Displaying 7 results from an estimated 7 matches for "tarjanscciterator".
Did you mean:
tarjanscc_iterator
2002 Nov 15
1
[LLVMdev] TarjanSCCInterator
Dear LLVM,
when I tried to use the TarjanSCCIterator. I include the header file and
compile the program. It give me this warning:
Compiling MemLeakage.cpp
In file included from MemLeakage.cpp:28:
../../../include/Support/TarjanSCCIterator.h:59: warning: left shift count
>=
width of type
======= Linking MemLeakage debug library =======
Please...
2002 Nov 14
1
[LLVMdev] problem checking out llvm
...ting include/Support
cvs update: cannot close BitSetVector.h: No space left on device
cvs update: could not check out include/Support/BitSetVector.h
cvs update: cannot close GraphWriter.h: No space left on device
cvs update: could not check out include/Support/GraphWriter.h
cvs update: cannot close TarjanSCCIterator.h: No space left on device
cvs update: could not check out include/Support/TarjanSCCIterator.h
cvs update: cannot close hash_map: No space left on device
cvs update: could not check out include/Support/hash_map
cvs update: cannot close hash_set: No space left on device
cvs update: could not check o...
2002 Dec 06
1
[LLVMdev] WRT: function pointers + DSG
...td::vector<GlobalValue*> funcVect =
theGraph.getNodeForValue(calli->getCalledFunction()).getNode()->getGlobals();
Doesn't appear to work... getCalledFunction() returns 0
Dave
On Fri, 6 Dec 2002, Vikram Adve wrote:
> P.S. I have also updated the CSIL tree. Just check out
> TarjanSCCIterator.h.
>
> --Vikram
> http://www.cs.uiuc.edu/~vadve
>
>
> > From: David Crowe <dcrowe at tremor.crhc.uiuc.edu>
> > Subject: [LLVMbugs] Re: [LLVMdev] Tarjan+function_ptrs == trouble ?
> > Sender: llvmbugs-admin at cs.uiuc.edu
> > Date: Fri, 6 Dec 2002 00:5...
2002 Dec 06
3
[LLVMdev] Tarjan+function_ptrs == trouble ? (fwd)
Test Cases:
(attached)
Iteration code:
(...)
typedef TarjanSCC_iterator<CallGraph*> MyTarjan;
CallGraph& callGraph = getAnalysis<CallGraph>();
MyTarjan iter = tarj_begin(&callGraph);
MyTarjan end = tarj_end(&callGraph);
while(iter!=end)
iter++;
(...)
if you take the time to print out the function each non-looping node iter
traverses, it never reaches main...
2002 Dec 06
1
[LLVMdev] Tarjan+function_ptrs == trouble ?
...you look into this if you get a
> chance?
>
> -Chris
>
> ------------------- Pass code ----------------------------
>
> #include "llvm/Analysis/CallGraph.h"
> #include "llvm/Function.h"
> #include "llvm/Pass.h"
> #include "Support/TarjanSCCIterator.h"
>
> struct Test : public Pass {
> virtual bool run(Module &F) {
> typedef TarjanSCC_iterator<CallGraph*> MyTarjan;
> CallGraph& callGraph = getAnalysis<CallGraph>();
> for (MyTarjan I = tarj_begin(&callGraph), E = tarj_end(&callGr...
2002 Nov 12
0
[LLVMdev] (no subject)
P.S. If anyone can take a little time to write a GraphTraits class for
the call graph, using the call sites returned by the TDGraph, that would
be great.
Then you could directly use the PostOrderIterator,
ReversePostOrderIterator, and TarjanSCCIterator on this call graph,
without having to do any extra work. You can also do other things like
print out the call graph to dot files and view them. All this comes for
free since they only need GraphTraits.
--Vikram
http://www.cs.uiuc.edu/~vadve
> -----Original Message-----
> From: Vikram S....
2002 Dec 06
0
[LLVMdev] Tarjan+function_ptrs == trouble ?
...hree
Which doesn't visit main. Vikram, could you look into this if you get a
chance?
-Chris
------------------- Pass code ----------------------------
#include "llvm/Analysis/CallGraph.h"
#include "llvm/Function.h"
#include "llvm/Pass.h"
#include "Support/TarjanSCCIterator.h"
struct Test : public Pass {
virtual bool run(Module &F) {
typedef TarjanSCC_iterator<CallGraph*> MyTarjan;
CallGraph& callGraph = getAnalysis<CallGraph>();
for (MyTarjan I = tarj_begin(&callGraph), E = tarj_end(&callGraph); I != E; ++I) {
SCC...