Lines Matching refs:arange
340 struct arange
342 struct arange *next;
357 Unused if arange.high != 0. */
369 struct arange arange;
1845 struct arange arange;
2315 arange_add (struct comp_unit *unit, struct arange *first_arange,
2318 struct arange *arange;
2337 /* If the first arange is empty, use it. */
2346 arange = first_arange;
2349 if (low_pc == arange->high)
2351 arange
2354 if (high_pc == arange->low)
2356 arange->low = low_pc;
2359 arange = arange->next;
2361 while (arange);
2363 /* Need to allocate a new arange and insert it into the arange list.
2364 Order isn't significant, so just insert after the first arange. */
2365 arange = (struct arange *) bfd_alloc (unit->abfd, sizeof (*arange));
2366 if (arange == NULL)
2368 arange->low = low_pc;
2369 arange->high = high_pc;
2370 arange->next = first_arange->next;
2371 first_arange->next = arange;
2983 if (!arange_add (unit, &unit->arange, &unit->file->trie_root,
3246 struct arange *range;
3267 low_addr = entry->funcinfo->arange.low;
3268 high_addr = entry->funcinfo->arange.high;
3270 for (range = entry->funcinfo->arange.next; range; range = range->next)
3321 struct arange *arange;
3360 for (arange = &funcinfo->arange; arange; arange = arange->next)
3362 if (addr < arange->low || addr >= arange->high)
3365 if (arange->high - arange->low < best_fit_len
3369 || (arange->high - arange->low == best_fit_len
3373 best_fit_len = arange->high - arange->low;
3400 struct arange *arange;
3404 for (arange = &each->arange; arange; arange = arange->next)
3405 if (addr >= arange->low
3406 && addr < arange->high
3407 && arange->high - arange->low < best_fit_len
3413 best_fit_len = arange->high - arange->low;
3687 read_ranges (struct comp_unit *unit, struct arange *arange,
3723 if (!arange_add (unit, arange, trie_root,
3732 read_rnglists (struct comp_unit *unit, struct arange *arange,
3807 if (!arange_add (unit, arange, trie_root, low_pc, high_pc))
3813 read_rangelist (struct comp_unit *unit, struct arange *arange,
3817 return read_ranges (unit, arange, trie_root, offset);
3819 return read_rnglists (unit, arange, trie_root, offset);
4174 && !read_rangelist (unit, &func->arange,
4289 if (!arange_add (unit, &func->arange, &unit->file->trie_root,
4345 if (!read_rangelist (unit, &unit->arange,
4598 && !read_rangelist (unit, &unit->arange,
4654 if (!arange_add (unit, &unit->arange, &unit->file->trie_root,
4679 struct arange *arange;
4684 if (unit->arange.high == 0 /* No ranges have been computed yet. */
4688 for (arange = &unit->arange; arange != NULL; arange = arange->next)
4689 if (addr >= arange->low && addr < arange->high)
5128 struct arange *arange;
5136 for (arange = &each_func->arange;
5137 arange;
5138 arange = arange->next)
5140 if (addr >= arange->low
5141 && addr < arange->high
5142 && arange->high - arange->low < best_fit_len)
5145 best_fit_len = arange->high - arange->low;
5646 if (each->arange.high == 0)
5721 if (func->name && func->arange.low)
5732 result = func->arange.low - (sym->value + sym->section->vma);
5979 if (each->arange.high != 0)
6053 else if (fun->value + sec_vma == function->arange.low)
Indexes created Thu Aug 13 00:25:44 UTC 2026