| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 31 typedef unsigned EdgeId;
39 static EdgeId invalidEdgeId() {
40 return std::numeric_limits<EdgeId>::max();
66 typedef std::vector<EdgeId> AdjEdgeList;
76 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
119 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
135 void connect(Graph &G, EdgeId ThisEdgeId) {
187 typedef std::vector<EdgeId> FreeEdgeVector;
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId];
[all...] |
| ReductionRules.h | 31 typedef typename GraphT::EdgeId EdgeId;
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
75 typedef typename GraphT::EdgeId EdgeId;
86 EdgeId YXEId = *AEItr,
128 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 32 typedef unsigned EdgeId;
40 static EdgeId invalidEdgeId() {
41 return std::numeric_limits<EdgeId>::max();
67 typedef std::vector<EdgeId> AdjEdgeList;
77 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
113 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
120 void connect(Graph &G, EdgeId ThisEdgeId) {
172 typedef std::vector<EdgeId> FreeEdgeVector;
187 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
188 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 31 typedef typename GraphT::EdgeId EdgeId;
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
75 typedef typename GraphT::EdgeId EdgeId;
86 EdgeId YXEId = *AEItr,
128 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 32 typedef unsigned EdgeId;
40 static EdgeId invalidEdgeId() {
41 return std::numeric_limits<EdgeId>::max();
67 typedef std::vector<EdgeId> AdjEdgeList;
77 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
113 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
120 void connect(Graph &G, EdgeId ThisEdgeId) {
172 typedef std::vector<EdgeId> FreeEdgeVector;
187 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
188 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 31 typedef typename GraphT::EdgeId EdgeId;
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
75 typedef typename GraphT::EdgeId EdgeId;
86 EdgeId YXEId = *AEItr,
128 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId;
41 EdgeId EId = *G.adjEdgeIds(NId).begin();
77 using EdgeId = typename GraphT::EdgeId;
88 EdgeId YXEId = *AEItr,
130 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/ |
| Graph.h | 30 using EdgeId = unsigned;
38 static EdgeId invalidEdgeId() {
39 return std::numeric_limits<EdgeId>::max();
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) {
112 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) {
119 void connect(Graph &G, EdgeId ThisEdgeId) {
173 using FreeEdgeVector = std::vector<EdgeId>;
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId];
[all...] |
