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"
|
2010-02-12 20:53:19 +01:00
|
|
|
#include "cpu/translation.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
|
|
|
{}
|
|
|
|
|
2011-02-12 01:29:35 +01:00
|
|
|
void
|
|
|
|
markDelayed()
|
2011-02-12 01:29:35 +01:00
|
|
|
{
|
|
|
|
assert(cpu->_status == Running);
|
|
|
|
cpu->_status = ITBWaitResponse;
|
|
|
|
}
|
2011-02-12 01:29:35 +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;
|
|
|
|
|
2010-02-12 20:53:19 +01:00
|
|
|
void sendData(RequestPtr req, uint8_t *data, uint64_t *res, bool read);
|
|
|
|
void sendSplitData(RequestPtr req1, RequestPtr req2, RequestPtr req,
|
|
|
|
uint8_t *data, bool read);
|
2009-02-25 19:16:15 +01:00
|
|
|
|
|
|
|
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();
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
/**
|
|
|
|
* A TimingCPUPort overrides the default behaviour of the
|
|
|
|
* recvTiming and recvRetry and implements events for the
|
|
|
|
* scheduling of handling of incoming packets in the following
|
|
|
|
* cycle.
|
|
|
|
*/
|
|
|
|
class TimingCPUPort : public CpuPort
|
2006-05-16 23:36:50 +02:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
TimingCPUPort(const std::string& _name, TimingSimpleCPU* _cpu)
|
|
|
|
: CpuPort(_name, _cpu), cpu(_cpu), retryEvent(this)
|
2006-05-16 23:36:50 +02:00
|
|
|
{ }
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
TimingSimpleCPU* cpu;
|
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;
|
2010-11-15 21:04:03 +01:00
|
|
|
CpuPort *port;
|
2006-07-21 01:00:40 +02:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
TickEvent(TimingSimpleCPU *_cpu) : pkt(NULL), 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
|
|
|
};
|
|
|
|
|
2010-11-15 21:04:03 +01:00
|
|
|
EventWrapper<Port, &Port::sendRetry> retryEvent;
|
2006-05-16 23:36:50 +02:00
|
|
|
};
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
class IcachePort : public TimingCPUPort
|
2006-05-16 23:36:50 +02:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
IcachePort(TimingSimpleCPU *_cpu)
|
|
|
|
: TimingCPUPort(_cpu->name() + "-iport", _cpu),
|
|
|
|
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
|
|
|
};
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
class DcachePort : public TimingCPUPort
|
2006-05-16 23:36:50 +02:00
|
|
|
{
|
|
|
|
public:
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
DcachePort(TimingSimpleCPU *_cpu)
|
|
|
|
: TimingCPUPort(_cpu->name() + "-dport", _cpu), 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 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;
|
|
|
|
|
2012-02-24 17:42:00 +01:00
|
|
|
protected:
|
|
|
|
|
|
|
|
/** Return a reference to the data port. */
|
|
|
|
virtual CpuPort &getDataPort() { return dcachePort; }
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2012-02-24 17:42:00 +01:00
|
|
|
/** Return a reference to the instruction port. */
|
|
|
|
virtual CpuPort &getInstPort() { return icachePort; }
|
|
|
|
|
|
|
|
public:
|
2006-07-07 21:15:11 +02:00
|
|
|
|
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);
|
|
|
|
|
2012-01-31 18:05:52 +01:00
|
|
|
virtual void activateContext(ThreadID thread_num, int delay);
|
|
|
|
virtual void suspendContext(ThreadID thread_num);
|
2006-05-16 23:36:50 +02:00
|
|
|
|
2011-07-03 07:35:04 +02:00
|
|
|
Fault readMem(Addr addr, uint8_t *data, unsigned size, unsigned flags);
|
2010-08-13 15:16:02 +02:00
|
|
|
|
2011-07-03 07:35:04 +02:00
|
|
|
Fault writeMem(uint8_t *data, unsigned size,
|
|
|
|
Addr addr, unsigned flags, uint64_t *res);
|
2010-08-13 15:16:02 +02:00
|
|
|
|
2006-05-16 23:36:50 +02:00
|
|
|
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);
|
|
|
|
|
2010-02-12 20:53:19 +01:00
|
|
|
/**
|
|
|
|
* Finish a DTB translation.
|
|
|
|
* @param state The DTB translation state.
|
|
|
|
*/
|
|
|
|
void finishTranslation(WholeTranslationState *state);
|
|
|
|
|
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__
|