193 struct arange  struct
195   struct arange *next;  argument
217   struct arange arange;  argument
1169   struct arange arange;  member
1394 arange_add (const struct comp_unit *unit, struct arange *first_arange,  in arange_add()
1397   struct arange *arange;  in arange_add()  local
1412   arange = first_arange;  in arange_add()
1415       if (low_pc == arange->high)  in arange_add()
1417 	  arange->high = high_pc;  in arange_add()
1420       if (high_pc == arange->low)  in arange_add()
1422 	  arange->low = low_pc;  in arange_add()
1425       arange = arange->next;  in arange_add()
1427   while (arange);  in arange_add()
1431   arange = (struct arange *) bfd_alloc (unit->abfd, sizeof (*arange));  in arange_add()
1432   if (arange == NULL)  in arange_add()
1434   arange->low = low_pc;  in arange_add()
1435   arange->high = high_pc;  in arange_add()
1436   arange->next = first_arange->next;  in arange_add()
1437   first_arange->next = arange;  in arange_add()
1774 		  if (!arange_add (unit, &unit->arange, low_pc, high_pc))  in decode_line_info()
2006   struct arange *arange;  in lookup_address_in_function_table()  local
2012       for (arange = &each_func->arange;  in lookup_address_in_function_table()
2013 	   arange;  in lookup_address_in_function_table()
2014 	   arange = arange->next)  in lookup_address_in_function_table()
2016 	  if (addr >= arange->low && addr < arange->high)  in lookup_address_in_function_table()
2019 		  || arange->high - arange->low < best_fit_len)  in lookup_address_in_function_table()
2022 		  best_fit_len = arange->high - arange->low;  in lookup_address_in_function_table()
2053   struct arange *arange;  in lookup_symbol_in_function_table()  local
2061       for (arange = &each_func->arange;  in lookup_symbol_in_function_table()
2062 	   arange;  in lookup_symbol_in_function_table()
2063 	   arange = arange->next)  in lookup_symbol_in_function_table()
2066 	      && addr >= arange->low  in lookup_symbol_in_function_table()
2067 	      && addr < arange->high  in lookup_symbol_in_function_table()
2071 		  || arange->high - arange->low < best_fit_len))  in lookup_symbol_in_function_table()
2074 	      best_fit_len = arange->high - arange->low;  in lookup_symbol_in_function_table()
2235 read_rangelist (struct comp_unit *unit, struct arange *arange,  in read_rangelist()  argument
2264 	  if (!arange_add (unit, arange,  in read_rangelist()
2417 		  if (!read_rangelist (unit, &func->arange, attr.u.val))  in scan_unit_for_symbols()
2497 	  if (!arange_add (unit, &func->arange, low_pc, high_pc))  in scan_unit_for_symbols()
2672 	  if (!read_rangelist (unit, &unit->arange, attr.u.val))  in parse_comp_unit()
2700       if (!arange_add (unit, &unit->arange, low_pc, high_pc))  in parse_comp_unit()
2717   struct arange *arange;  in comp_unit_contains_address()  local
2722   arange = &unit->arange;  in comp_unit_contains_address()
2725       if (addr >= arange->low && addr < arange->high)  in comp_unit_contains_address()
2727       arange = arange->next;  in comp_unit_contains_address()
2729   while (arange);  in comp_unit_contains_address()
3198   struct arange *arange;  in info_hash_lookup_funcinfo()  local
3207       for (arange = &each_func->arange;  in info_hash_lookup_funcinfo()
3208 	   arange;  in info_hash_lookup_funcinfo()
3209 	   arange = arange->next)  in info_hash_lookup_funcinfo()
3212 	      && addr >= arange->low  in info_hash_lookup_funcinfo()
3213 	      && addr < arange->high  in info_hash_lookup_funcinfo()
3215 		  || arange->high - arange->low < best_fit_len))  in info_hash_lookup_funcinfo()
3218 	      best_fit_len = arange->high - arange->low;  in info_hash_lookup_funcinfo()
3699 		|| each->arange.high == 0  in _bfd_dwarf2_find_nearest_line()
3721 	  found = ((each->arange.high == 0  in _bfd_dwarf2_find_nearest_line()
3838 		      || each->arange.high == 0  in _bfd_dwarf2_find_nearest_line()
3845 	    found = ((each->arange.high == 0  in _bfd_dwarf2_find_nearest_line()