Searched refs:NodeQueueId (Results 1 – 5 of 5) sorted by relevance
235 assert(left->NodeQueueId && right->NodeQueueId && in pickBest()237 return (left->NodeQueueId > right->NodeQueueId) ? right : left; in pickBest()262 C.SU->NodeQueueId = CurQueueId++; in releasePending()
1463 if (SU->isAvailable && !SU->NodeQueueId) { in releaseInterferences()1544 if (!TrySU->isAvailable || !TrySU->NodeQueueId) { in PickNodeToScheduleBottomUp()1817 assert(!U->NodeQueueId && "Node in the queue already"); in push()1818 U->NodeQueueId = ++CurQueueId; in push()1824 assert(SU->NodeQueueId != 0 && "Not in queue!"); in remove()1829 SU->NodeQueueId = 0; in remove()1913 V->NodeQueueId = 0; in pop()2630 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()2647 assert(left->NodeQueueId && right->NodeQueueId && in BURRSort()2649 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()
169 SU.NodeQueueId = 0; in initNodes()
547 bool isInQueue(SUnit *SU) const { return (SU->NodeQueueId & ID); } in isInQueue()567 SU->NodeQueueId |= ID; in push()571 (*I)->NodeQueueId &= ~ID; in remove()
265 unsigned NodeQueueId = 0; ///< Queue id of node. variable