On Thu, Jan 24, 2013 at 3:17 PM, Uday P. Khedker wrote:
>
>
> Richard Biener wrote, On Thursday 24 January 2013 05:28 PM:
>
>
>>> In the program below, we have a global pointer p that has conditional
>>> assignments before its
>>> use on the RHS of a copy statement.
>>>
>>> ---
Richard Biener wrote, On Thursday 24 January 2013 05:28 PM:
In the program below, we have a global pointer p that has conditional
assignments before its
use on the RHS of a copy statement.
-
#include
int *
On Thu, Jan 24, 2013 at 9:02 AM, Uday P. Khedker wrote:
>
>
> Richard Biener wrote, On Thursday 24 January 2013 01:57 AM:
>
>> On Wed, Jan 23, 2013 at 8:12 PM, Uday Khedker wrote:
>>>
>>> Hi Richard,
>>>
>>> I am trying to understand the full implications of your statement:
>>>
>>>
> Yes, tha
Richard Biener wrote, On Thursday 24 January 2013 01:57 AM:
On Wed, Jan 23, 2013 at 8:12 PM, Uday Khedker wrote:
Hi Richard,
I am trying to understand the full implications of your statement:
Yes, that's what I say. Any pointer that is dereferenced is first
copied to
an SSA name. Basica
On Wed, Jan 23, 2013 at 8:12 PM, Uday Khedker wrote:
> Hi Richard,
>
> I am trying to understand the full implications of your statement:
>
>
>>> Yes, that's what I say. Any pointer that is dereferenced is first
>>> copied to
>>> an SSA name. Basically everything residing in memory first has to
Hi Richard,
I am trying to understand the full implications of your statement:
>> Yes, that's what I say. Any pointer that is dereferenced is first
>> copied to
>> an SSA name. Basically everything residing in memory first has to be
>> loaded to an SSA name before it can be dereferenced. That
On Saturday 13 October 2012 02:34 AM, Xinliang David Li wrote:
Somewhere it is mentioned that heap is handled conservatively. Does
it mean the algorithm can not disambiguate heap objects all all, or
it can but does not track pointer values stored in heap objects?
How about field sensitivity?
CS, virtual calls in C++ will be one of the the biggest
challenges. How is that dealt with? It can be combined with type
propagation/analysis.
thanks,
David
On Wed, Oct 10, 2012 at 10:56 AM, Uday P. Khedker wrote:
>
> We have designed and implemented a fully flow and context sensitive
>
Excellent! Thanks.
Uday.
Richard Biener wrote, On Friday 12 October 2012 03:20 PM:
On Fri, Oct 12, 2012 at 11:46 AM, Uday P. Khedker wrote:
Richard Biener wrote, On Friday 12 October 2012 02:51 PM:
we _always_ see
ssa_name_1 = a;
use (ssa_name_1);
so you have a place to associa
On Fri, Oct 12, 2012 at 11:46 AM, Uday P. Khedker wrote:
>
>
> Richard Biener wrote, On Friday 12 October 2012 02:51 PM:
>
>>
>> we _always_ see
>>
>>ssa_name_1 = a;
>>use (ssa_name_1);
>>
>> so you have a place to associate your flow-sensitive and context-sensitive
>> points-to-info with
Richard Biener wrote, On Friday 12 October 2012 02:51 PM:
we _always_ see
ssa_name_1 = a;
use (ssa_name_1);
so you have a place to associate your flow-sensitive and context-sensitive
points-to-info with (the SSA name). My point is that for _using_ the
points-to info flow-sensitivity p
On Fri, Oct 12, 2012 at 7:41 AM, Uday P. Khedker wrote:
>
>
> Andrew Pinski wrote, On Friday 12 October 2012 10:29 AM:
>
>
>>> Here's an example:
>>>
>>> main()
>>> {
>>> int **p;
>>> int *a, *d;
>>> int w, x;
>>>
>>> a = &w;
>>> f1(a);
>>> p =
Andrew Pinski wrote, On Friday 12 October 2012 11:26 AM:
Except the problem here is just about what f1 clobbers. Since a has
not escaped by the time f1 is called, f1 cannot clobber a (or d).
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23384 for reference on why
GCC gets this incorrect. GCC
On Thu, Oct 11, 2012 at 10:41 PM, Uday P. Khedker wrote:
>
>
> Andrew Pinski wrote, On Friday 12 October 2012 10:29 AM:
>
>
>>> Here's an example:
>>>
>>> main()
>>> {
>>> int **p;
>>> int *a, *d;
>>> int w, x;
>>>
>>> a = &w;
>>> f1(a);
>>> p
decided to hold the address of a into a1 through function f1, let me eliminate
the
call to f1 and make the assignment a=&w live in some other way. Here's the
changed code:
Please read it as "eliminate the call passing a to f1".
Uday.
Andrew Pinski wrote, On Friday 12 October 2012 10:29 AM:
Here's an example:
main()
{
int **p;
int *a, *d;
int w, x;
a = &w;
f1(a);
p = &a;
a = &x;
f2(p);
d = a;
return *d;
}
It is clear that d can onl
On Thu, Oct 11, 2012 at 9:41 PM, Uday P. Khedker wrote:
>
>
> Diego Novillo wrote, On Friday 12 October 2012 01:41 AM:
>
>> On Thu, Oct 11, 2012 at 11:53 AM, Uday P. Khedker
>> wrote:
>>>
>>>
That's actually not true. In fact existing GCC pointer analysis is
flow-sensitive for all
Diego Novillo wrote, On Friday 12 October 2012 01:41 AM:
On Thu, Oct 11, 2012 at 11:53 AM, Uday P. Khedker wrote:
That's actually not true. In fact existing GCC pointer analysis is
flow-sensitive for all SSA pointers.
SSA provides partial flow sensitivity to the top level pointers. For
On Thu, Oct 11, 2012 at 11:53 AM, Uday P. Khedker wrote:
>
>>
>> That's actually not true. In fact existing GCC pointer analysis is
>> flow-sensitive for all SSA pointers.
>
>
> SSA provides partial flow sensitivity to the top level pointers. For deeper
> pointers, one needs to interleave SSA and
That's actually not true. In fact existing GCC pointer analysis is
flow-sensitive for all SSA pointers.
SSA provides partial flow sensitivity to the top level pointers. For deeper
pointers, one needs to interleave SSA and points-to analysis. Besides, it cannot
handle global pointers which ar
On Thu, Oct 11, 2012 at 5:04 AM, Uday P. Khedker wrote:
> Hi David,
>
>> This is great progress.
>
>
> Thanks.
>
>
>>
>> If I understand the experiments, your implementtion has very small
>> cost to perform the analysis, at least for the SPEC benchmarks you are
>> testing. Have you connected the
Hi David,
This is great progress.
Thanks.
If I understand the experiments, your implementtion has very small
cost to perform the analysis, at least for the SPEC benchmarks you are
testing. Have you connected the analysis to any optimizations? Is
there any improvement in performance on SPE
On Wed, Oct 10, 2012 at 1:56 PM, Uday P. Khedker wrote:
>
> We have designed and implemented a fully flow and context sensitive
> points-to analysis in gcc-4.6.0. For simplicity, we have made a dynamic
> plugin available at http://www.cse.iitb.ac.in/grc/index.php?page=l-fcpa.
>
We have designed and implemented a fully flow and context sensitive points-to
analysis in gcc-4.6.0. For simplicity, we have made a dynamic plugin available
at http://www.cse.iitb.ac.in/grc/index.php?page=l-fcpa. This page also provides
an overview of the method, and links to the paper
24 matches
Mail list logo
