258 treeinsert(Free *tree, Free *node)  in treeinsert()  argument
262 	assert(node != nil /* treeinsert */);  in treeinsert()
264 	loc = ltreewalk(&tree, node->size);  in treeinsert()
266 		node->left = nil;  in treeinsert()
267 		node->right = nil;  in treeinsert()
270 		node->left = repl->left;  in treeinsert()
271 		node->right = repl->right;  in treeinsert()
273 	*loc = node;  in treeinsert()
279 treedelete(Free *tree, Free *node)  in treedelete()  argument
283 	assert(node != nil /* treedelete */);  in treedelete()
285 	loc = ltreewalk(&tree, node->size);  in treedelete()
286 	assert(*loc == node);  in treedelete()
288 	if(node->left == nil)  in treedelete()
289 		*loc = node->right;  in treedelete()
290 	else if(node->right == nil)  in treedelete()
291 		*loc = node->left;  in treedelete()
294 		for(lsucc = &node->right; (*lsucc)->left; lsucc = &(*lsucc)->left)  in treedelete()
298 		succ->left = node->left;  in treedelete()
299 		succ->right = node->right;  in treedelete()
303 	node->left = node->right = Poison;  in treedelete()
333 listadd(Free *list, Free *node)  in listadd()  argument
336 		node->next = node;  in listadd()
337 		node->prev = node;  in listadd()
338 		return node;  in listadd()
341 	node->prev = list->prev;  in listadd()
342 	node->next = list;  in listadd()
344 	node->prev->next = node;  in listadd()
345 	node->next->prev = node;  in listadd()
352 listdelete(Pool *p, Free *list, Free *node)  in listdelete()  argument
354 	if(node->next == node) {	/* singular list */  in listdelete()
355 		node->prev = node->next = Poison;  in listdelete()
358 	if(node->next == nil)  in listdelete()
360 	if(node->prev == nil)  in listdelete()
362 	node->next->prev = node->prev;  in listdelete()
363 	node->prev->next = node->next;  in listdelete()
365 	if(list == node)  in listdelete()
366 		list = node->next;  in listdelete()
368 	node->prev = node->next = Poison;  in listdelete()
381 	Free *node;  in pooladd()  local
388 	node = (Free*)anode;  in pooladd()
389 	node->magic = FREE_MAGIC;  in pooladd()
390 	parent = ltreewalk(&p->freeroot, node->size);  in pooladd()
392 	lst = listadd(olst, node);  in pooladd()
395 	p->curfree += node->size;  in pooladd()
396 	return node;  in pooladd()
401 pooldel(Pool *p, Free *node)  in pooldel()  argument
406 	parent = ltreewalk(&p->freeroot, node->size);  in pooldel()
410 	lst = listdelete(p, olst, node);  in pooldel()
416 	node->left = node->right = Poison;  in pooldel()
417 	p->curfree -= node->size;  in pooldel()
420 		memmark(_B2D(node), 0xF9, node->size-sizeof(Bhdr)-sizeof(Btail));  in pooldel()
423 	node->magic = UNALLOC_MAGIC;  in pooldel()
424 	return (Alloc*)node;  in pooldel()