Home
last modified time | relevance | path

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

12345678910>>...26

/external/tensorflow/tensorflow/python/profiler/internal/
Dflops_registry.py46 def _zero_flops(graph, node): argument
64 def _unary_op_flops(graph, node, ops_per_element=1): argument
72 def _reciprocal_flops(graph, node): argument
78 def _square_flops(graph, node): argument
84 def _rsqrt_flops(graph, node): argument
91 def _log_flops(graph, node): argument
97 def _neg_flops(graph, node): argument
103 def _assign_sub_flops(graph, node): argument
109 def _assign_add_flops(graph, node): argument
115 def _l2_loss_flops(graph, node): argument
[all …]
/external/skia/tests/
DTopoSortTest.cpp25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0()
46 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1()
61 static void create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph2()
84 static void create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph3()
107 static void create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph4()
130 static void create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph5()
150 static void create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph6()
179 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
/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.py72 def get_global_step(graph=None): argument
107 def create_global_step(graph=None): argument
148 def get_or_create_global_step(graph=None): argument
188 def _get_global_step_read(graph=None): argument
212 def _get_or_create_global_step_read(graph=None): argument
242 def _increment_global_step(increment, graph=None): argument
/external/tensorflow/tensorflow/lite/
Darena_planner_test.cc141 explicit TestGraphInfo(TestGraph* graph) : graph_(graph) {} in TestGraphInfo()
177 void SetGraph(TestGraph* graph, bool preserve_inputs = false, in SetGraph()
188 void SwapGraph(TestGraph* graph) { in SwapGraph()
243 TestGraph graph({}, {}, {}); in TEST_F() local
249 TestGraph graph({0, 10}, {}, {5, 11}); in TEST_F() local
261 TestGraph graph({1}, {{{1}, {2}, {}}}, {2}); in TEST_F() local
269 TestGraph graph({1}, {{{1}, {2}, {}}}, {2}); in TEST_F() local
277 TestGraph graph({0, 1}, in TEST_F() local
298 TestGraph graph({0, 1}, in TEST_F() local
319 TestGraph graph({0, 1}, in TEST_F() local
[all …]
/external/guava/android/guava/src/com/google/common/graph/
DGraphs.java58 public static <N> boolean hasCycle(Graph<N> graph) { in hasCycle()
101 Graph<N> graph, in subgraphHasCycle()
131 Graph<?> graph, Object nextNode, @NullableDecl Object previousNode) { in canTraverseWithoutReusingEdge()
150 public static <N> Graph<N> transitiveClosure(Graph<N> graph) { in transitiveClosure()
194 public static <N> Set<N> reachableNodes(Graph<N> graph, N node) { in reachableNodes()
207 public static <N> Graph<N> transpose(Graph<N> graph) { in transpose()
223 public static <N, V> ValueGraph<N, V> transpose(ValueGraph<N, V> graph) { in transpose()
261 private final Graph<N> graph; field in Graphs.TransposedGraph
263 TransposedGraph(Graph<N> graph) { in TransposedGraph()
DEndpointPairIterator.java33 private final BaseGraph<N> graph; field in EndpointPairIterator
39 static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { in of()
43 private EndpointPairIterator(BaseGraph<N> graph) { in EndpointPairIterator()
67 private Directed(BaseGraph<N> graph) { in Directed()
113 private Undirected(BaseGraph<N> graph) { in Undirected()
/external/guava/guava/src/com/google/common/graph/
DGraphs.java59 public static <N> boolean hasCycle(Graph<N> graph) { in hasCycle()
102 Graph<N> graph, Map<Object, NodeVisitState> visitedNodes, N node, @Nullable N previousNode) { in subgraphHasCycle()
129 Graph<?> graph, Object nextNode, @Nullable Object previousNode) { in canTraverseWithoutReusingEdge()
148 public static <N> Graph<N> transitiveClosure(Graph<N> graph) { in transitiveClosure()
192 public static <N> Set<N> reachableNodes(Graph<N> graph, N node) { in reachableNodes()
205 public static <N> Graph<N> transpose(Graph<N> graph) { in transpose()
221 public static <N, V> ValueGraph<N, V> transpose(ValueGraph<N, V> graph) { in transpose()
259 private final Graph<N> graph; field in Graphs.TransposedGraph
261 TransposedGraph(Graph<N> graph) { in TransposedGraph()
DEndpointPairIterator.java33 private final BaseGraph<N> graph; field in EndpointPairIterator
39 static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) { in of()
43 private EndpointPairIterator(BaseGraph<N> graph) { in EndpointPairIterator()
67 private Directed(BaseGraph<N> graph) { in Directed()
113 private Undirected(BaseGraph<N> graph) { in Undirected()
/external/skqp/tests/
DTopoSortTest.cpp23 static void create_graph0(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) { in create_graph0()
41 static void create_graph1(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) { in create_graph1()
54 static void create_graph2(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) { in create_graph2()
73 static void create_graph3(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) { in create_graph3()
94 static void create_graph4(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) { in create_graph4()
123 SkTArray<sk_sp<sk_tool_utils::TopoTestNode>> graph; in DEF_TEST() local
/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/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()
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/
Dgraph_utils_test.cc42 MutableGraphView graph(&graph_def); in TEST() local
50 MutableGraphView graph(&graph_def); in TEST() local
58 MutableGraphView graph(&graph_def); in TEST() local
66 MutableGraphView graph(&graph_def); in TEST() local
74 MutableGraphView graph(&graph_def); in TEST() local
82 MutableGraphView graph(&graph_def); in TEST() local
90 MutableGraphView graph(&graph_def); in TEST() local
99 MutableGraphView graph(&graph_def); in TEST() local
108 MutableGraphView graph(&graph_def); in TEST() local
119 MutableGraphView graph(&graph_def); in TEST() local
[all …]
Dgraph_utils.cc46 std::vector<int> CreateNameIndex(const GraphDef& graph) { in CreateNameIndex()
74 MutableGraphView* graph) { in AddScalarConstNodeHelper()
94 NodeDef* AddScalarPlaceholder(DataType dtype, MutableGraphView* graph) { in AddScalarPlaceholder()
107 MutableGraphView* graph) { in AddNode()
125 NodeDef* AddScalarConstNode(bool v, MutableGraphView* graph) { in AddScalarConstNode()
131 NodeDef* AddScalarConstNode(double v, MutableGraphView* graph) { in AddScalarConstNode()
137 NodeDef* AddScalarConstNode(float v, MutableGraphView* graph) { in AddScalarConstNode()
143 NodeDef* AddScalarConstNode(int v, MutableGraphView* graph) { in AddScalarConstNode()
149 NodeDef* AddScalarConstNode(int64 v, MutableGraphView* graph) { in AddScalarConstNode()
155 NodeDef* AddScalarConstNode(StringPiece v, MutableGraphView* graph) { in AddScalarConstNode()
[all …]
Dnoop_elimination.cc37 bool IsTakeAll(const NodeDef& take_node, const MutableGraphView& graph) { in IsTakeAll()
51 bool IsSkipNone(const NodeDef& skip_node, const MutableGraphView& graph) { in IsSkipNone()
57 bool IsRepeatOne(const NodeDef& repeat_node, const MutableGraphView& graph) { in IsRepeatOne()
64 const MutableGraphView& graph) { in IsPrefetchZero()
99 bool IsMapIdentity(const NodeDef& map_node, const MutableGraphView& graph) { in IsMapIdentity()
131 bool IsNoOp(const NodeDef& node, const MutableGraphView& graph) { in IsNoOp()
144 MutableGraphView graph(output); in OptimizeAndCollectStats() local
/external/tensorflow/tensorflow/c/
Dpython_api.cc23 void AddControlInput(TF_Graph* graph, TF_Operation* op, TF_Operation* input) { in AddControlInput()
29 void SetAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name, in SetAttr()
44 void ClearAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name, in ClearAttr()
52 void SetRequestedDevice(TF_Graph* graph, TF_Operation* op, const char* device) { in SetRequestedDevice()
58 void UpdateEdge(TF_Graph* graph, TF_Output new_src, TF_Input dst, in UpdateEdge()
63 void RemoveAllControlInputs(TF_Graph* graph, TF_Operation* op) { in RemoveAllControlInputs()
75 void SetRequireShapeInferenceFns(TF_Graph* graph, bool require) { in SetRequireShapeInferenceFns()
85 std::string GetHandleShapeAndType(TF_Graph* graph, TF_Output output) { in GetHandleShapeAndType()
111 void SetHandleShapeAndType(TF_Graph* graph, TF_Output output, const void* proto, in SetHandleShapeAndType()
137 void AddWhileInputHack(TF_Graph* graph, TF_Output new_src, TF_Operation* dst, in AddWhileInputHack()
/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/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/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
/external/tensorflow/tensorflow/lite/delegates/gpu/common/
Dmodel_test.cc31 GraphFloat32 graph; in TEST() local
52 GraphFloat32 graph; in TEST() local
67 GraphFloat32 graph; in TEST() local
76 GraphFloat32 graph; in TEST() local
101 GraphFloat32 graph; in TEST() local
109 GraphFloat32 graph; in TEST() local
124 GraphFloat32 graph; in TEST() local
296 GraphFloat32 graph; in TEST() local
334 GraphFloat32 graph; in TEST() local
341 GraphFloat32 graph; in TEST() local
[all …]
/external/dagger2/java/dagger/internal/codegen/bindinggraphvalidation/
DMissingBindingValidator.java58 public void visitGraph(BindingGraph graph, DiagnosticReporter diagnosticReporter) { in visitGraph()
70 MissingBinding missingBinding, BindingGraph graph, DiagnosticReporter diagnosticReporter) { in reportMissingBinding()
75 private String missingBindingErrorMessage(MissingBinding missingBinding, BindingGraph graph) { in missingBindingErrorMessage()
106 MissingBinding missingBinding, BindingGraph graph) { in allIncomingDependenciesCanUseProduction()
114 private boolean dependencyCanBeProduction(DependencyEdge edge, BindingGraph graph) { in dependencyCanBeProduction()

12345678910>>...26