Lines Matching refs:idx
143 size_t idx = (l + u) / 2;
144 if (address < dwfl->lookup_addr[idx])
145 u = idx;
148 l = idx + 1;
150 return idx;
170 int idx = lookup (dwfl, start, hint);
171 if (unlikely (idx < 0))
176 idx = 0;
179 else if (dwfl->lookup_addr[idx] > start)
182 if (unlikely (insert (dwfl, idx + 1, start, end,
183 dwfl->lookup_segndx[idx])))
185 ++idx;
188 else if (dwfl->lookup_addr[idx] < start)
192 if (unlikely (insert (dwfl, idx + 1, start, end, -1)))
194 ++idx;
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)))
217 mod->segment = idx;
221 dwfl->lookup_module[idx++] = mod;
222 while ((size_t) idx < dwfl->lookup_elts
223 && dwfl->lookup_addr[idx] < end);
226 if (resized && idx - 1 >= highest)
231 highest = idx - 1;
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;
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];
278 if (likely (idx >= 0))
280 idx = dwfl->lookup_segndx[idx];
282 return idx;