Searched defs:EId (Results 1 - 25 of 42) sorted by relevance

12

/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
H A DGraph.h75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
77 AdjEdgeIds.push_back(EId);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
209 EdgeId EId = 0;
211 EId = FreeEdgeIds.back();
213 Edges[EId] = std::move(E);
215 EId
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); local
509 updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
535 getEdgeMetadata(EdgeId EId) argument
561 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
594 EdgeId EId = *AEItr; local
626 disconnectEdge(EdgeId EId, NodeId NId) argument
645 reconnectEdge(EdgeId EId, NodeId NId) argument
654 removeEdge(EdgeId EId) argument
[all...]
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Matrix &ECosts = G.getEdgeCosts(EId);
49 if (NId == G.getEdgeNode1Id(EId)) {
71 G.disconnectEdge(EId, MId);
203 for (auto EId : G.adjEdgeIds(NId)) {
204 const Matrix& edgeCosts = G.getEdgeCosts(EId);
205 if (NId == G.getEdgeNode1Id(EId)) {
206 NodeId mId = G.getEdgeNode2Id(EId);
209 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h39 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
42 const Matrix &ECosts = G.getEdgeCosts(EId);
47 if (NId == G.getEdgeNode1Id(EId)) {
69 G.disconnectEdge(EId, MId);
201 for (auto EId : G.adjEdgeIds(NId)) {
202 const Matrix& edgeCosts = G.getEdgeCosts(EId);
203 if (NId == G.getEdgeNode1Id(EId)) {
204 NodeId mId = G.getEdgeNode2Id(EId);
207 NodeId mId = G.getEdgeNode1Id(EId);
[all...]
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h39 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
42 const Matrix &ECosts = G.getEdgeCosts(EId);
47 if (NId == G.getEdgeNode1Id(EId)) {
69 G.disconnectEdge(EId, MId);
201 for (auto EId : G.adjEdgeIds(NId)) {
202 const Matrix& edgeCosts = G.getEdgeCosts(EId);
203 if (NId == G.getEdgeNode1Id(EId)) {
204 NodeId mId = G.getEdgeNode2Id(EId);
207 NodeId mId = G.getEdgeNode1Id(EId);
[all...]

Completed in 574 milliseconds

12