[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Gcl-devel] Considering 64bit fixnums on 64bit GCL
From: |
Camm Maguire |
Subject: |
[Gcl-devel] Considering 64bit fixnums on 64bit GCL |
Date: |
Fri, 24 May 2013 10:51:25 -0400 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/23.4 (gnu/linux) |
Greetings! I am considering backporting this into the production branch
of gcl. I have a local version which passes all maxima tests.
As you know, many of these run using optimized modular arithmetic. In
particular, one cannot do circular modular multiplication in 64bits in
registers.
maxima defines *bigprimes* as < (ash most-positive-fixnum -1). My
question is, is it not sensible to make this
< (ash 1 (ash (integer-length most-positive-fixnum) -1))
Take care,
--
Camm Maguire address@hidden
==========================================================================
"The earth is but one country, and mankind its citizens." -- Baha'u'llah
- [Gcl-devel] Considering 64bit fixnums on 64bit GCL,
Camm Maguire <=
- Message not available