| /external/v8/src/compiler/ |
| scheduler.h | 23 class Graph;
27 // Computes a schedule from a graph, placing nodes into basic blocks and
36 // nodes from the graph into it.
37 static Schedule* ComputeSchedule(Zone* temp_zone, Graph* graph, Flags flags);
70 Graph* graph_;
82 Scheduler(Zone* zone, Graph* graph, Schedule* schedule, Flags flags,
99 // Phase 1: Build control-flow graph.
|
| type-narrowing-reducer.h | 9 #include "src/compiler/graph-reducer.h"
32 Graph* graph() const;
|
| all-nodes.cc | 7 #include "src/compiler/graph.h"
13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs)
15 is_reachable_(graph->NodeCount(), false, local_zone),
17 Mark(local_zone, graph->end(), graph);
20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph,
23 is_reachable_(graph->NodeCount(), false, local_zone),
25 Mark(local_zone, end, graph);
[all...] |
| dead-code-elimination.h | 9 #include "src/compiler/graph-reducer.h"
20 // Propagates {Dead} control and {DeadValue} values through the graph and
27 // {Unreachable} nodes to the graph end, since this is much easier if there is
38 // In contrast to {DeadValue}, {Dead} can never remain in the graph.
42 DeadCodeElimination(Editor* editor, Graph* graph,
70 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
74 Graph* const graph_;
|
| node-marker.h | 15 class Graph;
21 NodeMarkerBase(Graph* graph, uint32_t num_states);
44 // A NodeMarker assigns a local "state" to every node of a graph in constant
45 // memory. Only one NodeMarker per graph is valid at a given time, that is,
63 V8_INLINE NodeMarker(Graph* graph, uint32_t num_states)
64 : NodeMarkerBase(graph, num_states) {}
|
| pipeline.h | 34 class Graph;
57 // Run the pipeline on a machine graph and generate code. The {schedule} must
58 // be valid, hence the given {graph} does not need to be schedulable.
60 Isolate* isolate, CallDescriptor* call_descriptor, Graph* graph,
74 // Run the pipeline on a machine graph and generate code. If {schedule} is
78 CallDescriptor* call_descriptor, Graph* graph,
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| mark_for_compilation_pass_test.cc | 35 #include "tensorflow/core/graph/algorithm.h"
36 #include "tensorflow/core/graph/graph_constructor.h"
37 #include "tensorflow/core/graph/graph_def_builder.h"
38 #include "tensorflow/core/graph/graph_def_builder_util.h"
50 std::unordered_map<string, string> GetClusters(const Graph& graph) {
52 for (Node* node : graph.nodes()) {
70 const Graph& g, std::vector<string>* cluster_names = nullptr) {
89 std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()))
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| costmodel_manager.cc | 33 CostModel* CostModelManager::FindOrCreateCostModel(const Graph* graph) {
35 auto it = cost_models_.find(graph);
40 cost_model->InitFromGraph(*graph);
41 cost_models_.emplace(graph, cost_model);
45 bool CostModelManager::RemoveCostModelForGraph(const Graph* graph) {
47 auto itr = cost_models_.find(graph);
52 cost_models_.erase(graph);
56 Status CostModelManager::AddToCostGraphDef(const Graph* graph
[all...] |
| graph_optimizer.cc | 20 #include "tensorflow/core/graph/algorithm.h"
21 #include "tensorflow/core/graph/graph_constructor.h"
22 #include "tensorflow/core/graph/node_builder.h"
23 #include "tensorflow/core/graph/optimizer_cse.h"
38 std::unique_ptr<Graph>* graph,
42 Graph* g = graph->get();
102 // Note that we use the Graph constructor that copies the input
104 std::unique_ptr<Graph> copy(new Graph(g->flib_def()))
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| adjust_contrast_op_benchmark_test.cc | 18 #include "tensorflow/core/graph/node_builder.h"
24 static Graph* BM_AdjustContrast(int batches, int width, int height) {
25 Graph* g = new Graph(OpRegistry::Global());
33 .Input(test::graph::Constant(g, in))
34 .Input(test::graph::Constant(g, factor))
|
| diag_op_test.cc | 24 static Graph* Diag(int n, DataType type) {
25 Graph* g = new Graph(OpRegistry::Global());
28 Node* out = test::graph::Diag(g, test::graph::Constant(g, in), type);
29 test::graph::DiagPart(g, out, type);
|
| multinomial_op_test.cc | 21 #include "tensorflow/core/graph/node_builder.h"
27 static Graph* Multinomial(int batch_size, int num_classes, int num_samples) {
28 Graph* g = new Graph(OpRegistry::Global());
36 .Input(test::graph::Constant(g, logits_t))
37 .Input(test::graph::Constant(g, num_samples_t))
|
| resize_op_benchmark_test.cc | 18 #include "tensorflow/core/graph/node_builder.h"
24 static Graph* BM_Resize(const char* algorithm, int batches, int width,
26 Graph* g = new Graph(OpRegistry::Global());
37 .Input(test::graph::Constant(g, in))
38 .Input(test::graph::Constant(g, out_size))
|
| xent_op_test.cc | 24 static Graph* Xent(int batch_size, int num_classes) {
25 Graph* g = new Graph(OpRegistry::Global());
30 test::graph::Binary(g, "SoftmaxCrossEntropyWithLogits",
31 test::graph::Constant(g, logits),
32 test::graph::Constant(g, labels));
|
| substr_op_test.cc | 30 #include "tensorflow/core/graph/graph.h"
31 #include "tensorflow/core/graph/node_builder.h"
32 #include "tensorflow/core/graph/testlib.h"
48 "The graph nodes represent mathematical operations, while the graph edges "
135 Graph* SetupSubstrGraph(const Tensor& input, const int32 pos, const int32 len,
137 Graph* g = new Graph(OpRegistry::Global());
144 .Input(test::graph::Constant(g, input)
[all...] |
| /external/tensorflow/tensorflow/go/ |
| saved_model.go | 32 Graph *Graph
39 // Tags in the model identify a single graph. LoadSavedModel initializes a
40 // session with the identified graph and with variables initialized to from the
60 graph := NewGraph()
62 cSess := C.TF_LoadSessionFromSavedModel(cOpt, nil, cExportDir, (**C.char)(unsafe.Pointer(&cTags[0])), C.int(len(cTags)), graph.c, nil, status.c)
73 return &SavedModel{Session: s, Graph: graph}, nil
|
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/op/ |
| OperandsTest.java | 26 import org.tensorflow.Graph;
37 try (Graph g = new Graph()) {
|
| PrimitiveOpTest.java | 28 import org.tensorflow.Graph;
38 try (Graph g = new Graph()) {
|
| ScopeTest.java | 27 import org.tensorflow.Graph;
40 try (Graph g = new Graph()) {
51 try (Graph g = new Graph()) {
77 try (Graph g = new Graph()) {
90 try (Graph g = new Graph()) {
127 try (Graph g = new Graph())
[all...] |
| /external/testng/src/test/java/test/ |
| GraphTest.java | 6 import org.testng.internal.Graph;
21 Graph<String> g = new Graph<>();
54 Graph<String> g = createCyclicGraph();
60 Graph<String> g = null;
72 private Graph<String> createCyclicGraph() {
73 Graph<String> g = new Graph<>();
87 Graph<String> g = new Graph<>();
[all...] |
| /external/llvm/lib/Analysis/ |
| CFLGraph.h | 27 /// \brief The Program Expression Graph (PEG) of CFL analysis
30 /// the main purpose of this graph is to abstract away unrelated facts and
32 /// Each Node in the graph is an InstantiatedValue, and each edge represent a
34 /// references/dereferences are not explicitly stored in the graph: we
144 CFLGraph Graph;
148 /// Gets the edges our graph should have, based on an Instruction*
153 CFLGraph &Graph;
182 if (Graph.addNode(InstantiatedValue{GVal, 0},
184 Graph.addNode(InstantiatedValue{GVal, 1}, getAttrUnknown());
187 if (Graph.addNode(InstantiatedValue{CExpr, 0})
[all...] |
| /external/tensorflow/tensorflow/contrib/framework/python/ops/ |
| ops_test.py | 31 with ops.Graph().as_default() as g0:
35 g0 = ops.Graph()
40 with ops.Graph().as_default():
45 g0 = ops.Graph()
48 g1 = ops.Graph()
49 with self.assertRaisesRegexp(ValueError, "not from the passed-in graph"):
53 with self.assertRaisesRegexp(ValueError, "must be from the same graph"):
55 with self.assertRaisesRegexp(ValueError, "not from the passed-in graph"):
57 with self.assertRaisesRegexp(ValueError, "not from the passed-in graph"):
|
| /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/ |
| TestUtil.java | 47 public static <T> Output<T> constant(Graph g, String name, Object value) {
57 public static <T> Output<T> placeholder(Graph g, String name, Class<T> type) {
64 public static <T> Output<T> addN(Graph g, Output<?>... inputs) {
69 Graph g, String name, Output<T> a, Output<T> b, boolean transposeA, boolean transposeB) {
79 public static Operation split(Graph g, String name, int[] values, int numSplit) {
87 public static <T> Output<T> square(Graph g, String name, Output<T> value) {
94 public static void transpose_A_times_X(Graph g, int[][] a) {
|
| /external/tensorflow/tensorflow/python/framework/ |
| importer_test.py | 62 with ops.Graph().as_default():
120 with ops.Graph().as_default():
158 # "absolute" name scope (see the Graph.name_scope docstring).
222 with ops.Graph().as_default():
227 # Import graph def that uses name scope name
236 with ops.Graph().as_default():
263 with ops.Graph().as_default():
290 with ops.Graph().as_default():
317 with ops.Graph().as_default():
328 with ops.Graph().as_default()
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| build.c | 84 Graph
96 Graph g;
160 Graph
169 Graph g;
192 Graph
201 Graph g;
268 Graph
277 Graph g;
296 * Or two subgraphs into one graph via:
307 Graph
[all...] |
