Displaying 2 results from an estimated 2 matches for "bottomupcallgraph".
2009 Aug 08
0
[LLVMdev] [PATCH] Add functionality to scc_iterator
Chris Lattner wrote:
> On Aug 7, 2009, at 12:51 PM, Vikram S. Adve wrote:
>
>
>> Checking if a graph node is in a cycle or not must be a relatively
>> common query. E.g., we used this on DS graphs to decide if DS node
>> represented multiple objects or a single object. It's the basic query
>> to decide if a function is part of a recursive computation (a
2009 Aug 08
3
[LLVMdev] [PATCH] Add functionality to scc_iterator
On Aug 7, 2009, at 12:51 PM, Vikram S. Adve wrote:
> Checking if a graph node is in a cycle or not must be a relatively
> common query. E.g., we used this on DS graphs to decide if DS node
> represented multiple objects or a single object. It's the basic query
> to decide if a function is part of a recursive computation (a cycle in
> the call graph). CFGs happen to have