Lines Matching refs:left
116 RET(tree_srch(&(**ppr_tree).left,
160 if (!tree_trav(&(**ppr_tree).left, pfi_uar))
173 tree_mung(&(**ppr_tree).left, pfv_uar);
199 (*ppr)->left = NULL;
212 /* if LESS, prepare to move to the left.
215 MSG("LESS. sprouting left.")
216 sub = sprout(&(*ppr)->left, p_data, pi_balance,
218 if (sub && *pi_balance) { /*%< left branch has grown */
219 MSG("LESS: left branch has grown")
228 /* balance WAS okay; now left branch longer */
233 /* left branch was already too long. rebal */
235 p1 = (*ppr)->left;
238 (*ppr)->left = p1->right;
246 p1->right = p2->left;
247 p2->left = p1;
249 (*ppr)->left = p2->right;
294 (*ppr)->right = p1->left;
295 p1->left = *ppr;
301 p2 = p1->left;
302 p1->left = p2->right;
305 (*ppr)->right = p2->left;
306 p2->left = *ppr;
353 MSG("too high - scan left")
354 i_ret = delete(&(*ppr_p)->left, pfi_compare, p_user, pfv_uar,
369 *ppr_p = pr_q->left;
371 } else if (pr_q->left == NULL) {
372 MSG("right subtree non-null, left subtree null")
377 del(&pr_q->left, pi_balance, &pr_q,
408 *ppr_r = (*ppr_r)->left;
421 MSG("left branch has shrunk")
439 (*ppr_p)->right = p1->left;
440 p1->left = *ppr_p;
454 p2 = p1->left;
456 p1->left = p2->right;
458 (*ppr_p)->right = p2->left;
459 p2->left = *ppr_p;
494 p1 = (*ppr_p)->left;
498 (*ppr_p)->left = p1->right;
515 p1->right = p2->left;
516 p2->left = p1;
517 (*ppr_p)->left = p2->right;