| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| D | test-trees.rb | 163 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/python/cpython2/Lib/lib2to3/ |
| D | btm_utils.py | 112 new_node = None
122 new_node = reduce_tree(node.children[0], parent)
125 new_node = MinNode(type=TYPE_ALTERNATIVES)
130 reduced = reduce_tree(child, new_node)
132 new_node.children.append(reduced)
136 new_node = MinNode(type=TYPE_GROUP)
138 reduced = reduce_tree(child, new_node)
140 new_node.children.append(reduced)
141 if not new_node.children:
143 new_node = None
[all …]
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| D | rbt.c | 285 rb_node *new_node; in rbtree_insert() local
292 new_node = rbnode_construct(object, black); in rbtree_insert()
293 if (!new_node) in rbtree_insert()
295 tree->root = new_node; in rbtree_insert()
297 return new_node; in rbtree_insert()
305 new_node = rbnode_construct(object, red); in rbtree_insert()
306 if (!new_node) in rbtree_insert()
317 free(new_node); in rbtree_insert()
325 cur_node->left = new_node; in rbtree_insert()
326 new_node->parent = cur_node; in rbtree_insert()
[all …]
|
| /external/v8/src/compiler/ |
| D | instruction-scheduler.cc | 121 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr); in AddInstruction() local
127 node->AddSuccessor(new_node); in AddInstruction()
131 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
133 last_live_in_reg_marker_ = new_node; in AddInstruction()
136 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
142 last_deopt_->AddSuccessor(new_node); in AddInstruction()
149 last_side_effect_instr_->AddSuccessor(new_node); in AddInstruction()
152 load->AddSuccessor(new_node); in AddInstruction()
155 last_side_effect_instr_ = new_node; in AddInstruction()
160 last_side_effect_instr_->AddSuccessor(new_node); in AddInstruction()
[all …]
|
| D | simd-scalar-lowering.cc | 261 Node* new_node[kMaxLanes]; in LowerNode() local
263 new_node[i] = nullptr; in LowerNode()
265 new_node[0] = node; in LowerNode()
269 new_node[i] = graph()->NewNode(common()->Parameter(new_index + i), in LowerNode()
273 ReplaceNode(node, new_node); in LowerNode()
447 void SimdScalarLowering::ReplaceNode(Node* old, Node** new_node) { in ReplaceNode() argument
449 DCHECK(new_node[0] != nullptr || in ReplaceNode()
450 (new_node[1] == nullptr && new_node[2] == nullptr && in ReplaceNode()
451 new_node[3] == nullptr)); in ReplaceNode()
453 replacements_[old->id()].node[i] = new_node[i]; in ReplaceNode()
|
| /external/libvpx/libvpx/ |
| D | warnings.c | 42 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()
52 *node = new_node; in add_warning()
|
| /external/compiler-rt/lib/profile/ |
| D | GCDAProfiling.c | 502 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); in llvm_register_writeout_function() local
503 new_node->fn = fn; in llvm_register_writeout_function()
504 new_node->next = NULL; in llvm_register_writeout_function()
507 writeout_fn_head = writeout_fn_tail = new_node; in llvm_register_writeout_function()
509 writeout_fn_tail->next = new_node; in llvm_register_writeout_function()
510 writeout_fn_tail = new_node; in llvm_register_writeout_function()
534 struct flush_fn_node *new_node = malloc(sizeof(struct flush_fn_node)); in llvm_register_flush_function() local
535 new_node->fn = fn; in llvm_register_flush_function()
536 new_node->next = NULL; in llvm_register_flush_function()
539 flush_fn_head = flush_fn_tail = new_node; in llvm_register_flush_function()
[all …]
|
| /external/c-ares/ |
| D | ares_llist.c | 46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list() argument
48 new_node->next = old_node; in ares__insert_in_list()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
|
| /external/selinux/libsepol/src/ |
| D | node_record.c | 594 sepol_node_t *new_node = NULL; in hidden_def() local
595 if (sepol_node_create(handle, &new_node) < 0) in hidden_def()
599 new_node->addr = malloc(node->addr_sz); in hidden_def()
600 new_node->mask = malloc(node->mask_sz); in hidden_def()
601 if (!new_node->addr || !new_node->mask) in hidden_def()
604 memcpy(new_node->addr, node->addr, node->addr_sz); in hidden_def()
605 memcpy(new_node->mask, node->mask, node->mask_sz); in hidden_def()
606 new_node->addr_sz = node->addr_sz; in hidden_def()
607 new_node->mask_sz = node->mask_sz; in hidden_def()
608 new_node->proto = node->proto; in hidden_def()
[all …]
|
| D | conditional.c | 143 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 …]
|
| D | link.c | 1550 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/v8/src/interpreter/ |
| D | bytecode-peephole-optimizer.cc | 195 BytecodeNode new_node(BytecodeNode::Nop(node->source_info())); in ElideCurrentAction() local
196 DefaultAction(&new_node); in ElideCurrentAction()
248 BytecodeNode new_node(TransformLdaSmiBinaryOpToBinaryOpWithSmi( in TransformLdaSmiBinaryOpToBinaryOpWithSmiAction() local
250 SetLast(&new_node); in TransformLdaSmiBinaryOpToBinaryOpWithSmiAction()
263 BytecodeNode new_node(TransformLdaZeroBinaryOpToBinaryOpWithZero( in TransformLdaZeroBinaryOpToBinaryOpWithZeroAction() local
265 SetLast(&new_node); in TransformLdaZeroBinaryOpToBinaryOpWithZeroAction()
276 BytecodeNode new_node(TransformEqualityWithNullOrUndefined( in TransformEqualityWithNullOrUndefinedAction() local
278 SetLast(&new_node); in TransformEqualityWithNullOrUndefinedAction()
|
| /external/python/cpython2/Lib/ |
| D | ast.py | 113 def copy_location(new_node, old_node): argument
119 if attr in old_node._attributes and attr in new_node._attributes \
121 setattr(new_node, attr, getattr(old_node, attr))
122 return new_node
306 new_node = self.visit(old_value)
307 if new_node is None:
310 setattr(node, field, new_node)
|
| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 118 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/v8/testing/gtest/samples/ |
| D | sample3-inl.h | 117 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/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | sample3-inl.h | 117 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/googletest/googletest/samples/ |
| D | sample3-inl.h | 117 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/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 117 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/libmojo/third_party/jinja2/ |
| D | visitor.py | 73 new_node = self.visit(old_value, *args, **kwargs)
74 if new_node is None:
77 setattr(node, field, new_node)
|
| /external/chromium-trace/catapult/systrace/profile_chrome/third_party/ |
| D | perf_to_tracing.py | 185 new_node = StackFrameNode(next_stack_id, call[0], call[1])
187 new_node.parent_id = stack_frame.stack_id
188 stack_frame.children[call] = new_node
189 stack_frame = new_node
|
| /external/dtc/ |
| D | livetree.c | 137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
146 for_each_label_withdel(new_node->labels, l) in merge_nodes()
151 while (new_node->proplist) { in merge_nodes()
153 new_prop = new_node->proplist; in merge_nodes()
154 new_node->proplist = new_prop->next; in merge_nodes()
185 while (new_node->children) { in merge_nodes()
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
214 free(new_node); in merge_nodes()
219 void add_orphan_node(struct node *dt, struct node *new_node, char *ref) in add_orphan_node() argument
[all …]
|
| /external/valgrind/callgrind/ |
| D | clo.c | 221 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/ |
| D | cmockery.c | 118 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/mesa3d/src/util/ |
| D | ralloc.c | 636 linear_header *new_node; in linear_alloc_child() local
648 new_node = create_linear_node(latest->ralloc_parent, size); in linear_alloc_child()
649 if (unlikely(!new_node)) in linear_alloc_child()
652 first->latest = new_node; in linear_alloc_child()
653 latest->latest = new_node; in linear_alloc_child()
654 latest->next = new_node; in linear_alloc_child()
655 latest = new_node; in linear_alloc_child()
|
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/scripts/mako/ |
| D | _ast_util.py | 125 def copy_location(new_node, old_node): argument
131 if attr in old_node._attributes and attr in new_node._attributes \
133 setattr(new_node, attr, getattr(old_node, attr))
134 return new_node
343 new_node = self.visit(old_value)
344 if new_node is None:
347 setattr(node, field, new_node)
|