2004-02-11 22:07:55 +01:00
|
|
|
/*
|
2006-03-30 00:37:25 +02:00
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
2004-02-11 22:07:55 +01:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "dev/io_device.hh"
|
2004-04-06 19:02:00 +02:00
|
|
|
#include "sim/builder.hh"
|
2004-02-11 22:07:55 +01:00
|
|
|
|
2006-03-21 21:45:31 +01:00
|
|
|
|
2006-03-26 00:31:20 +01:00
|
|
|
PioPort::PioPort(PioDevice *dev, Platform *p)
|
|
|
|
: device(dev), platform(p)
|
2006-03-21 21:45:31 +01:00
|
|
|
{ }
|
|
|
|
|
|
|
|
|
|
|
|
Tick
|
|
|
|
PioPort::recvAtomic(Packet &pkt)
|
|
|
|
{
|
|
|
|
return device->recvAtomic(pkt);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
PioPort::recvFunctional(Packet &pkt)
|
|
|
|
{
|
|
|
|
device->recvAtomic(pkt);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
PioPort::getDeviceAddressRanges(AddrRangeList &range_list, bool &owner)
|
|
|
|
{
|
|
|
|
device->addressRanges(range_list, owner);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Packet *
|
|
|
|
PioPort::recvRetry()
|
|
|
|
{
|
|
|
|
Packet* pkt = transmitList.front();
|
|
|
|
transmitList.pop_front();
|
|
|
|
return pkt;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-01-31 20:20:39 +01:00
|
|
|
void
|
|
|
|
PioPort::SendEvent::process()
|
|
|
|
{
|
2006-03-21 21:45:31 +01:00
|
|
|
if (port->Port::sendTiming(packet) == Success)
|
2006-01-31 20:20:39 +01:00
|
|
|
return;
|
|
|
|
|
|
|
|
port->transmitList.push_back(&packet);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool
|
2006-03-21 21:45:31 +01:00
|
|
|
PioPort::recvTiming(Packet &pkt)
|
2006-01-31 20:20:39 +01:00
|
|
|
{
|
|
|
|
device->recvAtomic(pkt);
|
2006-03-26 00:31:20 +01:00
|
|
|
sendTiming(pkt, pkt.time-pkt.req->time);
|
2006-01-31 20:20:39 +01:00
|
|
|
return Success;
|
|
|
|
}
|
2004-02-11 22:07:55 +01:00
|
|
|
|
|
|
|
PioDevice::~PioDevice()
|
|
|
|
{
|
2006-01-31 20:20:39 +01:00
|
|
|
if (pioPort)
|
2006-03-21 21:45:31 +01:00
|
|
|
delete pioPort;
|
2004-02-11 22:07:55 +01:00
|
|
|
}
|
|
|
|
|
2006-03-21 21:45:31 +01:00
|
|
|
|
|
|
|
DmaPort::DmaPort(DmaDevice *dev)
|
|
|
|
: device(dev)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
bool
|
|
|
|
DmaPort::recvTiming(Packet &pkt)
|
2006-01-31 20:20:39 +01:00
|
|
|
{
|
2006-03-21 21:45:31 +01:00
|
|
|
completionEvent->schedule(curTick+1);
|
|
|
|
completionEvent = NULL;
|
|
|
|
return Success;
|
2006-01-31 20:20:39 +01:00
|
|
|
}
|
2004-04-06 19:02:00 +02:00
|
|
|
|
2005-01-15 10:12:25 +01:00
|
|
|
DmaDevice::DmaDevice(const std::string &name, Platform *p)
|
2006-01-31 20:20:39 +01:00
|
|
|
: PioDevice(name, p)
|
|
|
|
{
|
2006-03-21 21:45:31 +01:00
|
|
|
dmaPort = new DmaPort(this);
|
2006-01-31 20:20:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2006-03-21 21:45:31 +01:00
|
|
|
DmaPort::SendEvent::process()
|
|
|
|
{
|
|
|
|
if (port->Port::sendTiming(packet) == Success)
|
|
|
|
return;
|
|
|
|
|
|
|
|
port->transmitList.push_back(&packet);
|
|
|
|
}
|
|
|
|
|
|
|
|
Packet *
|
|
|
|
DmaPort::recvRetry()
|
|
|
|
{
|
|
|
|
Packet* pkt = transmitList.front();
|
|
|
|
transmitList.pop_front();
|
|
|
|
return pkt;
|
|
|
|
}
|
|
|
|
void
|
|
|
|
DmaPort::dmaAction(Command cmd, DmaPort port, Addr addr, int size,
|
|
|
|
Event *event, uint8_t *data)
|
2006-01-31 20:20:39 +01:00
|
|
|
{
|
|
|
|
|
|
|
|
assert(event);
|
|
|
|
|
|
|
|
int prevSize = 0;
|
|
|
|
Packet basePkt;
|
|
|
|
Request baseReq;
|
|
|
|
|
|
|
|
basePkt.flags = 0;
|
|
|
|
basePkt.coherence = NULL;
|
|
|
|
basePkt.senderState = NULL;
|
|
|
|
basePkt.src = 0;
|
|
|
|
basePkt.dest = 0;
|
|
|
|
basePkt.cmd = cmd;
|
|
|
|
basePkt.result = Unknown;
|
2006-03-21 21:45:31 +01:00
|
|
|
basePkt.req = NULL;
|
2006-01-31 20:20:39 +01:00
|
|
|
baseReq.nicReq = true;
|
2006-03-26 00:31:20 +01:00
|
|
|
baseReq.time = curTick;
|
2006-01-31 20:20:39 +01:00
|
|
|
|
|
|
|
completionEvent = event;
|
|
|
|
|
2006-02-21 18:20:02 +01:00
|
|
|
for (ChunkGenerator gen(addr, size, peerBlockSize());
|
|
|
|
!gen.done(); gen.next()) {
|
2006-01-31 20:20:39 +01:00
|
|
|
Packet *pkt = new Packet(basePkt);
|
|
|
|
Request *req = new Request(baseReq);
|
|
|
|
pkt->addr = gen.addr();
|
|
|
|
pkt->size = gen.size();
|
|
|
|
pkt->req = req;
|
|
|
|
pkt->req->paddr = pkt->addr;
|
|
|
|
pkt->req->size = pkt->size;
|
|
|
|
// Increment the data pointer on a write
|
|
|
|
pkt->data = data ? data + prevSize : NULL ;
|
2006-03-21 21:45:31 +01:00
|
|
|
prevSize += pkt->size;
|
2006-01-31 20:20:39 +01:00
|
|
|
|
|
|
|
sendDma(*pkt);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
DmaPort::sendDma(Packet &pkt)
|
|
|
|
{
|
|
|
|
// some kind of selction between access methods
|
|
|
|
// more work is going to have to be done to make
|
|
|
|
// switching actually work
|
2006-03-21 21:45:31 +01:00
|
|
|
/* MemState state = device->platform->system->memState;
|
2006-01-31 20:20:39 +01:00
|
|
|
|
|
|
|
if (state == Timing) {
|
|
|
|
if (sendTiming(pkt) == Failure)
|
|
|
|
transmitList.push_back(&packet);
|
2006-03-21 21:45:31 +01:00
|
|
|
} else if (state == Atomic) {*/
|
2006-01-31 20:20:39 +01:00
|
|
|
sendAtomic(pkt);
|
2006-03-26 00:31:20 +01:00
|
|
|
completionEvent->schedule(pkt.time - pkt.req->time);
|
2006-03-21 21:45:31 +01:00
|
|
|
completionEvent = NULL;
|
|
|
|
/* } else if (state == Functional) {
|
2006-01-31 20:20:39 +01:00
|
|
|
sendFunctional(pkt);
|
|
|
|
// Is this correct???
|
2006-03-21 21:45:31 +01:00
|
|
|
completionEvent->schedule(pkt.req->responseTime - pkt.req->requestTime);
|
2006-01-31 20:20:39 +01:00
|
|
|
completionEvent == NULL;
|
|
|
|
} else
|
|
|
|
panic("Unknown memory command state.");
|
2006-03-21 21:45:31 +01:00
|
|
|
*/
|
2006-01-31 20:20:39 +01:00
|
|
|
}
|
2004-02-11 22:07:55 +01:00
|
|
|
|
|
|
|
DmaDevice::~DmaDevice()
|
|
|
|
{
|
2006-03-21 21:45:31 +01:00
|
|
|
if (dmaPort)
|
|
|
|
delete dmaPort;
|
2004-02-11 22:07:55 +01:00
|
|
|
}
|
|
|
|
|
2006-03-30 00:37:25 +02:00
|
|
|
void
|
|
|
|
BasePioDevice::addressRanges(AddrRangeList &range_list, bool &owner)
|
|
|
|
{
|
|
|
|
assert(pioSize != 0);
|
|
|
|
owner = true;
|
|
|
|
range_list.clear();
|
|
|
|
range_list.push_back(RangeSize(pio_addr, sizeof(struct alphaAccess)));
|
|
|
|
}
|
|
|
|
|
2004-04-06 19:02:00 +02:00
|
|
|
|