628 	struct radnode* par)  in radnode_cleanup_onechild()  argument
638 	assert(pidx < par->len);  in radnode_cleanup_onechild()
639 	joinlen = par->array[pidx].len + n->array[0].len + 1;  in radnode_cleanup_onechild()
647 	if(par->array[pidx].str)  in radnode_cleanup_onechild()
648 	    memcpy(join, par->array[pidx].str, par->array[pidx].len);  in radnode_cleanup_onechild()
650 	join[par->array[pidx].len] = child->pidx + n->offset;  in radnode_cleanup_onechild()
653 	    memmove(join+par->array[pidx].len+1, n->array[0].str, n->array[0].len);  in radnode_cleanup_onechild()
654 	region_recycle(region, par->array[pidx].str, par->array[pidx].len);  in radnode_cleanup_onechild()
655 	par->array[pidx].str = join;  in radnode_cleanup_onechild()
656 	par->array[pidx].len = joinlen;  in radnode_cleanup_onechild()
658 	par->array[pidx].node = child;  in radnode_cleanup_onechild()
659 	child->parent = par;  in radnode_cleanup_onechild()
748 	struct radnode* par)  in radnode_cleanup_leaf()  argument
757 	assert(pidx < par->len);  in radnode_cleanup_leaf()
758 	region_recycle(region, par->array[pidx].str, par->array[pidx].len);  in radnode_cleanup_leaf()
759 	par->array[pidx].str = NULL;  in radnode_cleanup_leaf()
760 	par->array[pidx].len = 0;  in radnode_cleanup_leaf()
761 	par->array[pidx].node = NULL;  in radnode_cleanup_leaf()
764 	if(par->len == 1) {  in radnode_cleanup_leaf()
766 		radnode_array_clean_all(region, par);  in radnode_cleanup_leaf()
769 		radnode_array_clean_front(region, par);  in radnode_cleanup_leaf()
770 	} else if(pidx == par->len-1) {  in radnode_cleanup_leaf()
772 		radnode_array_clean_end(region, par);  in radnode_cleanup_leaf()
793 			struct radnode* par = n->parent;  in radnode_cleanup()  local
794 			if(!par) {  in radnode_cleanup()
801 			radnode_cleanup_leaf(rt->region, n, par);  in radnode_cleanup()
803 			n = par;  in radnode_cleanup()