| /external/llvm-project/mlir/include/mlir/Dialect/Linalg/IR/ |
| D | LinalgOps.td | 67 // `src` and `reassociation`.
69 "ArrayRef<ReassociationExprs>":$reassociation,
72 "ArrayRef<ReassociationIndices>":$reassociation,
76 convertReassociationIndicesToMaps($_builder, reassociation);
83 "ArrayRef<ReassociationExprs>":$reassociation,
86 "ArrayRef<ReassociationIndices>":$reassociation,
90 convertReassociationIndicesToMaps($_builder, reassociation);
96 static StringRef getReassociationAttrName() { return "reassociation"; }
98 return llvm::to_vector<4>(llvm::map_range(reassociation(), [
103 $src $reassociation attr-dict `:` type($src) `into` type(results)
[all …]
|
| /external/llvm-project/mlir/lib/Dialect/Linalg/IR/ |
| D | LinalgOps.cpp | 669 static bool isReassociationValid(ArrayRef<AffineMap> reassociation, in isReassociationValid() argument
671 if (reassociation.empty()) in isReassociationValid()
673 unsigned nDims = reassociation[0].getNumDims(); in isReassociationValid()
675 for (auto it : llvm::enumerate(reassociation)) { in isReassociationValid()
693 *invalidIndex = reassociation.size() - 1; in isReassociationValid()
728 ArrayRef<AffineMap> reassociation) { in computeReshapeCollapsedType() argument
737 newSizes.reserve(reassociation.size()); in computeReshapeCollapsedType()
739 newStrides.reserve(reassociation.size()); in computeReshapeCollapsedType()
743 assert(isReassociationValid(reassociation) && "invalid reassociation"); in computeReshapeCollapsedType()
745 for (AffineMap m : reassociation) { in computeReshapeCollapsedType()
[all …]
|
| /external/llvm-project/llvm/test/Transforms/Reassociate/ |
| D | subtest.ll | 3 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
16 ; With sub reassociation, constant folding can eliminate the uses of %a.
|
| D | 2002-05-15-SubReassociate.ll | 4 ; With sub reassociation, constant folding can eliminate all of the constants.
17 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
| D | min_int.ll | 3 ; MIN_INT cannot be negated during reassociation
|
| D | shifttest.ll | 1 ; With shl->mul reassociation, we can see that this is (shl A, 9) * A
|
| D | secondary.ll | 5 ; reassociation.
|
| D | fast-SubReassociate.ll | 19 ; With sub reassociation, constant folding can eliminate all of the constants.
79 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
| D | xor_reassoc.ll | 6 ; Xor reassociation general cases
130 ; Xor reassociation special cases
238 ; Xor reassociation curtail code size
286 ; Xor reassociation bugs
|
| D | add-like-or.ll | 32 ; And that allows reassociation in general.
|
| D | reassociate_dbgvalue_discard.ll | 4 ; After reassociation m1 and m2 aren't calculated as m1=c*a and m2=c*b any longer.
|
| /external/llvm/test/Transforms/Reassociate/ |
| D | subtest.ll | 3 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
15 ; With sub reassociation, constant folding can eliminate the uses of %a.
|
| D | 2002-05-15-SubReassociate.ll | 3 ; With sub reassociation, constant folding can eliminate all of the constants.
16 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
| D | xor_reassoc.ll | 5 ; Xor reassociation general cases
65 ; Xor reassociation special cases
118 ; Xor reassociation curtail code size
156 ; Xor reassociation bugs
|
| D | min_int.ll | 3 ; MIN_INT cannot be negated during reassociation
|
| D | shifttest.ll | 1 ; With shl->mul reassociation, we can see that this is (shl A, 9) * A
|
| D | fast-SubReassociate.ll | 18 ; With sub reassociation, constant folding can eliminate all of the constants.
49 ; With sub reassociation, constant folding can eliminate the two 12 constants.
|
| D | secondary.ll | 5 ; reassociation.
|
| D | fast-basictest.ll | 3 ; With reassociation, constant folding can eliminate the 12 and -12 constants.
258 ; With sub reassociation, constant folding can eliminate the 12 and -12 constants.
269 ; With sub reassociation, constant folding can eliminate the uses of %a.
277 ; opportunites for FAdd reassociation.
|
| D | fast-ReassociateVector.ll | 146 ; FIXME: shifts should be converted to mul to assist further reassociation.
159 ; further reassociation.
172 ; Break up subtract to assist further reassociation.
|
| /external/llvm-project/mlir/lib/Dialect/Linalg/Transforms/ |
| D | FusionOnTensors.cpp | 532 SmallVectorImpl<ReassociationIndices> &reassociation, in fuseWithReshapeByExpansion()
539 reassociation.emplace_back(foldedDims.begin(), foldedDims.end()); in fuseWithReshapeByExpansion()
552 SmallVector<ReassociationIndices, 4> reassociation; in fuseWithReshapeByExpansion() local
554 getReshapeInfo(indexingMap, reassociation, expandedOperandShape); in fuseWithReshapeByExpansion()
561 reassociation)); in fuseWithReshapeByExpansion()
571 SmallVector<ReassociationIndices, 4> reassociation; in fuseWithReshapeByExpansion() local
573 getReshapeInfo(indexingMap, reassociation, expandedResultShape); in fuseWithReshapeByExpansion()
577 resultReassociation.emplace_back(std::move(reassociation)); in fuseWithReshapeByExpansion()
|
| D | DropUnitDims.cpp | 233 ArrayAttr reassociation; member
313 reassociationMaps.push_back(replacementInfo.reassociation); in matchAndRewrite()
|
| /external/llvm-project/llvm/test/Transforms/NaryReassociate/ |
| D | pr24301.ll | 37 %t21 = add i32 119, %t4 ; => dead after reassociation
|
| /external/llvm-project/mlir/test/Dialect/Linalg/ |
| D | invalid.mlir | 336 …// expected-error @+1 {{expected rank of the collapsed type(2) to be the number of reassociation m…
344 …// expected-error @+1 {{expected reassociation map #0 of same rank as expanded memref(3), but got …
352 // expected-error @+1 {{expected reassociation map #1 to be valid and contiguous}}
|
| /external/llvm/test/CodeGen/X86/ |
| D | lea-recursion.ll | 5 ; expression reassociation which causes it to miss opportunities for
|