mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-18 10:53:40 +00:00
This fix uses the approach discussed on m-dev 2020 nov 16/17 for fixing github issue #72, whose core problem is a need for information flow back to a the caller from a callee when the callee fills in the argument of a function symbol whose representation is a direct_arg tag. In most cases when the callee fills in the value of an argument, the caller can see it because the argument is in a word on the heap, but when the function symbol uses a direct_arg tag, that is not the case. compiler/direct_arg_in_out.m: A new module that implements the transformation proposed on m-dev. It creates a fresh clone variable every time an argument of a direct_arg tag function symbol is (or may be) updated. This can happen several times if a type has more than one function symbol with a direct_arg tag. Since the affected variable can be bound to only one function symbol at the start, its argument can be filled in only once, but the compiler cannot know in advance what function symbol the variable contains, and therefore which of the possibly several fill-in sites (which fill in the arguments of different function symbols) executed in sequence will actually update the variable. The transformation ensures that once a variable is cloned, it is never referred to again. It also ensures that in a branched control structure (if-then-else, disjunction or switch), all branches will use the *same* variable to represent the latest version of each cloned variable at the end, so that following code has a consistent view regardless of through which branch execution has reached it. There are three situations that the transformation cannot and does not handle. 1. Situations in which the mode of an argument is either an inst variable, or an abstract inst. In either case, the pass cannot know whether it should apply its transformation to the argument. 2. Situations where a procedure that has such an argument is exported to C code as a function. In that case, the C signature of the function we would generate would be different from what the user would normally expect. We could modify the documentation of the export pragma, but I don't think there much point due to lack of demand. (The problem cannot arise when targeting any language other than C, because we use direct_arg tags only with the low level data representation, which we only use for C.) 3. Situations where a procedure that has such an argument is defined by foreign_proc. Again, dealing with the problem would require nontrivial changes to the documented interface between code in foreign_procs and the surrounding Mercury code, and I see no demand for code that could benefit from that. In these cases, this module generates error messages. compiler/transform_hlds.m: Include the new module in the transform_hlds package. Delete unnecessary module qualification on some existing inclusions. Put some existing inclusions into a more meaningful order. compiler/notes/compiler_design.html: Document the new pass. Fix some nearby prose. compiler/lambda.m: compiler/simplify_proc.m: Use a predicate exported by direct_arg_in_out.m to test, for each procedure, whether the procedure has any argument positions that are subject to the problem that direct_arg_in_out.m addresses. simplify_proc.m does this for all procedures it processes; lambda.m does this for all the procedures it creates from lambda expressions. Give a predicate in simplify_proc.m a better name. Sort a list of predicate names. compiler/hlds_module.m: Add a field to the module_info that simplify_proc.m and lambda.m can use to tell direct_arg_in_out.m what work (if any) it needs to do. compiler/mercury_compile_middle_passes.m: Invoke direct_arg_in_out.m if the new field in the HLDS indicates that it has some work to do. (In the vast majority of compiler invocations, it won't have any.) compiler/hlds_pred.m: The new code in direct_arg_in_out.m creates a clone of each procedure affected by the problem, before deleting the originals (to make sure that no references to the unfixed versions of now-fixed procedures remain.) Make it possible to create exact clones of both predicates and procedures by adding two pairs of predicates, {pred,proc}_prepare_to_clone and {pred,proc}_create. Add the direct_arg_in_out transformation as a possible source of transformed predicates. library/private_builtin.m: Add a new builtin operation, partial_inst_copy, that the new module generates calls to. configure.ac: Require the installed compiler to recognize partial_inst_copy as a no_type_info builtin. compiler/builtin_ops.m: Recognize the new builtin. (This was committed before the rest; the diff to private_builtin.m can be done only once the change to builtin_ops.m is part of the installed compiler.) compiler/options.m: Add a way to test whether the builtin_ops.m in the installed compiler recognizes the new builtin. compiler/dead_proc_elim.m: Do not delete the new primitive before direct_arg_in_out.m has had a chance to generate calls to it. Add an XXX. compiler/error_util.m: Recognize the new module as a source of error messages. compiler/pred_table.m: Add a pair of utility predicates to be used when looking up builtin predicates, for which the compiler writer knows that there should be exactly one match. These are used in direct_arg_in_out.m. compiler/simplify_goal_call.m: Replace some existing code with calls to the new predicates in pred_table.m. compiler/hlds_goal.m: Add modes to rename_vars_in_goal_expr that express the fact that when an atomic goal_expr has some variables renamed inside it, it does not suddenly become some *other* kind of goal_expr. New code in direct_arg_in_out.m relies on this. compiler/hlds_out_goal.m: When the HLDS we are dumping out is malformed because it contains calls to predicates that have been deleted, the compiler used to abort at such calls. (I ran into this while debugging direct_arg_in_out.m.) Fix this. When such calls are encountered, we now print out as much information we can about the call, and prefix the call with an unmistakable prefix to draw attention to the problem. compiler/inst_util.m: Fix a bug that prevented direct_arg_in_out.m from even being invoked on some test code for it. The bug was in code that we use to unify a headvar's initial inst with its final inst. When the initial inst was a non-ground bound_inst such as the ones used in tests/hard_coded/gh72.m, and the final inst was simply "ground", this code quite properly returned a bound_inst (which, unlike ground, can show the exact set of function symbols that the headvar could be bound to). The problem was that it reused the original bound_inst's test results, including the one that said the final inst is NOT ground, which of course is wrong for any inst unified with ground. Fix two instances of this bug. compiler/modes.m: Make some of the code I had to traverse to find the bug in inst_util.m easier to read and understand. Replace some uses of booleans with bespoke enum types. Change the argument lists of some predicates to put related arguments next to each other. Give some variables more descriptive names. compiler/layout_out.m: Conform to the change in hlds_pred.m. compiler/var_locn.m: Fix a code generation bug. When filling-in the value of the argument of a function symbol represented by a direct_arg tag, the code we generated for it worked only if the direct_arg tag used 0 as its ptag value. In the test cases we initially used for github issue 72, that was the case, but the new tests/hard_coded/gh72.m has direct_tag args that use other ptag values as well. Document the reason why the updated code works. compiler/term_constr_initial.m: Add the new primitive predicate added to private_builtin.m, partial_inst_copy, to a table of builtins that do not take type_infos, even though their signatures contain type variables. Fix a bunch of old bugs: most other such primitives were not listed either. mdbcomp/program_representation.m: Add partial_inst_copy to the master list of builtins that do not take type_infos even though their signatures contain type variables. (Done by an earlier commit.) Document the fact that any updates here require updates to term_constr_initial.m. library/multi_map.m: We have long had multi_map.add and multi_map.set as synonyms, but we only had multi_map.reverse_set. Add multi_map.reverse_add as a synonym for it. Define the "set" versions in terms of the "add" versions, instead of vice versa. NEWS: Document the new predicates in multi_map.m. tests/hard_coded/gh72a.m: Fix typo. tests/hard_coded/gh72.{m,exp}: A new, much more comprehensive test case than gh72a.m. This one tries to tickle github issue 72 in as many forms of code as I can think of. tests/invalid/gh72_errors.{m,err_exp}: A test case for testing the generation of error messages for two out of the three kinds of situations that direct_arg_in_out.m cannot handle. (Proposals for how to test the third category welcome.) tests/hard_coded/Mmakefile: tests/invalid/Mmakefile: Enable the two new test cases, as well as two old ones, gh72[ab].m, that previously we didn't pass. tests/invalid/Mercury.option: Do not compile gh72_error.m with --errorcheck-only, since its errors are reported by a pass that --errorcheck-only does not invoke.
1026 lines
44 KiB
Mathematica
1026 lines
44 KiB
Mathematica
%-----------------------------------------------------------------------------%
|
|
% vim: ft=mercury ts=4 sw=4 et
|
|
%-----------------------------------------------------------------------------%
|
|
% Copyright (C) 2014 The Mercury team.
|
|
% This file may only be copied under the terms of the GNU General
|
|
% Public License - see the file COPYING in the Mercury distribution.
|
|
%-----------------------------------------------------------------------------%
|
|
%
|
|
% File: simplify_proc.m.
|
|
%
|
|
% This module handles top level invocations of simplification.
|
|
%
|
|
% Most such invocations simplify the body of a procedure, or the bodies
|
|
% of all the procedures in a predicate. However, in some cases some other
|
|
% compiler passes (such as deforestation or partial evaluation) want to
|
|
% simplify a goal that is not the body of a procedure.
|
|
%
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- module check_hlds.simplify.simplify_proc.
|
|
:- interface.
|
|
|
|
:- import_module check_hlds.simplify.simplify_tasks.
|
|
:- import_module hlds.
|
|
:- import_module hlds.hlds_goal.
|
|
:- import_module hlds.hlds_module.
|
|
:- import_module hlds.hlds_pred.
|
|
:- import_module hlds.instmap.
|
|
:- import_module parse_tree.
|
|
:- import_module parse_tree.error_util.
|
|
:- import_module parse_tree.prog_data.
|
|
|
|
:- import_module list.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% Simplify all the given procedures of the given predicate.
|
|
% Add any resulting messages to the error spec accumulator.
|
|
%
|
|
% Used by mercury_compiler_front_end.m when doing compilation pass-by-pass.
|
|
%
|
|
:- pred simplify_pred_procs(simplify_tasks::in, pred_id::in,
|
|
list(proc_id)::in, module_info::in, module_info::out,
|
|
pred_info::in, pred_info::out,
|
|
error_spec_accumulator::in, error_spec_accumulator::out) is det.
|
|
|
|
% Simplify the given procedure. Throw away any resulting error messages.
|
|
%
|
|
% Used by compiler passes after the front end that need (or maybe just
|
|
% want) to eliminate unnecessary parts of the procedure.
|
|
%
|
|
:- pred simplify_proc(simplify_tasks::in, pred_id::in, proc_id::in,
|
|
module_info::in, module_info::out, proc_info::in, proc_info::out) is det.
|
|
|
|
% simplify_goal_update_vars_in_proc(SimplifyTasks, !ModuleInfo,
|
|
% PredId, ProcId, !ProcInfo, InstMap0, !Goal, CostDelta):
|
|
%
|
|
% Perform the specified simplification tasks on !Goal, which should be
|
|
% part of the procedure identified by PredId and ProcId. InstMap0
|
|
% should be the instmap immediately before !.Goal.
|
|
%
|
|
% We may update !ModuleInfo during the course of updating instmaps
|
|
% to reflect any changes made to the code. If the modifications to !Goal
|
|
% add any new variables, add these to !ProcInfo.
|
|
%
|
|
% !.Goal does NOT need to be the entire body of the procedure it appears
|
|
% in; it can be just a part of it. This is why we return the updated goal
|
|
% in !:Goal, not in !:ProcInfo.
|
|
%
|
|
% Used by partial evaluation.
|
|
%
|
|
:- pred simplify_goal_update_vars_in_proc(simplify_tasks::in,
|
|
module_info::in, module_info::out, pred_id::in, proc_id::in,
|
|
proc_info::in, proc_info::out, instmap::in, hlds_goal::in, hlds_goal::out,
|
|
int::out) is det.
|
|
|
|
% simplify_may_introduce_calls(ModuleName, PredName, Arity):
|
|
%
|
|
% Succeed if the simplify package may introduce calls to a predicate
|
|
% or function with the given name. ModuleName should be a standard library
|
|
% module.
|
|
%
|
|
:- pred simplify_may_introduce_calls(string::in, string::in, arity::in)
|
|
is semidet.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module check_hlds.det_analysis.
|
|
:- import_module check_hlds.det_util.
|
|
:- import_module check_hlds.mode_util.
|
|
:- import_module check_hlds.simplify.common.
|
|
:- import_module check_hlds.simplify.format_call.
|
|
:- import_module check_hlds.simplify.simplify_goal.
|
|
:- import_module check_hlds.simplify.simplify_info.
|
|
:- import_module hlds.code_model.
|
|
:- import_module hlds.passes_aux.
|
|
:- import_module hlds.quantification.
|
|
:- import_module hlds.status.
|
|
:- import_module hlds.vartypes.
|
|
:- import_module libs.
|
|
:- import_module libs.globals.
|
|
:- import_module libs.optimization_options.
|
|
:- import_module libs.options.
|
|
:- import_module mdbcomp.
|
|
:- import_module mdbcomp.sym_name.
|
|
:- import_module parse_tree.prog_data_foreign.
|
|
:- import_module transform_hlds.
|
|
:- import_module transform_hlds.direct_arg_in_out.
|
|
|
|
:- import_module bool.
|
|
:- import_module int.
|
|
:- import_module map.
|
|
:- import_module maybe.
|
|
:- import_module require.
|
|
:- import_module set.
|
|
:- import_module string.
|
|
:- import_module varset.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
simplify_pred_procs(_, _, [], !ModuleInfo, !PredInfo, !Specs).
|
|
simplify_pred_procs(SimplifyTasks, PredId, [ProcId | ProcIds], !ModuleInfo,
|
|
!PredInfo, !Specs) :-
|
|
simplify_pred_proc(SimplifyTasks, PredId, ProcId, !ModuleInfo,
|
|
!PredInfo, !Specs),
|
|
simplify_pred_procs(SimplifyTasks, PredId, ProcIds, !ModuleInfo,
|
|
!PredInfo, !Specs).
|
|
|
|
:- pred simplify_pred_proc(simplify_tasks::in, pred_id::in, proc_id::in,
|
|
module_info::in, module_info::out, pred_info::in, pred_info::out,
|
|
error_spec_accumulator::in, error_spec_accumulator::out) is det.
|
|
|
|
simplify_pred_proc(SimplifyTasks, PredId, ProcId, !ModuleInfo,
|
|
!PredInfo, !Specs) :-
|
|
pred_info_get_proc_table(!.PredInfo, ProcTable0),
|
|
map.lookup(ProcTable0, ProcId, ProcInfo0),
|
|
simplify_proc_return_msgs(SimplifyTasks, PredId, ProcId,
|
|
!ModuleInfo, ProcInfo0, ProcInfo, ProcSpecs),
|
|
% This is ugly, but we want to avoid running the dependent parallel
|
|
% conjunction pass on predicates and even modules that do not contain
|
|
% parallel conjunctions (nearly all of them). Since simplification
|
|
% is always done, we use it to mark modules and procedures containing
|
|
% parallel conjunctions.
|
|
proc_info_get_has_parallel_conj(ProcInfo, HasParallelConj),
|
|
(
|
|
HasParallelConj = has_parallel_conj,
|
|
module_info_set_has_parallel_conj(!ModuleInfo)
|
|
;
|
|
HasParallelConj = has_no_parallel_conj
|
|
),
|
|
proc_info_get_has_user_event(ProcInfo, HasUserEvent),
|
|
(
|
|
HasUserEvent = has_user_event,
|
|
module_info_set_has_user_event(!ModuleInfo)
|
|
;
|
|
HasUserEvent = has_no_user_event
|
|
),
|
|
map.det_update(ProcId, ProcInfo, ProcTable0, ProcTable),
|
|
pred_info_set_proc_table(ProcTable, !PredInfo),
|
|
accumulate_error_specs_for_proc(ProcSpecs, !Specs).
|
|
|
|
simplify_proc(SimplifyTasks, PredId, ProcId, !ModuleInfo, !ProcInfo) :-
|
|
trace [io(!IO)] (
|
|
write_pred_progress_message("% Simplifying ", PredId, !.ModuleInfo,
|
|
!IO)
|
|
),
|
|
simplify_proc_return_msgs(SimplifyTasks, PredId, ProcId, !ModuleInfo,
|
|
!ProcInfo, _).
|
|
|
|
simplify_goal_update_vars_in_proc(SimplifyTasks, !ModuleInfo,
|
|
PredId, ProcId, !ProcInfo, InstMap0, !Goal, CostDelta) :-
|
|
simplify_info_init(!.ModuleInfo, PredId, ProcId, !.ProcInfo,
|
|
SimplifyTasks, SimplifyInfo0),
|
|
% The nested context we construct is probably a lie; we don't actually
|
|
% know whether we are inside a goal duplicated for a switch, or a lambda,
|
|
% or a model_non procedure. However, this should be ok. The nested context
|
|
% is used for deciding what warnings and errors to generate, and
|
|
% we are not interested in those.
|
|
InsideDuplForSwitch = no,
|
|
NumEnclosingBarriers = 0u,
|
|
ProcIsModelNon = no,
|
|
NestedContext0 = simplify_nested_context(InsideDuplForSwitch,
|
|
ProcIsModelNon, NumEnclosingBarriers),
|
|
simplify_top_level_goal(!Goal, NestedContext0, InstMap0,
|
|
SimplifyInfo0, SimplifyInfo),
|
|
|
|
simplify_info_get_module_info(SimplifyInfo, !:ModuleInfo),
|
|
|
|
simplify_info_get_varset(SimplifyInfo, VarSet),
|
|
simplify_info_get_var_types(SimplifyInfo, VarTypes),
|
|
simplify_info_get_rtti_varmaps(SimplifyInfo, RttiVarMaps),
|
|
proc_info_set_varset(VarSet, !ProcInfo),
|
|
proc_info_set_vartypes(VarTypes, !ProcInfo),
|
|
proc_info_set_rtti_varmaps(RttiVarMaps, !ProcInfo),
|
|
|
|
simplify_info_get_cost_delta(SimplifyInfo, CostDelta).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
% Simplify the given procedure. Return the resulting error messages.
|
|
%
|
|
:- pred simplify_proc_return_msgs(simplify_tasks::in, pred_id::in,
|
|
proc_id::in, module_info::in, module_info::out,
|
|
proc_info::in, proc_info::out, list(error_spec)::out) is det.
|
|
|
|
simplify_proc_return_msgs(SimplifyTasks0, PredId, ProcId, !ModuleInfo,
|
|
!ProcInfo, !:Specs) :-
|
|
simplify_proc_maybe_vary_parameters(!.ModuleInfo, PredId, !.ProcInfo,
|
|
SimplifyTasks0, SimplifyTasks),
|
|
module_info_pred_info(!.ModuleInfo, PredId, PredInfo0),
|
|
pred_info_get_markers(PredInfo0, Markers0),
|
|
( if check_marker(Markers0, marker_mode_check_clauses) then
|
|
simplify_proc_maybe_mark_modecheck_clauses(!ProcInfo)
|
|
else
|
|
true
|
|
),
|
|
|
|
% We must invoke analyze_and_optimize_format_calls before
|
|
% simplify_top_level_goal, for two reasons.
|
|
%
|
|
% First, excess assignment optimization may delete some of the
|
|
% unifications that build the format strings or values,
|
|
% which means that the goal it generates may not contain the
|
|
% information that analyze_and_optimize_format_calls needs to avoid
|
|
% spurious messages about unknown format strings or values.
|
|
%
|
|
% Second, analyze_and_optimize_format_calls generates nested
|
|
% conjunctions, which simplify_top_level_goal can eliminate.
|
|
%
|
|
% We therefore get determinism analysis to mark the procedure
|
|
% if its body contains any calls relevant to format_calls.m.
|
|
|
|
( if
|
|
check_marker(Markers0, marker_has_format_call),
|
|
SimplifyTasks ^ do_format_calls = yes
|
|
then
|
|
(
|
|
SimplifyTasks ^ do_warn_implicit_stream_calls = no,
|
|
ImplicitStreamWarnings = do_not_generate_implicit_stream_warnings
|
|
;
|
|
SimplifyTasks ^ do_warn_implicit_stream_calls = yes,
|
|
ImplicitStreamWarnings = generate_implicit_stream_warnings
|
|
),
|
|
simplify_proc_analyze_and_format_calls(!ModuleInfo,
|
|
ImplicitStreamWarnings, PredId, ProcId, FormatSpecs, !ProcInfo)
|
|
else
|
|
% Either there are no format calls to check, or we don't want to
|
|
% optimize them and would ignore the added messages anyway.
|
|
FormatSpecs = []
|
|
),
|
|
|
|
simplify_info_init(!.ModuleInfo, PredId, ProcId, !.ProcInfo,
|
|
SimplifyTasks, Info0),
|
|
|
|
InsideDuplForSwitch = no,
|
|
NumEnclosingBarriers = 0u,
|
|
CodeModel = proc_info_interface_code_model(!.ProcInfo),
|
|
(
|
|
( CodeModel = model_det
|
|
; CodeModel = model_semi
|
|
),
|
|
ProcIsModelNon = no
|
|
;
|
|
CodeModel = model_non,
|
|
ProcIsModelNon = yes(imp_whole_proc)
|
|
),
|
|
NestedContext0 = simplify_nested_context(InsideDuplForSwitch,
|
|
ProcIsModelNon, NumEnclosingBarriers),
|
|
proc_info_get_initial_instmap(!.ModuleInfo, !.ProcInfo, InstMap0),
|
|
|
|
proc_info_get_goal(!.ProcInfo, Goal0),
|
|
simplify_top_level_goal(Goal0, Goal, NestedContext0, InstMap0,
|
|
Info0, Info),
|
|
proc_info_set_goal(Goal, !ProcInfo),
|
|
|
|
simplify_info_get_varset(Info, VarSet0),
|
|
simplify_info_get_var_types(Info, VarTypes0),
|
|
simplify_info_get_rtti_varmaps(Info, RttiVarMaps),
|
|
simplify_info_get_elim_vars(Info, ElimVarsLists0),
|
|
% We sort the lists basically on the number of the first variable.
|
|
list.sort(ElimVarsLists0, ElimVarsLists),
|
|
list.condense(ElimVarsLists, ElimVars),
|
|
varset.delete_sorted_vars(ElimVars, VarSet0, VarSet1),
|
|
delete_sorted_var_types(ElimVars, VarTypes0, VarTypes),
|
|
simplify_info_get_module_info(Info, !:ModuleInfo),
|
|
% We only eliminate vars that cannot occur in RttiVarMaps.
|
|
( if simplify_do_after_front_end(Info) then
|
|
proc_info_get_var_name_remap(!.ProcInfo, VarNameRemap),
|
|
map.foldl(varset.name_var, VarNameRemap, VarSet1, VarSet),
|
|
proc_info_set_var_name_remap(map.init, !ProcInfo),
|
|
|
|
proc_info_get_headvars(!.ProcInfo, HeadVars),
|
|
proc_info_get_argmodes(!.ProcInfo, ArgModes),
|
|
find_and_record_any_direct_arg_in_out_posns(PredId, ProcId, VarTypes,
|
|
HeadVars, ArgModes, !ModuleInfo)
|
|
else
|
|
VarSet = VarSet0
|
|
),
|
|
proc_info_set_varset(VarSet, !ProcInfo),
|
|
proc_info_set_vartypes(VarTypes, !ProcInfo),
|
|
proc_info_set_rtti_varmaps(RttiVarMaps, !ProcInfo),
|
|
|
|
simplify_info_get_has_parallel_conj(Info, HasParallelConj),
|
|
proc_info_set_has_parallel_conj(HasParallelConj, !ProcInfo),
|
|
|
|
simplify_info_get_has_user_event(Info, HasUserEvent),
|
|
proc_info_set_has_user_event(HasUserEvent, !ProcInfo),
|
|
|
|
simplify_info_get_deleted_call_callees(Info, CurDeletedCallCallees),
|
|
proc_info_get_deleted_call_callees(!.ProcInfo, DeletedCallCallees0),
|
|
set.union(CurDeletedCallCallees, DeletedCallCallees0, DeletedCallCallees),
|
|
proc_info_set_deleted_call_callees(DeletedCallCallees, !ProcInfo),
|
|
|
|
simplify_info_get_error_specs(Info, !:Specs),
|
|
!:Specs = FormatSpecs ++ !.Specs,
|
|
simplify_proc_maybe_warn_about_duplicates(!.ModuleInfo, PredId,
|
|
!.ProcInfo, !Specs),
|
|
|
|
pred_info_get_status(PredInfo0, Status),
|
|
IsDefinedHere = pred_status_defined_in_this_module(Status),
|
|
(
|
|
IsDefinedHere = no,
|
|
% Don't generate any warnings or even errors if the predicate isn't
|
|
% defined here; any such messages will be generated when we compile
|
|
% the module the predicate comes from.
|
|
!:Specs = []
|
|
;
|
|
IsDefinedHere = yes
|
|
).
|
|
|
|
:- pred simplify_proc_maybe_vary_parameters(module_info::in, pred_id::in,
|
|
proc_info::in, simplify_tasks::in, simplify_tasks::out) is det.
|
|
|
|
simplify_proc_maybe_vary_parameters(ModuleInfo, PredId, ProcInfo,
|
|
!SimplifyTasks) :-
|
|
proc_info_get_vartypes(ProcInfo, VarTypes0),
|
|
vartypes_count(VarTypes0, NumVars),
|
|
( if NumVars > turn_off_common_struct_threshold then
|
|
!SimplifyTasks ^ do_common_struct := do_not_opt_common_structs
|
|
else
|
|
true
|
|
),
|
|
module_info_get_globals(ModuleInfo, Globals),
|
|
globals.lookup_string_option(Globals, common_struct_preds,
|
|
CommonStructPreds),
|
|
( if CommonStructPreds = "" then
|
|
true
|
|
else
|
|
CommonStructPredIdStrs = string.split_at_char(',', CommonStructPreds),
|
|
( if
|
|
list.map(string.to_int, CommonStructPredIdStrs,
|
|
CommonStructPredIdInts)
|
|
then
|
|
PredIdInt = pred_id_to_int(PredId),
|
|
( if list.member(PredIdInt, CommonStructPredIdInts) then
|
|
true
|
|
else
|
|
!SimplifyTasks ^ do_common_struct := do_not_opt_common_structs
|
|
)
|
|
else
|
|
true
|
|
)
|
|
).
|
|
|
|
% If we have too many variables, common_struct used to take so long that
|
|
% either the compiler runs out of memory, or the user runs out of patience.
|
|
% In such cases, the fact that we would generate better code if the
|
|
% compilation finished is therefore of limited interest.
|
|
%
|
|
% However, since this limit was first imposed, we have optimized
|
|
% the compiler's infrastructure for such things, e.g. by using much more
|
|
% compact representations for sets of variables, which permit much faster
|
|
% operations on them. These changes do not eliminate the danger described
|
|
% above completely, but they do raise the threshold at which they can
|
|
% appear.
|
|
%
|
|
% As of 2020 october 11, the code of convert_options_to_globals in
|
|
% handle_options.m has just shy of 9,000 variables at the time of the
|
|
% first simplify pass (HLDS dump stage 65). The compiler can handle that
|
|
% easily, so the setting below allows for some growth.
|
|
%
|
|
:- func turn_off_common_struct_threshold = int.
|
|
|
|
turn_off_common_struct_threshold = 12000.
|
|
|
|
:- pred simplify_proc_maybe_mark_modecheck_clauses(
|
|
proc_info::in, proc_info::out) is det.
|
|
|
|
simplify_proc_maybe_mark_modecheck_clauses(!ProcInfo) :-
|
|
proc_info_get_goal(!.ProcInfo, Goal0),
|
|
Goal0 = hlds_goal(GoalExpr0, GoalInfo0),
|
|
( if
|
|
( GoalExpr0 = disj(_)
|
|
; GoalExpr0 = switch(_, _, _)
|
|
)
|
|
then
|
|
goal_info_add_feature(feature_mode_check_clauses_goal,
|
|
GoalInfo0, GoalInfo),
|
|
Goal = hlds_goal(GoalExpr0, GoalInfo),
|
|
proc_info_set_goal(Goal, !ProcInfo)
|
|
else
|
|
true
|
|
).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- pred simplify_proc_analyze_and_format_calls(
|
|
module_info::in, module_info::out,
|
|
maybe_generate_implicit_stream_warnings::in, pred_id::in, proc_id::in,
|
|
list(error_spec)::out, proc_info::in, proc_info::out) is det.
|
|
|
|
simplify_proc_analyze_and_format_calls(!ModuleInfo, ImplicitStreamWarnings,
|
|
PredId, ProcId, FormatSpecs, !ProcInfo) :-
|
|
proc_info_get_goal(!.ProcInfo, Goal0),
|
|
proc_info_get_varset(!.ProcInfo, VarSet0),
|
|
proc_info_get_vartypes(!.ProcInfo, VarTypes0),
|
|
analyze_and_optimize_format_calls(!.ModuleInfo, ImplicitStreamWarnings,
|
|
Goal0, MaybeGoal, FormatSpecs, VarSet0, VarSet, VarTypes0, VarTypes),
|
|
(
|
|
MaybeGoal = yes(Goal),
|
|
proc_info_set_goal(Goal, !ProcInfo),
|
|
proc_info_set_varset(VarSet, !ProcInfo),
|
|
proc_info_set_vartypes(VarTypes, !ProcInfo),
|
|
|
|
% The goals we replace format calls with are created with the
|
|
% correct nonlocals, but analyze_and_optimize_format_calls can
|
|
% take code for building a list of string.poly_types out of one
|
|
% scope (e.g. the condition of an if-then-else) and replace it
|
|
% with code to build the string directly in another scope
|
|
% (such as the then part of that if-then-else, if that is where
|
|
% the format call is). This can leave variables missing from
|
|
% the nonlocal fields of the original scopes. And since
|
|
% instmap_deltas are restricted to the goal's nonlocals,
|
|
% they need to be recomputed as well.
|
|
requantify_proc_general(ordinary_nonlocals_maybe_lambda, !ProcInfo),
|
|
recompute_instmap_delta_proc(do_not_recompute_atomic_instmap_deltas,
|
|
!ProcInfo, !ModuleInfo),
|
|
|
|
% Put the new proc_info back into !ModuleInfo, since some of the
|
|
% following code could otherwise find obsolete information in there.
|
|
|
|
% Remove the has_format_call marker from the pred_info before
|
|
% putting it back, since any optimizable format calls will already
|
|
% have been optimized. Since currently there is no program
|
|
% transformation that inserts calls to these predicates,
|
|
% there is no point in invoking find_format_call again later.
|
|
|
|
module_info_get_preds(!.ModuleInfo, PredTable0),
|
|
map.lookup(PredTable0, PredId, PredInfo0),
|
|
pred_info_get_proc_table(PredInfo0, ProcTable0),
|
|
map.det_update(ProcId, !.ProcInfo, ProcTable0, ProcTable),
|
|
pred_info_set_proc_table(ProcTable, PredInfo0, PredInfo1),
|
|
|
|
pred_info_get_markers(PredInfo1, Markers1),
|
|
remove_marker(marker_has_format_call, Markers1, Markers),
|
|
pred_info_set_markers(Markers, PredInfo1, PredInfo),
|
|
|
|
map.det_update(PredId, PredInfo, PredTable0, PredTable),
|
|
module_info_set_preds(PredTable, !ModuleInfo)
|
|
;
|
|
MaybeGoal = no
|
|
% There should not be any updates to the varset and the vartypes,
|
|
% but even if there are, throw them away, since they apply to a version
|
|
% of the goal that we will not be using.
|
|
).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- pred simplify_proc_maybe_warn_about_duplicates(module_info::in, pred_id::in,
|
|
proc_info::in, list(error_spec)::in, list(error_spec)::out) is det.
|
|
|
|
simplify_proc_maybe_warn_about_duplicates(ModuleInfo, PredId, ProcInfo,
|
|
!Specs) :-
|
|
module_info_pred_info(ModuleInfo, PredId, PredInfo),
|
|
pred_info_get_markers(PredInfo, Markers),
|
|
|
|
% The alternate goal by definition cannot be a call_foreign_proc.
|
|
proc_info_get_goal(ProcInfo, Goal),
|
|
Goal = hlds_goal(GoalExpr, GoalInfo),
|
|
( if
|
|
GoalExpr = call_foreign_proc(Attributes, _, _, _, _, _, _),
|
|
MaybeMayDuplicate = get_may_duplicate(Attributes),
|
|
MaybeMayDuplicate = yes(MayDuplicate)
|
|
then
|
|
(
|
|
MayDuplicate = proc_may_duplicate,
|
|
( if check_marker(Markers, marker_user_marked_no_inline) then
|
|
Context = goal_info_get_context(GoalInfo),
|
|
Pieces = [words("Error: the"), quote("may_duplicate"),
|
|
words("attribute on the foreign_proc contradicts the"),
|
|
quote("no_inline"), words("pragma on the predicate.")],
|
|
Spec = simplest_spec($pred, severity_error,
|
|
phase_simplify(report_in_any_mode), Context, Pieces),
|
|
!:Specs = [Spec | !.Specs]
|
|
else
|
|
true
|
|
)
|
|
;
|
|
MayDuplicate = proc_may_not_duplicate,
|
|
( if check_marker(Markers, marker_user_marked_inline) then
|
|
Context = goal_info_get_context(GoalInfo),
|
|
Pieces = [words("Error: the"), quote("may_not_duplicate"),
|
|
words("attribute on the foreign_proc contradicts the"),
|
|
quote("inline"), words("pragma on the predicate.")],
|
|
Spec = simplest_spec($pred, severity_error,
|
|
phase_simplify(report_in_any_mode), Context, Pieces),
|
|
!:Specs = [Spec | !.Specs]
|
|
else
|
|
true
|
|
)
|
|
)
|
|
else
|
|
true
|
|
).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- pred simplify_top_level_goal(hlds_goal::in, hlds_goal::out,
|
|
simplify_nested_context::in, instmap::in,
|
|
simplify_info::in, simplify_info::out) is det.
|
|
|
|
simplify_top_level_goal(!Goal, NestedContext0, InstMap0, !Info) :-
|
|
% Simplification is done in two passes, which is we have two calls to
|
|
% do_simplify_top_level_goal below. The first pass performs common
|
|
% structure and duplicate call elimination. The second pass performs
|
|
% excess assignment elimination, and cleans up the code after the
|
|
% first pass.
|
|
%
|
|
% Two passes are required because some parts of the first pass can
|
|
% obsolete existing nonlocals sets and instmap deltas, while some parts
|
|
% of the second pass may need this information to be up-to-date.
|
|
% Therefore we have to be prepared to recompute this information
|
|
% between the two passes.
|
|
some [!SimplifyTasks] (
|
|
simplify_info_get_simplify_tasks(!.Info, !:SimplifyTasks),
|
|
OriginalSimplifyTasks = !.SimplifyTasks,
|
|
( if
|
|
( simplify_do_common_struct(!.Info)
|
|
; simplify_do_opt_duplicate_calls(!.Info)
|
|
)
|
|
then
|
|
!SimplifyTasks ^ do_mark_code_model_changes := no,
|
|
!SimplifyTasks ^ do_excess_assign := do_not_elim_excess_assigns,
|
|
simplify_info_set_simplify_tasks(!.SimplifyTasks, !Info),
|
|
|
|
do_simplify_top_level_goal(!Goal, NestedContext0, InstMap0,
|
|
GoalInfo0, !Info),
|
|
maybe_recompute_fields_after_top_level_goal(GoalInfo0, InstMap0,
|
|
!Goal, !Info),
|
|
|
|
!:SimplifyTasks = OriginalSimplifyTasks,
|
|
|
|
% Disable the generation of error, warning and info messages
|
|
% for the second pass.
|
|
% - We can do this because any warnings we want to generate
|
|
% will have been generated by the first pass.
|
|
% - And we *must* do this, because the excess assign transformation
|
|
% in pass 2 may replace a variable (say X) with a different
|
|
% variable (say Y). So if in pass 1, we generated e.g. a message
|
|
% involving X, then in pass 2 we would generate a version
|
|
% of that same message, but referring to Y instead of X,
|
|
% which is very likely to confuse the reader.
|
|
simplify_info_set_allow_messages(do_not_allow_messages, !Info),
|
|
|
|
% These tasks were done in pass 1. Repeating them in pass 2
|
|
% would serve no purpose, since we do nothing in pass 1
|
|
% that would generate new occurrences of the situations
|
|
% that these tasks seek to optimize.
|
|
!SimplifyTasks ^ do_common_struct := do_not_opt_common_structs,
|
|
!SimplifyTasks ^ do_opt_duplicate_calls := do_not_opt_dup_calls,
|
|
simplify_info_reinit(!.SimplifyTasks, !Info)
|
|
else
|
|
true
|
|
),
|
|
% On the second pass do excess assignment elimination and
|
|
% some cleaning up after the common structure pass.
|
|
do_simplify_top_level_goal(!Goal, NestedContext0, InstMap0,
|
|
GoalInfo1, !Info),
|
|
maybe_recompute_fields_after_top_level_goal(GoalInfo1, InstMap0,
|
|
!Goal, !Info),
|
|
|
|
simplify_info_get_found_contains_trace(!.Info, FoundContainsTrace),
|
|
(
|
|
FoundContainsTrace = no
|
|
;
|
|
FoundContainsTrace = yes,
|
|
set_goal_contains_trace_features_in_goal(!Goal, _)
|
|
)
|
|
% We do not have to put OriginalSimplifyTasks back into !:Info
|
|
% at the end, because neither of our two callers will look at
|
|
% the tasks field of the !:Info value we return. We could return
|
|
% just the fields they *do* look at, but there are many of them.
|
|
).
|
|
|
|
:- pred do_simplify_top_level_goal(hlds_goal::in, hlds_goal::out,
|
|
simplify_nested_context::in, instmap::in, hlds_goal_info::out,
|
|
simplify_info::in, simplify_info::out) is det.
|
|
|
|
do_simplify_top_level_goal(!Goal, NestedContext0, InstMap0, GoalInfo0, !Info) :-
|
|
!.Goal = hlds_goal(_, GoalInfo0),
|
|
simplify_goal(!Goal, NestedContext0, InstMap0,
|
|
common_info_init, _Common, !Info).
|
|
|
|
:- pred maybe_recompute_fields_after_top_level_goal(hlds_goal_info::in,
|
|
instmap::in, hlds_goal::in, hlds_goal::out,
|
|
simplify_info::in, simplify_info::out) is det.
|
|
|
|
maybe_recompute_fields_after_top_level_goal(GoalInfo0, InstMap0,
|
|
!Goal, !Info) :-
|
|
simplify_info_get_rerun_quant_instmap_delta(!.Info, RerunQuantDelta),
|
|
(
|
|
RerunQuantDelta = rerun_quant_instmap_deltas,
|
|
NonLocals = goal_info_get_nonlocals(GoalInfo0),
|
|
some [!VarSet, !VarTypes, !RttiVarMaps, !ModuleInfo] (
|
|
simplify_info_get_varset(!.Info, !:VarSet),
|
|
simplify_info_get_var_types(!.Info, !:VarTypes),
|
|
simplify_info_get_rtti_varmaps(!.Info, !:RttiVarMaps),
|
|
implicitly_quantify_goal_general(ordinary_nonlocals_maybe_lambda,
|
|
NonLocals, _, !Goal, !VarSet, !VarTypes, !RttiVarMaps),
|
|
|
|
simplify_info_set_varset(!.VarSet, !Info),
|
|
simplify_info_set_var_types(!.VarTypes, !Info),
|
|
simplify_info_set_rtti_varmaps(!.RttiVarMaps, !Info),
|
|
|
|
% Always recompute instmap_deltas for atomic goals - this is safer
|
|
% in the case where unused variables should no longer be included
|
|
% in the instmap_delta for a goal.
|
|
simplify_info_get_module_info(!.Info, !:ModuleInfo),
|
|
simplify_info_get_inst_varset(!.Info, InstVarSet),
|
|
recompute_instmap_delta(recompute_atomic_instmap_deltas, !Goal,
|
|
!.VarTypes, InstVarSet, InstMap0, !ModuleInfo),
|
|
simplify_info_set_module_info(!.ModuleInfo, !Info)
|
|
)
|
|
;
|
|
RerunQuantDelta = do_not_rerun_quant_instmap_deltas
|
|
),
|
|
|
|
simplify_info_get_rerun_det(!.Info, RerunDet),
|
|
(
|
|
RerunDet = rerun_det,
|
|
Detism = goal_info_get_determinism(GoalInfo0),
|
|
some [!VarSet, !VarTypes, !RttiVarMaps, !ModuleInfo, !ProcInfo]
|
|
(
|
|
det_get_soln_context(Detism, SolnContext),
|
|
|
|
% Det_infer_goal looks up the proc_info in the module_info
|
|
% for the vartypes, so we have to put them back in the module_info.
|
|
simplify_info_get_module_info(!.Info, !:ModuleInfo),
|
|
simplify_info_get_varset(!.Info, !:VarSet),
|
|
simplify_info_get_var_types(!.Info, !:VarTypes),
|
|
simplify_info_get_rtti_varmaps(!.Info, !:RttiVarMaps),
|
|
simplify_info_get_pred_proc_id(!.Info, PredProcId),
|
|
module_info_pred_proc_info(!.ModuleInfo, PredProcId,
|
|
PredInfo, !:ProcInfo),
|
|
proc_info_set_vartypes(!.VarTypes, !ProcInfo),
|
|
proc_info_set_varset(!.VarSet, !ProcInfo),
|
|
proc_info_set_rtti_varmaps(!.RttiVarMaps, !ProcInfo),
|
|
module_info_set_pred_proc_info(PredProcId,
|
|
PredInfo, !.ProcInfo, !ModuleInfo),
|
|
simplify_info_set_module_info(!.ModuleInfo, !Info),
|
|
|
|
det_info_init(!.ModuleInfo, PredProcId, !.VarSet, !.VarTypes,
|
|
pess_extra_vars_report, [], DetInfo0),
|
|
det_infer_goal(!Goal, InstMap0, SolnContext, [], no,
|
|
_, _, DetInfo0, DetInfo),
|
|
det_info_get_module_info(DetInfo, !:ModuleInfo),
|
|
det_info_get_vartypes(DetInfo, !:VarTypes),
|
|
simplify_info_set_module_info(!.ModuleInfo, !Info),
|
|
simplify_info_set_var_types(!.VarTypes, !Info)
|
|
)
|
|
;
|
|
RerunDet = do_not_rerun_det
|
|
).
|
|
% The call to simplify_info_reinit in our caller will reset !:Info
|
|
% to do_not_rerun_quant_instmap_deltas and do_not_rerun_det before
|
|
% the next pass, if there is a next pass.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
:- pred set_goal_contains_trace_features_in_goal(hlds_goal::in, hlds_goal::out,
|
|
contains_trace_goal::out) is det.
|
|
|
|
set_goal_contains_trace_features_in_goal(Goal0, Goal, ContainsTrace) :-
|
|
Goal0 = hlds_goal(GoalExpr0, GoalInfo0),
|
|
(
|
|
( GoalExpr0 = unify(_, _, _, _, _)
|
|
; GoalExpr0 = plain_call(_, _, _, _, _, _)
|
|
; GoalExpr0 = generic_call(_, _, _, _, _)
|
|
; GoalExpr0 = call_foreign_proc(_, _, _, _, _, _, _)
|
|
),
|
|
GoalExpr = GoalExpr0,
|
|
ContainsTrace = contains_no_trace_goal
|
|
;
|
|
GoalExpr0 = conj(ConjType, SubGoals0),
|
|
ContainsTrace0 = contains_no_trace_goal,
|
|
set_goal_contains_trace_features_in_goals(SubGoals0, SubGoals,
|
|
ContainsTrace0, ContainsTrace),
|
|
GoalExpr = conj(ConjType, SubGoals)
|
|
;
|
|
GoalExpr0 = disj(SubGoals0),
|
|
ContainsTrace0 = contains_no_trace_goal,
|
|
set_goal_contains_trace_features_in_goals(SubGoals0, SubGoals,
|
|
ContainsTrace0, ContainsTrace),
|
|
GoalExpr = disj(SubGoals)
|
|
;
|
|
GoalExpr0 = switch(SwitchVar, CanFail, Cases0),
|
|
ContainsTrace0 = contains_no_trace_goal,
|
|
set_goal_contains_trace_features_in_cases(Cases0, Cases,
|
|
ContainsTrace0, ContainsTrace),
|
|
GoalExpr = switch(SwitchVar, CanFail, Cases)
|
|
;
|
|
GoalExpr0 = if_then_else(Vars, Cond0, Then0, Else0),
|
|
set_goal_contains_trace_features_in_goal(Cond0, Cond,
|
|
CondContainsTrace),
|
|
set_goal_contains_trace_features_in_goal(Then0, Then,
|
|
ThenContainsTrace),
|
|
set_goal_contains_trace_features_in_goal(Else0, Else,
|
|
ElseContainsTrace),
|
|
GoalExpr = if_then_else(Vars, Cond, Then, Else),
|
|
ContainsTrace = worst_contains_trace(CondContainsTrace,
|
|
worst_contains_trace(ThenContainsTrace, ElseContainsTrace))
|
|
;
|
|
GoalExpr0 = negation(SubGoal0),
|
|
set_goal_contains_trace_features_in_goal(SubGoal0, SubGoal,
|
|
ContainsTrace),
|
|
GoalExpr = negation(SubGoal)
|
|
;
|
|
GoalExpr0 = scope(Reason, SubGoal0),
|
|
(
|
|
Reason = trace_goal(_, _, _, _, _),
|
|
SubGoal = SubGoal0,
|
|
ContainsTrace = contains_trace_goal
|
|
;
|
|
Reason = from_ground_term(_, FGT),
|
|
(
|
|
( FGT = from_ground_term_construct
|
|
; FGT = from_ground_term_deconstruct
|
|
),
|
|
SubGoal = SubGoal0,
|
|
ContainsTrace = contains_no_trace_goal
|
|
;
|
|
( FGT = from_ground_term_initial
|
|
; FGT = from_ground_term_other
|
|
),
|
|
set_goal_contains_trace_features_in_goal(SubGoal0, SubGoal,
|
|
ContainsTrace)
|
|
)
|
|
;
|
|
( Reason = disable_warnings(_, _)
|
|
; Reason = exist_quant(_)
|
|
; Reason = promise_solutions(_, _)
|
|
; Reason = promise_purity(_)
|
|
; Reason = require_detism(_)
|
|
; Reason = require_complete_switch(_)
|
|
; Reason = require_switch_arms_detism(_, _)
|
|
; Reason = commit(_)
|
|
; Reason = barrier(_)
|
|
; Reason = loop_control(_, _, _)
|
|
),
|
|
set_goal_contains_trace_features_in_goal(SubGoal0, SubGoal,
|
|
ContainsTrace)
|
|
),
|
|
GoalExpr = scope(Reason, SubGoal)
|
|
;
|
|
GoalExpr0 = shorthand(ShortHand0),
|
|
(
|
|
ShortHand0 = atomic_goal(GoalType, Outer, Inner, MaybeOutputVars,
|
|
MainGoal0, OrElseGoals0, OrElseInners),
|
|
set_goal_contains_trace_features_in_goal(MainGoal0, MainGoal,
|
|
MainContainsTrace),
|
|
OrElseContainsTrace0 = contains_no_trace_goal,
|
|
set_goal_contains_trace_features_in_goals(
|
|
OrElseGoals0, OrElseGoals,
|
|
OrElseContainsTrace0, OrElseContainsTrace),
|
|
ShortHand = atomic_goal(GoalType, Outer, Inner, MaybeOutputVars,
|
|
MainGoal, OrElseGoals, OrElseInners),
|
|
GoalExpr = shorthand(ShortHand),
|
|
ContainsTrace = worst_contains_trace(MainContainsTrace,
|
|
OrElseContainsTrace)
|
|
;
|
|
ShortHand0 = try_goal(MaybeIO, ResultVar, SubGoal0),
|
|
set_goal_contains_trace_features_in_goal(SubGoal0, SubGoal,
|
|
ContainsTrace),
|
|
ShortHand = try_goal(MaybeIO, ResultVar, SubGoal),
|
|
GoalExpr = shorthand(ShortHand)
|
|
;
|
|
ShortHand0 = bi_implication(_, _),
|
|
unexpected($pred, "bi_implication")
|
|
)
|
|
),
|
|
(
|
|
ContainsTrace = contains_trace_goal,
|
|
goal_info_add_feature(feature_contains_trace, GoalInfo0, GoalInfo)
|
|
;
|
|
ContainsTrace = contains_no_trace_goal,
|
|
goal_info_remove_feature(feature_contains_trace, GoalInfo0, GoalInfo)
|
|
),
|
|
Goal = hlds_goal(GoalExpr, GoalInfo).
|
|
|
|
:- pred set_goal_contains_trace_features_in_goals(
|
|
list(hlds_goal)::in, list(hlds_goal)::out,
|
|
contains_trace_goal::in, contains_trace_goal::out) is det.
|
|
|
|
set_goal_contains_trace_features_in_goals([], [], !ContainsTrace).
|
|
set_goal_contains_trace_features_in_goals([Goal0 | Goals0], [Goal | Goals],
|
|
!ContainsTrace) :-
|
|
set_goal_contains_trace_features_in_goal(Goal0, Goal, GoalContainsTrace),
|
|
!:ContainsTrace = worst_contains_trace(GoalContainsTrace, !.ContainsTrace),
|
|
set_goal_contains_trace_features_in_goals(Goals0, Goals, !ContainsTrace).
|
|
|
|
:- pred set_goal_contains_trace_features_in_cases(
|
|
list(case)::in, list(case)::out,
|
|
contains_trace_goal::in, contains_trace_goal::out) is det.
|
|
|
|
set_goal_contains_trace_features_in_cases([], [], !ContainsTrace).
|
|
set_goal_contains_trace_features_in_cases([Case0 | Cases0], [Case | Cases],
|
|
!ContainsTrace) :-
|
|
Case0 = case(MainConsId, OtherConsIds, Goal0),
|
|
set_goal_contains_trace_features_in_goal(Goal0, Goal, GoalContainsTrace),
|
|
Case = case(MainConsId, OtherConsIds, Goal),
|
|
!:ContainsTrace = worst_contains_trace(GoalContainsTrace, !.ContainsTrace),
|
|
set_goal_contains_trace_features_in_cases(Cases0, Cases, !ContainsTrace).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
simplify_may_introduce_calls(ModuleName, PredName, _Arity) :-
|
|
% For some reason, the compiler records the original arity of
|
|
% int.unchecked_quotient as 3, not 2. Don't check the arities
|
|
% until this is fixed.
|
|
(
|
|
ModuleName = "private_builtin",
|
|
( PredName = "builtin_compound_eq"
|
|
; PredName = "builtin_compound_lt"
|
|
; PredName = "builtin_int16_gt"
|
|
; PredName = "builtin_int16_lt"
|
|
; PredName = "builtin_int32_gt"
|
|
; PredName = "builtin_int32_lt"
|
|
; PredName = "builtin_int64_gt"
|
|
; PredName = "builtin_int64_lt"
|
|
; PredName = "builtin_int8_gt"
|
|
; PredName = "builtin_int8_lt"
|
|
; PredName = "builtin_int_gt"
|
|
; PredName = "builtin_int_lt"
|
|
; PredName = "builtin_uint16_gt"
|
|
; PredName = "builtin_uint16_lt"
|
|
; PredName = "builtin_uint32_gt"
|
|
; PredName = "builtin_uint32_lt"
|
|
; PredName = "builtin_uint64_gt"
|
|
; PredName = "builtin_uint64_lt"
|
|
; PredName = "builtin_uint8_gt"
|
|
; PredName = "builtin_uint8_lt"
|
|
; PredName = "builtin_uint_gt"
|
|
; PredName = "builtin_uint_lt"
|
|
; PredName = "state_var_copy"
|
|
)
|
|
;
|
|
( ModuleName = "int"
|
|
; ModuleName = "uint"
|
|
; ModuleName = "int8"
|
|
; ModuleName = "uint8"
|
|
; ModuleName = "int16"
|
|
; ModuleName = "uint16"
|
|
; ModuleName = "int32"
|
|
; ModuleName = "uint32"
|
|
; ModuleName = "int64"
|
|
; ModuleName = "uint64"
|
|
),
|
|
( PredName = "*"
|
|
; PredName = "unchecked_quotient"
|
|
; PredName = "unchecked_rem"
|
|
; PredName = "unchecked_left_shift"
|
|
; PredName = "unchecked_right_shift"
|
|
)
|
|
;
|
|
ModuleName = "io",
|
|
PredName = "write_string"
|
|
;
|
|
ModuleName = "string",
|
|
( PredName = "int_to_string"
|
|
; PredName = "char_to_string"
|
|
; PredName = "float_to_string"
|
|
; PredName = "++"
|
|
)
|
|
;
|
|
ModuleName = "string.format",
|
|
( PredName = "format_char_component_nowidth"
|
|
; PredName = "format_char_component_width"
|
|
; PredName = "format_string_component_nowidth_noprec"
|
|
; PredName = "format_string_component_nowidth_prec"
|
|
; PredName = "format_string_component_width_noprec"
|
|
; PredName = "format_string_component_width_prec"
|
|
; PredName = "format_signed_int_component_nowidth_noprec"
|
|
; PredName = "format_signed_int_component_nowidth_prec"
|
|
; PredName = "format_signed_int_component_width_noprec"
|
|
; PredName = "format_signed_int_component_width_prec"
|
|
; PredName = "format_unsigned_int_component_nowidth_noprec"
|
|
; PredName = "format_unsigned_int_component_nowidth_prec"
|
|
; PredName = "format_unsigned_int_component_width_noprec"
|
|
; PredName = "format_unsigned_int_component_width_prec"
|
|
; PredName = "format_signed_int64_component_nowidth_noprec"
|
|
; PredName = "format_signed_int64_component_nowidth_prec"
|
|
; PredName = "format_signed_int64_component_width_noprec"
|
|
; PredName = "format_signed_int64_component_width_prec"
|
|
; PredName = "format_unsigned_int64_component_nowidth_noprec"
|
|
; PredName = "format_unsigned_int64_component_nowidth_prec"
|
|
; PredName = "format_unsigned_int64_component_width_noprec"
|
|
; PredName = "format_unsigned_int64_component_width_prec"
|
|
; PredName = "format_uint_component_nowidth_noprec"
|
|
; PredName = "format_uint_component_nowidth_prec"
|
|
; PredName = "format_uint_component_width_noprec"
|
|
; PredName = "format_uint_component_width_prec"
|
|
; PredName = "format_uint64_component_nowidth_noprec"
|
|
; PredName = "format_uint64_component_nowidth_prec"
|
|
; PredName = "format_uint64_component_width_noprec"
|
|
; PredName = "format_uint64_component_width_prec"
|
|
; PredName = "format_float_component_nowidth_noprec"
|
|
; PredName = "format_float_component_nowidth_prec"
|
|
; PredName = "format_float_component_width_noprec"
|
|
; PredName = "format_float_component_width_prec"
|
|
; PredName = "format_cast_int8_to_int"
|
|
; PredName = "format_cast_int16_to_int"
|
|
; PredName = "format_cast_int32_to_int"
|
|
; PredName = "format_cast_uint8_to_uint"
|
|
; PredName = "format_cast_uint16_to_uint"
|
|
; PredName = "format_cast_uint32_to_uint"
|
|
)
|
|
;
|
|
ModuleName = "stream",
|
|
PredName = "put"
|
|
;
|
|
ModuleName = "table_builtin",
|
|
|
|
( PredName = "table_lookup_insert_start_int"
|
|
; PredName = "table_lookup_insert_int"
|
|
; PredName = "table_lookup_insert_float"
|
|
; PredName = "table_lookup_insert_char"
|
|
; PredName = "table_lookup_insert_string"
|
|
; PredName = "table_lookup_insert_enum"
|
|
; PredName = "table_lookup_insert_foreign_enum"
|
|
; PredName = "table_lookup_insert_gen"
|
|
; PredName = "table_lookup_insert_addr"
|
|
; PredName = "table_lookup_insert_poly"
|
|
; PredName = "table_lookup_insert_poly_addr"
|
|
; PredName = "table_lookup_insert_typeinfo"
|
|
; PredName = "table_lookup_insert_typeclassinfo"
|
|
|
|
; PredName = "table_lookup_save_int_answer"
|
|
; PredName = "table_lookup_save_char_answer"
|
|
; PredName = "table_lookup_save_string_answer"
|
|
; PredName = "table_lookup_save_float_answer"
|
|
; PredName = "table_lookup_save_io_state_answer"
|
|
; PredName = "table_lookup_save_any_answer"
|
|
|
|
; PredName = "table_lookup_restore_int_answer"
|
|
; PredName = "table_lookup_restore_char_answer"
|
|
; PredName = "table_lookup_restore_string_answer"
|
|
; PredName = "table_lookup_restore_float_answer"
|
|
; PredName = "table_lookup_restore_io_state_answer"
|
|
; PredName = "table_lookup_restore_any_answer"
|
|
|
|
; PredName = "table_loop_setup"
|
|
; PredName = "table_loop_setup_shortcut"
|
|
; PredName = "table_loop_mark_as_inactive"
|
|
; PredName = "table_loop_mark_as_inactive_and_fail"
|
|
; PredName = "table_loop_mark_as_active_and_fail"
|
|
|
|
; PredName = "table_memo_det_setup"
|
|
; PredName = "table_memo_det_setup_shortcut"
|
|
; PredName = "table_memo_semi_setup"
|
|
; PredName = "table_memo_semi_setup_shortcut"
|
|
; PredName = "table_memo_non_setup"
|
|
; PredName = "table_memo_mark_as_failed"
|
|
; PredName = "table_memo_mark_as_succeeded"
|
|
; PredName = "table_memo_mark_as_incomplete"
|
|
; PredName = "table_memo_mark_as_active_and_fail"
|
|
; PredName = "table_memo_mark_as_complete_and_fail"
|
|
; PredName = "table_memo_create_answer_block"
|
|
; PredName = "table_memo_get_answer_block"
|
|
; PredName = "table_memo_non_get_answer_table"
|
|
; PredName = "table_memo_non_answer_is_not_duplicate"
|
|
; PredName = "table_memo_non_answer_is_not_duplicate_shortcut"
|
|
; PredName = "table_memo_return_all_answers_nondet"
|
|
; PredName = "table_memo_return_all_answers_multi"
|
|
; PredName = "table_memo_non_return_all_shortcut"
|
|
|
|
; PredName = "table_io_in_range"
|
|
; PredName = "table_io_has_occurred"
|
|
; PredName = "table_io_copy_io_state"
|
|
; PredName = "table_io_left_bracket_unitized_goal"
|
|
; PredName = "table_io_right_bracket_unitized_goal"
|
|
|
|
; PredName = "table_mm_setup"
|
|
; PredName = "table_mm_suspend_consumer"
|
|
; PredName = "table_mm_completion"
|
|
; PredName = "table_mm_get_answer_table"
|
|
; PredName = "table_mm_answer_is_not_duplicate"
|
|
; PredName = "table_mm_answer_is_not_duplicate_shortcut"
|
|
; PredName = "table_mm_create_answer_block"
|
|
; PredName = "table_mm_fill_answer_block_shortcut"
|
|
; PredName = "table_mm_return_all_nondet"
|
|
; PredName = "table_mm_return_all_multi"
|
|
; PredName = "table_mm_return_all_shortcut"
|
|
|
|
; PredName = "table_mmos_save_inputs"
|
|
; PredName = "table_mmos_setup_consumer"
|
|
; PredName = "table_mmos_answer_is_not_duplicate"
|
|
; PredName = "table_mmos_answer_is_not_duplicate_shortcut"
|
|
; PredName = "table_mmos_consume_next_answer_nondet"
|
|
; PredName = "table_mmos_consume_next_answer_multi"
|
|
; PredName = "table_mmos_restore_answers"
|
|
; PredName = "table_mmos_pickup_inputs"
|
|
; PredName = "table_mmos_create_answer_block"
|
|
; PredName = "table_mmos_return_answer"
|
|
; PredName = "table_mmos_completion"
|
|
|
|
; PredName = "table_error"
|
|
)
|
|
).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
:- end_module check_hlds.simplify.simplify_proc.
|
|
%-----------------------------------------------------------------------------%
|