Use ilist rather than std::list for Node and Edge lists in the PBQP graph. This

should fix an issue (described at http://stackoverflow.com/questions/10065384/instantiation-of-a-list-with-an-incomplete-type-in-a-typedef)
that was preventing LLVMCodeGen from building with libc++ in C++11 mode.

llvm-svn: 166484
This commit is contained in:
Lang Hames 2012-10-23 17:10:51 +00:00
parent 1ad26f0423
commit dd8574e8fb
1 changed files with 13 additions and 8 deletions

View File

@ -19,6 +19,7 @@
#include <list>
#include <map>
#include <llvm/ADT/ilist.h>
namespace PBQP {
@ -31,16 +32,16 @@ namespace PBQP {
class NodeEntry;
class EdgeEntry;
typedef std::list<NodeEntry> NodeList;
typedef std::list<EdgeEntry> EdgeList;
typedef llvm::ilist<NodeEntry> NodeList;
typedef llvm::ilist<EdgeEntry> EdgeList;
public:
typedef NodeList::iterator NodeItr;
typedef NodeList::const_iterator ConstNodeItr;
typedef NodeEntry* NodeItr;
typedef const NodeEntry* ConstNodeItr;
typedef EdgeList::iterator EdgeItr;
typedef EdgeList::const_iterator ConstEdgeItr;
typedef EdgeEntry* EdgeItr;
typedef const EdgeEntry* ConstEdgeItr;
private:
@ -52,12 +53,14 @@ namespace PBQP {
private:
class NodeEntry {
class NodeEntry : public llvm::ilist_node<NodeEntry> {
friend struct llvm::ilist_sentinel_traits<NodeEntry>;
private:
Vector costs;
AdjEdgeList adjEdges;
unsigned degree;
void *data;
NodeEntry() : costs(0, 0) {}
public:
NodeEntry(const Vector &costs) : costs(costs), degree(0) {}
Vector& getCosts() { return costs; }
@ -77,12 +80,14 @@ namespace PBQP {
void* getData() { return data; }
};
class EdgeEntry {
class EdgeEntry : public llvm::ilist_node<EdgeEntry> {
friend struct llvm::ilist_sentinel_traits<EdgeEntry>;
private:
NodeItr node1, node2;
Matrix costs;
AdjEdgeItr node1AEItr, node2AEItr;
void *data;
EdgeEntry() : costs(0, 0, 0) {}
public:
EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
: node1(node1), node2(node2), costs(costs) {}