ranger - mirror of ranger - a simple, vim-like file manager

	Commit message (Expand)	Author	Age	Files	Lines
*	make snapshot: changed the format of the filename	hut	2010-03-08	1	-2/+3
*	make minimal_snapshot: snapshot with only neccessary files	hut	2010-03-08	1	-1/+13
*	make clean: fixed	hut	2010-02-28	1	-2/+2
*	Makefile: added make info + some improvements	hut	2010-02-27	1	-7/+22
*	added make snapshot	hut	2010-02-25	1	-0/+4
*	make clean: delete pyo files as well.	hut	2010-02-25	1	-1/+1
*	added Makefile	hut	2010-02-25	1	-0/+39

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <title>Mu - 037abandon.cc</title> <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="cpp"> <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">  </style> <script type='text/javascript'>  </script> </head> <body onload='JumpToLine();'> <pre id='vimCodeElement'> 1 //: Reclaiming memory when it's no longer used. 2 3 :(scenario new_reclaim) 4 def <a href='000organization.cc.html#L113'>main</a> [ 5 1:<a href='043space.cc.html#L80'>address</a>:num <- new number:type 6 2:num <- copy 1:<a href='043space.cc.html#L80'>address</a>:num # because 1 will get reset during abandon below 7 <a href='037abandon.cc.html#L48'>abandon</a> 1:<a href='043space.cc.html#L80'>address</a>:num 8 3:<a href='043space.cc.html#L80'>address</a>:num <- new number:type # must be same size as abandoned memory to reuse 9 4:num <- copy 3:<a href='043space.cc.html#L80'>address</a>:num 10 5:bool <- equal 2:num, 4:num 11 ] 12 # both allocations should have returned the same address 13 +mem: storing 1 in location 5 14 15 //: When abandoning addresses we'll save them to a 'free list', segregated by size. 16 17 :(before "End routine Fields") 18 map<int, int> free_list; 19 20 :(before "End Primitive Recipe Declarations") 21 ABANDON, 22 :(before "End Primitive Recipe Numbers") 23 <a href='001help.cc.html#L221'>put</a>(Recipe_ordinal, "abandon", ABANDON); 24 :(before "End Primitive Recipe Checks") 25 case ABANDON: { 26 if (!inst.products.empty()) { 27 <a href='003trace.cc.html#L174'>raise</a> << <a href='013update_operation.cc.html#L25'>maybe</a>(get(Recipe, r).name) << "'abandon' shouldn't write to any products in '" << to_original_string(inst) << "'\n" << end(); 28 break; 29 } 30 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(inst.ingredients); ++i) { 31 if (!is_mu_address(inst.ingredients.at(i))) 32 <a href='003trace.cc.html#L174'>raise</a> << <a href='013update_operation.cc.html#L25'>maybe</a>(get(Recipe, r).name) << "ingredients of 'abandon' should be addresses, but ingredient " <" is '" << to_string(inst.ingredients.at(i)) << '\n' << end(); 33 break; 34 } 35 break; 36 } 37 :(before "End Primitive Recipe Implementations") 38 case ABANDON: { 39 for (int i = 0; i < <a href='001help.cc.html#L141'>SIZE</a>(<a href='026call.cc.html#L89'>current_instruction</a>().ingredients); ++i) { 40 reagent/*copy*/ ingredient = <a href='026call.cc.html#L89'>current_instruction</a>().ingredients.at(i); 41 canonize(ingredient); 42 <a href='037abandon.cc.html#L48'>abandon</a>(<a href='001help.cc.html#L229'>get_or_insert</a>(Memory, ingredient.value), <a href='037abandon.cc.html#L58'>payload_size</a>(ingredient)); 43 } 44 break; 45 } 46 47 :(code) 48 void <a href='037abandon.cc.html#L48'>abandon</a>(int <a href='043space.cc.html#L80'>address</a>, int <a href='037abandon.cc.html#L58'>payload_size</a>) { 49 // clear memory 50 for (int curr = <a href='043space.cc.html#L80'>address</a>; curr < address+payload_size; ++curr) 51 <a href='001help.cc.html#L221'>put</a>(Memory, curr, 0); 52 // append existing free list to address 53 <a href='003trace.cc.html#L167'>trace</a>("abandon") << "saving " << <a href='043space.cc.html#L80'>address</a> << " in free-list of size " << <a href='037abandon.cc.html#L58'>payload_size</a> << <a href='003trace.cc.html#L203'>end</a>(); 54 <a href='001help.cc.html#L221'>put</a>(Memory, <a href='043space.cc.html#L80'>address</a>, <a href='001help.cc.html#L229'>get_or_insert</a>(Current_routine->free_list, <a href='037abandon.cc.html#L58'>payload_size</a>)); 55 <a href='001help.cc.html#L221'>put</a>(Current_routine->free_list, <a href='037abandon.cc.html#L58'>payload_size</a>, <a href='043space.cc.html#L80'>address</a>); 56 } 57 58 int <a href='037abandon.cc.html#L58'>payload_size</a>(reagent/*copy*/ x) { 59 x.properties.push_back(pair<string, string_tree*>("lookup", NULL)); 60 lookup_memory_core(x, /*check_for_null*/false); 61 return size_of(x); 62 } 63 64 :(after "Allocate Special-cases") 65 if (<a href='001help.cc.html#L229'>get_or_insert</a>(Current_routine->free_list, size)) { 66 <a href='003trace.cc.html#L167'>trace</a>("abandon") << "picking up space from free-list of size " << size << <a href='003trace.cc.html#L203'>end</a>(); 67 int result = <a href='001help.cc.html#L229'>get_or_insert</a>(Current_routine->free_list, size); 68 <a href='003trace.cc.html#L167'>trace</a>("mem") << "new alloc from free list: " << result << <a href='003trace.cc.html#L203'>end</a>(); 69 <a href='001help.cc.html#L221'>put</a>(Current_routine->free_list, size, <a href='001help.cc.html#L229'>get_or_insert</a>(Memory, result)); 70 <a href='001help.cc.html#L221'>put</a>(Memory, result, 0); 71 for (int curr = result; curr < result+size; ++curr) { 72 if (<a href='001help.cc.html#L229'>get_or_insert</a>(Memory, curr) != 0) { 73 <a href='003trace.cc.html#L174'>raise</a> << <a href='013update_operation.cc.html#L25'>maybe</a>(<a href='026call.cc.html#L87'>current_recipe_name</a>()) << "memory in free list was not zeroed out: " << curr << '/' << result << "; somebody wrote to us after free!!!\n" << <a href='003trace.cc.html#L203'>end</a>(); 74 break; // always fatal 75 } 76 } 77 return result; 78 } 79 80 :(scenario new_differing_size_no_reclaim) 81 def <a href='000organization.cc.html#L113'>main</a> [ 82 1:<a href='043space.cc.html#L80'>address</a>:num <- new number:type 83 2:num <- copy 1:<a href='043space.cc.html#L80'>address</a>:num 84 <a href='037abandon.cc.html#L48'>abandon</a> 1:<a href='043space.cc.html#L80'>address</a>:num 85 3:<a href='043space.cc.html#L80'>address</a>:array:num <- new number:type, 2 # different size 86 4:num <- copy 3:<a href='043space.cc.html#L80'>address</a>:array:num 87 5:bool <- equal 2:num, 4:num 88 ] 89 # no reuse 90 +mem: storing 0 in location 5 91 92 :(scenario new_reclaim_array) 93 def <a href='000organization.cc.html#L113'>main</a> [ 94 1:<a href='043space.cc.html#L80'>address</a>:array:num <- new number:type, 2 95 2:num <- copy 1:<a href='043space.cc.html#L80'>address</a>:array:num 96 <a href='037abandon.cc.html#L48'>abandon</a> 1:<a href='043space.cc.html#L80'>address</a>:array:num 97 3:<a href='043space.cc.html#L80'>address</a>:array:num <- new number:type, 2 # same size 98 4:num <- copy 3:<a href='043space.cc.html#L80'>address</a>:array:num 99 5:bool <- equal 2:num, 4:num 100 ] 101 # both calls to new returned identical addresses 102 +mem: storing 1 in location 5 </pre> </body> </html>