2015-09-18 18:31 GMT+02:00 Jason Merrill :
> On 09/18/2015 02:19 AM, Kai Tietz wrote:
>>
>> Hi Jason,
>>
>> Sounds like an interesting idea. Do have already a specific approach in
>> mind?
>>
>> My idea might be just hard to model, as we aren't sure we walked
>> before the complete chain. Due cp_
On 09/18/2015 02:19 AM, Kai Tietz wrote:
Hi Jason,
Sounds like an interesting idea. Do have already a specific approach in mind?
My idea might be just hard to model, as we aren't sure we walked
before the complete chain. Due cp_fold is caching, we won't try to
fold an expression a second time
Hi Jason,
Sounds like an interesting idea. Do have already a specific approach in mind?
My idea might be just hard to model, as we aren't sure we walked
before the complete chain. Due cp_fold is caching, we won't try to
fold an expression a second time, but we don't cover all EXPRs in
cp_fold,
I think we want to clear *walk_subtrees a lot more often in cp_fold_r;
as it is, for most expressions we end up calling cp_fold on the
full-expression, then uselessly on the subexpressions after we already
folded the containing expression.
Jason
