Re: [wide-int] Make the main tree decompose cheaper

2013-10-24 Thread Richard Sandiford
Richard Biener writes: > On Wed, 23 Oct 2013, Richard Sandiford wrote: >> This patch stores two array lengths in an INTEGER_CST: the length that >> should be used when accessing the constant in its TYPE_PRECISION, >> and the one that should be used for wider precisions. This means that >> the mai

Re: [wide-int] Make the main tree decompose cheaper

2013-10-24 Thread Richard Biener
On Wed, 23 Oct 2013, Richard Sandiford wrote: > This patch stores two array lengths in an INTEGER_CST: the length that > should be used when accessing the constant in its TYPE_PRECISION, > and the one that should be used for wider precisions. This means that > the main tree decompose routine is j

[wide-int] Make the main tree decompose cheaper

2013-10-23 Thread Richard Sandiford
This patch stores two array lengths in an INTEGER_CST: the length that should be used when accessing the constant in its TYPE_PRECISION, and the one that should be used for wider precisions. This means that the main tree decompose routine is just a simple storage_ref constructor. It also means tha