1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335
|
%-----------------------------------------------------------------------------%
% Copyright (C) 1999-2001 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: ml_util.m
% Main author: fjh, trd
% This module contains utility predicates for manipulating the MLDS.
%-----------------------------------------------------------------------------%
:- module ml_util.
:- interface.
:- import_module mlds.
:- import_module list, std_util.
%-----------------------------------------------------------------------------%
% return `true' if the statement is a tail call which
% can be optimized into a jump back to the start of the
% function
:- pred can_optimize_tailcall(mlds__qualified_entity_name, mlds__stmt).
:- mode can_optimize_tailcall(in, in) is semidet.
%-----------------------------------------------------------------------------%
%
% routines that deal with statements
%
% nondeterministically generates sub-statements from statements.
:- pred statements_contains_statement(mlds__statements, mlds__statement).
:- mode statements_contains_statement(in, out) is nondet.
:- pred statement_contains_statement(mlds__statement, mlds__statement).
:- mode statement_contains_statement(in, out) is multi.
:- pred stmt_contains_statement(mlds__stmt, mlds__statement).
:- mode stmt_contains_statement(in, out) is nondet.
%-----------------------------------------------------------------------------%
%
% routines that deal with definitions
%
% defn_contains_foreign_code(NativeTargetLang, Defn):
% Succeeds iff this definition contains target_code
% statements in a target language other than the
% specified native target language.
:- pred defn_contains_foreign_code(target_lang, mlds__defn).
:- mode defn_contains_foreign_code(in, in) is semidet.
% Succeeds iff this definition is a type definition.
:- pred defn_is_type(mlds__defn).
:- mode defn_is_type(in) is semidet.
% Succeeds iff this definition is a function definition.
:- pred defn_is_function(mlds__defn).
:- mode defn_is_function(in) is semidet.
% Succeeds iff this definition is a data definition which
% defines a type_ctor_info constant.
:- pred defn_is_type_ctor_info(mlds__defn).
:- mode defn_is_type_ctor_info(in) is semidet.
% Succeeds iff this definition is a data definition which
% defines a variable whose type is mlds__commit_type.
:- pred defn_is_commit_type_var(mlds__defn).
:- mode defn_is_commit_type_var(in) is semidet.
% Succeeds iff this definition has `public' in the access
% field in its decl_flags.
:- pred defn_is_public(mlds__defn).
:- mode defn_is_public(in) is semidet.
%-----------------------------------------------------------------------------%
%
% routines that deal with lvals/rvals
%
%
% initializer_contains_var:
% rvals_contains_var:
% maybe_rval_contains_var:
% rval_contains_var:
% lvals_contains_var:
% lval_contains_var:
% Succeeds iff the specified construct contains a reference to
% the specified variable.
%
:- pred initializer_contains_var(mlds__initializer, mlds__var).
:- mode initializer_contains_var(in, in) is semidet.
:- pred rvals_contains_var(list(mlds__rval), mlds__var).
:- mode rvals_contains_var(in, in) is semidet.
:- pred maybe_rval_contains_var(maybe(mlds__rval), mlds__var).
:- mode maybe_rval_contains_var(in, in) is semidet.
:- pred rval_contains_var(mlds__rval, mlds__var).
:- mode rval_contains_var(in, in) is semidet.
:- pred lvals_contains_var(list(mlds__lval), mlds__var).
:- mode lvals_contains_var(in, in) is semidet.
:- pred lval_contains_var(mlds__lval, mlds__var).
:- mode lval_contains_var(in, in) is semidet.
%-----------------------------------------------------------------------------%
%-----------------------------------------------------------------------------%
:- implementation.
:- import_module rtti.
:- import_module bool, list, std_util.
%-----------------------------------------------------------------------------%
can_optimize_tailcall(Name, Call) :-
Call = call(_Signature, FuncRval, MaybeObject, _CallArgs,
_Results, IsTailCall),
%
% check if this call can be optimized as a tail call
%
IsTailCall = tail_call,
%
% check if the callee adddress is the same as
% the caller
%
FuncRval = const(code_addr_const(CodeAddr)),
(
CodeAddr = proc(QualifiedProcLabel, _Sig),
MaybeSeqNum = no
;
CodeAddr = internal(QualifiedProcLabel, SeqNum, _Sig),
MaybeSeqNum = yes(SeqNum)
),
QualifiedProcLabel = qual(ModuleName, PredLabel - ProcId),
% check that the module name matches
Name = qual(ModuleName, FuncName),
% check that the PredLabel, ProcId, and MaybeSeqNum match
FuncName = function(PredLabel, ProcId, MaybeSeqNum, _),
%
% In C++, `this' is a constant, so our usual technique
% of assigning the arguments won't work if it is a
% member function. Thus we don't do this optimization
% if we're optimizing a member function call
%
MaybeObject = no.
%-----------------------------------------------------------------------------%
%
% routines that deal with statements
%
statements_contains_statement(Statements, SubStatement) :-
list__member(Statement, Statements),
statement_contains_statement(Statement, SubStatement).
:- pred maybe_statement_contains_statement(maybe(mlds__statement),
mlds__statement).
:- mode maybe_statement_contains_statement(in, out) is nondet.
maybe_statement_contains_statement(no, _Statement) :- fail.
maybe_statement_contains_statement(yes(Statement), SubStatement) :-
statement_contains_statement(Statement, SubStatement).
statement_contains_statement(Statement, Statement).
statement_contains_statement(Statement, SubStatement) :-
Statement = mlds__statement(Stmt, _Context),
stmt_contains_statement(Stmt, SubStatement).
stmt_contains_statement(Stmt, SubStatement) :-
(
Stmt = block(_Defns, Statements),
statements_contains_statement(Statements, SubStatement)
;
Stmt = while(_Rval, Statement, _Once),
statement_contains_statement(Statement, SubStatement)
;
Stmt = if_then_else(_Cond, Then, MaybeElse),
( statement_contains_statement(Then, SubStatement)
; maybe_statement_contains_statement(MaybeElse, SubStatement)
)
;
Stmt = switch(_Type, _Val, _Range, Cases, Default),
( cases_contains_statement(Cases, SubStatement)
; default_contains_statement(Default, SubStatement)
)
;
Stmt = label(_Label),
fail
;
Stmt = goto(_),
fail
;
Stmt = computed_goto(_Rval, _Labels),
fail
;
Stmt = call(_Sig, _Func, _Obj, _Args, _RetLvals, _TailCall),
fail
;
Stmt = return(_Rvals),
fail
;
Stmt = do_commit(_Ref),
fail
;
Stmt = try_commit(_Ref, Statement, Handler),
( statement_contains_statement(Statement, SubStatement)
; statement_contains_statement(Handler, SubStatement)
)
;
Stmt = atomic(_AtomicStmt),
fail
).
:- pred cases_contains_statement(list(mlds__switch_case), mlds__statement).
:- mode cases_contains_statement(in, out) is nondet.
cases_contains_statement(Cases, SubStatement) :-
list__member(Case, Cases),
Case = _MatchCond - Statement,
statement_contains_statement(Statement, SubStatement).
:- pred default_contains_statement(mlds__switch_default, mlds__statement).
:- mode default_contains_statement(in, out) is nondet.
default_contains_statement(default_do_nothing, _) :- fail.
default_contains_statement(default_is_unreachable, _) :- fail.
default_contains_statement(default_case(Statement), SubStatement) :-
statement_contains_statement(Statement, SubStatement).
%-----------------------------------------------------------------------------%
%
% routines that deal with definitions
%
defn_contains_foreign_code(NativeTargetLang, Defn) :-
Defn = mlds__defn(_Name, _Context, _Flags, Body),
Body = function(_, _, yes(FunctionBody)),
statement_contains_statement(FunctionBody, Statement),
Statement = mlds__statement(Stmt, _),
Stmt = atomic(target_code(TargetLang, _)),
TargetLang \= NativeTargetLang.
defn_is_type(Defn) :-
Defn = mlds__defn(Name, _Context, _Flags, _Body),
Name = type(_, _).
defn_is_function(Defn) :-
Defn = mlds__defn(Name, _Context, _Flags, _Body),
Name = function(_, _, _, _).
defn_is_type_ctor_info(Defn) :-
Defn = mlds__defn(_Name, _Context, _Flags, Body),
Body = mlds__data(Type, _),
Type = mlds__rtti_type(RttiName),
RttiName = type_ctor_info.
defn_is_commit_type_var(Defn) :-
Defn = mlds__defn(_Name, _Context, _Flags, Body),
Body = mlds__data(Type, _),
Type = mlds__commit_type.
defn_is_public(Defn) :-
Defn = mlds__defn(_Name, _Context, Flags, _Body),
access(Flags) \= private.
%-----------------------------------------------------------------------------%
%
% routines that deal with lvals/rvals
%
%
% initializer_contains_var:
% rvals_contains_var:
% maybe_rval_contains_var:
% rval_contains_var:
% lvals_contains_var:
% lval_contains_var:
% Succeeds iff the specified construct contains a reference to
% the specified variable.
%
% initializer_contains_var(no_initializer, _) :- fail.
initializer_contains_var(init_obj(Rval), Name) :-
rval_contains_var(Rval, Name).
initializer_contains_var(init_struct(Inits), Name) :-
list__member(Init, Inits),
initializer_contains_var(Init, Name).
initializer_contains_var(init_array(Inits), Name) :-
list__member(Init, Inits),
initializer_contains_var(Init, Name).
rvals_contains_var(Rvals, Name) :-
list__member(Rval, Rvals),
rval_contains_var(Rval, Name).
% maybe_rval_contains_var(no, _Name) :- fail.
maybe_rval_contains_var(yes(Rval), Name) :-
rval_contains_var(Rval, Name).
rval_contains_var(lval(Lval), Name) :-
lval_contains_var(Lval, Name).
rval_contains_var(mkword(_Tag, Rval), Name) :-
rval_contains_var(Rval, Name).
% rval_contains_var(const(_Const), _Name) :- fail.
rval_contains_var(unop(_Op, Rval), Name) :-
rval_contains_var(Rval, Name).
rval_contains_var(binop(_Op, X, Y), Name) :-
( rval_contains_var(X, Name)
; rval_contains_var(Y, Name)
).
rval_contains_var(mem_addr(Lval), Name) :-
lval_contains_var(Lval, Name).
lvals_contains_var(Lvals, Name) :-
list__member(Lval, Lvals),
lval_contains_var(Lval, Name).
lval_contains_var(field(_MaybeTag, Rval, _FieldId, _, _), Name) :-
rval_contains_var(Rval, Name).
lval_contains_var(mem_ref(Rval, _Type), Name) :-
rval_contains_var(Rval, Name).
lval_contains_var(var(Name), Name). /* this is where we can succeed! */
%-----------------------------------------------------------------------------%
|