| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | shuffle_and_repeat_fusion.cc | 47 const NodeDef& repeat_node, in FuseShuffleV1AndRepeat() argument
67 fused_node->add_input(repeat_node.input(1)); in FuseShuffleV1AndRepeat()
79 const NodeDef& repeat_node, in FuseShuffleV2AndRepeat() argument
101 fused_node->add_input(repeat_node.input(1)); in FuseShuffleV2AndRepeat()
118 const NodeDef& repeat_node, in FuseShuffleV3AndRepeat() argument
138 fused_node->add_input(repeat_node.input(1)); in FuseShuffleV3AndRepeat()
161 for (const NodeDef& repeat_node : item.graph.node()) { in OptimizeAndCollectStats() local
162 if (repeat_node.op() != kRepeatDataset) { in OptimizeAndCollectStats()
167 *graph_utils::GetInputNode(repeat_node, graph); in OptimizeAndCollectStats()
171 TF_RETURN_IF_ERROR(FuseShuffleV1AndRepeat(shuffle_node, repeat_node, in OptimizeAndCollectStats()
[all …]
|
| D | shuffle_and_repeat_fusion_test.cc | 72 NodeDef *repeat_node = graph_utils::AddNode( in TEST() local
82 graph_utils::ContainsGraphNodeWithName(repeat_node->name(), output)); in TEST()
92 EXPECT_EQ(shuffle_and_repeat_node.input(4), repeat_node->input(1)); in TEST()
138 NodeDef *repeat_node = graph_utils::AddNode( in TEST() local
148 graph_utils::ContainsGraphNodeWithName(repeat_node->name(), output)); in TEST()
156 EXPECT_EQ(shuffle_and_repeat_node.input(4), repeat_node->input(1)); in TEST()
208 NodeDef *repeat_node = graph_utils::AddNode( in TEST() local
218 graph_utils::ContainsGraphNodeWithName(repeat_node->name(), output)); in TEST()
228 EXPECT_EQ(shuffle_and_repeat_node.input(4), repeat_node->input(1)); in TEST()
|
| D | noop_elimination.cc | 57 bool IsRepeatOne(const NodeDef& repeat_node, const MutableGraphView& graph) { in IsRepeatOne() argument
58 if (repeat_node.op() != "RepeatDataset") return false; in IsRepeatOne()
60 return IsConstNodeWithValue(*graph.GetNode(repeat_node.input(1)), 1); in IsRepeatOne()
|
| /external/mesa3d/src/gallium/drivers/r600/sb/ |
| D | sb_shader.cpp | 312 repeat_node* shader::create_repeat(region_node* target) { in create_repeat()
313 repeat_node* n = new (pool.allocate(sizeof(repeat_node))) in create_repeat()
314 repeat_node(target, target->repeats.size() + 1); in create_repeat()
452 repeat_node *r = static_cast<repeat_node*>(p); in simplify_dep_rep()
|
| D | sb_pass.h | 67 virtual bool visit(repeat_node &n, bool enter);
185 virtual bool visit(repeat_node &n, bool enter);
381 virtual bool visit(repeat_node &n, bool enter);
606 virtual bool visit(repeat_node &n, bool enter);
660 virtual bool visit(repeat_node &n, bool enter);
|
| D | sb_ra_checker.cpp | 262 repeat_node *r = static_cast<repeat_node*>(c); in run_on()
|
| D | sb_pass.cpp | 80 bool vpass::visit(repeat_node& n, bool enter) { return true; } in visit()
|
| D | sb_ssa_builder.cpp | 107 bool ssa_prepare::visit(repeat_node& n, bool enter) { in visit()
251 bool ssa_rename::visit(repeat_node& n, bool enter) { in visit()
|
| D | sb_ir.h | 1076 class repeat_node : public container_node {
1078 repeat_node(region_node *target, unsigned id) in repeat_node() function
1114 typedef std::vector<repeat_node*> repeat_vec;
1156 void expand_repeat(repeat_node *r);
|
| D | sb_ir.cpp | 41 bool repeat_node::accept(vpass& p, bool enter) { in accept()
501 void region_node::expand_repeat(repeat_node *r) { in expand_repeat()
|
| D | sb_bc_finalize.cpp | 153 repeat_node *rep = *I; in finalize_loop()
225 repeat_node *rep1 = static_cast<repeat_node*>(repdep1); in finalize_if()
|
| D | sb_gcm.cpp | 252 repeat_node *r = static_cast<repeat_node*>(n); in sched_late()
|
| D | sb_shader.h | 365 repeat_node* create_repeat(region_node *target);
|
| D | sb_liveness.cpp | 151 bool liveness::visit(repeat_node& n, bool enter) { in visit()
|
| D | sb_ra_init.cpp | 605 repeat_node *r = static_cast<repeat_node*>(n); in split()
|
| D | sb_dump.cpp | 232 bool dump::visit(repeat_node& n, bool enter) { in visit()
|
| D | sb_bc_parser.cpp | 768 repeat_node *rep = sh->create_repeat(loop_stack.top()); in prepare_ir()
935 repeat_node *rep = sh->create_repeat(reg); in prepare_loop()
|