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; --- 88 unchanged lines hidden (view full) --- 97 l.m_link = m_out.size(); 98 m_link_order.push_back(l); 99 100 // Add to routing table 101 m_out.push_back(out); 102 m_routing_table.push_back(routing_table_entry); 103} 104 |
105PerfectSwitch::~PerfectSwitch() 106{ 107} 108 109void 110PerfectSwitch::wakeup() 111{ 112 MsgPtr msg_ptr; --- 183 unchanged lines hidden (view full) --- 296 297void 298PerfectSwitch::storeEventInfo(int info) 299{ 300 m_pending_message_count[info]++; 301} 302 303void |
304PerfectSwitch::clearStats() |
305{ |
306} |
307void |
308PerfectSwitch::collateStats() |
309{ 310} 311 |
312 |
313void 314PerfectSwitch::print(std::ostream& out) const 315{ 316 out << "[PerfectSwitch " << m_switch_id << "]"; 317} |