| /external/skqp/tests/ |
| TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTDArray<sk_tool_utils::TopoTestNode*>* graph);
23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) {
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4);
26 (*graph)[0]->dependsOn((*graph)[1]);
27 (*graph)[0]->dependsOn((*graph)[2]);
28 (*graph)[1]->dependsOn((*graph)[3]);
29 (*graph)[2]->dependsOn((*graph)[3])
123 SkTDArray<sk_tool_utils::TopoTestNode*> graph; local
[all...] |
| /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...] |
| /tools/tradefederation/core/tests/src/com/android/tradefed/util/ |
| DirectedGraphTest.java | 26 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
27 graph.addEdge(0, 1);
28 graph.addEdge(1, 2);
29 graph.addEdge(2, 3);
30 assertTrue(graph.contains(0));
31 assertTrue(graph.contains(1));
32 assertTrue(graph.contains(2));
33 assertTrue(graph.contains(3));
35 assertTrue(graph.isDag());
39 DirectedGraph<Integer> graph = new DirectedGraph<Integer>() local
55 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
[all...] |
| /external/fio/ |
| graph.h | 4 struct graph;
11 struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font);
12 /* graph_new() Returns a new graph structure of the given dimensions and font */
13 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim);
14 /* graph_set_size() Changes the size of a graph to the given dimensions. */
15 void graph_set_position(struct graph *g, double xoffset, double yoffset);
16 /* graph_set_position() sets the x- and y-offset to translate the graph */
17 void bar_graph_draw(struct graph *g, cairo_t *cr);
18 /* bar_graph_draw() draws the given graph as a bar graph */
[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
163 private final Graph graph; field in class:Scope
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-sce.h | 16 explicit HStackCheckEliminationPhase(HGraph* graph)
17 : HPhase("H_Stack check elimination", graph) { }
|
| hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph)
17 : HPhase("H_Canonicalize", graph) { }
|
| hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph)
17 : HPhase("H_Dehoist index computations", graph) { }
|
| hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph)
16 : HPhase("H_Load elimination", graph) { }
|
| /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) {}
|
| /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/ |
| topological_sort.h | 19 #include "tensorflow/core/framework/graph.pb.h"
25 // Sort a graph in topological order.
26 Status TopologicalSort(GraphDef* graph);
|
| topological_sort_test.cc | 47 GraphDef graph; local
48 *graph.add_node() = CreateNode("2", {"5"});
49 *graph.add_node() = CreateNode("0", {"5", "4"});
50 *graph.add_node() = CreateNode("1", {"4", "3"});
51 *graph.add_node() = CreateNode("3", {"2"});
52 *graph.add_node() = CreateNode("5", {});
53 *graph.add_node() = CreateNode("4", {});
55 TF_EXPECT_OK(TopologicalSort(&graph));
58 EXPECT_EQ(graph.node(i).name(), order[i]);
63 GraphDef graph; local
79 GraphDef graph; local
94 GraphDef graph; local
106 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| SavedModelBundle.java | 21 * <p>The model consists of a description of the computation (a {@link Graph}), a {@link Session}
22 * with tensors (e.g., parameters or variables in the graph) initialized to values saved in storage,
36 * @return a bundle containing the graph and associated session.
51 /** Returns the graph that describes the computation performed by the model. */
52 public Graph graph() { method in class:SavedModelBundle
53 return graph;
66 * Releases resources (the {@link Graph} and {@link Session}) associated with the saved model
72 graph.close();
75 private final Graph graph field in class:SavedModelBundle
93 Graph graph = new Graph(graphHandle); local
[all...] |
| /external/tensorflow/tensorflow/c/ |
| python_api.h | 22 // refactoring of graph construction code in the Python API.
26 void AddControlInput(TF_Graph* graph, TF_Operation* op, TF_Operation* input);
30 void SetAttr(TF_Graph* graph, TF_Operation* op, const char* attr_name,
33 void SetRequestedDevice(TF_Graph* graph, TF_Operation* op, const char* device);
35 void UpdateEdge(TF_Graph* graph, TF_Output new_src, TF_Input dst,
38 void RemoveAllControlInputs(TF_Graph* graph, TF_Operation* op);
|
| /system/update_engine/payload_generator/ |
| tarjan.cc | 35 Graph* graph,
40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it)
44 Tarjan(vertex, graph);
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_
[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 | 15 void SkTTopoSort_CheckAllUnmarked(const SkTDArray<T*>& graph) {
16 for (int i = 0; i < graph.count(); ++i) {
17 SkASSERT(!Traits::IsTempMarked(graph[i]));
18 SkASSERT(!Traits::WasOutput(graph[i]));
23 void SkTTopoSort_CleanExit(const SkTDArray<T*>& graph) {
24 for (int i = 0; i < graph.count(); ++i) {
25 SkASSERT(!Traits::IsTempMarked(graph[i]));
26 SkASSERT(Traits::WasOutput(graph[i]));
60 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
62 // 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/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);
|
| /external/v8/src/compiler/ |
| graph-replay.h | 15 class Graph;
17 // Helper class to print a full replay of a graph. This replay can be used to
18 // materialize the same graph within a C++ unit test and hence test subsequent
19 // optimization passes on a graph without going through the construction steps.
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
|
