<div dir="ltr"><div class="gmail_extra"><div class="gmail_quote">On Mon, Jun 15, 2015 at 1:43 AM, Daniel Berlin <span dir="ltr"><<a href="mailto:dberlin@dberlin.org" target="_blank">dberlin@dberlin.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex"><span class="">> The AA algorithm uses dataflow analysis to monitor the possible propagation<br>
> of those values through the program code, and it represents those flows by<br>
> updates to the may-point-to graph. If at some code point CP, a may-point-to<br>
> graph vertex "B" has no outbound edges, that's equivalent to saying that the<br>
> AA has concluded the runtime memory modeled by "B" does not contain any<br>
> pointer that a correct program has any business trying to dereference.<br>
<br>
</span>FWIW: When i first did GCC's current points-to analysis, I did the<br>
same thing. It eliminated "non-pointer" values along the same lines.<br>
This broke roughly "the entire world".<br></blockquote><div><br></div><div><span style="font-size:12.8000001907349px">Whoa, thanks for the warning.</span></div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">
I tried to find some subset i felt was worthwhile and where it was<br>
okay, but gave up after a while.<br>
</blockquote></div><br class=""><span style="font-size:12.8000001907349px">I'm not quite sure which things you're referring to in that statement. Would you mind clarifying?</span><br></div></div>