coherent_xbar.cc revision 2665
110859Sandreas.sandberg@arm.com/*
210859Sandreas.sandberg@arm.com * Copyright (c) 2006 The Regents of The University of Michigan
310859Sandreas.sandberg@arm.com * All rights reserved.
410859Sandreas.sandberg@arm.com *
510859Sandreas.sandberg@arm.com * Redistribution and use in source and binary forms, with or without
610859Sandreas.sandberg@arm.com * modification, are permitted provided that the following conditions are
710859Sandreas.sandberg@arm.com * met: redistributions of source code must retain the above copyright
810859Sandreas.sandberg@arm.com * notice, this list of conditions and the following disclaimer;
910859Sandreas.sandberg@arm.com * redistributions in binary form must reproduce the above copyright
1010859Sandreas.sandberg@arm.com * notice, this list of conditions and the following disclaimer in the
1110859Sandreas.sandberg@arm.com * documentation and/or other materials provided with the distribution;
1210859Sandreas.sandberg@arm.com * neither the name of the copyright holders nor the names of its
1310859Sandreas.sandberg@arm.com * contributors may be used to endorse or promote products derived from
1410859Sandreas.sandberg@arm.com * this software without specific prior written permission.
1510859Sandreas.sandberg@arm.com *
1610859Sandreas.sandberg@arm.com * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
1710859Sandreas.sandberg@arm.com * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
1810859Sandreas.sandberg@arm.com * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
1910859Sandreas.sandberg@arm.com * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2010859Sandreas.sandberg@arm.com * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2110859Sandreas.sandberg@arm.com * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
2210859Sandreas.sandberg@arm.com * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
2310859Sandreas.sandberg@arm.com * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
2410859Sandreas.sandberg@arm.com * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
2510859Sandreas.sandberg@arm.com * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
2610859Sandreas.sandberg@arm.com * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
2710859Sandreas.sandberg@arm.com *
2810859Sandreas.sandberg@arm.com * Authors: Ali Saidi
2910859Sandreas.sandberg@arm.com */
3010859Sandreas.sandberg@arm.com
3110859Sandreas.sandberg@arm.com/**
3210859Sandreas.sandberg@arm.com * @file Definition of a bus object.
3310859Sandreas.sandberg@arm.com */
3410859Sandreas.sandberg@arm.com
3510859Sandreas.sandberg@arm.com
3610859Sandreas.sandberg@arm.com#include "base/trace.hh"
3710859Sandreas.sandberg@arm.com#include "mem/bus.hh"
3810859Sandreas.sandberg@arm.com#include "sim/builder.hh"
3910859Sandreas.sandberg@arm.com
4010859Sandreas.sandberg@arm.comPort *
4110859Sandreas.sandberg@arm.comBus::getPort(const std::string &if_name)
4210859Sandreas.sandberg@arm.com{
4310859Sandreas.sandberg@arm.com    // if_name ignored?  forced to be empty?
4410859Sandreas.sandberg@arm.com    int id = interfaces.size();
4510859Sandreas.sandberg@arm.com    BusPort *bp = new BusPort(csprintf("%s-p%d", name(), id), this, id);
4610859Sandreas.sandberg@arm.com    interfaces.push_back(bp);
4710859Sandreas.sandberg@arm.com    return bp;
4810859Sandreas.sandberg@arm.com}
4912334Sgabeblack@google.com
5010859Sandreas.sandberg@arm.com/** Get the ranges of anyone that we are connected to. */
5110859Sandreas.sandberg@arm.comvoid
5210859Sandreas.sandberg@arm.comBus::init()
5310859Sandreas.sandberg@arm.com{
5410859Sandreas.sandberg@arm.com    std::vector<Port*>::iterator intIter;
5510859Sandreas.sandberg@arm.com    for (intIter = interfaces.begin(); intIter != interfaces.end(); intIter++)
5610859Sandreas.sandberg@arm.com        (*intIter)->sendStatusChange(Port::RangeChange);
5710859Sandreas.sandberg@arm.com}
5810859Sandreas.sandberg@arm.com
5910859Sandreas.sandberg@arm.com
6010859Sandreas.sandberg@arm.com/** Function called by the port when the bus is receiving a Timing
6110859Sandreas.sandberg@arm.com * transaction.*/
6210859Sandreas.sandberg@arm.combool
6310859Sandreas.sandberg@arm.comBus::recvTiming(Packet *pkt)
6410859Sandreas.sandberg@arm.com{
6510859Sandreas.sandberg@arm.com    Port *port;
6610859Sandreas.sandberg@arm.com    DPRINTF(Bus, "recvTiming: packet src %d dest %d addr 0x%x cmd %s\n",
6710859Sandreas.sandberg@arm.com            pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
6810859Sandreas.sandberg@arm.com
6910859Sandreas.sandberg@arm.com    short dest = pkt->getDest();
7010859Sandreas.sandberg@arm.com    if (dest == Packet::Broadcast) {
7110859Sandreas.sandberg@arm.com        port = findPort(pkt->getAddr(), pkt->getSrc());
7210859Sandreas.sandberg@arm.com    } else {
7310859Sandreas.sandberg@arm.com        assert(dest >= 0 && dest < interfaces.size());
7410859Sandreas.sandberg@arm.com        assert(dest != pkt->getSrc()); // catch infinite loops
7510859Sandreas.sandberg@arm.com        port = interfaces[dest];
7610859Sandreas.sandberg@arm.com    }
7710859Sandreas.sandberg@arm.com    if (port->sendTiming(pkt))  {
7810859Sandreas.sandberg@arm.com        // packet was successfully sent, just return true.
7910859Sandreas.sandberg@arm.com        return true;
8010859Sandreas.sandberg@arm.com    }
8110859Sandreas.sandberg@arm.com
8210859Sandreas.sandberg@arm.com    // packet not successfully sent
8310859Sandreas.sandberg@arm.com    retryList.push_back(interfaces[pkt->getSrc()]);
8410859Sandreas.sandberg@arm.com    return false;
8510859Sandreas.sandberg@arm.com}
8610859Sandreas.sandberg@arm.com
8710859Sandreas.sandberg@arm.comvoid
8810859Sandreas.sandberg@arm.comBus::recvRetry(int id)
8910859Sandreas.sandberg@arm.com{
9010859Sandreas.sandberg@arm.com    // Go through all the elements on the list calling sendRetry on each
9110859Sandreas.sandberg@arm.com    // This is not very efficient at all but it works. Ultimately we should end
9210859Sandreas.sandberg@arm.com    // up with something that is more intelligent.
9310859Sandreas.sandberg@arm.com    int initialSize = retryList.size();
9410859Sandreas.sandberg@arm.com    int i;
9510859Sandreas.sandberg@arm.com    Port *p;
9610859Sandreas.sandberg@arm.com
9710859Sandreas.sandberg@arm.com    for (i = 0; i < initialSize; i++) {
9810859Sandreas.sandberg@arm.com        assert(retryList.size() > 0);
9910859Sandreas.sandberg@arm.com        p = retryList.front();
10010859Sandreas.sandberg@arm.com        retryList.pop_front();
10110859Sandreas.sandberg@arm.com        p->sendRetry();
10210859Sandreas.sandberg@arm.com    }
10310859Sandreas.sandberg@arm.com}
10410859Sandreas.sandberg@arm.com
10510859Sandreas.sandberg@arm.com
10610859Sandreas.sandberg@arm.comPort *
10710859Sandreas.sandberg@arm.comBus::findPort(Addr addr, int id)
10810859Sandreas.sandberg@arm.com{
10910859Sandreas.sandberg@arm.com    /* An interval tree would be a better way to do this. --ali. */
11010859Sandreas.sandberg@arm.com    int dest_id = -1;
11110859Sandreas.sandberg@arm.com    int i = 0;
11210859Sandreas.sandberg@arm.com    bool found = false;
11310859Sandreas.sandberg@arm.com
11410859Sandreas.sandberg@arm.com    while (i < portList.size() && !found)
11510859Sandreas.sandberg@arm.com    {
11610859Sandreas.sandberg@arm.com        if (portList[i].range == addr) {
11710859Sandreas.sandberg@arm.com            dest_id = portList[i].portId;
11810859Sandreas.sandberg@arm.com            found = true;
11910859Sandreas.sandberg@arm.com            DPRINTF(Bus, "  found addr 0x%llx on device %d\n", addr, dest_id);
12010859Sandreas.sandberg@arm.com        }
12110859Sandreas.sandberg@arm.com        i++;
12210859Sandreas.sandberg@arm.com    }
12310859Sandreas.sandberg@arm.com    if (dest_id == -1)
12410859Sandreas.sandberg@arm.com        panic("Unable to find destination for addr: %llx", addr);
12510859Sandreas.sandberg@arm.com
126    // we shouldn't be sending this back to where it came from
127    assert(dest_id != id);
128
129    return interfaces[dest_id];
130}
131
132/** Function called by the port when the bus is receiving a Atomic
133 * transaction.*/
134Tick
135Bus::recvAtomic(Packet *pkt)
136{
137    DPRINTF(Bus, "recvAtomic: packet src %d dest %d addr 0x%x cmd %s\n",
138            pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
139    assert(pkt->getDest() == Packet::Broadcast);
140    return findPort(pkt->getAddr(), pkt->getSrc())->sendAtomic(pkt);
141}
142
143/** Function called by the port when the bus is receiving a Functional
144 * transaction.*/
145void
146Bus::recvFunctional(Packet *pkt)
147{
148    DPRINTF(Bus, "recvFunctional: packet src %d dest %d addr 0x%x cmd %s\n",
149            pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
150    assert(pkt->getDest() == Packet::Broadcast);
151    findPort(pkt->getAddr(), pkt->getSrc())->sendFunctional(pkt);
152}
153
154/** Function called by the port when the bus is receiving a status change.*/
155void
156Bus::recvStatusChange(Port::Status status, int id)
157{
158    assert(status == Port::RangeChange &&
159           "The other statuses need to be implemented.");
160
161    DPRINTF(BusAddrRanges, "received RangeChange from device id %d\n", id);
162
163    assert(id < interfaces.size() && id >= 0);
164    int x;
165    Port *port = interfaces[id];
166    AddrRangeList ranges;
167    AddrRangeList snoops;
168    AddrRangeIter iter;
169    std::vector<DevMap>::iterator portIter;
170
171    // Clean out any previously existent ids
172    for (portIter = portList.begin(); portIter != portList.end(); ) {
173        if (portIter->portId == id)
174            portIter = portList.erase(portIter);
175        else
176            portIter++;
177    }
178
179    port->getPeerAddressRanges(ranges, snoops);
180
181    // not dealing with snooping yet either
182    assert(snoops.size() == 0);
183    for(iter = ranges.begin(); iter != ranges.end(); iter++) {
184        DevMap dm;
185        dm.portId = id;
186        dm.range = *iter;
187
188        DPRINTF(BusAddrRanges, "Adding range %llx - %llx for id %d\n",
189                dm.range.start, dm.range.end, id);
190        portList.push_back(dm);
191    }
192    DPRINTF(MMU, "port list has %d entries\n", portList.size());
193
194    // tell all our peers that our address range has changed.
195    // Don't tell the device that caused this change, it already knows
196    for (x = 0; x < interfaces.size(); x++)
197        if (x != id)
198            interfaces[x]->sendStatusChange(Port::RangeChange);
199}
200
201void
202Bus::addressRanges(AddrRangeList &resp, AddrRangeList &snoop, int id)
203{
204    std::vector<DevMap>::iterator portIter;
205
206    resp.clear();
207    snoop.clear();
208
209    DPRINTF(BusAddrRanges, "received address range request, returning:\n");
210    for (portIter = portList.begin(); portIter != portList.end(); portIter++) {
211        if (portIter->portId != id) {
212            resp.push_back(portIter->range);
213            DPRINTF(BusAddrRanges, "  -- %#llX : %#llX\n",
214                    portIter->range.start, portIter->range.end);
215        }
216    }
217}
218
219BEGIN_DECLARE_SIM_OBJECT_PARAMS(Bus)
220
221    Param<int> bus_id;
222
223END_DECLARE_SIM_OBJECT_PARAMS(Bus)
224
225BEGIN_INIT_SIM_OBJECT_PARAMS(Bus)
226    INIT_PARAM(bus_id, "a globally unique bus id")
227END_INIT_SIM_OBJECT_PARAMS(Bus)
228
229CREATE_SIM_OBJECT(Bus)
230{
231    return new Bus(getInstanceName(), bus_id);
232}
233
234REGISTER_SIM_OBJECT("Bus", Bus)
235