search for: dfset

...It's a bit confusing to be honest. Can you help? > Here are some examples on how to use the dataflow graphs: Value *V = ... for(df_iterator<Value*> UI = df_begin(V), UE = df_end(V); UI != UE; ++UI) { ... } typedef SmallPtrSet<const Value*, 16> SmallValueSet; SmallValueSet DFSet; const User* U = ...; for (idf_ext_iterator<const User*, SmallValueSet> I=idf_ext_begin(U, DFSet), E=idf_ext_end(U, DFSet); I != E; ++I) { .. } There is no common root for the dataflow graph from which you can enumerate all dataflows, but you could take each instruction in a function that y...

...;> > > Here are some examples on how to use the dataflow graphs: > > Value *V = ... > for(df_iterator<Value*> UI = df_begin(V), UE = df_end(V); UI != UE; ++UI) { > ... > } > > > typedef SmallPtrSet<const Value*, 16> SmallValueSet; > SmallValueSet DFSet; > const User* U = ...; > for (idf_ext_iterator<const User*, SmallValueSet> I=idf_ext_begin(U, > DFSet), E=idf_ext_end(U, DFSet); I != E; ++I) { > .. > } > > > I don't understand why I'd need a depth-first iterator. > There is no common root for the dat...

...n how to use the dataflow graphs: >> >> Value *V = ... >> for(df_iterator<Value*> UI = df_begin(V), UE = df_end(V); UI != UE; >> ++UI) { >> ... >> } >> >> >> typedef SmallPtrSet<const Value*, 16> SmallValueSet; >> SmallValueSet DFSet; >> const User* U = ...; >> for (idf_ext_iterator<const User*, SmallValueSet> I=idf_ext_begin(U, >> DFSet), E=idf_ext_end(U, DFSet); I != E; ++I) { >> .. >> } >> >> >> > I don't understand why I'd need a depth-first iterator. It w...

I've tried to write a DFGPrinter based on the CFGPrinter, as you suggested, but encountered problems. The GraphWriter expects GraphTraits<GraphType>::nodes_begin()/nodes_end(). The way this is implemented in CFG.h, a function is a graph of basic blocks. A GraphTraits<Function*> inherits from GraphTraits<BasicBlock*>, and implements those nodes_begin()/nodes_end()

Hi Ioannis, On Thu, 2009-08-13 at 19:31 +0100, Ioannis Nousias wrote: > Thanks Tobi for the tip. > > however I also need the Data-Flow-Graph of each basic block/functions. > As I said, I need a view of how the instructions 'link' to each other > (via registers or memory aliasing or whatnot) I believe that there is not yet a DOT printer for this kind of information.

...t;> >>> Value *V = ... >>> for(df_iterator<Value*> UI = df_begin(V), UE = df_end(V); UI != UE; >>> ++UI) { >>> ... >>> } >>> >>> >>> typedef SmallPtrSet<const Value*, 16> SmallValueSet; >>> SmallValueSet DFSet; >>> const User* U = ...; >>> for (idf_ext_iterator<const User*, SmallValueSet> I=idf_ext_begin(U, >>> DFSet), E=idf_ext_end(U, DFSet); I != E; ++I) { >>> .. >>> } >>> >>> >>> >>> >> I don't u...