heap              110 src/ralloc.c     struct heap *next;
heap              111 src/ralloc.c     struct heap *prev;
heap              131 src/ralloc.c   static struct heap heap_base;
heap              154 src/ralloc.c     struct heap *heap; 		/* Heap this bloc is in.  */
heap              176 src/ralloc.c     heap_ptr heap;
heap              178 src/ralloc.c     for (heap = last_heap; heap; heap = heap->prev)
heap              180 src/ralloc.c         if (heap->start <= address && address <= heap->end)
heap              181 src/ralloc.c   	return heap;
heap              208 src/ralloc.c     heap_ptr heap;
heap              212 src/ralloc.c     for (heap = last_heap; heap; heap = heap->prev)
heap              214 src/ralloc.c         if (heap->start <= address && address <= heap->end)
heap              218 src/ralloc.c     if (! heap)
heap              223 src/ralloc.c     while (heap && (char *) address + size > (char *) heap->end)
heap              225 src/ralloc.c         heap = heap->next;
heap              226 src/ralloc.c         if (heap == NIL_HEAP)
heap              228 src/ralloc.c         address = heap->bloc_start;
heap              233 src/ralloc.c     if (heap == NIL_HEAP)
heap              377 src/ralloc.c     heap_ptr heap;
heap              395 src/ralloc.c     heap = find_heap (new_bloc->data);
heap              396 src/ralloc.c     heap->free = break_value;
heap              399 src/ralloc.c     new_bloc->heap = heap;
heap              400 src/ralloc.c     heap->last_bloc = new_bloc;
heap              401 src/ralloc.c     if (heap->first_bloc == NIL_BLOC)
heap              402 src/ralloc.c       heap->first_bloc = new_bloc;
heap              429 src/ralloc.c   relocate_blocs (bloc_ptr bloc, heap_ptr heap, void *address)
heap              441 src/ralloc.c         while (heap && (char *) address + b->size > (char *) heap->end)
heap              443 src/ralloc.c   	  heap = heap->next;
heap              444 src/ralloc.c   	  if (heap == NIL_HEAP)
heap              446 src/ralloc.c   	  address = heap->bloc_start;
heap              451 src/ralloc.c         if (heap == NIL_HEAP)
heap              470 src/ralloc.c   	  heap = last_heap;
heap              488 src/ralloc.c   update_heap_bloc_correspondence (bloc_ptr bloc, heap_ptr heap)
heap              493 src/ralloc.c     if (bloc != NIL_BLOC && bloc->prev != NIL_BLOC && bloc->prev->heap == heap)
heap              496 src/ralloc.c         heap->last_bloc = bloc->prev;
heap              497 src/ralloc.c         heap->free = (char *) bloc->prev->data + bloc->prev->size;
heap              502 src/ralloc.c         heap->first_bloc = NIL_BLOC;
heap              503 src/ralloc.c         heap->last_bloc = NIL_BLOC;
heap              504 src/ralloc.c         heap->free = heap->bloc_start;
heap              512 src/ralloc.c         while (heap)
heap              514 src/ralloc.c   	  if (heap->bloc_start <= b->data && b->data <= heap->end)
heap              516 src/ralloc.c   	  heap = heap->next;
heap              519 src/ralloc.c   	  heap->first_bloc = NIL_BLOC;
heap              520 src/ralloc.c   	  heap->last_bloc = NIL_BLOC;
heap              521 src/ralloc.c   	  heap->free = heap->bloc_start;
heap              525 src/ralloc.c         heap->free = (char *) b->data + b->size;
heap              526 src/ralloc.c         heap->last_bloc = b;
heap              527 src/ralloc.c         if (heap->first_bloc == NIL_BLOC)
heap              528 src/ralloc.c   	heap->first_bloc = b;
heap              531 src/ralloc.c         b->heap = heap;
heap              536 src/ralloc.c     heap = heap->next;
heap              537 src/ralloc.c     while (heap)
heap              539 src/ralloc.c         heap->first_bloc = NIL_BLOC;
heap              540 src/ralloc.c         heap->last_bloc = NIL_BLOC;
heap              541 src/ralloc.c         heap->free = heap->bloc_start;
heap              542 src/ralloc.c         heap = heap->next;
heap              553 src/ralloc.c     heap_ptr heap;
heap              564 src/ralloc.c     for (heap = first_heap; heap != NIL_HEAP; heap = heap->next)
heap              566 src/ralloc.c         if (heap->bloc_start <= bloc->data && bloc->data <= heap->end)
heap              570 src/ralloc.c     if (heap == NIL_HEAP)
heap              579 src/ralloc.c     while (heap)
heap              581 src/ralloc.c         if (heap->bloc_start <= address && address <= heap->end)
heap              583 src/ralloc.c         heap = heap->prev;
heap              586 src/ralloc.c     if (! relocate_blocs (bloc, heap, address))
heap              639 src/ralloc.c     update_heap_bloc_correspondence (bloc, heap);
heap              652 src/ralloc.c     heap_ptr heap = bloc->heap;
heap              695 src/ralloc.c       if (heap == h)
heap              701 src/ralloc.c         if (heap->first_bloc == bloc)
heap              703 src/ralloc.c   	  if (bloc->next != 0 && bloc->next->heap == heap)
heap              704 src/ralloc.c   	    heap->first_bloc = bloc->next;
heap              706 src/ralloc.c   	    heap->first_bloc = heap->last_bloc = NIL_BLOC;
heap              708 src/ralloc.c         if (heap->last_bloc == bloc)
heap              710 src/ralloc.c   	  if (bloc->prev != 0 && bloc->prev->heap == heap)
heap              711 src/ralloc.c   	    heap->last_bloc = bloc->prev;
heap              713 src/ralloc.c   	    heap->first_bloc = heap->last_bloc = NIL_BLOC;
heap              185 src/w32heap.c  HANDLE heap = NULL;
heap              195 src/w32heap.c    void *p = size <= PTRDIFF_MAX ? HeapAlloc (heap, 0, size | !size) : NULL;
heap              205 src/w32heap.c  	     ? HeapReAlloc (heap, 0, ptr, size | !size)
heap              273 src/w32heap.c        heap = HeapCreate (0, 0, 0);
heap              284 src/w32heap.c  	  if (s_pfn_Heap_Set_Information ((PVOID) heap,
heap              333 src/w32heap.c        heap = s_pfn_Rtl_Create_Heap (0, data_region_base, 0, 0, NULL, &params);
heap              514 src/w32heap.c        HeapFree (heap, 0, ptr);
heap              529 src/w32heap.c        HeapFree (heap, 0, ptr);