| /src/external/mit/isl/dist/ |
| basis_reduction_templ.c | 28 /* Compute a reduced basis for the set represented by the tableau "tab".
29 * tab->basis, which must be initialized by the calling function to an affine
30 * unimodular basis, is updated to reflect the reduced basis.
31 * The first tab->n_zero rows of the basis (ignoring the constant row)
34 * have been detected in the first rows of the new basis.
35 * The final tab->n_unbounded rows of the basis are assumed to correspond
41 * "An Implementation of the Generalized Basis Reduction Algorithm
42 * for Integer Programming" of Cook el al. to compute a reduced basis.
46 * in the first direction. In this case we stop the basis reduction whe
318 struct isl_mat *basis; local
[all...] |
| isl_tab.h | 169 struct isl_mat *basis; member in struct:isl_tab
|
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
| expression.h | 417 Expression *basis; member in class:ArrayLiteralExp
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-ssa-strength-reduction.cc | 78 is called a "basis" for S1. In both cases, S1 may be replaced by
147 C1 + (C2 * C3) + C4 in the index (i) field. A basis for a CAND_REF
149 least two CAND_REFs are chained together using the basis relation,
185 has a "hidden basis" (2). The hidden basis is unlike a normal basis
186 in that the statement and the hidden basis have different base SSA
195 The hidden basis for statement (6) is the nearest dominating candidate
198 create the new "phi basis" (4a) and feeding adds along incoming arcs (3a),
206 stride of 1. A statement with a hidden basis can then be detected b
274 cand_idx basis; member in class:slsr_cand_d
545 slsr_cand_t basis = NULL; local
590 slsr_cand_t basis = find_basis_for_base_expr (c, c->base_expr); local
2087 slsr_cand_t basis; local
2244 slsr_cand_t basis; local
2407 slsr_cand_t basis = lookup_cand (c->basis); local
2515 slsr_cand_t basis; local
2557 slsr_cand_t basis = lookup_cand (c->basis); local
2866 slsr_cand_t basis = lookup_cand (c->basis); local
3248 slsr_cand_t basis = lookup_cand (c->basis); local
3515 slsr_cand_t basis = lookup_cand (c->basis); local
3866 slsr_cand_t basis = lookup_cand (c->basis); local
3882 slsr_cand_t basis = lookup_cand (c->basis); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-ssa-strength-reduction.cc | 78 is called a "basis" for S1. In both cases, S1 may be replaced by
147 C1 + (C2 * C3) + C4 in the index (i) field. A basis for a CAND_REF
149 least two CAND_REFs are chained together using the basis relation,
185 has a "hidden basis" (2). The hidden basis is unlike a normal basis
186 in that the statement and the hidden basis have different base SSA
195 The hidden basis for statement (6) is the nearest dominating candidate
198 create the new "phi basis" (4a) and feeding adds along incoming arcs (3a),
206 stride of 1. A statement with a hidden basis can then be detected b
274 cand_idx basis; member in class:slsr_cand_d
545 slsr_cand_t basis = NULL; local
590 slsr_cand_t basis = find_basis_for_base_expr (c, c->base_expr); local
2087 slsr_cand_t basis; local
2244 slsr_cand_t basis; local
2407 slsr_cand_t basis = lookup_cand (c->basis); local
2515 slsr_cand_t basis; local
2557 slsr_cand_t basis = lookup_cand (c->basis); local
2866 slsr_cand_t basis = lookup_cand (c->basis); local
3248 slsr_cand_t basis = lookup_cand (c->basis); local
3515 slsr_cand_t basis = lookup_cand (c->basis); local
3866 slsr_cand_t basis = lookup_cand (c->basis); local
3882 slsr_cand_t basis = lookup_cand (c->basis); local
[all...] |
