| /external/v8/src/compiler/ |
| graph-assembler.cc | 5 #include "src/compiler/graph-assembler.h"
31 return graph()->NewNode(common()->Int32Constant(value));
66 return graph()->NewNode(machine()->Name(), input); \
73 return graph()->NewNode(machine()->Name(), left, right); \
80 return graph()->NewNode(machine()->Name(), left, right, current_control_); \
87 return graph()->NewNode(machine()->Float64RoundDown().op(), value);
93 return graph()->NewNode(common()->Projection(index), value, current_control_);
98 graph()->NewNode(simplified()->Allocate(NOT_TENURED), size,
104 graph()->NewNode(simplified()->LoadField(access), object,
111 graph()->NewNode(simplified()->LoadElement(access), object, index
[all...] |
| graph-visualizer.h | 21 class Graph;
32 AsJSON(const Graph& g, SourcePositionTable* p) : graph(g), positions(p) {}
33 const Graph& graph; member in struct:v8::internal::compiler::AsJSON
40 explicit AsRPO(const Graph& g) : graph(g) {}
41 const Graph& graph; member in struct:v8::internal::compiler::AsRPO
|
| js-inlining-heuristic.cc | 200 Node** inputs = graph()->zone()->NewArray<Node*>(input_count);
212 graph()->NewNode(simplified()->ReferenceEqual(), callee, target);
214 graph()->NewNode(common()->Branch(), check, fallthrough_control);
215 fallthrough_control = graph()->NewNode(common()->IfFalse(), branch);
216 if_successes[i] = graph()->NewNode(common()->IfTrue(), branch);
225 calls[i] = graph()->NewNode(node->op(), input_count, inputs);
226 if_successes[i] = graph()->NewNode(common()->IfSuccess(), calls[i]);
243 graph()->NewNode(common()->IfException(), calls[i], calls[i]);
246 graph()->NewNode(common()->Merge(num_calls), num_calls, if_exceptions);
248 Node* exception_effect = graph()->NewNode(common()->EffectPhi(num_calls)
308 Graph* JSInliningHeuristic::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSInliningHeuristic
[all...] |
| simd-scalar-lowering.cc | 20 Graph* graph, MachineOperatorBuilder* machine,
24 graph_(graph),
27 state_(graph, 3),
32 graph->NewNode(common->Parameter(-2, "placeholder"), graph->start())),
34 DCHECK_NOT_NULL(graph);
35 DCHECK_NOT_NULL(graph->end());
36 replacements_ = zone->NewArray<Replacement>(graph->NodeCount());
37 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount())
[all...] |
| compiler-source-position-table.cc | 6 #include "src/compiler/graph.h"
27 SourcePositionTable::SourcePositionTable(Graph* graph)
28 : graph_(graph),
31 table_(graph->zone()) {}
|
| /external/tensorflow/tensorflow/cc/profiler/ |
| profiler.h | 19 #include "tensorflow/core/framework/graph.pb.h"
31 /// A `Profiler` object lets the caller profile the execution of a graph.
34 /// // First build a graph and run tracing.
49 /// GraphDef graph;
50 /// root.ToGraphDef(&graph);
51 /// Profiler profiler(graph);
58 /// `graph` is the model's GraphDef.
59 Profiler(const GraphDef& graph);
69 /// Profiles the model by organizing nodes in graph structure.
|
| /external/tensorflow/tensorflow/compiler/aot/ |
| flags.h | 29 string graph; member in struct:tensorflow::tfcompile::MainFlags
|
| /external/tensorflow/tensorflow/contrib/remote_fused_graph/pylib/python/ops/ |
| remote_fused_graph_ops_test.py | 37 graph = graph_pb2.GraphDef()
38 node = graph.node.add()
41 node = graph.node.add()
55 inputs, output_types, graph, graph_input_node_names,
|
| /external/tensorflow/tensorflow/contrib/tensorrt/convert/ |
| convert_nodes.h | 23 #include "tensorflow/core/framework/graph.pb.h"
24 #include "tensorflow/core/graph/graph.h"
36 const tensorflow::Graph& graph, const std::set<int>& subgraph_node_ids,
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| 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();
95 // Note that we use the Graph constructor that copies the input
97 std::unique_ptr<Graph> copy(new Graph(g->flib_def()))
[all...] |
| graph_optimizer.h | 20 #include "tensorflow/core/graph/graph.h"
32 // Applies optimization passes specified in 'opts' to 'graph'.
33 // Maybe replace *graph with a new graph object. 'device' is device
34 // on which the 'graph' will execute. It's passed to the optimizers
38 // If shape_map is not null it maps from nodes in graph to partially-known
44 // TODO(b/65453533) introduce a unique way to name nodes in a graph.
50 std::unique_ptr<Graph>* graph,
[all...] |
| graph_runner.h | 26 #include "tensorflow/core/graph/graph.h"
32 // GraphRunner takes a Graph, some inputs to feed, and some outputs
33 // to fetch and executes the graph required to feed and fetch the
37 // partially evaluate inexpensive nodes in a graph, such as for shape
53 // REQUIRES: `graph`, `env`, and `outputs` are not nullptr.
56 Status Run(Graph* graph, FunctionLibraryRuntime* function_library,
|
| function_testlib.cc | 62 NodeDefBuilder builder(op_name, fn_name, scope->graph()->op_registry());
69 Node* n = scope->graph()->AddNode(def, &status);
73 scope->graph()->AddEdge(inputs[i].node(), inputs[i].index(), n, i);
|
| /external/tensorflow/tensorflow/core/example/ |
| example_parser_configuration.h | 25 #include "tensorflow/core/framework/graph.pb.h"
38 // Given a graph and the node_name of a ParseExample op,
41 const tensorflow::GraphDef& graph, const string& node_name,
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| utils_test.cc | 17 #include "tensorflow/core/framework/graph.pb.h"
71 GraphDef graph; local
72 NodeDef* input = graph.add_node();
75 NodeDef* filter = graph.add_node();
79 NodeDef* output_backprop = graph.add_node();
83 NodeDef* input_sizes = graph.add_node();
88 NodeDef* filter_sizes = graph.add_node();
103 .Finalize(graph.add_node()));
106 NodeDef* conv = graph.add_node();
114 NodeDef* conv_bp_in = graph.add_node()
150 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/core/public/ |
| session.h | 23 #include "tensorflow/core/framework/graph.pb.h"
33 /// \brief A Session instance lets a caller drive a TensorFlow graph
40 /// with a graph, the caller uses the Run() API to perform the
47 /// tensorflow::GraphDef graph;
48 /// // ... Create or load graph into "graph".
56 /// // Create the session with this graph.
57 /// tensorflow::Status s = session->Create(graph);
60 /// // Run the graph and fetch the first output of the "output"
88 /// \brief Create the graph to be used for the session
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| FilterContext.java | 105 for (FilterGraph graph : mGraphs) {
106 graph.tearDown(this);
123 final void addGraph(FilterGraph graph) {
124 mGraphs.add(graph);
|
| /test/vti/dashboard/src/main/webapp/css/ |
| show_graph.css | 50 .graph-wrapper {
54 .graph {
|
| /art/compiler/optimizing/ |
| optimization.h | 35 HOptimization(HGraph* graph,
38 : graph_(graph),
133 HGraph* graph,
|
| /external/autotest/tko/ |
| machine_test_attribute_graph.cgi | 33 graph = plotgraph.gnuplot(title, 'Kernel', key, xsort = sort_kernels)
34 graph.add_dataset('all kernels', data)
35 graph.plot(cgi_header = True)
|
| /external/tensorflow/tensorflow/core/grappler/ |
| grappler_item.h | 25 #include "tensorflow/core/framework/graph.pb.h"
34 // Models are represented by the combination of a graph, one of more fetch
44 GraphDef graph; member in struct:tensorflow::grappler::GrapplerItem
65 // Return the set nodes used by TensorFlow to initialize the graph.
75 const GraphDef& graph, const std::vector<string>& terminal_nodes);
78 // true if one of the node is missing in the graph, or some node inputs don't
81 const GraphDef& graph, const std::vector<string>& terminal_nodes,
|
| /external/tensorflow/tensorflow/core/kernels/ |
| 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);
|
| slice_op_test.cc | 25 #include "tensorflow/core/graph/node_builder.h"
26 #include "tensorflow/core/graph/testlib.h"
41 Graph* g = new Graph(OpRegistry::Global());
60 .Input(test::graph::Constant(g, input))
61 .Input(test::graph::Constant(g, begin))
62 .Input(test::graph::Constant(g, sizes))
|
| 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));
|
| /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
|
