Searched refs:lookup_elts (Results 1 – 7 of 7) sorted by relevance
53 bool need_end = (i + 1 >= dwfl->lookup_elts in insert()59 if (dwfl->lookup_alloc - dwfl->lookup_elts < need) in insert()90 if (unlikely (i < dwfl->lookup_elts)) in insert()92 const size_t move = dwfl->lookup_elts - i; in insert()121 dwfl->lookup_elts += need; in insert()131 && ((size_t) hint + 1 == dwfl->lookup_elts in lookup()136 size_t l = 0, u = dwfl->lookup_elts; in lookup()145 if (l == dwfl->lookup_elts || address < dwfl->lookup_addr[l]) in lookup()194 if ((size_t) idx + 1 < dwfl->lookup_elts in reify_segments()218 while ((size_t) idx < dwfl->lookup_elts in reify_segments()[all …]
64 if ((size_t) offset - 1 == dwfl->lookup_elts) in dwfl_getmodules()67 if (unlikely ((size_t) offset - 1 > dwfl->lookup_elts)) in dwfl_getmodules()87 : (((m == NULL ? (ptrdiff_t) dwfl->lookup_elts + 1 in dwfl_getmodules()
71 if (++segment >= dwfl->lookup_elts - 1) in addr_segndx()79 if (++segment >= dwfl->lookup_elts - 1) in addr_segndx()249 if (segment >= dwfl->lookup_elts) in dwfl_segment_report_module()250 segment = dwfl->lookup_elts - 1; in dwfl_segment_report_module()258 if (++segment == dwfl->lookup_elts) in dwfl_segment_report_module()
134 dwfl->lookup_elts = 0; in INTDEF()
131 size_t lookup_elts; /* Elements in use. */ member
323 while (next != 0 && ++iterations < dwfl->lookup_elts) in report_r_debug()
328 * segment.c (insert): Check correct number of lookup_elts.1845 * libdwflP.h (struct Dwfl): New members lookup_elts, lookup_alloc,