bal                27 ompi/mca/coll/libnbc/libdict/hb_tree.c 	balance_t	 bal;
bal               198 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (parent->bal)
bal               216 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->bal = (parent->rlink == node) * 2 - 1;
bal               222 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (--q->bal == -2) {
bal               223 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->llink->bal > 0)
bal               228 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (++q->bal == +2) {
bal               229 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->rlink->bal < 0)
bal               258 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (parent->bal)
bal               276 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->bal = (parent->rlink == node) * 2 - 1;
bal               282 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (--q->bal == -2) {
bal               283 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->llink->bal > 0)
bal               288 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (++q->bal == +2) {
bal               289 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->rlink->bal < 0)
bal               355 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (++parent->bal == 0) {
bal               359 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (parent->bal == +2) {
bal               361 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (parent->rlink->bal < 0) {
bal               373 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (--parent->bal == 0) {
bal               377 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (parent->bal == -2) {
bal               379 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (parent->llink->bal > 0) {
bal               494 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->bal = 0;
bal               635 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hc = rlink->bal != 0;
bal               636 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->bal  -= 1 + MAX(rlink->bal, 0);
bal               637 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink->bal -= 1 - MIN(node->bal, 0);
bal               679 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hc = llink->bal != 0;
bal               680 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->bal  += 1 - MIN(llink->bal, 0);
bal               681 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink->bal += 1 + MAX(node->bal, 0);