binutils/bfd/dwarf2.c

143 struct arange
145   struct arange *next;
163   struct arange arange;
743   struct arange arange;
927 arange_add (bfd *abfd, struct arange *first_arange, bfd_vma low_pc, bfd_vma high_pc)
929   struct arange *arange;
931   /* If the first arange is empty, use it. */
940   arange = first_arange;
943       if (low_pc == arange->high)
945 	  arange->high = high_pc;
948       if (high_pc == arange->low)
950 	  arange->low = low_pc;
953       arange = arange->next;
955   while (arange);
957   /* Need to allocate a new arange and insert it into the arange list.
958      Order isn't significant, so just insert after the first arange. */
959   arange = bfd_zalloc (abfd, sizeof (*arange));
960   arange->low = low_pc;
961   arange->high = high_pc;
962   arange->next = first_arange->next;
963   first_arange->next = arange;
1193 		  arange_add (unit->abfd, &unit->arange, low_pc, high_pc);
1350 	      struct arange *arange;
1353 	      lowest_pc = function->arange.low;
1354 	      for (arange = &function->arange;
1355 		   arange;
1356 		   arange = arange->next)
1358 		  if (function->arange.low < lowest_pc)
1359 		    lowest_pc = function->arange.low;
1449   struct arange *arange;
1455       for (arange = &each_func->arange;
1456 	   arange;
1457 	   arange = arange->next)
1459 	  if (addr >= arange->low && addr < arange->high)
1462 		  ((arange->high - arange->low) < (best_fit->arange.high - best_fit->arange.low)))
1492   struct arange *arange;
1500       for (arange = &each_func->arange;
1501 	   arange;
1502 	   arange = arange->next)
1505 	      && addr >= arange->low
1506 	      && addr < arange->high
1510 		  || ((arange->high - arange->low)
1511 		      < (best_fit->arange.high - best_fit->arange.low))))
1614 read_rangelist (struct comp_unit *unit, struct arange *arange, bfd_uint64_t offset)
1650 	arange_add (unit->abfd, arange, base_address + low_pc, base_address + high_pc);
1781 		  read_rangelist (unit, &func->arange, attr.u.val);
1856 	  arange_add (unit->abfd, &func->arange, low_pc, high_pc);
2014 	  read_rangelist (unit, &unit->arange, attr.u.val);
2039       arange_add (unit->abfd, &unit->arange, low_pc, high_pc);
2055   struct arange *arange;
2060   arange = &unit->arange;
2063       if (addr >= arange->low && addr < arange->high)
2065       arange = arange->next;
2067   while (arange);
2565 			  || each->arange.high == 0
2572 		found = ((each->arange.high == 0