mshr.cc revision 10571:c848de089432
12006Sbinkertn@umich.edu/*
22006Sbinkertn@umich.edu * Copyright (c) 2012-2013 ARM Limited
32006Sbinkertn@umich.edu * All rights reserved.
42006Sbinkertn@umich.edu *
52006Sbinkertn@umich.edu * The license below extends only to copyright in the software and shall
62006Sbinkertn@umich.edu * not be construed as granting a license to any other intellectual
72006Sbinkertn@umich.edu * property including but not limited to intellectual property relating
82006Sbinkertn@umich.edu * to a hardware implementation of the functionality of the software
92006Sbinkertn@umich.edu * licensed hereunder.  You may use the software subject to the license
102006Sbinkertn@umich.edu * terms below provided that you ensure that this notice is replicated
112006Sbinkertn@umich.edu * unmodified and in its entirety in all distributions of the software,
122006Sbinkertn@umich.edu * modified or unmodified, in source code or in binary form.
132006Sbinkertn@umich.edu *
142006Sbinkertn@umich.edu * Copyright (c) 2002-2005 The Regents of The University of Michigan
152006Sbinkertn@umich.edu * Copyright (c) 2010 Advanced Micro Devices, Inc.
162006Sbinkertn@umich.edu * All rights reserved.
172006Sbinkertn@umich.edu *
182006Sbinkertn@umich.edu * Redistribution and use in source and binary forms, with or without
192006Sbinkertn@umich.edu * modification, are permitted provided that the following conditions are
202006Sbinkertn@umich.edu * met: redistributions of source code must retain the above copyright
212006Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer;
222006Sbinkertn@umich.edu * redistributions in binary form must reproduce the above copyright
232006Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer in the
242006Sbinkertn@umich.edu * documentation and/or other materials provided with the distribution;
252006Sbinkertn@umich.edu * neither the name of the copyright holders nor the names of its
262006Sbinkertn@umich.edu * contributors may be used to endorse or promote products derived from
272006Sbinkertn@umich.edu * this software without specific prior written permission.
282006Sbinkertn@umich.edu *
292006Sbinkertn@umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
302006Sbinkertn@umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
312006Sbinkertn@umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
322006Sbinkertn@umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
332006Sbinkertn@umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
342006Sbinkertn@umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
352006Sbinkertn@umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
362006Sbinkertn@umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
372006Sbinkertn@umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
382006Sbinkertn@umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
392006Sbinkertn@umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
402006Sbinkertn@umich.edu *
412006Sbinkertn@umich.edu * Authors: Erik Hallnor
422006Sbinkertn@umich.edu *          Dave Greene
432006Sbinkertn@umich.edu */
442006Sbinkertn@umich.edu
452006Sbinkertn@umich.edu/**
462006Sbinkertn@umich.edu * @file
472006Sbinkertn@umich.edu * Miss Status and Handling Register (MSHR) definitions.
482006Sbinkertn@umich.edu */
492006Sbinkertn@umich.edu
502006Sbinkertn@umich.edu#include <algorithm>
512006Sbinkertn@umich.edu#include <cassert>
522006Sbinkertn@umich.edu#include <string>
532006Sbinkertn@umich.edu#include <vector>
542006Sbinkertn@umich.edu
552006Sbinkertn@umich.edu#include "base/misc.hh"
562006Sbinkertn@umich.edu#include "base/types.hh"
572006Sbinkertn@umich.edu#include "debug/Cache.hh"
582006Sbinkertn@umich.edu#include "mem/cache/cache.hh"
592006Sbinkertn@umich.edu#include "mem/cache/mshr.hh"
602006Sbinkertn@umich.edu#include "sim/core.hh"
612006Sbinkertn@umich.edu
622006Sbinkertn@umich.eduusing namespace std;
632006Sbinkertn@umich.edu
642006Sbinkertn@umich.eduMSHR::MSHR() : readyTime(0), _isUncacheable(false), downstreamPending(false),
652006Sbinkertn@umich.edu               pendingDirty(false), pendingClean(false),
662006Sbinkertn@umich.edu               postInvalidate(false), postDowngrade(false),
672006Sbinkertn@umich.edu               _isObsolete(false), queue(NULL), order(0), addr(0),
682006Sbinkertn@umich.edu               size(0), isSecure(false), inService(false),
692006Sbinkertn@umich.edu               isForward(false), threadNum(InvalidThreadID), data(NULL)
702006Sbinkertn@umich.edu{
712006Sbinkertn@umich.edu}
722006Sbinkertn@umich.edu
732006Sbinkertn@umich.edu
742006Sbinkertn@umich.eduMSHR::TargetList::TargetList()
752006Sbinkertn@umich.edu    : needsExclusive(false), hasUpgrade(false)
762006Sbinkertn@umich.edu{}
772006Sbinkertn@umich.edu
782006Sbinkertn@umich.edu
792006Sbinkertn@umich.eduinline void
802006Sbinkertn@umich.eduMSHR::TargetList::add(PacketPtr pkt, Tick readyTime,
812006Sbinkertn@umich.edu                      Counter order, Target::Source source, bool markPending)
822006Sbinkertn@umich.edu{
832006Sbinkertn@umich.edu    if (source != Target::FromSnoop) {
842006Sbinkertn@umich.edu        if (pkt->needsExclusive()) {
85            needsExclusive = true;
86        }
87
88        // StoreCondReq is effectively an upgrade if it's in an MSHR
89        // since it would have been failed already if we didn't have a
90        // read-only copy
91        if (pkt->isUpgrade() || pkt->cmd == MemCmd::StoreCondReq) {
92            hasUpgrade = true;
93        }
94    }
95
96    if (markPending) {
97        // Iterate over the SenderState stack and see if we find
98        // an MSHR entry. If we do, set the downstreamPending
99        // flag. Otherwise, do nothing.
100        MSHR *mshr = pkt->findNextSenderState<MSHR>();
101        if (mshr != NULL) {
102            assert(!mshr->downstreamPending);
103            mshr->downstreamPending = true;
104        }
105    }
106
107    push_back(Target(pkt, readyTime, order, source, markPending));
108}
109
110
111static void
112replaceUpgrade(PacketPtr pkt)
113{
114    if (pkt->cmd == MemCmd::UpgradeReq) {
115        pkt->cmd = MemCmd::ReadExReq;
116        DPRINTF(Cache, "Replacing UpgradeReq with ReadExReq\n");
117    } else if (pkt->cmd == MemCmd::SCUpgradeReq) {
118        pkt->cmd = MemCmd::SCUpgradeFailReq;
119        DPRINTF(Cache, "Replacing SCUpgradeReq with SCUpgradeFailReq\n");
120    } else if (pkt->cmd == MemCmd::StoreCondReq) {
121        pkt->cmd = MemCmd::StoreCondFailReq;
122        DPRINTF(Cache, "Replacing StoreCondReq with StoreCondFailReq\n");
123    }
124}
125
126
127void
128MSHR::TargetList::replaceUpgrades()
129{
130    if (!hasUpgrade)
131        return;
132
133    Iterator end_i = end();
134    for (Iterator i = begin(); i != end_i; ++i) {
135        replaceUpgrade(i->pkt);
136    }
137
138    hasUpgrade = false;
139}
140
141
142void
143MSHR::TargetList::clearDownstreamPending()
144{
145    Iterator end_i = end();
146    for (Iterator i = begin(); i != end_i; ++i) {
147        if (i->markedPending) {
148            // Iterate over the SenderState stack and see if we find
149            // an MSHR entry. If we find one, clear the
150            // downstreamPending flag by calling
151            // clearDownstreamPending(). This recursively clears the
152            // downstreamPending flag in all caches this packet has
153            // passed through.
154            MSHR *mshr = i->pkt->findNextSenderState<MSHR>();
155            if (mshr != NULL) {
156                mshr->clearDownstreamPending();
157            }
158        }
159    }
160}
161
162
163bool
164MSHR::TargetList::checkFunctional(PacketPtr pkt)
165{
166    Iterator end_i = end();
167    for (Iterator i = begin(); i != end_i; ++i) {
168        if (pkt->checkFunctional(i->pkt)) {
169            return true;
170        }
171    }
172
173    return false;
174}
175
176
177void
178MSHR::TargetList::
179print(std::ostream &os, int verbosity, const std::string &prefix) const
180{
181    ConstIterator end_i = end();
182    for (ConstIterator i = begin(); i != end_i; ++i) {
183        const char *s;
184        switch (i->source) {
185          case Target::FromCPU:
186            s = "FromCPU";
187            break;
188          case Target::FromSnoop:
189            s = "FromSnoop";
190            break;
191          case Target::FromPrefetcher:
192            s = "FromPrefetcher";
193            break;
194          default:
195            s = "";
196            break;
197        }
198        ccprintf(os, "%s%s: ", prefix, s);
199        i->pkt->print(os, verbosity, "");
200    }
201}
202
203
204void
205MSHR::allocate(Addr _addr, int _size, PacketPtr target, Tick whenReady,
206               Counter _order)
207{
208    addr = _addr;
209    size = _size;
210    isSecure = target->isSecure();
211    readyTime = whenReady;
212    order = _order;
213    assert(target);
214    isForward = false;
215    _isUncacheable = target->req->isUncacheable();
216    inService = false;
217    pendingClean = (target->cmd == MemCmd::WriteInvalidateReq);
218    downstreamPending = false;
219    _isObsolete = false;
220    threadNum = 0;
221    assert(targets.isReset());
222    // Don't know of a case where we would allocate a new MSHR for a
223    // snoop (mem-side request), so set source according to request here
224    Target::Source source = (target->cmd == MemCmd::HardPFReq) ?
225        Target::FromPrefetcher : Target::FromCPU;
226    targets.add(target, whenReady, _order, source, true);
227    assert(deferredTargets.isReset());
228    data = NULL;
229}
230
231
232void
233MSHR::clearDownstreamPending()
234{
235    assert(downstreamPending);
236    downstreamPending = false;
237    // recursively clear flag on any MSHRs we will be forwarding
238    // responses to
239    targets.clearDownstreamPending();
240}
241
242bool
243MSHR::markInService(PacketPtr pkt)
244{
245    assert(!inService);
246    if (isForwardNoResponse()) {
247        // we just forwarded the request packet & don't expect a
248        // response, so get rid of it
249        assert(getNumTargets() == 1);
250        popTarget();
251        return true;
252    }
253
254    assert(pkt != NULL);
255    inService = true;
256    pendingDirty = ((targets.needsExclusive &&
257                     (pkt->cmd != MemCmd::WriteInvalidateReq)) ||
258                    (!pkt->sharedAsserted() && pkt->memInhibitAsserted()));
259    postInvalidate = postDowngrade = false;
260
261    if (!downstreamPending) {
262        // let upstream caches know that the request has made it to a
263        // level where it's going to get a response
264        targets.clearDownstreamPending();
265    }
266    return false;
267}
268
269
270void
271MSHR::deallocate()
272{
273    assert(targets.empty());
274    targets.resetFlags();
275    assert(deferredTargets.isReset());
276    inService = false;
277}
278
279/*
280 * Adds a target to an MSHR
281 */
282void
283MSHR::allocateTarget(PacketPtr pkt, Tick whenReady, Counter _order)
284{
285    // if there's a request already in service for this MSHR, we will
286    // have to defer the new target until after the response if any of
287    // the following are true:
288    // - there are other targets already deferred
289    // - there's a pending invalidate to be applied after the response
290    //   comes back (but before this target is processed)
291    // - this target requires an exclusive block and either we're not
292    //   getting an exclusive block back or we have already snooped
293    //   another read request that will downgrade our exclusive block
294    //   to shared
295
296    // assume we'd never issue a prefetch when we've got an
297    // outstanding miss
298    assert(pkt->cmd != MemCmd::HardPFReq);
299
300    if (inService &&
301        (!deferredTargets.empty() || hasPostInvalidate() ||
302         (pkt->needsExclusive() &&
303          (!isPendingDirty() || hasPostDowngrade() || isForward)))) {
304        // need to put on deferred list
305        if (hasPostInvalidate())
306            replaceUpgrade(pkt);
307        deferredTargets.add(pkt, whenReady, _order, Target::FromCPU, true);
308    } else {
309        // No request outstanding, or still OK to append to
310        // outstanding request: append to regular target list.  Only
311        // mark pending if current request hasn't been issued yet
312        // (isn't in service).
313        targets.add(pkt, whenReady, _order, Target::FromCPU, !inService);
314    }
315}
316
317bool
318MSHR::handleSnoop(PacketPtr pkt, Counter _order)
319{
320    DPRINTF(Cache, "%s for %s address %x size %d\n", __func__,
321            pkt->cmdString(), pkt->getAddr(), pkt->getSize());
322    if (!inService || (pkt->isExpressSnoop() && downstreamPending)) {
323        // Request has not been issued yet, or it's been issued
324        // locally but is buffered unissued at some downstream cache
325        // which is forwarding us this snoop.  Either way, the packet
326        // we're snooping logically precedes this MSHR's request, so
327        // the snoop has no impact on the MSHR, but must be processed
328        // in the standard way by the cache.  The only exception is
329        // that if we're an L2+ cache buffering an UpgradeReq from a
330        // higher-level cache, and the snoop is invalidating, then our
331        // buffered upgrades must be converted to read exclusives,
332        // since the upper-level cache no longer has a valid copy.
333        // That is, even though the upper-level cache got out on its
334        // local bus first, some other invalidating transaction
335        // reached the global bus before the upgrade did.
336        if (pkt->needsExclusive()) {
337            targets.replaceUpgrades();
338            deferredTargets.replaceUpgrades();
339        }
340
341        return false;
342    }
343
344    // From here on down, the request issued by this MSHR logically
345    // precedes the request we're snooping.
346    if (pkt->needsExclusive()) {
347        // snooped request still precedes the re-request we'll have to
348        // issue for deferred targets, if any...
349        deferredTargets.replaceUpgrades();
350    }
351
352    if (hasPostInvalidate()) {
353        // a prior snoop has already appended an invalidation, so
354        // logically we don't have the block anymore; no need for
355        // further snooping.
356        return true;
357    }
358
359    if (isPendingDirty() || pkt->isInvalidate()) {
360        // We need to save and replay the packet in two cases:
361        // 1. We're awaiting an exclusive copy, so ownership is pending,
362        //    and we need to respond after we receive data.
363        // 2. It's an invalidation (e.g., UpgradeReq), and we need
364        //    to forward the snoop up the hierarchy after the current
365        //    transaction completes.
366
367        // Actual target device (typ. a memory) will delete the
368        // packet on reception, so we need to save a copy here.
369
370        // Clear flags and also allocate new data as the original
371        // packet data storage may have been deleted by the time we
372        // get to send this packet.
373        PacketPtr cp_pkt = new Packet(pkt, true, true);
374        targets.add(cp_pkt, curTick(), _order, Target::FromSnoop,
375                     downstreamPending && targets.needsExclusive);
376
377        // WriteInvalidates must writeback and should not be inhibited on
378        // account of its snoops discovering MSHRs wanting exclusive access
379        // to what it wrote.  We don't want to push this check higher,
380        // however, because we want to be sure to add an invalidating
381        // Target::FromSnoop, above.
382        if (isPendingDirty() && (pkt->cmd != MemCmd::WriteInvalidateReq)) {
383            pkt->assertMemInhibit();
384            pkt->setSupplyExclusive();
385        }
386
387        if (pkt->needsExclusive()) {
388            // This transaction will take away our pending copy
389            postInvalidate = true;
390
391            // Do not defer (i.e. return true) the snoop if the block is
392            // going to be clean once the MSHR completes, as the data is
393            // ready now.
394            if (isPendingClean()) {
395                return false;
396            }
397        }
398    }
399
400    if (!pkt->needsExclusive()) {
401        // This transaction will get a read-shared copy, downgrading
402        // our copy if we had an exclusive one
403        postDowngrade = true;
404        pkt->assertShared();
405    }
406
407    return true;
408}
409
410
411bool
412MSHR::promoteDeferredTargets()
413{
414    assert(targets.empty());
415    if (deferredTargets.empty()) {
416        return false;
417    }
418
419    // swap targets & deferredTargets lists
420    std::swap(targets, deferredTargets);
421
422    // clear deferredTargets flags
423    deferredTargets.resetFlags();
424
425    order = targets.front().order;
426    readyTime = std::max(curTick(), targets.front().readyTime);
427
428    return true;
429}
430
431
432void
433MSHR::handleFill(Packet *pkt, CacheBlk *blk)
434{
435    if (!pkt->sharedAsserted()
436        && !(hasPostInvalidate() || hasPostDowngrade())
437        && deferredTargets.needsExclusive) {
438        // We got an exclusive response, but we have deferred targets
439        // which are waiting to request an exclusive copy (not because
440        // of a pending invalidate).  This can happen if the original
441        // request was for a read-only (non-exclusive) block, but we
442        // got an exclusive copy anyway because of the E part of the
443        // MOESI/MESI protocol.  Since we got the exclusive copy
444        // there's no need to defer the targets, so move them up to
445        // the regular target list.
446        assert(!targets.needsExclusive);
447        targets.needsExclusive = true;
448        // if any of the deferred targets were upper-level cache
449        // requests marked downstreamPending, need to clear that
450        assert(!downstreamPending);  // not pending here anymore
451        deferredTargets.clearDownstreamPending();
452        // this clears out deferredTargets too
453        targets.splice(targets.end(), deferredTargets);
454        deferredTargets.resetFlags();
455    }
456}
457
458
459bool
460MSHR::checkFunctional(PacketPtr pkt)
461{
462    // For printing, we treat the MSHR as a whole as single entity.
463    // For other requests, we iterate over the individual targets
464    // since that's where the actual data lies.
465    if (pkt->isPrint()) {
466        pkt->checkFunctional(this, addr, isSecure, size, NULL);
467        return false;
468    } else {
469        return (targets.checkFunctional(pkt) ||
470                deferredTargets.checkFunctional(pkt));
471    }
472}
473
474
475void
476MSHR::print(std::ostream &os, int verbosity, const std::string &prefix) const
477{
478    ccprintf(os, "%s[%x:%x](%s) %s %s %s state: %s %s %s %s %s\n",
479             prefix, addr, addr+size-1,
480             isSecure ? "s" : "ns",
481             isForward ? "Forward" : "",
482             isForwardNoResponse() ? "ForwNoResp" : "",
483             needsExclusive() ? "Excl" : "",
484             _isUncacheable ? "Unc" : "",
485             inService ? "InSvc" : "",
486             downstreamPending ? "DwnPend" : "",
487             hasPostInvalidate() ? "PostInv" : "",
488             hasPostDowngrade() ? "PostDowngr" : "");
489
490    ccprintf(os, "%s  Targets:\n", prefix);
491    targets.print(os, verbosity, prefix + "    ");
492    if (!deferredTargets.empty()) {
493        ccprintf(os, "%s  Deferred Targets:\n", prefix);
494        deferredTargets.print(os, verbosity, prefix + "      ");
495    }
496}
497
498std::string
499MSHR::print() const
500{
501    ostringstream str;
502    print(str);
503    return str.str();
504}
505