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()
1448 if (SU->isAvailable && !SU->NodeQueueId) { in releaseInterferences()1530 if (!TrySU->isAvailable || !TrySU->NodeQueueId) { in PickNodeToScheduleBottomUp()1803 assert(!U->NodeQueueId && "Node in the queue already"); in push()1804 U->NodeQueueId = ++CurQueueId; in push()1810 assert(SU->NodeQueueId != 0 && "Not in queue!"); in remove()1815 SU->NodeQueueId = 0; in remove()1899 V->NodeQueueId = 0; in pop()2606 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()2623 assert(left->NodeQueueId && right->NodeQueueId && in BURRSort()2625 return (left->NodeQueueId > right->NodeQueueId); in BURRSort()
174 SU->NodeQueueId = 0; in initNodes()
544 bool isInQueue(SUnit *SU) const { return (SU->NodeQueueId & ID); } in isInQueue()564 SU->NodeQueueId |= ID; in push()568 (*I)->NodeQueueId &= ~ID; in remove()
265 unsigned NodeQueueId = 0; ///< Queue id of node. variable