libmalloc/dist/gmalloc.c

166 	__malloc_size_t prev;	/* Index of previous free cluster.  */
190     struct list *prev;
451   _heapinfo[0].free.next = _heapinfo[0].free.prev = 0;
565 	  next->prev->next = next->next;
567 	    next->next->prev = next->prev;
593 	      next->prev = &_fraghead[log];
594 	      next->prev->next = next;
596 		next->next->prev = next;
626 	      block = _heapinfo[0].free.prev;
635  		  block = _heapinfo[0].free.prev;
663 	  _heapinfo[block + blocks].free.prev
664 	    = _heapinfo[block].free.prev;
665 	  _heapinfo[_heapinfo[block].free.prev].free.next
666 	    = _heapinfo[_heapinfo[block].free.next].free.prev
673 	  _heapinfo[_heapinfo[block].free.next].free.prev
674 	    = _heapinfo[block].free.prev;
675 	  _heapinfo[_heapinfo[block].free.prev].free.next
767   struct list *prev, *next;
786 	  i = _heapinfo[i].free.prev;
792 	  i = _heapinfo[i].free.prev;
807 	  _heapinfo[block].free.prev = i;
809 	  _heapinfo[_heapinfo[block].free.next].free.prev = block;
822 	  _heapinfo[_heapinfo[block].free.next].free.prev = block;
834 	  _heapinfo[_heapinfo[block].free.prev].free.next
836 	  _heapinfo[_heapinfo[block].free.next].free.prev
837 	    = _heapinfo[block].free.prev;
838 	  block = _heapinfo[block].free.prev;
855       prev = (struct list *) ((char *) ADDRESS (block) +
862 	  next = prev;
865 	  prev->prev->next = next;
867 	    next->prev = prev->prev;
885 	  next->next = prev->next;
886 	  next->prev = prev;
887 	  prev->next = next;
889 	    next->next->prev = next;
897 	  prev = (struct list *) ptr;
902 	  prev->next = _fraghead[type].next;
903 	  prev->prev = &_fraghead[type];
904 	  prev->prev->next = prev;
905 	  if (prev->next != NULL)
906 	    prev->next->prev = prev;