| /external/v8/src/compiler/ |
| compiler-source-position-table.cc | 6 #include "src/compiler/graph.h"
27 SourcePositionTable::SourcePositionTable(Graph* graph)
28 : graph_(graph),
31 table_(graph->zone()) {}
|
| js-inlining-heuristic.h | 63 Graph* graph() const;
|
| js-inlining.h | 8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
21 // The JSInliner provides the core graph inlining machinery. Note that this
22 // class only deals with the mechanics of how to inline one graph into another,
45 Graph* graph() const;
|
| typed-optimization.h | 10 #include "src/compiler/graph-reducer.h"
59 Graph* graph() const;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
189 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
197 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
207 // graph of basic blocks... these are the same as the basic block iterators,
213 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
230 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
245 // graph of basic blocks... and to walk it in inverse order. Inverse order for
252 return &G.Graph->getEntryBlock();
258 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
189 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
197 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
207 // graph of basic blocks... these are the same as the basic block iterators,
213 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
230 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
245 // graph of basic blocks... and to walk it in inverse order. Inverse order for
252 return &G.Graph->getEntryBlock();
258 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/IR/ |
| CFG.h | 160 // graph of basic blocks...
182 // graph of basic blocks... and to walk it in inverse order. Inverse order for
190 static NodeRef getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
199 static NodeRef getEntryNode(Inverse<const BasicBlock *> G) { return G.Graph; }
209 // graph of basic blocks... these are the same as the basic block iterators,
215 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
232 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
247 // graph of basic blocks... and to walk it in inverse order. Inverse order for
254 return &G.Graph->getEntryBlock();
260 return &G.Graph->getEntryBlock()
[all...] |
| /system/core/libmemunreachable/ |
| LeakFolding.h | 94 Graph<LeakInfo> leak_graph_;
|
| /system/update_engine/payload_generator/ |
| graph_types.h | 33 // for the graph work.
63 // We sometimes wish to consider a subgraph of a graph. A subgraph would have
64 // a subset of the vertices from the graph and a subset of the edges.
81 typedef std::vector<Vertex> Graph;
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow.cc | 32 #include "tensorflow/core/graph/algorithm.h"
33 #include "tensorflow/core/graph/control_flow.h"
107 // Copies a subgraph from `graph` to `output` by performing a reverse DFS
111 // before the traversal clients can cut the graph. If a frame is provided (frame
114 // cut the graph and prevent the traversal from escaping.
122 Status CopySubgraph(const Graph& graph, const Frame* frame,
125 std::vector<Node*>* node_map, Graph* output) {
127 std::vector<bool> visited(graph.num_node_ids(), false);
141 return errors::Internal("Graph traversal of loop frame ", frame->name
[all...] |
| /external/tensorflow/tensorflow/contrib/android/java/org/tensorflow/contrib/android/ |
| TensorFlowInferenceInterface.java | 34 import org.tensorflow.Graph;
43 * Wrapper over the TensorFlow API ({@link Graph}, {@link Session}) providing a smaller API surface
63 this.g = new Graph();
97 + " of the graph, expected to read "
130 this.g = new Graph();
165 * Construct a TensorFlowInferenceInterface with provided Graph
167 * @param g The Graph to use to construct this interface.
169 public TensorFlowInferenceInterface(Graph g) {
249 /** Returns a reference to the Graph describing the computation run during inference. */
250 public Graph graph() method in class:TensorFlowInferenceInterface
[all...] |
| /external/tensorflow/tensorflow/contrib/framework/python/framework/ |
| checkpoint_utils_test.py | 118 # New graph and session.
119 with ops.Graph().as_default() as g:
120 with self.test_session(graph=g) as session:
144 # Check that tensors are not explicitly in the graph.
145 self.assertLess(len(str(session.graph.as_graph_def())), 27000)
152 with ops.Graph().as_default() as g:
161 with self.test_session(graph=g) as session:
171 # New graph and session.
172 with ops.Graph().as_default() as g:
173 with self.test_session(graph=g) as session
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| direct_session_with_tracking_alloc_test.cc | 25 #include "tensorflow/core/framework/graph.pb.h"
30 #include "tensorflow/core/graph/costmodel.h"
31 #include "tensorflow/core/graph/graph.h"
32 #include "tensorflow/core/graph/testlib.h"
49 Graph graph(OpRegistry::Global());
53 Node* a = test::graph::Constant(&graph, a_tensor);
58 Node* x = test::graph::Constant(&graph, x_tensor)
[all...] |
| /external/tensorflow/tensorflow/python/training/ |
| basic_session_run_hooks_test.py | 139 with ops.Graph().as_default():
163 with ops.Graph().as_default():
190 with ops.Graph().as_default():
234 with ops.Graph().as_default(), session_lib.Session() as sess:
286 with ops.Graph().as_default(), session_lib.Session() as sess:
292 with ops.Graph().as_default(), session_lib.Session() as sess:
299 with ops.Graph().as_default(), session_lib.Session() as sess:
344 with ops.Graph().as_default(), session_lib.Session() as sess:
350 with ops.Graph().as_default(), session_lib.Session() as sess:
356 with ops.Graph().as_default(), session_lib.Session() as sess
[all...] |
