diff options
Diffstat (limited to 'html/037abandon.cc.html')
| -rw-r--r-- | html/037abandon.cc.html | 524 |
1 files changed, 274 insertions, 250 deletions
diff --git a/html/037abandon.cc.html b/html/037abandon.cc.html index 1ef3ac3a..f33258b7 100644 --- a/html/037abandon.cc.html +++ b/html/037abandon.cc.html @@ -6,7 +6,7 @@ <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="cpp"> -<meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy="> +<meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy="> <meta name="colorscheme" content="minimal"> <style type="text/css"> <!-- @@ -14,11 +14,12 @@ pre { white-space: pre-wrap; font-family: monospace; color: #eeeeee; background- body { font-size: 12pt; font-family: monospace; color: #eeeeee; background-color: #080808; } * { font-size: 12pt; font-size: 1em; } .Constant { color: #00a0a0; } -.cSpecial { color: #008000; } +.Special { color: #c00000; } .muRecipe { color: #ff8700; } +.cSpecial { color: #008000; } .Comment { color: #9090ff; } .Delimiter { color: #800080; } -.Special { color: #c00000; } +.LineNr { color: #444444; } .traceContains { color: #008000; } .Normal { color: #eeeeee; background-color: #080808; padding-bottom: 1px; } .muData { color: #ffff00; } @@ -30,257 +31,280 @@ body { font-size: 12pt; font-family: monospace; color: #eeeeee; background-color <script type='text/javascript'> <!-- +/* function to open any folds containing a jumped-to line before jumping to it */ +function JumpToLine() +{ + var lineNum; + lineNum = window.location.hash; + lineNum = lineNum.substr(1); /* strip off '#' */ + + if (lineNum.indexOf('L') == -1) { + lineNum = 'L'+lineNum; + } + lineElem = document.getElementById(lineNum); + /* Always jump to new location even if the line was hidden inside a fold, or + * we corrected the raw number to a line ID. + */ + if (lineElem) { + lineElem.scrollIntoView(true); + } + return true; +} +if ('onhashchange' in window) { + window.onhashchange = JumpToLine; +} + --> </script> </head> -<body> +<body onload='JumpToLine();'> <pre id='vimCodeElement'> -<span class="Comment">//: Reclaiming memory when it's no longer used.</span> -<span class="Comment">//: The top of the address layer has the complete life cycle of memory.</span> - -<span class="Delimiter">:(scenario new_reclaim)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:num <span class="Comment"># because 1 will get reset during abandon below</span> - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> - <span class="Constant">3</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> <span class="Comment"># must be same size as abandoned memory to reuse</span> - <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:num - <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num -] -<span class="Comment"># both allocations should have returned the same address</span> -<span class="traceContains">+mem: storing 1 in location 5</span> - -<span class="Delimiter">:(before "End Decrement Refcount(old_address, payload_type, payload_size)")</span> -<span class="Normal">if</span> <span class="Delimiter">(</span>old_refcount == <span class="Constant">0</span><span class="Delimiter">)</span> <span class="Delimiter">{</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">"automatically abandoning "</span> << old_address << end<span class="Delimiter">();</span> - abandon<span class="Delimiter">(</span>old_address<span class="Delimiter">,</span> payload_type<span class="Delimiter">,</span> payload_size<span class="Delimiter">);</span> -<span class="Delimiter">}</span> - -<span class="Comment">//: When abandoning addresses we'll save them to a 'free list', segregated by size.</span> - -<span class="Delimiter">:(before "End routine Fields")</span> -map<<span class="Normal">int</span><span class="Delimiter">,</span> <span class="Normal">int</span>> free_list<span class="Delimiter">;</span> - -<span class="Delimiter">:(code)</span> -<span class="Normal">void</span> abandon<span class="Delimiter">(</span><span class="Normal">int</span> address<span class="Delimiter">,</span> <span class="Normal">const</span> type_tree* payload_type<span class="Delimiter">,</span> <span class="Normal">int</span> payload_size<span class="Delimiter">)</span> <span class="Delimiter">{</span> - trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"updating refcounts inside "</span> << address << <span class="Constant">": "</span> << to_string<span class="Delimiter">(</span>payload_type<span class="Delimiter">)</span> << end<span class="Delimiter">();</span> -<span class="CommentedCode">//? Total_free += size;</span> -<span class="CommentedCode">//? ++Num_free;</span> -<span class="CommentedCode">//? cerr << "abandon: " << size << '\n';</span> - <span class="Comment">// decrement any contained refcounts</span> - <span class="Normal">if</span> <span class="Delimiter">(</span>is_mu_array<span class="Delimiter">(</span>payload_type<span class="Delimiter">))</span> <span class="Delimiter">{</span> - reagent<span class="Comment">/*</span><span class="Comment">local</span><span class="Comment">*/</span> element<span class="Delimiter">;</span> - element<span class="Delimiter">.</span>type = copy_array_element<span class="Delimiter">(</span>payload_type<span class="Delimiter">);</span> - <span class="Normal">int</span> array_length = get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">);</span> - assert<span class="Delimiter">(</span>element<span class="Delimiter">.</span>type<span class="Delimiter">-></span>name != <span class="Constant">"array"</span><span class="Delimiter">);</span> - <span class="Normal">int</span> element_size = size_of<span class="Delimiter">(</span>element<span class="Delimiter">);</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 < array_length<span class="Delimiter">;</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> - element<span class="Delimiter">.</span>set_value<span class="Delimiter">(</span>address + <span class="Comment">/*</span><span class="Comment">skip refcount and length</span><span class="Comment">*/</span><span class="Constant">2</span> + i*element_size<span class="Delimiter">);</span> - decrement_any_refcounts<span class="Delimiter">(</span>element<span class="Delimiter">);</span> - <span class="Delimiter">}</span> - <span class="Delimiter">}</span> - <span class="Normal">else</span> <span class="Normal">if</span> <span class="Delimiter">(</span>is_mu_container<span class="Delimiter">(</span>payload_type<span class="Delimiter">)</span> || is_mu_exclusive_container<span class="Delimiter">(</span>payload_type<span class="Delimiter">))</span> <span class="Delimiter">{</span> - reagent tmp<span class="Delimiter">;</span> - tmp<span class="Delimiter">.</span>type = <span class="Normal">new</span> type_tree<span class="Delimiter">(</span>*payload_type<span class="Delimiter">);</span> - tmp<span class="Delimiter">.</span>set_value<span class="Delimiter">(</span>address + <span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">);</span> - decrement_any_refcounts<span class="Delimiter">(</span>tmp<span class="Delimiter">);</span> - <span class="Delimiter">}</span> - <span class="Comment">// clear memory</span> - <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> curr = address<span class="Delimiter">;</span> curr < address+payload_size<span class="Delimiter">;</span> ++curr<span class="Delimiter">)</span> - put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> curr<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> - <span class="Comment">// append existing free list to address</span> - trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"saving "</span> << address << <span class="Constant">" in free-list of size "</span> << payload_size << end<span class="Delimiter">();</span> - put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address<span class="Delimiter">,</span> get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> payload_size<span class="Delimiter">));</span> - put<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> payload_size<span class="Delimiter">,</span> address<span class="Delimiter">);</span> -<span class="Delimiter">}</span> - -<span class="Delimiter">:(after "Allocate Special-cases")</span> -<span class="Normal">if</span> <span class="Delimiter">(</span>get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">))</span> <span class="Delimiter">{</span> - trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"picking up space from free-list of size "</span> << size << end<span class="Delimiter">();</span> - <span class="Normal">int</span> result = get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">);</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 from free list: "</span> << result << end<span class="Delimiter">();</span> - put<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">,</span> get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result<span class="Delimiter">));</span> - put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> - <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> curr = result<span class="Delimiter">;</span> curr < result+size<span class="Delimiter">;</span> ++curr<span class="Delimiter">)</span> <span class="Delimiter">{</span> - <span class="Normal">if</span> <span class="Delimiter">(</span>get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> curr<span class="Delimiter">)</span> != <span class="Constant">0</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> - raise << maybe<span class="Delimiter">(</span>current_recipe_name<span class="Delimiter">())</span> << <span class="Constant">"memory in free list was not zeroed out: "</span> << curr << <span class="Constant">'/'</span> << result << <span class="Constant">"; somebody wrote to us after free!!!</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> - <span class="Identifier">break</span><span class="Delimiter">;</span> <span class="Comment">// always fatal</span> - <span class="Delimiter">}</span> - <span class="Delimiter">}</span> - <span class="Identifier">return</span> result<span class="Delimiter">;</span> -<span class="Delimiter">}</span> - -<span class="Delimiter">:(scenario new_differing_size_no_reclaim)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:num - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> - <span class="Constant">3</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> <span class="Comment"># different size</span> - <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:array:num - <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num -] -<span class="Comment"># no reuse</span> -<span class="traceContains">+mem: storing 0 in location 5</span> - -<span class="Delimiter">:(scenario new_reclaim_array)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> - <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:array:num - <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> - <span class="Constant">3</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> <span class="Comment"># same size</span> - <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:array:num - <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num -] -<span class="Comment"># both calls to new returned identical addresses</span> -<span class="traceContains">+mem: storing 1 in location 5</span> - -<span class="Delimiter">:(scenario abandon_on_overwrite)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Comment"># over-writing one allocation with another</span> - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: automatically abandoning 1000</span> - -<span class="Delimiter">:(scenario abandon_after_call)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Comment"># passing in addresses to recipes increments refcount</span> - foo <span class="Constant">1</span>:address:num - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="muRecipe">def</span> foo [ - <span class="Constant">2</span>:address:num<span class="Special"> <- </span>next-ingredient - <span class="Comment"># return does NOT yet decrement refcount; memory must be explicitly managed</span> - <span class="Constant">2</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: foo {1: ("address" "number")}</span> -<span class="Comment"># leave ambiguous precisely when the next increment happens</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> -<span class="traceContains">+run: {2: ("address" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> -<span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> -<span class="traceContains">+mem: automatically abandoning 1000</span> - -<span class="Delimiter">:(scenario abandon_on_overwrite_array)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:num<span class="Special"> <- </span>copy <span class="Constant">30</span> - <span class="Comment"># allocate an array</span> - <span class="Constant">10</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">20</span> - <span class="Constant">11</span>:num<span class="Special"> <- </span>copy <span class="Constant">10</span>:address:array:num <span class="Comment"># doesn't increment refcount</span> - <span class="Comment"># allocate another array in its place, implicitly freeing the previous allocation</span> - <span class="Constant">10</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">25</span> -] -<span class="traceContains">+run: {10: ("address" "array" "number")} <- new {number: "type"}, {25: "literal"}</span> -<span class="Comment"># abandoned array is of old size (20, not 25)</span> -<span class="traceContains">+abandon: saving 1000 in free-list of size 22</span> - -<span class="Delimiter">:(scenario refcounts_abandon_address_in_container)</span> -<span class="Comment"># container containing an address</span> -<span class="muData">container</span> foo [ - <span class="Normal">x</span>:address:num -] -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">2</span>:address:foo<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">foo:type</span> - *<span class="Constant">2</span>:address:foo<span class="Special"> <- </span>put *<span class="Constant">2</span>:address:foo<span class="Delimiter">,</span> <span class="Constant">x:offset</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:num - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> - <span class="Constant">2</span>:address:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: {2: ("address" "foo")} <- new {foo: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1002: 0 -> 1</span> -<span class="traceContains">+run: {2: ("address" "foo"), "lookup": ()} <- put {2: ("address" "foo"), "lookup": ()}, {x: "offset"}, {1: ("address" "number")}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> -<span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> -<span class="traceContains">+run: {2: ("address" "foo")} <- copy {0: "literal"}</span> -<span class="Comment"># start abandoning container containing address</span> -<span class="traceContains">+mem: decrementing refcount of 1002: 1 -> 0</span> -<span class="Comment"># nested abandon</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> -<span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> -<span class="Comment"># actually abandon the container containing address</span> -<span class="traceContains">+abandon: saving 1002 in free-list of size 2</span> - -<span class="Comment"># todo: move past dilated reagent</span> -<span class="Delimiter">:(scenario refcounts_abandon_address_in_array)</span> -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">2</span>:address:array: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 class="Constant">3</span> - *<span class="Constant">2</span>:address:array:address:num<span class="Special"> <- </span>put-index *<span class="Constant">2</span>:address:array:address:num<span class="Delimiter">,</span> <span class="Constant">1</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:num - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> - <span class="Constant">2</span>:address:array:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: {2: ("address" "array" "address" "number"), "lookup": ()} <- put-index {2: ("address" "array" "address" "number"), "lookup": ()}, {1: "literal"}, {1: ("address" "number")}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> -<span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> -<span class="traceContains">+run: {2: ("address" "array" "address" "number")} <- copy {0: "literal"}</span> -<span class="Comment"># nested abandon</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> -<span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> - -<span class="Delimiter">:(scenario refcounts_abandon_address_in_container_in_array)</span> -<span class="Comment"># container containing an address</span> -<span class="muData">container</span> foo [ - <span class="Normal">x</span>:address:num -] -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> - <span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">foo:type</span><span class="Delimiter">,</span> <span class="Constant">3</span> - <span class="Constant">3</span>:foo<span class="Special"> <- </span>merge <span class="Constant">1</span>:address:num - *<span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span>put-index *<span class="Constant">2</span>:address:array:foo<span class="Delimiter">,</span> <span class="Constant">1</span><span class="Delimiter">,</span> <span class="Constant">3</span>:foo - <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> - <span class="Constant">3</span>:foo<span class="Special"> <- </span>merge <span class="Constant">0</span> - <span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: {3: "foo"} <- merge {1: ("address" "number")}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> -<span class="traceContains">+run: {2: ("address" "array" "foo"), "lookup": ()} <- put-index {2: ("address" "array" "foo"), "lookup": ()}, {1: "literal"}, {3: "foo"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 2 -> 3</span> -<span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 3 -> 2</span> -<span class="traceContains">+run: {3: "foo"} <- merge {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> -<span class="traceContains">+run: {2: ("address" "array" "foo")} <- copy {0: "literal"}</span> -<span class="Comment"># nested abandon</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> -<span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> - -<span class="Delimiter">:(scenario refcounts_abandon_array_within_container)</span> -<span class="muData">container</span> foo [ - <span class="Normal">x</span>:address:array:num -] -<span class="muRecipe">def</span> main [ - <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">3</span> - <span class="Constant">2</span>:foo<span class="Special"> <- </span>merge <span class="Constant">1</span>:address:array:num - <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span>copy <span class="Constant">0</span> - <span class="Constant">2</span>:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> -] -<span class="traceContains">+run: {1: ("address" "array" "number")} <- new {number: "type"}, {3: "literal"}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> -<span class="traceContains">+run: {2: "foo"} <- merge {1: ("address" "array" "number")}</span> -<span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> -<span class="traceContains">+run: {1: ("address" "array" "number")} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> -<span class="traceContains">+run: {2: "foo"} <- copy {0: "literal"}</span> -<span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> -<span class="traceContains">+mem: automatically abandoning 1000</span> -<span class="Comment"># make sure we save it in a free-list of the appropriate size</span> -<span class="traceContains">+abandon: saving 1000 in free-list of size 5</span> +<a name="L1"></a><span id="L1" class="LineNr"> 1 </span><span class="Comment">//: Reclaiming memory when it's no longer used.</span> +<a name="L2"></a><span id="L2" class="LineNr"> 2 </span><span class="Comment">//: The top of the address layer has the complete life cycle of memory.</span> +<a name="L3"></a><span id="L3" class="LineNr"> 3 </span> +<a name="L4"></a><span id="L4" class="LineNr"> 4 </span><span class="Delimiter">:(scenario new_reclaim)</span> +<a name="L5"></a><span id="L5" class="LineNr"> 5 </span><span class="muRecipe">def</span> main [ +<a name="L6"></a><span id="L6" class="LineNr"> 6 </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="L7"></a><span id="L7" class="LineNr"> 7 </span> <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:num <span class="Comment"># because 1 will get reset during abandon below</span> +<a name="L8"></a><span id="L8" class="LineNr"> 8 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> +<a name="L9"></a><span id="L9" class="LineNr"> 9 </span> <span class="Constant">3</span>:address:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span> <span class="Comment"># must be same size as abandoned memory to reuse</span> +<a name="L10"></a><span id="L10" class="LineNr"> 10 </span> <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:num +<a name="L11"></a><span id="L11" class="LineNr"> 11 </span> <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num +<a name="L12"></a><span id="L12" class="LineNr"> 12 </span>] +<a name="L13"></a><span id="L13" class="LineNr"> 13 </span><span class="Comment"># both allocations should have returned the same address</span> +<a name="L14"></a><span id="L14" class="LineNr"> 14 </span><span class="traceContains">+mem: storing 1 in location 5</span> +<a name="L15"></a><span id="L15" class="LineNr"> 15 </span> +<a name="L16"></a><span id="L16" class="LineNr"> 16 </span><span class="Delimiter">:(before "End Decrement Refcount(old_address, payload_type, payload_size)")</span> +<a name="L17"></a><span id="L17" class="LineNr"> 17 </span><span class="Normal">if</span> <span class="Delimiter">(</span>old_refcount == <span class="Constant">0</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<a name="L18"></a><span id="L18" class="LineNr"> 18 </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">"automatically abandoning "</span> << old_address << end<span class="Delimiter">();</span> +<a name="L19"></a><span id="L19" class="LineNr"> 19 </span> abandon<span class="Delimiter">(</span>old_address<span class="Delimiter">,</span> payload_type<span class="Delimiter">,</span> payload_size<span class="Delimiter">);</span> +<a name="L20"></a><span id="L20" class="LineNr"> 20 </span><span class="Delimiter">}</span> +<a name="L21"></a><span id="L21" class="LineNr"> 21 </span> +<a name="L22"></a><span id="L22" class="LineNr"> 22 </span><span class="Comment">//: When abandoning addresses we'll save them to a 'free list', segregated by size.</span> +<a name="L23"></a><span id="L23" class="LineNr"> 23 </span> +<a name="L24"></a><span id="L24" class="LineNr"> 24 </span><span class="Delimiter">:(before "End routine Fields")</span> +<a name="L25"></a><span id="L25" class="LineNr"> 25 </span>map<<span class="Normal">int</span><span class="Delimiter">,</span> <span class="Normal">int</span>> free_list<span class="Delimiter">;</span> +<a name="L26"></a><span id="L26" class="LineNr"> 26 </span> +<a name="L27"></a><span id="L27" class="LineNr"> 27 </span><span class="Delimiter">:(code)</span> +<a name="L28"></a><span id="L28" class="LineNr"> 28 </span><span class="Normal">void</span> abandon<span class="Delimiter">(</span><span class="Normal">int</span> address<span class="Delimiter">,</span> <span class="Normal">const</span> type_tree* payload_type<span class="Delimiter">,</span> <span class="Normal">int</span> payload_size<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<a name="L29"></a><span id="L29" class="LineNr"> 29 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"updating refcounts inside "</span> << address << <span class="Constant">": "</span> << to_string<span class="Delimiter">(</span>payload_type<span class="Delimiter">)</span> << end<span class="Delimiter">();</span> +<a name="L30"></a><span id="L30" class="LineNr"> 30 </span><span class="CommentedCode">//? Total_free += size;</span> +<a name="L31"></a><span id="L31" class="LineNr"> 31 </span><span class="CommentedCode">//? ++Num_free;</span> +<a name="L32"></a><span id="L32" class="LineNr"> 32 </span><span class="CommentedCode">//? cerr << "abandon: " << size << '\n';</span> +<a name="L33"></a><span id="L33" class="LineNr"> 33 </span> <span class="Comment">// decrement any contained refcounts</span> +<a name="L34"></a><span id="L34" class="LineNr"> 34 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>is_mu_array<span class="Delimiter">(</span>payload_type<span class="Delimiter">))</span> <span class="Delimiter">{</span> +<a name="L35"></a><span id="L35" class="LineNr"> 35 </span> reagent<span class="Comment">/*</span><span class="Comment">local</span><span class="Comment">*/</span> element<span class="Delimiter">;</span> +<a name="L36"></a><span id="L36" class="LineNr"> 36 </span> element<span class="Delimiter">.</span>type = copy_array_element<span class="Delimiter">(</span>payload_type<span class="Delimiter">);</span> +<a name="L37"></a><span id="L37" class="LineNr"> 37 </span> <span class="Normal">int</span> array_length = get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address+<span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">);</span> +<a name="L38"></a><span id="L38" class="LineNr"> 38 </span> assert<span class="Delimiter">(</span>element<span class="Delimiter">.</span>type<span class="Delimiter">-></span>name != <span class="Constant">"array"</span><span class="Delimiter">);</span> +<a name="L39"></a><span id="L39" class="LineNr"> 39 </span> <span class="Normal">int</span> element_size = size_of<span class="Delimiter">(</span>element<span class="Delimiter">);</span> +<a name="L40"></a><span id="L40" class="LineNr"> 40 </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 < array_length<span class="Delimiter">;</span> ++i<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<a name="L41"></a><span id="L41" class="LineNr"> 41 </span> element<span class="Delimiter">.</span>set_value<span class="Delimiter">(</span>address + <span class="Comment">/*</span><span class="Comment">skip refcount and length</span><span class="Comment">*/</span><span class="Constant">2</span> + i*element_size<span class="Delimiter">);</span> +<a name="L42"></a><span id="L42" class="LineNr"> 42 </span> decrement_any_refcounts<span class="Delimiter">(</span>element<span class="Delimiter">);</span> +<a name="L43"></a><span id="L43" class="LineNr"> 43 </span> <span class="Delimiter">}</span> +<a name="L44"></a><span id="L44" class="LineNr"> 44 </span> <span class="Delimiter">}</span> +<a name="L45"></a><span id="L45" class="LineNr"> 45 </span> <span class="Normal">else</span> <span class="Normal">if</span> <span class="Delimiter">(</span>is_mu_container<span class="Delimiter">(</span>payload_type<span class="Delimiter">)</span> || is_mu_exclusive_container<span class="Delimiter">(</span>payload_type<span class="Delimiter">))</span> <span class="Delimiter">{</span> +<a name="L46"></a><span id="L46" class="LineNr"> 46 </span> reagent tmp<span class="Delimiter">;</span> +<a name="L47"></a><span id="L47" class="LineNr"> 47 </span> tmp<span class="Delimiter">.</span>type = <span class="Normal">new</span> type_tree<span class="Delimiter">(</span>*payload_type<span class="Delimiter">);</span> +<a name="L48"></a><span id="L48" class="LineNr"> 48 </span> tmp<span class="Delimiter">.</span>set_value<span class="Delimiter">(</span>address + <span class="Comment">/*</span><span class="Comment">skip refcount</span><span class="Comment">*/</span><span class="Constant">1</span><span class="Delimiter">);</span> +<a name="L49"></a><span id="L49" class="LineNr"> 49 </span> decrement_any_refcounts<span class="Delimiter">(</span>tmp<span class="Delimiter">);</span> +<a name="L50"></a><span id="L50" class="LineNr"> 50 </span> <span class="Delimiter">}</span> +<a name="L51"></a><span id="L51" class="LineNr"> 51 </span> <span class="Comment">// clear memory</span> +<a name="L52"></a><span id="L52" class="LineNr"> 52 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> curr = address<span class="Delimiter">;</span> curr < address+payload_size<span class="Delimiter">;</span> ++curr<span class="Delimiter">)</span> +<a name="L53"></a><span id="L53" class="LineNr"> 53 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> curr<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> +<a name="L54"></a><span id="L54" class="LineNr"> 54 </span> <span class="Comment">// append existing free list to address</span> +<a name="L55"></a><span id="L55" class="LineNr"> 55 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"saving "</span> << address << <span class="Constant">" in free-list of size "</span> << payload_size << end<span class="Delimiter">();</span> +<a name="L56"></a><span id="L56" class="LineNr"> 56 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> address<span class="Delimiter">,</span> get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> payload_size<span class="Delimiter">));</span> +<a name="L57"></a><span id="L57" class="LineNr"> 57 </span> put<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> payload_size<span class="Delimiter">,</span> address<span class="Delimiter">);</span> +<a name="L58"></a><span id="L58" class="LineNr"> 58 </span><span class="Delimiter">}</span> +<a name="L59"></a><span id="L59" class="LineNr"> 59 </span> +<a name="L60"></a><span id="L60" class="LineNr"> 60 </span><span class="Delimiter">:(after "Allocate Special-cases")</span> +<a name="L61"></a><span id="L61" class="LineNr"> 61 </span><span class="Normal">if</span> <span class="Delimiter">(</span>get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">))</span> <span class="Delimiter">{</span> +<a name="L62"></a><span id="L62" class="LineNr"> 62 </span> trace<span class="Delimiter">(</span><span class="Constant">9999</span><span class="Delimiter">,</span> <span class="Constant">"abandon"</span><span class="Delimiter">)</span> << <span class="Constant">"picking up space from free-list of size "</span> << size << end<span class="Delimiter">();</span> +<a name="L63"></a><span id="L63" class="LineNr"> 63 </span> <span class="Normal">int</span> result = get_or_insert<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">);</span> +<a name="L64"></a><span id="L64" class="LineNr"> 64 </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 from free list: "</span> << result << end<span class="Delimiter">();</span> +<a name="L65"></a><span id="L65" class="LineNr"> 65 </span> put<span class="Delimiter">(</span>Current_routine<span class="Delimiter">-></span>free_list<span class="Delimiter">,</span> size<span class="Delimiter">,</span> get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result<span class="Delimiter">));</span> +<a name="L66"></a><span id="L66" class="LineNr"> 66 </span> put<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> result<span class="Delimiter">,</span> <span class="Constant">0</span><span class="Delimiter">);</span> +<a name="L67"></a><span id="L67" class="LineNr"> 67 </span> <span class="Normal">for</span> <span class="Delimiter">(</span><span class="Normal">int</span> curr = result<span class="Delimiter">;</span> curr < result+size<span class="Delimiter">;</span> ++curr<span class="Delimiter">)</span> <span class="Delimiter">{</span> +<a name="L68"></a><span id="L68" class="LineNr"> 68 </span> <span class="Normal">if</span> <span class="Delimiter">(</span>get_or_insert<span class="Delimiter">(</span>Memory<span class="Delimiter">,</span> curr<span class="Delimiter">)</span> != <span class="Constant">0</span><span class="Delimiter">)</span> <span class="Delimiter">{</span> +<a name="L69"></a><span id="L69" class="LineNr"> 69 </span> raise << maybe<span class="Delimiter">(</span>current_recipe_name<span class="Delimiter">())</span> << <span class="Constant">"memory in free list was not zeroed out: "</span> << curr << <span class="Constant">'/'</span> << result << <span class="Constant">"; somebody wrote to us after free!!!</span><span class="cSpecial">\n</span><span class="Constant">"</span> << end<span class="Delimiter">();</span> +<a name="L70"></a><span id="L70" class="LineNr"> 70 </span> <span class="Identifier">break</span><span class="Delimiter">;</span> <span class="Comment">// always fatal</span> +<a name="L71"></a><span id="L71" class="LineNr"> 71 </span> <span class="Delimiter">}</span> +<a name="L72"></a><span id="L72" class="LineNr"> 72 </span> <span class="Delimiter">}</span> +<a name="L73"></a><span id="L73" class="LineNr"> 73 </span> <span class="Identifier">return</span> result<span class="Delimiter">;</span> +<a name="L74"></a><span id="L74" class="LineNr"> 74 </span><span class="Delimiter">}</span> +<a name="L75"></a><span id="L75" class="LineNr"> 75 </span> +<a name="L76"></a><span id="L76" class="LineNr"> 76 </span><span class="Delimiter">:(scenario new_differing_size_no_reclaim)</span> +<a name="L77"></a><span id="L77" class="LineNr"> 77 </span><span class="muRecipe">def</span> main [ +<a name="L78"></a><span id="L78" class="LineNr"> 78 </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="L79"></a><span id="L79" class="LineNr"> 79 </span> <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:num +<a name="L80"></a><span id="L80" class="LineNr"> 80 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> +<a name="L81"></a><span id="L81" class="LineNr"> 81 </span> <span class="Constant">3</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> <span class="Comment"># different size</span> +<a name="L82"></a><span id="L82" class="LineNr"> 82 </span> <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:array:num +<a name="L83"></a><span id="L83" class="LineNr"> 83 </span> <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num +<a name="L84"></a><span id="L84" class="LineNr"> 84 </span>] +<a name="L85"></a><span id="L85" class="LineNr"> 85 </span><span class="Comment"># no reuse</span> +<a name="L86"></a><span id="L86" class="LineNr"> 86 </span><span class="traceContains">+mem: storing 0 in location 5</span> +<a name="L87"></a><span id="L87" class="LineNr"> 87 </span> +<a name="L88"></a><span id="L88" class="LineNr"> 88 </span><span class="Delimiter">:(scenario new_reclaim_array)</span> +<a name="L89"></a><span id="L89" class="LineNr"> 89 </span><span class="muRecipe">def</span> main [ +<a name="L90"></a><span id="L90" class="LineNr"> 90 </span> <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> +<a name="L91"></a><span id="L91" class="LineNr"> 91 </span> <span class="Constant">2</span>:num<span class="Special"> <- </span>copy <span class="Constant">1</span>:address:array:num +<a name="L92"></a><span id="L92" class="LineNr"> 92 </span> <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span>copy <span class="Constant">0</span> <span class="Comment"># abandon</span> +<a name="L93"></a><span id="L93" class="LineNr"> 93 </span> <span class="Constant">3</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">2</span> <span class="Comment"># same size</span> +<a name="L94"></a><span id="L94" class="LineNr"> 94 </span> <span class="Constant">4</span>:num<span class="Special"> <- </span>copy <span class="Constant">3</span>:address:array:num +<a name="L95"></a><span id="L95" class="LineNr"> 95 </span> <span class="Constant">5</span>:<span class="Normal">bool</span><span class="Special"> <- </span>equal <span class="Constant">2</span>:num<span class="Delimiter">,</span> <span class="Constant">4</span>:num +<a name="L96"></a><span id="L96" class="LineNr"> 96 </span>] +<a name="L97"></a><span id="L97" class="LineNr"> 97 </span><span class="Comment"># both calls to new returned identical addresses</span> +<a name="L98"></a><span id="L98" class="LineNr"> 98 </span><span class="traceContains">+mem: storing 1 in location 5</span> +<a name="L99"></a><span id="L99" class="LineNr"> 99 </span> +<a name="L100"></a><span id="L100" class="LineNr">100 </span><span class="Delimiter">:(scenario abandon_on_overwrite)</span> +<a name="L101"></a><span id="L101" class="LineNr">101 </span><span class="muRecipe">def</span> main [ +<a name="L102"></a><span id="L102" class="LineNr">102 </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="L103"></a><span id="L103" class="LineNr">103 </span> <span class="Comment"># over-writing one allocation with another</span> +<a name="L104"></a><span id="L104" class="LineNr">104 </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="L105"></a><span id="L105" class="LineNr">105 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L106"></a><span id="L106" class="LineNr">106 </span>] +<a name="L107"></a><span id="L107" class="LineNr">107 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L108"></a><span id="L108" class="LineNr">108 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L109"></a><span id="L109" class="LineNr">109 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L110"></a><span id="L110" class="LineNr">110 </span><span class="traceContains">+mem: automatically abandoning 1000</span> +<a name="L111"></a><span id="L111" class="LineNr">111 </span> +<a name="L112"></a><span id="L112" class="LineNr">112 </span><span class="Delimiter">:(scenario abandon_after_call)</span> +<a name="L113"></a><span id="L113" class="LineNr">113 </span><span class="muRecipe">def</span> main [ +<a name="L114"></a><span id="L114" class="LineNr">114 </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="L115"></a><span id="L115" class="LineNr">115 </span> <span class="Comment"># passing in addresses to recipes increments refcount</span> +<a name="L116"></a><span id="L116" class="LineNr">116 </span> foo <span class="Constant">1</span>:address:num +<a name="L117"></a><span id="L117" class="LineNr">117 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L118"></a><span id="L118" class="LineNr">118 </span>] +<a name="L119"></a><span id="L119" class="LineNr">119 </span><span class="muRecipe">def</span> foo [ +<a name="L120"></a><span id="L120" class="LineNr">120 </span> <span class="Constant">2</span>:address:num<span class="Special"> <- </span>next-ingredient +<a name="L121"></a><span id="L121" class="LineNr">121 </span> <span class="Comment"># return does NOT yet decrement refcount; memory must be explicitly managed</span> +<a name="L122"></a><span id="L122" class="LineNr">122 </span> <span class="Constant">2</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L123"></a><span id="L123" class="LineNr">123 </span>] +<a name="L124"></a><span id="L124" class="LineNr">124 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L125"></a><span id="L125" class="LineNr">125 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L126"></a><span id="L126" class="LineNr">126 </span><span class="traceContains">+run: foo {1: ("address" "number")}</span> +<a name="L127"></a><span id="L127" class="LineNr">127 </span><span class="Comment"># leave ambiguous precisely when the next increment happens</span> +<a name="L128"></a><span id="L128" class="LineNr">128 </span><span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> +<a name="L129"></a><span id="L129" class="LineNr">129 </span><span class="traceContains">+run: {2: ("address" "number")} <- copy {0: "literal"}</span> +<a name="L130"></a><span id="L130" class="LineNr">130 </span><span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> +<a name="L131"></a><span id="L131" class="LineNr">131 </span><span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> +<a name="L132"></a><span id="L132" class="LineNr">132 </span><span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> +<a name="L133"></a><span id="L133" class="LineNr">133 </span><span class="traceContains">+mem: automatically abandoning 1000</span> +<a name="L134"></a><span id="L134" class="LineNr">134 </span> +<a name="L135"></a><span id="L135" class="LineNr">135 </span><span class="Delimiter">:(scenario abandon_on_overwrite_array)</span> +<a name="L136"></a><span id="L136" class="LineNr">136 </span><span class="muRecipe">def</span> main [ +<a name="L137"></a><span id="L137" class="LineNr">137 </span> <span class="Constant">1</span>:num<span class="Special"> <- </span>copy <span class="Constant">30</span> +<a name="L138"></a><span id="L138" class="LineNr">138 </span> <span class="Comment"># allocate an array</span> +<a name="L139"></a><span id="L139" class="LineNr">139 </span> <span class="Constant">10</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">20</span> +<a name="L140"></a><span id="L140" class="LineNr">140 </span> <span class="Constant">11</span>:num<span class="Special"> <- </span>copy <span class="Constant">10</span>:address:array:num <span class="Comment"># doesn't increment refcount</span> +<a name="L141"></a><span id="L141" class="LineNr">141 </span> <span class="Comment"># allocate another array in its place, implicitly freeing the previous allocation</span> +<a name="L142"></a><span id="L142" class="LineNr">142 </span> <span class="Constant">10</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">25</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="traceContains">+run: {10: ("address" "array" "number")} <- new {number: "type"}, {25: "literal"}</span> +<a name="L145"></a><span id="L145" class="LineNr">145 </span><span class="Comment"># abandoned array is of old size (20, not 25)</span> +<a name="L146"></a><span id="L146" class="LineNr">146 </span><span class="traceContains">+abandon: saving 1000 in free-list of size 22</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="Delimiter">:(scenario refcounts_abandon_address_in_container)</span> +<a name="L149"></a><span id="L149" class="LineNr">149 </span><span class="Comment"># container containing an address</span> +<a name="L150"></a><span id="L150" class="LineNr">150 </span><span class="muData">container</span> foo [ +<a name="L151"></a><span id="L151" class="LineNr">151 </span> <span class="Normal">x</span>:address:num +<a name="L152"></a><span id="L152" class="LineNr">152 </span>] +<a name="L153"></a><span id="L153" class="LineNr">153 </span><span class="muRecipe">def</span> main [ +<a name="L154"></a><span id="L154" class="LineNr">154 </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="L155"></a><span id="L155" class="LineNr">155 </span> <span class="Constant">2</span>:address:foo<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">foo:type</span> +<a name="L156"></a><span id="L156" class="LineNr">156 </span> *<span class="Constant">2</span>:address:foo<span class="Special"> <- </span>put *<span class="Constant">2</span>:address:foo<span class="Delimiter">,</span> <span class="Constant">x:offset</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:num +<a name="L157"></a><span id="L157" class="LineNr">157 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L158"></a><span id="L158" class="LineNr">158 </span> <span class="Constant">2</span>:address:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L159"></a><span id="L159" class="LineNr">159 </span>] +<a name="L160"></a><span id="L160" class="LineNr">160 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L161"></a><span id="L161" class="LineNr">161 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L162"></a><span id="L162" class="LineNr">162 </span><span class="traceContains">+run: {2: ("address" "foo")} <- new {foo: "type"}</span> +<a name="L163"></a><span id="L163" class="LineNr">163 </span><span class="traceContains">+mem: incrementing refcount of 1002: 0 -> 1</span> +<a name="L164"></a><span id="L164" class="LineNr">164 </span><span class="traceContains">+run: {2: ("address" "foo"), "lookup": ()} <- put {2: ("address" "foo"), "lookup": ()}, {x: "offset"}, {1: ("address" "number")}</span> +<a name="L165"></a><span id="L165" class="LineNr">165 </span><span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> +<a name="L166"></a><span id="L166" class="LineNr">166 </span><span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> +<a name="L167"></a><span id="L167" class="LineNr">167 </span><span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> +<a name="L168"></a><span id="L168" class="LineNr">168 </span><span class="traceContains">+run: {2: ("address" "foo")} <- copy {0: "literal"}</span> +<a name="L169"></a><span id="L169" class="LineNr">169 </span><span class="Comment"># start abandoning container containing address</span> +<a name="L170"></a><span id="L170" class="LineNr">170 </span><span class="traceContains">+mem: decrementing refcount of 1002: 1 -> 0</span> +<a name="L171"></a><span id="L171" class="LineNr">171 </span><span class="Comment"># nested abandon</span> +<a name="L172"></a><span id="L172" class="LineNr">172 </span><span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> +<a name="L173"></a><span id="L173" class="LineNr">173 </span><span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> +<a name="L174"></a><span id="L174" class="LineNr">174 </span><span class="Comment"># actually abandon the container containing address</span> +<a name="L175"></a><span id="L175" class="LineNr">175 </span><span class="traceContains">+abandon: saving 1002 in free-list of size 2</span> +<a name="L176"></a><span id="L176" class="LineNr">176 </span> +<a name="L177"></a><span id="L177" class="LineNr">177 </span><span class="Comment"># todo: move past dilated reagent</span> +<a name="L178"></a><span id="L178" class="LineNr">178 </span><span class="Delimiter">:(scenario refcounts_abandon_address_in_array)</span> +<a name="L179"></a><span id="L179" class="LineNr">179 </span><span class="muRecipe">def</span> main [ +<a name="L180"></a><span id="L180" class="LineNr">180 </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="L181"></a><span id="L181" class="LineNr">181 </span> <span class="Constant">2</span>:address:array: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 class="Constant">3</span> +<a name="L182"></a><span id="L182" class="LineNr">182 </span> *<span class="Constant">2</span>:address:array:address:num<span class="Special"> <- </span>put-index *<span class="Constant">2</span>:address:array:address:num<span class="Delimiter">,</span> <span class="Constant">1</span><span class="Delimiter">,</span> <span class="Constant">1</span>:address:num +<a name="L183"></a><span id="L183" class="LineNr">183 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L184"></a><span id="L184" class="LineNr">184 </span> <span class="Constant">2</span>:address:array:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L185"></a><span id="L185" class="LineNr">185 </span>] +<a name="L186"></a><span id="L186" class="LineNr">186 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L187"></a><span id="L187" class="LineNr">187 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L188"></a><span id="L188" class="LineNr">188 </span><span class="traceContains">+run: {2: ("address" "array" "address" "number"), "lookup": ()} <- put-index {2: ("address" "array" "address" "number"), "lookup": ()}, {1: "literal"}, {1: ("address" "number")}</span> +<a name="L189"></a><span id="L189" class="LineNr">189 </span><span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> +<a name="L190"></a><span id="L190" class="LineNr">190 </span><span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> +<a name="L191"></a><span id="L191" class="LineNr">191 </span><span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> +<a name="L192"></a><span id="L192" class="LineNr">192 </span><span class="traceContains">+run: {2: ("address" "array" "address" "number")} <- copy {0: "literal"}</span> +<a name="L193"></a><span id="L193" class="LineNr">193 </span><span class="Comment"># nested abandon</span> +<a name="L194"></a><span id="L194" class="LineNr">194 </span><span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> +<a name="L195"></a><span id="L195" class="LineNr">195 </span><span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> +<a name="L196"></a><span id="L196" class="LineNr">196 </span> +<a name="L197"></a><span id="L197" class="LineNr">197 </span><span class="Delimiter">:(scenario refcounts_abandon_address_in_container_in_array)</span> +<a name="L198"></a><span id="L198" class="LineNr">198 </span><span class="Comment"># container containing an address</span> +<a name="L199"></a><span id="L199" class="LineNr">199 </span><span class="muData">container</span> foo [ +<a name="L200"></a><span id="L200" class="LineNr">200 </span> <span class="Normal">x</span>:address:num +<a name="L201"></a><span id="L201" class="LineNr">201 </span>] +<a name="L202"></a><span id="L202" class="LineNr">202 </span><span class="muRecipe">def</span> main [ +<a name="L203"></a><span id="L203" class="LineNr">203 </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="L204"></a><span id="L204" class="LineNr">204 </span> <span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">foo:type</span><span class="Delimiter">,</span> <span class="Constant">3</span> +<a name="L205"></a><span id="L205" class="LineNr">205 </span> <span class="Constant">3</span>:foo<span class="Special"> <- </span>merge <span class="Constant">1</span>:address:num +<a name="L206"></a><span id="L206" class="LineNr">206 </span> *<span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span>put-index *<span class="Constant">2</span>:address:array:foo<span class="Delimiter">,</span> <span class="Constant">1</span><span class="Delimiter">,</span> <span class="Constant">3</span>:foo +<a name="L207"></a><span id="L207" class="LineNr">207 </span> <span class="Constant">1</span>:address:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L208"></a><span id="L208" class="LineNr">208 </span> <span class="Constant">3</span>:foo<span class="Special"> <- </span>merge <span class="Constant">0</span> +<a name="L209"></a><span id="L209" class="LineNr">209 </span> <span class="Constant">2</span>:address:array:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L210"></a><span id="L210" class="LineNr">210 </span>] +<a name="L211"></a><span id="L211" class="LineNr">211 </span><span class="traceContains">+run: {1: ("address" "number")} <- new {number: "type"}</span> +<a name="L212"></a><span id="L212" class="LineNr">212 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L213"></a><span id="L213" class="LineNr">213 </span><span class="traceContains">+run: {3: "foo"} <- merge {1: ("address" "number")}</span> +<a name="L214"></a><span id="L214" class="LineNr">214 </span><span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> +<a name="L215"></a><span id="L215" class="LineNr">215 </span><span class="traceContains">+run: {2: ("address" "array" "foo"), "lookup": ()} <- put-index {2: ("address" "array" "foo"), "lookup": ()}, {1: "literal"}, {3: "foo"}</span> +<a name="L216"></a><span id="L216" class="LineNr">216 </span><span class="traceContains">+mem: incrementing refcount of 1000: 2 -> 3</span> +<a name="L217"></a><span id="L217" class="LineNr">217 </span><span class="traceContains">+run: {1: ("address" "number")} <- copy {0: "literal"}</span> +<a name="L218"></a><span id="L218" class="LineNr">218 </span><span class="traceContains">+mem: decrementing refcount of 1000: 3 -> 2</span> +<a name="L219"></a><span id="L219" class="LineNr">219 </span><span class="traceContains">+run: {3: "foo"} <- merge {0: "literal"}</span> +<a name="L220"></a><span id="L220" class="LineNr">220 </span><span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> +<a name="L221"></a><span id="L221" class="LineNr">221 </span><span class="traceContains">+run: {2: ("address" "array" "foo")} <- copy {0: "literal"}</span> +<a name="L222"></a><span id="L222" class="LineNr">222 </span><span class="Comment"># nested abandon</span> +<a name="L223"></a><span id="L223" class="LineNr">223 </span><span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> +<a name="L224"></a><span id="L224" class="LineNr">224 </span><span class="traceContains">+abandon: saving 1000 in free-list of size 2</span> +<a name="L225"></a><span id="L225" class="LineNr">225 </span> +<a name="L226"></a><span id="L226" class="LineNr">226 </span><span class="Delimiter">:(scenario refcounts_abandon_array_within_container)</span> +<a name="L227"></a><span id="L227" class="LineNr">227 </span><span class="muData">container</span> foo [ +<a name="L228"></a><span id="L228" class="LineNr">228 </span> <span class="Normal">x</span>:address:array:num +<a name="L229"></a><span id="L229" class="LineNr">229 </span>] +<a name="L230"></a><span id="L230" class="LineNr">230 </span><span class="muRecipe">def</span> main [ +<a name="L231"></a><span id="L231" class="LineNr">231 </span> <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span><span class="Normal">new</span> <span class="Constant">number:type</span><span class="Delimiter">,</span> <span class="Constant">3</span> +<a name="L232"></a><span id="L232" class="LineNr">232 </span> <span class="Constant">2</span>:foo<span class="Special"> <- </span>merge <span class="Constant">1</span>:address:array:num +<a name="L233"></a><span id="L233" class="LineNr">233 </span> <span class="Constant">1</span>:address:array:num<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L234"></a><span id="L234" class="LineNr">234 </span> <span class="Constant">2</span>:foo<span class="Special"> <- </span>copy <span class="Constant">0</span> +<a name="L235"></a><span id="L235" class="LineNr">235 </span>] +<a name="L236"></a><span id="L236" class="LineNr">236 </span><span class="traceContains">+run: {1: ("address" "array" "number")} <- new {number: "type"}, {3: "literal"}</span> +<a name="L237"></a><span id="L237" class="LineNr">237 </span><span class="traceContains">+mem: incrementing refcount of 1000: 0 -> 1</span> +<a name="L238"></a><span id="L238" class="LineNr">238 </span><span class="traceContains">+run: {2: "foo"} <- merge {1: ("address" "array" "number")}</span> +<a name="L239"></a><span id="L239" class="LineNr">239 </span><span class="traceContains">+mem: incrementing refcount of 1000: 1 -> 2</span> +<a name="L240"></a><span id="L240" class="LineNr">240 </span><span class="traceContains">+run: {1: ("address" "array" "number")} <- copy {0: "literal"}</span> +<a name="L241"></a><span id="L241" class="LineNr">241 </span><span class="traceContains">+mem: decrementing refcount of 1000: 2 -> 1</span> +<a name="L242"></a><span id="L242" class="LineNr">242 </span><span class="traceContains">+run: {2: "foo"} <- copy {0: "literal"}</span> +<a name="L243"></a><span id="L243" class="LineNr">243 </span><span class="traceContains">+mem: decrementing refcount of 1000: 1 -> 0</span> +<a name="L244"></a><span id="L244" class="LineNr">244 </span><span class="traceContains">+mem: automatically abandoning 1000</span> +<a name="L245"></a><span id="L245" class="LineNr">245 </span><span class="Comment"># make sure we save it in a free-list of the appropriate size</span> +<a name="L246"></a><span id="L246" class="LineNr">246 </span><span class="traceContains">+abandon: saving 1000 in free-list of size 5</span> </pre> </body> </html> |