simon/post-scarcity
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity Actions

Added code::blocks project experimentally; also, added macro for bits

Browse source
This commit is contained in:
Simon Brooke 2025-03-13 18:26:38 +00:00
parent ce1c72973d
commit e9f49d06a6
7 changed files with 275 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/arith/integer.c
View file

@ -87,9 +87,10 @@ __int128_t cell_value( struct cons_pointer c, char op, bool is_first_cell ) {
/**
* Overwrite the value field of the integer indicated by `new` with
* the least significant 60 bits of `val`, and return the more significant
* bits (if any) right-shifted by 60 places. Destructive, primitive, do not
* use in any context except primitive operations on integers.
* the least significant INTEGER_BITS bits of `val`, and return the
* more significant bits (if any) right-shifted by INTEGER_BITS places.
* Destructive, primitive, do not use in any context except primitive
* operations on integers.
*
* @param val the value to represent;
* @param less_significant the less significant words of this bignum, if any,
@ -106,7 +107,7 @@ __int128_t int128_to_integer( __int128_t val,
if ( MAX_INTEGER >= val ) {
carry = 0;
} else {
carry = val >> 60;
carry = val >> INTEGER_BITS;
debug_printf( DEBUG_ARITH,
L"int128_to_integer: 64 bit overflow; setting carry to %ld\n",
( int64_t ) carry );
@ -136,7 +137,7 @@ struct cons_pointer make_integer_128( __int128_t val,
less_significant =
make_integer( ( long int ) val & MAX_INTEGER,
less_significant );
val = val >> 60;
val = val >> INTEGER_BITS;
}
} while ( nilp( result ) );
@ -290,7 +291,7 @@ struct cons_pointer multiply_integers( struct cons_pointer a,
/* if xj exceeds one digit, break it into the digit dj and
* the carry */
carry = xj >> 60;
carry = xj >> INTEGER_BITS;
struct cons_pointer dj = make_integer( xj & MAX_INTEGER, NIL );
/* destructively modify ri by appending dj */
@ -361,7 +362,7 @@ struct cons_pointer integer_to_string( struct cons_pointer int_pointer,
while ( accumulator > 0 || !nilp( next ) ) {
if ( accumulator < MAX_INTEGER && !nilp( next ) ) {
accumulator +=
( pointer2cell( next ).payload.integer.value << 60 );
( pointer2cell( next ).payload.integer.value << INTEGER_BITS );
next = pointer2cell( next ).payload.integer.more;
}
int offset = ( int ) ( accumulator % base );

11
src/arith/peano.h
View file

@ -14,12 +14,13 @@
/**
* The maximum value we will allow in an integer cell.
*
* NOTE: 20250312 this is 2^60. WHY? Given that we're using the sign bit
* inside the int64 record, we only have 63 value bits; but why did I decide
* not to use all 63?
*/
#define MAX_INTEGER ((__int128_t)0x0fffffffffffffffL)
#define MAX_INTEGER ((__int128_t)0x7fffffffffffffffL)
/**
* @brief Number of value bits in an integer cell
*
*/
#define INTEGER_BITS 63
bool zerop( struct cons_pointer arg );