Lines Matching refs:nd
138 NodeData &nd = getHeuristicNodeData(nItr);
140 nd.isHeuristic = true;
141 if (nd.isAllocable) {
142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr);
144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr);
261 NodeData &nd = getHeuristicNodeData(nItr);
265 if (!nd.isHeuristic)
273 bool ndWasAllocable = nd.isAllocable;
279 nd.isHeuristic = false;
282 rnAllocableList.erase(nd.rnaItr);
284 rnUnallocableList.erase(nd.rnuItr);
289 if (!ndWasAllocable && nd.isAllocable) {
290 rnUnallocableList.erase(nd.rnuItr);
291 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr);
361 NodeData &nd = getHeuristicNodeData(nItr);
367 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
371 if (nd.unsafeDegrees[r]==0) {
372 --nd.numSafe;
374 ++nd.unsafeDegrees[r];
388 NodeData &nd = getHeuristicNodeData(nItr);
394 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
398 if (nd.unsafeDegrees[r] == 1) {
399 ++nd.numSafe;
401 --nd.unsafeDegrees[r];
407 NodeData &nd = getHeuristicNodeData(nItr);
409 nd.isAllocable = nd.numDenied < numRegs || nd.numSafe > 0;
413 NodeData &nd = getHeuristicNodeData(nItr);
415 if (nd.isInitialized)
420 nd.numDenied = 0;
421 nd.numSafe = numRegs;
422 nd.unsafeDegrees.resize(numRegs, 0);
436 nd.isInitialized = true;