<p dir="ltr"><br>
On 29 Jan 2015 11:36, "Sean Silva" <<a href="mailto:chisophugis@gmail.com">chisophugis@gmail.com</a>> wrote:<br>
><br>
><br>
><br>
> On Thu, Jan 29, 2015 at 12:53 AM, Renato Golin <<a href="mailto:renato.golin@linaro.org">renato.golin@linaro.org</a>> wrote:<br>
>><br>
>> So, bitset would be a property that means : globals with the same name will append on a string of bits in the order in which they appear, and it's the job of the front end to make sure the correct order is followed in every unit, so that linking does the right job in every corner case?<br>
>><br>
>> Could that be used for efficient global boolean flags, like LLVM's options? Even if you don't need the range check, you get the bit mask check for free.<br>
><br>
> Maybe during LTO... in general they would need to have distinct addresses.<br>
><br>
> Actually, Peter, would it be possible to prototype this with an appending i8 array that we already have in the IR? Some space overhead compared to appending bits, but could allow for a quick prototype.</p>
<p dir="ltr">This would work, and you could make the packaging during your lowering pass, no? </p>
<p dir="ltr">Cheers, <br>
Renato <br>
</p>