Home
last modified time | relevance | path

Searched refs:decompose (Results 1 – 25 of 27) sorted by relevance

12

/llvm-project-15.0.7/llvm/test/Transforms/ConstraintElimination/
H A Dadd-nsw.ll106 define void @test.decompose.nonconst(i8 %a, i8 %b, i8 %c, i8 %d) {
107 ; CHECK-LABEL: @test.decompose.nonconst(
160 define void @test.decompose.nonconst.no.null.check(i8 %a, i8 %b, i8 %c, i8 %d) {
161 ; CHECK-LABEL: @test.decompose.nonconst.no.null.check(
H A Dadd-nuw.ll240 define void @test.decompose.nonconst(i8 %a, i8 %b, i8 %c, i8 %d) {
241 ; CHECK-LABEL: @test.decompose.nonconst(
294 define void @test.decompose.nonconst.no.null.check(i8 %a, i8 %b, i8 %c, i8 %d) {
295 ; CHECK-LABEL: @test.decompose.nonconst.no.null.check(
/llvm-project-15.0.7/llvm/test/Transforms/DivRemPairs/Mips/
H A Ddiv-rem-pairs.ll32 ; Hoist and optionally decompose the sdiv because it's safe and free.
62 ; Hoist and optionally decompose the udiv because it's safe and free.
94 ; Hoist the srem if it's safe and free, otherwise decompose it.
126 ; Hoist the urem if it's safe and free, otherwise decompose it.
288 ; If the target doesn't have a unified div/rem op for the type, decompose rem in-place to mul+sub.
/llvm-project-15.0.7/llvm/test/Transforms/DivRemPairs/X86/
H A Ddiv-rem-pairs.ll32 ; Hoist and optionally decompose the sdiv because it's safe and free.
62 ; Hoist and optionally decompose the udiv because it's safe and free.
91 ; Hoist the srem if it's safe and free, otherwise decompose it.
120 ; Hoist the urem if it's safe and free, otherwise decompose it.
279 ; If the target doesn't have a unified div/rem op for the type, decompose rem in-place to mul+sub.
/llvm-project-15.0.7/llvm/test/Transforms/DivRemPairs/PowerPC/
H A Ddiv-rem-pairs.ll38 ; Hoist and optionally decompose the sdiv because it's safe and free.
71 ; Hoist and optionally decompose the udiv because it's safe and free.
103 ; Hoist the srem if it's safe and free, otherwise decompose it.
135 ; Hoist the urem if it's safe and free, otherwise decompose it.
302 ; If the target doesn't have a unified div/rem op for the type, decompose rem in-place to mul+sub.
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86InterleavedAccess.cpp72 void decompose(Instruction *Inst, unsigned NumSubVectors, FixedVectorType *T,
167 void X86InterleavedAccessGroup::decompose( in decompose() function in X86InterleavedAccessGroup
743 decompose(Inst, Factor, ShuffleTy, DecomposedVectors); in lowerIntoOptimizedSequence()
769 decompose(Shuffles[0], Factor, in lowerIntoOptimizedSequence()
H A DX86.td362 "LFENCE instruction to serialize control flow. Also decompose RET "
/llvm-project-15.0.7/llvm/test/Transforms/MemCpyOpt/
H A Dpreserve-memssa.ll80 declare void @decompose(%t* nocapture)
91 ; CHECK-NEXT: call fastcc void @decompose(%t* [[TMP]])
102 call fastcc void @decompose(%t* %tmp)
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Linalg/Transforms/
H A DCodegenStrategy.h269 decompose(const LinalgTransformationFilter::FilterFunction &f = nullptr) {
276 return b ? decompose(std::move(f)) : *this;
/llvm-project-15.0.7/mlir/test/Dialect/Linalg/
H A Dtransform-op-decompose.mlir46 %1 = transform.structured.decompose %0
H A Ddecompose-ops.mlir1 // RUN: mlir-opt -test-linalg-decompose-ops -cse -split-input-file %s | FileCheck %s
2 // RUN: mlir-opt -test-linalg-decompose-ops -cse -canonicalize -split-input-file %s | FileCheck %s …
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DConstraintElimination.cpp178 decompose(Value *V, SmallVector<PreconditionTy, 4> &Preconditions, in decompose() function
316 auto ADec = decompose(Op0->stripPointerCastsSameRepresentation(), in getConstraint()
318 auto BDec = decompose(Op1->stripPointerCastsSameRepresentation(), in getConstraint()
/llvm-project-15.0.7/mlir/test/Transforms/
H A Ddecompose-call-graph-types.mlir1 // RUN: mlir-opt %s -split-input-file -test-decompose-call-graph-types | FileCheck %s
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Linalg/
H A DPasses.td228 : Pass<"linalg-strategy-decompose-pass", "func::FuncOp"> {
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Linalg/TransformOps/
H A DLinalgTransformOps.td20 def DecomposeOp : Op<Transform_Dialect, "structured.decompose",
31 If all the operations referred to by the `target` PDLOperation decompose
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Ddiv-rem-pair-recomposition-signed.ll5 ; -div-rem-pairs pass will decompose the remainder calculation as:
H A Ddiv-rem-pair-recomposition-unsigned.ll5 ; -div-rem-pairs pass will decompose the remainder calculation as:
/llvm-project-15.0.7/llvm/docs/
H A DExtendingLLVM.rst147 code you wrote in ``LegalizeOp`` above to decompose your new node into other
/llvm-project-15.0.7/mlir/docs/Dialects/Linalg/
H A DOpDSL.md42 Using a matmul as an example, we will decompose the language:
/llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/
H A Drisbg-04.ll255 ; Introduce a second use of %shr so that the ashr doesn't decompose to
H A Drisbg-01.ll267 ; Introduce a second use of %shr so that the ashr doesn't decompose to
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dptrtoint-nullgep.ll320 ; However, InstCombine can decompose the null gep and convert it to a shift.
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Dimplementation.tex980 \label{eq:transitive:decompose}
1006 that the relations we compose in \eqref{eq:transitive:decompose}
1462 separately and then compose them as in \eqref{eq:transitive:decompose}.
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Ddiv-rem-pair-recomposition-signed.ll6 ; -div-rem-pairs pass will decompose the remainder calculation as:
H A Ddiv-rem-pair-recomposition-unsigned.ll6 ; -div-rem-pairs pass will decompose the remainder calculation as:

12