summaryrefslogtreecommitdiff
path: root/src/mem/tport.cc
blob: 21907c0ca30143075cc3f426168844eb214f5ed9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/*
 * Copyright (c) 2006 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.
 *
 * Authors: Ali Saidi
 */

#include "mem/tport.hh"

void
SimpleTimingPort::recvFunctional(Packet *pkt)
{
    //First check queued events
    std::list<Packet *>::iterator i = transmitList.begin();
    std::list<Packet *>::iterator end = transmitList.end();
    bool cont = true;

    while (i != end && cont) {
        Packet * target = *i;
        // If the target contains data, and it overlaps the
        // probed request, need to update data
        if (target->intersect(pkt))
            fixPacket(pkt, target);

    }
    //Then just do an atomic access and throw away the returned latency
    if (cont)
        recvAtomic(pkt);
}

bool
SimpleTimingPort::recvTiming(Packet *pkt)
{
    // If the device is only a slave, it should only be sending
    // responses, which should never get nacked.  There used to be
    // code to hanldle nacks here, but I'm pretty sure it didn't work
    // correctly with the drain code, so that would need to be fixed
    // if we ever added it back.
    assert(pkt->result != Packet::Nacked);
    Tick latency = recvAtomic(pkt);
    // turn packet around to go back to requester if response expected
    if (pkt->needsResponse()) {
        pkt->makeTimingResponse();
        sendTimingLater(pkt, latency);
    }
    return true;
}

void
SimpleTimingPort::recvRetry()
{
    assert(outTiming > 0);
    assert(!transmitList.empty());
    if (sendTiming(transmitList.front())) {
        transmitList.pop_front();
        outTiming--;
        DPRINTF(Bus, "No Longer waiting on retry\n");
        if (!transmitList.empty())
            sendTimingLater(transmitList.front(), 1);
    }

    if (transmitList.empty() && drainEvent) {
        drainEvent->process();
        drainEvent = NULL;
    }
}

void
SimpleTimingPort::SendEvent::process()
{
    assert(port->outTiming > 0);
    if (!port->transmitList.empty() && port->transmitList.front() != packet) {
        //We are not the head of the list
        port->transmitList.push_back(packet);
    } else if (port->sendTiming(packet)) {
        // send successful
        if (port->transmitList.size()) {
            port->transmitList.pop_front();
            port->outTiming--;
           if (!port->transmitList.empty())
                port->sendTimingLater(port->transmitList.front(), 1);
        }
        if (port->transmitList.empty() && port->drainEvent) {
            port->drainEvent->process();
            port->drainEvent = NULL;
        }
    } else {
        // send unsuccessful (due to flow control).  Will get retry
        // callback later; save for then if not already
        DPRINTF(Bus, "Waiting on retry\n");
        if (!(port->transmitList.front() == packet))
            port->transmitList.push_back(packet);
    }
}


unsigned int
SimpleTimingPort::drain(Event *de)
{
    if (outTiming == 0 && transmitList.size() == 0)
        return 0;
    drainEvent = de;
    return 1;
}