Displaying 2 results from an estimated 2 matches for "lehmer".
2014 Jul 09
2
[LLVMdev] Continuing PR5680: preserve order of use lists in bitcode
> On 2014-Jul-08, at 16:48, Chandler Carruth <chandlerc at google.com> wrote:
>
>
>> On Tue, Jul 8, 2014 at 4:29 PM, Duncan P. N. Exon Smith <duncan at exonsmith.com> wrote:
>> I'm looking to tackle PR5680 [1]. The primary goal is to prevent
>> behaviour changes in passes that depend on the order of use lists when
>> serializing/deserializing the
2014 Jul 24
2
[LLVMdev] Continuing PR5680: preserve order of use lists in bitcode
...int64_t.
> return 4;
> if (N <= 1u << 8) // String of uint8_t.
> return 8;
> if (N <= 1u << 16) // String of uint16_t.
> return 16;
> return 32; // String of uint32_t.
>
> 3. Straw man: store a Lehmer code, which uses a successively smaller
> radix for each index.
>
> E.g., the indirect array [6, 2, 3, 0, 5, 4, 1, 7] converts to the
> Lehmer code of [6, 2, 2, 0, 2, 1, 0, 0].
>
> (1) is simplest. I think (2) is strictly better. At very little extra
> complexity,...