Topology.cc (11664:2365e9e396f7) | Topology.cc (11793:ef606668d247) |
---|---|
1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 12 unchanged lines hidden (view full) --- 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 | 1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 12 unchanged lines hidden (view full) --- 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 |
29#include "mem/ruby/network/Topology.hh" 30 |
|
29#include <cassert> 30 31#include "base/trace.hh" 32#include "debug/RubyNetwork.hh" 33#include "mem/ruby/common/NetDest.hh" 34#include "mem/ruby/network/BasicLink.hh" | 31#include <cassert> 32 33#include "base/trace.hh" 34#include "debug/RubyNetwork.hh" 35#include "mem/ruby/common/NetDest.hh" 36#include "mem/ruby/network/BasicLink.hh" |
35#include "mem/ruby/network/Topology.hh" | 37#include "mem/ruby/network/Network.hh" |
36#include "mem/ruby/slicc_interface/AbstractController.hh" 37 38using namespace std; 39 40const int INFINITE_LATENCY = 10000; // Yes, this is a big hack 41 42// Note: In this file, we use the first 2*m_nodes SwitchIDs to 43// represent the input and output endpoint links. These really are --- 264 unchanged lines hidden --- | 38#include "mem/ruby/slicc_interface/AbstractController.hh" 39 40using namespace std; 41 42const int INFINITE_LATENCY = 10000; // Yes, this is a big hack 43 44// Note: In this file, we use the first 2*m_nodes SwitchIDs to 45// represent the input and output endpoint links. These really are --- 264 unchanged lines hidden --- |