Files
mercury/compiler/goal_path.m
Zoltan Somogyi 9551640f55 Import only one compiler module per line. Sort the blocks of imports.
Estimated hours taken: 2
Branches: main

compiler/*.m:
	Import only one compiler module per line. Sort the blocks of imports.
	This makes it easier to merge in changes.

	In a couple of places, remove unnecessary imports.
2003-03-15 03:09:14 +00:00

129 lines
4.6 KiB
Mathematica

%-----------------------------------------------------------------------------%
% Copyright (C) 1997-2003 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.
%-----------------------------------------------------------------------------%
% This module looks after goal paths, which associate each goal
% with its position in a procedure definition,
% Main author: zs.
:- module check_hlds__goal_path.
:- interface.
:- import_module hlds__hlds_module.
:- import_module hlds__hlds_pred.
:- pred goal_path__fill_slots(proc_info::in, module_info::in, proc_info::out)
is det.
:- implementation.
:- import_module check_hlds__type_util.
:- import_module hlds__hlds_data.
:- import_module hlds__hlds_goal.
:- import_module parse_tree__prog_data.
:- import_module char, int, list, map, std_util, require.
:- type slot_info
---> slot_info(
vartypes,
module_info
).
goal_path__fill_slots(Proc0, ModuleInfo, Proc) :-
% The ModuleInfo argument is there just for passes_aux
proc_info_goal(Proc0, Goal0),
proc_info_vartypes(Proc0, VarTypes),
SlotInfo = slot_info(VarTypes, ModuleInfo),
fill_goal_slots(Goal0, [], SlotInfo, Goal),
proc_info_set_goal(Proc0, Goal, Proc).
:- pred fill_goal_slots(hlds_goal::in, goal_path::in, slot_info::in,
hlds_goal::out) is det.
fill_goal_slots(Expr0 - Info0, Path0, SlotInfo, Expr - Info) :-
goal_info_set_goal_path(Info0, Path0, Info),
fill_expr_slots(Expr0, Info, Path0, SlotInfo, Expr).
:- pred fill_expr_slots(hlds_goal_expr::in, hlds_goal_info::in, goal_path::in,
slot_info::in, hlds_goal_expr::out) is det.
fill_expr_slots(conj(Goals0), _, Path0, SlotInfo, conj(Goals)) :-
fill_conj_slots(Goals0, Path0, 0, SlotInfo, Goals).
fill_expr_slots(par_conj(Goals0), _, Path0, SlotInfo,
par_conj(Goals)) :-
fill_conj_slots(Goals0, Path0, 0, SlotInfo, Goals).
fill_expr_slots(disj(Goals0), _, Path0, SlotInfo, disj(Goals)) :-
fill_disj_slots(Goals0, Path0, 0, SlotInfo, Goals).
fill_expr_slots(switch(Var, B, Cases0), _, Path0, SlotInfo,
switch(Var, B, Cases)) :-
SlotInfo = slot_info(VarTypes, ModuleInfo),
map__lookup(VarTypes, Var, Type),
(
type_util__switch_type_num_functors(ModuleInfo, Type,
NumFunctors)
->
NumCases = NumFunctors
;
NumCases = -1
),
fill_switch_slots(Cases0, Path0, 0, NumCases, SlotInfo, Cases).
fill_expr_slots(not(Goal0), _, Path0, SlotInfo, not(Goal)) :-
fill_goal_slots(Goal0, [neg | Path0], SlotInfo, Goal).
fill_expr_slots(some(A, B, Goal0), OuterInfo, Path0, SlotInfo,
some(A, B, Goal)) :-
Goal0 = _ - InnerInfo,
goal_info_get_determinism(OuterInfo, OuterDetism),
goal_info_get_determinism(InnerInfo, InnerDetism),
( InnerDetism = OuterDetism ->
MaybeCut = no_cut
;
MaybeCut = cut
),
fill_goal_slots(Goal0, [exist(MaybeCut) | Path0], SlotInfo, Goal).
fill_expr_slots(if_then_else(A, Cond0, Then0, Else0), _, Path0, SlotInfo,
if_then_else(A, Cond, Then, Else)) :-
fill_goal_slots(Cond0, [ite_cond | Path0], SlotInfo, Cond),
fill_goal_slots(Then0, [ite_then | Path0], SlotInfo, Then),
fill_goal_slots(Else0, [ite_else | Path0], SlotInfo, Else).
fill_expr_slots(call(A,B,C,D,E,F), _, _, _, call(A,B,C,D,E,F)).
fill_expr_slots(generic_call(A,B,C,D), _, _, _, generic_call(A,B,C,D)).
fill_expr_slots(unify(A,B,C,D,E), _, _, _, unify(A,B,C,D,E)).
fill_expr_slots(foreign_proc(A,B,C,D,E,F,G), _, _, _,
foreign_proc(A,B,C,D,E,F,G)).
fill_expr_slots(shorthand(_), _, _, _, _) :-
% these should have been expanded out by now
error("fill_expr_slots: unexpected shorthand").
:- pred fill_conj_slots(list(hlds_goal)::in, goal_path::in, int::in,
slot_info::in, list(hlds_goal)::out) is det.
fill_conj_slots([], _, _, _, []).
fill_conj_slots([Goal0 | Goals0], Path0, N0, SlotInfo, [Goal | Goals]) :-
N1 = N0 + 1,
fill_goal_slots(Goal0, [conj(N1) | Path0], SlotInfo, Goal),
fill_conj_slots(Goals0, Path0, N1, SlotInfo, Goals).
:- pred fill_disj_slots(list(hlds_goal)::in, goal_path::in, int::in,
slot_info::in, list(hlds_goal)::out) is det.
fill_disj_slots([], _, _, _, []).
fill_disj_slots([Goal0 | Goals0], Path0, N0, SlotInfo, [Goal | Goals]) :-
N1 = N0 + 1,
fill_goal_slots(Goal0, [disj(N1) | Path0], SlotInfo, Goal),
fill_disj_slots(Goals0, Path0, N1, SlotInfo, Goals).
:- pred fill_switch_slots(list(case)::in, goal_path::in, int::in, int::in,
slot_info::in, list(case)::out) is det.
fill_switch_slots([], _, _, _, _, []).
fill_switch_slots([case(A, Goal0) | Cases0], Path0, N0, NumCases, SlotInfo,
[case(A, Goal) | Cases]) :-
N1 = N0 + 1,
fill_goal_slots(Goal0, [switch(N1, NumCases) | Path0], SlotInfo, Goal),
fill_switch_slots(Cases0, Path0, N1, NumCases, SlotInfo, Cases).