Octobench is a code generator to test compiler compilation speeds on different hardware.

The code generator generates a number of functions that calculate a Fibonacci number in a way that generates many lines of code to compile.

A compiler can then compile the code and we can measure the compilation time on a set of hardware.

The size of the generated code can be adjusted so compilation speed E.g. can be measured for 10.000 LOC or 1.000.000 LOC.

Octobench currently supports

• Go
  needs Go >=19 installed
• Java
  needs a JDK and Gradle installed
• Typescript
  needs npm installed

The generated code looks like this - calculate Fibonacci(3). The code uses big.Int/BigInteger because Fibonacci numbers get large fast and if we want to generate f100000 and see if it works ints range is not big enough. The Map is for speeding things up by calculating f12 etc. only once.

public static BigInteger f3(Map m) {
  if (m.containsKey(3)) {
    return m.get(3);
  } else {
    BigInteger r = M1.f2(m).add(M1.f1(m));
    m.put(3, r);
    return r;
  }
}

func F3(m map[int]*big.Int) *big.Int {
  val, ok := m[3]
  if ok {
    return val
  } else {
    r := big.NewInt(0)
    r.Add(F2(m), F1(m))
    m[3] = r
    return r
  }
}

Contact: stephan@amazingcto.com