2006-06-28 17:02:14 +02:00
|
|
|
/*
|
2013-05-30 18:54:11 +02:00
|
|
|
* Copyright (c) 2012-2013 ARM Limited
|
2012-11-02 17:32:02 +01:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* The license below extends only to copyright in the software and shall
|
|
|
|
* not be construed as granting a license to any other intellectual
|
|
|
|
* property including but not limited to intellectual property relating
|
|
|
|
* to a hardware implementation of the functionality of the software
|
|
|
|
* licensed hereunder. You may use the software subject to the license
|
|
|
|
* terms below provided that you ensure that this notice is replicated
|
|
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
|
|
* modified or unmodified, in source code or in binary form.
|
|
|
|
*
|
2006-06-28 17:02:14 +02:00
|
|
|
* Copyright (c) 2003-2005 The Regents of The University of Michigan
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Authors: Erik Hallnor
|
2012-11-02 17:32:02 +01:00
|
|
|
* Andreas Sandberg
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
/** @file
|
|
|
|
* Declaration of a structure to manage MSHRs.
|
|
|
|
*/
|
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
#ifndef __MEM__CACHE__MISS__MSHR_QUEUE_HH__
|
|
|
|
#define __MEM__CACHE__MISS__MSHR_QUEUE_HH__
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
#include <vector>
|
2007-06-18 02:27:53 +02:00
|
|
|
|
2008-02-10 23:45:25 +01:00
|
|
|
#include "mem/cache/mshr.hh"
|
2011-04-15 19:44:06 +02:00
|
|
|
#include "mem/packet.hh"
|
2012-11-02 17:32:02 +01:00
|
|
|
#include "sim/drain.hh"
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2006-10-23 05:38:34 +02:00
|
|
|
* A Class for maintaining a list of pending and allocated memory requests.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2012-11-02 17:32:02 +01:00
|
|
|
class MSHRQueue : public Drainable
|
2007-06-18 02:27:53 +02:00
|
|
|
{
|
2006-06-28 17:02:14 +02:00
|
|
|
private:
|
2008-01-02 21:20:15 +01:00
|
|
|
/** Local label (for functional print requests) */
|
|
|
|
const std::string label;
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
// Parameters
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* The total number of entries in this queue. This number is set as the
|
|
|
|
* number of entries requested plus (numReserve - 1). This allows for
|
|
|
|
* the same number of effective entries while still maintaining the reserve.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2007-06-18 02:27:53 +02:00
|
|
|
const int numEntries;
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* The number of entries to hold in reserve. This is needed because copy
|
|
|
|
* operations can allocate upto 4 entries at one time.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
|
|
|
const int numReserve;
|
|
|
|
|
2014-12-23 15:31:18 +01:00
|
|
|
/**
|
|
|
|
* The number of entries to reserve for future demand accesses.
|
|
|
|
* Prevent prefetcher from taking all mshr entries
|
|
|
|
*/
|
|
|
|
const int demandReserve;
|
|
|
|
|
2013-05-30 18:54:11 +02:00
|
|
|
/** MSHR storage. */
|
|
|
|
std::vector<MSHR> registers;
|
|
|
|
/** Holds pointers to all allocated entries. */
|
|
|
|
MSHR::List allocatedList;
|
|
|
|
/** Holds pointers to entries that haven't been sent to the bus. */
|
|
|
|
MSHR::List readyList;
|
|
|
|
/** Holds non allocated entries. */
|
|
|
|
MSHR::List freeList;
|
|
|
|
|
2012-11-02 17:32:02 +01:00
|
|
|
/** Drain manager to inform of a completed drain */
|
|
|
|
DrainManager *drainManager;
|
|
|
|
|
2007-06-25 15:47:05 +02:00
|
|
|
MSHR::Iterator addToReadyList(MSHR *mshr);
|
|
|
|
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
public:
|
2007-06-18 02:27:53 +02:00
|
|
|
/** The number of allocated entries. */
|
2006-06-28 17:02:14 +02:00
|
|
|
int allocated;
|
2007-06-18 02:27:53 +02:00
|
|
|
/** The number of entries that have been forwarded to the bus. */
|
|
|
|
int inServiceEntries;
|
2007-06-21 20:59:17 +02:00
|
|
|
/** The index of this queue within the cache (MSHR queue vs. write
|
|
|
|
* buffer). */
|
|
|
|
const int index;
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Create a queue with a given number of entries.
|
|
|
|
* @param num_entrys The number of entries in this queue.
|
|
|
|
* @param reserve The minimum number of entries needed to satisfy
|
|
|
|
* any access.
|
2014-12-23 15:31:18 +01:00
|
|
|
* @param demand_reserve The minimum number of entries needed to satisfy
|
|
|
|
* demand accesses.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2008-01-02 21:20:15 +01:00
|
|
|
MSHRQueue(const std::string &_label, int num_entries, int reserve,
|
2014-12-23 15:31:18 +01:00
|
|
|
int demand_reserve, int index);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Find the first MSHR that matches the provided address.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param addr The address to find.
|
2014-01-24 22:29:30 +01:00
|
|
|
* @param is_secure True if the target memory space is secure.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @return Pointer to the matching MSHR, null if not found.
|
|
|
|
*/
|
2014-01-24 22:29:30 +01:00
|
|
|
MSHR *findMatch(Addr addr, bool is_secure) const;
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Find and return all the matching entries in the provided vector.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param addr The address to find.
|
2014-01-24 22:29:30 +01:00
|
|
|
* @param is_secure True if the target memory space is secure.
|
2007-06-18 02:27:53 +02:00
|
|
|
* @param matches The vector to return pointers to the matching entries.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @return True if any matches are found, false otherwise.
|
|
|
|
* @todo Typedef the vector??
|
|
|
|
*/
|
2014-01-24 22:29:30 +01:00
|
|
|
bool findMatches(Addr addr, bool is_secure,
|
|
|
|
std::vector<MSHR*>& matches) const;
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2006-10-23 05:38:34 +02:00
|
|
|
* Find any pending requests that overlap the given request.
|
2006-08-15 01:25:07 +02:00
|
|
|
* @param pkt The request to find.
|
2014-01-24 22:29:30 +01:00
|
|
|
* @param is_secure True if the target memory space is secure.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @return A pointer to the earliest matching MSHR.
|
|
|
|
*/
|
2014-01-24 22:29:30 +01:00
|
|
|
MSHR *findPending(Addr addr, int size, bool is_secure) const;
|
2006-06-28 17:02:14 +02:00
|
|
|
|
2007-07-27 21:46:45 +02:00
|
|
|
bool checkFunctional(PacketPtr pkt, Addr blk_addr);
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
/**
|
2006-10-23 05:38:34 +02:00
|
|
|
* Allocates a new MSHR for the request and size. This places the request
|
2006-06-28 17:02:14 +02:00
|
|
|
* as the first target in the MSHR.
|
2006-08-15 01:25:07 +02:00
|
|
|
* @param pkt The request to handle.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param size The number in bytes to fetch from memory.
|
|
|
|
* @return The a pointer to the MSHR allocated.
|
|
|
|
*
|
2007-06-18 02:27:53 +02:00
|
|
|
* @pre There are free entries.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2007-06-25 15:47:05 +02:00
|
|
|
MSHR *allocate(Addr addr, int size, PacketPtr &pkt,
|
|
|
|
Tick when, Counter order);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Removes the given MSHR from the queue. This places the MSHR on the
|
|
|
|
* free list.
|
|
|
|
* @param mshr
|
|
|
|
*/
|
2007-06-18 02:27:53 +02:00
|
|
|
void deallocate(MSHR *mshr);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Remove a MSHR from the queue. Returns an iterator into the
|
|
|
|
* allocatedList for faster squash implementation.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param mshr The MSHR to remove.
|
|
|
|
* @return An iterator to the next entry in the allocatedList.
|
|
|
|
*/
|
2007-06-18 02:27:53 +02:00
|
|
|
MSHR::Iterator deallocateOne(MSHR *mshr);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Moves the MSHR to the front of the pending list if it is not
|
|
|
|
* in service.
|
|
|
|
* @param mshr The entry to move.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
|
|
|
void moveToFront(MSHR *mshr);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Mark the given MSHR as in service. This removes the MSHR from the
|
2015-02-03 20:25:59 +01:00
|
|
|
* readyList or deallocates the MSHR if it does not expect a response.
|
|
|
|
*
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param mshr The MSHR to mark in service.
|
2015-02-03 20:25:59 +01:00
|
|
|
* @param pending_dirty_resp Whether we expect a dirty response
|
|
|
|
* from another cache
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2015-02-03 20:25:59 +01:00
|
|
|
void markInService(MSHR *mshr, bool pending_dirty_resp);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Mark an in service entry as pending, used to resend a request.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @param mshr The MSHR to resend.
|
|
|
|
*/
|
2007-06-18 02:27:53 +02:00
|
|
|
void markPending(MSHR *mshr);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
|
|
|
/**
|
2006-10-23 05:38:34 +02:00
|
|
|
* Squash outstanding requests with the given thread number. If a request
|
2006-06-28 17:02:14 +02:00
|
|
|
* is in service, just squashes the targets.
|
2006-08-15 01:25:07 +02:00
|
|
|
* @param threadNum The thread to squash.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2006-06-28 23:28:33 +02:00
|
|
|
void squash(int threadNum);
|
2006-06-28 17:02:14 +02:00
|
|
|
|
2014-05-10 00:58:46 +02:00
|
|
|
/**
|
|
|
|
* Deallocate top target, possibly freeing the MSHR
|
|
|
|
* @return if MSHR queue is no longer full
|
|
|
|
*/
|
|
|
|
bool forceDeallocateTarget(MSHR *mshr);
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
/**
|
|
|
|
* Returns true if the pending list is not empty.
|
2006-10-23 05:38:34 +02:00
|
|
|
* @return True if there are outstanding requests.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
|
|
|
bool havePending() const
|
|
|
|
{
|
2007-06-25 15:47:05 +02:00
|
|
|
return !readyList.empty();
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2007-06-18 02:27:53 +02:00
|
|
|
* Returns true if there are no free entries.
|
2006-06-28 17:02:14 +02:00
|
|
|
* @return True if this queue is full.
|
|
|
|
*/
|
|
|
|
bool isFull() const
|
|
|
|
{
|
2007-06-18 02:27:53 +02:00
|
|
|
return (allocated > numEntries - numReserve);
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
|
|
|
|
2014-12-23 15:31:18 +01:00
|
|
|
/**
|
|
|
|
* Returns true if sufficient mshrs for prefetch.
|
|
|
|
* @return True if sufficient mshrs for prefetch.
|
|
|
|
*/
|
|
|
|
bool canPrefetch() const
|
|
|
|
{
|
|
|
|
return (allocated < numEntries - (numReserve + demandReserve));
|
|
|
|
}
|
|
|
|
|
2006-06-28 17:02:14 +02:00
|
|
|
/**
|
2007-06-25 15:47:05 +02:00
|
|
|
* Returns the MSHR at the head of the readyList.
|
2006-10-23 05:38:34 +02:00
|
|
|
* @return The next request to service.
|
2006-06-28 17:02:14 +02:00
|
|
|
*/
|
2007-06-18 02:27:53 +02:00
|
|
|
MSHR *getNextMSHR() const
|
2006-06-28 17:02:14 +02:00
|
|
|
{
|
2011-01-08 06:50:29 +01:00
|
|
|
if (readyList.empty() || readyList.front()->readyTime > curTick()) {
|
2006-06-28 17:02:14 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
2007-06-25 15:47:05 +02:00
|
|
|
return readyList.front();
|
|
|
|
}
|
|
|
|
|
2007-06-30 22:34:16 +02:00
|
|
|
Tick nextMSHRReadyTime() const
|
2007-06-25 15:47:05 +02:00
|
|
|
{
|
2007-06-30 22:34:16 +02:00
|
|
|
return readyList.empty() ? MaxTick : readyList.front()->readyTime;
|
2006-06-28 17:02:14 +02:00
|
|
|
}
|
2012-11-02 17:32:02 +01:00
|
|
|
|
|
|
|
unsigned int drain(DrainManager *dm);
|
2006-06-28 17:02:14 +02:00
|
|
|
};
|
|
|
|
|
2007-06-18 02:27:53 +02:00
|
|
|
#endif //__MEM__CACHE__MISS__MSHR_QUEUE_HH__
|