contrib/gcc/lambda-code.c

46 /* This loop nest code generation is based on non-singular matrix
75  For a dense source space, we take the transformation matrix, decompose it
85  bounds in the target space by simple matrix multiplication.
87  diagonals of the H matrix.
92  spaces directly, we just find a legal transformation matrix that gives you
101  transformation matrix specified by the user (since our matrix transformations
103  (which is dense) plus the composed transformation matrix, to compute the rest
107  space (A), and a matrix (L) that transforms A into B, such that A.L = B.
108  We then compute the composition of L and the user transformation matrix (T),
126   /* Lattice base matrix.  */
132   /* Origin matrix for the invariants.  */
167   *inverse* of the transformation matrix.  */
176   /* Make sure the matrix is square.  */
377    only does something interesting (IE produce a matrix that isn't the
378    identity matrix) if NEST is a sparse space.  */
469    Remember the constant are in our vector a, our coefficient matrix is A,
470    and our invariant coefficient matrix is B.
475    A, B, and a are the coefficient matrix, invariant coefficient, and a
512 	      /* Any linear expression in the matrix with a coefficient less
616    1. Convert the nest into matrix form, which consists of a matrix for the
617    coefficients, a matrix for the
619    2. Use the matrix form to calculate the lattice base for the nest (which is
623    4. Multiply the composed transformation matrix times the matrix form of the
625    5. Transform the newly created matrix (from step 4) back into a loop nest
655   /* Store the bounds in the equation matrix A, constant vector a, and
656      invariant matrix B, so that we have Ax <= a + B.
691 	  /* Need to increase matrix sizes above.  */
720 	  /* Need to increase matrix sizes above.  */
761    the auxiliary nest AUXILLARY_NEST, and the triangular matrix H.
763    matrix H by the auxiliary nest, to get the new loop bounds.  The sign of
973   lambda_matrix matrix, H;
979   matrix = LTM_MATRIX (trans);
986   lambda_matrix_copy (matrix, H, size, size);
1057   /* Multiply the transformation matrix by the lattice base.  */
1062   /* Compute the Hermite normal form for the new transformation matrix.  */
1073      transformation matrix.  */
1077      the lower triangular matrix H.  */
1803    TRANSFORM is the matrix transform that was applied to OLD_LOOPNEST to get
1824       fprintf (dump_file, "Inverse of transformation matrix:\n");
2643 /* Return true if TRANS is a legal transformation matrix that respects
2648    matrix T is legal when applied to a loop nest with a set of
2653    a unimodular matrix must transform the zero vector (and only it) to