static int x = 1, y = 2;
void foo();

static int Ternary(int i) {
   foo(); foo(); foo(); foo(); foo();
   foo(); foo(); foo(); foo(); foo();
   return i > 0 ? x : y;
}

static int If(int i) {
   foo(); foo(); foo(); foo(); foo();
   foo(); foo(); foo(); foo(); foo();
   if (i > 0)
       return x;
   else
       return y;
}

void bar(int x){
   If(0);
   Ternary(1);
}

The LLVM Project is a collection of modular and reusable compiler and toolchain technologies. Note: the repository does not accept github pull requests at this moment. Please submit your patches at...

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Layouts We'll begin by looking for an abstract model of a pretty-printer's output --- that is, prettily indented text. We could say that the output is just a string, but a string has so little structure that we can derive no intuition from it. Let us say instead, that a layout is a sequence of indented lines, which we can model as type Layout = [(Int; String)] + Notice that we shall allow indentations to be negative: later on this will contribute to a nicer algebra, just as integers have a nicer algebra than natural numbers. But notice also that we restrict layouts to be non-empty (we use [\Gamma] + for the type of non-empty lists). We'll return to this point below. We can now specify text, nest and ($$) very easily: text s = [(0; s)] nest k l = [(i + k; s)j(i; s) / l] l 1 $$ l 2 = l 1 ++l 2 The right definition of horizontal composition (!?) is not so obvious. The desired behaviour is clear enough when text s is placed beside text t…