/usr/lib/swi-prolog/library/apply_macros.pl is in swi-prolog-nox 5.10.4-3ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* $Id$
Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@uva.nl
WWW: http://www.swi-prolog.org
Copyright (C): 1985-2009, University of Amsterdam
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
As a special exception, if you link this library with other files,
compiled with a Free Software compiler, to produce an executable, this
library does not by itself cause the resulting executable to be covered
by the GNU General Public License. This exception does not however
invalidate any other reasons why the executable file might be covered by
the GNU General Public License.
*/
:- module(apply_macros,
[
]).
:- use_module(library(lists)).
:- use_module(library(occurs)).
/** <module> Goal expansion rules to avoid meta-calling
This module defines goal_expansion/2 rules to deal with commonly used,
but fundamentally slow meta-predicates. Notable maplist/2... defines a
useful set of predicates, but its execution is considerable slower than
a traditional Prolog loop. Using this library calls to maplist/2... are
translated into an call to a generated auxilary predicate that is
compiled using compile_aux_clauses/1. Currently this module supports:
* maplist/2..
* forall/2
* once/1
* ignore/1
* phrase/2
* phrase/3
The idea for this library originates from ECLiPSe and came to SWI-Prolog
through YAP.
@tbd Support more predicates
@author Jan Wielemaker
*/
:- dynamic
user:goal_expansion/2.
:- multifile
user:goal_expansion/2.
%% expand_maplist(+Callable, +Lists, -Goal) is det.
%
% Macro expansion for maplist/2 and higher arity.
expand_maplist(Callable0, Lists, Goal) :-
( Callable0 = _:_
-> strip_module(Callable0, M, Callable),
NextGoal = M:NextCall
; Callable = Callable0,
NextGoal = NextCall
),
Callable =.. [Pred|Args],
length(Args, Argc),
length(Argv, Argc),
length(Lists, N),
length(Vars, N),
MapArity is N + 1,
format(atom(AuxName), '__aux_maplist/~d_~w+~d', [MapArity, Pred, Argc]),
append(Lists, Args, AuxArgs),
Goal =.. [AuxName|AuxArgs],
AuxArity is N+Argc,
prolog_load_context(module, Module),
( current_predicate(Module:AuxName/AuxArity)
-> true
; empty_lists(N, BaseLists),
length(Anon, Argc),
append(BaseLists, Anon, BaseArgs),
BaseClause =.. [AuxName|BaseArgs],
heads_and_tails(N, NextArgs, Vars, Tails),
append(NextArgs, Argv, AllNextArgs),
NextHead =.. [AuxName|AllNextArgs],
append(Argv, Vars, PredArgs),
NextCall =.. [Pred|PredArgs],
append(Tails, Argv, IttArgs),
NextIterate =.. [AuxName|IttArgs],
NextClause = (NextHead :- NextGoal, NextIterate),
( predicate_property(Module:NextGoal, transparent)
-> compile_aux_clauses([ (:- module_transparent(Module:AuxName/AuxArity)),
BaseClause,
NextClause
])
; compile_aux_clauses([BaseClause, NextClause])
)
).
empty_lists(0, []) :- !.
empty_lists(N, [[]|T]) :-
N2 is N - 1,
empty_lists(N2, T).
heads_and_tails(0, [], [], []).
heads_and_tails(N, [[H|T]|L1], [H|L2], [T|L3]) :-
N2 is N - 1,
heads_and_tails(N2, L1, L2, L3).
%% expand_apply(+GoalIn:callable, -GoalOut) is semidet.
%
% Macro expansion for `apply' predicates.
expand_apply(Maplist, Goal) :-
functor(Maplist, maplist, N),
N >= 2,
Maplist =.. [maplist, Callable|Lists],
qcall_instantiated(Callable), !,
expand_maplist(Callable, Lists, Goal).
expand_apply(forall(Cond, Action), \+((Cond, \+(Action)))).
expand_apply(once(Goal), (Goal->true;fail)).
expand_apply(ignore(Goal), (Goal->true;true)).
expand_apply(Phrase, Expanded) :-
expand_phrase(Phrase, Expanded), !.
expand_phrase(phrase(NT,Xs), NTXsNil) :- !,
expand_apply(phrase(NT,Xs,[]), NTXsNil).
expand_phrase(Goal, NewGoal) :-
Goal = phrase(NT,Xs0,Xs),
nonvar(NT),
catch(dcg_translate_rule((pseudo_nt --> NT), Rule),
error(Pat,ImplDep),
( \+ harmless_dcgexception(Pat),
throw(error(Pat,ImplDep))
)),
Rule = (pseudo_nt(Xs0c,Xsc) :- NewGoal0),
Goal \== NewGoal0,
\+ contains_illegal_dcgnt(NT), !, % apply translation only if we are safe
( var(Xsc), Xsc \== Xs0c
-> Xs = Xsc, NewGoal1 = NewGoal0
; NewGoal1 = (NewGoal0, Xsc = Xs)
),
( var(Xs0c)
-> Xs0 = Xs0c,
NewGoal = NewGoal1
; ( Xs0 = Xs0c, NewGoal1 ) = NewGoal
).
%% qcall_instantiated(@Term) is semidet.
%
% True if Term is instantiated sufficiently to call it.
%
% @tbd Shouldn't this be callable straight away?
qcall_instantiated(Var) :-
var(Var), !,
fail.
qcall_instantiated(M:C) :- !,
atom(M),
callable(C).
qcall_instantiated(C) :-
callable(C).
harmless_dcgexception(instantiation_error). % ex: phrase(([1],x:X,[3]),L)
harmless_dcgexception(type_error(callable,_)). % ex: phrase(27,L)
%% contains_illegal_dcgnt(+Term) is semidet.
%
% True if Term contains a non-terminal we cannot deal with using
% goal-expansion. The test is too general approximation, but safe.
contains_illegal_dcgnt(NT) :-
sub_term(I, NT),
nonvar(I),
( I = ! ; I = phrase(_,_,_) ), !.
% write(contains_illegal_nt(NT)), % JW: we do not want to write
% nl.
/*******************************
* ACTIVATE *
*******************************/
:- multifile
system:goal_expansion/2.
% @tbd Should we only apply if optimization is enabled (-O)?
system:goal_expansion(GoalIn, GoalOut) :-
\+ current_prolog_flag(xref, true),
expand_apply(GoalIn, GoalOut).
|