Displaying 3 results from an estimated 3 matches for "timinggraph".
2010 Mar 26
2
[LLVMdev] Why is BasicBlock's copy constructor private?
...graph processing, could you just use a
> boost::directed_graph<llvm::BasicBlock*> instead?
Yeah, that was one of the first things I tried:
for (Function::iterator i = function.begin(), e = function.end(); i !=
e; ++i) {
BasicBlock *basicBlockPtr = &(*i);
add_vertex(basicBlockPtr, timingGraph);
}
The "&(*i)" sure seems weird, but I don't know how else to grab a
pointer to the BasicBlock from within the iterator.
Also, if I then try to extract a vertex from the graph:
BasicBlock *basicBlockPtr = timingGraph[0];
...the whole thing segfaults. So I'm basically...
2010 Mar 26
0
[LLVMdev] Why is BasicBlock's copy constructor private?
On 25 March 2010 20:04, Trevor Harmon <trevor.w.harmon at nasa.gov> wrote:
>
> So why exactly is BasicBlock's copy constructor private? The ominous
> "Do not implement" warning leads me to think there is some sort of
> design issue that is preventing a copy constructor here. Is there any
> possibility of working around it?
>
I think the problem is that LLVM
2010 Mar 26
3
[LLVMdev] Why is BasicBlock's copy constructor private?
Hi,
LLVM provides basic graph traversal for its CFGs, but I need
additional operations, such as iterating over the edges. I thought I
would solve this problem using the Boost graph library. It should be
relatively simple to walk an LLVM CFG and add the BasicBlock objects
to a Boost graph declared as:
typedef boost::directed_graph<llvm::BasicBlock> Graph;
Once constructed, this