@@ -1,4 +1,4 @@
-2cc25c2191928f865e1b711f30b6a4268d6a0d9a
+cb4a96faecb6b521ac4749581bcfa39f61143db0
The first line of this file holds the git revision number of the last
merge done from the dlang/dmd repository.
@@ -226,11 +226,10 @@ void Macro::expand(OutBuffer *buf, size_t start, size_t *pend,
{
// limit recursive expansion
static int nest;
- static const int nestLimit = 1000;
- if (nest > nestLimit)
+ if (nest > global.recursionLimit)
{
- error(Loc(), "DDoc macro expansion limit exceeded; more than %d "
- "expansions.", nestLimit);
+ error(Loc(), "DDoc macro expansion limit exceeded; more than %d expansions.",
+ global.recursionLimit);
return;
}
nest++;
@@ -4337,6 +4337,13 @@ MATCH deduceType(RootObject *o, Scope *sc, Type *tparam, TemplateParameters *par
void visit(ArrayLiteralExp *e)
{
+ // https://issues.dlang.org/show_bug.cgi?id=20092
+ if (e->elements && e->elements->length &&
+ e->type->toBasetype()->nextOf()->ty == Tvoid)
+ {
+ result = deduceEmptyArrayElement();
+ return;
+ }
if ((!e->elements || !e->elements->length) &&
e->type->toBasetype()->nextOf()->ty == Tvoid &&
tparam->ty == Tarray)
@@ -5932,10 +5939,10 @@ void TemplateInstance::tryExpandMembers(Scope *sc2)
static int nest;
// extracted to a function to allow windows SEH to work without destructors in the same function
//printf("%d\n", nest);
- if (++nest > 500)
+ if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
- error("recursive expansion");
+ error("recursive expansion exceeded allowed nesting limit");
fatal();
}
@@ -5949,10 +5956,10 @@ void TemplateInstance::trySemantic3(Scope *sc2)
// extracted to a function to allow windows SEH to work without destructors in the same function
static int nest;
//printf("%d\n", nest);
- if (++nest > 300)
+ if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
- error("recursive expansion");
+ error("recursive expansion exceeded allowed nesting limit");
fatal();
}
semantic3(sc2);
@@ -6353,7 +6360,7 @@ Lerror:
while (ti && !ti->deferred && ti->tinst)
{
ti = ti->tinst;
- if (++nest > 500)
+ if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
error("recursive expansion");
@@ -8440,7 +8447,7 @@ void TemplateMixin::semantic(Scope *sc)
static int nest;
//printf("%d\n", nest);
- if (++nest > 500)
+ if (++nest > global.recursionLimit)
{
global.gag = 0; // ensure error message gets printed
error("recursive expansion");
@@ -2896,7 +2896,7 @@ public:
else
{
static int nest;
- if (++nest > 500)
+ if (++nest > global.recursionLimit)
{
exp->error("recursive evaluation of %s", exp->toChars());
--nest;
@@ -244,6 +244,8 @@ struct Global
Array<class Identifier*>* versionids; // command line versions and predefined versions
Array<class Identifier*>* debugids; // command line debug versions and predefined versions
+ enum { recursionLimit = 500 }; // number of recursive template expansions before abort
+
/* Start gagging. Return the current number of gagged errors
*/
unsigned startGagging();
@@ -2189,7 +2189,7 @@ Expression *Type::noMember(Scope *sc, Expression *e, Identifier *ident, int flag
static int nest; // https://issues.dlang.org/show_bug.cgi?id=17380
- if (++nest > 500)
+ if (++nest > global.recursionLimit)
{
::error(e->loc, "cannot resolve identifier `%s`", ident->toChars());
--nest;
@@ -5536,7 +5536,7 @@ Type *TypeFunction::semantic(Loc loc, Scope *sc)
bool errors = false;
- if (inuse > 500)
+ if (inuse > global.recursionLimit)
{
inuse = 0;
::error(loc, "recursive type");
@@ -19,6 +19,7 @@
#include "init.h"
#include "enum.h"
#include "ctfe.h"
+#include "errors.h"
Expression *semantic(Expression *e, Scope *sc);
@@ -1214,10 +1215,18 @@ Expression *Expression_optimize(Expression *e, int result, bool keepLvalue)
v.ret = e;
// Optimize the expression until it can no longer be simplified.
- while (ex != v.ret)
+ size_t b = 0;
+ while (1)
{
+ if (b++ == global.recursionLimit)
+ {
+ e->error("infinite loop while optimizing expression");
+ fatal();
+ }
ex = v.ret;
ex->accept(&v);
+ if (ex == v.ret)
+ break;
}
return ex;
}
new file mode 100644
@@ -0,0 +1,10 @@
+void foo()
+{
+ (void[1]).init.front;
+}
+
+void front(T)(T[] a)
+{
+ static assert(is(T == void));
+}
+