Files
mercury/compiler/code_gen.m
Zoltan Somogyi 3f3045c9e2 Get and set varsets/vartypes in proc_infos together.
compiler/hlds_pred.m:
    We eventually want to replace the varset and vartypes fields in
    each proc_info with a var_table, but it is not practical to do so
    at once; it will have to be done gradually, a few modules at most
    at a time. During this process, we will need a way either

    - to let already converted modules get a var_table out of the proc_info,
      and put an updated var_table back into a proc_info, even though
      proc_infos still contain varset and vartypes fields, or

    - to let not-yet-converted modules get varsets and vartypes out of the
      proc_info, and put updated varsets and vartypes back into a proc_info,
      even though proc_infos already store a var_table.

    The latter cannot be done in two halves (i.e. set the varset half
    of the var_table, and then set its vartypes half), and while the former
    *can* be done that way, it is more efficient to do them at the same time.

    Therefore as a first step, this diff replaces the indiviual getter
    and setter predicates of the varset and vartypes fields of proc_info
    with a getter that gets both and a setter that sets both.

    Put the varset and vartypes next to each other in a structure.

compiler/code_info.m:
    Delete a function that duplicates a function in var_table.m.

    Conform to the change above.

compiler/det_report.m:
    Factor out some common code.

    Conform to the change above.

compiler/det_util.m:
    Delete a no-longer-needed predicate.

    Conform to the change above.

compiler/higher_order.m:
    Fix an old oversight: when deleting variables from the vartypes,
    delete them from the varset as well.

    Conform to the change above.

compiler/liveness.m:
    Avoid constructing and traversing a list unnecessarily.

    Conform to the change above.

compiler/accumulator.m:
compiler/add_heap_ops.m:
compiler/add_trail_ops.m:
compiler/arg_info.m:
compiler/build_mode_constraints.m:
compiler/bytecode_gen.m:
compiler/call_gen.m:
compiler/clause_to_proc.m:
compiler/closure_analysis.m:
compiler/code_gen.m:
compiler/code_loc_dep.m:
compiler/complexity.m:
compiler/continuation_info.m:
compiler/cse_detection.m:
compiler/ctgc.datastruct.m:
compiler/ctgc.util.m:
compiler/deep_profiling.m:
compiler/deforest.m:
compiler/delay_construct.m:
compiler/delay_partial_inst.m:
compiler/dep_par_conj.m:
compiler/det_analysis.m:
compiler/direct_arg_in_out.m:
compiler/disj_gen.m:
compiler/equiv_type_hlds.m:
compiler/exception_analysis.m:
compiler/float_regs.m:
compiler/follow_code.m:
compiler/goal_mode.m:
compiler/goal_path.m:
compiler/hlds_out_pred.m:
compiler/hlds_rtti.m:
compiler/hlds_statistics.m:
compiler/inlining.m:
compiler/intermod.m:
compiler/intermod_analysis.m:
compiler/introduce_exists_casts.m:
compiler/introduce_parallelism.m:
compiler/lambda.m:
compiler/lco.m:
compiler/live_vars.m:
compiler/loop_inv.m:
compiler/mark_tail_calls.m:
compiler/ml_accurate_gc.m:
compiler/ml_args_util.m:
compiler/ml_closure_gen.m:
compiler/ml_gen_info.m:
compiler/ml_proc_gen.m:
compiler/mode_info.m:
compiler/modecheck_goal.m:
compiler/modes.m:
compiler/par_loop_control.m:
compiler/pd_debug.m:
compiler/pd_info.m:
compiler/pd_util.m:
compiler/polymorphism_info.m:
compiler/proc_gen.m:
compiler/purity.m:
compiler/push_goals_together.m:
compiler/quantification.m:
compiler/rbmm.add_rbmm_goal_infos.m:
compiler/rbmm.live_variable_analysis.m:
compiler/rbmm.points_to_graph.m:
compiler/rbmm.points_to_info.m:
compiler/rbmm.region_liveness_info.m:
compiler/rbmm.region_transformation.m:
compiler/recompute_instmap_deltas.m:
compiler/saved_vars.m:
compiler/simplify_goal_unify.m:
compiler/simplify_info.m:
compiler/simplify_proc.m:
compiler/size_prof.m:
compiler/ssdebug.m:
compiler/stack_alloc.m:
compiler/stack_layout.m:
compiler/stack_opt.m:
compiler/stm_expand.m:
compiler/store_alloc.m:
compiler/structure_reuse.analysis.m:
compiler/structure_reuse.direct.choose_reuse.m:
compiler/structure_reuse.direct.detect_garbage.m:
compiler/structure_reuse.indirect.m:
compiler/structure_reuse.lbu.m:
compiler/structure_reuse.lfu.m:
compiler/structure_sharing.analysis.m:
compiler/structure_sharing.domain.m:
compiler/switch_detection.m:
compiler/table_gen.m:
compiler/tabling_analysis.m:
compiler/term_constr_build.m:
compiler/term_constr_initial.m:
compiler/term_errors.m:
compiler/term_pass1.m:
compiler/term_pass2.m:
compiler/trace_gen.m:
compiler/trailing_analysis.m:
compiler/try_expand.m:
compiler/tupling.m:
compiler/unneeded_code.m:
compiler/untupling.m:
compiler/unused_args.m:
compiler/unused_imports.m:
    Conform to the change above.
