Files
mercury/compiler/add_mode.m
Zoltan Somogyi b54ab42d70 A simple tool for performing substitutions on the source files of the
Estimated hours taken: 0.5
Branches: main

tools/subst:
	A simple tool for performing substitutions on the source files of the
	compiler.

compiler/*.m:
	Change the names of the get predicates operating on module_infos to
	include "get" in the name, for uniformity. This was done mostly by
	the following sed script, with some manual cleanup afterwards to reduce
	excessive line lengths.

s/module_info_types/module_info_get_type_table/
s/module_info_set_types/module_info_set_type_table/
s/module_info_insts/module_info_get_inst_table/
s/module_info_set_insts/module_info_set_inst_table/
s/module_info_modes/module_info_get_mode_table/
s/module_info_set_modes/module_info_set_mode_table/
s/module_info_ctors/module_info_get_cons_table/
s/module_info_set_ctors/module_info_set_cons_table/
s/module_info_classes/module_info_get_class_table/
s/module_info_set_classes/module_info_set_class_table/
s/module_info_instances/module_info_get_instance_table/
s/module_info_set_instances/module_info_set_instance_table/
s/module_info_superclasses/module_info_get_superclass_table/
s/module_info_set_superclasses/module_info_set_superclass_table/
s/module_info_assertion_table/module_info_get_assertion_table/
s/module_info_exclusive_table/module_info_get_exclusive_table/
s/module_info_ctor_field_table/module_info_get_ctor_field_table/
s/module_info_name/module_info_get_name/
s/module_info_globals/module_info_get_globals/
s/module_info_contains_foreign_types/module_info_get_contains_foreign_types/
s/module_info_num_errors/module_info_get_num_errors/
s/module_info_type_ctor_gen_infos/module_info_get_type_ctor_gen_infos/
s/module_info_stratified_preds/module_info_get_stratified_preds/
s/module_info_unused_arg_info/module_info_get_unused_arg_info/
s/module_info_exception_info/module_info_get_exception_info/
s/module_info_type_spec_info/module_info_get_type_spec_info/
s/module_info_no_tag_types/module_info_get_no_tag_types/
s/module_info_analysis_info/module_info_get_analysis_info/
s/module_info_aditi_top_down_procs/module_info_get_aditi_top_down_procs/
2005-09-30 08:08:49 +00:00

220 lines
8.4 KiB
Mathematica

%-----------------------------------------------------------------------------%
% vim: ft=mercury ts=4 sw=4 et
%-----------------------------------------------------------------------------%
% Copyright (C) 1993-2005 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.
%-----------------------------------------------------------------------------%
%
% This submodule of make_hlds handles the declarations of new insts and modes.
:- module hlds__make_hlds__add_mode.
:- interface.
:- import_module hlds__hlds_module.
:- import_module hlds__make_hlds__make_hlds_passes.
:- import_module mdbcomp__prim_data.
:- import_module parse_tree__prog_data.
:- import_module bool.
:- import_module io.
:- import_module list.
:- pred module_add_inst_defn(inst_varset::in, sym_name::in, list(inst_var)::in,
inst_defn::in, condition::in, prog_context::in, item_status::in,
module_info::in, module_info::out, bool::out, io::di, io::uo) is det.
:- pred module_add_mode_defn(inst_varset::in, sym_name::in, list(inst_var)::in,
mode_defn::in, condition::in, prog_context::in, item_status::in,
module_info::in, module_info::out, bool::out, io::di, io::uo) is det.
:- implementation.
:- import_module hlds__hlds_data.
:- import_module hlds__hlds_pred.
:- import_module hlds__make_hlds__make_hlds_error.
:- import_module parse_tree__error_util.
:- import_module parse_tree__prog_mode.
:- import_module map.
:- import_module require.
:- import_module std_util.
:- import_module string.
module_add_inst_defn(VarSet, Name, Args, InstDefn, Cond, Context,
item_status(Status, _NeedQual), !ModuleInfo, InvalidMode, !IO) :-
%
% Add the definition of this inst to the HLDS inst table.
%
module_info_get_inst_table(!.ModuleInfo, InstTable0),
inst_table_get_user_insts(InstTable0, Insts0),
insts_add(VarSet, Name, Args, InstDefn, Cond, Context, Status,
Insts0, Insts, !IO),
inst_table_set_user_insts(Insts, InstTable0, InstTable),
module_info_set_inst_table(InstTable, !ModuleInfo),
%
% check if the inst is infinitely recursive (at the top level)
%
Arity = list__length(Args),
InstId = Name - Arity,
TestArgs = list__duplicate(Arity, not_reached),
check_for_cyclic_inst(Insts, InstId, InstId, TestArgs, [], Context,
InvalidMode, !IO).
:- pred insts_add(inst_varset::in, sym_name::in,
list(inst_var)::in, inst_defn::in, condition::in, prog_context::in,
import_status::in, user_inst_table::in, user_inst_table::out,
io::di, io::uo) is det.
insts_add(_, _, _, abstract_inst, _, _, _, !Insts, !IO) :-
% XXX handle abstract insts
error("sorry, abstract insts not implemented").
insts_add(VarSet, Name, Args, eqv_inst(Body), _Cond, Context, Status, !Insts,
!IO) :-
list__length(Args, Arity),
(
I = hlds_inst_defn(VarSet, Args, eqv_inst(Body), Context, Status),
user_inst_table_insert(Name - Arity, I, !Insts)
->
true
;
% If abstract insts are implemented, this will need to change
% to update the hlds_inst_defn to the non-abstract inst.
% XXX we should record each error using
% module_info_incr_errors
user_inst_table_get_inst_defns(!.Insts, InstDefns),
map__lookup(InstDefns, Name - Arity, OrigI),
OrigI = hlds_inst_defn(_, _, _, OrigContext, _),
multiple_def_error(Status, Name, Arity, "inst", Context, OrigContext,
_, !IO)
).
% Check if the inst is infinitely recursive (at the top level).
%
:- pred check_for_cyclic_inst(user_inst_table::in, inst_id::in, inst_id::in,
list(inst)::in, list(inst_id)::in, prog_context::in, bool::out,
io::di, io::uo) is det.
check_for_cyclic_inst(UserInstTable, OrigInstId, InstId0, Args0, Expansions0,
Context, InvalidMode, !IO) :-
( list__member(InstId0, Expansions0) ->
report_circular_equiv_error("inst", OrigInstId, InstId0, Expansions0,
Context, !IO),
InvalidMode = yes
;
user_inst_table_get_inst_defns(UserInstTable, InstDefns),
(
map__search(InstDefns, InstId0, InstDefn),
InstDefn = hlds_inst_defn(_, Params, Body, _, _),
Body = eqv_inst(EqvInst0),
inst_substitute_arg_list(EqvInst0, Params, Args0, EqvInst),
EqvInst = defined_inst(user_inst(Name, Args))
->
Arity = list__length(Args),
InstId = Name - Arity,
Expansions = [InstId0 | Expansions0],
check_for_cyclic_inst(UserInstTable, OrigInstId, InstId, Args,
Expansions, Context, InvalidMode, !IO)
;
InvalidMode = no
)
).
%-----------------------------------------------------------------------------%
module_add_mode_defn(VarSet, Name, Params, ModeDefn, Cond, Context,
item_status(Status, _NeedQual), !ModuleInfo, InvalidMode, !IO) :-
module_info_get_mode_table(!.ModuleInfo, Modes0),
modes_add(VarSet, Name, Params, ModeDefn, Cond, Context, Status,
Modes0, Modes, InvalidMode, !IO),
module_info_set_mode_table(Modes, !ModuleInfo).
:- pred modes_add(inst_varset::in, sym_name::in, list(inst_var)::in,
mode_defn::in, condition::in, prog_context::in, import_status::in,
mode_table::in, mode_table::out, bool::out, io::di, io::uo) is det.
modes_add(VarSet, Name, Args, eqv_mode(Body), _Cond, Context, Status,
!Modes, InvalidMode, !IO) :-
list__length(Args, Arity),
ModeId = Name - Arity,
(
I = hlds_mode_defn(VarSet, Args, eqv_mode(Body), Context, Status),
mode_table_insert(ModeId, I, !Modes)
->
true
;
mode_table_get_mode_defns(!.Modes, ModeDefns),
map__lookup(ModeDefns, ModeId, OrigI),
OrigI = hlds_mode_defn(_, _, _, OrigContext, _),
% XXX we should record each error using
% module_info_incr_errors
multiple_def_error(Status, Name, Arity, "mode", Context, OrigContext,
_, !IO)
),
check_for_cyclic_mode(!.Modes, ModeId, ModeId, [], Context, InvalidMode,
!IO).
% Check if the mode is infinitely recursive at the top level.
%
:- pred check_for_cyclic_mode(mode_table::in, mode_id::in, mode_id::in,
list(mode_id)::in, prog_context::in, bool::out, io::di, io::uo) is det.
check_for_cyclic_mode(ModeTable, OrigModeId, ModeId0, Expansions0, Context,
InvalidMode, !IO) :-
( list__member(ModeId0, Expansions0) ->
report_circular_equiv_error("mode", OrigModeId, ModeId0,
Expansions0, Context, !IO),
InvalidMode = yes
;
mode_table_get_mode_defns(ModeTable, ModeDefns),
(
map__search(ModeDefns, ModeId0, ModeDefn),
ModeDefn = hlds_mode_defn(_, _, Body, _, _),
Body = eqv_mode(EqvMode),
EqvMode = user_defined_mode(Name, Args)
->
Arity = list__length(Args),
ModeId = Name - Arity,
Expansions = [ModeId0 | Expansions0],
check_for_cyclic_mode(ModeTable, OrigModeId, ModeId, Expansions,
Context, InvalidMode, !IO)
;
InvalidMode = no
)
).
:- type id == pair(sym_name, arity).
:- pred report_circular_equiv_error(string::in, id::in, id::in, list(id)::in,
prog_context::in, io::di, io::uo) is det.
report_circular_equiv_error(Kind, OrigId, Id, Expansions, Context, !IO) :-
( Id = OrigId ->
%
% Report an error message of the form
% Error: circular equivalence <kind> foo/0.
% or
% Error: circular equivalence <kind>s foo/0 and bar/1.
% or
% Error: circular equivalence <kind>s foo/0, bar/1,
% and baz/2.
% where <kind> is either "inst" or "mode".
%
Kinds = (if Expansions = [_] then Kind else Kind ++ "s"),
ExpansionPieces = list__map(
(func(SymName - Arity) =
sym_name_and_arity(SymName / Arity)),
Expansions),
Pieces = [words("Error: circular equivalence"), fixed(Kinds)]
++ component_list_to_pieces(ExpansionPieces) ++ [suffix(".")],
error_util__write_error_pieces(Context, 0, Pieces, !IO),
io__set_exit_status(1, !IO)
;
% We have an inst `OrigId' which is not itself circular,
% but which is defined in terms of `Id' which is circular.
% Don't bother reporting it now -- it have already been
% reported when we processed the definition of Id.
true
).