| /external/v8/src/compiler/ |
| machine-graph-verifier.h | 15 class Graph;
19 // Verifies properties of a scheduled graph, such as that the nodes' inputs are
23 static void Run(Graph* graph, Schedule const* const schedule,
|
| graph.cc | 5 #include "src/compiler/graph.h"
10 #include "src/compiler/graph-visualizer.h"
19 Graph::Graph(Zone* zone)
28 void Graph::Decorate(Node* node) {
35 void Graph::AddDecorator(GraphDecorator* decorator) {
40 void Graph::RemoveDecorator(GraphDecorator* decorator) {
46 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs,
53 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count,
62 Node* Graph::CloneNode(const Node* node)
[all...] |
| all-nodes.h | 15 // A helper utility that traverses the graph and gathers all nodes reachable
19 // Constructor. Traverses the graph and builds the {reachable} set of nodes
22 AllNodes(Zone* local_zone, Node* end, const Graph* graph,
24 // Constructor. Traverses the graph and builds the {reachable} set of nodes
26 AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs = true);
42 void Mark(Zone* local_zone, Node* end, const Graph* graph);
|
| loop-peeling.h | 35 static PeeledIteration* Peel(Graph* graph, CommonOperatorBuilder* common,
38 static void PeelInnerLoopsOfTree(Graph* graph, CommonOperatorBuilder* common,
41 static void EliminateLoopExits(Graph* graph, Zone* temp_zone);
|
| control-flow-optimizer.h | 18 class Graph;
24 ControlFlowOptimizer(Graph* graph, CommonOperatorBuilder* common,
37 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
42 Graph* const graph_;
|
| graph-trimmer.h | 16 class Graph;
19 // Trims dead nodes from the node graph.
22 GraphTrimmer(Zone* zone, Graph* graph);
25 // Trim nodes in the {graph} that are not reachable from {graph->end()}.
28 // Trim nodes in the {graph} that are not reachable from either {graph->end()}
49 Graph* graph() const { return graph_; function in class:v8::internal::compiler::final
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
| rexpr.c | 14 * first-search is performed on the NFA (graph) to check for a match of 's'.
83 static Graph BuildNFA_atom( int label );
84 static Graph BuildNFA_AB( Graph A, Graph B );
85 static Graph BuildNFA_AorB( Graph A, Graph B );
86 static Graph BuildNFA_set( char *s );
87 static Graph BuildNFA_Astar( Graph A );
[all...] |
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| Graph.java | 21 * A data flow graph representing a TensorFlow computation.
23 * <p>Instances of a Graph are thread-safe.
25 * <p><b>WARNING:</b> Resources consumed by the Graph object must be explicitly freed by invoking
26 * the {@link #close()} method then the Graph object is no longer needed.
28 public final class Graph implements AutoCloseable {
30 /** Create an empty Graph. */
31 public Graph() {
35 /** Create a Graph from an existing handle (takes ownership). */
36 Graph(long nativeHandle) {
41 * Release resources associated with the Graph
237 private final Graph graph; field in class:Graph.OperationIterator
[all...] |
| 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...] |
| Operation.java | 19 * A Graph node that performs computation on Tensors.
21 * <p>An Operation is a node in a {@link Graph} that takes zero or more {@link Tensor}s (produced by
22 * other Operations in the Graph) as input, and produces zero or more {@link Tensor}s as output.
24 * <p>Operation instances are valid only as long as the Graph they are a part of is valid. Thus, if
25 * {@link Graph#close()} has been invoked, then methods on the Operation instance may fail with an
34 // called unsafeHandle. Graph.ref() is used to safely use the unsafeHandle.
35 Operation(Graph g, long unsafeNativeHandle) {
36 this.graph = g;
42 Graph.Reference r = graph.ref()
205 private final Graph graph; field in class:Operation
[all...] |
| /hardware/interfaces/tests/pointer/1.0/default/ |
| Graph.cpp | 3 #include "Graph.h"
19 Return<void> Graph::passAGraph(const IGraph::Graph& g) {
20 ALOGI("SERVER(Graph) passAGraph start.");
22 // logSimpleGraph("SERVER(Graph) passAGraph:", g);
26 Return<void> Graph::giveAGraph(giveAGraph_cb _cb) {
27 IGraph::Graph g;
33 Return<void> Graph::passANode(const IGraph::Node& n) {
38 Return<void> Graph::passTwoGraphs(IGraph::Graph const* g1, IGraph::Graph const* g2)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| DOTGraphTraits.h | 12 // this file will produce a simple, but not very polished graph. By
41 /// getGraphName - Return the label for the graph as a whole. Printed at the
42 /// top of the graph.
45 static std::string getGraphName(const GraphType& Graph) { return ""; }
48 /// in the top level graph structure for dot.
51 static std::string getGraphProperties(const GraphType& Graph) {
55 /// renderGraphFromBottomUp - If this function returns true, the graph is
63 /// displayed in the graph.
68 /// getNodeLabel - Given a node and a pointer to the top level graph, return
71 std::string getNodeLabel(const void *Node, const GraphType& Graph) {
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| encapsulate_subgraphs_pass.h | 25 #include "tensorflow/core/graph/graph.h"
31 // 'graph' is the subgraph. The rewriting may renumber the inputs and outputs;
40 std::unique_ptr<Graph>* graph, std::vector<int>* input_permutation,
55 // in an outside_compilation cluster are left in the original graph. Edges
65 // output graph, together with a "ParallelCheck" operator, that verifies that
73 // graph, C and D in a subgraph. B and C have control deps from A, D has control
78 const Graph& graph_in, const RewriteSubgraphFn& rewrite_subgraph_fn,
80 std::unique_ptr<Graph>* graph_out, FunctionLibraryDefinition* library)
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| placer.h | 23 #include "tensorflow/core/graph/graph.h"
32 // A placement algorithm that assigns the nodes of the given Graph to
43 // The implementation builds a constraint graph with the same set of
45 // nodes. Each connected component in the resulting constraint graph
54 // placement algorithms so that they may be injected into the graph
58 // A map from graph node names to numerical IDs (in a Graph object).
62 // Graph "graph" (nodes in which may or may not be assigned) on th
[all...] |
| /system/update_engine/payload_generator/ |
| cycle_breaker.h | 21 // finding all elementary cycles (a.k.a. circuits) in a directed graph.
22 // See the paper "Finding All the Elementary Circuits of a Directed Graph"
32 // In a sample graph representative of a typical workload, I found over
46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
59 Graph subgraph_; // "A_K" in the paper
60 Graph blocked_graph_; // "B" in the paper
|
| graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
36 // These add a read-before dependency from graph[src] -> graph[dst]. If the dep
47 // For each node N in graph, drop all edges N->|index|.
48 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
50 void DumpGraph(const Graph& graph);
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
46 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
49 // Return total number of nodes in the graph
56 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| GraphTraits.h | 1 //===-- llvm/ADT/GraphTraits.h - Graph traits template ----------*- C++ -*-===//
11 // specialized by classes that want to be iteratable by generic graph iterators.
14 // graphs in a graph defined, inverse ordering...
23 // GraphTraits - This class should be specialized by different graph types...
30 // typedef NodeType - Type of Node in the graph
31 // typedef ChildIteratorType - Type used to iterate over children in graph
34 // Return the entry node of the graph
47 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
53 // graph, or you need to define it for a new graph type. Either that o
[all...] |
| /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);
|
| /test/vti/dashboard/src/main/java/com/android/vts/util/ |
| GraphSerializer.java | 24 /** Serializer class for Graph objects. */
25 public class GraphSerializer implements JsonSerializer<Graph> {
27 public JsonElement serialize(Graph src, Type typeOfSrc, JsonSerializationContext context) {
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| scheduler.h | 27 #include "tensorflow/core/graph/costmodel.h"
33 SlackAnalysis(const Graph* g, const CostModel* cost_model);
49 const Graph* graph_;
72 const Graph* g, std::vector<int64>* priority);
86 const Graph* graph_;
96 const Graph* g);
111 const Graph* graph_;
|
| /external/tensorflow/tensorflow/core/kernels/ |
| sendrecv_ops_test.cc | 42 static Graph* Send() {
43 Graph* g = new Graph(OpRegistry::Global());
45 test::graph::Send(g, test::graph::Constant(g, in0), "T", "/cpu:0", 1,
47 test::graph::Recv(g, "T", "float", "/cpu:0", 1, "/cpu:0");
51 static Graph* Recv() {
52 Graph* g = new Graph(OpRegistry::Global());
53 test::graph::Recv(g, "T", "float", "/cpu:0", 1, "/cpu:0")
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 31 Graph::Graph()
38 Graph::~Graph()
44 void Graph::insert(Node *node)
49 node->graph = this;
53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
87 Graph::Node::Node(void *priv) : data(priv),
88 in(0), out(0), graph(0)
[all...] |
| /hardware/interfaces/tests/pointer/1.0/ |
| IGraph.hal | 28 struct Graph {
48 passAGraph(Graph g);
49 passTwoGraphs(ref<Graph> g1, ref<Graph> g2);
50 giveAGraph() generates (Graph g);
|
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| OperationTest.java | 37 try (Graph g = new Graph()) {
57 try (Graph g = new Graph()) {
72 try (Graph g = new Graph()) {
80 try (Graph g = new Graph()) {
97 try (Graph g = new Graph()) {
[all...] |
