From 70d534d587b08926efcfaa2206af07c3460d99be Mon Sep 17 00:00:00 2001
From: Slava Pestov <slava@factorcode.org>
Date: Tue, 15 Mar 2005 23:18:33 +0000
Subject: [PATCH] compiling a prologue and epilogue on PowerPC

---
 library/compiler/linearizer.factor    | 14 ++++++++++++--
 library/compiler/ppc/generator.factor | 19 +++++++++++++++++++
 library/compiler/simplifier.factor    |  2 ++
 library/compiler/x86/generator.factor |  4 ++++
 4 files changed, 37 insertions(+), 2 deletions(-)

diff --git a/library/compiler/linearizer.factor b/library/compiler/linearizer.factor
index 1ce276c110..748f5121d3 100644
--- a/library/compiler/linearizer.factor
+++ b/library/compiler/linearizer.factor
@@ -31,6 +31,12 @@ SYMBOL: #target ( part of jump table )
 SYMBOL: #target-label
 SYMBOL: #end-dispatch
 
+! on PowerPC, compiled definitions that make subroutine calls
+! must have a prologue and epilogue to set up and tear down the
+! link register.
+SYMBOL: #prologue
+SYMBOL: #epilogue
+
 : linear, ( node -- )
     #! Add a node to the linear IR.
     [ node-op get node-param get ] bind cons , ;
@@ -50,7 +56,7 @@ SYMBOL: #end-dispatch
     #! jumps and labels, and turns dataflow IR nodes into
     #! lists where the first element is an operation, and the
     #! rest is arguments.
-    [ (linearize) ] make-list ;
+    [ [ #prologue ] , (linearize) ] make-list ;
 
 : immediate? ( obj -- ? )
     #! fixnums and f have a pointerless representation, and
@@ -83,6 +89,8 @@ SYMBOL: #end-dispatch
     linearize-simple-label
 ] "linearizer" set-word-prop
 
+: return,  [ #epilogue ] ,  [ #return ] , ;
+
 : linearize-label ( node -- )
     #! Labels are tricky, because they might contain non-tail
     #! calls. So we push the address of the location right after
@@ -92,7 +100,7 @@ SYMBOL: #end-dispatch
     #! not contain non-tail recursive calls to itself.
     <label> dup #return-to swons , >r
     linearize-simple-label
-    [ #return ] ,
+    return,
     r> label, ;
 
 #label [
@@ -136,3 +144,5 @@ SYMBOL: #end-dispatch
 ] "linearizer" set-word-prop
 
 #values [ drop ] "linearizer" set-word-prop
+
+#return [ drop return, ] "linearizer" set-word-prop
diff --git a/library/compiler/ppc/generator.factor b/library/compiler/ppc/generator.factor
index f23bea1372..b1d7cf258b 100644
--- a/library/compiler/ppc/generator.factor
+++ b/library/compiler/ppc/generator.factor
@@ -3,4 +3,23 @@
 IN: compiler
 USING: assembler inference kernel words ;
 
+! At the start of each word that calls a subroutine, we store
+! the link register in r0, then push r0 on the C stack.
+#prologue [
+    drop
+    0 MFLR
+    0 1 -4 STWU
+] "generator" set-word-prop
+
+! At the end of each word that calls a subroutine, we store
+! the previous link register value in r0 by popping it off the
+! stack, set the link register to the contents of r0, and jump
+! to the link register.
+#epilogue [
+    drop
+    0 1 0 LWZ
+    1 1 4 ADDI
+    0 MTLR
+] "generator" set-word-prop
+
 #return [ drop BLR ] "generator" set-word-prop
diff --git a/library/compiler/simplifier.factor b/library/compiler/simplifier.factor
index fac077be17..5d015b46e1 100644
--- a/library/compiler/simplifier.factor
+++ b/library/compiler/simplifier.factor
@@ -92,6 +92,8 @@ SYMBOL: simplifying
     car cdr find-label cdr
 ] "next-logical" set-word-prop
 
+#epilogue [ cdr ] "next-logical" set-word-prop
+
 : next-logical? ( op linear -- ? )
     next-logical dup [ car car = ] [ 2drop f ] ifte ;
 
diff --git a/library/compiler/x86/generator.factor b/library/compiler/x86/generator.factor
index 1d4ccae450..3a2dba44de 100644
--- a/library/compiler/x86/generator.factor
+++ b/library/compiler/x86/generator.factor
@@ -4,6 +4,10 @@ IN: compiler
 USING: alien assembler inference kernel kernel-internals lists
 math memory namespaces words ;
 
+! Not used on x86
+#prologue [ drop ] "generator" set-word-prop
+#epilogue [ drop ] "generator" set-word-prop
+
 \ slot [
     PEEK-DS
     2unlist type-tag >r cell * r> - EAX swap 2list EAX swap MOV