Searched refs:invariants (Results 1 - 4 of 4) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dlambda-code.c132 /* Origin matrix for the invariants. */
134 /* Number of invariants. */
135 int invariants; member in struct:__anon1184
142 #define LATTICE_INVARIANTS(T) ((T)->invariants)
203 int depth, int invariants)
216 for (i = 0; i < invariants; i++)
224 of invariants INVARIANTS. */
227 lambda_linear_expression_new (int dim, int invariants) argument
235 LLE_INVARIANT_COEFFICIENTS (ret) = lambda_vector_new (invariants);
274 depth/number of coefficients is given by DEPTH, the number of invariants i
202 lle_equal(lambda_linear_expression lle1, lambda_linear_expression lle2, int depth, int invariants) argument
279 print_lambda_linear_expression(FILE * outfile, lambda_linear_expression expr, int depth, int invariants, char start) argument
298 print_lambda_loop(FILE * outfile, lambda_loop loop, int depth, int invariants, char start) argument
329 lambda_loopnest_new(int depth, int invariants) argument
361 lambda_lattice_new(int depth, int invariants) argument
384 int depth, invariants; local
479 compute_nest_using_fourier_motzkin(int size, int depth, int invariants, lambda_matrix A, lambda_matrix B, lambda_vector a) argument
635 int depth, invariants, size; local
778 int depth, invariants; local
825 invariants); local
854 invariants); local
857 invariants, factor); local
867 (target_expr), invariants, local
910 invariants); local
913 invariants, factor); local
923 (target_expr), invariants, local
1029 int depth, invariants; local
1084 origin_invariants, depth, depth, invariants); local
1114 gcc_tree_to_linear_expression(int depth, tree expr, VEC(tree,heap) *outerinductionvars, VEC(tree,heap) *invariants, int extra) argument
1210 gcc_loop_to_lambda_loop(struct loop *loop, int depth, VEC(tree,heap) ** invariants, tree * ourinductionvar, VEC(tree,heap) * outerinductionvars, VEC(tree,heap) ** lboundvars, VEC(tree,heap) ** uboundvars, VEC(int,heap) ** steps) argument
1460 gcc_loopnest_to_lambda_loopnest(struct loops *currloops, struct loop *loop_nest, VEC(tree,heap) **inductionvars, VEC(tree,heap) **invariants) argument
1611 lle_to_gcc_expression(lambda_linear_expression lle, lambda_linear_expression offset, tree type, VEC(tree,heap) *induction_vars, VEC(tree,heap) *invariants, enum tree_code wrap, tree *stmts_to_insert) argument
1807 lambda_loopnest_to_gcc_loopnest(struct loop *old_loopnest, VEC(tree,heap) *old_ivs, VEC(tree,heap) *invariants, lambda_loopnest new_loopnest, lambda_trans_matrix transform) argument
[all...]
H A Dtree-loop-linear.c247 VEC(tree,heap) *invariants = NULL;
276 VEC_truncate (tree, invariants, 0);
323 &invariants);
342 lambda_loopnest_to_gcc_loopnest (loop_nest, oldivs, invariants,
355 VEC_free (tree, heap, invariants);
H A Dloop-invariant.c23 like address arithmetics -- other more complicated invariants should be
32 used and move as many invariants as possible while we still have enough free
33 registers. We prefer the expensive invariants.
35 Then we move the selected invariants out of the loop, creating a new
116 /* The invariants it depends on. */
119 /* Used for detecting already visited invariants during determining
141 /* The actual stamp for marking already visited invariants during determining
151 /* The invariants. */
153 static VEC(invariant_p,heap) *invariants;
452 /* Finds invariants identica
[all...]
H A Dlambda.h75 This structure represents a linear expression with terms for the invariants
80 INVARIANT_COEFFICIENTS is a vector of coefficients for the loop invariants,
134 int invariants; member in struct:__anon1187
139 #define LN_INVARIANTS(T) ((T)->invariants)

Completed in 59 milliseconds