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),
124 % mainly useful when COMPRESSION preference is full or
125 % when force_state_packing_for_closures is true so that closure bodies packed
126 assertz(registered_value_packed(InnerMemoID,Name,PValue)).
127
128 registered_value(InnerMemoID,Name,BValue) :-
129 registered_value_packed(InnerMemoID,Name,PValue),
130 unpack_value(PValue,BValue).
131
132 :- load_files(library(system), [when(compile_time), imports([environ/2])]).
133 :- if(environ(cogen,true)).
134 compile_value(closure(Paras,Ty,Body),InnerMemoID) :-
135 compile_closure(Paras,Ty,Body,InnerMemoID),!.
136 compile_value(_,_).
137 :- use_module(b_cogen).
138 :- else.
139 compile_value(_,_).
140 reset_cogen.
141 :- endif.
142
143 construct_memoization_closure(MemoID,BValue,ElType,Result) :-
144 get_infos(BValue,BInfos),
145 XFC = b(external_function_call('MEMOIZE_STORED_FUNCTION',[b(value(int(MemoID)),integer,[])]),set(ElType),[]),
146 TID = b(identifier('_zzzz_unary'),ElType,[]),
147 Body = b(member(TID,XFC),pred,[prob_annotation('MEMOIZE'(MemoID))|BInfos]),
148 %bsyntaxtree:check_used_ids_in_ast(Body),
149 Result = closure(['_zzzz_unary'],[ElType], Body).
150
151 :- use_module(bsyntaxtree,[get_texpr_info/2, extract_info_wo_used_ids/2, extract_pos_infos/2]). % extract_info_wo_used_ids
152 % extract important infos,
153 get_infos(Var,Res) :- var(Var),!,Res=[].
154 get_infos(closure(_,_,B),Res) :- extract_info_wo_used_ids(B,Infos),!,
155 get_texpr_info(B,AllInfos),extract_pos_infos(AllInfos,Pos),
156 append(Pos,Infos,Res).
157 get_infos(_,[]). % :- print(no_infos(A)),nl.
158
159 :- use_module(bsyntaxtree, [get_texpr_id/2]).
160 is_memoization_closure([ID],_T,b(Body,_,INFO),MemoID) :-
161 ? member(prob_annotation('MEMOIZE'(MemoID)),INFO),
162 % check Body has not been rewritten:
163 Body = member(TID,b(RHS,_,_)),
164 get_texpr_id(TID,ID),
165 is_memoize_stored_function_reference(RHS,MemoID).
166
167 is_memoize_stored_function_reference(external_function_call('MEMOIZE_STORED_FUNCTION',[Arg]),MemoID) :-
168 Arg=b(value(int(MemoID)),_,_).
169
170 % check if we have a memoization closure and get its stored value
171 get_memoization_closure_value(P,T,B,Value) :-
172 is_memoization_closure(P,T,B,MemoID),
173 number(MemoID),
174 registered_value(MemoID,_,Value).
175
176 % expand an (untyped) expression term referring to a stored function into full value:
177 %expand_memoize_stored_function_reference(Expr,Value) :-
178 % is_memoize_stored_function_reference(Expr,MemoID),
179 % number(MemoID), % in case this is called before function registered
180 % registered_value(MemoID,_,Value).
181
182 :- use_module(probsrc(closures),[is_lambda_value_domain_normal_closure/5]).
183 :- dynamic stored_lambda_value_domain/3.
184 % Note: the caller must check that DomainValue, Expr are not equal to fail
185 is_lambda_value_domain_memoization_closure(P,T,Pred, DomainValue,Expr) :-
186 ? is_memoization_closure(P,T,Pred,MemoID),
187 number(MemoID),
188 (stored_lambda_value_domain(MemoID,DV,E)
189 -> true %print(get_domain(MemoID)),nl
190 ; registered_value(MemoID,_,closure(P2,T2,Pred2)),
191 %print(storing(lambda_domain(MemoID))),nl,
192 (is_lambda_value_domain_normal_closure(P2,T2,Pred2, DV,E)
193 -> assertz(stored_lambda_value_domain(MemoID,DV,E))
194 ; assertz(stored_lambda_value_domain(MemoID,fail,fail)),
195 fail
196 )
197 ),
198 DomainValue=DV, Expr = E.
199
200
201 % ----------------------------------------------
202 % providing stored_memo_result_id/4 fact interface
203 % some MemoID are stored in separate table
204 :- dynamic stored_memo_result1/3, stored_memo_result2/3,
205 stored_memo_result3/3, stored_memo_result4/3,
206 stored_memo_result5/3, stored_memo_result6/3,
207 stored_memo_result7/3, stored_memo_result8/3,
208 stored_memo_result/4.
209 stored_memo_result_id(1,ArgHash,Argument,StoredResult) :- !,
210 ? stored_memo_result1(ArgHash,Argument,StoredResult).
211 stored_memo_result_id(2,ArgHash,Argument,StoredResult) :- !,
212 stored_memo_result2(ArgHash,Argument,StoredResult).
213 stored_memo_result_id(3,ArgHash,Argument,StoredResult) :- !,
214 stored_memo_result3(ArgHash,Argument,StoredResult).
215 stored_memo_result_id(4,ArgHash,Argument,StoredResult) :- !,
216 stored_memo_result4(ArgHash,Argument,StoredResult).
217 stored_memo_result_id(5,ArgHash,Argument,StoredResult) :- !,
218 ? stored_memo_result5(ArgHash,Argument,StoredResult).
219 stored_memo_result_id(6,ArgHash,Argument,StoredResult) :- !,
220 ? stored_memo_result6(ArgHash,Argument,StoredResult).
221 stored_memo_result_id(7,ArgHash,Argument,StoredResult) :- !,
222 ? stored_memo_result7(ArgHash,Argument,StoredResult).
223 stored_memo_result_id(8,ArgHash,Argument,StoredResult) :- !,
224 ? stored_memo_result8(ArgHash,Argument,StoredResult).
225 stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult) :-
226 ? stored_memo_result(ArgHash,MemoID,Argument,StoredResult).
227
228 assert_stored_memo_result_id(1,ArgHash,Argument,StoredResult) :- !,
229 assertz(stored_memo_result1(ArgHash,Argument,StoredResult)).
230 assert_stored_memo_result_id(2,ArgHash,Argument,StoredResult) :- !,
231 assertz(stored_memo_result2(ArgHash,Argument,StoredResult)).
232 assert_stored_memo_result_id(3,ArgHash,Argument,StoredResult) :- !,
233 assertz(stored_memo_result3(ArgHash,Argument,StoredResult)).
234 assert_stored_memo_result_id(4,ArgHash,Argument,StoredResult) :- !,
235 assertz(stored_memo_result4(ArgHash,Argument,StoredResult)).
236 assert_stored_memo_result_id(5,ArgHash,Argument,StoredResult) :- !,
237 assertz(stored_memo_result5(ArgHash,Argument,StoredResult)).
238 assert_stored_memo_result_id(6,ArgHash,Argument,StoredResult) :- !,
239 assertz(stored_memo_result6(ArgHash,Argument,StoredResult)).
240 assert_stored_memo_result_id(7,ArgHash,Argument,StoredResult) :- !,
241 assertz(stored_memo_result7(ArgHash,Argument,StoredResult)).
242 assert_stored_memo_result_id(8,ArgHash,Argument,StoredResult) :- !,
243 assertz(stored_memo_result8(ArgHash,Argument,StoredResult)).
244 assert_stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult) :-
245 assertz(stored_memo_result(ArgHash,MemoID,Argument,StoredResult)).
246
247 retractall_stored_memo_result :-
248 retractall(stored_memo_result1(_,_,_)),
249 retractall(stored_memo_result2(_,_,_)),
250 retractall(stored_memo_result3(_,_,_)),
251 retractall(stored_memo_result4(_,_,_)),
252 retractall(stored_memo_result5(_,_,_)),
253 retractall(stored_memo_result6(_,_,_)),
254 retractall(stored_memo_result7(_,_,_)),
255 retractall(stored_memo_result8(_,_,_)),
256 retractall(stored_memo_result(_,_,_,_)).
257
258 % this clause is only ok if we have just a single function; otherwise we get collisions between different functions
259 compute_funcall_memo_hash(int(X),MemoID,R) :- MemoID <9, !,
260 R=X. % avoid computing hash for simple integer values; only drawback: indexing not good for too large integers
261 % TO DO: we could register with each registered_value fact also a dynamic table_memo fact
262 % then we can avoid clashes between different memoized functions
263 compute_funcall_memo_hash(X,MemoID,ArgHash) :-
264 compute_memo_hash((MemoID,X),ArgHash).
265
266
267 % --------------------------------------------
268
269 % last argument should be left free when calling
270 get_stored_memo_result(MemoID,Argument,ArgHash,StoredResult) :-
271 stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult),
272 %print(get_stored(MemoID,ArgHash,StoredResult)),nl,
273 count_reuse(MemoID).
274
275
276 :- use_module(kernel_waitflags,[add_wd_error_span/4]).
277 :- use_module(tools_strings,[ajoin/2]).
278 :- use_module(store,[normalise_value_for_var/3]).
279 store_memo_result(MemoID,Argument,ArgHash,Result,Span,WF) :-
280 normalise_value_for_var(MemoID,Result,NormResult),
281 store_norm_memo_result(MemoID,Argument,ArgHash,NormResult,Span,WF).
282
283 :- use_module(kernel_objects,[equal_object/2]).
284 store_norm_memo_result(MemoID,Argument,ArgHash,Result,Span,WF) :-
285 stored_memo_result_id(MemoID,ArgHash,Argument,StoredResult),
286 !,
287 (Result=StoredResult -> true
288 ; equal_object(Result,StoredResult) -> format('Two representations for memoized function (~w) result.~n',[MemoID])
289 ; ajoin(['Memoized function ',MemoID,' has multiple results for: '],Msg),
290 Relation = [(Argument,StoredResult),(Argument,Result)],
291 add_wd_error_span(Msg,'@fun'(Argument,Relation),Span,WF)
292 %,print('stored: '),translate:print_bvalue(StoredResult),nl,print('new: '),translate:print_bvalue(Result),nl
293 ).
294 store_norm_memo_result(MemoID,Argument,ArgHash,Result,_,_) :-
295 %format('Storing memo result for ~w, argument =',[MemoID]),
296 %translate:print_bvalue(Argument),nl, translate:print_bvalue(Result),nl,
297 assert_stored_memo_result_id(MemoID,ArgHash,Argument,Result).
298 %assertz(stored_memo_result(ArgHash,MemoID,Argument,Result)).
299 %print(stored_memo_result(ArgHash,MemoID,Argument,Result)),nl.
300
301
302 % function application for memoized function:
303 apply_to_memoize(MemoID,P,T,B,X,Y,Span,WF) :-
304 ground_value_check(X,XV),
305 ? block_apply_closure_memo_groundx(XV,MemoID,X,Y,P,T,B,raise_wd,Span,WF).
306
307 :- use_module(kernel_tools,[ground_value/1]).
308 :- use_module(kernel_objects,[equal_object_wf/3]).
309
310 :- block block_apply_closure_memo_groundx(-,?, ?,?, ?,?,?, ?,?,?),
311 block_apply_closure_memo_groundx(?,-, ?,?, ?,?,?, ?,?,?).
312
313
314 block_apply_closure_memo_groundx(_,MemoID, X,Y, P,T,B, RaiseWD, Span,WF) :-
315 % MemoID is ground, meaning body B is ground as well
316 % TODO: obtain stored value directly
317 compute_funcall_memo_hash(X,MemoID,ArgHash),
318 if(get_stored_memo_result(MemoID,X,ArgHash,StoredResult),
319 ? equal_object_wf(Y,StoredResult,WF),
320 (start_profile_function_application(MemoID,Timer),
321 ? if(check_element_of_function_closure_nowf(MemoID,X,ComputedResult,P,T,B,Span,WF),
322 % ground WF to compute ground value for ComputedResult
323 (stop_profile_function_application(MemoID,X,Timer,WF),
324 (ground_value(ComputedResult)
325 -> store_memo_result(MemoID,X,ArgHash,ComputedResult,Span,WF)
326 ; add_error_wf(memoization,'Could not compute ground value for function application',MemoID,Span,WF),
327 print('Argument: '),translate:print_bvalue(X),nl,
328 print('Result: '), print(ComputedResult),nl,
329 print('Function: '),registered_value(MemoID,_Name,FunValue), translate:print_bvalue(FunValue),nl,nl
330 ),
331 % To do: check if we compute two or more solutions for f(X) and add WD error
332 equal_object_wf(Y,ComputedResult,WF)
333 ),
334 (RaiseWD=raise_wd,
335 add_wd_error_span('function applied outside of domain (#8-Memo): ', '@fun'(X,closure(P,T,B)),Span,WF)
336 )
337 )
338 )
339 ).
340
341 :- use_module(kernel_waitflags, [init_wait_flags/2, init_wait_flags_and_push_call_stack/3,ground_wait_flags/1]).
342 :- use_module(custom_explicit_sets,[check_element_of_function_closure/6]).
343 check_element_of_function_closure_nowf(MemoID,X,ComputedResult,_,_,_,Span,OuterWF) :-
344 registered_value(MemoID,Name,closure(P,T,B)),!, % can be expensive if closure contains large values
345 init_wait_flags_and_push_call_stack(OuterWF,function_call(Name,X,Span),WF), % slows down test 1968 with recursion
346 check_element_of_function_closure(X,ComputedResult,P,T,B,WF),
347 ? ground_wait_flags(WF).
348 check_element_of_function_closure_nowf(_,X,ComputedResult,P,T,B,_Span,_OuterWF) :-
349 init_wait_flags(WF,[check_element_of_function_closure_nowf]),
350 check_element_of_function_closure(X,ComputedResult,P,T,B,WF),
351 ground_wait_flags(WF).
352
353 :- use_module(library(avl),[avl_domain/2]).
354 :- use_module(library(lists),[maplist/2]).
355
356 % store the complete expansion of a memoized function for later re-use
357 % and also passes result and done flag to an outer call
358 :- block store_memoization_closure_expansion(?,-,?,?,?,?,?).
359 store_memoization_closure_expansion(MemoID,_,Res,OuterDone,OuterRes,Span,WF) :-
360 my_avl_domain(Res,List),
361 !,
362 debug_println(19,storing_expansion_of_memoized_function(MemoID)),
363 (maplist(store_function_result(MemoID,Span,WF),List)
364 -> assertz(memoization_expansion_completed(MemoID))
365 ; add_internal_error(memoization,'Error storing expansion for memoized function:',MemoID,Span)),
366 equal_object_wf(Res,OuterRes,WF), OuterDone=true.
367 store_memoization_closure_expansion(MemoID,_,R,OuterDone,OuterRes,Span,WF) :-
368 add_warning_wf(memoization,'Cannot store expansion for memoized function:',MemoID:R,Span,WF),
369 equal_object_wf(R,OuterRes,WF), OuterDone=true.
370
371 my_avl_domain(avl_set(A),List) :- avl_domain(A,List).
372 my_avl_domain([],[]).
373
374 store_function_result(MemoID,Span,WF,(X,ComputedResult)) :-
375 compute_funcall_memo_hash(X,MemoID,ArgHash),
376 store_memo_result(MemoID,X,ArgHash,ComputedResult,Span,WF). % TO DO: we could use special version that also allows relations
377
378 :- use_module(kernel_objects,[equal_object_optimized_wf/4]).
379 % succeeds if function has been completely memoized and returns expansion
380 try_get_complete_memoization_expansion(MemoID,Result,WF) :-
381 memoization_expansion_completed(MemoID),
382 debug_println(19,recovering_full_value_for_memoized_function(MemoID)),
383 findall((X,Y),stored_memo_result_id(MemoID,_,X,Y),List), % probably not sorted !
384 equal_object_optimized_wf(List,Result,expand_normal_closure_memo,WF).
385
386 % always succeeds to obtain the full expansion; also stores it for reuse
387 :- block get_complete_memoization_expansion(-,?,?,?,?,?).
388 get_complete_memoization_expansion(MemoID,Result,Done,_,_PP,WF) :-
389 try_get_complete_memoization_expansion(MemoID,Cached,WF),
390 !,
391 Result=Cached, Done=true.
392 get_complete_memoization_expansion(MemoID,Result,Done,Span,PP,WF) :-
393 registered_value(MemoID,Name,Val), nonvar(Val),
394 !,
395 get_complete_memoization_expansion_aux(Val,MemoID,Name,Result,Done,Span,PP,WF).
396 get_complete_memoization_expansion(MemoID,_,_,Span,PP,WF) :-
397 add_error_wf(get_complete_memoization_expansion,'Memoized function ID not registered:',MemoID:PP,Span,WF),
398 fail.
399
400
401 get_complete_memoization_expansion_aux(Val,_MemoID,_,Result,Done,_Span,_PP,_WF) :- expanded_value(Val), !,
402 Result=Val,Done=true.
403 get_complete_memoization_expansion_aux(closure(P,T,B),MemoID,Name,Result,Done,Span,PP,WF) :- !,
404 debug_println(19,expanding_memoized_function(MemoID,PP)),
405 (custom_explicit_sets:is_infinite_or_very_large_closure(P,T,B,200000)
406 -> add_warning_wf(PP,'Expanding infinite or very large memoized function: ',Name,B,WF)
407 ? ; is_symbolic_closure(P,T,B)
408 -> add_message_wf(PP,'Fully expanding symbolic memoized function: ',Name,B,WF)
409 ; true),
410 % bsyntaxtree:check_used_ids_in_ast(B),
411 custom_explicit_sets:expand_normal_closure_direct(P,T,B,Expansion,DoneExp,WF),
412 store_memoization_closure_expansion(MemoID,DoneExp,Expansion,Done,Result,Span,WF).
413 get_complete_memoization_expansion_aux(Val,MemoID,Name,_,_,Span,PP,WF) :-
414 add_error_wf(memoization(PP),'Illegal value stored for memoized function:',MemoID:Name,Span,WF),
415 print(Val),nl,
416 fail.
417
418 expanded_value(avl_set(_)).
419 expanded_value(global_set(_)).
420 expanded_value([]).
421 expanded_value([_|_]).
422
423 :- use_module(kernel_tools,[ground_value/1]).
424 :- use_module(kernel_objects,[check_element_of_wf/3]).
425 % special treatment for element of memoization closure; possibly not a function call
426 element_of_memoization_closure(MemoID,Element,WF,P,T,B) :-
427 nonvar(Element), Element = (X,Y),
428 % we can do a function application; we assume that we only store functions
429 ground_value_check(X,GrX),
430 !, %print(fun_apply_reuse(MemoID,Element)),nl,
431 Span=B,
432 % do_not_raise_wd: do not raise outside of domain errors
433 block_apply_closure_memo_groundx(GrX,MemoID, X,Y, P,T,B, do_not_raise_wd, Span,WF).
434 element_of_memoization_closure(MemoID,Element,WF,_,_,B) :-
435 % TO DO: delay before computing complete memoization
436 get_complete_memoization_expansion(MemoID,Set,_Done,B,element_of_memoization_closure,WF),
437 !, %print(el_of(MemoID,Element)),nl,
438 check_element_of_wf(Element,Set,WF).
439
440 :- use_module(kernel_objects,[not_equal_object_wf/3]).
441 :- use_module(kernel_objects,[not_element_of_wf/3]).
442
443 not_element_of_memoization_closure(MemoID,Element,WF,P,T,B) :-
444 nonvar(Element), Element = (X,Y),
445 % we can do a function application; we assume that we only store functions
446 ground_value_check(X,GrX),
447 !,
448 block_not_apply_closure_memo_groundx(GrX,MemoID, X,Y, P,T,B, do_not_raise_wd, B,WF).
449 not_element_of_memoization_closure(MemoID,Element,WF,_,_,B) :-
450 % TO DO: delay before computing complete memoization
451 get_complete_memoization_expansion(MemoID,Set,_Done,B,not_element_of_memoization_closure,WF),
452 !,
453 not_element_of_wf(Element,Set,WF).
454
455
456 :- block block_not_apply_closure_memo_groundx(-,?, ?,?, ?,?,?, ?,?,?).
457
458 block_not_apply_closure_memo_groundx(GrX,MemoID, X,Y, P,T,B, RaiseWD, Span,WF) :-
459 if(block_apply_closure_memo_groundx(GrX,MemoID, X,YRes, P,T,B, RaiseWD, Span,WF),
460 not_equal_object_wf(Y,YRes,wf),
461 true).
462
463 % -------------------------------
464
465 :- dynamic function_application_time/2.
466 :- use_module(preferences,[preference/2,get_preference/2]).
467 :- load_files(library(system), [when(compile_time), imports([environ/2])]).
468 :- if(\+ environ(prob_profile,false)).
469 %:- print('Profiling Memoizations'),nl.
470 count_reuse(MemoID) :-
471 my_bb_get_reuse_counter(MemoID,Cnt), C1 is Cnt+1, bb_put(MemoID,C1),
472 inc_counter(memoization_function_reuse_counter,_).
473 my_bb_get_reuse_counter(Key,Val) :- (bb_get(Key,V) -> V=Val ; Val=0).
474 bb_reset_reuse_counter(Key) :- bb_put(Key,0).
475 start_profile_function_application(_,Walltime) :- preference(prob_profiling_on,false),!, Walltime=0.
476 start_profile_function_application(_,Walltime) :- statistics(walltime,[Walltime,_]).
477 :- use_module(probsrc(performance_messages),[perf_format_wf/3]).
478 stop_profile_function_application(_,_,_,_) :- preference(prob_profiling_on,false),!.
479 stop_profile_function_application(MemoID,X,Walltime1,WF) :- statistics(walltime,[Walltime2,_]),
480 Delta is Walltime2-Walltime1,
481 (Delta>0 ->
482 (Delta > 1000
483 -> perf_format_wf('Long /* @memo ~w */ function application : ~w ms : arg: ~w~n',[MemoID,Delta,X],WF) ; true),
484 (retract(function_application_time(MemoID,Old))
485 -> New is Old+Delta ; New = Delta),
486 assertz(function_application_time(MemoID,New))
487 ; true
488 ).
489 function_application_time_available :- get_preference(prob_profiling_on,true).
490 :- else.
491 count_reuse(_MemoID) :-
492 inc_counter(memoization_function_reuse_counter,_).
493 my_bb_get_reuse_counter(_,'?').
494 bb_reset_reuse_counter(_).
495 start_profile_function_application(_,0).
496 stop_profile_function_application(_,_,_,_).
497 function_application_time_available :- fail.
498 :- endif.
499
500 % -------------------------------
501 % utilities to profile expansions
502 :- public inc/1.
503 :- dynamic hash_count/2.
504 inc(Hash) :- (retract(hash_count(Hash,Nr)) -> N1 is Nr+1 ; N1 = 1), assertz(hash_count(Hash,N1)).
505 :- dynamic hash_time/2.
506 store_memo_computation_time(Hash,Time) :- % for closure expansions, not for funct. applications
507 retractall(hash_time(Hash,_)), assertz(hash_time(Hash,Time)).
508
509 % reused and walltime info requires prob_profile flag
510 tcltk_get_memo_profile_table(list([Header|Entries])) :-
511 Header = list(['ID','Name','Fully','Stored Values','Reused','Walltime (ms)']),
512 findall(Entry,get_memo_entry_info(Entry),Entries).
513
514 get_memo_entry_info(list([MemoID,Name,Complete,NrStored,ReuseCnt,Walltime])) :-
515 registered_value(MemoID,Name,_FunValue),
516 (memoization_expansion_completed(MemoID) -> Complete='true' ; Complete = 'false'),
517 get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt).
518
519 % get some profile info about a MemoID
520 get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt) :-
521 my_bb_get_reuse_counter(MemoID,ReuseCnt),
522 findall(1,stored_memo_result_id(MemoID,_Hash,_,_),Stored), length(Stored,NrStored),
523 (\+ function_application_time_available -> Walltime='?'
524 ; function_application_time(MemoID,Walltime) -> true ; Walltime=0).
525
526
527 print_memo_profile :-
528 ((stored_memo_expansion(_,_,_) ; registered_value_packed(_,_,_))
529 -> print('MEMO Table:'),nl,
530 print_memo_table
531 ; true).
532
533 :- use_module(library(terms), [term_size/2]).
534 % memoization:print_memo.
535 print_memo_table :-
536 stored_memo_expansion(Hash,LookupTerm,PackedValue),
537 (hash_count(Hash,Count) -> print(Count), print(' : ') ; true),
538 (hash_time(Hash,Time) -> print(Time),print(' --> ') ; true),
539 print_memo_entry(LookupTerm),
540 nl, print(' : '),translate:print_bvalue(PackedValue),nl,fail.
541 print_memo_table :-
542 debug_mode(on),
543 registered_value(MemoID,Name,FunValue),
544 (memoization_expansion_completed(MemoID)
545 -> Compl=' (completely evaluated)' ; Compl=''),
546 format('MemoID ~w stored FUNCTION ~w~w ',[MemoID,Name,Compl]),
547 nl, print(' : '),translate:print_bvalue(FunValue),nl,fail.
548 print_memo_table :-
549 debug_mode(on),
550 registered_value_name(MemoID,Name),
551 stored_memo_result_id(MemoID,_Hash,LookupTerm,PackedValue),
552 term_size(LookupTerm,LSz),
553 format('MemoID ~w (~w) result for argument (size=~w) ',[MemoID,Name,LSz]),
554 print_memo_entry(LookupTerm),
555 term_size(PackedValue,PSz),
556 format('~n : (size=~w) ',[PSz]),translate:print_bvalue(PackedValue),nl,fail.
557 print_memo_table :-
558 stored_memo_result(Hash,MemoID1,T1,_),
559 stored_memo_result(Hash,MemoID2,T2,_),
560 dif((MemoID1,T1),(MemoID2,T2)),
561 format('Hash COLLISION ~w, ~w:~w vs ~w:~w~n',[Hash,MemoID1,T1,MemoID2,T2]),
562 fail.
563 print_memo_table :- format('Summary of reuse per memoization ID:~n',[]),
564 registered_value_name(MemoID,Name),
565 get_memo_profile_info(MemoID,NrStored,Walltime,ReuseCnt),
566 format('MemoID ~w (~w) : Values Stored: ~w (~w ms to compute), Reused ~w~n',[MemoID,Name,NrStored,Walltime,ReuseCnt]),
567 fail.
568 print_memo_table :- get_counter(memoization_hash_counter,Hash),
569 get_counter(memoization_reuse_counter,RHit),
570 format('Hashes computed: ~w, expansions reused: ~w~n',[Hash,RHit]),
571 get_counter(memoization_function_counter,F),
572 get_counter(memoization_function_reuse_counter,FR),
573 format('Memoization functions registered: ~w, results reused: ~w~n',[F,FR]).
574
575 print_memo_entry(closure(Parameters,ParameterTypes,ClosureBody)) :- !,
576 translate:print_bvalue(closure(Parameters,ParameterTypes,ClosureBody)).
577 print_memo_entry(closure1_for_explicit_set(A)) :- !,
578 print('closure1('),translate:print_bvalue(avl_set(A)), print(')').
579 print_memo_entry(A) :- translate:print_bvalue(A).
580
581 :- use_module(extension('counter/counter'),[counter_init/0, reset_counter/1,
582 new_counter/1, inc_counter/2,
583 get_counter/2]).
584 init_memo_table :-
585 counter_init,
586 new_counter(memoization_reuse_counter), new_counter(memoization_hash_counter),
587 new_counter(memoization_function_counter), new_counter(memoization_function_reuse_counter),
588 reset_memo_table.
589
590 reset_memo_table :-
591 ? retract(registered_value_packed(MemoID,_,_)),
592 bb_reset_reuse_counter(MemoID),
593 retract(registered_value_name(MemoID,_)),
594 fail.
595 reset_memo_table :-
596 reset_counter(memoization_reuse_counter),
597 reset_counter(memoization_hash_counter),
598 reset_counter(memoization_function_counter),
599 reset_counter(memoization_function_reuse_counter),
600 ? (stored_memo_expansion(_,_,_) -> debug_println(19,'Resetting MEMO table') ; true),
601 retractall(hash_count(_,_)),
602 retractall(hash_time(_,_)),
603 retractall(stored_memo_expansion(_,_,_)),
604 retractall(registered_value_packed(_,_,_)),
605 retractall(registered_value_name(_,_)),
606 retractall(function_application_time(_,_)),
607 retractall(memoization_expansion_completed(_)),
608 retractall(stored_lambda_value_domain(_,_,_)),
609 retractall_stored_memo_result,
610 reset_cogen.
611
612 :- use_module(probsrc(tools),[retract_with_statistics/2]).
613 reset_memo_with_statistics :-
614 ? retract_with_statistics(memoization,
615 [stored_memo_expansion(_,_,_),
616 registered_value_packed(_,_,_),registered_value_name(_,_,_),
617 memoization_expansion_completed(_),
618 stored_lambda_value_domain(_,_,_),
619 stored_memo_result1(_,_,_), stored_memo_result2(_,_,_),
620 stored_memo_result3(_,_,_), stored_memo_result4(_,_,_),
621 stored_memo_result5(_,_,_), stored_memo_result6(_,_,_),
622 stored_memo_result7(_,_,_), stored_memo_result8(_,_,_),
623 stored_memo_result(_,_,_,_)]),
624 reset_memo_table.
625