/netbsd-current/external/mit/isl/dist/ |
H A D | 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 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 when 85 B = tab->basis; 318 struct isl_mat *basis; local [all...] |
H A D | 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 [all...] |
H A D | 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);
|
H A D | isl_tab.h | 169 struct isl_mat *basis; member in struct:isl_tab
|
H A D | 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;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | gimple-ssa-strength-reduction.c | 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 ca 274 cand_idx basis; variable 544 slsr_cand_t basis = NULL; local 589 slsr_cand_t basis = find_basis_for_base_expr (c, c->base_expr); local 2086 slsr_cand_t basis; local 2243 slsr_cand_t basis; local 2406 slsr_cand_t basis = lookup_cand (c->basis); local 2514 slsr_cand_t basis; local 2556 slsr_cand_t basis = lookup_cand (c->basis); local 2772 record_phi_increments_1(slsr_cand_t basis, gimple *phi) argument 2814 record_phi_increments(slsr_cand_t basis, gimple *phi) argument 2865 slsr_cand_t basis = lookup_cand (c->basis); local 3247 slsr_cand_t basis = lookup_cand (c->basis); local 3514 slsr_cand_t basis = lookup_cand (c->basis); local 3865 slsr_cand_t basis = lookup_cand (c->basis); local 3881 slsr_cand_t basis = lookup_cand (c->basis); local [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | 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 ca 274 cand_idx basis; member in class:slsr_cand_d 544 slsr_cand_t basis = NULL; local 589 slsr_cand_t basis = find_basis_for_base_expr (c, c->base_expr); local 2085 slsr_cand_t basis; local 2242 slsr_cand_t basis; local 2405 slsr_cand_t basis = lookup_cand (c->basis); local 2513 slsr_cand_t basis; local 2555 slsr_cand_t basis = lookup_cand (c->basis); local 2771 record_phi_increments_1(slsr_cand_t basis, gimple *phi) argument 2813 record_phi_increments(slsr_cand_t basis, gimple *phi) argument 2864 slsr_cand_t basis = lookup_cand (c->basis); local 3246 slsr_cand_t basis = lookup_cand (c->basis); local 3513 slsr_cand_t basis = lookup_cand (c->basis); local 3864 slsr_cand_t basis = lookup_cand (c->basis); local 3880 slsr_cand_t basis = lookup_cand (c->basis); local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
H A D | apply.c | 116 doCond(e->basis) || doCond(e->elements) || applyTo(e);
|
H A D | escape.c | 820 if (e->basis) 821 e->basis->accept(this);
|
H A D | dcast.c | 673 if (e->basis) 675 MATCH m = e->basis->implicitConvTo(telement); 2033 if (e->basis) 2034 ae->basis = e->basis->castTo(sc, tb->nextOf()); 2412 if (ale->basis) 2413 ale->basis = inferType(ale->basis, tn, flag);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/ |
H A D | apply.d | 162 doCond(e.basis) || doCond(e.elements) || applyTo(e);
|
H A D | transitivevisitor.d | 184 void visitArgs(AST.Expressions* expressions, AST.Expression basis = null) 191 el = basis; 935 visitArgs(e.elements, e.basis);
|
H A D | escape.d | 216 if (ae.basis) 217 errors = checkNewEscape(sc, ae.basis, gag); 1561 if (e.basis) 1562 e.basis.accept(this);
|
H A D | 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);
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/ |
H A D | com.asm | 45 C of the two is 0mod8, it runs at 1.0 c/l. On that basis dst is checked
|
/netbsd-current/usr.bin/make/unit-tests/ |
H A D | varparse-errors.mk | 5 # This is the basis for redesigning the error handling in Var_Parse and
|
/netbsd-current/sys/arch/m68k/060sp/dist/ |
H A D | iskeletn.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
H A D | fskeletn.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
/netbsd-current/share/mk/ |
H A D | bsd.doc.mk | 124 # a per-document basis... sigh.
|
H A D | bsd.man.mk | 58 # make MANCOMPRESS a filter, so it can be inserted on an as-needed basis
|
/netbsd-current/external/bsd/file/dist/magic/ |
H A D | Makefile.am | 40 $(MAGIC_FRAGMENT_DIR)/basis \
|
/netbsd-current/external/mpl/bind/dist/fuzz/isc_lex_getmastertoken.in/ |
H A D | named.conf | 78 // basis in the "zone" statement
|
/netbsd-current/external/mpl/bind/dist/fuzz/isc_lex_gettoken.in/ |
H A D | named.conf | 78 // basis in the "zone" statement
|
/netbsd-current/sys/arch/m68k/fpsp/ |
H A D | fpsp.h | 10 * THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
H A D | l_fpsp.h | 10 * THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|