conservatory
/
dream-website
4
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Do routine cleanup 

- Clean up whitespace.
- Fix W3C HTML Validator warnings.
- Use CSS to style the table.
  (Try to replicate the effect of <table border>.)
This commit is contained in:
Lassi Kortela 2023-02-22 17:05:21 +02:00
parent 2aae3d999f
commit 6dead2c8ba
1 changed files with 89 additions and 71 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

160
www/index.html
View File

@ -1,29 +1,45 @@
<!DOCTYPE html>
<html>
<head>
<title>The 'dream' Scheme Interpreter</title>
<style type="text/css">
body { background-color:black; color:white; font-family:sans-serif; }
a { text-decoration:underline; }
<style type="text/css">
body {
background-color: black;
color: white;
font-family: sans-serif;
}
a {
text-decoration: underline;
}
table.border {
border-collapse: separate;
border-spacing: 2px;
border: thin outset gray;
}
table.border td, th {
border: thin inset gray;
}
</style>
</head>
<h1>The 'dream' Scheme Interpreter</h1>
<h1>The 'dream' Scheme Interpreter</h1>
by David Joseph Stith
<hr>
<b>Welcome to the home of my Scheme interpreter/compiler, 'dream', written in x86 machine language. :-)</b>
<br />
<hr>
<b>Welcome to the home of my Scheme interpreter/compiler, 'dream', written in x86 machine language. :-)</b>
<br />
All essential syntax and procedures from the <a href="http://www.swiss.ai.mit.edu/~jaffer/r4rs_toc.html">R4RS standard</a> are implemented.
<br />
<br />
The interpreter is properly tail recursive and passes all applicable tests from the 'r4rstest.scm' test suite.
<br />
<br />
Rational arithmetic with 32 bit magnitude numerator and denominator, or up to 262112 bit magnitude if the GMP library is available, is supported (with sign stored separately), but no Real or Complex numbers (these currently are in the works).
<hr>
<hr>
Dream is compiled using an x86 assembler written in Scheme, with a syntax very similar to GAS.
<br />
<br />
Consequently Dream compiles itself. :-)
<hr>
<b>Download latest version for Linux or Windows on x86:</b>
<hr>
<b>Download latest version for Linux or Windows on x86:</b>
<a href="/cgi-bin/wiki_joey/dream20110707.tar.gz">dream20110707.tar.gz</a>
<dt>Linux:</dt>
<dl>
<dt>Linux:</dt>
<dd>'dream' is an ELF executable that may use Linux syscalls only or, by default, is dynamically linked with <b>ld-linux.so.2</b> in order to provide access in scheme to dlopen, dlclose, and dlsym.</dd>
<dd>In particular, if <b>libgmp.so.3</b> is available then it is dynamically loaded in order to implement multiple precision integer arithmetic.</dd>
<dt>Windows:</dt>
@ -31,27 +47,29 @@ Consequently Dream compiles itself. :-)
<dd>In particular, if <b>libgmp-3.dll</b> is available then it is automatically loaded in order to implement multiple precision integer arithmetic.</dd>
<dd>dream.exe expects to find 'c:/dream/bootstrap.scm'.
So unzip to your C: drive, or else place a copy of 'bootstrap.scm' there.</dd>
</dl>
<hr>
<b>Check out my DreamOS based on the Dream Scheme
<b>Check out my DreamOS based on the Dream Scheme
Interpreter as a bootable floppy disk:</b> <a href="dreamos.html">dreamos</a>
:-)
<hr>
<h2>Notes on the Design</h2>
<p>
<hr>
<h2>Notes on the Design</h2>
<p>
The design for the 'dream' Scheme interpreter began with the design given in Abelson and Sussman's <a href="http://mitpress.mit.edu/sicp/full-text/book/book.html">Structure and Interpretation of Computer Programs</a>.
</p>
<p>In the following I will use the term 'byte' to refer to 8 bits, 'wyde' to refer to two bytes, 'tetra' to refer to four bytes, and 'octa' to refer to eight bytes.</p>
<h2>Garbage Collection</h2>
<p>
</p>
<p>In the following I will use the term 'byte' to refer to 8 bits, 'wyde' to refer to two bytes, 'tetra' to refer to four bytes, and 'octa' to refer to eight bytes.</p>
<h2>Garbage Collection</h2>
<p>
Two areas of memory of equal size are used for the storage of scheme objects.
Both are aligned on an 8-byte boundary.
Only one of the two is used at a time by the scheme interpreter; when it becomes full, the garbage collector copies all scheme objects in use to the other memory area (which then becomes the active one).
Dynamically allocated scheme objects other than symbols are represented by a discrete number of quad-words which are allocated consecutively within the active memory area.
<h2>Scheme Object Types</h2>
<h2>Scheme Object Types</h2>
<p>
The simplest object is the scheme pair which consists of two tetras each of which addresses a scheme object.
</p>
<p>
</p>
<p>
Symbols and statically allocated objects are not garbage-collected, but they must begin on a wyde boundary so that the addresses stored in pairs are always divisible by 2.
By virtue of the fact that all scheme objects begin on a wyde boundary, scheme objects other than scheme pairs are differentiated from scheme pairs by storing a tetra which is NOT divisible by 2 in the first tetra of the octa.
This tetra represents the type of scheme object.
@ -60,63 +78,63 @@ Statically allocated objects are given a type which is negative (sign bit set) s
All 256 ascii chars, #t and #f, and the end-of-file object are statically allocated.
Only one tetra is necessary for these statically allocated objects.
In the case of chars and booleans, the value is stored in the high byte of the low wyde.
</p>
<table border>
<tr>
<th></th><th>Bit:</th><th>0-7</th><th>8</th><th>9</th><th>10-15</th><th>16</th><th>17</th><th>18-30</th><th>31</th>
</tr>
<tr>
<th colspan="2">Scheme Object</th><th>Major Type</th><th>CDR is scheme?</th><th colspan="2">Minor Type</th><th colspan="3">Type Specific Info</th><th>Statically Allocated?</th>
</tr>
<tr>
<td rowspan="2">NUMBER</td><td>INTEGER</td><td rowspan="2">3</td><td>0</td><td colspan="2">0</td><td rowspan="2">Exact?</td><td>Negative?</td><td>Length in tetras (or 0 if value is stored directly in CDR)</td><td rowspan="2">0</td>
</tr>
<tr>
<td>RATIONAL</td><td>1</td><td colspan="2">0</td><td colspan="2"></td>
</tr>
<tr>
<tr>
<td rowspan="2">PORT</td><td>OUTPUT</td><td rowspan="2">5</td><td>0</td><td colspan="2">0</td><td colspan="3" rowspan="2"></td><td rowspan="2">0</td>
</tr>
<tr>
<td>INPUT</td><td>0</td><td colspan="2">1</td>
</tr>
<td colspan="2">STRING</td><td>7</td><td>0</td><td>Immutable?</td><td colspan="4">Length in bytes</td><td>0</td>
</tr>
<tr>
<td colspan="2">VECTOR</td><td>9</td><td>1</td><td>0</td><td colspan="4">Length in objects</td><td>0</th>
</tr>
</table>
<p>
</p>
<table class="border">
<tr>
<th></th><th>Bit:</th><th>0-7</th><th>8</th><th>9</th><th>10-15</th><th>16</th><th>17</th><th>18-30</th><th>31</th>
</tr>
<tr>
<th colspan="2">Scheme Object</th><th>Major Type</th><th>CDR is scheme?</th><th colspan="2">Minor Type</th><th colspan="3">Type Specific Info</th><th>Statically Allocated?</th>
</tr>
<tr>
<td rowspan="2">NUMBER</td><td>INTEGER</td><td rowspan="2">3</td><td>0</td><td colspan="2">0</td><td rowspan="2">Exact?</td><td>Negative?</td><td>Length in tetras (or 0 if value is stored directly in CDR)</td><td rowspan="2">0</td>
</tr>
<tr>
<td>RATIONAL</td><td>1</td><td colspan="2">0</td><td colspan="2"></td>
</tr>
<tr>
<td rowspan="2">PORT</td><td>OUTPUT</td><td rowspan="2">5</td><td>0</td><td colspan="2">0</td><td colspan="3" rowspan="2"></td><td rowspan="2">0</td>
</tr>
<tr>
<td>INPUT</td><td>0</td><td colspan="2">1</td>
</tr>
<tr>
<td colspan="2">STRING</td><td>7</td><td>0</td><td>Immutable?</td><td colspan="4">Length in bytes</td><td>0</td>
</tr>
<tr>
<td colspan="2">VECTOR</td><td>9</td><td>1</td><td>0</td><td colspan="4">Length in objects</td><td>0</td>
</tr>
</table>
<p>
Symbols are also given a negative type, since they are not garbage collected, but they are dynamically created in a separate memory area devoted to them.
Each symbol begins with the tetra type header (on a wyde boundary) which is followed by the bytes of ascii code that form the name of the symbol.
A zero byte marks the end of the symbol name.
The address of every symbol is stored in a simple hash keyed on just the first character of the symbol.
</p>
<p>
</p>
<p>
Strings, unlike symbols, are stored along with the other dynamically allocated objects, and use the second tetra to store the address of their string of ascii byte codes.
Furthermore, unlike symbols, the length of the string is stored in the header.
For mutable strings (the default) another pair of memory areas of equal size is used to store these strings of ascii byte codes.
When the active string storage area becomes full, the garbage collector copies in-use string data to the other string storage area (which then becomes the active one).
Otherwise the garbage collector leaves these string storage areas untouched.
The ascii data for immutable strings (produced by symbol->string) are always ignored by the garbage collector.
</p>
<p>
</p>
<p>
Vectors are stored as consecutive pairs (but the first tetra of the first pair is the vector type header.)
The length of the vector is stored in the header.
This and all other objects which require more than an octa of storage simply store the address of a scheme object in the second tetra and set the low bit in the high byte of the low wyde of their type to indicate to the garbage collector that this address in the second tetra must be followed just as if it were the cdr of a pair.
</p>
<p>
</p>
<p>
Procedures store their starting address in the second tetra.
</p>
<p>
</p>
<p>
Number types are distinguished by the high byte of the low wyde, which increases as the complexity of the type of number ascends the numeric tower. Integers simply store their 32 bit unsigned value in the second tetra. But integers requiring more than 32 bits for their absolute value store their length (in tetras) in the high 14 bits of their type tetra (sign bit clear), and the address of their data (just like string storage) in the second tetra. Rationals are stored as a pair of integers, thus the low bit in the high byte of the low wyde of their type is set so that the garbage collector will copy the pair. Inexactness of a number is indicated by setting the lowest bit of the high wyde of the number's type. Note, however, that all internal representations of numbers are exact (no floating point numbers are used), and so inexactness is given only as an auxiliary property of the number.
</p>
<p>
</p>
<p>
Input ports use the low byte of the high wyde of the type field to store the last character read by the (peek) procedure. The second tetra for both input and output ports holds the file descriptor associated with the port.
The ports returned by (current-input-port) and (current-output-port) are stored internally for efficiency's sake; they therefore must be treated by the garbage collector as if they were registers (and hence saved on the scheme stack before garbage collection begins and restored afterward).
</p>
<p>
</p>
<p>
Closures are initially stored simply as scheme along with the enclosing environment.
But as soon as the closure is applied, it is compiled to machine code.
This machine code is not relocatable, and hence a different garbage collection strategy is employed for this memory area.
@ -124,17 +142,17 @@ The garbage collector maintains a list of start addresses of machine code of act
Using this information, the largest free space is identified, and compilation of new closures occurs sequentially here until this space is filled.
At this point the garbage collector is invoked again, the largest space identified, and the process repeats.
This garbage collection process for machine code may be invoked from scheme with (sys-gc-lambda), which returns #t if a free space was found larger than the one that had been in use immediately prior.
</p>
<h2>The Stack</h2>
<p>
</p>
<h2>The Stack</h2>
<p>
The scheme object stack is maintained as a scheme list (dynamically allocated as pairs).
The garbage collector, when it runs, begins at the root of this scheme list.
Hence when garbage collection commences, only the registers and the current input and output ports need be saved on this scheme object stack and restored afterward to insure that all reachable objects are retained throughout the garbage collection process.
The native x86 stack (pointed to by the ESP register) is used for the flow of continuation control.
Consequently when call-with-current-continuation is invoked, this native stack is copied to a scheme list with each address represented as an Integer.
</p>
</p>
<h2>Scheme Registers</h2>
<p>
<p>
The registers denoted by EXP, ENV, UNEV, ARGL, VAL, and FREE in <a href="http://mitpress.mit.edu/sicp/full-text/book/book.html">Structure and Interpretation of Computer Programs</a> are implemented by the machine registers EDX, EBP, ESI, EDI, EAX, and EBX respectively.
The registers EXP, ENV, UNEV, ARGL, and VAL must point to a valid scheme object (or be zero) when the garbage collector is invoked.
Likewise, the garbage collector registers OLD, NEW, and SCAN are implemented by the machine registers ESI, EDI, and EAX respectively.