These slides cover practical issues on SSA

SSA to machine/assembly code

SSA + arrays

SSA + structs/records/classes/…

Dominance Frontiers (definition, algorithm example)

phi-node insertion (Algorithm & example)

variable renaming ( algorithm and example)

de-ssa (where to insert no-ops)

Cheers,

Albert

The algorithm for variable renaming presented ion the 19th slide of the third lecture there is an error.

Revised version (pseudocode):

rename(B) {

  for each statement A in block B {

    if (A != phi-function) {
      for each v in RHS(A) {
        i = TOS(stack(v));
        replace v with vi
      }

    }

    if (A == assignment) {
      v = LHS(A);
      i = counter++;
      replace v with vi;
      push(i) on stack(v);
    }

  }

  for each S in succ(B) {
    j = position of B in pred(S)
    for each phi-function in S {
      i = TOS(v);
      replace v with vi at pos j
    }
  }

  for each C in children(B) {
    rename(C)
  }

  for each statement A in B {
    if (A is an assignment)
      v = LHS(A);
      pop(stack(v));

  }

}

Hello,

the second recitation class will be tomorrow at 9:15 again.

we will do some examples on:

- calculation of dominance frontier

-  phi-node insertion and

- variable renaming

Cheers,

Albert

The lecture slides of 2007-10-09 are on the course homepage

Albert

The second set of lecture slides is online.

We will first meet fort the recitation class of Compiler Design II on October, 5 (Friday) at 8:15 in IFW C42

The first set of lecture slides is online.

I just created a mailig list for

• questions on topics relevant to the lecture or recitation classes
• exercises (problemd, hints)
• announcements

since the ETH does not yet (it’s coming) offer mailing lists where students can subscribe themselves I created a list on my site using mailman.

You can add yourself to the list visiting

http://matteocorti.ch/mailman/listinfo/cd2

The first lecture will take place on September 25 15, 10:15 am (IFW C42)

In the meanwhile you can take a look at the course homepage:

or subscribe to this blog’s RSS feeds: posts & comments