eventq.hh revision 7058
12SN/A/* 21762SN/A * Copyright (c) 2000-2005 The Regents of The University of Michigan 32SN/A * All rights reserved. 42SN/A * 52SN/A * Redistribution and use in source and binary forms, with or without 62SN/A * modification, are permitted provided that the following conditions are 72SN/A * met: redistributions of source code must retain the above copyright 82SN/A * notice, this list of conditions and the following disclaimer; 92SN/A * redistributions in binary form must reproduce the above copyright 102SN/A * notice, this list of conditions and the following disclaimer in the 112SN/A * documentation and/or other materials provided with the distribution; 122SN/A * neither the name of the copyright holders nor the names of its 132SN/A * contributors may be used to endorse or promote products derived from 142SN/A * this software without specific prior written permission. 152SN/A * 162SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272665Ssaidi@eecs.umich.edu * 282665Ssaidi@eecs.umich.edu * Authors: Steve Reinhardt 292665Ssaidi@eecs.umich.edu * Nathan Binkert 302SN/A */ 312SN/A 322SN/A/* @file 332SN/A * EventQueue interfaces 342SN/A */ 352SN/A 361354SN/A#ifndef __SIM_EVENTQ_HH__ 371354SN/A#define __SIM_EVENTQ_HH__ 382SN/A 392SN/A#include <algorithm> 405501Snate@binkert.org#include <cassert> 415546Snate@binkert.org#include <climits> 427004Snate@binkert.org#include <iosfwd> 432SN/A#include <string> 442SN/A 4556SN/A#include "base/fast_alloc.hh" 465769Snate@binkert.org#include "base/flags.hh" 472361SN/A#include "base/misc.hh" 481354SN/A#include "base/trace.hh" 496216Snate@binkert.org#include "base/types.hh" 5056SN/A#include "sim/serialize.hh" 512SN/A 525543Ssaidi@eecs.umich.educlass EventQueue; // forward declaration 532SN/A 541354SN/Aextern EventQueue mainEventQueue; 551354SN/A 562SN/A/* 572SN/A * An item on an event queue. The action caused by a given 582SN/A * event is specified by deriving a subclass and overriding the 592SN/A * process() member function. 605501Snate@binkert.org * 615501Snate@binkert.org * Caution, the order of members is chosen to maximize data packing. 622SN/A */ 63395SN/Aclass Event : public Serializable, public FastAlloc 642SN/A{ 652SN/A friend class EventQueue; 662SN/A 675769Snate@binkert.org protected: 685769Snate@binkert.org typedef short FlagsType; 695769Snate@binkert.org typedef ::Flags<FlagsType> Flags; 705769Snate@binkert.org 715769Snate@binkert.org static const FlagsType PublicRead = 0x003f; 725769Snate@binkert.org static const FlagsType PublicWrite = 0x001d; 735769Snate@binkert.org static const FlagsType Squashed = 0x0001; 745769Snate@binkert.org static const FlagsType Scheduled = 0x0002; 755769Snate@binkert.org static const FlagsType AutoDelete = 0x0004; 765769Snate@binkert.org static const FlagsType AutoSerialize = 0x0008; 775769Snate@binkert.org static const FlagsType IsExitEvent = 0x0010; 785769Snate@binkert.org static const FlagsType IsMainQueue = 0x0020; 795774Snate@binkert.org#ifdef EVENTQ_DEBUG 805774Snate@binkert.org static const FlagsType Initialized = 0xf000; 815774Snate@binkert.org#endif 825769Snate@binkert.org 837058Snate@binkert.org public: 847058Snate@binkert.org typedef int8_t Priority; 857058Snate@binkert.org 862SN/A private: 875502Snate@binkert.org // The event queue is now a linked list of linked lists. The 885502Snate@binkert.org // 'nextBin' pointer is to find the bin, where a bin is defined as 895502Snate@binkert.org // when+priority. All events in the same bin will be stored in a 905503Snate@binkert.org // second linked list (a stack) maintained by the 'nextInBin' 915503Snate@binkert.org // pointer. The list will be accessed in LIFO order. The end 925502Snate@binkert.org // result is that the insert/removal in 'nextBin' is 935502Snate@binkert.org // linear/constant, and the lookup/removal in 'nextInBin' is 945502Snate@binkert.org // constant/constant. Hopefully this is a significant improvement 955502Snate@binkert.org // over the current fully linear insertion. 965502Snate@binkert.org Event *nextBin; 975502Snate@binkert.org Event *nextInBin; 985502Snate@binkert.org 995602Snate@binkert.org static Event *insertBefore(Event *event, Event *curr); 1005602Snate@binkert.org static Event *removeItem(Event *event, Event *last); 1015501Snate@binkert.org 1025543Ssaidi@eecs.umich.edu Tick _when; //!< timestamp when event should be processed 1037058Snate@binkert.org Priority _priority; //!< event priority 1045769Snate@binkert.org Flags flags; 1054016Sstever@eecs.umich.edu 1064016Sstever@eecs.umich.edu#ifndef NDEBUG 1074016Sstever@eecs.umich.edu /// Global counter to generate unique IDs for Event instances 1084016Sstever@eecs.umich.edu static Counter instanceCounter; 1094016Sstever@eecs.umich.edu 1104016Sstever@eecs.umich.edu /// This event's unique ID. We can also use pointer values for 1114016Sstever@eecs.umich.edu /// this but they're not consistent across runs making debugging 1124016Sstever@eecs.umich.edu /// more difficult. Thus we use a global counter value when 1134016Sstever@eecs.umich.edu /// debugging. 1145501Snate@binkert.org Counter instance; 1155605Snate@binkert.org 1165605Snate@binkert.org /// queue to which this event belongs (though it may or may not be 1175605Snate@binkert.org /// scheduled on this queue yet) 1185605Snate@binkert.org EventQueue *queue; 1195501Snate@binkert.org#endif 1204016Sstever@eecs.umich.edu 1215577SSteve.Reinhardt@amd.com#ifdef EVENTQ_DEBUG 1225501Snate@binkert.org Tick whenCreated; //!< time created 1235501Snate@binkert.org Tick whenScheduled; //!< time scheduled 1245501Snate@binkert.org#endif 1255502Snate@binkert.org 1265502Snate@binkert.org void 1275605Snate@binkert.org setWhen(Tick when, EventQueue *q) 1285502Snate@binkert.org { 1295502Snate@binkert.org _when = when; 1305605Snate@binkert.org#ifndef NDEBUG 1315605Snate@binkert.org queue = q; 1325605Snate@binkert.org#endif 1335577SSteve.Reinhardt@amd.com#ifdef EVENTQ_DEBUG 1345502Snate@binkert.org whenScheduled = curTick; 1355502Snate@binkert.org#endif 1365502Snate@binkert.org } 1375502Snate@binkert.org 1382SN/A protected: 1395769Snate@binkert.org /// Accessor for flags. 1405769Snate@binkert.org Flags 1415769Snate@binkert.org getFlags() const 1425769Snate@binkert.org { 1435769Snate@binkert.org return flags & PublicRead; 1445769Snate@binkert.org } 1452SN/A 1465769Snate@binkert.org Flags 1475769Snate@binkert.org getFlags(Flags _flags) const 1485769Snate@binkert.org { 1495769Snate@binkert.org assert(flags.noneSet(~PublicRead)); 1505769Snate@binkert.org return flags.isSet(_flags); 1515769Snate@binkert.org } 1522SN/A 1535769Snate@binkert.org Flags 1545769Snate@binkert.org allFlags(Flags _flags) const 1555769Snate@binkert.org { 1565769Snate@binkert.org assert(_flags.noneSet(~PublicRead)); 1575769Snate@binkert.org return flags.allSet(_flags); 1585769Snate@binkert.org } 1595769Snate@binkert.org 1605769Snate@binkert.org /// Accessor for flags. 1615769Snate@binkert.org void 1625769Snate@binkert.org setFlags(Flags _flags) 1635769Snate@binkert.org { 1645769Snate@binkert.org assert(_flags.noneSet(~PublicWrite)); 1655769Snate@binkert.org flags.set(_flags); 1665769Snate@binkert.org } 1675769Snate@binkert.org 1685769Snate@binkert.org void 1695769Snate@binkert.org clearFlags(Flags _flags) 1705769Snate@binkert.org { 1715769Snate@binkert.org assert(_flags.noneSet(~PublicWrite)); 1725769Snate@binkert.org flags.clear(_flags); 1735769Snate@binkert.org } 1745769Snate@binkert.org 1755769Snate@binkert.org void 1765769Snate@binkert.org clearFlags() 1775769Snate@binkert.org { 1785769Snate@binkert.org flags.clear(PublicWrite); 1795769Snate@binkert.org } 1805769Snate@binkert.org 1815501Snate@binkert.org // This function isn't really useful if TRACING_ON is not defined 1825543Ssaidi@eecs.umich.edu virtual void trace(const char *action); //!< trace event activity 1832SN/A 1842SN/A public: 185396SN/A /// Event priorities, to provide tie-breakers for events scheduled 186396SN/A /// at the same cycle. Most events are scheduled at the default 187396SN/A /// priority; these values are used to control events that need to 188396SN/A /// be ordered within a cycle. 1895501Snate@binkert.org 1907058Snate@binkert.org /// Minimum priority 1917058Snate@binkert.org static const Priority Minimum_Pri = SCHAR_MIN; 1923329Sstever@eecs.umich.edu 1937058Snate@binkert.org /// If we enable tracing on a particular cycle, do that as the 1947058Snate@binkert.org /// very first thing so we don't miss any of the events on 1957058Snate@binkert.org /// that cycle (even if we enter the debugger). 1967058Snate@binkert.org static const Priority Trace_Enable_Pri = -101; 197396SN/A 1987058Snate@binkert.org /// Breakpoints should happen before anything else (except 1997058Snate@binkert.org /// enabling trace output), so we don't miss any action when 2007058Snate@binkert.org /// debugging. 2017058Snate@binkert.org static const Priority Debug_Break_Pri = -100; 2023329Sstever@eecs.umich.edu 2037058Snate@binkert.org /// CPU switches schedule the new CPU's tick event for the 2047058Snate@binkert.org /// same cycle (after unscheduling the old CPU's tick event). 2057058Snate@binkert.org /// The switch needs to come before any tick events to make 2067058Snate@binkert.org /// sure we don't tick both CPUs in the same cycle. 2077058Snate@binkert.org static const Priority CPU_Switch_Pri = -31; 208396SN/A 2097058Snate@binkert.org /// For some reason "delayed" inter-cluster writebacks are 2107058Snate@binkert.org /// scheduled before regular writebacks (which have default 2117058Snate@binkert.org /// priority). Steve? 2127058Snate@binkert.org static const Priority Delayed_Writeback_Pri = -1; 213396SN/A 2147058Snate@binkert.org /// Default is zero for historical reasons. 2157058Snate@binkert.org static const Priority Default_Pri = 0; 216396SN/A 2177058Snate@binkert.org /// Serailization needs to occur before tick events also, so 2187058Snate@binkert.org /// that a serialize/unserialize is identical to an on-line 2197058Snate@binkert.org /// CPU switch. 2207058Snate@binkert.org static const Priority Serialize_Pri = 32; 221396SN/A 2227058Snate@binkert.org /// CPU ticks must come after other associated CPU events 2237058Snate@binkert.org /// (such as writebacks). 2247058Snate@binkert.org static const Priority CPU_Tick_Pri = 50; 225396SN/A 2267058Snate@binkert.org /// Statistics events (dump, reset, etc.) come after 2277058Snate@binkert.org /// everything else, but before exit. 2287058Snate@binkert.org static const Priority Stat_Event_Pri = 90; 2294075Sbinkertn@umich.edu 2307058Snate@binkert.org /// Progress events come at the end. 2317058Snate@binkert.org static const Priority Progress_Event_Pri = 95; 2325501Snate@binkert.org 2337058Snate@binkert.org /// If we want to exit on this cycle, it's the very last thing 2347058Snate@binkert.org /// we do. 2357058Snate@binkert.org static const Priority Sim_Exit_Pri = 100; 2367058Snate@binkert.org 2377058Snate@binkert.org /// Maximum priority 2387058Snate@binkert.org static const Priority Maximum_Pri = SCHAR_MAX; 239396SN/A 2402SN/A /* 2412SN/A * Event constructor 2422SN/A * @param queue that the event gets scheduled on 2432SN/A */ 2445605Snate@binkert.org Event(Priority p = Default_Pri) 2455769Snate@binkert.org : nextBin(NULL), nextInBin(NULL), _priority(p) 246224SN/A { 2474016Sstever@eecs.umich.edu#ifndef NDEBUG 2485501Snate@binkert.org instance = ++instanceCounter; 2495605Snate@binkert.org queue = NULL; 2505501Snate@binkert.org#endif 2515501Snate@binkert.org#ifdef EVENTQ_DEBUG 2525774Snate@binkert.org flags.set(Initialized); 2535501Snate@binkert.org whenCreated = curTick; 2545501Snate@binkert.org whenScheduled = 0; 2554016Sstever@eecs.umich.edu#endif 256224SN/A } 257224SN/A 2585768Snate@binkert.org virtual ~Event(); 2595768Snate@binkert.org virtual const std::string name() const; 260265SN/A 2615501Snate@binkert.org /// Return a C string describing the event. This string should 2625501Snate@binkert.org /// *not* be dynamically allocated; just a const char array 2635501Snate@binkert.org /// describing the event class. 2645501Snate@binkert.org virtual const char *description() const; 2655501Snate@binkert.org 2665501Snate@binkert.org /// Dump the current event data 2675501Snate@binkert.org void dump() const; 2685501Snate@binkert.org 2695501Snate@binkert.org public: 2705501Snate@binkert.org /* 2715501Snate@binkert.org * This member function is invoked when the event is processed 2725501Snate@binkert.org * (occurs). There is no default implementation; each subclass 2735501Snate@binkert.org * must provide its own implementation. The event is not 2745501Snate@binkert.org * automatically deleted after it is processed (to allow for 2755501Snate@binkert.org * statically allocated event objects). 2765501Snate@binkert.org * 2775501Snate@binkert.org * If the AutoDestroy flag is set, the object is deleted once it 2785501Snate@binkert.org * is processed. 2795501Snate@binkert.org */ 2805501Snate@binkert.org virtual void process() = 0; 2815501Snate@binkert.org 2822SN/A /// Determine if the current event is scheduled 2835769Snate@binkert.org bool scheduled() const { return flags.isSet(Scheduled); } 2842SN/A 2852SN/A /// Squash the current event 2865769Snate@binkert.org void squash() { flags.set(Squashed); } 2872SN/A 2882SN/A /// Check whether the event is squashed 2895769Snate@binkert.org bool squashed() const { return flags.isSet(Squashed); } 2902SN/A 2912667Sstever@eecs.umich.edu /// See if this is a SimExitEvent (without resorting to RTTI) 2925769Snate@binkert.org bool isExitEvent() const { return flags.isSet(IsExitEvent); } 2932667Sstever@eecs.umich.edu 2942SN/A /// Get the time that the event is scheduled 2952SN/A Tick when() const { return _when; } 2962SN/A 2972SN/A /// Get the event priority 2987058Snate@binkert.org Priority priority() const { return _priority; } 2992SN/A 3005605Snate@binkert.org#ifndef SWIG 3015501Snate@binkert.org struct priority_compare 3025501Snate@binkert.org : public std::binary_function<Event *, Event *, bool> 3032SN/A { 3045501Snate@binkert.org bool 3055501Snate@binkert.org operator()(const Event *l, const Event *r) const 3065501Snate@binkert.org { 3072SN/A return l->when() >= r->when() || l->priority() >= r->priority(); 3082SN/A } 3092SN/A }; 310224SN/A 311224SN/A virtual void serialize(std::ostream &os); 312237SN/A virtual void unserialize(Checkpoint *cp, const std::string §ion); 3135605Snate@binkert.org#endif 314571SN/A}; 315571SN/A 3167005Snate@binkert.org#ifndef SWIG 3177005Snate@binkert.orginline bool 3187005Snate@binkert.orgoperator<(const Event &l, const Event &r) 3197005Snate@binkert.org{ 3207005Snate@binkert.org return l.when() < r.when() || 3217005Snate@binkert.org (l.when() == r.when() && l.priority() < r.priority()); 3227005Snate@binkert.org} 3237005Snate@binkert.org 3247005Snate@binkert.orginline bool 3257005Snate@binkert.orgoperator>(const Event &l, const Event &r) 3267005Snate@binkert.org{ 3277005Snate@binkert.org return l.when() > r.when() || 3287005Snate@binkert.org (l.when() == r.when() && l.priority() > r.priority()); 3297005Snate@binkert.org} 3307005Snate@binkert.org 3317005Snate@binkert.orginline bool 3327005Snate@binkert.orgoperator<=(const Event &l, const Event &r) 3337005Snate@binkert.org{ 3347005Snate@binkert.org return l.when() < r.when() || 3357005Snate@binkert.org (l.when() == r.when() && l.priority() <= r.priority()); 3367005Snate@binkert.org} 3377005Snate@binkert.orginline bool 3387005Snate@binkert.orgoperator>=(const Event &l, const Event &r) 3397005Snate@binkert.org{ 3407005Snate@binkert.org return l.when() > r.when() || 3417005Snate@binkert.org (l.when() == r.when() && l.priority() >= r.priority()); 3427005Snate@binkert.org} 3437005Snate@binkert.org 3447005Snate@binkert.orginline bool 3457005Snate@binkert.orgoperator==(const Event &l, const Event &r) 3467005Snate@binkert.org{ 3477005Snate@binkert.org return l.when() == r.when() && l.priority() == r.priority(); 3487005Snate@binkert.org} 3497005Snate@binkert.org 3507005Snate@binkert.orginline bool 3517005Snate@binkert.orgoperator!=(const Event &l, const Event &r) 3527005Snate@binkert.org{ 3537005Snate@binkert.org return l.when() != r.when() || l.priority() != r.priority(); 3547005Snate@binkert.org} 3557005Snate@binkert.org#endif 3567005Snate@binkert.org 3572SN/A/* 3582SN/A * Queue of events sorted in time order 3592SN/A */ 360395SN/Aclass EventQueue : public Serializable 3612SN/A{ 3625605Snate@binkert.org private: 363265SN/A std::string objName; 3642SN/A Event *head; 3652SN/A 3662SN/A void insert(Event *event); 3672SN/A void remove(Event *event); 3682SN/A 3692SN/A public: 3702SN/A EventQueue(const std::string &n) 371265SN/A : objName(n), head(NULL) 3722SN/A {} 3732SN/A 374512SN/A virtual const std::string name() const { return objName; } 375265SN/A 3762SN/A // schedule the given event on this queue 3775738Snate@binkert.org void schedule(Event *event, Tick when); 3785738Snate@binkert.org void deschedule(Event *event); 3795738Snate@binkert.org void reschedule(Event *event, Tick when, bool always = false); 3802SN/A 3815501Snate@binkert.org Tick nextTick() const { return head->when(); } 3822667Sstever@eecs.umich.edu Event *serviceOne(); 3832SN/A 3842SN/A // process all events up to the given timestamp. we inline a 3852SN/A // quick test to see if there are any events to process; if so, 3862SN/A // call the internal out-of-line version to process them all. 3875501Snate@binkert.org void 3885501Snate@binkert.org serviceEvents(Tick when) 3895501Snate@binkert.org { 3902SN/A while (!empty()) { 3912SN/A if (nextTick() > when) 3922SN/A break; 3932SN/A 3941634SN/A /** 3951634SN/A * @todo this assert is a good bug catcher. I need to 3961634SN/A * make it true again. 3971634SN/A */ 3981634SN/A //assert(head->when() >= when && "event scheduled in the past"); 3992SN/A serviceOne(); 4002SN/A } 4012SN/A } 4022SN/A 4032SN/A // default: process all events up to 'now' (curTick) 4042SN/A void serviceEvents() { serviceEvents(curTick); } 4052SN/A 4062SN/A // return true if no events are queued 4075501Snate@binkert.org bool empty() const { return head == NULL; } 4082SN/A 4095501Snate@binkert.org void dump() const; 4102SN/A 4112SN/A Tick nextEventTime() { return empty() ? curTick : head->when(); } 4122SN/A 4135502Snate@binkert.org bool debugVerify() const; 4145502Snate@binkert.org 4155605Snate@binkert.org#ifndef SWIG 416217SN/A virtual void serialize(std::ostream &os); 417237SN/A virtual void unserialize(Checkpoint *cp, const std::string §ion); 4185605Snate@binkert.org#endif 4192SN/A}; 4202SN/A 4215605Snate@binkert.org#ifndef SWIG 4225605Snate@binkert.orgclass EventManager 4235605Snate@binkert.org{ 4245605Snate@binkert.org protected: 4255605Snate@binkert.org /** A pointer to this object's event queue */ 4265605Snate@binkert.org EventQueue *eventq; 4272SN/A 4285605Snate@binkert.org public: 4295605Snate@binkert.org EventManager(EventManager &em) : eventq(em.queue()) {} 4305605Snate@binkert.org EventManager(EventManager *em) : eventq(em ? em->queue() : NULL) {} 4315605Snate@binkert.org EventManager(EventQueue *eq) : eventq(eq) {} 4322SN/A 4335605Snate@binkert.org EventQueue * 4345605Snate@binkert.org queue() const 4355605Snate@binkert.org { 4365605Snate@binkert.org return eventq; 4375605Snate@binkert.org } 4385605Snate@binkert.org 4395605Snate@binkert.org void 4405605Snate@binkert.org schedule(Event &event, Tick when) 4415605Snate@binkert.org { 4425605Snate@binkert.org eventq->schedule(&event, when); 4435605Snate@binkert.org } 4445605Snate@binkert.org 4455605Snate@binkert.org void 4465605Snate@binkert.org deschedule(Event &event) 4475605Snate@binkert.org { 4485605Snate@binkert.org eventq->deschedule(&event); 4495605Snate@binkert.org } 4505605Snate@binkert.org 4515605Snate@binkert.org void 4525605Snate@binkert.org reschedule(Event &event, Tick when, bool always = false) 4535605Snate@binkert.org { 4545605Snate@binkert.org eventq->reschedule(&event, when, always); 4555605Snate@binkert.org } 4565605Snate@binkert.org 4575605Snate@binkert.org void 4585605Snate@binkert.org schedule(Event *event, Tick when) 4595605Snate@binkert.org { 4605605Snate@binkert.org eventq->schedule(event, when); 4615605Snate@binkert.org } 4625605Snate@binkert.org 4635605Snate@binkert.org void 4645605Snate@binkert.org deschedule(Event *event) 4655605Snate@binkert.org { 4665605Snate@binkert.org eventq->deschedule(event); 4675605Snate@binkert.org } 4685605Snate@binkert.org 4695605Snate@binkert.org void 4705605Snate@binkert.org reschedule(Event *event, Tick when, bool always = false) 4715605Snate@binkert.org { 4725605Snate@binkert.org eventq->reschedule(event, when, always); 4735605Snate@binkert.org } 4745605Snate@binkert.org}; 4755605Snate@binkert.org 4762SN/Ainline void 4775605Snate@binkert.orgEventQueue::schedule(Event *event, Tick when) 4782SN/A{ 4796712Snate@binkert.org assert((UTick)when >= (UTick)curTick); 4805605Snate@binkert.org assert(!event->scheduled()); 4815774Snate@binkert.org#ifdef EVENTQ_DEBUG 4825774Snate@binkert.org assert((event->flags & Event::Initialized) == Event::Initialized); 4835774Snate@binkert.org#endif 4845605Snate@binkert.org 4855605Snate@binkert.org event->setWhen(when, this); 4865605Snate@binkert.org insert(event); 4875769Snate@binkert.org event->flags.set(Event::Scheduled); 4885605Snate@binkert.org if (this == &mainEventQueue) 4895769Snate@binkert.org event->flags.set(Event::IsMainQueue); 4905605Snate@binkert.org else 4915769Snate@binkert.org event->flags.clear(Event::IsMainQueue); 4925605Snate@binkert.org 4935605Snate@binkert.org if (DTRACE(Event)) 4945605Snate@binkert.org event->trace("scheduled"); 4952SN/A} 4962SN/A 4972SN/Ainline void 4985605Snate@binkert.orgEventQueue::deschedule(Event *event) 4992SN/A{ 5005605Snate@binkert.org assert(event->scheduled()); 5015774Snate@binkert.org#ifdef EVENTQ_DEBUG 5025774Snate@binkert.org assert((event->flags & Event::Initialized) == Event::Initialized); 5035774Snate@binkert.org#endif 5045605Snate@binkert.org 5055605Snate@binkert.org remove(event); 5065605Snate@binkert.org 5075769Snate@binkert.org event->flags.clear(Event::Squashed); 5085769Snate@binkert.org event->flags.clear(Event::Scheduled); 5095605Snate@binkert.org 5105769Snate@binkert.org if (event->flags.isSet(Event::AutoDelete)) 5115605Snate@binkert.org delete event; 5125605Snate@binkert.org 5135605Snate@binkert.org if (DTRACE(Event)) 5145605Snate@binkert.org event->trace("descheduled"); 5152SN/A} 5162SN/A 5172SN/Ainline void 5185605Snate@binkert.orgEventQueue::reschedule(Event *event, Tick when, bool always) 5192SN/A{ 5205605Snate@binkert.org assert(when >= curTick); 5215605Snate@binkert.org assert(always || event->scheduled()); 5225774Snate@binkert.org#ifdef EVENTQ_DEBUG 5235774Snate@binkert.org assert((event->flags & Event::Initialized) == Event::Initialized); 5245774Snate@binkert.org#endif 5255605Snate@binkert.org 5265605Snate@binkert.org if (event->scheduled()) 5275605Snate@binkert.org remove(event); 5285605Snate@binkert.org 5295605Snate@binkert.org event->setWhen(when, this); 5305605Snate@binkert.org insert(event); 5315769Snate@binkert.org event->flags.clear(Event::Squashed); 5325769Snate@binkert.org event->flags.set(Event::Scheduled); 5335605Snate@binkert.org if (this == &mainEventQueue) 5345769Snate@binkert.org event->flags.set(Event::IsMainQueue); 5355605Snate@binkert.org else 5365769Snate@binkert.org event->flags.clear(Event::IsMainQueue); 5375605Snate@binkert.org 5385605Snate@binkert.org if (DTRACE(Event)) 5395605Snate@binkert.org event->trace("rescheduled"); 5402SN/A} 5412SN/A 5427005Snate@binkert.orgtemplate <class T, void (T::* F)()> 5437005Snate@binkert.orgvoid 5447005Snate@binkert.orgDelayFunction(EventQueue *eventq, Tick when, T *object) 5455502Snate@binkert.org{ 5467005Snate@binkert.org class DelayEvent : public Event 5477005Snate@binkert.org { 5487005Snate@binkert.org private: 5497005Snate@binkert.org T *object; 5507005Snate@binkert.org 5517005Snate@binkert.org public: 5527005Snate@binkert.org DelayEvent(T *o) 5537005Snate@binkert.org : object(o) 5547005Snate@binkert.org { this->setFlags(AutoDelete); } 5557005Snate@binkert.org void process() { (object->*F)(); } 5567005Snate@binkert.org const char *description() const { return "delay"; } 5577005Snate@binkert.org }; 5587005Snate@binkert.org 5597005Snate@binkert.org eventq->schedule(new DelayEvent(object), when); 5605502Snate@binkert.org} 5615502Snate@binkert.org 5627005Snate@binkert.orgtemplate <class T, void (T::* F)()> 5637005Snate@binkert.orgclass EventWrapper : public Event 5645502Snate@binkert.org{ 5657005Snate@binkert.org private: 5667005Snate@binkert.org T *object; 5675502Snate@binkert.org 5687005Snate@binkert.org public: 5697005Snate@binkert.org EventWrapper(T *obj, bool del = false, Priority p = Default_Pri) 5707005Snate@binkert.org : Event(p), object(obj) 5717005Snate@binkert.org { 5727005Snate@binkert.org if (del) 5737005Snate@binkert.org setFlags(AutoDelete); 5747005Snate@binkert.org } 5755502Snate@binkert.org 5767005Snate@binkert.org void process() { (object->*F)(); } 5775502Snate@binkert.org 5787005Snate@binkert.org const std::string 5797005Snate@binkert.org name() const 5807005Snate@binkert.org { 5817005Snate@binkert.org return object->name() + ".wrapped_event"; 5827005Snate@binkert.org } 5837005Snate@binkert.org 5847005Snate@binkert.org const char *description() const { return "EventWrapped"; } 5857005Snate@binkert.org}; 5865605Snate@binkert.org#endif 5872SN/A 5881354SN/A#endif // __SIM_EVENTQ_HH__ 589