Lines Matching defs:columns

15 //   * Improve cost-modeling, e.g. choose different number of rows/columns
16 //     columns for tiles, consider cost of copies on alias.
130 // number of elements in a column (= number of columns of the matrix).
142 // Then we can use computeVectorAddr to compute the addresses for the columns
388         assert(Vectors.size() > 0 && "Cannot call getNumRows without columns");
394         assert(Vectors.size() > 0 && "Cannot call getNumRows without columns");
410     iterator_range<SmallVector<Value *, 8>::iterator> columns() {
412              "columns() only supported for column-major matrixes");
918     // A^t + B ^t -> (A + B)^t. Pick rows and columns from first transpose. If
1203   /// The intrinsic loads a matrix from memory using a stride between columns.
1266   /// The intrinsic store a matrix back memory using a stride between columns.
1405         // Roughly estimate the cost for embedding the columns into a vector.
1425         // estimate the savings as the cost of embedding the columns in a
1573       // Multiply columns from the first operand with scalars from the second
1574       // operand. Then move along the K axes and accumulate the columns.  With
1784     // Create PHI nodes for the result columns to accumulate across iterations.