| /external/v8/src/crankshaft/ |
| hydrogen-bce.h | 31 explicit HBoundsCheckEliminationPhase(HGraph* graph)
32 : HPhase("H_Bounds checks elimination", graph), table_(zone()) { }
35 EliminateRedundantBoundsChecks(graph()->entry_block());
|
| hydrogen-range-analysis.h | 17 explicit HRangeAnalysisPhase(HGraph* graph)
18 : HPhase("H_Range analysis", graph), changed_ranges_(16, zone()),
19 in_worklist_(graph->GetMaximumValueID(), zone()),
|
| hydrogen-osr.cc | 23 HGraph* graph = builder_->graph(); local
26 DCHECK(graph->osr() == NULL);
28 // remember this builder as the one OSR builder in the graph.
29 graph->set_osr(this);
31 HBasicBlock* non_osr_entry = graph->CreateBasicBlock();
32 osr_entry_ = graph->CreateBasicBlock();
33 HValue* true_value = graph->GetConstantTrue();
38 HBasicBlock* loop_predecessor = graph->CreateBasicBlock();
|
| hydrogen-sce.cc | 16 for (int i = 0; i < graph()->blocks()->length(); i++) {
17 HBasicBlock* block = graph()->blocks()->at(i);
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| const_analysis_test.cc | 41 Graph graph(OpRegistry::Global());
42 TF_ASSERT_OK(root.ToGraph(&graph));
45 TF_ASSERT_OK(BackwardsConstAnalysis(graph, &const_args));
47 // Arg 0 doesn't need to be constant since the graph only uses its shape.
72 Graph graph(OpRegistry::Global());
73 TF_ASSERT_OK(root.ToGraph(&graph));
76 TF_ASSERT_OK(BackwardsConstAnalysis(graph, &const_args));
|
| graph_compiler.h | 36 // GraphCompiler compiles the graph in topological order in the current
37 // thread. It also resolves the nondeterminism in the graph by enforcing a
40 // If a function call is visited during the graph traversal, it is then
59 Graph* graph, FunctionLibraryRuntime* flib,
63 graph_(graph),
67 // Compiles the graph. The results are written in `xla_context` that is passed
87 Graph* graph_;
90 // A buffer to hold tensor inputs to a node, this is reused across the graph
|
| tf2xla.cc | 32 #include "tensorflow/core/framework/graph.pb.h"
37 #include "tensorflow/core/graph/algorithm.h"
38 #include "tensorflow/core/graph/graph.h"
39 #include "tensorflow/core/graph/graph_constructor.h"
40 #include "tensorflow/core/graph/node_builder.h"
64 Status AddArgNodes(Graph* graph, const NodeMap& node_map,
86 // "_shape" attr if we can determine it. That way the graph will be
97 .Finalize(graph, &arg_node))
352 std::unique_ptr<Graph> graph; local
[all...] |
| /external/tensorflow/tensorflow/contrib/graph_editor/tests/ |
| select_test.py | 32 self.graph = ops_lib.Graph()
33 with self.graph.as_default():
55 self.assertEqual(len(ge.select._get_input_ts(self.graph)), 6)
56 self.assertEqual(len(ge.select._get_output_ts(self.graph)), 8)
61 self.assertEqual(len(ge.filter_ops(self.graph, True)), 8)
63 len(ge.filter_ops(self.graph, lambda op: op.node_def.op == "Const")), 3)
65 len(ge.filter_ops(self.graph, lambda op: op.node_def.op == "Add")), 5)
67 len(ge.filter_ops_from_regex(self.graph, r"^.*\b[abc]$")), 3)
69 self.assertEqual(len(ge.filter_ts(self.graph, True)), 8
[all...] |
| /external/tensorflow/tensorflow/contrib/quantize/python/ |
| common.py | 42 def BatchNormGroups(graph):
46 graph: Graph to inspect.
52 for op in graph.get_operations():
62 def GetEndpointActivationOp(graph, prefix):
66 graph: Graph where to look for the operation.
71 there are no matching operations in the graph for any valid suffix
74 activation = _GetOperationByNameDontThrow(graph, prefix + suffix)
80 def _GetOperationByNameDontThrow(graph, name)
[all...] |
| /external/tensorflow/tensorflow/contrib/tfprof/ |
| tfprof_logger.py | 28 def write_op_log(graph, log_dir, op_log=None, run_meta=None, add_trace=True):
29 _write_op_log(graph, log_dir, op_log, run_meta, add_trace)
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| constant_folding.h | 22 #include "tensorflow/core/graph/graph.h"
30 std::function<string(Graph* graph, string old_name)>;
52 // Perform constant folding optimization on "graph".
53 // Looks for nodes in "graph" that can be completely evaluated statically, i.e.,
56 // "partition_device", if non-null, is the device where all the graph nodes are
58 // Sets `was_mutated` to true if and only if "graph" has been mutated.
60 // running the graph.
63 Device* partition_device, Graph* graph, bool* was_mutated)
[all...] |
| placer.h | 23 #include "tensorflow/core/graph/graph.h"
32 // A placement algorithm that assigns the nodes of the given Graph to
43 // The implementation builds a constraint graph with the same set of
45 // nodes. Each connected component in the resulting constraint graph
54 // placement algorithms so that they may be injected into the graph
58 // A map from graph node names to numerical IDs (in a Graph object).
62 // Graph "graph" (nodes in which may or may not be assigned) on th
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| grappler_test.cc | 26 const GraphDef& graph, const std::vector<string>& node_names) {
29 TF_CHECK_OK(session->Create(graph));
|
| /external/tensorflow/tensorflow/python/framework/ |
| c_api_util.py | 44 self.graph = c_api.TF_NewGraph()
50 c_api.TF_DeleteGraph(self.graph)
72 # get serialized graph def into buf
115 def tf_operations(graph):
116 """Generator that yields every TF_Operation in `graph`.
119 graph: Graph
126 c_op, pos = c_api.TF_GraphNextOperation(graph._c_graph, pos)
129 c_op, pos = c_api.TF_GraphNextOperation(graph._c_graph, pos)
133 def new_tf_operations(graph)
[all...] |
| /external/tensorflow/tensorflow/python/profiler/ |
| tfprof_logger.py | 39 def _fill_missing_graph_shape(graph, run_meta):
40 """Fill Tensor shapes in 'graph' with run time shape from 'run_meta'."""
46 op = graph.get_operation_by_name(node_stat.node_name)
48 # Graph doesn't contains the node_stat, usually RecvTensor.
65 return graph
77 def _get_logged_ops(graph, run_meta=None, add_trace=True,
79 """Extract trainable model parameters and FLOPs for ops from a Graph.
82 graph: tf.Graph.
92 graph = _fill_missing_graph_shape(graph, run_meta
[all...] |
| /frameworks/base/media/mca/filterfw/java/android/filterfw/core/ |
| RandomScheduler.java | 33 public RandomScheduler(FilterGraph graph) {
34 super(graph);
|
| /system/update_engine/payload_generator/ |
| tarjan.h | 21 // Strongly Connected Components in a graph.
24 // in the graph. This implementation will only find the strongly connected
39 Graph* graph,
42 void Tarjan(Vertex::Index vertex, Graph* graph);
|
| /external/tensorflow/tensorflow/core/debug/ |
| grpc_session_debug_test.cc | 23 #include "tensorflow/core/framework/graph.pb.h"
27 #include "tensorflow/core/graph/default_device.h"
28 #include "tensorflow/core/graph/graph.h"
29 #include "tensorflow/core/graph/testlib.h"
53 Graph graph(OpRegistry::Global());
57 Node* a = test::graph::Constant(&graph, a_tensor);
62 Node* b = test::graph::Constant(&graph, b_tensor)
152 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/c/ |
| c_test_util.cc | 84 void PlaceholderHelper(TF_Graph* graph, TF_Status* s, const char* name,
86 TF_OperationDescription* desc = TF_NewOperation(graph, "Placeholder", name);
93 TF_Operation* Placeholder(TF_Graph* graph, TF_Status* s, const char* name) {
95 PlaceholderHelper(graph, s, name, &op);
99 void ConstHelper(TF_Tensor* t, TF_Graph* graph, TF_Status* s, const char* name,
101 TF_OperationDescription* desc = TF_NewOperation(graph, "Const", name);
110 TF_Operation* Const(TF_Tensor* t, TF_Graph* graph, TF_Status* s,
113 ConstHelper(t, graph, s, name, &op);
117 TF_Operation* ScalarConst(int32_t v, TF_Graph* graph, TF_Status* s,
120 return Const(tensor.get(), graph, s, name)
[all...] |
| /development/vndk/tools/definition-tool/tests/ |
| test_elf_linker.py | 57 graph = gb.graph
59 node = graph.get_lib('/system/lib/libc.so')
63 node = graph.get_lib('/system/lib64/libdl.so')
67 node = graph.get_lib('/vendor/lib64/libEGL.so')
71 self.assertEqual(None, graph.get_lib('/no/such/path.so'))
76 graph = gb.graph
80 nodes = graph.get_libs(paths, bad.append)
88 nodes = graph.get_libs(paths, bad.append
[all...] |
| /system/core/libmemunreachable/ |
| Tarjan.h | 58 using Graph = allocator::vector<Node<T>*>;
72 void Execute(Graph<T>& graph, SCCList<T>& out);
76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
84 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) {
88 for (auto& it : graph) {
93 for (auto& it : graph) {
95 Tarjan(it, graph);
[all...] |
| /external/tensorflow/tensorflow/contrib/tensorrt/segment/ |
| segment.cc | 23 #include "tensorflow/core/graph/algorithm.h"
24 #include "tensorflow/core/graph/graph.h"
25 #include "tensorflow/core/graph/graph_constructor.h"
37 const tensorflow::Graph& graph) {
42 // graph. So, if there is a directed path from 'src' to 'dst', other
46 // In practice, to avoid modifying the graph and to take advantage
47 // of existing graph functions, we perform an equivalent.
60 tensorflow::ReverseDFSFrom(graph, dfs_start_nodes, {}
[all...] |
| /external/tensorflow/tensorflow/contrib/tensorrt/convert/ |
| convert_graph.cc | 26 #include "tensorflow/core/graph/algorithm.h"
27 #include "tensorflow/core/graph/graph.h"
28 #include "tensorflow/core/graph/graph_constructor.h"
63 void GetSubGraphIncomingEdges(const tensorflow::Graph& graph,
67 const tensorflow::Node* node = graph.FindNodeId(node_id);
77 void GetSubGraphOutgoingEdges(const tensorflow::Graph& graph,
81 const tensorflow::Node* node = graph.FindNodeId(node_id)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| graph_test.go | 1 package graph package
33 func graphDebugString(graph *Graph) string {
35 for i, node := range graph.Nodes {
39 for i, node := range graph.Nodes {
80 // graphsEqual checks if graph is equivalent to the graph templated by expected.
81 func graphsEqual(graph *Graph, expected []expectedNode) bool {
82 if len(graph.Nodes) != len(expected)
[all...] |
| /prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
| graph_test.go | 1 package graph package
33 func graphDebugString(graph *Graph) string {
35 for i, node := range graph.Nodes {
39 for i, node := range graph.Nodes {
80 // graphsEqual checks if graph is equivalent to the graph templated by expected.
81 func graphsEqual(graph *Graph, expected []expectedNode) bool {
82 if len(graph.Nodes) != len(expected)
[all...] |
