1		% (c) 2012-2025 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		:- module(external_functions,[call_external_function/7, call_external_predicate/8,
6		call_external_substitution/6,
7		reset_external_functions/0,
8		print_external_function_instantiation_profile/0,
9		external_pred_always_true/1,
10		reset_side_effect_occurred/0,
11		side_effect_occurred/1,
12		performs_io/1, not_declarative/1,
13		is_external_function_name/1,
14		get_external_function_type/3, % version with types with Prolog variables
15		external_fun_type/3,
16		external_subst_enabling_condition/3,
17		external_fun_has_wd_condition/1,
18		external_fun_can_be_inverted/1,
19		external_function_requires_state/1,
20		expects_unevaluated_args/1,
21		do_not_evaluate_args/1,
22		reset_argv/0, set_argv_from_list/1, set_argv_from_atom/1,
23		set_current_state_for_external_fun/1, clear_state_for_external_fun/0,
24
25		observe_parameters/2, observe_state/1, observe_value/2
26		]).
27
28		% Note: there is also the predicate external_procedure_used/1 in bmachine_construction
29
30		:- use_module(error_manager).
31		:- use_module(self_check).
32		:- use_module(library(avl)).
33		:- use_module(library(lists)).
34		:- use_module(translate).
35
36		% TO DO: add external Prolog files
37		% Should we do auto-conversion of B to Prolog types ,... ?
38
39		:- use_module(kernel_waitflags).
40		:- use_module(debug).
41		:- use_module(bsyntaxtree).
42		:- use_module(custom_explicit_sets).
43
44		:- use_module(module_information,[module_info/2]).
45		:- module_info(group,external_functions).
46		:- module_info(description,'This module provides a way to call external functions and predicates.').
47
48		:- set_prolog_flag(double_quotes, codes).
49
50		:- dynamic side_effect_occurred/1.
51		% TRUE if a side effect has occured
52		% possible values (user_output, file)
53	?	reset_side_effect_occurred :- (retract(side_effect_occurred(_)) -> retractall(side_effect_occurred(_)) ; true).
54		assert_side_effect_occurred(Location) :-
55		(side_effect_occurred(Location) -> true ; assertz(side_effect_occurred(Location))).
56
57		:- discontiguous expects_waitflag/1.
58		:- discontiguous expects_spaninfo/1.
59		:- discontiguous expects_type/1. % only used for external functions, not predicates or subst
60		:- discontiguous performs_io/1.
61		:- discontiguous is_not_declarative/1. % does not perform io but is still not declarative, e.g., has hidden args
62		:- discontiguous does_not_modify_state/1.
63		:- discontiguous expects_unevaluated_args/1.
64		:- discontiguous do_not_evaluate_args/1. % currently only used for external predicates, not for functions
65		:- discontiguous expects_state/1. % currently only used for external predicates
66		:- discontiguous external_pred_always_true/1. % external predicates which are always true
67		:- discontiguous external_subst_enabling_condition/3. % external predicates which are always true
68		:- discontiguous external_fun_has_wd_condition/1.
69		:- discontiguous external_fun_can_be_inverted/1.
70		:- discontiguous external_function_requires_state/1. % true if the function/predicate works on the current state in the state space
71		:- discontiguous external_fun_type/3. % external_fun_type(FUN,ListOfTypeParameters,ListOfArgTypes); also applicable to external predicates
72
73		:- meta_predicate safe_call(0,-,-).
74		:- meta_predicate safe_call(0,-).
75
76		:- meta_predicate observe_ground(-,-,-,-,-,0).
77
78		not_declarative(FunName) :- if(performs_io(FunName),true,is_not_declarative(FunName)).
79
80		is_external_function_name(Name) :- if(external_fun_type(Name,_,_),true,
81		if(expects_waitflag(Name),true,
82		if(expects_spaninfo(Name),true,
83		if(external_subst_enabling_condition(Name,_,_),true,
84		if(not_declarative(Name),true,
85		if(expects_unevaluated_args(Name),true,fail)
86		))))).
87
88
89		:- use_module(state_space,[current_state_id/1, get_current_context_state/1]).
90		:- dynamic current_state_id_for_external_fun/1.
91		% some external functions access the current state; here we can set a particular state, without changing the animator/state_space
92		% useful, e.g., when exporting a VisB HTML trace when the JSON glue file uses ENABLED
93		% TODO: some commands also access the history;
94
95		% we use this rather than set_context_state because this would lead to errors being stored in the state_space
96		set_current_state_for_external_fun(ID) :-
97		asserta(current_state_id_for_external_fun(ID)).
98
99		clear_state_for_external_fun :-
100		(retract(current_state_id_for_external_fun(_)) -> true ; format('No state for external functions stored!~n',[])).
101
102		get_current_state_id(ID) :-
103		(current_state_id_for_external_fun(CID) -> ID=CID
104		; state_space:get_current_context_state(CID) -> ID=CID
105		; current_state_id(ID)).
106
107		% get current history without root (and without current state id)
108		get_current_history(History,Span) :-
109		history(RH),!,
110		(state_space:get_current_context_state(CID),
111		(current_state_id(CID)
112		-> RH=[Last|_], \+ state_space:transition(Last,CID,_) % something wrong, this cannot be last state of history
113		; true % the history was not made for context state CID
114		),
115		append(_,[CID|RH2],RH) % stop at CID which is being set; not a perfect solution; CID could occur multiple times!
116		-> true
117		; RH2=RH),
118		(RH2=[] -> History=[]
119		; reverse(RH2,[root|HH]) -> History = HH
120		; add_message(external_functions,'HISTORY does not start with root:',RH2,Span), % from ProB2: fix
121		reverse(RH2,History)
122		).
123		get_current_history(History,Span) :- add_message(external_functions,'No HISTORY available','',Span), History=[].
124
125		:- use_module(runtime_profiler,[profile_single_call/4]).
126
127		:- assert_must_succeed(( external_functions:call_external_function('COS',[b(integer(0),integer,[])],
128		[int(0)],int(100),integer,unknown,_WF) )).
129		:- assert_must_succeed(( external_functions:call_external_function('SIN',[b(integer(0),integer,[])],
130		[int(0)],int(0),integer,unknown,_WF) )).
131		% first a few hard-wired external functions for efficiency:
132		call_external_function('COS',_,[X],Value,_,_,_WF) :- !, 'COS'(X,Value). % already use safe_is
133		call_external_function('SIN',_,[X],Value,_,_,_WF) :- !, 'SIN'(X,Value).
134		call_external_function('TAN',_,[X],Value,_,_,_WF) :- !, 'TAN'(X,Value).
135		%call_external_function('STRING_APPEND',_,[A,B],Value,_,_,WF) :- !, 'STRING_APPEND'(A,B,Value,WF). % do we need safe_call?
136		%call_external_function('STRING_LENGTH',_,[A],Value,_,_,_WF) :- !, 'STRING_LENGTH'(A,Value).
137		% now the generic case:
138		call_external_function(F,Args,EvaluatedArgs,Value,Type,SpanInfo,WF) :-
139		(expects_waitflag(F)
140		-> E1=[WF],
141		(expects_spaninfo(F) -> E2=[SpanInfo|E1] ; E2=E1)
142		; E1=[],
143		(expects_spaninfo(F) -> add_call_stack_to_span(SpanInfo,WF,S2), E2=[S2|E1] ; E2=E1)
144		),
145		(expects_unevaluated_args(F) -> E3=[Args|E2] ; E3=E2),
146		(expects_type(F) -> E4=[Type|E3] ; E4=E3),
147		append(EvaluatedArgs,[Value|E4],AV),
148		% Check if there is better way to do this
149		Call =.. [F|AV],
150		% print('EXTERNAL FUNCTION CALL: '), print(F), print(' '), print(Call),nl,
151		% we could pass get_current_state_id(.) instead of unknown
152	?	profile_single_call(F,external_functions,unknown,safe_call(Call,SpanInfo,WF))
153		%, print(result(Value)),nl.
154		.
155
156		call_external_predicate(F,Args,EvaluatedArgs,LocalState,State,PREDRES,SpanInfo,WF) :-
157		(expects_waitflag(F)
158		-> E1=[WF],
159		(expects_spaninfo(F) -> E2=[SpanInfo|E1] ; E2=E1)
160		; E1=[],
161		(expects_spaninfo(F) -> add_call_stack_to_span(SpanInfo,WF,S2), E2=[S2|E1] ; E2=E1)
162		),
163		(expects_unevaluated_args(F) -> E3=[Args|E2] ; E3=E2),
164		(expects_state(F) -> E4=[LocalState,State|E3] ; E4=E3),
165		append(EvaluatedArgs,[PREDRES|E4],AV),
166		Call =.. [F|AV],
167		% print('EXTERNAL PREDICATE CALL: '), print(Call),nl, %%
168	?	profile_single_call(F,external_functions,unknown,safe_call(Call,SpanInfo,WF)).
169
170		call_external_substitution(FunName,Args,InState,OutState,Info,WF) :-
171		% TO DO: signal if substitution can be backtracked
172		get_wait_flag_for_subst(FunName,WF,Flag),
173		(does_not_modify_state(FunName) -> OutState=[] ; OutState = OutState2),
174		call_external_substitution2(Flag,FunName,Args,InState,OutState2,Info,WF).
175
176		get_wait_flag_for_subst(FunName,WF,Flag) :- perform_directly(FunName),!,
177		get_wait_flag1(WF,Flag). % ensure that precondition, ... have been evaluated
178		get_wait_flag_for_subst(FunName,WF,Flag) :- performs_io(FunName),!,
179		get_enumeration_finished_wait_flag(WF,Flag). % ensure that precondition, ... have been evaluated
180		% get_enumeration_starting_wait_flag(external(FunName),WF,Flag).
181		get_wait_flag_for_subst(FunName,WF,Flag) :- get_binary_choice_wait_flag(external(FunName),WF,Flag).
182
183		:- block call_external_substitution2(-,?,?,?,?,?,?).
184		call_external_substitution2(_,F,Args,InState,OutState,SpanInfo,WF) :-
185		(expects_waitflag(F) -> E1=[WF] ; E1=[]),
186		(expects_spaninfo(F) -> E2=[SpanInfo|E1] ; E2=E1),
187		append(Args,[InState,OutState|E2],AV),
188		Call =.. [F|AV],
189		% print('EXTERNAL SUBSTITUTION CALL: '), print(Call),nl, %%
190	?	profile_single_call(F,external_functions,unknown,safe_call(Call,SpanInfo,WF)).
191
192	?	safe_call(X,SpanInfo) :- safe_call(X,SpanInfo,no_wf_available).
193		safe_call(X,SpanInfo,WF) :-
194	?	catch(call(X), Exception, add_exception_error(Exception,X,SpanInfo,WF)).
195
196		safe_is(Context,X,Y,Span) :- safe_is(Context,X,Y,Span,no_wf_available).
197		safe_is(Context,X,Y,Span,WF) :- % print(safe_is(Context,X,Y)),nl,
198		catch(X is Y, Exception, add_exception_error(Exception,Context,Span,WF)). %, print(res(X)),nl.
199
200		add_exception_error(Exception,Context,Span,WF) :-
201		get_function_call_info(Context,SimplifiedContext),
202		add_exception_error2(Exception,SimplifiedContext,Span,WF),
203		(debug:debug_mode(on) -> tools_printing:print_term_summary(Context),nl ; true).
204
205		get_function_call_info(external_functions:X,Func) :- nonvar(X),!,functor(X,Func,_Arity).
206		get_function_call_info(M:X,M:Func) :- nonvar(X),!,functor(X,Func,_Arity).
207		get_function_call_info(X,X).
208
209		:- use_module(kernel_waitflags,[add_error_wf/5, add_warning_wf/5,add_wd_error_span/4]).
210		add_exception_error2(error(existence_error(procedure,external_functions:FUN),_),_X,SpanInfo,WF) :- !,
211		add_error_wf(external_functions,
212		'EXTERNAL function does not exist (check that you have an up-to-date version of ProB):',FUN,SpanInfo,WF),
213		fail.
214		add_exception_error2(error(existence_error(procedure,MODULE:FUN),_),_X,SpanInfo,WF) :- !,
215		add_error_wf(external_functions,'Predicate called by EXTERNAL function does not exist:',MODULE:FUN,SpanInfo,WF),
216		fail.
217		add_exception_error2(error(undefined,ERR),X,SpanInfo,WF) :-
218		is_error(ERR,ExprTerm),!,
219		ajoin(['Arithmetic operation ',X,' not defined:'],Msg),
220		add_error_wf(external_functions,Msg,ExprTerm,SpanInfo,WF),
221		fail.
222		add_exception_error2(error(evaluation_error(undefined),ERR),X,SpanInfo,WF) :-
223		is_error(ERR,ExprTerm),!,
224		ajoin(['Arithmetic operation ',X,' not defined for given argument(s):'],Msg),
225		add_wd_error_span(Msg,ExprTerm,SpanInfo,WF).
226		add_exception_error2(error(evaluation_error(zero_divisor),ERR),X,SpanInfo,WF) :-
227		is_error(ERR,_),!,
228		% TO DO: use add_wd_error_set_result:
229		add_wd_error_span('Division by 0 in arithmetic operation: ',X,SpanInfo,WF).
230		add_exception_error2(error(existence_error(source_sink,File),Err2),X,SpanInfo,WF) :- !,
231		(arg(1,Err2,Call), get_file_open_mode(Call,append)
232		-> ajoin(['File does not exist and cannot be created (calling external function ',X,'):'],Msg)
233		; arg(1,Err2,Call), get_file_open_mode(Call,write)
234		-> ajoin(['File cannot be created (calling external function ',X,'):'],Msg)
235		; ajoin(['File does not exist (calling external function ',X,'):'],Msg)
236		),
237		add_error_wf(external_functions,Msg,File,SpanInfo,WF),
238		fail.
239		add_exception_error2(error(consistency_error(Msg,_,format_arguments),_),_X,SpanInfo,WF) :- !,
240		add_error_wf(external_functions,'Illegal format string (see SICStus Prolog reference manual for syntax):',Msg,SpanInfo,WF),
241		fail.
242		add_exception_error2(enumeration_warning(A,B,C,D,E),X,SpanInfo,WF) :-
243		Exception = enumeration_warning(A,B,C,D,E),!,
244		debug_println(20,Exception),
245		get_predicate_name(X,Pred),
246		add_warning_wf(external_functions,'Enumeration warning occured while calling external function: ',Pred,SpanInfo,WF),
247		% or should we just print a message on the console ?
248		% or use
249		throw(Exception).
250		add_exception_error2(user_interrupt_signal,X,SpanInfo,WF) :- !,
251		get_predicate_name(X,Pred),
252		add_warning_wf(external_functions,'User Interrupt during external function evaluation: ',Pred,SpanInfo,WF),
253		throw(user_interrupt_signal).
254		add_exception_error2(Exception,X,SpanInfo,WF) :-
255		debug_println(20,Exception),
256		ajoin(['Exception occurred while calling external function ',X,':'],Msg),
257		add_error_wf(external_functions,Msg,Exception,SpanInfo,WF),
258		fail.
259
260		% get file open mode from a SICStus library call (e.g., that caused an existence_error exception)
261		get_file_open_mode(open(_File,Mode,_,_),Mode).
262		get_file_open_mode(open(_File,Mode,_),Mode).
263
264		get_predicate_name(Var,P) :- var(Var),!,P='_VAR_'.
265		get_predicate_name(external_functions:C,P) :- !, get_predicate_name(C,P).
266		get_predicate_name(Module:C,Module:P) :- !, get_predicate_name(C,P).
267		get_predicate_name(Call,F/P) :- functor(Call,F,P).
268
269		is_error(evaluation_error('is'(_,ExprTerm),2,_,_),ExprTerm).
270		is_error(domain_error('is'(_,ExprTerm),2,_,_),ExprTerm).
271
272		get_external_function_type(FunName,ArgTypes,ReturnType) :-
273		external_fun_type(FunName,TypeParas,AllTypes),
274		(member(TP,TypeParas),nonvar(TP)
275		-> add_internal_error('External function type parameter not a variable:,',
276		external_fun_type(FunName,TypeParas,AllTypes))
277		; true
278		),
279		append(ArgTypes,[ReturnType],AllTypes).
280
281		% STANDARD EXTERNAL FUNCTIONS
282
283
284		% -------------------------------
285
286
287		:- use_module(extrasrc(external_functions_reals)). % removed explicit imports for Spider
288
289
290		expects_waitflag('STRING_TO_REAL').
291		external_fun_type('STRING_TO_REAL',[],[string,real]).
292
293		expects_waitflag('RADD').
294		external_fun_type('RADD',[],[real,real,real]).
295		expects_waitflag('RSUB').
296		external_fun_type('RSUB',[],[real,real,real]).
297		expects_waitflag('RMUL').
298		external_fun_type('RMUL',[],[real,real,real]).
299		expects_waitflag('RDIV').
300		expects_spaninfo('RDIV').
301		external_fun_type('RDIV',[],[real,real,real]).
302		external_fun_has_wd_condition('RDIV').
303		expects_waitflag('RINV').
304		expects_spaninfo('RINV').
305		external_fun_type('RINV',[],[real,real]).
306		external_fun_has_wd_condition('RINV').
307
308		external_fun_type('RPI',[],[real]).
309		external_fun_type('RZERO',[],[real]).
310		external_fun_type('RONE',[],[real]).
311		external_fun_type('REULER',[],[real]).
312		external_fun_type('REPSILON',[],[real]).
313		external_fun_type('RMAXFLOAT',[],[real]).
314
315		external_fun_type('RSIN',[],[real,real]).
316		expects_waitflag('RSIN').
317		external_fun_type('RCOS',[],[real,real]).
318		expects_waitflag('RCOS').
319		external_fun_type('RTAN',[],[real,real]).
320		expects_waitflag('RTAN').
321		external_fun_type('RCOT',[],[real,real]).
322		expects_waitflag('RCOT').
323		external_fun_type('RSINH',[],[real,real]).
324		expects_waitflag('RSINH').
325		external_fun_type('RCOSH',[],[real,real]).
326		expects_waitflag('RCOSH').
327		external_fun_type('RTANH',[],[real,real]).
328		expects_waitflag('RTANH').
329		external_fun_type('RCOTH',[],[real,real]).
330		expects_waitflag('RCOTH').
331		external_fun_type('RASIN',[],[real,real]).
332		expects_waitflag('RASIN').
333		external_fun_type('RACOS',[],[real,real]).
334		expects_waitflag('RACOS').
335		external_fun_type('RATAN',[],[real,real]).
336		expects_waitflag('RATAN').
337		external_fun_type('RACOT',[],[real,real]).
338		expects_waitflag('RACOT').
339		external_fun_type('RASINH',[],[real,real]).
340		expects_waitflag('RASINH').
341		external_fun_type('RACOSH',[],[real,real]).
342		expects_waitflag('RACOSH').
343		external_fun_type('RATANH',[],[real,real]).
344		expects_waitflag('RATANH').
345		external_fun_type('RACOTH',[],[real,real]).
346		expects_waitflag('RACOTH').
347		external_fun_type('RATAN2',[],[real,real,real]).
348		expects_waitflag('RATAN2').
349		expects_spaninfo('RATAN2').
350		external_fun_type('RHYPOT',[],[real,real,real]).
351		expects_waitflag('RHYPOT').
352		expects_spaninfo('RHYPOT').
353		external_fun_type('RADIANS',[],[real,real]).
354		expects_waitflag('RADIANS').
355		expects_spaninfo('RADIANS').
356		external_fun_type('DEGREE',[],[real,real]).
357		expects_waitflag('DEGREE').
358		expects_spaninfo('DEGREE').
359
360
361		external_fun_type('RUMINUS',[],[real,real]).
362		expects_waitflag('RUMINUS').
363		external_fun_type('REXP',[],[real,real]).
364		expects_waitflag('REXP').
365		external_fun_type('RLOGe',[],[real,real]).
366		expects_waitflag('RLOGe').
367		expects_spaninfo('RLOGe').
368		external_fun_has_wd_condition('RLOGe').
369		external_fun_type('RSQRT',[],[real,real]).
370		expects_waitflag('RSQRT').
371		expects_spaninfo('RSQRT').
372		external_fun_has_wd_condition('RSQRT'). % for negative numbers obviously
373		external_fun_type('RABS',[],[real,real]).
374		expects_waitflag('RABS').
375		external_fun_type('ROUND',[],[real,integer]).
376		expects_waitflag('ROUND').
377		external_fun_type('RSIGN',[],[real,real]).
378		expects_waitflag('RSIGN').
379		external_fun_type('RINTEGER',[],[real,real]).
380		expects_waitflag('RINTEGER').
381		external_fun_type('RFRACTION',[],[real,real]).
382		expects_waitflag('RFRACTION').
383
384		expects_waitflag('RMAX').
385		expects_spaninfo('RMAX').
386		external_fun_type('RMAX',[],[real,real,real]).
387		expects_waitflag('RMIN').
388		expects_spaninfo('RMIN').
389		external_fun_type('RMIN',[],[real,real,real]).
390		expects_spaninfo('RPOW').
391		expects_waitflag('RPOW').
392		external_fun_type('RPOW',[],[real,real,real]).
393		external_fun_has_wd_condition('RPOW'). % for negative numbers, e.g., RPOW(-1.0,1.1) or RPOW(-1.0,0.5)
394		expects_spaninfo('RDECIMAL').
395		expects_waitflag('RDECIMAL').
396		external_fun_type('RDECIMAL',[],[integer,integer,real]).
397		expects_waitflag('RLOG').
398		expects_spaninfo('RLOG').
399		external_fun_type('RLOG',[],[real,real,real]).
400		external_fun_has_wd_condition('RLOG').
401
402		expects_waitflag('RLT').
403		external_fun_type('RLT',[],[real,real,boolean]).
404		expects_waitflag('REQ').
405		external_fun_type('REQ',[],[real,real,boolean]).
406		expects_waitflag('RNEQ').
407		external_fun_type('RNEQ',[],[real,real,boolean]).
408		expects_waitflag('RLEQ').
409		external_fun_type('RLEQ',[],[real,real,boolean]).
410		expects_waitflag('RGT').
411		external_fun_type('RGT',[],[real,real,boolean]).
412		expects_waitflag('RGEQ').
413		external_fun_type('RGEQ',[],[real,real,boolean]).
414		expects_waitflag('RMAXIMUM').
415		expects_spaninfo('RMAXIMUM').
416		external_fun_type('RMAXIMUM',[],[set(real),real]).
417		external_fun_has_wd_condition('RMAXIMUM'). % empty set or unbounded set
418		expects_waitflag('RMINIMUM').
419		expects_spaninfo('RMINIMUM').
420		external_fun_type('RMINIMUM',[],[set(real),real]).
421		external_fun_has_wd_condition('RMINIMUM'). % empty set or unbounded set
422
423		external_fun_type('RNEXT',[],[real,real]).
424		external_fun_type('RPREV',[],[real,real]).
425
426
427		% -------------------------------
428
429		external_fun_type('SFADD16',[],[real,real,real]).
430		external_fun_type('SFSUB16',[],[real,real,real]).
431		external_fun_type('SFMUL16',[],[real,real,real]).
432		external_fun_type('SFDIV16',[],[real,real,real]).
433		external_fun_type('SFSQRT16',[],[real,real]).
434		external_fun_type('SFMULADD16',[],[real,real,real,real]).
435		external_fun_type('SFADD32',[],[real,real,real]).
436		external_fun_type('SFSUB32',[],[real,real,real]).
437		external_fun_type('SFMUL32',[],[real,real,real]).
438		external_fun_type('SFDIV32',[],[real,real,real]).
439		external_fun_type('SFSQRT32',[],[real,real]).
440		external_fun_type('SFMULADD32',[],[real,real,real,real]).
441		external_fun_type('SFADD64',[],[real,real,real]).
442		external_fun_type('SFSUB64',[],[real,real,real]).
443		external_fun_type('SFMUL64',[],[real,real,real]).
444		external_fun_type('SFDIV64',[],[real,real,real]).
445		external_fun_type('SFSQRT64',[],[real,real]).
446		external_fun_type('SFMULADD64',[],[real,real,real,real]).
447		external_fun_type('SFADD80',[],[couple(int,int),couple(int,int),couple(int,int)]).
448		external_fun_type('SFSUB80',[],[couple(int,int),couple(int,int),couple(int,int)]).
449		external_fun_type('SFMUL80',[],[couple(int,int),couple(int,int),couple(int,int)]).
450		external_fun_type('SFDIV80',[],[couple(int,int),couple(int,int),couple(int,int)]).
451		external_fun_type('SFSQRT80',[],[couple(int,int),couple(int,int)]).
452		external_fun_type('SFADD128',[],[couple(int,int),couple(int,int),couple(int,int)]).
453		external_fun_type('SFSUB128',[],[couple(int,int),couple(int,int),couple(int,int)]).
454		external_fun_type('SFMUL128',[],[couple(int,int),couple(int,int),couple(int,int)]).
455		external_fun_type('SFDIV128',[],[couple(int,int),couple(int,int),couple(int,int)]).
456		external_fun_type('SFSQRT128',[],[couple(int,int),couple(int,int)]).
457		external_fun_type('SFMULADD128',[],[couple(int,int),couple(int,int),couple(int,int),couple(int,int)]).
458
459		% -------------------------------
460
461		:- use_module(extrasrc(external_functions_svg)). %, [svg_points/4, svg_train/8, svg_car/8, svg_axis/7, svg_set_polygon/7]).
462
463		expects_waitflag('svg_points').
464		expects_spaninfo('svg_points').
465		external_fun_type('svg_points',[T1,T2],[seq(couple(T1,T2)),string]). % T1, T2 should be numbers
466
467		expects_waitflag('svg_train').
468		expects_spaninfo('svg_train').
469		external_fun_type('svg_train',[T1,T2],[T1,T1,T2,T2,T2,string]). % T1, T2 should be numbers
470		expects_waitflag('svg_car').
471		expects_spaninfo('svg_car').
472		external_fun_type('svg_car',[T1,T2],[T1,T1,T2,T2,T2,string]). % T1, T2 should be numbers
473
474		expects_waitflag('svg_axis').
475		expects_spaninfo('svg_axis').
476		external_fun_type('svg_axis',[T1,T2],[set(T1),T2,T2,T2,string]). % T1, T2 should be numbers
477
478		expects_waitflag('svg_set_polygon').
479		expects_spaninfo('svg_set_polygon').
480		external_fun_type('svg_set_polygon',[T2],[set(integer),T2,T2,T2,string]). % T2 should be number type
481
482		expects_waitflag('svg_set_polygon_auto').
483		expects_spaninfo('svg_set_polygon_auto').
484		external_fun_type('svg_set_polygon_auto',[T2],[set(integer),T2,T2,string]). % T2 should be number type
485
486		expects_waitflag('svg_dasharray_for_intervals').
487		expects_spaninfo('svg_dasharray_for_intervals').
488		external_fun_type('svg_dasharray_for_intervals',[T1,T2],[set(couple(T1,T2)),string]). % T1, T2 should be numbers
489
490		expects_waitflag('svg_set_dasharray').
491		expects_spaninfo('svg_set_dasharray').
492		external_fun_type('svg_set_dasharray',[],[set(integer),string]).
493
494		% -------------------------------
495
496		% MATHEMATICAL FUNCTIONS
497
498		external_fun_type('COS',[],[integer,integer]).
499		:- public 'COS'/2.
500		:- block 'COS'(-,?). % redundant; we could add CLPFD constraints for R
501		'COS'(int(X),int(R)) :- cos2(100,X,R,unknown).
502		external_fun_type('COSx',[],[integer,integer,integer]).
503		expects_spaninfo('COSx').
504		:- public 'COSx'/4.
505		:- block 'COSx'(-,?,?,?),'COSx'(?,-,?,?).
506		'COSx'(int(PrecisionMultiplier),int(X),int(R),Span) :- cos2(PrecisionMultiplier,X,R,Span).
507		:- block cos2(-,?,?,?),cos2(?,-,?,?).
508		cos2(Multiplier,X,R,Span) :- safe_is('COSx',R,round(Multiplier*cos(X/Multiplier)),Span).
509
510		external_fun_type('SIN',[],[integer,integer]).
511		:- public 'SIN'/2.
512		:- block 'SIN'(-,?). % redundant; we could add CLPFD constraints for R
513		'SIN'(int(X),int(R)) :- sin2(100,X,R,unknown).
514		external_fun_type('SINx',[],[integer,integer,integer]).
515		expects_spaninfo('SINx').
516		:- public 'SINx'/4.
517		:- block 'SINx'(-,?,?,?),'SINx'(?,-,?,?).
518		'SINx'(int(PrecisionMultiplier),int(X),int(R),Span) :- %print('SINx'(PrecisionMultiplier,X,R)),nl,
519		sin2(PrecisionMultiplier,X,R,Span).
520		:- block sin2(-,?,?,?),sin2(?,-,?,?).
521		sin2(Multiplier,X,R,Span) :- safe_is('SINx',R,round(Multiplier*sin(X/Multiplier)),Span).
522
523		external_fun_type('TAN',[],[integer,integer]).
524		:- public 'TAN'/2.
525		:- block 'TAN'(-,?). % redundant; we could add CLPFD constraints for R
526		'TAN'(int(X),int(R)) :- tan2(100,X,R,unknown).
527		external_fun_type('TANx',[],[integer,integer,integer]).
528		expects_spaninfo('TANx').
529		:- public 'TANx'/4.
530		:- block 'TANx'(-,?,?,?),'TANx'(?,-,?,?).
531		'TANx'(int(PrecisionMultiplier),int(X),int(R),Span) :- tan2(PrecisionMultiplier,X,R,Span).
532		:- block tan2(?,-,?,?),tan2(-,?,?,?).
533		tan2(Multiplier,X,R,Span) :- safe_is('TANx',R,round(Multiplier*tan(X/Multiplier)),Span).
534
535
536		external_fun_type('PROLOG_FUN',[],[string,integer,integer,integer]).
537		external_fun_has_wd_condition('PROLOG_FUN').
538		expects_spaninfo('PROLOG_FUN').
539		:- public 'PROLOG_FUN'/5.
540		'PROLOG_FUN'(string(Function),int(PrecisionMultiplier),int(Argument),int(Result),Span) :-
541		prolog_fun2(Function,PrecisionMultiplier,Argument,Result,Span).
542		% Function can be:
543		% sin, cos, tan, cot, sinh, cosh, tanh, asin, acos, atan, acot, asinh, acosh, atanh, acoth, sqrt, log, exp
544		:- block prolog_fun2(?,-,?,?,?),prolog_fun2(-,?,?,?,?), prolog_fun2(?,?,-,?,?).
545		prolog_fun2(Function,Multiplier,X,R,Span) :-
546		E =.. [Function,X/Multiplier],
547		safe_is(Function,R,round(Multiplier*E),Span).
548
549		external_fun_has_wd_condition('LOGx').
550		expects_spaninfo('LOGx').
551		external_fun_type('LOGx',[],[integer,integer,integer,integer]).
552		:- public 'LOGx'/5.
553		:- block 'LOGx'(-,?,?,?,?),'LOGx'(?,-,?,?,?), 'LOGx'(?,?,-,?,?).
554		'LOGx'(int(PrecisionMultiplier),int(Base),int(X),int(R),Span) :-
555		log2(PrecisionMultiplier,Base,X,R,Span).
556		:- block log2(?,-,?,?,?),log2(-,?,?,?,?),log2(?,?,-,?,?).
557		log2(Multiplier,Base,X,R,Span) :-
558		logx_internal(Multiplier,Base,X,R,Span).
559
560		:- use_module(tools_portability, [check_arithmetic_function/1]).
561		:- if(check_arithmetic_function(log(2, 4))).
562		% Native log(Base, Power) function is available - use it.
563		logx_internal(Multiplier,Base,X,R,Span) :-
564		safe_is('LOGx',R,round(Multiplier*log(Base/Multiplier,X/Multiplier)),Span).
565		:- else.
566		% No native log(Base, Power) support, so construct it using natural logarithms.
567		logx_internal(Multiplier,Base,X,R,Span) :-
568		safe_is('LOGx',R,round(Multiplier*(log(X/Multiplier)/log(Base/Multiplier))),Span).
569		:- endif.
570
571		:- use_module(clpfd_interface,[clpfd_gcd/3, clpfd_lcm/3, clpfd_abs/2, clpfd_sign/2]).
572		external_fun_type('GCD',[],[integer,integer,integer]).
573		:- public 'GCD'/3.
574		:- block 'GCD'(-,-,-).
575		'GCD'(int(X),int(Y),int(R)) :-
576		clpfd_gcd(X,Y,R).
577
578		% least / smallest common multiple
579		external_fun_type('LCM',[],[integer,integer,integer]).
580		:- public 'LCM'/3.
581		:- block 'LCM'(-,-,-).
582		'LCM'(int(X),int(Y),int(R)) :- clpfd_lcm(X,Y,R).
583
584		external_fun_type('ABS',[],[integer,integer]).
585		external_fun_can_be_inverted('ABS'). % there are two possible input values for an output value
586		:- public 'ABS'/2.
587		:- block 'ABS'(-,-). % do we need this ??
588		'ABS'(int(X),int(R)) :-
589		clpfd_abs(X,R).
590
591		external_fun_type('SIGN',[],[integer,integer]).
592		:- public 'SIGN'/2.
593		:- block 'SIGN'(-,-).
594		'SIGN'(int(X),int(R)) :-
595		clpfd_sign(X,R).
596
597
598		% TLA style floored division
599		external_fun_has_wd_condition('FDIV').
600		expects_spaninfo('FDIV').
601		expects_waitflag('FDIV').
602		external_fun_type('FDIV',[],[integer,integer,integer]).
603		:- public 'FDIV'/5.
604		:- block 'FDIV'(-,-,-,?,?).
605		'FDIV'(X,Y,Z,Span,WF) :-
606		kernel_objects:floored_division(X,Y,Z,Span,WF).
607
608		% ceiling division
609		external_fun_has_wd_condition('CDIV').
610		expects_spaninfo('CDIV').
611		expects_waitflag('CDIV').
612		external_fun_type('CDIV',[],[integer,integer,integer]).
613		:- public 'CDIV'/5.
614		:- block 'CDIV'(-,?,?,?,?),'CDIV'(?,-,?,?,?).
615		'CDIV'(int(X),int(Y),Res,Span,WF) :-
616		ceiling_division(X,Y,Res,Span,WF).
617
618		:- block ceiling_division(-,?,?,?,?),ceiling_division(?,-,?,?,?).
619		ceiling_division(X,Y,_Res,Span,WF) :- Y=0,!,
620		add_wd_error_span('Ceiling division by zero:',X,Span,WF).
621		ceiling_division(X,Y,Res,_Span,_WF) :-
622		X mod Y =:= 0,!,
623		XY is X//Y, Res = int(XY).
624		ceiling_division(X,Y,Res,Span,WF) :-
625		kernel_objects:floored_division(int(X),int(Y),int(Z),Span,WF),
626		Z1 is 1 + Z,
627		Res = int(Z1).
628
629		external_fun_has_wd_condition('SQRT').
630		expects_spaninfo('SQRT').
631		expects_waitflag('SQRT').
632		external_fun_type('SQRT',[],[integer,integer]).
633		%external_fun_can_be_inverted('SQRT'). % TODO : comment in after fixing TODOs below
634		:- public 'SQRT'/4.
635		:- block 'SQRT'(-,?,?,?).
636		'SQRT'(int(X),R,Span,WF) :-
637		positive_integer_sqrt(X,R,Span,WF). % TO DO: maybe do CLPFD propagation?
638		% TODO: backwards propagation from R to X; if X=2 -> X=+/-4,5,6,7,8
639
640		:- block positive_integer_sqrt(-,?,?,?).
641		positive_integer_sqrt(X,_,Span,WF) :- X<0,!,
642		add_wd_error_span('Trying to compute square root of negative number:',X,Span,WF).
643		positive_integer_sqrt(X,Res,Span,_WF) :-
644		Candidate is floor(sqrt(X)), % compute using floating number function
645		(Candidate*Candidate =< X
646		-> C1 is Candidate+1,
647		(C1*C1 > X
648		-> Res = int(Candidate)
649		; (C1+1)*(C1+1) > X
650		-> Res = int(C1)
651		; % SQR is (C1+1)^2, Delta is X-SQR, write(sqr_candidate(C1,SQR,X,Delta)),nl,
652		% >>> SQRT(9999911144210000019*9999911144210000019+2)
653		add_error(external_functions,'Rounding error (2) while computing SQRT of: ',X,Span),
654		Res = int(C1)
655		)
656		; add_error(external_functions,'Rounding error (1) while computing SQRT of: ',X,Span),
657		% SQRT(999991114421000001*999991114421000001+2)
658		Res = int(Candidate)
659		).
660
661		external_fun_type('MSB',[],[integer,integer]).
662		expects_spaninfo('MSB').
663		:- public 'MSB'/3.
664		:- block 'MSB'(-,?,?).
665		'MSB'(int(X),int(R),Span) :- msb2(X,R,Span). % most significant bit
666		:- block msb2(-,?,?).
667		msb2(X,R,Span) :- safe_is('MSB',R,msb(X),Span). % TO DO: could be made reversible by propagating constraint if R known
668
669
670		external_fun_type('FACTORIAL',[],[integer,integer]).
671		expects_spaninfo('FACTORIAL').
672		expects_waitflag('FACTORIAL').
673		:- public 'FACTORIAL'/4.
674		:- block 'FACTORIAL'(-,?,?,?).
675		'FACTORIAL'(int(X),int(R),Span,WF) :- fact(X,R,Span,WF). % most significant bit
676		:- block fact(-,?,?,?).
677		fact(X,_,Span,WF) :- X<0,!, add_wd_error_span('FACTORIAL applied to negative number: ',X,Span,WF).
678		fact(X,_,Span,WF) :- X>10000,!, add_wd_error_span('FACTORIAL overflow, argument too large: ',X,Span,WF).
679		fact(X,Res,_,_) :- fact_acc(X,1,Res).
680
681		fact_acc(0,Acc,Res) :- !,Res=Acc.
682		fact_acc(N,Acc,Res) :- NAcc is Acc*N,
683		N1 is N-1, fact_acc(N1,NAcc,Res).
684
685		% TODO: fact_k, choose_nk
686
687		% BITWISE OPERATORS
688		external_fun_type('BNOT',[],[integer,integer]).
689		external_fun_can_be_inverted('BNOT').
690		expects_spaninfo('BNOT').
691		:- public 'BNOT'/3.
692		:- block 'BNOT'(-,-,?).
693		'BNOT'(int(X),int(R),Span) :- bitwise_not(X,R,Span).
694		:- block bitwise_not(-,-,?).
695		bitwise_not(X,R,Span) :- number(X),!,safe_is('BNOT',R,\(X),Span).
696		bitwise_not(X,R,Span) :- safe_is('BNOT',X,\(R),Span).
697
698		external_fun_type('BAND',[],[integer,integer,integer]).
699		:- public 'BAND'/3.
700		:- block 'BAND'(-,?,?),'BAND'(?,-,?).
701		'BAND'(int(X),int(Y),int(R)) :- bitwise_and(X,Y,R).
702		:- block bitwise_and(?,-,?),bitwise_and(-,?,?).
703		bitwise_and(X,Y,R) :- R is X /\ Y. % we could do some early consistency checking, e.g., when X and R known
704
705		external_fun_type('BOR',[],[integer,integer,integer]).
706		:- public 'BOR'/3.
707		:- block 'BOR'(-,?,?),'BOR'(?,-,?).
708		'BOR'(int(X),int(Y),int(R)) :- bitwise_or(X,Y,R).
709		:- block bitwise_or(?,-,?),bitwise_or(-,?,?).
710		bitwise_or(X,Y,R) :- R is X \/ Y. % we could do some early consistency checking, e.g., when X and R known
711
712		external_fun_type('BXOR',[],[integer,integer,integer]).
713		external_fun_can_be_inverted('BXOR').
714		:- public 'BXOR'/3.
715		:- if((current_prolog_flag(dialect, sicstus),
716		current_prolog_flag(version_data, sicstus(4,9,_,_,_)))).
717		:- use_module(clpfd_interface,[clpfd_eq_expr/2]).
718		:- block 'BXOR'(-,-,-).
719		'BXOR'(int(X),int(Y),int(R)) :-
720		(preferences:preference(use_clpfd_solver,true)
721		-> clpfd_eq_expr(R,xor(X,Y))
722		; bitwise_xor(X,Y,R)).
723		:- else.
724		:- block 'BXOR'(-,-,?),'BXOR'(?,-,-),'BXOR'(-,?,-).
725		'BXOR'(int(X),int(Y),int(R)) :- bitwise_xor(X,Y,R).
726		:- endif.
727		:- block bitwise_xor(-,-,?),bitwise_xor(?,-,-),bitwise_xor(-,?,-).
728		% DO WE NEED TO KNOW THE sizes of X,Y,R ?
729		bitwise_xor(X,Y,R) :- var(X),!, X is xor(R,Y).
730		bitwise_xor(X,Y,R) :- var(Y),!, Y is xor(X,R).
731		bitwise_xor(X,Y,R) :- R is xor(X,Y).
732
733		% TO DO: do some clpfd propagations ? X:0..N & Y:0..M -> BAND(X,Y) : 0..min(N,M)
734
735		% EXTERNAL_FUNCTION_BITS == INTEGER --> seq(INTEGER)
736		% BITS(x) == [0]
737		external_fun_type('BLSHIFT',[],[integer,integer,integer]).
738		:- public 'BLSHIFT'/3.
739		:- block 'BLSHIFT'(-,?,?),'BLSHIFT'(?,-,?).
740		'BLSHIFT'(int(X),int(Y),int(R)) :- bitwise_left_shift(X,Y,R).
741		:- block bitwise_left_shift(?,-,?),bitwise_left_shift(-,?,?).
742		bitwise_left_shift(X,Y,R) :- R is X << Y.
743		external_fun_type('BRSHIFT',[],[integer,integer,integer]).
744		:- public 'BRSHIFT'/3.
745		:- block 'BRSHIFT'(-,?,?),'BRSHIFT'(?,-,?).
746		'BRSHIFT'(int(X),int(Y),int(R)) :- bitwise_right_shift(X,Y,R).
747		:- block bitwise_right_shift(?,-,?),bitwise_right_shift(-,?,?).
748		bitwise_right_shift(X,Y,R) :- R is X >> Y.
749
750		:- assert_must_succeed(( external_functions:call_external_function('BITS',[12],[int(12)],R,integer,unknown,_WF),
751		equal_object(R,[(int(1),int(1)),(int(2),int(1)),(int(3),int(0)),(int(4),int(0))]) )).
752
753		external_fun_type('BITS',[],[integer,seq(integer)]).
754		:- public 'BITS'/2.
755		:- block 'BITS'(-,?).
756		'BITS'(int(X),Res) :- convert_to_bits(X,Res).
757
758		:- block convert_to_bits(-,?).
759		convert_to_bits(0,Res) :- !, convert_list_to_seq([int(0)],Res).
760		convert_to_bits(N,Res) :- convert_to_bits(N,[],List),
761		convert_list_to_seq(List,Res).
762		convert_to_bits(0,Acc,Res) :- !, Res=Acc.
763		convert_to_bits(X,Acc,Res) :- XM2 is X mod 2, XD2 is X // 2,
764		convert_to_bits(XD2,[int(XM2)|Acc],Res).
765		% TO DO: maybe do some constraint propagation from Result to number, or use CLP(FD) size info to infer size of sequence?
766
767		% -------------------------------
768
769		% THE CHOOSE operator (for TLA, recursive functions over sets,...)
770		% or choice operator from Abrial Book, page 60ff
771
772		:- use_module(kernel_waitflags,[add_wd_error_span/4]).
773		external_fun_type('CHOOSE',[X],[set(X),X]).
774		external_fun_has_wd_condition('CHOOSE').
775		expects_waitflag('CHOOSE').
776		expects_spaninfo('CHOOSE').
777		:- public 'CHOOSE'/4.
778		:- block 'CHOOSE'(-,?,?,?).
779		'CHOOSE'([],_,Span,WF) :-
780		add_wd_error_span('CHOOSE applied to empty set: ',[],Span,WF).
781		'CHOOSE'(CS,H,_,_) :- is_interval_closure_or_integerset(CS,Low,Up),
782		!,
783		choose_interval(Low,Up,H).
784		'CHOOSE'([H|T],C,_Span,WF) :- T==[], !, kernel_objects:equal_object_optimized_wf(C,H,'CHOOSE',WF).
785		'CHOOSE'([H|T],C,Span,WF) :- !,
786		ground_value_check([H|T],Gr),
787		when(nonvar(Gr),
788		(convert_to_avl([H|T],AVL) -> 'CHOOSE'(AVL,C,Span,WF)
789		; add_wd_error_span('Cannot determine minimum element for CHOOSE: ',[H|T],Span,WF),
790		kernel_objects:equal_object_wf(C,H,WF))
791		).
792	?	'CHOOSE'(avl_set(A),H,_,WF) :- !, avl_min(A,Min), kernel_objects:equal_object_wf(H,Min,WF).
793		'CHOOSE'(global_set(GS),H,_,_) :- !, H = fd(1,GS). % assume GS not empty, integer sets covered above
794		'CHOOSE'(freetype(ID),H,Span,WF) :- !,
795		(kernel_freetypes:enumerate_freetype_wf(basic,FV,freetype(ID),WF)
796		-> kernel_objects:equal_object_wf(FV,H,WF)
797		; add_internal_error('Could not generate freetype element: ','CHOOSE'(freetype(ID),H,Span,WF))).
798		'CHOOSE'(CS,H,Span,WF) :- custom_explicit_sets:is_cartesian_product_closure(CS,Set1,Set2),!,
799		'CHOOSE'(Set1,H1,Span,WF),
800		'CHOOSE'(Set2,H2,Span,WF),
801		kernel_objects:equal_object_wf(H,(H1,H2),WF).
802		'CHOOSE'(closure(P,T,B),H,Span,WF) :-
803		custom_explicit_sets:expand_custom_set_wf(closure(P,T,B),ER,'CHOOSE',WF),
804		'CHOOSE'(ER,H,Span,WF).
805
806		:- block choose_interval(-,?,?).
807		choose_interval(Low,_Up,H) :- number(Low),!,H=int(Low).
808		choose_interval(_Low,Up,H) :- choose_interval2(Up,H). % lower-bound is minus infinity
809		:- block choose_interval2(-,?).
810		choose_interval2(Up,H) :- number(Up),!,H=int(Up). % for those intervals we choose Up
811		choose_interval2(_,int(0)). % we have INTEGER or something equivalent; simply choose 0
812
813		:- use_module(kernel_objects,[singleton_set_element/4, singleton_set_element_wd/4]).
814		external_fun_type('MU',[X],[set(X),X]).
815		external_fun_has_wd_condition('MU').
816		expects_waitflag('MU').
817		expects_spaninfo('MU').
818		:- public 'MU'/4.
819		'MU'(Set,Res,Span,WF) :-
820		singleton_set_element(Set,Res,Span,WF).
821
822		external_fun_type('MU_WD',[X],[set(X),X]).
823		external_fun_has_wd_condition('MU_WD').
824		expects_waitflag('MU_WD').
825		expects_spaninfo('MU_WD').
826		% a version of MU which propagates more strongly from result to input
827		% but may thus fail to generate WD errors; can be used for stronger constraint propagation if MU is known to be WD
828		:- public 'MU_WD'/4.
829		'MU_WD'(Set,Res,Span,WF) :-
830		singleton_set_element_wd(Set,Res,Span,WF).
831
832
833		% choose n elements from a set
834		% will currently fail without good error message when we cannot find enough solutions
835		external_fun_type('CHOOSE_n',[X],[integer,set(X),set(X)]).
836		external_fun_has_wd_condition('CHOOSE_n').
837		expects_waitflag('CHOOSE_n').
838		expects_spaninfo('CHOOSE_n').
839		expects_type('CHOOSE_n').
840		:- public 'CHOOSE_n'/6.
841		:- block 'CHOOSE_n'(-,?,?,?,?,?).
842		'CHOOSE_n'(int(Nr),Set,Result,set(Type),Span,WF) :-
843		ground_value_check(Set,GrSet),
844		choose_n_aux(Nr,GrSet,Set,Result,Type,Span,WF).
845
846		:- block 'choose_n_aux'(-,?,?,?,?,?,?),'choose_n_aux'(?,-,?,?,?,?,?).
847		choose_n_aux(Nr,_,Set,Result,Type,Span,WF) :-
848		generate_elements(Nr,Set,[],List,Type,Span,WF),
849		equal_object_wf(List,Result,WF).
850
851		% TODO: disable enumeration warnings when generating new elements
852		generate_elements(0,_,_,Res,_,_,_) :- !, Res=[].
853		generate_elements(Nr,Set,Acc,[H|T],Type,Span,WF) :-
854		init_wait_flags_with_call_stack(WF2,[operation_call('CHOOSE_n',[int(Nr)],Span)]),
855		check_element_of_wf(H,Set,WF2),
856		not_element_of_wf(H,Acc,WF2),
857		b_enumerate:b_enumerate_typed_values([H],[Type],WF2),
858		ground_wait_flags(WF2),
859		add_element_wf(H,Acc,Acc2,no_wf_available),
860		!,
861		N1 is Nr-1,
862		generate_elements(N1,Set,Acc2,T,Type,Span,WF).
863
864
865		% -----------------
866
867		% sort a set and generate a sequence
868		% external_fun_has_wd_condition('SORT'). SORT generates virtual time-out for infinite sets; but has no WD-condition
869		% important to remove wd_condition fact to allow b_compiler to pre-compute calls to SORT
870		expects_waitflag('SORT').
871		expects_spaninfo('SORT').
872		external_fun_type('SORT',[X],[set(X),seq(X)]).
873		:- public 'SORT'/4.
874		:- block 'SORT'(-,?,?,?).
875		'SORT'([],Res,_Span,_WF) :- !, Res=[].
876		'SORT'(CS,Res,_,WF) :- custom_explicit_sets:is_custom_explicit_set(CS),!,
877		expand_custom_set_to_list_wf(CS,ER,Done,'SORT',WF),
878		sort_aux(Done,ER,Res,WF).
879		'SORT'([H|T],Res,_,WF) :-
880		when(ground([H|T]),
881		(maplist(convert_to_avl_if_possible,[H|T],List),
882		sort(List,SList),sort_aux(done,SList,Res,WF))).
883
884		convert_to_avl_if_possible(H,Res) :- convert_to_avl(H,CH),!,Res=CH.
885		convert_to_avl_if_possible(H,H) :-
886		add_warning(external_functions,'Cannot guarantee order when sorting:',H).
887
888		:- block sort_aux(-,?,?,?).
889		sort_aux(_,ER,Res,_WF) :- convert_list_to_seq(ER,Res).
890
891		% construct a B sequence from a Prolog list
892		convert_list_to_seq(ER,Res) :- convert_list_to_seq(ER,1,Seq), equal_object_optimized(Seq,Res).
893
894		convert_list_to_seq([],_,[]).
895		convert_list_to_seq([H|T],N,[(int(N),H)|CT]) :- N1 is N+1, convert_list_to_seq(T,N1,CT).
896
897		% :- use_module(library(samsort),[samsort/3]).
898		% TO DO: version of SORT with samsort/3 and user provided sorting predicate
899
900		% Z Compaction / squash operator to fill up gaps in sequence
901		external_fun_has_wd_condition('SQUASH'). % needs to be a function
902		expects_waitflag('SQUASH').
903		external_fun_type('SQUASH',[X],[set(couple(integer,X)),seq(X)]). % input not necessarily proper sequence
904
905		:- use_module(kernel_z,[compaction/3]).
906		:- public 'SQUASH'/3.
907		'SQUASH'(Sequence,Value,WF) :- compaction(Sequence,Value,WF).
908
909		external_fun_has_wd_condition('REPLACE'). % needs to be a function
910		expects_waitflag('REPLACE').
911		expects_spaninfo('REPLACE').
912		external_fun_type('REPLACE',[X],[seq(X),seq(X),seq(X),set(seq(X))]).
913		% Replace a pattern by another pattern within a sequence
914		% Currently it also performs a squashing of its arguments and does not check if its argument is a function or sequence.
915		% REPLACE([a],[b],[a,c,a]) = { [b,c,a], [a,c,b] };
916		% REPLACE([a],[],[a,c,a]) = { [c,a], [a,c] };
917		% REPLACE([a,a],[],[a,c,a]) = { }
918		:- public 'REPLACE'/6.
919		:- block 'REPLACE'(-,?,?,?,?,?), 'REPLACE'(?,-,?,?,?,?), 'REPLACE'(?,?,-,?,?,?).
920		'REPLACE'(Pat,Replacement,InSequence,Res,Span,_WF) :-
921		ground_value_check((Pat,Replacement,InSequence),Gr),
922		replace_pat_aux(Gr,Pat,Replacement,InSequence,Res,Span).
923		:- block replace_pat_aux(-,?,?,?,?,?).
924		replace_pat_aux(_,Pat,Replacement,InSequence,Res,Span) :-
925		convert_to_sorted_seq_list(Pat,PL,Span),
926		convert_to_sorted_seq_list(Replacement,RL,Span),
927		convert_to_sorted_seq_list(InSequence,SL,Span),
928		findall(ResList,replace_pattern(PL,RL,SL,ResList),ResLists),
929		equal_object_optimized(ResLists,Res,'REPLACE').
930
931		% convert argument to avl list and then on to a list of elements without indices
932		convert_to_sorted_seq_list([],List,_Span) :- !, List=[].
933		convert_to_sorted_seq_list(Sequence,List,_Span) :-
934		convert_to_avl(Sequence,avl_set(AVL)),
935		custom_explicit_sets:get_avl_sequence(AVL,List),!.
936		convert_to_sorted_seq_list(Sequence,_,Span) :-
937		add_error(external_functions,'Cannot convert argument to finite sequences: ',Sequence,Span).
938
939		replace_pattern(Pat,Rep,Seq,ResBSequence) :- % Prefix.Pat.Post ---> Prefix.Rep.Post
940		append(Pat,Post,PatPost),
941		append(Rep,Post,RepPost),
942		append(Prefix,PatPost,Seq),
943		append(Prefix,RepPost,ResList),
944		convert_list_to_seq(ResList,ResBSequence).
945
946
947		% Prolog term order on encoding
948		external_fun_type('LESS',[X],[X,X,boolean]).
949		:- public 'LESS'/3.
950		:- block 'LESS'(-,?,?), 'LESS'(?,-,?).
951		'LESS'(string(A),string(B),Res) :- !, less2(A,B,Res).
952		'LESS'(int(A),int(B),Res) :- !, less_clpfd(A,B,Res). % use CLPFD less ?
953		'LESS'(fd(A,G),fd(B,G),Res) :- !, less_clpfd(A,B,Res).
954		'LESS'(term(floating(A)),B,Res) :- !,
955		kernel_reals:real_comp_wf('<',term(floating(A)),B,Res,no_wf_available).
956		'LESS'(pred_false,B,Res) :- !, B=Res. % if B=pred_true then < , otherwise not
957		'LESS'(pred_true,_,Res) :- !, Res=pred_false.
958		% TO DO: expand finite closures, couples, avl_sets, ...
959		'LESS'(X,Y,Res) :- when((ground(X),ground(Y)), less2(X,Y,Res)).
960		% TO DO: use kernel_ordering,[ordered_value/2]).
961
962		:- use_module(clpfd_interface,[clpfd_leq_expr/2,clpfd_lt_expr/2]).
963		:- block less_clpfd(-,?,-), less_clpfd(?,-,-).
964		less_clpfd(A,B,Res) :- Res==pred_true, !, clpfd_lt_expr(A,B).
965		less_clpfd(A,B,Res) :- Res==pred_false, !, clpfd_leq_expr(B,A).
966		less_clpfd(A,B,Res) :- (A < B -> Res=pred_true ; Res=pred_false).
967
968
969		:- block less2(-,?,?), less2(?,-,?).
970		less2(A,B,Res) :- (A @< B -> Res=pred_true ; Res=pred_false).
971
972		:- use_module(kernel_ordering,[leq_ordered_value/3]).
973
974		:- public 'LEQ_SYM_BREAK'/4.
975		expects_waitflag('LEQ_SYM_BREAK').
976		external_fun_type('LEQ_SYM_BREAK',[X],[X,X,boolean]).
977		'LEQ_SYM_BREAK'(A,B,Res,WF) :- 'LEQ_SYM'(A,B,Res,WF).
978
979		expects_waitflag('LEQ_SYM').
980		external_fun_type('LEQ_SYM',[X],[X,X,boolean]).
981		% true if arg1 <= arg2 according to Prolog term order; may return true for some symbolic representations
982		% Note: it is sometimes ignored, e.g., by Kodkod or Z3 translation
983		% Also: LEQ_SYM_BREAK / LEQ_SYM do not fully support all types yet, see sym_break_supported_type
984		:- block 'LEQ_SYM'(-,?,?,?).
985		'LEQ_SYM'(int(A),int(B),Res,_WF) :- !,
986		b_interpreter_check:check_arithmetic_operator('<=',A,B,Res).
987		'LEQ_SYM'(fd(A,G),fd(B,G),Res,_WF) :- !,
988		b_interpreter_check:check_arithmetic_operator('<=',A,B,Res).
989		'LEQ_SYM'(term(floating(A)),B,Res,WF) :- !,
990		kernel_reals:real_comp_wf('=<',term(floating(A)),B,Res,WF).
991		'LEQ_SYM'(pred_false,_,Res,_WF) :- !, Res=pred_true. % pred_false @< pred_true
992		'LEQ_SYM'(pred_true,B,Res,_WF) :- !, Res=B. % if B=pred_true -> ok; otherwise Res=pred_false
993		'LEQ_SYM'([],_,Res,_W) :- !, Res=pred_true. % the empty set is the smallest set
994		'LEQ_SYM'(closure(_,_,_),_,Res,_) :- !, Res=pred_true. % otherwise we would have to expand it
995		'LEQ_SYM'(global_set(_),_,Res,_) :- !, Res=pred_true. % ditto
996		'LEQ_SYM'(X,Y,Res,WF) :- 'LEQ_SYM2'(X,Y,Res,WF).
997
998		:- block 'LEQ_SYM2'(?,-,?,?).
999		%'LEQ_SYM'(X,Y,Res) :- print('LEQ_SYM'(X,Y,Res)),nl,fail.
1000		'LEQ_SYM2'(string(A),string(B),Res,_WF) :- !, less_eq2(A,B,Res).
1001		'LEQ_SYM2'(_,closure(_,_,_),Res,_WF) :- !, Res=pred_true. % we would have to expand it
1002		'LEQ_SYM2'(Set1,[],Res,WF) :- !, kernel_equality:empty_set_test_wf(Set1,Res,WF).
1003		'LEQ_SYM2'((A,B),(X,Y),Res,_WF) :- Res==pred_true,!, leq_ordered_value((A,B),(X,Y),_Equal).
1004		'LEQ_SYM2'(rec(FA),rec(FB),Res,_WF) :- Res==pred_true,!, leq_ordered_value(rec(FA),rec(FB),_Equal).
1005		% TODO: support sets, e.g., by comparing cardinality or minimal elements
1006		'LEQ_SYM2'(_A,_B,Res,_WF) :- Res=pred_true.
1007		%'LEQ_SYM2'(X,Y,Res,_WF) :- when((ground(X),ground(Y)), less_eq2(X,Y,Res)). % unsafe to use; we should normalize AVLs ...
1008		% TO DO: use kernel_ordering:leq_ordered_value/2 more or use lex_chain([[X,X],[Y,Z]],[op(#=<)]) for pairs/records of FD values
1009		% Note: it is reified in b_interpreter_check
1010
1011		:- block less_eq2(-,?,?), less_eq2(?,-,?).
1012		less_eq2(A,B,Res) :- (A @=< B -> Res=pred_true ; Res=pred_false).
1013
1014		% -------------------------------
1015
1016		% was a first prototype for implementing recursive functions
1017		% was still a bit clumsy to define recursive functions (using STRING parameter for names)
1018		% a restriction is that we can only have one version per machine, i.e.
1019		% one can only define recursive function in the CONSTANTS section and only
1020		% in a deterministic fashion not depending on enumerated constants,...
1021		% we now use generate_recursive_closure in b_interpreter for recursive_let/2 constructs
1022		%:- dynamic recursive_function/2.
1023		%expects_waitflag('REC'). % DEPRECATED
1024		%expects_spaninfo('RECx'). % DEPRECATED
1025		%expects_spaninfo('REC_LET'). % DEPRECATED
1026
1027
1028		reset_external_functions :-
1029		retractall(last_walltime(_)),
1030		reset_ident,
1031		reset_kodkod,
1032		reset_observe,
1033		close_all_files.
1034
1035		:- use_module(eventhandling,[register_event_listener/3]).
1036		:- register_event_listener(clear_specification,reset_external_functions,
1037		'Reset B External Functions.').
1038
1039		print_external_function_instantiation_profile :-
1040		%TODO: we could register number of external function calls, ..
1041		portray_instantiations.
1042
1043
1044		% -------------------------------
1045
1046		expects_waitflag('FORCE').
1047		external_fun_type('FORCE',[T],[T,T]).
1048		:- public 'FORCE'/3.
1049		% example usage halve = FORCE( %x.(x:0..1000 & x mod 2 = 0 | x/2))
1050		:- block 'FORCE'(-,?,?).
1051		%'FORCE'(A,B,_) :- print(force(A)),nl,fail.
1052		'FORCE'(avl_set(A),Result,_) :- !, equal_object(avl_set(A),Result).
1053		'FORCE'([],Result,_) :- !, equal_object([],Result).
1054		'FORCE'(closure(P,T,B),Result,WF) :- !,
1055		(debug:debug_mode(on) -> print('FORCING : '),translate:print_bvalue(closure(P,T,B)),nl ; true),
1056		custom_explicit_sets:expand_closure_to_avl_or_list(P,T,B,ExpandedValue,no_check,WF),
1057		(debug:debug_mode(on) -> print('RESULT : '),translate:print_bvalue(ExpandedValue),nl,
1058		print(' ASSIGNING TO : '), translate:print_bvalue(Result),nl
1059		; true),
1060		equal_object(ExpandedValue,Result).
1061		'FORCE'((A,B),(FA,FB),WF) :- !,'FORCE'(A,FA,WF), 'FORCE'(B,FB,WF).
1062		% TO DO: treat lists and records ...
1063		'FORCE'(A,B,_) :- equal_object_optimized(A,B,'FORCE').
1064
1065		% -----------------------------------------
1066
1067		:- use_module(tools, [read_term_from_file/2]).
1068
1069		expects_spaninfo('READ_PROB_DATA_FILE').
1070		external_fun_type('READ_PROB_DATA_FILE',[T],[set(T),string,T]).
1071		:- public 'READ_PROB_DATA_FILE'/4.
1072		:- block 'READ_PROB_DATA_FILE'(-,?,?,?), 'READ_PROB_DATA_FILE'(?,-,?,?).
1073		'READ_PROB_DATA_FILE'(_,string(File),Expr,Span) :- % first arg provides type info
1074		read_prob_data_file(File,Expr,Span).
1075
1076		:- block read_prob_data_file(-,?,?).
1077		read_prob_data_file(File,Expr,Span) :-
1078		b_absolute_file_name(File,AFile,Span),
1079		safe_call(read_term_from_file(AFile,Expr),Span). % can also be in fastrw format
1080
1081
1082
1083		% -----------------------------------------
1084
1085		:- public 'ENUM'/2.
1086		% example usage: ENUM((x,y)) : AVLSet
1087		% external function used for deriving info field annotations in ast_cleanup
1088		'ENUM'(Obj,Obj).
1089
1090		% -----------------------------------------
1091
1092		expects_unevaluated_args('DO_NOT_ENUMERATE').
1093		:- public 'DO_NOT_ENUMERATE'/3.
1094		:- block 'DO_NOT_ENUMERATE'(-,?,?).
1095		'DO_NOT_ENUMERATE'((A,B),PredRes,UEA) :- !, 'DO_NOT_ENUMERATE'(A,PredRes,UEA),'DO_NOT_ENUMERATE'(B,PredRes,UEA).
1096		'DO_NOT_ENUMERATE'(fd(V,_),PredRes,UEA) :- !, 'DO_NOT_ENUMERATE'(V,PredRes,UEA).
1097		'DO_NOT_ENUMERATE'(int(V),PredRes,UEA) :- !, 'DO_NOT_ENUMERATE'(V,PredRes,UEA).
1098		'DO_NOT_ENUMERATE'(string(V),PredRes,UEA) :- !, 'DO_NOT_ENUMERATE'(V,PredRes,UEA).
1099		'DO_NOT_ENUMERATE'(_Obj,PredRes,_UEA) :-
1100		%print('INSTANTIATED: '),nl, _UEA=[UnEvalArg],translate:print_bexpr(UnEvalArg),nl, print(_Obj),nl,
1101		PredRes=pred_true.
1102		% add_message('DO_NOT_ENUMERATE','Enumerating: ',UnEvalArgs).
1103
1104		% a utility to avoid propagation of values, can be used as "enumeration barrier"
1105		expects_waitflag('COPY').
1106		:- public 'COPY'/3.
1107		:- block 'COPY'(-,?,?).
1108		'COPY'(Val,Result,WF) :- ground_value_check(Val,GrVal),
1109		when(nonvar(GrVal),equal_object_optimized_wf(Val,Result,'COPY',WF)).
1110
1111
1112		% -------------------------------
1113
1114		:- assert_must_succeed(( external_functions:call_external_function('STRING_APPEND',[a,b],[string(a),string(b)],string(ab),string,unknown,_WF) )).
1115		% STRING MANIPULATION FUNCTIONS
1116
1117		:- use_module(kernel_strings,[b_string_append_wf/4, b_concat_sequence_of_strings_wf/4, b_string_reverse_wf/3,
1118		b_string_chars/2, b_string_codes/2, b_string_length/2,
1119		b_string_to_uppercase/2, b_string_to_lowercase/2]).
1120
1121		% function to append two strings, reversible
1122		external_fun_can_be_inverted('STRING_APPEND').
1123		expects_waitflag('STRING_APPEND').
1124		external_fun_type('STRING_APPEND',[],[string,string,string]).
1125		:- public 'STRING_APPEND'/4.
1126		'STRING_APPEND'(A,B,C,WF) :- b_string_append_wf(A,B,C,WF).
1127
1128		% function to append two strings, reversible
1129		external_fun_can_be_inverted('STRING_REV').
1130		expects_waitflag('STRING_REV').
1131		external_fun_type('STRING_REV',[],[string,string]).
1132		:- public 'STRING_REV'/3.
1133		'STRING_REV'(A,B,WF) :- b_string_reverse_wf(A,B,WF).
1134
1135		expects_waitflag('STRING_CONC').
1136		expects_spaninfo('STRING_CONC').
1137		external_fun_type('STRING_CONC',[],[seq(string),string]).
1138		:- public 'STRING_CONC'/4.
1139		:- block 'STRING_CONC'(-,?,?,?).
1140		% the conc(.) operator is mapped to this for strings (instead to concat_sequence)
1141		'STRING_CONC'(List,Res,Span,WF) :-
1142		b_concat_sequence_of_strings_wf(List,Res,Span,WF).
1143
1144		external_fun_can_be_inverted('STRING_CHARS').
1145		external_fun_type('STRING_CHARS',[],[string,seq(string)]).
1146		:- public 'STRING_CHARS'/2.
1147		'STRING_CHARS'(Str,SeqOfChars) :- b_string_chars(Str,SeqOfChars).
1148		/* Note: STRING_CONC can be used as inverse to combine the chars */
1149
1150		external_fun_can_be_inverted('CODES_TO_STRING').
1151		external_fun_type('CODES_TO_STRING',[],[seq(integer),string]).
1152		:- public 'CODES_TO_STRING'/2.
1153		'CODES_TO_STRING'(A,SeqRes) :- 'STRING_CODES'(SeqRes,A).
1154
1155		external_fun_can_be_inverted('STRING_CODES').
1156		external_fun_type('STRING_CODES',[],[string,seq(integer)]).
1157		:- public 'STRING_CODES'/2.
1158		'STRING_CODES'(A,SeqRes) :- b_string_codes(A,SeqRes).
1159
1160
1161		external_fun_type('STRING_TO_UPPER',[],[string,string]).
1162		:- public 'STRING_TO_UPPER'/2.
1163		'STRING_TO_UPPER'(S,S2) :- b_string_to_uppercase(S,S2).
1164		external_fun_type('STRING_TO_LOWER',[],[string,string]).
1165		:- public 'STRING_TO_LOWER'/2.
1166		'STRING_TO_LOWER'(S,S2) :- b_string_to_lowercase(S,S2).
1167
1168		:- use_module(kernel_strings,[b_string_equal_case_insensitive/3]).
1169		external_fun_type('STRING_EQUAL_CASE_INSENSITIVE',[],[string,string,boolean]).
1170		:- public 'GET_STRING_EQUAL_CASE_INSENSITIVE'/3.
1171		'STRING_EQUAL_CASE_INSENSITIVE'(S1,S2,Res) :- b_string_equal_case_insensitive(S1,S2,Res).
1172
1173		:- assert_must_succeed(( external_functions:call_external_function('STRING_LENGTH',[a],[string(a)],int(1),integer,unknown,_WF) )).
1174		% function to get length of a string
1175		external_fun_type('STRING_LENGTH',[],[string,integer]).
1176		:- public 'STRING_LENGTH'/2.
1177		'STRING_LENGTH'(S,L) :- b_string_length(S,L).
1178
1179		:- use_module(kernel_strings,[b_string_split_wf/4, b_string_join_wf/5]).
1180
1181		% function to split a string into a list of strings which were delimited by a separator
1182		% WARNING: if the seperator is of length more than one, then first match-strategy will be used
1183		external_fun_can_be_inverted('STRING_SPLIT').
1184		expects_waitflag('STRING_SPLIT').
1185		external_fun_type('STRING_SPLIT',[],[string,string,seq(string)]).
1186		:- public 'STRING_SPLIT'/4.
1187		'STRING_SPLIT'(Str,Sep,Strings,WF) :- b_string_split_wf(Str,Sep,Strings,WF).
1188
1189		:- public 'STRING_JOIN'/5.
1190		expects_waitflag('STRING_JOIN').
1191		expects_spaninfo('STRING_JOIN').
1192		external_fun_type('STRING_JOIN',[],[seq(string),string,string]).
1193		'STRING_JOIN'(SplitAtoms,Sep,Res,Span,WF) :- b_string_join_wf(SplitAtoms,Sep,Res,Span,WF).
1194
1195
1196		expects_waitflag('STRING_CONTAINS_STRING').
1197		external_fun_type('STRING_CONTAINS_STRING',[],[string,string,boolean]).
1198		% TRUE when arg2 occurs as contiguous substring in arg1
1199		:- public 'STRING_CONTAINS_STRING'/4.
1200		:- block 'STRING_CONTAINS_STRING'(-,?,?,?), 'STRING_CONTAINS_STRING'(?,-,?,?).
1201		'STRING_CONTAINS_STRING'(string(A),string(B),PredRes,_WF) :-
1202		string_contains_string_aux(A,B,PredRes).
1203		:- use_module(library(lists),[sublist/5]).
1204		% TO DO: we could enumerate B if A known and waitflag instantiated
1205		:- block string_contains_string_aux(-,?,?),string_contains_string_aux(?,-,?).
1206		string_contains_string_aux(A,B,PredRes) :-
1207		atom_codes(A,ACodes),
1208		atom_codes(B,BCodes),
1209	?	(sublist(ACodes,BCodes,_,_,_) -> PredRes=pred_true ; PredRes=pred_false).
1210
1211		:- use_module(kernel_strings,[b_substring_wf/6]).
1212		:- public 'SUB_STRING'/6.
1213		expects_spaninfo('SUB_STRING').
1214		expects_waitflag('SUB_STRING').
1215		external_fun_type('SUB_STRING',[],[string,integer,integer,string]).
1216		'SUB_STRING'(S,From,Len,Res,Span,WF) :- b_substring_wf(S,From,Len,Res,Span,WF).
1217
1218
1219		:- use_module(kernel_strings,[b_string_replace/4]).
1220		:- public 'STRING_REPLACE'/4.
1221		external_fun_type('STRING_REPLACE',[],[string,string,string,string]).
1222		'STRING_REPLACE'(S,Pat,New,Res) :- b_string_replace(S,Pat,New,Res).
1223
1224
1225		:- use_module(probsrc(kernel_freetypes), [get_freetype_id/2, get_freeval_type/3, registered_freetype_case_value/3]).
1226		:- use_module(probsrc(translate), [pretty_type/2]).
1227		:- use_module(probsrc(btypechecker), [unify_types_werrors/4]).
1228
1229		external_fun_type('STRING_IS_FREETYPE',[],[string,boolean]).
1230		:- public 'STRING_IS_FREETYPE'/2.
1231		:- block 'STRING_IS_FREETYPE'(-,?).
1232		'STRING_IS_FREETYPE'(string(ID),Res) :-
1233		get_freeval_type(_,ID,_) -> Res=pred_true ; Res=pred_false.
1234
1235		external_fun_has_wd_condition('STRING_TO_FREETYPE').
1236		external_fun_type('STRING_TO_FREETYPE',[F],[string,F]). % F is freetype case
1237		expects_type('STRING_TO_FREETYPE').
1238		expects_spaninfo('STRING_TO_FREETYPE').
1239		:- public 'STRING_TO_FREETYPE'/4.
1240		:- block 'STRING_TO_FREETYPE'(-,?,?,?).
1241		'STRING_TO_FREETYPE'(string(ID),Value,Type,Span) :-
1242		string_to_freetype2(ID,Value,Type,Span).
1243
1244		:- block string_to_freetype2(-,?,?,?).
1245		string_to_freetype2(ID,Value,Type,Span) :-
1246		get_freetype_id(Type,FreetypeId), !, % checks implicitly that Type is freetype
1247		check_is_freetype_case(FreetypeId,ID,ArgType,Span),
1248		(Type = set(couple(_,freetype(_)))
1249		-> ExpectedType = set(couple(ArgType,freetype(FreetypeId)))
1250		; ExpectedType = freetype(FreetypeId)
1251		),
1252		unify_types_werrors(ExpectedType,Type,Span,'STRING_TO_FREETYPE'),
1253		(registered_freetype_case_value(ID,Type,Value) -> true
1254		; add_error('STRING_TO_FREETYPE','error while accessing case value:',ID,Span)
1255		).
1256		string_to_freetype2(ID,_,Type,Span) :-
1257		(nonvar(ID) -> pretty_type(Type,TS),
1258		add_error('STRING_TO_FREETYPE','STRING_TO_FREETYPE: Type mismatch: expected FREETYPE or FREETYPE case function (T <-> FREETYPE), but was',TS,Span)
1259		; add_error('STRING_TO_FREETYPE','STRING_TO_FREETYPE cannot be inverted',ID,Span)),
1260		fail.
1261
1262		:- block check_is_freetype_case(?,-,?,?).
1263		check_is_freetype_case(FreetypeId,ID,ArgType,_) :- get_freeval_type(FreetypeId,ID,ArgType), !.
1264		check_is_freetype_case(_,ID,_,Span) :-
1265		add_error('STRING_TO_FREETYPE','STRING_TO_FREETYPE: no FREETYPE case found for string',ID,Span),
1266		fail.
1267
1268
1269		external_fun_has_wd_condition('TYPED_STRING_TO_ENUM').
1270		expects_waitflag('TYPED_STRING_TO_ENUM').
1271		expects_spaninfo('TYPED_STRING_TO_ENUM').
1272		external_fun_type('TYPED_STRING_TO_ENUM',[T],[set(T),string,T]).
1273		:- public 'TYPED_STRING_TO_ENUM'/5.
1274		:- block 'TYPED_STRING_TO_ENUM'(?,-,-,?,?),'TYPED_STRING_TO_ENUM'(-,?,?,?,?).
1275		'TYPED_STRING_TO_ENUM'(Type,string(S),Res,Span,WF) :-
1276		string_to_enum2(S,fd(Nr,GS),_,Span),
1277		check_type(Type,S,Nr,GS,Res,Span,WF).
1278
1279		:- block check_type(-,?,?, ?,?,?,?), check_type(?,-,?, ?,?,?,?), check_type(?,?,-, ?,?,?,?).
1280		check_type(GSTypeExpr,S,Nr,GS,Res,Span,WF) :-
1281		get_global_set_value_type(GSTypeExpr,'TYPED_STRING_TO_ENUM',ExpectedGS),
1282		ExpectedGS=GS,
1283		!,
1284		membership_test_wf(GSTypeExpr,fd(Nr,GS),MemTest,WF),
1285		check_value(MemTest,Nr,GS,Res,S,GSTypeExpr,Span,WF).
1286		check_type(GSTypeExpr,S,_,GS,_,Span,WF) :-
1287		get_global_set_value_type(GSTypeExpr,'TYPED_STRING_TO_ENUM',ExpectedGS),
1288		tools:ajoin(['String value ',S,' is of type ',GS,' and not of expected type:'],Msg),
1289		add_wd_error_span(Msg,ExpectedGS,Span,WF).
1290
1291		:- block check_value(-,?,?,?,?,?,?,?).
1292		check_value(pred_true,Nr,GS,Res,_,_,_,_) :- !, Res=fd(Nr,GS).
1293		check_value(pred_false,_,_GS,_,S,GSTypeExpr,Span,WF) :-
1294		tools:ajoin(['String value ',S,' is of correct type but not in set:'],Msg),
1295		translate:translate_bvalue(GSTypeExpr,SetStr),
1296		add_wd_error_span(Msg,SetStr,Span,WF).
1297
1298		% get type of a set of enumerated/deferred set elements
1299		get_global_set_value_type(global_set(GS),_,Res) :- !, Res=GS.
1300		get_global_set_value_type([fd(_,GS)|_],_,Res) :- !, Res=GS.
1301		get_global_set_value_type(avl_set(node(fd(_,GS),_True,_,_,_)),_,Res) :- !, Res=GS.
1302		get_global_set_value_type(Val,Source,_) :- translate:translate_bvalue(Val,VS),
1303		add_error(Source,'First argument of illegal type, it must be a set of deferred or enumerated set elements:',VS),fail.
1304
1305		:- use_module(probsrc(translate), [pretty_type/2]).
1306
1307		external_fun_can_be_inverted('STRING_TO_ENUM').
1308		external_fun_has_wd_condition('STRING_TO_ENUM').
1309		external_fun_type('STRING_TO_ENUM',[G],[string,G]). % G is enumerated set
1310		expects_type('STRING_TO_ENUM').
1311		expects_spaninfo('STRING_TO_ENUM').
1312		:- public 'STRING_TO_ENUM'/4.
1313		:- block 'STRING_TO_ENUM'(-,-,?,?).
1314		'STRING_TO_ENUM'(string(S),FD,global(Type),Span) :- !, string_to_enum2(S,FD,Type,Span).
1315		'STRING_TO_ENUM'(_,_,Type,Span) :- pretty_type(Type,TS),
1316		add_error('STRING_TO_ENUM','Illegal type for STRING_TO_ENUM (requires a SET type): ',TS,Span),fail.
1317
1318		:- block string_to_enum2(-,-,?,?).
1319		string_to_enum2(S,Res,Type,Span) :- nonvar(S),!,
1320		(b_global_sets:lookup_global_constant(S,FD),
1321		FD = fd(_,GS)
1322		-> check_type_aux(Type,GS,S,Span),
1323		Res=FD % fd(Nr,GS)
1324		; % TO DO: use add_wd_error_set_result
1325		add_error('STRING_TO_ENUM','Could not convert string to enumerated set element: ',S,Span),fail).
1326		string_to_enum2(S,fd(Nr,GS),Type,Span) :-
1327		string_to_enum3(S,Nr,GS,Type,Span).
1328
1329
1330		check_type_aux(Type,GS,S,Span) :- Type \= GS,!,
1331		ajoin(['String value "',S,'" has illegal type ',GS,', expected: '],Msg),
1332		add_error('STRING_TO_ENUM',Msg,Type,Span),
1333		fail.
1334		check_type_aux(_,_,_,_).
1335
1336		:- block string_to_enum3(-,-,?,?,?),string_to_enum3(-,?,-,?,?).
1337		string_to_enum3(S,Nr,GS,Type,Span) :- nonvar(S),!,
1338		(b_global_sets:lookup_global_constant(S,fd(SNr,SGS))
1339		-> check_type_aux(Type,SGS,S,Span),
1340		(SGS,SNr) = (GS,Nr)
1341		; add_error('STRING_TO_ENUM','Could not convert string to enumerated set element: ',S,Span),fail).
1342		string_to_enum3(S,Nr,GS,_,Span) :-
1343		(b_global_sets:is_b_global_constant_hash(GS,Nr,GNS)
1344		-> GNS=S
1345		; add_error('STRING_TO_ENUM','Could not convert deferred set element to string: ',GS:Nr,Span),fail).
1346
1347		:- use_module(kernel_strings,[b_string_is_int/2]).
1348		external_fun_type('STRING_IS_INT',[],[string,boolean]).
1349		:- public 'GET_STRING_IS_INT'/2.
1350		'STRING_IS_INT'(S,Res) :- b_string_is_int(S,Res).
1351
1352		:- use_module(kernel_strings,[b_string_is_number/2]).
1353		external_fun_type('STRING_IS_NUMBER',[],[string,boolean]).
1354		:- public 'GET_STRING_IS_NUMBER'/2.
1355		'STRING_IS_NUMBER'(S,Res) :- b_string_is_number(S,Res).
1356
1357		:- use_module(kernel_strings,[b_string_is_decimal/2]).
1358		external_fun_type('STRING_IS_DECIMAL',[],[string,boolean]).
1359		:- public 'GET_STRING_IS_DECIMAL'/2.
1360		'STRING_IS_DECIMAL'(S,Res) :- b_string_is_decimal(S,Res).
1361
1362		external_fun_type('STRING_IS_ALPHANUMERIC',[],[string,boolean]).
1363		:- use_module(kernel_strings,[b_string_is_alphanumerical/2]).
1364		:- public 'GET_STRING_IS_ALPHANUMERIC'/2.
1365		'STRING_IS_ALPHANUMERIC'(X,Res) :- b_string_is_alphanumerical(X,Res).
1366
1367		% synonyms as use for functions to BOOL rather than predicates
1368		'GET_STRING_EQUAL_CASE_INSENSITIVE'(S1,S2,Res) :- 'STRING_EQUAL_CASE_INSENSITIVE'(S1,S2,Res).
1369		'GET_STRING_IS_ALPHANUMERIC'(S,Res) :- 'STRING_IS_ALPHANUMERIC'(S,Res).
1370		'GET_STRING_IS_DECIMAL'(S,Res) :- 'STRING_IS_DECIMAL'(S,Res).
1371		'GET_STRING_IS_NUMBER'(S,Res) :- 'STRING_IS_NUMBER'(S,Res).
1372		'GET_STRING_IS_INT'(S,Res) :- 'STRING_IS_INT'(S,Res).
1373
1374		% A Utility to convert Decimal Strings to Integers
1375		% TO DO: make a more precise version using just integers: currently DEC_STRING_TO_INT("1024.235",2) = 102423 !
1376		external_fun_has_wd_condition('DEC_STRING_TO_INT').
1377		expects_spaninfo('DEC_STRING_TO_INT').
1378		expects_waitflag('DEC_STRING_TO_INT').
1379		external_fun_type('DEC_STRING_TO_INT',[],[string,integer,integer]).
1380
1381		:- assert_must_succeed((atom_codes(A,"1024"),
1382		external_functions:'DEC_STRING_TO_INT'(string(A),int(0),int(1024),unknown,no_wf_available))).
1383		:- assert_must_succeed((atom_codes(A,"1024.1"),
1384		external_functions:'DEC_STRING_TO_INT'(string(A),int(1),int(10241),unknown,no_wf_available))).
1385		:- public 'DEC_STRING_TO_INT'/5.
1386		:- block 'DEC_STRING_TO_INT'(-,?,?,?,?),'DEC_STRING_TO_INT'(?,-,?,?,?).
1387		'DEC_STRING_TO_INT'(string(S),int(Precision),int(Res),Span,WF) :-
1388		dec_str_to_int(S,Precision,Res,Span,WF).
1389
1390		:- use_module(tools,[split_chars/3]).
1391		:- block dec_str_to_int(-,?,?,?,?),dec_str_to_int(?,-,?,?,?).
1392		dec_str_to_int(S,Precision,Res,Span,WF) :-
1393		atom_codes(S,Codes),
1394		split_chars(Codes,".",[Left|T]),
1395		(T=[] -> Right="", dec_str_to_int2(Left,Right,Precision,Res,Span,WF)
1396		; T = [Right] -> dec_str_to_int2(Left,Right,Precision,Res,Span,WF)
1397		; %add_error(external_functions,'Expecting integer or decimal number:',S,Span),fail
1398		add_wd_error_span('String contains multiple dots, expecting integer or decimal number for DEC_STRING_TO_INT:',S,Span,WF)
1399		).
1400
1401
1402		get_sign([45|T],-1,Res) :- !,strip_ws(T,Res).
1403		get_sign([32|T],PosNeg,Res) :- !, get_sign(T,PosNeg,Res).
1404		get_sign(L,1,L).
1405		strip_ws([32|T],R) :- !, strip_ws(T,R).
1406		strip_ws(R,R).
1407
1408	?	rounding([H|_]) :- member(H,"56789").
1409
1410		is_zero(48). % code of 0
1411		is_digit(Code) :- Code >= 48, Code =< 57.
1412		check_digits(Codes,_,_,Res) :- maplist(is_digit,Codes),!,Res=ok.
1413		check_digits(Codes,Span,WF,ko) :-
1414		append([39|Codes],[39],C2), atom_codes(A,C2), % generate atom with quotes
1415		%add_error(external_functions,'Illegal number: ',A,Span),fail.
1416		add_wd_error_span('String contains illegal characters, expecting integer or decimal number for DEC_STRING_TO_INT:',A,Span,WF).
1417
1418		dec_safe_number_codes(Number,[],_,_) :- !, Number=0.
1419		dec_safe_number_codes(Number,Codes,Span,WF) :-
1420		(safe_number_codes(Nr,Codes) -> Number=Nr
1421		; append([39|Codes],[39],C2), atom_codes(A,C2),
1422		%add_error(external_functions,'Cannot convert to number: ',A,Span),fail
1423		add_wd_error_span('Cannot convert string to number for DEC_STRING_TO_INT:',A,Span,WF),
1424		Number='$WDERROR$'
1425		).
1426
1427		dec_str_to_int2(Left,Right,Precision,Res,Span,WF) :-
1428		maplist(is_zero,Right), Precision >= 0,
1429		!,
1430		dec_safe_number_codes(LeftNumber,Left,Span,WF),
1431		(LeftNumber=='$WDERROR$' -> true
1432		; safe_is('DEC_STRING_TO_INT',Res,LeftNumber*(10^Precision),Span,WF)).
1433		dec_str_to_int2(Left,Right,Precision,Res,Span,WF) :- get_sign(Left,Sign,NewLeft),
1434		check_digits(NewLeft,Span,WF,Res1), check_digits(Right,Span,WF,Res2),
1435		(Res1==ok,Res2==ok
1436		-> shift(Precision,NewLeft,Right,ResL,ResR),
1437		dec_safe_number_codes(LeftInteger,ResL,Span,WF),
1438	?	(rounding(ResR)
1439		-> Res is Sign*(LeftInteger+1)
1440		; Res is Sign*LeftInteger)
1441		; true).
1442
1443		:- use_module(library(lists),[append_length/4]).
1444		% shift decimal values left or right depending on precision argument
1445		shift(0,Left,Right,Left,Right) :- !.
1446		shift(Pos,Left,Right,ResL,ResR) :- Pos>0,!,
1447		append(Left,Left2,ResL),
1448		length(Right,RLen),
1449		(RLen >= Pos -> append_length(Left2,ResR,Right,Pos) % take first Pos elements from R and shift left of .
1450		; append(Right,Zeros,Left2), % take all of Right and add Zeros
1451		ResR = [],
1452		NrZeros is Pos - RLen,
1453		length(Zeros,NrZeros), maplist(is_zero,Zeros)
1454		).
1455		shift(Pos,Left,Right,ResL,ResR) :- % Pos < 0
1456		length(Left,LLen), PPos is -Pos,
1457		(LLen >= PPos
1458		-> Shift is LLen-PPos, append_length(ResL,L2,Left,Shift), append(L2,Right,ResR)
1459		; %Result always 0.0...
1460		NrZeros is PPos - LLen,length(Zeros,NrZeros), maplist(is_zero,Zeros),
1461		ResL = "0",
1462		append(Zeros,LR,ResR),
1463		append(Left,Right,LR)).
1464
1465		:- public 'STRING_PADLEFT'/6.
1466		external_fun_has_wd_condition('STRING_PADLEFT').
1467		expects_waitflag('STRING_PADLEFT').
1468		expects_spaninfo('STRING_PADLEFT').
1469		external_fun_type('STRING_PADLEFT',[],[string,integer,string,string]).
1470		:- block 'STRING_PADLEFT'(-,?,?,?,?,?),'STRING_PADLEFT'(?,-,?,?,?,?),'STRING_PADLEFT'(?,?,-,?,?,?).
1471		'STRING_PADLEFT'(string(S),int(Width),string(PadChar),Res,Span,WF) :-
1472		string_pad_left(S,Width,PadChar,Res,Span,WF).
1473
1474		:- block string_pad_left(-,?,?,?,?,?),string_pad_left(?,-,?,?,?,?),string_pad_left(?,?,-,?,?,?).
1475		string_pad_left(_S,_Width,PadChar,_Res,Span,WF) :-
1476		atom_length(PadChar,Len), Len \= 1,
1477		!,
1478		add_wd_error_span('STRING_PADLEFT requires padding string of length 1: ',PadChar,Span,WF).
1479		string_pad_left(S,Width,PadChar,Res,_Span,_WF) :-
1480		atom_length(S,Len),
1481		(Len >= Width % no padding necessary
1482		-> Res = string(S)
1483		; ToPad is Width-Len,
1484		atom_codes(PadChar,[PadCode]),
1485		atom_codes(S,Codes),
1486		pad_char(ToPad,PadCode,PaddedCodes,Codes),
1487		atom_codes(ResStr,PaddedCodes),
1488		Res = string(ResStr)
1489		).
1490
1491		pad_char(0,_,Res,Tail) :- !, Res=Tail.
1492		pad_char(Nr,Code,[Code|TR],Tail) :- N1 is Nr-1, pad_char(N1,Code,TR,Tail).
1493
1494
1495
1496
1497		:- use_module(kernel_strings,[b_string_to_int_wf/4]).
1498		external_fun_has_wd_condition('STRING_TO_INT').
1499		expects_waitflag('STRING_TO_INT').
1500		expects_spaninfo('STRING_TO_INT').
1501		external_fun_type('STRING_TO_INT',[],[string,integer]).
1502		:- public 'STRING_TO_INT'/4.
1503		:- block 'STRING_TO_INT'(-,-,?,?).
1504		'STRING_TO_INT'(S,I,Span,WF) :- b_string_to_int_wf(S,I,Span,WF).
1505
1506
1507		:- use_module(kernel_strings,[int_to_b_string/2]).
1508		external_fun_type('INT_TO_STRING',[],[integer,string]).
1509		:- public 'INT_TO_STRING'/2.
1510		'INT_TO_STRING'(I,S) :- int_to_b_string(I,S).
1511
1512		:- use_module(kernel_strings,[int_to_dec_b_string/3, real_to_dec_b_string/4]).
1513		external_fun_type('INT_TO_DEC_STRING',[],[integer,integer,string]).
1514		:- public 'INT_TO_DEC_STRING'/3.
1515		'INT_TO_DEC_STRING'(I,Precision,S) :- int_to_dec_b_string(I,Precision,S).
1516
1517		external_fun_type('REAL_TO_DEC_STRING',[],[real,integer,string]).
1518		expects_spaninfo('REAL_TO_DEC_STRING').
1519		:- public 'REAL_TO_DEC_STRING'/4.
1520		'REAL_TO_DEC_STRING'(R,Precision,S,Span) :- real_to_dec_b_string(R,Precision,S,Span).
1521
1522		:- use_module(tools,[safe_read_term_from_atom/2]).
1523		% only for internal use in XTL mode! (used in execute by predicate to pass terms as parameters in a B predicate)
1524		external_fun_type('STRING_TO_TERM',[],[string,string]).
1525		:- public 'STRING_TO_TERM'/2.
1526		:- block 'STRING_TO_TERM'(-,?).
1527		'STRING_TO_TERM'(string(S),term(Term)) :-
1528		safe_read_term_from_atom(S,Term).
1529
1530
1531		:- use_module(kernel_strings,[to_b_string_with_type/3,to_b_string_with_type_and_options/4,format_to_b_string/3,format_to_b_string_with_type/4]).
1532		external_fun_type('TO_STRING',[X],[X,string]).
1533		expects_waitflag('TO_STRING').
1534		expects_spaninfo('TO_STRING').
1535		expects_unevaluated_args('TO_STRING').
1536		:- public 'TO_STRING'/5.
1537		'TO_STRING'(Value,S,[TExpr],Span,WF) :-
1538		get_large_finite_wait_flag(to_string,WF,AWF), %get_enumeration_finished_wait_flag(WF,AWF),
1539		tostring6(Value,TExpr,S,Span,WF,AWF).
1540
1541		:- block tostring6(-,?,?,?,?,-).
1542		tostring6(Value,TExpr,S,_,_WF,_AWF) :- (nonvar(Value); nonvar(S)),!,
1543		get_texpr_type(TExpr, Type),
1544		to_b_string_with_type(Value,Type,S).
1545		tostring6(Val,_,string(S),Span,WF,_) :-
1546		add_wd_error_span('Could not compute value in TO_STRING',Val,Span,WF),
1547		S = '<<WELL-DEF-ERROR>>'.
1548
1549		external_fun_type('TO_STRING_UNICODE',[X],[X,string]).
1550		expects_unevaluated_args('TO_STRING_UNICODE').
1551		:- public 'TO_STRING_UNICODE'/3.
1552		'TO_STRING_UNICODE'(Value,S,[TExpr]) :-
1553		get_texpr_type(TExpr, Type),
1554		to_b_string_with_type_and_options(Value,Type,[unicode],S).
1555
1556		external_fun_type('FORMAT_TO_STRING',[X],[string,seq(X),string]).
1557		expects_unevaluated_args('FORMAT_TO_STRING').
1558		:- public 'FORMAT_TO_STRING'/4.
1559		'FORMAT_TO_STRING'(FormatString,ListOfStrings,Res,[_,TExprs]) :-
1560		(get_texpr_type(TExprs, seq(Type)) % if the type of the given format args is a sequence we can use the contained type
1561		-> format_to_b_string_with_type(FormatString,ListOfStrings,Type,Res)
1562		; format_to_b_string(FormatString,ListOfStrings,Res)).
1563
1564
1565		external_fun_type('STRINGIFY',[X],[X,string]).
1566		expects_unevaluated_args('STRINGIFY').
1567		:- public 'PRETTY_PRINT_TO_STRING'/3.
1568		:- public 'STRINGIFY'/3.
1569		% pretty print a formula to string, the value is not used (but will currently be evaluated !)
1570		% TO DO: should we enforce a certain mode? (ascii, unicode, ...)
1571
1572		'PRETTY_PRINT_TO_STRING'(V,R,A) :- 'STRINGIFY'(V,R,A). % old name
1573		'STRINGIFY'(_Value,Res,[AST]) :-
1574		translate:translate_bexpression(AST,S),
1575		Res = string(S).
1576
1577		external_fun_type('HASH',[X],[X,integer]).
1578		:- public 'HASH'/2.
1579		:- block 'HASH'(-,?).
1580		'HASH'(Value,Int) :-
1581		% TO DO: use ground_value_check
1582		when(ground(Value),(term_hash(Value,H),Int=int(H))).
1583
1584
1585		external_fun_type('TO_INT',[X],[X,integer]). % can translate enumerated/deferred set elements to integer
1586		expects_waitflag('TO_INT').
1587		expects_spaninfo('TO_INT').
1588		:- public 'TO_INT'/4.
1589		:- block 'TO_INT'(-,?,?,?).
1590		'TO_INT'(fd(X,_),I,_,_) :- !, I=int(X).
1591		'TO_INT'(int(X),I,_,_) :- !, I=int(X).
1592		'TO_INT'(string(X),I,Span,WF) :- !, 'STRING_TO_INT'(string(X),I,Span,WF).
1593		'TO_INT'(Val,_,Span,_WF) :- !, translate:translate_bvalue(Val,VS),
1594		add_error(external_functions,'Illegal argument type for TO_INT:',VS,Span).
1595
1596
1597		external_fun_has_wd_condition('INT_TO_ENUM').
1598		expects_waitflag('INT_TO_ENUM').
1599		expects_spaninfo('INT_TO_ENUM').
1600		external_fun_type('INT_TO_ENUM',[T],[set(T),integer,T]).
1601		:- public 'INT_TO_ENUM'/5.
1602		:- block 'INT_TO_ENUM'(?,-,?,?,?),'INT_TO_ENUM'(-,?,?,?,?).
1603		'INT_TO_ENUM'(GSTypeExpr,int(I),Res,Span,WF) :-
1604		get_global_set_value_type(GSTypeExpr,'INT_TO_ENUM',GS),
1605		int2enum(GS,GSTypeExpr,I,Res,Span,WF).
1606		:- use_module(b_global_sets,[b_get_fd_type_bounds/3]).
1607
1608		:- use_module(library(clpfd), []). % for .. operator
1609		:- block int2enum(?,?,-,?,?,?).
1610		int2enum(GS,_,I,_,Span,WF) :-
1611		b_get_fd_type_bounds(GS,Low,Up),
1612		(I<Low ; integer(Up),I>Up),!,
1613		tools:ajoin(['INT_TO_ENUM integer value ',I,' is not in expected range for ',GS,' :'],Msg),
1614		add_wd_error_span(Msg,Low..Up,Span,WF).
1615		int2enum(GS,GSTypeExpr,I,Res,Span,WF) :- Res = fd(I,GS),
1616		membership_test_wf(GSTypeExpr,Res,MemTest,WF),
1617		check_value(MemTest,I,GS,Res,I,GSTypeExpr,Span,WF).
1618
1619		% -------------------------------
1620		% REGULAR EXPRESSION FUNCTIONS
1621		% Using ECMAScript syntax: http://www.cplusplus.com/reference/regex/ECMAScript/
1622
1623		:- use_module(extension('regexp/regexp'),
1624		[regexp_match/4, is_regexp/1, regexp_replace/5,
1625		regexp_search_first/4, regexp_search_first_detailed/5]).
1626		external_fun_type('REGEX_MATCH',[],[string,string,boolean]).
1627		expects_spaninfo('REGEX_MATCH').
1628		:- public 'REGEX_MATCH'/4, 'REGEX_IMATCH'/4.
1629		:- block 'REGEX_MATCH'(-,?,?,?), 'REGEX_MATCH'(?,-,?,?).
1630		'REGEX_MATCH'(string(String),string(Pattern),Res,Span) :-
1631		block_regex_match(String,Pattern,match_case,Res,Span).
1632
1633		external_fun_type('REGEX_IMATCH',[],[string,string,boolean]).
1634		expects_spaninfo('REGEX_IMATCH').
1635		:- block 'REGEX_IMATCH'(-,?,?,?), 'REGEX_IMATCH'(?,-,?,?).
1636		'REGEX_IMATCH'(string(String),string(Pattern),Res,Span) :-
1637		block_regex_match(String,Pattern,ignore_case,Res,Span).
1638
1639		:- block block_regex_match(-,?,?,?,?), block_regex_match(?,-,?,?,?).
1640		block_regex_match(String,Pattern,IgnoreCase,Res,Span) :-
1641		(regexp_match(String,Pattern,IgnoreCase,Span) -> Res=pred_true ; Res=pred_false).
1642
1643		external_fun_type('IS_REGEX',[],[string,boolean]).
1644		:- public 'IS_REGEX'/2.
1645		:- block 'IS_REGEX'(-,?).
1646		'IS_REGEX'(string(Pattern),Res) :- block_is_regexp(Pattern,Res).
1647		:- block block_is_regexp(-,?).
1648		block_is_regexp(Pattern,Res) :-
1649		(is_regexp(Pattern) -> Res=pred_true ; Res=pred_false).
1650
1651
1652		:- public 'GET_IS_REGEX'/2.
1653		:- public 'GET_IS_REGEX_MATCH'/4.
1654		:- public 'GET_IS_REGEX_IMATCH'/4.
1655		expects_spaninfo('GET_IS_REGEX_MATCH').
1656		expects_spaninfo('GET_IS_REGEX_IMATCH').
1657		% synonyms as use for functions to BOOL rather than predicates
1658		'GET_IS_REGEX'(A,Res) :- 'IS_REGEX'(A,Res).
1659		'GET_IS_REGEX_MATCH'(S1,S2,Res,Span) :- 'REGEX_MATCH'(S1,S2,Res,Span).
1660		'GET_IS_REGEX_IMATCH'(S1,S2,Res,Span) :- 'REGEX_IMATCH'(S1,S2,Res,Span).
1661
1662		external_fun_type('REGEX_REPLACE',[],[string,string,string,string]).
1663		:- public 'REGEX_REPLACE'/4.
1664		:- block 'REGEX_REPLACE'(-,?,?,?), 'REGEX_REPLACE'(?,-,?,?), 'REGEX_REPLACE'(?,?,-,?).
1665		'REGEX_REPLACE'(string(String),string(Pattern),string(ReplString),Res) :-
1666		block_regex_replace(String,Pattern,match_case,ReplString,Res).
1667
1668		external_fun_type('REGEX_IREPLACE',[],[string,string,string,string]).
1669		:- public 'REGEX_IREPLACE'/4.
1670		:- block 'REGEX_IREPLACE'(-,?,?,?), 'REGEX_IREPLACE'(?,-,?,?), 'REGEX_IREPLACE'(?,?,-,?).
1671		'REGEX_IREPLACE'(string(String),string(Pattern),string(ReplString),Res) :-
1672		block_regex_replace(String,Pattern,ignore_case,ReplString,Res).
1673
1674		:- block block_regex_replace(-,?,?,?,?), block_regex_replace(?,-,?,?,?), block_regex_replace(?,?,?,-,?).
1675		block_regex_replace(String,Pattern,IgnoreCase,ReplString,Result) :-
1676		regexp_replace(String,Pattern,IgnoreCase,ReplString,Res), Result=string(Res).
1677
1678
1679		external_fun_type('REGEX_SEARCH_STR',[],[string,string,string]).
1680		:- public 'REGEX_SEARCH_STR'/3, 'REGEX_ISEARCH_STR'/3.
1681		:- block 'REGEX_SEARCH_STR'(-,?,?), 'REGEX_SEARCH_STR'(?,-,?).
1682		'REGEX_SEARCH_STR'(string(String),string(Pattern),Res) :- block_regex_search_first(String,Pattern,match_case,Res).
1683		external_fun_type('REGEX_ISEARCH_STR',[],[string,string,string]).
1684		:- block 'REGEX_ISEARCH_STR'(-,?,?), 'REGEX_ISEARCH_STR'(?,-,?).
1685		'REGEX_ISEARCH_STR'(string(String),string(Pattern),Res) :- block_regex_search_first(String,Pattern,ignore_case,Res).
1686		:- block block_regex_search_first(-,?,?,?), block_regex_search_first(?,-,?,?).
1687		block_regex_search_first(String,Pattern,IgnoreCase,Result) :-
1688		regexp_search_first(String,Pattern,IgnoreCase,Res), Result=string(Res).
1689
1690		external_fun_type('REGEX_SEARCH',[],[string,integer,string,
1691		record([field(length,integer),field(position,integer),
1692		field(string,string),
1693		field(submatches,seq(string))])]).
1694		:- public 'REGEX_SEARCH'/4, 'REGEX_ISEARCH'/4.
1695		'REGEX_SEARCH'(S,From,Pat,Res) :- 'REGEX_SEARCH5'(S,From,Pat,match_case,Res).
1696		external_fun_type('REGEX_ISEARCH',TV,T) :- external_fun_type('REGEX_SEARCH',TV,T).
1697		'REGEX_ISEARCH'(S,From,Pat,Res) :- 'REGEX_SEARCH5'(S,From,Pat,ignore_case,Res).
1698
1699		:- block 'REGEX_SEARCH5'(-,?,?,?,?), 'REGEX_SEARCH5'(?,-,?,?,?), 'REGEX_SEARCH5'(?,?,-,?,?).
1700		'REGEX_SEARCH5'(string(String),int(From),string(Pattern),IgnoreCase,Res) :-
1701		block_regex_search_first_detailed(String,From,Pattern,IgnoreCase,Res).
1702
1703		:- block block_regex_search_first_detailed(-,?,?,?,?),
1704		block_regex_search_first_detailed(?,-,?,?,?), block_regex_search_first_detailed(?,?,-,?,?).
1705		block_regex_search_first_detailed(String,FromIndex,Pattern,IgnoreCase,Result) :-
1706		regexp_search_first_detailed(String,FromIndex,Pattern,IgnoreCase,Res),
1707		construct_match_result(Res,Result).
1708
1709		construct_match_result(match(Pos,Len,[Str|SubMatches]),Res) :- !,
1710		BPos is Pos+1,
1711		maplist(mkstring,SubMatches,SubMatchesStr),
1712		convert_list_to_seq(SubMatchesStr,SubList),
1713		Res = rec([field(length,int(Len)), field(position,int(BPos)),
1714		field(string,string(Str)), field(submatches,SubList)]).
1715		construct_match_result('no-match',Res) :- !,
1716		Res = rec([field(length,int(-1)), field(position,int(-1)), field(string,string('')), field(submatches,[])]).
1717
1718		mkstring(A,string(A)).
1719
1720		:- use_module(extension('regexp/regexp'), [regexp_search_all/4]).
1721		external_fun_type('REGEX_SEARCH_ALL',[],[string,string,seq(string)]).
1722		:- public 'REGEX_SEARCH_ALL'/3, 'REGEX_ISEARCH_ALL'/3.
1723		:- block 'REGEX_SEARCH_ALL'(-,?,?), 'REGEX_SEARCH_ALL'(?,-,?).
1724		'REGEX_SEARCH_ALL'(string(String),string(Pattern),Res) :- block_regex_search_all(String,Pattern,match_case,Res).
1725
1726		external_fun_type('REGEX_ISEARCH_ALL',[],[string,string,seq(string)]).
1727		:- block 'REGEX_ISEARCH_ALL'(-,?,?), 'REGEX_ISEARCH_ALL'(?,-,?).
1728		'REGEX_ISEARCH_ALL'(string(String),string(Pattern),Res) :- block_regex_search_all(String,Pattern,ignore_case,Res).
1729
1730		:- block block_regex_search_all(-,?,?,?), block_regex_search_all(?,-,?,?).
1731		block_regex_search_all(String,Pattern,IgnoreCase,Result) :-
1732		regexp_search_all(String,Pattern,IgnoreCase,Matches),
1733		maplist(mkstring,Matches,MatchesStr),
1734		convert_list_to_seq(MatchesStr,Result).
1735
1736
1737		% -------------------------------
1738
1739		external_fun_type('SHA_HASH',[X],[X,set(couple(integer,integer))]).
1740		expects_waitflag('SHA_HASH').
1741		:- use_module(extension('probhash/probhash'),[raw_sha_hash/2]).
1742		:- use_module(store,[normalise_value_for_var/3]).
1743		:- public 'SHA_HASH'/3.
1744		:- block 'SHA_HASH'(-,?,?).
1745		'SHA_HASH'(Value,Res,WF) :-
1746		normalise_value_for_var('SHA_HASH',Value,NValue),
1747		ground_value_check(NValue,Gr),
1748		sha_hash(NValue,Gr,Res,WF).
1749		:- block sha_hash(?,-,?,?).
1750		sha_hash(Value,_,Res,WF) :-
1751		raw_sha_hash(Value,List),
1752		convert_to_int_seq(List,1,Seq),
1753		equal_object_optimized_wf(Seq,Res,'SHA_HASH',WF).
1754
1755		convert_to_int_seq([],_,[]).
1756		convert_to_int_seq([H|T],N,[(int(N),int(H))|CT]) :- N1 is N+1, convert_to_int_seq(T,N1,CT).
1757
1758		external_fun_type('SHA_HASH_HEX',[X],[X,string]).
1759		:- public 'SHA_HASH_HEX'/2.
1760		:- block 'SHA_HASH_HEX'(-,?).
1761		'SHA_HASH_HEX'(Value,Res) :-
1762		normalise_value_for_var('SHA_HASH_HEX',Value,NValue),
1763		ground_value_check(NValue,Gr),
1764		sha_hash_string(NValue,Gr,Res).
1765		:- block sha_hash_string(?,-,?).
1766		sha_hash_string(Value,_,Res) :-
1767		sha_hash_as_hex_codes(Value,SHAHexCodes), atom_codes(Atom,SHAHexCodes),
1768		Res = string(Atom).
1769
1770		:- use_module(extension('probhash/probhash'),[raw_sha_hash_file/3]).
1771		performs_io('SHA_HASH_FILE_HEX').
1772		expects_spaninfo('SHA_HASH_FILE_HEX').
1773		external_fun_type('SHA_HASH_FILE_HEX',[],[string,string]).
1774		:- public 'SHA_HASH_FILE_HEX'/3.
1775		:- block 'SHA_HASH_FILE_HEX'(-,?,?).
1776		'SHA_HASH_FILE_HEX'(string(File),Res,Span) :-
1777		sha_hash_file(File,Res,Span).
1778		:- block sha_hash_file(-,?,?).
1779		sha_hash_file(File,Res,Span) :-
1780		b_absolute_file_name(File,AFile),
1781		raw_sha_hash_file(AFile,Term,Span),
1782		get_hex_bytes(Term,SHAHexCodes), atom_codes(Atom,SHAHexCodes),
1783		Res = string(Atom).
1784
1785		% -------------------------------
1786
1787		% STRING FILE SYSTEM FUNCTIONS
1788
1789
1790		:- use_module(kernel_objects).
1791		:- use_module(library(file_systems)).
1792		performs_io('FILES').
1793		external_fun_type('FILES',[],[string,set(string)]).
1794		:- public 'FILES'/2.
1795		:- block 'FILES'(-,?).
1796		'FILES'(string(A),L) :- files2(A,L).
1797		:- block files2(-,?).
1798		files2(Dir,List) :- b_absolute_file_name(Dir,ADir),
1799		findall(string(F),file_member_of_directory(ADir,F,_FLong),L),
1800		equal_object_optimized(L,List,files2).
1801		performs_io('FULL_FILES').
1802		external_fun_type('FULL_FILES',[],[string,set(string)]).
1803		:- public 'FULL_FILES'/2.
1804		:- block 'FULL_FILES'(-,?).
1805		'FULL_FILES'(string(A),L) :- full_files2(A,L).
1806		:- block full_files2(-,?).
1807		full_files2(Dir,List) :-
1808		b_absolute_file_name(Dir,ADir),
1809		findall(string(FLong),file_member_of_directory(ADir,_F,FLong),L),
1810		equal_object_optimized(L,List,full_files2).
1811
1812
1813		performs_io('DIRECTORIES').
1814		external_fun_type('DIRECTORIES',[],[string,set(string)]).
1815		:- public 'DIRECTORIES'/2.
1816		:- block 'DIRECTORIES'(-,?).
1817		'DIRECTORIES'(string(A),L) :- dir2(A,L).
1818		:- block dir2(-,?).
1819		dir2(Dir,List) :- b_absolute_file_name(Dir,ADir),
1820		findall(string(F),directory_member_of_directory(ADir,F,_FLong),L),
1821		equal_object_optimized(L,List,dir2).
1822		performs_io('FULL_DIRECTORIES').
1823		external_fun_type('FULL_DIRECTORIES',[],[string,set(string)]).
1824		:- public 'FULL_DIRECTORIES'/2.
1825		:- block 'FULL_DIRECTORIES'(-,?).
1826		'FULL_DIRECTORIES'(string(A),L) :- full_dir2(A,L).
1827		:- block full_dir2(-,?).
1828		full_dir2(Dir,List) :- b_absolute_file_name(Dir,ADir),
1829		findall(string(FLong),directory_member_of_directory(ADir,_,FLong),L),
1830		equal_object_optimized(L,List,full_dir2).
1831
1832		:- public 'GET_FILE_EXISTS'/2.
1833		'GET_FILE_EXISTS'(S,PREDRES) :- 'FILE_EXISTS'(S,PREDRES). % synonym as external function
1834		performs_io('FILE_EXISTS').
1835		external_fun_type('FILE_EXISTS',[],[string,boolean]).
1836		:- public 'FILE_EXISTS'/2.
1837		:- block 'FILE_EXISTS'(-,?).
1838		'FILE_EXISTS'(string(A),PREDRES) :- file_exists2(A,PREDRES).
1839		:- block file_exists2(-,?).
1840		file_exists2(A,PREDRES) :- b_absolute_file_name(A,AA),
1841		(file_exists(AA) -> PREDRES=pred_true ; PREDRES=pred_false).
1842
1843		:- public 'GET_DIRECTORY_EXISTS'/2.
1844		'GET_DIRECTORY_EXISTS'(S,PREDRES) :- 'DIRECTORY_EXISTS'(S,PREDRES). % synonym as external function
1845		performs_io('DIRECTORY_EXISTS').
1846		external_fun_type('DIRECTORY_EXISTS',[],[string,boolean]).
1847		:- public 'DIRECTORY_EXISTS'/2.
1848		:- block 'DIRECTORY_EXISTS'(-,?).
1849		'DIRECTORY_EXISTS'(string(A),PREDRES) :- dir_exists2(A,PREDRES).
1850		:- block dir_exists2(-,?).
1851		dir_exists2(A,PREDRES) :- b_absolute_file_name(A,AA),
1852		(directory_exists(AA) -> PREDRES=pred_true ; PREDRES=pred_false).
1853
1854		:- use_module(tools,[get_parent_directory/2]).
1855		% a variant of the predicate b_absolute_file_name_relative_to_main_machine in bmachine using safe_call (with span):
1856		b_absolute_file_name(File,AbsFileName) :- b_absolute_file_name(File,AbsFileName,unknown).
1857		b_absolute_file_name(File,AbsFileName,Span) :-
1858		bmachine:b_get_main_filename(MainFileName),!,
1859		get_parent_directory(MainFileName,Directory),
1860		% in Jupyter main file is (machine from Jupyter cell).mch, which confuses SICStus as the file does not exist
1861		safe_call(
1862		absolute_file_name(File,AbsFileName,[relative_to(Directory)]),
1863		Span).
1864		b_absolute_file_name(File,AbsFileName,Span) :-
1865		% call is executed without machine context; we could simply throw an error and fail
1866		safe_call(
1867		absolute_file_name(File,AbsFileName),
1868		Span).
1869
1870		:- public 'GET_FILE_PROPERTY'/3.
1871		'GET_FILE_PROPERTY'(S1,S2,PREDRES) :- 'FILE_PROPERTY'(S1,S2,PREDRES). % synonym as external function
1872		performs_io('FILE_PROPERTY').
1873		external_fun_type('FILE_PROPERTY',[],[string,string,boolean]).
1874		:- public 'FILE_PROPERTY'/3.
1875		:- block 'FILE_PROPERTY'(-,?,?), 'FILE_PROPERTY'(?,-,?).
1876		'FILE_PROPERTY'(string(A),string(P),BoolRes) :-
1877		file_property2(A,P,BoolRes).
1878		:- block file_property2(-,?,?), file_property2(?,-,?).
1879		file_property2(File,Prop,BoolRes) :-
1880		b_absolute_file_name(File,AFile),
1881		file_property(AFile,Prop) -> BoolRes=pred_true ; BoolRes=pred_false.
1882		% possible properties: readable, writable, executable
1883
1884		performs_io('FILE_PROPERTY_VALUE').
1885		external_fun_type('FILE_PROPERTY_VALUE',[],[string,string,integer]).
1886		:- public 'FILE_PROPERTY_VALUE'/3.
1887		:- block 'FILE_PROPERTY_VALUE'(-,?,?), 'FILE_PROPERTY_VALUE'(?,-,?).
1888		'FILE_PROPERTY_VALUE'(string(A),string(P),int(R)) :-
1889		file_property_val2(A,P,R).
1890		:- block file_property_val2(-,?,?), file_property_val2(?,-,?).
1891		file_property_val2(File,Prop,Res) :-
1892		b_absolute_file_name(File,AFile),
1893		file_property(AFile,Prop,Val) -> Res=Val
1894		; add_error(external_functions,'Illegal FILE_PROPERTY',Prop),Res=int(-1).
1895		% possible properties:
1896		% size_in_bytes, create_timestamp, modify_timestamp, access_timestamp
1897		% + on unix the follwing is also an integer: owner_user_id, owner_group_id
1898
1899		:- public 'GET_DIRECTORY_PROPERTY'/3.
1900		'GET_DIRECTORY_PROPERTY'(S1,S2,PREDRES) :- 'DIRECTORY_PROPERTY'(S1,S2,PREDRES). % synonym as external function
1901		performs_io('DIRECTORY_PROPERTY').
1902		external_fun_type('DIRECTORY_PROPERTY',[],[string,string,boolean]).
1903		:- public 'DIRECTORY_PROPERTY'/3.
1904		:- block 'DIRECTORY_PROPERTY'(-,?,?), 'DIRECTORY_PROPERTY'(?,-,?).
1905		'DIRECTORY_PROPERTY'(string(A),string(P),BoolRes) :-
1906		dir_property2(A,P,BoolRes).
1907		:- block dir_property2(-,?,?), dir_property2(?,-,?).
1908		dir_property2(File,Prop,BoolRes) :-
1909		b_absolute_file_name(File,AFile),
1910		directory_property(AFile,Prop) -> BoolRes=pred_true ; BoolRes=pred_false.
1911
1912		performs_io('DIRECTORY_PROPERTY_VALUE').
1913		external_fun_type('DIRECTORY_PROPERTY_VALUE',[],[string,string,integer]).
1914		:- public 'DIRECTORY_PROPERTY_VALUE'/3.
1915		:- block 'DIRECTORY_PROPERTY_VALUE'(-,?,?), 'DIRECTORY_PROPERTY_VALUE'(?,-,?).
1916		'DIRECTORY_PROPERTY_VALUE'(string(A),string(P),int(R)) :-
1917		dir_property_val2(A,P,R).
1918		:- block dir_property_val2(-,?,?), dir_property_val2(?,-,?).
1919		dir_property_val2(File,Prop,Res) :-
1920		b_absolute_file_name(File,AFile),
1921		directory_property(AFile,Prop,Val) -> Res=Val
1922		; add_error(external_functions,'Illegal DIRECTORY_PROPERTY',Prop), Res=int(-1).
1923		% --------------------------------
1924
1925		% I/O
1926
1927
1928		% printf as predicate; can also be used as a function to BOOL
1929		expects_spaninfo('fprintf').
1930		external_pred_always_true('fprintf').
1931		:- public fprintf/5.
1932		:- block fprintf(-,?,?,?,?), fprintf(?,-,?,?,?), fprintf(?,?,-,?,?).
1933		fprintf(string(File),string(FormatString),Value,PredRes,Span) :- !, PredRes = pred_true,
1934		when((ground(FormatString),ground(Value)),
1935		fprintf2(File,FormatString,Value,Span)).
1936		fprintf(File,F,V,P,S) :- add_internal_error('Illegal call: ',fprintf(File,F,V,P,S)), P=pred_true.
1937
1938		expects_spaninfo('printf_opt_trace').
1939		external_pred_always_true('printf_opt_trace').
1940		:- public printf_opt_trace/5.
1941		:- block printf_opt_trace(-,?,?,?,?), printf_opt_trace(?,-,?,?,?).
1942		printf_opt_trace(string(FormatString),Value,Trace,PredRes,Span) :- !, PredRes = pred_true,
1943		when((ground(FormatString),ground(Value)),
1944		(fprintf2(user_output,FormatString,Value,Span),
1945		(Trace==pred_true -> try_trace ; true)
1946		)
1947		).
1948		printf_opt_trace(F,V,T,P,S) :- add_internal_error('Illegal call: ',printf_opt_trace(F,V,T,P,S)), P=pred_true.
1949
1950		% try to perform trace commend if we are not in compiled version
1951		try_trace :-
1952		catch(trace, error(existence_error(_,_),_), (
1953		format('Cannot trace into source code in compiled version of ProB!~n<<<Type RETURN-Key to continue>>>',[]),
1954		read_line(user_input,_),nl
1955		)).
1956
1957		expects_spaninfo('printf').
1958		external_pred_always_true('printf').
1959		external_fun_type('printf',[T],[string,seq(T),boolean]).
1960
1961		:- assert_must_succeed(external_functions:printf(string('test ok = ~w~n'),[(int(1),pred_true)],pred_true,unknown)).
1962		:- block printf(-,?,?,?), printf(?,-,?,?).
1963		printf(string(FormatString),Value,PredRes,Span) :- !, PredRes = pred_true,
1964	?	when((ground(FormatString),ground(Value)),
1965		fprintf2(user_output,FormatString,Value,Span)).
1966		printf(F,V,P,S) :- add_internal_error('Illegal call: ',printf(F,V,P,S)), P=pred_true.
1967
1968		expects_spaninfo('printf_two'). % print two values, triggers as soon as first value is known
1969		external_pred_always_true('printf_two').
1970		:- assert_must_succeed(external_functions:printf_two(string('test ok = ~w~n'),[(int(1),pred_true)],string('test ok = ~w~n'),[(int(1),pred_true)],pred_true,unknown)).
1971		:- public printf_two/6.
1972		:- block printf_two(-,?,?,?,?,?), printf_two(?,-,?,?,?,?).
1973		printf_two(string(FormatString),Value,string(FormatString2),Value2,PredRes,Span) :- !, PredRes = pred_true,
1974		when((ground(FormatString),ground(Value)),
1975		(fprintf2(user_output,FormatString,Value,Span),
1976		fprintf2(user_output,FormatString2,Value2,Span))).
1977		printf_two(F,V,F2,V2,P,S) :- add_internal_error('Illegal call: ',printf_two(F,V,F2,V2,P,S)), P=pred_true.
1978
1979
1980		expects_spaninfo('printf_nonvar'). % print as soon as value becomes nonvar (printf waits until the value is ground)
1981		external_pred_always_true('printf_nonvar').
1982		:- public printf_nonvar/4.
1983		:- block printf_nonvar(-,?,?,?), printf_nonvar(?,-,?,?).
1984		printf_nonvar(string(FormatString),Value,PredRes,Span) :- !, PredRes = pred_true,
1985		when((ground(FormatString),nonvar(Value)),
1986		fprintf2(user_output,FormatString,Value,Span)).
1987		printf_nonvar(F,V,P,S) :- add_internal_error('Illegal call: ',printf(F,V,P,S)), P=pred_true.
1988
1989
1990		expects_spaninfo('dprintf'). % a version of printf which delays setting itself to TRUE until printing is performed
1991		external_pred_always_true('dprintf').
1992		:- public dprintf/4.
1993		:- block dprintf(-,?,?,?), dprintf(?,-,?,?).
1994		dprintf(string(FormatString),Value,PredRes,Span) :- !,
1995		when((ground(FormatString),ground(Value)),
1996		(fprintf2(user_output,FormatString,Value,Span),PredRes = pred_true)).
1997		dprintf(F,V,P,S) :- add_internal_error('Illegal call: ',dprintf(F,V,P,S)), P=pred_true.
1998
1999		:- use_module(kernel_strings,[convert_b_sequence_to_list_of_atoms/3]).
2000		fprintf2(File,FormatString,Value,Span) :-
2001		convert_b_sequence_to_list_of_atoms(Value,ListOfAtoms,Done),
2002	?	when(nonvar(Done),
2003		(file_format(File,FormatString,ListOfAtoms,Span),
2004		print_hash((FormatString,Value)),
2005		print_stats,
2006		fprint_log_info(File,Span)
2007		)).
2008		%fprintf2(File,FormatString,Value,Span) :- print('BACKTRACKING ') , file_format(File,FormatString,['?'],Span),nl,fail.
2009		% warning: format can call an argument as goal with ~@; this is dangerous
2010		% and we should prohibit this
2011		% Luckily PRINTF("@: <>~@<>~n","print(danger)") where print(danger)
2012		% is arbitrary code is not a security exploit:
2013		% our PRINTF translates the argument to an atom, i.e., one could
2014		% only call Prolog predicates without arguments, anything else leads to an exception
2015		% (even PRINTF("@: <>~@<>~n","nl") leads to an exception)
2016
2017
2018		:- use_module(hashing,[my_term_hash/2]).
2019		% optionally print hash and allow breakpoints
2020		print_hash(V) :-
2021		external_fun_pref(printf_hash,'TRUE'), % use SET_PREF("printf_hash","TRUE")
2022		!,
2023		my_term_hash(V,H), format('% HASH = ~w~n',H),
2024		%((H = 158201315 ; H=29759067) -> trace ; true),
2025		true.
2026		print_hash(_).
2027
2028
2029		:- use_module(probsrc(tools),[statistics_memory_used/1]).
2030		:- dynamic nr_of_printfs/1.
2031		nr_of_printfs(0).
2032		print_stats :-
2033		external_fun_pref(printf_stats,PFS), % use SET_PREF("printf_stats","TRUE")
2034		PFS='TRUE',
2035		retract(nr_of_printfs(N)),
2036		!,
2037		N1 is N+1,
2038		assertz(nr_of_printfs(N1)),
2039		statistics(walltime,[X,SL]),
2040		statistics_memory_used(M), MB is M / 1000000, % used instead of deprecated 1048576,
2041		statistics(gc_count,GCs),
2042		format('% Call ~w at walltime ~w ms (since last ~w ms), memory ~3f MB (~w GCs)~n',[N1,X,SL,MB,GCs]).
2043		print_stats.
2044
2045		:- dynamic external_fun_pref/2.
2046		% valid keys: log_info
2047		valid_external_fun_pref(log_info).
2048		valid_external_fun_pref(printf_stats).
2049		valid_external_fun_pref(printf_hash).
2050
2051		fprint_log_info(File,Span) :- external_fun_pref(log_info,X),
2052		'GET_INFO'(string(X),string(Res)),
2053		file_format(File,'%%% ~w~n',[Res],Span).
2054		fprint_log_info(_,_).
2055
2056		% example usage SET_PREF("log_info","time") or SET_PREF("printf_stats","TRUE")
2057		external_fun_type('SET_PREF',[],[string,string,boolean]).
2058		:- public 'SET_PREF'/3.
2059		:- block 'SET_PREF'(-,?,?), 'SET_PREF'(?,-,?).
2060		'SET_PREF'(string(S),string(Val),R) :-
2061		preferences:eclipse_preference(S,Pref),!, R=pred_true,
2062		format('Setting ProB preference ~w := ~w~n',[S,Val]),
2063		preferences:set_preference(Pref,Val).
2064		'SET_PREF'(string(S),string(Val),R) :- valid_external_fun_pref(S),!,
2065		R=pred_true,
2066		retractall(external_fun_pref(S,_)),
2067		format('Setting external function preference ~w := ~w~n',[S,Val]),
2068		assertz(external_fun_pref(S,Val)).
2069		'SET_PREF'(P,V,R) :-
2070		add_internal_error('Illegal call: ','SET_PREF'(P,V,R)), R=pred_false.
2071
2072		external_fun_type('GET_PREF',[],[string,string]).
2073		expects_waitflag('GET_PREF').
2074		expects_spaninfo('GET_PREF').
2075		:- assert_must_succeed(external_functions:'GET_PREF'(string('CLPFD'),string(_),unknown,_)).
2076		:- public 'GET_PREF'/4.
2077		'GET_PREF'(Str,Res,Span,WF) :-
2078		kernel_waitflags:get_wait_flag(10,'GET_PREF',WF,WF10), % will enumerate possible input strings
2079		get_pref2(Str,Res,_,WF10,Span).
2080		external_fun_type('GET_PREF_DEFAULT',[],[string,string]).
2081		expects_waitflag('GET_PREF_DEFAULT').
2082		expects_spaninfo('GET_PREF_DEFAULT').
2083		:- assert_must_succeed(external_functions:'GET_PREF_DEFAULT'(string('CLPFD'),string(true),unknown,_)).
2084		:- public 'GET_PREF_DEFAULT'/4.
2085		'GET_PREF_DEFAULT'(Str,Res,Span,WF) :-
2086		(nonvar(Str) -> true
2087		; kernel_waitflags:get_wait_flag(10,'GET_PREF',WF,WF10)), % will enumerate possible input strings
2088		get_pref2(Str,_,Res,WF10,Span).
2089
2090		:- block get_pref2(-,?,?,-,?).
2091		get_pref2(string(S),Res,Res2,_,Span) :-
2092		if((preferences:eclipse_preference(S,Pref),
2093		preferences:get_preference(Pref,Val),
2094		preferences:preference_default_value(Pref,DefVal)),
2095		(make_string(Val,Res),make_string(DefVal,Res2)),
2096		(add_error(external_functions,'Illegal argument for GET_PREF: ',S,Span),
2097		fail)).
2098
2099
2100		% printf followed by fail; useful for print fail loops in the REPL
2101		expects_spaninfo('printfail').
2102		:- assert_must_fail(external_functions:printfail(string('test ok = ~w~n'),[(int(1),pred_true)],pred_true,unknown)).
2103		:- block printfail(-,?,?,?), printfail(?,-,?,?).
2104		printfail(string(FormatString),Value,PredRes,Span) :- !, PredRes = pred_true,
2105		when((ground(FormatString),ground(Value)),
2106		(fprintf2(user_output,FormatString,Value,Span),fail)).
2107		printfail(F,V,P,S) :-
2108		add_internal_error('Illegal call: ',printfail(F,V,P,S)), P=pred_true.
2109
2110		% a version of printf with automatic indenting and backtracking feedback
2111		expects_spaninfo('iprintf').
2112		external_pred_always_true('iprintf').
2113		:- assert_must_succeed(external_functions:iprintf(string('test ok = ~w~n'),[(int(1),pred_true)],pred_true,unknown)).
2114		:- block iprintf(-,?,?,?), iprintf(?,-,?,?).
2115		iprintf(string(FormatString),Value,PredRes,Span) :- !, PredRes = pred_true,
2116		when((ground(FormatString),ground(Value)),
2117		ifprintf2(user_output,FormatString,Value,no_trace,Span)).
2118		iprintf(F,V,P,S) :- add_internal_error('Illegal call: ',iprintf(F,V,P,S)), P=pred_true.
2119		ifprintf2(File,FormatString,Value,Trace,Span) :-
2120		my_term_hash((FormatString,Value),Hash),
2121		format(user_output,'[hash ~w] ',[Hash]), % (Hash=1087266573122589201 -> (trace ; trace,fail) ; true),
2122		translate:translate_bvalue(Value,TV),
2123		indent_format(File,FormatString,[TV],Trace),
2124		fprint_log_info(File,Span).
2125		expects_spaninfo('itprintf').
2126		external_pred_always_true('itprintf').
2127		:- public itprintf/4.
2128		:- block itprintf(-,?,?,?), itprintf(?,-,?,?).
2129		itprintf(string(FormatString),Value,PredRes,Span) :- PredRes = pred_true,
2130		when((ground(FormatString),ground(Value)),
2131		ifprintf2(user_output,FormatString,Value,trace,Span)).
2132
2133		% ---------------
2134
2135		% a more light-weight version of observe_indent below
2136		:- public observe/5.
2137		expects_spaninfo('observe').
2138		expects_unevaluated_args('observe').
2139		expects_waitflag('observe').
2140		external_pred_always_true('observe').
2141		external_fun_type('observe',[T],[T,boolean]).
2142		observe(Value,PredRes,[Arg],Span,WF) :-
2143		observe6(Value,PredRes,[Arg],Span,_,WF).
2144
2145		% a version which does not print instantiations; just registers them and the patterns
2146		% can be inspected later with -prob-profile (calling portray_instantiations)
2147		:- public observe_silent/5.
2148		expects_spaninfo('observe_silent').
2149		expects_unevaluated_args('observe_silent').
2150		expects_waitflag('observe_silent').
2151		external_pred_always_true('observe_silent').
2152		external_fun_type('observe_silent',[T],[T,boolean]).
2153		observe_silent(Value,PredRes,[Arg],Span,WF) :-
2154		observe6(Value,PredRes,[Arg],Span,silent,WF).
2155
2156		observe6(Value,PredRes,[Arg],_Span,IndentVar,WF) :-
2157		observe_couples(Value,Arg,IndentVar,WF),
2158		PredRes=pred_true,
2159		(Arg\=b(couple(_,_),_,_)
2160		-> true
2161		; translate_bexpression(Arg,AS),
2162		ground_value_check(Value,GrVal),
2163		block_print_value_complete(GrVal,AS,Value,IndentVar,WF)
2164		).
2165
2166		observe_couples((V1,V2),b(couple(A1,A2),_,_),IndentVar,WF) :- !,
2167		observe_couples(V1,A1,IndentVar,WF),
2168		observe_couples(V2,A2,IndentVar,WF).
2169		observe_couples(Val,Arg,IndentVar,WF) :-
2170		translate_bexpression(Arg,ArgString),
2171		(IndentVar==silent -> true ; format(user_output,' observing ~w~n',[ArgString])), % for values we could print_span
2172		ground_value_check(Val,GrVal),
2173		block_print_value(GrVal,ArgString,Val,IndentVar,WF).
2174
2175		:- block block_print_value(-,?,?,?,?).
2176		block_print_value(_,ArgString,V,IndentVar,WF) :-
2177		print_value(ArgString,V,IndentVar,WF).
2178		print_value(ArgString,V,IndentVar,WF) :-
2179		register_instantiation_wf(ArgString,WF),
2180		(IndentVar==silent -> true
2181		; translate_bvalue(V,VS), statistics(walltime,[WT,_]),
2182		get_wf_summary(WF,WS),
2183		indent_var(IndentVar),
2184		format(user_output,' ~w = ~w (walltime: ~w ms) ~w~n',[ArgString,VS,WT,WS])
2185		%,set_prolog_flag(profiling,on), print_profile
2186		).
2187		:- block block_print_value_complete(-,?,?,?,?).
2188		block_print_value_complete(_,ArgString,V,IndentVar,WF) :- print_value_complete(ArgString,V,IndentVar,WF).
2189		print_value_complete(ArgString,V,IndentVar,WF) :-
2190		register_instantiation_wf(ArgString,WF),
2191		(IndentVar==silent -> true
2192		; translate_bvalue(V,VS), statistics(walltime,[WT,_]),
2193		get_wf_summary(WF,WS),
2194		indent_var(IndentVar),
2195		format(user_output,'* Value complete: ~w = ~w (walltime: ~w ms) ~w~n------~n',[ArgString,VS,WT,WS])
2196		%,set_prolog_flag(profiling,on), print_profile,trace
2197		).
2198		% TODO: determine indentation based on overall instantiation of full value
2199
2200		:- use_module(kernel_waitflags,[get_minimum_waitflag_prio/3]).
2201		get_wf_summary(WF,R) :- debug_mode(on),get_minimum_waitflag_prio(WF,MinPrio,_Info),!, R=MinPrio.
2202		get_wf_summary(_,'').
2203
2204		% TODO: store indent var in WF store; so that we can share results/indentation amongst multiple observes
2205		% indent based upon a shared variable and increment it; it displays indentation locally for every observe call
2206		% using put_wf_dynamic_info we could display it for every WF store
2207		indent_var(X) :- var(X),!, X=inst(_). %, register_instantiation(ArgStr,Pred,Level).
2208		indent_var(inst(X)) :- !,print('.'), indent_var(X).
2209		indent_var(_) :- print('***').
2210
2211		% a small utility to observe list of atomic variable names with Prolog value terms
2212		% can be used on Ids,Vars for calls to set_up_localstate(Ids,Vars,LocalState,LetState)
2213		:- public observe_variables/2. %useful for debugging
2214		observe_variables(ListOfIDs,ListOfVals) :- observe_variables(ListOfIDs,ListOfVals,_).
2215		observe_variables([],[],_).
2216		observe_variables([TID|T],[Val|TV],IndentVar) :-
2217		(atomic(TID) -> ID=TID ; get_texpr_id(TID,ID) -> true ; ID=TID),
2218		ground_value_check(Val,GrVal),
2219		block_print_value(GrVal,ID,Val,IndentVar,no_wf_available),
2220		observe_variables(T,TV,IndentVar).
2221
2222		:- dynamic instantiation_link/4, instantiation_level_reached/1.
2223		% keep track of how variables are instantiated in which order
2224		register_instantiation(ArgStr,Pred,Level) :-
2225		(instantiation_level_reached(Level) -> true ; assertz(instantiation_level_reached(Level))),
2226		(retract(instantiation_link(Pred,ArgStr,Level,Hits))
2227		-> H1 is Hits+1
2228		; H1 is 1),
2229		assertz(instantiation_link(Pred,ArgStr,Level,H1)).
2230
2231		:- use_module(probsrc(preferences), [get_preference/2]).
2232		register_instantiation_wf(ArgInstantiated,WF) :-
2233		(get_wf_dynamic_info(WF,instantiation_info,lvl_prev(Level,PrevArgInstantiated))
2234		-> true
2235		; Level=0,
2236		(get_preference(provide_trace_information,false)
2237		-> Infos=[] % only have one virtual root
2238		; get_wait_flag_infos(WF,Infos) %portray_wait_flag_infos(Infos),
2239		% Warning: these Infos can be large terms which get asserted below; they contain the call-stack
2240		),
2241		PrevArgInstantiated = root(Infos)
2242		),
2243		register_instantiation(ArgInstantiated,PrevArgInstantiated,Level),
2244		L1 is Level+1,
2245		put_wf_dynamic_info(WF,instantiation_info,lvl_prev(L1,ArgInstantiated)).
2246
2247		reset_observe :- retractall(instantiation_level_reached(_)),
2248		retractall(instantiation_link(_,_,_,_)).
2249
2250		portray_instantiations :-
2251		(instantiation_level_reached(0) -> true),
2252		format('--- ProB instantiation patterns observed ---~n',[]),
2253		instantiation_link(root(Infos),_,0,_),
2254		format('*PATTERNS*~n',[]),
2255		portray_wait_flag_infos(Infos),
2256		(Infos=[],get_preference(provide_trace_information,false)
2257		-> format(' (Set TRACE_INFO preference to TRUE to obtain more information.)~n',[])
2258		; true),
2259		portray_inst(0,root(Infos)),
2260		fail.
2261		portray_instantiations.
2262
2263		% portray how the instantiations occurred
2264		portray_inst(Level,ArgStr) :-
2265		instantiation_link(ArgStr,Successor,Level,Hits),
2266		i_indent(Level), format(' ~w hits : ~w~n',[Hits,Successor]),
2267		L1 is Level+1,
2268		portray_inst(L1,Successor).
2269
2270		i_indent(X) :- X < 1, !, write('->').
2271		i_indent(X) :- write('-+'), X1 is X-1, i_indent(X1).
2272
2273		% ---------------
2274
2275		:- public observe_indent/5.
2276		expects_spaninfo('observe_indent').
2277		expects_unevaluated_args('observe_indent').
2278		expects_waitflag('observe_indent').
2279		external_pred_always_true('observe_indent').
2280		external_fun_type('observe_indent',[T],[T,boolean]).
2281		% observe pairs of values
2282		observe_indent(Value,PredRes,UnEvalArgs,Span,WF) :-
2283		observe2(Value,PredRes,UnEvalArgs,no_trace,Span,WF).
2284
2285		:- public tobserve/5.
2286		expects_spaninfo('tobserve'). % observe_indent but with tracing enabled
2287		expects_unevaluated_args('tobserve').
2288		expects_waitflag('tobserve').
2289		external_pred_always_true('tobserve').
2290		tobserve(Value,PredRes,UnEvalArgs,Span,WF) :-
2291		observe2(Value,PredRes,UnEvalArgs,trace,Span,WF).
2292
2293		observe2(Value,PredRes,[Arg],Trace,Span,WF) :- PredRes=pred_true,
2294		%kernel_waitflags:portray_waitflags(WF),
2295		kernel_waitflags:get_wait_flag0(WF,WF0),
2296		kernel_waitflags:get_wait_flag1(observe,WF,WF1),
2297		when(nonvar(WF0),(indent_format(user_output,'WAITFLAG 0 set~n',[],no_trace),kernel_waitflags:portray_waitflags(WF))),
2298		when(nonvar(WF1),(indent_format(user_output,'WAITFLAG 1 set~n',[],no_trace),kernel_waitflags:portray_waitflags(WF))),
2299		Hook = print_value_as_table_if_possible(Arg,Value),
2300		observe_aux(Value,Arg,1,_,Trace,Span,Hook),
2301		iprintf(string("observe full value complete: ~w~n~n"),Value,_,Span).
2302
2303		:- use_module(extrasrc(table_tools),[print_value_as_table/2]).
2304		:- public print_value_as_table_if_possible/2. % used as hook above
2305		%print_value_as_table_if_possible(_,_) :- !.
2306		print_value_as_table_if_possible(Arg,Value) :-
2307		translate:print_bexpr(Arg),nl,
2308		(print_value_as_table(Arg,Value) -> true ; true).
2309
2310		observe_aux((V1,V2),b(couple(A1,A2),_,_),Nr,R,Trace,Span,Hook) :- !,
2311		observe_aux(V1,A1,Nr,N1,Trace,Span,Hook),
2312		observe_aux(V2,A2,N1,R,Trace,Span,Hook).
2313		observe_aux(V,Arg,Nr,R,Trace,Span,Hook) :- R is Nr+1,
2314		translate:translate_bexpression(Arg,ArgString), %print(obs(Nr,ArgString)),nl,
2315		atom_codes(ArgString,ArgCodes),
2316		observe_value(V,ArgCodes,Nr,Trace,Span,Hook).
2317
2318		% entry for other modules:
2319		observe_value(Value,Info) :- (Info=[_|_] -> PCodes = Info ; atom_codes(Info,PCodes)),
2320		observe_value(Value,PCodes,1,no_trace,unknown,true).
2321
2322		observe_value(Value,ArgCodes,Nr,Trace,Span,Hook) :- %print(obs(Nr,ArgString)),nl,
2323		number_codes(Nr,NrCodes), append(NrCodes,") = ~w~n",Tail1), append(" (",Tail1,Tail2),
2324		append(ArgCodes,Tail2,FormatString),
2325		observe_set(Value,ArgCodes,1,Trace,Span,Value,Hook),
2326		when((ground(FormatString),ground(Value)),ifprintf2(user_output,FormatString,Value,Trace,Span)).
2327		observe_value_with_full_value(Value,ArgCodes,Nr,Trace,Span,FullValue,Hook) :- %print(obs(Nr,ArgString)),nl,
2328		number_codes(Nr,NrCodes), append(NrCodes,"):FULL = ~w~n",Tail1), append(" (",Tail1,Tail2),
2329		append(ArgCodes,Tail2,FormatString),
2330		observe_set(Value,ArgCodes,1,Trace,Span,Value,Hook),
2331		when((ground(FormatString),ground(Value)),
2332		observe_ground(FormatString,Value,FullValue,Trace,Span,Hook)).
2333
2334		observe_ground(FormatString,Value,FullValue,Trace,Span,Hook) :-
2335		ifprintf2(user_output,FormatString,rec([field(value,Value),field(full,FullValue)]),Trace,Span),
2336		(call(Hook) -> true ; print(hook_failed(Hook)),nl).
2337
2338
2339
2340		% observe sets and records:
2341		:- block observe_set(-,?,?,?,?,?,?).
2342		observe_set([],_ArgCodes,_,_Trace,_Span,_,_) :- !.
2343		observe_set([Value|T],ArgCodes,Pos,Trace,Span,FullValue,Hook) :- !, %print(obs(Value,Pos)),nl,
2344		append(ArgCodes," el -> ",ArgN),
2345		observe_value_with_full_value(Value,ArgN,Pos,Trace,Span,FullValue,Hook),
2346		%tools_files:put_codes(ArgN,user_output),print(Pos),print(' = '),tools_printing:print_arg(Value),nl,
2347		P1 is Pos+1, observe_set(T,ArgCodes,P1,Trace,Span,FullValue,Hook).
2348		observe_set((V1,V2),ArgCodes,Pos,Trace,Span,FullValue,Hook) :-
2349		preferences:preference(observe_precise_values,true),
2350		!, %print(obs(Value,Pos)),nl,
2351		append(ArgCodes," prj1 -> ",ArgN1),
2352		observe_value_with_full_value(V1,ArgN1,Pos,Trace,Span,FullValue,Hook),
2353		%tools_files:put_codes(ArgN,user_output),print(Pos),print(' = '),tools_printing:print_arg(Value),nl,
2354		Pos2 is Pos+1,
2355		append(ArgCodes," prj2 -> ",ArgN2),
2356		observe_value_with_full_value(V2,ArgN2,Pos2,Trace,Span,FullValue,Hook).
2357		observe_set(rec(Fields),ArgCodes,Pos,Trace,Span,_FullValue,Hook) :-
2358		preferences:preference(observe_precise_values,true),
2359		!,
2360		append(ArgCodes," rec -> ",ArgN),
2361		observe_field(Fields,ArgN,Pos,Trace,Span,Hook).
2362		observe_set(_,_,_,_,_,_,_).
2363
2364		:- block observe_field(-,?,?,?,?,?).
2365		observe_field([],ArgN,Pos,Trace,Span,_Hook) :-
2366		append(ArgN," complete (~w)~n",FormatString),
2367		ifprintf2(user_output,FormatString,Pos,Trace,Span).
2368		observe_field([field(Name,Value)|TFields],ArgN,Pos,Trace,Span,Hook) :-
2369		observe_value((string(Name),Value),ArgN,Pos,Trace,Span,Hook),
2370		observe_field(TFields,ArgN,Pos,Trace,Span,Hook).
2371
2372		:- use_module(bsyntaxtree,[get_texpr_id/2]).
2373		:- use_module(store,[lookup_value_with_span_wf/6]).
2374		% utility function for other modules to use observe on parameters
2375		observe_parameters(Parameters,LocalState) :-
2376		skel(LocalState,SetupDone),
2377		reset_ident, reset_walltime,
2378		when(nonvar(SetupDone),observe_parameters_aux(Parameters,1,LocalState)).
2379		:- block skel(-,?).
2380		skel([],pred_true).
2381		skel([_|T],Done) :- skel(T,Done).
2382		:- block observe_parameters_aux(-,?,?), observe_parameters_aux(?,?,-).
2383		observe_parameters_aux([],_,_).
2384		observe_parameters_aux([TID|T],Nr,LS) :-
2385		safe_get_texpr_id(TID,ID), atom_codes(ID,PCodes),
2386		lookup_value_with_span_wf(ID,[],LS,Value,TID,no_wf_available),
2387		debug_println(9,observing(ID,Value,LS)),
2388		Hook = print_value_as_table_if_possible(TID,Value),
2389		observe_value(Value,PCodes,Nr,no_trace,unknown,Hook),
2390		N1 is Nr+1,
2391		observe_parameters_aux(T,N1,LS).
2392		safe_get_texpr_id(TID,ID) :- (atom(TID) -> ID=TID ; get_texpr_id(TID,ID)).
2393
2394		construct_bind(Id,V,bind(Id,V)).
2395		% observe a list of identifiers and values
2396		:- public observe_state/2. % debugging utility
2397		observe_state(Ids,Values) :-
2398		maplist(construct_bind,Ids,Values,State),!,
2399		observe_state(State).
2400		observe_state(Ids,Values) :- add_internal_error('Illegal id and value lists: ',observe_state(Ids,Values)).
2401
2402		% utility to observe a state using the observe external function
2403		observe_state(State) :-
2404		reset_ident, reset_walltime,
2405		observe_state_aux(State,1).
2406		:- block observe_state_aux(-,?).
2407		observe_state_aux(no_state,_) :- !.
2408		observe_state_aux([],_) :- !.
2409		observe_state_aux(concrete_constants(C),Nr) :- !, observe_state_aux(C,Nr).
2410		observe_state_aux([Binding|T],Nr) :- get_binding_value(Binding,Nr,PCodes,Value),!,
2411		%print(observe(Id,Value,Nr,T)),nl,
2412		observe_value(Value,PCodes,Nr,no_trace,unknown,true),
2413		N1 is Nr+1,
2414		observe_state_aux(T,N1).
2415		observe_state_aux(State,Nr) :- add_internal_error('Illegal state: ',observe_state_aux(State,Nr)).
2416
2417		:- block get_binding_value(-,?,?,?).
2418		get_binding_value(bind(Id,Value),_,PCodes,Value) :- atom_codes(Id,PCodes).
2419		get_binding_value(typedval(Value,_Type,Id,_Trigger),_,PCodes,Value) :- atom_codes(Id,PCodes).
2420		get_binding_value(Value,Nr,PCodes,Value) :- number_codes(Nr,PCodes). % we have just a list of values without ids
2421
2422
2423		external_fun_type('observe_fun',[X],[X,boolean]).
2424		expects_unevaluated_args('observe_fun').
2425		external_pred_always_true('observe_fun').
2426		:- public observe_fun/3.
2427		% a specific predicate to observe enumeration of functions,...
2428		:- block observe_fun(-,-,?).
2429		observe_fun(Value,PredRes,[UnEvalArg]) :-
2430		translate:translate_bexpression(UnEvalArg,Str), format('Observe function : ~w~n',[Str]),
2431		obs_fun(Value,Str,Value),PredRes=pred_true.
2432
2433		:- block obs_fun(-,?,?).
2434		obs_fun([],_,_) :- !.
2435		obs_fun([(A,B)|T],Str,FullVal) :- !,
2436		obs_idx(A,B,Str,FullVal),
2437		obs_fun(T,Str,FullVal).
2438		obs_fun(V,Str,_) :- print(uncovered_obs_fun(V,Str)),nl.
2439
2440		:- block obs_idx(-,?,?,?), obs_idx(?,-,?,?).
2441		obs_idx(A,B,Str,FullVal) :-
2442		when(ground((A,B)),obs_idx_complete(FullVal,A,B,Str)).
2443
2444		obs_idx_complete(FullVal,A,B,Str) :-
2445		format('~n ~w = ',[Str]),obs_idx_complete_aux(FullVal,A,B).
2446		obs_idx_complete(FullVal,A,B,Str) :-
2447		format('~n [BACKTRACK] ~w = ',[Str]),obs_idx_complete_aux(FullVal,A,B),fail.
2448
2449		obs_idx_complete_aux(V,_,_) :- var(V),!,print(' OPEN '),nl.
2450		obs_idx_complete_aux([],_,_) :- !, nl.
2451		obs_idx_complete_aux([(X,Y)|T],A,B) :- !,
2452		((X,Y)==(A,B) -> print(' * ') ; print(' ')), print_bvalue((X,Y)),
2453		obs_idx_complete_aux(T,A,B).
2454		obs_idx_complete_aux(_,_,_) :- print(unknown),nl.
2455
2456
2457		% -----------------------------
2458
2459		:- public tprintf/4.
2460		expects_spaninfo('tprintf').
2461		external_pred_always_true('tprintf').
2462		% a debugging version that switches into trace mode
2463		:- block tprintf(-,?,?,?), tprintf(?,-,?,?).
2464		tprintf(string(FormatString),Value,PredRes,Span) :- PredRes = pred_true,
2465		when((ground(FormatString),ground(Value)),
2466		(fprintf2(user_output,FormatString,Value,Span),
2467		try_trace %,print_profile,set_prolog_flag(profiling,on)
2468		)).
2469
2470		:- public 'prolog_printf'/5.
2471		expects_spaninfo('prolog_printf').
2472		expects_waitflag('prolog_printf').
2473		external_pred_always_true('prolog_printf').
2474		prolog_printf(string(FormatString),Value,PredRes,Span,WF) :- PredRes = pred_true,
2475		file_format(user_output,FormatString,[initial(Value,WF)],Span),
2476		when(nonvar(Value),file_format(user_output,FormatString,[nonvar(Value,WF)],Span)),
2477		when((ground(FormatString),ground(Value)),
2478		fprintf2(user_output,FormatString,Value,Span)).
2479
2480		% vprintf: expression which returns argument as value
2481		expects_spaninfo('vprintf').
2482		external_fun_type('vprintf',[T],[string,T,T]).
2483		:- public vprintf/4.
2484		vprintf(Format,Value,ValueRes,Span) :-
2485	?	printf(Format,[(int(1),Value)],pred_true,Span), % use itprintf for tracing
2486		equal_object(Value,ValueRes,vprintf). % we could generate a version which only instantiates when printing done
2487		expects_spaninfo('fvprintf').
2488		:- public fvprintf/5.
2489		fvprintf(File,Format,Value,ValueRes,Span) :-
2490		fprintf(File,Format,[(int(1),Value)],pred_true,Span),
2491		equal_object(Value,ValueRes,fvprintf). % we could generate a version which only instantiates when printing done
2492
2493
2494		% PRINT a single value as substitution
2495		performs_io('PRINT').
2496		external_subst_enabling_condition('PRINT',_,Truth) :- create_texpr(truth,pred,[],Truth).
2497		does_not_modify_state('PRINT').
2498		:- public 'PRINT'/3.
2499		:- block 'PRINT'(-,?,?), 'PRINT'(?,-,?).
2500		'PRINT'(Val,_Env,OutEnv) :- %print('PRINT : '), print(Env),nl,
2501		assert_side_effect_occurred(user_output),
2502		print_value(Val),nl, OutEnv=[].
2503
2504		% PRINT a single value as substitution; show backtracking
2505		performs_io('PRINT_BT').
2506		perform_directly('PRINT_BT').
2507		external_subst_enabling_condition('PRINT_BT',_,Truth) :- create_texpr(truth,pred,[],Truth).
2508		does_not_modify_state('PRINT_BT').
2509		:- public 'PRINT_BT'/3.
2510		:- block 'PRINT_BT'(-,?,?), 'PRINT_BT'(?,-,?).
2511		'PRINT_BT'(Val,_Env,OutEnv) :- %print('PRINT : '), print(Env),nl,
2512		assert_side_effect_occurred(user_output),
2513		print_value(Val),nl, OutEnv=[].
2514		'PRINT_BT'(Val,_Env,_OutEnv) :-
2515		assert_side_effect_occurred(user_output),
2516		print('BACKTRACKING: '),print_value(Val),nl, fail.
2517
2518		print_value(Val) :- translate:translate_bvalue(Val,TV), print(TV).
2519
2520
2521		performs_io('DEBUG_PRINT_STATE').
2522		external_subst_enabling_condition('DEBUG_PRINT_STATE',_,Truth) :- create_texpr(truth,pred,[],Truth).
2523		does_not_modify_state('DEBUG_PRINT_STATE').
2524		:- public 'DEBUG_PRINT_STATE'/3.
2525		:- block 'DEBUG_PRINT_STATE'(-,?,?).
2526		'DEBUG_PRINT_STATE'(Value,Env,OutEnv) :-
2527		assert_side_effect_occurred(user_output),
2528		print_value(Value),translate:print_bstate(Env),nl, OutEnv=[].
2529
2530		% PRINTF as substitution
2531		expects_spaninfo('PRINTF').
2532		performs_io('PRINTF').
2533		external_subst_enabling_condition('PRINTF',_,Truth) :- create_texpr(truth,pred,[],Truth).
2534		does_not_modify_state('PRINTF').
2535		:- public 'PRINTF'/5.
2536		:- block 'PRINTF'(-,?,?,?,?), 'PRINTF'(?,-,?,?,?), 'PRINTF'(?,?,-,?,?).
2537		'PRINTF'(string(FormatString),Value,_Env,OutEnvModifications,Span) :-
2538		% print('PRINTF'(FormatString,Value,_Env)),nl,
2539	?	when((ground(FormatString),ground(Value)),
2540		(fprintf2(user_output,FormatString,Value,Span),
2541		OutEnvModifications=[] /* substitution finished */
2542		)).
2543
2544		expects_spaninfo('FPRINTF').
2545		performs_io('FPRINTF').
2546		external_subst_enabling_condition('FPRINTF',_,Truth) :- create_texpr(truth,pred,[],Truth).
2547		does_not_modify_state('FPRINTF').
2548		:- public 'FPRINTF'/6.
2549		:- block 'FPRINTF'(-,?,?,?,?,?), 'FPRINTF'(?,-,?,?,?,?), 'FPRINTF'(?,?,-,?,?,?).
2550		'FPRINTF'(string(File),string(FormatString),Value,_Env,OutEnvModifications,Span) :-
2551		when((ground(FormatString),ground(Value)),
2552		(fprintf2(File,FormatString,Value,Span),
2553		OutEnvModifications=[] /* substitution finished */
2554		)).
2555
2556		file_format(user_output,FormatString,Args,Span) :- !,
2557		assert_side_effect_occurred(user_output),
2558	?	safe_call(myformat(user_output,FormatString,Args,Span),Span).
2559		file_format(File,FormatString,Args,Span) :-
2560		open(File,append,Stream,[encoding(utf8)]),
2561		assert_side_effect_occurred(file),
2562		safe_call(myformat(Stream,FormatString,Args,Span),Span),
2563		close(Stream). % TO DO: call_cleanup
2564
2565		% Simple check if the user forgot to put format specifiers in the format string.
2566		format_string_is_missing_tildes(FormatString) :-
2567		atom_codes(FormatString, Codes),
2568		\+ memberchk(0'~, Codes).
2569
2570		:- meta_predicate catch_format_error(0, 0).
2571		catch_format_error(Goal, Recover) :-
2572	?	catch(
2573		catch(
2574		Goal,
2575		error(consistency_error(_,_,format_arguments),_), % SICStus
2576		Recover),
2577		error(format(_Message),_), % SWI
2578		Recover).
2579
2580		:- public myformat/4.
2581		myformat(Stream,FormatString,Args,Span) :-
2582	?	catch_format_error(
2583		(Args \== [], format_string_is_missing_tildes(FormatString) ->
2584		% backup: the user has not provided ~w annotations:
2585		% instead print just the format string and then all arguments separately.
2586		% This case was previously detected by catching format errors,
2587		% but this causes problems with incomplete or duplicated output on SWI,
2588		% because SWI reports errors only during printing
2589		% (unlike SICStus, which checks the entire format string before printing anything).
2590		format(Stream,FormatString,[]),
2591		nl(Stream),
2592		format_args(Stream,Args)
2593		; format(Stream,FormatString,Args)
2594		),
2595		(length(Args,NrArgs),
2596		ajoin(['Illegal format string, expecting ',NrArgs,' ~w arguments (see SICStus Prolog reference manual for syntax):'],Msg),
2597		add_error(external_functions,Msg,FormatString,Span),
2598		format_args(Stream,Args))
2599		),
2600		flush_output(Stream).
2601
2602		format_args(_Stream,[]).
2603	?	format_args(Stream,[H|T]) :- format(Stream,'~w~n',H), format_args(Stream,T).
2604
2605		% a format with indentation and backtracking info:
2606		:- dynamic indentation_level/1.
2607		indentation_level(0).
2608		inc_indent :- retract(indentation_level(X)), X1 is X+1, assertz(indentation_level(X1)).
2609		dec_indent :- retract(indentation_level(X)), X1 is X-1, assertz(indentation_level(X1)).
2610		reset_ident :- retractall(indentation_level(_)), assertz(indentation_level(0)).
2611		get_indent_level(L) :- indentation_level(LL), L is ceiling(sqrt(LL)).
2612		indent(Stream) :- get_indent_level(L), %(L>28 -> trace ; true),
2613		indent_aux(L,Stream).
2614		indent_aux(X,Stream) :- X < 1, !, write(Stream,' ').
2615		indent_aux(X,Stream) :- write(Stream,'+-'), X1 is X-1, indent_aux(X1,Stream).
2616
2617		indent_format(Stream,Format,Args,Trace) :- inc_indent,
2618		indent(Stream), format(Stream,Format,Args),
2619		print_walltime(Stream),
2620		% my_term_hash(Args,Hash), format(Stream,'[hash ~w]~n',[Hash]), (Hash=101755762 -> trace ; true), %%
2621		flush_output(Stream),
2622		(Trace=trace -> try_trace ; true).
2623		%indent_format(_Stream,_Format,Args,_Trace) :- my_term_hash(Args,Hash),(Hash=553878463258718990 -> try_trace).
2624		indent_format(Stream,Format,Args,Trace) :-
2625		indent(Stream), write(Stream,'BACKTRACKING '),
2626		% my_term_hash(Args,Hash), format(Stream,'[hash ~w] ',[Hash]), %% (Hash=553878463258718990 -> try_trace ; true), %%
2627		format(Stream,Format,Args),
2628		print_walltime(Stream), %% comment in to see walltime info
2629		flush_output(Stream),
2630		dec_indent,
2631		(Trace=trace -> try_trace ; true),
2632		fail.
2633
2634		:- dynamic ref_walltime/1, prev_walltime/1.
2635		reset_walltime :- retractall(prev_walltime(_)), retractall(ref_walltime(_)),
2636		statistics(walltime,[WT,_]),
2637		assertz(prev_walltime(WT)),
2638		assertz(ref_walltime(WT)).
2639		print_walltime(File) :- statistics(walltime,[WT,_]),
2640		(ref_walltime(RefWT) -> RWT is WT-RefWT ; RWT = 0, assertz(ref_walltime(WT))),
2641		(retract(prev_walltime(PWT)) -> T is WT-PWT, indent(File),format(File,' ~w ms (walltime; total ~w ms)~n',[T,RWT])
2642		; true),
2643		assertz(prev_walltime(WT)).
2644		:- public 'TRACE'/2.
2645		:- block 'TRACE'(-,?).
2646		'TRACE'(pred_true,R) :- !,trace,R=pred_true.
2647		'TRACE'(pred_false,pred_true).
2648
2649		% --------------------------------------------
2650
2651		% ARGV, ARGC
2652
2653		:- dynamic argv_string/2, argc_number/1.
2654		argc_number(0).
2655		reset_argv :-
2656		retractall(argv_string(_,_)),
2657		retractall(argc_number(_)),
2658		assertz(argc_number(0)).
2659
2660		:- use_module(kernel_strings,[split_atom_string/3]).
2661		% call to set the commandline arguments, e.g., from probcli
2662		set_argv_from_atom(X) :-
2663		retractall(argv_string(_,_)),
2664		retractall(argc_number(_)),
2665		split_atom_string(X,' ',List),
2666		set_argv_from_list(List).
2667		set_argv_from_list(List) :-
2668		retractall(argv_string(_,_)),
2669		retractall(argc_number(_)),
2670		set_argv_from_list_aux(List).
2671		set_argv_from_list_aux(List) :-
2672		length(List,Len),
2673		assertz(argc_number(Len)),
2674		debug:debug_println(9,argc(Len)),
2675	?	nth1(N,List,String), % we number the arguments in B style
2676		debug:debug_println(9,argv(N,String)),
2677		assertz(argv_string(N,String)),
2678		fail.
2679		set_argv_from_list_aux(_).
2680
2681		external_fun_type('ARGV',[],[integer,string]).
2682		% access to the command-line arguments provided to probcli (after --)
2683		% first argument is ARGV(1) not ARGV(0)
2684		:- public 'ARGV'/2.
2685		:- block 'ARGV'(-,?).
2686		'ARGV'(int(N),S) :- argv2(N,S).
2687		:- block argv2(-,?).
2688		argv2(Nr,Res) :- % print(get_argv(Nr,Res)),nl,
2689		(argv_string(Nr,S) -> Res=string(S)
2690		; Nr=0 -> add_error(external_functions,'Command-line argument does not exist, numbering starts at 1: ',Nr), Res=string('')
2691		; add_error(external_functions,'Command-line argument does not exist: ',Nr), Res=string('')).
2692
2693		external_fun_type('ARGC',[],[integer]).
2694		:- public 'ARGC'/1.
2695		'ARGC'(int(X)) :- argc_number(X).
2696
2697		% --------------------------------------------
2698
2699		% RANDOM
2700
2701		:- assert_must_succeed(( external_functions:call_external_function('RANDOM',[0,1],[int(0),int(1)],int(0),integer,unknown,_WF) )).
2702		:- use_module(library(random),[random/3, random/1]).
2703		% Generate a random number >= Low and < Up
2704		% warning: this is not a mathematical function
2705		:- public 'RANDOM'/3.
2706		is_not_declarative('RANDOM').
2707		external_fun_type('RANDOM',[],[integer,integer,integer]).
2708		:- block 'RANDOM'(-,?,?), 'RANDOM'(?,-,?).
2709		'RANDOM'(int(Low),int(Up),int(R)) :- random2(Low,Up,R).
2710		:- block random2(-,?,?), random2(?,-,?).
2711		random2(L,U,R) :- random(L, U, R). % also works with reals
2712
2713		:- public 'RAND'/3.
2714		is_not_declarative('RAND').
2715		external_fun_type('RAND',[],[real,real,real]).
2716		:- block 'RAND'(-,?,?), 'RAND'(?,-,?).
2717		'RAND'(RLow,Rup,RR) :- is_real(RLow,Low),
2718		is_real(Rup,Up), is_real(RR,R),
2719		random2(Low,Up,R).
2720
2721
2722		% pick a random element from a set
2723		:- public 'random_element'/4.
2724		is_not_declarative('random_element').
2725		external_fun_type('random_element',[T],[set(T),T]).
2726		expects_waitflag('random_element').
2727		expects_spaninfo('random_element').
2728		:- block 'random_element'(-,?,?,?).
2729		random_element([],_,Span,WF) :- !,
2730		add_wd_error_span('random_element applied to empty set: ',[],Span,WF).
2731		random_element([H|T],El,_,WF) :- !,
2732		expand_custom_set_to_list_wf(T,ET,_Done,'random_element',WF),
2733		block_length(ET,1,Len),
2734		random_select_from_list([H|ET],Len,El).
2735		random_element(CS,Res,_,_) :- is_interval_closure_or_integerset(CS,Low,Up,finite),!,
2736		U1 is Up+1,
2737		random(Low,U1,H), Res = int(H).
2738		random_element(CS,X,Span,WF) :-
2739		custom_explicit_sets:expand_custom_set_wf(CS,ER,random_element,WF),
2740		random_element(ER,X,Span,WF).
2741
2742		:- block block_length(-,?,?).
2743		block_length([],Acc,Acc).
2744		block_length([_|T],Acc,R) :- A1 is Acc+1, block_length(T,A1,R).
2745
2746		:- use_module(library(random),[random_member/2]).
2747		:- block random_select_from_list(?,-,?).
2748		random_select_from_list(List,_,Res) :-
2749		random_member(El,List),
2750		kernel_objects:equal_object(El,Res).
2751
2752		:- use_module(library(random),[random_numlist/4]).
2753		:- public 'random_numset'/6.
2754		is_not_declarative('random_numset').
2755		external_fun_type('random_numset',[],[integer,integer,integer,integer,set(integer)]).
2756		expects_waitflag('random_numset').
2757		:- block random_numset(-,?,?,?,?,?),random_numset(?,-,?,?,?,?),random_numset(?,?,-,?,?,?),random_numset(?,?,?,-,?,?).
2758		random_numset(int(P),int(Q),int(Low),int(Up),Res,WF) :-
2759		Prob is P/Q,
2760		random_numlist(Prob,Low,Up,List),
2761		maplist(gen_int,List,IntList),
2762		kernel_objects:equal_object_optimized_wf(IntList,Res,random_numset,WF).
2763
2764		gen_int(I,int(I)).
2765
2766
2767		:- public 'NORMAL'/3.
2768		is_not_declarative('NORMAL').
2769		external_fun_type('NORMAL',[],[integer,integer,integer]).
2770		% GAUSSIAN Distribution
2771		:- block 'NORMAL'(-,?,?), 'NORMAL'(?,-,?).
2772		'NORMAL'(int(Mu),int(Sigma),int(R)) :- random_normal(Mu,Sigma,R).
2773
2774		:- block random_normal(-,?,-), random_normal(?,-,?).
2775		random_normal(Mu,Sigma,R) :-
2776		random_normal(N),
2777		R is round(Mu+N*Sigma).
2778
2779		:- use_module(kernel_reals,[is_real/2]).
2780		:- public 'RNORMAL'/3.
2781		is_not_declarative('RNORMAL').
2782		external_fun_type('RNORMAL',[],[real,real,real]).
2783		:- block 'RNORMAL'(-,?,?), 'RNORMAL'(?,-,?).
2784		'RNORMAL'(RMU,RSigma,RR) :- is_real(RMU,MU),
2785		is_real(RSigma,Sigma), is_real(RR,R),
2786		random_normal_real(MU,Sigma,R).
2787
2788		:- block random_normal_real(-,?,-), random_normal_real(?,-,?).
2789		random_normal_real(Mu,Sigma,R) :-
2790		random_normal(N),
2791		R is (Mu+N*Sigma).
2792
2793		% inspired by: https://stackoverflow.com/questions/44503752/how-to-generate-normal-distributed-random-numbers-in-prolog
2794		% https://en.wikipedia.org/wiki/Box–Muller_transform
2795		:- dynamic cached_gauss/1.
2796		:- use_module(library(random),[random/1]).
2797		random_normal(R) :- retract(cached_gauss(N)),!,R=N.
2798		random_normal(R) :-
2799		random(U1), random(U2),
2800		Z0 is sqrt(-2 * log(U1)) * cos(2*pi*U2),
2801		Z1 is sqrt(-2 * log(U1)) * sin(2*pi*U2),
2802		assertz(cached_gauss(Z1)),
2803		R = Z0.
2804
2805		% generates a random subset of a finite set
2806		:- public 'random_subset'/4.
2807		is_not_declarative('random_subset').
2808		external_fun_type('random_subset',[T],[set(T),set(T)]).
2809		expects_waitflag('random_subset').
2810		expects_spaninfo('random_subset').
2811		:- block 'random_subset'(-,?,?,?).
2812		random_subset(Set,Subset,Span,WF) :- !,
2813		expand_custom_set_to_list_wf(Set,ESet,Done,'random_subset',WF),
2814		random_subset_aux(Done,ESet,Subset,Span,WF).
2815
2816		:- use_module(library(random),[random_subseq/3]).
2817		:- block random_subset_aux(-,?,?,?,?).
2818		random_subset_aux(_Done,ESet,Subset,_Span,WF) :-
2819		random_subseq(ESet,Result,_Rest),
2820		kernel_objects:equal_object_wf(Result,Subset,WF).
2821
2822		% generates a random subset of a finite set
2823		:- public 'random_ordering'/4.
2824		is_not_declarative('random_ordering').
2825		external_fun_type('random_ordering',[T],[set(T),seq(T)]).
2826		expects_waitflag('random_ordering').
2827		expects_spaninfo('random_ordering').
2828		:- block 'random_ordering'(-,?,?,?).
2829		random_ordering(Set,Permutation,Span,WF) :- !,
2830		expand_custom_set_to_list_wf(Set,ESet,Done,'random_ordering',WF),
2831		random_perm_aux(Done,ESet,Permutation,Span,WF).
2832
2833		:- use_module(library(random),[random_permutation/2]).
2834		:- block random_perm_aux(-,?,?,?,?).
2835		random_perm_aux(_Done,ESet,Permutation,_Span,_WF) :-
2836		random_permutation(ESet,Result),
2837		convert_list_to_seq(Result,Permutation). % should we call WF version
2838
2839		% generates a random subset of a finite sequence
2840		:- public 'random_permutation'/4.
2841		is_not_declarative('random_permutation').
2842		external_fun_type('random_permutation',[T],[seq(T),seq(T)]).
2843		expects_waitflag('random_permutation').
2844		expects_spaninfo('random_permutation').
2845		:- block 'random_permutation'(-,?,?,?).
2846		random_permutation(Set,Permutation,Span,WF) :- !,
2847		expand_custom_set_to_list_wf(Set,ESet,Done,'random_permutation',WF),
2848		random_perm_seq_aux(Done,ESet,Permutation,Span,WF).
2849
2850		:- block random_perm_seq_aux(-,?,?,?,?).
2851		random_perm_seq_aux(_Done,ESet,Permutation,_Span,_WF) :-
2852		sort(ESet,Sorted),
2853		maplist(drop_index,Sorted,PrologList),
2854		random_permutation(PrologList,Result),
2855		convert_list_to_seq(Result,Permutation). % should we call WF version
2856
2857		drop_index((int(_),El),El).
2858
2859		:- use_module(library(system)).
2860
2861		:- assert_must_succeed(( external_functions:call_external_function('TIME',[y],[string(year)],int(Y),integer,unknown,_WF), number(Y), Y>2011 )).
2862		:- assert_must_succeed(( external_functions:call_external_function('TIME',[m],[string(month)],int(M),integer,unknown,_WF), number(M), M>0, M<13 )).
2863		external_fun_type('TIME',[],[string,integer]).
2864		:- public 'TIME'/2.
2865		is_not_declarative('TIME'). % as time can change with next call
2866		'TIME'(string(S),int(N)) :- time2(S,N).
2867		:- block time2(-,?).
2868		time2(now,N) :- !, now(N). % provide UNIX timesstamp
2869		time2(year,N) :- !,datime(datime(N,_,_,_,_,_)).
2870		time2(month,N) :- !,datime(datime(_,N,_,_,_,_)).
2871		time2(day,N) :- !,datime(datime(_,_,N,_,_,_)).
2872		time2(hour,N) :- !,datime(datime(_,_,_,N,_,_)).
2873		time2(min,N) :- !,datime(datime(_,_,_,_,N,_)).
2874		time2(sec,N) :- !,datime(datime(_,_,_,_,_,N)).
2875		time2(OTHER,_) :- add_error(time2,'Illegal time field (must be now,year,month,day,hour,min,sec): ',OTHER),fail.
2876
2877		:- assert_must_succeed(( external_functions:call_external_function('GET_INFO',[time],[string(time)],string(M),string,unknown,_WF), atom(M) )).
2878		external_fun_type('GET_INFO',[],[string,string]).
2879		:- public 'GET_INFO'/2.
2880		'GET_INFO'(string(S),Res) :- get_info2(S,Res).
2881		:- use_module(library(codesio)).
2882		:- block get_info2(-,?).
2883		get_info2(time,Res) :- !, datime(datime(Year,Month,Day,Hour,Min,Sec)),
2884		(Min<10
2885		-> format_to_codes('~w/~w/~w - ~wh0~w ~ws',[Day,Month,Year,Hour,Min,Sec],Codes)
2886		; format_to_codes('~w/~w/~w - ~wh~w ~ws',[Day,Month,Year,Hour,Min,Sec],Codes)
2887		),
2888		atom_codes(INFO, Codes), Res=string(INFO).
2889		get_info2(OTHER,_) :- add_error(time2,'Illegal GET_INFO field (must be time): ',OTHER),fail.
2890
2891		:- public 'TIMESTAMP_INFO'/3.
2892		:- assert_must_succeed(external_functions:'TIMESTAMP_INFO'(string('year'),int(1498484624),int(2017))).
2893		:- assert_must_succeed(external_functions:'TIMESTAMP_INFO'(string('month'),int(1498484624),int(6))).
2894		% second argument is ticks obtained by TIME("now")
2895		external_fun_type('TIMESTAMP_INFO',[],[string,integer,integer]).
2896		:- block 'TIMESTAMP_INFO'(-,-,-).
2897		'TIMESTAMP_INFO'(string(S),int(Ticks),int(Res)) :- time_info2(S,Ticks,Res).
2898		:- block time_info2(-,?,?), time_info2(?,-,?).
2899		time_info2(year,Ticks,N) :- !,datime(Ticks,datime(N,_,_,_,_,_)).
2900		time_info2(month,Ticks,N) :- !,datime(Ticks,datime(_,N,_,_,_,_)).
2901		time_info2(day,Ticks,N) :- !,datime(Ticks,datime(_,_,N,_,_,_)).
2902		time_info2(hour,Ticks,N) :- !,datime(Ticks,datime(_,_,_,N,_,_)).
2903		time_info2(min,Ticks,N) :- !,datime(Ticks,datime(_,_,_,_,N,_)).
2904		time_info2(sec,Ticks,N) :- !,datime(Ticks,datime(_,_,_,_,_,N)).
2905		time_info2(OTHER,_,_) :- add_error(time_info2,'Illegal time field (must be now,year,month,day,hour,min,sec): ',OTHER),fail.
2906
2907		:- public 'TIMESTAMP'/7.
2908		% TIMESTAMP/datime converts between a Unix timestamp (UTC) and *local* time.
2909		% To avoid depending on the system time zone,
2910		% build the timestamp dynamically based on the expected test date.
2911		% This way the timestamp varies slightly depending on the system time zone,
2912		% but the date will always be consistent.
2913		:- assert_must_succeed((
2914		datime(Timestamp, datime(2017,6,26,15,43,44)),
2915		% Sanity check to ensure that Timestamp is roughly in the right range.
2916		Timestamp >= 1498437824, Timestamp =< 1498545824,
2917		external_functions:'TIMESTAMP'(int(2017),int(6),int(26),int(H),int(Min),int(S),int(Timestamp)),
2918		H==15, Min==43, S==44
2919		)).
2920		external_fun_type('TIMESTAMP',[],[integer,integer,integer,integer,integer,integer,integer]).
2921		:- block 'TIMESTAMP'(-,-,-,-,-,-,-).
2922		'TIMESTAMP'(int(Y),int(M),int(D),int(H),int(Min),int(S),int(Res)) :-
2923		timestamp2(Y,M,D,H,Min,S,Res).
2924
2925		:- block timestamp2(-,?,?,?,?,?,-), timestamp2(?,-,?,?,?,?,-), timestamp2(?,?,-,?,?,?,-),
2926		timestamp2(?,?,?,-,?,?,-), timestamp2(?,?,?,?,?,-,-).
2927		timestamp2(Y,M,D,H,Min,S,ResTimeStamp) :- datime(ResTimeStamp, datime(Y,M,D,H,Min,S)).
2928
2929
2930		:- public 'WALLTIME'/1.
2931		is_not_declarative('WALLTIME'). % as time can change with next call
2932		'WALLTIME'(int(X)) :- statistics(walltime,[X,_]).
2933
2934		:- volatile last_walltime/1.
2935		:- dynamic last_walltime/1.
2936		:- public 'DELTA_WALLTIME'/1.
2937		is_not_declarative('DELTA_WALLTIME'). % as time can change with next call
2938		'DELTA_WALLTIME'(int(D)) :- statistics(walltime,[X,_]),
2939		(retract(last_walltime(L)) -> D is X-L ; D = 0),
2940		assertz(last_walltime(X)).
2941
2942		:- public 'RUNTIME'/1.
2943		is_not_declarative('RUNTIME'). % as time can change with next call
2944		'RUNTIME'(int(X)) :- statistics(runtime,[X,_]).
2945
2946		:- public 'SLEEP'/3.
2947		external_subst_enabling_condition('SLEEP',_,Truth) :- create_texpr(truth,pred,[],Truth).
2948		:- use_module(library(system),[sleep/1]).
2949		:- block 'SLEEP'(-,?,?), 'SLEEP'(?,-,?).
2950		'SLEEP'(int(X),_Env,OutEnvModifications) :- when(nonvar(X),
2951		(Seconds is X / 1000, sleep(Seconds), OutEnvModifications=[])).
2952
2953
2954		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
2955		% check if a given expression is valued in the deterministic phase; warn otherwise
2956
2957		:- use_module(kernel_tools,[ground_value_check/2]).
2958		expects_spaninfo('CHECK_DET').
2959		expects_unevaluated_args('CHECK_DET').
2960		expects_waitflag('CHECK_DET').
2961		:- public 'CHECK_DET'/5.
2962		'CHECK_DET'(Value,PredRes,[UnEvalArg],Span,WF) :-
2963		ground_value_check(Value,Ground),
2964		kernel_waitflags:get_wait_flag0(WF,WF0),
2965		kernel_waitflags:get_wait_flag1(WF,WF1),
2966		PredRes=pred_true,
2967		check_det_aux(Ground,Value,WF0,WF1,UnEvalArg,Span).
2968
2969		:- block check_det_aux(-,?,?,-,?,?).
2970		check_det_aux(Ground,Value,_WF0,_WF1,UnEvalArg,Span) :- var(Ground),!,
2971		translate:translate_bexpression(UnEvalArg,S),
2972		add_error(external_functions,'Argument has not been computed deterministically: ',S,Span),
2973		translate:print_bvalue(Value),nl.
2974		check_det_aux(_Ground,Value,WF0,WF1,UnEvalArg,_Span) :- debug:debug_mode(on),!,
2975		translate:translate_bexpression(UnEvalArg,S),
2976		format('Value determined (WF0=~w,WF1=~w) : ~w~n',[WF0,WF1,S]),
2977		translate:print_bvalue(Value),nl.
2978		check_det_aux(_Ground,_Value,_WF0,_WF1,_UnEvalArgs,_Span).
2979
2980		% check if a given expression has already a ground value when
2981		% the predicate is called
2982
2983		% the predicate is true when the value is ground, false otherwise
2984		:- public 'IS_DETERMINED'/2.
2985		'IS_DETERMINED'(Value,PredRes) :- ground(Value),!,PredRes=pred_true.
2986		'IS_DETERMINED'(_Value,pred_false).
2987
2988		% other variant: the predicate is always true, the information if the variable is written
2989		% to a file to check it later.
2990		expects_spaninfo('IS_DETERMINED_INTO_FILE').
2991		:- public 'IS_DETERMINED_INTO_FILE'/5.
2992		'IS_DETERMINED_INTO_FILE'(FileValue,VariableValue,Value,PredRes,SpanInfo) :-
2993		check_value_is_string(FileValue,'IS_DETERMINED_INTO_FILE','file name',SpanInfo,File),
2994		check_value_is_string(VariableValue,'IS_DETERMINED_INTO_FILE','variable name',SpanInfo,Varname),
2995		( ground(File) ->
2996		open(File,write,S,[encoding(utf8)]),
2997		call_cleanup( check_determined2(Value,S,Varname), close(S))
2998		;
2999		add_error(external_functions,'### EXTERNAL Unspecified file in check_determined','',SpanInfo)),
3000		PredRes = pred_true.
3001		check_determined2(Value,S,Varname) :-
3002		check_determined3(Value,Varname,Term),
3003		writeq(S,Term),write(S,'.\n').
3004		check_determined3(Value,Name,Term) :- ground(Value),!,Term=determined_value(Name,Value).
3005		check_determined3(_Value,Name,not_determined_value(Name)).
3006
3007		check_value_is_string(string(S),_PredName,_Location,_SpanInfo,String) :-
3008		!, String=S.
3009		check_value_is_string(Value,PredName,Location,SpanInfo,_String) :-
3010		atom_concat('### EXTERNAL ',PredName,Msg1),
3011		atom_concat(Msg1,': Type error, expected string as ',Msg2),
3012		atom_concat(Msg2,Location,Msg),
3013		add_error(external_functions,Msg,Value,SpanInfo),
3014		fail.
3015
3016
3017		:- public 'SEE'/3.
3018		is_not_declarative('SEE').
3019		:- dynamic open_stream/2.
3020		'SEE'(string(File),_S,[]) :- b_absolute_file_name(File,AFile),
3021		open_stream(AFile,_),!,
3022		print('File already open: '), print(File),nl.
3023		'SEE'(string(File),_S,[]) :-
3024		b_absolute_file_name(File,AFile),
3025		open_absolute_file_for_reading(AFile,_Stream).
3026
3027		open_file_for_reading_if_necessary(File,Stream) :-
3028		b_absolute_file_name(File,AFile),
3029		(open_stream(AFile,S) -> Stream=S
3030		; open_absolute_file_for_reading(AFile,Stream)).
3031		open_absolute_file_for_reading(AFile,Stream) :-
3032		open(AFile,read,Stream,[encoding(utf8)]),
3033		print(opened_file(AFile,Stream)),nl,
3034		assert_side_effect_occurred(file),
3035		assertz(open_stream(AFile,Stream)).
3036
3037		%correct_file_open_mode(read).
3038		%correct_file_open_mode(write).
3039		%correct_file_open_mode(append).
3040
3041		:- public 'GET_CODE'/2.
3042		performs_io('GET_CODE').
3043		'GET_CODE'(string(File),int(Code)) :-
3044		b_absolute_file_name(File,AFile),
3045		open_stream(AFile,S),
3046		assert_side_effect_occurred(file),
3047		get_code(S,Code). %,print(got_code(S,Code)),nl.
3048
3049		:- public 'GET_CODE_STDIN'/1.
3050		performs_io('GET_CODE_STDIN').
3051		'GET_CODE_STDIN'(int(Code)) :-
3052		get_code(user_input,Code). % can be problematic if called in ProB2UI
3053		% TODO: check get_prob_application_type(prob2) ?
3054
3055		:- public 'SEEN'/3.
3056		is_not_declarative('SEEN').
3057		'SEEN'(string(File),_S,[]) :- b_absolute_file_name(File,AFile),
3058		retract(open_stream(AFile,S)),
3059		assert_side_effect_occurred(file),
3060		close(S).
3061
3062		close_all_files :- retract(open_stream(_File,S)),
3063		close(S),fail.
3064		close_all_files.
3065
3066
3067		open_utf8_file_for_reading(AFile,Stream,SpanInfo) :-
3068		safe_call(open(AFile,read,Stream,[encoding(utf8)]),SpanInfo).
3069
3070		:- public 'READ_FILE_AS_STRINGS'/3.
3071		performs_io('READ_FILE_AS_STRINGS').
3072		external_subst_enabling_condition('READ_FILE_AS_STRINGS',_,Truth) :- create_texpr(truth,pred,[],Truth).
3073		expects_spaninfo('READ_FILE_AS_STRINGS').
3074		:- block 'READ_FILE_AS_STRINGS'(-,?,?).
3075		'READ_FILE_AS_STRINGS'(string(File),Res,SpanInfo) :-
3076		b_absolute_file_name(File,AFile,SpanInfo),
3077		open_utf8_file_for_reading(AFile,Stream,SpanInfo),!,
3078		format('% Opened file: ~w~n',[File]),
3079		% no side-effect: as everything read in one go
3080		call_cleanup(read_lines(Stream,Res),
3081		close(Stream)).
3082		'READ_FILE_AS_STRINGS'(string(File),_Res,_SpanInfo) :-
3083		format('% Opening file failed: ~w~n',[File]),fail.
3084		read_lines(File,Res) :- read_lines_loop(1,File,Lines),
3085		kernel_objects:equal_object(Res,Lines).
3086		read_lines_loop(Nr,Stream,Lines) :- read_line(Stream,Line),
3087		debug:debug_println(9,read_line(Nr,Line)),
3088		(Line = end_of_file -> Lines = []
3089		; atom_codes(Atom,Line), Lines = [(int(Nr),string(Atom))|T],
3090		N1 is Nr+1,read_lines_loop(N1,Stream,T)).
3091
3092
3093		:- public 'READ_FILE_AS_STRING'/3.
3094		performs_io('READ_FILE_AS_STRING').
3095		external_subst_enabling_condition('READ_FILE_AS_STRING',_,Truth) :- create_texpr(truth,pred,[],Truth).
3096		expects_spaninfo('READ_FILE_AS_STRING').
3097		:- block 'READ_FILE_AS_STRING'(-,?,?).
3098		'READ_FILE_AS_STRING'(string(File),Res,SpanInfo) :-
3099		b_absolute_file_name(File,AFile,SpanInfo),
3100		open_utf8_file_for_reading(AFile,Stream,SpanInfo),!,
3101		format('% Opened file: ~w~n',[File]),
3102		% no side-effect: as everything read in one go
3103		call_cleanup(read_all_codes(Stream,All,[]),
3104		close(Stream)),
3105		atom_codes(ResStr,All), Res = string(ResStr).
3106
3107		% read all codes in the stream:
3108		read_all_codes(Stream) --> {read_line(Stream,Line), Line \= end_of_file, !},
3109		Line, "\n",
3110		read_all_codes(Stream).
3111		read_all_codes(_) --> "".
3112
3113
3114		:- public 'READ_LINE'/3.
3115		expects_spaninfo('READ_LINE').
3116		external_subst_enabling_condition('READ_LINE',_,Truth) :- create_texpr(truth,pred,[],Truth).
3117		performs_io('READ_LINE').
3118		'READ_LINE'(string(File),Res,_SpanInfo) :-
3119		open_file_for_reading_if_necessary(File,Stream),
3120		read_line(Stream,Line),
3121		debug:debug_println(9,read_line(Line)),
3122		assert_side_effect_occurred(file),
3123		(Line = end_of_file
3124		-> add_error(external_functions,'Attempting to read past EOF: ',File),
3125		Res = ""
3126		; atom_codes(Atom,Line), Res = string(Atom)).
3127
3128		is_not_declarative('EOF').
3129		:- public 'EOF'/2.
3130		'EOF'(string(File),Res) :- eof2(File,Res).
3131		:- block eof2(-,?).
3132		eof2(File,Res) :-
3133		open_file_for_reading_if_necessary(File,Stream),
3134		((peek_code(Stream,C), C = -1) -> Res = pred_true ; Res = pred_false). % for Linux compatibility
3135		% (at_end_of_stream(Stream) -> Res = pred_true ; Res=pred_false).
3136
3137		is_not_declarative('EOF_STDIN').
3138		:- public 'EOF_STDIN'/2.
3139		'EOF_STDIN'(_,Res) :- % dummy argument to enable valid external predicate type declarations
3140		((peek_code(user_input,C), C = -1) -> Res = pred_true ; Res = pred_false).
3141
3142
3143		external_fun_type('CURRENT_FILE_POSITION',[],[string,string,integer]).
3144		is_not_declarative('CURRENT_FILE_POSITION').
3145		:- public 'CURRENT_FILE_POSITION'/3.
3146		'CURRENT_FILE_POSITION'(string(File),string(Field),Res) :-
3147		open_file_for_reading_if_necessary(File,Stream),
3148		stream_position(Stream,Pos),
3149		% POS must be one of byte_count [only for binary streams], line_count, character_count, line_position
3150		stream_position_data(Field,Pos,R), Res=int(R).
3151
3152		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
3153
3154		:- public 'ADD_ERROR'/6.
3155		expects_spaninfo('ADD_ERROR').
3156		expects_waitflag('ADD_ERROR').
3157		performs_io('ADD_ERROR').
3158		'ADD_ERROR'(string(Msg),Expr,_State,[],SpanInfo,WF) :-
3159		add_error_wf('ADD_ERROR',Msg,Expr,SpanInfo,WF).
3160
3161		:- public 'ADD_STATE_ERROR'/6.
3162		expects_spaninfo('ADD_STATE_ERROR').
3163		expects_waitflag('ADD_STATE_ERROR').
3164		performs_io('ADD_STATE_ERROR').
3165		'ADD_STATE_ERROR'(string(Msg),Expr,_State,[],SpanInfo,WF) :-
3166		%add_wd_error_span_now(Msg,Expr,SpanInfo,WF).
3167		%add_wd_error_span(Msg,Expr,SpanInfo,WF).
3168		add_state_error_wf('ADD_STATE_ERROR',Msg,Expr,SpanInfo,WF). % does not fail
3169
3170		:- public 'ADD_WARNING'/6.
3171		expects_spaninfo('ADD_WARNING').
3172		expects_waitflag('ADD_WARNING').
3173		performs_io('ADD_WARNING').
3174		'ADD_WARNING'(string(Msg),Expr,_State,[],SpanInfo,WF) :-
3175		add_warning_wf('ADD_WARNING',Msg,Expr,SpanInfo,WF).
3176
3177
3178		:- public 'ADD_ERRORS'/5.
3179		expects_spaninfo('ADD_ERRORS').
3180		expects_waitflag('ADD_ERRORS').
3181		performs_io('ADD_ERRORS').
3182		:- block 'ADD_ERRORS'(-,?,?,?,?).
3183		'ADD_ERRORS'(SetOfStrings,_State,[],SpanInfo,WF) :-
3184		expand_custom_set_to_list_wf(SetOfStrings,ESet,_,add_errors,WF),
3185		add_errors_aux(ESet,SpanInfo,WF).
3186		:- block add_errors_aux(-,?,?).
3187		add_errors_aux([],_SpanInfo,_WF).
3188		add_errors_aux([string(Msg)|T],SpanInfo,WF) :-
3189		add_error('ADD_ERRORS',Msg,'',SpanInfo),
3190		add_errors_aux(T,SpanInfo,WF).
3191
3192		:- public 'ADD_STATE_ERRORS'/5.
3193		expects_spaninfo('ADD_STATE_ERRORS').
3194		expects_waitflag('ADD_STATE_ERRORS').
3195		performs_io('ADD_STATE_ERRORS').
3196		:- block 'ADD_STATE_ERRORS'(-,?,?,?,?).
3197		'ADD_STATE_ERRORS'(SetOfStrings,_State,[],SpanInfo,WF) :-
3198		expand_custom_set_to_list_wf(SetOfStrings,ESet,_,add_state_errors,WF),
3199		add_state_errors_aux(ESet,SpanInfo,WF).
3200		:- block add_state_errors_aux(-,?,?).
3201		add_state_errors_aux([],_SpanInfo,_WF).
3202		add_state_errors_aux([string(Msg)|T],SpanInfo,WF) :-
3203		add_state_error_wf('ADD_STATE_ERRORS',Msg,'',SpanInfo,WF),
3204		add_state_errors_aux(T,SpanInfo,WF).
3205
3206		:- public 'ADD_WARNINGS'/5.
3207		expects_spaninfo('ADD_WARNINGS').
3208		expects_waitflag('ADD_WARNINGS').
3209		performs_io('ADD_WARNINGS').
3210		:- block 'ADD_WARNINGS'(-,?,?,?,?).
3211		'ADD_WARNINGS'(SetOfStrings,_State,[],SpanInfo,WF) :-
3212		expand_custom_set_to_list_wf(SetOfStrings,ESet,_,add_warnings,WF),
3213		add_warnings_aux(ESet,SpanInfo,WF).
3214		:- block add_warnings_aux(-,?,?).
3215		add_warnings_aux([],_SpanInfo,_WF).
3216		add_warnings_aux([string(Msg)|T],SpanInfo,WF) :-
3217		add_warning('ADD_WARNINGS',Msg,'',SpanInfo),
3218		% we do not add with WF and call stack: call stack contains call to ADD_WARNINGS with all error messages again
3219		add_warnings_aux(T,SpanInfo,WF).
3220
3221		:- public 'ASSERT_TRUE'/5.
3222		expects_spaninfo('ASSERT_TRUE').
3223		expects_waitflag('ASSERT_TRUE').
3224		external_fun_has_wd_condition('ASSERT_TRUE').
3225
3226		'ASSERT_TRUE'(PredVal,string(Msg),PredRes,SpanInfo,WF) :-
3227		assert_true(PredVal,Msg,PredRes,SpanInfo,WF).
3228
3229		:- block assert_true(-,?,?,?,?).
3230		assert_true(pred_true,_Msg,pred_true,_SpanInfo,_WF).
3231		assert_true(pred_false,Msg,Res,SpanInfo,WF) :-
3232		debug_format(19,'% Waiting for enumeration to finish to raise ASSERT_TRUE:~n ~w~n',[Msg]),
3233		add_error_ef('ASSERT_TRUE',Msg,'',SpanInfo,WF,Res).
3234
3235		% we could also use: add_wd_error_set_result
3236		add_error_ef(Source,Msg,Term,Span,WF,Res) :-
3237		get_enumeration_finished_wait_flag(WF,AWF),
3238		add_error_ef_aux(AWF,Source,Msg,Term,Span,WF,Res).
3239
3240		:- block add_error_ef_aux(-,?,?,?,?,?,?).
3241		add_error_ef_aux(_AWF,Source,Msg,Term,Span,_WF,Res) :-
3242		add_error(Source,Msg,Term,Span),
3243		Res = pred_false.
3244
3245		:- public 'ASSERT_EXPR'/6.
3246		expects_spaninfo('ASSERT_EXPR').
3247		expects_waitflag('ASSERT_EXPR').
3248		external_fun_has_wd_condition('ASSERT_EXPR').
3249		external_fun_type('ASSERT_EXPR',[T],[boolean,string,T,T]).
3250
3251		'ASSERT_EXPR'(PredVal,string(Msg),ExprVal,Res,SpanInfo,WF) :-
3252		% TO DO: call assertion_expression(Cond,ErrMsg,Expr)
3253		assert_expr(PredVal,Msg,ExprVal,Res,SpanInfo,WF).
3254
3255		:- block assert_expr(-,?,?,?,?,?).
3256		assert_expr(pred_true,_Msg,ExprVal,Res,_SpanInfo,_WF) :-
3257		Res = ExprVal.
3258		assert_expr(pred_false,Msg,_ExprVal,Res,SpanInfo,WF) :-
3259		add_error_ef('ASSERT_EXPR',Msg,'',SpanInfo,WF,Res).
3260
3261		% --------------------------
3262		% Reflection Functions
3263
3264		external_fun_type('STATE_AS_STRING',[],[integer,string]).
3265		external_function_requires_state('STATE_AS_STRING').
3266		:- public 'STATE_AS_STRING'/3.
3267		expects_waitflag('STATE_AS_STRING').
3268		'STATE_AS_STRING'(int(X),StateStr,WF) :-
3269		state_space:get_state_space_stats(NrNodes,_NrTransitions,_ProcessedNodes),
3270		get_wait_flag(NrNodes,'STATE_AS_STRING',WF,LWF),
3271		get_state2(X,StateStr,LWF).
3272		:- block get_state2(-,?,-).
3273		get_state2(X,StateStr,_) :-
3274		convert_id_to_nr(IDX,X),
3275		state_space:visited_expression(IDX,S),
3276		translate:translate_any_state(S,Str),
3277		StateStr = string(Str).
3278
3279		:- public 'CURRENT_STATE_AS_TYPED_STRING'/1.
3280		external_function_requires_state('CURRENT_STATE_AS_TYPED_STRING').
3281		external_fun_type('CURRENT_STATE_AS_TYPED_STRING',[],[string]).
3282		% translate current state values as parseable string
3283		'CURRENT_STATE_AS_TYPED_STRING'(string(Translation)) :-
3284		'VARS_AS_TYPED_STRING'(string(''),string(Translation)).
3285
3286		external_function_requires_state('VARS_AS_TYPED_STRING').
3287		external_fun_type('VARS_AS_TYPED_STRING',[],[string,string]).
3288		:- block 'VARS_AS_TYPED_STRING'(-,?).
3289		'VARS_AS_TYPED_STRING'(string(Prefix),string(Translation)) :-
3290		get_current_state_id(ID),
3291		visited_expression(ID,State),
3292		state_corresponds_to_fully_setup_b_machine(State,FullState),
3293		b_get_machine_constants(Constants),
3294		include(identifier_matches_prefix(Prefix),Constants,C1),
3295		b_get_machine_variables(Vars),
3296		include(identifier_matches_prefix(Prefix),Vars,V1),
3297		append(C1,V1,Ids),
3298		findall(Equality,(member(TID,Ids),
3299		generate_equality(TID,FullState,Equality)),Eqs),
3300		generate_typing_predicates(Ids,TypePreds),
3301		append(TypePreds,Eqs,Ps),
3302		conjunct_predicates(Ps,Pred),
3303		translate_bexpr_to_parseable(Pred,Translation).
3304
3305		:- use_module(probsrc(tools_strings), [atom_prefix/2]).
3306		identifier_matches_prefix(Prefix,b(identifier(ID),_,_)) :- atom_prefix(Prefix,ID).
3307
3308		generate_equality(TID,FullState,Equality) :- TID = b(identifier(ID),Type,_),
3309		if(member(bind(ID,Val),FullState),
3310		safe_create_texpr(equal(TID,b(value(Val),Type,[])),pred,Equality),
3311		add_error_fail('VARS_AS_TYPED_STRING','Could not find identifier:',TID)).
3312
3313		:- use_module(state_space,[visited_expression/2]).
3314		:- use_module(probsrc(tools_strings),[match_atom/3]).
3315		:- use_module(specfile,[property/2]).
3316		:- public 'STATE_PROPERTY'/3.
3317		% a useful function for VisB and XTL or CSP models to query state of model
3318		expects_spaninfo('STATE_PROPERTY').
3319		external_function_requires_state('STATE_PROPERTY').
3320		external_fun_type('STATE_PROPERTY',[],[string,string]).
3321		:- block 'STATE_PROPERTY'(-,?,?).
3322		'STATE_PROPERTY'(string(Prop),Res,Span) :- state_property2(Prop,Res,Span).
3323		:- block state_property2(-,?,?).
3324		state_property2(Prop,Res,Span) :-
3325		get_current_state_id(ID),
3326		visited_expression(ID,State),
3327		atom_codes(Prop,PC),
3328		(property(State,'='(StateProp,Val)), % TODO: this leads to error in B mode due to atom_codes error
3329		match_atom(Prop,PC,StateProp)
3330		-> (atom(Val) -> Res = string(Val)
3331		; number(Val), number_codes(Val,CC), atom_codes(Atom,CC) -> Res = string(Atom)
3332		; add_message(external_functions,'Cannot convert STATE_PROPERTY value to STRING ',Val,Span),
3333		Res = string('UNKNOWN')
3334		)
3335		; add_message(external_functions,'Unknown value for STATE_PROPERTY: ',Prop,Span),
3336		Res = string('UNKNOWN')
3337		).
3338
3339
3340		:- public 'STATE_SUCC'/5.
3341		external_fun_type('STATE_SUCC',[],[integer,integer,boolean]).
3342		expects_waitflag('STATE_SUCC').
3343		expects_spaninfo('STATE_SUCC').
3344		'STATE_SUCC'(X,Y,Res,Span,WF) :- 'STATE_TRANS'(X,_,Y,Res,Span,WF).
3345
3346		% synonym for function to BOOL rather than predicate
3347		'GET_IS_ENABLED'(OperationName,Res,Span,WF) :- 'ENABLED'(OperationName,Res,Span,WF).
3348		:- public 'GET_IS_ENABLED'/4.
3349		expects_waitflag('ENABLED').
3350		expects_waitflag('GET_IS_ENABLED').
3351		expects_spaninfo('ENABLED').
3352		expects_spaninfo('GET_IS_ENABLED').
3353		external_function_requires_state('ENABLED').
3354		external_function_requires_state('GET_IS_ENABLED').
3355		external_fun_type('ENABLED',[],[string,boolean]).
3356		'ENABLED'(OperationName,Res,Span,WF) :-
3357		get_current_state_id(ID),
3358		tcltk_interface:compute_all_transitions_if_necessary(ID,false),
3359		NrOps = 10, get_wait_flag(NrOps,'ENABLED',WF,LWF),
3360		% format('Checking ENABLED of ~w in state ~w~n',[OperationName,ID]),
3361		enabled_op(ID,OperationName,Res,Span,LWF).
3362
3363		:- use_module(probsrc(specfile),[b_or_z_mode/0, get_possible_event/1]).
3364		:- block enabled_op(?,-,?,?,-).
3365		enabled_op(ID,string(OpName),Res,Span,_) :-
3366		(var(OpName) -> get_possible_event(OpName) % is b_top_level_operation in b_or_z_mode
3367	?	; b_or_z_mode, \+ get_possible_event(OpName)
3368		-> (b_is_operation_name(OpName)
3369		-> add_warning('ENABLED','Not a top-level operation, use GET_GUARD_STATUS for: ',OpName,Span)
3370		; add_warning('ENABLED','Unknown operation/event: ',OpName,Span)
3371		)
3372		; true
3373		),
3374	?	(state_space_transition(ID,_,string(OpName),_,unknown) -> Res=pred_true
3375		; Res=pred_false,
3376		(get_preference(maxNrOfEnablingsPerOperation,0)
3377		-> add_warning('ENABLED','MAX_OPERATIONS is 0, you may want to use GET_GUARD_STATUS instead for: ',OpName,Span); true)
3378		).
3379
3380
3381		:- use_module(b_operation_guards,[get_quantified_operation_enabling_condition/5]).
3382		:- public 'GET_GUARD_STATUS'/4.
3383		expects_waitflag('GET_GUARD_STATUS').
3384		expects_spaninfo('GET_GUARD_STATUS').
3385		%expects_state('GET_GUARD_STATUS'). % passing state does not always work: to the outside it looks like this call requires no variables and constants
3386		external_function_requires_state('GET_GUARD_STATUS').
3387		external_fun_type('GET_GUARD_STATUS',[],[string,boolean]).
3388		% in contrast to ENABLED, this external function works by computing the guard and evaluating it
3389		% ENABLED just checks the state space; which is in principle more efficient but does not work when
3390		% either MAX_OPERATIONS=0 or subsidiary operations are inspected
3391		'GET_GUARD_STATUS'(Op,PredRes,Span,WF) :-
3392		get_current_state_id(ID),
3393		NrOps = 10, get_wait_flag(NrOps,'GET_GUARD_STATUS',WF,LWF),
3394		get_guard_status(ID,Op,PredRes,Span,WF,LWF).
3395		:- block get_guard_status(?,-,?,?,?,-).
3396		get_guard_status(ID,string(OpName),PredRes,Span,WF,_) :-
3397		Simplify=true,
3398		if(get_quantified_operation_enabling_condition(OpName, BExpr, _BSVars, Precise, Simplify),
3399		((Precise=precise -> true
3400		; add_message('GET_GUARD_STATUS','Guard of operation/event not precise: ',OpName,Span)),
3401		test_formula_in_state(ID,BExpr,PredRes,WF)),
3402		(add_error('GET_GUARD_STATUS','Unknown operation/event: ',OpName,Span),
3403		PredRes=pred_false)).
3404
3405
3406		% synonym for function to BOOL rather than predicate
3407		'GET_IS_ENABLED_TRANSITION'(OperationName,Res,WF) :- 'ENABLED_TRANSITION'(OperationName,Res,WF).
3408		:- public 'GET_IS_ENABLED_TRANSITION'/3.
3409		% a variation of ENABLED where we can check for arguments; useful for VisB but it relies on argument order
3410		external_fun_type('ENABLED_TRANSITION',[],[string,boolean]).
3411		expects_waitflag('ENABLED_TRANSITION').
3412		expects_waitflag('GET_IS_ENABLED_TRANSITION').
3413		external_function_requires_state('ENABLED_TRANSITION').
3414		external_function_requires_state('GET_IS_ENABLED_TRANSITION').
3415		'ENABLED_TRANSITION'(TransString,Res,WF) :-
3416		get_current_state_id(ID),
3417		tcltk_interface:compute_all_transitions_if_necessary(ID,false),
3418		NrOps = 10, get_wait_flag(NrOps,'GET_IS_ENABLED_TRANSITION',WF,LWF),
3419		% format('Checking ENABLED_TRANSITION of ~w in state ~w~n',[TransString,ID]),
3420		enabled_trans(ID,TransString,Res,LWF).
3421
3422		:- block enabled_trans(?,-,?,-),enabled_trans(?,-,-,?).
3423		enabled_trans(ID,string(TransitionStr),Res,LWF) :-
3424		enabled_trans2(ID,TransitionStr,Res,LWF).
3425		:- block enabled_trans2(?,-,?,-),enabled_trans2(?,-,-,?).
3426		enabled_trans2(ID,TransitionStr,Res,_) :- var(TransitionStr),!,
3427		(Res=pred_true -> transition_string(ID,Str,1000,_), TransitionStr=Str
3428		; enabled_trans2(ID,TransitionStr,Res,_) % wait until TransitionStr is known
3429		).
3430		enabled_trans2(ID,TransitionStr,Res,_) :-
3431		atom_length(TransitionStr,Limit),
3432		(transition_string(ID,TransitionStr,Limit,_) -> Res=pred_true ; Res=pred_false).
3433
3434		:- use_module(state_space,[transition/4]).
3435		:- use_module(translate,[translate_event_with_src_and_target_id/5]).
3436		transition_string(ID,TransitionStr,Limit,ToID) :-
3437		transition(ID,TransitionTerm,_TransID,ToID),
3438		% This will currently also output --> Res for operation results; probably we do not want that
3439		translate_event_with_src_and_target_id(TransitionTerm,ID,ToID,Limit,TransitionStr).
3440
3441		:- public 'NON_DET_STATE'/1.
3442		%is_not_declarative('NON_DET_STATE'). % depends on current state, but for any given state it is declarative
3443		external_fun_type('NON_DET_STATE',[],[boolean]).
3444		external_function_requires_state('NON_DET_STATE').
3445		% check if there is a non-deterministic transition: same transition different target state
3446		% similar to tcltk_goto_a_non_deterministic_node
3447		'NON_DET_STATE'(Res) :- get_current_state_id(ID),
3448	?	non_det_transition(ID,_OperationName,_,_), !,
3449		Res = pred_true.
3450		'NON_DET_STATE'(pred_false).
3451
3452		:- public 'NON_DET_OUTPUT_STATE'/1.
3453		%is_not_declarative('NON_DET_OUTPUT_STATE'). % depends on current state, but for any given state it is declarative
3454		external_function_requires_state('NON_DET_OUTPUT_STATE').
3455		external_fun_type('NON_DET_OUTPUT_STATE',[],[boolean]).
3456		% check if there is a non-deterministic transition: same transition different classic B operation result
3457		% similar to tcltk_goto_a_non_deterministic_output_node
3458		'NON_DET_OUTPUT_STATE'(Res) :- get_current_state_id(ID),
3459	?	non_det_output_transition2(ID,_OperationName), !,
3460		Res = pred_true.
3461		'NON_DET_OUTPUT_STATE'(pred_false).
3462
3463		% check if we find a state ID where OperationName leads to two different states with same arguments
3464		non_det_transition(ID,OperationName,TID1,TID2) :-
3465		tcltk_interface:compute_all_transitions_if_necessary(ID,false),
3466	?	transition(ID,Transition,TID1,ID1),
3467		get_operation_name(Transition,OperationName),
3468		get_operation_arguments(Transition,OperationArgs),
3469	?	transition(ID,Transition2,TID2,ID2),
3470		TID2 > TID1, ID1 \= ID2,
3471		get_operation_name(Transition2,OperationName), % same operation
3472		get_operation_arguments(Transition2,OperationArgs). % same arguments
3473
3474		:- use_module(probltlsrc(ltl_propositions), [non_det_output_transition/4]).
3475		% check if we find a state where an operation with output/result parameters is non-det in the output
3476		non_det_output_transition2(ID,OperationName) :-
3477		tcltk_interface:compute_all_transitions_if_necessary(ID,false), % TODO: detect if we are looping and computing guards/actions
3478	?	non_det_output_transition(ID,OperationName,_TID1,_TID2).
3479
3480		:- public 'GET_IS_DET'/3.
3481		expects_spaninfo('GET_IS_DET').
3482		external_function_requires_state('GET_IS_DET').
3483		external_fun_type('GET_IS_DET',[],[string,boolean]).
3484		% check if there is a non-deterministic transition for a given operation: same transition different target state
3485		:- block 'GET_IS_DET'(-,?,?).
3486		'GET_IS_DET'(string(OperationName),Res,Span) :-
3487		get_current_state_id(ID),
3488		nondet_op2(ID,OperationName,'GET_IS_DET',Res,Span).
3489
3490
3491		:- public 'GET_IS_DET_OUTPUT'/3.
3492		expects_spaninfo('GET_IS_DET_OUTPUT').
3493		external_function_requires_state('GET_IS_DET_OUTPUT').
3494		external_fun_type('GET_IS_DET_OUTPUT',[],[string,boolean]).
3495		% check if there is a non-deterministic transition for a given operation: same transition different target state
3496		:- block 'GET_IS_DET_OUTPUT'(-,?,?).
3497		'GET_IS_DET_OUTPUT'(string(OperationName),Res,Span) :-
3498		get_current_state_id(ID),
3499		nondet_op2(ID,OperationName,'GET_IS_DET_OUTPUT',Res,Span).
3500
3501		:- block nondet_op2(?,-,?,?,?).
3502		nondet_op2(_ID,OperationName,XFUN,Res,Span) :- \+ b_top_level_operation(OperationName),!,
3503		add_error(XFUN,'Not a valid top-level operation:',OperationName,Span),
3504		Res = pred_false.
3505		% Check if it has outputs and throw warning if not ?
3506		nondet_op2(ID,OperationName,'GET_IS_DET',Res,_Span) :-
3507		non_det_transition(ID,OperationName,_,_),
3508		!,
3509		Res = pred_false.
3510		nondet_op2(ID,OperationName,'GET_IS_DET_OUTPUT',Res,_Span) :-
3511	?	non_det_output_transition2(ID,OperationName),
3512		!,
3513		Res = pred_false.
3514		nondet_op2(_,_,_,pred_true,_Span).
3515
3516		:- public 'NON_DET_OUTPUT_OPERATIONS'/1.
3517		external_function_requires_state('NON_DET_OUTPUT_OPERATIONS').
3518		external_fun_type('NON_DET_OUTPUT_OPERATIONS',[],[set(string)]).
3519		'NON_DET_OUTPUT_OPERATIONS'(Res) :-
3520		get_current_state_id(ID),
3521		findall(string(OpName),
3522		non_det_output_transition2(ID,OpName),
3523		List),
3524		sort(List,SList),
3525		kernel_objects:equal_object_optimized(SList,Res).
3526
3527
3528		% -------------------
3529
3530		% usage e.g. for scheduler.mch: {x|x:PID & GET_IS_ENABLED_WITH_ARGS("new",x)=TRUE}
3531		expects_waitflag('GET_IS_ENABLED_WITH_ARGS').
3532		external_fun_type('GET_IS_ENABLED_WITH_ARGS',[X],[string,X,boolean]).
3533		expects_spaninfo('GET_IS_ENABLED_WITH_ARGS').
3534		external_function_requires_state('GET_IS_ENABLED_WITH_ARGS').
3535		expects_unevaluated_args('GET_IS_ENABLED_WITH_ARGS').
3536		:- public 'GET_IS_ENABLED_WITH_ARGS'/6.
3537		:- block 'GET_IS_ENABLED_WITH_ARGS'(-,?,?,?,?,?).
3538		% we would expect the operation name to be known statically, as the type of the arguments may differ amongst operations
3539		'GET_IS_ENABLED_WITH_ARGS'(OperationName,OperationArgs,Res,[OpNameExpr,UnEvalArgs|_],SpanInfo,WF) :-
3540		OperationName = string(OpName),
3541		check_operation_name_and_arg_type(OpName,UnEvalArgs,'GET_IS_ENABLED_WITH_ARGS',OpNameExpr),
3542		get_current_state_id(CurID),
3543		tcltk_interface:compute_all_transitions_if_necessary(CurID,false),
3544		'STATE_TRANS_ARGS'(int(CurID),OperationName,OperationArgs,_,Res,SpanInfo,WF).
3545
3546		%:- block check_operation_name(-,?,?).
3547		%check_operation_name(OpName,_,_) :- b_top_level_operation(OpName),!.
3548		%check_operation_name(OpName,XFUN,Span) :-
3549		% add_error(XFUN,'Unknown operation name:',OpName,Span).
3550		:- use_module(bmachine,[b_get_machine_operation_for_animation/4, b_is_operation_name/1]).
3551		:- block check_operation_name_and_arg_type(-,?,?,?).
3552		check_operation_name_and_arg_type(OpName,Args,XFUN,_) :- b_top_level_operation(OpName),!,
3553		get_texpr_type(Args,ArgType),
3554		b_get_machine_operation_for_animation(OpName,_Results,Parameters,_Body),
3555		check_argument_type_against_params(Parameters,OpName,ArgType,XFUN,Args).
3556		check_operation_name_and_arg_type(OpName,_,XFUN,Span) :- b_is_operation_name(OpName),!,
3557		% will never be executed as transition in state_space
3558		add_warning(XFUN,'Not a top-level operation name:',OpName,Span).
3559		check_operation_name_and_arg_type(OpName,_,XFUN,Span) :-
3560		add_error(XFUN,'Unknown operation name:',OpName,Span).
3561
3562		check_argument_type_against_params([],OpName,_,XFUN,Args) :- !,
3563		add_error(XFUN,'Operation has no arguments, use GET_IS_ENABLED instead:',OpName,Args).
3564		check_argument_type_against_params([Para],_OpName,ArgType,XFUN,Args) :- !,
3565		check_type(Para,ArgType,XFUN,Args).
3566		check_argument_type_against_params([Para|TParas],OpName,couple(PType1,PTypeRest),XFUN,Args) :- !,
3567		check_type(Para,PType1,XFUN,Args),
3568		check_argument_type_against_params(TParas,OpName,PTypeRest,XFUN,Args).
3569		check_argument_type_against_params(_,OpName,_ArgType,XFUN,Args) :- !,
3570		add_error(XFUN,'Not enough arugments provided for operation:',OpName,Args).
3571
3572		:- use_module(probsrc(btypechecker), [lookup_type_for_expr/2, unify_types_werrors/4]).
3573		check_type(Arg1,Type2,XFUN,Pos) :-
3574		get_texpr_type(Arg1,Type1),
3575		unify_types_werrors(Type1,Type2,Pos,XFUN).
3576
3577
3578		external_fun_type('STATE_TRANS',[],[integer,string,integer,boolean]).
3579		expects_waitflag('STATE_TRANS').
3580		expects_spaninfo('STATE_TRANS').
3581		'STATE_TRANS'(int(X),OperationName,int(Y),Res,SpanInfo,WF) :-
3582		'STATE_TRANS_ARGS'(int(X),OperationName,_,int(Y),Res,SpanInfo,WF).
3583
3584		external_fun_type('STATE_TRANS_ARGS',[X],[integer,string,X,integer,boolean]).
3585		expects_waitflag('STATE_TRANS_ARGS').
3586		expects_spaninfo('STATE_TRANS_ARGS').
3587		'STATE_TRANS_ARGS'(int(X),OperationName,OperationArgs,int(Y),Res,SpanInfo,WF) :-
3588		(nonvar(X)
3589		-> true
3590		; state_space:get_state_space_stats(NrNodes,_NrTransitions,_ProcessedNodes),
3591		get_wait_flag(NrNodes,'STATE_TRANS',WF,LWF)
3592		),
3593		get_wait_flag1('STATE_TRANS_ARGS',WF,WF1),
3594		get_succ2(X,OperationName,OperationArgs,Y,Res,LWF,WF1,SpanInfo).
3595		:- block get_succ2(-,?,?,-,?,-,?,?),
3596		get_succ2(?,?,?,?,?,?,-,?). % wait at least until WF1 (or at least wf0); as we do non-deterministic enumeration ! (e.g., otherwise b_interpreter_components gets confused !!)
3597		get_succ2(X,OperationName,OperationArgs,Y,Res,_,_,Pos) :- convert_id_to_nr(IDX,X),
3598	?	if((state_space_transition(IDX,IDY,OperationName,OperationArgs,Pos),
3599		convert_id_to_nr(IDY,Y)),
3600		Res=pred_true,Res=pred_false).
3601
3602		state_space_transition(IDX,IDY,OperationName,OperationArgs,Pos) :-
3603	?	state_space:transition(IDX,Transition,IDY),
3604		op_functor(Transition,OperationName),
3605		op_args(Transition,OperationArgs,Pos).
3606
3607		% root is represented as -1
3608		:- block convert_id_to_nr(-,-).
3609		convert_id_to_nr(ID,X) :- ID==root, !, X is -1.
3610		convert_id_to_nr(ID,X) :- X == -1, !, ID=root.
3611		convert_id_to_nr(X,X).
3612
3613		:- use_module(specfile,[get_operation_name/2,get_operation_arguments/2, get_operation_return_values_and_arguments/3]).
3614		op_functor(OpTerm,Res) :- get_operation_name(OpTerm,Name),
3615		Res = string(Name).
3616
3617		:- use_module(tools,[convert_list_into_pairs/2]).
3618		op_args(OpTerm,OperationArgs,Pos) :-
3619		get_operation_arguments(OpTerm,As),
3620		convert_list_into_pairs(As,ArgTerm),
3621		% first check if types are compatible; user could have provided wrong types;
3622		% TODO: sometimes we check_operation_name_and_arg_type and could remove this check in then
3623		kernel_objects:check_values_have_same_type(OperationArgs,ArgTerm,Pos),
3624		kernel_objects:equal_object(OperationArgs,ArgTerm).
3625
3626
3627		:- public 'STATE_SAT'/4.
3628		expects_waitflag('STATE_SAT').
3629		external_fun_type('STATE_SAT',[],[integer,string,boolean]).
3630		% check whether formula as string holds in a state
3631		:- block 'STATE_SAT'(?,-,?,?).
3632		'STATE_SAT'(int(X),string(Formula),Res,WF) :- %print(parsing(Formula)),nl, trace,
3633		parse_pred(Formula,TFormula),
3634		state_space:get_state_space_stats(NrNodes,_NrTransitions,_ProcessedNodes),
3635		get_wait_flag(NrNodes,'STATE_SAT',WF,LWF),
3636		state_sat2(X,TFormula,Res,LWF,WF).
3637		:- block state_sat2(?,-,?,?,?),state_sat2(-,?,?,-,?).
3638		state_sat2(X,TFormula,PredRes,_,WF) :-
3639		(number(X) -> test_formula_in_state(X,TFormula,PredRes,WF)
3640		; test_formula_in_state(ID,TFormula,PredRes,WF), ID \= root, X=ID % avoid CLPFD errors on X
3641		).
3642
3643		:- use_module(b_global_sets,[add_prob_deferred_set_elements_to_store/3]).
3644		:- use_module(specfile,[state_corresponds_to_fully_setup_b_machine/2]).
3645		%:- use_module(b_interpreter,[b_try_check_boolean_expression_wf/5]).
3646		test_formula_in_state(ID,Pred,PredRes,WF) :-
3647		state_space:visited_expression(ID,State),
3648		state_corresponds_to_fully_setup_b_machine(State,FullState),
3649		add_prob_deferred_set_elements_to_store(FullState,FullState1,visible),
3650		debug_println(9,check(Pred,FullState1,PredRes)),
3651		b_interpreter:b_try_check_boolean_expression_wf(Pred,[],FullState1,WF,PredRes).
3652
3653
3654		:- public 'EVAL'/6.
3655		expects_waitflag('EVAL'). % external function with unknown return type
3656		expects_type('EVAL').
3657		expects_spaninfo('EVAL').
3658		:- block 'EVAL'(?,-,?,?,?,?).
3659		'EVAL'(int(X),string(Expr),Value,Type,Span,WF) :-
3660		state_eval1(X,Expr,Value,pred_true,Type,Span,WF).
3661
3662		% evaluate expression and check whether value corresponds to provided value
3663		% (needed for type inference of the external predicate)
3664		%:- block 'STATE_EVAL'(?,-,?,?,?,?,?).
3665		%'STATE_EVAL'(int(X),string(Expr),Value,PredRes,Span,WF) :-
3666		% state_eval1(X,Expr,Value,PredRes,any,Span,WF).
3667
3668		:- use_module(btypechecker, [unify_types_strict/2]).
3669		:- block state_eval1(?,-,?,?,?,?,?).
3670		state_eval1(X,Expr,Value,PredRes,ExpectedType,Span,WF) :-
3671		% string must be provided ; we assume it will be ground
3672		parse_expr(Expr,TExpr),
3673		get_texpr_type(TExpr,Type),
3674		(unify_types_strict(ExpectedType,Type) -> true
3675		; pretty_type(Type,TS), pretty_type(ExpectedType,ETS),
3676		ajoin(['Type ',TS, ' does not match expected type ', ETS, ' for:'],Msg),
3677		add_error('EVAL',Msg,Expr,Span),fail
3678		),
3679		state_space:get_state_space_stats(NrNodes,_NrTransitions,_ProcessedNodes),
3680		get_wait_flag(NrNodes,'STATE_SAT',WF,LWF),
3681		state_eval2(X,TExpr,Value,LWF,PredRes).
3682		:- block state_eval2(?,-,?,?,?),state_eval2(-,?,?,-,?).
3683		state_eval2(X,TExpr,Value,_,PredRes) :-
3684		(number(X)
3685		-> eval_formula_in_state(TExpr,PredRes,X,Value)
3686		; eval_formula_in_state(TExpr,PredRes,ID,Value), ID \= root, X=ID % avoid CLPFD errors on X
3687		).
3688		:- use_module(kernel_equality,[equality_objects/3]).
3689		eval_formula_in_state(TExpr,PredRes,ID,Value) :-
3690		state_space:visited_expression(ID,State),
3691		state_corresponds_to_fully_setup_b_machine(State,FullState),
3692		add_prob_deferred_set_elements_to_store(FullState,FullState1,visible),
3693		debug_println(9,eval(TExpr,FullState1,Value)),
3694		equality_objects(Value,TExprValue,PredRes), % TO DO: Stronger Checks that types compatible
3695		b_interpreter:b_compute_expression_nowf(TExpr,[],FullState1,TExprValue,'STATE_EVAL',ID).
3696
3697		:- use_module(library(terms),[term_hash/2]).
3698		:- use_module(bmachine,[b_parse_machine_predicate/3]).
3699		:- dynamic parse_pred_cache/3.
3700		parse_pred(PredStr,TPred) :- term_hash(PredStr,Hash), parse_pred(PredStr,Hash,TPred).
3701		parse_pred(PredStr,Hash,TPred) :- parse_pred_cache(Hash,PredStr,TC),!, TPred=TC.
3702		parse_pred(PredStr,Hash,TPred) :-
3703		b_parse_machine_predicate(PredStr,[prob_ids(visible),variables],TC),
3704		assertz(parse_pred_cache(Hash,PredStr,TC)),
3705		TPred=TC.
3706
3707		:- dynamic parse_expr_cache/3.
3708		parse_expr(ExprStr,TExpr) :- term_hash(ExprStr,Hash), parse_expr(ExprStr,Hash,TExpr).
3709		parse_expr(ExprStr,Hash,TExpr) :- parse_expr_cache(Hash,ExprStr,TC),!, TExpr=TC.
3710		parse_expr(ExprStr,Hash,TExpr) :-
3711		atom_codes(ExprStr,Codes), %print(parsing(Expr,Codes)),nl,
3712		bmachine:b_parse_machine_expression_from_codes_with_prob_ids(Codes,TC),
3713		assertz(parse_expr_cache(Hash,ExprStr,TC)),
3714		TExpr=TC.
3715
3716		:- use_module(kernel_strings,[generate_code_sequence/3]).
3717		external_fun_type('HISTORY',[],[seq(integer)]).
3718		expects_spaninfo('HISTORY').
3719		:- public 'HISTORY'/2.
3720		'HISTORY'(Value,Span) :-
3721		get_current_history(H,Span), % does not include current state
3722		generate_code_sequence(H,1,Hist),
3723		kernel_objects:equal_object(Value,Hist).
3724
3725
3726		:- use_module(probsrc(state_space), [visited_state_corresponds_to_initialised_b_machine/1,history/1]).
3727
3728
3729		external_fun_type('EVAL_OVER_HISTORY',[X],[X,integer,seq(X)]).
3730		expects_unevaluated_args('EVAL_OVER_HISTORY').
3731		expects_spaninfo('EVAL_OVER_HISTORY').
3732		is_not_declarative('EVAL_OVER_HISTORY'). % depends on history, not explicitly part of arguments
3733
3734		:- public 'EVAL_OVER_HISTORY'/5.
3735		% related to tcltk_evaluate_expression_over_history
3736		:- block 'EVAL_OVER_HISTORY'(-,?,?,?,?), 'EVAL_OVER_HISTORY'(?,-,?,?,?).
3737		'EVAL_OVER_HISTORY'(CurValue,int(Limit),Res,Infos,Span) :-
3738		eval_over_history(CurValue,Limit,Res,Infos,Span).
3739
3740		:- use_module(probsrc(tools_lists),[include_maplist/3]).
3741		:- block eval_over_history(?,-,?,?,?).
3742		eval_over_history(CurValue,Limit,Res,[AST|_],Span) :-
3743		get_current_history(H,Span), % does not include current state
3744		(H=[ID1|SeqOfStateIds], \+visited_state_corresponds_to_initialised_b_machine(ID1) -> true ; SeqOfStateIds=H),
3745		(Limit<0 -> Seq2=SeqOfStateIds ; limit_history(SeqOfStateIds,Limit,Seq2,_Len)),
3746		include_maplist(eval_formula_in_state(AST,pred_true),Seq2,Values),
3747		append(Values,[CurValue],AllValues),
3748		convert_list_to_seq(AllValues,Res).
3749
3750		limit_history([],_,[],0).
3751		limit_history([H|T],Lim,Res,Len1) :- limit_history(T,Lim,TRes,Len), Len1 is Len+1,
3752		(Len >= Lim -> Res = TRes ; Res = [H|TRes]).
3753
3754
3755		:- use_module(probsrc(bool_pred),[negate/2]).
3756		external_fun_type('CHANGED',[X],[X,boolean]).
3757		expects_unevaluated_args('CHANGED').
3758		expects_spaninfo('CHANGED').
3759		is_not_declarative('CHANGED'). % depends on history, not explicitly part of arguments
3760
3761		:- public 'CHANGED'/4.
3762		% check if an expression has changed wrt the preceding state in the history
3763		:- block 'CHANGED'(-,?,?,?).
3764		'CHANGED'(CurValue,Res,[AST|_],Span) :-
3765		(get_current_history(H,Span),
3766		last(H,PrevID), % get_current_predecessor_state_id does not take current_state_id_for_external_fun into account
3767		visited_state_corresponds_to_initialised_b_machine(PrevID)
3768		-> eval_formula_in_state(AST,pred_true,PrevID,PrevValue),
3769		% TODO: the AST could refer to local variables, e.g., if CHANGED is called in a set comprehension
3770		% currently this will lead to identifier not found error messages
3771		equality_objects(CurValue,PrevValue,EqRes),
3772		negate(EqRes,Res)
3773		; Res=pred_false
3774		).
3775		external_fun_type('INCREASING',[X],[X,boolean]).
3776		expects_unevaluated_args('INCREASING').
3777		expects_spaninfo('INCREASING').
3778		is_not_declarative('INCREASING'). % depends on history, not explicitly part of arguments
3779
3780		:- public 'INCREASING'/4.
3781		% check if an expression has increased wrt the preceding state in the history
3782		:- block 'INCREASING'(-,?,?,?).
3783		'INCREASING'(CurValue,Res,[AST|_],Span) :-
3784		(get_current_history(H,Span),
3785		last(H,PrevID), % get_current_predecessor_state_id does not take current_state_id_for_external_fun into account
3786		visited_state_corresponds_to_initialised_b_machine(PrevID)
3787		-> eval_formula_in_state(AST,pred_true,PrevID,PrevValue),
3788		'LESS'(PrevValue,CurValue,Res) % LESS can handle numbers, strings, enumerated sets, ...
3789		; Res=pred_false
3790		).
3791
3792
3793		:- use_module(state_space,[is_initial_state_id/1]).
3794
3795		:- public 'INITIAL_STATE'/3.
3796		expects_waitflag('INITIAL_STATE'). % external function with unknown return type
3797		'INITIAL_STATE'(int(InitialState),PredRes,WF) :-
3798		get_wait_flag(2,'INITIAL_STATE',WF,LWF),
3799		is_init2(InitialState,PredRes,LWF).
3800		:- block is_init2(-,-,?), is_init2(-,?,-).
3801		is_init2(InitialState,PredRes,_) :-
3802		PredRes == pred_true,!,
3803		is_initial_state_id(InitialState).
3804		is_init2(InitialState,PredRes,_) :- number(InitialState),!,
3805		(is_initial_state_id(InitialState) -> PredRes=pred_true ; PredRes=pred_false).
3806		is_init2(InitialState,PredRes,_LWF) :-
3807		PredRes == pred_false,!,
3808		when(nonvar(InitialState), \+is_initial_state_id(InitialState)).
3809		is_init2(InitialState,PredRes,LWF) :-
3810		add_internal_error('Uncovered case: ', is_init2(InitialState,PredRes,LWF)),fail.
3811
3812
3813		% provide information about a particular B machine in the project
3814		:- public 'MACHINE_INFO'/4.
3815		expects_waitflag('MACHINE_INFO').
3816		external_fun_type('MACHINE_INFO',[],[string,string,string]).
3817		:- block 'MACHINE_INFO'(?,-,?,?).
3818		'MACHINE_INFO'(M,string(I),Value,WF) :-
3819		get_wait_flag(2,'MACHINE_INFO',WF,LWF), % TO DO: use number of machines
3820		machine_info2(I,M,Value,LWF).
3821
3822		:- use_module(b_machine_hierarchy,[machine_type/2]).
3823		:- block machine_info2(-,?,?,?), machine_info2(?,-,?,-).
3824		machine_info2(INFO,M,Value,_LWF) :-
3825		(ground(M) -> M = string(MachineName) ; true),
3826		machine_info3(INFO,MachineName,Type),
3827		(M,Value) = (string(MachineName),string(Type)).
3828
3829		:- use_module(b_machine_hierarchy,[machine_type/2]).
3830		% :- use_module(extension('probhash/probhash'),[raw_sha_hash/2]). % already imported above
3831		:- use_module(bmachine,[get_full_b_machine/2]).
3832		machine_info3('TYPE',MachineName,Type) :- !, machine_type(MachineName,Type).
3833		% SHA_HASH
3834		machine_info3(INFO,_,_) :- add_error('MACHINE_INFO','Unknown info field (TYPE recognised): ',INFO),fail.
3835
3836
3837		:- use_module(tools_strings,[get_hex_codes/2]).
3838		external_fun_type('INT_TO_HEX_STRING',[],[integer,string]).
3839		:- public 'INT_TO_HEX_STRING'/2.
3840		:- block 'INT_TO_HEX_STRING'(-,?).
3841		'INT_TO_HEX_STRING'(int(Int),Res) :- int_to_hex(Int,Res).
3842
3843		:- block int_to_hex(-,?).
3844		int_to_hex(Int,Res) :-
3845		(Int >= 0 -> Nat=Int ; Nat is -(Int)),
3846		get_hex_codes(Nat,Chars),
3847		(Int >= 0 -> atom_codes(Atom,Chars) ; atom_codes(Atom,[45|Chars])), % "-" = [45]
3848		Res = string(Atom).
3849
3850
3851		:- use_module(tools_strings,[get_hex_bytes/2]).
3852		sha_hash_as_hex_codes(Term,SHAHexCodes) :-
3853		raw_sha_hash(Term,RawListOfBytes),
3854		get_hex_bytes(RawListOfBytes,SHAHexCodes).
3855
3856
3857
3858		%-------------------
3859
3860		% returns list of strings for info string such as files, variables,...
3861		external_fun_type('PROJECT_STATISTICS',[],[string,integer]).
3862		expects_waitflag('PROJECT_STATISTICS').
3863		expects_spaninfo('PROJECT_STATISTICS').
3864		:- public 'PROJECT_STATISTICS'/4.
3865		'PROJECT_STATISTICS'(Str,Res,Span,WF) :-
3866		kernel_waitflags:get_wait_flag(10,'PROJECT_STATISTICS',WF,WF10), % will enumerate possible input strings
3867		project_stats1(Str,Res,WF10,Span).
3868
3869		:- use_module(bmachine,[b_machine_statistics/2]).
3870		:- block project_stats1(-,?,-,?).
3871		project_stats1(string(INFO),Res,_,Span) :-
3872		if(b_machine_statistics(INFO,Nr), Res=int(Nr),
3873		add_error('PROJECT_STATISTICS','Unknown info field: ',INFO,Span)).
3874
3875
3876		% returns list of strings for info string such as files, variables,...
3877		external_fun_type('PROJECT_INFO',[],[string,set(string)]).
3878		expects_waitflag('PROJECT_INFO').
3879		expects_spaninfo('PROJECT_INFO').
3880		:- public 'PROJECT_INFO'/4.
3881		'PROJECT_INFO'(Str,Res,Span,WF) :-
3882		kernel_waitflags:get_wait_flag(10,'PROJECT_INFO',WF,WF10), % will enumerate possible input strings
3883		project_info1(Str,Res,WF10,Span).
3884
3885		:- block project_info1(-,?,-,?).
3886		project_info1(string(INFO),Res,_,_Span) :- INFO==help,!,
3887		L = [files, absolute-files, main-file, main-machine, sha-hash,
3888		variables, constants, sets, operations, assertion_labels, invariant_labels],
3889		maplist(make_string,L,SL),
3890		kernel_objects:equal_object(SL,Res).
3891		project_info1(string(INFO),Res,_,Span) :-
3892		if(list_info(INFO,L),
3893		(maplist(make_string,L,SL),
3894		kernel_objects:equal_object(SL,Res)),
3895		(add_error(external_functions,'Illegal argument for PROJECT_INFO or :list (use help to obtain valid arguments) : ',INFO,Span),
3896		fail)).
3897
3898		:- use_module(bmachine).
3899		:- use_module(bsyntaxtree, [get_texpr_ids/2, get_texpr_label/2]).
3900		:- use_module(tools,[get_tail_filename/2]).
3901		list_info(files,TL) :- (b_get_all_used_filenames(L) -> true ; L=[]), maplist(get_tail_filename,L,TL).
3902		list_info('absolute-files',L) :- (b_get_all_used_filenames(L) -> true ; L=[]).
3903		list_info('main-file',L) :- (b_get_main_filename(F) -> get_tail_filename(F,TF),L=[TF] ; L=[]).
3904		list_info('main-machine',L) :- findall(Name,get_full_b_machine(Name,_),L). % gets only the main machine
3905		list_info('sha-hash',[AtomHash]) :-
3906		get_full_b_machine_sha_hash(Bytes),
3907		get_hex_bytes(Bytes,Hash), atom_codes(AtomHash,Hash).
3908		list_info(variables,L) :- b_get_machine_variables(LT), get_texpr_ids(LT,L).
3909		list_info(constants,L) :- b_get_machine_constants(LT), get_texpr_ids(LT,L).
3910		list_info(sets,L) :- findall(S,b_get_machine_set(S),L).
3911		list_info(operations,L) :- findall(S,b_top_level_operation(S),L).
3912		list_info(assertion_labels,L) :-
3913		findall(ID,(b_get_assertions(all,_,Ass), member(Assertion,Ass),get_texpr_label(Assertion,ID)),L).
3914		list_info(invariant_labels,L) :-
3915		findall(ID,(b_get_invariant_from_machine(C), conjunction_to_list(C,CL),
3916		member(Inv,CL),get_texpr_label(Inv,ID)),L).
3917
3918
3919		make_string(X,Res) :- atom(X),!,Res=string(X).
3920		make_string(X,Res) :- format_to_codes('~w',X,C), atom_codes(Atom,C), Res=string(Atom).
3921
3922		% obtain the source code of an identifier
3923		external_fun_type('SOURCE',[],[string,string]).
3924		:- public 'SOURCE'/2.
3925		'SOURCE'(string(ID),SourceCode) :- source2(ID,SourceCode).
3926		:- block source2(-,?).
3927		source2(ID,SourceCode) :-
3928		source_code_for_identifier(ID,_,_,_OriginStr,_,Source),
3929		translate:translate_bexpression(Source,SC),
3930		SourceCode = string(SC).
3931
3932
3933		% obtain various information about ProB (STRING result)
3934		external_fun_type('PROB_INFO_STR',[],[string,string]).
3935		expects_waitflag('PROB_INFO_STR').
3936		:- assert_must_succeed(external_functions:'PROB_INFO_STR'(string('prob-version'),string(_),_)).
3937		:- public 'PROB_INFO_STR'/3.
3938		% :- block 'PROB_INFO_STR'(-,?). % no block: this way we can via backtracking generate solutions
3939		'PROB_INFO_STR'(Str,Res,WF) :-
3940		kernel_waitflags:get_wait_flag(10,'PROB_INFO_STR',WF,WF10), % will enumerate possible input strings
3941		prob_info1(Str,Res,WF10,WF).
3942
3943		:- use_module(tools,[ajoin_with_sep/3]).
3944		:- block prob_info1(-,?,-,?).
3945		prob_info1(string(INFO),Res,_,WF) :-
3946		if(prob_info2(INFO,Str),true,
3947		(findall(I,prob_info2(I,_),Is),
3948		ajoin_with_sep(['Unknown info field, known fields:'|Is],' ',Msg),
3949		add_error_wf('PROB_INFO_STR',Msg,I,unknown,WF),
3950		Str = 'ERROR'
3951		)),
3952		make_string(Str,Res).
3953
3954		:- use_module(probsrc(tools_strings),[ajoin/2]).
3955		:- use_module(parsercall,[get_parser_version/1, get_java_command_path/1, get_java_fullversion/3]).
3956		:- use_module(version, [version_str/1, revision/1, lastchangeddate/1]).
3957		prob_info2('prob-version',V) :- version_str(V).
3958		prob_info2('parser-version',V) :- get_parser_version(V).
3959		prob_info2('prolog-version',V) :- current_prolog_flag(version,V).
3960		prob_info2('prob-revision',V) :- revision(V).
3961		prob_info2('prob-last-changed-date',V) :- lastchangeddate(V).
3962		prob_info2('java-version',V) :- get_java_fullversion(Maj,Min,Sfx), ajoin([Maj,'.',Min,'.',Sfx],V).
3963		prob_info2('java-command-path',V) :- get_java_command_path(V).
3964		prob_info2('current-time',V) :- get_info2(time,string(V)). % Maybe we can get rid of GET_INFO ?
3965
3966
3967		% obtain various information about ProB (INTEGER result)
3968		external_fun_type('PROB_STATISTICS',[],[string,integer]).
3969		expects_waitflag('PROB_STATISTICS').
3970		expects_spaninfo('PROB_STATISTICS').
3971		external_function_requires_state('PROB_STATISTICS'). % e.g., for current-state-id
3972		:- public 'PROB_STATISTICS'/4.
3973		'PROB_STATISTICS'(Str,Res,Span,WF) :-
3974		kernel_waitflags:get_wait_flag(10,'PROB_STATISTICS',WF,WF10), % will enumerate possible input strings
3975		prob_info_int1(Str,Res,Span,WF10,WF).
3976
3977		% old name of function:
3978		:- public 'PROB_INFO_INT'/4.
3979		'PROB_INFO_INT'(Str,Res,Span,WF) :- 'PROB_STATISTICS'(Str,Res,Span,WF).
3980
3981		:- block prob_info_int1(-,?,?,-,?).
3982		prob_info_int1(string(INFO),Res,Span,_,WF) :-
3983		if(prob_info_int1(INFO,I), Res=int(I),
3984		(add_error_wf('PROB_STATISTICS','Unknown info field: ',INFO,Span,WF),
3985		fail)).
3986
3987		:- use_module(state_space_exploration_modes,[get_current_breadth_first_level/1]).
3988		:- use_module(state_space,[get_state_space_stats/3]).
3989		prob_info_int1('current-state-id',StateIDNr) :- get_current_state_id(ID),convert_id_to_nr(ID,StateIDNr).
3990		prob_info_int1('states',NrNodes) :- get_state_space_stats(NrNodes,_,_).
3991		prob_info_int1('transitions',NrTransitions) :- get_state_space_stats(_,NrTransitions,_).
3992		prob_info_int1('processed-states',ProcessedNodes) :- get_state_space_stats(_,_,ProcessedNodes).
3993		prob_info_int1('bf-level',Level) :- (get_current_breadth_first_level(R) -> Level = R ; Level = -1).
3994		prob_info_int1('now-timestamp',N) :- now(N). % provide UNIX timesstamp
3995		prob_info_int1('prolog-runtime',V) :- statistics(runtime,[V,_]).
3996		prob_info_int1('prolog-walltime',V) :- statistics(walltime,[V,_]).
3997		prob_info_int1('prolog-memory-bytes-used',V) :- statistics(memory_used,V).
3998		prob_info_int1('prolog-memory-bytes-free',V) :- statistics(memory_free,V).
3999		prob_info_int1('prolog-global-stack-bytes-used',V) :- statistics(global_stack_used,V).
4000		prob_info_int1('prolog-local-stack-bytes-used',V) :- statistics(local_stack_used,V).
4001		%prob_info_int1('prolog-global-stack-bytes-free',V) :- statistics(global_stack_free,V).
4002		%prob_info_int1('prolog-local-stack-bytes-free',V) :- statistics(local_stack_free,V).
4003		prob_info_int1('prolog-trail-bytes-used',V) :- statistics(trail_used,V).
4004		prob_info_int1('prolog-choice-bytes-used',V) :- statistics(choice_used,V).
4005		prob_info_int1('prolog-atoms-bytes-used',V) :- statistics(atoms_used,V).
4006		prob_info_int1('prolog-atoms-nb-used',V) :- statistics(atoms_nbused,V).
4007		prob_info_int1('prolog-gc-count',V) :- statistics(gc_count,V).
4008		prob_info_int1('prolog-gc-time',V) :- statistics(gc_time,V).
4009
4010		% --------------------
4011
4012		% coverage/projection functions:
4013
4014		external_fun_type('STATE_VALUES',[T],[string,set(couple(couple(integer,integer),T))]).
4015		expects_unevaluated_args('STATE_VALUES').
4016		:- public 'STATE_VALUES'/3.
4017		:- block 'STATE_VALUES'(-,?,?).
4018		'STATE_VALUES'(_Value,Res,[AST]) :-
4019		state_space_reduction:compute_set_of_covered_values_for_typed_expression(AST,Set),
4020		kernel_objects:equal_object_optimized(Set,Res).
4021
4022		% TODO: other projection/reduction operators: projection as graph, ...
4023		% could be useful to have a minimum/maximum operator on sets which uses Prolog order in avl
4024
4025		% -----------------
4026
4027		% obtain various information about bvisual2 Formulas
4028		external_fun_type('FORMULA_INFOS',[],[string,seq(string)]).
4029		expects_waitflag('FORMULA_INFOS').
4030		:- public 'FORMULA_INFOS'/3.
4031		'FORMULA_INFOS'(Str,Res,WF) :-
4032		kernel_waitflags:get_wait_flag(10,'FORMULA_INFOS',WF,WF10), % will enumerate possible input strings
4033	?	formula_info(Str,_,Res,_,WF10).
4034		external_fun_type('FORMULA_VALUES',[],[string,seq(string)]).
4035		expects_waitflag('FORMULA_VALUES').
4036		:- public 'FORMULA_VALUES'/3.
4037		'FORMULA_VALUES'(Str,Res,WF) :-
4038		kernel_waitflags:get_wait_flag(10,'FORMULA_VALUES',WF,WF10), % will enumerate possible input strings
4039	?	formula_info(Str,_,_,Res,WF10).
4040
4041		:- use_module(extrasrc(bvisual2),[bv_get_top_level_formula/4, bv_value_to_atom/2]).
4042
4043		% valid TopLevelCategories are constants, definitions, guards_top_level, inv, sets, variables
4044		:- block formula_info(-,?,?,?,-).
4045		formula_info(string(TopLevelCategory),CatTextRes,LabelRes,ValuesRes,_) :-
4046	?	bv_get_top_level_formula(TopLevelCategory,CatText,Labels,Values),
4047		CatTextRes = string(CatText),
4048		maplist(make_string,Labels,LS),
4049		convert_list_to_seq(LS,LabelRes),
4050		maplist(make_value,Values,LV),
4051		convert_list_to_seq(LV,ValuesRes).
4052
4053		make_value(V,string(A)) :- bv_value_to_atom(V,A).
4054		%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4055
4056
4057		% --------------------------
4058
4059		:- use_module(covsrc(hit_profiler),[add_hit/2, add_hit_if_not_covered/2,
4060		get_profile_statistics/2, profile_functor/1]). %profiler:profile_statistics.
4061
4062		:- public 'GET_PROFILE_STATISTICS'/3.
4063		is_not_declarative('GET_PROFILE_STATISTICS').
4064		:- block 'GET_PROFILE_STATISTICS'(-,?,?).
4065		'GET_PROFILE_STATISTICS'(string(PP),_DummyType,Res) :- % DummyType is just there for typing purposes
4066		if(profile_functor(PP),
4067		(get_profile_statistics(PP,Hits),
4068		maplist(translate_hit_to_b,Hits,List)),
4069		List = []),
4070		equal_object_optimized(List,Res, 'GET_PROFILE_STATISTICS').
4071		%equal_object(List,Res,'GET_PROFILE_STATISTICS'), print(res(Res)),nl.
4072
4073		translate_hit_to_b(hit(Arg,Nr),(Arg,int(Nr))).
4074
4075		:- public 'GET_PROFILE_POINTS'/1.
4076		'GET_PROFILE_POINTS'(Res) :- findall(string(S),profile_functor(S),List),
4077		equal_object_optimized(List,Res,'PROFILE_POINT').
4078
4079		expects_spaninfo('PROFILE').
4080		:- public 'PROFILE'/5.
4081		:- block 'PROFILE'(-,?,?,?,?), 'PROFILE'(?,-,?,?,?). %, 'PROFILE'(?,-,?,?,?).
4082		'PROFILE'(string(PP),Count,Value,ValueRes,SpanInfo) :-
4083		add_profile_exf_hit(Value,PP,SpanInfo,Count),
4084		equal_object(Value,ValueRes,'PROFILE').
4085
4086		:- block add_profile_exf_hit(-,?,?,?), add_profile_exf_hit(?,-,?,?).
4087		add_profile_exf_hit(pred_true,PP,SpanInfo,Count) :- !, add_value_hit(Count,pred_true,PP,SpanInfo).
4088		add_profile_exf_hit(pred_false,PP,SpanInfo,Count) :- !, add_value_hit(Count,pred_false,PP,SpanInfo).
4089		add_profile_exf_hit(int(X),PP,SpanInfo,Count) :- !, add_int_hit(X,PP,SpanInfo,Count).
4090		add_profile_exf_hit(string(X),PP,SpanInfo,Count) :- !, add_string_hit(X,PP,SpanInfo,Count).
4091		add_profile_exf_hit(Value,PP,SpanInfo,Count) :- when(ground(Value), add_complex_hit(Value,PP,SpanInfo,Count)).
4092
4093		add_complex_hit(Value,PP,SpanInfo,Count) :- print(PP), print(' : '), translate:print_bvalue(Value),nl,
4094		add_value_hit(Count,Value,PP,SpanInfo).
4095
4096		:- block add_int_hit(-,?,?,?).
4097		add_int_hit(X,PP,SpanInfo,Count) :- add_value_hit(Count,int(X),PP,SpanInfo).
4098		:- block add_string_hit(-,?,?,?).
4099		add_string_hit(X,PP,SpanInfo,Count) :- add_value_hit(Count,string(X),PP,SpanInfo).
4100
4101		add_value_hit(pred_true,Val,PP,_) :- add_hit(PP,Val).
4102		add_value_hit(pred_false,Val,PP,_) :- add_hit_if_not_covered(PP,Val).
4103
4104		% -------------------
4105
4106		:- use_module(memoization,[get_complete_memoization_expansion/6]).
4107
4108		expects_spaninfo('MEMOIZE_STORED_FUNCTION').
4109		expects_waitflag('MEMOIZE_STORED_FUNCTION').
4110		:- public 'MEMOIZE_STORED_FUNCTION'/4.
4111		:- block 'MEMOIZE_STORED_FUNCTION'(-,?,?,?).
4112		'MEMOIZE_STORED_FUNCTION'(int(MemoID),Res,Span,WF) :- memoize_get_aux(MemoID,Res,Span,WF).
4113
4114		:- block memoize_get_aux(-,?,?,?).
4115		memoize_get_aux(MemoID,Res,Span,WF) :-
4116		if(get_complete_memoization_expansion(MemoID,RV,_Done,Span,'MEMOIZE_STORED_FUNCTION',WF),
4117		kernel_objects:equal_object_wf(Res,RV,WF),
4118		add_error(external_functions,'Function ID not registered:',MemoID,Span)).
4119
4120		% -------------------
4121
4122		:- use_module(eval_let_store,[stored_let_value/3, set_stored_let_value/3,
4123		retract_stored_let_value/3, reset_let_values/0,
4124		extend_state_with_stored_lets/2, get_stored_let_typing_scope/1]).
4125
4126		:- public 'STORE'/4.
4127		external_fun_type('STORE',[X],[X,X]).
4128		expects_waitflag('STORE').
4129		expects_unevaluated_args('STORE').
4130		% stores values just like :let in the REPL does, but can be used within a predicate;
4131		% here name inferred from AST and it is a transparent function for more convenient annotation
4132		:- block 'STORE'(-,?,?,?).
4133		'STORE'(Val,Res,[TVal],WF) :- equal_object_optimized_wf(Val,Res,'STORE',WF),
4134		(translate:try_get_identifier(TVal,ID) -> true % also checks for was_identifier
4135		; translate:translate_bexpression(TVal,ID),
4136		add_warning('STORE','The expression is not an identifier:',ID,TVal)
4137		),
4138		'STORE_VALUE'(string(ID),Val,pred_true,[_,TVal],WF).
4139
4140		external_fun_type('STORE_VALUE',[X],[string,X,boolean]).
4141		expects_waitflag('STORE_VALUE').
4142		expects_unevaluated_args('STORE_VALUE').
4143		% stores values just like :let in the REPL does, but can be used within a predicate
4144		:- block 'STORE_VALUE'(-,?,?,?,?).
4145		'STORE_VALUE'(string(ID),Val,PredRes,[_,TVal],WF) :- PredRes=pred_true,
4146		get_enumeration_finished_wait_flag(WF,EWF),
4147		get_texpr_type(TVal,Type),
4148		store_value(ID,Type,Val,EWF).
4149
4150		:- block store_value(-,?,?,?), store_value(?,?,?,-).
4151		store_value(ID,Type,Val,_) :-
4152		set_stored_let_value(ID,Type,Val).
4153
4154
4155		:- use_module(btypechecker, [unify_types_werrors/4]).
4156		:- public 'RECALL_VALUE'/5.
4157		external_fun_type('RECALL_VALUE',[X],[string,X]).
4158		expects_waitflag('RECALL_VALUE').
4159		expects_spaninfo('RECALL_VALUE').
4160		expects_type('RECALL_VALUE').
4161		:- block 'RECALL_VALUE'(-,?,?,?,?).
4162		'RECALL_VALUE'(string(ID),Res,Type,Span,WF) :-
4163		recall_value(ID,Res,Type,Span,WF).
4164
4165		recall_value(ID,Res,Type,Span,WF) :-
4166		stored_let_value(ID,StoredType,Val),
4167		!,
4168		(unify_types_werrors(Type,StoredType,Span,'RECALL_VALUE')
4169		-> equal_object_optimized_wf(Val,Res,'RECALL_VALUE',WF)
4170		; add_error_wf('RECALL_VALUE','Stored value has incompatible type:',ID,Span,WF)
4171		).
4172		recall_value(ID,_,_,Span,WF) :-
4173		add_error_wf('RECALL_VALUE','No value stored with STORE_VALUE or :let for:',ID,Span,WF),
4174		fail.
4175
4176		% TODO: do we need a DELETE_STORED_VALUE external function
4177
4178		% -------------------
4179		% a few ugraphs (unweighted graphs) utilities:
4180
4181		% an alternate implementation of closure1
4182		expects_spaninfo('CLOSURE1').
4183		external_fun_type('CLOSURE1',[X],[set(couple(X,X)),set(couple(X,X))]).
4184		:- public 'CLOSURE1'/3.
4185		:- block 'CLOSURE1'(-,?,?).
4186		'CLOSURE1'([],Res,_) :- !, kernel_objects:equal_object(Res,[]).
4187		'CLOSURE1'(avl_set(A),Res,_) :- !, closure1_for_avl_set(A,R), kernel_objects:equal_object_optimized(R,Res).
4188		'CLOSURE1'(A,Res,Span) :- ground_value_check(A,Gr), closure1_gr(A,Gr,Res,Span).
4189
4190		closure1_gr(Set,_,Res,Span) :- convert_to_avl(Set,AVL),!, 'CLOSURE1'(AVL,Res,Span).
4191		closure1_gr(Set,_,_,Span) :-
4192		add_error(external_functions,'Cannot convert CLOSURE1 argument to set: ',Set,Span).
4193
4194		% compute strongly connected components
4195		expects_spaninfo('SCCS').
4196		external_fun_type('SCCS',[X],[set(couple(X,X)),set(set(X))]).
4197		:- public 'SCCS'/3.
4198		:- block 'SCCS'(-,?,?).
4199		'SCCS'([],Res,_) :- !, kernel_objects:equal_object(Res,[]).
4200		'SCCS'(avl_set(A),Res,_) :- !, sccs_for_avl_set(A,R), kernel_objects:equal_object_optimized(R,Res).
4201		'SCCS'(A,Res,Span) :- ground_value_check(A,Gr), sccs_gr(A,Gr,Res,Span).
4202
4203		sccs_gr(Set,_,Res,Span) :- convert_to_avl(Set,AVL),!, 'SCCS'(AVL,Res,Span).
4204		sccs_gr(Set,_,_,Span) :-
4205		add_error(external_functions,'Cannot convert SCCS argument to set: ',Set,Span).
4206
4207		:- use_module(extrasrc(avl_ugraphs),[avl_transitive_closure/2, avl_scc_sets/2]).
4208		closure1_for_avl_set(A,Res) :-
4209		avl_transitive_closure(A,TC),
4210		construct_avl_set(TC,Res).
4211		sccs_for_avl_set(A,Res) :-
4212		avl_scc_sets(A,TC),
4213		construct_avl_set(TC,Res).
4214		construct_avl_set(Avl,Res) :- empty_avl(Avl) -> Res = [] ; Res = avl_set(Avl).
4215		% -------------------
4216
4217		reset_kodkod :-
4218		true. %retractall(kodkod_pred(_,_)).
4219
4220		%:- use_module(probsrc(bsyntaxtree), [b_compute_expression/5]).
4221
4222		% KODKOD(ProblemID, LocalIDsOfPredicate, WaitToBeGroundBeforePosting, PredicateAsBooleanFunction)
4223		% EXTERNAL_PREDICATE_KODKOD(T1,T2) == INTEGER*T1*T2*BOOL;
4224		%:- dynamic kodkod_pred/2. % now stored as attribute in WF store
4225		do_not_evaluate_args('KODKOD').
4226		expects_unevaluated_args('KODKOD').
4227		expects_waitflag('KODKOD').
4228		expects_spaninfo('KODKOD').
4229		expects_state('KODKOD').
4230
4231		:- use_module(bsyntaxtree,[create_negation/2]).
4232		:- use_module(b_compiler,[b_optimize/6]).
4233		:- use_module(b_interpreter,[b_compute_expression/5]).
4234		:- public 'KODKOD'/6.
4235		:- block 'KODKOD'(-,?,?,?,?,?).
4236		'KODKOD'(PredRes,LocalState,State,UnevaluatedArgs,Span,WF) :-
4237		UnevaluatedArgs = [TID,IDEXPR,WAITIDEXPR,UEA],
4238		get_integer(TID,ID),
4239		construct_predicate(UEA,KPredicate),
4240		(PredRes == pred_false -> create_negation(KPredicate,Predicate) ; Predicate=KPredicate),
4241		must_get_identifiers('KODKOD',IDEXPR,TIdentifiers),
4242		get_texpr_ids(TIdentifiers,Ids),
4243		b_compute_expression(WAITIDEXPR,LocalState,State,WaitVal,WF),
4244		when(ground(WaitVal),
4245		( b_optimize(Predicate,Ids,LocalState,State,CPredicate,WF),
4246		(debug:debug_mode(off) -> true
4247		; add_message(kodkod,'STORING FOR KODKOD : ',ID:PredRes,Span), translate:print_bexpr(CPredicate),nl),
4248		kernel_waitflags:my_add_predicate_to_kodkod(WF,ID,CPredicate),
4249		%assertz(kodkod_pred(ID,CPredicate)), % TO DO: attach to WF Store !; assertz will break Prolog variable links !
4250		% TO DO: retract upon backtracking + store negation if PredRes = pred_false
4251		PredRes=pred_true
4252		)).
4253
4254
4255		:- use_module(probsrc(bsyntaxtree), [safe_create_texpr/3]).
4256		construct_predicate(b(convert_bool(P),_,_),Res) :- !, Res=P.
4257		construct_predicate(BoolExpr,Res) :-
4258		safe_create_texpr(equal(BoolExpr,b(boolean_true,boolean,[])),pred,Res).
4259
4260		:- use_module(kodkodsrc(kodkod), [replace_by_kodkod/3]).
4261		% EXTERNAL_PREDICATE_KODKOD_SOLVE(T1,T2) == INTEGER*T1*T2;
4262		expects_unevaluated_args('KODKOD_SOLVE').
4263		expects_waitflag('KODKOD_SOLVE').
4264		expects_state('KODKOD_SOLVE').
4265		:- public 'KODKOD_SOLVE'/8.
4266		:- block 'KODKOD_SOLVE'(-,?,?,?,?,?,?,?).
4267		'KODKOD_SOLVE'(int(ID),Ids,WaitIds,PredRes,LocalState,State,UEA,WF) :-
4268		when(ground(WaitIds),
4269		kodkod_solve_aux(ID,Ids,WaitIds,PredRes,LocalState,State,UEA,WF)).
4270
4271		:- use_module(library(ordsets),[ord_subtract/3]).
4272		kodkod_solve_aux(ID,Ids,_WaitIds,PredRes,LocalState,State,UEA,WF) :-
4273		%print(trigger_SOLVE(_WaitIds)),nl,
4274		get_wait_flag(2,'KODKOD_SOLVE',WF,LWF), % give other co-routines chance to fire
4275		kodkod_solve_aux2(ID,Ids,PredRes,LocalState,State,UEA,WF,LWF).
4276
4277		:- block kodkod_solve_aux2(?,?,?,?,?,?,?,-).
4278		kodkod_solve_aux2(ID,_,PredRes,LocalState,State,[_,IDEXPR,WAITIDEXPR],WF,_) :-
4279		%print(ls(LocalState,State)),nl,
4280		%findall(P,kodkod_pred(ID,P),Ps), % TO DO: obtain from WF Store
4281		kernel_waitflags:my_get_kodkod_predicates(WF,ID,Ps),
4282		length(Ps,Len),
4283		reverse(Ps,RPs), % we reverse Ps to put predicates in same order they were added by KODKOD / seems to influence analysis time
4284		conjunct_predicates(RPs,Predicate),
4285		%translate:print_bexpr(Predicate),nl,
4286		must_get_identifiers('KODKOD_SOLVE',IDEXPR,TIdentifiers),
4287		get_texpr_ids(TIdentifiers,Ids),
4288		((get_identifiers(WAITIDEXPR,TWaitIds,[]), get_texpr_ids(TWaitIds,WaitIds),
4289		sort(WaitIds,SWIds),
4290		formatsilent('KODKOD_SOLVE Problem ~w (~w conjuncts), Identifiers: ~w, Waiting for ~w~n',[ID,Len,Ids,SWIds]),
4291		sort(Ids,SIds),
4292		ord_subtract(SIds,SWIds,IdsToSolve))
4293		-> b_optimize(Predicate,IdsToSolve,LocalState,State,CPredicate,WF), % inline known values
4294		(silent_mode(on) -> true ; print('compiled: '),translate:print_bexpr(CPredicate),nl,nl)
4295		; CPredicate=Predicate
4296		),
4297		(replace_by_kodkod(TIdentifiers,CPredicate,NewPredicate)
4298		-> (silent_mode(on) -> true ; print('AFTER KODKOD: '),translate:print_bexpr(NewPredicate),nl),
4299		b_interpreter:b_test_boolean_expression(NewPredicate,LocalState,State,WF)
4300		; print('KODKOD cannot be applied'),nl,
4301		b_interpreter:b_test_boolean_expression(CPredicate,LocalState,State,WF)
4302		),
4303		PredRes=pred_true.
4304
4305		must_get_identifiers(PP,TExpr,Res) :-
4306		(get_identifiers(TExpr,Ids,[]) -> Res=Ids
4307		; add_error(PP,'Could not get identifiers: ',TExpr),fail).
4308
4309		get_identifiers(b(couple(A1,A2),_,_)) --> !, get_identifiers(A1), get_identifiers(A2).
4310		get_identifiers(b(identifier(ID),T,I)) --> [b(identifier(ID),T,I)].
4311		get_identifiers(b(integer(_),_,_)) --> []. % to do: accept other ground values; in case they are compiled
4312		get_identifiers(b(value(_),_,_)) --> []. % identifier has already been compiled
4313		get_identifiers(b(string(_),_,_)) --> [].
4314
4315
4316		% -------------------
4317		do_not_evaluate_args('SATSOLVER').
4318		expects_unevaluated_args('SATSOLVER').
4319		expects_waitflag('SATSOLVER').
4320		expects_spaninfo('SATSOLVER').
4321		expects_state('SATSOLVER').
4322
4323		:- use_module(kernel_tools,[value_variables/2]).
4324		:- public 'SATSOLVER'/6.
4325		:- block 'SATSOLVER'(-,?,?,?,?,?).
4326		'SATSOLVER'(PredRes,LocalState,State,UnevaluatedArgs,Span,WF) :-
4327		UnevaluatedArgs = [TID,IDEXPR,WAITIDEXPR,UEA],
4328		get_integer(TID,ID),
4329		construct_predicate(UEA,KPredicate),
4330		(PredRes == pred_false -> create_negation(KPredicate,Predicate) ; Predicate=KPredicate),
4331		must_get_identifiers('SATSOLVER',IDEXPR,TIdentifiers),
4332		get_texpr_ids(TIdentifiers,Ids),
4333		% Note: the Ids are not really necessary here; they are just used for b_optimize; see SATSOLVER_SOLVE below
4334		b_interpreter:b_compute_expression(WAITIDEXPR,LocalState,State,WaitVal,WF),
4335		value_variables(WaitVal,WVars),
4336		when(ground(WVars),
4337		( %print(compile_for(ID,Ids)),nl,
4338		%nl,add_message(satsolver,'Optimzing for SATSOLVER_SOLVE: ',Predicate,Span), debug:nl_time,
4339		%translate:nested_print_bexpr(Predicate),nl,
4340		b_optimize(Predicate,Ids,LocalState,State,CPredicate,WF), % Ids are left in the closure
4341		(debug:debug_mode(off) -> true
4342		; add_message(satsolver,'Storing for SATSOLVER_SOLVE: ',CPredicate,Span)
4343		),
4344		kernel_waitflags:my_add_predicate_to_satsolver(WF,ID,CPredicate),
4345		% TO DO: retract upon backtracking + store negation if PredRes = pred_false
4346		PredRes=pred_true
4347		)).
4348
4349		expects_unevaluated_args('SATSOLVER_SOLVE').
4350		expects_waitflag('SATSOLVER_SOLVE').
4351		expects_state('SATSOLVER_SOLVE').
4352		:- public 'SATSOLVER_SOLVE'/8.
4353		:- block 'SATSOLVER_SOLVE'(-,?,?,?,?,?,?,?).
4354		'SATSOLVER_SOLVE'(int(ID),Ids,WaitIds,PredRes,LocalState,State,UEA,WF) :-
4355		value_variables(WaitIds,WVars),
4356		get_wait_flag1('SATSOLVER_SOLVE',WF,WF1),
4357		when(ground((WF1,WVars)),
4358		satsolver_solve_aux(ID,Ids,WaitIds,PredRes,LocalState,State,UEA,WF)).
4359		% Note: the Ids are not really necessary here; they are just used for b_optimize
4360		% The b_to_cnf conversion will look up all identifiers anyway, identifier or value(_) node makes no difference!
4361		% TODO: probably remove them
4362
4363		:- use_module(library(ordsets),[ord_subtract/3]).
4364		satsolver_solve_aux(ID,Ids,_WaitIds,PredRes,LocalState,State,UEA,WF) :-
4365		%print(trigger_SOLVE(_WaitIds)),nl,
4366		get_idle_wait_flag('SATSOLVER_SOLVE',WF,LWF), % give other co-routines chance to fire
4367		satsolver_solve_aux2(ID,Ids,PredRes,LocalState,State,UEA,WF,LWF).
4368
4369		:- use_module(extension('satsolver/b2sat'), [solve_predicate_with_satsolver/2]).
4370
4371		:- block satsolver_solve_aux2(?,?,?,?,?,?,?,-).
4372		satsolver_solve_aux2(ID,_,PredRes,LocalState,State,[_,IDEXPR,WAITIDEXPR],WF,_) :-
4373		print('SATSOLVER_SOLVE:'),nl,
4374		kernel_waitflags:my_get_satsolver_predicates(WF,ID,Ps),
4375		length(Ps,Len), format('Got ~w SATSOLVER predicates for ID: ~w~n',[Len,ID]),
4376		reverse(Ps,RPs), % we reverse Ps to put predicates in same order they were added, necessary??
4377		conjunct_predicates(RPs,Predicate),
4378		%translate:print_bexpr(Predicate),nl,
4379		must_get_identifiers('SATSOLVER_SOLVE',IDEXPR,TIdentifiers),
4380		get_texpr_ids(TIdentifiers,Ids),
4381		((get_identifiers(WAITIDEXPR,TWaitIds,[]), get_texpr_ids(TWaitIds,WaitIds),
4382		sort(WaitIds,SWIds),
4383		formatsilent('Sat Solver identifiers: ~w ; waiting for ~w~n',[Ids,SWIds]),
4384		sort(Ids,SIds),
4385		ord_subtract(SIds,SWIds,IdsToSolve))
4386		-> b_optimize(Predicate,IdsToSolve,LocalState,State,CPredicate,WF), % inline known values
4387		(debug_mode(off) -> true
4388		; print('compiled: '),translate:print_bexpr(CPredicate),nl,nl)
4389		; CPredicate=Predicate
4390		),
4391		(solve_predicate_with_satsolver(CPredicate,State)
4392		% if(b_interpreter:b_test_boolean_expression(CPredicate,[],State,WF),print(ok),
4393		% add_error_wf('SATSOLVER_SOLVE','SAT result not confirmed by ProB:',ID,CPredicate,WF))
4394		% TODO: catch errors if b_sat fails!
4395		%-> true
4396		% ; print('Calling SAT solver failed'),nl,
4397		% b_interpreter:b_test_boolean_expression(CPredicate,LocalState,State,WF)
4398		),
4399		PredRes=pred_true.
4400		% -------------------
4401
4402
4403		expects_waitflag('UNSAT_CORE'). % WF not used at the moment
4404		expects_spaninfo('UNSAT_CORE').
4405		:- public 'UNSAT_CORE'/5.
4406		% EXTERNAL_FUNCTION_UNSAT_CORE(T) == (POW(T)-->BOOL)*POW(T) --> POW(T);
4407		% UNSAT_CORE(Fun,Set) == Set
4408		% example: UNSAT_CORE(f,0..200) = {2} with f = %x.(x:POW(INTEGER)|bool(x /\ 1..2={}))
4409		'UNSAT_CORE'(FunToBool,Set,ValueRes,SpanInfo,WF) :-
4410		'UNSAT_CORE_ACC'(FunToBool,Set,[],ValueRes,SpanInfo,WF).
4411
4412
4413		expects_waitflag('UNSAT_CORE_ACC'). % WF not used at the moment
4414		expects_spaninfo('UNSAT_CORE_ACC').
4415		% EXTERNAL_FUNCTION_UNSAT_CORE_ACC(T) == (POW(T)-->BOOL)*POW(T)*POW(T) --> POW(T);
4416		% UNSAT_CORE_ACC(Fun,Set,Acc) == Set\/Acc;
4417		% example: UNSAT_CORE_ACC(f,0..200,{}) = {2} & f = %x.(x:POW(INTEGER)|bool(x /\ 1..2={}))
4418		% provides a way to initialise the accumulator of the unsat core computation
4419		'UNSAT_CORE_ACC'(FunToBool,Set,Acc,ValueRes,SpanInfo,WF) :-
4420		expand_custom_set_to_list_wf(Set,ESet,_,compute_apply_true,WF),
4421		expand_custom_set_to_list_wf(Acc,EAcc,_,compute_apply_true,WF),
4422		debug_println(9,computing_unsat_core(ESet,EAcc)),
4423		when(ground((FunToBool,ESet)), compute_unsat_core(ESet,FunToBool,no_time_out,EAcc,ValueRes,SpanInfo,WF)).
4424
4425		% EXTERNAL_FUNCTION_UNSAT_CORE_ACC_TIMEOUT(T) == (POW(T)-->BOOL)*POW(T)*POW(T)*INTEGER --> POW(T);
4426		% UNSAT_CORE_ACC_TIMEOUT(Fun,Set,Acc,TO) == Set\/Acc;
4427		% example: UNSAT_CORE_ACC_TIMEOUT(f,0..200,{},100) = {2} & f = %x.(x:POW(INTEGER)|bool(x /\ 1..2={}))
4428		expects_waitflag('UNSAT_CORE_ACC_TIMEOUT'). % WF not used at the moment
4429		expects_spaninfo('UNSAT_CORE_ACC_TIMEOUT').
4430		:- public 'UNSAT_CORE_ACC_TIMEOUT'/7.
4431		'UNSAT_CORE_ACC_TIMEOUT'(FunToBool,Set,Acc,int(TimeOut),ValueRes,SpanInfo,WF) :-
4432		expand_custom_set_to_list_wf(Set,ESet,_,compute_apply_true,WF),
4433		expand_custom_set_to_list_wf(Acc,EAcc,_,compute_apply_true,WF),
4434		debug_println(9,computing_unsat_core(ESet,EAcc)),
4435		when(ground((FunToBool,ESet,TimeOut)), compute_unsat_core(ESet,FunToBool,TimeOut,EAcc,ValueRes,SpanInfo,WF)).
4436
4437		compute_unsat_core([],_FunToBool,_TimeOut,Core,Result,_SpanInfo,WF) :- equal_object_wf(Result,Core,WF).
4438		compute_unsat_core([H|T],FunToBool,TimeOut,Core,Result,SpanInfo,WF) :-
4439		debug_println(9,trying_to_remove(H,core(Core))),
4440		append(Core,T,CoreT),
4441		if(compute_apply_true_timeout(TimeOut,FunToBool,CoreT,SpanInfo),
4442		compute_unsat_core(T,FunToBool,TimeOut,[H|Core],Result,SpanInfo,WF), % we found a solution, H is needed in core
4443		compute_unsat_core(T,FunToBool,TimeOut, Core, Result,SpanInfo,WF) % contradiction also exists without H
4444		).
4445
4446		:- use_module(library(timeout)).
4447		compute_apply_true_timeout(no_time_out,FunToBool,CoreT,SpanInfo) :- !,
4448		compute_apply_true(FunToBool,CoreT,SpanInfo).
4449		compute_apply_true_timeout(TO,FunToBool,CoreT,SpanInfo) :-
4450		time_out(compute_apply_true(FunToBool,CoreT,SpanInfo), TO, TORes),
4451		(TORes == success -> true ,format(user_output,'~nSUCCESS~n~n',[])
4452		; format(user_output,'~nTIME-OUT: ~w~n~n',[TORes]),fail). % treat time-out like failure
4453
4454		compute_apply_true(FunToBool,CoreT,SpanInfo) :-
4455		init_wait_flags_with_call_stack(WF1,[prob_command_context(compute_apply_true,unknown)]),
4456		bsets_clp:apply_to(FunToBool,CoreT,pred_true,SpanInfo,WF1), % TO DO: also pass function type
4457		ground_wait_flags(WF1).
4458
4459		expects_waitflag('MAX_SAT').
4460		expects_spaninfo('MAX_SAT').
4461		:- public 'MAX_SAT'/5.
4462		% EXTERNAL_FUNCTION_MAX_SAT(T) == (POW(T)-->BOOL)*POW(T) --> POW(T);
4463		% MAX_SAT(Fun,Set) == Set;
4464		% example: MAX_SAT(f,0..3) = {0,3} & f = %x.(x:POW(INTEGER)|bool(x /\ 1..2={}))
4465
4466		'MAX_SAT'(FunToBool,Set,ValueRes,SpanInfo,WF) :-
4467		expand_custom_set_to_list_wf(Set,ESet,_,compute_apply_true,WF),
4468		debug_println(9,computing_unsat_core(ESet)),
4469		when(ground((FunToBool,ESet)), compute_maxsat_ground(ESet,FunToBool,ValueRes,SpanInfo,WF)).
4470
4471		compute_maxsat_ground(ESet,FunToBool,ValueRes,SpanInfo,WF) :-
4472		debug_println(9,computing_maxsat(ESet)), %nl,reset_walltime,
4473		get_wait_flag(1,'MAX_SAT',WF,LWF), % avoid computing straightaway in case pending co-routines fail; not really sure it is needed
4474		when(nonvar(LWF),compute_maxsat(ESet,FunToBool,[],ValueRes,SpanInfo,WF)).
4475		compute_maxsat([],_FunToBool,Core,Result,_SpanInfo,_WF) :- equal_object(Result,Core).
4476		compute_maxsat([H|T],FunToBool,Core,Result,SpanInfo,WF) :-
4477		debug_println(9,trying_to_add(H,core(Core))),
4478		%nl,nl,nl,print(maxsat(H,Core)),nl, print_walltime(user_output),nl,
4479		if(compute_apply_true(FunToBool,[H|Core],SpanInfo),
4480		compute_maxsat(T,FunToBool,[H|Core],Result,SpanInfo,WF),
4481		compute_maxsat(T,FunToBool, Core, Result,SpanInfo,WF) % contradiction also exists without H
4482		).
4483
4484		% can be used to maximize a bounded integer expression
4485		% more limited than optimizing_solver (only optimizing integers), but using inlined branch and bound enumeration
4486		% example usage: xx:1..10 & res=10*xx-xx*xx & MAXIMIZE_EXPR(res)
4487		:- use_module(clpfd_interface,[clpfd_domain/3, clpfd_inrange/3, clpfd_size/2, clpfd_eq/2]).
4488		expects_waitflag('MAXIMIZE_EXPR').
4489		expects_spaninfo('MAXIMIZE_EXPR').
4490		:- public 'MAXIMIZE_EXPR'/4.
4491		'MAXIMIZE_EXPR'(int(X),PredRes,Span,WF) :-
4492		%get_wait_flag1('MAXIMIZE_EXPR',WF,LWF),
4493		get_wait_flag(2,'MAXIMIZE_EXPR',WF,LWF),
4494		PredRes=pred_true,
4495		maximize_expr_wf(LWF,X,Span,WF).
4496		:- block maximize_expr_wf(-,?,?,?).
4497		maximize_expr_wf(_LWF,X,Span,WF) :-
4498		clpfd_size(X,Size), Size \= sup,
4499		clpfd_domain(X,Min,Max),
4500		Mid is round((Min + Max)/2),
4501		!,
4502		maximize_expr_6(Min,Mid,Max,X,Span,WF).
4503		maximize_expr_wf(_,_,Span,_) :-
4504		add_error(external_functions,'MAXIMIZE_EXPR/MINIMIZE_EXPR called on unbounded expression',Span),
4505		fail.
4506		maximize_expr_6(M,M,M,X,Span,WF) :- !, X=M,
4507		add_message(external_functions,'Checking optimisation target for MAXIMIZE_EXPR/MINIMIZE_EXPR: ',X,Span),
4508		ground_wait_flags(WF). % NOTE: without fully grounding WF: we do not know if a solution has really been found !
4509		maximize_expr_6(Min,Mid,Max,X,Span,WF) :- % tools_printing:print_term_summary(maximize_expr_6(Min,Mid,Max,X)),nl,
4510		%add_message(external_functions,'Optimisation target for MAXIMIZE_EXPR/MINIMIZE_EXPR: ',Min:Max,Span),
4511		if( (clpfd_inrange(X,Mid,Max),
4512		NMid is round((Mid+Max)/2),
4513		maximize_expr_6(Mid,NMid,Max,X,Span,WF)),
4514		true, % we found a solution in the upper half
4515		(Mid>Min, M1 is Mid-1,
4516		clpfd_inrange(X,Min,M1),
4517		NMid is round((Min+M1)/2),
4518		maximize_expr_6(Min,NMid,M1,X,Span,WF)
4519		) ).
4520
4521		expects_waitflag('MINIMIZE_EXPR').
4522		expects_spaninfo('MINIMIZE_EXPR').
4523		:- public 'MINIMIZE_EXPR'/4.
4524		'MINIMIZE_EXPR'(int(X),PredRes,Span,WF) :-
4525		clpfd_eq(-X,MaxVar),
4526		'MAXIMIZE_EXPR'(int(MaxVar),PredRes,Span,WF).
4527
4528
4529		:- use_module(kernel_tools,[bexpr_variables/2]).
4530		% maximize is actually quite similar to CHOOSE; but it will choose maximum and use special algorithm for closures
4531		expects_waitflag('MAXIMIZE').
4532		expects_spaninfo('MAXIMIZE').
4533		:- public 'MAXIMIZE'/4.
4534		:- block 'MAXIMIZE'(-,?,?,?).
4535		'MAXIMIZE'([],_,Span,WF) :- !,
4536		add_wd_error_span('MAXIMIZE applied to empty set: ',[],Span,WF).
4537		'MAXIMIZE'(avl_set(A),H,_,_) :- !, avl_max(A,Max),kernel_objects:equal_object(H,Max).
4538		'MAXIMIZE'(closure(P,T,Body),FunValue,SpanInfo,WF) :- !,
4539		bexpr_variables(Body,ClosureWaitVars),
4540		debug_println(19,wait_maximize(P,ClosureWaitVars)),
4541		when(ground(ClosureWaitVars),maximize_closure(P,T,Body,FunValue,SpanInfo,WF)).
4542		'MAXIMIZE'([H|T],C,Span,WF) :- !,
4543		when(ground([H|T]),
4544		(convert_to_avl([H|T],AVL) -> 'MAXIMIZE'(AVL,C,Span,WF)
4545		; add_wd_error_span('Cannot determine maximum element for MAXIMIZE: ',[H|T],Span,WF),
4546		kernel_objects:equal_object_wf(C,H,WF))
4547		).
4548		'MAXIMIZE'(_,_,SpanInfo,_WF) :-
4549		add_error(external_functions,'MAXIMIZE requires set of values',SpanInfo),
4550		fail.
4551
4552		% move to optimizing solver
4553		% difference here is that entire constraint is re-set up every time; allowing Kodkod to be used
4554		maximize_closure(Parameters,ParameterTypes,ClosureBody,FunValue,_SpanInfo,WF) :-
4555		debug_println(maximizing(Parameters)),
4556		length(Parameters,Len), length(ParValues,Len),
4557	?	test_closure(Parameters,ParameterTypes,ClosureBody,ParValues),
4558		debug_println(19,found_initial_solution(ParValues)),
4559		!,
4560		maximize_closure2(Parameters,ParameterTypes,ClosureBody,ParValues,FunValue,WF).
4561		maximize_closure(_Parameters,_ParameterTypes,_ClosureBody,_FunValue,SpanInfo,_WF) :-
4562		add_error(external_functions,'MAXIMIZE: could not find solution for set comprehension',SpanInfo),
4563		fail.
4564
4565		maximize_closure2(Parameters,ParameterTypes,ClosureBody,PrevSol,FunValue,WF) :-
4566		Parameters=[PMax|_], ParameterTypes=[T1|_],
4567		PrevSol = [ PrevVal | _],
4568		debug_println(19,trying_to_improve_upon(PrevVal,PMax)),
4569		better_sol_pred(PMax,T1,PrevVal,Better),
4570		%translate:print_bexpr(Better),nl,
4571		bsyntaxtree:conjunct_predicates([Better,ClosureBody],NewBody),
4572		length(Parameters,Len), length(NewParValues,Len),
4573	?	test_closure(Parameters,ParameterTypes,NewBody,NewParValues),
4574		debug_println(19,found_better_solution(NewParValues)),
4575		!,
4576		maximize_closure2(Parameters,ParameterTypes,ClosureBody,NewParValues,FunValue,WF).
4577		maximize_closure2(_Parameters,_ParameterTypes,_ClosureBody,PrevSol,FunValue,WF) :-
4578		debug_println(19,cannot_improve),
4579		tools:convert_list_into_pairs(PrevSol,ParTuple),
4580		kernel_objects:equal_object_wf(ParTuple,FunValue,WF).
4581
4582		:- use_module(probsrc(solver_interface),[apply_kodkod_or_other_optimisations/4]).
4583		test_closure(Parameters,ParameterTypes,Body,ParValues) :-
4584		apply_kodkod_or_other_optimisations(Parameters,ParameterTypes,Body,Body2),
4585	?	custom_explicit_sets:b_test_closure(Parameters,ParameterTypes,Body2,ParValues,positive,no_wf_available). % positive instead of all_solutions
4586
4587		% generate predicate for better solution; % TO DO: support MINIMIZE by inverting args
4588		% TO DO: support more types: couples, booleans, ...
4589		better_sol_pred(PMax,integer,PrevVal,Better) :- !,
4590		Better = b(less(b(value(PrevVal),integer,[]),b(identifier(PMax),integer,[])),pred,[]).
4591		better_sol_pred(PMax,set(T1),PrevVal,Better) :- !,
4592		% WARNING: for sets we will only find one maximum, not all due to the cuts in maximize_closure(2) above
4593		Better = b(subset_strict(b(value(PrevVal),set(T1),[]),b(identifier(PMax),set(T1),[])),pred,[]).
4594		better_sol_pred(PMax,Type,_Val,_) :-
4595		add_error(external_functions,'MAXIMIZE requires first argument of set comprehension to be integer or set; cannot optimize: ',PMax:Type),fail.
4596
4597		% ----------------------------------
4598
4599		% EXTERNAL_FUNCTION_READ_XML == STRING --> seq(XML_ELement_Type);
4600		% with XML_ELement_Type == struct( recId: NATURAL1, pId:NATURAL, element:STRING, attributes: STRING +-> STRING, meta: STRING +-> STRING );
4601
4602		% XML_ELement_Type from LibraryXML.def:
4603		xml_element_type(record([ field(recId,integer), field(pId, integer), field(element,string),
4604		field(attributes, set(couple(string,string))),
4605		field(meta, set(couple(string,string))) ]) ).
4606
4607		performs_io('READ_XML').
4608		expects_spaninfo('READ_XML').
4609		:- public 'READ_XML'/3.
4610		:- block 'READ_XML'(-,?,?).
4611		'READ_XML'(string(File),Res,Span) :-
4612		read_xml(File,auto,Res,Span).
4613
4614		%expects_spaninfo('READ_XML'). both versions expect span info
4615		external_fun_type('READ_XML',[],[string,string,seq(XT)]) :- xml_element_type(XT).
4616		:- public 'READ_XML'/4.
4617		:- block 'READ_XML'(-,?,?,?),'READ_XML'(?,-,?,?).
4618		'READ_XML'(string(File),string(Encoding),Res,Span) :-
4619		read_xml(File,Encoding,Res,Span).
4620
4621
4622		:- use_module(tools, [read_string_from_file/3, detect_xml_encoding/3]).
4623		:- use_module(extrasrc(xml2b), [convert_xml_to_b/4]).
4624		:- use_module(preferences, [is_of_type/2]).
4625		:- block read_xml(-,?,?,?), read_xml(?,-,?,?).
4626		read_xml(File,EncodingPref,Res,Span) :-
4627		b_absolute_file_name(File,AFile,Span),
4628		(EncodingPref = 'auto',
4629		detect_xml_encoding(AFile,_Version,HeaderEncoding)
4630	?	-> (is_of_type(HeaderEncoding,text_encoding)
4631		-> Encoding=HeaderEncoding
4632		; add_warning(read_xml,'Illegal encoding in XML header (must be "UTF-8", "UTF-16", "ISO-8859-1",...): ',HeaderEncoding),
4633		Encoding=auto
4634		)
4635	?	; is_of_type(EncodingPref,text_encoding) -> Encoding = EncodingPref
4636		; add_error(read_xml,'Illegal encoding preference (must be "auto", "UTF-8", "UTF-16", "ISO-8859-1",...): ',EncodingPref),
4637		Encoding=auto
4638		),
4639		statistics(walltime,_),
4640		safe_call(read_string_from_file(AFile,Encoding,Codes),Span),
4641		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to read in ~w~n',[W1,AFile]),
4642		convert_xml_to_b(Codes,BDataSequence,File,Span),
4643		statistics(walltime,[_,W2]),
4644		formatsilent('% Walltime ~w ms to parse and convert XML in ~w~n',[W2,AFile]),
4645		kernel_objects:equal_object_optimized(Res,BDataSequence).
4646
4647
4648		external_fun_type('READ_XML_FROM_STRING',[],[string,seq(XT)]) :- xml_element_type(XT).
4649		expects_spaninfo('READ_XML_FROM_STRING').
4650		:- public 'READ_XML_FROM_STRING'/3.
4651		:- block 'READ_XML_FROM_STRING'(-,?,?).
4652		'READ_XML_FROM_STRING'(string(Contents),Res,Span) :-
4653		atom_codes(Contents,Codes),
4654		statistics(walltime,[W1,_]),
4655		convert_xml_to_b(Codes,BDataSequence,'string',Span),
4656		statistics(walltime,[W2,_]), W is W2-W1,
4657		formatsilent('% Walltime ~w ms to parse and convert XML~n',[W]),
4658		kernel_objects:equal_object_optimized(Res,BDataSequence).
4659
4660		:- use_module(extrasrc(json_parser),[json_parse_file/3,json_parse/3]).
4661		:- use_module(extrasrc(json_freetype),[json_parser_to_json_freetype/2]).
4662		performs_io('READ_JSON').
4663		external_fun_type('READ_JSON',[],[string,freetype('JsonValue')]).
4664		expects_spaninfo('READ_JSON').
4665		:- public 'READ_JSON'/3.
4666		:- block 'READ_JSON'(-,?,?).
4667		'READ_JSON'(string(File),Res,Span) :-
4668		read_json(File,Res,Span).
4669		:- block read_json(-,?,?).
4670		read_json(File,Res,Span) :-
4671		b_absolute_file_name(File,AFile,Span),
4672		statistics(walltime,_),
4673		safe_call(json_parse_file(AFile,Json,[]),Span),
4674		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to read and parse ~w~n',[W1,AFile]),
4675		json_parser_to_json_freetype(Json,JsonFreetype),
4676		statistics(walltime,[_,W2]),
4677		formatsilent('% Walltime ~w ms to convert JSON from ~w~n',[W2,AFile]),
4678		kernel_objects:equal_object_optimized(Res,JsonFreetype).
4679
4680		:- use_module(extrasrc(xml2b), [convert_json_to_b/3]).
4681		% reads in JSON file producing the same format as READ_XML
4682		performs_io('READ_JSON_AS_XML').
4683		external_fun_type('READ_JSON_AS_XML',[],[string,seq(XT)]) :- xml_element_type(XT).
4684		expects_spaninfo('READ_JSON_AS_XML').
4685		:- public 'READ_JSON_AS_XML'/3.
4686		:- block 'READ_JSON_AS_XML'(-,?,?).
4687		'READ_JSON_AS_XML'(string(File),Res,Span) :-
4688		read_json_as_xml(File,Res,Span).
4689		:- block read_json_as_xml(-,?,?).
4690		read_json_as_xml(File,Res,Span) :-
4691		statistics(walltime,_),
4692		b_absolute_file_name(File,AFile,Span),
4693		safe_call(json_parse_file(AFile,JSONList,[position_infos(true)]),Span),
4694		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to read and parse ~w~n',[W1,AFile]),
4695		convert_json_to_b(JSONList,BDataSequence,Span),
4696		statistics(walltime,[_,W2]),
4697		formatsilent('% Walltime ~w ms to convert JSON from ~w~n',[W2,AFile]),
4698		kernel_objects:equal_object_optimized(Res,BDataSequence).
4699
4700		external_fun_type('READ_JSON_FROM_STRING',[],[string,freetype('JsonValue')]).
4701		expects_spaninfo('READ_JSON_FROM_STRING').
4702		:- public 'READ_JSON_FROM_STRING'/3.
4703		:- block 'READ_JSON_FROM_STRING'(-,?,?).
4704		'READ_JSON_FROM_STRING'(string(Contents),Res,Span) :-
4705		read_json_from_string(Contents,Res,Span).
4706		:- block read_json_from_string(-,?,?).
4707		read_json_from_string(Contents,Res,Span) :-
4708		statistics(walltime,_),
4709		atom_codes(Contents,Codes),
4710		safe_call(json_parse(Codes,Json,[]),Span),
4711		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to parse string~n',[W1]),
4712		json_parser_to_json_freetype(Json,JsonFreetype),
4713		statistics(walltime,[_,W2]),
4714		formatsilent('% Walltime ~w ms to convert JSON~n',[W2]),
4715		kernel_objects:equal_object_optimized(Res,JsonFreetype).
4716
4717		external_fun_type('READ_JSON_FROM_STRING_AS_XML',[],[string,seq(XT)]) :- xml_element_type(XT).
4718		expects_spaninfo('READ_JSON_FROM_STRING_AS_XML').
4719		:- public 'READ_JSON_FROM_STRING_AS_XML'/3.
4720		:- block 'READ_JSON_FROM_STRING_AS_XML'(-,?,?).
4721		'READ_JSON_FROM_STRING_AS_XML'(string(Contents),Res,Span) :-
4722		read_json_from_string_as_xml(Contents,Res,Span).
4723		:- block read_json_from_string_as_xml(-,?,?).
4724		read_json_from_string_as_xml(Contents,Res,Span) :-
4725		atom_codes(Contents,Codes),
4726		statistics(walltime,_),
4727		safe_call(json_parse(Codes,JSONList,[position_infos(true)]),Span),
4728		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to parse string~n',[W1]),
4729		convert_json_to_b(JSONList,BDataSequence,Span),
4730		statistics(walltime,[_,W2]),
4731		formatsilent('% Walltime ~w ms to convert JSON~n',[W2]),
4732		kernel_objects:equal_object_optimized(Res,BDataSequence).
4733
4734		expects_spaninfo('WRITE_XML').
4735		external_fun_type('WRITE_XML',[],[seq(XT),string]) :- xml_element_type(XT).
4736		:- public 'WRITE_XML'/4.
4737		:- block 'WRITE_XML'(-,?,?,?),'WRITE_XML'(?,-,?,?).
4738		'WRITE_XML'(Records,string(File),Res,Span) :- write_xml2(Records,File,Res,Span).
4739		:- block write_xml2(?,-,?,?).
4740		write_xml2(Records,File,Res,Span) :-
4741		b_absolute_file_name(File,AFile,Span),
4742		statistics(walltime,_),
4743		'WRITE_XML_TO_STRING'(Records,String,Span),
4744		String = string(S),
4745		when(nonvar(S),
4746		(statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to convert XML for ~w~n',[W1,AFile]),
4747		open(AFile,write,Stream,[encoding(utf8)]),
4748		write(Stream,S),nl(Stream),
4749		close(Stream),
4750		statistics(walltime,[_,W2]), formatsilent('% Walltime ~w ms to write XML to file ~w~n',[W2,AFile]),
4751		Res = pred_true
4752		)).
4753
4754
4755		%sequence of records of type:
4756		% rec(attributes:{("version"|->"03.04")},
4757		% element:"Data",
4758		% meta:{("xmlLineNumber"|->"2")},
4759		% pId:0,
4760		% recId:1),
4761		:- use_module(probsrc(xml_prob),[xml_parse/4, xml_pp/1]).
4762		expects_spaninfo('WRITE_XML_TO_STRING').
4763		:- public 'WRITE_XML_TO_STRING'/3.
4764		:- block 'WRITE_XML_TO_STRING'(-,?,?).
4765		'WRITE_XML_TO_STRING'(Records,Res,Span) :-
4766		custom_explicit_sets:expand_custom_set_to_list(Records,ESet,Done,'WRITE_XML_TO_STRING'),
4767		ground_value_check(ESet,Gr),
4768		when((nonvar(Done),nonvar(Gr)),
4769		( % print(expanded(ESet)),nl,
4770		gen_prolog_xml_term(ESet,Prolog,Span),
4771		%print(prolog(Prolog)),nl,
4772		xml_parse(Codes,Prolog,[],Span),
4773		(debug:debug_mode(on) -> xml_pp(Prolog) ; true),
4774		atom_codes(S,Codes),
4775		Res = string(S))).
4776
4777		:- use_module(extrasrc(json_parser),[json_write/3,json_write_file/3]).
4778		:- use_module(extrasrc(json_freetype),[json_freetype_to_json_parser/2]).
4779		expects_spaninfo('WRITE_JSON').
4780		external_fun_type('WRITE_JSON',[],[freetype('JsonValue'),string]).
4781		:- public 'WRITE_JSON'/4.
4782		:- block 'WRITE_JSON'(-,?,?,?),'WRITE_JSON'(?,-,?,?).
4783		'WRITE_JSON'(JsonFreetype,string(File),Res,Span) :-
4784		ground_value_check(JsonFreetype,GrJ),
4785		write_json(GrJ,JsonFreetype,File,Res,Span).
4786		:- block write_json(-,?,?,?,?),write_json(?,?,-,?,?).
4787		write_json(_,JsonFreetype,File,Res,Span) :-
4788		statistics(walltime,_),
4789		json_freetype_to_json_parser(JsonFreetype,Json),
4790		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to convert JSON to parser representation for ~w~n',[W1,AFile]),
4791		b_absolute_file_name(File,AFile,Span),
4792		safe_call(json_write_file(AFile,Json,[pretty(true)]),Span),
4793		statistics(walltime,[_,W2]), formatsilent('% Walltime ~w ms to write JSON for ~w~n',[W2,AFile]),
4794		Res = pred_true.
4795
4796		expects_spaninfo('WRITE_JSON_TO_STRING').
4797		external_fun_type('WRITE_JSON_TO_STRING',[],[freetype('JsonValue'),string]).
4798		:- public 'WRITE_JSON_TO_STRING'/3.
4799		'WRITE_JSON_TO_STRING'(JsonFreetype,Res,Span) :-
4800		ground_value_check(JsonFreetype,GrJ),
4801		write_json_to_string(GrJ,JsonFreetype,Res,Span).
4802		:- block write_json_to_string(-,?,?,?).
4803		write_json_to_string(_,JsonFreetype,Res,Span) :-
4804		statistics(walltime,_),
4805		json_freetype_to_json_parser(JsonFreetype,Json),
4806		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to convert JSON to parser representation~n',[W1]),
4807		safe_call(json_write(Json,Codes,[pretty(true)]),Span),
4808		atom_codes(S,Codes),
4809		statistics(walltime,[_,W2]), formatsilent('% Walltime ~w ms to write JSON to string~n',[W2]),
4810		Res = string(S).
4811
4812		gen_prolog_xml_term(List,xml( [version="1.0", encoding="ASCII"], ContentList),Span) :-
4813		InitialLineNr = 2, % first line is xml-header !?
4814		gen_prolog_xml_dcg(InitialLineNr,_,0,[],ContentList,Span,List,[]).
4815
4816		gen_prolog_xml_dcg(LastLineNr,FinalLineNr,CurLevel, Parents, ResContentList,Span) -->
4817		[(int(Index),rec(Fields))],
4818		{ %print(treat(Index,Fields)),nl,
4819		get_parentId(Fields,CurLevel,Span)}, % The element should be added to the current content list
4820		!,
4821		{get_element(Fields,Element,Span),
4822		get_attributes(Fields,Attributes,Span),
4823		get_line(Fields,LineNr,Span),
4824		gen_element(LastLineNr,LineNr,Element, Attributes, InnerContentList, ResContentList, TailContentList)
4825		},
4826		gen_prolog_xml_dcg(LineNr,LineNr2,Index,[CurLevel|Parents],InnerContentList,Span),
4827		gen_prolog_xml_dcg(LineNr2,FinalLineNr,CurLevel, Parents, TailContentList,Span).
4828		gen_prolog_xml_dcg(L,L,_,_,[],_Span) --> [].
4829
4830		gen_element(LastLineNr,NewLineNr,'CText',['='(text,Codes)],[], [PCDATA|Tail],Tail) :-
4831		insert_newlines(LastLineNr,NewLineNr,Codes,NLCodes),
4832		!,
4833		PCDATA=pcdata(NLCodes).
4834		gen_element(LastLineNr,NewLineNr,Element, Attributes, InnerContentList, [pcdata(NL),XELEMENT|Tail],Tail) :-
4835		LastLineNr < NewLineNr,
4836		insert_newlines(LastLineNr,NewLineNr,[],NL),
4837		!,
4838		XELEMENT = element( Element, Attributes, InnerContentList).
4839		gen_element(_,_,Element, Attributes, InnerContentList, [XELEMENT|Tail],Tail) :-
4840		XELEMENT = element( Element, Attributes, InnerContentList).
4841
4842		insert_newlines(LastLineNr,NewLineNr,C,R) :- NewLineNr =< LastLineNr,!,R=C.
4843		% TO DO: maybe we have to use 13 on Windows ??
4844		insert_newlines(LastLineNr,NewLineNr,C,[10|Res]) :- L1 is LastLineNr+1, insert_newlines(L1,NewLineNr,C,Res).
4845
4846		get_parentId(Fields,Nr,Span) :-
4847	?	(member(field(pId,int(ParentID)),Fields) -> Nr=ParentID
4848		; add_error('WRITE_XML_TO_STRING','The record has no pId field: ',Fields,Span),
4849		Nr = 0).
4850		get_element(Fields,Atom,Span) :-
4851	?	(member(field(element,string(Atom)),Fields) -> true
4852		; add_error('WRITE_XML_TO_STRING','The record has no element field: ',Fields,Span),
4853		Atom = '??').
4854
4855		get_attributes(Fields,Attrs,Span) :-
4856	?	(member(field(attributes,Set),Fields)
4857		-> custom_explicit_sets:expand_custom_set_to_list(Set,ESet,_Done,'get_attributes'),
4858		(maplist(get_xml_attr,ESet,Attrs) -> true
4859		; add_error('WRITE_XML_TO_STRING','Illegal attributes field: ',ESet,Span),
4860		Attrs = []
4861		)
4862		; add_error('WRITE_XML_TO_STRING','The record has no attributes field: ',Fields,Span),
4863		Attrs = []).
4864		get_line(Fields,LineNr,Span) :-
4865	?	(member(field(meta,Set),Fields)
4866		-> custom_explicit_sets:expand_custom_set_to_list(Set,ESet,_Done,'get_line'),
4867		(member((string(xmlLineNumber),string(LineNrS)),ESet)
4868		-> atom_codes(LineNrS,CC), number_codes(LineNr,CC)
4869		; add_error('WRITE_XML_TO_STRING','The meta field has no xmlLineNumber entry: ',ESet,Span),
4870		LineNr = -1
4871		)
4872		; add_error('WRITE_XML_TO_STRING','The record has no meta field: ',Fields,Span),
4873		LineNr = -1).
4874
4875		get_xml_attr((string(Attr),string(Val)),'='(Attr,ValCodes)) :- atom_codes(Val,ValCodes).
4876
4877
4878		% ----------------------------------
4879		% A flexible CVS Reader that always uses the same type
4880		% rec([field(attributes,BAttributes),field(lineNr,LineNr)])
4881
4882		% EXTERNAL_FUNCTION_READ_CSV_STRINGS == STRING --> seq(CSV_ELement_Type);
4883		% with CSV_ELement_Type == STRING +-> STRING ;
4884
4885		performs_io('READ_CSV_STRINGS').
4886		expects_spaninfo('READ_CSV_STRINGS').
4887		external_fun_type('READ_CSV_STRINGS',[],[string,seq(set(couple(string,string)))]).
4888		:- public 'READ_CSV_STRINGS'/3.
4889		:- block 'READ_CSV_STRINGS'(-,?,?).
4890		'READ_CSV_STRINGS'(string(File),Res,Span) :- read_csv_strings(File,Res,Span).
4891
4892		read_csv_strings(File,ResAVL,Span) :-
4893		b_absolute_file_name(File,AFile,Span),
4894		open_utf8_file_for_reading(AFile,Stream,Span),
4895		statistics(walltime,_),
4896		read_line(Stream,Line1),
4897		(Line1 = end_of_file -> ResAVL = []
4898		; split_csv_line([],HeadersCodes,Span,Line1,[]),
4899		maplist(process_header,HeadersCodes,Headers),
4900		formatsilent('CSV Line Headers = ~w for ~w~n',[Headers,AFile]),
4901		safe_call(read_csv_strings_lines(Stream,1,Span,Headers,Res),Span),
4902		statistics(walltime,[_,W1]), formatsilent('% Walltime ~w ms to read in ~w~n',[W1,AFile]),
4903		kernel_objects:equal_object_optimized(Res,ResAVL),
4904		statistics(walltime,[_,W2]), formatsilent('% Walltime ~w ms to normalise in ~w~n',[W2,AFile])
4905		),
4906		close(Stream). % TO DO: call_cleanup
4907
4908		process_header(HeaderC,HeaderAtom) :- safe_atom_codes(HeaderAtom,HeaderC).
4909
4910		read_csv_strings_lines(Stream,PrevLineNr,Span,Headers,Res) :-
4911		read_line(Stream,Line),
4912		(Line = end_of_file -> Res = []
4913		; LineNr is PrevLineNr+1,
4914		debug_format(9,'~nCSV line ~w: ~s~n',[LineNr,Line]),
4915		split_csv_line([],AtomsC,Span,Line,[]),
4916		Res = [(int(PrevLineNr),Attrs)|ResT],
4917		construct_attributes(AtomsC,Headers,Attrs,Span,LineNr,1),
4918		read_csv_strings_lines(Stream,LineNr,Span,Headers,ResT)
4919		).
4920
4921		construct_attributes([],_,[],_,_,_).
4922		construct_attributes([ [] | T],[ _|HT],Res,Span,LineNr,ColNr) :- !, % empty column
4923		C1 is ColNr+1,
4924		construct_attributes(T,HT,Res,Span,LineNr,C1).
4925		construct_attributes([ AtomC | T], [], Res,Span,LineNr,ColNr) :- !,
4926		safe_atom_codes(A,AtomC),
4927		length(AtomC,NrChars),
4928		ajoin(['Additional field with ',NrChars,' chars on line ',LineNr,' and column ',ColNr,': '],Msg),
4929		add_warning('READ_CSV_STRINGS',Msg,A,Span),
4930		Res=[(string('ExtraField'),string(A))|TR],
4931		C1 is ColNr+1,
4932		construct_attributes(T, [], TR,Span,LineNr,C1).
4933		construct_attributes([ AtomC | T], [ Header | HT],
4934		[ (string(Header),string(A)) | ResT],Span,LineNr,ColNr) :-
4935		safe_atom_codes(A,AtomC),
4936		%format('Col ~w: ~w~n',[ColNr,A]),flush_output,
4937		C1 is ColNr+1,
4938		construct_attributes(T,HT,ResT,Span,LineNr,C1).
4939
4940		% ----------------------------------
4941		% A CSV Reader that uses the B types to adapt how it reads in values
4942
4943		performs_io('READ_CSV').
4944		expects_spaninfo('READ_CSV').
4945		expects_type('READ_CSV').
4946
4947		:- public 'READ_CSV'/6.
4948		:- block 'READ_CSV'(-,?,?,?,?,?).
4949		'READ_CSV'(string(File),BoolSkipLine1,AllowExtraValues,Res,Type,Span) :-
4950		read_csv(File,BoolSkipLine1,AllowExtraValues,pred_false,Res,Type,Span).
4951
4952		external_fun_type('READ_CSV',[T],[string,T]).
4953		:- public 'READ_CSV'/4.
4954		:- block 'READ_CSV'(-,?,?,?).
4955		'READ_CSV'(string(File),Res,Type,Span) :-
4956		read_csv(File,pred_false,pred_false,pred_false,Res,Type,Span).
4957
4958		performs_io('READ_CSV_SEQUENCE').
4959		expects_spaninfo('READ_CSV_SEQUENCE').
4960		expects_type('READ_CSV_SEQUENCE').
4961		:- public 'READ_CSV_SEQUENCE'/6.
4962		:- block 'READ_CSV_SEQUENCE'(-,?,?,?,?,?).
4963		'READ_CSV_SEQUENCE'(string(File),BoolSkipLine1,AllowExtraValues,Res,Type,Span) :-
4964		read_csv(File,BoolSkipLine1,AllowExtraValues,pred_true,Res,Type,Span).
4965
4966		:- use_module(bsyntaxtree,[get_set_type/2]).
4967		:- block read_csv(-,?,?,?,?,?,?).
4968		read_csv(File,BoolSkipLine1,AllowExtraValues,CreateSequence,Res,InType,Span) :-
4969		(CreateSequence=pred_true
4970		-> (get_set_type(InType,couple(integer,T)) -> Type=set(T), SeqIndex=1
4971		; add_error('READ_CSV_SEQUENCE','Expecting sequence as return type:',InType),
4972		Type=InType, SeqIndex=none
4973		)
4974		; SeqIndex=none,Type=InType),
4975		get_column_types(Type,Types,Skel,Vars,Span),
4976		b_absolute_file_name(File,AFile,Span),
4977		open_utf8_file_for_reading(AFile,Stream,Span),
4978		(debug:debug_mode(off) -> true
4979		; formatsilent('~nReading CSV file ~w with Types = ~w and Skel = ~w for Vars = ~w~n~n',[AFile,Types,Skel,Vars])),
4980		(read_csv_lines(1,SeqIndex,BoolSkipLine1,AllowExtraValues,Stream,Types,Skel,Vars,Res,Span) -> true
4981		; add_error('READ_CSV','Reading CSV File failed: ',AFile)),
4982		close(Stream). % TO DO: call_cleanup
4983
4984		read_csv_lines(Nr,SeqIndex,BoolSkipLine1,AllowExtraValues,Stream,Types,Skel,Vars,Res,Span) :- %print(line(Nr,Types)),nl,
4985		read_line(Stream,Line),
4986		debug:debug_println(9,read_line(Nr,Line)),
4987		(Line = end_of_file -> Res = []
4988		; split_csv_line([],AtomsC,Span,Line,[]),
4989		%print(atoms(Nr,Atoms)),nl,
4990		%maplist(convert_atom_codes(Span),Types,Atoms,Tuple), % TO DO: check same length
4991		(Nr=1,BoolSkipLine1=pred_true
4992		-> maplist(codes_to_atom,AtomsC,Atoms), format('Skipping line 1: ~w~n',[Atoms]),
4993		Res=ResT
4994		; Line=[] -> format('Skipping empty line ~w~n',[Nr]), Res=ResT
4995		; l_convert_atom_codes(Types,AtomsC,Tuple,Span,Nr,AllowExtraValues),
4996		copy_term((Vars,Skel),(Tuple,BValue)),
4997		(number(SeqIndex) -> S1 is SeqIndex+1, Res = [(int(SeqIndex),BValue)|ResT]
4998		; S1 = SeqIndex, Res = [BValue|ResT]
4999		)
5000		),
5001		N1 is Nr+1,
5002		read_csv_lines(N1,S1,BoolSkipLine1,AllowExtraValues,Stream,Types,Skel,Vars,ResT,Span)).
5003
5004		codes_to_atom(C,A) :- atom_codes(A,C).
5005
5006		l_convert_atom_codes([],[],Vals,_Span,_LineNr,_) :- !, Vals=[].
5007		l_convert_atom_codes([Type|TT],[AtomC|TC],[Val|VT],Span,LineNr,AllowExtraValues) :- !,
5008		convert_atom_codes(Span,LineNr,Type,AtomC,Val),
5009		l_convert_atom_codes(TT,TC,VT,Span,LineNr,AllowExtraValues).
5010		l_convert_atom_codes([Type|TT],[],_,Span,LineNr,_) :- !,
5011		ajoin(['Missing value(s) on CSV line ',LineNr,' for types: '],Msg),
5012		add_error('READ_CSV',Msg,[Type|TT],Span),fail.
5013		l_convert_atom_codes([],[AtomC|AT],Vals,Span,LineNr,AllowExtraValues) :- !,
5014		(AllowExtraValues=pred_true -> true
5015		; safe_atom_codes(Atom,AtomC),
5016		ajoin(['Extra value(s) on CSV line ',LineNr,' : ',Atom,' Rest = '],Msg),
5017		add_error('READ_CSV',Msg,AT,Span)
5018		), Vals=[].
5019
5020		convert_atom_codes(Span,LineNr,T,AtomC,Val) :-
5021		(convert_atom2(T,AtomC,Val,Span,LineNr) -> true ;
5022		atom_codes(Atom,AtomC),
5023		ajoin(['Could not convert value to type ',T,' on CSV line ',LineNr,': '],Msg),
5024		add_error('READ_CSV',Msg,Atom,Span),
5025		Val = term('READ_CSV_ERROR')).
5026		:- use_module(tools,[safe_number_codes/2, safe_atom_codes/2]).
5027		convert_atom2(string,C,string(A),_,_) :- safe_atom_codes(A,C).
5028		convert_atom2(integer,C,int(Nr),_Span,LineNr) :-
5029		(C=[] -> (debug:debug_mode(off) -> true ; format('Translating empty string to -1 on line ~w~n',[LineNr])),
5030		% add_warning('READ_CSV','Translating empty string to -1 on line: ',LineNr,Span),
5031		Nr is -1
5032		; safe_number_codes(Nr,C)).
5033		convert_atom2(global(G),C,FD,Span,LineNr) :- safe_atom_codes(A,C),convert_to_enum(G,A,FD,Span,LineNr).
5034		convert_atom2(boolean,C,Bool,Span,LineNr) :- safe_atom_codes(A,C),
5035		(convert_to_bool(A,Bool) -> true
5036		; ajoin(['Could not convert value to BOOL on line ',LineNr,'; assuming FALSE: '],Msg),
5037		add_warning('READ_CSV',Msg,A,Span),
5038		Bool=pred_false).
5039		% TO DO: support set(_), seq(_)
5040
5041		convert_to_bool('0',pred_false).
5042		convert_to_bool('1',pred_true).
5043		convert_to_bool('FALSE',pred_false).
5044		convert_to_bool('TRUE',pred_true).
5045		convert_to_bool('false',pred_false).
5046		convert_to_bool('true',pred_true).
5047
5048		convert_to_enum(G,A,FD,Span,LineNr) :- string_to_enum2(A,FD,_,Span),
5049		(FD=fd(_,G) -> true ; add_error('READ_CSV','Enumerated element of incorrect type: ',A:expected(G):line(LineNr),Span)).
5050
5051		% split a CSV line into individual AtomCode lists
5052		split_csv_line([],T,Span) --> " ", !, split_csv_line([],T,Span).
5053	?	split_csv_line(Acc,[AtomC|T],Span) --> sep, !,
5054		{reverse(Acc,AtomC)}, split_csv_line([],T,Span).
5055		split_csv_line([],[String|T],Span) --> [34], !, % "
5056		scan_to_end_of_string([],String,Span),
5057		(sep -> split_csv_line([],T,Span)
5058		; [XX] -> {add_error('READ_CSV','String not followed by separator: ',String,Span)},
5059		split_csv_line([XX],T,Span)
5060		; {T=[]}).
5061		split_csv_line(Acc,Atoms,Span) --> [X], !, split_csv_line([X|Acc],Atoms,Span).
5062		split_csv_line(Acc,[AtomC],_Span) --> !, % end of line
5063		{reverse(Acc,AtomC)}.
5064
5065		sep --> " ",!, sep.
5066		sep --> ("," ; ";" ; " ,").
5067
5068		scan_to_end_of_string(Acc,AtomC,_) --> [34],!,{reverse(Acc,AtomC)}.
5069		scan_to_end_of_string(Acc,String,Span) --> [X],!, scan_to_end_of_string([X|Acc],String,Span).
5070		scan_to_end_of_string(Acc,String,Span) -->
5071		{reverse(Acc,RAcc),atom_codes(String,RAcc),add_error('READ_CSV','String not terminated: ',String,Span)}.
5072
5073		% get the list of column types along with Value skeleton with variables in the places where CSV values should be inserted
5074		get_column_types(set(X),Types,Skel,Vars,_) :- !,flatten_pairs(X,Types,[]), %print(types(Types)),nl,
5075		flatten_pairs_value_skeleton(X,Skel,Vars,[]). % print(skel(Skel,Vars)),nl.
5076		get_column_types(seq(X),Types,Skel,Vars,Span) :- !,
5077		get_column_types(set(couple(integer,X)),Types,Skel,Vars,Span).
5078		get_column_types(Type,_,_,_,Span) :- add_error('READ_CSV','Invalid return type (must be relation): ',Type,Span),fail.
5079
5080		% flatten couple pairs and generate skeleton term
5081		flatten_pairs(couple(A,B)) --> !,flatten_pairs(A), flatten_pairs(B).
5082		flatten_pairs(record(Fields)) --> !, flatten_fields(Fields).
5083		flatten_pairs(X) --> [X].
5084
5085		/* note: currently record fields have to be alphabetically in the same order as in CSV file: the fields are sorted by ProB's kernel ! : TO DO: try and recover the original order of the fields */
5086		flatten_fields([]) --> [].
5087		flatten_fields([field(_Name,Type)|T]) --> [Type], % no nesting allowed; this has to be a basic type for CSV reading to work
5088		flatten_fields(T).
5089
5090		% generate a value skeleton
5091		flatten_pairs_value_skeleton(couple(A,B),(CA,CB)) --> !,
5092		flatten_pairs_value_skeleton(A,CA), flatten_pairs_value_skeleton(B,CB).
5093		flatten_pairs_value_skeleton(record(Fields),rec(SF)) --> !, flatten_field_skel(Fields,SF).
5094		flatten_pairs_value_skeleton(_X,Var) --> [Var].
5095
5096		flatten_field_skel([],[]) --> [].
5097		flatten_field_skel([field(Name,_Type)|T],[field(Name,Var)|ST]) --> [Var],
5098		flatten_field_skel(T,ST).
5099
5100
5101		% ----------------------------------
5102		% Writing a matrix to a .pgm graphics file
5103		% The header of such a file looks like:
5104		% P5
5105		% 752 864 (width height)
5106		% 255 (maximal pixel value)
5107		% after that we have bytes of grayscale values
5108		% https://en.wikipedia.org/wiki/Netpbm#File_formats
5109
5110		% TODO: try and support colors (.ppm files)
5111		% improve performance; possibly avoiding to expand avl_sets
5112
5113		:- use_module(probsrc(tools_io),[read_byte_line/2, read_byte_word/2, put_bytes/2]).
5114
5115		:- public 'READ_PGM_IMAGE_FILE'/4.
5116		external_fun_type('READ_PGM_IMAGE_FILE',[],[string,seq(seq(integer))]).
5117		expects_waitflag('READ_PGM_IMAGE_FILE').
5118		expects_spaninfo('READ_PGM_IMAGE_FILE').
5119		:- block 'READ_PGM_IMAGE_FILE'(-,?,?,?).
5120		'READ_PGM_IMAGE_FILE'(string(FileName),Matrix,Span,WF) :-
5121		when(nonvar(FileName),
5122		(statistics(walltime,[_,_]),
5123		b_absolute_file_name(FileName,AFile,Span),
5124		open(AFile,read,Stream,[type(binary)]),
5125		call_cleanup(read_pgm_file(Stream,MatrixList,Span,WF), close(Stream)),
5126		statistics(walltime,[_,W2]),
5127		formatsilent('% Walltime ~w ms to read matrix from PGM file ~w~n',[W2,AFile]),
5128		kernel_objects:equal_object_optimized(Matrix,MatrixList)
5129		)).
5130
5131		read_pgm_file(Stream,Matrix,Span,_WF) :-
5132		read_byte_line(Stream,FileType),
5133		(FileType = "P5"
5134		-> read_byte_number(Stream,Width,Span),
5135		read_byte_number(Stream,Height,Span),
5136		read_byte_number(Stream,MaxPix,Span),
5137		formatsilent('% Detected PGM file width=~w, height=~w, max=~w~n',[Width,Height,MaxPix]),
5138		read_pgm_matrix(1,Height,Width,MaxPix,Stream,Matrix,Span)
5139		; atom_codes(FT,FileType),
5140		add_error('READ_PGM_IMAGE_FILE','Can only support P5 grayscale type:',FT,Span),fail
5141		).
5142
5143		% read pgm bytes and covert to B sequence of sequence of numbers
5144		read_pgm_matrix(Nr,Height,_,_,Stream,Res,Span) :- Nr > Height, !,
5145		get_byte(Stream,Code),
5146		(Code = -1 -> true
5147		; add_warning('READ_PGM_IMAGE_FILE','Bytes ignored after reading rows=',Height,Span)),
5148		Res=[].
5149		read_pgm_matrix(RowNr,Height,Width,MaxPix,Stream,[(int(RowNr),Row1)|ResT],Span) :-
5150		read_pgm_row(1,Width,MaxPix,Stream,Row1,Span),
5151		N1 is RowNr+1,
5152		read_pgm_matrix(N1,Height,Width,MaxPix,Stream,ResT,Span).
5153
5154		read_pgm_row(Nr,Width,_,_Stream,Res,_Span) :- Nr>Width, !, Res=[].
5155		read_pgm_row(ColNr,Width,MaxPix,Stream,[(int(ColNr),int(Code))|ResT],Span) :-
5156		(get_byte(Stream,Code), Code >= 0
5157		-> (Code =< MaxPix -> true
5158		; add_warning('READ_PGM_IMAGE_FILE','Grayscale pixel value exceeds maximum: ',Code,Span)
5159		)
5160		; add_error('READ_PGM_IMAGE_FILE','Unexpected EOF at column:',ColNr),
5161		fail
5162		),
5163		N1 is ColNr+1,
5164		read_pgm_row(N1,Width,MaxPix,Stream,ResT,Span).
5165
5166
5167		% read a word (until ws or eof) and convert it to a number
5168		read_byte_number(Stream,Nr,Span) :- read_byte_word(Stream,Codes),
5169		(safe_number_codes(Nr,Codes) -> true
5170		; add_error('READ_PGM_IMAGE_FILE','Expected number:',Codes,Span)
5171		).
5172
5173		:- public 'WRITE_PGM_IMAGE_FILE'/5.
5174		external_fun_type('WRITE_PGM_IMAGE_FILE',[],[string,seq(seq(integer),boolean)]).
5175		expects_waitflag('WRITE_PGM_IMAGE_FILE').
5176		expects_spaninfo('WRITE_PGM_IMAGE_FILE').
5177		:- block 'WRITE_PGM_IMAGE_FILE'(-,?,?,?,?), 'WRITE_PGM_IMAGE_FILE'(?,-,?,?,?).
5178		'WRITE_PGM_IMAGE_FILE'(string(FileName),Matrix,Res,Span,WF) :-
5179		custom_explicit_sets:expand_custom_set_to_list(Matrix,ESet,Done,'WRITE_PGM_IMAGE_FILE'),
5180		ground_value_check(ESet,Gr),
5181		when((nonvar(FileName),nonvar(Done),nonvar(Gr)),
5182		(statistics(walltime,[_,_]),
5183		b_absolute_file_name(FileName,AFile,Span),
5184		open(AFile,write,Stream,[type(binary)]),
5185		call_cleanup(put_pgm_file(Stream,ESet,Width,Height,WF),
5186		close(Stream)),
5187		statistics(walltime,[_,W2]),
5188		formatsilent('% Walltime ~w ms to write matrix to PGM file (width=~w, height=~w) ~w~n',[W2,Width,Height,AFile]),
5189		Res = pred_true
5190		)).
5191
5192		put_pgm_file(Stream,ESet,Width,Height,WF) :-
5193		ESet = [(int(_),Row)|_],
5194		bsets_clp:size_of_sequence(Row,int(Width),WF),
5195		put_bytes(Stream,"P5\n"),
5196		number_codes(Width,WC), put_bytes(Stream,WC),
5197		put_bytes(Stream," "),
5198		bsets_clp:size_of_sequence(ESet,int(Height),WF),
5199		number_codes(Height,HC), put_bytes(Stream,HC),
5200		put_bytes(Stream,"\n"),
5201		put_bytes(Stream,"255\n"),
5202		sort(ESet,SESet),
5203		put_pgm_matrix(Stream,Width,SESet).
5204
5205		% put a pgm grayscale matrix as bytes into a stream
5206		put_pgm_matrix(_,_,[]).
5207		put_pgm_matrix(Stream,Width,[(int(_),RowVector)|T]) :-
5208		custom_explicit_sets:expand_custom_set_to_list(RowVector,ESet,_,'WRITE_PGM_IMAGE_FILE'),
5209		sort(ESet,SESet),
5210		put_pgm_row(Stream,Width,SESet),
5211		put_pgm_matrix(Stream,Width,T).
5212
5213		put_zeros(_,X) :- X<1, !.
5214		put_zeros(Stream,X) :- put_byte(Stream,0), X1 is X-1, put_zeros(Stream,X1).
5215
5216		put_pgm_row(Stream,W,[]) :-
5217		(W=0 -> true
5218		; add_error('WRITE_PGM_IMAGE_FILE','Illegal PGM width in row: ',W),
5219		put_zeros(Stream,W)
5220		).
5221		put_pgm_row(Stream,W,[(_,int(Pixel))|T]) :-
5222		W1 is W-1,
5223		( W<1 -> add_error('WRITE_PGM_IMAGE_FILE','Additional PGM pixel in row: ',Pixel)
5224		; Pixel >=0, Pixel =< 255
5225		-> put_byte(Stream,Pixel),
5226		put_pgm_row(Stream,W1,T)
5227		; add_error('WRITE_PGM_IMAGE_FILE','Illegal PGM pixel (must be 0..255): ',Pixel),
5228		put_byte(Stream,0),
5229		put_pgm_row(Stream,W1,T)
5230		).
5231
5232		% -----------------
5233
5234		:- use_module(extrasrc(mcts_game_play), [mcts_auto_play/4, mcts_auto_play_available/0]).
5235		external_subst_enabling_condition('MCTS_AUTO_PLAY',_,Truth) :- create_texpr(truth,pred,[],Truth).
5236		external_function_requires_state('MCTS_AUTO_PLAY').
5237		:- public 'MCTS_AUTO_PLAY'/3.
5238		:- block 'MCTS_AUTO_PLAY'(-,?,?).
5239		'MCTS_AUTO_PLAY'(_,_Env,OutEnvModifications) :- % TO DO: pass simulation runs and time_out as parameter
5240		mcts_auto_play_available,!,
5241		get_current_state_id(CurID),
5242		mcts_auto_play(CurID,_ActionAsTerm,_TransID,State2),
5243		state_space:get_variables_state_for_id(State2,OutEnvModifications).
5244		'MCTS_AUTO_PLAY'(_,_,[]).
5245
5246		% EXTERNAL_SUBSTITUTION_MCTS_AUTO_PLAY == BOOL; MCTS_AUTO_PLAY(x) == skip;
5247
5248		% -----------------
5249
5250		:- use_module(extension('zmq_rpc/zmq_rpc'),
5251		[zmq_rpc_init/2, stream_socket_rpc_init/2,
5252		zmq_rpc_destroy/1, zmq_rpc_send/4,
5253		stream_socket_rpc_accept_request/3, stream_socket_rpc_send_answer/3]).
5254
5255		% connect to a JSON-RPC ZMQ socket
5256		performs_io('ZMQ_RPC_INIT').
5257		external_fun_type('ZMQ_RPC_INIT',[],[string,integer]).
5258		:- public 'ZMQ_RPC_INIT'/2.
5259		:- block 'ZMQ_RPC_INIT'(-,?).
5260		'ZMQ_RPC_INIT'(string(Endpoint), Res) :-
5261		when(nonvar(Endpoint), zmq_rpc_init(Endpoint, Res)).
5262
5263		% connect to a JSON-RPC regular socket using ndjson single-line messages
5264		performs_io('SOCKET_RPC_INIT').
5265		external_fun_type('SOCKET_RPC_INIT',[],[integer,integer]).
5266		:- public 'SOCKET_RPC_INIT'/2.
5267		:- block 'SOCKET_RPC_INIT'(-,?).
5268		'SOCKET_RPC_INIT'(int(Port), Res) :-
5269		when(nonvar(Port), stream_socket_rpc_init(Port, Res)).
5270
5271		performs_io('ZMQ_RPC_DESTROY').
5272		external_fun_type('ZMQ_RPC_DESTROY',[],[integer]).
5273		:- public 'ZMQ_RPC_DESTROY'/3.
5274		:- block 'ZMQ_RPC_DESTROY'(-,?,?).
5275		'ZMQ_RPC_DESTROY'(int(Socket), _EnvIn, EnvOut) :-
5276		when(nonvar(Socket),zmq_rpc_destroy(Socket)),
5277		EnvOut = [].
5278
5279		performs_io('ZMQ_RPC_SEND').
5280		expects_waitflag('ZMQ_RPC_SEND').
5281		external_fun_type('ZMQ_RPC_SEND',[],[integer,string,set(couple(string,freetype('JsonValue'))),freetype('RpcResult')]).
5282		:- public 'ZMQ_RPC_SEND'/5.
5283		:- block 'ZMQ_RPC_SEND'(-,?,?,?,?), 'ZMQ_RPC_SEND'(?,-,?,?,?), 'ZMQ_RPC_SEND'(?,?,-,?,?).
5284		'ZMQ_RPC_SEND'(int(Socket), string(Name), Args, Res,WF) :-
5285		expand_custom_set_to_list_wf(Args, ExpArgs, _Done, 'ZMQ_RPC_SEND',WF),
5286		ground_value_check(ExpArgs,Ground),
5287		block_zmq_rpc_send(Socket, Name, Ground, ExpArgs, Res).
5288
5289		:- block block_zmq_rpc_send(-,?,?,?,?), block_zmq_rpc_send(?,-,?,?,?),
5290		block_zmq_rpc_send(?,?,-,?,?).
5291		block_zmq_rpc_send(Socket, Name, _, ExpArgs, Res) :-
5292		zmq_rpc_send(Socket, Name, ExpArgs, Res).
5293
5294		performs_io('SOCKET_RPC_ACCEPT').
5295		external_fun_type('SOCKET_RPC_ACCEPT',[],[integer,freetype('JsonValue')]).
5296		:- public 'SOCKET_RPC_ACCEPT'/2.
5297		:- block 'SOCKET_RPC_ACCEPT'(-,?).
5298		'SOCKET_RPC_ACCEPT'(int(Port), Request) :-
5299		when(nonvar(Port),
5300		(stream_socket_rpc_accept_request(Port,_Id,FreeVal), % the Id is stored in zmq_rpc
5301		kernel_objects:equal_object_optimized(Request,FreeVal))).
5302
5303
5304		performs_io('SOCKET_RPC_REPLY').
5305		external_fun_type('SOCKET_RPC_REPLY',[],[integer,freetype('JsonValue')]).
5306		:- public 'SOCKET_RPC_REPLY'/3.
5307		:- block 'SOCKET_RPC_REPLY'(-,?,?),'SOCKET_RPC_REPLY'(?,-,?).
5308		'SOCKET_RPC_REPLY'(int(Port), FreeVal,Res) :-
5309		ground_value_check(FreeVal,Gr),
5310		when((nonvar(Port),nonvar(Gr)),
5311		(stream_socket_rpc_send_answer(Port,_Id,FreeVal), Res=pred_true)).