Mercurial > projects > ldc
view dmd/root/gnuc.c @ 1491:360a8e8eea51
Teach stack promotion to walk the CFG when a potential reuse of an allocation
is found to see if it can actually happen instead of just assuming it will.
This allows it to catch cases like
{{{
int i;
Foo f;
while (cond(i))
f = new Foo(i++);
return f.value;
}}}
where it previously wouldn't because a phi using the allocation would appear in
the condition block to propagate it to the use after the loop.
author | Frits van Bommel <fvbommel wxs.nl> |
---|---|
date | Thu, 11 Jun 2009 02:04:44 +0200 |
parents | 1853dcd9b944 |
children |
line wrap: on
line source
// Put functions in here missing from gnu C #include "gnuc.h" int memicmp(const char *s1, const char *s2, int n) { int result = 0; for (int i = 0; i < n; i++) { char c1 = s1[i]; char c2 = s2[i]; result = c1 - c2; if (result) { if ('A' <= c1 && c1 <= 'Z') c1 += 'a' - 'A'; if ('A' <= c2 && c2 <= 'Z') c2 += 'a' - 'A'; result = c1 - c2; if (result) break; } } return result; } int stricmp(const char *s1, const char *s2) { int result = 0; for (;;) { char c1 = *s1; char c2 = *s2; result = c1 - c2; if (result) { if ('A' <= c1 && c1 <= 'Z') c1 += 'a' - 'A'; if ('A' <= c2 && c2 <= 'Z') c2 += 'a' - 'A'; result = c1 - c2; if (result) break; } if (!c1) break; s1++; s2++; } return result; }