Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> >>> Second: sbcl and especially ecl like it much better if you compile the lsp
> >>> files generated with the aldor compiler
> >> What does that mean?
> >
> > ecl complains about "too large jump" in aldor-combinat, unless you compile
> > the
> > files. sbcl is *much* faster on compiled files.
>
> Does that just mean that instead of
>
> for f in $(ar t libcombinatax.al); do
> echo ")lib $f" >> combinat.input;
> done
>
> we should have something like
>
> for f in $(ar t libcombinatax.al); do
> n=$(basename $f .ao);
> echo ")compile $n.lsp" >> combinat.input;
> echo ")lib $n" >> combinat.input;
> done
>
> in Aldor-combinat?
Not really, because it will fail for siprimes on machines with not enough
memory (eg., my laptop). (If you look at cssiprimes.lsp, you'll find a rather
long routine starting with
(|SetAElt|
t6
(the |SInt| 0)
(|CCall|
(|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|)
(|MakeLit| "2")))
(|SetAElt|
t6
(the |SInt| 1)
(|CCall|
(|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|)
(|MakeLit| "3")))
(|SetAElt|
t6
(the |SInt| 2)
(|CCall|
(|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|)
(|MakeLit| "5")))
and going on for quite a long time. It seems that not all compilers like it
equally well...
Martin
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/
_______________________________________________
Aldor-combinat-devel mailing list
Aldor-combinat-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
