| /external/mesa3d/src/compiler/nir/ |
| D | nir_propagate_invariant.c | 27 add_src(nir_src *src, struct set *invariants) in add_src() argument
30 _mesa_set_add(invariants, src->ssa); in add_src()
32 _mesa_set_add(invariants, src->reg.reg); in add_src()
44 dest_is_invariant(nir_dest *dest, struct set *invariants) in dest_is_invariant() argument
47 return _mesa_set_search(invariants, &dest->ssa); in dest_is_invariant()
49 return _mesa_set_search(invariants, dest->reg.reg); in dest_is_invariant()
54 add_cf_node(nir_cf_node *cf, struct set *invariants) in add_cf_node() argument
58 add_src(&if_stmt->condition, invariants); in add_cf_node()
62 add_cf_node(cf->parent, invariants); in add_cf_node()
66 add_var(nir_variable *var, struct set *invariants) in add_var() argument
[all …]
|
| /external/angle/src/compiler/translator/TranslatorMetalDirect/ |
| D | RewritePipelines.cpp | 76 Invariants &invariants) in Exec() argument
78 GeneratePipelineStruct self(compiler, idGen, pipeline, symbolEnv, invariants); in Exec()
92 Invariants &invariants) in GeneratePipelineStruct() argument
96 mInvariants(invariants), in GeneratePipelineStruct()
886 Invariants &invariants, in RewritePipeline() argument
894 if (!GeneratePipelineStruct::Exec(psi, compiler, root, idGen, pipeline, symbolEnv, invariants)) in RewritePipeline()
943 Invariants &invariants, in RewritePipelines() argument
972 if (!RewritePipeline(compiler, root, idGen, pipeline, symbolEnv, invariants, in RewritePipelines()
|
| D | RewritePipelines.h | 40 Invariants &invariants,
|
| D | EmitMetal.h | 26 const Invariants &invariants,
|
| D | EmitMetal.cpp | 84 const Invariants &invariants,
216 const Invariants &invariants, in GenMetalTraverser() argument
223 mInvariants(invariants), in GenMetalTraverser()
2424 const Invariants &invariants, in EmitMetal() argument
2484 GenMetalTraverser gen(compiler, outWrapper, idGen, pipelineStructs, invariants, symbolEnv, in EmitMetal()
|
| /external/python/cryptography/docs/ |
| D | spelling_wordlist.txt | 58 invariants
|
| /external/tensorflow/tensorflow/compiler/mlir/lite/tests/mlir2exec/ |
| D | BUILD | 7 # invariants only verified in the converter/compiler.
|
| /external/llvm-project/llvm/test/Transforms/LoopStrengthReduce/ARM/ |
| D | addrec-is-loop-invariant.ll | 5 ; its operands are loop invariants.
|
| /external/googletest/docs/ |
| D | index.md | 20 matchers, actions, invariants, and more.
|
| /external/llvm-project/clang/include/clang/Tooling/Syntax/ |
| D | Syntax.td | 75 // The role sequence and role/type match are enforced invariants of the class.
78 // are permitted (for Leaf nodes). These invariants are not enforced.
|
| /external/llvm-project/mlir/lib/Dialect/Vector/ |
| D | VectorUtils.cpp | 188 auto invariants = getInvariantAccesses( in makePermutationMap() local
193 if (!invariants.count(indices[dim])) { in makePermutationMap()
|
| /external/angle/src/compiler/translator/ |
| D | TranslatorMetalDirect.cpp | 1110 Invariants invariants; in translateImpl() local
1111 if (!RewriteGlobalQualifierDecls(*this, *root, invariants)) in translateImpl()
1127 if (!RewritePipelines(*this, *root, idGen, *driverUniforms, symbolEnv, invariants, in translateImpl()
1166 if (!EmitMetal(*this, *root, idGen, pipelineStructs, invariants, symbolEnv, ppc, in translateImpl()
|
| /external/usrsctp/ |
| D | configure.ac | 100 AC_ARG_ENABLE(invariants, optenable
101 AC_HELP_STRING( [--enable-invariants],
|
| /external/tensorflow/tensorflow/compiler/mlir/g3doc/ |
| D | dialects.md | 19 Each dialect consists of a set of defined operations which have invariants
|
| /external/tensorflow/tensorflow/security/advisory/ |
| D | tfsa-2020-032.md | 27 There are multiple invariants and preconditions that are assumed by the parallel
|
| /external/rust/crates/gdbstub/ |
| D | README.md | 13 …ive_ use of Rust's powerful type system + generics to enforce protocol invariants at compile time,…
36 … `gdbstub`'s heavy use of Rust's type system in enforcing GDB protocol invariants at compile time,…
147 …stub`'s heavy reliance on the Rust type system to enforce GDB protocol invariants, it's likely tha…
|
| /external/grpc-grpc/third_party/nanopb/docs/ |
| D | security.rst | 49 The following invariants are maintained during operation, even if the
|
| /external/nanopb-c/docs/ |
| D | security.rst | 49 The following invariants are maintained during operation, even if the
|
| /external/llvm-project/lldb/docs/resources/ |
| D | contributing.rst | 56 assertion should be placed to assert invariants that the developer
|
| /external/llvm-project/mlir/docs/Tutorials/ |
| D | DefiningAttributesAndTypes.md | 155 /// asserts that all of the construction invariants were satisfied. To
165 /// the given location. If any of the construction invariants are invalid,
175 /// This method is used to verify the construction invariants passed into the
|
| /external/rust/cxx/book/src/ |
| D | index.md | 20 invariants. Then it uses a pair of code generators to implement the boundary
|
| /external/llvm-project/llvm/test/Transforms/Inline/ |
| D | inline-tail.ll | 201 ; any tail marking, otherwise we break verifier invariants.
|
| /external/llvm-project/mlir/include/mlir/Interfaces/ |
| D | ViewLikeInterface.td | 44 The invariants of this interface are:
|
| /external/python/cpython3/Doc/howto/ |
| D | functional.rst | 112 The technique used to prove programs correct is to write down **invariants**,
114 true. For each line of code, you then show that if invariants X and Y are true
115 **before** the line is executed, the slightly different invariants X' and Y' are
117 the program, at which point the invariants should match the desired conditions
121 difficult to handle with this technique; assignments can break invariants that
122 were true before the assignment without producing any new invariants that can be
|
| /external/python/cpython2/Doc/howto/ |
| D | functional.rst | 111 The technique used to prove programs correct is to write down **invariants**,
113 true. For each line of code, you then show that if invariants X and Y are true
114 **before** the line is executed, the slightly different invariants X' and Y' are
116 the program, at which point the invariants should match the desired conditions
120 difficult to handle with this technique; assignments can break invariants that
121 were true before the assignment without producing any new invariants that can be
|