| /external/skia/tests/ |
| TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph);
23 static void create_graph0(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) {
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4);
26 (*graph)[0]->dependsOn((*graph)[1].get());
27 (*graph)[0]->dependsOn((*graph)[2].get());
28 (*graph)[1]->dependsOn((*graph)[3].get());
29 (*graph)[2]->dependsOn((*graph)[3].get())
123 SkTArray<sk_sp<sk_tool_utils::TopoTestNode>> graph; local
[all...] |
| /external/skqp/tests/ |
| TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph);
23 static void create_graph0(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph) {
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4);
26 (*graph)[0]->dependsOn((*graph)[1].get());
27 (*graph)[0]->dependsOn((*graph)[2].get());
28 (*graph)[1]->dependsOn((*graph)[3].get());
29 (*graph)[2]->dependsOn((*graph)[3].get())
123 SkTArray<sk_sp<sk_tool_utils::TopoTestNode>> graph; local
[all...] |
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/op/ |
| Scope.java | 18 import org.tensorflow.Graph;
28 * Scope scope = new Scope(graph);
39 * scope.graph().opBuilder(
56 * Scope root = new Scope(graph);
81 * @param graph The graph instance to be managed by the scope.
83 public Scope(Graph graph) {
84 this(graph, new NameScope());
87 /** Returns the graph managed by this scope. *
88 public Graph graph() { method in class:Scope
154 private final Graph graph; field in class:Scope
[all...] |
| /external/tensorflow/tensorflow/core/grappler/verifiers/ |
| structure_verifier.cc | 22 #include "tensorflow/core/framework/graph.pb.h"
25 #include "tensorflow/core/graph/validate.h"
34 Status StructureVerifier::Verify(const GraphDef& graph) {
38 graph.library());
39 status_group.Update(tensorflow::graph::ValidateGraphDefAgainstOpRegistry(
40 graph, function_library));
41 status_group.Update(tensorflow::graph::VerifyNoDuplicateNodeNames(graph));
44 status_group.Update(ComputeTopologicalOrder(graph, &topo_order));
|
| /art/tools/ahat/src/test/com/android/ahat/ |
| DominatorsTest.java | 32 private static class Graph implements Dominators.Graph<String> {
57 * Define a node in the graph, including all its outgoing edges.
75 Graph graph = new Graph(); local
76 graph.node("n");
77 new Dominators(graph).computeDominators("n");
84 Graph graph = new Graph() local
98 Graph graph = new Graph(); local
115 Graph graph = new Graph(); local
129 Graph graph = new Graph(); local
144 Graph graph = new Graph(); local
157 Graph graph = new Graph(); local
176 Graph graph = new Graph(); local
201 Graph graph = new Graph(); local
217 Graph graph = new Graph(); local
240 Graph graph = new Graph(); local
267 Graph graph = new Graph(); local
294 Graph graph = new Graph(); local
[all...] |
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| graph_utils_test.cc | 19 #include "tensorflow/core/graph/node_builder.h"
42 MutableGraphView graph(&graph_def);
43 NodeDef* bool_node = AddScalarConstNode<bool>(true, &graph);
44 EXPECT_TRUE(ContainsGraphNodeWithName(bool_node->name(), *graph.graph()));
50 MutableGraphView graph(&graph_def);
51 NodeDef* double_node = AddScalarConstNode<double>(3.14, &graph);
52 EXPECT_TRUE(ContainsGraphNodeWithName(double_node->name(), *graph.graph()));
58 MutableGraphView graph(&graph_def)
[all...] |
| make_numa_aware.cc | 31 NodeDef MakeNumaAwareNode(const NodeDef& node, MutableGraphView* graph) {
33 graph_utils::SetUniqueGraphNodeName("make_numa_aware", graph->graph(),
45 *output = item.graph;
46 MutableGraphView graph(output);
49 for (const NodeDef& node : item.graph.node()) {
52 auto* numa_node = graph.AddNode(MakeNumaAwareNode(node, &graph));
53 TF_RETURN_IF_ERROR(graph.UpdateFanouts(node.name(), numa_node->name()));
57 TF_RETURN_IF_ERROR(graph.DeleteNodes(nodes_to_delete))
[all...] |
| noop_elimination.cc | 34 bool IsTakeAll(const NodeDef& take_node, const MutableGraphView& graph) {
37 const auto& count_node = *graph.GetNode(take_node.input(1));
48 bool IsSkipNone(const NodeDef& skip_node, const MutableGraphView& graph) {
51 return IsConstNodeWithValue(*graph.GetNode(skip_node.input(1)), 0);
54 bool IsRepeatOne(const NodeDef& repeat_node, const MutableGraphView& graph) {
57 return IsConstNodeWithValue(*graph.GetNode(repeat_node.input(1)), 1);
61 const MutableGraphView& graph) {
64 return IsConstNodeWithValue(*graph.GetNode(prefetch_node.input(1)), 0);
67 bool IsNoOp(const NodeDef& node, const MutableGraphView& graph) {
68 return IsTakeAll(node, graph) || IsSkipNone(node, graph) |
[all...] |
| /art/compiler/optimizing/ |
| find_loops_test.cc | 38 HGraph* graph = CreateCFG(data); local
39 for (HBasicBlock* block : graph->GetBlocks()) {
49 HGraph* graph = CreateCFG(data); local
50 for (HBasicBlock* block : graph->GetBlocks()) {
63 HGraph* graph = CreateCFG(data); local
64 for (HBasicBlock* block : graph->GetBlocks()) {
78 HGraph* graph = CreateCFG(data); local
79 for (HBasicBlock* block : graph->GetBlocks()) {
91 HGraph* graph = CreateCFG(data); local
92 for (HBasicBlock* block : graph->GetBlocks())
135 HGraph* graph = CreateCFG(data); local
161 HGraph* graph = CreateCFG(data); local
184 HGraph* graph = CreateCFG(data); local
208 HGraph* graph = CreateCFG(data); local
232 HGraph* graph = CreateCFG(data); local
255 HGraph* graph = CreateCFG(data); local
284 HGraph* graph = CreateCFG(data); local
312 HGraph* graph = CreateCFG(data); local
326 HGraph* graph = CreateCFG(data); local
[all...] |
| cha_guard_optimization.h | 29 explicit CHAGuardOptimization(HGraph* graph,
31 : HOptimization(graph, name) {}
|
| constant_folding.h | 29 * Note that graph simplifications producing a constant should be
30 * implemented in art::HConstantFolding, while graph simplifications
42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {}
|
| instruction_simplifier_arm.h | 28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats)
29 : HOptimization(graph, kInstructionSimplifierArmPassName, stats) {}
|
| instruction_simplifier_arm64.h | 28 InstructionSimplifierArm64(HGraph* graph, OptimizingCompilerStats* stats)
29 : HOptimization(graph, kInstructionSimplifierArm64PassName, stats) {}
|
| linear_order.h | 26 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order);
28 // Linearizes the 'graph' such that:
40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) {
45 linear_order->resize(graph->GetReversePostOrder().size());
46 LinearizeGraphInternal(graph, ArrayRef<HBasicBlock*>(*linear_order));
|
| ssa_phi_elimination.h | 26 * Optimization phase that removes dead phis from the graph. Dead phis are unused
31 explicit SsaDeadPhiElimination(HGraph* graph)
32 : HOptimization(graph, kSsaDeadPhiEliminationPassName) {}
53 explicit SsaRedundantPhiElimination(HGraph* graph)
54 : HOptimization(graph, kSsaRedundantPhiEliminationPassName) {}
|
| /external/tensorflow/tensorflow/python/profiler/internal/ |
| flops_registry.py | 46 def _zero_flops(graph, node):
48 del graph, node # graph and node are unused
64 def _unary_op_flops(graph, node, ops_per_element=1):
66 in_shape = graph_util.tensor_shape_from_node_def_name(graph, node.input[0])
72 def _reciprocal_flops(graph, node):
74 return _unary_op_flops(graph, node)
78 def _square_flops(graph, node):
80 return _unary_op_flops(graph, node)
84 def _rsqrt_flops(graph, node)
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| colocation.h | 20 #include "tensorflow/core/framework/graph.pb.h"
25 // Evaluates the colocation relation in the graph and rewrites the new
26 // colocation relation in the graph. We scan the graph nodes sequentially, and
30 // exist in graph) with the representative node.
33 // X, Y are removed from graph. In this case we can't know A colocates with B.
34 void ReassignColocation(GraphDef* graph);
|
| frame_test.cc | 57 GraphDef graph; local
59 *graph.add_node() = CreateNode("0", {});
60 *graph.add_node() = CreateNode("1", "Enter", "while/context1", {"0"});
61 *graph.add_node() = CreateNode("2", {"1"});
62 *graph.add_node() = CreateNode("3", "Merge", {"2", "14"});
63 *graph.add_node() = CreateNode("4", {"3"});
64 *graph.add_node() = CreateNode("5", "Switch", {"4"});
65 *graph.add_node() = CreateNode("6", {"5"});
66 *graph.add_node() = CreateNode("7", "Enter", "while/context2", {"6"});
67 *graph.add_node() = CreateNode("8", {"7"})
97 GraphDef graph; local
118 GraphDef graph; local
140 GraphDef graph; local
168 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/core/grappler/ |
| mutable_graph_view_test.cc | 22 #include "tensorflow/core/graph/tensor_id.h"
36 void CompareNodeFanins(const MutableGraphView& graph, NodeDef* node,
43 if (tensor_id.index() == Graph::kControlSlot) {
44 port = Graph::kControlSlot;
50 graph.GetOutputPort(tensor_id.node(), tensor_id.index());
51 EXPECT_TRUE(graph.GetFanin(input_port).contains(output_port));
52 EXPECT_TRUE(graph.GetFanout(output_port).contains(input_port));
56 void CompareNodeFanouts(const MutableGraphView& graph, NodeDef* node,
59 graph.GetFanouts(*node, /*include_controlled_nodes=*/true);
63 MutableGraphView::InputPort input_port(graph.GetNode(tensor_id.node())
[all...] |
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| test_tools.cc | 151 GraphDef& graph = graph_3n_self_control_; local
153 (*graph.add_node()) = MakeNodeConst("node1");
154 (*graph.add_node()) = MakeNodeSub("node2", "node3:1", "node3:0");
155 auto node3 = graph.add_node();
160 GraphDef& graph = graph_multi_input_; local
162 (*graph.add_node()) = MakeNodeConst("const1_1");
163 (*graph.add_node()) = MakeNodeConst("const1_2");
164 (*graph.add_node()) = MakeNodeAddN("add1", "const1_1", "const1_2");
166 (*graph.add_node()) = MakeNodeConst("const2_1");
167 (*graph.add_node()) = MakeNodeConst("const2_2")
179 GraphDef& graph = graph_all_or_none_; local
205 GraphDef& graph = graph_circular_onedir_; local
213 GraphDef& graph = graph_circular_bidir_; local
222 GraphDef& graph = graph_linear_; local
230 GraphDef& graph = graph_cross_; local
246 GraphDef& graph = graph_small_cross_; local
258 GraphDef& graph = graph_for_link_order_; local
279 GraphDef& graph = graph_sun_; local
[all...] |
| /external/skia/src/core/ |
| SkTTopoSort.h | 16 void SkTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) {
17 for (int i = 0; i < graph.count(); ++i) {
18 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
19 SkASSERT(!Traits::WasOutput(graph[i].get()));
24 void SkTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) {
25 for (int i = 0; i < graph.count(); ++i) {
26 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
27 SkASSERT(Traits::WasOutput(graph[i].get()));
61 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
63 // A false return value means there was a loop and the contents of 'graph' wil
[all...] |
| /external/skqp/src/core/ |
| SkTTopoSort.h | 16 void SkTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) {
17 for (int i = 0; i < graph.count(); ++i) {
18 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
19 SkASSERT(!Traits::WasOutput(graph[i].get()));
24 void SkTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) {
25 for (int i = 0; i < graph.count(); ++i) {
26 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
27 SkASSERT(Traits::WasOutput(graph[i].get()));
61 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
63 // A false return value means there was a loop and the contents of 'graph' wil
[all...] |
| /external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/ |
| Makefile | 3 OUTPUTS=graph
7 noploop: graph.c
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| mark_for_compilation_pass_test_helper.h | 24 // Runs the MarkForCompilation pass on `graph` after assigning all nodes in
25 // `graph` to the CPU device. To make testing easier, ignores device
27 static Status MarkForCompilation(std::unique_ptr<Graph>* graph,
32 static Status MarkForCompilation(std::unique_ptr<Graph>* graph,
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_def_builder_util.cc | 15 #include "tensorflow/core/graph/graph_def_builder_util.h"
17 #include "tensorflow/core/graph/graph_constructor.h"
21 Status GraphDefBuilderToGraph(const GraphDefBuilder& builder, Graph* graph) {
25 return ConvertGraphDefToGraph(opts, graph_def, graph);
|
