/external/tensorflow/tensorflow/core/distributed_runtime/ |
executor_test.cc | 28 #include "tensorflow/core/graph/graph_constructor.h" 59 // Resets executor_ with a new executor based on a graph 'gdef'. 60 void Create(std::unique_ptr<const Graph> graph) { 61 const int version = graph->versions().producer(); 72 TF_CHECK_OK(NewLocalExecutor(params, std::move(graph), &exec_)); 147 std::unique_ptr<Graph> g(new Graph(OpRegistry::Global())); 148 auto in0 = test::graph::Recv(g.get(), "a", "float", ALICE, 1, BOB); 149 auto in1 = test::graph::Recv(g.get(), "b", "float", ALICE, 1, BOB) [all...] |
/external/v8/src/compiler/ |
loop-peeling.cc | 7 #include "src/compiler/graph.h" 49 // from the peeled iteration, resulting in the graph as follows: 98 // graph, but are instead computed by the {LoopFinder}. 110 Peeling(Graph* graph, Zone* tmp_zone, size_t max, NodeVector* p) 111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {} 124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) { 132 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]); 207 PeeledIteration* LoopPeeler::Peel(Graph* graph, CommonOperatorBuilder* common [all...] |
machine-graph-verifier.h | 15 class Graph; 19 // Verifies properties of a scheduled graph, such as that the nodes' inputs are 23 static void Run(Graph* graph, Schedule const* const schedule,
|
/art/compiler/optimizing/ |
select_generator.h | 66 HSelectGenerator(HGraph* graph,
|
live_ranges_test.cc | 38 HGraph* graph = CreateCFG(data); local 41 RemoveSuspendChecks(graph); 43 PrepareForRegisterAllocation(graph).Run(); 44 return graph; 52 * Which becomes the following graph (numbered by lifetime position): 64 HGraph* graph = BuildGraph(data); local 68 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions()); 69 SsaLivenessAnalysis liveness(graph, &codegen, GetScopedAllocator()); 77 HBasicBlock* block = graph->GetBlocks()[1]; 92 * Which becomes the following graph (numbered by lifetime position) 111 HGraph* graph = BuildGraph(data); local 160 HGraph* graph = BuildGraph(data); local 236 HGraph* graph = BuildGraph(data); local 314 HGraph* graph = BuildGraph(data); local 390 HGraph* graph = BuildGraph(data); local [all...] |
/external/tensorflow/tensorflow/compiler/tf2xla/ |
dump_graph.h | 23 #include "tensorflow/core/framework/graph.pb.h" 24 #include "tensorflow/core/graph/graph.h" 34 // If a graph has already been dumped by this process with the same name, 38 // Similar to DumpGraphDefToFile, but builds the GraphDef to dump from a 'graph' 40 string DumpGraphToFile(const string& name, Graph const& graph,
|
/external/tensorflow/tensorflow/contrib/tfprof/ |
model_analyzer.py | 104 'Use `tf.profiler.advise(graph, run_meta, options)`. See README.md') 105 def advise(graph, run_meta=None, tfprof_options=_DEFAULT_ADVISE_OPTIONS): 106 return _advise(graph, run_meta, tfprof_options) 110 'Use `tf.profiler.profile(graph, run_meta, op_log, cmd, options)`. ' 113 def print_model_analysis(graph, 118 return _profile(graph, run_meta, op_log, tfprof_cmd, tfprof_options)
|
/external/tensorflow/tensorflow/core/common_runtime/gpu/ |
gpu_stream_util.h | 21 #include "tensorflow/core/graph/graph.h" 37 // Given the input graph, assigns every node in the graph with a 39 Status AssignStreams(const Graph* graph, const AssignStreamsOpts& opts,
|
/external/tensorflow/tensorflow/core/debug/ |
debug_graph_utils.h | 24 #include "tensorflow/core/graph/graph.h" 33 // EXPERIMENTAL: Insert special debug ops (e.g., DebugIdentity) to graph for 36 // For example, before the node insertion, the graph may look like: 45 // graph becomes: 52 // If a node (e.g., B) has Ref input, the graph becomes: 75 const protobuf::RepeatedPtrField<DebugTensorWatch>& watches, Graph* graph, 82 static void DeparallelizeWhileLoops(Graph* graph, Device* device) [all...] |
/external/tensorflow/tensorflow/core/graph/ |
default_device.h | 21 #include "tensorflow/core/framework/graph.pb.h" 25 namespace graph { namespace in namespace:tensorflow 38 } // namespace graph
|
gradients.h | 19 #include "tensorflow/core/graph/graph.h" 40 // 'y_node_outputs'), adds gradient nodes to 'graph' that compute the symbolic 54 Graph* graph);
|
validate.h | 19 #include "tensorflow/core/framework/graph.pb.h" 24 namespace graph { namespace in namespace:tensorflow 53 } // namespace graph
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
auto_parallel.h | 26 // Automatically parallelize a graph by splitting in the batch dimension. 56 GraphDef* graph); 58 void AddSharedNodes(GraphDef* graph); 59 void AddOneReplica(GraphDef* graph, int number); 60 void BuildGraph(GraphDef* graph);
|
loop_optimizer.cc | 34 *optimized_graph = item.graph;
|
/external/tensorflow/tensorflow/core/kernels/ |
basic_ops_benchmark_test.cc | 38 static Node* Var(Graph* g, int n) { 39 return test::graph::Var(g, DT_FLOAT, TensorShape({n})); 42 static Node* Zeros(Graph* g, int n) { 45 return test::graph::Constant(g, data); 48 static void MulChain(int chain_length, Graph** init_g, Graph** run_g) { 50 Graph* g = new Graph(OpRegistry::Global()); 52 test::graph::Assign(g, var, Zeros(g, 1)); 56 Graph* g = new Graph(OpRegistry::Global()) [all...] |
sendrecv_ops_test.cc | 42 static Graph* Send() { 43 Graph* g = new Graph(OpRegistry::Global()); 45 test::graph::Send(g, test::graph::Constant(g, in0), "T", "/cpu:0", 1, 47 test::graph::Recv(g, "T", "float", "/cpu:0", 1, "/cpu:0"); 51 static Graph* Recv() { 52 Graph* g = new Graph(OpRegistry::Global()); 53 test::graph::Recv(g, "T", "float", "/cpu:0", 1, "/cpu:0") [all...] |
/external/tensorflow/tensorflow/python/grappler/ |
tf_optimizer_test.py | 41 mg = meta_graph.create_meta_graph_def(graph=ops.get_default_graph()) 46 graph = tf_optimizer.OptimizeGraph(rewriter_config, mg) 48 self.assertEqual(len(graph.node), 1) 49 self.assertItemsEqual([node.name for node in graph.node], ['d'])
|
/frameworks/support/navigation/runtime/ktx/src/androidTest/java/androidx/navigation/ |
NavControllerTest.kt | 34 val graph = navController.createGraph(startDestination = DESTINATION_ID) { 37 assertTrue("Destination should be added to the graph", 38 DESTINATION_ID in graph)
|
NavHostTest.kt | 35 val graph = navHost.createGraph(startDestination = DESTINATION_ID) { 38 assertTrue("Destination should be added to the graph", 39 DESTINATION_ID in graph)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
ctype_base.h | 57 static const mask graph = (1 << 2) | (1 << 3) | (1 << 9); // alnum|punct member in struct:ctype_base
|
/external/autotest/server/site_tests/audiovideo_AVSyncInternalDisplayAudioJack/ |
audiovideo_AVSyncInternalDisplayAudioJack.py | 36 @param perf_prefix: The prefix name of perf graph. 84 graph=video_graph_name) 87 graph=video_graph_name) 90 higher_is_better=False, graph=video_graph_name) 93 higher_is_better=False, graph=video_graph_name) 96 higher_is_better=False, graph=video_graph_name) 101 graph=audiovideo_graph_name) 105 graph=audiovideo_graph_name)
|
/external/dagger2/compiler/src/main/java/dagger/internal/codegen/ |
ComponentWriter.java | 46 BindingGraph graph) { 47 super(types, elements, keyFactory, nullableValidationType, name, graph); 70 graph.componentDescriptor().builderSpec().isPresent() 72 graph 96 graph.componentDescriptor().builderSpec().isPresent() 97 ? graph 107 /** {@code true} if all of the graph's required dependencies can be automatically constructed. */ 110 graph.componentRequirements(),
|
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
nv50_ir_graph.cpp | 31 Graph::Graph() 38 Graph::~Graph() 44 void Graph::insert(Node *node) 49 node->graph = this; 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 87 Graph::Node::Node(void *priv) : data(priv), 88 in(0), out(0), graph(0) [all...] |
/external/tensorflow/tensorflow/compiler/xla/service/ |
hlo_graph_dumper_test.cc | 39 string RenderGraph(const string& graph, GraphKind graph_kind, 41 return graph; 91 // Generate the graph; all nodes should be present. 92 string graph = hlo_graph_dumper::DumpGraph(*root_computation, /*label=*/"", local 99 EXPECT_THAT(graph, HasSubstr(instruction->name())); 127 string graph = hlo_graph_dumper::DumpGraph( local 129 EXPECT_THAT(graph, HasSubstr("an_empty_graph")); 130 EXPECT_THAT(graph, Not(HasSubstr("i_am_a_constant_root_instruction")));
|