52 lines
2.1 KiB
C++
52 lines
2.1 KiB
C++
|
/*
|
||
|
|
* Copyright (c) 2004 The Regents of The University of Michigan
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions are
|
||
|
|
* met: redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer;
|
||
|
|
* redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution;
|
||
|
|
* neither the name of the copyright holders nor the names of its
|
||
|
|
* contributors may be used to endorse or promote products derived from
|
||
|
|
* this software without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <list>
|
||
|
|
|
||
|
|
#include "base/misc.hh"
|
||
|
|
#include "sim/startup.hh"
|
||
|
|
#include "sim/debug.hh"
|
||
|
|
|
||
|
|
typedef std::list<StartupCallback *> startupq_t;
|
||
|
|
startupq_t &startupq() { static startupq_t queue; return queue; }
|
||
|
|
StartupCallback::StartupCallback() { startupq().push_back(this); }
|
||
|
|
StartupCallback::~StartupCallback() { startupq().remove(this); }
|
||
|
|
void StartupCallback::startup() { }
|
||
|
|
|
||
|
|
void
|
||
|
|
SimStartup()
|
||
|
|
{
|
||
|
|
startupq_t::iterator i = startupq().begin();
|
||
|
|
startupq_t::iterator end = startupq().end();
|
||
|
|
|
||
|
|
while (i != end) {
|
||
|
|
(*i)->startup();
|
||
|
|
++i;
|
||
|
|
}
|
||
|
|
}
|