Lines Matching defs:permutation

46 // If the `linalgOp` represents a transpose, return the permutation vector for
66   // To get the permutation, look at each output index and find which
97           "expects outer_dims_perm is empty or an identity permutation");
157           "expects outer_dims_perm is empty or an identity permutation");
259 // Applies 'permutation' on 'inVec' and stores the result in resVec.
260 // 'inVec' may be empty, in that case it's one-to-one mapping with permutation.
261 // `rank` sets the boundary for permutation i.e., the permutation dim can't be
263 // For e.g., permutation {1, 0, 3, 2} with rank 2 is allowed since the values in
264 // permutation[:rank] doesn't exceed rank, whereas, permutation {1, 3, 0, 2} is
266 static bool checkAndPermute(ArrayRef<int64_t> permutation,
271     int64_t remappedPosition = permutation[i];
363     // permutation rank won't necessarily be equal in all cases.
404     // permutation rank won't necessarily be equal in all cases.