167 static heap_ptr first_heap, last_heap;  variable
202   for (heap = last_heap; heap; heap = heap->prev)
238   for (heap = last_heap; heap; heap = heap->prev)
264       already_available = (char *)last_heap->end - (char *)address;
266       if (new != last_heap->end)
281 	  new_heap->prev = last_heap;
284 	  last_heap->next = new_heap;
285 	  last_heap = new_heap;
295       get = (char *) ROUNDUP ((char *)last_heap->end + get)
296 	- (char *) last_heap->end;
298       if ((*real_morecore) (get) != last_heap->end)
301       last_heap->end += get;
321   for (h = last_heap; h && break_value < h->end; h = h->prev)  in relinquish()
327   if (excess > extra_bytes * 2 && (*real_morecore) (0) == last_heap->end)  in relinquish()
333       if ((char *)last_heap->end - (char *)last_heap->bloc_start <= excess)  in relinquish()
336 	  if (last_heap->first_bloc != NIL_BLOC  in relinquish()
337 	      || last_heap->last_bloc != NIL_BLOC)  in relinquish()
341 	  excess = (char *)last_heap->end - (char *)last_heap->start;  in relinquish()
342 	  last_heap = last_heap->prev;  in relinquish()
343 	  last_heap->next = NIL_HEAP;  in relinquish()
347 	  excess = (char *) last_heap->end  in relinquish()
348 			- (char *) ROUNDUP ((char *)last_heap->end - excess);  in relinquish()
349 	  last_heap->end -= excess;  in relinquish()
479 	  heap = last_heap;
765 	  if (first_heap == last_heap)
768 	    address = (POINTER) ROUNDUP (last_heap->start);
769 	  h = last_heap;
811 	    last_heap = first_heap;
975   first_heap = last_heap = &heap_base;  in r_alloc_init()
1017     assert (last_heap->end <= (POINTER) sbrk (0));  in r_alloc_check()
1043     assert (last_heap == ph);  in r_alloc_check()