Files
mercury/compiler/code_gen.m
Zoltan Somogyi 672f77c4ec Add a new compiler option. --inform-ite-instead-of-switch.
Estimated hours taken: 20
Branches: main

Add a new compiler option. --inform-ite-instead-of-switch. If this is enabled,
the compiler will generate informational messages about if-then-elses that
it thinks should be converted to switches for the sake of program reliability.

Act on the output generated by this option.

compiler/simplify.m:
	Implement the new option.

	Fix an old bug that could cause us to generate warnings about code
	that was OK in one duplicated copy but not in another (where a switch
	arm's code is duplicated due to the case being selected for more than
	one cons_id).

compiler/options.m:
	Add the new option.

	Add a way to test for the bug fix in simplify.

doc/user_guide.texi:
	Document the new option.

NEWS:
	Mention the new option.

library/*.m:
mdbcomp/*.m:
browser/*.m:
compiler/*.m:
deep_profiler/*.m:
	Convert if-then-elses to switches at most of the sites suggested by the
	new option. At the remaining sites, switching to switches would have
	nontrivial downsides. This typically happens with the switched-on type
	has many functors, and we treat one or two specially (e.g. cons/2 in
	the cons_id type).

	Perform misc cleanups in the vicinity of the if-then-else to switch
	conversions.

	In a few cases, improve the error messages generated.

compiler/accumulator.m:
compiler/hlds_goal.m:
	(Rename and) move insts for particular kinds of goal from
	accumulator.m to hlds_goal.m, to allow them to be used in other
	modules. Using these insts allowed us to eliminate some if-then-elses
	entirely.

compiler/exprn_aux.m:
	Instead of fixing some if-then-elses, delete the predicates containing
	them, since they aren't used, and (as pointed out by the new option)
	would need considerable other fixing if they were ever needed again.

compiler/lp_rational.m:
	Add prefixes to the names of the function symbols on some types,
	since without those prefixes, it was hard to figure out what type
	the switch corresponding to an old if-then-else was switching on.

tests/invalid/reserve_tag.err_exp:
	Expect a new, improved error message.
2007-11-23 07:36:01 +00:00

307 lines
12 KiB
Mathematica

%---------------------------------------------------------------------------%
% vim: ft=mercury ts=4 sw=4 et
%---------------------------------------------------------------------------%
% Copyright (C) 1994-2007 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: code_gen.m.
% Main authors: conway, zs.
%
% The task of this module is to provide a generic predicate that can be called
% from anywhere in the code generator to generate code for a goal. We forward
% most of the actual construction of code for particular types of goals
% to other modules. The generation of code for unifications is done
% by unify_gen, for calls, higher-order calls and method calls by call_gen,
% for commits by commit_gen, for if-then-elses and negations by ite_gen,
% for switches by switch_gen and its subsidiary modules, for disjunctions
% by disj_gen, for parallel conjunctions by par_conj_gen, and for foreign_procs
% by pragma_c_gen. The only goals handled directly by code_gen are sequential
% conjunctions.
%
%---------------------------------------------------------------------------%
:- module ll_backend.code_gen.
:- interface.
:- import_module hlds.code_model.
:- import_module hlds.hlds_goal.
:- import_module ll_backend.code_info.
:- import_module ll_backend.llds.
%---------------------------------------------------------------------------%
% Translate a HLDS goal to LLDS.
%
:- pred generate_goal(code_model::in, hlds_goal::in, code_tree::out,
code_info::in, code_info::out) is det.
%---------------------------------------------------------------------------%
%---------------------------------------------------------------------------%
:- implementation.
:- import_module hlds.hlds_pred.
:- import_module hlds.instmap.
:- import_module libs.compiler_util.
:- import_module libs.globals.
:- import_module libs.tree.
:- import_module ll_backend.call_gen.
:- import_module ll_backend.commit_gen.
:- import_module ll_backend.disj_gen.
:- import_module ll_backend.ite_gen.
:- import_module ll_backend.par_conj_gen.
:- import_module ll_backend.pragma_c_gen.
:- import_module ll_backend.switch_gen.
:- import_module ll_backend.unify_gen.
:- import_module parse_tree.prog_data.
:- import_module bool.
:- import_module list.
:- import_module map.
:- import_module maybe.
:- import_module pair.
:- import_module set.
%---------------------------------------------------------------------------%
generate_goal(ContextModel, hlds_goal(GoalExpr, GoalInfo), Code, !CI) :-
% Generate a goal. This predicate arranges for the necessary updates of
% the generic data structures before and after the actual code generation,
% which is delegated to goal-specific predicates.
code_info.get_forward_live_vars(!.CI, ForwardLiveVarsBeforeGoal),
% Make any changes to liveness before Goal.
( goal_is_atomic(GoalExpr) ->
IsAtomic = yes
;
IsAtomic = no
),
code_info.pre_goal_update(GoalInfo, IsAtomic, !CI),
code_info.get_instmap(!.CI, InstMap),
( instmap.is_reachable(InstMap) ->
CodeModel = goal_info_get_code_model(GoalInfo),
% Sanity check: code of some code models should occur
% only in limited contexts.
(
CodeModel = model_det
;
CodeModel = model_semi,
(
ContextModel = model_det,
unexpected(this_file, "semidet model in det context")
;
( ContextModel = model_semi
; ContextModel = model_non
)
)
;
CodeModel = model_non,
(
( ContextModel = model_det
; ContextModel = model_semi
),
unexpected(this_file, "nondet model in det/semidet context")
;
ContextModel = model_non
)
),
generate_goal_2(GoalExpr, GoalInfo, CodeModel,
ForwardLiveVarsBeforeGoal, GoalCode, !CI),
Features = goal_info_get_features(GoalInfo),
code_info.get_proc_info(!.CI, ProcInfo),
% If the predicate's evaluation method is memo, loopcheck or minimal
% model, the goal generated the variable that represents the call table
% tip, *and* tracing is enabled, then we save this variable to its
% stack slot. This is necessary to enable retries across this procedure
% to reset the call table entry to uninitialized, effectively removing
% the call table entry.
%
% If tracing is not enabled, then CallTableVar isn't guaranteed
% to have a stack slot.
(
set.member(feature_call_table_gen, Features),
code_info.get_proc_info(!.CI, ProcInfo),
proc_info_get_call_table_tip(ProcInfo, MaybeCallTableVar),
MaybeCallTableVar = yes(CallTableVar),
code_info.get_maybe_trace_info(!.CI, yes(_))
->
code_info.save_variables_on_stack([CallTableVar], TipSaveCode,
!CI),
CodeUptoTip = tree(GoalCode, TipSaveCode)
;
CodeUptoTip = GoalCode
),
% After the goal that generates the variables needed at the exception
% port, on which deep_profiling.m puts the save_deep_excp_vars feature,
% save those variables in their stack slots. The procedure layout
% structure gives the identity of their slots, and exception.m
% expects to find the variables in their stack slots.
%
% These variables are computed by the call port code and are needed
% by the exit and fail port codes, so their lifetime is the entire
% procedure invocation. If the procedure makes any calls other than
% the ones inserted by deep profiling, then all the variables will have
% stack slots, and we save them all on the stack. If the procedure
% doesn't make any such calls, then the variables won't have stack
% slots, but they won't *need* stack slots either, since there is no
% way for such a leaf procedure to throw an exception. (Throwing
% requires calling exception.throw, directly or indirectly.)
( set.member(feature_save_deep_excp_vars, Features) ->
DeepSaveVars = compute_deep_save_excp_vars(ProcInfo),
save_variables_on_stack(DeepSaveVars, DeepSaveCode, !CI),
Code = tree(CodeUptoTip, DeepSaveCode)
;
Code = CodeUptoTip
),
% Make live any variables which subsequent goals will expect to be
% live, but were not generated.
code_info.set_instmap(InstMap, !CI),
code_info.post_goal_update(GoalInfo, !CI)
;
Code = empty
).
:- func compute_deep_save_excp_vars(proc_info) = list(prog_var).
compute_deep_save_excp_vars(ProcInfo) = DeepSaveVars :-
proc_info_get_maybe_deep_profile_info(ProcInfo, MaybeDeepProfInfo),
(
MaybeDeepProfInfo = yes(DeepProfInfo),
MaybeDeepLayout = DeepProfInfo ^ deep_layout,
MaybeDeepLayout = yes(DeepLayout)
->
ExcpVars = DeepLayout ^ deep_layout_excp,
ExcpVars = hlds_deep_excp_vars(TopCSDVar, MiddleCSDVar,
MaybeOldOutermostVar),
proc_info_get_stack_slots(ProcInfo, StackSlots),
( map.search(StackSlots, TopCSDVar, _) ->
% If one of these variables has a stack slot, the others must
% have one too.
(
MaybeOldOutermostVar = yes(OldOutermostVar),
DeepSaveVars = [TopCSDVar, MiddleCSDVar, OldOutermostVar]
;
MaybeOldOutermostVar = no,
DeepSaveVars = [TopCSDVar, MiddleCSDVar]
)
;
DeepSaveVars = []
)
;
unexpected(this_file,
"compute_deep_save_excp_vars: inconsistent proc_info")
).
%---------------------------------------------------------------------------%
:- pred generate_goal_2(hlds_goal_expr::in, hlds_goal_info::in,
code_model::in, set(prog_var)::in, code_tree::out,
code_info::in, code_info::out) is det.
generate_goal_2(GoalExpr, GoalInfo, CodeModel, ForwardLiveVarsBeforeGoal,
Code, !CI) :-
(
GoalExpr = unify(_, _, _, Uni, _),
unify_gen.generate_unification(CodeModel, Uni, GoalInfo, Code, !CI)
;
GoalExpr = conj(ConjType, Goals),
(
ConjType = plain_conj,
generate_goals(Goals, CodeModel, Code, !CI)
;
ConjType = parallel_conj,
par_conj_gen.generate_par_conj(Goals, GoalInfo, CodeModel, Code,
!CI)
)
;
GoalExpr = disj(Goals),
disj_gen.generate_disj(CodeModel, Goals, GoalInfo, Code, !CI)
;
GoalExpr = negation(Goal),
ite_gen.generate_negation(CodeModel, Goal, GoalInfo, Code, !CI)
;
GoalExpr = if_then_else(_Vars, Cond, Then, Else),
ite_gen.generate_ite(CodeModel, Cond, Then, Else, GoalInfo, Code, !CI)
;
GoalExpr = switch(Var, CanFail, CaseList),
switch_gen.generate_switch(CodeModel, Var, CanFail, CaseList, GoalInfo,
Code, !CI)
;
GoalExpr = scope(Reason, Goal),
commit_gen.generate_scope(Reason, CodeModel, GoalInfo,
ForwardLiveVarsBeforeGoal, Goal, Code, !CI)
;
GoalExpr = generic_call(GenericCall, Args, Modes, Det),
call_gen.generate_generic_call(CodeModel, GenericCall, Args,
Modes, Det, GoalInfo, Code, !CI)
;
GoalExpr = plain_call(PredId, ProcId, Args, BuiltinState, _, _),
(
BuiltinState = not_builtin,
call_gen.generate_call(CodeModel, PredId, ProcId, Args, GoalInfo,
Code, !CI)
;
( BuiltinState = inline_builtin
; BuiltinState = out_of_line_builtin
),
call_gen.generate_builtin(CodeModel, PredId, ProcId, Args,
Code, !CI)
)
;
GoalExpr = call_foreign_proc(Attributes, PredId, ProcId,
Args, ExtraArgs, MaybeTraceRuntimeCond, PragmaCode),
Lang = get_foreign_language(Attributes),
(
Lang = lang_c,
generate_foreign_proc_code(CodeModel, Attributes,
PredId, ProcId, Args, ExtraArgs, MaybeTraceRuntimeCond,
PragmaCode, GoalInfo, Code, !CI)
;
( Lang = lang_java
; Lang = lang_csharp
; Lang = lang_il
; Lang = lang_erlang
),
unexpected(this_file,
"generate_goal_2: foreign code other than C unexpected")
)
;
GoalExpr = shorthand(_),
% These should have been expanded out by now.
unexpected(this_file, "generate_goal_2: unexpected shorthand")
).
%---------------------------------------------------------------------------%
% Generate a conjoined series of goals. Note of course, that with a
% conjunction, state information flows directly from one conjunct
% to the next.
%
:- pred generate_goals(hlds_goals::in, code_model::in,
code_tree::out, code_info::in, code_info::out) is det.
generate_goals([], _, empty, !CI).
generate_goals([Goal | Goals], CodeModel, Code, !CI) :-
generate_goal(CodeModel, Goal, Code1, !CI),
code_info.get_instmap(!.CI, Instmap),
( instmap.is_unreachable(Instmap) ->
Code = Code1
;
generate_goals(Goals, CodeModel, Code2, !CI),
Code = tree(Code1, Code2)
).
%---------------------------------------------------------------------------%
:- func this_file = string.
this_file = "code_gen.m".
%---------------------------------------------------------------------------%