diff options
Diffstat (limited to 'gcc/d/dmd/statementsem.c')
-rw-r--r-- | gcc/d/dmd/statementsem.c | 96 |
1 files changed, 48 insertions, 48 deletions
diff --git a/gcc/d/dmd/statementsem.c b/gcc/d/dmd/statementsem.c index b9aa0c9..aac1c30 100644 --- a/gcc/d/dmd/statementsem.c +++ b/gcc/d/dmd/statementsem.c @@ -127,7 +127,7 @@ public: void visit(CompoundStatement *cs) { //printf("CompoundStatement::semantic(this = %p, sc = %p)\n", cs, sc); - for (size_t i = 0; i < cs->statements->dim; ) + for (size_t i = 0; i < cs->statements->length; ) { Statement *s = (*cs->statements)[i]; if (s) @@ -158,7 +158,7 @@ public: sexception = semantic(sexception, sc); if (sexception) { - if (i + 1 == cs->statements->dim && !sfinally) + if (i + 1 == cs->statements->length && !sfinally) { } else @@ -172,7 +172,7 @@ public: * { sexception; throw __o; } */ Statements *a = new Statements(); - for (size_t j = i + 1; j < cs->statements->dim; j++) + for (size_t j = i + 1; j < cs->statements->length; j++) { a->push((*cs->statements)[j]); } @@ -206,7 +206,7 @@ public: } else if (sfinally) { - if (0 && i + 1 == cs->statements->dim) + if (0 && i + 1 == cs->statements->length) { cs->statements->push(sfinally); } @@ -218,7 +218,7 @@ public: * s; try { s1; s2; } finally { sfinally; } */ Statements *a = new Statements(); - for (size_t j = i + 1; j < cs->statements->dim; j++) + for (size_t j = i + 1; j < cs->statements->length; j++) { a->push((*cs->statements)[j]); } @@ -241,7 +241,7 @@ public: } i++; } - for (size_t i = 0; i < cs->statements->dim; ++i) + for (size_t i = 0; i < cs->statements->length; ++i) { Lagain: Statement *s = (*cs->statements)[i]; @@ -263,12 +263,12 @@ public: { cs->statements->remove(i); cs->statements->insert(i, flt); - if (cs->statements->dim <= i) + if (cs->statements->length <= i) break; goto Lagain; } } - if (cs->statements->dim == 1) + if (cs->statements->length == 1) { result = (*cs->statements)[0]; return; @@ -284,7 +284,7 @@ public: scd->scontinue = uls; Statement *serror = NULL; - for (size_t i = 0; i < uls->statements->dim; i++) + for (size_t i = 0; i < uls->statements->length; i++) { Statement *s = (*uls->statements)[i]; if (s) @@ -634,7 +634,7 @@ public: Statements *stmts = (isDecl) ? NULL : new Statements(); Dsymbols *decls = (isDecl) ? new Dsymbols() : NULL; - size_t dim = fs->parameters->dim; + size_t dim = fs->parameters->length; if (!needExpansion && dim == 2) { // Declare key @@ -772,7 +772,7 @@ public: Statements *statements, Dsymbols *declarations, Dsymbols *dbody) { Loc loc = fs->loc; - size_t dim = fs->parameters->dim; + size_t dim = fs->parameters->length; if (!needExpansion && (dim < 1 || dim > 2)) { fs->error("only one (value) or two (key,value) arguments for tuple foreach"); @@ -795,7 +795,7 @@ public: if (fs->aggr->op == TOKtuple) // expression tuple { te = (TupleExp *)fs->aggr; - n = te->exps->dim; + n = te->exps->length; } else if (fs->aggr->op == TOKtype) // type tuple { @@ -841,7 +841,7 @@ public: ScopeDsymbol *sym; Statement *s = fs; Loc loc = fs->loc; - size_t dim = fs->parameters->dim; + size_t dim = fs->parameters->length; TypeAArray *taa = NULL; Dsymbol *sapply = NULL; @@ -915,7 +915,7 @@ public: } } - //printf("dim = %d, parameters->dim = %d\n", dim, fs->parameters->dim); + //printf("dim = %d, parameters->length = %d\n", dim, fs->parameters->length); if (foundMismatch && dim != foreachParamCount) { const char *plural = foreachParamCount > 1 ? "s" : ""; @@ -1128,7 +1128,7 @@ public: !((*fs->parameters)[dim - 1]->storageClass & STCref)) { ArrayLiteralExp *ale = (ArrayLiteralExp *)fs->aggr; - size_t edim = ale->elements ? ale->elements->dim : 0; + size_t edim = ale->elements ? ale->elements->length : 0; Type *telem = (*fs->parameters)[dim - 1]->type; // Bugzilla 12936: if telem has been specified explicitly, @@ -1362,17 +1362,17 @@ public: Expressions *exps = new Expressions(); exps->push(ve); int pos = 0; - while (exps->dim < dim) + while (exps->length < dim) { pos = expandAliasThisTuples(exps, pos); if (pos == -1) break; } - if (exps->dim != dim) + if (exps->length != dim) { - const char *plural = exps->dim > 1 ? "s" : ""; + const char *plural = exps->length > 1 ? "s" : ""; fs->error("cannot infer argument types, expected %d argument%s, not %d", - exps->dim, plural, dim); + exps->length, plural, dim); goto Lerror2; } @@ -1433,7 +1433,7 @@ public: tfld = (TypeFunction *)tab->nextOf(); Lget: //printf("tfld = %s\n", tfld->toChars()); - if (tfld->parameters->dim == 1) + if (tfld->parameters->length == 1) { Parameter *p = Parameter::getNth(tfld->parameters, 0); if (p->type && p->type->ty == Tdelegate) @@ -1507,14 +1507,14 @@ public: fld->tookAddressOf = 0; // Resolve any forward referenced goto's - for (size_t i = 0; i < fs->gotos->dim; i++) + for (size_t i = 0; i < fs->gotos->length; i++) { GotoStatement *gs = (GotoStatement *)(*fs->gotos)[i]->statement; if (!gs->label->statement) { // 'Promote' it to this scope, and replace with a return fs->cases->push(gs); - s = new ReturnStatement(Loc(), new IntegerExp(fs->cases->dim + 1)); + s = new ReturnStatement(Loc(), new IntegerExp(fs->cases->length + 1)); (*fs->gotos)[i]->statement = s; } } @@ -1701,7 +1701,7 @@ public: } e = Expression::combine(e, ec); - if (!fs->cases->dim) + if (!fs->cases->length) { // Easy case, a clean exit from the loop e = new CastExp(loc, e, Type::tvoid); // Bugzilla 13899 @@ -1719,7 +1719,7 @@ public: a->push(s); // cases 2... - for (size_t i = 0; i < fs->cases->dim; i++) + for (size_t i = 0; i < fs->cases->length; i++) { s = (*fs->cases)[i]; s = new CaseStatement(Loc(), new IntegerExp(i + 2), s); @@ -2054,7 +2054,7 @@ public: { if (ps->args) { - for (size_t i = 0; i < ps->args->dim; i++) + for (size_t i = 0; i < ps->args->length; i++) { Expression *e = (*ps->args)[i]; @@ -2090,7 +2090,7 @@ public: } else if (ps->ident == Id::startaddress) { - if (!ps->args || ps->args->dim != 1) + if (!ps->args || ps->args->length != 1) ps->error("function name expected for start address"); else { @@ -2125,9 +2125,9 @@ public: else if (ps->ident == Id::Pinline) { PINLINE inlining = PINLINEdefault; - if (!ps->args || ps->args->dim == 0) + if (!ps->args || ps->args->length == 0) inlining = PINLINEdefault; - else if (!ps->args || ps->args->dim != 1) + else if (!ps->args || ps->args->length != 1) { ps->error("boolean expression expected for pragma(inline)"); goto Lerror; @@ -2261,7 +2261,7 @@ public: goto Lerror; // Resolve any goto case's with exp - for (size_t i = 0; i < ss->gotoCases.dim; i++) + for (size_t i = 0; i < ss->gotoCases.length; i++) { GotoCaseStatement *gcs = ss->gotoCases[i]; @@ -2275,7 +2275,7 @@ public: { if (!scx->sw) continue; - for (size_t j = 0; j < scx->sw->cases->dim; j++) + for (size_t j = 0; j < scx->sw->cases->length; j++) { CaseStatement *cs = (*scx->sw->cases)[j]; @@ -2304,13 +2304,13 @@ public: ed = ds->isEnumDeclaration(); if (ed) { - size_t dim = ed->members->dim; + size_t dim = ed->members->length; for (size_t i = 0; i < dim; i++) { EnumMember *em = (*ed->members)[i]->isEnumMember(); if (em) { - for (size_t j = 0; j < ss->cases->dim; j++) + for (size_t j = 0; j < ss->cases->length; j++) { CaseStatement *cs = (*ss->cases)[j]; if (cs->exp->equals(em->value()) || @@ -2459,7 +2459,7 @@ public: } L1: - for (size_t i = 0; i < sw->cases->dim; i++) + for (size_t i = 0; i < sw->cases->length; i++) { CaseStatement *cs2 = (*sw->cases)[i]; @@ -2475,7 +2475,7 @@ public: sw->cases->push(cs); // Resolve any goto case's with no exp to this case statement - for (size_t i = 0; i < sw->gotoCases.dim; ) + for (size_t i = 0; i < sw->gotoCases.length; ) { GotoCaseStatement *gcs = sw->gotoCases[i]; @@ -2691,7 +2691,7 @@ public: { assert(rs->caseDim == 0); sc->fes->cases->push(rs); - result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->dim + 1)); + result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->length + 1)); return; } if (fd->returnLabel) @@ -2972,8 +2972,8 @@ public: sc->fes->cases->push(s); // Immediately rewrite "this" return statement as: - // return cases->dim+1; - rs->exp = new IntegerExp(sc->fes->cases->dim + 1); + // return cases->length+1; + rs->exp = new IntegerExp(sc->fes->cases->length + 1); if (e0) { result = new CompoundStatement(rs->loc, new ExpStatement(rs->loc, e0), rs); @@ -2997,7 +2997,7 @@ public: // return exp; // to: // vresult = exp; retrun caseDim; - rs->caseDim = sc->fes->cases->dim + 1; + rs->caseDim = sc->fes->cases->length + 1; } } if (rs->exp) @@ -3039,7 +3039,7 @@ public: * and 1 is break. */ sc->fes->cases->push(bs); - result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->dim + 1)); + result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->length + 1)); return; } break; // can't break to it @@ -3126,7 +3126,7 @@ public: * and 1 is break. */ sc->fes->cases->push(cs); - result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->dim + 1)); + result = new ReturnStatement(Loc(), new IntegerExp(sc->fes->cases->length + 1)); return; } break; // can't continue to it @@ -3429,7 +3429,7 @@ public: /* Even if body is empty, still do semantic analysis on catches */ bool catchErrors = false; - for (size_t i = 0; i < tcs->catches->dim; i++) + for (size_t i = 0; i < tcs->catches->length; i++) { Catch *c = (*tcs->catches)[i]; semantic(c, sc); @@ -3480,7 +3480,7 @@ public: if (!(blockExit(tcs->_body, sc->func, false) & BEthrow) && ClassDeclaration::exception) { - for (size_t i = 0; i < tcs->catches->dim; i++) + for (size_t i = 0; i < tcs->catches->length; i++) { Catch *c = (*tcs->catches)[i]; @@ -3496,7 +3496,7 @@ public: } } - if (tcs->catches->dim == 0) + if (tcs->catches->length == 0) { result = tcs->_body->hasCode() ? tcs->_body : NULL; return; @@ -3717,7 +3717,7 @@ public: sc = sc->push(); sc->stc |= cas->stc; - for (size_t i = 0; i < cas->statements->dim; i++) + for (size_t i = 0; i < cas->statements->length; i++) { Statement *s = (*cas->statements)[i]; (*cas->statements)[i] = s ? semantic(s, sc) : NULL; @@ -3739,11 +3739,11 @@ public: void visit(ImportStatement *imps) { - for (size_t i = 0; i < imps->imports->dim; i++) + for (size_t i = 0; i < imps->imports->length; i++) { Import *s = (*imps->imports)[i]->isImport(); - assert(!s->aliasdecls.dim); - for (size_t j = 0; j < s->names.dim; j++) + assert(!s->aliasdecls.length); + for (size_t j = 0; j < s->names.length; j++) { Identifier *name = s->names[j]; Identifier *alias = s->aliases[j]; @@ -3766,7 +3766,7 @@ public: Module::addDeferredSemantic2(s); // Bugzilla 14666 sc->insert(s); - for (size_t j = 0; j < s->aliasdecls.dim; j++) + for (size_t j = 0; j < s->aliasdecls.length; j++) { sc->insert(s->aliasdecls[j]); } |