Lines Matching refs:rootp
181 maybe_split_for_insert (node *rootp, node *parentp, node *gparentp,
184 node root = *rootp;
186 rp = &(*rootp)->right;
187 lp = &(*rootp)->left;
268 node *rootp = (node *) vrootp;
272 if (rootp == NULL)
276 if (*rootp != NULL)
277 (*rootp)->red = 0;
279 CHECK_TREE (*rootp);
281 nextp = rootp;
284 node root = *rootp;
289 maybe_split_for_insert (rootp, parentp, gparentp, p_r, gp_r, 0);
299 parentp = rootp;
300 rootp = nextp;
314 if (nextp != rootp)
317 maybe_split_for_insert (nextp, rootp, parentp, r, p_r, 1);
336 node *rootp = (node *) vrootp;
338 if (rootp == NULL)
341 CHECK_TREE (*rootp);
343 while (*rootp != NULL)
345 node root = *rootp;
352 rootp = r < 0 ? &root->left : &root->right;
369 node *rootp = (node *) vrootp;
378 if (rootp == NULL)
380 p = *rootp;
386 while ((cmp = (*compar) (key, (*rootp)->key)) != 0)
391 nodestack[sp++] = rootp;
392 p = *rootp;
393 rootp = ((cmp < 0)
394 ? &(*rootp)->left
395 : &(*rootp)->right);
396 if (*rootp == NULL)
409 root = *rootp;
418 node *parent = rootp, *up = &root->right;
438 *rootp = r;