Lines Matching refs:idx
152 size_t idx = (l + u) / 2;
153 if (address < dwfl->lookup_addr[idx])
154 u = idx;
157 l = idx + 1;
159 return idx;
176 int idx = lookup (dwfl, start, hint);
177 if (unlikely (idx < 0))
182 idx = 0;
184 else if (dwfl->lookup_addr[idx] > start)
187 if (unlikely (insert (dwfl, idx + 1, start, end,
188 dwfl->lookup_segndx[idx])))
190 ++idx;
192 else if (dwfl->lookup_addr[idx] < start)
196 if (unlikely (insert (dwfl, idx + 1, start, end, -1)))
198 ++idx;
201 if ((size_t) idx + 1 < dwfl->lookup_elts
202 && end < dwfl->lookup_addr[idx + 1]
204 && unlikely (insert (dwfl, idx + 1,
205 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);
224 hint = (size_t) idx < dwfl->lookup_elts ? idx : -1;
244 int idx = lookup (dwfl, address, -1);
247 if (unlikely (idx < 0) || unlikely (dwfl->lookup_module == NULL))
251 *mod = dwfl->lookup_module[idx];
255 if (*mod == NULL && idx > 0 && dwfl->lookup_addr[idx] == address)
257 *mod = dwfl->lookup_module[idx - 1];
264 if (likely (idx >= 0))
266 idx = dwfl->lookup_segndx[idx];
268 return idx;
