Merge pull request sampsyo#274 from emwangs/main

LCM Benchmark

benchmarks/core/lcm.bril

@@ -0,0 +1,34 @@
+#ARGS: 64 24
+@main(x: int, y: int) {
+  greater: int = id y;
+  v4: bool = gt x y;
+  br v4 .then.1 .else.1;
+.then.1:
+  greater: int = id x;
+  jmp .endif.1;
+.else.1:
+.endif.1:
+.foreverloop:
+  modX : int = call @getMod greater x;
+  modY : int = call @getMod greater y;
+  zero: int = const 0;
+  xZero : bool = eq modX zero;
+  yZero : bool = eq modY zero;
+  bothZero : bool = and xZero yZero;
+  br bothZero .then.2 .else.2;
+.then.2:
+  print greater;
+  jmp .loopend;
+.else.2:
+  one: int = const 1;
+  greater:int = add greater one;
+  jmp .foreverloop;
+.loopend:
+}
+
+@getMod(val: int, mod: int): int{
+  divisor: int = div val mod;
+  multiple: int = mul divisor mod;
+  rem: int = sub val multiple;
+  ret rem;
+}

benchmarks/core/lcm.out

@@ -0,0 +1 @@
+192

benchmarks/core/lcm.prof

@@ -0,0 +1 @@
+total_dyn_inst: 2326

docs/tools/bench.md

@@ -33,6 +33,7 @@ The current benchmarks are:
 * `function_call`: For benchmarking the overhead of simple function calls.
 * `gcd`: Calculate Greatest Common Divisor (GCD) of two input positive integer using [Euclidean algorithm][euclidean_into].
 * `hanoi`: Print the solution to the *n*-disk [Tower of Hanoi][hanoi] puzzle.
+* `lcm`: Compute LCM for two numbers using a very inefficient loop.
 * `loopfact`: Compute *n!* imperatively using a loop.
 * `mandelbrot`: Generates a really low resolution, ascii, [mandelbrot set][mandelbrot].
 * `mat-inv` : Calculates the inverse of a 3x3 matrix and prints it out.