Home
last modified time | relevance | path

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

1234

/external/pdfium/xfa/fxfa/parser/
Dcxfa_node_unittest.cpp44 CXFA_Node* GetNode() const { return node_.get(); } in GetNode() function in CXFANodeTest
52 EXPECT_EQ(nullptr, GetNode()->GetFirstChild()); in TEST_F()
53 EXPECT_EQ(nullptr, GetNode()->GetLastChild()); in TEST_F()
57 GetNode()->InsertChildAndNotify(-1, child); in TEST_F()
59 EXPECT_EQ(GetNode(), child->GetParent()); in TEST_F()
60 EXPECT_EQ(child, GetNode()->GetFirstChild()); in TEST_F()
61 EXPECT_EQ(child, GetNode()->GetLastChild()); in TEST_F()
69 GetNode()->InsertChildAndNotify(-1, child0); in TEST_F()
73 GetNode()->InsertChildAndNotify(-1, child); in TEST_F()
75 EXPECT_EQ(GetNode(), child->GetParent()); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dgraph_analyzer_test.cc69 GenNode* GetNode(const string& name) { return gran_->nodes_.at(name).get(); } in GetNode() function in tensorflow::grappler::graph_analyzer::test::GraphAnalyzerTest
154 absl::make_unique<Subgraph>(Subgraph::Identity({GetNode("add2")})); in TEST_F()
156 ExtendSubgraphPortAllOrNone(root.get(), GetNode("add2"), in TEST_F()
177 absl::make_unique<Subgraph>(Subgraph::Identity({GetNode("add2")})); in TEST_F()
179 ExtendSubgraphPortAllOrNone(parent.get(), GetNode("add2"), in TEST_F()
199 absl::make_unique<Subgraph>(Subgraph::Identity({GetNode("add2")})); in TEST_F()
201 ExtendSubgraphPortAllOrNone(root.get(), GetNode("add2"), in TEST_F()
221 absl::make_unique<Subgraph>(Subgraph::Identity({GetNode("add2")})); in TEST_F()
223 ExtendSubgraphPortAllOrNone(root.get(), GetNode("add2"), in TEST_F()
239 Subgraph::Identity({GetNode("add2"), GetNode("const2_1"), in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dgeneric_layout_optimizer_transposer_test.cc405 auto* c2d = context.graph_view->GetNode("conv2d"); in ReduceTransposerKeepDims()
410 auto* sum = context.graph_view->GetNode("sum"); in ReduceTransposerKeepDims()
414 auto* input_transpose_node = context.graph_view->GetNode( in ReduceTransposerKeepDims()
418 auto* updated_sum_node = context.graph_view->GetNode("sum"); in ReduceTransposerKeepDims()
424 auto* axis_node = context.graph_view->GetNode( in ReduceTransposerKeepDims()
430 auto* output_transpose_node = context.graph_view->GetNode( in ReduceTransposerKeepDims()
434 auto* z_output_node = context.graph_view->GetNode("z"); in ReduceTransposerKeepDims()
472 auto* c2d = context.graph_view->GetNode("conv2d"); in ReduceTransposerValidAxisNode()
477 auto* max = context.graph_view->GetNode("max"); in ReduceTransposerValidAxisNode()
481 auto* input_transpose_node = context.graph_view->GetNode( in ReduceTransposerValidAxisNode()
[all …]
Dauto_mixed_precision_test.cc77 const NodeDef& optimized = *optimized_view.GetNode(original.name()); in VerifyGraphsEquivalent()
191 EXPECT_EQ(output_view.GetNode("input")->attr().at("dtype").type(), in TestSimpleUnaryInferOp()
193 EXPECT_EQ(output_view.GetNode("allow1")->attr().at("T").type(), DT_HALF); in TestSimpleUnaryInferOp()
194 EXPECT_EQ(output_view.GetNode("infer1")->attr().at("T").type(), DT_HALF); in TestSimpleUnaryInferOp()
195 EXPECT_EQ(output_view.GetNode("allow2")->attr().at("T").type(), DT_HALF); in TestSimpleUnaryInferOp()
232 EXPECT_EQ(output_view.GetNode("input")->attr().at("dtype").type(), DT_FLOAT); in TEST_F()
233 EXPECT_EQ(output_view.GetNode("deny1")->attr().at("T").type(), DT_FLOAT); in TEST_F()
234 EXPECT_EQ(output_view.GetNode("clr1")->attr().at("T").type(), DT_FLOAT); in TEST_F()
235 EXPECT_EQ(output_view.GetNode("infer1")->attr().at("T").type(), DT_FLOAT); in TEST_F()
236 EXPECT_EQ(output_view.GetNode("clr2")->attr().at("T").type(), DT_FLOAT); in TEST_F()
[all …]
Dlayout_optimizer_test.cc242 auto input_sizes_node = node_map.GetNode(input_name); in TEST_F()
244 auto conv2d_backprop_node = node_map.GetNode("Conv2DBackpropInput"); in TEST_F()
253 TensorShape filter_shape = GetAttrShape(*node_map.GetNode("Filter")); in TEST_F()
276 auto conv2d_backprop_node = node_map.GetNode("Conv2DBackpropInput"); in TEST_F()
280 auto input_sizes_node = node_map.GetNode( in TEST_F()
297 EXPECT_TRUE(node_map.GetNode("Conv2D-0-TransposeNHWCToNCHW-LayoutOptimizer")); in TEST_F()
310 EXPECT_TRUE(node_map.GetNode("Conv2D-0-TransposeNHWCToNCHW-LayoutOptimizer")); in TEST_F()
323 EXPECT_TRUE(node_map.GetNode("Conv2D-0-TransposeNHWCToNCHW-LayoutOptimizer")); in TEST_F()
336 EXPECT_TRUE(node_map.GetNode("Conv2D-0-TransposeNHWCToNCHW-LayoutOptimizer")); in TEST_F()
349 EXPECT_TRUE(node_map.GetNode("Conv2D-0-TransposeNHWCToNCHW-LayoutOptimizer")); in TEST_F()
[all …]
Dgeneric_layout_optimizer_test.cc247 auto* input_transpose_node = graph_view.GetNode( in TEST_F()
255 auto* conv2d_node = graph_view.GetNode("Conv2D"); in TEST_F()
262 auto* output_transpose_node = graph_view.GetNode( in TEST_F()
269 auto* output_node = graph_view.GetNode("Output"); in TEST_F()
290 auto* conv_node = graph_view.GetNode("Conv2D"); in TEST_F()
309 auto* conv_node = graph_view.GetNode("Conv2D"); in TEST_F()
332 auto* conv_node = graph_view.GetNode("Conv2D"); in TEST_F()
351 auto* conv_node = graph_view.GetNode("Conv2D"); in TEST_F()
374 auto* conv_node = graph_view.GetNode("Conv2D"); in TEST_F()
395 const int i1_index = graph_view_original.GetNode("i1")->node_index(); in TEST_F()
[all …]
Dcommon_subgraph_elimination_test.cc85 const NodeDef* new_c1 = node_map.GetNode("c1"); in TEST_F()
88 const NodeDef* new_div = node_map.GetNode("div"); in TEST_F()
126 const NodeDef* new_div = node_map.GetNode("div"); in TEST_F()
157 const NodeDef* new_c1 = node_map.GetNode("c1"); in TEST_F()
159 const NodeDef* new_c2 = node_map.GetNode("c2"); in TEST_F()
161 const NodeDef* new_mul1 = node_map.GetNode("mul1"); in TEST_F()
166 const NodeDef* new_div1 = node_map.GetNode("div1"); in TEST_F()
Dloop_optimizer_test.cc117 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
122 const auto* variant_add_node = view.GetNode("VariantAdd"); in TEST_F()
137 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
141 const auto* variant_add_node = view.GetNode("VariantAdd"); in TEST_F()
184 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
189 const auto* const_node = view.GetNode("Const"); in TEST_F()
204 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
208 const auto* const_node = view.GetNode("Const"); in TEST_F()
251 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
266 const auto* invariant_add_node = view.GetNode("InvariantAdd"); in TEST_F()
[all …]
Dmemory_optimizer_test.cc56 (*pre_transform_node_map.GetNode("b")->mutable_attr())["_recompute_hint"] in TEST_F()
66 NodeDef* transformed_e = post_transform_node_map.GetNode(e.name()); in TEST_F()
70 NodeDef* recomputed_b = post_transform_node_map.GetNode("Recomputed/b"); in TEST_F()
75 post_transform_node_map.GetNode("RecomputeTrigger/b"); in TEST_F()
96 (*pre_transform_node_map.GetNode("b")->mutable_attr())["_recompute_hint"] in TEST_F()
119 (*pre_transform_node_map.GetNode("a")->mutable_attr())["_recompute_hint"] in TEST_F()
121 (*pre_transform_node_map.GetNode("b")->mutable_attr())["_recompute_hint"] in TEST_F()
133 EXPECT_NE(post_transform_node_map.GetNode("Recomputed/a"), nullptr); in TEST_F()
134 EXPECT_NE(post_transform_node_map.GetNode("Recomputed/b"), nullptr); in TEST_F()
135 EXPECT_NE(post_transform_node_map.GetNode("RecomputeTrigger/a"), nullptr); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/grappler/utils/
Dgraph_view_test.cc121 const auto* node = graph_view.GetNode(i); in TYPED_TEST()
126 const auto* bad_node = graph_view.GetNode(-1); in TYPED_TEST()
128 bad_node = graph_view.GetNode(num_nodes); in TYPED_TEST()
142 const auto* node = graph_view.GetNode(node_name); in TYPED_TEST()
148 const auto* bad_node = graph_view.GetNode("e"); in TYPED_TEST()
213 const auto* a_node = graph_view.GetNode("a"); in TEST()
215 const auto* b_node = graph_view.GetNode("b"); in TEST()
217 const auto* c_node = graph_view.GetNode("c"); in TEST()
219 const auto* d_node = graph_view.GetNode("d"); in TEST()
253 const auto* node_view = graph_view.GetNode(node.name()); in TYPED_TEST()
[all …]
Dpattern_utils_test.cc172 auto root_node_view = graph_view.GetNode("e"); in TEST_F()
189 int expected_node_idx = graph_view.GetNode(label)->node_index(); in TEST_F()
254 auto root_node_view = graph_view.GetNode("e"); in TEST_F()
271 int expected_node_idx = graph_view.GetNode(label)->node_index(); in TEST_F()
340 auto root_node_view = graph_view.GetNode("e"); in TEST_F()
361 auto root_node_view = graph_view.GetNode("gelu"); in TEST_F()
378 int expected_node_idx = graph_view.GetNode(label)->node_index(); in TEST_F()
397 auto root_node_view = graph_view.GetNode("gelu"); in TEST_F()
418 auto root_node_view = graph_view.GetNode("gelu"); in TEST_F()
434 remove_node_names.push_back(graph_view.GetNode(node_idx)->GetName()); in TEST_F()
[all …]
Dtraversal.cc70 if (predicates.enter && !predicates.enter(graph_view.GetNode(w.node))) { in DfsTraversal()
79 callbacks.post_order(graph_view.GetNode(w.node)); in DfsTraversal()
87 callbacks.on_back_edge(graph_view.GetNode(w.src), in DfsTraversal()
88 graph_view.GetNode(w.node)); in DfsTraversal()
95 callbacks.pre_order(graph_view.GetNode(w.node)); in DfsTraversal()
102 if (predicates.advance && !predicates.advance(graph_view.GetNode(w.node))) { in DfsTraversal()
Dgraph_view_internal_test.cc63 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
87 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
111 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
135 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
181 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
220 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
304 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
339 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
363 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
395 MutableNodeView* d_node = graph_view.GetNode("d"); in TEST()
[all …]
Dgraph_view_internal.h69 return graph_view_->GetNode(node_index_); in node_view()
293 const NodeViewT* GetNode(int node_index) const { in GetNode() function
301 NodeViewT* GetNode(int node_index) { in GetNode() function
311 const NodeViewT* GetNode(absl::string_view node_name) const { in GetNode() function
319 NodeViewT* GetNode(absl::string_view node_name) { in GetNode() function
405 if (diff->graph_view->GetNode(diff->node_index)->GetName() == name) { in UpdateName()
419 if (diff->graph_view->GetNode(diff->node_index)->GetOp() == op) { in UpdateOp()
434 if (diff->graph_view->GetNode(diff->node_index)->GetDevice() == device) { in UpdateDevice()
495 auto* node_view = diff->graph_view->GetNode(diff->node_index); in AddOrUpdateRegularFanin()
537 auto* node_view = diff->graph_view->GetNode(diff->node_index); in RemoveRegularFanin()
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc131 const CallGraphNode& CallGraph::GetNode( in GetNode() function in xla::CallGraph
138 CallGraphNode& CallGraph::GetNode(const HloComputation* computation) { in GetNode() function in xla::CallGraph
153 const CallGraphNode& b_node = GetNode(b); in DominatesHelper()
201 CallGraphNode& node = GetNode(computation); in SetCallContexts()
214 CallGraphNode& callee_node = GetNode(callee); in SetCallContexts()
239 CHECK_NE(GetNode(computation).context(), CallContext::kNone); in SetCallContexts()
254 CallGraphNode& node = GetNode(computation); in SetNodeDepths()
265 CallGraphNode& callee_node = GetNode(callee); in SetNodeDepths()
304 call_graph->GetNode(computation).callsites()) { in Build()
307 call_graph->GetNode(callee).AddCallerCallSite(callsite); in Build()
[all …]
Dcall_graph_test.cc104 const CallGraphNode& node = call_graph->GetNode(computation); in TEST_F()
126 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
132 call_graph->GetNode(unreachable_computation); in TEST_F()
150 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
159 const CallGraphNode& map_node = call_graph->GetNode(map_computation); in TEST_F()
185 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
193 const CallGraphNode& called_node = call_graph->GetNode(called_computation); in TEST_F()
224 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
242 const CallGraphNode& sub_node = call_graph->GetNode(subcomputation); in TEST_F()
273 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
[all …]
Dflatten_call_graph_test.cc146 const CallGraphNode& c_node = flat_call_graph->GetNode(c_computation); in TEST_F()
181 const CallGraphNode& cond_node = call_graph->GetNode(cond_computation); in TEST_F()
189 const CallGraphNode& cond_node = call_graph->GetNode(cond_computation); in TEST_F()
220 const CallGraphNode& c_node = call_graph->GetNode(c_computation); in TEST_F()
223 const CallGraphNode& b_node = call_graph->GetNode(b_computation); in TEST_F()
253 const CallGraphNode& sub_node = call_graph->GetNode(sub_computation); in TEST_F()
/external/pdfium/xfa/fxfa/
Dcxfa_ffimage.cpp21 GetNode()->SetImageImage(nullptr); in ~CXFA_FFImage()
25 return !!GetNode()->GetImageImage(); in IsLoaded()
29 if (GetNode()->GetImageImage()) in LoadWidget()
32 return GetNode()->LoadImageImage(GetDoc()) && CXFA_FFWidget::LoadWidget(); in LoadWidget()
46 RetainPtr<CFX_DIBitmap> pDIBitmap = GetNode()->GetImageImage(); in RenderWidget()
Dcxfa_fwltheme.cpp130 CXFA_Node* pNode = pWidget->GetNode(); in DrawText()
154 CXFA_Node* pNode = pWidget->GetNode(); in GetUIMargin()
184 return pWidget->GetNode()->GetFontSize(); in GetFontSize()
191 return pWidget->GetNode()->GetFDEFont(pWidget->GetDoc()); in GetFont()
197 return pWidget->GetNode()->GetLineHeight(); in GetLineHeight()
208 return pWidget->GetNode()->GetTextColor(); in GetTextColor()
216 CXFA_Para* para = pWidget->GetNode()->GetParaIfExists(); in GetSpaceAboveBelow()
244 CXFA_Node* pNode = pWidget->GetNode(); in CalcTextRect()
/external/tensorflow/tensorflow/core/grappler/
Dgraph_view_test.cc44 const NodeDef& a_node_def = *graph_view.GetNode("a"); in TEST_F()
45 const NodeDef& b_node_def = *graph_view.GetNode("b"); in TEST_F()
79 const NodeDef& b_node_def = *graph_view.GetNode("b"); in TEST_F()
111 const NodeDef& c_node_def = *graph_view.GetNode("c"); in TEST_F()
161 const NodeDef* add_node = graph.GetNode("AddN"); in TEST_F()
256 const NodeDef* d_node = graph.GetNode("d"); in TEST_F()
278 const NodeDef* b_node = graph.GetNode("b"); in TEST_F()
280 const NodeDef* c_node = graph.GetNode("c"); in TEST_F()
282 const NodeDef* d_node = graph.GetNode("d"); in TEST_F()
345 graph_view.GetNode("out"); in BM_GraphViewGetNode()
[all …]
Dmutable_graph_view.cc70 NodeDef* input_node = graph.GetNode(tensor_id.node()); in IsIdentityConsumingSwitch()
91 NodeDef* control_node = graph.GetNode(control_node_name); in CanDedupControlWithRegularInput()
510 NodeDef* node = GetNode(node_name); in UpdateNode()
558 NodeDef* node = GetNode(from_node_name); in UpdateNodeName()
601 NodeDef* from_node = GetNode(from_node_name); in SwapNodeNames()
606 NodeDef* to_node = GetNode(to_node_name); in SwapNodeNames()
737 NodeDef* from_node = GetNode(from_node_name); in UpdateFanouts()
741 NodeDef* to_node = GetNode(to_node_name); in UpdateFanouts()
903 NodeDef* node = GetNode(node_name); in AddRegularFanin()
905 NodeDef* fanin_node = GetNode(fanin.node()); in AddRegularFanin()
[all …]
Dgraph_topology_view_test.cc62 const NodeDef* a_by_name = graph_view.GetNode("a"); in TEST_F()
63 const NodeDef* a_by_idx = graph_view.GetNode(0); in TEST_F()
68 const NodeDef* b_by_name = graph_view.GetNode("b"); in TEST_F()
69 const NodeDef* b_by_idx = graph_view.GetNode(1); in TEST_F()
Dmutable_graph_view_test.cc63 MutableGraphView::InputPort input_port(graph.GetNode(tensor_id.node()), in CompareNodeFanouts()
74 NodeDef* node = graph.GetNode(node_name); in CheckNode()
108 EXPECT_EQ(&node, immutable_graph.GetNode(node.name())); in CheckGraph()
349 NodeDef* node = graph.GetNode(from_node_name); in TestUpdateNodeName()
916 NodeDef* node = graph.GetNode(node_name); in TestAddRegularFanin()
1048 NodeDef* node = graph.GetNode(node_name); in TestAddRegularFaninByPort()
1202 NodeDef* node = graph.GetNode(node_name); in TestRemoveRegularFanin()
1344 NodeDef* node = graph.GetNode(node_name); in TestRemoveRegularFaninByPort()
1447 NodeDef* node = graph.GetNode(node_name); in TestRemoveAllFanins()
1545 NodeDef* node = graph.GetNode(node_name); in TestUpdateFanin()
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dreorder_data_discarding_ops_test.cc80 *graph.GetNode("reorder_data_discarding_ops/take"), graph) in TEST()
84 *graph.GetNode("reorder_data_discarding_ops/skip"), graph) in TEST()
88 graph_utils::GetInputNode(*graph.GetNode("map_and_batch"), graph)->name(), in TEST()
Dnoop_elimination.cc40 const auto& count_node = *graph.GetNode(take_node.input(1)); in IsTakeAll()
54 return IsConstNodeWithValue(*graph.GetNode(skip_node.input(1)), 0); in IsSkipNone()
60 return IsConstNodeWithValue(*graph.GetNode(repeat_node.input(1)), 1); in IsRepeatOne()
67 return IsConstNodeWithValue(*graph.GetNode(prefetch_node.input(1)), 0); in IsPrefetchZero()

1234