/netbsd-current/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
H A D | expression.c | 3753 this->basis = NULL; 3762 this->basis = NULL; 3769 ArrayLiteralExp::ArrayLiteralExp(Loc loc, Type *type, Expression *basis, Expressions *elements) argument 3772 this->basis = basis; 3803 e1 = basis; 3805 e2 = basis; 3819 basis ? basis->syntaxCopy() : NULL, 3827 el = basis; [all...] |
H A D | ctfeexpr.c | 226 Expressions *copyLiteralArray(Expressions *oldelems, Expression *basis = NULL) 237 el = basis; 265 Expressions *elements = copyLiteralArray(ale->elements, ale->basis);
|
H A D | expression.h | 411 Expression *basis; member in class:ArrayLiteralExp 417 ArrayLiteralExp(Loc loc, Type *type, Expression *basis, Expressions *elements);
|
H A D | expressionsem.c | 691 if (e->basis) 692 e->basis = semantic(e->basis, sc); 693 if (arrayExpressionSemantic(e->elements, sc) || (e->basis && e->basis->op == TOKerror)) 698 if (e->basis) 699 e->elements->push(e->basis); 701 if (e->basis)
|
H A D | optimize.c | 256 expOptimize(e->basis, result & WANTexpand);
|
H A D | dinterpret.c | 2480 Expression *basis = interpret(e->basis, istate); local 2481 if (exceptionOrCant(basis)) 2492 ex = copyLiteral(basis).copy(); 2530 new(pue) ArrayLiteralExp(e->loc, e->type, basis, expsx);
|
H A D | hdrgen.c | 2187 void argsToBuffer(Expressions *expressions, Expression *basis = NULL) 2198 el = basis; 2517 argsToBuffer(e->elements, e->basis);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/ |
H A D | ob.d | 1658 if (e.basis) 1659 e.basis.accept(this); 2388 if (e.basis) 2389 e.basis.accept(this);
|
H A D | 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)
|
H A D | ctfeexpr.d | 265 private Expressions* copyLiteralArray(Expressions* oldelems, Expression basis = null) 273 (*newelems)[i] = copyLiteral(el ? el : basis).copy(); 298 auto elements = copyLiteralArray(ale.elements, ale.basis);
|
H A D | expression.d | 2929 /** If !is null, elements[] can be sparse and basis is used for the 2931 * this 'basis' value. 2933 Expression basis; 2954 extern (D) this(const ref Loc loc, Type type, Expression basis, Expressions* elements) 2958 this.basis = basis; 2977 basis ? basis.syntaxCopy() : null, 3000 auto e1x = e1 ? e1 : basis; 3001 auto e2x = e2 ? e2 : ae.basis; [all...] |
H A D | dinterpret.d | 2483 auto basis = interpretRegion(e.basis, istate); 2484 if (exceptionOrCant(basis)) 2495 ex = copyLiteral(basis).copy(); 2533 emplaceExp!(ArrayLiteralExp)(pue, e.loc, e.type, basis, expsx); 3096 // This can be made more efficient by making use of ue.basis 6748 ale.basis = copyRegionExp(ale.basis);
|
H A D | expression.h | 417 Expression *basis; member in class:ArrayLiteralExp
|
H A D | expressionsem.d | 3106 if (e.basis) 3107 e.basis = e.basis.expressionSemantic(sc); 3108 if (arrayExpressionSemantic(e.elements, sc) || (e.basis && e.basis.op == EXP.error)) 3113 if (e.basis) 3114 e.elements.push(e.basis); 3116 if (e.basis) 3117 e.basis = e.elements.pop();
|
H A D | optimize.d | 351 expOptimize(e.basis, result & WANTexpand);
|
/netbsd-current/external/mit/isl/dist/ |
H A D | 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 b [all...] |
H A D | isl_tab_pip.c | 1199 * solution when leaving the basis in favor of the row. 2200 * in basis of the tableau. 2898 /* Representation of the context when using generalized basis reduction. 3053 if (cgbr->tab->basis) { 3054 if (cgbr->tab->basis->n_col != 1 + cgbr->tab->n_var) { 3055 isl_mat_free(cgbr->tab->basis); 3056 cgbr->tab->basis = NULL; 3949 * and that we need to do this before saving the current basis 3950 * such that the basis has been restore before we restore the row signs.
|
/netbsd-current/external/gpl2/xcvs/dist/contrib/ |
H A D | cvs_acls.in | 257 (from the third column of your pserver 'passwd' file) as the basis for 271 b) The second option is to use the client-side userId as the basis for
|
/netbsd-current/sys/arch/m68k/060sp/ |
H A D | isp.S | 13 |# THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
/netbsd-current/sys/arch/m68k/060sp/dist/ |
H A D | os.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
H A D | ilsp.s | 13 # THE SOFTWARE is provided on an "AS IS" basis and without warranty.
|
/netbsd-current/external/gpl3/autoconf/dist/lib/Autom4te/ |
H A D | Channels.pm | 65 etc.) that can also be overridden on a per-message basis.
|
/netbsd-current/distrib/syspkg/mk/ |
H A D | bsd.syspkg.mk | 36 ##### Some overrides of defaults below on a per-OS basis.
|
/netbsd-current/external/bsd/file/dist/magic/ |
H A D | Makefile.in | 318 $(MAGIC_FRAGMENT_DIR)/basis \
|
/netbsd-current/external/mit/isl/dist/doc/ |
H A D | implementation.tex | 566 uses generalized basis reduction. 657 is generalized basis reduction \parencite{Cook1991implementation}. 670 incrementally keep track of this recession cone. The reduced basis 671 found by one call of the algorithm is also reused as initial basis 1122 a Hilbert basis of this cone \parencite[Theorem~16.4]{Schrijver1986}.
|