Home
last modified time | relevance | path

Searched refs:rootp (Results 1 - 5 of 5) sorted by relevance

/third_party/skia/third_party/externals/microhttpd/src/microhttpd/
H A Dtsearch.c29 node_t **rootp = (node_t **)vrootp; local
31 if (rootp == NULL)
34 while (*rootp != NULL) { /* Knuth's T1: */
37 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
38 return *rootp; /* we found it! */
40 rootp = (r < 0) ?
41 &(*rootp)->llink : /* T3: follow left branch */
42 &(*rootp)->rlink; /* T4: follow right branch */
47 *rootp = q; /* link new node to old */
62 node_t **rootp local
90 node_t **rootp = (node_t **)vrootp; tdelete() local
[all...]
/third_party/musl/src/search/
H A Dtdelete.c5 void *tdelete(const void *restrict key, void **restrict rootp, in tdelete() argument
8 if (!rootp) in tdelete()
12 struct node *n = *rootp; in tdelete()
18 a[i++] = rootp; in tdelete()
19 a[i++] = rootp; in tdelete()
H A Dtfind.c4 void *tfind(const void *key, void *const *rootp, in tfind() argument
7 if (!rootp) in tfind()
10 struct node *n = *rootp; in tfind()
H A Dtsearch.c62 void *tsearch(const void *key, void **rootp, in tsearch() argument
65 if (!rootp) in tsearch()
69 struct node *n = *rootp; in tsearch()
72 a[i++] = rootp; in tsearch()
/third_party/ffmpeg/libavutil/
H A Dtree.h76 * @param rootp A pointer to a pointer to the root node of the tree; note that
91 * void *tree_insert(struct AVTreeNode **rootp, void *key,
97 * return av_tree_insert(rootp, key, cmp, next);
99 * void *tree_remove(struct AVTreeNode **rootp, void *key,
103 * return av_tree_insert(rootp, key, cmp, next);
113 void *av_tree_insert(struct AVTreeNode **rootp, void *key,

Completed in 2 milliseconds