No matter how efficient or clever a virtual machine, it still
requires additional steps in order to perform useful work. So
there are really three efficient approaches to consider:
1. Accept that we have a ubiquitous x86(-64) mono-culture and primarily
target that.
I use PPC
On Wed, Oct 15, 2008 at 10:27:59PM +0100, Tomas Hlavaty wrote:
your 64 bit Linux fine. You'll need to add the -m32 option to gcc.l
.. or download the latest testing version.
--
UNSUBSCRIBE: mailto:[EMAIL PROTECTED]
Hi Tomas,
I was curious to try picolisp bignums and must say that for somebody
doing anything serious, it is probably rather inefficient. As a
I'm aware of that. The bignum implementation was not intended to be
particularly fast, or - to put it corrrectly - cannot be expected to be
very fast
On Thu, Oct 16, 2008 at 10:24:40PM +1100, konrad Zielinski wrote:
And now back to questions about 64 bit picolisp:
Is switching to an assembler going to mean the demise of gcc.l ?
Are we going to see inline picoLisp Assembler instead?O
Yes, the current version of gcc.l will not work any
Hi Alex,
Yes, the current version of gcc.l will not work any longer :-(
What is the reason for this not being possible? I though C and asm
can be linked together (C is compiled to asm anyway).
Cheers,
Tomas
--
UNSUBSCRIBE: mailto:[EMAIL PROTECTED]
Hi Tomas,
Yes, the current version of gcc.l will not work any longer :-(
What is the reason for this not being possible? I though C and asm
can be linked together (C is compiled to asm anyway).
On the instruction level this is correct, but the calling conventions of
the (assembly)
Hi All,
It would appear that setting up a chroot is remarkably easy, well
under debian anyway, I can't speak for other distros as I haven't
tried. AndJus it seems to work quite nicely too, even if their are
other ways to do it.
Anyway now that I have a chroot I can install a version of Firefox
Hi Alex,
thanks for explanation.
I was curious to try picolisp bignums and must say that for somebody
doing anything serious, it is probably rather inefficient. As a
benchmark, I tried the example from
http://paste.lisp.org/display/15116
(setq X 0)
(setq Y 1)
(for (N 2 (= N 100) (inc N))
