2006-05-16 23:36:50 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2002-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.
|
2006-06-01 01:26:56 +02:00
|
|
|
*
|
|
|
|
* Authors: Steve Reinhardt
|
2006-05-16 23:36:50 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __CPU_SIMPLE_TIMING_HH__
|
|
|
|
#define __CPU_SIMPLE_TIMING_HH__
|
|
|
|
|
|
|
|
#include "cpu/simple/base.hh"
|
|
|
|
|
2008-08-11 21:22:16 +02:00
|
|
|
#include "params/TimingSimpleCPU.hh"
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
class TimingSimpleCPU : public BaseSimpleCPU
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2008-08-11 21:22:16 +02:00
|
|
|
TimingSimpleCPU(TimingSimpleCPUParams * params);
|
2006-05-16 23:36:50 +02:00
|
|
|
virtual ~TimingSimpleCPU();
|
|
|
|
|
|
|
|
virtual void init();
|
|
|
|
|
|
|
|
public:
|
2006-07-05 23:59:33 +02:00
|
|
|
Event *drainEvent;
|
2006-06-30 01:45:24 +02:00
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
private:
|
|
|
|
|
2008-11-10 06:56:28 +01:00
|
|
|
/*
|
|
|
|
* If an access needs to be broken into fragments, currently at most two,
|
|
|
|
* the the following two classes are used as the sender state of the
|
|
|
|
* packets so the CPU can keep track of everything. In the main packet
|
|
|
|
* sender state, there's an array with a spot for each fragment. If a
|
|
|
|
* fragment has already been accepted by the CPU, aka isn't waiting for
|
|
|
|
* a retry, it's pointer is NULL. After each fragment has successfully
|
|
|
|
* been processed, the "outstanding" counter is decremented. Once the
|
|
|
|
* count is zero, the entire larger access is complete.
|
|
|
|
*/
|
|
|
|
class SplitMainSenderState : public Packet::SenderState
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
int outstanding;
|
|
|
|
PacketPtr fragments[2];
|
|
|
|
|
|
|
|
int
|
|
|
|
getPendingFragment()
|
|
|
|
{
|
|
|
|
if (fragments[0]) {
|
|
|
|
return 0;
|
|
|
|
} else if (fragments[1]) {
|
|
|
|
return 1;
|
|
|
|
} else {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class SplitFragmentSenderState : public Packet::SenderState
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
SplitFragmentSenderState(PacketPtr _bigPkt, int _index) :
|
|
|
|
bigPkt(_bigPkt), index(_index)
|
|
|
|
{}
|
|
|
|
PacketPtr bigPkt;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
void
|
|
|
|
clearFromParent()
|
|
|
|
{
|
|
|
|
SplitMainSenderState * main_send_state =
|
|
|
|
dynamic_cast<SplitMainSenderState *>(bigPkt->senderState);
|
|
|
|
main_send_state->fragments[index] = NULL;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2009-02-25 19:16:15 +01:00
|
|
|
class FetchTranslation : public BaseTLB::Translation
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
TimingSimpleCPU *cpu;
|
|
|
|
|
|
|
|
public:
|
2009-04-09 07:21:27 +02:00
|
|
|
FetchTranslation(TimingSimpleCPU *_cpu)
|
|
|
|
: cpu(_cpu)
|
2009-02-25 19:16:15 +01:00
|
|
|
{}
|
|
|
|
|
2009-04-09 07:21:27 +02:00
|
|
|
void
|
|
|
|
finish(Fault fault, RequestPtr req, ThreadContext *tc,
|
|
|
|
BaseTLB::Mode mode)
|
2009-02-25 19:16:15 +01:00
|
|
|
{
|
|
|
|
cpu->sendFetch(fault, req, tc);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
FetchTranslation fetchTranslation;
|
|
|
|
|
|
|
|
class DataTranslation : public BaseTLB::Translation
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
TimingSimpleCPU *cpu;
|
|
|
|
uint8_t *data;
|
|
|
|
uint64_t *res;
|
2009-04-09 07:21:27 +02:00
|
|
|
BaseTLB::Mode mode;
|
2009-02-25 19:16:15 +01:00
|
|
|
|
|
|
|
public:
|
|
|
|
DataTranslation(TimingSimpleCPU *_cpu,
|
2009-04-09 07:21:27 +02:00
|
|
|
uint8_t *_data, uint64_t *_res, BaseTLB::Mode _mode)
|
|
|
|
: cpu(_cpu), data(_data), res(_res), mode(_mode)
|
|
|
|
{
|
|
|
|
assert(mode == BaseTLB::Read || mode == BaseTLB::Write);
|
|
|
|
}
|
2009-02-25 19:16:15 +01:00
|
|
|
|
|
|
|
void
|
2009-04-09 07:21:27 +02:00
|
|
|
finish(Fault fault, RequestPtr req, ThreadContext *tc,
|
|
|
|
BaseTLB::Mode mode)
|
2009-02-25 19:16:15 +01:00
|
|
|
{
|
2009-04-09 07:21:27 +02:00
|
|
|
assert(mode == this->mode);
|
|
|
|
cpu->sendData(fault, req, data, res, mode == BaseTLB::Read);
|
2009-02-25 19:16:15 +01:00
|
|
|
delete this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class SplitDataTranslation : public BaseTLB::Translation
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
struct WholeTranslationState
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
int outstanding;
|
|
|
|
RequestPtr requests[2];
|
|
|
|
RequestPtr mainReq;
|
|
|
|
Fault faults[2];
|
|
|
|
uint8_t *data;
|
2009-04-09 07:21:27 +02:00
|
|
|
BaseTLB::Mode mode;
|
2009-02-25 19:16:15 +01:00
|
|
|
|
|
|
|
WholeTranslationState(RequestPtr req1, RequestPtr req2,
|
2009-04-09 07:21:27 +02:00
|
|
|
RequestPtr main, uint8_t *data, BaseTLB::Mode mode)
|
2009-02-25 19:16:15 +01:00
|
|
|
{
|
2009-04-09 07:21:27 +02:00
|
|
|
assert(mode == BaseTLB::Read || mode == BaseTLB::Write);
|
|
|
|
|
2009-02-25 19:16:15 +01:00
|
|
|
outstanding = 2;
|
|
|
|
requests[0] = req1;
|
|
|
|
requests[1] = req2;
|
|
|
|
mainReq = main;
|
|
|
|
faults[0] = faults[1] = NoFault;
|
2009-04-09 07:21:27 +02:00
|
|
|
this->data = data;
|
|
|
|
this->mode = mode;
|
2009-02-25 19:16:15 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
TimingSimpleCPU *cpu;
|
|
|
|
int index;
|
|
|
|
WholeTranslationState *state;
|
|
|
|
|
|
|
|
SplitDataTranslation(TimingSimpleCPU *_cpu, int _index,
|
2009-04-09 07:21:27 +02:00
|
|
|
WholeTranslationState *_state)
|
|
|
|
: cpu(_cpu), index(_index), state(_state)
|
2009-02-25 19:16:15 +01:00
|
|
|
{}
|
|
|
|
|
|
|
|
void
|
2009-04-09 07:21:27 +02:00
|
|
|
finish(Fault fault, RequestPtr req, ThreadContext *tc,
|
|
|
|
BaseTLB::Mode mode)
|
2009-02-25 19:16:15 +01:00
|
|
|
{
|
|
|
|
assert(state);
|
|
|
|
assert(state->outstanding);
|
|
|
|
state->faults[index] = fault;
|
|
|
|
if (--state->outstanding == 0) {
|
|
|
|
cpu->sendSplitData(state->faults[0],
|
|
|
|
state->faults[1],
|
|
|
|
state->requests[0],
|
|
|
|
state->requests[1],
|
|
|
|
state->mainReq,
|
|
|
|
state->data,
|
2009-04-09 07:21:27 +02:00
|
|
|
state->mode == BaseTLB::Read);
|
2009-02-25 19:16:15 +01:00
|
|
|
delete state;
|
|
|
|
}
|
|
|
|
delete this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
void sendData(Fault fault, RequestPtr req,
|
|
|
|
uint8_t *data, uint64_t *res, bool read);
|
|
|
|
void sendSplitData(Fault fault1, Fault fault2,
|
|
|
|
RequestPtr req1, RequestPtr req2, RequestPtr req,
|
|
|
|
uint8_t *data, bool read);
|
|
|
|
|
|
|
|
void translationFault(Fault fault);
|
|
|
|
|
|
|
|
void buildPacket(PacketPtr &pkt, RequestPtr req, bool read);
|
|
|
|
void buildSplitPacket(PacketPtr &pkt1, PacketPtr &pkt2,
|
|
|
|
RequestPtr req1, RequestPtr req2, RequestPtr req,
|
|
|
|
uint8_t *data, bool read);
|
2008-11-14 08:30:37 +01:00
|
|
|
|
2008-11-10 06:56:28 +01:00
|
|
|
bool handleReadPacket(PacketPtr pkt);
|
|
|
|
// This function always implicitly uses dcache_pkt.
|
|
|
|
bool handleWritePacket();
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
class CpuPort : public Port
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
TimingSimpleCPU *cpu;
|
2006-07-21 01:00:40 +02:00
|
|
|
Tick lat;
|
2006-05-16 23:36:50 +02:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
2006-07-21 01:00:40 +02:00
|
|
|
CpuPort(const std::string &_name, TimingSimpleCPU *_cpu, Tick _lat)
|
2006-10-31 19:59:30 +01:00
|
|
|
: Port(_name, _cpu), cpu(_cpu), lat(_lat)
|
2006-05-16 23:36:50 +02:00
|
|
|
{ }
|
|
|
|
|
2006-11-14 00:51:16 +01:00
|
|
|
bool snoopRangeSent;
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
protected:
|
|
|
|
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual Tick recvAtomic(PacketPtr pkt);
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual void recvFunctional(PacketPtr pkt);
|
2006-05-16 23:36:50 +02:00
|
|
|
|
|
|
|
virtual void recvStatusChange(Status status);
|
|
|
|
|
|
|
|
virtual void getDeviceAddressRanges(AddrRangeList &resp,
|
2007-05-22 08:36:09 +02:00
|
|
|
bool &snoop)
|
|
|
|
{ resp.clear(); snoop = false; }
|
2006-07-21 01:00:40 +02:00
|
|
|
|
|
|
|
struct TickEvent : public Event
|
|
|
|
{
|
2006-10-20 09:10:12 +02:00
|
|
|
PacketPtr pkt;
|
2006-07-21 01:00:40 +02:00
|
|
|
TimingSimpleCPU *cpu;
|
|
|
|
|
2008-10-09 13:58:24 +02:00
|
|
|
TickEvent(TimingSimpleCPU *_cpu) : cpu(_cpu) {}
|
2008-02-06 22:32:40 +01:00
|
|
|
const char *description() const { return "Timing CPU tick"; }
|
2006-10-20 09:10:12 +02:00
|
|
|
void schedule(PacketPtr _pkt, Tick t);
|
2006-07-21 01:00:40 +02:00
|
|
|
};
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
class IcachePort : public CpuPort
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2006-07-21 01:00:40 +02:00
|
|
|
IcachePort(TimingSimpleCPU *_cpu, Tick _lat)
|
|
|
|
: CpuPort(_cpu->name() + "-iport", _cpu, _lat), tickEvent(_cpu)
|
2006-05-16 23:36:50 +02:00
|
|
|
{ }
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual bool recvTiming(PacketPtr pkt);
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
virtual void recvRetry();
|
2006-07-21 01:00:40 +02:00
|
|
|
|
|
|
|
struct ITickEvent : public TickEvent
|
|
|
|
{
|
|
|
|
|
|
|
|
ITickEvent(TimingSimpleCPU *_cpu)
|
|
|
|
: TickEvent(_cpu) {}
|
|
|
|
void process();
|
2008-02-06 22:32:40 +01:00
|
|
|
const char *description() const { return "Timing CPU icache tick"; }
|
2006-07-21 01:00:40 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
ITickEvent tickEvent;
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
class DcachePort : public CpuPort
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2006-07-21 01:00:40 +02:00
|
|
|
DcachePort(TimingSimpleCPU *_cpu, Tick _lat)
|
|
|
|
: CpuPort(_cpu->name() + "-dport", _cpu, _lat), tickEvent(_cpu)
|
2006-05-16 23:36:50 +02:00
|
|
|
{ }
|
|
|
|
|
2007-03-09 16:06:09 +01:00
|
|
|
virtual void setPeer(Port *port);
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
protected:
|
|
|
|
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual bool recvTiming(PacketPtr pkt);
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
virtual void recvRetry();
|
2006-07-21 01:00:40 +02:00
|
|
|
|
|
|
|
struct DTickEvent : public TickEvent
|
|
|
|
{
|
|
|
|
DTickEvent(TimingSimpleCPU *_cpu)
|
|
|
|
: TickEvent(_cpu) {}
|
|
|
|
void process();
|
2008-02-06 22:32:40 +01:00
|
|
|
const char *description() const { return "Timing CPU dcache tick"; }
|
2006-07-21 01:00:40 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
DTickEvent tickEvent;
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
IcachePort icachePort;
|
|
|
|
DcachePort dcachePort;
|
|
|
|
|
2006-10-20 09:10:12 +02:00
|
|
|
PacketPtr ifetch_pkt;
|
|
|
|
PacketPtr dcache_pkt;
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2006-10-08 06:55:05 +02:00
|
|
|
Tick previousTick;
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
public:
|
|
|
|
|
2006-07-07 21:15:11 +02:00
|
|
|
virtual Port *getPort(const std::string &if_name, int idx = -1);
|
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
virtual void serialize(std::ostream &os);
|
|
|
|
virtual void unserialize(Checkpoint *cp, const std::string §ion);
|
|
|
|
|
2006-07-13 02:22:07 +02:00
|
|
|
virtual unsigned int drain(Event *drain_event);
|
2006-06-30 01:45:24 +02:00
|
|
|
virtual void resume();
|
|
|
|
|
|
|
|
void switchOut();
|
2006-05-16 23:36:50 +02:00
|
|
|
void takeOverFrom(BaseCPU *oldCPU);
|
|
|
|
|
|
|
|
virtual void activateContext(int thread_num, int delay);
|
|
|
|
virtual void suspendContext(int thread_num);
|
|
|
|
|
|
|
|
template <class T>
|
|
|
|
Fault read(Addr addr, T &data, unsigned flags);
|
|
|
|
|
|
|
|
template <class T>
|
|
|
|
Fault write(T data, Addr addr, unsigned flags, uint64_t *res);
|
|
|
|
|
|
|
|
void fetch();
|
2009-02-25 19:16:15 +01:00
|
|
|
void sendFetch(Fault fault, RequestPtr req, ThreadContext *tc);
|
2006-10-20 09:10:12 +02:00
|
|
|
void completeIfetch(PacketPtr );
|
2009-02-25 19:16:15 +01:00
|
|
|
void completeDataAccess(PacketPtr pkt);
|
2006-05-26 20:33:43 +02:00
|
|
|
void advanceInst(Fault fault);
|
2007-05-21 06:43:01 +02:00
|
|
|
|
2008-01-02 22:46:22 +01:00
|
|
|
/**
|
|
|
|
* Print state of address in memory system via PrintReq (for
|
|
|
|
* debugging).
|
|
|
|
*/
|
|
|
|
void printAddr(Addr a);
|
|
|
|
|
2006-06-30 01:45:24 +02:00
|
|
|
private:
|
2007-05-21 06:43:01 +02:00
|
|
|
|
|
|
|
typedef EventWrapper<TimingSimpleCPU, &TimingSimpleCPU::fetch> FetchEvent;
|
2008-10-27 23:18:04 +01:00
|
|
|
FetchEvent fetchEvent;
|
2007-05-21 06:43:01 +02:00
|
|
|
|
2007-10-01 08:55:27 +02:00
|
|
|
struct IprEvent : Event {
|
|
|
|
Packet *pkt;
|
|
|
|
TimingSimpleCPU *cpu;
|
|
|
|
IprEvent(Packet *_pkt, TimingSimpleCPU *_cpu, Tick t);
|
|
|
|
virtual void process();
|
2008-02-06 22:32:40 +01:00
|
|
|
virtual const char *description() const;
|
2007-10-01 08:55:27 +02:00
|
|
|
};
|
|
|
|
|
2006-07-05 23:59:33 +02:00
|
|
|
void completeDrain();
|
2006-05-16 23:36:50 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif // __CPU_SIMPLE_TIMING_HH__
|