Searched refs:m_nodes (Results 1 - 6 of 6) sorted by relevance

/gem5/src/mem/ruby/network/
H A DTopology.cc44 // Note: In this file, we use the first 2*m_nodes SwitchIDs to
47 // them. The first m_nodes SwitchIDs are the links into the network,
48 // the second m_nodes set of SwitchIDs represent the the output queues
54 : m_nodes(MachineType_base_number(MachineType_NUM)),
59 assert(m_nodes > 1);
77 int ext_idx2 = ext_idx1 + m_nodes;
78 int int_idx = router->params()->router_id + 2*m_nodes;
100 int src = router_src->params()->router_id + 2*m_nodes;
101 int dst = router_dst->params()->router_id + 2*m_nodes;
166 assert(src <= m_number_of_switches+m_nodes
[all...]
H A DNetwork.cc60 m_nodes = MachineType_base_number(MachineType_NUM);
61 assert(m_nodes != 0);
69 m_toNetQueues.resize(m_nodes);
72 m_fromNetQueues.resize(m_nodes);
110 for (int node = 0; node < m_nodes; node++) {
165 fatal_if(id >= m_nodes, "Node ID is out of range");
H A DNetwork.hh88 int getNumNodes() const { return m_nodes; }
148 uint32_t m_nodes; member in class:Network
H A DTopology.hh35 * 2*m_nodes elements in the node vector are input and output
96 const uint32_t m_nodes; member in class:Topology
/gem5/src/mem/ruby/network/simple/
H A DSimpleNetwork.cc85 assert(dest < m_nodes);
101 assert(src < m_nodes);
/gem5/src/mem/ruby/network/garnet2.0/
H A DGarnetNetwork.cc106 for (int i=0; i < m_nodes; i++) {
165 assert(src < m_nodes);
192 assert(dest < m_nodes);

Completed in 22 milliseconds