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

/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDFS.h79 struct NodeData { struct in class:llvm::SchedDFSResult
83 NodeData(): InstrCount(0), SubtreeID(InvalidSubtreeID) {} function in struct:llvm::SchedDFSResult::NodeData
105 std::vector<NodeData> DFSNodeData;
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h88 struct NodeData { struct in class:PBQP::Heuristics::Briggs
96 NodeData() function in struct:PBQP::Heuristics::Briggs::NodeData
137 NodeData &nd = getHeuristicNodeData(nItr);
187 NodeData &n1 = getHeuristicNodeData(n1Itr),
217 NodeData &n1 = getHeuristicNodeData(n1Itr),
260 NodeData &nd = getHeuristicNodeData(nItr);
297 NodeData& getHeuristicNodeData(Graph::NodeItr nItr) {
360 NodeData &nd = getHeuristicNodeData(nItr);
387 NodeData &nd = getHeuristicNodeData(nItr);
406 NodeData
[all...]
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h40 typedef typename HImpl::NodeData HeuristicNodeData;
52 class NodeData { class in class:PBQP::HeuristicSolverImpl
54 NodeData() : solverDegree(0) {} function in class:PBQP::HeuristicSolverImpl::NodeData
109 typedef std::list<NodeData> NodeDataList;
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)),
238 NodeData &nd = getSolverNodeData(xnItr);
290 NodeData &nd = getSolverNodeData(xnItr);
394 NodeData& getSolverNodeData(Graph::NodeItr nItr) {
395 return *static_cast<NodeData*>(g.getNodeData(nItr));
404 NodeData
[all...]

Completed in 177 milliseconds