rootp             182 maint/gnulib/lib/tsearch.c maybe_split_for_insert (node *rootp, node *parentp, node *gparentp,
rootp             185 maint/gnulib/lib/tsearch.c   node root = *rootp;
rootp             187 maint/gnulib/lib/tsearch.c   rp = &(*rootp)->right;
rootp             188 maint/gnulib/lib/tsearch.c   lp = &(*rootp)->left;
rootp             269 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
rootp             273 maint/gnulib/lib/tsearch.c   if (rootp == NULL)
rootp             277 maint/gnulib/lib/tsearch.c   if (*rootp != NULL)
rootp             278 maint/gnulib/lib/tsearch.c     (*rootp)->red = 0;
rootp             280 maint/gnulib/lib/tsearch.c   CHECK_TREE (*rootp);
rootp             282 maint/gnulib/lib/tsearch.c   nextp = rootp;
rootp             285 maint/gnulib/lib/tsearch.c       node root = *rootp;
rootp             290 maint/gnulib/lib/tsearch.c       maybe_split_for_insert (rootp, parentp, gparentp, p_r, gp_r, 0);
rootp             300 maint/gnulib/lib/tsearch.c       parentp = rootp;
rootp             301 maint/gnulib/lib/tsearch.c       rootp = nextp;
rootp             315 maint/gnulib/lib/tsearch.c       if (nextp != rootp)
rootp             318 maint/gnulib/lib/tsearch.c         maybe_split_for_insert (nextp, rootp, parentp, r, p_r, 1);
rootp             334 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
rootp             336 maint/gnulib/lib/tsearch.c   if (rootp == NULL)
rootp             339 maint/gnulib/lib/tsearch.c   CHECK_TREE (*rootp);
rootp             341 maint/gnulib/lib/tsearch.c   while (*rootp != NULL)
rootp             343 maint/gnulib/lib/tsearch.c       node root = *rootp;
rootp             350 maint/gnulib/lib/tsearch.c       rootp = r < 0 ? &root->left : &root->right;
rootp             367 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
rootp             376 maint/gnulib/lib/tsearch.c   if (rootp == NULL)
rootp             378 maint/gnulib/lib/tsearch.c   p = *rootp;
rootp             384 maint/gnulib/lib/tsearch.c   while ((cmp = (*compar) (key, (*rootp)->key)) != 0)
rootp             389 maint/gnulib/lib/tsearch.c       nodestack[sp++] = rootp;
rootp             390 maint/gnulib/lib/tsearch.c       p = *rootp;
rootp             391 maint/gnulib/lib/tsearch.c       rootp = ((cmp < 0)
rootp             392 maint/gnulib/lib/tsearch.c                ? &(*rootp)->left
rootp             393 maint/gnulib/lib/tsearch.c                : &(*rootp)->right);
rootp             394 maint/gnulib/lib/tsearch.c       if (*rootp == NULL)
rootp             407 maint/gnulib/lib/tsearch.c   root = *rootp;
rootp             416 maint/gnulib/lib/tsearch.c       node *parent = rootp, *up = &root->right;
rootp             436 maint/gnulib/lib/tsearch.c     *rootp = r;