mshr_queue.hh (7667:aa8fd8f6a495) mshr_queue.hh (7823:dac01f14f20f)
1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 185 unchanged lines hidden (view full) ---

194 }
195
196 /**
197 * Returns the MSHR at the head of the readyList.
198 * @return The next request to service.
199 */
200 MSHR *getNextMSHR() const
201 {
1/*
2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;

--- 185 unchanged lines hidden (view full) ---

194 }
195
196 /**
197 * Returns the MSHR at the head of the readyList.
198 * @return The next request to service.
199 */
200 MSHR *getNextMSHR() const
201 {
202 if (readyList.empty() || readyList.front()->readyTime > curTick) {
202 if (readyList.empty() || readyList.front()->readyTime > curTick()) {
203 return NULL;
204 }
205 return readyList.front();
206 }
207
208 Tick nextMSHRReadyTime() const
209 {
210 return readyList.empty() ? MaxTick : readyList.front()->readyTime;
211 }
212};
213
214#endif //__MEM__CACHE__MISS__MSHR_QUEUE_HH__
203 return NULL;
204 }
205 return readyList.front();
206 }
207
208 Tick nextMSHRReadyTime() const
209 {
210 return readyList.empty() ? MaxTick : readyList.front()->readyTime;
211 }
212};
213
214#endif //__MEM__CACHE__MISS__MSHR_QUEUE_HH__