mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-17 02:13:54 +00:00
33eb3028f5
tests/accumulator/*.m:
tests/analysis_*/*.m:
tests/benchmarks*/*.m:
tests/debugger*/*.{m,exp,inp}:
tests/declarative_debugger*/*.{m,exp,inp}:
tests/dppd*/*.m:
tests/exceptions*/*.m:
tests/general*/*.m:
tests/grade_subdirs*/*.m:
tests/hard_coded*/*.m:
Make these tests use four-space indentation, and ensure that
each module is imported on its own line. (I intend to use the latter
to figure out which subdirectories' tests can be executed in parallel.)
These changes usually move code to different lines. For the debugger tests,
specify the new line numbers in .inp files and expect them in .exp files.
53 lines
1.4 KiB
Mathematica
53 lines
1.4 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% The following program compiles incorrectly on PPC/MacOS X in grade reg.gc.
|
|
% find_nth_yes/4 ends up throwing an exception instead of returning `YesPos =
|
|
% 3'. Passing `--no-optimize-fulljumps' causes the test to pass.
|
|
%
|
|
% The test passes with gcc 2.95.2 (Apple version) but fails with gcc 3.3
|
|
% (Apple version).
|
|
%
|
|
% The problem was that gcc's `-floop-optimize' options was incompatible
|
|
% with our use of global registers. The fix is to make sure that option
|
|
% is disabled on powerpc-apple-darwin.
|
|
|
|
:- module ppc_bug.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module list.
|
|
:- import_module int.
|
|
:- import_module bool.
|
|
:- import_module std_util.
|
|
:- import_module exception.
|
|
|
|
main(!IO) :-
|
|
find_nth_yes([yes, no, yes, yes], 2, 1, X),
|
|
io.write_int(X, !IO),
|
|
io.nl(!IO).
|
|
|
|
:- pred find_nth_yes(list(bool)::in, int::in, int::in, int::out) is det.
|
|
|
|
find_nth_yes([], _, _, _) :-
|
|
throw("no").
|
|
find_nth_yes([B | Bs], N, Cur, YesPos) :-
|
|
(
|
|
B = no,
|
|
find_nth_yes(Bs, N, Cur + 1, YesPos)
|
|
;
|
|
B = yes,
|
|
( N = 1 ->
|
|
YesPos = Cur
|
|
;
|
|
find_nth_yes(Bs, N - 1, Cur + 1, YesPos)
|
|
)
|
|
).
|