Searched refs:node_t (Results 1 - 17 of 17) sorted by relevance

/external/chromium_org/third_party/bintrees/bintrees/
H A Dctrees.pxd12 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 *roo
[all...]
H A Dctrees.h14 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_nod
[all...]
H A Dcwalker.pxd8 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)
H A Dstack.h18 node_t **stack;
23 void stack_push(node_stack_t *stack, node_t *node);
24 node_t *stack_pop(node_stack_t *stack);
H A Dstack.pxd8 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)
H A Dstack.c18 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 *
H A Dctrees.c24 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 *roo
[all...]
H A Dqavltree.pyx17 cdef node_t *_root
74 cdef node_t *node
82 cdef node_t *node
H A Dqbintree.pyx17 cdef node_t *_root
73 cdef node_t *node
81 cdef node_t *node
H A Dqrbtree.pyx17 cdef node_t *_root
74 cdef node_t *node
82 cdef node_t *node
H A Dcwalker.pyx23 cdef void set_tree(self, node_t *root):
H A Dcwalker.c352 * cdef node_t *node
353 * cdef node_t *root
358 node_t *node;
359 node_t *root;
374 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *);
653 * cdef void set_tree(self, node_t *root):
663 * cdef void set_tree(self, node_t *root): # <<<<<<<<<<<<<<
668 static void __pyx_f_8bintrees_7cwalker_7cWalker_set_tree(struct __pyx_obj_8bintrees_7cwalker_cWalker *__pyx_v_self, node_t *__pyx_v_root) {
678 * cdef void set_tree(self, node_t *root):
686 * cdef void set_tree(self, node_t *roo
[all...]
H A Dqavltree.c354 * cdef node_t *node
355 * cdef node_t *root
360 node_t *node;
361 node_t *root;
370 * cdef node_t *_root
375 node_t *_root;
385 * cdef node_t *node
386 * cdef node_t *root
390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *);
1551 * cdef node_t *nod
[all...]
H A Dqbintree.c354 * cdef node_t *node
355 * cdef node_t *root
360 node_t *node;
361 node_t *root;
370 * cdef node_t *_root
375 node_t *_root;
385 * cdef node_t *node
386 * cdef node_t *root
390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *);
1549 * cdef node_t *nod
[all...]
H A Dqrbtree.c354 * cdef node_t *node
355 * cdef node_t *root
360 node_t *node;
361 node_t *root;
370 * cdef node_t *_root
375 node_t *_root;
385 * cdef node_t *node
386 * cdef node_t *root
390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *);
1551 * cdef node_t *nod
[all...]
/external/jemalloc/test/unit/
H A Drb.c14 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_nod
[all...]
/external/libsepol/tests/policies/test-cond/
H A Drefpolicy-base.conf805 type node_t, node_type;
1460 allow kernel_t node_t:node rawip_send;
1653 sid node system_u:object_r:node_t:s0

Completed in 1114 milliseconds