> In theory, this is true, but a lot of the optimizations decrease
> accuracy at a cost of making the problem solvable in a reasonable
> amount of time.
> By performing it after building initial points-to sets, the amount of
> accuracy loss is incredibly small.
> The only type of constraint that wi
On Thu, Sep 9, 2010 at 7:24 AM, Richard Guenther
wrote:
> On Thu, Sep 9, 2010 at 1:19 PM, Amker.Cheng wrote:
>> Hi,
>> I am studying gcc's points-to analysis right now and encountered a question.
>> In paper "Off-line Variable Substitution for Scaling Points-to
>> Analysis", section 3.2
>> It says
On Thu, Sep 9, 2010 at 1:19 PM, Amker.Cheng wrote:
> Hi,
> I am studying gcc's points-to analysis right now and encountered a question.
> In paper "Off-line Variable Substitution for Scaling Points-to
> Analysis", section 3.2
> It says that we should not substitute a variable with other if it is
>
Hi,
I am studying gcc's points-to analysis right now and encountered a question.
In paper "Off-line Variable Substitution for Scaling Points-to
Analysis", section 3.2
It says that we should not substitute a variable with other if it is
taken address.
But in GCC's implementation, it units pointer but
