HomeSort by relevance Sort by last modified time
    Searched refs:GraphBase (Results 1 - 5 of 5) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Solution.h 30 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
76 void setSelection(GraphBase::NodeId nodeId, unsigned selection) {
83 unsigned getSelection(GraphBase::NodeId nodeId) const {
ReductionRules.h 180 typedef GraphBase::NodeId NodeId;
Graph.h 28 class GraphBase {
48 class Graph : public GraphBase {
  /external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
158 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const {
161 return GraphBase::invalidNodeId();
174 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
338 typedef GraphBase::NodeId NodeId;
339 typedef GraphBase::EdgeId EdgeId;
490 std::vector<GraphBase::NodeId> reduce() {
493 typedef GraphBase::NodeId NodeId;
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 184 typedef std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId> IEdgeKey;
220 typedef std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>
231 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) {
328 PBQP::GraphBase::NodeId NId = getNodeId(Cur);
330 PBQP::GraphBase::NodeId MId = getNodeId(A);

Completed in 616 milliseconds