diff options
| author | Kartik K. Agaram <vc@akkartik.com> | 2016-12-26 11:44:14 -0800 |
|---|---|---|
| committer | Kartik K. Agaram <vc@akkartik.com> | 2016-12-26 11:44:14 -0800 |
| commit | 204dae921abff0c70e017215bb3c91fa6ca11aff (patch) | |
| tree | 548788d18c881e3f6beb56133c1ca9d733ffa1e8 /html/034address.cc.html | |
| parent | e5c11a5137d538b7713dd8708ca767c208824c06 (diff) | |
| download | mu-204dae921abff0c70e017215bb3c91fa6ca11aff.tar.gz | |
3710
Turns out we don't need to explicitly add anchors for each line. Vim's TOhtml has magic for that out of the box.
Diffstat (limited to 'html/034address.cc.html')
| -rw-r--r-- | html/034address.cc.html | 854 |
1 files changed, 427 insertions, 427 deletions
diff --git a/html/034address.cc.html b/html/034address.cc.html index 1dd7d0f7..98475a13 100644 --- a/html/034address.cc.html +++ b/html/034address.cc.html @@ -58,433 +58,433 @@ if ('onhashchange' in window) { </head> <body onload='JumpToLine();'> <pre id='vimCodeElement'> -<a name="L1"></a><span id="L1" class="LineNr"> 1 </span><span class="Comment">//: Addresses help us spend less time copying data around.</span> -<a name="L2"></a><span id="L2" class="LineNr"> 2 </span> -<a name="L3"></a><span id="L3" class="LineNr"> 3 </span><span class="Comment">//: So far we've been operating on primitives like numbers and characters, and</span> -<a name="L4"></a><span id="L4" class="LineNr"> 4 </span><span class="Comment">//: we've started combining these primitives together into larger logical</span> -<a name="L5"></a><span id="L5" class="LineNr"> 5 </span><span class="Comment">//: units (containers or arrays) that may contain many different primitives at</span> -<a name="L6"></a><span id="L6" class="LineNr"> 6 </span><span class="Comment">//: once. Containers and arrays can grow quite large in complex programs, and</span> -<a name="L7"></a><span id="L7" class="LineNr"> 7 </span><span class="Comment">//: we'd like some way to efficiently share them between recipes without</span> -<a name="L8"></a><span id="L8" class="LineNr"> 8 </span><span class="Comment">//: constantly having to make copies. Right now 'next-ingredient' and 'return'</span> -<a name="L9"></a><span id="L9" class="LineNr"> 9 </span><span class="Comment">//: copy data across recipe boundaries. To avoid copying large quantities of</span> -<a name="L10"></a><span id="L10" class="LineNr"> 10 </span><span class="Comment">//: data around, we'll use *addresses*. An address is a bookmark to some</span> -<a name="L11"></a><span id="L11" class="LineNr"> 11 </span><span class="Comment">//: arbitrary quantity of data (the *payload*). It's a primitive, so it's as</span> -<a name="L12"></a><span id="L12" class="LineNr"> 12 </span><span class="Comment">//: efficient to copy as a number. To read or modify the payload 'pointed to'</span> -<a name="L13"></a><span id="L13" class="LineNr"> 13 </span><span class="Comment">//: by an address, we'll perform a *lookup*.</span> -<a name="L14"></a><span id="L14" class="LineNr"> 14 </span><span class="Comment">//:</span> -<a name="L15"></a><span id="L15" class="LineNr"> 15 </span><span class="Comment">//: The notion of 'lookup' isn't an instruction like 'add' or 'subtract'.</span> -<a name="L16"></a><span id="L16" class="LineNr"> 16 </span><span class="Comment">//: Instead it's an operation that can be performed when reading any of the</span> -<a name="L17"></a><span id="L17" class="LineNr"> 17 </span><span class="Comment">//: ingredients of an instruction, and when writing to any of the products. To</span> -<a name="L18"></a><span id="L18" class="LineNr"> 18 </span><span class="Comment">//: write to the payload of an ingredient rather than its value, simply add</span> -<a name="L19"></a><span id="L19" class="LineNr"> 19 </span><span class="Comment">//: the /lookup property to it. Modern computers provide efficient support for</span> -<a name="L20"></a><span id="L20" class="LineNr"> 20 </span><span class="Comment">//: addresses and lookups, making this a realistic feature.</span> -<a name="L21"></a><span id="L21" class="LineNr"> 21 </span><span class="Comment">//:</span> -<a name="L22"></a><span id="L22" class="LineNr"> 22 </span><span class="Comment">//: To recap: an address is a bookmark to some potentially large payload, and</span> -<a name="L23"></a><span id="L23" class="LineNr"> 23 </span><span class="Comment">//: you can replace any ingredient or product with a lookup to an address of</span> -<a name="L24"></a><span id="L24" class="LineNr"> 24 </span><span class="Comment">//: the appropriate type. But how do we get addresses to begin with? That</span> -<a name="L25"></a><span id="L25" class="LineNr"> 25 </span><span class="Comment">//: requires a little more explanation. Once we introduce the notion of</span> -<a name="L26"></a><span id="L26" class="LineNr"> 26 </span><span class="Comment">//: bookmarks to data, we have to think about the life cycle of a piece of</span> -<a name="L27"></a><span id="L27" class="LineNr"> 27 </span><span class="Comment">//: data and its bookmarks (because remember, bookmarks can be copied around</span> -<a name="L28"></a><span id="L28" class="LineNr"> 28 </span><span class="Comment">//: just like anything else). Otherwise several bad outcomes can result (and</span> -<a name="L29"></a><span id="L29" class="LineNr"> 29 </span><span class="Comment">//: indeed *have* resulted in past languages like C):</span> -<a name="L30"></a><span id="L30" class="LineNr"> 30 </span><span class="Comment">//:</span> -<a name="L31"></a><span id="L31" class="LineNr"> 31 </span><span class="Comment">//: a) You can run out of memory if you don't have a way to reclaim</span> -<a name="L32"></a><span id="L32" class="LineNr"> 32 </span><span class="Comment">//: data.</span> -<a name="L33"></a><span id="L33" class="LineNr"> 33 </span><span class="Comment">//: b) If you allow data to be reclaimed, you have to be careful not to</span> -<a name="L34"></a><span id="L34" class="LineNr"> 34 </span><span class="Comment">//: leave any stale addresses pointing at it. Otherwise your program might</span> -<a name="L35"></a><span id="L35" class="LineNr"> 35 </span><span class="Comment">//: try to lookup such an address and find something unexpected. Such</span> -<a name="L36"></a><span id="L36" class="LineNr"> 36 </span><span class="Comment">//: problems can be very hard to track down, and they can also be exploited</span> -<a name="L37"></a><span id="L37" class="LineNr"> 37 </span><span class="Comment">//: to break into your computer over the network, etc.</span> -<a name="L38"></a><span id="L38" class="LineNr"> 38 </span><span class="Comment">//:</span> -<a name="L39"></a><span id="L39" class="LineNr"> 39 </span><span class="Comment">//: To avoid these problems, we introduce the notion of a *reference count* or</span> -<a name="L40"></a><span id="L40" class="LineNr"> 40 </span><span class="Comment">//: refcount. The life cycle of a bit of data accessed through addresses looks</span> -<a name="L41"></a><span id="L41" class="LineNr"> 41 </span><span class="Comment">//: like this.</span> -<a name="L42"></a><span id="L42" class="LineNr"> 42 </span><span class="Comment">//:</span> -<a name="L43"></a><span id="L43" class="LineNr"> 43 </span><span class="Comment">//: We create space in computer memory for it using the 'new' instruction.</span> -<a name="L44"></a><span id="L44" class="LineNr"> 44 </span><span class="Comment">//: The 'new' instruction takes a type as an ingredient, allocates</span> -<a name="L45"></a><span id="L45" class="LineNr"> 45 </span><span class="Comment">//: sufficient space to hold that type, and returns an address (bookmark)</span> -<a name="L46"></a><span id="L46" class="LineNr"> 46 </span><span class="Comment">//: to the allocated space.</span> -<a name="L47"></a><span id="L47" class="LineNr"> 47 </span><span class="Comment">//:</span> -<a name="L48"></a><span id="L48" class="LineNr"> 48 </span><span class="Comment">//: x:address:num <- new number:type</span> -<a name="L49"></a><span id="L49" class="LineNr"> 49 </span><span class="Comment">//:</span> -<a name="L50"></a><span id="L50" class="LineNr"> 50 </span><span class="Comment">//: +------------+</span> -<a name="L51"></a><span id="L51" class="LineNr"> 51 </span><span class="Comment">//: x -------> | number |</span> -<a name="L52"></a><span id="L52" class="LineNr"> 52 </span><span class="Comment">//: +------------+</span> -<a name="L53"></a><span id="L53" class="LineNr"> 53 </span><span class="Comment">//:</span> -<a name="L54"></a><span id="L54" class="LineNr"> 54 </span><span class="Comment">//: That isn't entirely accurate. Under the hood, 'new' allocates an extra</span> -<a name="L55"></a><span id="L55" class="LineNr"> 55 </span><span class="Comment">//: number -- the refcount:</span> -<a name="L56"></a><span id="L56" class="LineNr"> 56 </span><span class="Comment">//:</span> -<a name="L57"></a><span id="L57" class="LineNr"> 57 </span><span class="Comment">//: +------------+------------+</span> -<a name="L58"></a><span id="L58" class="LineNr"> 58 </span><span class="Comment">//: x -------> | refcount | number |</span> -<a name="L59"></a><span id="L59" class="LineNr"> 59 </span><span class="Comment">//: +------------+------------+</span> -<a name="L60"></a><span id="L60" class="LineNr"> 60 </span><span class="Comment">//:</span> -<a name="L61"></a><span id="L61" class="LineNr"> 61 </span><span class="Comment">//: This probably seems like a waste of space. In practice it isn't worth</span> -<a name="L62"></a><span id="L62" class="LineNr"> 62 </span><span class="Comment">//: allocating individual numbers and our payload will tend to be larger,</span> -<a name="L63"></a><span id="L63" class="LineNr"> 63 </span><span class="Comment">//: so the picture would look more like this (zooming out a bit):</span> -<a name="L64"></a><span id="L64" class="LineNr"> 64 </span><span class="Comment">//:</span> -<a name="L65"></a><span id="L65" class="LineNr"> 65 </span><span class="Comment">//: +-------------------------+</span> -<a name="L66"></a><span id="L66" class="LineNr"> 66 </span><span class="Comment">//: +---+ |</span> -<a name="L67"></a><span id="L67" class="LineNr"> 67 </span><span class="Comment">//: x -------> | r | |</span> -<a name="L68"></a><span id="L68" class="LineNr"> 68 </span><span class="Comment">//: +---+ DATA |</span> -<a name="L69"></a><span id="L69" class="LineNr"> 69 </span><span class="Comment">//: | |</span> -<a name="L70"></a><span id="L70" class="LineNr"> 70 </span><span class="Comment">//: | |</span> -<a name="L71"></a><span id="L71" class="LineNr"> 71 </span><span class="Comment">//: +-------------------------+</span> -<a name="L72"></a><span id="L72" class="LineNr"> 72 </span><span class="Comment">//:</span> -<a name="L73"></a><span id="L73" class="LineNr"> 73 </span><span class="Comment">//: (Here 'r' denotes the refcount. It occupies a tiny amount of space</span> -<a name="L74"></a><span id="L74" class="LineNr"> 74 </span><span class="Comment">//: compared to the payload.)</span> -<a name="L75"></a><span id="L75" class="LineNr"> 75 </span><span class="Comment">//:</span> -<a name="L76"></a><span id="L76" class="LineNr"> 76 </span><span class="Comment">//: Anyways, back to our example where the data is just a single number.</span> -<a name="L77"></a><span id="L77" class="LineNr"> 77 </span><span class="Comment">//: After the call to 'new', Mu's map of memory looks like this:</span> -<a name="L78"></a><span id="L78" class="LineNr"> 78 </span><span class="Comment">//:</span> -<a name="L79"></a><span id="L79" class="LineNr"> 79 </span><span class="Comment">//: +---+------------+</span> -<a name="L80"></a><span id="L80" class="LineNr"> 80 </span><span class="Comment">//: x -------> | 1 | number |</span> -<a name="L81"></a><span id="L81" class="LineNr"> 81 </span><span class="Comment">//: +---+------------+</span> -<a name="L82"></a><span id="L82" class="LineNr"> 82 </span><span class="Comment">//:</span> -<a name="L83"></a><span id="L83" class="LineNr"> 83 </span><span class="Comment">//: The refcount of 1 here indicates that this number has one bookmark</span> -<a name="L84"></a><span id="L84" class="LineNr"> 84 </span><span class="Comment">//: outstanding. If you then make a copy of x, the refcount increments:</span> -<a name="L85"></a><span id="L85" class="LineNr"> 85 </span><span class="Comment">//:</span> -<a name="L86"></a><span id="L86" class="LineNr"> 86 </span><span class="Comment">//: y:address:num <- copy x</span> -<a name="L87"></a><span id="L87" class="LineNr"> 87 </span><span class="Comment">//:</span> -<a name="L88"></a><span id="L88" class="LineNr"> 88 </span><span class="Comment">//: x ---+ +---+------------+</span> -<a name="L89"></a><span id="L89" class="LineNr"> 89 </span><span class="Comment">//: +---> | 2 | number |</span> -<a name="L90"></a><span id="L90" class="LineNr"> 90 </span><span class="Comment">//: y ---+ +---+------------+</span> -<a name="L91"></a><span id="L91" class="LineNr"> 91 </span><span class="Comment">//:</span> -<a name="L92"></a><span id="L92" class="LineNr"> 92 </span><span class="Comment">//: Whether you access the payload through x or y, Mu knows how many</span> -<a name="L93"></a><span id="L93" class="LineNr"> 93 </span><span class="Comment">//: bookmarks are outstanding to it. When you change x or y, the refcount</span> -<a name="L94"></a><span id="L94" class="LineNr"> 94 </span><span class="Comment">//: transparently decrements:</span> -<a name="L95"></a><span id="L95" class="LineNr"> 95 </span><span class="Comment">//:</span> -<a name="L96"></a><span id="L96" class="LineNr"> 96 </span><span class="Comment">//: x <- copy 0 # an address is just a number, you can always write 0 to it</span> -<a name="L97"></a><span id="L97" class="LineNr"> 97 </span><span class="Comment">//:</span> -<a name="L98"></a><span id="L98" class="LineNr"> 98 </span><span class="Comment">//: +---+------------+</span> -<a name="L99"></a><span id="L99" class="LineNr"> 99 </span><span class="Comment">//: y -------> | 1 | number |</span> -<a name="L100"></a><span id="L100" class="LineNr">100 </span><span class="Comment">//: +---+------------+</span> -<a name="L101"></a><span id="L101" class="LineNr">101 </span><span class="Comment">//:</span> -<a name="L102"></a><span id="L102" class="LineNr">102 </span><span class="Comment">//: The final flourish is what happens when the refcount goes down to 0: Mu</span> -<a name="L103"></a><span id="L103" class="LineNr">103 </span><span class="Comment">//: reclaims the space occupied by both refcount and payload in memory, and</span> -<a name="L104"></a><span id="L104" class="LineNr">104 </span><span class="Comment">//: they're ready to be reused by later calls to 'new'.</span> -<a name="L105"></a><span id="L105" class="LineNr">105 </span><span class="Comment">//:</span> -<a name="L106"></a><span id="L106" class="LineNr">106 </span><span class="Comment">//: y <- copy 0</span> -<a name="L107"></a><span id="L107" class="LineNr">107 </span><span class="Comment">//:</span> -<a name="L108"></a><span id="L108" class="LineNr">108 </span><span class="Comment">//: +---+------------+</span> -<a name="L109"></a><span id="L109" class="LineNr">109 </span><span class="Comment">//: | 0 | XXXXXXX |</span> -<a name="L110"></a><span id="L110" class="LineNr">110 </span><span class="Comment">//: +---+------------+</span> -<a name="L111"></a><span id="L111" class="LineNr">111 </span><span class="Comment">//:</span> -<a name="L112"></a><span id="L112" class="LineNr">112 </span><span class="Comment">//: Using refcounts fixes both our problems a) and b) above: you can use</span> -<a name="L113"></a><span id="L113" class="LineNr">113 </span><span class="Comment">//: memory for many different purposes as many times as you want without</span> -<a name="L114"></a><span id="L114" class="LineNr">114 </span><span class="Comment">//: running out of memory, and you don't have to worry about ever leaving a</span> -<a name="L115"></a><span id="L115" class="LineNr">115 </span><span class="Comment">//: dangling bookmark when you reclaim memory.</span> -<a name="L116"></a><span id="L116" class="LineNr">116 </span><span class="Comment">//:</span> -<a name="L117"></a><span id="L117" class="LineNr">117 </span><span class="Comment">//: This layer implements creating addresses using 'new'. The next few layers</span> -<a name="L118"></a><span id="L118" class="LineNr">118 </span><span class="Comment">//: will flesh out the rest of the life cycle.</span> -<a name="L119"></a><span id="L119" class="LineNr">119 </span> -<a name="L120"></a><span id="L120" class="LineNr">120 </span><span class="Comment">//: todo: give 'new' a custodian ingredient. Following malloc/free is a temporary hack.</span> -<a name="L121"></a><span id="L121" class="LineNr">121 </span> -<a name="L122"></a><span id="L122" class="LineNr">122 </span><span class="Delimiter">:(scenario new)</span> -<a name="L123"></a><span id="L123" class="LineNr">123 </span><span class="Comment"># call 'new' two times with identical types without modifying the results; you</span> -<a name="L124"></a><span id="L124" class="LineNr">124 </span><span class="Comment"># should get back different results</span> -<a name="L125"></a><span id="L125" class="LineNr">125 </span><span class="muRecipe">def</span> main [ -<a name="L126"></a><span id="L126" class="LineNr">126 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L127"></a><span id="L127" class="LineNr">127 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L128"></a><span id="L128" class="LineNr">128 </span> <span class="Constant">3</span>:<span class="Normal">bool</span>/<span class="Special">raw <- </span>equal <span class="Constant">1</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">2</span>:address:num/<span class="Special">raw</span> -<a name="L129"></a><span id="L129" class="LineNr">129 </span>] -<a name="L130"></a><span id="L130" class="LineNr">130 </span><span class="traceContains">+mem: storing 0 in location 3</span> -<a name="L131"></a><span id="L131" class="LineNr">131 </span> -<a name="L132"></a><span id="L132" class="LineNr">132 </span><span class="Delimiter">:(scenario new_array)</span> -<a name="L133"></a><span id="L133" class="LineNr">133 </span><span class="Comment"># call 'new' with a second ingredient to allocate an array of some type rather than a single copy</span> -<a name="L134"></a><span id="L134" class="LineNr">134 </span><span class="muRecipe">def</span> main [ -<a name="L135"></a><span id="L135" class="LineNr">135 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">5</span> -<a name="L136"></a><span id="L136" class="LineNr">136 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L137"></a><span id="L137" class="LineNr">137 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> -<a name="L138"></a><span id="L138" class="LineNr">138 </span>] -<a name="L139"></a><span id="L139" class="LineNr">139 </span><span class="traceContains">+run: {1: ("address" "array" "number"), "raw": ()} <- new {number: "type"}, {5: "literal"}</span> -<a name="L140"></a><span id="L140" class="LineNr">140 </span><span class="traceContains">+mem: array length is 5</span> -<a name="L141"></a><span id="L141" class="LineNr">141 </span><span class="Comment"># don't forget the extra location for array length, and the second extra location for the refcount</span> -<a name="L142"></a><span id="L142" class="LineNr">142 </span><span class="traceContains">+mem: storing 7 in location 3</span> -<a name="L143"></a><span id="L143" class="LineNr">143 </span> -<a name="L144"></a><span id="L144" class="LineNr">144 </span><span class="Delimiter">:(scenario dilated_reagent_with_new)</span> -<a name="L145"></a><span id="L145" class="LineNr">145 </span><span class="muRecipe">def</span> main [ -<a name="L146"></a><span id="L146" class="LineNr">146 </span> <span class="Constant">1</span>:address:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>address number<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> -<a name="L147"></a><span id="L147" class="LineNr">147 </span>] -<a name="L148"></a><span id="L148" class="LineNr">148 </span><span class="traceContains">+new: size of '(address number)' is 1</span> -<a name="L149"></a><span id="L149" class="LineNr">149 </span> -<a name="L150"></a><span id="L150" class="LineNr">150 </span><span class="Comment">//: 'new' takes a weird 'type' as its first ingredient; don't error on it</span> -<a name="L151"></a><span id="L151" class="LineNr">151 </span><span class="Delimiter">:(before "End Mu Types Initialization")</span> -<a name="L152"></a><span id="L152" class="LineNr">152 </span>put<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"type"</span><span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L153"></a><span id="L153" class="LineNr">153 </span><span class="Delimiter">:(code)</span> -<a name="L154"></a><span id="L154" class="LineNr">154 </span><span class="Normal">bool</span> is_mu_type_literal<span class="Delimiter">(</span><span class="Normal">const</span> reagent& r<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L155"></a><span id="L155" class="LineNr">155 </span> <span class="Identifier">return</span> is_literal<span class="Delimiter">(</span>r<span class="Delimiter">)</span> && r<span class="Delimiter">.</span>type && r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>name == <span class="Constant">"type"</span><span class="Delimiter">;</span> -<a name="L156"></a><span id="L156" class="LineNr">156 </span><span class="Delimiter">}</span> -<a name="L157"></a><span id="L157" class="LineNr">157 </span> -<a name="L158"></a><span id="L158" class="LineNr">158 </span><span class="Delimiter">:(before "End Primitive Recipe Declarations")</span> -<a name="L159"></a><span id="L159" class="LineNr">159 </span>NEW<span class="Delimiter">,</span> -<a name="L160"></a><span id="L160" class="LineNr">160 </span><span class="Delimiter">:(before "End Primitive Recipe Numbers")</span> -<a name="L161"></a><span id="L161" class="LineNr">161 </span>put<span class="Delimiter">(</span>Recipe_ordinal<span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">,</span> NEW<span class="Delimiter">);</span> -<a name="L162"></a><span id="L162" class="LineNr">162 </span><span class="Delimiter">:(before "End Primitive Recipe Checks")</span> -<a name="L163"></a><span id="L163" class="LineNr">163 </span><span class="Normal">case</span> NEW: <span class="Delimiter">{</span> -<a name="L164"></a><span id="L164" class="LineNr">164 </span> <span class="Normal">const</span> recipe& caller = get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">);</span> -<a name="L165"></a><span id="L165" class="LineNr">165 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>empty<span class="Delimiter">()</span> || SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">2</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L166"></a><span id="L166" class="LineNr">166 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"'new' requires one or two ingredients, but got '"</span> << inst<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L167"></a><span id="L167" class="LineNr">167 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L168"></a><span id="L168" class="LineNr">168 </span> <span class="Delimiter">}</span> -<a name="L169"></a><span id="L169" class="LineNr">169 </span> <span class="Comment">// End NEW Check Special-cases</span> -<a name="L170"></a><span id="L170" class="LineNr">170 </span> <span class="Normal">const</span> reagent& type = inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L171"></a><span id="L171" class="LineNr">171 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!is_mu_type_literal<span class="Delimiter">(</span>type<span class="Delimiter">))</span> <span class="Delimiter">{</span> -<a name="L172"></a><span id="L172" class="LineNr">172 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"first ingredient of 'new' should be a type, but got '"</span> << type<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L173"></a><span id="L173" class="LineNr">173 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L174"></a><span id="L174" class="LineNr">174 </span> <span class="Delimiter">}</span> -<a name="L175"></a><span id="L175" class="LineNr">175 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span> && !is_mu_number<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">)))</span> <span class="Delimiter">{</span> -<a name="L176"></a><span id="L176" class="LineNr">176 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"second ingredient of 'new' should be a number (array length), but got '"</span> << type<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L177"></a><span id="L177" class="LineNr">177 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L178"></a><span id="L178" class="LineNr">178 </span> <span class="Delimiter">}</span> -<a name="L179"></a><span id="L179" class="LineNr">179 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>products<span class="Delimiter">.</span>empty<span class="Delimiter">())</span> <span class="Delimiter">{</span> -<a name="L180"></a><span id="L180" class="LineNr">180 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"result of 'new' should never be ignored</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L181"></a><span id="L181" class="LineNr">181 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L182"></a><span id="L182" class="LineNr">182 </span> <span class="Delimiter">}</span> -<a name="L183"></a><span id="L183" class="LineNr">183 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product_of_new_is_valid<span class="Delimiter">(</span>inst<span class="Delimiter">))</span> <span class="Delimiter">{</span> -<a name="L184"></a><span id="L184" class="LineNr">184 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"product of 'new' has incorrect type: '"</span> << inst<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L185"></a><span id="L185" class="LineNr">185 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L186"></a><span id="L186" class="LineNr">186 </span> <span class="Delimiter">}</span> -<a name="L187"></a><span id="L187" class="LineNr">187 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L188"></a><span id="L188" class="LineNr">188 </span><span class="Delimiter">}</span> -<a name="L189"></a><span id="L189" class="LineNr">189 </span><span class="Delimiter">:(code)</span> -<a name="L190"></a><span id="L190" class="LineNr">190 </span><span class="Normal">bool</span> product_of_new_is_valid<span class="Delimiter">(</span><span class="Normal">const</span> instruction& inst<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L191"></a><span id="L191" class="LineNr">191 </span> reagent<span class="Comment">/*</span><span class="Comment">copy</span><span class="Comment">*/</span> product = inst<span class="Delimiter">.</span>products<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L192"></a><span id="L192" class="LineNr">192 </span> <span class="Comment">// Update NEW product in Check</span> -<a name="L193"></a><span id="L193" class="LineNr">193 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product<span class="Delimiter">.</span>type || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>value != get<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"address"</span><span class="Delimiter">))</span> -<a name="L194"></a><span id="L194" class="LineNr">194 </span> <span class="Identifier">return</span> <span class="Constant">false</span><span class="Delimiter">;</span> -<a name="L195"></a><span id="L195" class="LineNr">195 </span> drop_from_type<span class="Delimiter">(</span>product<span class="Delimiter">,</span> <span class="Constant">"address"</span><span class="Delimiter">);</span> -<a name="L196"></a><span id="L196" class="LineNr">196 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L197"></a><span id="L197" class="LineNr">197 </span> <span class="Comment">// array allocation</span> -<a name="L198"></a><span id="L198" class="LineNr">198 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product<span class="Delimiter">.</span>type || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>value != get<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"array"</span><span class="Delimiter">))</span> -<a name="L199"></a><span id="L199" class="LineNr">199 </span> <span class="Identifier">return</span> <span class="Constant">false</span><span class="Delimiter">;</span> -<a name="L200"></a><span id="L200" class="LineNr">200 </span> drop_from_type<span class="Delimiter">(</span>product<span class="Delimiter">,</span> <span class="Constant">"array"</span><span class="Delimiter">);</span> -<a name="L201"></a><span id="L201" class="LineNr">201 </span> <span class="Delimiter">}</span> -<a name="L202"></a><span id="L202" class="LineNr">202 </span> reagent<span class="Comment">/*</span><span class="Comment">local</span><span class="Comment">*/</span> expected_product<span class="Delimiter">;</span> -<a name="L203"></a><span id="L203" class="LineNr">203 </span> expected_product<span class="Delimiter">.</span>type = new_type_tree<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name<span class="Delimiter">);</span> -<a name="L204"></a><span id="L204" class="LineNr">204 </span> <span class="Identifier">return</span> types_strictly_match<span class="Delimiter">(</span>product<span class="Delimiter">,</span> expected_product<span class="Delimiter">);</span> -<a name="L205"></a><span id="L205" class="LineNr">205 </span><span class="Delimiter">}</span> -<a name="L206"></a><span id="L206" class="LineNr">206 </span> -<a name="L207"></a><span id="L207" class="LineNr">207 </span><span class="Normal">void</span> drop_from_type<span class="Delimiter">(</span>reagent& r<span class="Delimiter">,</span> string expected_type<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L208"></a><span id="L208" class="LineNr">208 </span> assert<span class="Delimiter">(</span>!r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom<span class="Delimiter">);</span> -<a name="L209"></a><span id="L209" class="LineNr">209 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>name != expected_type<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L210"></a><span id="L210" class="LineNr">210 </span> raise << <span class="Constant">"can't drop2 "</span> << expected_type << <span class="Constant">" from '"</span> << to_string<span class="Delimiter">(</span>r<span class="Delimiter">)</span> << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L211"></a><span id="L211" class="LineNr">211 </span> <span class="Identifier">return</span><span class="Delimiter">;</span> -<a name="L212"></a><span id="L212" class="LineNr">212 </span> <span class="Delimiter">}</span> -<a name="L213"></a><span id="L213" class="LineNr">213 </span> <span class="Comment">// r.type = r.type->right</span> -<a name="L214"></a><span id="L214" class="LineNr">214 </span> type_tree* tmp = r<span class="Delimiter">.</span>type<span class="Delimiter">;</span> -<a name="L215"></a><span id="L215" class="LineNr">215 </span> r<span class="Delimiter">.</span>type = tmp<span class="Delimiter">-></span>right<span class="Delimiter">;</span> -<a name="L216"></a><span id="L216" class="LineNr">216 </span> tmp<span class="Delimiter">-></span>right = <span class="Constant">NULL</span><span class="Delimiter">;</span> -<a name="L217"></a><span id="L217" class="LineNr">217 </span> <span class="Normal">delete</span> tmp<span class="Delimiter">;</span> -<a name="L218"></a><span id="L218" class="LineNr">218 </span> <span class="Comment">// if (!r.type->right) r.type = r.type->left</span> -<a name="L219"></a><span id="L219" class="LineNr">219 </span> assert<span class="Delimiter">(</span>!r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom<span class="Delimiter">);</span> -<a name="L220"></a><span id="L220" class="LineNr">220 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>right<span class="Delimiter">)</span> <span class="Identifier">return</span><span class="Delimiter">;</span> -<a name="L221"></a><span id="L221" class="LineNr">221 </span> tmp = r<span class="Delimiter">.</span>type<span class="Delimiter">;</span> -<a name="L222"></a><span id="L222" class="LineNr">222 </span> r<span class="Delimiter">.</span>type = tmp<span class="Delimiter">-></span>left<span class="Delimiter">;</span> -<a name="L223"></a><span id="L223" class="LineNr">223 </span> tmp<span class="Delimiter">-></span>left = <span class="Constant">NULL</span><span class="Delimiter">;</span> -<a name="L224"></a><span id="L224" class="LineNr">224 </span> <span class="Normal">delete</span> tmp<span class="Delimiter">;</span> -<a name="L225"></a><span id="L225" class="LineNr">225 </span><span class="Delimiter">}</span> -<a name="L226"></a><span id="L226" class="LineNr">226 </span> -<a name="L227"></a><span id="L227" class="LineNr">227 </span><span class="Delimiter">:(scenario new_returns_incorrect_type)</span> -<a name="L228"></a><span id="L228" class="LineNr">228 </span><span class="Special">% Hide_errors = true;</span> -<a name="L229"></a><span id="L229" class="LineNr">229 </span><span class="muRecipe">def</span> main [ -<a name="L230"></a><span id="L230" class="LineNr">230 </span> <span class="Constant">1</span>:<span class="Normal">bool</span><span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">num:type</span> -<a name="L231"></a><span id="L231" class="LineNr">231 </span>] -<a name="L232"></a><span id="L232" class="LineNr">232 </span><span class="traceContains">+error: main: product of 'new' has incorrect type: '1:bool <- new num:type'</span> -<a name="L233"></a><span id="L233" class="LineNr">233 </span> -<a name="L234"></a><span id="L234" class="LineNr">234 </span><span class="Delimiter">:(scenario new_discerns_singleton_list_from_atom_container)</span> -<a name="L235"></a><span id="L235" class="LineNr">235 </span><span class="Special">% Hide_errors = true;</span> -<a name="L236"></a><span id="L236" class="LineNr">236 </span><span class="muRecipe">def</span> main [ -<a name="L237"></a><span id="L237" class="LineNr">237 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>num<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> <span class="Comment"># should be '{num: type}'</span> -<a name="L238"></a><span id="L238" class="LineNr">238 </span>] -<a name="L239"></a><span id="L239" class="LineNr">239 </span><span class="traceContains">+error: main: product of 'new' has incorrect type: '1:address:num/raw <- new {(num): type}'</span> -<a name="L240"></a><span id="L240" class="LineNr">240 </span> -<a name="L241"></a><span id="L241" class="LineNr">241 </span><span class="Delimiter">:(scenario new_with_type_abbreviation)</span> -<a name="L242"></a><span id="L242" class="LineNr">242 </span><span class="muRecipe">def</span> main [ -<a name="L243"></a><span id="L243" class="LineNr">243 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">num:type</span> -<a name="L244"></a><span id="L244" class="LineNr">244 </span>] -<a name="L245"></a><span id="L245" class="LineNr">245 </span>$error: <span class="Constant">0</span> -<a name="L246"></a><span id="L246" class="LineNr">246 </span> -<a name="L247"></a><span id="L247" class="LineNr">247 </span><span class="Delimiter">:(scenario new_with_type_abbreviation_inside_compound)</span> -<a name="L248"></a><span id="L248" class="LineNr">248 </span><span class="muRecipe">def</span> main [ -<a name="L249"></a><span id="L249" class="LineNr">249 </span> <span class="Delimiter">{</span><span class="Constant">1</span>: <span class="Delimiter">(</span>address address number<span class="Delimiter">),</span> <span class="Special">raw</span>: <span class="Delimiter">()}</span><span class="Special"> <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>& num<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> -<a name="L250"></a><span id="L250" class="LineNr">250 </span>] -<a name="L251"></a><span id="L251" class="LineNr">251 </span>$error: <span class="Constant">0</span> -<a name="L252"></a><span id="L252" class="LineNr">252 </span> -<a name="L253"></a><span id="L253" class="LineNr">253 </span><span class="Comment">//: To implement 'new', a Mu transform turns all 'new' instructions into</span> -<a name="L254"></a><span id="L254" class="LineNr">254 </span><span class="Comment">//: 'allocate' instructions that precompute the amount of memory they want to</span> -<a name="L255"></a><span id="L255" class="LineNr">255 </span><span class="Comment">//: allocate.</span> -<a name="L256"></a><span id="L256" class="LineNr">256 </span> -<a name="L257"></a><span id="L257" class="LineNr">257 </span><span class="Comment">//: Ensure that we never call 'allocate' directly, and that there's no 'new'</span> -<a name="L258"></a><span id="L258" class="LineNr">258 </span><span class="Comment">//: instructions left after the transforms have run.</span> -<a name="L259"></a><span id="L259" class="LineNr">259 </span><span class="Delimiter">:(before "End Primitive Recipe Checks")</span> -<a name="L260"></a><span id="L260" class="LineNr">260 </span><span class="Normal">case</span> ALLOCATE: <span class="Delimiter">{</span> -<a name="L261"></a><span id="L261" class="LineNr">261 </span> raise << <span class="Constant">"never call 'allocate' directly'; always use 'new'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L262"></a><span id="L262" class="LineNr">262 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L263"></a><span id="L263" class="LineNr">263 </span><span class="Delimiter">}</span> -<a name="L264"></a><span id="L264" class="LineNr">264 </span><span class="Delimiter">:(before "End Primitive Recipe Implementations")</span> -<a name="L265"></a><span id="L265" class="LineNr">265 </span><span class="Normal">case</span> NEW: <span class="Delimiter">{</span> -<a name="L266"></a><span id="L266" class="LineNr">266 </span> raise << <span class="Constant">"no implementation for 'new'; why wasn't it translated to 'allocate'? Please save a copy of your program and send it to Kartik.</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> -<a name="L267"></a><span id="L267" class="LineNr">267 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L268"></a><span id="L268" class="LineNr">268 </span><span class="Delimiter">}</span> -<a name="L269"></a><span id="L269" class="LineNr">269 </span> -<a name="L270"></a><span id="L270" class="LineNr">270 </span><span class="Delimiter">:(after "Transform.push_back(check_instruction)")</span> <span class="Comment">// check_instruction will guard against direct 'allocate' instructions below</span> -<a name="L271"></a><span id="L271" class="LineNr">271 </span>Transform<span class="Delimiter">.</span>push_back<span class="Delimiter">(</span>transform_new_to_allocate<span class="Delimiter">);</span> <span class="Comment">// idempotent</span> -<a name="L272"></a><span id="L272" class="LineNr">272 </span> -<a name="L273"></a><span id="L273" class="LineNr">273 </span><span class="Delimiter">:(code)</span> -<a name="L274"></a><span id="L274" class="LineNr">274 </span><span class="Normal">void</span> transform_new_to_allocate<span class="Delimiter">(</span><span class="Normal">const</span> recipe_ordinal r<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L275"></a><span id="L275" class="LineNr">275 </span> trace<span class="Delimiter">(</span><span class="Constant">9991</span><span class="Delimiter">,</span> <span class="Constant">"transform"</span><span class="Delimiter">)</span> << <span class="Constant">"--- convert 'new' to 'allocate' for recipe "</span> << get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>name << end<span class="Delimiter">();</span> -<a name="L276"></a><span id="L276" class="LineNr">276 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> i = <span class="Constant">0</span><span class="Delimiter">;</span> i < SIZE<span class="Delimiter">(</span>get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>steps<span class="Delimiter">);</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L277"></a><span id="L277" class="LineNr">277 </span> instruction& inst = get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>steps<span class="Delimiter">.</span>at<span class="Delimiter">(</span>i<span class="Delimiter">);</span> -<a name="L278"></a><span id="L278" class="LineNr">278 </span> <span class="Comment">// Convert 'new' To 'allocate'</span> -<a name="L279"></a><span id="L279" class="LineNr">279 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>name == <span class="Constant">"new"</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L280"></a><span id="L280" class="LineNr">280 </span> inst<span class="Delimiter">.</span>operation = ALLOCATE<span class="Delimiter">;</span> -<a name="L281"></a><span id="L281" class="LineNr">281 </span> type_tree* type = new_type_tree<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name<span class="Delimiter">);</span> -<a name="L282"></a><span id="L282" class="LineNr">282 </span> inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>set_value<span class="Delimiter">(</span>size_of<span class="Delimiter">(</span>type<span class="Delimiter">));</span> -<a name="L283"></a><span id="L283" class="LineNr">283 </span> trace<span class="Delimiter">(</span><span class="Constant">9992</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"size of '"</span> << inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name << <span class="Constant">"' is "</span> << inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>value << end<span class="Delimiter">();</span> -<a name="L284"></a><span id="L284" class="LineNr">284 </span> <span class="Normal">delete</span> type<span class="Delimiter">;</span> -<a name="L285"></a><span id="L285" class="LineNr">285 </span> <span class="Delimiter">}</span> -<a name="L286"></a><span id="L286" class="LineNr">286 </span> <span class="Delimiter">}</span> -<a name="L287"></a><span id="L287" class="LineNr">287 </span><span class="Delimiter">}</span> -<a name="L288"></a><span id="L288" class="LineNr">288 </span> -<a name="L289"></a><span id="L289" class="LineNr">289 </span><span class="Comment">//: implement 'allocate' based on size</span> -<a name="L290"></a><span id="L290" class="LineNr">290 </span> -<a name="L291"></a><span id="L291" class="LineNr">291 </span><span class="Delimiter">:(before "End Globals")</span> -<a name="L292"></a><span id="L292" class="LineNr">292 </span><span class="Normal">extern</span> <span class="Normal">const</span> <span class="Normal">int</span> Reserved_for_tests = <span class="Constant">1000</span><span class="Delimiter">;</span> -<a name="L293"></a><span id="L293" class="LineNr">293 </span><span class="Normal">int</span> Memory_allocated_until = Reserved_for_tests<span class="Delimiter">;</span> -<a name="L294"></a><span id="L294" class="LineNr">294 </span><span class="Normal">int</span> Initial_memory_per_routine = <span class="Constant">100000</span><span class="Delimiter">;</span> -<a name="L295"></a><span id="L295" class="LineNr">295 </span><span class="Delimiter">:(before "End Setup")</span> -<a name="L296"></a><span id="L296" class="LineNr">296 </span>Memory_allocated_until = Reserved_for_tests<span class="Delimiter">;</span> -<a name="L297"></a><span id="L297" class="LineNr">297 </span>Initial_memory_per_routine = <span class="Constant">100000</span><span class="Delimiter">;</span> -<a name="L298"></a><span id="L298" class="LineNr">298 </span><span class="Delimiter">:(before "End routine Fields")</span> -<a name="L299"></a><span id="L299" class="LineNr">299 </span><span class="Normal">int</span> alloc<span class="Delimiter">,</span> alloc_max<span class="Delimiter">;</span> -<a name="L300"></a><span id="L300" class="LineNr">300 </span><span class="Delimiter">:(before "End routine Constructor")</span> -<a name="L301"></a><span id="L301" class="LineNr">301 </span>alloc = Memory_allocated_until<span class="Delimiter">;</span> -<a name="L302"></a><span id="L302" class="LineNr">302 </span>Memory_allocated_until += Initial_memory_per_routine<span class="Delimiter">;</span> -<a name="L303"></a><span id="L303" class="LineNr">303 </span>alloc_max = Memory_allocated_until<span class="Delimiter">;</span> -<a name="L304"></a><span id="L304" class="LineNr">304 </span>trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"routine allocated memory from "</span> << alloc << <span class="Constant">" to "</span> << alloc_max << end<span class="Delimiter">();</span> -<a name="L305"></a><span id="L305" class="LineNr">305 </span> -<a name="L306"></a><span id="L306" class="LineNr">306 </span><span class="Delimiter">:(before "End Primitive Recipe Declarations")</span> -<a name="L307"></a><span id="L307" class="LineNr">307 </span>ALLOCATE<span class="Delimiter">,</span> -<a name="L308"></a><span id="L308" class="LineNr">308 </span><span class="Delimiter">:(before "End Primitive Recipe Numbers")</span> -<a name="L309"></a><span id="L309" class="LineNr">309 </span>put<span class="Delimiter">(</span>Recipe_ordinal<span class="Delimiter">,</span> <span class="Constant">"allocate"</span><span class="Delimiter">,</span> ALLOCATE<span class="Delimiter">);</span> -<a name="L310"></a><span id="L310" class="LineNr">310 </span><span class="Delimiter">:(before "End Primitive Recipe Implementations")</span> -<a name="L311"></a><span id="L311" class="LineNr">311 </span><span class="Normal">case</span> ALLOCATE: <span class="Delimiter">{</span> -<a name="L312"></a><span id="L312" class="LineNr">312 </span> <span class="Comment">// compute the space we need</span> -<a name="L313"></a><span id="L313" class="LineNr">313 </span> <span class="Normal">int</span> size = ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L314"></a><span id="L314" class="LineNr">314 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L315"></a><span id="L315" class="LineNr">315 </span> <span class="Comment">// array allocation</span> -<a name="L316"></a><span id="L316" class="LineNr">316 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"array length is "</span> << ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">)</span> << end<span class="Delimiter">();</span> -<a name="L317"></a><span id="L317" class="LineNr">317 </span> size = <span class="Comment">/*</span><span class="Comment">space for length</span><span class="Comment">*/</span><span class="Constant">1</span> + size*ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L318"></a><span id="L318" class="LineNr">318 </span> <span class="Delimiter">}</span> -<a name="L319"></a><span id="L319" class="LineNr">319 </span> <span class="Normal">int</span> result = allocate<span class="Delimiter">(</span>size<span class="Delimiter">);</span> -<a name="L320"></a><span id="L320" class="LineNr">320 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>current_instruction<span class="Delimiter">().</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L321"></a><span id="L321" class="LineNr">321 </span> <span class="Comment">// initialize array length</span> -<a name="L322"></a><span id="L322" class="LineNr">322 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"storing "</span> << ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">)</span> << <span class="Constant">" in location "</span> << result+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span> << end<span class="Delimiter">();</span> -<a name="L323"></a><span id="L323" class="LineNr">323 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">,</span> ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">));</span> -<a name="L324"></a><span id="L324" class="LineNr">324 </span> <span class="Delimiter">}</span> -<a name="L325"></a><span id="L325" class="LineNr">325 </span> products<span class="Delimiter">.</span>resize<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">);</span> -<a name="L326"></a><span id="L326" class="LineNr">326 </span> products<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>push_back<span class="Delimiter">(</span>result<span class="Delimiter">);</span> -<a name="L327"></a><span id="L327" class="LineNr">327 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> -<a name="L328"></a><span id="L328" class="LineNr">328 </span><span class="Delimiter">}</span> -<a name="L329"></a><span id="L329" class="LineNr">329 </span><span class="Delimiter">:(code)</span> -<a name="L330"></a><span id="L330" class="LineNr">330 </span><span class="Normal">int</span> allocate<span class="Delimiter">(</span><span class="Normal">int</span> size<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L331"></a><span id="L331" class="LineNr">331 </span> <span class="Comment">// include space for refcount</span> -<a name="L332"></a><span id="L332" class="LineNr">332 </span> ++size<span class="Delimiter">;</span> -<a name="L333"></a><span id="L333" class="LineNr">333 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"allocating size "</span> << size << end<span class="Delimiter">();</span> -<a name="L334"></a><span id="L334" class="LineNr">334 </span><span class="CommentedCode">//? Total_alloc += size;</span> -<a name="L335"></a><span id="L335" class="LineNr">335 </span><span class="CommentedCode">//? ++Num_alloc;</span> -<a name="L336"></a><span id="L336" class="LineNr">336 </span> <span class="Comment">// Allocate Special-cases</span> -<a name="L337"></a><span id="L337" class="LineNr">337 </span> <span class="Comment">// compute the region of memory to return</span> -<a name="L338"></a><span id="L338" class="LineNr">338 </span> <span class="Comment">// really crappy at the moment</span> -<a name="L339"></a><span id="L339" class="LineNr">339 </span> ensure_space<span class="Delimiter">(</span>size<span class="Delimiter">);</span> -<a name="L340"></a><span id="L340" class="LineNr">340 </span> <span class="Normal">const</span> <span class="Normal">int</span> result = Current_routine<span class="Delimiter">-></span>alloc<span class="Delimiter">;</span> -<a name="L341"></a><span id="L341" class="LineNr">341 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"new alloc: "</span> << result << end<span class="Delimiter">();</span> -<a name="L342"></a><span id="L342" class="LineNr">342 </span> <span class="Comment">// initialize allocated space</span> -<a name="L343"></a><span id="L343" class="LineNr">343 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> address = result<span class="Delimiter">;</span> address < result+size<span class="Delimiter">;</span> ++address<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L344"></a><span id="L344" class="LineNr">344 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"storing 0 in location "</span> << address << end<span class="Delimiter">();</span> -<a name="L345"></a><span id="L345" class="LineNr">345 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L346"></a><span id="L346" class="LineNr">346 </span> <span class="Delimiter">}</span> -<a name="L347"></a><span id="L347" class="LineNr">347 </span> Current_routine<span class="Delimiter">-></span>alloc += size<span class="Delimiter">;</span> -<a name="L348"></a><span id="L348" class="LineNr">348 </span> <span class="Comment">// no support yet for reclaiming memory between routines</span> -<a name="L349"></a><span id="L349" class="LineNr">349 </span> assert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>alloc <= Current_routine<span class="Delimiter">-></span>alloc_max<span class="Delimiter">);</span> -<a name="L350"></a><span id="L350" class="LineNr">350 </span> <span class="Identifier">return</span> result<span class="Delimiter">;</span> -<a name="L351"></a><span id="L351" class="LineNr">351 </span><span class="Delimiter">}</span> -<a name="L352"></a><span id="L352" class="LineNr">352 </span> -<a name="L353"></a><span id="L353" class="LineNr">353 </span><span class="Comment">//: statistics for debugging</span> -<a name="L354"></a><span id="L354" class="LineNr">354 </span><span class="CommentedCode">//? :(before "End Globals")</span> -<a name="L355"></a><span id="L355" class="LineNr">355 </span><span class="CommentedCode">//? int Total_alloc = 0;</span> -<a name="L356"></a><span id="L356" class="LineNr">356 </span><span class="CommentedCode">//? int Num_alloc = 0;</span> -<a name="L357"></a><span id="L357" class="LineNr">357 </span><span class="CommentedCode">//? int Total_free = 0;</span> -<a name="L358"></a><span id="L358" class="LineNr">358 </span><span class="CommentedCode">//? int Num_free = 0;</span> -<a name="L359"></a><span id="L359" class="LineNr">359 </span><span class="CommentedCode">//? :(before "End Setup")</span> -<a name="L360"></a><span id="L360" class="LineNr">360 </span><span class="CommentedCode">//? Total_alloc = Num_alloc = Total_free = Num_free = 0;</span> -<a name="L361"></a><span id="L361" class="LineNr">361 </span><span class="CommentedCode">//? :(before "End Teardown")</span> -<a name="L362"></a><span id="L362" class="LineNr">362 </span><span class="CommentedCode">//? cerr << Total_alloc << "/" << Num_alloc</span> -<a name="L363"></a><span id="L363" class="LineNr">363 </span><span class="CommentedCode">//? << " vs " << Total_free << "/" << Num_free << '\n';</span> -<a name="L364"></a><span id="L364" class="LineNr">364 </span><span class="CommentedCode">//? cerr << SIZE(Memory) << '\n';</span> -<a name="L365"></a><span id="L365" class="LineNr">365 </span> -<a name="L366"></a><span id="L366" class="LineNr">366 </span><span class="Delimiter">:(code)</span> -<a name="L367"></a><span id="L367" class="LineNr">367 </span><span class="Normal">void</span> ensure_space<span class="Delimiter">(</span><span class="Normal">int</span> size<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L368"></a><span id="L368" class="LineNr">368 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>size > Initial_memory_per_routine<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L369"></a><span id="L369" class="LineNr">369 </span> tb_shutdown<span class="Delimiter">();</span> -<a name="L370"></a><span id="L370" class="LineNr">370 </span> cerr << <span class="Constant">"can't allocate "</span> << size << <span class="Constant">" locations, that's too much compared to "</span> << Initial_memory_per_routine << <span class="Constant">".</span><span class="cSpecial">\n</span><span class="Constant">"</span><span class="Delimiter">;</span> -<a name="L371"></a><span id="L371" class="LineNr">371 </span> exit<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> -<a name="L372"></a><span id="L372" class="LineNr">372 </span> <span class="Delimiter">}</span> -<a name="L373"></a><span id="L373" class="LineNr">373 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>alloc + size > Current_routine<span class="Delimiter">-></span>alloc_max<span class="Delimiter">)</span> <span class="Delimiter">{</span> -<a name="L374"></a><span id="L374" class="LineNr">374 </span> <span class="Comment">// waste the remaining space and create a new chunk</span> -<a name="L375"></a><span id="L375" class="LineNr">375 </span> Current_routine<span class="Delimiter">-></span>alloc = Memory_allocated_until<span class="Delimiter">;</span> -<a name="L376"></a><span id="L376" class="LineNr">376 </span> Memory_allocated_until += Initial_memory_per_routine<span class="Delimiter">;</span> -<a name="L377"></a><span id="L377" class="LineNr">377 </span> Current_routine<span class="Delimiter">-></span>alloc_max = Memory_allocated_until<span class="Delimiter">;</span> -<a name="L378"></a><span id="L378" class="LineNr">378 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"routine allocated memory from "</span> << Current_routine<span class="Delimiter">-></span>alloc << <span class="Constant">" to "</span> << Current_routine<span class="Delimiter">-></span>alloc_max << end<span class="Delimiter">();</span> -<a name="L379"></a><span id="L379" class="LineNr">379 </span> <span class="Delimiter">}</span> -<a name="L380"></a><span id="L380" class="LineNr">380 </span><span class="Delimiter">}</span> -<a name="L381"></a><span id="L381" class="LineNr">381 </span> -<a name="L382"></a><span id="L382" class="LineNr">382 </span><span class="Delimiter">:(scenario new_initializes)</span> -<a name="L383"></a><span id="L383" class="LineNr">383 </span><span class="Special">% Memory_allocated_until = 10;</span> -<a name="L384"></a><span id="L384" class="LineNr">384 </span><span class="Special">% put(Memory, Memory_allocated_until, 1);</span> -<a name="L385"></a><span id="L385" class="LineNr">385 </span><span class="muRecipe">def</span> main [ -<a name="L386"></a><span id="L386" class="LineNr">386 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L387"></a><span id="L387" class="LineNr">387 </span>] -<a name="L388"></a><span id="L388" class="LineNr">388 </span><span class="traceContains">+mem: storing 0 in location 10</span> -<a name="L389"></a><span id="L389" class="LineNr">389 </span> -<a name="L390"></a><span id="L390" class="LineNr">390 </span><span class="Delimiter">:(scenario new_size)</span> -<a name="L391"></a><span id="L391" class="LineNr">391 </span><span class="muRecipe">def</span> main [ -<a name="L392"></a><span id="L392" class="LineNr">392 </span> <span class="Constant">11</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L393"></a><span id="L393" class="LineNr">393 </span> <span class="Constant">12</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L394"></a><span id="L394" class="LineNr">394 </span> <span class="Constant">13</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">12</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">11</span>:address:num/<span class="Special">raw</span> -<a name="L395"></a><span id="L395" class="LineNr">395 </span>] -<a name="L396"></a><span id="L396" class="LineNr">396 </span><span class="Comment"># size of number + refcount</span> -<a name="L397"></a><span id="L397" class="LineNr">397 </span><span class="traceContains">+mem: storing 2 in location 13</span> -<a name="L398"></a><span id="L398" class="LineNr">398 </span> -<a name="L399"></a><span id="L399" class="LineNr">399 </span><span class="Delimiter">:(scenario new_array_size)</span> -<a name="L400"></a><span id="L400" class="LineNr">400 </span><span class="muRecipe">def</span> main [ -<a name="L401"></a><span id="L401" class="LineNr">401 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">5</span> -<a name="L402"></a><span id="L402" class="LineNr">402 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L403"></a><span id="L403" class="LineNr">403 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> -<a name="L404"></a><span id="L404" class="LineNr">404 </span>] -<a name="L405"></a><span id="L405" class="LineNr">405 </span><span class="Comment"># 5 locations for array contents + array length + refcount</span> -<a name="L406"></a><span id="L406" class="LineNr">406 </span><span class="traceContains">+mem: storing 7 in location 3</span> -<a name="L407"></a><span id="L407" class="LineNr">407 </span> -<a name="L408"></a><span id="L408" class="LineNr">408 </span><span class="Delimiter">:(scenario new_empty_array)</span> -<a name="L409"></a><span id="L409" class="LineNr">409 </span><span class="muRecipe">def</span> main [ -<a name="L410"></a><span id="L410" class="LineNr">410 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">0</span> -<a name="L411"></a><span id="L411" class="LineNr">411 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L412"></a><span id="L412" class="LineNr">412 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> -<a name="L413"></a><span id="L413" class="LineNr">413 </span>] -<a name="L414"></a><span id="L414" class="LineNr">414 </span><span class="traceContains">+run: {1: ("address" "array" "number"), "raw": ()} <- new {number: "type"}, {0: "literal"}</span> -<a name="L415"></a><span id="L415" class="LineNr">415 </span><span class="traceContains">+mem: array length is 0</span> -<a name="L416"></a><span id="L416" class="LineNr">416 </span><span class="Comment"># one location for array length, and one for the refcount</span> -<a name="L417"></a><span id="L417" class="LineNr">417 </span><span class="traceContains">+mem: storing 2 in location 3</span> -<a name="L418"></a><span id="L418" class="LineNr">418 </span> -<a name="L419"></a><span id="L419" class="LineNr">419 </span><span class="Comment">//: If a routine runs out of its initial allocation, it should allocate more.</span> -<a name="L420"></a><span id="L420" class="LineNr">420 </span><span class="Delimiter">:(scenario new_overflow)</span> -<a name="L421"></a><span id="L421" class="LineNr">421 </span><span class="Special">% Initial_memory_per_routine = 3; // barely enough room for point allocation below</span> -<a name="L422"></a><span id="L422" class="LineNr">422 </span><span class="muRecipe">def</span> main [ -<a name="L423"></a><span id="L423" class="LineNr">423 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> -<a name="L424"></a><span id="L424" class="LineNr">424 </span> <span class="Constant">2</span>:address:point/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">point:type</span> <span class="Comment"># not enough room in initial page</span> -<a name="L425"></a><span id="L425" class="LineNr">425 </span>] -<a name="L426"></a><span id="L426" class="LineNr">426 </span><span class="traceContains">+new: routine allocated memory from 1000 to 1003</span> -<a name="L427"></a><span id="L427" class="LineNr">427 </span><span class="traceContains">+new: routine allocated memory from 1003 to 1006</span> +<span id="L1" class="LineNr"> 1 </span><span class="Comment">//: Addresses help us spend less time copying data around.</span> +<span id="L2" class="LineNr"> 2 </span> +<span id="L3" class="LineNr"> 3 </span><span class="Comment">//: So far we've been operating on primitives like numbers and characters, and</span> +<span id="L4" class="LineNr"> 4 </span><span class="Comment">//: we've started combining these primitives together into larger logical</span> +<span id="L5" class="LineNr"> 5 </span><span class="Comment">//: units (containers or arrays) that may contain many different primitives at</span> +<span id="L6" class="LineNr"> 6 </span><span class="Comment">//: once. Containers and arrays can grow quite large in complex programs, and</span> +<span id="L7" class="LineNr"> 7 </span><span class="Comment">//: we'd like some way to efficiently share them between recipes without</span> +<span id="L8" class="LineNr"> 8 </span><span class="Comment">//: constantly having to make copies. Right now 'next-ingredient' and 'return'</span> +<span id="L9" class="LineNr"> 9 </span><span class="Comment">//: copy data across recipe boundaries. To avoid copying large quantities of</span> +<span id="L10" class="LineNr"> 10 </span><span class="Comment">//: data around, we'll use *addresses*. An address is a bookmark to some</span> +<span id="L11" class="LineNr"> 11 </span><span class="Comment">//: arbitrary quantity of data (the *payload*). It's a primitive, so it's as</span> +<span id="L12" class="LineNr"> 12 </span><span class="Comment">//: efficient to copy as a number. To read or modify the payload 'pointed to'</span> +<span id="L13" class="LineNr"> 13 </span><span class="Comment">//: by an address, we'll perform a *lookup*.</span> +<span id="L14" class="LineNr"> 14 </span><span class="Comment">//:</span> +<span id="L15" class="LineNr"> 15 </span><span class="Comment">//: The notion of 'lookup' isn't an instruction like 'add' or 'subtract'.</span> +<span id="L16" class="LineNr"> 16 </span><span class="Comment">//: Instead it's an operation that can be performed when reading any of the</span> +<span id="L17" class="LineNr"> 17 </span><span class="Comment">//: ingredients of an instruction, and when writing to any of the products. To</span> +<span id="L18" class="LineNr"> 18 </span><span class="Comment">//: write to the payload of an ingredient rather than its value, simply add</span> +<span id="L19" class="LineNr"> 19 </span><span class="Comment">//: the /lookup property to it. Modern computers provide efficient support for</span> +<span id="L20" class="LineNr"> 20 </span><span class="Comment">//: addresses and lookups, making this a realistic feature.</span> +<span id="L21" class="LineNr"> 21 </span><span class="Comment">//:</span> +<span id="L22" class="LineNr"> 22 </span><span class="Comment">//: To recap: an address is a bookmark to some potentially large payload, and</span> +<span id="L23" class="LineNr"> 23 </span><span class="Comment">//: you can replace any ingredient or product with a lookup to an address of</span> +<span id="L24" class="LineNr"> 24 </span><span class="Comment">//: the appropriate type. But how do we get addresses to begin with? That</span> +<span id="L25" class="LineNr"> 25 </span><span class="Comment">//: requires a little more explanation. Once we introduce the notion of</span> +<span id="L26" class="LineNr"> 26 </span><span class="Comment">//: bookmarks to data, we have to think about the life cycle of a piece of</span> +<span id="L27" class="LineNr"> 27 </span><span class="Comment">//: data and its bookmarks (because remember, bookmarks can be copied around</span> +<span id="L28" class="LineNr"> 28 </span><span class="Comment">//: just like anything else). Otherwise several bad outcomes can result (and</span> +<span id="L29" class="LineNr"> 29 </span><span class="Comment">//: indeed *have* resulted in past languages like C):</span> +<span id="L30" class="LineNr"> 30 </span><span class="Comment">//:</span> +<span id="L31" class="LineNr"> 31 </span><span class="Comment">//: a) You can run out of memory if you don't have a way to reclaim</span> +<span id="L32" class="LineNr"> 32 </span><span class="Comment">//: data.</span> +<span id="L33" class="LineNr"> 33 </span><span class="Comment">//: b) If you allow data to be reclaimed, you have to be careful not to</span> +<span id="L34" class="LineNr"> 34 </span><span class="Comment">//: leave any stale addresses pointing at it. Otherwise your program might</span> +<span id="L35" class="LineNr"> 35 </span><span class="Comment">//: try to lookup such an address and find something unexpected. Such</span> +<span id="L36" class="LineNr"> 36 </span><span class="Comment">//: problems can be very hard to track down, and they can also be exploited</span> +<span id="L37" class="LineNr"> 37 </span><span class="Comment">//: to break into your computer over the network, etc.</span> +<span id="L38" class="LineNr"> 38 </span><span class="Comment">//:</span> +<span id="L39" class="LineNr"> 39 </span><span class="Comment">//: To avoid these problems, we introduce the notion of a *reference count* or</span> +<span id="L40" class="LineNr"> 40 </span><span class="Comment">//: refcount. The life cycle of a bit of data accessed through addresses looks</span> +<span id="L41" class="LineNr"> 41 </span><span class="Comment">//: like this.</span> +<span id="L42" class="LineNr"> 42 </span><span class="Comment">//:</span> +<span id="L43" class="LineNr"> 43 </span><span class="Comment">//: We create space in computer memory for it using the 'new' instruction.</span> +<span id="L44" class="LineNr"> 44 </span><span class="Comment">//: The 'new' instruction takes a type as an ingredient, allocates</span> +<span id="L45" class="LineNr"> 45 </span><span class="Comment">//: sufficient space to hold that type, and returns an address (bookmark)</span> +<span id="L46" class="LineNr"> 46 </span><span class="Comment">//: to the allocated space.</span> +<span id="L47" class="LineNr"> 47 </span><span class="Comment">//:</span> +<span id="L48" class="LineNr"> 48 </span><span class="Comment">//: x:address:num <- new number:type</span> +<span id="L49" class="LineNr"> 49 </span><span class="Comment">//:</span> +<span id="L50" class="LineNr"> 50 </span><span class="Comment">//: +------------+</span> +<span id="L51" class="LineNr"> 51 </span><span class="Comment">//: x -------> | number |</span> +<span id="L52" class="LineNr"> 52 </span><span class="Comment">//: +------------+</span> +<span id="L53" class="LineNr"> 53 </span><span class="Comment">//:</span> +<span id="L54" class="LineNr"> 54 </span><span class="Comment">//: That isn't entirely accurate. Under the hood, 'new' allocates an extra</span> +<span id="L55" class="LineNr"> 55 </span><span class="Comment">//: number -- the refcount:</span> +<span id="L56" class="LineNr"> 56 </span><span class="Comment">//:</span> +<span id="L57" class="LineNr"> 57 </span><span class="Comment">//: +------------+------------+</span> +<span id="L58" class="LineNr"> 58 </span><span class="Comment">//: x -------> | refcount | number |</span> +<span id="L59" class="LineNr"> 59 </span><span class="Comment">//: +------------+------------+</span> +<span id="L60" class="LineNr"> 60 </span><span class="Comment">//:</span> +<span id="L61" class="LineNr"> 61 </span><span class="Comment">//: This probably seems like a waste of space. In practice it isn't worth</span> +<span id="L62" class="LineNr"> 62 </span><span class="Comment">//: allocating individual numbers and our payload will tend to be larger,</span> +<span id="L63" class="LineNr"> 63 </span><span class="Comment">//: so the picture would look more like this (zooming out a bit):</span> +<span id="L64" class="LineNr"> 64 </span><span class="Comment">//:</span> +<span id="L65" class="LineNr"> 65 </span><span class="Comment">//: +-------------------------+</span> +<span id="L66" class="LineNr"> 66 </span><span class="Comment">//: +---+ |</span> +<span id="L67" class="LineNr"> 67 </span><span class="Comment">//: x -------> | r | |</span> +<span id="L68" class="LineNr"> 68 </span><span class="Comment">//: +---+ DATA |</span> +<span id="L69" class="LineNr"> 69 </span><span class="Comment">//: | |</span> +<span id="L70" class="LineNr"> 70 </span><span class="Comment">//: | |</span> +<span id="L71" class="LineNr"> 71 </span><span class="Comment">//: +-------------------------+</span> +<span id="L72" class="LineNr"> 72 </span><span class="Comment">//:</span> +<span id="L73" class="LineNr"> 73 </span><span class="Comment">//: (Here 'r' denotes the refcount. It occupies a tiny amount of space</span> +<span id="L74" class="LineNr"> 74 </span><span class="Comment">//: compared to the payload.)</span> +<span id="L75" class="LineNr"> 75 </span><span class="Comment">//:</span> +<span id="L76" class="LineNr"> 76 </span><span class="Comment">//: Anyways, back to our example where the data is just a single number.</span> +<span id="L77" class="LineNr"> 77 </span><span class="Comment">//: After the call to 'new', Mu's map of memory looks like this:</span> +<span id="L78" class="LineNr"> 78 </span><span class="Comment">//:</span> +<span id="L79" class="LineNr"> 79 </span><span class="Comment">//: +---+------------+</span> +<span id="L80" class="LineNr"> 80 </span><span class="Comment">//: x -------> | 1 | number |</span> +<span id="L81" class="LineNr"> 81 </span><span class="Comment">//: +---+------------+</span> +<span id="L82" class="LineNr"> 82 </span><span class="Comment">//:</span> +<span id="L83" class="LineNr"> 83 </span><span class="Comment">//: The refcount of 1 here indicates that this number has one bookmark</span> +<span id="L84" class="LineNr"> 84 </span><span class="Comment">//: outstanding. If you then make a copy of x, the refcount increments:</span> +<span id="L85" class="LineNr"> 85 </span><span class="Comment">//:</span> +<span id="L86" class="LineNr"> 86 </span><span class="Comment">//: y:address:num <- copy x</span> +<span id="L87" class="LineNr"> 87 </span><span class="Comment">//:</span> +<span id="L88" class="LineNr"> 88 </span><span class="Comment">//: x ---+ +---+------------+</span> +<span id="L89" class="LineNr"> 89 </span><span class="Comment">//: +---> | 2 | number |</span> +<span id="L90" class="LineNr"> 90 </span><span class="Comment">//: y ---+ +---+------------+</span> +<span id="L91" class="LineNr"> 91 </span><span class="Comment">//:</span> +<span id="L92" class="LineNr"> 92 </span><span class="Comment">//: Whether you access the payload through x or y, Mu knows how many</span> +<span id="L93" class="LineNr"> 93 </span><span class="Comment">//: bookmarks are outstanding to it. When you change x or y, the refcount</span> +<span id="L94" class="LineNr"> 94 </span><span class="Comment">//: transparently decrements:</span> +<span id="L95" class="LineNr"> 95 </span><span class="Comment">//:</span> +<span id="L96" class="LineNr"> 96 </span><span class="Comment">//: x <- copy 0 # an address is just a number, you can always write 0 to it</span> +<span id="L97" class="LineNr"> 97 </span><span class="Comment">//:</span> +<span id="L98" class="LineNr"> 98 </span><span class="Comment">//: +---+------------+</span> +<span id="L99" class="LineNr"> 99 </span><span class="Comment">//: y -------> | 1 | number |</span> +<span id="L100" class="LineNr">100 </span><span class="Comment">//: +---+------------+</span> +<span id="L101" class="LineNr">101 </span><span class="Comment">//:</span> +<span id="L102" class="LineNr">102 </span><span class="Comment">//: The final flourish is what happens when the refcount goes down to 0: Mu</span> +<span id="L103" class="LineNr">103 </span><span class="Comment">//: reclaims the space occupied by both refcount and payload in memory, and</span> +<span id="L104" class="LineNr">104 </span><span class="Comment">//: they're ready to be reused by later calls to 'new'.</span> +<span id="L105" class="LineNr">105 </span><span class="Comment">//:</span> +<span id="L106" class="LineNr">106 </span><span class="Comment">//: y <- copy 0</span> +<span id="L107" class="LineNr">107 </span><span class="Comment">//:</span> +<span id="L108" class="LineNr">108 </span><span class="Comment">//: +---+------------+</span> +<span id="L109" class="LineNr">109 </span><span class="Comment">//: | 0 | XXXXXXX |</span> +<span id="L110" class="LineNr">110 </span><span class="Comment">//: +---+------------+</span> +<span id="L111" class="LineNr">111 </span><span class="Comment">//:</span> +<span id="L112" class="LineNr">112 </span><span class="Comment">//: Using refcounts fixes both our problems a) and b) above: you can use</span> +<span id="L113" class="LineNr">113 </span><span class="Comment">//: memory for many different purposes as many times as you want without</span> +<span id="L114" class="LineNr">114 </span><span class="Comment">//: running out of memory, and you don't have to worry about ever leaving a</span> +<span id="L115" class="LineNr">115 </span><span class="Comment">//: dangling bookmark when you reclaim memory.</span> +<span id="L116" class="LineNr">116 </span><span class="Comment">//:</span> +<span id="L117" class="LineNr">117 </span><span class="Comment">//: This layer implements creating addresses using 'new'. The next few layers</span> +<span id="L118" class="LineNr">118 </span><span class="Comment">//: will flesh out the rest of the life cycle.</span> +<span id="L119" class="LineNr">119 </span> +<span id="L120" class="LineNr">120 </span><span class="Comment">//: todo: give 'new' a custodian ingredient. Following malloc/free is a temporary hack.</span> +<span id="L121" class="LineNr">121 </span> +<span id="L122" class="LineNr">122 </span><span class="Delimiter">:(scenario new)</span> +<span id="L123" class="LineNr">123 </span><span class="Comment"># call 'new' two times with identical types without modifying the results; you</span> +<span id="L124" class="LineNr">124 </span><span class="Comment"># should get back different results</span> +<span id="L125" class="LineNr">125 </span><span class="muRecipe">def</span> main [ +<span id="L126" class="LineNr">126 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L127" class="LineNr">127 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L128" class="LineNr">128 </span> <span class="Constant">3</span>:<span class="Normal">bool</span>/<span class="Special">raw <- </span>equal <span class="Constant">1</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">2</span>:address:num/<span class="Special">raw</span> +<span id="L129" class="LineNr">129 </span>] +<span id="L130" class="LineNr">130 </span><span class="traceContains">+mem: storing 0 in location 3</span> +<span id="L131" class="LineNr">131 </span> +<span id="L132" class="LineNr">132 </span><span class="Delimiter">:(scenario new_array)</span> +<span id="L133" class="LineNr">133 </span><span class="Comment"># call 'new' with a second ingredient to allocate an array of some type rather than a single copy</span> +<span id="L134" class="LineNr">134 </span><span class="muRecipe">def</span> main [ +<span id="L135" class="LineNr">135 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">5</span> +<span id="L136" class="LineNr">136 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L137" class="LineNr">137 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> +<span id="L138" class="LineNr">138 </span>] +<span id="L139" class="LineNr">139 </span><span class="traceContains">+run: {1: ("address" "array" "number"), "raw": ()} <- new {number: "type"}, {5: "literal"}</span> +<span id="L140" class="LineNr">140 </span><span class="traceContains">+mem: array length is 5</span> +<span id="L141" class="LineNr">141 </span><span class="Comment"># don't forget the extra location for array length, and the second extra location for the refcount</span> +<span id="L142" class="LineNr">142 </span><span class="traceContains">+mem: storing 7 in location 3</span> +<span id="L143" class="LineNr">143 </span> +<span id="L144" class="LineNr">144 </span><span class="Delimiter">:(scenario dilated_reagent_with_new)</span> +<span id="L145" class="LineNr">145 </span><span class="muRecipe">def</span> main [ +<span id="L146" class="LineNr">146 </span> <span class="Constant">1</span>:address:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>address number<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> +<span id="L147" class="LineNr">147 </span>] +<span id="L148" class="LineNr">148 </span><span class="traceContains">+new: size of '(address number)' is 1</span> +<span id="L149" class="LineNr">149 </span> +<span id="L150" class="LineNr">150 </span><span class="Comment">//: 'new' takes a weird 'type' as its first ingredient; don't error on it</span> +<span id="L151" class="LineNr">151 </span><span class="Delimiter">:(before "End Mu Types Initialization")</span> +<span id="L152" class="LineNr">152 </span>put<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"type"</span><span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L153" class="LineNr">153 </span><span class="Delimiter">:(code)</span> +<span id="L154" class="LineNr">154 </span><span class="Normal">bool</span> is_mu_type_literal<span class="Delimiter">(</span><span class="Normal">const</span> reagent& r<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L155" class="LineNr">155 </span> <span class="Identifier">return</span> is_literal<span class="Delimiter">(</span>r<span class="Delimiter">)</span> && r<span class="Delimiter">.</span>type && r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>name == <span class="Constant">"type"</span><span class="Delimiter">;</span> +<span id="L156" class="LineNr">156 </span><span class="Delimiter">}</span> +<span id="L157" class="LineNr">157 </span> +<span id="L158" class="LineNr">158 </span><span class="Delimiter">:(before "End Primitive Recipe Declarations")</span> +<span id="L159" class="LineNr">159 </span>NEW<span class="Delimiter">,</span> +<span id="L160" class="LineNr">160 </span><span class="Delimiter">:(before "End Primitive Recipe Numbers")</span> +<span id="L161" class="LineNr">161 </span>put<span class="Delimiter">(</span>Recipe_ordinal<span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">,</span> NEW<span class="Delimiter">);</span> +<span id="L162" class="LineNr">162 </span><span class="Delimiter">:(before "End Primitive Recipe Checks")</span> +<span id="L163" class="LineNr">163 </span><span class="Normal">case</span> NEW: <span class="Delimiter">{</span> +<span id="L164" class="LineNr">164 </span> <span class="Normal">const</span> recipe& caller = get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">);</span> +<span id="L165" class="LineNr">165 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>empty<span class="Delimiter">()</span> || SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">2</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L166" class="LineNr">166 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"'new' requires one or two ingredients, but got '"</span> << inst<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L167" class="LineNr">167 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L168" class="LineNr">168 </span> <span class="Delimiter">}</span> +<span id="L169" class="LineNr">169 </span> <span class="Comment">// End NEW Check Special-cases</span> +<span id="L170" class="LineNr">170 </span> <span class="Normal">const</span> reagent& type = inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L171" class="LineNr">171 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!is_mu_type_literal<span class="Delimiter">(</span>type<span class="Delimiter">))</span> <span class="Delimiter">{</span> +<span id="L172" class="LineNr">172 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"first ingredient of 'new' should be a type, but got '"</span> << type<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L173" class="LineNr">173 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L174" class="LineNr">174 </span> <span class="Delimiter">}</span> +<span id="L175" class="LineNr">175 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span> && !is_mu_number<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">)))</span> <span class="Delimiter">{</span> +<span id="L176" class="LineNr">176 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"second ingredient of 'new' should be a number (array length), but got '"</span> << type<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L177" class="LineNr">177 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L178" class="LineNr">178 </span> <span class="Delimiter">}</span> +<span id="L179" class="LineNr">179 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>products<span class="Delimiter">.</span>empty<span class="Delimiter">())</span> <span class="Delimiter">{</span> +<span id="L180" class="LineNr">180 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"result of 'new' should never be ignored</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L181" class="LineNr">181 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L182" class="LineNr">182 </span> <span class="Delimiter">}</span> +<span id="L183" class="LineNr">183 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product_of_new_is_valid<span class="Delimiter">(</span>inst<span class="Delimiter">))</span> <span class="Delimiter">{</span> +<span id="L184" class="LineNr">184 </span> raise << maybe<span class="Delimiter">(</span>caller<span class="Delimiter">.</span>name<span class="Delimiter">)</span> << <span class="Constant">"product of 'new' has incorrect type: '"</span> << inst<span class="Delimiter">.</span>original_string << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L185" class="LineNr">185 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L186" class="LineNr">186 </span> <span class="Delimiter">}</span> +<span id="L187" class="LineNr">187 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L188" class="LineNr">188 </span><span class="Delimiter">}</span> +<span id="L189" class="LineNr">189 </span><span class="Delimiter">:(code)</span> +<span id="L190" class="LineNr">190 </span><span class="Normal">bool</span> product_of_new_is_valid<span class="Delimiter">(</span><span class="Normal">const</span> instruction& inst<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L191" class="LineNr">191 </span> reagent<span class="Comment">/*</span><span class="Comment">copy</span><span class="Comment">*/</span> product = inst<span class="Delimiter">.</span>products<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L192" class="LineNr">192 </span> <span class="Comment">// Update NEW product in Check</span> +<span id="L193" class="LineNr">193 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product<span class="Delimiter">.</span>type || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>value != get<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"address"</span><span class="Delimiter">))</span> +<span id="L194" class="LineNr">194 </span> <span class="Identifier">return</span> <span class="Constant">false</span><span class="Delimiter">;</span> +<span id="L195" class="LineNr">195 </span> drop_from_type<span class="Delimiter">(</span>product<span class="Delimiter">,</span> <span class="Constant">"address"</span><span class="Delimiter">);</span> +<span id="L196" class="LineNr">196 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L197" class="LineNr">197 </span> <span class="Comment">// array allocation</span> +<span id="L198" class="LineNr">198 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>!product<span class="Delimiter">.</span>type || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom || product<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>value != get<span class="Delimiter">(</span>Type_ordinal<span class="Delimiter">,</span> <span class="Constant">"array"</span><span class="Delimiter">))</span> +<span id="L199" class="LineNr">199 </span> <span class="Identifier">return</span> <span class="Constant">false</span><span class="Delimiter">;</span> +<span id="L200" class="LineNr">200 </span> drop_from_type<span class="Delimiter">(</span>product<span class="Delimiter">,</span> <span class="Constant">"array"</span><span class="Delimiter">);</span> +<span id="L201" class="LineNr">201 </span> <span class="Delimiter">}</span> +<span id="L202" class="LineNr">202 </span> reagent<span class="Comment">/*</span><span class="Comment">local</span><span class="Comment">*/</span> expected_product<span class="Delimiter">;</span> +<span id="L203" class="LineNr">203 </span> expected_product<span class="Delimiter">.</span>type = new_type_tree<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name<span class="Delimiter">);</span> +<span id="L204" class="LineNr">204 </span> <span class="Identifier">return</span> types_strictly_match<span class="Delimiter">(</span>product<span class="Delimiter">,</span> expected_product<span class="Delimiter">);</span> +<span id="L205" class="LineNr">205 </span><span class="Delimiter">}</span> +<span id="L206" class="LineNr">206 </span> +<span id="L207" class="LineNr">207 </span><span class="Normal">void</span> drop_from_type<span class="Delimiter">(</span>reagent& r<span class="Delimiter">,</span> string expected_type<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L208" class="LineNr">208 </span> assert<span class="Delimiter">(</span>!r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom<span class="Delimiter">);</span> +<span id="L209" class="LineNr">209 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>left<span class="Delimiter">-></span>name != expected_type<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L210" class="LineNr">210 </span> raise << <span class="Constant">"can't drop2 "</span> << expected_type << <span class="Constant">" from '"</span> << to_string<span class="Delimiter">(</span>r<span class="Delimiter">)</span> << <span class="Constant">"'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L211" class="LineNr">211 </span> <span class="Identifier">return</span><span class="Delimiter">;</span> +<span id="L212" class="LineNr">212 </span> <span class="Delimiter">}</span> +<span id="L213" class="LineNr">213 </span> <span class="Comment">// r.type = r.type->right</span> +<span id="L214" class="LineNr">214 </span> type_tree* tmp = r<span class="Delimiter">.</span>type<span class="Delimiter">;</span> +<span id="L215" class="LineNr">215 </span> r<span class="Delimiter">.</span>type = tmp<span class="Delimiter">-></span>right<span class="Delimiter">;</span> +<span id="L216" class="LineNr">216 </span> tmp<span class="Delimiter">-></span>right = <span class="Constant">NULL</span><span class="Delimiter">;</span> +<span id="L217" class="LineNr">217 </span> <span class="Normal">delete</span> tmp<span class="Delimiter">;</span> +<span id="L218" class="LineNr">218 </span> <span class="Comment">// if (!r.type->right) r.type = r.type->left</span> +<span id="L219" class="LineNr">219 </span> assert<span class="Delimiter">(</span>!r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>atom<span class="Delimiter">);</span> +<span id="L220" class="LineNr">220 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>r<span class="Delimiter">.</span>type<span class="Delimiter">-></span>right<span class="Delimiter">)</span> <span class="Identifier">return</span><span class="Delimiter">;</span> +<span id="L221" class="LineNr">221 </span> tmp = r<span class="Delimiter">.</span>type<span class="Delimiter">;</span> +<span id="L222" class="LineNr">222 </span> r<span class="Delimiter">.</span>type = tmp<span class="Delimiter">-></span>left<span class="Delimiter">;</span> +<span id="L223" class="LineNr">223 </span> tmp<span class="Delimiter">-></span>left = <span class="Constant">NULL</span><span class="Delimiter">;</span> +<span id="L224" class="LineNr">224 </span> <span class="Normal">delete</span> tmp<span class="Delimiter">;</span> +<span id="L225" class="LineNr">225 </span><span class="Delimiter">}</span> +<span id="L226" class="LineNr">226 </span> +<span id="L227" class="LineNr">227 </span><span class="Delimiter">:(scenario new_returns_incorrect_type)</span> +<span id="L228" class="LineNr">228 </span><span class="Special">% Hide_errors = true;</span> +<span id="L229" class="LineNr">229 </span><span class="muRecipe">def</span> main [ +<span id="L230" class="LineNr">230 </span> <span class="Constant">1</span>:<span class="Normal">bool</span><span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">num:type</span> +<span id="L231" class="LineNr">231 </span>] +<span id="L232" class="LineNr">232 </span><span class="traceContains">+error: main: product of 'new' has incorrect type: '1:bool <- new num:type'</span> +<span id="L233" class="LineNr">233 </span> +<span id="L234" class="LineNr">234 </span><span class="Delimiter">:(scenario new_discerns_singleton_list_from_atom_container)</span> +<span id="L235" class="LineNr">235 </span><span class="Special">% Hide_errors = true;</span> +<span id="L236" class="LineNr">236 </span><span class="muRecipe">def</span> main [ +<span id="L237" class="LineNr">237 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>num<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> <span class="Comment"># should be '{num: type}'</span> +<span id="L238" class="LineNr">238 </span>] +<span id="L239" class="LineNr">239 </span><span class="traceContains">+error: main: product of 'new' has incorrect type: '1:address:num/raw <- new {(num): type}'</span> +<span id="L240" class="LineNr">240 </span> +<span id="L241" class="LineNr">241 </span><span class="Delimiter">:(scenario new_with_type_abbreviation)</span> +<span id="L242" class="LineNr">242 </span><span class="muRecipe">def</span> main [ +<span id="L243" class="LineNr">243 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">num:type</span> +<span id="L244" class="LineNr">244 </span>] +<span id="L245" class="LineNr">245 </span>$error: <span class="Constant">0</span> +<span id="L246" class="LineNr">246 </span> +<span id="L247" class="LineNr">247 </span><span class="Delimiter">:(scenario new_with_type_abbreviation_inside_compound)</span> +<span id="L248" class="LineNr">248 </span><span class="muRecipe">def</span> main [ +<span id="L249" class="LineNr">249 </span> <span class="Delimiter">{</span><span class="Constant">1</span>: <span class="Delimiter">(</span>address address number<span class="Delimiter">),</span> <span class="Special">raw</span>: <span class="Delimiter">()}</span><span class="Special"> <- </span><span class="Normal">new</span> <span class="Delimiter">{(</span>& num<span class="Delimiter">)</span>: type<span class="Delimiter">}</span> +<span id="L250" class="LineNr">250 </span>] +<span id="L251" class="LineNr">251 </span>$error: <span class="Constant">0</span> +<span id="L252" class="LineNr">252 </span> +<span id="L253" class="LineNr">253 </span><span class="Comment">//: To implement 'new', a Mu transform turns all 'new' instructions into</span> +<span id="L254" class="LineNr">254 </span><span class="Comment">//: 'allocate' instructions that precompute the amount of memory they want to</span> +<span id="L255" class="LineNr">255 </span><span class="Comment">//: allocate.</span> +<span id="L256" class="LineNr">256 </span> +<span id="L257" class="LineNr">257 </span><span class="Comment">//: Ensure that we never call 'allocate' directly, and that there's no 'new'</span> +<span id="L258" class="LineNr">258 </span><span class="Comment">//: instructions left after the transforms have run.</span> +<span id="L259" class="LineNr">259 </span><span class="Delimiter">:(before "End Primitive Recipe Checks")</span> +<span id="L260" class="LineNr">260 </span><span class="Normal">case</span> ALLOCATE: <span class="Delimiter">{</span> +<span id="L261" class="LineNr">261 </span> raise << <span class="Constant">"never call 'allocate' directly'; always use 'new'</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L262" class="LineNr">262 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L263" class="LineNr">263 </span><span class="Delimiter">}</span> +<span id="L264" class="LineNr">264 </span><span class="Delimiter">:(before "End Primitive Recipe Implementations")</span> +<span id="L265" class="LineNr">265 </span><span class="Normal">case</span> NEW: <span class="Delimiter">{</span> +<span id="L266" class="LineNr">266 </span> raise << <span class="Constant">"no implementation for 'new'; why wasn't it translated to 'allocate'? Please save a copy of your program and send it to Kartik.</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<span id="L267" class="LineNr">267 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L268" class="LineNr">268 </span><span class="Delimiter">}</span> +<span id="L269" class="LineNr">269 </span> +<span id="L270" class="LineNr">270 </span><span class="Delimiter">:(after "Transform.push_back(check_instruction)")</span> <span class="Comment">// check_instruction will guard against direct 'allocate' instructions below</span> +<span id="L271" class="LineNr">271 </span>Transform<span class="Delimiter">.</span>push_back<span class="Delimiter">(</span>transform_new_to_allocate<span class="Delimiter">);</span> <span class="Comment">// idempotent</span> +<span id="L272" class="LineNr">272 </span> +<span id="L273" class="LineNr">273 </span><span class="Delimiter">:(code)</span> +<span id="L274" class="LineNr">274 </span><span class="Normal">void</span> transform_new_to_allocate<span class="Delimiter">(</span><span class="Normal">const</span> recipe_ordinal r<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L275" class="LineNr">275 </span> trace<span class="Delimiter">(</span><span class="Constant">9991</span><span class="Delimiter">,</span> <span class="Constant">"transform"</span><span class="Delimiter">)</span> << <span class="Constant">"--- convert 'new' to 'allocate' for recipe "</span> << get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>name << end<span class="Delimiter">();</span> +<span id="L276" class="LineNr">276 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> i = <span class="Constant">0</span><span class="Delimiter">;</span> i < SIZE<span class="Delimiter">(</span>get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>steps<span class="Delimiter">);</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L277" class="LineNr">277 </span> instruction& inst = get<span class="Delimiter">(</span>Recipe<span class="Delimiter">,</span> r<span class="Delimiter">).</span>steps<span class="Delimiter">.</span>at<span class="Delimiter">(</span>i<span class="Delimiter">);</span> +<span id="L278" class="LineNr">278 </span> <span class="Comment">// Convert 'new' To 'allocate'</span> +<span id="L279" class="LineNr">279 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>inst<span class="Delimiter">.</span>name == <span class="Constant">"new"</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L280" class="LineNr">280 </span> inst<span class="Delimiter">.</span>operation = ALLOCATE<span class="Delimiter">;</span> +<span id="L281" class="LineNr">281 </span> type_tree* type = new_type_tree<span class="Delimiter">(</span>inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name<span class="Delimiter">);</span> +<span id="L282" class="LineNr">282 </span> inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>set_value<span class="Delimiter">(</span>size_of<span class="Delimiter">(</span>type<span class="Delimiter">));</span> +<span id="L283" class="LineNr">283 </span> trace<span class="Delimiter">(</span><span class="Constant">9992</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"size of '"</span> << inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>name << <span class="Constant">"' is "</span> << inst<span class="Delimiter">.</span>ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>value << end<span class="Delimiter">();</span> +<span id="L284" class="LineNr">284 </span> <span class="Normal">delete</span> type<span class="Delimiter">;</span> +<span id="L285" class="LineNr">285 </span> <span class="Delimiter">}</span> +<span id="L286" class="LineNr">286 </span> <span class="Delimiter">}</span> +<span id="L287" class="LineNr">287 </span><span class="Delimiter">}</span> +<span id="L288" class="LineNr">288 </span> +<span id="L289" class="LineNr">289 </span><span class="Comment">//: implement 'allocate' based on size</span> +<span id="L290" class="LineNr">290 </span> +<span id="L291" class="LineNr">291 </span><span class="Delimiter">:(before "End Globals")</span> +<span id="L292" class="LineNr">292 </span><span class="Normal">extern</span> <span class="Normal">const</span> <span class="Normal">int</span> Reserved_for_tests = <span class="Constant">1000</span><span class="Delimiter">;</span> +<span id="L293" class="LineNr">293 </span><span class="Normal">int</span> Memory_allocated_until = Reserved_for_tests<span class="Delimiter">;</span> +<span id="L294" class="LineNr">294 </span><span class="Normal">int</span> Initial_memory_per_routine = <span class="Constant">100000</span><span class="Delimiter">;</span> +<span id="L295" class="LineNr">295 </span><span class="Delimiter">:(before "End Setup")</span> +<span id="L296" class="LineNr">296 </span>Memory_allocated_until = Reserved_for_tests<span class="Delimiter">;</span> +<span id="L297" class="LineNr">297 </span>Initial_memory_per_routine = <span class="Constant">100000</span><span class="Delimiter">;</span> +<span id="L298" class="LineNr">298 </span><span class="Delimiter">:(before "End routine Fields")</span> +<span id="L299" class="LineNr">299 </span><span class="Normal">int</span> alloc<span class="Delimiter">,</span> alloc_max<span class="Delimiter">;</span> +<span id="L300" class="LineNr">300 </span><span class="Delimiter">:(before "End routine Constructor")</span> +<span id="L301" class="LineNr">301 </span>alloc = Memory_allocated_until<span class="Delimiter">;</span> +<span id="L302" class="LineNr">302 </span>Memory_allocated_until += Initial_memory_per_routine<span class="Delimiter">;</span> +<span id="L303" class="LineNr">303 </span>alloc_max = Memory_allocated_until<span class="Delimiter">;</span> +<span id="L304" class="LineNr">304 </span>trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"routine allocated memory from "</span> << alloc << <span class="Constant">" to "</span> << alloc_max << end<span class="Delimiter">();</span> +<span id="L305" class="LineNr">305 </span> +<span id="L306" class="LineNr">306 </span><span class="Delimiter">:(before "End Primitive Recipe Declarations")</span> +<span id="L307" class="LineNr">307 </span>ALLOCATE<span class="Delimiter">,</span> +<span id="L308" class="LineNr">308 </span><span class="Delimiter">:(before "End Primitive Recipe Numbers")</span> +<span id="L309" class="LineNr">309 </span>put<span class="Delimiter">(</span>Recipe_ordinal<span class="Delimiter">,</span> <span class="Constant">"allocate"</span><span class="Delimiter">,</span> ALLOCATE<span class="Delimiter">);</span> +<span id="L310" class="LineNr">310 </span><span class="Delimiter">:(before "End Primitive Recipe Implementations")</span> +<span id="L311" class="LineNr">311 </span><span class="Normal">case</span> ALLOCATE: <span class="Delimiter">{</span> +<span id="L312" class="LineNr">312 </span> <span class="Comment">// compute the space we need</span> +<span id="L313" class="LineNr">313 </span> <span class="Normal">int</span> size = ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L314" class="LineNr">314 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L315" class="LineNr">315 </span> <span class="Comment">// array allocation</span> +<span id="L316" class="LineNr">316 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"array length is "</span> << ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">)</span> << end<span class="Delimiter">();</span> +<span id="L317" class="LineNr">317 </span> size = <span class="Comment">/*</span><span class="Comment">space for length</span><span class="Comment">*/</span><span class="Constant">1</span> + size*ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L318" class="LineNr">318 </span> <span class="Delimiter">}</span> +<span id="L319" class="LineNr">319 </span> <span class="Normal">int</span> result = allocate<span class="Delimiter">(</span>size<span class="Delimiter">);</span> +<span id="L320" class="LineNr">320 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>SIZE<span class="Delimiter">(</span>current_instruction<span class="Delimiter">().</span>ingredients<span class="Delimiter">)</span> > <span class="Constant">1</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L321" class="LineNr">321 </span> <span class="Comment">// initialize array length</span> +<span id="L322" class="LineNr">322 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"storing "</span> << ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">)</span> << <span class="Constant">" in location "</span> << result+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span> << end<span class="Delimiter">();</span> +<span id="L323" class="LineNr">323 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">,</span> ingredients<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">).</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">));</span> +<span id="L324" class="LineNr">324 </span> <span class="Delimiter">}</span> +<span id="L325" class="LineNr">325 </span> products<span class="Delimiter">.</span>resize<span class="Delimiter">(</span><span class="Constant">1</span><span class="Delimiter">);</span> +<span id="L326" class="LineNr">326 </span> products<span class="Delimiter">.</span>at<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">).</span>push_back<span class="Delimiter">(</span>result<span class="Delimiter">);</span> +<span id="L327" class="LineNr">327 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> +<span id="L328" class="LineNr">328 </span><span class="Delimiter">}</span> +<span id="L329" class="LineNr">329 </span><span class="Delimiter">:(code)</span> +<span id="L330" class="LineNr">330 </span><span class="Normal">int</span> allocate<span class="Delimiter">(</span><span class="Normal">int</span> size<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L331" class="LineNr">331 </span> <span class="Comment">// include space for refcount</span> +<span id="L332" class="LineNr">332 </span> ++size<span class="Delimiter">;</span> +<span id="L333" class="LineNr">333 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"allocating size "</span> << size << end<span class="Delimiter">();</span> +<span id="L334" class="LineNr">334 </span><span class="CommentedCode">//? Total_alloc += size;</span> +<span id="L335" class="LineNr">335 </span><span class="CommentedCode">//? ++Num_alloc;</span> +<span id="L336" class="LineNr">336 </span> <span class="Comment">// Allocate Special-cases</span> +<span id="L337" class="LineNr">337 </span> <span class="Comment">// compute the region of memory to return</span> +<span id="L338" class="LineNr">338 </span> <span class="Comment">// really crappy at the moment</span> +<span id="L339" class="LineNr">339 </span> ensure_space<span class="Delimiter">(</span>size<span class="Delimiter">);</span> +<span id="L340" class="LineNr">340 </span> <span class="Normal">const</span> <span class="Normal">int</span> result = Current_routine<span class="Delimiter">-></span>alloc<span class="Delimiter">;</span> +<span id="L341" class="LineNr">341 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"new alloc: "</span> << result << end<span class="Delimiter">();</span> +<span id="L342" class="LineNr">342 </span> <span class="Comment">// initialize allocated space</span> +<span id="L343" class="LineNr">343 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> address = result<span class="Delimiter">;</span> address < result+size<span class="Delimiter">;</span> ++address<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L344" class="LineNr">344 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"mem"</span><span class="Delimiter">)</span> << <span class="Constant">"storing 0 in location "</span> << address << end<span class="Delimiter">();</span> +<span id="L345" class="LineNr">345 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L346" class="LineNr">346 </span> <span class="Delimiter">}</span> +<span id="L347" class="LineNr">347 </span> Current_routine<span class="Delimiter">-></span>alloc += size<span class="Delimiter">;</span> +<span id="L348" class="LineNr">348 </span> <span class="Comment">// no support yet for reclaiming memory between routines</span> +<span id="L349" class="LineNr">349 </span> assert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>alloc <= Current_routine<span class="Delimiter">-></span>alloc_max<span class="Delimiter">);</span> +<span id="L350" class="LineNr">350 </span> <span class="Identifier">return</span> result<span class="Delimiter">;</span> +<span id="L351" class="LineNr">351 </span><span class="Delimiter">}</span> +<span id="L352" class="LineNr">352 </span> +<span id="L353" class="LineNr">353 </span><span class="Comment">//: statistics for debugging</span> +<span id="L354" class="LineNr">354 </span><span class="CommentedCode">//? :(before "End Globals")</span> +<span id="L355" class="LineNr">355 </span><span class="CommentedCode">//? int Total_alloc = 0;</span> +<span id="L356" class="LineNr">356 </span><span class="CommentedCode">//? int Num_alloc = 0;</span> +<span id="L357" class="LineNr">357 </span><span class="CommentedCode">//? int Total_free = 0;</span> +<span id="L358" class="LineNr">358 </span><span class="CommentedCode">//? int Num_free = 0;</span> +<span id="L359" class="LineNr">359 </span><span class="CommentedCode">//? :(before "End Setup")</span> +<span id="L360" class="LineNr">360 </span><span class="CommentedCode">//? Total_alloc = Num_alloc = Total_free = Num_free = 0;</span> +<span id="L361" class="LineNr">361 </span><span class="CommentedCode">//? :(before "End Teardown")</span> +<span id="L362" class="LineNr">362 </span><span class="CommentedCode">//? cerr << Total_alloc << "/" << Num_alloc</span> +<span id="L363" class="LineNr">363 </span><span class="CommentedCode">//? << " vs " << Total_free << "/" << Num_free << '\n';</span> +<span id="L364" class="LineNr">364 </span><span class="CommentedCode">//? cerr << SIZE(Memory) << '\n';</span> +<span id="L365" class="LineNr">365 </span> +<span id="L366" class="LineNr">366 </span><span class="Delimiter">:(code)</span> +<span id="L367" class="LineNr">367 </span><span class="Normal">void</span> ensure_space<span class="Delimiter">(</span><span class="Normal">int</span> size<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L368" class="LineNr">368 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>size > Initial_memory_per_routine<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L369" class="LineNr">369 </span> tb_shutdown<span class="Delimiter">();</span> +<span id="L370" class="LineNr">370 </span> cerr << <span class="Constant">"can't allocate "</span> << size << <span class="Constant">" locations, that's too much compared to "</span> << Initial_memory_per_routine << <span class="Constant">".</span><span class="cSpecial">\n</span><span class="Constant">"</span><span class="Delimiter">;</span> +<span id="L371" class="LineNr">371 </span> exit<span class="Delimiter">(</span><span class="Constant">0</span><span class="Delimiter">);</span> +<span id="L372" class="LineNr">372 </span> <span class="Delimiter">}</span> +<span id="L373" class="LineNr">373 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>alloc + size > Current_routine<span class="Delimiter">-></span>alloc_max<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<span id="L374" class="LineNr">374 </span> <span class="Comment">// waste the remaining space and create a new chunk</span> +<span id="L375" class="LineNr">375 </span> Current_routine<span class="Delimiter">-></span>alloc = Memory_allocated_until<span class="Delimiter">;</span> +<span id="L376" class="LineNr">376 </span> Memory_allocated_until += Initial_memory_per_routine<span class="Delimiter">;</span> +<span id="L377" class="LineNr">377 </span> Current_routine<span class="Delimiter">-></span>alloc_max = Memory_allocated_until<span class="Delimiter">;</span> +<span id="L378" class="LineNr">378 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"new"</span><span class="Delimiter">)</span> << <span class="Constant">"routine allocated memory from "</span> << Current_routine<span class="Delimiter">-></span>alloc << <span class="Constant">" to "</span> << Current_routine<span class="Delimiter">-></span>alloc_max << end<span class="Delimiter">();</span> +<span id="L379" class="LineNr">379 </span> <span class="Delimiter">}</span> +<span id="L380" class="LineNr">380 </span><span class="Delimiter">}</span> +<span id="L381" class="LineNr">381 </span> +<span id="L382" class="LineNr">382 </span><span class="Delimiter">:(scenario new_initializes)</span> +<span id="L383" class="LineNr">383 </span><span class="Special">% Memory_allocated_until = 10;</span> +<span id="L384" class="LineNr">384 </span><span class="Special">% put(Memory, Memory_allocated_until, 1);</span> +<span id="L385" class="LineNr">385 </span><span class="muRecipe">def</span> main [ +<span id="L386" class="LineNr">386 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L387" class="LineNr">387 </span>] +<span id="L388" class="LineNr">388 </span><span class="traceContains">+mem: storing 0 in location 10</span> +<span id="L389" class="LineNr">389 </span> +<span id="L390" class="LineNr">390 </span><span class="Delimiter">:(scenario new_size)</span> +<span id="L391" class="LineNr">391 </span><span class="muRecipe">def</span> main [ +<span id="L392" class="LineNr">392 </span> <span class="Constant">11</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L393" class="LineNr">393 </span> <span class="Constant">12</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L394" class="LineNr">394 </span> <span class="Constant">13</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">12</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">11</span>:address:num/<span class="Special">raw</span> +<span id="L395" class="LineNr">395 </span>] +<span id="L396" class="LineNr">396 </span><span class="Comment"># size of number + refcount</span> +<span id="L397" class="LineNr">397 </span><span class="traceContains">+mem: storing 2 in location 13</span> +<span id="L398" class="LineNr">398 </span> +<span id="L399" class="LineNr">399 </span><span class="Delimiter">:(scenario new_array_size)</span> +<span id="L400" class="LineNr">400 </span><span class="muRecipe">def</span> main [ +<span id="L401" class="LineNr">401 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">5</span> +<span id="L402" class="LineNr">402 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L403" class="LineNr">403 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> +<span id="L404" class="LineNr">404 </span>] +<span id="L405" class="LineNr">405 </span><span class="Comment"># 5 locations for array contents + array length + refcount</span> +<span id="L406" class="LineNr">406 </span><span class="traceContains">+mem: storing 7 in location 3</span> +<span id="L407" class="LineNr">407 </span> +<span id="L408" class="LineNr">408 </span><span class="Delimiter">:(scenario new_empty_array)</span> +<span id="L409" class="LineNr">409 </span><span class="muRecipe">def</span> main [ +<span id="L410" class="LineNr">410 </span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">0</span> +<span id="L411" class="LineNr">411 </span> <span class="Constant">2</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L412" class="LineNr">412 </span> <span class="Constant">3</span>:num/<span class="Special">raw <- </span>subtract <span class="Constant">2</span>:address:num/<span class="Special">raw</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:array:num/<span class="Special">raw</span> +<span id="L413" class="LineNr">413 </span>] +<span id="L414" class="LineNr">414 </span><span class="traceContains">+run: {1: ("address" "array" "number"), "raw": ()} <- new {number: "type"}, {0: "literal"}</span> +<span id="L415" class="LineNr">415 </span><span class="traceContains">+mem: array length is 0</span> +<span id="L416" class="LineNr">416 </span><span class="Comment"># one location for array length, and one for the refcount</span> +<span id="L417" class="LineNr">417 </span><span class="traceContains">+mem: storing 2 in location 3</span> +<span id="L418" class="LineNr">418 </span> +<span id="L419" class="LineNr">419 </span><span class="Comment">//: If a routine runs out of its initial allocation, it should allocate more.</span> +<span id="L420" class="LineNr">420 </span><span class="Delimiter">:(scenario new_overflow)</span> +<span id="L421" class="LineNr">421 </span><span class="Special">% Initial_memory_per_routine = 3; // barely enough room for point allocation below</span> +<span id="L422" class="LineNr">422 </span><span class="muRecipe">def</span> main [ +<span id="L423" class="LineNr">423 </span> <span class="Constant">1</span>:address:num/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> +<span id="L424" class="LineNr">424 </span> <span class="Constant">2</span>:address:point/<span class="Special">raw <- </span><span class="Normal">new</span> <span class="Constant">point:type</span> <span class="Comment"># not enough room in initial page</span> +<span id="L425" class="LineNr">425 </span>] +<span id="L426" class="LineNr">426 </span><span class="traceContains">+new: routine allocated memory from 1000 to 1003</span> +<span id="L427" class="LineNr">427 </span><span class="traceContains">+new: routine allocated memory from 1003 to 1006</span> </pre> </body> </html> |