260 	int diff;  in avl_find()  local
268 		diff = tree->avl_compar(value, AVL_NODE2DATA(node, off));  in avl_find()
269 		ASSERT(-1 <= diff && diff <= 1);  in avl_find()
270 		if (diff == 0) {  in avl_find()
277 		child = avl_balance2child[1 + diff];  in avl_find()
581 	int diff;  in avl_insert_here()  local
596 	diff = tree->avl_compar(new_data, here);  in avl_insert_here()
597 	ASSERT(-1 <= diff && diff <= 1);  in avl_insert_here()
598 	ASSERT(diff != 0);  in avl_insert_here()
599 	ASSERT(diff > 0 ? child == 1 : child == 0);  in avl_insert_here()
607 			diff = tree->avl_compar(new_data,  in avl_insert_here()
609 			ASSERT(-1 <= diff && diff <= 1);  in avl_insert_here()
610 			ASSERT(diff != 0);  in avl_insert_here()
611 			ASSERT(diff > 0 ? child == 1 : child == 0);  in avl_insert_here()
616 		diff = tree->avl_compar(new_data,  in avl_insert_here()
618 		ASSERT(-1 <= diff && diff <= 1);  in avl_insert_here()
619 		ASSERT(diff != 0);  in avl_insert_here()
620 		ASSERT(diff > 0 ? child == 1 : child == 0);  in avl_insert_here()