Lines Matching refs:dwfl
37 __libdwfl_segment_start (Dwfl *dwfl, GElf_Addr start)
39 if (dwfl->segment_align > 1)
40 start &= -dwfl->segment_align;
46 __libdwfl_segment_end (Dwfl *dwfl, GElf_Addr end)
48 if (dwfl->segment_align > 1)
49 end = (end + dwfl->segment_align - 1) & -dwfl->segment_align;
54 insert (Dwfl *dwfl, size_t i, GElf_Addr start, GElf_Addr end, int segndx)
56 bool need_start = (i == 0 || dwfl->lookup_addr[i - 1] != start);
57 bool need_end = (i + 1 >= dwfl->lookup_elts
58 || dwfl->lookup_addr[i + 1] != end);
63 if (dwfl->lookup_alloc - dwfl->lookup_elts < need)
65 size_t n = dwfl->lookup_alloc == 0 ? 16 : dwfl->lookup_alloc * 2;
66 GElf_Addr *naddr = realloc (dwfl->lookup_addr, sizeof naddr[0] * n);
69 int *nsegndx = realloc (dwfl->lookup_segndx, sizeof nsegndx[0] * n);
72 if (naddr != dwfl->lookup_addr)
76 dwfl->lookup_alloc = n;
77 dwfl->lookup_addr = naddr;
78 dwfl->lookup_segndx = nsegndx;
80 if (dwfl->lookup_module != NULL)
83 Dwfl_Module **old = dwfl->lookup_module;
84 dwfl->lookup_module = realloc (dwfl->lookup_module,
85 sizeof dwfl->lookup_module[0] * n);
86 if (unlikely (dwfl->lookup_module == NULL))
94 if (unlikely (i < dwfl->lookup_elts))
96 const size_t move = dwfl->lookup_elts - i;
97 memmove (&dwfl->lookup_addr[i + need], &dwfl->lookup_addr[i],
98 move * sizeof dwfl->lookup_addr[0]);
99 memmove (&dwfl->lookup_segndx[i + need], &dwfl->lookup_segndx[i],
100 move * sizeof dwfl->lookup_segndx[0]);
101 if (dwfl->lookup_module != NULL)
102 memmove (&dwfl->lookup_module[i + need], &dwfl->lookup_module[i],
103 move * sizeof dwfl->lookup_module[0]);
108 dwfl->lookup_addr[i] = start;
109 dwfl->lookup_segndx[i] = segndx;
110 if (dwfl->lookup_module != NULL)
111 dwfl->lookup_module[i] = NULL;
115 dwfl->lookup_segndx[i - 1] = segndx;
119 dwfl->lookup_addr[i] = end;
120 dwfl->lookup_segndx[i] = -1;
121 if (dwfl->lookup_module != NULL)
122 dwfl->lookup_module[i] = NULL;
125 dwfl->lookup_elts += need;
131 lookup (Dwfl *dwfl, GElf_Addr address, int hint)
134 && address >= dwfl->lookup_addr[hint]
135 && ((size_t) hint + 1 == dwfl->lookup_elts
136 || address < dwfl->lookup_addr[hint + 1]))
140 size_t l = 0, u = dwfl->lookup_elts;
144 if (address < dwfl->lookup_addr[idx])
149 if (l == dwfl->lookup_elts || address < dwfl->lookup_addr[l])
158 reify_segments (Dwfl *dwfl)
163 for (Dwfl_Module *mod = dwfl->modulelist; mod != NULL; mod = mod->next)
166 const GElf_Addr start = __libdwfl_segment_start (dwfl, mod->low_addr);
167 const GElf_Addr end = __libdwfl_segment_end (dwfl, mod->high_addr);
170 int idx = lookup (dwfl, start, hint);
174 if (unlikely (insert (dwfl, 0, start, end, -1)))
179 else if (dwfl->lookup_addr[idx] > start)
182 if (unlikely (insert (dwfl, idx + 1, start, end,
183 dwfl->lookup_segndx[idx])))
188 else if (dwfl->lookup_addr[idx] < start)
192 if (unlikely (insert (dwfl, idx + 1, start, end, -1)))
198 if ((size_t) idx + 1 < dwfl->lookup_elts
199 && end < dwfl->lookup_addr[idx + 1])
202 if (unlikely (insert (dwfl, idx + 1,
203 end, dwfl->lookup_addr[idx + 1], -1)))
208 if (dwfl->lookup_module == NULL)
210 dwfl->lookup_module = calloc (dwfl->lookup_alloc,
211 sizeof dwfl->lookup_module[0]);
212 if (unlikely (dwfl->lookup_module == NULL))
221 dwfl->lookup_module[idx++] = mod;
222 while ((size_t) idx < dwfl->lookup_elts
223 && dwfl->lookup_addr[idx] < end);
224 assert (dwfl->lookup_module[mod->segment] == mod);
232 hint = (size_t) idx < dwfl->lookup_elts ? idx : -1;
237 for (size_t idx = 0; idx < dwfl->lookup_elts; ++idx)
238 if (dwfl->lookup_module[idx] != NULL)
239 dwfl->lookup_module[idx]->segment = idx;
245 dwfl_addrsegment (Dwfl *dwfl, Dwarf_Addr address, Dwfl_Module **mod)
247 if (unlikely (dwfl == NULL))
250 if (unlikely (dwfl->lookup_module == NULL)
252 && unlikely (reify_segments (dwfl)))
258 int idx = lookup (dwfl, address, -1);
261 if (unlikely (idx < 0) || unlikely (dwfl->lookup_module == NULL))
265 *mod = dwfl->lookup_module[idx];
269 if (*mod == NULL && idx > 0 && dwfl->lookup_addr[idx] == address)
271 *mod = dwfl->lookup_module[idx - 1];
280 idx = dwfl->lookup_segndx[idx];
287 dwfl_report_segment (Dwfl *dwfl, int ndx, const GElf_Phdr *phdr, GElf_Addr bias,
294 if (dwfl == NULL)
298 ndx = dwfl->next_segndx;
300 if (phdr->p_align > 1 && (dwfl->segment_align <= 1 ||
301 phdr->p_align < dwfl->segment_align))
302 dwfl->segment_align = phdr->p_align;
304 if (unlikely (dwfl->lookup_module != NULL))
306 free (dwfl->lookup_module);
307 dwfl->lookup_module = NULL;
310 GElf_Addr start = __libdwfl_segment_start (dwfl, bias + phdr->p_vaddr);
311 GElf_Addr end = __libdwfl_segment_end (dwfl,
316 size_t i = dwfl->lookup_elts;
317 while (i > 0 && unlikely (start < dwfl->lookup_addr[i - 1]))
320 if (unlikely (insert (dwfl, i, start, end, ndx)))
326 dwfl->next_segndx = ndx + 1;