mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-18 19:03:45 +00:00
fdd141bf77
tests/invalid/*.{m,err_exp}:
tests/misc_tests/*.m:
tests/mmc_make/*.m:
tests/par_conj/*.m:
tests/purity/*.m:
tests/stm/*.m:
tests/string_format/*.m:
tests/structure_reuse/*.m:
tests/submodules/*.m:
tests/tabling/*.m:
tests/term/*.m:
tests/trailing/*.m:
tests/typeclasses/*.m:
tests/valid/*.m:
tests/warnings/*.{m,exp}:
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 tests
that check compiler error messages, expect the new line numbers.
browser/cterm.m:
browser/tree234_cc.m:
Import only one module per line.
tests/hard_coded/boyer.m:
Fix something I missed.
58 lines
1.4 KiB
Mathematica
58 lines
1.4 KiB
Mathematica
%---------------------------------------------------------------------------%
|
|
% vim: ts=4 sw=4 et ft=mercury
|
|
%---------------------------------------------------------------------------%
|
|
%
|
|
% Regression test.
|
|
% The compiler aborted on this module with --trace shallow.
|
|
%
|
|
% Software Error: continuation_info.m: Unexpected: find_typeinfos_for_tvars:
|
|
% can't find rval for type_info var TypeInfo_for_AtomicTask
|
|
%
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- module livevars_shallow.
|
|
:- interface.
|
|
|
|
:- import_module list.
|
|
|
|
:- type node(A)
|
|
---> place
|
|
; task.
|
|
|
|
:- type task_type(A)
|
|
---> atomick
|
|
; composite.
|
|
|
|
:- pred cancellation_set_updates(list(node(A))::in, list(string)::out) is det.
|
|
|
|
%---------------------------------------------------------------------------%
|
|
|
|
:- implementation.
|
|
|
|
cancellation_set_updates(Nodes, L) :-
|
|
classify_nodes(Nodes, L).
|
|
|
|
:- pred classify_nodes(list(node(A))::in, list(string)::out) is det.
|
|
|
|
classify_nodes([], []).
|
|
classify_nodes([Node | Nodes], L) :-
|
|
(
|
|
Node = place,
|
|
classify_nodes(Nodes, L)
|
|
;
|
|
Node = task,
|
|
classify_nodes(Nodes, L0),
|
|
TaskType = get_task_type(Node),
|
|
(
|
|
TaskType = atomick,
|
|
L = L0
|
|
;
|
|
TaskType = composite,
|
|
L = L0
|
|
)
|
|
).
|
|
|
|
:- func get_task_type(node(A)) = task_type(A).
|
|
|
|
get_task_type(_) = composite.
|