Searched refs:EdgeId (Results 1 - 5 of 5) sorted by relevance

/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h33 typedef unsigned EdgeId; typedef in class:PBQP::Graph
58 AdjEdgeItr addEdge(EdgeId e) {
98 typedef std::vector<EdgeId> FreeEdgeVector;
107 EdgeEntry& getEdge(EdgeId eId) { return edges[eId]; }
108 const EdgeEntry& getEdge(EdgeId eId) const { return edges[eId]; }
123 EdgeId addConstructedEdge(const EdgeEntry &e) {
126 EdgeId edgeId = 0;
183 EdgeItr(EdgeId edgeId, const Graph &g)
191 EdgeId operator*() const { return edgeId; }
194 EdgeId findNextInUs
[all...]
H A DHeuristicBase.h203 void preUpdateEdgeCosts(Graph::EdgeId eId) {
209 void postUpdateEdgeCostts(Graph::EdgeId eId) {
215 void handleAddEdge(Graph::EdgeId eId) {
226 void handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) {
H A DHeuristicSolver.h43 typedef std::list<Graph::EdgeId> SolverEdges;
58 SolverEdgeItr addSolverEdge(Graph::EdgeId eId) {
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeId eId) {
164 void removeSolverEdge(Graph::EdgeId eId) {
213 Graph::EdgeId eId(*aeItr);
242 Graph::EdgeId eId = *nd.solverEdgesBegin();
294 Graph::EdgeId yxeId = *aeItr,
336 Graph::EdgeId yzeId = g.findEdge(ynId, znId);
398 EdgeData& getSolverEdgeData(Graph::EdgeId eId) {
402 void addSolverEdge(Graph::EdgeId eI
[all...]
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h183 void preUpdateEdgeCosts(Graph::EdgeId eId) {
201 void postUpdateEdgeCosts(Graph::EdgeId eId) {
213 void handleAddEdge(Graph::EdgeId eId) {
259 void handleRemoveEdge(Graph::EdgeId eId, Graph::NodeId nId) {
301 EdgeData& getHeuristicEdgeData(Graph::EdgeId eId) {
307 void computeEdgeContributions(Graph::EdgeId eId) {
355 void addEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) {
382 void subtractEdgeContributions(Graph::EdgeId eId, Graph::NodeId nId) {
435 Graph::EdgeId eId = *aeItr;
446 std::vector<Graph::EdgeId> edgesToRemov
[all...]
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp275 PBQP::Graph::EdgeId edge =
374 PBQP::Graph::EdgeId edge = g.findEdge(node1, node2);

Completed in 51 milliseconds