packet.cc revision 3260
12568SN/A/*
22568SN/A * Copyright (c) 2006 The Regents of The University of Michigan
32568SN/A * All rights reserved.
42568SN/A *
52568SN/A * Redistribution and use in source and binary forms, with or without
62568SN/A * modification, are permitted provided that the following conditions are
72568SN/A * met: redistributions of source code must retain the above copyright
82568SN/A * notice, this list of conditions and the following disclaimer;
92568SN/A * redistributions in binary form must reproduce the above copyright
102568SN/A * notice, this list of conditions and the following disclaimer in the
112568SN/A * documentation and/or other materials provided with the distribution;
122568SN/A * neither the name of the copyright holders nor the names of its
132568SN/A * contributors may be used to endorse or promote products derived from
142568SN/A * this software without specific prior written permission.
152568SN/A *
162568SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
172568SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
182568SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
192568SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
202568SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
212568SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
222568SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
232568SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
242568SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
252568SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
262568SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
272665Ssaidi@eecs.umich.edu *
282665Ssaidi@eecs.umich.edu * Authors: Ali Saidi
292665Ssaidi@eecs.umich.edu *          Steve Reinhardt
302568SN/A */
312568SN/A
322568SN/A/**
332568SN/A * @file
342568SN/A * Definition of the Packet Class, a packet is a transaction occuring
352568SN/A * between a single level of the memory heirarchy (ie L1->L2).
362568SN/A */
373260Ssaidi@eecs.umich.edu
383260Ssaidi@eecs.umich.edu#include <iostream>
392590SN/A#include "base/misc.hh"
402568SN/A#include "mem/packet.hh"
413260Ssaidi@eecs.umich.edu#include "base/trace.hh"
422568SN/A
432641Sstever@eecs.umich.edustatic const std::string ReadReqString("ReadReq");
442641Sstever@eecs.umich.edustatic const std::string WriteReqString("WriteReq");
452641Sstever@eecs.umich.edustatic const std::string WriteReqNoAckString("WriteReqNoAck");
462641Sstever@eecs.umich.edustatic const std::string ReadRespString("ReadResp");
472641Sstever@eecs.umich.edustatic const std::string WriteRespString("WriteResp");
482641Sstever@eecs.umich.edustatic const std::string OtherCmdString("<other>");
492641Sstever@eecs.umich.edu
502641Sstever@eecs.umich.educonst std::string &
512641Sstever@eecs.umich.eduPacket::cmdString() const
522641Sstever@eecs.umich.edu{
532641Sstever@eecs.umich.edu    switch (cmd) {
542641Sstever@eecs.umich.edu      case ReadReq:         return ReadReqString;
552641Sstever@eecs.umich.edu      case WriteReq:        return WriteReqString;
562641Sstever@eecs.umich.edu      case WriteReqNoAck:   return WriteReqNoAckString;
572641Sstever@eecs.umich.edu      case ReadResp:        return ReadRespString;
582641Sstever@eecs.umich.edu      case WriteResp:       return WriteRespString;
592641Sstever@eecs.umich.edu      default:              return OtherCmdString;
602641Sstever@eecs.umich.edu    }
612641Sstever@eecs.umich.edu}
622592SN/A
632811Srdreslin@umich.educonst std::string &
642811Srdreslin@umich.eduPacket::cmdIdxToString(Packet::Command idx)
652811Srdreslin@umich.edu{
662811Srdreslin@umich.edu    switch (idx) {
672811Srdreslin@umich.edu      case ReadReq:         return ReadReqString;
682811Srdreslin@umich.edu      case WriteReq:        return WriteReqString;
692811Srdreslin@umich.edu      case WriteReqNoAck:   return WriteReqNoAckString;
702811Srdreslin@umich.edu      case ReadResp:        return ReadRespString;
712811Srdreslin@umich.edu      case WriteResp:       return WriteRespString;
722811Srdreslin@umich.edu      default:              return OtherCmdString;
732811Srdreslin@umich.edu    }
742811Srdreslin@umich.edu}
752811Srdreslin@umich.edu
762592SN/A/** delete the data pointed to in the data pointer. Ok to call to matter how
772592SN/A * data was allocted. */
782592SN/Avoid
792641Sstever@eecs.umich.eduPacket::deleteData()
802641Sstever@eecs.umich.edu{
812592SN/A    assert(staticData || dynamicData);
822592SN/A    if (staticData)
832592SN/A        return;
842592SN/A
852592SN/A    if (arrayData)
862592SN/A        delete [] data;
872592SN/A    else
882592SN/A        delete data;
892592SN/A}
902592SN/A
912592SN/A/** If there isn't data in the packet, allocate some. */
922592SN/Avoid
932641Sstever@eecs.umich.eduPacket::allocate()
942641Sstever@eecs.umich.edu{
952592SN/A    if (data)
962592SN/A        return;
972592SN/A    assert(!staticData);
982592SN/A    dynamicData = true;
992592SN/A    arrayData = true;
1002641Sstever@eecs.umich.edu    data = new uint8_t[getSize()];
1012592SN/A}
1022592SN/A
1032592SN/A/** Do the packet modify the same addresses. */
1042592SN/Abool
1052641Sstever@eecs.umich.eduPacket::intersect(Packet *p)
1062641Sstever@eecs.umich.edu{
1072641Sstever@eecs.umich.edu    Addr s1 = getAddr();
1083242Sgblack@eecs.umich.edu    Addr e1 = getAddr() + getSize() - 1;
1092641Sstever@eecs.umich.edu    Addr s2 = p->getAddr();
1103242Sgblack@eecs.umich.edu    Addr e2 = p->getAddr() + p->getSize() - 1;
1112592SN/A
1123242Sgblack@eecs.umich.edu    return !(s1 > e2 || e1 < s2);
1132592SN/A}
1142592SN/A
1152641Sstever@eecs.umich.edubool
1162641Sstever@eecs.umich.edufixPacket(Packet *func, Packet *timing)
1172641Sstever@eecs.umich.edu{
1183260Ssaidi@eecs.umich.edu    Addr funcStart      = func->getAddr();
1193260Ssaidi@eecs.umich.edu    Addr funcEnd        = func->getAddr() + func->getSize() - 1;
1203260Ssaidi@eecs.umich.edu    Addr timingStart    = timing->getAddr();
1213260Ssaidi@eecs.umich.edu    Addr timingEnd      = timing->getAddr() + timing->getSize() - 1;
1223260Ssaidi@eecs.umich.edu
1233260Ssaidi@eecs.umich.edu    assert(!(funcStart > timingEnd || timingStart < funcEnd));
1243260Ssaidi@eecs.umich.edu
1253260Ssaidi@eecs.umich.edu    if (DTRACE(FunctionalAccess)) {
1263260Ssaidi@eecs.umich.edu       DebugOut() << func;
1273260Ssaidi@eecs.umich.edu       DebugOut() << timing;
1283260Ssaidi@eecs.umich.edu    }
1293260Ssaidi@eecs.umich.edu
1303260Ssaidi@eecs.umich.edu    // this packet can't solve our problem, continue on
1313260Ssaidi@eecs.umich.edu    if (!timing->hasData())
1323260Ssaidi@eecs.umich.edu        return true;
1333260Ssaidi@eecs.umich.edu
1343260Ssaidi@eecs.umich.edu    if (func->isRead()) {
1353260Ssaidi@eecs.umich.edu        if (funcStart >= timingStart && funcEnd <= timingEnd) {
1363260Ssaidi@eecs.umich.edu            func->allocate();
1373260Ssaidi@eecs.umich.edu            memcpy(func->getPtr<uint8_t>(), timing->getPtr<uint8_t>() +
1383260Ssaidi@eecs.umich.edu                    funcStart - timingStart, func->getSize());
1393260Ssaidi@eecs.umich.edu            func->result = Packet::Success;
1403260Ssaidi@eecs.umich.edu            return false;
1413260Ssaidi@eecs.umich.edu        } else {
1423260Ssaidi@eecs.umich.edu            // In this case the timing packet only partially satisfies the
1433260Ssaidi@eecs.umich.edu            // requset, so we would need more information to make this work.
1443260Ssaidi@eecs.umich.edu            // Like bytes valid in the packet or something, so the request could
1453260Ssaidi@eecs.umich.edu            // continue and get this bit of possibly newer data along with the
1463260Ssaidi@eecs.umich.edu            // older data not written to yet.
1473260Ssaidi@eecs.umich.edu            panic("Timing packet only partially satisfies the functional"
1483260Ssaidi@eecs.umich.edu                    "request. Now what?");
1493260Ssaidi@eecs.umich.edu        }
1503260Ssaidi@eecs.umich.edu    } else if (func->isWrite()) {
1513260Ssaidi@eecs.umich.edu        if (funcStart >= timingStart) {
1523260Ssaidi@eecs.umich.edu            memcpy(timing->getPtr<uint8_t>() + (funcStart - timingStart),
1533260Ssaidi@eecs.umich.edu                   func->getPtr<uint8_t>(),
1543260Ssaidi@eecs.umich.edu                   funcStart - std::min(funcEnd, timingEnd));
1553260Ssaidi@eecs.umich.edu        } else { // timingStart > funcStart
1563260Ssaidi@eecs.umich.edu            memcpy(timing->getPtr<uint8_t>(),
1573260Ssaidi@eecs.umich.edu                   func->getPtr<uint8_t>() + (timingStart - funcStart),
1583260Ssaidi@eecs.umich.edu                   timingStart - std::min(funcEnd, timingEnd));
1593260Ssaidi@eecs.umich.edu        }
1603260Ssaidi@eecs.umich.edu        // we always want to keep going with a write
1613260Ssaidi@eecs.umich.edu        return true;
1623260Ssaidi@eecs.umich.edu    } else
1633260Ssaidi@eecs.umich.edu        panic("Don't know how to handle command type %#x\n",
1643260Ssaidi@eecs.umich.edu                func->cmdToIndex());
1653260Ssaidi@eecs.umich.edu
1662641Sstever@eecs.umich.edu}
1673260Ssaidi@eecs.umich.edu
1683260Ssaidi@eecs.umich.edu
1693260Ssaidi@eecs.umich.edustd::ostream &
1703260Ssaidi@eecs.umich.eduoperator<<(std::ostream &o, const Packet &p)
1713260Ssaidi@eecs.umich.edu{
1723260Ssaidi@eecs.umich.edu
1733260Ssaidi@eecs.umich.edu    o << "[0x";
1743260Ssaidi@eecs.umich.edu    o.setf(std::ios_base::hex, std::ios_base::showbase);
1753260Ssaidi@eecs.umich.edu    o <<  p.getAddr();
1763260Ssaidi@eecs.umich.edu    o.unsetf(std::ios_base::hex| std::ios_base::showbase);
1773260Ssaidi@eecs.umich.edu    o <<  ":";
1783260Ssaidi@eecs.umich.edu    o.setf(std::ios_base::hex, std::ios_base::showbase);
1793260Ssaidi@eecs.umich.edu    o <<  p.getAddr() + p.getSize() - 1 << "] ";
1803260Ssaidi@eecs.umich.edu    o.unsetf(std::ios_base::hex| std::ios_base::showbase);
1813260Ssaidi@eecs.umich.edu
1823260Ssaidi@eecs.umich.edu    if (p.result == Packet::Success)
1833260Ssaidi@eecs.umich.edu        o << "Successful ";
1843260Ssaidi@eecs.umich.edu    if (p.result == Packet::BadAddress)
1853260Ssaidi@eecs.umich.edu        o << "BadAddress ";
1863260Ssaidi@eecs.umich.edu    if (p.result == Packet::Nacked)
1873260Ssaidi@eecs.umich.edu        o << "Nacked ";
1883260Ssaidi@eecs.umich.edu    if (p.result == Packet::Unknown)
1893260Ssaidi@eecs.umich.edu        o << "Inflight ";
1903260Ssaidi@eecs.umich.edu
1913260Ssaidi@eecs.umich.edu    if (p.isRead())
1923260Ssaidi@eecs.umich.edu        o << "Read ";
1933260Ssaidi@eecs.umich.edu    if (p.isWrite())
1943260Ssaidi@eecs.umich.edu        o << "Read ";
1953260Ssaidi@eecs.umich.edu    if (p.isInvalidate())
1963260Ssaidi@eecs.umich.edu        o << "Read ";
1973260Ssaidi@eecs.umich.edu    if (p.isRequest())
1983260Ssaidi@eecs.umich.edu        o << "Request ";
1993260Ssaidi@eecs.umich.edu    if (p.isResponse())
2003260Ssaidi@eecs.umich.edu        o << "Response ";
2013260Ssaidi@eecs.umich.edu    if (p.hasData())
2023260Ssaidi@eecs.umich.edu        o << "w/Data ";
2033260Ssaidi@eecs.umich.edu
2043260Ssaidi@eecs.umich.edu    o << std::endl;
2053260Ssaidi@eecs.umich.edu    return o;
2063260Ssaidi@eecs.umich.edu}
2073260Ssaidi@eecs.umich.edu
208