HomeSort by relevance Sort by last modified time
    Searched refs:lookup_elts (Results 1 - 6 of 6) sorted by null

  /external/elfutils/0.153/libdwfl/
dwfl_getmodules.c 85 if ((size_t) offset - 1 == dwfl->lookup_elts)
88 if (unlikely ((size_t) offset - 1 > dwfl->lookup_elts))
108 : (((m == NULL ? (ptrdiff_t) dwfl->lookup_elts + 1
segment.c 72 bool need_end = (i >= dwfl->lookup_elts || dwfl->lookup_addr[i + 1] != end);
77 if (dwfl->lookup_alloc - dwfl->lookup_elts < need)
108 if (unlikely (i < dwfl->lookup_elts))
110 const size_t move = dwfl->lookup_elts - i;
139 dwfl->lookup_elts += need;
149 && ((size_t) hint + 1 == dwfl->lookup_elts
154 size_t l = 0, u = dwfl->lookup_elts;
163 if (l == dwfl->lookup_elts || address < dwfl->lookup_addr[l])
212 if ((size_t) idx + 1 < dwfl->lookup_elts
236 while ((size_t) idx < dwfl->lookup_elts
    [all...]
dwfl_segment_report_module.c 86 if (++segment >= dwfl->lookup_elts - 1)
94 if (++segment >= dwfl->lookup_elts - 1)
111 if (segment >= dwfl->lookup_elts)
112 segment = dwfl->lookup_elts - 1;
120 if (++segment == dwfl->lookup_elts)
dwfl_module.c 123 dwfl->lookup_elts = 0;
libdwflP.h 121 size_t lookup_elts; /* Elements in use. */ member in struct:Dwfl
link_map.c 336 segments. DWFL->lookup_elts is probably twice that number, so it
340 while (next != 0 && ++iterations < dwfl->lookup_elts)

Completed in 389 milliseconds