Displaying 2 results from an estimated 2 matches for "compareusers".
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
...d-1]
> - after id-2: [id-2, id-1]
> - after id-3: [id-1, id-2]
> - after id-4: [id-4, id-1, id-2]
> - after id-5: [id-5, id-4, id-1, id-2]
>
> For such "normal" values, it's trivial to sort a use-list to match what
> the reader will see:
>
> auto compareUsers = [&IDs, ValueID](User *LHS, User *RHS) {
> unsigned LID = IDs.lookup(LHS), RID = IDS.lookup(RHS);
> if (LID > ValueID)
> return LID > RID;
> if (RID > ValueID)
> return false;
> return LID < RID;
> }
&...