143   struct heap *prev;  member
176   struct bp *prev;  member
202   for (heap = last_heap; heap; heap = heap->prev)
238   for (heap = last_heap; heap; heap = heap->prev)
281 	  new_heap->prev = last_heap;
321   for (h = last_heap; h && break_value < h->end; h = h->prev)  in relinquish()
342 	  last_heap = last_heap->prev;  in relinquish()
419       new_bloc->prev = last_bloc;
426       new_bloc->prev = NIL_BLOC;
500   bloc_ptr prev, next;  local
503   prev = bloc->prev;
506   if (prev)
507     prev->next = next;
509     next->prev = prev;
512   prev = before->prev;
514   if (prev)
515     prev->next = bloc;
516   bloc->prev = prev;
518   before->prev = bloc;
533   if (bloc != NIL_BLOC && bloc->prev != NIL_BLOC && bloc->prev->heap == heap)
536       heap->last_bloc = bloc->prev;
537       heap->free = bloc->prev->data + bloc->prev->size;
615   address = (bloc->prev ? bloc->prev->data + bloc->prev->size
621       heap = heap->prev;
632       for (b = last_bloc; b != bloc; b = b->prev)
674       last_bloc = bloc->prev;
680       first_bloc->prev = NIL_BLOC;
684       bloc->next->prev = bloc->prev;
685       bloc->prev->next = bloc->next;
698       if (bloc->prev->heap == heap)
699 	heap->last_bloc = bloc->prev;
784 	  for (b = last_bloc; b != NIL_BLOC; b = b->prev)
799 	  first_heap->prev = NIL_HEAP;
809 	    first_heap->next->prev = first_heap;
976   first_heap->next = first_heap->prev = NIL_HEAP;  in r_alloc_init()
1024 	assert (h->prev == ph);  in r_alloc_check()
1047 	assert (b->prev == pb);  in r_alloc_check()
1076 		ph = ph->prev;  in r_alloc_check()