llink              25 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_node		*llink;
llink             122 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (node->llink || node->rlink) {
llink             123 ompi/mca/coll/libnbc/libdict/hb_tree.c 			node = node->llink ? node->llink : node->rlink;
llink             138 ompi/mca/coll/libnbc/libdict/hb_tree.c 			if (parent->llink == node)
llink             139 ompi/mca/coll/libnbc/libdict/hb_tree.c 				parent->llink = NULL;
llink             162 ompi/mca/coll/libnbc/libdict/hb_tree.c 			node = node->llink;
llink             184 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent = node, node = node->llink;
llink             211 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->llink = node;
llink             221 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (q->llink == node) {
llink             223 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->llink->bal > 0)
llink             224 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, q->llink);
llink             251 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent = node, node = node->llink;
llink             271 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->llink = node;
llink             281 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (q->llink == node) {
llink             283 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (q->llink->bal > 0)
llink             284 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, q->llink);
llink             323 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = rv < 0 ? node->llink : node->rlink;
llink             328 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->llink && node->rlink) {
llink             329 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (out = node->rlink; out->llink; out = out->llink)
llink             337 ompi/mca/coll/libnbc/libdict/hb_tree.c 	out = node->llink ? node->llink : node->rlink;
llink             347 ompi/mca/coll/libnbc/libdict/hb_tree.c 	left = parent->llink == node;
llink             349 ompi/mca/coll/libnbc/libdict/hb_tree.c 		parent->llink = out;
llink             378 ompi/mca/coll/libnbc/libdict/hb_tree.c 				ASSERT(parent->llink != NULL);
llink             379 ompi/mca/coll/libnbc/libdict/hb_tree.c 				if (parent->llink->bal > 0) {
llink             380 ompi/mca/coll/libnbc/libdict/hb_tree.c 					rot_left(tree, parent->llink);
llink             383 ompi/mca/coll/libnbc/libdict/hb_tree.c 					ASSERT(parent->llink->llink != NULL);
llink             399 ompi/mca/coll/libnbc/libdict/hb_tree.c 		left = parent->llink == node;
llink             415 ompi/mca/coll/libnbc/libdict/hb_tree.c 	for (node = tree->root; node->llink; node = node->llink)
llink             492 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->llink = NULL;
llink             504 ompi/mca/coll/libnbc/libdict/hb_tree.c 	while (node->llink)
llink             505 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = node->llink;
llink             527 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (node = node->rlink; node->llink; node = node->llink)
llink             546 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->llink) {
llink             547 ompi/mca/coll/libnbc/libdict/hb_tree.c 		for (node = node->llink; node->rlink; node = node->rlink)
llink             552 ompi/mca/coll/libnbc/libdict/hb_tree.c 	while (temp && temp->llink == node) {
llink             566 ompi/mca/coll/libnbc/libdict/hb_tree.c 	l = node->llink ? node_height(node->llink) + 1 : 0;
llink             578 ompi/mca/coll/libnbc/libdict/hb_tree.c 	l = node->llink ? node_mheight(node->llink) + 1 : 0;
llink             590 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (node->llink)
llink             591 ompi/mca/coll/libnbc/libdict/hb_tree.c 		n += level + node_pathlen(node->llink, level + 1);
llink             619 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->rlink = rlink->llink;
llink             620 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (rlink->llink)
llink             621 ompi/mca/coll/libnbc/libdict/hb_tree.c 		rlink->llink->parent = node;
llink             625 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (parent->llink == node)
llink             626 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->llink = rlink;
llink             632 ompi/mca/coll/libnbc/libdict/hb_tree.c 	rlink->llink = node;
llink             656 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hb_node *llink, *parent;
llink             660 ompi/mca/coll/libnbc/libdict/hb_tree.c 	ASSERT(node->llink != NULL);
llink             662 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink = node->llink;
llink             663 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->llink = llink->rlink;
llink             664 ompi/mca/coll/libnbc/libdict/hb_tree.c 	if (llink->rlink)
llink             665 ompi/mca/coll/libnbc/libdict/hb_tree.c 		llink->rlink->parent = node;
llink             667 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink->parent = parent;
llink             669 ompi/mca/coll/libnbc/libdict/hb_tree.c 		if (parent->llink == node)
llink             670 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->llink = llink;
llink             672 ompi/mca/coll/libnbc/libdict/hb_tree.c 			parent->rlink = llink;
llink             674 ompi/mca/coll/libnbc/libdict/hb_tree.c 		tree->root = llink;
llink             676 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink->rlink = node;
llink             677 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->parent = llink;
llink             679 ompi/mca/coll/libnbc/libdict/hb_tree.c 	hc = llink->bal != 0;
llink             680 ompi/mca/coll/libnbc/libdict/hb_tree.c 	node->bal  += 1 - MIN(llink->bal, 0);
llink             681 ompi/mca/coll/libnbc/libdict/hb_tree.c 	llink->bal += 1 + MAX(node->bal, 0);
llink             857 ompi/mca/coll/libnbc/libdict/hb_tree.c 		node = rv < 0 ? node->llink : node->rlink;