search for: conserative

...ons). > 3. The conservative graph representing all edges which may exist *at > runtime*. > > LazyCallGraph models 1. (the "call graph") and 2. (the "ref graph"). It > does not model 3. > The search for constants in findReferences guarantees that we find (a > conserative superset of) all call destinations addresses that > transformations may add direct calls (and hence update 1.). > > The existing CallGraph data structure (used by e.g. the old PM CGSCC > visitation) only models 1. > > > >> Another point is that it may not be practical t...

On Thu, Jun 16, 2016 at 10:47 PM, Sean Silva <chisophugis at gmail.com> wrote: > > > On Thu, Jun 16, 2016 at 9:53 PM, Xinliang David Li <davidxl at google.com> > wrote: > >> >> >> On Thu, Jun 16, 2016 at 11:12 AM, Sanjoy Das < >> sanjoy at playingwithpointers.com> wrote: >> >>> Hi Sean, >>> >>> On Thu, Jun

...g all edges which may exist *at >>> runtime*. >>> >>> LazyCallGraph models 1. (the "call graph") and 2. (the "ref graph"). It >>> does not model 3. >>> The search for constants in findReferences guarantees that we find (a >>> conserative superset of) all call destinations addresses that >>> transformations may add direct calls (and hence update 1.). >>> >>> The existing CallGraph data structure (used by e.g. the old PM CGSCC >>> visitation) only models 1. >>> >>> >>> &g...