| /external/v8/src/compiler/ |
| 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 | 29 class Graph;
48 // Run the pipeline on a machine graph and generate code. The {schedule} must
49 // be valid, hence the given {graph} does not need to be schedulable.
52 Graph* graph, Schedule* schedule,
60 // Run the pipeline on a machine graph and generate code. If {schedule} is
63 Graph* graph,
71 // Run the pipeline on a machine graph and generate code. If {schedule} is
74 CompilationInfo* info, CallDescriptor* call_descriptor, Graph* graph
[all...] |
| simplified-lowering.cc | 44 // 1.) PROPAGATE: Traverse the graph from the end, pushing usage information
291 count_(jsgraph->graph()->NodeCount()),
315 typing_stack_.push({graph()->end(), 0});
316 GetInfo(graph()->end())->set_pushed();
562 EnqueueInitial(jsgraph_->graph()->end());
1159 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::RepresentationSelector
[all...] |
| osr.cc | 13 #include "src/compiler/graph-reducer.h"
14 #include "src/compiler/graph-trimmer.h"
15 #include "src/compiler/graph-visualizer.h"
16 #include "src/compiler/graph.h"
17 #include "src/compiler/js-graph.h"
52 // Peel outer loops and rewire the graph so that control reduction can
53 // produce a properly formed graph.
54 void PeelOuterLoopsForOsr(Graph* graph, CommonOperatorBuilder* common,
58 const size_t original_count = graph->NodeCount()
278 Graph* graph = jsgraph->graph(); local
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-check-elimination.h | 18 explicit HCheckEliminationPhase(HGraph* graph)
19 : HPhase("H_Check Elimination", graph), aliasing_(),
24 graph->isolate()->factory()->name##_map()), zone());
|
| hydrogen-escape-analysis.h | 17 explicit HEscapeAnalysisPhase(HGraph* graph)
18 : HPhase("H_Escape analysis", graph),
23 block_states_(graph->blocks()->length(), zone()) { }
|
| hydrogen-dce.cc | 51 for (int i = 0; i < graph()->blocks()->length(); ++i) {
52 HBasicBlock* block = graph()->blocks()->at(i);
68 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone());
71 for (int i = 0; i < graph()->blocks()->length(); ++i) {
72 HBasicBlock* block = graph()->blocks()->at(i);
79 // Clear the liveness flag to leave the graph clean for the next DCE.
|
| /external/tensorflow/tensorflow/python/framework/ |
| meta_graph.py | 136 """Collect the list of ops used by a graph.
141 graph_def: A `GraphDef` proto, as from `graph.as_graph_def()`.
144 A list of strings, each naming an op used by the graph.
172 """Collect the stripped OpDefs for ops used by a graph.
180 graph_def: A `GraphDef` proto, as from `graph.as_graph_def()`.
183 An `OpList` of ops used by the graph.
202 raise ValueError("Op %s is used by the graph, but is not registered" % op)
246 tensor_name: the full name of a Tensor in the graph.
271 node_name: the full name of an Op or a Tensor in the graph.
304 # If not, we need to walk up the graph from any restore_all nodes, and wal
[all...] |
| /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/ |
| GraphRunner.java | 27 * A GraphRunner schedules and executes the filter nodes of a graph.
197 public void enterSubGraph(FilterGraph graph, SubListener listener) {
199 onOpenGraph(graph);
289 private void onPrepare(FilterGraph graph) {
293 onOpenGraph(graph);
297 private void onOpenGraph(FilterGraph graph) {
298 loadFilters(graph);
299 mOpenedGraphs.add(graph);
380 for (FilterGraph graph : mOpenedGraphs) {
381 graph.flushFrames()
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| reduction_ops_test.cc | 24 // Creates a Graph which "reduce"s a 3D float tensor of "num" elements
27 static Graph* ToScalar(const string& reduce, int num_x, int num_y) {
28 auto* g = new Graph(OpRegistry::Global());
34 test::graph::Reduce(g, reduce, test::graph::Constant(g, data),
35 test::graph::Constant(g, axes));
39 static Graph* ColReduce(const string& reduce, int num_x, int num_y) {
40 auto* g = new Graph(OpRegistry::Global());
45 test::graph::Reduce(g, reduce, test::graph::Constant(g, data)
[all...] |
| /prebuilts/tools/common/m2/repository/org/eclipse/aether/aether-util/1.0.2.v20150114/ |
| aether-util-1.0.2.v20150114.jar | |
| /prebuilts/tools/common/m2/repository/org/eclipse/aether/aether-util/0.9.0.M3/ |
| aether-util-0.9.0.M3.jar | |
| /art/compiler/optimizing/ |
| graph_checker.h | 29 // A control-flow graph visitor performing various checks.
32 explicit GraphChecker(HGraph* graph, const char* dump_prefix = "art::GraphChecker: ")
33 : HGraphDelegateVisitor(graph),
34 errors_(graph->GetAllocator()->Adapter(kArenaAllocGraphChecker)),
36 allocator_(graph->GetArenaStack()),
37 seen_ids_(&allocator_, graph->GetCurrentInstructionId(), false, kArenaAllocGraphChecker) {
41 // Check the whole graph (in reverse post-order).
77 // Was the last visit of the graph valid?
102 // Errors encountered while checking the graph.
|
| induction_var_range.h | 88 * generated in given block and graph and are returned in the output parameters lower and
102 HGraph* graph,
109 * given block and graph. Returns generated taken-test.
113 HInstruction* GenerateTakenTest(HInstruction* context, HGraph* graph, HBasicBlock* block);
123 * Code is generated in given block and graph. Returns generated last value.
127 HInstruction* GenerateLastValue(HInstruction* instruction, HGraph* graph, HBasicBlock* block);
176 HGraph* graph,
181 * and graph. The expression is guarded by a taken test if needed. Returns the trip count
184 HInstruction* GenerateTripCount(HLoopInformation* loop, HGraph* graph, HBasicBlock* block);
278 HGraph* graph,
[all...] |
| /development/vndk/tools/definition-tool/tests/ |
| utils.py | 25 self.graph = ELFLinker()
43 lib = self.graph.add_lib(partition, path, elf)
72 self.graph.vndk_lib_dirs = vndk_lib_dirs
74 self.graph.ro_vndk_version = ro_vndk_version
75 self.graph.resolve_deps()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| constant_folding.h | 33 // Constant folding optimization for a graph.
37 static string AddControlDependency(const string& input_name, GraphDef* graph,
81 GraphDef* graph);
83 GraphDef* graph);
86 NodeDef* node, GraphDef* graph);
87 void ReplaceDivisionOfOnesByReciprocal(NodeDef* node, GraphDef* graph);
|
| /external/testng/src/main/java/org/testng/internal/ |
| Tarjan.java | 12 * Implementation of the Tarjan algorithm to find and display a cycle in a graph.
22 public Tarjan(Graph<T> graph, T start) {
24 run(graph, start);
27 private void run(Graph<T> graph, T v) {
33 for (T vprime : graph.getPredecessors(v)) {
35 run(graph, vprime);
56 Graph<String> g = new Graph<>();
[all...] |
| /external/tensorflow/tensorflow/core/debug/ |
| debug_gateway_test.cc | 25 #include "tensorflow/core/graph/testlib.h"
36 // Turn off graph optimizer so we can observe intermediate node states.
54 Graph graph(OpRegistry::Global());
66 Node* a = test::graph::Constant(&graph, a_tensor);
72 Node* x = test::graph::Constant(&graph, x_tensor);
77 Node* y = test::graph::Matmul(&graph, a, x, false, false)
[all...] |
| /external/tensorflow/tensorflow/c/ |
| c_api_internal.h | 33 #include "tensorflow/core/graph/graph.h"
34 #include "tensorflow/core/graph/graph_constructor.h"
35 #include "tensorflow/core/graph/node_builder.h"
78 tensorflow::Graph graph GUARDED_BY(mu);
83 // Maps from name of an operation to the Node* in 'graph'.
87 // The keys of this map are all the active sessions using this graph.
103 // Used to link graphs contained in TF_WhileParams to the parent graph that
112 : node_builder(node_name, op_type, g->graph.op_registry()), graph(g) {
115 TF_Graph* graph; member in struct:TF_OperationDescription
127 TF_Graph* graph; member in struct:TF_Session
[all...] |
| /external/tensorflow/tensorflow/contrib/timeseries/python/timeseries/ |
| saved_model_utils.py | 34 graph):
43 input_key: graph.as_graph_element(input_value.name)
47 output_key: graph.as_graph_element(output_value.name)
76 session: The session to use. The session's graph must be the one into which
111 graph=session.graph)
132 session: The session to use. The session's graph must be the one into which
160 graph=session.graph)
|
| /external/tensorflow/tensorflow/examples/speech_commands/ |
| label_wav_dir.py | 15 r"""Runs a trained audio graph against WAVE files and reports the results.
25 --graph=/tmp/my_frozen_graph.pb \
48 """Unpersists graph from file as default graph."""
62 """Runs the audio data through the graph and prints predictions."""
64 # Feed the audio data as input to the graph.
75 softmax_tensor = sess.graph.get_tensor_by_name(output_layer_name)
89 def label_wav(wav_dir, labels, graph, input_name, output_name, how_many_labels):
94 if not graph or not tf.gfile.Exists(graph)
[all...] |
| /external/tensorflow/tensorflow/go/ |
| operation_test.go | 26 // createGraphAndOp creates an Operation but loses the reference to the Graph.
41 // Ensure that the Graph is not garbage collected while the program
57 graph := NewGraph()
58 c1, err := Const(graph, "c1", int64(1))
62 c2, err := Const(graph, "c2", [][]int64{{1, 2}, {3, 4}})
67 op, err := graph.AddOperation(OpSpec{
102 graph := NewGraph()
137 c, err := Const(graph, fmt.Sprintf("const%d", idx), test.Value)
160 placeholder, err := Placeholder(graph, "placeholder", dummyTensor.DataType())
174 // Operation did not hold on to a reference to Graph. With thi
[all...] |
| /external/tensorflow/tensorflow/contrib/graph_editor/ |
| util.py | 166 """Check that all the element in args belong to the same graph.
169 *args: a list of object with a obj.graph property.
171 ValueError: if all the elements do not belong to the same graph.
173 graph = None
175 if graph is None and sgv.graph is not None:
176 graph = sgv.graph
177 elif sgv.graph is not None and sgv.graph is not graph
384 def graph(self): member in class:ControlOutputs
[all...] |
| /external/tensorflow/tensorflow/contrib/graph_editor/tests/ |
| transform_test.py | 41 self.graph = ops.Graph()
42 with self.graph.as_default():
50 graph = ops.Graph()
51 _, info = ge.copy(self.graph, graph)
53 set(op.name for op in self.graph.get_operations()),
54 set(op.name for op in graph.get_operations()))
55 src_ops = self.graph.get_operations(
[all...] |
| /external/skia/tools/ |
| sk_tool_utils.h | 200 static void AllocNodes(SkTArray<sk_sp<sk_tool_utils::TopoTestNode>>* graph, int num) {
201 graph->reserve(num);
204 graph->push_back(sk_sp<TopoTestNode>(new TopoTestNode(i)));
209 static void Print(const SkTArray<TopoTestNode*>& graph) {
210 for (int i = 0; i < graph.count(); ++i) {
211 SkDebugf("%d, ", graph[i]->id());
218 static void Shuffle(SkTArray<sk_sp<TopoTestNode>>* graph, SkRandom* rand) {
219 for (int i = graph->count()-1; i > 0; --i) {
222 (*graph)[i].swap((*graph)[swap])
[all...] |
