diff: allocation.html
Zoltan Somogyi
zs at cs.mu.oz.au
Wed Oct 29 20:16:52 AEDT 1997
allocation.html:
Note that this file has been almost completely implemented
(almost a year ago).
Zoltan.
Index: allocation.html
===================================================================
RCS file: /home/mercury1/repository/mercury/compiler/notes/allocation.html,v
retrieving revision 1.2
diff -u -u -r1.2 allocation.html
--- allocation.html 1997/09/29 06:10:54 1.2
+++ allocation.html 1997/10/29 09:15:05
@@ -1,7 +1,7 @@
<html>
<head>
<title>
- The New Allocation Scheme
+ The Storage Allocation Scheme
</title>
</head>
@@ -13,8 +13,11 @@
<hr>
<!-------------------------->
-This document describes the allocation system we are moving towards;
-it is only partially implemented as yet.
+This document describes
+the storage allocation system used by the code generator.
+The code generator currently does not really use
+the follow_vars field of goal_infos,
+but the rest of the scheme reflects what the compiler does.
<hr>
<!-------------------------->
@@ -225,7 +228,7 @@
The reason is that as an optimization, each conceptual resumption point
is associated with either one or two labels, and if there are two labels,
these will differ in where they expect these variables to be. The
-the failure continuation stack entry created by the code generator
+failure continuation stack entry created by the code generator
that describes the resumption point will associate a resume map with
each label, with each resume map assigning a location to each variable
included in the resume vars set.
@@ -311,7 +314,7 @@
except those produced by the call. This is equivalent to the set of
variables that are live immediately after the call, minus the pre-birth
and post-birth sets of the call, which in turn is equivalent to the set
-of variables live before the call minus the the pre-death and post-death
+of variables live before the call minus the pre-death and post-death
sets of the call.
<p>
More information about the developers
mailing list