rlink              26 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_node		*rlink;
rlink             122 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (node->llink || node->rlink) {
rlink             123 ompi/mca/coll/libnbc/libdict/hb_tree.c 			node = node->llink ? node->llink : node->rlink;
rlink             141 ompi/mca/coll/libnbc/libdict/hb_tree.c 				parent->rlink = NULL;
rlink             164 ompi/mca/coll/libnbc/libdict/hb_tree.c 			node = node->rlink;
rlink             186 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent = node, node = node->rlink;
rlink             213 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->rlink = node;
rlink             216 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->bal = (parent->rlink == node) * 2 - 1;
rlink             229 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->rlink->bal < 0)
rlink             230 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, q->rlink);
rlink             253 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent = node, node = node->rlink;
rlink             273 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->rlink = node;
rlink             276 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->bal = (parent->rlink == node) * 2 - 1;
rlink             289 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->rlink->bal < 0)
rlink             290 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, q->rlink);
rlink             323 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = rv < 0 ? node->llink : node->rlink;
rlink             328 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->llink && node->rlink) {
rlink             329 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (out = node->rlink; out->llink; out = out->llink)
rlink             337 ompi/mca/coll/libnbc/libdict/hb_tree.c 	out = node->llink ? node->llink : node->rlink;
rlink             351 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->rlink = out;
rlink             360 ompi/mca/coll/libnbc/libdict/hb_tree.c 				ASSERT(parent->rlink != NULL);
rlink             361 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (parent->rlink->bal < 0) {
rlink             362 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_right(tree, parent->rlink);
rlink             365 ompi/mca/coll/libnbc/libdict/hb_tree.c 					ASSERT(parent->rlink->rlink != NULL);
rlink             430 ompi/mca/coll/libnbc/libdict/hb_tree.c 	for (; node->rlink; node = node->rlink)
rlink             493 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->rlink = NULL;
rlink             514 ompi/mca/coll/libnbc/libdict/hb_tree.c 	while (node->rlink)
rlink             515 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = node->rlink;
rlink             526 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->rlink) {
rlink             527 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (node = node->rlink; node->llink; node = node->llink)
rlink             532 ompi/mca/coll/libnbc/libdict/hb_tree.c 	while (temp && temp->rlink == node) {
rlink             547 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (node = node->llink; node->rlink; node = node->rlink)
rlink             567 ompi/mca/coll/libnbc/libdict/hb_tree.c 	r = node->rlink ? node_height(node->rlink) + 1 : 0;
rlink             579 ompi/mca/coll/libnbc/libdict/hb_tree.c 	r = node->rlink ? node_mheight(node->rlink) + 1 : 0;
rlink             592 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->rlink)
rlink             593 ompi/mca/coll/libnbc/libdict/hb_tree.c 		n += level + node_pathlen(node->rlink, level + 1);
rlink             612 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_node *rlink, *parent;
rlink             616 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(node->rlink != NULL);
rlink             618 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink = node->rlink;
rlink             619 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->rlink = rlink->llink;
rlink             620 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (rlink->llink)
rlink             621 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rlink->llink->parent = node;
rlink             623 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink->parent = parent;
rlink             626 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->llink = rlink;
rlink             628 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->rlink = rlink;
rlink             630 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = rlink;
rlink             632 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink->llink = node;
rlink             633 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->parent = rlink;
rlink             635 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hc = rlink->bal != 0;
rlink             636 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->bal  -= 1 + MAX(rlink->bal, 0);
rlink             637 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink->bal -= 1 - MIN(node->bal, 0);
rlink             663 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->llink = llink->rlink;
rlink             664 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (llink->rlink)
rlink             665 ompi/mca/coll/libnbc/libdict/hb_tree.c 		llink->rlink->parent = node;
rlink             672 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->rlink = llink;
rlink             676 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink->rlink = node;
rlink             857 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = rv < 0 ? node->llink : node->rlink;