1 | % (c) 2009-2024 Lehrstuhl fuer Softwaretechnik und Programmiersprachen, | |
2 | % Heinrich Heine Universitaet Duesseldorf | |
3 | % This software is licenced under EPL 1.0 (http://www.eclipse.org/org/documents/epl-v10.html) | |
4 | ||
5 | ||
6 | :- module(memoization,[store_memo_expansion/3, | |
7 | get_stored_memo_expansion/3, | |
8 | compute_memo_hash/2, | |
9 | store_memo_computation_time/2, % for profiling | |
10 | ||
11 | register_memoization_function/6, | |
12 | get_registered_function/2, get_registered_function/3, | |
13 | get_registered_function_name/2, | |
14 | is_registered_function_name/1, is_registered_function_name/2, | |
15 | is_memoization_closure/4, | |
16 | get_memoization_closure_value/4, | |
17 | %expand_memoize_stored_function_reference/2, | |
18 | store_memo_result/6, | |
19 | get_stored_memo_result/4, | |
20 | apply_to_memoize/8, | |
21 | get_complete_memoization_expansion/6, | |
22 | element_of_memoization_closure/6, | |
23 | not_element_of_memoization_closure/6, | |
24 | is_lambda_value_domain_memoization_closure/5, | |
25 | ||
26 | tcltk_get_memo_profile_table/1, | |
27 | print_memo_profile/0, | |
28 | reset_memo_table/0, | |
29 | reset_memo_with_statistics/0]). | |
30 | ||
31 | :- use_module(error_manager). | |
32 | :- use_module(debug). | |
33 | ||
34 | :- use_module(module_information,[module_info/2]). | |
35 | :- module_info(group,kernel). | |
36 | :- module_info(description,'This module provides memoization features (for closure expansion, closure1,...).'). | |
37 | % used when use_closure_expansion_memoization is true | |
38 | ||
39 | :- use_module(probsrc(closures),[is_symbolic_closure/3]). | |
40 | :- use_module(probsrc(kernel_waitflags),[add_error_wf/5, add_message_wf/5, add_warning_wf/5]). | |
41 | ||
42 | ||
43 | ||
44 | :- use_module(eventhandling,[register_event_listener/3]). | |
45 | :- register_event_listener(startup_prob,init_memo_table, | |
46 | 'Initialise Preferences'). | |
47 | :- register_event_listener(clear_specification,reset_memo_table, | |
48 | 'Reset Temporary Preferences.'). | |
49 | ||
50 | ||
51 | ||
52 | % ---------------- Memoization for set comprehension / lambda / closure1 expansion: | |
53 | ||
54 | get_stored_memo_expansion(Hash,Term,Result) :- | |
55 | stored_memo_expansion(Hash,Term,Result), | |
56 | inc_counter(memoization_reuse_counter,_). | |
57 | ||
58 | :- dynamic stored_memo_expansion/3. | |
59 | ||
60 | store_memo_expansion(Hash,LookupTerm,StoredResult) :- | |
61 | assertz(stored_memo_expansion(Hash,LookupTerm,StoredResult)). | |
62 | ||
63 | :- if(current_prolog_flag(dialect, sicstus)). | |
64 | :- use_module(library(terms),[term_hash/3]). | |
65 | compute_memo_hash(LookupTerm,Hash) :- | |
66 | inc_counter(memoization_hash_counter,_), | |
67 | term_hash(LookupTerm, | |
68 | [range(smallint),algorithm(sdbm), depth(infinite),if_var(ignore)],Hash). | |
69 | %hashing:my_term_hash(closure(Parameters,ParameterTypes,ClosureBody),Hash), | |
70 | %inc(Hash), % | |
71 | :- else. | |
72 | :- use_module(hashing,[my_term_hash/2]). | |
73 | compute_memo_hash(LookupTerm,Hash) :- | |
74 | inc_counter(memoization_hash_counter,_), | |
75 | my_term_hash(LookupTerm,Hash). | |
76 | :- endif. | |
77 | ||
78 | % ---------------- Memoization for function application | |
79 | ||
80 | :- dynamic registered_value_packed/3, registered_value_name/2, memoization_expansion_completed/1. | |
81 | ||
82 | % we register the functions to be memoized | |
83 | get_registered_function(Id,Val) :- registered_value(Id,_,Val). | |
84 | get_registered_function(Id,Name,Val) :- registered_value(Id,Name,Val). | |
85 | get_registered_function_name(Id,Name) :- registered_value_name(Id,Name). | |
86 | is_registered_function_name(Name) :- registered_value_name(_,Name). | |
87 | is_registered_function_name(Name,Expanded) :- registered_value_name(ID,Name), | |
88 | (memoization_expansion_completed(ID) -> Expanded=true ; Expanded=false). | |
89 | ||
90 | :- use_module(tools,[remove_variables/3]). | |
91 | :- use_module(kernel_tools,[ground_value_check/2, value_variables/2]). | |
92 | % register a (usually symbolic closure) value as a function | |
93 | % ElType is the type of the elements of the function and MemoResultClosure is a closure that | |
94 | % can and should be used instead of BValue to ensure memoization works | |
95 | register_memoization_function(Name,BValue,ElType,RecursionInfo,MemoID,MemoResultClosure) :- | |
96 | value_variables(BValue,Vars), | |
97 | %print(vars(Name,Vars,LHSValue)),nl, print(bvalue(BValue)),nl, | |
98 | (RecursionInfo='$recursion_value'(RecValue) | |
99 | -> remove_variables(Vars,[RecValue],WVars), % do not wait on RecValue; it will be set by registering MEMOID | |
100 | RecValue = MemoResultClosure, | |
101 | InnerMemoID=MemoID % already instantiate MemoID before asserting closure; cyclic use | |
102 | ; WVars=Vars | |
103 | ), | |
104 | ground_value_check(WVars,Ground), | |
105 | %print(register(Name,MemoID,Ground,BValue)),nl,nl, | |
106 | construct_memoization_closure(MemoID,BValue,ElType,MemoResultClosure), | |
107 | register_memoization_function_aux(Ground,Name,BValue,InnerMemoID,MemoID). | |
108 | ||
109 | :- block register_memoization_function_aux(-,?,?,?,?). | |
110 | register_memoization_function_aux(_,Name,BValue,InnerMemoID,MemoID) :- | |
111 | inc_counter(memoization_function_counter,InnerMemoID), | |
112 | formatsilent('Registering function ~w for memoization: ~w~n',[InnerMemoID,Name]), | |
113 | (ground_value(BValue) -> true ; add_internal_error('Non ground memo closure: ',InnerMemoID:BValue)), | |
114 | %(BValue=closure(_,_,BB) -> bsyntaxtree:check_used_ids_in_ast(BB) ; true), | |
115 | compile_value(BValue,InnerMemoID), | |
116 | assertz(registered_value_name(InnerMemoID,Name)), | |
117 | assert_registered_value(InnerMemoID,Name,BValue), | |
118 | %if(MemoID=InnerMemoID, format('Finish ~w~n',[MemoID]),format('FAILURE ~w~n',[InnerMemoID])). | |
119 | MemoID=InnerMemoID. % only unify after assertz; in case co-routines are triggered which call get_registered_function | |
120 | ||
121 | :- use_module(state_packing,[pack_value/2,unpack_value/2]). | |
122 | assert_registered_value(InnerMemoID,Name,BValue) :- | |
123 | pack_value(BValue,PValue), % mainly useful when CMPRESSION set to full so that closure bodies packed | |
124 | assertz(registered_value_packed(InnerMemoID,Name,PValue)). % TODO: pack value | |
125 | ||
126 | registered_value(InnerMemoID,Name,BValue) :- | |
127 | registered_value_packed(InnerMemoID,Name,PValue), | |
128 | unpack_value(PValue,BValue). | |
129 | ||
130 | :- load_files(library(system), [when(compile_time), imports([environ/2])]). | |
131 | :- if(environ(cogen,true)). | |
132 | compile_value(closure(Paras,Ty,Body),InnerMemoID) :- | |
133 | compile_closure(Paras,Ty,Body,InnerMemoID),!. | |
134 | compile_value(_,_). | |
135 | :- use_module(b_cogen). | |
136 | :- else. | |
137 | compile_value(_,_). | |
138 | reset_cogen. | |
139 | :- endif. | |
140 | ||
141 | construct_memoization_closure(MemoID,BValue,ElType,Result) :- | |
142 | get_infos(BValue,BInfos), | |
143 | XFC = b(external_function_call('MEMOIZE_STORED_FUNCTION',[b(value(int(MemoID)),integer,[])]),set(ElType),[]), | |
144 | TID = b(identifier('_zzzz_unary'),ElType,[]), | |
145 | Body = b(member(TID,XFC),pred,[prob_annotation('MEMOIZE'(MemoID))|BInfos]), | |
146 | %bsyntaxtree:check_used_ids_in_ast(Body), | |
147 | Result = closure(['_zzzz_unary'],[ElType], Body). | |
148 | ||
149 | :- use_module(bsyntaxtree,[get_texpr_info/2, extract_info_wo_used_ids/2, extract_pos_infos/2]). % extract_info_wo_used_ids | |
150 | % extract important infos, | |
151 | get_infos(Var,Res) :- var(Var),!,Res=[]. | |
152 | get_infos(closure(_,_,B),Res) :- extract_info_wo_used_ids(B,Infos),!, | |
153 | get_texpr_info(B,AllInfos),extract_pos_infos(AllInfos,Pos), | |
154 | append(Pos,Infos,Res). | |
155 | get_infos(_,[]). % :- print(no_infos(A)),nl. | |
156 | ||
157 | :- use_module(bsyntaxtree, [get_texpr_id/2]). | |
158 | is_memoization_closure([ID],_T,b(Body,_,INFO),MemoID) :- | |
159 | ? | member(prob_annotation('MEMOIZE'(MemoID)),INFO), |
160 | % check Body has not been rewritten: | |
161 | Body = member(TID,b(RHS,_,_)), | |
162 | get_texpr_id(TID,ID), | |
163 | is_memoize_stored_function_reference(RHS,MemoID). | |
164 | ||
165 | is_memoize_stored_function_reference(external_function_call('MEMOIZE_STORED_FUNCTION',[Arg]),MemoID) :- | |
166 | Arg=b(value(int(MemoID)),_,_). | |
167 | ||
168 | % check if we have a memoization closure and get its stored value | |
169 | get_memoization_closure_value(P,T,B,Value) :- | |
170 | is_memoization_closure(P,T,B,MemoID), | |
171 | number(MemoID), | |
172 | registered_value(MemoID,_,Value). | |
173 | ||
174 | % expand an (untyped) expression term referring to a stored function into full value: | |
175 | %expand_memoize_stored_function_reference(Expr,Value) :- | |
176 | % is_memoize_stored_function_reference(Expr,MemoID), | |
177 | % number(MemoID), % in case this is called before function registered | |
178 | % registered_value(MemoID,_,Value). | |
179 | ||
180 | :- use_module(probsrc(closures),[is_lambda_value_domain_normal_closure/5]). | |
181 | :- dynamic stored_lambda_value_domain/3. | |
182 | % Note: the caller must check that DomainValue, Expr are not equal to fail | |
183 | is_lambda_value_domain_memoization_closure(P,T,Pred, DomainValue,Expr) :- | |
184 | ? | is_memoization_closure(P,T,Pred,MemoID), |
185 | number(MemoID), | |
186 | (stored_lambda_value_domain(MemoID,DV,E) | |
187 | -> true %print(get_domain(MemoID)),nl | |
188 | ; registered_value(MemoID,_,closure(P2,T2,Pred2)), | |
189 | %print(storing(lambda_domain(MemoID))),nl, | |
190 | (is_lambda_value_domain_normal_closure(P2,T2,Pred2, DV,E) | |
191 | -> assertz(stored_lambda_value_domain(MemoID,DV,E)) | |
192 | ; assertz(stored_lambda_value_domain(MemoID,fail,fail)), | |
193 | fail | |
194 | ) | |
195 | ), | |
196 | DomainValue=DV, Expr = E. | |
197 | ||
198 | ||
199 | % ---------------------------------------------- | |
200 | % providing stored_memo_result_id/4 fact interface | |
201 | % some MemoID are stored in separate table | |
202 | :- dynamic stored_memo_result1/3, stored_memo_result2/3, | |
203 | stored_memo_result3/3, stored_memo_result4/3, | |
204 | stored_memo_result5/3, stored_memo_result6/3, | |
205 | stored_memo_result7/3, stored_memo_result8/3, | |
206 | stored_memo_result/4. | |
207 | stored_memo_result_id(1,ArgHash,Argument,StoredResult) :- !, | |
208 | stored_memo_result1(ArgHash,Argument,StoredResult). | |
209 | stored_memo_result_id(2,ArgHash,Argument,StoredResult) :- !, | |
210 | stored_memo_result2(ArgHash,Argument,StoredResult). | |
211 | stored_memo_result_id(3,ArgHash,Argument,StoredResult) :- !, | |
212 | stored_memo_result3(ArgHash,Argument,StoredResult). | |
213 | stored_memo_result_id(4,ArgHash,Argument,StoredResult) :- !, | |
214 | stored_memo_result4(ArgHash,Argument,StoredResult). | |
215 | stored_memo_result_id(5,ArgHash,Argument,StoredResult) :- !, | |
216 | ? | stored_memo_result5(ArgHash,Argument,StoredResult). |
217 | stored_memo_result_id(6,ArgHash,Argument,StoredResult) :- !, | |
218 | ? | stored_memo_result6(ArgHash,Argument,StoredResult). |
219 | stored_memo_result_id(7,ArgHash,Argument,StoredResult) :- !, | |
220 | ? | stored_memo_result7(ArgHash,Argument,StoredResult). |
221 | stored_memo_result_id(8,ArgHash,Argument,StoredResult) :- !, | |
222 | ? | stored_memo_result8(ArgHash,Argument,StoredResult). |
223 | stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult) :- | |
224 | ? | stored_memo_result(ArgHash,MemoID,Argument,StoredResult). |
225 | ||
226 | assert_stored_memo_result_id(1,ArgHash,Argument,StoredResult) :- !, | |
227 | assertz(stored_memo_result1(ArgHash,Argument,StoredResult)). | |
228 | assert_stored_memo_result_id(2,ArgHash,Argument,StoredResult) :- !, | |
229 | assertz(stored_memo_result2(ArgHash,Argument,StoredResult)). | |
230 | assert_stored_memo_result_id(3,ArgHash,Argument,StoredResult) :- !, | |
231 | assertz(stored_memo_result3(ArgHash,Argument,StoredResult)). | |
232 | assert_stored_memo_result_id(4,ArgHash,Argument,StoredResult) :- !, | |
233 | assertz(stored_memo_result4(ArgHash,Argument,StoredResult)). | |
234 | assert_stored_memo_result_id(5,ArgHash,Argument,StoredResult) :- !, | |
235 | assertz(stored_memo_result5(ArgHash,Argument,StoredResult)). | |
236 | assert_stored_memo_result_id(6,ArgHash,Argument,StoredResult) :- !, | |
237 | assertz(stored_memo_result6(ArgHash,Argument,StoredResult)). | |
238 | assert_stored_memo_result_id(7,ArgHash,Argument,StoredResult) :- !, | |
239 | assertz(stored_memo_result7(ArgHash,Argument,StoredResult)). | |
240 | assert_stored_memo_result_id(8,ArgHash,Argument,StoredResult) :- !, | |
241 | assertz(stored_memo_result8(ArgHash,Argument,StoredResult)). | |
242 | assert_stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult) :- | |
243 | assertz(stored_memo_result(ArgHash,MemoID,Argument,StoredResult)). | |
244 | ||
245 | retractall_stored_memo_result :- | |
246 | retractall(stored_memo_result1(_,_,_)), | |
247 | retractall(stored_memo_result2(_,_,_)), | |
248 | retractall(stored_memo_result3(_,_,_)), | |
249 | retractall(stored_memo_result4(_,_,_)), | |
250 | retractall(stored_memo_result5(_,_,_)), | |
251 | retractall(stored_memo_result6(_,_,_)), | |
252 | retractall(stored_memo_result7(_,_,_)), | |
253 | retractall(stored_memo_result8(_,_,_)), | |
254 | retractall(stored_memo_result(_,_,_,_)). | |
255 | ||
256 | % this clause is only ok if we have just a single function; otherwise we get collisions between different functions | |
257 | compute_funcall_memo_hash(int(X),MemoID,R) :- MemoID <9, !, | |
258 | R=X. % avoid computing hash for simple integer values; only drawback: indexing not good for too large integers | |
259 | % TO DO: we could register with each registered_value fact also a dynamic table_memo fact | |
260 | % then we can avoid clashes between different memoized functions | |
261 | compute_funcall_memo_hash(X,MemoID,ArgHash) :- | |
262 | compute_memo_hash((MemoID,X),ArgHash). | |
263 | ||
264 | ||
265 | % -------------------------------------------- | |
266 | ||
267 | % last argument should be left free when calling | |
268 | get_stored_memo_result(MemoID,Argument,ArgHash,StoredResult) :- | |
269 | stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult), | |
270 | %print(get_stored(MemoID,ArgHash,StoredResult)),nl, | |
271 | count_reuse(MemoID). | |
272 | ||
273 | ||
274 | :- use_module(kernel_waitflags,[add_wd_error_span/4]). | |
275 | :- use_module(tools_strings,[ajoin/2]). | |
276 | :- use_module(store,[normalise_value_for_var/3]). | |
277 | store_memo_result(MemoID,Argument,ArgHash,Result,Span,WF) :- | |
278 | normalise_value_for_var(MemoID,Result,NormResult), | |
279 | store_norm_memo_result(MemoID,Argument,ArgHash,NormResult,Span,WF). | |
280 | ||
281 | :- use_module(kernel_objects,[equal_object/2]). | |
282 | store_norm_memo_result(MemoID,Argument,ArgHash,Result,Span,WF) :- | |
283 | stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult), | |
284 | !, | |
285 | (Result=StoredResult -> true | |
286 | ; equal_object(Result,StoredResult) -> format('Two representations for memoized function (~w) result.~n',[MemoID]) | |
287 | ; ajoin(['Memoized function ',MemoID,' has multiple results for: '],Msg), | |
288 | Relation = [(Argument,StoredResult),(Argument,Result)], | |
289 | add_wd_error_span(Msg,'@fun'(Argument,Relation),Span,WF) | |
290 | %,print('stored: '),translate:print_bvalue(StoredResult),nl,print('new: '),translate:print_bvalue(Result),nl | |
291 | ). | |
292 | store_norm_memo_result(MemoID,Argument,ArgHash,Result,_,_) :- | |
293 | %format('Storing memo result for ~w, argument =',[MemoID]), | |
294 | %translate:print_bvalue(Argument),nl, translate:print_bvalue(Result),nl, | |
295 | assert_stored_memo_result_id(MemoID,ArgHash,Argument,Result). | |
296 | %assertz(stored_memo_result(ArgHash,MemoID,Argument,Result)). | |
297 | %print(stored_memo_result(ArgHash,MemoID,Argument,Result)),nl. | |
298 | ||
299 | ||
300 | % function application for memoized function: | |
301 | apply_to_memoize(MemoID,P,T,B,X,Y,Span,WF) :- | |
302 | ground_value_check(X,XV), | |
303 | block_apply_closure_memo_groundx(XV,MemoID,X,Y,P,T,B,raise_wd,Span,WF). | |
304 | ||
305 | :- use_module(kernel_tools,[ground_value/1]). | |
306 | :- use_module(kernel_objects,[equal_object_wf/3]). | |
307 | ||
308 | :- block block_apply_closure_memo_groundx(-,?, ?,?, ?,?,?, ?,?,?), | |
309 | block_apply_closure_memo_groundx(?,-, ?,?, ?,?,?, ?,?,?). | |
310 | ||
311 | ||
312 | block_apply_closure_memo_groundx(_,MemoID, X,Y, P,T,B, RaiseWD, Span,WF) :- | |
313 | % MemoID is ground, meaning body B is ground as well | |
314 | % TODO: obtain stored value directly | |
315 | compute_funcall_memo_hash(X,MemoID,ArgHash), | |
316 | if(get_stored_memo_result(MemoID,X,ArgHash,StoredResult), | |
317 | equal_object_wf(Y,StoredResult,WF), | |
318 | (start_profile_function_application(MemoID,Timer), | |
319 | if(check_element_of_function_closure_nowf(MemoID,X,ComputedResult,P,T,B,Span,WF), | |
320 | % ground WF to compute ground value for ComputedResult | |
321 | (stop_profile_function_application(MemoID,Timer), | |
322 | (ground_value(ComputedResult) | |
323 | -> store_memo_result(MemoID,X,ArgHash,ComputedResult,Span,WF) | |
324 | ; add_error_wf(memoization,'Could not compute ground value for function application',MemoID,Span,WF), | |
325 | print('Argument: '),translate:print_bvalue(X),nl, | |
326 | print('Result: '), print(ComputedResult),nl, | |
327 | print('Function: '),registered_value(MemoID,_Name,FunValue), translate:print_bvalue(FunValue),nl,nl | |
328 | ), | |
329 | % To do: check if we compute two or more solutions for f(X) and add WD error | |
330 | equal_object_wf(Y,ComputedResult,WF) | |
331 | ), | |
332 | (RaiseWD=raise_wd, | |
333 | add_wd_error_span('function applied outside of domain (#8-Memo): ', '@fun'(X,closure(P,T,B)),Span,WF) | |
334 | ) | |
335 | ) | |
336 | ) | |
337 | ). | |
338 | ||
339 | :- use_module(kernel_waitflags, [init_wait_flags/2, init_wait_flags_and_push_call_stack/3,ground_wait_flags/1]). | |
340 | :- use_module(custom_explicit_sets,[check_element_of_function_closure/6]). | |
341 | check_element_of_function_closure_nowf(MemoID,X,ComputedResult,_,_,_,Span,OuterWF) :- | |
342 | registered_value(MemoID,Name,closure(P,T,B)),!, % can be expensive if closure contains large values | |
343 | init_wait_flags_and_push_call_stack(OuterWF,function_call(Name,X,Span),WF), % slows down test 1968 with recursion | |
344 | check_element_of_function_closure(X,ComputedResult,P,T,B,WF), | |
345 | ground_wait_flags(WF). | |
346 | check_element_of_function_closure_nowf(_,X,ComputedResult,P,T,B,_Span,_OuterWF) :- | |
347 | init_wait_flags(WF,[check_element_of_function_closure_nowf]), | |
348 | check_element_of_function_closure(X,ComputedResult,P,T,B,WF), | |
349 | ground_wait_flags(WF). | |
350 | ||
351 | :- use_module(library(avl),[avl_domain/2]). | |
352 | :- use_module(library(lists),[maplist/2]). | |
353 | ||
354 | % store the complete expansion of a memoized function for later re-use | |
355 | % and also passes result and done flag to an outer call | |
356 | :- block store_memoization_closure_expansion(?,-,?,?,?,?,?). | |
357 | store_memoization_closure_expansion(MemoID,_,Res,OuterDone,OuterRes,Span,WF) :- | |
358 | my_avl_domain(Res,List), | |
359 | !, | |
360 | debug_println(19,storing_expansion_of_memoized_function(MemoID)), | |
361 | (maplist(store_function_result(MemoID,Span,WF),List) | |
362 | -> assertz(memoization_expansion_completed(MemoID)) | |
363 | ; add_internal_error(memoization,'Error storing expansion for memoized function:',MemoID,Span)), | |
364 | equal_object_wf(Res,OuterRes,WF), OuterDone=true. | |
365 | store_memoization_closure_expansion(MemoID,_,R,OuterDone,OuterRes,Span,WF) :- | |
366 | add_warning_wf(memoization,'Cannot store expansion for memoized function:',MemoID:R,Span,WF), | |
367 | equal_object_wf(R,OuterRes,WF), OuterDone=true. | |
368 | ||
369 | my_avl_domain(avl_set(A),List) :- avl_domain(A,List). | |
370 | my_avl_domain([],[]). | |
371 | ||
372 | store_function_result(MemoID,Span,WF,(X,ComputedResult)) :- | |
373 | compute_funcall_memo_hash(X,MemoID,ArgHash), | |
374 | store_memo_result(MemoID,X,ArgHash,ComputedResult,Span,WF). % TO DO: we could use special version that also allows relations | |
375 | ||
376 | :- use_module(kernel_objects,[equal_object_optimized_wf/4]). | |
377 | % succeeds if function has been completely memoized and returns expansion | |
378 | try_get_complete_memoization_expansion(MemoID,Result,WF) :- | |
379 | memoization_expansion_completed(MemoID), | |
380 | debug_println(19,recovering_full_value_for_memoized_function(MemoID)), | |
381 | findall((X,Y),stored_memo_result_id(MemoID,_,X,Y),List), % probably not sorted ! | |
382 | equal_object_optimized_wf(List,Result,expand_normal_closure_memo,WF). | |
383 | ||
384 | % always succeeds to obtain the full expansion; also stores it for reuse | |
385 | :- block get_complete_memoization_expansion(-,?,?,?,?,?). | |
386 | get_complete_memoization_expansion(MemoID,Result,Done,_,_PP,WF) :- | |
387 | try_get_complete_memoization_expansion(MemoID,Cached,WF), | |
388 | !, | |
389 | Result=Cached, Done=true. | |
390 | get_complete_memoization_expansion(MemoID,Result,Done,Span,PP,WF) :- | |
391 | registered_value(MemoID,Name,Val), nonvar(Val), | |
392 | !, | |
393 | get_complete_memoization_expansion_aux(Val,MemoID,Name,Result,Done,Span,PP,WF). | |
394 | get_complete_memoization_expansion(MemoID,_,_,Span,PP,WF) :- | |
395 | add_error_wf(get_complete_memoization_expansion,'Memoized function ID not registered:',MemoID:PP,Span,WF), | |
396 | fail. | |
397 | ||
398 | ||
399 | get_complete_memoization_expansion_aux(Val,_MemoID,_,Result,Done,_Span,_PP,_WF) :- expanded_value(Val), !, | |
400 | Result=Val,Done=true. | |
401 | get_complete_memoization_expansion_aux(closure(P,T,B),MemoID,Name,Result,Done,Span,PP,WF) :- !, | |
402 | debug_println(19,expanding_memoized_function(MemoID,PP)), | |
403 | (custom_explicit_sets:is_infinite_or_very_large_closure(P,T,B,200000) | |
404 | -> add_warning_wf(PP,'Expanding infinite or very large memoized function: ',Name,B,WF) | |
405 | ? | ; is_symbolic_closure(P,T,B) |
406 | -> add_message_wf(PP,'Fully expanding symbolic memoized function: ',Name,B,WF) | |
407 | ; true), | |
408 | % bsyntaxtree:check_used_ids_in_ast(B), | |
409 | custom_explicit_sets:expand_normal_closure_direct(P,T,B,Expansion,DoneExp,WF), | |
410 | store_memoization_closure_expansion(MemoID,DoneExp,Expansion,Done,Result,Span,WF). | |
411 | get_complete_memoization_expansion_aux(Val,MemoID,Name,_,_,Span,PP,WF) :- | |
412 | add_error_wf(memoization(PP),'Illegal value stored for memoized function:',MemoID:Name,Span,WF), | |
413 | print(Val),nl, | |
414 | fail. | |
415 | ||
416 | expanded_value(avl_set(_)). | |
417 | expanded_value(global_set(_)). | |
418 | expanded_value([]). | |
419 | expanded_value([_|_]). | |
420 | ||
421 | :- use_module(kernel_tools,[ground_value/1]). | |
422 | :- use_module(kernel_objects,[check_element_of_wf/3]). | |
423 | % special treatment for element of memoization closure; possibly not a function call | |
424 | element_of_memoization_closure(MemoID,Element,WF,P,T,B) :- | |
425 | nonvar(Element), Element = (X,Y), | |
426 | ground_value(X), | |
427 | % we can do a function application; we assume that we only store functions | |
428 | !, %print(fun_apply_reuse(MemoID,Element)),nl, | |
429 | Span=B, | |
430 | block_apply_closure_memo_groundx(ground,MemoID, X,Y, P,T,B, do_not_raise_wd, Span,WF). | |
431 | element_of_memoization_closure(MemoID,Element,WF,_,_,B) :- | |
432 | % TO DO: delay before computing complete memoization | |
433 | get_complete_memoization_expansion(MemoID,Set,_Done,B,element_of_memoization_closure,WF), | |
434 | !, %print(el_of(MemoID,Element)),nl, | |
435 | check_element_of_wf(Element,Set,WF). | |
436 | ||
437 | :- use_module(kernel_objects,[not_equal_object_wf/3]). | |
438 | :- use_module(kernel_objects,[not_element_of_wf/3]). | |
439 | ||
440 | not_element_of_memoization_closure(MemoID,Element,WF,P,T,B) :- | |
441 | nonvar(Element), Element = (X,Y), | |
442 | ground_value(X), | |
443 | !, | |
444 | if(block_apply_closure_memo_groundx(ground,MemoID, X,YRes, P,T,B, do_not_raise_wd, B,WF), | |
445 | not_equal_object_wf(Y,YRes,wf), | |
446 | true). | |
447 | not_element_of_memoization_closure(MemoID,Element,WF,_,_,B) :- | |
448 | % TO DO: delay before computing complete memoization | |
449 | get_complete_memoization_expansion(MemoID,Set,_Done,B,not_element_of_memoization_closure,WF), | |
450 | !, | |
451 | ? | not_element_of_wf(Element,Set,WF). |
452 | % ------------------------------- | |
453 | ||
454 | :- dynamic function_application_time/2. | |
455 | :- load_files(library(system), [when(compile_time), imports([environ/2])]). | |
456 | :- if(environ(prob_profile,true)). | |
457 | %:- if(1=1). | |
458 | %:- print('Profiling Memoizations'),nl. | |
459 | count_reuse(MemoID) :- | |
460 | my_bb_get_reuse_counter(MemoID,Cnt), C1 is Cnt+1, bb_put(MemoID,C1), | |
461 | inc_counter(memoization_function_reuse_counter,_). | |
462 | my_bb_get_reuse_counter(Key,Val) :- (bb_get(Key,V) -> V=Val ; Val=0). | |
463 | bb_reset_reuse_counter(Key) :- bb_put(Key,0). | |
464 | start_profile_function_application(_,Walltime) :- statistics(walltime,[Walltime,_]). | |
465 | stop_profile_function_application(MemoID,Walltime1) :- statistics(walltime,[Walltime2,_]), | |
466 | Delta is Walltime2-Walltime1, | |
467 | (Delta>0 -> | |
468 | (retract(function_application_time(MemoID,Old)) | |
469 | -> New is Old+Delta ; New = Delta), | |
470 | assertz(function_application_time(MemoID,New)) | |
471 | ; true | |
472 | ). | |
473 | function_application_time_available :- true. | |
474 | :- else. | |
475 | count_reuse(_MemoID) :- | |
476 | inc_counter(memoization_function_reuse_counter,_). | |
477 | my_bb_get_reuse_counter(_,'?'). | |
478 | bb_reset_reuse_counter(_). | |
479 | start_profile_function_application(_,0). | |
480 | stop_profile_function_application(_,_). | |
481 | function_application_time_available :- fail. | |
482 | :- endif. | |
483 | ||
484 | % ------------------------------- | |
485 | % utilities to profile expansions | |
486 | :- public inc/1. | |
487 | :- dynamic hash_count/2. | |
488 | inc(Hash) :- (retract(hash_count(Hash,Nr)) -> N1 is Nr+1 ; N1 = 1), assertz(hash_count(Hash,N1)). | |
489 | :- dynamic hash_time/2. | |
490 | store_memo_computation_time(Hash,Time) :- % for closure expansions, not for funct. applications | |
491 | retractall(hash_time(Hash,_)), assertz(hash_time(Hash,Time)). | |
492 | ||
493 | % reused and walltime info requires prob_profile flag | |
494 | tcltk_get_memo_profile_table(list([Header|Entries])) :- | |
495 | Header = list(['ID','Name','Fully','Stored Values','Reused','Walltime (ms)']), | |
496 | findall(Entry,get_memo_entry_info(Entry),Entries). | |
497 | ||
498 | get_memo_entry_info(list([MemoID,Name,Complete,NrStored,ReuseCnt,Walltime])) :- | |
499 | registered_value(MemoID,Name,_FunValue), | |
500 | (memoization_expansion_completed(MemoID) -> Complete='true' ; Complete = 'false'), | |
501 | get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt). | |
502 | ||
503 | % get some profile info about a MemoID | |
504 | get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt) :- | |
505 | my_bb_get_reuse_counter(MemoID,ReuseCnt), | |
506 | findall(1,stored_memo_result_id(MemoID,_Hash,_,_),Stored), length(Stored,NrStored), | |
507 | (\+ function_application_time_available -> Walltime='?' | |
508 | ; function_application_time(MemoID,Walltime) -> true ; Walltime=0). | |
509 | ||
510 | ||
511 | print_memo_profile :- | |
512 | ((stored_memo_expansion(_,_,_) ; registered_value_packed(_,_,_)) | |
513 | -> print('MEMO Table:'),nl, | |
514 | print_memo_table | |
515 | ; true). | |
516 | ||
517 | % memoization:print_memo. | |
518 | print_memo_table :- | |
519 | stored_memo_expansion(Hash,LookupTerm,PackedValue), | |
520 | (hash_count(Hash,Count) -> print(Count), print(' : ') ; true), | |
521 | (hash_time(Hash,Time) -> print(Time),print(' --> ') ; true), | |
522 | print_memo_entry(LookupTerm), | |
523 | nl, print(' : '),translate:print_bvalue(PackedValue),nl,fail. | |
524 | print_memo_table :- | |
525 | debug_mode(on), | |
526 | registered_value(MemoID,Name,FunValue), | |
527 | (memoization_expansion_completed(MemoID) | |
528 | -> Compl=' (completely evaluated)' ; Compl=''), | |
529 | format('MemoID ~w stored FUNCTION ~w~w ',[MemoID,Name,Compl]), | |
530 | nl, print(' : '),translate:print_bvalue(FunValue),nl,fail. | |
531 | print_memo_table :- | |
532 | debug_mode(on), | |
533 | registered_value_name(MemoID,Name), | |
534 | stored_memo_result_id(MemoID,_Hash,LookupTerm,PackedValue), | |
535 | format('MemoID ~w (~w) result for argument ',[MemoID,Name]), | |
536 | print_memo_entry(LookupTerm), | |
537 | nl, print(' : '),translate:print_bvalue(PackedValue),nl,fail. | |
538 | print_memo_table :- | |
539 | stored_memo_result(Hash,MemoID1,T1,_), | |
540 | stored_memo_result(Hash,MemoID2,T2,_), | |
541 | dif((MemoID1,T1),(MemoID2,T2)), | |
542 | format('Hash COLLISION ~w, ~w:~w vs ~w:~w~n',[Hash,MemoID1,T1,MemoID2,T2]), | |
543 | fail. | |
544 | print_memo_table :- format('Summary of reuse per memoization ID:~n',[]), | |
545 | registered_value_name(MemoID,Name), | |
546 | get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt), | |
547 | format('MemoID ~w (~w) : Values Stored: ~w (~w ms to compute), Reused ~w~n',[MemoID,Name,NrStored,Walltime,ReuseCnt]), | |
548 | fail. | |
549 | print_memo_table :- get_counter(memoization_hash_counter,Hash), | |
550 | get_counter(memoization_reuse_counter,RHit), | |
551 | format('Hashes computed: ~w, expansions reused: ~w~n',[Hash,RHit]), | |
552 | get_counter(memoization_function_counter,F), | |
553 | get_counter(memoization_function_reuse_counter,FR), | |
554 | format('Memoization functions registered: ~w, results reused: ~w~n',[F,FR]). | |
555 | ||
556 | print_memo_entry(closure(Parameters,ParameterTypes,ClosureBody)) :- !, | |
557 | translate:print_bvalue(closure(Parameters,ParameterTypes,ClosureBody)). | |
558 | print_memo_entry(closure1_for_explicit_set(A)) :- !, | |
559 | print('closure1('),translate:print_bvalue(avl_set(A)), print(')'). | |
560 | print_memo_entry(A) :- translate:print_bvalue(A). | |
561 | ||
562 | :- use_module(extension('counter/counter'),[counter_init/0, reset_counter/1, | |
563 | new_counter/1, inc_counter/2, | |
564 | get_counter/2]). | |
565 | init_memo_table :- | |
566 | counter_init, | |
567 | new_counter(memoization_reuse_counter), new_counter(memoization_hash_counter), | |
568 | new_counter(memoization_function_counter), new_counter(memoization_function_reuse_counter), | |
569 | reset_memo_table. | |
570 | ||
571 | reset_memo_table :- | |
572 | ? | retract(registered_value_packed(MemoID,_,_)), |
573 | bb_reset_reuse_counter(MemoID), | |
574 | retract(registered_value_name(MemoID,_)), | |
575 | fail. | |
576 | reset_memo_table :- | |
577 | reset_counter(memoization_reuse_counter), | |
578 | reset_counter(memoization_hash_counter), | |
579 | reset_counter(memoization_function_counter), | |
580 | reset_counter(memoization_function_reuse_counter), | |
581 | ? | (stored_memo_expansion(_,_,_) -> debug_println(19,'Resetting MEMO table') ; true), |
582 | retractall(hash_count(_,_)), | |
583 | retractall(hash_time(_,_)), | |
584 | retractall(stored_memo_expansion(_,_,_)), | |
585 | retractall(registered_value_packed(_,_,_)), | |
586 | retractall(registered_value_name(_,_)), | |
587 | retractall(function_application_time(_,_)), | |
588 | retractall(memoization_expansion_completed(_)), | |
589 | retractall(stored_lambda_value_domain(_,_,_)), | |
590 | retractall_stored_memo_result, | |
591 | reset_cogen. | |
592 | ||
593 | :- use_module(probsrc(tools),[retract_with_statistics/2]). | |
594 | reset_memo_with_statistics :- | |
595 | retract_with_statistics(memoization, | |
596 | [stored_memo_expansion(_,_,_), | |
597 | registered_value_packed(_,_,_),registered_value_name(_,_,_), | |
598 | memoization_expansion_completed(_), | |
599 | stored_lambda_value_domain(_,_,_), | |
600 | stored_memo_result1(_,_,_), stored_memo_result2(_,_,_), | |
601 | stored_memo_result3(_,_,_), stored_memo_result4(_,_,_), | |
602 | stored_memo_result5(_,_,_), stored_memo_result6(_,_,_), | |
603 | stored_memo_result7(_,_,_), stored_memo_result8(_,_,_), | |
604 | stored_memo_result(_,_,_,_)]), | |
605 | reset_memo_table. | |
606 |