Searched refs:NodeQueueId (Results 1 – 5 of 5) sorted by relevance
233 assert(left->NodeQueueId && right->NodeQueueId && in pickBest()235 return (left->NodeQueueId > right->NodeQueueId) ? right : left; in pickBest()260 C.SU->NodeQueueId = CurQueueId++; in releasePending()
1456 if (SU->isAvailable && !SU->NodeQueueId) { in releaseInterferences()1537 if (!TrySU->isAvailable || !TrySU->NodeQueueId) { in PickNodeToScheduleBottomUp()1810 assert(!U->NodeQueueId && "Node in the queue already"); in push()1811 U->NodeQueueId = ++CurQueueId; in push()1817 assert(SU->NodeQueueId != 0 && "Not in queue!"); in remove()1822 SU->NodeQueueId = 0; in remove()1906 V->NodeQueueId = 0; in pop()2622 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()2639 assert(left->NodeQueueId && right->NodeQueueId && in BURRSort()2641 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()
169 SU.NodeQueueId = 0; in initNodes()
553 bool isInQueue(SUnit *SU) const { return (SU->NodeQueueId & ID); } in isInQueue()573 SU->NodeQueueId |= ID; in push()577 (*I)->NodeQueueId &= ~ID; in remove()
271 unsigned NodeQueueId = 0; ///< Queue id of node. variable