mirror of
https://github.com/Mercury-Language/mercury.git
synced 2025-12-18 15:26:31 +00:00
Estimated hours taken: 40
Implement nondet pragma C codes.
runtime/mercury_stacks.h:
Define a new macro, mkpragmaframe, for use in the implementation
of nondet pragma C codes. This new macro includes space for a
struct with a given sruct tag in the nondet stack frame being created.
compiler/{prog_data.m,hlds_goal.m}:
Revise the representation of pragma C codes, both as the item and
in the HLDS.
compiler/prog_io_pragma.m:
Parse nondet pragma C declarations.
Fix the indentation in some places.
compiler/llds.m:
Include an extra argument in mkframe instructions. This extra argument
gives the details of the C structure (if any) to be included in the
nondet stack frame to be created.
Generalize the LLDS representation of pragma C codes. Instead of a
fixed sequence of <assign from inputs, user c code, assign to outputs>,
let the sequence contain these elements, as well as arbitrary
compiler-generated C code, in any order and possibly with repetitions.
This flexibility is needed for nondet pragma C codes.
Add a field to pragma C codes to say whether they can call Mercury.
Some optimizations can do a better job if they know that a pragma C
code cannot call Mercury.
Add another field to pragma C codes to give the name of the label
they refer to (if any). This is needed to prevent labelopt from
incorrectly optimizing away the label definition.
Add a new alternative to the type pragma_c_decl, to describe the
declaration of the local variable that points to the save struct.
compiler/llds_out.m:
Output mkframe instructions that specify a struct as invoking the new
mkpragmaframe macro, and make sure that the struct is declared just
before the procedure that uses it.
Other minor changes to keep up with the changes to the representation
of pragma C code in the LLDS, and to make the output look a bit nicer.
compiler/pragma_c_gen.m:
Add code to generate code for nondet pragma C codes. Revise the utility
predicates and their data structures a bit to make this possible.
compiler/code_gen.m:
Add code for the necessary special handling of prologs and epilogs
of procedures defined by nondet pragma C codes. The prologs need
to be modified to include a programmer-defined C structure in the
nondet stack frame and to communicate the location of this structure
to the pragma C code, whereas the functionality of the epilog is
taken care of by the pragma C code itself.
compiler/make_hlds.m:
When creating a proc_info for a procedure defined by a pragma C code,
we used to insert unifications between the headvars and the vars of
the pragma C code into the body goal. We now perform substitutions
instead. This removes a factor that would complicate the generation
of code for nondet pragma C codes.
Pass a moduleinfo down the procedures that warn about singletons
(and other basic scope errors). When checking whether to warn about
an argument of a pragma C code not being mentioned in the C code
fragment, we need to know whether the argument is input or output,
since input variables should appear in some code fragments in a
nondet pragma C code and must not appear in others. The
mode_is_{in,out}put checks need the moduleinfo.
(We do not need to check for any variables being mentioned where
they shouldn't be. The C compiler will fail in the presence of any
errors of that type, and since those variables could be referred
to via macros whose definitions we do not see, we couldn't implement
a reliable test anyway.)
compiler/opt_util.m:
Recognize that some sorts of pragma_c codes cannot affect the data
structures that control backtracking. This allows peepholing to
do a better job on code sequences produced for nondet pragma C codes.
Recognize that the C code strings inside some pragma_c codes refer to
other labels in the procedure. This prevents labelopt from incorrectly
optimizing away these labels.
compiler/dupelim.m:
If a label is referred to from within a C code string, then do not
attempt to optimize it away.
compiler/det_analysis.m:
Remove a now incorrect part of an error message.
compiler/*.m:
Minor changes to conform to changes to the HLDS and LLDS data
structures.
853 lines
32 KiB
Mathematica
853 lines
32 KiB
Mathematica
%-----------------------------------------------------------------------------%
|
|
% Copyright (C) 1997-1998 The University of Melbourne.
|
|
% This file may only be copied under the terms of the GNU General
|
|
% Public License - see the file COPYING in the Mercury distribution.
|
|
%-----------------------------------------------------------------------------%
|
|
%
|
|
% File : purity.m
|
|
% Authors : pets (Peter Schachte)
|
|
% Purpose : handle `impure' and `promise_pure' declarations;
|
|
% finish off type checking.
|
|
%
|
|
% The main purpose of this module is check the consistency of the
|
|
% `impure' and `promise_pure' (etc.) declarations, and to thus report
|
|
% error messages if the program is not "purity-correct".
|
|
%
|
|
% This module also does two final parts of type analysis:
|
|
% - it resolves predicate overloading
|
|
% (perhaps it ought to also resolve function overloading,
|
|
% converting unifications that are function calls into
|
|
% HLDS call instructions, but currently that is still done
|
|
% in modecheck_unify.m)
|
|
% - it checks for unbound type variables and if there are any,
|
|
% it reports an error (or a warning, binding them to the type `void').
|
|
% These actions cannot be done until after type inference is complete,
|
|
% so they need to be a separate "post-typecheck pass"; they are done
|
|
% here in combination with the purity-analysis pass for efficiency reasons.
|
|
%
|
|
%
|
|
% The aim of Mercury's purity system is to allow one to declare certain parts
|
|
% of one's program to be impure, thereby forbidding the compiler from making
|
|
% certain optimizations to that part of the code. Since one can often
|
|
% implement a perfectly pure predicate or function in terms of impure
|
|
% predicates and functions, one is also allowed to promise to the compiler
|
|
% that a predicate *is* pure, despite calling impure predicates and
|
|
% functions.
|
|
%
|
|
% To keep purity/impurity consistent, it is required that every impure
|
|
% predicate/function be declared so. A predicate is impure if:
|
|
%
|
|
% 1. It's declared impure, or
|
|
% 2a. It's not promised pure, and
|
|
% 2b. It calls some impure predicates or functions.
|
|
%
|
|
% A predicate or function is declared impure by preceding the `pred' or
|
|
% `func' in its declaration with `impure'. It is promised to be pure with a
|
|
%
|
|
% :- pragma promise_pure(Name/Arity).
|
|
%
|
|
% directive.
|
|
%
|
|
% Calls to impure predicates may not be optimized away. Neither may they be
|
|
% reodered relative to any other goals in a given conjunction; ie, an impure
|
|
% goal cleaves a conjunction into the stuff before it and the stuff after it.
|
|
% Both of these groups may be reordered separately, but no goal from either
|
|
% group may move into the other. Similarly for disjunctions.
|
|
%
|
|
% Semipure goals are goals that are sensitive to the effects of impure goals.
|
|
% They may be reordered and optimized away just like pure goals, except that
|
|
% a semipure goal may behave differently after a call to an impure goal than
|
|
% before. This means that semipure (as well as impure) predicates must not
|
|
% be tabled. Further, duplicate semipure goals on different sides of an
|
|
% impure goal must not be optimized away. In the current implementation, we
|
|
% simply do not optimize away duplicate semipure (or impure) goals at all.
|
|
%
|
|
% A predicate either has no purity declaration and so is assumed pure, or is
|
|
% declared semipure or impure, or is promised to be pure despite calling
|
|
% semipure or impure predicates. This promise cannot be checked, so we must
|
|
% trust the programmer.
|
|
%
|
|
% XXX The current implementation doesn't handle impure functions. The main
|
|
% reason is that handling of nested functions is likely to get pretty
|
|
% confusing. Because impure functions can't be reordered, the execution
|
|
% order would have to be strictly innermost-first, left-to-right, and
|
|
% predicate arguments would always have to be evaluated before the
|
|
% predicate call. Implied modes are right out. All in all, they just
|
|
% won't be as natural as one might think at first.
|
|
|
|
|
|
:- module purity.
|
|
:- interface.
|
|
|
|
:- import_module hlds_module.
|
|
:- import_module io.
|
|
|
|
:- type purity ---> pure
|
|
; (semipure)
|
|
; (impure).
|
|
|
|
|
|
% Purity check a whole module.
|
|
:- pred puritycheck(module_info, module_info, io__state, io__state).
|
|
:- mode puritycheck(in, out, di, uo) is det.
|
|
|
|
% Sort of a "maximum" for impurity.
|
|
:- pred worst_purity(purity, purity, purity).
|
|
:- mode worst_purity(in, in, out) is det.
|
|
|
|
% Compare two purities.
|
|
:- pred less_pure(purity, purity).
|
|
:- mode less_pure(in, in) is semidet.
|
|
|
|
% Print out a purity name.
|
|
:- pred write_purity(purity, io__state, io__state).
|
|
:- mode write_purity(in, di, uo) is det.
|
|
|
|
% Get a purity name as a string.
|
|
:- pred purity_name(purity, string).
|
|
:- mode purity_name(in, out) is det.
|
|
|
|
% Update a goal info to reflect the specified purity
|
|
:- pred add_goal_info_purity_feature(hlds_goal_info, purity, hlds_goal_info).
|
|
:- mode add_goal_info_purity_feature(in, in, out) is det.
|
|
|
|
% Determine the purity of a goal from its hlds_goal_info.
|
|
:- pred infer_goal_info_purity(hlds_goal_info, purity).
|
|
:- mode infer_goal_info_purity(in, out) is det.
|
|
|
|
% Check if a hlds_goal_info is for a pure goal
|
|
:- pred goal_info_is_pure(hlds_goal_info).
|
|
:- mode goal_info_is_pure(in) is semidet.
|
|
|
|
% Check if a hlds_goal_info is for an impure goal. Fails if the goal is
|
|
% semipure, so this isn't the same as \+ goal_info_is_pure.
|
|
:- pred goal_info_is_impure(hlds_goal_info).
|
|
:- mode goal_info_is_impure(in) is semidet.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module make_hlds, hlds_data, hlds_pred, hlds_goal, prog_io_util.
|
|
:- import_module type_util, mode_util, code_util, prog_data, unify_proc.
|
|
:- import_module globals, options, mercury_to_mercury, hlds_out.
|
|
:- import_module passes_aux, typecheck, module_qual, clause_to_proc.
|
|
:- import_module modecheck_unify, modecheck_call, inst_util, prog_out.
|
|
:- import_module list, map, varset, term, string, require, std_util.
|
|
:- import_module assoc_list, bool, int, set.
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% Public Predicates
|
|
|
|
|
|
puritycheck(HLDS0, HLDS) -->
|
|
globals__io_lookup_bool_option(statistics, Statistics),
|
|
globals__io_lookup_bool_option(verbose, Verbose),
|
|
io__stderr_stream(StdErr),
|
|
io__set_output_stream(StdErr, OldStream),
|
|
|
|
maybe_write_string(Verbose, "% Purity-checking clauses...\n"),
|
|
check_preds_purity(HLDS0, HLDS),
|
|
maybe_report_stats(Statistics),
|
|
|
|
io__set_output_stream(OldStream, _).
|
|
|
|
|
|
% worst_purity/3 could be written more compactly, but this definition
|
|
% guarantees us a determinism error if we add to type `purity'. We also
|
|
% define less_pure/2 in terms of worst_purity/3 rather than the other way
|
|
% around for the same reason.
|
|
|
|
worst_purity(pure, pure, pure).
|
|
worst_purity(pure, (semipure), (semipure)).
|
|
worst_purity(pure, (impure), (impure)).
|
|
worst_purity((semipure), pure, (semipure)).
|
|
worst_purity((semipure), (semipure), (semipure)).
|
|
worst_purity((semipure), (impure), (impure)).
|
|
worst_purity((impure), pure, (impure)).
|
|
worst_purity((impure), (semipure), (impure)).
|
|
worst_purity((impure), (impure), (impure)).
|
|
|
|
|
|
less_pure(P1, P2) :-
|
|
\+ worst_purity(P1, P2, P2).
|
|
|
|
|
|
add_goal_info_purity_feature(GoalInfo0, pure, GoalInfo) :-
|
|
goal_info_remove_feature(GoalInfo0, (semipure), GoalInfo1),
|
|
goal_info_remove_feature(GoalInfo1, (impure), GoalInfo).
|
|
add_goal_info_purity_feature(GoalInfo0, (semipure), GoalInfo) :-
|
|
goal_info_add_feature(GoalInfo0, (semipure), GoalInfo).
|
|
add_goal_info_purity_feature(GoalInfo0, (impure), GoalInfo) :-
|
|
goal_info_add_feature(GoalInfo0, (impure), GoalInfo).
|
|
|
|
|
|
infer_goal_info_purity(GoalInfo, Purity) :-
|
|
(
|
|
goal_info_has_feature(GoalInfo, (impure)) ->
|
|
Purity = (impure)
|
|
;
|
|
goal_info_has_feature(GoalInfo, (semipure)) ->
|
|
Purity = (semipure)
|
|
;
|
|
Purity = pure
|
|
).
|
|
|
|
|
|
goal_info_is_pure(GoalInfo) :-
|
|
\+ goal_info_has_feature(GoalInfo, (impure)),
|
|
\+ goal_info_has_feature(GoalInfo, (semipure)).
|
|
|
|
|
|
goal_info_is_impure(GoalInfo) :-
|
|
goal_info_has_feature(GoalInfo, (impure)).
|
|
|
|
|
|
write_purity(Purity) -->
|
|
{ purity_name(Purity, String) },
|
|
io__write_string(String).
|
|
|
|
purity_name(pure, "pure").
|
|
purity_name((semipure), "semipure").
|
|
purity_name((impure), "impure").
|
|
|
|
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% Purity-check the code for all the predicates in a module
|
|
|
|
:- pred check_preds_purity(module_info, module_info, io__state, io__state).
|
|
:- mode check_preds_purity(in, out, di, uo) is det.
|
|
|
|
check_preds_purity(ModuleInfo0, ModuleInfo) -->
|
|
{ module_info_predids(ModuleInfo0, PredIds) },
|
|
check_preds_purity_2(PredIds, ModuleInfo0, ModuleInfo1, 0, NumErrors),
|
|
{ module_info_num_errors(ModuleInfo1, Errs0) },
|
|
{ Errs is Errs0 + NumErrors },
|
|
{ module_info_set_num_errors(ModuleInfo1, Errs, ModuleInfo) }.
|
|
|
|
|
|
:- pred check_preds_purity_2(list(pred_id), module_info, module_info,
|
|
int, int, io__state, io__state).
|
|
:- mode check_preds_purity_2(in, in, out, in, out, di, uo) is det.
|
|
|
|
check_preds_purity_2([], ModuleInfo, ModuleInfo,
|
|
NumErrors, NumErrors) --> [].
|
|
check_preds_purity_2([PredId | PredIds], ModuleInfo0, ModuleInfo,
|
|
NumErrors0, NumErrors) -->
|
|
{ module_info_preds(ModuleInfo0, Preds0) },
|
|
{ map__lookup(Preds0, PredId, PredInfo0) },
|
|
(
|
|
{ pred_info_is_imported(PredInfo0)
|
|
; pred_info_is_pseudo_imported(PredInfo0) }
|
|
->
|
|
{ ModuleInfo1 = ModuleInfo0 },
|
|
{ NumErrors1 = NumErrors0 }
|
|
;
|
|
write_pred_progress_message("% Purity-checking ", PredId,
|
|
ModuleInfo0),
|
|
check_type_bindings(PredId, PredInfo0, PredInfo1, ModuleInfo0,
|
|
UnboundTypeErrsInThisPred),
|
|
puritycheck_pred(PredId, PredInfo1, PredInfo2, ModuleInfo0,
|
|
PurityErrsInThisPred),
|
|
{ map__det_update(Preds0, PredId, PredInfo2, Preds) },
|
|
{ module_info_get_predicate_table(ModuleInfo0, PredTable0) },
|
|
{ predicate_table_set_preds(PredTable0, Preds, PredTable) },
|
|
{ module_info_set_predicate_table(ModuleInfo0, PredTable,
|
|
ModuleInfo1) },
|
|
{ NumErrors1 is NumErrors0 + UnboundTypeErrsInThisPred
|
|
+ PurityErrsInThisPred }
|
|
),
|
|
check_preds_purity_2(PredIds, ModuleInfo1, ModuleInfo,
|
|
NumErrors1, NumErrors).
|
|
|
|
% Purity-check the code for single predicate, reporting any errors.
|
|
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% Check for unbound type variables
|
|
%
|
|
% Check that the all of the types which have been inferred
|
|
% for the variables in the clause do not contain any unbound type
|
|
% variables other than those that occur in the types of head
|
|
% variables.
|
|
|
|
:- pred check_type_bindings(pred_id, pred_info, pred_info,
|
|
module_info, int, io__state, io__state).
|
|
:- mode check_type_bindings(in, in, out, in, out, di, uo) is det.
|
|
|
|
check_type_bindings(PredId, PredInfo0, PredInfo, ModuleInfo, NumErrors,
|
|
IOState0, IOState) :-
|
|
pred_info_clauses_info(PredInfo0, ClausesInfo0),
|
|
ClausesInfo0 = clauses_info(VarSet, B, VarTypesMap0, HeadVars, E),
|
|
map__apply_to_list(HeadVars, VarTypesMap0, HeadVarTypes),
|
|
term__vars_list(HeadVarTypes, HeadVarTypeParams),
|
|
map__to_assoc_list(VarTypesMap0, VarTypesList),
|
|
set__init(Set0),
|
|
check_type_bindings_2(VarTypesList, HeadVarTypeParams,
|
|
[], Errs, Set0, Set),
|
|
( Errs = [] ->
|
|
PredInfo = PredInfo0,
|
|
IOState = IOState0,
|
|
NumErrors = 0
|
|
;
|
|
%
|
|
% report the warning
|
|
%
|
|
report_unresolved_type_warning(Errs, PredId, PredInfo0,
|
|
ModuleInfo, VarSet, IOState0, IOState),
|
|
NumErrors = 0,
|
|
|
|
%
|
|
% bind all the type variables in `Set' to `void' ...
|
|
%
|
|
pred_info_context(PredInfo0, Context),
|
|
bind_type_vars_to_void(Set, Context, VarTypesMap0, VarTypesMap),
|
|
ClausesInfo = clauses_info(VarSet, B, VarTypesMap, HeadVars, E),
|
|
pred_info_set_clauses_info(PredInfo0, ClausesInfo, PredInfo)
|
|
).
|
|
|
|
:- pred check_type_bindings_2(assoc_list(var, (type)), list(var),
|
|
assoc_list(var, (type)), assoc_list(var, (type)),
|
|
set(tvar), set(tvar)).
|
|
:- mode check_type_bindings_2(in, in, in, out, in, out) is det.
|
|
|
|
check_type_bindings_2([], _, Errs, Errs, Set, Set).
|
|
check_type_bindings_2([Var - Type | VarTypes], HeadTypeParams,
|
|
Errs0, Errs, Set0, Set) :-
|
|
term__vars(Type, TVars),
|
|
set__list_to_set(TVars, TVarsSet0),
|
|
set__delete_list(TVarsSet0, HeadTypeParams, TVarsSet1),
|
|
( \+ set__empty(TVarsSet1) ->
|
|
Errs1 = [Var - Type | Errs0],
|
|
set__union(Set0, TVarsSet1, Set1)
|
|
;
|
|
Errs1 = Errs0,
|
|
Set0 = Set1
|
|
),
|
|
check_type_bindings_2(VarTypes, HeadTypeParams,
|
|
Errs1, Errs, Set1, Set).
|
|
|
|
%
|
|
% bind all the type variables in `UnboundTypeVarsSet' to the type `void' ...
|
|
%
|
|
:- pred bind_type_vars_to_void(set(var), term__context,
|
|
map(var, type), map(var, type)).
|
|
:- mode bind_type_vars_to_void(in, in, in, out) is det.
|
|
|
|
bind_type_vars_to_void(UnboundTypeVarsSet, Context,
|
|
VarTypesMap0, VarTypesMap) :-
|
|
%
|
|
% first create a pair of corresponding lists (UnboundTypeVars, Voids)
|
|
% that map the unbound type variables to void
|
|
%
|
|
set__to_sorted_list(UnboundTypeVarsSet, UnboundTypeVars),
|
|
list__length(UnboundTypeVars, Length),
|
|
Void = term__functor(term__atom("void"), [], Context),
|
|
list__duplicate(Length, Void, Voids),
|
|
|
|
%
|
|
% then apply the substitution we just created to the variable types
|
|
%
|
|
map__keys(VarTypesMap0, Vars),
|
|
map__values(VarTypesMap0, Types0),
|
|
term__substitute_corresponding_list(UnboundTypeVars, Voids,
|
|
Types0, Types),
|
|
map__from_corresponding_lists(Vars, Types, VarTypesMap).
|
|
|
|
%
|
|
% report an error: uninstantiated type parameter
|
|
%
|
|
:- pred report_unresolved_type_warning(assoc_list(var, (type)), pred_id,
|
|
pred_info, module_info, varset, io__state, io__state).
|
|
:- mode report_unresolved_type_warning(in, in, in, in, in, di, uo) is det.
|
|
|
|
report_unresolved_type_warning(Errs, PredId, PredInfo, ModuleInfo, VarSet) -->
|
|
globals__io_lookup_bool_option(halt_at_warn, HaltAtWarn),
|
|
( { HaltAtWarn = yes } ->
|
|
io__set_exit_status(1)
|
|
;
|
|
[]
|
|
),
|
|
|
|
{ pred_info_typevarset(PredInfo, TypeVarSet) },
|
|
{ pred_info_context(PredInfo, Context) },
|
|
|
|
prog_out__write_context(Context),
|
|
io__write_string("In "),
|
|
hlds_out__write_pred_id(ModuleInfo, PredId),
|
|
io__write_string(":\n"),
|
|
|
|
prog_out__write_context(Context),
|
|
io__write_string(" warning: unresolved polymorphism.\n"),
|
|
prog_out__write_context(Context),
|
|
( { Errs = [_] } ->
|
|
io__write_string(" The variable with an unbound type was:\n")
|
|
;
|
|
io__write_string(" The variables with unbound types were:\n")
|
|
),
|
|
write_type_var_list(Errs, Context, VarSet, TypeVarSet),
|
|
prog_out__write_context(Context),
|
|
io__write_string(" The unbound type variable(s) will be implicitly\n"),
|
|
prog_out__write_context(Context),
|
|
io__write_string(" bound to the builtin type `void'.\n"),
|
|
globals__io_lookup_bool_option(verbose_errors, VerboseErrors),
|
|
( { VerboseErrors = yes } ->
|
|
io__write_strings([
|
|
"\tThe body of the clause contains a call to a polymorphic predicate,\n",
|
|
"\tbut I can't determine which version should be called,\n",
|
|
"\tbecause the type variables listed above didn't get bound.\n",
|
|
% "\tYou may need to use an explicit type qualifier.\n",
|
|
% XXX improve error message
|
|
"\t(I ought to tell you which call caused the problem, but I'm afraid\n",
|
|
"\tyou'll have to work it out yourself. My apologies.)\n"
|
|
])
|
|
;
|
|
[]
|
|
).
|
|
|
|
:- pred write_type_var_list(assoc_list(var, (type)), term__context,
|
|
varset, tvarset, io__state, io__state).
|
|
:- mode write_type_var_list(in, in, in, in, di, uo) is det.
|
|
|
|
write_type_var_list([], _, _, _) --> [].
|
|
write_type_var_list([Var - Type | Rest], Context, VarSet, TVarSet) -->
|
|
prog_out__write_context(Context),
|
|
io__write_string(" "),
|
|
mercury_output_var(Var, VarSet, no),
|
|
io__write_string(" :: "),
|
|
mercury_output_term(Type, TVarSet, no),
|
|
io__write_string("\n"),
|
|
write_type_var_list(Rest, Context, VarSet, TVarSet).
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% Check purity of a single predicate
|
|
%
|
|
% Purity checking is quite simple. Since impurity /must/ be declared, we can
|
|
% perform a single pass checking that the actual purity of each predicate
|
|
% matches the declared (or implied) purity. A predicate is just as pure as
|
|
% its least pure goal. While we're doing this, we attach a `feature' to each
|
|
% goal that is not pure, including non-atomic goals, indicating its purity.
|
|
% This information must be maintained by later compilation passes, at least
|
|
% until after the last pass that may perform transformations that would not
|
|
% be correct for impure code. As we check purity and attach impurity
|
|
% features, we also check that impure (semipure) atomic goals were marked in
|
|
% the source code as impure (semipure). At this stage in the computation,
|
|
% this is indicated by already having the appropriate goal feature. (During
|
|
% the translation from term to goal, calls have their purity attached to
|
|
% them, and in the translation from goal to hlds_goal, the attached purity is
|
|
% turned into the appropriate feature in the hlds_goal_info.)
|
|
|
|
:- pred puritycheck_pred(pred_id, pred_info, pred_info, module_info, int,
|
|
io__state, io__state).
|
|
:- mode puritycheck_pred(in, in, out, in, out, di, uo) is det.
|
|
|
|
puritycheck_pred(PredId, PredInfo0, PredInfo, ModuleInfo, NumErrors) -->
|
|
{ pred_info_get_purity(PredInfo0, DeclPurity)} ,
|
|
{ pred_info_get_promised_pure(PredInfo0, Promised) },
|
|
( { pred_info_get_goal_type(PredInfo0, pragmas) } ->
|
|
{ WorstPurity = (impure) },
|
|
{ Purity = pure },
|
|
{ PredInfo = PredInfo0 },
|
|
{ NumErrors0 = 0 }
|
|
;
|
|
{ pred_info_clauses_info(PredInfo0, ClausesInfo0) },
|
|
{ ClausesInfo0 = clauses_info(A, B, C, D, Clauses0) },
|
|
{ ClausesInfo = clauses_info(A, B, C, D, Clauses) },
|
|
{ pred_info_set_clauses_info(PredInfo0, ClausesInfo,
|
|
PredInfo) },
|
|
compute_purity(Clauses0, Clauses, PredInfo0, ModuleInfo,
|
|
pure, Purity, 0, NumErrors0),
|
|
{ WorstPurity = Purity }
|
|
),
|
|
(
|
|
{ DeclPurity \= pure, Promised = yes } ->
|
|
{ NumErrors is NumErrors0 + 1 },
|
|
error_inconsistent_promise(ModuleInfo, PredInfo, PredId,
|
|
DeclPurity)
|
|
; { less_pure(DeclPurity, WorstPurity) } ->
|
|
{ NumErrors = NumErrors0 },
|
|
warn_exaggerated_impurity_decl(ModuleInfo, PredInfo, PredId,
|
|
DeclPurity, WorstPurity)
|
|
; { less_pure(Purity, DeclPurity), Promised = no } ->
|
|
{ NumErrors is NumErrors0 + 1 },
|
|
error_inferred_impure(ModuleInfo, PredInfo, PredId, Purity)
|
|
; { Purity = pure, Promised = yes } ->
|
|
{ NumErrors = NumErrors0 },
|
|
warn_unnecessary_promise_pure(ModuleInfo, PredInfo, PredId)
|
|
;
|
|
{ NumErrors = NumErrors0 }
|
|
).
|
|
|
|
|
|
% Infer the purity of a single (non-pragma c_code) predicate
|
|
|
|
:- pred compute_purity(list(clause), list(clause), pred_info, module_info,
|
|
purity, purity, int, int, io__state, io__state).
|
|
:- mode compute_purity(in, out, in, in, in, out, in, out, di, uo) is det.
|
|
|
|
compute_purity([], [], _, _, Purity, Purity, NumErrors, NumErrors) -->
|
|
[].
|
|
compute_purity([Clause0|Clauses0], [Clause|Clauses], PredInfo, ModuleInfo,
|
|
Purity0, Purity, NumErrors0, NumErrors) -->
|
|
{ Clause0 = clause(Ids, Body0 - Info0, Context) },
|
|
compute_expr_purity(Body0, Body, Info0, PredInfo, ModuleInfo,
|
|
no, Bodypurity, NumErrors0, NumErrors1),
|
|
{ add_goal_info_purity_feature(Info0, Bodypurity, Info) },
|
|
{ worst_purity(Purity0, Bodypurity, Purity1) },
|
|
{ Clause = clause(Ids, Body - Info, Context) },
|
|
compute_purity(Clauses0, Clauses, PredInfo, ModuleInfo,
|
|
Purity1, Purity, NumErrors1, NumErrors).
|
|
|
|
:- pred compute_expr_purity(hlds_goal_expr, hlds_goal_expr, hlds_goal_info,
|
|
pred_info, module_info, bool, purity, int, int, io__state, io__state).
|
|
:- mode compute_expr_purity(in, out, in, in, in, in, out, in, out, di, uo)
|
|
is det.
|
|
|
|
compute_expr_purity(conj(Goals0), conj(Goals), _, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_goals_purity(Goals0, Goals, PredInfo, ModuleInfo,
|
|
InClosure, pure, Purity, NumErrors0, NumErrors).
|
|
compute_expr_purity(call(PredId0,ProcId,Vars,BIState,UContext,Name0),
|
|
call(PredId,ProcId,Vars,BIState,UContext,Name), GoalInfo,
|
|
PredInfo, ModuleInfo, InClosure, ActualPurity,
|
|
NumErrors0, NumErrors) -->
|
|
{ resolve_pred_overloading(PredId0, Vars, PredInfo, ModuleInfo,
|
|
Name0, Name, PredId) },
|
|
{ module_info_preds(ModuleInfo, Preds) },
|
|
{ map__lookup(Preds, PredId, CalleePredInfo) },
|
|
{ pred_info_get_purity(CalleePredInfo, ActualPurity) },
|
|
{ infer_goal_info_purity(GoalInfo, DeclaredPurity) },
|
|
{ goal_info_get_context(GoalInfo, CallContext) },
|
|
( { code_util__compiler_generated(PredInfo) } ->
|
|
% Don't require purity annotations on calls in
|
|
% compiler-generated code
|
|
{ NumErrors = NumErrors0 }
|
|
; { ActualPurity = DeclaredPurity } ->
|
|
{ NumErrors = NumErrors0 }
|
|
; { InClosure = yes } ->
|
|
% Don't report purity errors inside closures: the whole
|
|
% closure is an error if it's not pure
|
|
{ NumErrors = NumErrors0 }
|
|
; { less_pure(ActualPurity, DeclaredPurity) } ->
|
|
error_missing_body_impurity_decl(ModuleInfo, CalleePredInfo,
|
|
PredId, CallContext,
|
|
ActualPurity),
|
|
{ NumErrors is NumErrors0 + 1 }
|
|
;
|
|
warn_unnecessary_body_impurity_decl(ModuleInfo, CalleePredInfo,
|
|
PredId, CallContext,
|
|
ActualPurity,
|
|
DeclaredPurity),
|
|
{ NumErrors = NumErrors0 }
|
|
).
|
|
compute_expr_purity(HOCall, HOCall, _, _, _, _, pure, NumErrors, NumErrors) -->
|
|
{ HOCall = higher_order_call(_,_,_,_,_,_) }.
|
|
compute_expr_purity(CMCall, CMCall, _, _, _, _, pure, NumErrors, NumErrors) -->
|
|
{ CMCall = class_method_call(_,_,_,_,_,_) }.
|
|
compute_expr_purity(switch(Var,Canfail,Cases0,Storemap),
|
|
switch(Var,Canfail,Cases,Storemap), _, PredInfo,
|
|
ModuleInfo, InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_cases_purity(Cases0, Cases, PredInfo, ModuleInfo,
|
|
InClosure, pure, Purity, NumErrors0, NumErrors).
|
|
compute_expr_purity(Unif0, Unif, GoalInfo, PredInfo, ModuleInfo, _,
|
|
pure, NumErrors0, NumErrors) -->
|
|
{ Unif0 = unify(A,RHS0,C,D,E) },
|
|
{ Unif = unify(A,RHS,C,D,E) },
|
|
( { RHS0 = lambda_goal(F, G, H, I, Goal0 - Info0) } ->
|
|
{ RHS = lambda_goal(F, G, H, I, Goal - Info0) },
|
|
compute_expr_purity(Goal0, Goal, Info0, PredInfo, ModuleInfo,
|
|
yes, Purity, NumErrors0, NumErrors1),
|
|
error_if_closure_impure(GoalInfo, Purity,
|
|
NumErrors1, NumErrors)
|
|
;
|
|
{ RHS = RHS0 },
|
|
{ NumErrors = NumErrors0 }
|
|
).
|
|
compute_expr_purity(disj(Goals0,Store), disj(Goals,Store), _, PredInfo,
|
|
ModuleInfo, InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_goals_purity(Goals0, Goals, PredInfo, ModuleInfo,
|
|
InClosure, pure, Purity, NumErrors0, NumErrors).
|
|
compute_expr_purity(not(Goal0), not(Goal), _, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_goal_purity(Goal0, Goal, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors).
|
|
compute_expr_purity(some(Vars,Goal0), some(Vars,Goal), _, PredInfo,
|
|
ModuleInfo, InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_goal_purity(Goal0, Goal, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors).
|
|
compute_expr_purity(if_then_else(Vars,Goali0,Goalt0,Goale0,Store),
|
|
if_then_else(Vars,Goali,Goalt,Goale,Store), _, PredInfo,
|
|
ModuleInfo, InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_goal_purity(Goali0, Goali, PredInfo, ModuleInfo,
|
|
InClosure, Purity1, NumErrors0, NumErrors1),
|
|
compute_goal_purity(Goalt0, Goalt, PredInfo, ModuleInfo,
|
|
InClosure, Purity2, NumErrors1, NumErrors2),
|
|
compute_goal_purity(Goale0, Goale, PredInfo, ModuleInfo,
|
|
InClosure, Purity3, NumErrors2, NumErrors),
|
|
{ worst_purity(Purity1, Purity2, Purity12) },
|
|
{ worst_purity(Purity12, Purity3, Purity) }.
|
|
compute_expr_purity(Ccode, Ccode, _, _, ModuleInfo, _, Purity,
|
|
NumErrors, NumErrors) -->
|
|
{ Ccode = pragma_c_code(_,PredId,_,_,_,_,_) },
|
|
{ module_info_preds(ModuleInfo, Preds) },
|
|
{ map__lookup(Preds, PredId, PredInfo) },
|
|
{ pred_info_get_purity(PredInfo, Purity) }.
|
|
|
|
|
|
|
|
:- pred compute_goal_purity(hlds_goal, hlds_goal, pred_info,
|
|
module_info, bool, purity, int, int, io__state, io__state).
|
|
:- mode compute_goal_purity(in, out, in, in, in, out, in, out, di, uo) is det.
|
|
|
|
compute_goal_purity(Goal0 - GoalInfo0, Goal - GoalInfo, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors) -->
|
|
compute_expr_purity(Goal0, Goal, GoalInfo0, PredInfo, ModuleInfo,
|
|
InClosure, Purity, NumErrors0, NumErrors),
|
|
{ add_goal_info_purity_feature(GoalInfo0, Purity, GoalInfo) }.
|
|
|
|
|
|
% Compute the purity of a list of hlds_goals. Since the purity of a
|
|
% disjunction is computed the same way as the purity of a conjunction, we use
|
|
% the same code for both
|
|
|
|
:- pred compute_goals_purity(list(hlds_goal), list(hlds_goal), pred_info,
|
|
module_info, bool, purity, purity, int, int, io__state, io__state).
|
|
:- mode compute_goals_purity(in, out, in, in, in, in, out, in, out, di, uo)
|
|
is det.
|
|
|
|
compute_goals_purity([], [], _, _, _, Purity, Purity, NumErrors, NumErrors) -->
|
|
[].
|
|
compute_goals_purity([Goal0|Goals0], [Goal|Goals], PredInfo, ModuleInfo,
|
|
InClosure, Purity0, Purity, NumErrors0, NumErrors) -->
|
|
compute_goal_purity(Goal0, Goal, PredInfo, ModuleInfo,
|
|
InClosure, Purity1, NumErrors0, NumErrors1),
|
|
{ worst_purity(Purity0, Purity1, Purity2) },
|
|
compute_goals_purity(Goals0, Goals, PredInfo, ModuleInfo, InClosure,
|
|
Purity2, Purity, NumErrors1, NumErrors).
|
|
|
|
|
|
|
|
:- pred compute_cases_purity(list(case), list(case), pred_info, module_info,
|
|
bool, purity, purity, int, int, io__state, io__state).
|
|
:- mode compute_cases_purity(in, out, in, in, in, in, out, in, out, di, uo)
|
|
is det.
|
|
|
|
compute_cases_purity([], [], _, _, _, Purity, Purity, NumErrors, NumErrors) -->
|
|
[].
|
|
compute_cases_purity([case(Ctor,Goal0)|Goals0], [case(Ctor,Goal)|Goals],
|
|
PredInfo, ModuleInfo, InClosure, Purity0, Purity,
|
|
NumErrors0, NumErrors) -->
|
|
compute_goal_purity(Goal0, Goal, PredInfo, ModuleInfo,
|
|
InClosure, Purity1, NumErrors0, NumErrors1),
|
|
{ worst_purity(Purity0, Purity1, Purity2) },
|
|
compute_cases_purity(Goals0, Goals, PredInfo, ModuleInfo, InClosure,
|
|
Purity2, Purity, NumErrors1, NumErrors).
|
|
|
|
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% Print error messages
|
|
|
|
|
|
:- pred error_inconsistent_promise(module_info, pred_info, pred_id, purity,
|
|
io__state, io__state).
|
|
:- mode error_inconsistent_promise(in, in, in, in, di, uo) is det.
|
|
|
|
error_inconsistent_promise(ModuleInfo, PredInfo, PredId, Purity) -->
|
|
{ pred_info_context(PredInfo, Context) },
|
|
write_context_and_pred_id(ModuleInfo, PredInfo, PredId),
|
|
prog_out__write_context(Context),
|
|
report_warning(" warning: declared `"),
|
|
write_purity(Purity),
|
|
io__write_string("' but promised pure.\n"),
|
|
globals__io_lookup_bool_option(verbose_errors, VerboseErrors),
|
|
( { VerboseErrors = yes } ->
|
|
{ pred_info_get_is_pred_or_func(PredInfo, PredOrFunc) },
|
|
prog_out__write_context(Context),
|
|
io__write_string(" A pure "),
|
|
hlds_out__write_pred_or_func(PredOrFunc),
|
|
io__write_string(" that invokes impure or semipure code should\n"),
|
|
prog_out__write_context(Context),
|
|
io__write_string(
|
|
" be promised pure and should have no impurity declaration.\n"
|
|
)
|
|
;
|
|
[]
|
|
).
|
|
|
|
|
|
:- pred warn_exaggerated_impurity_decl(module_info, pred_info, pred_id,
|
|
purity, purity, io__state, io__state).
|
|
:- mode warn_exaggerated_impurity_decl(in, in, in, in, in, di, uo) is det.
|
|
|
|
warn_exaggerated_impurity_decl(ModuleInfo, PredInfo, PredId,
|
|
DeclPurity, AcutalPurity) -->
|
|
{ pred_info_context(PredInfo, Context) },
|
|
write_context_and_pred_id(ModuleInfo, PredInfo, PredId),
|
|
prog_out__write_context(Context),
|
|
report_warning(" warning: declared `"),
|
|
write_purity(DeclPurity),
|
|
io__write_string("' but actually "),
|
|
write_purity(AcutalPurity),
|
|
io__write_string(".\n").
|
|
|
|
:- pred warn_unnecessary_promise_pure(module_info, pred_info, pred_id,
|
|
io__state, io__state).
|
|
:- mode warn_unnecessary_promise_pure(in, in, in, di, uo) is det.
|
|
|
|
warn_unnecessary_promise_pure(ModuleInfo, PredInfo, PredId) -->
|
|
{ pred_info_context(PredInfo, Context) },
|
|
write_context_and_pred_id(ModuleInfo, PredInfo, PredId),
|
|
prog_out__write_context(Context),
|
|
report_warning(" warning: unnecessary `promise_pure' pragma.\n"),
|
|
globals__io_lookup_bool_option(verbose_errors, VerboseErrors),
|
|
( { VerboseErrors = yes } ->
|
|
prog_out__write_context(Context),
|
|
{ pred_info_get_is_pred_or_func(PredInfo, PredOrFunc) },
|
|
io__write_string(" This "),
|
|
hlds_out__write_pred_or_func(PredOrFunc),
|
|
io__write_string(
|
|
" does not invoke any impure or semipure code,\n"
|
|
),
|
|
prog_out__write_context(Context),
|
|
io__write_string(
|
|
" so there is no need for a `promise_pure' pragma.\n"
|
|
)
|
|
;
|
|
[]
|
|
).
|
|
|
|
|
|
:- pred error_inferred_impure(module_info, pred_info, pred_id, purity,
|
|
io__state, io__state).
|
|
:- mode error_inferred_impure(in, in, in, in, di, uo) is det.
|
|
|
|
error_inferred_impure(ModuleInfo, PredInfo, PredId, Purity) -->
|
|
{ pred_info_context(PredInfo, Context) },
|
|
{ pred_info_get_is_pred_or_func(PredInfo, PredOrFunc) },
|
|
write_context_and_pred_id(ModuleInfo, PredInfo, PredId),
|
|
prog_out__write_context(Context),
|
|
io__write_string(" error: "),
|
|
hlds_out__write_pred_or_func(PredOrFunc),
|
|
io__write_string(" is "),
|
|
write_purity(Purity),
|
|
io__write_string(".\n"),
|
|
prog_out__write_context(Context),
|
|
( { code_util__compiler_generated(PredInfo) } ->
|
|
io__write_string(" It must be pure.\n")
|
|
;
|
|
io__write_string(" It must be declared `"),
|
|
write_purity(Purity),
|
|
io__write_string("' or promised pure.\n")
|
|
).
|
|
|
|
|
|
:- pred error_missing_body_impurity_decl(module_info, pred_info, pred_id,
|
|
context, purity, io__state, io__state).
|
|
:- mode error_missing_body_impurity_decl(in, in, in, in, in, di, uo) is det.
|
|
|
|
error_missing_body_impurity_decl(ModuleInfo, _, PredId, Context,
|
|
Purity) -->
|
|
prog_out__write_context(Context),
|
|
io__write_string("In call to "),
|
|
write_purity(Purity),
|
|
io__write_string(" "),
|
|
hlds_out__write_pred_id(ModuleInfo, PredId),
|
|
io__write_string(":\n"),
|
|
prog_out__write_context(Context),
|
|
io__write_string(" error: call must be preceded by `"),
|
|
write_purity(Purity),
|
|
io__write_string("' indicator.\n").
|
|
|
|
|
|
:- pred warn_unnecessary_body_impurity_decl(module_info, pred_info, pred_id,
|
|
context, purity, purity, io__state, io__state).
|
|
:- mode warn_unnecessary_body_impurity_decl(in, in, in, in, in, in, di, uo)
|
|
is det.
|
|
|
|
warn_unnecessary_body_impurity_decl(ModuleInfo, _, PredId, Context,
|
|
ActualPurity, DeclaredPurity) -->
|
|
prog_out__write_context(Context),
|
|
io__write_string("In call to "),
|
|
hlds_out__write_pred_id(ModuleInfo, PredId),
|
|
io__write_string(":\n"),
|
|
prog_out__write_context(Context),
|
|
io__write_string(" warning: unnecessary `"),
|
|
write_purity(DeclaredPurity),
|
|
io__write_string("' indicator.\n"),
|
|
prog_out__write_context(Context),
|
|
( { ActualPurity = pure } ->
|
|
io__write_string(" No purity indicator is necessary.\n")
|
|
;
|
|
io__write_string(" A purity indicator of `"),
|
|
write_purity(ActualPurity),
|
|
io__write_string("' is sufficient.\n")
|
|
).
|
|
|
|
|
|
:- pred error_if_closure_impure(hlds_goal_info, purity, int, int,
|
|
io__state, io__state).
|
|
:- mode error_if_closure_impure(in, in, in, out, di, uo) is det.
|
|
|
|
error_if_closure_impure(GoalInfo, Purity, NumErrors0, NumErrors) -->
|
|
( { Purity = pure } ->
|
|
{ NumErrors = NumErrors0 }
|
|
;
|
|
{ NumErrors is NumErrors0 + 1 },
|
|
{ goal_info_get_context(GoalInfo, Context) },
|
|
prog_out__write_context(Context),
|
|
io__write_string("Error in closure: closure is "),
|
|
write_purity(Purity),
|
|
io__write_string(".\n"),
|
|
globals__io_lookup_bool_option(verbose_errors, VerboseErrors),
|
|
( { VerboseErrors = yes } ->
|
|
prog_out__write_context(Context),
|
|
io__write_string(" All closures must be pure.\n")
|
|
;
|
|
[]
|
|
)
|
|
).
|
|
|
|
|
|
:- pred write_context_and_pred_id(module_info, pred_info, pred_id,
|
|
io__state, io__state).
|
|
:- mode write_context_and_pred_id(in, in, in, di, uo) is det.
|
|
|
|
write_context_and_pred_id(ModuleInfo, PredInfo, PredId) -->
|
|
{ pred_info_context(PredInfo, Context) },
|
|
prog_out__write_context(Context),
|
|
io__write_string("In "),
|
|
hlds_out__write_pred_id(ModuleInfo, PredId),
|
|
io__write_string(":\n").
|
|
|
|
|
|
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
% resolve predicate overloading
|
|
|
|
:- pred resolve_pred_overloading(pred_id, list(var), pred_info, module_info,
|
|
sym_name, sym_name, pred_id).
|
|
:- mode resolve_pred_overloading(in, in, in, in, in, out, out)
|
|
is det.
|
|
|
|
% In the case of a call to an overloaded predicate, typecheck.m
|
|
% does not figure out the correct pred_id. We must do that here.
|
|
|
|
resolve_pred_overloading(PredId0, Args0, CallerPredInfo, ModuleInfo,
|
|
PredName0, PredName, PredId) :-
|
|
( invalid_pred_id(PredId0) ->
|
|
%
|
|
% Find the set of candidate pred_ids for predicates which
|
|
% have the specified name and arity
|
|
%
|
|
pred_info_typevarset(CallerPredInfo, TVarSet),
|
|
pred_info_clauses_info(CallerPredInfo, ClausesInfo),
|
|
ClausesInfo = clauses_info(_, _, VarTypes, _, _),
|
|
typecheck__resolve_pred_overloading(ModuleInfo, Args0,
|
|
VarTypes, TVarSet, PredName0, PredName, PredId)
|
|
;
|
|
PredId = PredId0,
|
|
PredName = PredName0
|
|
).
|
|
|