Lines Matching defs:permutation

602   SmallVector<int64_t> permutation =
604   auto sequence = llvm::to_vector(llvm::seq<int64_t>(0, permutation.size()));
606                            permutation.begin(), permutation.end())) {
607     return emitOpError() << "expects interchange to be a permutation, found "
1158   ArrayRef<int64_t> permutation = getIteratorInterchange();
1159   auto sequence = llvm::to_vector(llvm::seq<int64_t>(0, permutation.size()));
1161                            permutation.begin(), permutation.end())) {
1163            << "expects iterator_interchange to be a permutation, found "
1525                          << " is not a valid permutation";
1596                          << " is not a valid permutation";
1600                          << " is not a valid permutation";
1614 /// Return true if `permutation` is a valid permutation of the
1617 /// This is the case when the `permutation` rank matches the rank expected by
1618 /// `op` and `permutation` is itself a permutation vector.
1619 /// Return true if either `op` or `permutation` are empty to allow a simpler
1623     RelayoutOpTy op, ArrayRef<int64_t> permutation,
1628   if (!op || permutation.empty())
1632     return permutation.size() == innerRank && isPermutationVector(permutation);
1636     return permutation.size() == op.getSourceRank() &&
1637            isPermutationVector(permutation);
1639   return permutation.size() == op.getDestRank() &&
1640          isPermutationVector(permutation);
1703   // Step 2.5. Fail if any permutation does not validate.
1959              << "expects transpose_paddings to be a permutation, found "
2016     return emitOpError() << "expects transpose to be a permutation, found "
2058     return emitOpError() << "expects transpose to be a permutation, found "