Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 25 of 919) sorted by relevance

12345678910>>...37

/external/tensorflow/tensorflow/python/profiler/internal/
Dflops_registry.py42 def _zero_flops(graph, node): argument
60 def _unary_op_flops(graph, node, ops_per_element=1): argument
68 def _reciprocal_flops(graph, node): argument
74 def _square_flops(graph, node): argument
80 def _rsqrt_flops(graph, node): argument
87 def _log_flops(graph, node): argument
93 def _neg_flops(graph, node): argument
99 def _assign_sub_flops(graph, node): argument
105 def _assign_add_flops(graph, node): argument
111 def _l2_loss_flops(graph, node): argument
[all …]
/external/skia/tests/
DTopoSortTest.cpp31 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0()
40 static void create_simple_chain(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph, int n) { in create_simple_chain()
60 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1()
71 static void create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph2()
94 static void create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph3()
117 static void create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph4()
140 static void create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph5()
160 static void create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph6()
189 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
224 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
/external/armnn/src/backends/reference/test/
DRefCreateWorkloadTests.cpp57 Graph graph; in RefCreateActivationWorkloadTest() local
83 Graph graph; in RefCreateElementwiseWorkloadTest() local
96 Graph graph; variable
113 Graph graph; variable
129 Graph graph; variable
290 Graph graph; in RefCreateBatchNormalizationWorkloadTest() local
318 Graph graph; variable
384 Graph graph; variable
395 Graph graph; variable
406 Graph graph; in RefCreateConvolution2dWorkloadTest() local
[all …]
/external/tensorflow/tensorflow/core/grappler/
Dmutable_graph_view_test.cc36 void CompareNodeFanins(const MutableGraphView& graph, NodeDef* node, in CompareNodeFanins()
56 void CompareNodeFanouts(const MutableGraphView& graph, NodeDef* node, in CompareNodeFanouts()
69 void CheckNode(const MutableGraphView& graph, absl::string_view node_name, in CheckNode()
152 MutableGraphView graph(&graph_def); in TEST() local
174 MutableGraphView graph(&graph_def); in TEST() local
187 MutableGraphView graph(&graph_def); in TEST() local
200 MutableGraphView graph(&graph_def); in TEST() local
221 MutableGraphView graph(&graph_def); in TEST() local
249 MutableGraphView graph(&graph_def); in TEST() local
271 MutableGraphView graph(&graph_def); in TEST() local
[all …]
/external/tensorflow/tensorflow/python/training/
Dtraining_util.py68 def get_global_step(graph=None): argument
162 def create_global_step(graph=None): argument
256 def get_or_create_global_step(graph=None): argument
349 def _get_global_step_read(graph=None): argument
373 def _get_or_create_global_step_read(graph=None): argument
403 def _increment_global_step(increment, graph=None): argument
/external/tensorflow/tensorflow/lite/
Darena_planner_test.cc154 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} in TestGraphInfo()
190 void SetGraph(TestGraph* graph, bool preserve_all_tensors = false) { in SetGraph()
200 void SwapGraph(TestGraph* graph) { in SwapGraph()
257 TestGraph graph({}, {}, {}); in TEST_F() local
263 TestGraph graph({0, 10}, {}, {5, 11}); in TEST_F() local
275 TestGraph graph({1}, {{{1}, {2}, {}}}, {2}); in TEST_F() local
283 TestGraph graph({1}, {{{1}, {2}, {}}}, {2}); in TEST_F() local
291 TestGraph graph({0, 1}, in TEST_F() local
311 TestGraph graph({0, 1}, in TEST_F() local
332 TestGraph graph({0, 1}, in TEST_F() local
[all …]
/external/guava/guava/src/com/google/common/graph/
DGraphs.java61 public static <N> boolean hasCycle(Graph<N> graph) { in hasCycle()
104 Graph<N> graph, in subgraphHasCycle()
134 Graph<?> graph, Object nextNode, @CheckForNull Object previousNode) { in canTraverseWithoutReusingEdge()
153 public static <N> Graph<N> transitiveClosure(Graph<N> graph) { in transitiveClosure()
197 public static <N> Set<N> reachableNodes(Graph<N> graph, N node) { in reachableNodes()
210 public static <N> Graph<N> transpose(Graph<N> graph) { in transpose()
226 public static <N, V> ValueGraph<N, V> transpose(ValueGraph<N, V> graph) { in transpose()
264 private final Graph<N> graph; field in Graphs.TransposedGraph
266 TransposedGraph(Graph<N> graph) { in TransposedGraph()
DEndpointPairIterator.java37 private final BaseGraph<N> graph; field in EndpointPairIterator
45 static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { in of()
49 private EndpointPairIterator(BaseGraph<N> graph) { in EndpointPairIterator()
73 private Directed(BaseGraph<N> graph) { in Directed()
122 private Undirected(BaseGraph<N> graph) { in Undirected()
/external/guava/android/guava/src/com/google/common/graph/
DGraphs.java60 public static <N> boolean hasCycle(Graph<N> graph) { in hasCycle()
103 Graph<N> graph, in subgraphHasCycle()
133 Graph<?> graph, Object nextNode, @CheckForNull Object previousNode) { in canTraverseWithoutReusingEdge()
152 public static <N> Graph<N> transitiveClosure(Graph<N> graph) { in transitiveClosure()
196 public static <N> Set<N> reachableNodes(Graph<N> graph, N node) { in reachableNodes()
209 public static <N> Graph<N> transpose(Graph<N> graph) { in transpose()
225 public static <N, V> ValueGraph<N, V> transpose(ValueGraph<N, V> graph) { in transpose()
263 private final Graph<N> graph; field in Graphs.TransposedGraph
265 TransposedGraph(Graph<N> graph) { in TransposedGraph()
DEndpointPairIterator.java37 private final BaseGraph<N> graph; field in EndpointPairIterator
45 static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { in of()
49 private EndpointPairIterator(BaseGraph<N> graph) { in EndpointPairIterator()
73 private Directed(BaseGraph<N> graph) { in Directed()
122 private Undirected(BaseGraph<N> graph) { in Undirected()
/external/tensorflow/tensorflow/c/
Dpython_api.cc24 void AddControlInput(TF_Graph* graph, TF_Operation* op, TF_Operation* input) { in AddControlInput()
30 void SetAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name, in SetAttr()
45 void ClearAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name, in ClearAttr()
52 void SetFullType(TF_Graph* graph, TF_Operation* op, in SetFullType()
59 void SetRequestedDevice(TF_Graph* graph, TF_Operation* op, const char* device) { in SetRequestedDevice()
65 void UpdateEdge(TF_Graph* graph, TF_Output new_src, TF_Input dst, in UpdateEdge()
70 void RemoveAllControlInputs(TF_Graph* graph, TF_Operation* op) { in RemoveAllControlInputs()
82 void SetRequireShapeInferenceFns(TF_Graph* graph, bool require) { in SetRequireShapeInferenceFns()
92 std::string GetHandleShapeAndType(TF_Graph* graph, TF_Output output) { in GetHandleShapeAndType()
118 void SetHandleShapeAndType(TF_Graph* graph, TF_Output output, const void* proto, in SetHandleShapeAndType()
[all …]
/external/armnn/src/armnn/test/
DInferOutputTests.hpp23 armnn::Graph graph; in ArgMinMaxInferOutputShapeImpl() local
30 armnn::Graph graph; in ArgMinMaxInferOutputShape4dTest() local
49 armnn::Graph graph; in ArgMinMaxInferOutputShape3dTest() local
68 armnn::Graph graph; in ArgMinMaxInferOutputShape2dTest() local
87 armnn::Graph graph; in ArgMinMaxInferOutputShape1dTest() local
106 armnn::Graph graph; in BatchToSpaceInferOutputShapeTest() local
129 armnn::Graph graph; in SpaceToDepthInferOutputShapeTest() local
152 armnn::Graph graph; in PreluInferOutputShapeImpl() local
237 void CreatePreluLayerHelper(armnn::Graph& graph, in CreatePreluLayerHelper()
261 armnn::Graph graph; in PreluValidateTensorShapesFromInputsMatchTest() local
[all …]
/external/tensorflow/tensorflow/core/grappler/utils/
Dgraph_view_internal_test.cc56 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
80 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
104 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
128 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
174 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
213 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
297 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
332 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
356 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
388 GraphDef graph = SimpleTestGraphForMutation(); in TEST() local
[all …]
/external/armnn/src/backends/neon/test/
DNeonCreateWorkloadTests.cpp72 Graph graph; in NeonCreateActivationWorkloadTest() local
104 Graph graph; in NeonCreateElementwiseWorkloadTest() local
200 Graph graph; in NeonCreateBatchNormalizationWorkloadTest() local
244 Graph graph; in NeonCreateConvolution2dWorkloadTest() local
285 Graph graph; variable
312 Graph graph; in NeonCreateDepthWiseConvolutionWorkloadTest() local
348 Graph graph; in NeonCreateFullyConnectedWorkloadTest() local
391 Graph graph; in NeonCreateNormalizationWorkloadTest() local
435 Graph graph; in NeonCreatePooling2dWorkloadTest() local
484 Graph graph; in NeonCreatePreluWorkloadTest() local
[all …]
/external/guava/android/guava-tests/test/com/google/common/graph/
DImmutableValueGraphTest.java112 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_addNode() local
121 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_putEdgeFromNodes() local
134 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_putEdgeFromEndpointPair() local
147 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_incidentEdges_preservesIncidentEdgesOrder() local
163 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_incidentEdgeOrder_stable() local
171 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable() local
DElementOrderTest.java37 MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); in nodeOrder_none() local
44 MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); in nodeOrder_insertion() local
55 MutableGraph<Integer> graph = GraphBuilder.directed().build(); in nodeOrder_default() local
65 MutableGraph<Integer> graph = in nodeOrder_natural() local
76 MutableGraph<Integer> graph = in nodeOrder_sorted() local
181 MutableGraph<NonComparableSuperClass> graph = in customComparator() local
200 MutableGraph<ComparableSubClass> graph = in customComparable() local
217 private static void addNodes(MutableGraph<Integer> graph) { in addNodes()
/external/guava/guava-tests/test/com/google/common/graph/
DImmutableValueGraphTest.java112 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_addNode() local
121 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_putEdgeFromNodes() local
134 ImmutableValueGraph<String, Integer> graph = in immutableValueGraphBuilder_putEdgeFromEndpointPair() local
147 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_incidentEdges_preservesIncidentEdgesOrder() local
163 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_incidentEdgeOrder_stable() local
171 ImmutableValueGraph<Integer, String> graph = in immutableValueGraphBuilder_fromUnorderedBuilder_incidentEdgeOrder_stable() local
DElementOrderTest.java37 MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(unordered()).build(); in nodeOrder_none() local
44 MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); in nodeOrder_insertion() local
55 MutableGraph<Integer> graph = GraphBuilder.directed().build(); in nodeOrder_default() local
65 MutableGraph<Integer> graph = in nodeOrder_natural() local
76 MutableGraph<Integer> graph = in nodeOrder_sorted() local
181 MutableGraph<NonComparableSuperClass> graph = in customComparator() local
200 MutableGraph<ComparableSubClass> graph = in customComparable() local
217 private static void addNodes(MutableGraph<Integer> graph) { in addNodes()
DStandardImmutableGraphAdditionalTest.java91 ImmutableGraph<Object> graph = ImmutableGraph.copyOf(GraphBuilder.undirected().build()); in copyOf_incidentEdgeOrder() local
98 ImmutableGraph<Object> graph = in copyOf_fromUnorderedGraph_incidentEdgeOrder() local
107 ImmutableGraph<String> graph = GraphBuilder.directed().<String>immutable().addNode("A").build(); in immutableGraphBuilder_addNode() local
115 ImmutableGraph<String> graph = in immutableGraphBuilder_putEdgeFromNodes() local
124 ImmutableGraph<String> graph = in immutableGraphBuilder_putEdgeFromEndpointPair() local
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dauto_shard_test.cc95 MutableGraphView graph(&item.graph); in TEST() local
127 MutableGraphView graph(&item.graph); in TEST() local
160 MutableGraphView graph(&item.graph); in TEST() local
186 MutableGraphView graph(&item.graph); in TEST() local
212 MutableGraphView graph(&item.graph); in TEST() local
239 MutableGraphView graph(&item.graph); in TEST() local
265 MutableGraphView graph(&item.graph); in TEST() local
289 MutableGraphView graph(&item.graph); in TEST() local
318 MutableGraphView graph(&item.graph); in TEST() local
341 MutableGraphView graph(&item.graph); in TEST() local
[all …]
Dnoop_elimination.cc37 bool IsTakeAll(const NodeDef& take_node, const MutableGraphView& graph) { in IsTakeAll()
55 bool IsSkipNone(const NodeDef& skip_node, const MutableGraphView& graph) { in IsSkipNone()
61 bool IsRepeatOne(const NodeDef& repeat_node, const MutableGraphView& graph) { in IsRepeatOne()
68 const MutableGraphView& graph) { in IsPrefetchZero()
74 bool IsShardOne(const NodeDef& shard_node, const MutableGraphView& graph) { in IsShardOne()
109 bool IsMapIdentity(const NodeDef& map_node, const MutableGraphView& graph) { in IsMapIdentity()
141 bool IsNoOp(const NodeDef& node, const MutableGraphView& graph) { in IsNoOp()
154 MutableGraphView graph(output); in OptimizeAndCollectStats() local
/external/dagger2/java/dagger/internal/codegen/bindinggraphvalidation/
DMissingBindingValidator.java72 public void visitGraph(BindingGraph graph, DiagnosticReporter diagnosticReporter) { in visitGraph()
84 MissingBinding missingBinding, BindingGraph graph, DiagnosticReporter diagnosticReporter) { in reportMissingBinding()
104 private String missingBindingErrorMessage(MissingBinding missingBinding, BindingGraph graph) { in missingBindingErrorMessage()
129 BindingGraph graph) { in wrongComponentErrorMessage()
182 MissingBinding missingBinding, BindingGraph graph) { in allIncomingDependenciesCanUseProduction()
190 private boolean dependencyCanBeProduction(DependencyEdge edge, BindingGraph graph) { in dependencyCanBeProduction()
210 DependencyEdge edge, BindingGraph graph, boolean completePath) { in getComponentFromDependencyEdge()
217 private Node source(Edge edge, BindingGraph graph) { in source()
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dtest_tools.cc151 GraphDef& graph = graph_3n_self_control_; in TestGraphs() local
160 GraphDef& graph = graph_multi_input_; in TestGraphs() local
179 GraphDef& graph = graph_all_or_none_; in TestGraphs() local
205 GraphDef& graph = graph_circular_onedir_; in TestGraphs() local
213 GraphDef& graph = graph_circular_bidir_; in TestGraphs() local
222 GraphDef& graph = graph_linear_; in TestGraphs() local
230 GraphDef& graph = graph_cross_; in TestGraphs() local
246 GraphDef& graph = graph_small_cross_; in TestGraphs() local
258 GraphDef& graph = graph_for_link_order_; in TestGraphs() local
279 GraphDef& graph = graph_sun_; in TestGraphs() local
/external/armnn/src/backends/cl/test/
DClCreateWorkloadTests.cpp40 Graph graph; in ClCreateActivationWorkloadTest() local
72 Graph graph; in ClCreateElementwiseWorkloadTest() local
150 Graph graph; in ClCreateElementwiseUnaryWorkloadTest() local
177 Graph graph; in ClCreateBatchNormalizationWorkloadTest() local
232 Graph graph; variable
251 Graph graph; variable
272 Graph graph; in ClConvolution2dWorkloadTest() local
315 Graph graph; variable
345 Graph graph; variable
491 Graph graph; in ClDepthwiseConvolutionWorkloadTest() local
[all …]
/external/tensorflow/tensorflow/core/graph/
Dcollective_order_test.cc34 void VerifyGraph(const Graph& graph, in VerifyGraph()
65 const Graph& graph, in VerifyAttrs()
131 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); in InitGraph() local
142 std::unique_ptr<Graph> graph = InitGraph(); in TEST() local
149 std::unique_ptr<Graph> graph = InitGraph(); in TEST() local
179 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); in InitGraph2() local
191 std::unique_ptr<Graph> graph = InitGraph2(); in TEST() local
218 std::unique_ptr<Graph> graph = absl::make_unique<Graph>(OpRegistry::Global()); in InitGraphForPruning() local
229 std::unique_ptr<Graph> graph = InitGraphForPruning(); in TEST() local

12345678910>>...37