/external/python/cpython3/Tools/peg_generator/pegen/ |
D | python_generator.py | 248 is_loop = node.is_loop() 268 if is_loop: 270 self.visit(rhs, is_loop=is_loop, is_gather=is_gather) 271 if is_loop: 287 def visit_Rhs(self, node: Rhs, is_loop: bool = False, is_gather: bool = False) -> None: 288 if is_loop: 291 self.visit(alt, is_loop=is_loop, is_gather=is_gather) 293 def visit_Alt(self, node: Alt, is_loop: bool, is_gather: bool) -> None: 298 if is_loop: 334 if is_loop:
|
D | c_generator.py | 180 type = "asdl_seq *" if rule.is_loop() or rule.is_gather() else rule.type 453 if rule.is_loop() or rule.is_gather(): 599 is_loop=False, 636 is_loop=True, 655 is_loop = node.is_loop() 658 if is_loop or is_gather: 684 if is_loop: 701 self, node: Rhs, is_loop: bool, is_gather: bool, rulename: Optional[str] 703 if is_loop: 706 self.visit(alt, is_loop=is_loop, is_gather=is_gather, rulename=rulename) [all …]
|
D | grammar.py | 77 def is_loop(self) -> bool: member in Rule 104 not self.is_loop()
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
D | r3xx_vertprog_dump.c | 172 unsigned is_loop = 0; in r300_vertex_program_dump() local 182 is_loop = 1; in r300_vertex_program_dump() 193 if (is_loop) { in r300_vertex_program_dump()
|
/external/swiftshader/third_party/SPIRV-Tools/source/val/ |
D | construct.cpp | 76 const bool is_loop = type() == ConstructType::kLoop; in blocks() local 78 if (is_loop) { in blocks() 99 if (is_loop && continue_header->structurally_dominates(*block)) { in blocks()
|
/external/deqp-deps/SPIRV-Tools/source/val/ |
D | construct.cpp | 76 const bool is_loop = type() == ConstructType::kLoop; in blocks() local 78 if (is_loop) { in blocks() 99 if (is_loop && continue_header->structurally_dominates(*block)) { in blocks()
|
/external/angle/third_party/spirv-tools/src/source/val/ |
D | construct.cpp | 76 const bool is_loop = type() == ConstructType::kLoop; in blocks() local 78 if (is_loop) { in blocks() 99 if (is_loop && continue_header->structurally_dominates(*block)) { in blocks()
|
/external/mesa3d/src/gallium/drivers/r600/sfn/ |
D | sfn_liverangeevaluator_helpers.cpp | 54 ProgramScope::is_loop() const in is_loop() function in r600::ProgramScope 602 if (last_read_scope->is_loop()) in update_required_live_range() 611 if (keep_for_full_loop && first_write_scope->is_loop()) in update_required_live_range() 628 if (keep_for_full_loop && first_write_scope->is_loop()) in update_required_live_range()
|
D | sfn_liverangeevaluator_helpers.h | 45 bool is_loop() const;
|
/external/crosvm/devices/src/ |
D | serial.rs | 159 if !c.is_empty() && !self.is_loop() { in queue_input_bytes() 328 fn is_loop(&self) -> bool { in is_loop() method 389 if self.is_loop() { in handle_write() 500 if self.is_loop() { in read()
|
/external/pytorch/torch/_inductor/codegen/ |
D | triton_split_scan.py | 71 is_loop=False,
|
D | simd.py | 121 is_loop: bool, 146 assert not is_loop or (prefix == "r" and grid_dim is None) 147 self.is_loop = is_loop 388 is_loop=is_reduction and not self.persistent_reduction, 494 should_flush = self.range_trees[-1].is_loop
|
D | triton.py | 1245 if not tree.is_loop: 1247 if self.inside_reduction and self.range_trees[-1].is_loop: 1648 and self.range_trees[-1].is_loop 1712 and self.range_trees[-1].is_loop 1746 elif self.inside_reduction and self.range_trees[-1].is_loop: 2379 if self.inside_reduction and self.range_trees[-1].is_loop: 2864 if entry.root.is_loop: 2931 if entry.is_loop:
|
/external/pytorch/test/cpp/jit/ |
D | test_misc.cpp | 1642 bool is_loop(Node* n) { in is_loop() function 1665 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1679 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1707 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1721 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1754 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1768 std::count_if(copy->nodes().begin(), copy->nodes().end(), is_loop); in TEST() 1797 ASSERT_EQ(countNodes(copy, is_loop), 5); in TEST() 1808 ASSERT_EQ(countNodes(copy, is_loop), 5); in TEST() 1836 ASSERT_EQ(countNodes(copy, is_loop), 5); in TEST() [all …]
|
/external/libaom/test/ |
D | quantize_func_test.cc | 136 void QuantizeRun(bool is_loop, int q = 0, int test_num = 1) { in QuantizeRun() argument 167 if (is_loop) FillCoeffRandom(); in QuantizeRun()
|