Re: wide set re-implementation progress

[Michael Riedl]

Hallo Gaius,

one short question on the topic - at what time is a set considered to be 
"wide" ?

I use SYSTEM.SHIFT and SYSTEM.ROTATE and bit-wise AND/OR operations for 
index related packing/unpacking in a four-dimensional space, and

it would be painful slow if this would be done within a runtime library 
for 32 or 64 bit arithmetic.

Gruß

Michael

Am 09.01.24 um 17:01 schrieb Gaius Mulley:
> Hi,
>
> I thought I'd post an update on the re-implementation of wide sets in
> gm2.  The wide set re-implementation moves all of the set arithmetic
> operators into a runtime library (removing a substantial amount of
> complexity from the compiler).  The development version of the compiler
> will currently bootstrap using this technique (although it does not use
> the runtime code).  All the libraries in /libgm2 build (and many use wide
> sets - SET OF CHAR - for example).
>
> Wide sets are re-implemented internally as arrays of bytes - thus
> removing any endian portability issues.  Offloading these arithmetic
> operators is inspired by m2r10 and when coupled with module inlining
> should cause little if any performance penalty - and module inlining
> would be available for general use.  I anticipate that the
> re-implementation of wide sets would arrive in gcc master around end of
> April (during the start of stage1 - when major changes are allowed
> again).  At some point there should be a development branch in git
> appear containing the wide set for testing,
>
> regards,
> Gaius