2022-04-07 21:22:21 +10:00

375 lines
15 KiB
Mathematica

%---------------------------------------------------------------------------%
% vim: ft=mercury ts=4 sw=4 et
%---------------------------------------------------------------------------%
% Copyright (C) 1994-2012 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.
:- import_module hlds.code_model.
:- import_module hlds.hlds_goal.
:- import_module ll_backend.code_info.
:- import_module ll_backend.code_loc_dep.
:- import_module ll_backend.llds.
%---------------------------------------------------------------------------%
% Translate a HLDS goal to LLDS.
%
:- pred generate_goal(code_model::in, hlds_goal::in, llds_code::out,
code_info::in, code_info::out, code_loc_dep::in, code_loc_dep::out) is det.
%---------------------------------------------------------------------------%
%---------------------------------------------------------------------------%
:- implementation.
:- import_module hlds.goal_form.
:- import_module hlds.hlds_desc.
:- import_module hlds.hlds_pred.
:- import_module hlds.instmap.
:- import_module hlds.passes_aux.
:- import_module libs.
:- import_module libs.globals.
:- 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.opt_debug.
:- 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 ll_backend.unify_gen_construct.
:- import_module parse_tree.
:- import_module parse_tree.prog_data.
:- import_module parse_tree.prog_data_foreign.
:- import_module parse_tree.set_of_var.
:- import_module cord.
:- import_module int.
:- import_module io.
:- import_module list.
:- import_module map.
:- import_module maybe.
:- import_module require.
:- import_module set.
:- import_module string.
%---------------------------------------------------------------------------%
generate_goal(ContextModel, Goal, Code, !CI, !CLD) :-
% 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.
get_proc_info(!.CI, ProcInfo),
trace [compiletime(flag("codegen_goal")), io(!IO)] (
some [ModuleInfo, VarSet, GoalDesc] (
code_info.get_module_info(!.CI, ModuleInfo),
proc_info_get_varset_vartypes(ProcInfo, VarSet, _VarTypes),
GoalDesc = describe_goal(ModuleInfo, VarSet, Goal),
( if should_trace_code_gen(!.CI) then
get_debug_output_stream(ModuleInfo, DebugStream, !IO),
io.format(DebugStream, "\nGOAL START: %s\n",
[s(GoalDesc)], !IO),
io.flush_output(DebugStream, !IO)
else
true
)
)
),
% Make any changes to liveness before Goal.
get_forward_live_vars(!.CLD, ForwardLiveVarsBeforeGoal),
Goal = hlds_goal(GoalExpr, GoalInfo),
HasSubGoals = goal_expr_has_subgoals(GoalExpr),
pre_goal_update(GoalInfo, HasSubGoals, !CLD),
get_instmap(!.CLD, InstMap),
( if instmap_is_reachable(InstMap) then
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($pred, "semidet model in det context")
;
( ContextModel = model_semi
; ContextModel = model_non
)
)
;
CodeModel = model_non,
(
( ContextModel = model_det
; ContextModel = model_semi
),
unexpected($pred, "nondet model in det/semidet context")
;
ContextModel = model_non
)
),
generate_goal_expr(GoalExpr, GoalInfo, CodeModel,
ForwardLiveVarsBeforeGoal, GoalCode, !CI, !CLD),
Features = goal_info_get_features(GoalInfo),
% 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.
( if
set.member(feature_call_table_gen, Features),
proc_info_get_call_table_tip(ProcInfo, MaybeCallTableVar),
MaybeCallTableVar = yes(CallTableVar),
get_maybe_trace_info(!.CI, yes(_))
then
save_variables_on_stack([CallTableVar], TipSaveCode, !.CI, !CLD),
CodeUptoTip = GoalCode ++ TipSaveCode
else
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.)
( if set.member(feature_save_deep_excp_vars, Features) then
DeepSaveVars = compute_deep_save_excp_vars(ProcInfo),
save_variables_on_stack(DeepSaveVars, DeepSaveCode, !.CI, !CLD),
Code = CodeUptoTip ++ DeepSaveCode
else
Code = CodeUptoTip
),
% Make live any variables which subsequent goals will expect to be
% live, but were not generated.
set_instmap(InstMap, !CLD),
post_goal_update(GoalInfo, !.CI, !CLD)
else
Code = empty
),
trace [compiletime(flag("codegen_goal")), io(!IO)] (
some [ModuleInfo, VarSet, GoalDesc] (
code_info.get_module_info(!.CI, ModuleInfo),
proc_info_get_varset_vartypes(ProcInfo, VarSet, _VarTypes),
GoalDesc = describe_goal(ModuleInfo, VarSet, Goal),
( if should_trace_code_gen(!.CI) then
get_debug_output_stream(ModuleInfo, DebugStream, !IO),
Instrs = cord.list(Code),
io.format(DebugStream, "\nGOAL FINISH: %s\n",
[s(GoalDesc)], !IO),
write_instrs(DebugStream, Instrs, no, auto_comments, !IO),
io.flush_output(DebugStream, !IO)
else
true
)
)
).
:- 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),
( if
MaybeDeepProfInfo = yes(DeepProfInfo),
MaybeDeepLayout = DeepProfInfo ^ deep_layout,
MaybeDeepLayout = yes(DeepLayout)
then
ExcpVars = DeepLayout ^ deep_layout_excp,
ExcpVars = hlds_deep_excp_vars(TopCSDVar, MiddleCSDVar,
MaybeOldOutermostVar),
proc_info_get_stack_slots(ProcInfo, StackSlots),
( if map.search(StackSlots, TopCSDVar, _) then
% 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]
)
else
DeepSaveVars = []
)
else
unexpected($pred, "inconsistent proc_info")
).
%---------------------------------------------------------------------------%
:- pred generate_goal_expr(hlds_goal_expr::in, hlds_goal_info::in,
code_model::in, set_of_progvar::in, llds_code::out,
code_info::in, code_info::out, code_loc_dep::in, code_loc_dep::out) is det.
generate_goal_expr(GoalExpr, GoalInfo, CodeModel, ForwardLiveVarsBeforeGoal,
Code, !CI, !CLD) :-
(
GoalExpr = unify(_, _, _, Uni, _),
unify_gen.generate_unification(CodeModel, Uni, GoalInfo, Code,
!CI, !CLD)
;
GoalExpr = conj(ConjType, Goals),
(
ConjType = plain_conj,
generate_conj(Goals, CodeModel, cord.init, Code, !CI, !CLD)
;
ConjType = parallel_conj,
par_conj_gen.generate_par_conj(Goals, GoalInfo, CodeModel, Code,
!CI, !CLD)
)
;
GoalExpr = disj(Goals),
disj_gen.generate_disj(CodeModel, Goals, GoalInfo, Code, !CI, !CLD)
;
GoalExpr = negation(Goal),
ite_gen.generate_negation(CodeModel, Goal, GoalInfo, Code, !CI, !CLD)
;
GoalExpr = if_then_else(_Vars, Cond, Then, Else),
ite_gen.generate_ite(CodeModel, Cond, Then, Else, GoalInfo, Code,
!CI, !CLD)
;
GoalExpr = switch(Var, CanFail, CaseList),
switch_gen.generate_switch(CodeModel, Var, CanFail, CaseList, GoalInfo,
Code, !CI, !CLD)
;
GoalExpr = scope(Reason, SubGoal),
( if
Reason = from_ground_term(TermVar, from_ground_term_construct)
then
unify_gen_construct.generate_ground_term(TermVar, SubGoal,
!CI, !CLD),
Code = empty
else if
Reason = loop_control(LCVar, LCSVar, UseParentStack)
then
par_conj_gen.generate_lc_spawn_off(SubGoal, LCVar, LCSVar,
UseParentStack, Code, !CI, !CLD)
else
commit_gen.generate_scope(Reason, CodeModel, GoalInfo,
ForwardLiveVarsBeforeGoal, SubGoal, Code, !CI, !CLD)
)
;
GoalExpr = generic_call(GenericCall, Args, Modes, MaybeRegTypes, Det),
call_gen.generate_generic_call(CodeModel, GenericCall, Args,
Modes, MaybeRegTypes, Det, GoalInfo, Code, !CI, !CLD)
;
GoalExpr = plain_call(PredId, ProcId, Args, BuiltinState, _, _),
(
BuiltinState = not_builtin,
call_gen.generate_call(CodeModel, PredId, ProcId, Args, GoalInfo,
Code, !CI, !CLD)
;
BuiltinState = inline_builtin,
call_gen.generate_builtin(CodeModel, PredId, ProcId, Args,
Code, !CI, !CLD)
)
;
GoalExpr = call_foreign_proc(Attributes, PredId, ProcId,
Args, ExtraArgs, MaybeTraceRuntimeCond, PragmaCode),
Lang = get_foreign_language(Attributes),
(
Lang = lang_c,
generate_code_for_foreign_proc(CodeModel, Attributes,
PredId, ProcId, Args, ExtraArgs, MaybeTraceRuntimeCond,
PragmaCode, GoalInfo, Code, !CI, !CLD)
;
( Lang = lang_java
; Lang = lang_csharp
),
unexpected($pred, "foreign code other than C")
)
;
GoalExpr = shorthand(_),
% These should have been expanded out by now.
unexpected($pred, "shorthand")
).
%---------------------------------------------------------------------------%
% Generate a conjoined series of goals. State information flows directly
% from one conjunct to the next.
%
% We call generate_conj_inner to generate code for up to 1000 goals.
% If there are any more goals left after that, we let generate_conj_inner
% give up all its stack frames before calling it again. This allows us
% to generate code for *very* long sequences of goals even if the compiler
% is compiled in a grade that does not allow tail recursion.
%
:- pred generate_conj(list(hlds_goal)::in, code_model::in,
llds_code::in, llds_code::out,
code_info::in, code_info::out, code_loc_dep::in, code_loc_dep::out) is det.
generate_conj([], _, !Code, !CI, !CLD).
generate_conj(Goals @ [_ | _], CodeModel, !Code, !CI, !CLD) :-
generate_conj_inner(Goals, 1000, CodeModel, LeftOverGoals, !Code,
!CI, !CLD),
generate_conj(LeftOverGoals, CodeModel, !Code, !CI, !CLD).
:- pred generate_conj_inner(list(hlds_goal)::in, int::in, code_model::in,
list(hlds_goal)::out, llds_code::in, llds_code::out,
code_info::in, code_info::out, code_loc_dep::in, code_loc_dep::out) is det.
generate_conj_inner([], _, _, [], !Code, !CI, !CLD).
generate_conj_inner([Goal | Goals], N, CodeModel, LeftOverGoals, !Code,
!CI, !CLD) :-
( if N > 0 then
generate_goal(CodeModel, Goal, GoalCode, !CI, !CLD),
!:Code = !.Code ++ GoalCode,
get_instmap(!.CLD, Instmap),
( if instmap_is_unreachable(Instmap) then
LeftOverGoals = []
else
generate_conj_inner(Goals, N - 1, CodeModel, LeftOverGoals, !Code,
!CI, !CLD)
)
else
LeftOverGoals = [Goal | Goals]
).
%---------------------------------------------------------------------------%
:- end_module ll_backend.code_gen.
%---------------------------------------------------------------------------%