mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-16 09:53: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.
115 lines
2.9 KiB
Mathematica
115 lines
2.9 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% This program performs Mercury allocations in one thread (e.g. using Boehm GC)
|
|
% and simulates malloc calls in another thread that indirectly call sbrk.
|
|
% If both allocators use sbrk and are invoked simulataneously then
|
|
% memory corruption can result.
|
|
%
|
|
|
|
:- module thread_sbrk.
|
|
:- interface.
|
|
|
|
:- import_module io.
|
|
|
|
:- pred main(io::di, io::uo) is cc_multi.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
:- import_module bool.
|
|
:- import_module int.
|
|
:- import_module list.
|
|
:- import_module string.
|
|
:- import_module thread.
|
|
:- import_module thread.semaphore.
|
|
|
|
:- pragma foreign_decl("C", "
|
|
#ifdef MR_HAVE_SBRK
|
|
#include <unistd.h>
|
|
#endif
|
|
").
|
|
|
|
:- type tree
|
|
---> nil
|
|
; node(int, tree, tree).
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
main(!IO) :-
|
|
( if can_spawn_native then
|
|
semaphore.init(Sem, !IO),
|
|
thread.spawn_native(alloc_thread(Sem), _, !IO),
|
|
semaphore.wait(Sem, !IO),
|
|
sbrk_loop(Sem, !IO),
|
|
io.write_string("done.\n", !IO)
|
|
else
|
|
io.write_string("spawn_native not supported.\n", !IO)
|
|
).
|
|
|
|
:- pred sbrk_loop(semaphore::in, io::di, io::uo) is det.
|
|
|
|
sbrk_loop(Sem, !IO) :-
|
|
% io.write_string("sbrk thread\n", !IO),
|
|
semaphore.try_wait(Sem, Success, !IO),
|
|
(
|
|
Success = yes
|
|
;
|
|
Success = no,
|
|
% It is hard to trigger a crash by calling malloc because not every
|
|
% call ends up calling sbrk. Therefore we call sbrk directly.
|
|
sbrk(0x100, !IO),
|
|
sbrk_loop(Sem, !IO)
|
|
).
|
|
|
|
:- pred sbrk(int::in, io::di, io::uo) is det.
|
|
|
|
sbrk(_, !IO).
|
|
|
|
:- pragma foreign_proc("C",
|
|
sbrk(Increment::in, _IO0::di, _IO::uo),
|
|
[will_not_call_mercury, promise_pure, thread_safe, tabled_for_io],
|
|
"
|
|
#ifdef MR_HAVE_SBRK
|
|
sbrk(Increment);
|
|
#endif
|
|
").
|
|
|
|
:- pred alloc_thread(semaphore::in, thread::in, io::di, io::uo) is cc_multi.
|
|
|
|
alloc_thread(Sem, _Thread, !IO) :-
|
|
semaphore.signal(Sem, !IO),
|
|
alloc_loop(Sem, 1, !IO).
|
|
|
|
:- pred alloc_loop(semaphore::in, int::in, io::di, io::uo) is cc_multi.
|
|
|
|
alloc_loop(Sem, Depth, !IO) :-
|
|
% io.write_string("alloc thread\n", !IO),
|
|
( Depth > 20 ->
|
|
semaphore.signal(Sem, !IO)
|
|
;
|
|
build(Depth, T, 0, _Id),
|
|
io.format("depth %d, size %d\n", [i(Depth), i(size(T))], !IO),
|
|
alloc_loop(Sem, Depth + 1, !IO)
|
|
).
|
|
|
|
:- pred build(int::in, tree::out, int::in, int::out) is det.
|
|
|
|
build(Depth, T, Id0, Id) :-
|
|
( if Depth = 1 then
|
|
T = nil,
|
|
Id = Id0
|
|
else
|
|
build(Depth - 1, L, Id0 + 1, Id2),
|
|
build(Depth - 1, R, Id2, Id),
|
|
T = node(Id0, L, R)
|
|
).
|
|
|
|
:- func size(tree) = int.
|
|
|
|
size(nil) = 1.
|
|
size(node(_, L, R)) = 1 + size(L) + size(R).
|