HomeSort by relevance Sort by last modified time
    Searched refs:Graph (Results 126 - 150 of 1024) sorted by null

1 2 3 4 56 7 8 91011>>

  /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...]
  /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));
unique_op_test.cc 24 #include "tensorflow/core/graph/node_builder.h"
25 #include "tensorflow/core/graph/testlib.h"
67 Graph* g = new Graph(OpRegistry::Global());
74 .Input(test::graph::Constant(g, input))
86 Graph* g = new Graph(OpRegistry::Global());
94 .Input(test::graph::Constant(g, input))
124 Graph* g = new Graph(OpRegistry::Global())
    [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/v8/src/compiler/
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...]
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) {}
  /hardware/interfaces/tests/pointer/1.0/default/lib/
PointerHelper.cpp 9 void simpleGraph(IGraph::Graph& g) {
18 bool isSimpleGraph(const IGraph::Graph &g) {
28 void logSimpleGraph(const char *prefix, const IGraph::Graph& g) {
29 ALOGI("%s Graph %p, %d nodes, %d edges", prefix, &g, (int)g.nodes.size(), (int)g.edges.size());
  /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/contrib/kfac/python/kernel_tests/
fisher_factors_test.py 47 with tf_ops.Graph().as_default():
56 with tf_ops.Graph().as_default():
142 with tf_ops.Graph().as_default(), self.test_session() as sess:
153 with tf_ops.Graph().as_default(), self.test_session() as sess:
165 with tf_ops.Graph().as_default(), self.test_session() as sess:
186 with tf_ops.Graph().as_default():
192 with tf_ops.Graph().as_default():
199 with tf_ops.Graph().as_default():
207 with tf_ops.Graph().as_default():
216 with tf_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...]
  /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():
249 with ops.Graph().as_default():
276 with ops.Graph().as_default():
303 with ops.Graph().as_default():
314 with ops.Graph().as_default():
327 with ops.Graph().as_default():
338 with ops.Graph().as_default()
    [all...]
  /external/tensorflow/tensorflow/contrib/saved_model/python/saved_model/
reader_test.py 46 with self.test_session(graph=ops.Graph()) as sess:
68 # Graph with a single variable. SavedModel invoked to:
71 with self.test_session(graph=ops.Graph()) as sess:
75 # Graph that updates the single variable. SavedModel invoked to:
78 with self.test_session(graph=ops.Graph()) as sess:
82 # Graph that updates the single variable. SavedModel is invoked:
85 with self.test_session(graph=ops.Graph()) as sess
    [all...]
  /external/tensorflow/tensorflow/java/src/test/java/org/tensorflow/
TestUtil.java 22 public static <T> Output<T> constant(Graph g, String name, Object value) {
32 public static <T> Output<T> placeholder(Graph g, String name, Class<T> type) {
39 public static Output<?> addN(Graph g, Output<?>... inputs) {
44 Graph g, String name, Output<T> a, Output<T> b, boolean transposeA, boolean transposeB) {
54 public static Operation split(Graph g, String name, int[] values, int numSplit) {
62 public static void transpose_A_times_X(Graph g, int[][] a) {
  /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/factorization/kernels/
clustering_ops_test.cc 19 #include "tensorflow/core/graph/node_builder.h"
50 Graph* SetUpKmeansPlusPlusInitialization(int num_dims, int num_points,
53 Graph* g = new Graph(OpRegistry::Global());
65 .Input(test::graph::Constant(g, points))
66 .Input(test::graph::Constant(g, sample_size))
67 .Input(test::graph::Constant(g, seed))
68 .Input(test::graph::Constant(g, num_retries_per_sample))
80 Graph* g = SetUpKmeansPlusPlusInitialization(
119 Graph* SetUpKMC2Initialization(int num_points)
    [all...]
  /external/tensorflow/tensorflow/contrib/kfac/examples/tests/
mnist_test.py 31 with tf.Graph().as_default():
42 with tf.Graph().as_default():
57 with tf.Graph().as_default():

Completed in 1032 milliseconds

1 2 3 4 56 7 8 91011>>