Lines Matching refs:entry
104 typename Entry::Iterator addToReadyList(Entry* entry)
107 readyList.back()->readyTime <= entry->readyTime) {
108 return readyList.insert(readyList.end(), entry);
112 if ((*i)->readyTime > entry->readyTime) {
113 return readyList.insert(i, entry);
159 * Find the first entry that matches the provided address.
169 for (const auto& entry : allocatedList) {
176 if (!(ignore_uncacheable && entry->isUncacheable()) &&
177 entry->matchBlockAddr(blk_addr, is_secure)) {
178 return entry;
187 for (const auto& entry : allocatedList) {
188 if (entry->matchBlockAddr(pkt) &&
189 entry->trySatisfyFunctional(pkt)) {
202 * @param entry The entry to be compared against.
203 * @return A pointer to the earliest matching entry.
205 Entry* findPending(const QueueEntry* entry) const
208 if (ready_entry->conflictAddr(entry)) {
233 * Removes the given entry from the queue. This places the entry
236 * @param entry
238 void deallocate(Entry *entry)
240 allocatedList.erase(entry->allocIter);
241 freeList.push_front(entry);
243 if (entry->inService) {
246 readyList.erase(entry->readyIter);
248 entry->deallocate();