elf_mem_map 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349
  1. #!/usr/bin/env python3
  2. import argparse
  3. import elftools.elf.elffile
  4. import elftools.dwarf.descriptions
  5. from collections import namedtuple
  6. from struct import unpack
  7. SRAM_OFFSET = 0x800000
  8. EEPROM_OFFSET = 0x810000
  9. FILL_BYTE = b'\0'
  10. Entry = namedtuple('Entry', ['name', 'loc', 'size'])
  11. Member = namedtuple('Member', ['name', 'off', 'size'])
  12. def array_inc(loc, dim, idx=0):
  13. if idx == len(dim):
  14. return True
  15. loc[idx] += 1
  16. if loc[idx] == dim[idx]:
  17. loc[idx] = 0
  18. return array_inc(loc, dim, idx+1)
  19. return False
  20. def get_type_size(type_DIE):
  21. while True:
  22. if 'DW_AT_byte_size' in type_DIE.attributes:
  23. return type_DIE, type_DIE.attributes.get('DW_AT_byte_size').value
  24. if 'DW_AT_type' not in type_DIE.attributes:
  25. return None
  26. type_DIE = type_DIE.get_DIE_from_attribute('DW_AT_type')
  27. def get_type_arrsize(type_DIE):
  28. size = get_type_size(type_DIE)
  29. if size is None:
  30. return None
  31. byte_size = size[1]
  32. if size[0].tag != 'DW_TAG_pointer_type':
  33. array_DIE = get_type_def(type_DIE, 'DW_TAG_array_type')
  34. if array_DIE is not None:
  35. for range_DIE in array_DIE.iter_children():
  36. if range_DIE.tag == 'DW_TAG_subrange_type' and \
  37. 'DW_AT_upper_bound' in range_DIE.attributes:
  38. dim = range_DIE.attributes['DW_AT_upper_bound'].value + 1
  39. byte_size *= dim
  40. return byte_size
  41. def get_type_def(type_DIE, type_tag):
  42. while True:
  43. if type_DIE.tag == type_tag:
  44. return type_DIE
  45. if 'DW_AT_type' not in type_DIE.attributes:
  46. return None
  47. type_DIE = type_DIE.get_DIE_from_attribute('DW_AT_type')
  48. def get_FORM_block1(attr):
  49. if attr.form != 'DW_FORM_block1':
  50. return None
  51. if attr.value[0] == 3: # OP_addr
  52. return int.from_bytes(attr.value[1:], 'little')
  53. if attr.value[0] == 35: # OP_plus_uconst (ULEB128)
  54. v = 0
  55. s = 0
  56. for b in attr.value[1:]:
  57. v |= (b & 0x7f) << s
  58. if b & 0x80 == 0:
  59. break
  60. s += 7
  61. return v
  62. return None
  63. def get_elf_globals(path, expand_structs, struct_gaps=True):
  64. fd = open(path, "rb")
  65. if fd is None:
  66. return
  67. elffile = elftools.elf.elffile.ELFFile(fd)
  68. if elffile is None or not elffile.has_dwarf_info():
  69. return
  70. # probably not needed, since we're decoding expressions manually
  71. elftools.dwarf.descriptions.set_global_machine_arch(elffile.get_machine_arch())
  72. dwarfinfo = elffile.get_dwarf_info()
  73. grefs = []
  74. for CU in dwarfinfo.iter_CUs():
  75. for DIE in CU.iter_DIEs():
  76. # handle only variable types
  77. if DIE.tag != 'DW_TAG_variable':
  78. continue
  79. if 'DW_AT_location' not in DIE.attributes:
  80. continue
  81. if 'DW_AT_name' not in DIE.attributes and \
  82. 'DW_AT_abstract_origin' not in DIE.attributes:
  83. continue
  84. # handle locations encoded directly as DW_OP_addr (leaf globals)
  85. loc = get_FORM_block1(DIE.attributes['DW_AT_location'])
  86. if loc is None or loc < SRAM_OFFSET or loc >= EEPROM_OFFSET:
  87. continue
  88. loc -= SRAM_OFFSET
  89. # variable name/type
  90. if 'DW_AT_name' not in DIE.attributes and \
  91. 'DW_AT_abstract_origin' in DIE.attributes:
  92. DIE = DIE.get_DIE_from_attribute('DW_AT_abstract_origin')
  93. if 'DW_AT_location' in DIE.attributes:
  94. # duplicate reference (handled directly), skip
  95. continue
  96. if 'DW_AT_name' not in DIE.attributes:
  97. continue
  98. if 'DW_AT_type' not in DIE.attributes:
  99. continue
  100. name = DIE.attributes['DW_AT_name'].value.decode('ascii')
  101. # get final storage size
  102. size = get_type_size(DIE)
  103. if size is None:
  104. continue
  105. byte_size = size[1]
  106. # fetch array dimensions (if known)
  107. array_dim = []
  108. array_DIE = get_type_def(DIE, 'DW_TAG_array_type')
  109. if array_DIE is not None:
  110. for range_DIE in array_DIE.iter_children():
  111. if range_DIE.tag == 'DW_TAG_subrange_type' and \
  112. 'DW_AT_upper_bound' in range_DIE.attributes:
  113. array_dim.append(range_DIE.attributes['DW_AT_upper_bound'].value + 1)
  114. # fetch structure members (one level only)
  115. members = []
  116. if expand_structs and size[0].tag != 'DW_TAG_pointer_type':
  117. struct_DIE = get_type_def(DIE, 'DW_TAG_structure_type')
  118. if struct_DIE is not None:
  119. for member_DIE in struct_DIE.iter_children():
  120. if member_DIE.tag == 'DW_TAG_member' and 'DW_AT_name' in member_DIE.attributes:
  121. m_name = member_DIE.attributes['DW_AT_name'].value.decode('ascii')
  122. m_off = get_FORM_block1(member_DIE.attributes['DW_AT_data_member_location'])
  123. m_byte_size = get_type_size(member_DIE)[1]
  124. # still expand member arrays
  125. m_array_dim = []
  126. m_array_DIE = get_type_def(member_DIE, 'DW_TAG_array_type')
  127. if m_array_DIE is not None:
  128. for range_DIE in m_array_DIE.iter_children():
  129. if range_DIE.tag == 'DW_TAG_subrange_type' and \
  130. 'DW_AT_upper_bound' in range_DIE.attributes:
  131. m_array_dim.append(range_DIE.attributes['DW_AT_upper_bound'].value + 1)
  132. # likely string, remove one dimension
  133. if m_byte_size == 1 and len(m_array_dim) > 1:
  134. m_byte_size *= m_array_dim.pop()
  135. if len(m_array_dim) == 0 or (len(m_array_dim) == 1 and m_array_dim[0] == 1):
  136. # plain entry
  137. members.append(Member(m_name, m_off, m_byte_size))
  138. elif len(m_array_dim) == 1 and m_byte_size == 1:
  139. # likely string, avoid expansion
  140. members.append(Member(m_name + '[]', m_off, m_array_dim[0]))
  141. else:
  142. # expand array entries
  143. m_array_pos = m_off
  144. m_array_loc = [0] * len(m_array_dim)
  145. while True:
  146. # location index
  147. sfx = ''
  148. for d in range(len(m_array_dim)):
  149. sfx += '[{}]'.format(m_array_loc[d])
  150. members.append(Member(m_name + sfx, m_array_pos, m_byte_size))
  151. # advance
  152. if array_inc(m_array_loc, m_array_dim):
  153. break
  154. m_array_pos += m_byte_size
  155. if struct_gaps and len(members):
  156. # fill gaps in the middle
  157. members = list(sorted(members, key=lambda x: x.off))
  158. last_end = 0
  159. for n in range(len(members)):
  160. member = members[n]
  161. if member.off > last_end:
  162. members.append(Member('*UNKNOWN*', last_end, member.off - last_end))
  163. last_end = member.off + member.size
  164. if struct_gaps and len(members):
  165. # fill gap at the end
  166. members = list(sorted(members, key=lambda x: x.off))
  167. last = members[-1]
  168. last_end = last.off + last.size
  169. if byte_size > last_end:
  170. members.append(Member('*UNKNOWN*', last_end, byte_size - last_end))
  171. def expand_members(entry, members):
  172. if len(members) == 0:
  173. grefs.append(entry)
  174. else:
  175. for member in members:
  176. grefs.append(Entry(entry.name + '.' + member.name,
  177. entry.loc + member.off, member.size))
  178. # likely string, remove one dimension
  179. if byte_size == 1 and len(array_dim) > 1:
  180. byte_size *= array_dim.pop()
  181. if len(array_dim) == 0 or (len(array_dim) == 1 and array_dim[0] == 1):
  182. # plain entry
  183. expand_members(Entry(name, loc, byte_size), members)
  184. elif len(array_dim) == 1 and byte_size == 1:
  185. # likely string, avoid expansion
  186. grefs.append(Entry(name + '[]', loc, array_dim[0]))
  187. else:
  188. # expand array entries
  189. array_pos = loc
  190. array_loc = [0] * len(array_dim)
  191. while True:
  192. # location index
  193. sfx = ''
  194. for d in range(len(array_dim)):
  195. sfx += '[{}]'.format(array_loc[d])
  196. expand_members(Entry(name + sfx, array_pos, byte_size), members)
  197. # advance
  198. if array_inc(array_loc, array_dim):
  199. break
  200. array_pos += byte_size
  201. return grefs
  202. def decode_dump(path):
  203. fd = open(path, 'r')
  204. if fd is None:
  205. return None
  206. buf_addr = None # starting address
  207. buf_data = None # data
  208. for line in fd:
  209. tokens = line.split(maxsplit=1)
  210. if len(tokens) == 0 or tokens[0] == 'ok':
  211. break
  212. elif len(tokens) < 2 or tokens[0] == 'D2':
  213. continue
  214. addr = int.from_bytes(bytes.fromhex(tokens[0]), 'big')
  215. data = bytes.fromhex(tokens[1])
  216. if buf_addr is None:
  217. buf_addr = addr
  218. buf_data = data
  219. else:
  220. # grow buffer as needed
  221. if addr < buf_addr:
  222. buf_data = FILL_BYTE * (buf_addr - addr)
  223. buf_addr = addr
  224. addr_end = addr + len(data)
  225. buf_end = buf_addr + len(buf_data)
  226. if addr_end > buf_end:
  227. buf_data += FILL_BYTE * (addr_end - buf_end)
  228. # replace new part
  229. rep_start = addr - buf_addr
  230. rep_end = rep_start + len(data)
  231. buf_data = buf_data[:rep_start] + data + buf_data[rep_end:]
  232. return (buf_addr, buf_data)
  233. def annotate_refs(grefs, addr, data, width=46, gaps=True, overlaps=True):
  234. last_end = None
  235. for entry in grefs:
  236. if entry.loc < addr:
  237. continue
  238. if entry.loc + entry.size > addr + len(data):
  239. continue
  240. pos = entry.loc-addr
  241. end_pos = pos + entry.size
  242. buf = data[pos:end_pos]
  243. buf_repr = ''
  244. if len(buf) in [1, 2, 4]:
  245. # attempt to decode as integers
  246. buf_repr += ' I:' + str(int.from_bytes(buf, 'little')).rjust(10)
  247. if len(buf) in [4, 8]:
  248. # attempt to decode as floats
  249. typ = 'f' if len(buf) == 4 else 'd'
  250. buf_repr += ' F:' + '{:10.3f}'.format(unpack(typ, buf)[0])
  251. if last_end is not None:
  252. if gaps and last_end < pos:
  253. # decode gaps
  254. gap_size = pos - last_end
  255. gap_buf = data[last_end:pos]
  256. print('{:04x} {} {:4} R:{}'.format(addr+last_end, "*UNKNOWN*".ljust(width),
  257. gap_size, gap_buf.hex()))
  258. if overlaps and last_end > pos + 1:
  259. gap_size = pos - last_end
  260. print('{:04x} {} {:4}'.format(addr+last_end, "*OVERLAP*".ljust(width), gap_size))
  261. print('{:04x} {} {:4}{} R:{}'.format(entry.loc, entry.name.ljust(width),
  262. entry.size, buf_repr, buf.hex()))
  263. last_end = end_pos
  264. def print_map(grefs):
  265. print('OFFSET\tSIZE\tNAME')
  266. for entry in grefs:
  267. print('{:x}\t{}\t{}'.format(entry.loc, entry.size, entry.name))
  268. def main():
  269. ap = argparse.ArgumentParser(description="""
  270. Generate a symbol table map starting directly from an ELF
  271. firmware with DWARF2 debugging information.
  272. When used along with a memory dump obtained from the D2 g-code,
  273. show the value of each symbol which is within the address range.
  274. """)
  275. ap.add_argument('elf', help='ELF file containing DWARF2 debugging information')
  276. ap.add_argument('--no-gaps', action='store_true',
  277. help='do not dump memory inbetween known symbols')
  278. ap.add_argument('--no-expand-structs', action='store_true',
  279. help='do not decode structure data')
  280. ap.add_argument('--overlaps', action='store_true',
  281. help='annotate overlaps greater than 1 byte')
  282. ap.add_argument('--name-width', type=int, default=46,
  283. help='set name column width')
  284. g = ap.add_mutually_exclusive_group(required=True)
  285. g.add_argument('dump', nargs='?', help='RAM dump obtained from D2 g-code')
  286. g.add_argument('--map', action='store_true', help='dump global memory map')
  287. args = ap.parse_args()
  288. grefs = get_elf_globals(args.elf, expand_structs=not args.no_expand_structs)
  289. grefs = list(sorted(grefs, key=lambda x: x.loc))
  290. if args.dump is None:
  291. print_map(grefs)
  292. else:
  293. addr, data = decode_dump(args.dump)
  294. annotate_refs(grefs, addr, data,
  295. width=args.name_width,
  296. gaps=not args.no_gaps,
  297. overlaps=args.overlaps)
  298. if __name__ == '__main__':
  299. exit(main())