| /third_party/python/Lib/lib2to3/ |
| D | btm_utils.py | 111 new_node = None
121 new_node = reduce_tree(node.children[0], parent)
124 new_node = MinNode(type=TYPE_ALTERNATIVES)
129 reduced = reduce_tree(child, new_node)
131 new_node.children.append(reduced)
135 new_node = MinNode(type=TYPE_GROUP)
137 reduced = reduce_tree(child, new_node)
139 new_node.children.append(reduced)
140 if not new_node.children:
142 new_node = None
[all …]
|
| /third_party/node/deps/v8/src/compiler/backend/ |
| D | instruction-scheduler.cc | 111 ScheduleGraphNode* new_node = zone()->New<ScheduleGraphNode>(zone(), instr); in AddTerminator() local
115 node->AddSuccessor(new_node); in AddTerminator()
117 graph_.push_back(new_node); in AddTerminator()
131 ScheduleGraphNode* new_node = zone()->New<ScheduleGraphNode>(zone(), instr); in AddInstruction() local
138 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
140 last_live_in_reg_marker_ = new_node; in AddInstruction()
143 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
149 last_deopt_or_trap_->AddSuccessor(new_node); in AddInstruction()
156 last_side_effect_instr_->AddSuccessor(new_node); in AddInstruction()
159 load->AddSuccessor(new_node); in AddInstruction()
[all …]
|
| /third_party/python/Python/ |
| D | hamt.c | 351 PyHamtNode **new_node);
827 PyHamtNode_Array *new_node = NULL; in hamt_node_bitmap_assoc() local
831 new_node = (PyHamtNode_Array *)hamt_node_array_new(n + 1); in hamt_node_bitmap_assoc()
832 if (new_node == NULL) { in hamt_node_bitmap_assoc()
845 new_node->a_array[jdx] = hamt_node_assoc( in hamt_node_bitmap_assoc()
847 if (new_node->a_array[jdx] == NULL) { in hamt_node_bitmap_assoc()
859 assert(new_node->a_array[i] == NULL); in hamt_node_bitmap_assoc()
862 new_node->a_array[i] = in hamt_node_bitmap_assoc()
864 Py_INCREF(new_node->a_array[i]); in hamt_node_bitmap_assoc()
872 new_node->a_array[i] = hamt_node_assoc( in hamt_node_bitmap_assoc()
[all …]
|
| /third_party/selinux/libselinux/src/ |
| D | ignore_path.c | 32 ignore_path_node_t *new_node = malloc(sizeof(ignore_path_node_t)); in insert_ignore_path() local
33 if (new_node == NULL) { in insert_ignore_path()
36 new_node->path = strdup(line); in insert_ignore_path()
37 if (new_node->path == NULL) { in insert_ignore_path()
38 free(new_node); in insert_ignore_path()
41 new_node->next = *paths_ptr; in insert_ignore_path()
42 *paths_ptr = new_node; in insert_ignore_path()
43 return new_node; in insert_ignore_path()
101 ignore_path_node_t *new_node = insert_ignore_path(info.paths_ptr, line); in load_ignore_cfg_from_file() local
102 if (new_node == NULL) { in load_ignore_cfg_from_file()
|
| D | selinux_restorecon.c | 806 struct dir_hash_node **new_node, in check_context_match_for_dir() argument
814 if (!new_node) in check_context_match_for_dir()
817 *new_node = NULL; in check_context_match_for_dir()
830 *new_node = calloc(1, sizeof(struct dir_hash_node)); in check_context_match_for_dir()
832 if (!*new_node) in check_context_match_for_dir()
835 (*new_node)->path = strdup(pathname); in check_context_match_for_dir()
837 if (!(*new_node)->path) { in check_context_match_for_dir()
838 free(*new_node); in check_context_match_for_dir()
839 *new_node = NULL; in check_context_match_for_dir()
842 memcpy((*new_node)->digest, calculated_digest, digest_len); in check_context_match_for_dir()
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 217 struct cil_tree_node *new_node = cil_malloc(sizeof(*new_node)); in cil_tree_node_init() local
218 new_node->cl_head = NULL; in cil_tree_node_init()
219 new_node->cl_tail = NULL; in cil_tree_node_init()
220 new_node->parent = NULL; in cil_tree_node_init()
221 new_node->data = NULL; in cil_tree_node_init()
222 new_node->next = NULL; in cil_tree_node_init()
223 new_node->flavor = CIL_ROOT; in cil_tree_node_init()
224 new_node->line = 0; in cil_tree_node_init()
225 new_node->hll_offset = 0; in cil_tree_node_init()
227 *node = new_node; in cil_tree_node_init()
|
| /third_party/selinux/libsepol/src/ |
| D | node_record.c | 577 sepol_node_t *new_node = NULL; in sepol_node_clone() local
578 if (sepol_node_create(handle, &new_node) < 0) in sepol_node_clone()
582 new_node->addr = malloc(node->addr_sz); in sepol_node_clone()
583 new_node->mask = malloc(node->mask_sz); in sepol_node_clone()
584 if (!new_node->addr || !new_node->mask) in sepol_node_clone()
587 memcpy(new_node->addr, node->addr, node->addr_sz); in sepol_node_clone()
588 memcpy(new_node->mask, node->mask, node->mask_sz); in sepol_node_clone()
589 new_node->addr_sz = node->addr_sz; in sepol_node_clone()
590 new_node->mask_sz = node->mask_sz; in sepol_node_clone()
591 new_node->proto = node->proto; in sepol_node_clone()
[all …]
|
| D | conditional.c | 144 cond_node_t *new_node; in cond_node_create() local
147 new_node = (cond_node_t *)malloc(sizeof(cond_node_t)); in cond_node_create()
148 if (!new_node) { in cond_node_create()
151 memset(new_node, 0, sizeof(cond_node_t)); in cond_node_create()
154 new_node->expr = cond_copy_expr(node->expr); in cond_node_create()
155 if (!new_node->expr) { in cond_node_create()
156 free(new_node); in cond_node_create()
159 new_node->cur_state = cond_evaluate_expr(p, new_node->expr); in cond_node_create()
160 new_node->nbools = node->nbools; in cond_node_create()
162 new_node->bool_ids[i] = node->bool_ids[i]; in cond_node_create()
[all …]
|
| /third_party/spirv-tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
243 void SENodeSimplifyImpl::GatherAccumulatorsFromChildNodes(SENode* new_node, in GatherAccumulatorsFromChildNodes() argument
269 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
274 GatherAccumulatorsFromChildNodes(new_node, next_child, negation); in GatherAccumulatorsFromChildNodes()
279 GatherAccumulatorsFromChildNodes(new_node, negated_node, !negation); in GatherAccumulatorsFromChildNodes()
283 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
374 std::unique_ptr<SEAddNode> new_node{new SEAddNode(&analysis_)}; in FoldRecurrentAddExpressions() local
402 new_node->AddChild(child); in FoldRecurrentAddExpressions()
448 new_node->AddChild(analysis_.GetCachedOrAdd(std::move(new_recurrent))); in FoldRecurrentAddExpressions()
452 if (new_node->GetChildren().size() == 1) { in FoldRecurrentAddExpressions()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
243 void SENodeSimplifyImpl::GatherAccumulatorsFromChildNodes(SENode* new_node, in GatherAccumulatorsFromChildNodes() argument
269 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
274 GatherAccumulatorsFromChildNodes(new_node, next_child, negation); in GatherAccumulatorsFromChildNodes()
279 GatherAccumulatorsFromChildNodes(new_node, negated_node, !negation); in GatherAccumulatorsFromChildNodes()
283 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
374 std::unique_ptr<SEAddNode> new_node{new SEAddNode(&analysis_)}; in FoldRecurrentAddExpressions() local
402 new_node->AddChild(child); in FoldRecurrentAddExpressions()
448 new_node->AddChild(analysis_.GetCachedOrAdd(std::move(new_recurrent))); in FoldRecurrentAddExpressions()
452 if (new_node->GetChildren().size() == 1) { in FoldRecurrentAddExpressions()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | scalar_analysis_simplification.cpp | 95 void GatherAccumulatorsFromChildNodes(SENode* new_node, SENode* child,
243 void SENodeSimplifyImpl::GatherAccumulatorsFromChildNodes(SENode* new_node, in GatherAccumulatorsFromChildNodes() argument
269 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
274 GatherAccumulatorsFromChildNodes(new_node, next_child, negation); in GatherAccumulatorsFromChildNodes()
279 GatherAccumulatorsFromChildNodes(new_node, negated_node, !negation); in GatherAccumulatorsFromChildNodes()
283 new_node->AddChild(child); in GatherAccumulatorsFromChildNodes()
374 std::unique_ptr<SEAddNode> new_node{new SEAddNode(&analysis_)}; in FoldRecurrentAddExpressions() local
402 new_node->AddChild(child); in FoldRecurrentAddExpressions()
448 new_node->AddChild(analysis_.GetCachedOrAdd(std::move(new_recurrent))); in FoldRecurrentAddExpressions()
452 if (new_node->GetChildren().size() == 1) { in FoldRecurrentAddExpressions()
[all …]
|
| /third_party/node/deps/v8/src/compiler/ |
| D | node-observer.cc | 35 const Node* new_node) { in OnNodeChanged() argument
39 ObservableNodeState new_state{new_node, zone_}; in OnNodeChanged()
47 observation->observer->OnNodeChanged(reducer_name, new_node, old_state); in OnNodeChanged()
52 if (old_node != new_node) { in OnNodeChanged()
54 observations_[new_node->id()] = observation; in OnNodeChanged()
|
| D | escape-analysis-reducer.cc | 160 NodeHashCache::Constructor new_node(&node_cache_, node); in ReduceDeoptState() local
171 new_node.ReplaceInput(ReduceDeoptState(input, effect, deduplicator), in ReduceDeoptState()
174 return new_node.Get(); in ReduceDeoptState()
176 NodeHashCache::Constructor new_node(&node_cache_, node); in ReduceDeoptState() local
179 new_node.ReplaceValueInput(ReduceDeoptState(input, effect, deduplicator), in ReduceDeoptState()
182 return new_node.Get(); in ReduceDeoptState()
199 NodeHashCache::Constructor new_node( in ReduceDeoptState() local
203 return new_node.Get(); in ReduceDeoptState()
|
| /third_party/jerryscript/jerry-core/api/ |
| D | generate-bytecode.c | 310 dir_node *new_node = NULL; in add_directory_to_pending_list() local
311 if ((new_node = (dir_node*)OhosMalloc(MEM_TYPE_JERRY, sizeof(dir_node))) == NULL) { in add_directory_to_pending_list()
317 new_node->dir_name = input_file_path; in add_directory_to_pending_list()
318 new_node->next = NULL; in add_directory_to_pending_list()
319 (*end)->next = new_node; in add_directory_to_pending_list()
320 *end = new_node; in add_directory_to_pending_list()
321 new_node = NULL; in add_directory_to_pending_list()
525 dir_node *head, *curr, *end, *new_node; in walk_del_bytecode() local
588 if ((new_node = (dir_node*)OhosMalloc(MEM_TYPE_JERRY, sizeof(dir_node))) == NULL) { in walk_del_bytecode()
598 new_node->dir_name = input_file_path; in walk_del_bytecode()
[all …]
|
| /third_party/musl/libc-test/src/functionalext/queue/ |
| D | sys_queue.c | 38 struct Node *new_node = (struct Node*)malloc(sizeof(struct Node)); in insert_node() local
39 EXPECT_PTRNE("insert_node", new_node, NULL); in insert_node()
40 new_node->data = data; in insert_node()
41 LIST_INSERT_HEAD(&head, new_node, entries); in insert_node()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 218 int new_node = next_node++; in TEST() local
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
221 id[new_node] = new_gnode; in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
223 nodes.push_back(new_node); in TEST()
321 int new_node = next_node++; in TEST() local
322 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
324 id[new_node] = new_gnode; in TEST()
325 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
327 ASSERT_NE(node, new_node); in TEST()
[all …]
|
| /third_party/nghttp2/src/ |
| D | shrpx_router.cc | 57 void add_next_node(RNode *node, std::unique_ptr<RNode> new_node) { in add_next_node() argument
59 new_node->s[0], in add_next_node()
62 node->next.insert(itr, std::move(new_node)); in add_next_node()
69 auto new_node = in add_node() local
71 add_next_node(node, std::move(new_node)); in add_node()
134 auto new_node = std::make_unique<RNode>( in add_route() local
136 std::swap(node->next, new_node->next); in add_route()
142 add_next_node(node, std::move(new_node)); in add_route()
|
| /third_party/googletest/googletest/samples/ |
| D | sample3-inl.h | 115 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
118 head_ = last_ = new_node; in Enqueue()
121 last_->next_ = new_node; in Enqueue()
122 last_ = new_node; in Enqueue()
|
| /third_party/node/tools/gyp/tools/ |
| D | pretty_vcproj.py | 199 for new_node in node_array:
201 if new_node.nodeName == "Tool":
202 if new_node.attributes and new_node.attributes.length == 1:
205 if new_node.nodeName == "UserMacro":
207 node.appendChild(new_node)
|
| /third_party/ffmpeg/libavcodec/ |
| D | mvha.c | 105 int new_node = j; in build_vlc() local
113 int val = nodes[new_node].count; in build_vlc()
116 first_node = new_node; in build_vlc()
119 second_node = new_node; in build_vlc()
122 new_node += 1; in build_vlc()
123 } while (new_node != cur_node); in build_vlc()
|
| /third_party/NuttX/fs/vfs/ |
| D | fs_poll.c | 186 poll_wait_node *new_node = get_poll_item(wait); in add_pollwait_queue() local
187 if (new_node != NULL) in add_pollwait_queue()
189 new_node->entry = wait; in add_pollwait_queue()
190 new_node->key = p->key; in add_pollwait_queue()
191 new_node->wait_queue = queue; in add_pollwait_queue()
193 LOS_ListAdd(&queue->poll_queue, &new_node->queue_node); in add_pollwait_queue()
|
| /third_party/skia/third_party/externals/jinja2/ |
| D | visitor.py | 67 new_node = self.visit(old_value, *args, **kwargs)
68 if new_node is None:
71 setattr(node, field, new_node)
|
| /third_party/node/deps/v8/third_party/jinja2/ |
| D | visitor.py | 67 new_node = self.visit(old_value, *args, **kwargs)
68 if new_node is None:
71 setattr(node, field, new_node)
|
| /third_party/node/tools/inspector_protocol/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)
|
| /third_party/jinja2/ |
| D | visitor.py | 76 new_node = self.visit(old_value, *args, **kwargs)
77 if new_node is None:
80 setattr(node, field, new_node)
|