HomeSort by relevance Sort by last modified time
    Searched refs:rootp (Results 1 - 5 of 5) sorted by null

  /bionic/libc/upstream-openbsd/lib/libc/stdlib/
tfind.c 28 node **rootp = (node **)vrootp; local
30 if (rootp == (struct node_t **)0)
32 while (*rootp != (struct node_t *)0) { /* T1: */
34 if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */
35 return (*rootp); /* key found */
36 rootp = (r < 0) ?
37 &(*rootp)->llink : /* T3: follow left branch */
38 &(*rootp)->rlink; /* T4: follow right branch */
tsearch.c 30 node **rootp = (node **)vrootp; local
32 if (rootp == (struct node_t **)0)
34 while (*rootp != (struct node_t *)0) { /* Knuth's T1: */
37 if ((r = (*compar)(key, (*rootp)->key)) == 0) /* T2: */
38 return ((void *)*rootp); /* we found it! */
39 rootp = (r < 0) ?
40 &(*rootp)->left : /* T3: follow left branch */
41 &(*rootp)->right; /* T4: follow right branch */
45 *rootp = q; /* link new node to old */
57 node **rootp = (node **)vrootp local
    [all...]
  /external/valgrind/main/coregrind/
m_wordfm.c 161 Bool avl_insert_wrk ( AvlNode** rootp,
175 if (!(*rootp)) {
176 (*rootp) = a;
180 cmpres = kCmp ? /*boxed*/ kCmp( (*rootp)->key, a->key )
181 : /*unboxed*/ cmp_unsigned_Words( (UWord)(*rootp)->key,
186 if ((*rootp)->child[0]) {
187 AvlNode* left_subtree = (*rootp)->child[0];
189 switch ((*rootp)->balance--) {
195 if ((*rootp)->child[0]->balance < 0) {
196 avl_swr( rootp );
    [all...]
  /external/valgrind/main/cachegrind/
cg_merge.c 1052 Bool avl_insert_wrk ( AvlNode** rootp,
1066 if (!(*rootp)) {
1067 (*rootp) = a;
1071 cmpres = kCmp( (*rootp)->key, a->key );
1075 if ((*rootp)->left) {
1076 AvlNode* left_subtree = (*rootp)->left;
1078 switch ((*rootp)->balance--) {
1084 if ((*rootp)->left->balance < 0) {
1085 avl_swr( rootp );
1086 (*rootp)->balance = 0
    [all...]
  /external/libpcap/
optimize.c     [all...]

Completed in 69 milliseconds