Re: [1/9] Simplify the implementation of HARD_REG_SET

2019-09-10 Thread Oleg Endo
On Mon, 2019-09-09 at 19:05 +0100, Richard Sandiford wrote: > > Yeah. I might come back to this later and look at a fuller > transition > to C++ (or at least to try to get rid of CLEAR_HARD_REG_SET). > Maybe you can just typedef it to std::bitset ;) Cheers, Oleg

Re: [1/9] Simplify the implementation of HARD_REG_SET

2019-09-09 Thread Richard Sandiford
Jeff Law writes: > On 9/9/19 9:53 AM, Richard Sandiford wrote: >> We have two styles of HARD_REG_SET: a single integer based on >> HOST_WIDEST_FAST_INT (used when FIRST_PSEUDO_REGISTER is small enough) >> or an array of integers. One of the nice properties of this arrangement >> is that: >> >>

Re: [1/9] Simplify the implementation of HARD_REG_SET

2019-09-09 Thread Jeff Law
On 9/9/19 9:53 AM, Richard Sandiford wrote: > We have two styles of HARD_REG_SET: a single integer based on > HOST_WIDEST_FAST_INT (used when FIRST_PSEUDO_REGISTER is small enough) > or an array of integers. One of the nice properties of this arrangement > is that: > > void foo (const HARD_REG_

[1/9] Simplify the implementation of HARD_REG_SET

2019-09-09 Thread Richard Sandiford
We have two styles of HARD_REG_SET: a single integer based on HOST_WIDEST_FAST_INT (used when FIRST_PSEUDO_REGISTER is small enough) or an array of integers. One of the nice properties of this arrangement is that: void foo (const HARD_REG_SET); is passed by value as an integer when the set is