Home
last modified time | relevance | path

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

12345

/external/antlr/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/python/cpython3/Lib/lib2to3/
Dbtm_utils.py111 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 …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dmap_and_batch_fusion.cc38 NodeDef new_node; in MakeMapAndBatchNode() local
39 new_node.set_op(kFusedOpName); in MakeMapAndBatchNode()
40 graph_utils::SetUniqueGraphNodeName(kFusedOpName, graph->graph(), &new_node); in MakeMapAndBatchNode()
43 new_node.add_input(map_node.input(0)); in MakeMapAndBatchNode()
53 new_node.add_input(map_node.input(i + 1)); in MakeMapAndBatchNode()
57 new_node.add_input(batch_node.input(1)); in MakeMapAndBatchNode()
67 new_node.add_input(tmp->name()); in MakeMapAndBatchNode()
70 new_node.add_input(tmp->name()); in MakeMapAndBatchNode()
75 new_node.add_input(batch_node.input(2)); in MakeMapAndBatchNode()
78 new_node.add_input(tmp->name()); in MakeMapAndBatchNode()
[all …]
Dshuffle_and_repeat_fusion.cc46 NodeDef new_node; in OptimizeAndCollectStats() local
47 new_node.set_op(kFusedOpName); in OptimizeAndCollectStats()
48 graph_utils::SetUniqueGraphNodeName(kFusedOpName, output, &new_node); in OptimizeAndCollectStats()
51 new_node.add_input(shuffle_node.input(0)); in OptimizeAndCollectStats()
54 new_node.add_input(shuffle_node.input(1)); in OptimizeAndCollectStats()
57 new_node.add_input(shuffle_node.input(2)); in OptimizeAndCollectStats()
60 new_node.add_input(shuffle_node.input(3)); in OptimizeAndCollectStats()
63 new_node.add_input(repeat_node.input(1)); in OptimizeAndCollectStats()
67 graph_utils::CopyAttribute(key, repeat_node, &new_node); in OptimizeAndCollectStats()
69 return new_node; in OptimizeAndCollectStats()
Dlatency_all_edges.cc38 NodeDef new_node; in MakeLatencyNode() local
39 new_node.set_op(kInsertOpName); in MakeLatencyNode()
41 graph->graph(), &new_node); in MakeLatencyNode()
43 new_node.add_input(node.name()); in MakeLatencyNode()
47 new_node.add_input(tag->name()); in MakeLatencyNode()
52 (*new_node.mutable_attr())[key] = node.attr().at(key); in MakeLatencyNode()
57 (*new_node.mutable_attr())[key] = in MakeLatencyNode()
62 return new_node; in MakeLatencyNode()
Dauto_shard.cc108 NodeDef new_node; in AddShardNode() local
109 new_node.set_op(kShardDatasetOpName); in AddShardNode()
111 &new_node); in AddShardNode()
119 new_node.add_input(add_before.input(0)); in AddShardNode()
120 new_node.add_input(num_shards_node->name()); in AddShardNode()
121 new_node.add_input(index_node->name()); in AddShardNode()
125 graph_utils::CopyAttribute("output_shapes", *add_after, &new_node); in AddShardNode()
128 (*(new_node.mutable_attr()))["output_types"] = in AddShardNode()
131 graph_utils::CopyAttribute("output_types", *add_after, &new_node); in AddShardNode()
135 NodeDef* new_node_graph = graph->AddNode(std::move(new_node)); in AddShardNode()
/external/python/cpython2/Lib/lib2to3/
Dbtm_utils.py112 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/
Drbt.c285 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/
Dinstruction-scheduler.cc119 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr); in AddTerminator() local
123 node->AddSuccessor(new_node); in AddTerminator()
125 graph_.push_back(new_node); in AddTerminator()
129 ScheduleGraphNode* new_node = new (zone()) ScheduleGraphNode(zone(), instr); in AddInstruction() local
137 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
139 last_live_in_reg_marker_ = new_node; in AddInstruction()
142 last_live_in_reg_marker_->AddSuccessor(new_node); in AddInstruction()
148 last_deopt_or_trap_->AddSuccessor(new_node); in AddInstruction()
155 last_side_effect_instr_->AddSuccessor(new_node); in AddInstruction()
158 load->AddSuccessor(new_node); in AddInstruction()
[all …]
/external/tensorflow/tensorflow/contrib/framework/python/framework/
Dgraph_util.py112 new_node = node_def_pb2.NodeDef()
114 new_node.input.append(node)
115 new_node.attr["_output_types"].list.type[:] = output_dtypes
116 new_node.attr["_output_quantized"].b = output_quantized
117 new_node.op = op_type
118 new_node.name = op_name
119 out.node.extend([new_node])
124 new_node = copy.deepcopy(name_to_node[n])
125 del new_node.input[:]
126 new_node.input.append(op_name + (":" + str(index) if index != 0 else ""))
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dmodel_pruner.cc129 bool add_as_control, NodeDef* new_node, in ForwardInputsInternal() argument
137 *new_node->add_input() = in ForwardInputsInternal()
146 *new_node->add_input() = in ForwardInputsInternal()
152 add_as_control || IsControlInput(input), new_node, in ForwardInputsInternal()
155 *new_node->add_input() = in ForwardInputsInternal()
163 NodeDef* new_node, in ForwardInputs() argument
168 /*add_as_control=*/false, new_node, *optimized_nodes, in ForwardInputs()
170 if (!new_node->name().empty()) { in ForwardInputs()
171 (*optimized_nodes)[new_node->name()] = new_node; in ForwardInputs()
175 for (int i = 0; i < new_node->input_size(); ++i) { in ForwardInputs()
[all …]
Dauto_parallel.cc207 auto new_node = graph->add_node(); in AddSharedNodes() local
208 *new_node = *all_nodes_[node]; in AddSharedNodes()
209 for (int i = 0; i < new_node->input_size(); i++) { in AddSharedNodes()
210 if (NotSharedNode(NodeName(new_node->input(i)))) { in AddSharedNodes()
211 string new_name = AddPrefixToNodeName(new_node->input(i), prefix); in AddSharedNodes()
212 *new_node->mutable_input(i) = new_name; in AddSharedNodes()
221 auto new_node = graph->add_node(); in AddOneReplica() local
222 *new_node = *all_nodes_[node]; in AddOneReplica()
223 if (NotSharedNode(new_node->name())) { in AddOneReplica()
224 new_node->set_name(AddPrefixToNodeName(new_node->name(), prefix)); in AddOneReplica()
[all …]
Dgraph_optimizer_stage.cc79 NodeDef* new_node = ctx.optimized_graph->add_node(); in AddCopyNode() local
80 *new_node = *node_to_copy; in AddCopyNode()
81 new_node->set_name(name); in AddCopyNode()
82 ctx.node_map->AddNode(name, new_node); in AddCopyNode()
83 return new_node; in AddCopyNode()
89 NodeDef* new_node = ctx.optimized_graph->add_node(); in AddEmptyNode() local
90 new_node->set_name(name); in AddEmptyNode()
91 ctx.node_map->AddNode(name, new_node); in AddEmptyNode()
92 return new_node; in AddEmptyNode()
/external/python/cpython3/Python/
Dhamt.c350 PyHamtNode **new_node);
845 PyHamtNode_Array *new_node = NULL; in hamt_node_bitmap_assoc() local
849 new_node = (PyHamtNode_Array *)hamt_node_array_new(n + 1); in hamt_node_bitmap_assoc()
850 if (new_node == NULL) { in hamt_node_bitmap_assoc()
863 new_node->a_array[jdx] = hamt_node_assoc( in hamt_node_bitmap_assoc()
865 if (new_node->a_array[jdx] == NULL) { in hamt_node_bitmap_assoc()
877 assert(new_node->a_array[i] == NULL); in hamt_node_bitmap_assoc()
880 new_node->a_array[i] = in hamt_node_bitmap_assoc()
882 Py_INCREF(new_node->a_array[i]); in hamt_node_bitmap_assoc()
890 new_node->a_array[i] = hamt_node_assoc( in hamt_node_bitmap_assoc()
[all …]
/external/libaom/libaom/common/
Dwarnings.c40 struct WarningListNode *new_node = malloc(sizeof(*new_node)); in add_warning() local
41 if (new_node == NULL) { in add_warning()
45 new_node->warning_string = warning_string; in add_warning()
46 new_node->next_warning = NULL; in add_warning()
50 *node = new_node; in add_warning()
/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()
52 *node = new_node; in add_warning()
/external/compiler-rt/lib/profile/
DGCDAProfiling.c502 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/tensorflow/tensorflow/lite/toco/tensorflow_graph_matching/
Dresolve_cluster.cc37 NodeDef* new_node = graph->add_node(); in AddNodeToGraph() local
38 new_node->set_op(node.op()); in AddNodeToGraph()
39 new_node->set_name(node.name()); in AddNodeToGraph()
40 new_node->set_device(node.device()); in AddNodeToGraph()
49 new_node->add_input(cluster_name); in AddNodeToGraph()
55 new_node->add_input(node_input); in AddNodeToGraph()
59 (*new_node->mutable_attr())[attr.first] = attr.second; in AddNodeToGraph()
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles_test.cc230 int new_node = graph_cycles.NewNode(); in TEST() local
231 ASSERT_NE(-1, new_node); in TEST()
232 VLOG(1) << "adding node " << new_node; in TEST()
233 ASSERT_EQ(nullptr, graph_cycles.GetNodeData(new_node)); in TEST()
235 new_node, reinterpret_cast<void *>( in TEST()
236 static_cast<intptr_t>(new_node + kDataOffset))); in TEST()
237 ASSERT_GE(new_node, 0); in TEST()
239 ASSERT_NE(nodes[i], new_node); in TEST()
241 nodes.push_back(new_node); in TEST()
342 int new_node = graph_cycles.NewNode(); in TEST() local
[all …]
/external/libhevc/encoder/
Dhme_defs.h525 as_nodes, num_nodes, new_node, au4_map, center_x, center_y, use_hashing) \ argument
530 delta_x = (new_node).ps_mv->i2_mvx - (center_x); \
531 delta_y = (new_node).ps_mv->i2_mvy - (center_y); \
540 (new_node).s_mv = (new_node).ps_mv[0]; \
541 (as_nodes)[(num_nodes)] = (new_node); \
552 if(((as_nodes)[k].s_mv.i2_mvx == (new_node).ps_mv->i2_mvx) && \
553 ((as_nodes)[k].s_mv.i2_mvy == (new_node).ps_mv->i2_mvy) && \
554 ((as_nodes)[k].i1_ref_idx == (new_node).i1_ref_idx)) \
563 (new_node).s_mv = (new_node).ps_mv[0]; \
564 (as_nodes)[k] = (new_node); \
[all …]
/external/grpc-grpc/src/core/lib/avl/
Davl.cc82 grpc_avl_node* new_node(void* key, void* value, grpc_avl_node* left, in new_node() function
129 grpc_avl_node* n = new_node(vtable->copy_key(right->key, user_data), in rotate_left()
131 new_node(key, value, left, ref_node(right->left)), in rotate_left()
141 new_node(vtable->copy_key(left->key, user_data), in rotate_right()
143 new_node(key, value, ref_node(left->right), right)); in rotate_right()
154 new_node(vtable->copy_key(left->right->key, user_data), in rotate_left_right()
156 new_node(vtable->copy_key(left->key, user_data), in rotate_left_right()
159 new_node(key, value, ref_node(left->right->right), right)); in rotate_left_right()
170 new_node(vtable->copy_key(right->left->key, user_data), in rotate_right_left()
172 new_node(key, value, left, ref_node(right->left->left)), in rotate_right_left()
[all …]
/external/tensorflow/tensorflow/core/grappler/clusters/
Dsingle_machine.cc407 auto* new_node = graph_costs->add_node(); in MergeCosts() local
408 new_node->MergeFrom(node); in MergeCosts()
410 new_node->set_id(node.id() + queue_costs_id_offset); in MergeCosts()
411 if (new_node->id() >= init_costs_id_offset) { in MergeCosts()
412 init_costs_id_offset = new_node->id() + 1; in MergeCosts()
415 for (auto& input_info : *new_node->mutable_input_info()) { in MergeCosts()
419 for (auto& control_input : *new_node->mutable_control_input()) { in MergeCosts()
431 auto* new_node = graph_costs->add_node(); in MergeCosts() local
432 new_node->MergeFrom(node); in MergeCosts()
434 new_node->set_id(node.id() + init_costs_id_offset); in MergeCosts()
[all …]
/external/toolchain-utils/binary_search_tool/full_bisect_test/
Dstack.c21 struct stack_struct *new_node = (struct stack_struct *) malloc (sizeof (struct stack_struct *)); in push() local
22 new_node->data = value; in push()
23 new_node->next = *stack; in push()
24 *stack = new_node; in push()
/external/tensorflow/tensorflow/tools/graph_transforms/
Dremove_control_dependencies.cc31 NodeDef* new_node = output_graph_def->mutable_node()->Add(); in RemoveControlDependencies() local
32 *new_node = node; in RemoveControlDependencies()
33 new_node->clear_input(); in RemoveControlDependencies()
36 new_node->add_input(input); in RemoveControlDependencies()
/external/selinux/libsepol/src/
Dnode_record.c594 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 …]

12345