Searched refs:EdgeData (Results 1 - 3 of 3) sorted by relevance

/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h101 struct EdgeData { struct in class:PBQP::Heuristics::Briggs
107 EdgeData() : worst(0), reverseWorst(0), isUpToDate(false) {} function in struct:PBQP::Heuristics::Briggs::EdgeData
195 EdgeData &ed = getHeuristicEdgeData(eId);
267 EdgeData &ed = getHeuristicEdgeData(eId);
301 EdgeData& getHeuristicEdgeData(Graph::EdgeId eId) {
308 EdgeData &ed = getHeuristicEdgeData(eId);
356 EdgeData &ed = getHeuristicEdgeData(eId);
364 EdgeData::UnsafeArray &unsafe =
383 EdgeData &ed = getHeuristicEdgeData(eId);
391 EdgeData
[all...]
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h41 typedef typename HImpl::EdgeData HeuristicEdgeData;
82 class EdgeData { class in class:PBQP::HeuristicSolverImpl
112 typedef std::list<EdgeData> EdgeDataList;
165 EdgeData &eData = getSolverEdgeData(eId);
372 edgeDataList.push_back(EdgeData());
398 EdgeData& getSolverEdgeData(Graph::EdgeId eId) {
399 return *static_cast<EdgeData*>(g.getEdgeData(eId));
403 EdgeData &eData = getSolverEdgeData(eId);
426 edgeDataList.push_back(EdgeData());
/freebsd-9.3-release/contrib/llvm/lib/Analysis/
H A DMemoryBuiltins.cpp756 SizeOffsetEvalType EdgeData = compute_(PHI.getIncomingValue(i)); local
758 if (!bothKnown(EdgeData)) {
765 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
766 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));

Completed in 97 milliseconds