| /external/chromium_org/third_party/bintrees/bintrees/ |
| ctrees.h | 14 typedef struct tree_node node_t; typedef in typeref:struct:tree_node
17 node_t *link[2];
23 typedef node_t* nodeptr;
26 void ct_delete_tree(node_t *root);
28 PyObject *ct_get_item(node_t *root, PyObject *key);
29 node_t *ct_find_node(node_t *root, PyObject *key);
30 node_t *ct_succ_node(node_t *root, PyObject *key);
31 node_t *ct_prev_node(node_t *root, PyObject *key)
[all...] |
| ctrees.pxd | 12 ctypedef struct node_t:
13 node_t *link[2]
18 void ct_delete_tree(node_t *root)
19 node_t *ct_find_node(node_t *root, object key)
20 PyObject *ct_get_item(node_t *root, object key)
21 node_t *ct_max_node(node_t *root)
22 node_t *ct_min_node(node_t *root
[all...] |
| cwalker.pxd | 8 from ctrees cimport node_t namespace
12 cdef node_t *node
13 cdef node_t *root
16 cdef void set_tree(self, node_t *root)
|
| stack.h | 18 node_t **stack;
23 void stack_push(node_stack_t *stack, node_t *node);
24 node_t *stack_pop(node_stack_t *stack);
|
| stack.pxd | 8 from ctrees cimport node_t namespace
15 void stack_push(node_stack_t *stack, node_t *node)
16 node_t *stack_pop(node_stack_t *stack)
|
| stack.c | 18 stack->stack = PyMem_Malloc(sizeof(node_t *) * size);
32 stack_push(node_stack_t *stack, node_t *node)
38 sizeof(node_t *) * stack->size);
42 extern node_t *
|
| ctrees.c | 24 static node_t *
27 node_t *new_node = PyMem_Malloc(sizeof(node_t));
41 ct_delete_node(node_t *node)
53 ct_delete_tree(node_t *root)
67 ct_swap_data(node_t *node1, node_t *node2)
98 extern node_t *
99 ct_find_node(node_t *root, PyObject *key)
114 ct_get_item(node_t *root, PyObject *key
[all...] |
| qavltree.pyx | 17 cdef node_t *_root
74 cdef node_t *node
82 cdef node_t *node
|
| qbintree.pyx | 17 cdef node_t *_root
73 cdef node_t *node
81 cdef node_t *node
|
| qrbtree.pyx | 17 cdef node_t *_root
74 cdef node_t *node
82 cdef node_t *node
|
| /external/llvm/test/CodeGen/X86/ |
| 2008-01-16-InvalidDAGCombineXform.ll | 3 %struct.node_t = type { double*, %struct.node_t*, %struct.node_t**, double**, double*, i32, i32 }
5 define void @localize_local_bb19_bb(%struct.node_t** %cur_node) {
7 %tmp1 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
8 %tmp2 = getelementptr %struct.node_t* %tmp1, i32 0, i32 4 ; <double**> [#uses=1]
10 %tmp4 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
11 %tmp5 = getelementptr %struct.node_t* %tmp4, i32 0, i32 4 ; <double**> [#uses=1
[all...] |
| atom-fixup-lea2.ll | 16 ;struct node_t
22 ;extern struct node_t getnode();
27 ; struct node_t n = getnode();
34 %struct.node_t = type { i32, i32, i32, i32, i32* }
38 %n = alloca %struct.node_t, align 4
39 call void bitcast (void (%struct.node_t*, ...)* @getnode to void (%struct.node_t*)*)(%struct.node_t* sret %n)
40 %array = getelementptr inbounds %struct.node_t* %n, i32 0, i32 4
46 %p = getelementptr inbounds %struct.node_t* %n, i32 0, i32
[all...] |
| switch-zextload.ll | 8 %struct.node_t = type { i8, i8, i8, i8, i32, i32, %struct.node_t**, %struct.node_t*, %struct.move_s }
10 define fastcc void @set_proof_and_disproof_numbers(%struct.node_t* nocapture %node) nounwind {
|
| /external/llvm/test/Transforms/ADCE/ |
| 2002-05-23-ZeroArgPHITest.ll | 9 %node_t = type { double*, %node_t*, %node_t**, double**, double*, i32, i32 }
11 define void @localize_local(%node_t* %nodelist) {
13 %nodelist.upgrd.1 = alloca %node_t* ; <%node_t**> [#uses=2]
14 store %node_t* %nodelist, %node_t** %nodelist.upgrd.1
18 %reg107 = load %node_t** %nodelist.upgrd.1 ; <%node_t*> [#uses=2
[all...] |
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tsearch.c | 7 * The node_t structure is for internal use only
18 typedef struct node_t { struct
20 struct node_t *left, *right;
32 if (rootp == (struct node_t **)0)
34 while (*rootp != (struct node_t *)0) { /* Knuth's T1: */
44 if (q != (struct node_t *)0) { /* make new node */
47 q->left = q->right = (struct node_t *)0;
64 if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0)
65 return ((struct node_t *)0)
[all...] |
| tfind.c | 7 * The node_t structure is for internal use only
16 typedef struct node_t struct
19 struct node_t *llink, *rlink;
30 if (rootp == (struct node_t **)0)
31 return ((struct node_t *)0);
32 while (*rootp != (struct node_t *)0) { /* T1: */
|
| /external/jemalloc/test/unit/ |
| rb.c | 14 typedef struct node_s node_t; typedef in typeref:struct:node_s
19 rb_node(node_t) link;
24 node_cmp(node_t *a, node_t *b) {
42 typedef rb_tree(node_t) tree_t;
43 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
48 node_t key;
70 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth,
71 node_t *nil)
74 node_t *left_node = rbtn_left_get(node_t, link, node)
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2009-03-09-AddrModeBug.ll | 4 %struct.node_t = type { %struct.hit_t, %struct.hit_t, i32 }
7 define fastcc %struct.node_t* @_ZL6createP6node_tii3v_tS1_d(%struct.node_t* %n, i32 %lvl, i32 %dist, i64 %c.0.0, i64 %c.0.1, i64 %c.0.2, i64 %d.0.0, i64 %d.0.1, i64 %d.0.2, double %r) nounwind {
9 %0 = getelementptr %struct.node_t* %n, i32 0, i32 1 ; <%struct.hit_t*> [#uses=1]
|
| /external/llvm/test/CodeGen/Generic/ |
| 2006-01-12-BadSetCCFold.ll | 3 %struct.node_t = type { double*, %struct.node_t*, %struct.node_t**, double**, double*, i32, i32 }
27 %cur_node.0.i8.1.i.i = phi %struct.node_t* [ undef, %dealwithargs.exit ], [ null, %no_exit.i12.i.i ] ; <%struct.node_t*> [#uses=0]
|
| /bionic/libc/bionic/ |
| tdestroy.cpp | 24 node_t* root_node = (node_t*) root;
|
| /bionic/libc/include/ |
| search.h | 27 } node_t; typedef in typeref:struct:node
|
| /development/ndk/platforms/android-L/include/ |
| search.h | 27 } node_t; typedef in typeref:struct:node
|
| /prebuilts/ndk/9/platforms/android-19/arch-arm64/usr/include/ |
| search.h | 27 } node_t; typedef in typeref:struct:node
|
| /prebuilts/ndk/9/platforms/android-19/arch-mips64/usr/include/ |
| search.h | 27 } node_t; typedef in typeref:struct:node
|
| /prebuilts/ndk/9/platforms/android-19/arch-x86_64/usr/include/ |
| search.h | 27 } node_t; typedef in typeref:struct:node
|
