71   bool need_start = (i == 0 || dwfl->lookup_addr[i - 1] != start);  in insert()
72   bool need_end = (i >= dwfl->lookup_elts || dwfl->lookup_addr[i + 1] != end);  in insert()
80       GElf_Addr *naddr = realloc (dwfl->lookup_addr, sizeof naddr[0] * n);  in insert()
86 	  if (naddr != dwfl->lookup_addr)  in insert()
91       dwfl->lookup_addr = naddr;  in insert()
110       memcpy (&dwfl->lookup_addr[i + need], &dwfl->lookup_addr[i],  in insert()
111 	      need * sizeof dwfl->lookup_addr[0]);  in insert()
121       dwfl->lookup_addr[i] = start;  in insert()
130       dwfl->lookup_addr[i] = end;  in insert()
143       && address >= dwfl->lookup_addr[hint]  in lookup()
145 	  || address <= dwfl->lookup_addr[hint + 1]))  in lookup()
153       if (address < dwfl->lookup_addr[idx])  in lookup()
158 	  if (l == dwfl->lookup_elts || address < dwfl->lookup_addr[l])  in lookup()
184 	else if (dwfl->lookup_addr[idx] > start)  in reify_segments()
192 	else if (dwfl->lookup_addr[idx] < start)  in reify_segments()
202 	    && end < dwfl->lookup_addr[idx + 1]  in reify_segments()
205 				 end, dwfl->lookup_addr[idx + 1], -1)))  in reify_segments()
223 	       && dwfl->lookup_addr[idx] < end);  in reify_segments()
255 	  if (*mod == NULL && idx > 0 && dwfl->lookup_addr[idx] == address)  in dwfl_addrsegment()
305       while (i > 0 && unlikely (start < dwfl->lookup_addr[i - 1]))  in INTDEF()