343 struct arange  struct
345   struct arange *next;  argument
372   struct arange arange;  member
1838   struct arange arange;  member
2308 arange_add (struct comp_unit *unit, struct arange *first_arange,  in arange_add()
2311   struct arange *arange;  in arange_add()  local
2339   arange = first_arange;  in arange_add()
2342       if (low_pc == arange->high)  in arange_add()
2344             arange->high = high_pc;  in arange_add()
2347       if (high_pc == arange->low)  in arange_add()
2349             arange->low = low_pc;  in arange_add()
2352       arange = arange->next;  in arange_add()
2354   while (arange);  in arange_add()
2358   arange = (struct arange *) bfd_alloc (unit->abfd, sizeof (*arange));  in arange_add()
2359   if (arange == NULL)  in arange_add()
2361   arange->low = low_pc;  in arange_add()
2362   arange->high = high_pc;  in arange_add()
2363   arange->next = first_arange->next;  in arange_add()
2364   first_arange->next = arange;  in arange_add()
2976                       if (!arange_add (unit, &unit->arange, &unit->file->trie_root,  in decode_line_info()
3239   struct arange *range;  in build_lookup_funcinfo_table()
3260       low_addr  = entry->funcinfo->arange.low;  in build_lookup_funcinfo_table()
3261       high_addr = entry->funcinfo->arange.high;  in build_lookup_funcinfo_table()
3263       for (range = entry->funcinfo->arange.next; range; range = range->next)  in build_lookup_funcinfo_table()
3314   struct arange *arange;  in lookup_address_in_function_table()  local
3353       for (arange = &funcinfo->arange; arange; arange = arange->next)  in lookup_address_in_function_table()
3355             if (addr < arange->low || addr >= arange->high)  in lookup_address_in_function_table()
3358             if (arange->high - arange->low < best_fit_len  in lookup_address_in_function_table()
3362                 || (arange->high - arange->low == best_fit_len  in lookup_address_in_function_table()
3366                 best_fit_len = arange->high - arange->low;  in lookup_address_in_function_table()
3393   struct arange *arange;  in lookup_symbol_in_function_table()  local
3397     for (arange = &each->arange; arange; arange = arange->next)  in lookup_symbol_in_function_table()
3398       if (addr >= arange->low  in lookup_symbol_in_function_table()
3399             && addr < arange->high  in lookup_symbol_in_function_table()
3400             && arange->high - arange->low < best_fit_len  in lookup_symbol_in_function_table()
3406             best_fit_len = arange->high - arange->low;  in lookup_symbol_in_function_table()
3680 read_ranges (struct comp_unit *unit, struct arange *arange,  in read_ranges()  argument
3716             if (!arange_add (unit, arange, trie_root,  in read_ranges()
3725 read_rnglists (struct comp_unit *unit, struct arange *arange,  in read_rnglists()  argument
3800       if (!arange_add (unit, arange, trie_root, low_pc, high_pc))  in read_rnglists()
3806 read_rangelist (struct comp_unit *unit, struct arange *arange,  in read_rangelist()  argument
3810     return read_ranges (unit, arange, trie_root, offset);  in read_rangelist()
3812     return read_rnglists (unit, arange, trie_root, offset);  in read_rangelist()
4167                           && !read_rangelist (unit, &func->arange,  in scan_unit_for_symbols()
4282             if (!arange_add (unit, &func->arange, &unit->file->trie_root,  in scan_unit_for_symbols()
4338       if (!read_rangelist (unit, &unit->arange,  in reread_attribute()
4591                 && !read_rangelist (unit, &unit->arange,  in parse_comp_unit()
4647       if (!arange_add (unit, &unit->arange, &unit->file->trie_root,  in parse_comp_unit()
4672   struct arange *arange;  in comp_unit_may_contain_address()  local
4677   if (unit->arange.high == 0 /* No ranges have been computed yet.  */  in comp_unit_may_contain_address()
4681   for (arange = &unit->arange; arange != NULL; arange = arange->next)  in comp_unit_may_contain_address()
4682     if (addr >= arange->low && addr < arange->high)  in comp_unit_may_contain_address()
5121   struct arange *arange;  in info_hash_lookup_funcinfo()  local
5129       for (arange = &each_func->arange;  in info_hash_lookup_funcinfo()
5130              arange;  in info_hash_lookup_funcinfo()
5131              arange = arange->next)  in info_hash_lookup_funcinfo()
5133             if (addr >= arange->low  in info_hash_lookup_funcinfo()
5134                 && addr < arange->high  in info_hash_lookup_funcinfo()
5135                 && arange->high - arange->low < best_fit_len)  in info_hash_lookup_funcinfo()
5138                 best_fit_len = arange->high - arange->low;  in info_hash_lookup_funcinfo()
5639             if (each->arange.high == 0)  in stash_comp_unit()
5714           if (func->name && func->arange.low)  in _bfd_dwarf2_find_symbol_bias()
5725                     result = func->arange.low - (sym->value + sym->section->vma);  in _bfd_dwarf2_find_symbol_bias()
5972             if (each->arange.high != 0)  in _bfd_dwarf2_find_nearest_line_with_alt()
6046             else if (fun->value + sec_vma == function->arange.low)  in _bfd_dwarf2_find_nearest_line_with_alt()