| /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);
|
| 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;
18 // Trims dead nodes from the node graph.
21 GraphTrimmer(Zone* zone, Graph* graph);
24 // Trim nodes in the {graph} that are not reachable from {graph->end()}.
27 // Trim nodes in the {graph} that are not reachable from either {graph->end()}
48 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/core/graph/ |
| algorithm.h | 23 #include "tensorflow/core/graph/graph.h"
53 extern void DFS(const Graph& g, const std::function<void(Node*)>& enter,
64 extern void DFSFrom(const Graph& g, gtl::ArraySlice<Node*> start,
69 extern void DFSFrom(const Graph& g, gtl::ArraySlice<const Node*> start,
80 extern void ReverseDFS(const Graph& g, const std::function<void(Node*)>& enter,
89 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<Node*> start,
93 extern void ReverseDFSFrom(const Graph& g, gtl::ArraySlice<const Node*> start,
99 // in graph found via a depth first search starting at the source node.
102 // graph does not have cycles
[all...] |
| 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);
|
| mkl_tfconversion_pass.h | 16 // An optimization pass that inserts MklToTf conversion nodes in the graph
25 #include "tensorflow/core/graph/graph.h"
35 extern bool InsertMklToTfConversionNodes(std::unique_ptr<Graph>* g);
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| function.h | 27 #include "tensorflow/core/graph/graph.h"
73 // instantiated function that is represented as a Graph with arg/ret
77 Graph* graph = nullptr; // owned. member in struct:tensorflow::FunctionBody
86 DataTypeSlice ret_types, Graph* g);
90 // Debugging facility. Returns a debug string for a graph
92 string DebugString(const Graph* instantiated_func_graph);
95 // (a Graph*).
113 bool RemoveDeadNodes(Graph* g)
[all...] |
| executor_factory.h | 29 class Graph;
35 std::unique_ptr<const Graph> graph,
46 std::unique_ptr<const Graph> graph,
|
| /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"
32 // original source graph (*not* 'graph').
34 // 'graph' is the subgraph. The rewriting may renumber the inputs and outputs;
44 std::unique_ptr<Graph>* graph, std::vector<int>* input_permutation,
59 // in an outside_compilation cluster are left in the original graph. Edges
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
[all...] |
| encapsulate_util.h | 17 // in host graph and encapsulating outside compilation in XLA computation.
22 #include "tensorflow/core/graph/graph.h"
30 // Infers output shapes for all nodes in graph `g`. The output shapes will be
36 Status PerformStaticShapeInferenceBeforeEncapsulation(Graph* g);
86 // The XLA computation node in the graph.
106 Graph* g, const string& outside_compilation_attr_name);
120 Graph* g, const string& outside_compilation_attr_name);
|
| deadness_analysis.h | 19 #include "tensorflow/core/graph/graph.h"
23 // This analyzes a TensorFlow graph to identify nodes which may have partially
27 // For example, the ADD node in the following graph
60 // Run the deadness analysis over `graph` and returns an error or a populated
62 static Status Run(const Graph& graph,
|
| resource_operation_safety_analysis.h | 21 #include "tensorflow/core/graph/graph.h"
37 // In other words, if these pairs are seen as edges in an undirected graph of
38 // the nodes in `g` then auto-clustering is at least as constrained as the graph
39 // coloring problem on this graph.
42 // For instance if we auto-cluster all operations in this TensorFlow graph:
68 const Graph& g, const FunctionLibraryDefinition* flib_def,
|
| test_util.h | 28 #include "tensorflow/core/graph/graph.h"
33 // Tests that the shapes in 'shape_info' for the nodes in `graph` match
35 // that do not have shape information. Ignores nodes in `graph` that do not have
38 const Graph& graph, const GraphShapeInfo& shape_info,
|
| shape_inference_helpers.h | 21 #include "tensorflow/core/graph/graph.h"
26 // graph. Simple algorithms for shape inference don't work with cycles, and this
30 // to Replace() is optional if the graph will be discarded without being
47 // Temporarily removes all the back edges in graph.
48 Status Remove(Graph* graph);
57 Graph* graph_ = nullptr; // not owned
|
| /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/antlr/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 30 import org.antlr.misc.Graph;
41 Graph<String> g = new Graph<String>();
62 Graph<String> g = new Graph<String>();
76 Graph<String> g = new Graph<String>();
90 Graph<String> g = new Graph<String>();
104 Graph<String> g = new Graph<String>()
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow.h | 22 #include "tensorflow/core/graph/graph.h"
30 Status FunctionalizeControlFlow(Graph* graph,
33 Graph* graph,
42 // This pass looks at the graph and all associated FunctionDefs, and turns
|
| /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...] |
