| /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_sample.c | 193 /* Compute and return an initial basis for the bounded tableau "tab".
197 * Otherwise, we construct a basis whose first directions correspond
221 /* Compute the minimum of the current ("level") basis row over "tab"
230 return isl_tab_min(tab, tab->basis->row[1 + level],
234 /* Compute the maximum of the current ("level") basis row over "tab"
246 isl_seq_neg(tab->basis->row[1 + level] + 1,
247 tab->basis->row[1 + level] + 1, dim);
248 res = isl_tab_min(tab, tab->basis->row[1 + level],
250 isl_seq_neg(tab->basis->row[1 + level] + 1,
251 tab->basis->row[1 + level] + 1, dim)
[all...] |
| isl_scan.c | 87 * We first compute a reduced basis for the set and then scan
88 * the set in the directions of this basis.
90 * we compute the range in the i-th basis vector direction, given
91 * fixed values in the directions of the previous basis vector.
93 * direction of the current basis vector to each value in the range
97 * basis vector. "init" is true if we want the first value at the current
100 * we have fixed a value in each direction of the basis.
137 tab->basis = isl_mat_identity(bset->ctx, 1 + dim);
142 B = isl_mat_copy(tab->basis);
|
| isl_tab.h | 169 struct isl_mat *basis; member in struct:isl_tab
|
| isl_affine_hull.c | 264 * that tab->basis and tab->n_unbounded have been set appropriately.
415 * that tab->basis and tab->n_unbounded have been set appropriately.
572 * The unbounded directions are taken from the last rows of the basis,
598 isl_seq_cpy(bset->eq[k] + 1, tab->basis->row[1 + i] + 1,
637 isl_mat_free(tab->basis);
638 tab->basis = NULL;
|
| isl_tab.c | 92 tab->basis = NULL;
219 isl_mat_free(tab->basis);
302 dup->basis = isl_mat_dup(tab->basis);
555 prod->basis = NULL;
3891 * the basis, but shouldn't. Then we iterate over all variables
3892 * that should be in the basis and for each one that is currently
3893 * not in the basis, we exchange it with one of the elements of the
3896 * the current basis is mapped to the old basis by a non-singula
[all...] |
| /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...] |
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
| apply.d | 162 doCond(e.basis) || doCond(e.elements) || applyTo(e);
|
| transitivevisitor.d | 184 void visitArgs(AST.Expressions* expressions, AST.Expression basis = null)
191 el = basis;
935 visitArgs(e.elements, e.basis);
|
| escape.d | 216 if (ae.basis)
217 errors = checkNewEscape(sc, ae.basis, gag);
1561 if (e.basis)
1562 e.basis.accept(this);
|
| dcast.d | 725 if (e.basis)
727 MATCH m = e.basis.implicitConvTo(telement);
2278 if (e.basis)
2279 ae.basis = e.basis.castTo(sc, tb.nextOf());
2669 if (ale.basis)
2670 ale.basis = inferType(ale.basis, tn, flag);
|
| ob.d | 1658 if (e.basis)
1659 e.basis.accept(this);
2388 if (e.basis)
2389 e.basis.accept(this);
|
| hdrgen.d | 1999 argsToBuffer(e.elements, buf, hgs, e.basis);
3234 private void argsToBuffer(Expressions* expressions, OutBuffer* buf, HdrGenState* hgs, Expression basis = null)
3245 el = basis;
3253 // [0..dim: basis, 1: e1, 5: e5]
3254 if (basis)
3259 expToBuffer(basis, PREC.assign, buf, hgs);
3265 if (basis)
|
| /src/usr.bin/make/unit-tests/ |
| varparse-errors.mk | 5 # This is the basis for redesigning the error handling in Var_Parse and
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/ |
| com.asm | 45 C of the two is 0mod8, it runs at 1.0 c/l. On that basis dst is checked
|
| /src/sys/arch/m68k/060sp/dist/ |
| iskeletn.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
| fskeletn.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
| /src/share/mk/ |
| bsd.doc.mk | 124 # a per-document basis... sigh.
|
| bsd.man.mk | 58 # make MANCOMPRESS a filter, so it can be inserted on an as-needed basis
|
| /src/external/bsd/file/dist/magic/ |
| Makefile.am | 40 $(MAGIC_FRAGMENT_DIR)/basis \
|
| /src/external/mpl/bind/dist/fuzz/isc_lex_getmastertoken.in/ |
| named.conf | 78 // basis in the "zone" statement
|
| /src/external/mpl/bind/dist/fuzz/isc_lex_gettoken.in/ |
| named.conf | 78 // basis in the "zone" statement
|
| /src/sys/arch/m68k/fpsp/ |
| fpsp.h | 10 * THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
| l_fpsp.h | 10 * THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
