Files
mercury/tests/hard_coded/big_array_from_list.m
Zoltan Somogyi 2bd7c5ee3e Rename X's aux modules as X_helper_N in hard_coded.
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.
2023-06-16 08:33:22 +02:00

57 lines
1.7 KiB
Mathematica

%---------------------------------------------------------------------------%
% vim: ts=4 sw=4 et ft=mercury
%---------------------------------------------------------------------------%
%
% Test case for a bug in the MLDS backend in rotd-2007-08-28 and before.
% The MLDS code generator was incorrectly inserting assignment statements
% to do casts even when the types on the lhs and rhs were identical.
% This was inhibiting tail call optimisation in code that used arrays.
% (The code marked XXX below is one such example.).
%
:- module big_array_from_list.
:- interface.
:- import_module io.
:- pred main(io::di, io::uo) is det.
:- implementation.
:- import_module array.
:- import_module int.
:- import_module list.
:- import_module string.
main(!IO) :-
List = 0 .. 600000,
array_from_list(List, Array),
NumElems = array.foldl(count, Array, 0),
io.format("NumElems = %d\n", [i(NumElems)], !IO).
:- pred array_from_list(list(T), array(T)).
:- mode array_from_list(in, array_uo) is det.
array_from_list([], Array) :-
array.make_empty_array(Array).
array_from_list(List, Array) :-
List = [Head | Tail],
list.length(List, Len),
array.init(Len, Head, Array0),
array_insert_items(Tail, 1, Array0, Array).
% XXX Tail call optimisation was not being performed on this predicate
% in hl* grades.
:- pred array_insert_items(list(T)::in, int::in,
array(T)::array_di, array(T)::array_uo) is det.
array_insert_items([], _N, Array, Array).
array_insert_items([Head | Tail], N, Array0, Array) :-
array.set(N, Head, Array0, Array1),
N1 = N + 1,
array_insert_items(Tail, N1, Array1, Array).
:- func count(int, int) = int.
count(_, X) = X + 1.