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;

--- 43 unchanged lines hidden (view full) ---

52
53 // Allocate to and from queues
54 // Queues that are getting messages from protocol
55 m_toNetQueues.resize(m_nodes);
56
57 // Queues that are feeding the protocol
58 m_fromNetQueues.resize(m_nodes);
59
60 m_in_use.resize(m_virtual_networks);
61 m_ordered.resize(m_virtual_networks);
62
63 for (int i = 0; i < m_virtual_networks; i++) {
64 m_in_use[i] = false;
65 m_ordered[i] = false;
66 }
67

--- 9 unchanged lines hidden (view full) ---

77
78 // Register a callback function for combining the statistics
79 Stats::registerDumpCallback(new StatsCallback(this));
80}
81
82Network::~Network()
83{
84 for (int node = 0; node < m_nodes; node++) {
85
86 // Delete the Message Buffers
87 for (auto& it : m_toNetQueues[node]) {
88 delete it.second;
89 }
90
91 for (auto& it : m_fromNetQueues[node]) {
92 delete it.second;
93 }
94 }
95
96 delete m_topology_ptr;
97}
98
99void
100Network::init()
101{

--- 31 unchanged lines hidden ---