Lines Matching refs:left
81 *left,
203 node->left=(NodeInfo *) NULL;
209 node->left=splay_tree->root;
210 node->right=node->left->right;
211 node->left->right=(NodeInfo *) NULL;
216 node->left=node->right->left;
217 node->right->left=(NodeInfo *) NULL;
264 node->left=(NodeInfo *) NULL;
266 node->left=LinkSplayTreeNodes(nodes,low,bisect-1);
347 while (node->left != (NodeInfo *) NULL)
348 node=node->left;
384 while (node->left != (NodeInfo *) NULL)
385 node=node->left;
520 while (node->left != (NodeInfo *) NULL)
521 node=node->left;
530 *left,
552 left=splay_tree->root->left;
564 if (left == (NodeInfo *) NULL)
570 splay_tree->root=left;
573 while (left->right != (NodeInfo *) NULL)
574 left=left->right;
575 left->right=right;
620 *left,
642 left=splay_tree->root->left;
653 if (left == (NodeInfo *) NULL)
659 splay_tree->root=left;
662 while (left->right != (NodeInfo *) NULL)
663 left=left->right;
664 left->right=right;
718 if (active->left != (NodeInfo *) NULL)
721 (active->left->value != (void *) NULL))
722 active->left->value=splay_tree->relinquish_value(
723 active->left->value);
725 (active->left->key != (void *) NULL))
726 active->left->key=splay_tree->relinquish_key(active->left->key);
727 active->left->key=(void *) pend;
728 pend=active->left;
802 while (node->left != (NodeInfo *) NULL)
803 node=node->left;
857 while (node->left != (NodeInfo *) NULL)
858 node=node->left;
1041 if (node->left == (NodeInfo *) NULL)
1044 nodes[i]=node->left;
1195 while (node->left != (NodeInfo *) NULL)
1196 node=node->left;
1205 *left,
1224 left=splay_tree->root->left;
1232 if (left == (NodeInfo *) NULL)
1238 splay_tree->root=left;
1241 while (left->right != (NodeInfo *) NULL)
1242 left=left->right;
1243 left->right=right;
1286 *left,
1312 left=splay_tree->root->left;
1320 if (left == (NodeInfo *) NULL)
1326 splay_tree->root=left;
1329 while (left->right != (NodeInfo *) NULL)
1330 left=left->right;
1331 left->right=right;
1390 if (active->left != (NodeInfo *) NULL)
1393 (active->left->value != (void *) NULL))
1394 active->left->value=splay_tree->relinquish_value(
1395 active->left->value);
1397 (active->left->key != (void *) NULL))
1398 active->left->key=splay_tree->relinquish_key(active->left->key);
1399 active->left->key=(void *) pend;
1400 pend=active->left;
1520 next=(&n->left);
1539 if (n == (*parent)->left)
1546 *node=n->left;
1547 n->left=(*parent);
1552 if ((n == (*parent)->left) && (*parent == (*grandparent)->left))
1555 (*grandparent)->left=p->right;
1557 p->left=n->right;
1565 (*grandparent)->right=p->left;
1566 p->left=(*grandparent);
1567 p->right=n->left;
1568 n->left=p;
1572 if (n == (*parent)->left)
1574 (*parent)->left=n->right;
1576 (*grandparent)->right=n->left;
1577 n->left=(*grandparent);
1581 (*parent)->right=n->left;
1582 n->left=(*parent);
1583 (*grandparent)->left=n->right;
