Home
last modified time | relevance | path

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

1234567

/external/v8/src/compiler/
Draw-machine-assembler.h99 return AddNode(common()->Int32Constant(value)); in Int32Constant()
102 return AddNode(machine()->StackSlot(rep, alignment));
105 return AddNode(common()->Int64Constant(value)); in Int64Constant()
108 return AddNode(common()->NumberConstant(value)); in NumberConstant()
111 return AddNode(common()->Float32Constant(value)); in Float32Constant()
114 return AddNode(common()->Float64Constant(value)); in Float64Constant()
117 return AddNode(common()->HeapConstant(object)); in HeapConstant()
120 return AddNode(common()->ExternalConstant(address)); in ExternalConstant()
123 return AddNode(common()->RelocatableInt32Constant(value, rmode)); in RelocatableInt32Constant()
126 return AddNode(common()->RelocatableInt64Constant(value, rmode)); in RelocatableInt64Constant()
[all …]
Dgraph-assembler.cc25 Node* AddNode(Node* node);
26 Node* AddNode(Node* node, BasicBlock* to);
108 Node* GraphAssembler::BasicBlockUpdater::AddNode(Node* node) { in AddNode() function in v8::internal::compiler::GraphAssembler::BasicBlockUpdater
109 return AddNode(node, current_block_); in AddNode()
112 Node* GraphAssembler::BasicBlockUpdater::AddNode(Node* node, BasicBlock* to) { in AddNode() function in v8::internal::compiler::GraphAssembler::BasicBlockUpdater
126 schedule_->AddNode(to, node); in AddNode()
142 return AddNode(node); in AddClonedNode()
146 return AddNode(graph_->CloneNode(node)); in AddClonedNode()
367 return AddNode(graph()->NewNode( in UniqueIntPtrConstant()
404 return AddNode( in Parameter()
[all …]
Draw-machine-assembler.cc39 target_parameter_ = AddNode( in RawMachineAssembler()
44 AddNode(common()->Parameter(static_cast<int>(i)), graph->start()); in RawMachineAssembler()
86 return AddNode( in OptimizedAllocate()
151 schedule->AddNode(block, node); in OptimizeControlFlow()
205 new_true_block->AddNode( in OptimizeControlFlow()
207 new_false_block->AddNode( in OptimizeControlFlow()
552 true_block->AddNode(MakeNode(common()->IfTrue(), 1, &branch)); in Branch()
555 false_block->AddNode(MakeNode(common()->IfFalse(), 1, &branch)); in Branch()
582 schedule()->AddNode(case_block, case_node); in Switch()
588 schedule()->AddNode(default_block, default_node); in Switch()
[all …]
Dscheduled-machine-lowering.cc53 gasm()->AddNode(replacement); in Run()
56 gasm()->AddNode(node); in Run()
Dgraph-assembler.h397 Node* AddNode(Node* node);
400 TNode<T> AddNode(Node* node) { in AddNode() function
401 return TNode<T>::UncheckedCast(AddNode(node)); in AddNode()
565 AddNode(graph()->NewNode(common()->LoopExit(), control(), in MergeState()
567 AddNode(graph()->NewNode(common()->LoopExitEffect(), effect(), control())); in MergeState()
569 var_array[i] = AddNode( in MergeState()
667 AddNode(label->control_); in Bind()
668 AddNode(label->effect_); in Bind()
670 AddNode(label->bindings_[i]); in Bind()
675 control_ = AddNode(graph()->NewNode(common()->Merge(1), control())); in Bind()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dshape_refiner_test.cc85 TF_ASSERT_OK(m.AddNode(placeholder.node())); in TestStridedSlice()
86 TF_ASSERT_OK(m.AddNode(input.node())); in TestStridedSlice()
87 TF_ASSERT_OK(m.AddNode(begin_op.node())); in TestStridedSlice()
88 TF_ASSERT_OK(m.AddNode(end_op.node())); in TestStridedSlice()
89 TF_ASSERT_OK(m.AddNode(stride_op.node())); in TestStridedSlice()
90 TF_ASSERT_OK(m.AddNode(slice.node())); in TestStridedSlice()
91 TF_ASSERT_OK(m.AddNode(result)); in TestStridedSlice()
130 TF_ASSERT_OK(m.AddNode(c.node())); in TEST_F()
143 TF_ASSERT_OK(m.AddNode(a.node())); in TEST_F()
144 TF_ASSERT_OK(m.AddNode(b.node())); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dgraph_utils_test.cc154 AddNode("A", "OpA", {}, {}, &graph_a); in TEST()
155 AddNode("B", "OpB", {"A"}, {}, &graph_a); in TEST()
167 AddNode("A", "OpA", {}, {}, &graph); in TEST()
189 AddNode("A", "OpA", {}, {}, &graph); in TEST()
201 AddNode("A", "OpA", {}, {}, &graph); in TEST()
223 AddNode("A", "OpA", {}, {}, &graph); in TEST()
224 AddNode("B", "OpB", {"A"}, {}, &graph); in TEST()
225 AddNode("A2", "OpA", {"A"}, {}, &graph); in TEST()
238 AddNode("A", "OpA", {}, {}, &graph); in TEST()
239 AddNode("B", "OpB", {"A"}, {}, &graph); in TEST()
[all …]
Dmap_and_batch_fusion_test.cc41 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
59 graph_utils::AddNode("", "MapDataset", map_inputs, map_attrs, &graph); in TEST()
75 batch_node = graph_utils::AddNode("", "BatchDataset", batch_inputs, in TEST()
123 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
141 graph_utils::AddNode("", "MapDataset", map_inputs, map_attrs, &graph); in TEST()
160 batch_node = graph_utils::AddNode("", "BatchDatasetV2", batch_inputs, in TEST()
206 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
226 map_node = graph_utils::AddNode("", "ParallelMapDataset", map_inputs, in TEST()
243 batch_node = graph_utils::AddNode("", "BatchDataset", batch_inputs, in TEST()
292 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
[all …]
Dshuffle_and_repeat_fusion_test.cc48 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
60 NodeDef *shuffle_node = graph_utils::AddNode( in TEST()
67 NodeDef *repeat_node = graph_utils::AddNode( in TEST()
116 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
123 graph_utils::AddNode("", "RepeatDataset", repeat_inputs, common_attrs, in TEST()
Dslack_test.cc50 NodeDef *range_node = graph_utils::AddNode( in SetupGrapplerItem()
54 NodeDef *prefetch_node = graph_utils::AddNode( in SetupGrapplerItem()
130 function_utils::AddNode("TensorDataset", "TensorDataset", {"args_0"}, in TEST()
134 NodeDef *prefetch_node = function_utils::AddNode( in TEST()
143 NodeDef *identity_node = function_utils::AddNode( in TEST()
Dhoist_random_uniform.cc255 graph.AddNode(MakeRandomDataset(*random_uniform_op, &graph)); in OptimizeAndCollectStats()
258 graph.AddNode(MakeBatchTwo(*random_seed_dataset, &graph)); in OptimizeAndCollectStats()
263 graph.AddNode(MakeZipNode(parent_node, *batch_dataset, &graph)); in OptimizeAndCollectStats()
269 const auto* stateless_map = graph.AddNode( in OptimizeAndCollectStats()
Dfunction_utils_test.cc49 AddNode("X", "Some_Op", {"MapDefun:output:0"}, {}, &outer); in TEST()
141 AddNode(op_name, op_name, {}, {}, &func); in TEST()
149 AddNode("", op_name, inputs, {}, &func); in TEST()
164 AddNode("", op_name, {}, attrs, &func); in TEST()
800 NodeDef* nodeA = graph_utils::AddNode("", "A", {}, {}, &graph); in TEST()
Dnoop_elimination_test.cc41 return graph_utils::AddNode("", node_type, in MakeUnaryNode()
49 return graph_utils::AddNode("", node_type, in MakeUnaryNonConstNode()
57 return graph_utils::AddNode("", "CacheDataset", in MakeCacheNode()
70 return graph_utils::AddNode("", "RangeDataset", range_inputs, in MakeRangeNode()
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler_test.cc72 manager.AddNode(&node1_); in TEST_F()
79 manager.AddNode(&node1_); in TEST_F()
90 manager.AddNode(&node1_); in TEST_F()
91 manager.AddNode(&node2_); in TEST_F()
92 manager.AddNode(&node3_); in TEST_F()
93 manager.AddNode(&node4_); in TEST_F()
111 manager.AddNode(&node1_); in TEST_F()
112 manager.AddNode(&node2_); in TEST_F()
113 manager.AddNode(&node3_); in TEST_F()
114 manager.AddNode(&node4_); in TEST_F()
[all …]
Dvirtual_scheduler.h162 virtual void AddNode(const NodeDef* node) = 0;
172 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode() function
192 void AddNode(const NodeDef* node) override { nodes_.push_back(node); } in AddNode() function
215 void AddNode(const NodeDef* node) override { waiting_queue_.push_back(node); } in AddNode() function
259 void AddNode(const NodeDef* node) override;
286 void AddNode(const NodeDef* node) override;
/external/tensorflow/tensorflow/lite/
Dgraph_info_test.cc37 for (int i = 0; i < node_index_offset; ++i) AddNode({}, {}); in SimpleTestGraph()
62 void AddNode(const std::vector<int>& inputs, in AddNode() function in tflite::__anon351e2d8d0111::SimpleTestGraph
145 graph.AddNode({0}, {1}); in TEST()
163 graph.AddNode({0}, {1}); in TEST()
183 graph.AddNode({}, {0}); in TEST()
203 graph.AddNode({0}, {1}); in TEST()
225 graph.AddNode({0}, {1}); in TEST()
226 graph.AddNode({1}, {2}); in TEST()
253 graph.AddNode({0}, {1}); in TEST()
254 graph.AddNode({1}, {2}); in TEST()
[all …]
/external/libchrome/mojo/core/ports/
Dports_unittest.cc301 void AddNode(TestNode* node) { in AddNode() function in mojo::core::ports::test::__anon8292b8ce0111::PortsTest
414 AddNode(&node0); in TEST_F()
417 AddNode(&node1); in TEST_F()
438 AddNode(&node0); in TEST_F()
441 AddNode(&node1); in TEST_F()
464 AddNode(&node0); in TEST_F()
467 AddNode(&node1); in TEST_F()
498 AddNode(&node0); in TEST_F()
501 AddNode(&node1); in TEST_F()
531 AddNode(&node0); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/graph/
Dsubgraph.h59 virtual Status AddNode(Graph* g, NodeBuilder::NodeOut tensor,
125 Status AddNode(Graph* g, NodeBuilder::NodeOut feed_tensor,
136 Status AddNode(Graph* g, NodeBuilder::NodeOut feed_tensor,
146 Status AddNode(Graph* g, NodeBuilder::NodeOut fetch_tensor,
158 Status AddNode(Graph* g, NodeBuilder::NodeOut fetch_tensor,
Dsubgraph.cc80 feed_rewrites[i]->AddNode(g, {n, id.second}, &feed_node)); in FeedInputs()
162 fetch_rewrites[i]->AddNode(g, {n, id.second}, &fetch_node)); in FetchOutputs()
220 Status ArgFeedRewrite::AddNode(Graph* g, NodeBuilder::NodeOut feed_tensor, in AddNode() function in tensorflow::subgraph::ArgFeedRewrite
237 Status RecvFeedRewrite::AddNode(Graph* g, NodeBuilder::NodeOut feed_tensor, in AddNode() function in tensorflow::subgraph::RecvFeedRewrite
257 Status RetvalFetchRewrite::AddNode(Graph* g, NodeBuilder::NodeOut fetch_tensor, in AddNode() function in tensorflow::subgraph::RetvalFetchRewrite
276 Status SendFetchRewrite::AddNode(Graph* g, NodeBuilder::NodeOut fetch_tensor, in AddNode() function in tensorflow::subgraph::SendFetchRewrite
Dgradients.cc75 Node* read = g->AddNode(read_def, &s); in AddZerosLike()
83 Node* ret = g->AddNode(ndef, &s); in AddZerosLike()
94 Node* ret = g->AddNode(ndef, &s); in AddZerosLike()
146 Node* ret = g->AddNode(ndef, &s); in AddSymGrad()
326 Node* add = graph_->AddNode(ndef, &s); in SumGradients()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding_test.cc2018 AddNode("in1", "VariableV2", {}, {}, &want); in TEST_F()
2019 AddNode("in2", "VariableV2", {}, {}, &want); in TEST_F()
2020 AddNode("split_dim", "Const", {}, {}, &want); in TEST_F()
2021 AddNode("s1", "Identity", {"in1", AsControlDependency("split_dim")}, {}, in TEST_F()
2023 AddNode("s2", "Split", {"split_dim", "in2"}, {}, &want); in TEST_F()
2024 AddNode("out", "Add", {"s1", "s2"}, {}, &want); in TEST_F()
2064 AddNode("in1", "VariableV2", {}, {}, &want); in TEST_F()
2065 AddNode("in2", "VariableV2", {}, {}, &want); in TEST_F()
2066 AddNode("split_dim", "Const", {}, {}, &want); in TEST_F()
2067 AddNode("size_splits1", "Const", {}, {}, &want); in TEST_F()
[all …]
Dremapper.cc936 mutation->AddNode(std::move(fused_op), &status); in AddFusedContractionNode()
980 mutation->AddNode(std::move(fused_op), &status); in AddFusedContractionNode()
1027 mutation->AddNode(std::move(fused_conv2d), &status); in AddFusedConv2DNode()
1029 mutation->AddNode(std::move(remapped_squeeze), &status); in AddFusedConv2DNode()
1068 mutation->AddNode(std::move(fused_conv2d), &status); in AddFusedConv2DNode()
1111 mutation->AddNode(std::move(fused_conv2d), &status); in AddFusedConv2DNode()
1152 mutation->AddNode(std::move(fused_conv2d), &status); in AddFusedContractionNode()
1191 mutation->AddNode(std::move(fused_conv2d), &status); in AddFusedContractionNode()
1258 mutation->AddNode(std::move(fused_op), &status); in AddFusedBatchNormExNode()
1260 mutation->AddNode(std::move(identity_op), &status); in AddFusedBatchNormExNode()
[all …]
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp52 void AddNode(unsigned Idx) { in AddNode() function in llvm::Graph::NodeSubset
115 Nodes[FromIdx].second.AddNode(ToIdx); in AddEdge()
141 Reachable.AddNode(Idx); in NodesReachableFrom()
283 NodesInThisSCC.AddNode(SCC[i]->first); in TEST()
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DTestGraph.h57 void AddNode(unsigned Idx) { in AddNode() function
120 Nodes[FromIdx].second.AddNode(ToIdx); in AddEdge()
146 Reachable.AddNode(Idx); in NodesReachableFrom()
/external/v8/src/heap/cppgc-js/
Dcpp-snapshot.cc369 return static_cast<EmbedderRootNode*>(graph_.AddNode( in AddRootNode()
373 EmbedderNode* AddNode(const HeapObjectHeader& header) { in AddNode() function in v8::internal::CppGraphBuilderImpl
375 graph_.AddNode(std::unique_ptr<v8::EmbedderGraph::Node>{ in AddNode()
387 parent.set_node(AddNode(*parent.header())); in AddEdge()
390 current.set_node(AddNode(header)); in AddEdge()
400 parent.set_node(AddNode(*parent.header())); in AddEdge()
432 child.set_node(AddNode(*child.header())); in AddRootEdge()

1234567