Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 25 of 25) sorted by relevance

/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-trees.rb163 r0 = new_node new_token(101)
164 r1 = new_node new_token(102)
166 r1.add_child(new_node new_token(103))
167 r2 = new_node new_token(106)
168 r2.add_child new_node( new_token 107 )
170 r0.add_child new_node( new_token 104 )
171 r0.add_child new_node( new_token 105 )
189 r0 = new_node new_token(101)
190 r1 = new_node new_token(102)
192 r1.add_child new_node( new_token 103 )
[all …]
/external/lldb/examples/scripting/
Ddictionary.c68 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); in insert() local
69 new_node->word = strdup (word); in insert()
70 new_node->left = NULL; in insert()
71 new_node->right = NULL; in insert()
72 root->left = new_node; in insert()
81 tree_node *new_node = (tree_node *) malloc (sizeof (tree_node)); in insert() local
82 new_node->word = strdup (word); in insert()
83 new_node->left = NULL; in insert()
84 new_node->right = NULL; in insert()
85 root->right = new_node; in insert()
[all …]
/external/libvpx/libvpx/
Dwarnings.c42 struct WarningListNode *new_node = malloc(sizeof(*new_node)); in add_warning() local
43 if (new_node == NULL) { in add_warning()
47 new_node->warning_string = warning_string; in add_warning()
48 new_node->next_warning = NULL; in add_warning()
53 *node = new_node; in add_warning()
/external/compiler-rt/lib/profile/
DGCDAProfiling.c514 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); in llvm_register_writeout_function() local
515 new_node->fn = fn; in llvm_register_writeout_function()
516 new_node->next = NULL; in llvm_register_writeout_function()
519 writeout_fn_head = writeout_fn_tail = new_node; in llvm_register_writeout_function()
521 writeout_fn_tail->next = new_node; in llvm_register_writeout_function()
522 writeout_fn_tail = new_node; in llvm_register_writeout_function()
546 struct flush_fn_node *new_node = malloc(sizeof(struct flush_fn_node)); in llvm_register_flush_function() local
547 new_node->fn = fn; in llvm_register_flush_function()
548 new_node->next = NULL; in llvm_register_flush_function()
551 flush_fn_head = flush_fn_tail = new_node; in llvm_register_flush_function()
[all …]
/external/linux-tools-perf/src/tools/perf/util/
Drblist.c17 struct rb_node *parent = NULL, *new_node; in rblist__add_node() local
33 new_node = rblist->node_new(rblist, new_entry); in rblist__add_node()
34 if (new_node == NULL) in rblist__add_node()
37 rb_link_node(new_node, parent, p); in rblist__add_node()
38 rb_insert_color(new_node, &rblist->entries); in rblist__add_node()
/external/selinux/libsepol/src/
Dnode_record.c602 sepol_node_t *new_node = NULL; in hidden_def() local
603 if (sepol_node_create(handle, &new_node) < 0) in hidden_def()
607 new_node->addr = malloc(node->addr_sz); in hidden_def()
608 new_node->mask = malloc(node->mask_sz); in hidden_def()
609 if (!new_node->addr || !new_node->mask) in hidden_def()
612 memcpy(new_node->addr, node->addr, node->addr_sz); in hidden_def()
613 memcpy(new_node->mask, node->mask, node->mask_sz); in hidden_def()
614 new_node->addr_sz = node->addr_sz; in hidden_def()
615 new_node->mask_sz = node->mask_sz; in hidden_def()
616 new_node->proto = node->proto; in hidden_def()
[all …]
Dconditional.c143 cond_node_t *new_node; in cond_node_create() local
146 new_node = (cond_node_t *)malloc(sizeof(cond_node_t)); in cond_node_create()
147 if (!new_node) { in cond_node_create()
150 memset(new_node, 0, sizeof(cond_node_t)); in cond_node_create()
153 new_node->expr = cond_copy_expr(node->expr); in cond_node_create()
154 if (!new_node->expr) { in cond_node_create()
155 free(new_node); in cond_node_create()
158 new_node->cur_state = cond_evaluate_expr(p, new_node->expr); in cond_node_create()
159 new_node->nbools = node->nbools; in cond_node_create()
161 new_node->bool_ids[i] = node->bool_ids[i]; in cond_node_create()
[all …]
Dlink.c1550 cond_node_t *cur, *new_node = NULL, *tail; in copy_cond_list() local
1558 new_node = (cond_node_t *) malloc(sizeof(cond_node_t)); in copy_cond_list()
1559 if (!new_node) { in copy_cond_list()
1562 memset(new_node, 0, sizeof(cond_node_t)); in copy_cond_list()
1564 new_node->cur_state = cur->cur_state; in copy_cond_list()
1565 new_node->expr = cond_copy_expr(cur->expr); in copy_cond_list()
1566 if (!new_node->expr) in copy_cond_list()
1569 for (cur_expr = new_node->expr; cur_expr != NULL; in copy_cond_list()
1578 new_node->nbools = cur->nbools; in copy_cond_list()
1584 new_node->bool_ids[i] = remapped_id; in copy_cond_list()
[all …]
/external/protobuf/gtest/samples/
Dsample3-inl.h118 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
121 head_ = last_ = new_node; in Enqueue()
124 last_->next_ = new_node; in Enqueue()
125 last_ = new_node; in Enqueue()
/external/google-breakpad/src/testing/gtest/samples/
Dsample3-inl.h117 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
120 head_ = last_ = new_node; in Enqueue()
123 last_->next_ = new_node; in Enqueue()
124 last_ = new_node; in Enqueue()
/external/valgrind/callgrind/
Dclo.c221 config_node *new_node; in get_fnc2() local
224 new_node = new_config(n->name, len); in get_fnc2()
226 nprev->next = new_node; in get_fnc2()
228 node->sub_node[ n->name[0]%NODE_DEGREE ] = new_node; in get_fnc2()
229 new_node->next = n->next; in get_fnc2()
231 new_node->sub_node[ n->name[len]%NODE_DEGREE ] = n; in get_fnc2()
243 new_sub->next = new_node->sub_node[ name[0]%NODE_DEGREE ]; in get_fnc2()
244 new_node->sub_node[ name[0]%NODE_DEGREE ] = new_sub; in get_fnc2()
/external/cmockery/cmockery_0_1_2/src/
Dcmockery.c118 static ListNode* list_add(ListNode * const head, ListNode *new_node);
323 ListNode * const new_node = (ListNode*)malloc(sizeof(ListNode)); in list_add_value() local
326 new_node->value = value; in list_add_value()
327 new_node->refcount = refcount; in list_add_value()
328 return list_add(head, new_node); in list_add_value()
333 static ListNode* list_add(ListNode * const head, ListNode *new_node) { in list_add() argument
335 assert_true(new_node); in list_add()
336 new_node->next = head; in list_add()
337 new_node->prev = head->prev; in list_add()
338 head->prev->next = new_node; in list_add()
[all …]
/external/libvpx/libvpx/vpx_mem/memory_manager/include/
Dcavl_impl.h721 L_SC AVL_HANDLE L_(subst)(L_(avl) *l_tree, AVL_HANDLE new_node) { in L_()
732 cmp = AVL_COMPARE_NODE_NODE(new_node, h); in L_()
745 AVL_SET_LESS(new_node, AVL_GET_LESS(h, 0)) in L_()
746 AVL_SET_GREATER(new_node, AVL_GET_GREATER(h, 0)) in L_()
747 AVL_SET_BALANCE_FACTOR(new_node, AVL_GET_BALANCE_FACTOR(h)) in L_()
751 l_tree->root = new_node; in L_()
755 AVL_SET_LESS(parent, new_node) in L_()
757 AVL_SET_GREATER(parent, new_node) in L_()
Dcavl_if.h106 L_SC AVL_HANDLE L_(subst)(L_(avl) *tree, AVL_HANDLE new_node);
/external/e2fsprogs/lib/ext2fs/
Dblkmap64_rb.c86 struct rb_node *new_node, *node, *next; in check_tree() local
389 struct rb_node *new_node, *node, *next; in rb_insert_extent() local
427 new_node = &ext->node; in rb_insert_extent()
435 new_node = &new_ext->node; in rb_insert_extent()
436 ext2fs_rb_link_node(new_node, parent, n); in rb_insert_extent()
437 ext2fs_rb_insert_color(new_node, root); in rb_insert_extent()
440 node = ext2fs_rb_prev(new_node); in rb_insert_extent()
453 for (node = ext2fs_rb_next(new_node); node != NULL; node = next) { in rb_insert_extent()
/external/selinux/libsepol/cil/src/
Dcil_tree.c124 struct cil_tree_node *new_node = cil_malloc(sizeof(*new_node)); in cil_tree_node_init() local
125 new_node->cl_head = NULL; in cil_tree_node_init()
126 new_node->cl_tail = NULL; in cil_tree_node_init()
127 new_node->parent = NULL; in cil_tree_node_init()
128 new_node->data = NULL; in cil_tree_node_init()
129 new_node->next = NULL; in cil_tree_node_init()
130 new_node->flavor = CIL_ROOT; in cil_tree_node_init()
131 new_node->line = 0; in cil_tree_node_init()
132 new_node->path = NULL; in cil_tree_node_init()
134 *node = new_node; in cil_tree_node_init()
/external/v8/src/
Dliveedit-debugger.js683 function ProcessNode(old_node, new_node) { argument
685 IsFunctionContextLocalsChanged(old_node.info, new_node.info);
691 var new_children = new_node.children;
765 if (old_node.info.param_num != new_node.info.param_num) {
768 old_node.info.param_num + " and " + new_node.info.param_num;
Dprofile-generator.cc197 ProfileNode* new_node = new ProfileNode(tree_, entry); in FindOrAddChild() local
198 map_entry->value = new_node; in FindOrAddChild()
199 children_list_.Add(new_node); in FindOrAddChild()
/external/doclava/res/assets/templates/assets/
Ddoclava-developer-reference.js98 function new_node(me, mom, text, link, children_data, api_level) function
201 mom.children[i] = new_node(me, mom, node_data[0], node_data[1],
/external/v8/src/heap/
Dspaces.cc2343 FreeListNode* new_node = FindNodeFor(size_in_bytes, &new_node_size); in Allocate() local
2344 if (new_node == NULL) { in Allocate()
2354 reinterpret_cast<Object**>(new_node->address())[i] = in Allocate()
2362 DCHECK(!MarkCompactCollector::IsOnEvacuationCandidate(new_node)); in Allocate()
2373 owner_->Free(new_node->address() + size_in_bytes, bytes_left); in Allocate()
2382 owner_->Free(new_node->address() + size_in_bytes + linear_size, in Allocate()
2384 owner_->SetTopAndLimit(new_node->address() + size_in_bytes, in Allocate()
2385 new_node->address() + size_in_bytes + linear_size); in Allocate()
2389 owner_->SetTopAndLimit(new_node->address() + size_in_bytes, in Allocate()
2390 new_node->address() + new_node_size); in Allocate()
[all …]
/external/opencv/ml/src/
Dmltree.cpp180 data_root = new_node( 0, sample_count, 0, 0 ); in CV_IMPLEMENT_QSORT_EX()
300 CV_CALL( data_root = new_node( 0, sample_count, 0, 0 )); in CV_IMPLEMENT_QSORT_EX()
567 root = new_node( 0, 1, 0, 0 ); in subsample_data()
588 root = new_node( 0, count, 1, 0 ); in subsample_data()
801 CvDTreeNode* CvDTreeTrainData::new_node( CvDTreeNode* parent, int count, in new_node() function in CvDTreeTrainData
2542 node->left = left = data->new_node( node, nl, new_buf_idx, node->offset ); in split_node_data()
2543 node->right = right = data->new_node( node, nr, new_buf_idx, node->offset + in split_node_data()
3294 CV_CALL( node = data->new_node( parent, 0, 0, 0 )); in read_node()
/external/e2fsprogs/e2fsck/
Ddict.c1268 static dnode_t *new_node(void *c) in new_node() function
1483 dict_set_allocator(d, new_node, del_node, NULL); in main()
/external/selinux/libsepol/cil/test/unit/
Dtest_cil_copy_ast.c183 struct cil_class *new_node; in test_cil_copy_perm() local
184 cil_class_init(&new_node); in test_cil_copy_perm()
188 new_tree_node->data = new_node; in test_cil_copy_perm()
Dtest_cil_build_ast.c494 struct cil_class *new_node; in test_cil_gen_perm() local
495 cil_class_init(&new_node); in test_cil_gen_perm()
499 new_tree_node->data = new_node; in test_cil_gen_perm()
575 struct cil_class *new_node; in test_cil_gen_perm_astnull_neg() local
576 cil_class_init(&new_node); in test_cil_gen_perm_astnull_neg()
580 new_tree_node->data = new_node; in test_cil_gen_perm_astnull_neg()
/external/opencv/ml/include/
Dml.h781 virtual CvDTreeNode* new_node( CvDTreeNode* parent, int count,