/usr/lib/swi-prolog/library/prolog_stack.pl is in swi-prolog-nox 7.2.3-2.
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 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 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 | /* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (C): 1985-2014, University of Amsterdam
VU University 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 Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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(prolog_stack,
[ get_prolog_backtrace/2, % +MaxDepth, -Stack
get_prolog_backtrace/3, % +Frame, +MaxDepth, -Stack
prolog_stack_frame_property/2, % +Frame, ?Property
print_prolog_backtrace/2, % +Stream, +Stack
print_prolog_backtrace/3, % +Stream, +Stack, +Options
backtrace/1 % +MaxDepth
]).
:- use_module(library(prolog_clause)).
:- use_module(library(debug)).
:- use_module(library(error)).
:- use_module(library(lists)).
:- use_module(library(option)).
:- dynamic stack_guard/1.
:- multifile stack_guard/1.
:- predicate_options(print_prolog_backtrace/3, 3,
[ subgoal_positions(boolean)
]).
/** <module> Examine the Prolog stack
This module defines high-level primitives for examining the Prolog
stack, primarily intended to support debugging. It provides the
following functionality:
* get_prolog_backtrace/2 gets a Prolog representation of the
Prolog stack. This can be used for printing, but also to enrich
exceptions using prolog_exception_hook/4. Decorating exceptions
is provided by this library and controlled by the hook
stack_guard/1.
* print_prolog_backtrace/2 prints a backtrace as returned by
get_prolog_backtrace/2
* The shorthand backtrace/1 fetches and prints a backtrace.
This library may be enabled by default to improve interactive debugging,
for example by adding the lines below to your ~/swiplrc (swipl.ini in
Windows) to decorate uncaught exceptions:
==
:- load_files(library(prolog_stack), [silent(true)]).
prolog_stack:stack_guard(none).
==
@bug Use of this library may negatively impact performance of
applications that process (error-)exceptions frequently
as part of their normal processing.
*/
:- create_prolog_flag(backtrace_depth, 20, [type(integer)]).
:- create_prolog_flag(backtrace_goal_depth, 2, [type(integer)]).
:- create_prolog_flag(backtrace_show_lines, true, [type(boolean)]).
%% get_prolog_backtrace(+MaxDepth, -Backtrace) is det.
%% get_prolog_backtrace(+MaxDepth, -Backtrace, +Options) is det.
%
% Obtain a backtrace from the current location. The backtrace is a
% list of frames. Each frame is an opaque term that can be
% inspected using the predicate prolog_stack_frame_property/2 can
% be used to extract information from these frames. Most use
% scenarios will pass the stack to print_prolog_backtrace/2. The
% following options are provided:
%
% * frame(Frame)
% Start at Frame instead of the current frame.
% * goal_depth(+Depth)
% If Depth > 0, include a shallow copy of the goal arguments
% into the stack. Default is set by the Prolog flag
% =backtrace_goal_depth=, set to =2= initially, showing the
% goal and toplevel of any argument.
%
% @param Frame is the frame to start from. See prolog_current_frame/1.
% @param MaxDepth defines the maximum number of frames returned.
% @compat get_prolog_backtrace/3 used to have the parameters
% +Frame, +MaxDepth, -Backtrace. A call that matches this
% signature is mapped to get_prolog_backtrace(MaxDepth, Backtrace,
% [frame(Frame)]).
get_prolog_backtrace(MaxDepth, Stack) :-
get_prolog_backtrace(MaxDepth, Stack, []).
get_prolog_backtrace(Fr, MaxDepth, Stack) :-
integer(Fr), integer(MaxDepth), var(Stack), !,
get_prolog_backtrace_lc(MaxDepth, Stack, [frame(Fr)]),
nlc.
get_prolog_backtrace(MaxDepth, Stack, Options) :-
get_prolog_backtrace_lc(MaxDepth, Stack, Options),
nlc. % avoid last-call-optimization, such that
% the top of the stack is always a nice Prolog
% frame
nlc.
get_prolog_backtrace_lc(MaxDepth, Stack, Options) :-
( option(frame(Fr), Options)
-> PC = call
; prolog_current_frame(Fr0),
prolog_frame_attribute(Fr0, pc, PC),
prolog_frame_attribute(Fr0, parent, Fr)
),
( option(goal_term_depth(GoalDepth), Options)
-> true
; current_prolog_flag(backtrace_goal_depth, GoalDepth)
),
must_be(nonneg, GoalDepth),
backtrace(MaxDepth, Fr, PC, GoalDepth, Stack).
backtrace(0, _, _, _, []) :- !.
backtrace(MaxDepth, Fr, PC, GoalDepth,
[frame(Level, Where, Goal)|Stack]) :-
prolog_frame_attribute(Fr, level, Level),
( PC == foreign
-> prolog_frame_attribute(Fr, predicate_indicator, Pred),
Where = foreign(Pred)
; PC == call
-> prolog_frame_attribute(Fr, predicate_indicator, Pred),
Where = call(Pred)
; prolog_frame_attribute(Fr, clause, Clause)
-> Where = clause(Clause, PC)
; Where = meta_call
),
( Where == meta_call
-> Goal = 0
; copy_goal(GoalDepth, Fr, Goal)
),
( prolog_frame_attribute(Fr, pc, PC2)
-> true
; PC2 = foreign
),
( prolog_frame_attribute(Fr, parent, Parent),
( prolog_frame_attribute(Parent, predicate_indicator, PI),
PI \= '$toplevel':_
; current_prolog_flag(break_level, Break),
Break >= 1
)
-> D2 is MaxDepth - 1,
backtrace(D2, Parent, PC2, GoalDepth, Stack)
; Stack = []
).
%% copy_goal(+TermDepth, +Frame, -Goal) is det.
%
% Create a shallow copy of the frame's goal to help debugging. In
% addition to shallow copying, high-arity terms are represented
% as below. Currently the 16 first arguments are hardcoded.
%
% ==
% name(A1, ..., A16, <skipped Skipped of Arity>, An)
% ==
copy_goal(0, _, 0) :- !. % 0 is not a valid goal
copy_goal(D, Fr, Goal) :-
prolog_frame_attribute(Fr, goal, Goal0),
( Goal0 = Module:Goal1
-> copy_term_limit(D, Goal1, Goal2),
( hidden_module(Module)
-> Goal = Goal2
; Goal = Module:Goal2
)
; copy_term_limit(D, Goal0, Goal)
).
hidden_module(system).
hidden_module(user).
copy_term_limit(0, In, '...') :-
compound(In), !.
copy_term_limit(N, In, Out) :-
is_dict(In), !,
dict_pairs(In, Tag, PairsIn),
N2 is N - 1,
MaxArity = 16,
copy_pairs(PairsIn, N2, MaxArity, PairsOut),
dict_pairs(Out, Tag, PairsOut).
copy_term_limit(N, In, Out) :-
compound(In), !,
compound_name_arity(In, Functor, Arity),
N2 is N - 1,
MaxArity = 16,
( Arity =< MaxArity
-> compound_name_arity(Out, Functor, Arity),
copy_term_args(0, Arity, N2, In, Out)
; OutArity is MaxArity+2,
compound_name_arity(Out, Functor, OutArity),
copy_term_args(0, MaxArity, N2, In, Out),
SkipArg is MaxArity+1,
Skipped is Arity - MaxArity - 1,
format(atom(Msg), '<skipped ~D of ~D>', [Skipped, Arity]),
arg(SkipArg, Out, Msg),
arg(Arity, In, InA),
arg(OutArity, Out, OutA),
copy_term_limit(N2, InA, OutA)
).
copy_term_limit(_, In, Out) :-
copy_term_nat(In, Out).
copy_term_args(I, Arity, Depth, In, Out) :-
I < Arity, !,
I2 is I + 1,
arg(I2, In, InA),
arg(I2, Out, OutA),
copy_term_limit(Depth, InA, OutA),
copy_term_args(I2, Arity, Depth, In, Out).
copy_term_args(_, _, _, _, _).
copy_pairs([], _, _, []) :- !.
copy_pairs(Pairs, _, 0, ['<skipped>'-Skipped]) :- !,
length(Pairs, Skipped).
copy_pairs([K-V0|T0], N, MaxArity, [K-V|T]) :-
copy_term_limit(N, V0, V),
MaxArity1 is MaxArity - 1,
copy_pairs(T0, N, MaxArity1, T).
%% prolog_stack_frame_property(+Frame, ?Property) is nondet.
%
% True when Property is a property of Frame. Frame is an element
% of a stack-trace as produced by get_prolog_backtrace/2. Defined
% properties are:
%
% * level(Level)
% * predicate(PI)
% * location(File:Line)
prolog_stack_frame_property(frame(Level,_,_), level(Level)).
prolog_stack_frame_property(frame(_,Where,_), predicate(PI)) :-
frame_predicate(Where, PI).
prolog_stack_frame_property(frame(_,clause(Clause,PC),_), location(File:Line)) :-
subgoal_position(Clause, PC, File, CharA, _CharZ),
File \= @(_), % XPCE Object reference
lineno(File, CharA, Line).
prolog_stack_frame_property(frame(_,_,_,Goal), goal(Goal)) :-
Goal \== 0.
frame_predicate(foreign(PI), PI).
frame_predicate(call(PI), PI).
frame_predicate(clause(Clause, _PC), PI) :-
clause_property(Clause, PI).
default_backtrace_options(Options) :-
( current_prolog_flag(backtrace_show_lines, true)
-> Options = []
; Options = [subgoal_positions(false)]
).
%% print_prolog_backtrace(+Stream, +Backtrace) is det.
%% print_prolog_backtrace(+Stream, +Backtrace, +Options) is det.
%
% Print a stacktrace in human readable form to Stream.
% Options is an option list that accepts:
%
% * subgoal_positions(+Boolean)
% If =true=, print subgoal line numbers. The default depends
% on the Prolog flag =backtrace_show_lines=.
%
% @arg Backtrace is a list of frame(Depth,Location,Goal) terms.
print_prolog_backtrace(Stream, Backtrace) :-
print_prolog_backtrace(Stream, Backtrace, []).
print_prolog_backtrace(Stream, Backtrace, Options) :-
default_backtrace_options(DefOptions),
merge_options(Options, DefOptions, FinalOptions),
phrase(message(Backtrace, FinalOptions), Lines),
print_message_lines(Stream, '', Lines).
:- public % Called from some handlers
message//1.
message(Backtrace) -->
{default_backtrace_options(Options)},
message(Backtrace, Options).
message([], _) -->
[].
message([H|T], Options) -->
message(H, Options),
( {T == []}
-> []
; [nl],
message(T, Options)
).
message(frame(Level, Where, 0), Options) --> !,
level(Level),
where_no_goal(Where, Options).
message(frame(Level, Where, Goal), Options) -->
level(Level),
[ '~q'-[Goal] ],
where_goal(Where, Options).
where_no_goal(foreign(PI), _) -->
[ '~w <foreign>'-[PI] ].
where_no_goal(call(PI), _) -->
[ '~w'-[PI] ].
where_no_goal(clause(Clause, PC), Options) -->
{ option(subgoal_positions(true), Options, true),
subgoal_position(Clause, PC, File, CharA, _CharZ),
File \= @(_), % XPCE Object reference
lineno(File, CharA, Line),
clause_predicate_name(Clause, PredName)
}, !,
[ '~w at ~w:~d'-[PredName, File, Line] ].
where_no_goal(clause(Clause, _PC), _) -->
{ clause_property(Clause, file(File)),
clause_property(Clause, line_count(Line)),
clause_predicate_name(Clause, PredName)
}, !,
[ '~w at ~w:~d'-[PredName, File, Line] ].
where_no_goal(clause(Clause, _PC), _) -->
{ clause_name(Clause, ClauseName)
},
[ '~w <no source>'-[ClauseName] ].
where_no_goal(meta_call, _) -->
[ '<meta call>' ].
where_goal(foreign(_), _) -->
[ ' <foreign>'-[] ], !.
where_goal(clause(Clause, PC), Options) -->
{ option(subgoal_positions(true), Options, true),
subgoal_position(Clause, PC, File, CharA, _CharZ),
File \= @(_), % XPCE Object reference
lineno(File, CharA, Line)
}, !,
[ ' at ~w:~d'-[File, Line] ].
where_goal(clause(Clause, _PC), _) -->
{ clause_property(Clause, file(File)),
clause_property(Clause, line_count(Line))
}, !,
[ ' at ~w:~d'-[ File, Line] ].
where_goal(clause(Clause, _PC), _) -->
{ clause_name(Clause, ClauseName)
}, !,
[ ' ~w <no source>'-[ClauseName] ].
where_goal(_, _) -->
[].
level(Level) -->
[ '~|~t[~D]~6+ '-[Level] ].
%% clause_predicate_name(+ClauseRef, -Predname) is det.
%
% Produce a name (typically Functor/Arity) for a predicate to
% which Clause belongs.
clause_predicate_name(Clause, PredName) :-
user:prolog_clause_name(Clause, PredName), !.
clause_predicate_name(Clause, PredName) :-
nth_clause(Head, _N, Clause), !,
predicate_name(user:Head, PredName).
%% backtrace(+MaxDepth)
%
% Get and print a stacktrace to the user_error stream.
backtrace(MaxDepth) :-
get_prolog_backtrace_lc(MaxDepth, Stack, []),
print_prolog_backtrace(user_error, Stack).
subgoal_position(ClauseRef, PC, File, CharA, CharZ) :-
debug(backtrace, 'Term-position in ~p at PC=~w:', [ClauseRef, PC]),
clause_info(ClauseRef, File, TPos, _),
'$clause_term_position'(ClauseRef, PC, List),
debug(backtrace, '\t~p~n', [List]),
find_subgoal(List, TPos, PosTerm),
arg(1, PosTerm, CharA),
arg(2, PosTerm, CharZ).
find_subgoal([A|T], term_position(_, _, _, _, PosL), SPos) :-
is_list(PosL),
nth1(A, PosL, Pos),
nonvar(Pos), !,
find_subgoal(T, Pos, SPos).
find_subgoal([], Pos, Pos).
%% lineno(+File, +Char, -Line)
%
% Translate a character location to a line-number.
lineno(File, Char, Line) :-
setup_call_cleanup(
( open(File, read, Fd),
set_stream(Fd, newline(detect))
),
lineno_(Fd, Char, Line),
close(Fd)).
lineno_(Fd, Char, L) :-
stream_property(Fd, position(Pos)),
stream_position_data(char_count, Pos, C),
C > Char, !,
stream_position_data(line_count, Pos, L0),
L is L0-1.
lineno_(Fd, Char, L) :-
skip(Fd, 0'\n),
lineno_(Fd, Char, L).
/*******************************
* DECORATE ERRORS *
*******************************/
%% prolog_stack:stack_guard(+PI) is semidet.
%
% Dynamic multifile hook that is normally not defined. The hook is
% called with PI equal to =none= if the exception is not caught
% and with a fully qualified (e.g., Module:Name/Arity) predicate
% indicator of the predicate that called catch/3 if the exception
% is caught.
%
% The the exception is of the form error(Formal, ImplDef) and this
% hook succeeds, ImplDef is unified to a term
% context(prolog_stack(StackData), Message). This context
% information is used by the message printing system to print a
% human readable representation of the stack when the exception
% was raised.
%
% For example, using a clause stack_guard(none) prints contexts
% for uncaught exceptions only. Using a clause stack_guard(_)
% prints a full stack-trace for any error exception if the
% exception is given to print_message/2. See also
% library(http/http_error), which limits printing of exceptions to
% exceptions in user-code called from the HTTP server library.
%
% Details of the exception decoration is controlled by two Prolog
% flags:
%
% * backtrace_depth
% Integer that controls the maximum number of frames
% collected. Default is 20. If a guard is specified, callers
% of the guard are removed from the stack-trace.
%
% * backtrace_show_lines
% Boolean that indicates whether the library tries to find
% line numbers for the calls. Default is =true=.
:- multifile
user:prolog_exception_hook/4.
:- dynamic
user:prolog_exception_hook/4.
user:prolog_exception_hook(error(E, context(Ctx0,Msg)),
error(E, context(prolog_stack(Stack),Msg)),
Fr, Guard) :-
( Guard == none
-> debug(backtrace, 'Got uncaught exception ~p (Ctx0=~p)',
[E, Ctx0]),
stack_guard(none)
; prolog_frame_attribute(Guard, predicate_indicator, PI),
debug(backtrace, 'Got exception ~p (Ctx0=~p, Catcher=~p)',
[E, Ctx0, PI]),
stack_guard(PI)
),
( current_prolog_flag(backtrace_depth, Depth)
-> Depth > 0
; Depth = 20 % Thread created before lib was loaded
),
get_prolog_backtrace(Fr, Depth, Stack0),
debug(backtrace, 'Stack = ~p', [Stack0]),
clean_stack(Stack0, Stack).
clean_stack(List, List) :-
stack_guard(X), var(X), !. % Do not stop if we catch all
clean_stack(List, Clean) :-
clean_stack2(List, Clean).
clean_stack2([], []).
clean_stack2([H|_], [H]) :-
guard_frame(H), !.
clean_stack2([H|T0], [H|T]) :-
clean_stack2(T0, T).
guard_frame(frame(_,clause(ClauseRef, _, _))) :-
nth_clause(M:Head, _, ClauseRef),
functor(Head, Name, Arity),
stack_guard(M:Name/Arity).
/*******************************
* MESSAGES *
*******************************/
:- multifile
prolog:message//1.
prolog:message(error(Error, context(Stack, Message))) -->
{ is_stack(Stack, Frames) }, !,
'$messages':translate_message(error(Error, context(_, Message))),
[ nl, 'In:', nl ],
( {is_list(Frames)}
-> message(Frames)
; ['~w'-[Frames]]
).
is_stack(Stack, Frames) :-
nonvar(Stack),
Stack = prolog_stack(Frames).
|