HomeSort by relevance Sort by last modified time
    Searched refs:start_node (Results 1 - 6 of 6) sorted by null

  /external/tensorflow/tensorflow/core/grappler/optimizers/data/
shuffle_and_repeat_fusion_test.cc 40 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
45 range_inputs[0] = start_node->name();
108 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
113 range_inputs[0] = start_node->name();
map_and_batch_fusion_test.cc 32 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
37 range_inputs[0] = start_node->name();
115 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
120 range_inputs[0] = start_node->name();
199 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
204 range_inputs[0] = start_node->name();
286 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); local
291 range_inputs[0] = start_node->name();
noop_elimination_test.cc 63 auto *start_node = graph_utils::AddScalarConstNode<int64>(0, graph); local
67 std::vector<string> range_inputs = {start_node->name(), stop_node->name(),
  /external/selinux/libsepol/cil/src/
cil_tree.h 72 int cil_tree_walk(struct cil_tree_node *start_node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, void *extra_args), int (*last_child)(struct cil_tree_node *node, void *extra_args), void *extra_args);
cil_tree.c 178 struct cil_tree_node *start_node = node; local
189 while (node != start_node) {
246 start_node: root node to start walking from
    [all...]
  /external/tensorflow/tensorflow/core/grappler/optimizers/
loop_optimizer.cc 335 NodeDef* start_node) {
338 stack.push_back(start_node);
    [all...]

Completed in 1574 milliseconds