view demos/qd1.d @ 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 22a56b65872b
children
line wrap: on
line source

module qd1;
import qd;
void main() {
  screen(640, 480);
  sleep(1);

  cls(Red);
  sleep(1);

  cls(Green);
  sleep(1);

  cls(Blue);
  sleep(1);

//   pset(10, 10);
//   line(0, 0, 100, 100, Box, Back(Red~Black));
//   for (int i=0; i<=100; i+=10) {
//     line(i, 0, 100-i, 100);
//     line(0, i, 100, 100-i);
//   }
//   circle(100, 100, 50, 15, White~Black, Fill=White~Black);
//   paint(200, 200, Red, Back=White);
//   circle(100, 100, 50, 15, White);
//   paint(200, 200, Black);
//   pset(10, 11); pset(10, 11, Black);
//   pset(10, 10);
//   sleep(1);
}