mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-16 18:03:36 +00:00
2bd7c5ee3e
tests/hard_coded/*.m:
Rename modules as mentioned above.
In a few cases, where the main module's name itself had a suffix,
such as "_mod_a" or "_main", remove that suffix. This entails
renaming the .exp file as well. (In some cases, this meant that
the name of a helper module was "taken over" by the main module
of the test case.)
Update all references to the moved modules.
General updates to programming style, such as
- replacing DCG notation with state var notation
- replacing (C->T;E) with (if C then T else E)
- moving pred/func declarations to just before their code
- replacing io.write/io.nl sequences with io.write_line
- replacing io.print/io.nl sequences with io.print_line
- fixing too-long lines
- fixing grammar errors in comments
tests/hard_coded/Mmakefile:
tests/hard_coded/Mercury.options:
Update all references to the moved modules.
Enable the constant_prop_int test case. The fact that it wasn't enabled
before is probably an accident. (When constant_prop_int.m was created,
the test case was added to a list in the Mmakefile, but that list
was later removed due to never being referenced.)
tests/hard_coded/constant_prop_int.{m,exp}:
Delete the calls to shift operations with negative shift amounts,
since we have added a compile-time error for these since the test
was originally created.
74 lines
1.9 KiB
Mathematica
74 lines
1.9 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% Stress test the handling of temp frames on the nondet stack, looking for
|
|
% bugs that manifest themselves when we add new segments to the nondet stack,
|
|
% or when we delete them.
|
|
%
|
|
% The code works by building a list of positive numbers, and searching it
|
|
% for a negative number. With debugging enabled, which we can do even in
|
|
% non-debug grades, the search predicate in_list will have its nondet tail
|
|
% recursion disabled, and every one of the nested active calls will have
|
|
% a temp frame created for its FAIL event. If the list is long enough,
|
|
% these temp frames will spill over into new nondet stack segments.
|
|
|
|
:- module bug314.
|
|
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is det.
|
|
|
|
:- implementation.
|
|
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module string.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
main(!IO) :-
|
|
N = 4000,
|
|
iota(N, [], List),
|
|
test(List, Result),
|
|
io.print(Result, !IO),
|
|
io.nl(!IO).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- pred iota(int::in, list(int)::in, list(int)::out) is det.
|
|
|
|
iota(N, !List) :-
|
|
( if N = 0 then
|
|
true
|
|
else
|
|
!:List = [N | !.List],
|
|
iota(N - 1, !List)
|
|
).
|
|
|
|
:- pred test(list(int)::in, string::out) is det.
|
|
|
|
test(List, Result) :-
|
|
( if
|
|
% We look for a number that cannot be in the list,
|
|
% to force in_list to use the maximum amount of nondet stack.
|
|
in_list(M, List),
|
|
M = -1
|
|
then
|
|
Result = "found"
|
|
else
|
|
Result = "not found"
|
|
).
|
|
|
|
% Our own version of list.member(out, in) so it gets compiled how we want it.
|
|
:- pred in_list(int::out, list(int)::in) is nondet.
|
|
|
|
in_list(N, [H | T]) :-
|
|
(
|
|
N = H
|
|
;
|
|
in_list(N, T)
|
|
).
|