2014-02-24 02:16:15 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2011 Mark D. Hill and David A. Wood
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2011-02-26 00:54:56 +01:00
|
|
|
#include <iostream>
|
|
|
|
|
|
|
|
#include "mem/ruby/slicc_interface/RubyRequest.hh"
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
2011-03-22 12:41:54 +01:00
|
|
|
void
|
|
|
|
RubyRequest::print(ostream& out) const
|
2011-02-26 00:54:56 +01:00
|
|
|
{
|
2011-03-22 12:41:54 +01:00
|
|
|
out << "[RubyRequest: ";
|
2015-09-18 20:27:47 +02:00
|
|
|
out << hex << "LineAddress = 0x" << m_LineAddress << dec << " ";
|
|
|
|
out << hex << "PhysicalAddress = 0x" << m_PhysicalAddress << dec << " ";
|
2011-03-22 12:41:54 +01:00
|
|
|
out << "Type = " << m_Type << " ";
|
2015-09-18 20:27:47 +02:00
|
|
|
out << hex << "ProgramCounter = 0x" << m_ProgramCounter << dec << " ";
|
2011-03-22 12:41:54 +01:00
|
|
|
out << "AccessMode = " << m_AccessMode << " ";
|
|
|
|
out << "Size = " << m_Size << " ";
|
|
|
|
out << "Prefetch = " << m_Prefetch << " ";
|
|
|
|
// out << "Time = " << getTime() << " ";
|
|
|
|
out << "]";
|
2011-02-26 00:54:56 +01:00
|
|
|
}
|
2012-10-16 00:51:57 +02:00
|
|
|
|
|
|
|
bool
|
|
|
|
RubyRequest::functionalRead(Packet *pkt)
|
|
|
|
{
|
|
|
|
// This needs a little explanation. Initially I thought that this
|
|
|
|
// message should be read. But the way the memtester works for now,
|
|
|
|
// we should not be reading this message as memtester updates the
|
|
|
|
// functional memory only after a write has actually taken place.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
RubyRequest::functionalWrite(Packet *pkt)
|
|
|
|
{
|
|
|
|
// This needs a little explanation. I am not sure if this message
|
|
|
|
// should be written. Essentially the question is how are writes
|
|
|
|
// ordered. I am assuming that if a functional write is issued after
|
|
|
|
// a timing write to the same address, then the functional write
|
|
|
|
// has to overwrite the data for the timing request, even if the
|
|
|
|
// timing request has still not been ordered globally.
|
|
|
|
|
2013-03-03 06:12:55 +01:00
|
|
|
Addr wBase = pkt->getAddr();
|
|
|
|
Addr wTail = wBase + pkt->getSize();
|
2015-08-14 19:04:51 +02:00
|
|
|
Addr mBase = m_PhysicalAddress;
|
2013-03-03 06:12:55 +01:00
|
|
|
Addr mTail = mBase + m_Size;
|
2012-10-16 00:51:57 +02:00
|
|
|
|
2014-12-02 12:07:36 +01:00
|
|
|
const uint8_t * pktData = pkt->getConstPtr<uint8_t>();
|
2012-10-16 00:51:57 +02:00
|
|
|
|
2013-03-03 06:12:55 +01:00
|
|
|
Addr cBase = std::max(wBase, mBase);
|
|
|
|
Addr cTail = std::min(wTail, mTail);
|
2012-10-16 00:51:57 +02:00
|
|
|
|
2013-03-03 06:12:55 +01:00
|
|
|
for (Addr i = cBase; i < cTail; ++i) {
|
|
|
|
data[i - mBase] = pktData[i - wBase];
|
2012-10-16 00:51:57 +02:00
|
|
|
}
|
2013-03-03 06:12:55 +01:00
|
|
|
|
|
|
|
return cBase < cTail;
|
2012-10-16 00:51:57 +02:00
|
|
|
}
|