OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:NodeItr
(Results
1 - 7
of
7
) sorted by null
/external/llvm/include/llvm/CodeGen/PBQP/
HeuristicBase.h
25
/// <li> void addToHeuristicList(Graph::
NodeItr
) : Add a node to the
34
/// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::
NodeItr
) : Handle the
55
typedef std::list<Graph::
NodeItr
> OptimalList;
66
void addToOptimalReductionList(Graph::
NodeItr
nItr) {
108
bool shouldOptimallyReduce(Graph::
NodeItr
nItr) {
121
void addToOptimalReduceList(Graph::
NodeItr
nItr) {
133
for (Graph::
NodeItr
nItr = g.nodesBegin(), nEnd = g.nodesEnd();
153
Graph::
NodeItr
nItr = optimalList.front();
188
void addToHeuristicList(Graph::
NodeItr
nItr) {
226
void handleRemoveEdge(Graph::EdgeItr eItr, Graph::
NodeItr
nItr)
[
all
...]
Graph.h
40
typedef NodeList::iterator
NodeItr
;
86
NodeItr
node1, node2;
92
EdgeEntry(
NodeItr
node1,
NodeItr
node2, const Matrix &costs)
94
NodeItr
getNode1() const { return node1; }
95
NodeItr
getNode2() const { return node2; }
116
NodeEntry& getNode(
NodeItr
nItr) { return *nItr; }
122
NodeItr
addConstructedNode(const NodeEntry &n) {
173
NodeItr
addNode(const Vector &costs) {
181
EdgeItr addEdge(Graph::
NodeItr
n1Itr, Graph::NodeItr n2Itr
[
all
...]
HeuristicSolver.h
107
std::vector<Graph::
NodeItr
> stack;
130
HeuristicNodeData& getHeuristicNodeData(Graph::
NodeItr
nItr) {
146
SolverEdgeItr solverEdgesBegin(Graph::
NodeItr
nItr) {
155
SolverEdgeItr solverEdgesEnd(Graph::
NodeItr
nItr) {
192
void pushToStack(Graph::
NodeItr
nItr) {
200
unsigned getSolverDegree(Graph::
NodeItr
nItr) {
207
void setSolution(const Graph::
NodeItr
&nItr, unsigned selection) {
214
Graph::
NodeItr
anItr(g.getEdgeOtherNode(eItr, nItr));
223
void applyR0(Graph::
NodeItr
nItr) {
237
void applyR1(Graph::
NodeItr
xnItr)
[
all
...]
Solution.h
76
void setSelection(Graph::
NodeItr
nItr, unsigned selection) {
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h
50
bool operator()(Graph::
NodeItr
n1Itr, Graph::
NodeItr
n2Itr) const {
63
bool operator()(Graph::
NodeItr
n1Itr, Graph::
NodeItr
n2Itr) const {
80
typedef std::list<Graph::
NodeItr
> RNAllocableList;
83
typedef std::list<Graph::
NodeItr
> RNUnallocableList;
126
bool shouldOptimallyReduce(Graph::
NodeItr
nItr) {
136
void addToHeuristicReduceList(Graph::
NodeItr
nItr) {
162
Graph::
NodeItr
nItr = *rnaItr;
171
Graph::
NodeItr
nItr = *rnuItr
[
all
...]
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
55
void recordVReg(unsigned vreg, PBQP::Graph::
NodeItr
node,
70
PBQP::Graph::
NodeItr
getNodeForVReg(unsigned vreg) const;
97
typedef DenseMap<unsigned, PBQP::Graph::
NodeItr
> VReg2Node;
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
167
PBQP::Graph::
NodeItr
PBQPRAProblem::getNodeForVReg(unsigned vreg) const {
168
VReg2Node::const_iterator
nodeItr
= vreg2Node.find(vreg);
169
assert(
nodeItr
!= vreg2Node.end() && "No node for vreg.");
170
return
nodeItr
->second;
250
PBQP::Graph::
NodeItr
node =
367
PBQP::Graph::
NodeItr
node = p->getNodeForVReg(src);
373
PBQP::Graph::
NodeItr
node1 = p->getNodeForVReg(dst);
374
PBQP::Graph::
NodeItr
node2 = p->getNodeForVReg(src);
Completed in 804 milliseconds