contrib/gcc/lambda-code.c

71  Dense source spaces are easy to transform, because they don't skip any
93  the sparse source space, from a dense space, and then transform the dense
99  base space, to the sparse iteration space (IE what transform was applied to
100  the dense space to make it sparse).  We then compose this transform with the
104  of the transform using the dense space algorithm above.
109  so that T is now a transform from A to the result, instead of from B to the
113  algorithm above to compute the result of applying transform (LT) to A.
170 lambda_body_vector_compute_new (lambda_trans_matrix transform,
177   gcc_assert (LTM_ROWSIZE (transform) == LTM_COLSIZE (transform));
179   depth = LTM_ROWSIZE (transform);
183     LBV_DENOMINATOR (vect) * LTM_DENOMINATOR (transform);
185 			     LTM_MATRIX (transform), depth,
374    non-singular transform from a dense base space to a sparse iteration space.
621    3. Compose the dense space transform with the user specified transform, to
622    get a transform we can easily calculate transformed bounds for.
1803    TRANSFORM is the matrix transform that was applied to OLD_LOOPNEST to get
1811 				 lambda_trans_matrix transform)
1823       transform = lambda_trans_matrix_inverse (transform);
1825       print_lambda_trans_matrix (dump_file, transform);
1957 	  newlbv = lambda_body_vector_compute_new (transform, lbv);
2388      otherwise we don't know how to transform it into a perfect nest right
2406    LOOP is the loop nest to transform into a perfect nest
2407    LBOUNDS are the lower bounds for the loops to transform
2408    UBOUNDS are the upper bounds for the loops to transform
2409    STEPS is the STEPS for the loops to transform.
2410    LOOPIVS is the induction variables for the loops to transform.
2423    This function will transform it into a perfect loop nest by splitting the
2653    a unimodular matrix must transform the zero vector (and only it) to
2693 	 conservatively answer that the transform is not valid.  */