/* libunwind - a platform-independent unwind library Copyright (c) 2003-2005 Hewlett-Packard Development Company, L.P. Contributed by David Mosberger-Tang This file is part of libunwind. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ /* Locate an FDE via the ELF data-structures defined by LSB v1.3 (http://www.linuxbase.org/spec/). */ #include #include #include #include "dwarf_i.h" #include "dwarf-eh.h" #include "libunwind_i.h" #ifdef HAVE_ZLIB #include #endif /* HAVE_ZLIB */ struct table_entry { int32_t start_ip_offset; int32_t fde_offset; }; #ifndef UNW_REMOTE_ONLY #ifdef __linux__ #include "os-linux.h" #endif #ifndef __clang__ static ALIAS(dwarf_search_unwind_table) int dwarf_search_unwind_table_int (unw_addr_space_t as, unw_word_t ip, unw_dyn_info_t *di, unw_proc_info_t *pi, int need_unwind_info, void *arg); #else #define dwarf_search_unwind_table_int dwarf_search_unwind_table #endif static int linear_search (unw_addr_space_t as, unw_word_t ip, unw_word_t eh_frame_start, unw_word_t eh_frame_end, unw_word_t fde_count, unw_proc_info_t *pi, int need_unwind_info, void *arg) { unw_accessors_t *a = unw_get_accessors_int (unw_local_addr_space); unw_word_t i = 0, fde_addr, addr = eh_frame_start; int ret; while (i++ < fde_count && addr < eh_frame_end) { fde_addr = addr; if ((ret = dwarf_extract_proc_info_from_fde (as, a, &addr, pi, eh_frame_start, 0, 0, arg)) < 0) return ret; if (ip >= pi->start_ip && ip < pi->end_ip) { if (!need_unwind_info) return 1; addr = fde_addr; if ((ret = dwarf_extract_proc_info_from_fde (as, a, &addr, pi, eh_frame_start, need_unwind_info, 0, arg)) < 0) return ret; return 1; } } return -UNW_ENOINFO; } #endif /* !UNW_REMOTE_ONLY */ #ifdef CONFIG_DEBUG_FRAME /* Load .debug_frame section from FILE. Allocates and returns space in *BUF, and sets *BUFSIZE to its size. IS_LOCAL is 1 if using the local process, in which case we can search the system debug file directory; 0 for other address spaces, in which case we do not. Returns 0 on success, 1 on error. Succeeds even if the file contains no .debug_frame. */ /* XXX: Could use mmap; but elf_map_image keeps tons mapped in. */ static int load_debug_frame (const char *file, char **buf, size_t *bufsize, int is_local, unw_word_t segbase, unw_word_t *load_offset) { struct elf_image ei; Elf_W (Ehdr) *ehdr; Elf_W (Phdr) *phdr; Elf_W (Shdr) *shdr; int i; int ret; ei.image = NULL; *load_offset = 0; ret = elf_w (load_debuglink) (file, &ei, is_local); if (ret != 0) return ret; shdr = elf_w (find_section) (&ei, ".debug_frame"); if (!shdr || (shdr->sh_offset + shdr->sh_size > ei.size)) { munmap(ei.image, ei.size); return 1; } #if defined(SHF_COMPRESSED) if (shdr->sh_flags & SHF_COMPRESSED) { Elf_W (Chdr) *chdr = (shdr->sh_offset + ei.image); #ifdef HAVE_ZLIB unsigned long destSize; if (chdr->ch_type == ELFCOMPRESS_ZLIB) { *bufsize = destSize = chdr->ch_size; GET_MEMORY (*buf, *bufsize); if (!*buf) { Debug (2, "failed to allocate zlib .debug_frame buffer, skipping\n"); munmap(ei.image, ei.size); return 1; } ret = uncompress((unsigned char *)*buf, &destSize, shdr->sh_offset + ei.image + sizeof(*chdr), shdr->sh_size - sizeof(*chdr)); if (ret != Z_OK) { Debug (2, "failed to decompress zlib .debug_frame, skipping\n"); munmap(*buf, *bufsize); munmap(ei.image, ei.size); return 1; } Debug (4, "read %zd->%zd bytes of .debug_frame from offset %zd\n", shdr->sh_size, *bufsize, shdr->sh_offset); } else #endif /* HAVE_ZLIB */ { Debug (2, "unknown compression type %d, skipping\n", chdr->ch_type); munmap(ei.image, ei.size); return 1; } } else { #endif *bufsize = shdr->sh_size; GET_MEMORY (*buf, *bufsize); if (!*buf) { Debug (2, "failed to allocate .debug_frame buffer, skipping\n"); munmap(ei.image, ei.size); return 1; } memcpy(*buf, shdr->sh_offset + ei.image, *bufsize); Debug (4, "read %zd bytes of .debug_frame from offset %zd\n", *bufsize, shdr->sh_offset); #if defined(SHF_COMPRESSED) } #endif ehdr = ei.image; phdr = (Elf_W (Phdr) *) ((char *) ei.image + ehdr->e_phoff); for (i = 0; i < ehdr->e_phnum; ++i) if (phdr[i].p_type == PT_LOAD) { *load_offset = segbase - phdr[i].p_vaddr; Debug (4, "%s load offset is 0x%zx\n", file, *load_offset); break; } munmap(ei.image, ei.size); return 0; } /* Locate the binary which originated the contents of address ADDR. Return the name of the binary in *name (space is allocated by the caller) Returns 0 if a binary is successfully found, or 1 if an error occurs. */ static int find_binary_for_address (unw_word_t ip, char *name, size_t name_size) { #if defined(__linux__) && (!UNW_REMOTE_ONLY) struct map_iterator mi; int found = 0; int pid = getpid (); unsigned long segbase, mapoff, hi; if (maps_init (&mi, pid) != 0) return 1; while (maps_next (&mi, &segbase, &hi, &mapoff, NULL)) if (ip >= segbase && ip < hi) { size_t len = strlen (mi.path); if (len + 1 <= name_size) { memcpy (name, mi.path, len + 1); found = 1; } break; } maps_close (&mi); return !found; #endif return 1; } /* Locate and/or try to load a debug_frame section for address ADDR. Return pointer to debug frame descriptor, or zero if not found. */ static struct unw_debug_frame_list * locate_debug_info (unw_addr_space_t as, unw_word_t addr, unw_word_t segbase, const char *dlname, unw_word_t start, unw_word_t end) { struct unw_debug_frame_list *w, *fdesc = 0; char path[PATH_MAX]; char *name = path; int err; char *buf; size_t bufsize; unw_word_t load_offset; /* First, see if we loaded this frame already. */ for (w = as->debug_frames; w; w = w->next) { Debug (4, "checking %p: %lx-%lx\n", w, (long)w->start, (long)w->end); if (addr >= w->start && addr < w->end) return w; } /* If the object name we receive is blank, there's still a chance of locating the file by parsing /proc/self/maps. */ if (strcmp (dlname, "") == 0) { err = find_binary_for_address (addr, name, sizeof(path)); if (err) { Debug (15, "tried to locate binary for 0x%" PRIx64 ", but no luck\n", (uint64_t) addr); return 0; } } else name = (char*) dlname; err = load_debug_frame (name, &buf, &bufsize, as == unw_local_addr_space, segbase, &load_offset); if (!err) { GET_MEMORY (fdesc, sizeof (struct unw_debug_frame_list)); if (!fdesc) { Debug (2, "failed to allocate frame list entry\n"); return 0; } fdesc->start = start; fdesc->end = end; fdesc->load_offset = load_offset; fdesc->debug_frame = buf; fdesc->debug_frame_size = bufsize; fdesc->index = NULL; fdesc->next = as->debug_frames; as->debug_frames = fdesc; } return fdesc; } static size_t debug_frame_index_make (struct unw_debug_frame_list *fdesc) { unw_accessors_t *a = unw_get_accessors_int (unw_local_addr_space); char *buf = fdesc->debug_frame; size_t bufsize = fdesc->debug_frame_size; unw_word_t addr = (unw_word_t) (uintptr_t) buf; size_t count = 0; while (addr < (unw_word_t) (uintptr_t) (buf + bufsize)) { unw_word_t item_start = addr, item_end = 0; uint32_t u32val = 0; uint64_t cie_id = 0; uint64_t id_for_cie; dwarf_readu32 (unw_local_addr_space, a, &addr, &u32val, NULL); if (u32val == 0) break; if (u32val != 0xffffffff) { uint32_t cie_id32 = 0; item_end = addr + u32val; dwarf_readu32 (unw_local_addr_space, a, &addr, &cie_id32, NULL); cie_id = cie_id32; id_for_cie = 0xffffffff; } else { uint64_t u64val = 0; /* Extended length. */ dwarf_readu64 (unw_local_addr_space, a, &addr, &u64val, NULL); item_end = addr + u64val; dwarf_readu64 (unw_local_addr_space, a, &addr, &cie_id, NULL); id_for_cie = 0xffffffffffffffffull; } /*Debug (1, "CIE/FDE id = %.8x\n", (int) cie_id);*/ if (cie_id == id_for_cie) { ; /*Debug (1, "Found CIE at %.8x.\n", item_start);*/ } else { unw_word_t fde_addr = item_start; unw_proc_info_t this_pi; int err; /*Debug (1, "Found FDE at %.8x\n", item_start);*/ err = dwarf_extract_proc_info_from_fde (unw_local_addr_space, a, &fde_addr, &this_pi, (uintptr_t) buf, 0, 1, NULL); if (!err) { Debug (15, "start_ip = %lx, end_ip = %lx\n", (long) this_pi.start_ip, (long) this_pi.end_ip); if (fdesc->index) { struct table_entry *e = &fdesc->index[count]; e->fde_offset = item_start - (unw_word_t) (uintptr_t) buf; e->start_ip_offset = this_pi.start_ip; } count++; } /*else Debug (1, "FDE parse failed\n");*/ } addr = item_end; } return count; } static void debug_frame_index_sort (struct unw_debug_frame_list *fdesc) { size_t i, j, k, n = fdesc->index_size / sizeof (*fdesc->index); struct table_entry *a = fdesc->index; struct table_entry t; /* Use a simple Shell sort as it relatively fast and * does not require additional memory. */ for (k = n / 2; k > 0; k /= 2) { for (i = k; i < n; i++) { t = a[i]; for (j = i; j >= k; j -= k) { if (t.start_ip_offset >= a[j - k].start_ip_offset) break; a[j] = a[j - k]; } a[j] = t; } } } int dwarf_find_debug_frame (int found, unw_dyn_info_t *di_debug, unw_word_t ip, unw_word_t segbase, const char* obj_name, unw_word_t start, unw_word_t end) { unw_dyn_info_t *di = di_debug; struct unw_debug_frame_list *fdesc; Debug (15, "Trying to find .debug_frame for %s\n", obj_name); fdesc = locate_debug_info (unw_local_addr_space, ip, segbase, obj_name, start, end); if (!fdesc) { Debug (15, "couldn't load .debug_frame\n"); return found; } Debug (15, "loaded .debug_frame\n"); if (fdesc->debug_frame_size == 0) { Debug (15, "zero-length .debug_frame\n"); return found; } /* Now create a binary-search table, if it does not already exist. */ if (!fdesc->index) { /* Find all FDE entries in debug_frame, and make into a sorted index. First determine an index element count. */ size_t count = debug_frame_index_make (fdesc); if (!count) { Debug (15, "no CIE/FDE found in .debug_frame\n"); return found; } fdesc->index_size = count * sizeof (*fdesc->index); GET_MEMORY (fdesc->index, fdesc->index_size); if (!fdesc->index) { Debug (15, "couldn't allocate a frame index table\n"); fdesc->index_size = 0; return found; } /* Then fill and sort the index. */ debug_frame_index_make (fdesc); debug_frame_index_sort (fdesc); /*for (i = 0; i < count; i++) { const struct table_entry *e = &fdesc->index[i]; Debug (15, "ip %x, FDE offset %x\n", e->start_ip_offset, e->fde_offset); }*/ } di->format = UNW_INFO_FORMAT_TABLE; di->start_ip = fdesc->start; di->end_ip = fdesc->end; di->load_offset = fdesc->load_offset; di->u.ti.name_ptr = (unw_word_t) (uintptr_t) obj_name; di->u.ti.table_data = (unw_word_t *) fdesc; di->u.ti.table_len = sizeof (*fdesc) / sizeof (unw_word_t); di->u.ti.segbase = segbase; found = 1; Debug (15, "found debug_frame table `%s': segbase=0x%lx, len=%lu, " "gp=0x%lx, table_data=0x%lx\n", (char *) (uintptr_t) di->u.ti.name_ptr, (long) di->u.ti.segbase, (long) di->u.ti.table_len, (long) di->gp, (long) di->u.ti.table_data); return found; } #endif /* CONFIG_DEBUG_FRAME */ #ifndef UNW_REMOTE_ONLY static Elf_W (Addr) dwarf_find_eh_frame_section(struct dl_phdr_info *info) { int rc; struct elf_image ei; Elf_W (Addr) eh_frame = 0; Elf_W (Shdr)* shdr; const char *file = info->dlpi_name; char exepath[PATH_MAX]; if (strlen(file) == 0) { tdep_get_exe_image_path(exepath); file = exepath; } Debug (1, "looking for .eh_frame section in %s\n", file); rc = elf_map_image (&ei, file); if (rc != 0) return 0; shdr = elf_w (find_section) (&ei, ".eh_frame"); if (!shdr) goto out; eh_frame = shdr->sh_addr + info->dlpi_addr; Debug (4, "found .eh_frame at address %lx\n", eh_frame); out: munmap (ei.image, ei.size); return eh_frame; } struct dwarf_callback_data { /* in: */ unw_word_t ip; /* instruction-pointer we're looking for */ unw_proc_info_t *pi; /* proc-info pointer */ int need_unwind_info; /* out: */ int single_fde; /* did we find a single FDE? (vs. a table) */ unw_dyn_info_t di; /* table info (if single_fde is false) */ unw_dyn_info_t di_debug; /* additional table info for .debug_frame */ }; /* ptr is a pointer to a dwarf_callback_data structure and, on entry, member ip contains the instruction-pointer we're looking for. */ HIDDEN int dwarf_callback (struct dl_phdr_info *info, size_t size, void *ptr) { struct dwarf_callback_data *cb_data = ptr; unw_dyn_info_t *di = &cb_data->di; const Elf_W(Phdr) *phdr, *p_eh_hdr, *p_dynamic, *p_text; unw_word_t addr, eh_frame_start, eh_frame_end, fde_count, ip; Elf_W(Addr) load_base, max_load_addr = 0; int ret, need_unwind_info = cb_data->need_unwind_info; unw_proc_info_t *pi = cb_data->pi; struct dwarf_eh_frame_hdr *hdr = NULL; unw_accessors_t *a; long n; int found = 0; struct dwarf_eh_frame_hdr synth_eh_frame_hdr; #ifdef CONFIG_DEBUG_FRAME unw_word_t start, end; #endif /* CONFIG_DEBUG_FRAME*/ ip = cb_data->ip; /* Make sure struct dl_phdr_info is at least as big as we need. */ if (size < offsetof (struct dl_phdr_info, dlpi_phnum) + sizeof (info->dlpi_phnum)) return -1; Debug (15, "checking %s, base=0x%lx)\n", info->dlpi_name, (long) info->dlpi_addr); phdr = info->dlpi_phdr; load_base = info->dlpi_addr; p_text = NULL; p_eh_hdr = NULL; p_dynamic = NULL; /* See if PC falls into one of the loaded segments. Find the eh-header segment at the same time. */ for (n = info->dlpi_phnum; --n >= 0; phdr++) { if (phdr->p_type == PT_LOAD) { Elf_W(Addr) vaddr = phdr->p_vaddr + load_base; if (ip >= vaddr && ip < vaddr + phdr->p_memsz) p_text = phdr; if (vaddr + phdr->p_filesz > max_load_addr) max_load_addr = vaddr + phdr->p_filesz; } else if (phdr->p_type == PT_GNU_EH_FRAME) p_eh_hdr = phdr; #if defined __sun else if (phdr->p_type == PT_SUNW_UNWIND) p_eh_hdr = phdr; #endif else if (phdr->p_type == PT_DYNAMIC) p_dynamic = phdr; } if (!p_text) return 0; if (p_eh_hdr) { hdr = (struct dwarf_eh_frame_hdr *) (p_eh_hdr->p_vaddr + load_base); } else { Elf_W (Addr) eh_frame; Debug (1, "no .eh_frame_hdr section found\n"); eh_frame = dwarf_find_eh_frame_section (info); if (eh_frame) { Debug (1, "using synthetic .eh_frame_hdr section for %s\n", info->dlpi_name); synth_eh_frame_hdr.version = DW_EH_VERSION; synth_eh_frame_hdr.eh_frame_ptr_enc = DW_EH_PE_absptr | ((sizeof(Elf_W (Addr)) == 4) ? DW_EH_PE_udata4 : DW_EH_PE_udata8); synth_eh_frame_hdr.fde_count_enc = DW_EH_PE_omit; synth_eh_frame_hdr.table_enc = DW_EH_PE_omit; synth_eh_frame_hdr.eh_frame = eh_frame; hdr = &synth_eh_frame_hdr; } } if (hdr) { if (p_dynamic) { /* For dynamically linked executables and shared libraries, DT_PLTGOT is the value that data-relative addresses are relative to for that object. We call this the "gp". */ Elf_W(Dyn) *dyn = (Elf_W(Dyn) *)(p_dynamic->p_vaddr + load_base); for (; dyn->d_tag != DT_NULL; ++dyn) if (dyn->d_tag == DT_PLTGOT) { /* Assume that _DYNAMIC is writable and GLIBC has relocated it (true for x86 at least). */ di->gp = dyn->d_un.d_ptr; break; } } else /* Otherwise this is a static executable with no _DYNAMIC. Assume that data-relative addresses are relative to 0, i.e., absolute. */ di->gp = 0; pi->gp = di->gp; if (hdr->version != DW_EH_VERSION) { Debug (1, "table `%s' has unexpected version %d\n", info->dlpi_name, hdr->version); return 0; } a = unw_get_accessors_int (unw_local_addr_space); addr = (unw_word_t) (uintptr_t) (&hdr->eh_frame); /* (Optionally) read eh_frame_ptr: */ if ((ret = dwarf_read_encoded_pointer (unw_local_addr_space, a, &addr, hdr->eh_frame_ptr_enc, pi, &eh_frame_start, NULL)) < 0) return ret; /* (Optionally) read fde_count: */ if ((ret = dwarf_read_encoded_pointer (unw_local_addr_space, a, &addr, hdr->fde_count_enc, pi, &fde_count, NULL)) < 0) return ret; if (hdr->table_enc != (DW_EH_PE_datarel | DW_EH_PE_sdata4)) { /* If there is no search table or it has an unsupported encoding, fall back on linear search. */ if (hdr->table_enc == DW_EH_PE_omit) { Debug (4, "table `%s' lacks search table; doing linear search\n", info->dlpi_name); } else { Debug (4, "table `%s' has encoding 0x%x; doing linear search\n", info->dlpi_name, hdr->table_enc); } eh_frame_end = max_load_addr; /* XXX can we do better? */ if (hdr->fde_count_enc == DW_EH_PE_omit) fde_count = ~0UL; if (hdr->eh_frame_ptr_enc == DW_EH_PE_omit) abort (); Debug (1, "eh_frame_start = %lx eh_frame_end = %lx\n", eh_frame_start, eh_frame_end); /* XXX we know how to build a local binary search table for .debug_frame, so we could do that here too. */ found = linear_search (unw_local_addr_space, ip, eh_frame_start, eh_frame_end, fde_count, pi, need_unwind_info, NULL); if (found != 1) found = 0; else cb_data->single_fde = 1; } else { di->format = UNW_INFO_FORMAT_REMOTE_TABLE; di->start_ip = p_text->p_vaddr + load_base; di->end_ip = p_text->p_vaddr + load_base + p_text->p_memsz; di->u.rti.name_ptr = (unw_word_t) (uintptr_t) info->dlpi_name; di->u.rti.table_data = addr; assert (sizeof (struct table_entry) % sizeof (unw_word_t) == 0); di->u.rti.table_len = (fde_count * sizeof (struct table_entry) / sizeof (unw_word_t)); /* For the binary-search table in the eh_frame_hdr, data-relative means relative to the start of that section... */ di->u.rti.segbase = (unw_word_t) (uintptr_t) hdr; found = 1; Debug (15, "found table `%s': segbase=0x%lx, len=%lu, gp=0x%lx, " "table_data=0x%lx\n", (char *) (uintptr_t) di->u.rti.name_ptr, (long) di->u.rti.segbase, (long) di->u.rti.table_len, (long) di->gp, (long) di->u.rti.table_data); } } #ifdef CONFIG_DEBUG_FRAME /* Find the start/end of the described region by parsing the phdr_info structure. */ start = (unw_word_t) -1; end = 0; for (n = 0; n < info->dlpi_phnum; n++) { if (info->dlpi_phdr[n].p_type == PT_LOAD) { unw_word_t seg_start = info->dlpi_addr + info->dlpi_phdr[n].p_vaddr; unw_word_t seg_end = seg_start + info->dlpi_phdr[n].p_memsz; if (seg_start < start) start = seg_start; if (seg_end > end) end = seg_end; } } found = dwarf_find_debug_frame (found, &cb_data->di_debug, ip, info->dlpi_addr, info->dlpi_name, start, end); #endif /* CONFIG_DEBUG_FRAME */ return found; } HIDDEN int dwarf_find_proc_info (unw_addr_space_t as, unw_word_t ip, unw_proc_info_t *pi, int need_unwind_info, void *arg) { struct dwarf_callback_data cb_data; intrmask_t saved_mask; int ret; Debug (14, "looking for IP=0x%lx\n", (long) ip); memset (&cb_data, 0, sizeof (cb_data)); cb_data.ip = ip; cb_data.pi = pi; cb_data.need_unwind_info = need_unwind_info; cb_data.di.format = -1; cb_data.di_debug.format = -1; SIGPROCMASK (SIG_SETMASK, &unwi_full_mask, &saved_mask); ret = dl_iterate_phdr (dwarf_callback, &cb_data); SIGPROCMASK (SIG_SETMASK, &saved_mask, NULL); if (ret > 0) { if (cb_data.single_fde) /* already got the result in *pi */ return 0; /* search the table: */ if (cb_data.di.format != -1) ret = dwarf_search_unwind_table_int (as, ip, &cb_data.di, pi, need_unwind_info, arg); else ret = -UNW_ENOINFO; if (ret == -UNW_ENOINFO && cb_data.di_debug.format != -1) ret = dwarf_search_unwind_table_int (as, ip, &cb_data.di_debug, pi, need_unwind_info, arg); } else ret = -UNW_ENOINFO; return ret; } static inline const struct table_entry * lookup (const struct table_entry *table, size_t table_size, int32_t rel_ip) { unsigned long table_len = table_size / sizeof (struct table_entry); const struct table_entry *e = NULL; unsigned long lo, hi, mid; /* do a binary search for right entry: */ for (lo = 0, hi = table_len; lo < hi;) { mid = (lo + hi) / 2; e = table + mid; Debug (15, "e->start_ip_offset = %lx\n", (long) e->start_ip_offset); if (rel_ip < e->start_ip_offset) hi = mid; else lo = mid + 1; } if (hi <= 0) return NULL; e = table + hi - 1; return e; } #endif /* !UNW_REMOTE_ONLY */ #ifndef UNW_LOCAL_ONLY /* Lookup an unwind-table entry in remote memory. Returns 1 if an entry is found, 0 if no entry is found, negative if an error occurred reading remote memory. */ static int remote_lookup (unw_addr_space_t as, unw_word_t table, size_t table_size, int32_t rel_ip, struct table_entry *e, int32_t *last_ip_offset, void *arg) { size_t table_len = table_size / sizeof (struct table_entry); unw_accessors_t *a = unw_get_accessors_int (as); size_t lo, hi, mid; unw_word_t e_addr = 0; int32_t start = 0; int ret; /* do a binary search for right entry: */ for (lo = 0, hi = table_len; lo < hi;) { mid = (lo + hi) / 2; e_addr = table + mid * sizeof (struct table_entry); if ((ret = dwarf_reads32 (as, a, &e_addr, &start, arg)) < 0) return ret; if (rel_ip < start) hi = mid; else lo = mid + 1; } if (hi <= 0) return 0; e_addr = table + (hi - 1) * sizeof (struct table_entry); if ((ret = dwarf_reads32 (as, a, &e_addr, &e->start_ip_offset, arg)) < 0 || (ret = dwarf_reads32 (as, a, &e_addr, &e->fde_offset, arg)) < 0 || (hi < table_len && (ret = dwarf_reads32 (as, a, &e_addr, last_ip_offset, arg)) < 0)) return ret; return 1; } #endif /* !UNW_LOCAL_ONLY */ static int is_remote_table(int format) { return (format == UNW_INFO_FORMAT_REMOTE_TABLE || format == UNW_INFO_FORMAT_IP_OFFSET); } int dwarf_search_unwind_table (unw_addr_space_t as, unw_word_t ip, unw_dyn_info_t *di, unw_proc_info_t *pi, int need_unwind_info, void *arg) { const struct table_entry *e = NULL, *table = NULL; unw_word_t ip_base = 0, segbase = 0, last_ip, fde_addr; unw_accessors_t *a; #ifndef UNW_LOCAL_ONLY struct table_entry ent; #endif int ret; unw_word_t debug_frame_base = 0; size_t table_len = 0; #ifdef UNW_REMOTE_ONLY assert (is_remote_table(di->format)); #else assert (is_remote_table(di->format) || di->format == UNW_INFO_FORMAT_TABLE); #endif assert (ip >= di->start_ip && ip < di->end_ip); if (is_remote_table(di->format)) { table = (const struct table_entry *) (uintptr_t) di->u.rti.table_data; table_len = di->u.rti.table_len * sizeof (unw_word_t); debug_frame_base = 0; } else { assert(di->format == UNW_INFO_FORMAT_TABLE); #ifndef UNW_REMOTE_ONLY struct unw_debug_frame_list *fdesc = (void *) di->u.ti.table_data; /* UNW_INFO_FORMAT_TABLE (i.e. .debug_frame) is read from local address space. Both the index and the unwind tables live in local memory, but the address space to check for properties like the address size and endianness is the target one. */ as = unw_local_addr_space; table = fdesc->index; table_len = fdesc->index_size; debug_frame_base = (uintptr_t) fdesc->debug_frame; #endif } a = unw_get_accessors_int (as); segbase = di->u.rti.segbase; if (di->format == UNW_INFO_FORMAT_IP_OFFSET) { ip_base = di->start_ip; } else { ip_base = segbase; } Debug (6, "lookup IP 0x%lx\n", (long) (ip - ip_base - di->load_offset)); #ifndef UNW_REMOTE_ONLY if (as == unw_local_addr_space) { e = lookup (table, table_len, ip - ip_base - di->load_offset); if (e && &e[1] < &table[table_len / sizeof (unw_word_t)]) last_ip = e[1].start_ip_offset + ip_base + di->load_offset; else last_ip = di->end_ip; } else #endif { #ifndef UNW_LOCAL_ONLY int32_t last_ip_offset = di->end_ip - ip_base - di->load_offset; segbase = di->u.rti.segbase; if ((ret = remote_lookup (as, (uintptr_t) table, table_len, ip - ip_base, &ent, &last_ip_offset, arg)) < 0) return ret; if (ret) { e = &ent; last_ip = last_ip_offset + ip_base + di->load_offset; } else e = NULL; /* no info found */ #endif } if (!e) { Debug (1, "IP %lx inside range %lx-%lx, but no explicit unwind info found\n", (long) ip, (long) di->start_ip, (long) di->end_ip); /* IP is inside this table's range, but there is no explicit unwind info. */ return -UNW_ENOINFO; } Debug (15, "ip=0x%lx, load_offset=0x%lx, start_ip=0x%lx\n", (long) ip, (long) di->load_offset, (long) (e->start_ip_offset)); if (debug_frame_base) fde_addr = e->fde_offset + debug_frame_base; else fde_addr = e->fde_offset + segbase; Debug (1, "e->fde_offset = %lx, segbase = %lx, debug_frame_base = %lx, " "fde_addr = %lx\n", (long) e->fde_offset, (long) segbase, (long) debug_frame_base, (long) fde_addr); if ((ret = dwarf_extract_proc_info_from_fde (as, a, &fde_addr, pi, debug_frame_base ? debug_frame_base : segbase, need_unwind_info, debug_frame_base != 0, arg)) < 0) return ret; /* .debug_frame uses an absolute encoding that does not know about any shared library relocation. */ if (di->format == UNW_INFO_FORMAT_TABLE) { pi->start_ip += segbase; pi->end_ip += segbase; pi->flags = UNW_PI_FLAG_DEBUG_FRAME; } pi->start_ip += di->load_offset; pi->end_ip += di->load_offset; #if defined(NEED_LAST_IP) pi->last_ip = last_ip; #else (void)last_ip; #endif if (ip < pi->start_ip || ip >= pi->end_ip) return -UNW_ENOINFO; return 0; } HIDDEN void dwarf_put_unwind_info (unw_addr_space_t as, unw_proc_info_t *pi, void *arg) { return; /* always a nop */ }