vidarh / writing-a-compiler-in-ruby

Code from my series on writing a Ruby compiler in Ruby

This URL has Read+Write access

Changed method naming in the asm output; added a comment re: self
vidarh (author)
Sat Feb 28 10:30:09 -0800 2009
commit  cbefdad73ef9d0d430b03c939ea921e24a4fee54
tree    c6c68bf7cfd57e8e0f1740e53ce6213644f9d3d4
parent  386f2801b1921bb6c71a743343d60674bb32d7c7
writing-a-compiler-in-ruby / runtime.c
100644 54 lines (42 sloc) 0.727 kb
raw blame history 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

signed int add(signed int a, signed int b)
{
  return a + b;
}
 
signed int sub(signed int a, signed int b)
{
  return a - b;
}
 
signed int div(signed int a, signed int b)
{
  return a / b;
}
 
signed int mul(signed int a, signed int b)
{
  return a * b;
}
 
signed int ne(signed int a, signed int b)
{
  return a != b;
}
 
signed int eq(signed int a, signed int b)
{
  return a == b;
}
 
signed int not(signed int a)
{
  return !a;
}
 
// Note that our "and" won't shortcircuit, as the
// evaluation happens before this function is called.
signed int and(signed int a, signed int b)
{
  return a && b;
}
 
signed int gt(signed int a, signed int b)
{
  return a > b;
}
 
signed int lt(signed int a, signed int b)
{
  return a < b;
}