Searched refs:basis (Results 1 - 12 of 12) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/
H A Dtemplate35.C2 // Bug: instantiation of D() corrupts declaration of basis[].
11 B const * basis[] = variable
/haiku-buildtools/isl/
H A Dbasis_reduction_templ.c27 /* Compute a reduced basis for the set represented by the tableau "tab".
28 * tab->basis, which must be initialized by the calling function to an affine
29 * unimodular basis, is updated to reflect the reduced basis.
30 * The first tab->n_zero rows of the basis (ignoring the constant row)
33 * have been detected in the first rows of the new basis.
34 * The final tab->n_unbounded rows of the basis are assumed to correspond
41 * for Integer Programming" of Cook el al. to compute a reduced basis.
45 * in the first direction. In this case we stop the basis reduction when
85 B = tab->basis;
319 struct isl_mat *basis; local
[all...]
H A Disl_sample.c322 /* Compute and return an initial basis for the bounded tableau "tab".
326 * Otherwise, we construct a basis whose first directions correspond
350 /* Compute the minimum of the current ("level") basis row over "tab"
356 return isl_tab_min(tab, tab->basis->row[1 + level],
360 /* Compute the maximum of the current ("level") basis row over "tab"
369 isl_seq_neg(tab->basis->row[1 + level] + 1,
370 tab->basis->row[1 + level] + 1, dim);
371 res = isl_tab_min(tab, tab->basis->row[1 + level],
373 isl_seq_neg(tab->basis->row[1 + level] + 1,
374 tab->basis
[all...]
H A Disl_scan.c86 * We first compute a reduced basis for the set and then scan
87 * the set in the directions of this basis.
89 * we compute the range in the i-th basis vector direction, given
90 * fixed values in the directions of the previous basis vector.
92 * direction of the current basis vector to each value in the range
96 * basis vector. "init" is true if we want the first value at the current
99 * we have fixed a value in each direction of the basis.
134 tab->basis = isl_mat_identity(bset->ctx, 1 + dim);
139 B = isl_mat_copy(tab->basis);
H A Disl_tab.h166 struct isl_mat *basis; member in struct:isl_tab
H A Disl_affine_hull.c261 * that tab->basis and tab->n_unbounded have been set appropriately.
434 * that tab->basis and tab->n_unbounded have been set appropriately.
757 * The unbounded directions are taken from the last rows of the basis,
782 isl_seq_cpy(bset->eq[k] + 1, tab->basis->row[1 + i] + 1,
821 isl_mat_free(tab->basis);
822 tab->basis = NULL;
H A Disl_tab.c84 tab->basis = NULL;
220 isl_mat_free(tab->basis);
303 dup->basis = isl_mat_dup(tab->basis);
556 prod->basis = NULL;
3153 * the basis, but shouldn't. Then we iterate over all variables
3154 * that should be in the basis and for each one that is currently
3155 * not in the basis, we exchange it with one of the elements of the
3158 * the current basis is mapped to the old basis b
[all...]
H A Disl_tab_pip.c1026 * solution when leaving the basis in favor of the row.
1947 * in basis of the tableau.
2619 /* Representation of the context when using generalized basis reduction.
2771 if (cgbr->tab->basis) {
2772 if (cgbr->tab->basis->n_col != 1 + cgbr->tab->n_var) {
2773 isl_mat_free(cgbr->tab->basis);
2774 cgbr->tab->basis = NULL;
3610 * and that we need to do this before saving the current basis
3611 * such that the basis has been restore before we restore the row signs.
/haiku-buildtools/gcc/gcc/
H A Dgimple-ssa-strength-reduction.c115 is called a "basis" for S1. In both cases, S1 may be replaced by
184 C1 + (C2 * C3) + C4 in the index (i) field. A basis for a CAND_REF
186 least two CAND_REFs are chained together using the basis relation,
222 has a "hidden basis" (2). The hidden basis is unlike a normal basis
223 in that the statement and the hidden basis have different base SSA
232 The hidden basis for statement (6) is the nearest dominating candidate
235 create the new "phi basis" (4a) and feeding adds along incoming arcs (3a),
243 stride of 1. A statement with a hidden basis ca
299 cand_idx basis; member in struct:slsr_cand_d
527 slsr_cand_t basis = NULL; local
566 slsr_cand_t basis = find_basis_for_base_expr (c, c->base_expr); local
1995 slsr_cand_t basis; local
2141 slsr_cand_t basis; local
2267 slsr_cand_t basis = lookup_cand (c->basis); local
2349 slsr_cand_t basis; local
2387 slsr_cand_t basis = lookup_cand (c->basis); local
2587 record_phi_increments(slsr_cand_t basis, gimple phi) argument
2660 slsr_cand_t basis = lookup_cand (c->basis); local
3004 slsr_cand_t basis = lookup_cand (c->basis); local
3214 slsr_cand_t basis = lookup_cand (c->basis); local
3501 slsr_cand_t basis = lookup_cand (c->basis); local
3517 slsr_cand_t basis = lookup_cand (c->basis); local
[all...]
/haiku-buildtools/gcc/gmp/mpn/x86/k7/mmx/
H A Dcom.asm34 C of the two is 0mod8, it runs at 1.0 c/l. On that basis dst is checked
/haiku-buildtools/autoconf/lib/Autom4te/
H A DChannels.pm60 etc.) that can also be overridden on a per-message basis.
/haiku-buildtools/isl/doc/
H A Dimplementation.tex554 uses generalized basis reduction.
645 is generalized basis reduction \shortcite{Cook1991implementation}.
658 incrementally keep track of this recession cone. The reduced basis
659 found by one call of the algorithm is also reused as initial basis
1109 a Hilbert basis of this cone \shortcite[Theorem~16.4]{Schrijver1986}.

Completed in 98 milliseconds