eventq.hh revision 7823
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 717059Snate@binkert.org static const FlagsType PublicRead = 0x003f; // public readable flags 727059Snate@binkert.org static const FlagsType PublicWrite = 0x001d; // public writable flags 737059Snate@binkert.org static const FlagsType Squashed = 0x0001; // has been squashed 747059Snate@binkert.org static const FlagsType Scheduled = 0x0002; // has been scheduled 757059Snate@binkert.org static const FlagsType AutoDelete = 0x0004; // delete after dispatch 767059Snate@binkert.org static const FlagsType AutoSerialize = 0x0008; // must be serialized 777059Snate@binkert.org static const FlagsType IsExitEvent = 0x0010; // special exit event 787059Snate@binkert.org static const FlagsType IsMainQueue = 0x0020; // on main event queue 797059Snate@binkert.org static const FlagsType Initialized = 0x7a40; // somewhat random bits 807059Snate@binkert.org static const FlagsType InitMask = 0xffc0; // mask for init bits 817059Snate@binkert.org 827059Snate@binkert.org bool 837059Snate@binkert.org initialized() const 847059Snate@binkert.org { 857059Snate@binkert.org return this && (flags & InitMask) == Initialized; 867059Snate@binkert.org } 875769Snate@binkert.org 887058Snate@binkert.org public: 897058Snate@binkert.org typedef int8_t Priority; 907058Snate@binkert.org 912SN/A private: 925502Snate@binkert.org // The event queue is now a linked list of linked lists. The 935502Snate@binkert.org // 'nextBin' pointer is to find the bin, where a bin is defined as 945502Snate@binkert.org // when+priority. All events in the same bin will be stored in a 955503Snate@binkert.org // second linked list (a stack) maintained by the 'nextInBin' 965503Snate@binkert.org // pointer. The list will be accessed in LIFO order. The end 975502Snate@binkert.org // result is that the insert/removal in 'nextBin' is 985502Snate@binkert.org // linear/constant, and the lookup/removal in 'nextInBin' is 995502Snate@binkert.org // constant/constant. Hopefully this is a significant improvement 1005502Snate@binkert.org // over the current fully linear insertion. 1015502Snate@binkert.org Event *nextBin; 1025502Snate@binkert.org Event *nextInBin; 1035502Snate@binkert.org 1045602Snate@binkert.org static Event *insertBefore(Event *event, Event *curr); 1055602Snate@binkert.org static Event *removeItem(Event *event, Event *last); 1065501Snate@binkert.org 1075543Ssaidi@eecs.umich.edu Tick _when; //!< timestamp when event should be processed 1087058Snate@binkert.org Priority _priority; //!< event priority 1095769Snate@binkert.org Flags flags; 1104016Sstever@eecs.umich.edu 1114016Sstever@eecs.umich.edu#ifndef NDEBUG 1124016Sstever@eecs.umich.edu /// Global counter to generate unique IDs for Event instances 1134016Sstever@eecs.umich.edu static Counter instanceCounter; 1144016Sstever@eecs.umich.edu 1154016Sstever@eecs.umich.edu /// This event's unique ID. We can also use pointer values for 1164016Sstever@eecs.umich.edu /// this but they're not consistent across runs making debugging 1174016Sstever@eecs.umich.edu /// more difficult. Thus we use a global counter value when 1184016Sstever@eecs.umich.edu /// debugging. 1195501Snate@binkert.org Counter instance; 1205605Snate@binkert.org 1215605Snate@binkert.org /// queue to which this event belongs (though it may or may not be 1225605Snate@binkert.org /// scheduled on this queue yet) 1235605Snate@binkert.org EventQueue *queue; 1245501Snate@binkert.org#endif 1254016Sstever@eecs.umich.edu 1265577SSteve.Reinhardt@amd.com#ifdef EVENTQ_DEBUG 1275501Snate@binkert.org Tick whenCreated; //!< time created 1285501Snate@binkert.org Tick whenScheduled; //!< time scheduled 1295501Snate@binkert.org#endif 1305502Snate@binkert.org 1315502Snate@binkert.org void 1325605Snate@binkert.org setWhen(Tick when, EventQueue *q) 1335502Snate@binkert.org { 1345502Snate@binkert.org _when = when; 1355605Snate@binkert.org#ifndef NDEBUG 1365605Snate@binkert.org queue = q; 1375605Snate@binkert.org#endif 1385577SSteve.Reinhardt@amd.com#ifdef EVENTQ_DEBUG 1397823Ssteve.reinhardt@amd.com whenScheduled = curTick(); 1405502Snate@binkert.org#endif 1415502Snate@binkert.org } 1425502Snate@binkert.org 1432SN/A protected: 1445769Snate@binkert.org /// Accessor for flags. 1455769Snate@binkert.org Flags 1465769Snate@binkert.org getFlags() const 1475769Snate@binkert.org { 1485769Snate@binkert.org return flags & PublicRead; 1495769Snate@binkert.org } 1502SN/A 1515769Snate@binkert.org Flags 1525769Snate@binkert.org getFlags(Flags _flags) const 1535769Snate@binkert.org { 1547059Snate@binkert.org assert(_flags.noneSet(~PublicRead)); 1555769Snate@binkert.org return flags.isSet(_flags); 1565769Snate@binkert.org } 1572SN/A 1585769Snate@binkert.org Flags 1595769Snate@binkert.org allFlags(Flags _flags) const 1605769Snate@binkert.org { 1615769Snate@binkert.org assert(_flags.noneSet(~PublicRead)); 1625769Snate@binkert.org return flags.allSet(_flags); 1635769Snate@binkert.org } 1645769Snate@binkert.org 1655769Snate@binkert.org /// Accessor for flags. 1665769Snate@binkert.org void 1675769Snate@binkert.org setFlags(Flags _flags) 1685769Snate@binkert.org { 1695769Snate@binkert.org assert(_flags.noneSet(~PublicWrite)); 1705769Snate@binkert.org flags.set(_flags); 1715769Snate@binkert.org } 1725769Snate@binkert.org 1735769Snate@binkert.org void 1745769Snate@binkert.org clearFlags(Flags _flags) 1755769Snate@binkert.org { 1765769Snate@binkert.org assert(_flags.noneSet(~PublicWrite)); 1775769Snate@binkert.org flags.clear(_flags); 1785769Snate@binkert.org } 1795769Snate@binkert.org 1805769Snate@binkert.org void 1815769Snate@binkert.org clearFlags() 1825769Snate@binkert.org { 1835769Snate@binkert.org flags.clear(PublicWrite); 1845769Snate@binkert.org } 1855769Snate@binkert.org 1865501Snate@binkert.org // This function isn't really useful if TRACING_ON is not defined 1875543Ssaidi@eecs.umich.edu virtual void trace(const char *action); //!< trace event activity 1882SN/A 1892SN/A public: 190396SN/A /// Event priorities, to provide tie-breakers for events scheduled 191396SN/A /// at the same cycle. Most events are scheduled at the default 192396SN/A /// priority; these values are used to control events that need to 193396SN/A /// be ordered within a cycle. 1945501Snate@binkert.org 1957058Snate@binkert.org /// Minimum priority 1967058Snate@binkert.org static const Priority Minimum_Pri = SCHAR_MIN; 1973329Sstever@eecs.umich.edu 1987058Snate@binkert.org /// If we enable tracing on a particular cycle, do that as the 1997058Snate@binkert.org /// very first thing so we don't miss any of the events on 2007058Snate@binkert.org /// that cycle (even if we enter the debugger). 2017058Snate@binkert.org static const Priority Trace_Enable_Pri = -101; 202396SN/A 2037058Snate@binkert.org /// Breakpoints should happen before anything else (except 2047058Snate@binkert.org /// enabling trace output), so we don't miss any action when 2057058Snate@binkert.org /// debugging. 2067058Snate@binkert.org static const Priority Debug_Break_Pri = -100; 2073329Sstever@eecs.umich.edu 2087058Snate@binkert.org /// CPU switches schedule the new CPU's tick event for the 2097058Snate@binkert.org /// same cycle (after unscheduling the old CPU's tick event). 2107058Snate@binkert.org /// The switch needs to come before any tick events to make 2117058Snate@binkert.org /// sure we don't tick both CPUs in the same cycle. 2127058Snate@binkert.org static const Priority CPU_Switch_Pri = -31; 213396SN/A 2147058Snate@binkert.org /// For some reason "delayed" inter-cluster writebacks are 2157058Snate@binkert.org /// scheduled before regular writebacks (which have default 2167058Snate@binkert.org /// priority). Steve? 2177058Snate@binkert.org static const Priority Delayed_Writeback_Pri = -1; 218396SN/A 2197058Snate@binkert.org /// Default is zero for historical reasons. 2207058Snate@binkert.org static const Priority Default_Pri = 0; 221396SN/A 2227058Snate@binkert.org /// Serailization needs to occur before tick events also, so 2237058Snate@binkert.org /// that a serialize/unserialize is identical to an on-line 2247058Snate@binkert.org /// CPU switch. 2257058Snate@binkert.org static const Priority Serialize_Pri = 32; 226396SN/A 2277058Snate@binkert.org /// CPU ticks must come after other associated CPU events 2287058Snate@binkert.org /// (such as writebacks). 2297058Snate@binkert.org static const Priority CPU_Tick_Pri = 50; 230396SN/A 2317058Snate@binkert.org /// Statistics events (dump, reset, etc.) come after 2327058Snate@binkert.org /// everything else, but before exit. 2337058Snate@binkert.org static const Priority Stat_Event_Pri = 90; 2344075Sbinkertn@umich.edu 2357058Snate@binkert.org /// Progress events come at the end. 2367058Snate@binkert.org static const Priority Progress_Event_Pri = 95; 2375501Snate@binkert.org 2387058Snate@binkert.org /// If we want to exit on this cycle, it's the very last thing 2397058Snate@binkert.org /// we do. 2407058Snate@binkert.org static const Priority Sim_Exit_Pri = 100; 2417058Snate@binkert.org 2427058Snate@binkert.org /// Maximum priority 2437058Snate@binkert.org static const Priority Maximum_Pri = SCHAR_MAX; 244396SN/A 2452SN/A /* 2462SN/A * Event constructor 2472SN/A * @param queue that the event gets scheduled on 2482SN/A */ 2495605Snate@binkert.org Event(Priority p = Default_Pri) 2507059Snate@binkert.org : nextBin(NULL), nextInBin(NULL), _priority(p), flags(Initialized) 251224SN/A { 2524016Sstever@eecs.umich.edu#ifndef NDEBUG 2535501Snate@binkert.org instance = ++instanceCounter; 2545605Snate@binkert.org queue = NULL; 2555501Snate@binkert.org#endif 2565501Snate@binkert.org#ifdef EVENTQ_DEBUG 2577823Ssteve.reinhardt@amd.com whenCreated = curTick(); 2585501Snate@binkert.org whenScheduled = 0; 2594016Sstever@eecs.umich.edu#endif 260224SN/A } 261224SN/A 2625768Snate@binkert.org virtual ~Event(); 2635768Snate@binkert.org virtual const std::string name() const; 264265SN/A 2655501Snate@binkert.org /// Return a C string describing the event. This string should 2665501Snate@binkert.org /// *not* be dynamically allocated; just a const char array 2675501Snate@binkert.org /// describing the event class. 2685501Snate@binkert.org virtual const char *description() const; 2695501Snate@binkert.org 2705501Snate@binkert.org /// Dump the current event data 2715501Snate@binkert.org void dump() const; 2725501Snate@binkert.org 2735501Snate@binkert.org public: 2745501Snate@binkert.org /* 2755501Snate@binkert.org * This member function is invoked when the event is processed 2765501Snate@binkert.org * (occurs). There is no default implementation; each subclass 2775501Snate@binkert.org * must provide its own implementation. The event is not 2785501Snate@binkert.org * automatically deleted after it is processed (to allow for 2795501Snate@binkert.org * statically allocated event objects). 2805501Snate@binkert.org * 2815501Snate@binkert.org * If the AutoDestroy flag is set, the object is deleted once it 2825501Snate@binkert.org * is processed. 2835501Snate@binkert.org */ 2845501Snate@binkert.org virtual void process() = 0; 2855501Snate@binkert.org 2862SN/A /// Determine if the current event is scheduled 2875769Snate@binkert.org bool scheduled() const { return flags.isSet(Scheduled); } 2882SN/A 2892SN/A /// Squash the current event 2905769Snate@binkert.org void squash() { flags.set(Squashed); } 2912SN/A 2922SN/A /// Check whether the event is squashed 2935769Snate@binkert.org bool squashed() const { return flags.isSet(Squashed); } 2942SN/A 2952667Sstever@eecs.umich.edu /// See if this is a SimExitEvent (without resorting to RTTI) 2965769Snate@binkert.org bool isExitEvent() const { return flags.isSet(IsExitEvent); } 2972667Sstever@eecs.umich.edu 2982SN/A /// Get the time that the event is scheduled 2992SN/A Tick when() const { return _when; } 3002SN/A 3012SN/A /// Get the event priority 3027058Snate@binkert.org Priority priority() const { return _priority; } 3032SN/A 3045605Snate@binkert.org#ifndef SWIG 3055501Snate@binkert.org struct priority_compare 3065501Snate@binkert.org : public std::binary_function<Event *, Event *, bool> 3072SN/A { 3085501Snate@binkert.org bool 3095501Snate@binkert.org operator()(const Event *l, const Event *r) const 3105501Snate@binkert.org { 3112SN/A return l->when() >= r->when() || l->priority() >= r->priority(); 3122SN/A } 3132SN/A }; 314224SN/A 315224SN/A virtual void serialize(std::ostream &os); 316237SN/A virtual void unserialize(Checkpoint *cp, const std::string §ion); 3175605Snate@binkert.org#endif 318571SN/A}; 319571SN/A 3207005Snate@binkert.org#ifndef SWIG 3217005Snate@binkert.orginline bool 3227005Snate@binkert.orgoperator<(const Event &l, const Event &r) 3237005Snate@binkert.org{ 3247005Snate@binkert.org return l.when() < r.when() || 3257005Snate@binkert.org (l.when() == r.when() && l.priority() < r.priority()); 3267005Snate@binkert.org} 3277005Snate@binkert.org 3287005Snate@binkert.orginline bool 3297005Snate@binkert.orgoperator>(const Event &l, const Event &r) 3307005Snate@binkert.org{ 3317005Snate@binkert.org return l.when() > r.when() || 3327005Snate@binkert.org (l.when() == r.when() && l.priority() > r.priority()); 3337005Snate@binkert.org} 3347005Snate@binkert.org 3357005Snate@binkert.orginline bool 3367005Snate@binkert.orgoperator<=(const Event &l, const Event &r) 3377005Snate@binkert.org{ 3387005Snate@binkert.org return l.when() < r.when() || 3397005Snate@binkert.org (l.when() == r.when() && l.priority() <= r.priority()); 3407005Snate@binkert.org} 3417005Snate@binkert.orginline bool 3427005Snate@binkert.orgoperator>=(const Event &l, const Event &r) 3437005Snate@binkert.org{ 3447005Snate@binkert.org return l.when() > r.when() || 3457005Snate@binkert.org (l.when() == r.when() && l.priority() >= r.priority()); 3467005Snate@binkert.org} 3477005Snate@binkert.org 3487005Snate@binkert.orginline bool 3497005Snate@binkert.orgoperator==(const Event &l, const Event &r) 3507005Snate@binkert.org{ 3517005Snate@binkert.org return l.when() == r.when() && l.priority() == r.priority(); 3527005Snate@binkert.org} 3537005Snate@binkert.org 3547005Snate@binkert.orginline bool 3557005Snate@binkert.orgoperator!=(const Event &l, const Event &r) 3567005Snate@binkert.org{ 3577005Snate@binkert.org return l.when() != r.when() || l.priority() != r.priority(); 3587005Snate@binkert.org} 3597005Snate@binkert.org#endif 3607005Snate@binkert.org 3612SN/A/* 3622SN/A * Queue of events sorted in time order 3632SN/A */ 364395SN/Aclass EventQueue : public Serializable 3652SN/A{ 3665605Snate@binkert.org private: 367265SN/A std::string objName; 3682SN/A Event *head; 3692SN/A 3702SN/A void insert(Event *event); 3712SN/A void remove(Event *event); 3722SN/A 3737063Snate@binkert.org EventQueue(const EventQueue &); 3747063Snate@binkert.org const EventQueue &operator=(const EventQueue &); 3757063Snate@binkert.org 3762SN/A public: 3777063Snate@binkert.org EventQueue(const std::string &n); 3782SN/A 379512SN/A virtual const std::string name() const { return objName; } 380265SN/A 3812SN/A // schedule the given event on this queue 3825738Snate@binkert.org void schedule(Event *event, Tick when); 3835738Snate@binkert.org void deschedule(Event *event); 3845738Snate@binkert.org void reschedule(Event *event, Tick when, bool always = false); 3852SN/A 3865501Snate@binkert.org Tick nextTick() const { return head->when(); } 3872667Sstever@eecs.umich.edu Event *serviceOne(); 3882SN/A 3892SN/A // process all events up to the given timestamp. we inline a 3902SN/A // quick test to see if there are any events to process; if so, 3912SN/A // call the internal out-of-line version to process them all. 3925501Snate@binkert.org void 3935501Snate@binkert.org serviceEvents(Tick when) 3945501Snate@binkert.org { 3952SN/A while (!empty()) { 3962SN/A if (nextTick() > when) 3972SN/A break; 3982SN/A 3991634SN/A /** 4001634SN/A * @todo this assert is a good bug catcher. I need to 4011634SN/A * make it true again. 4021634SN/A */ 4031634SN/A //assert(head->when() >= when && "event scheduled in the past"); 4042SN/A serviceOne(); 4052SN/A } 4062SN/A } 4072SN/A 4087823Ssteve.reinhardt@amd.com // default: process all events up to 'now' (curTick()) 4097823Ssteve.reinhardt@amd.com void serviceEvents() { serviceEvents(curTick()); } 4102SN/A 4112SN/A // return true if no events are queued 4125501Snate@binkert.org bool empty() const { return head == NULL; } 4132SN/A 4145501Snate@binkert.org void dump() const; 4152SN/A 4167823Ssteve.reinhardt@amd.com Tick nextEventTime() { return empty() ? curTick() : head->when(); } 4172SN/A 4185502Snate@binkert.org bool debugVerify() const; 4195502Snate@binkert.org 4205605Snate@binkert.org#ifndef SWIG 421217SN/A virtual void serialize(std::ostream &os); 422237SN/A virtual void unserialize(Checkpoint *cp, const std::string §ion); 4235605Snate@binkert.org#endif 4242SN/A}; 4252SN/A 4265605Snate@binkert.org#ifndef SWIG 4275605Snate@binkert.orgclass EventManager 4285605Snate@binkert.org{ 4295605Snate@binkert.org protected: 4305605Snate@binkert.org /** A pointer to this object's event queue */ 4315605Snate@binkert.org EventQueue *eventq; 4322SN/A 4335605Snate@binkert.org public: 4345605Snate@binkert.org EventManager(EventManager &em) : eventq(em.queue()) {} 4355605Snate@binkert.org EventManager(EventManager *em) : eventq(em ? em->queue() : NULL) {} 4365605Snate@binkert.org EventManager(EventQueue *eq) : eventq(eq) {} 4372SN/A 4385605Snate@binkert.org EventQueue * 4395605Snate@binkert.org queue() const 4405605Snate@binkert.org { 4415605Snate@binkert.org return eventq; 4425605Snate@binkert.org } 4435605Snate@binkert.org 4447060Snate@binkert.org operator EventQueue *() const 4457060Snate@binkert.org { 4467060Snate@binkert.org return eventq; 4477060Snate@binkert.org } 4487060Snate@binkert.org 4495605Snate@binkert.org void 4505605Snate@binkert.org schedule(Event &event, Tick when) 4515605Snate@binkert.org { 4525605Snate@binkert.org eventq->schedule(&event, when); 4535605Snate@binkert.org } 4545605Snate@binkert.org 4555605Snate@binkert.org void 4565605Snate@binkert.org deschedule(Event &event) 4575605Snate@binkert.org { 4585605Snate@binkert.org eventq->deschedule(&event); 4595605Snate@binkert.org } 4605605Snate@binkert.org 4615605Snate@binkert.org void 4625605Snate@binkert.org reschedule(Event &event, Tick when, bool always = false) 4635605Snate@binkert.org { 4645605Snate@binkert.org eventq->reschedule(&event, when, always); 4655605Snate@binkert.org } 4665605Snate@binkert.org 4675605Snate@binkert.org void 4685605Snate@binkert.org schedule(Event *event, Tick when) 4695605Snate@binkert.org { 4705605Snate@binkert.org eventq->schedule(event, when); 4715605Snate@binkert.org } 4725605Snate@binkert.org 4735605Snate@binkert.org void 4745605Snate@binkert.org deschedule(Event *event) 4755605Snate@binkert.org { 4765605Snate@binkert.org eventq->deschedule(event); 4775605Snate@binkert.org } 4785605Snate@binkert.org 4795605Snate@binkert.org void 4805605Snate@binkert.org reschedule(Event *event, Tick when, bool always = false) 4815605Snate@binkert.org { 4825605Snate@binkert.org eventq->reschedule(event, when, always); 4835605Snate@binkert.org } 4845605Snate@binkert.org}; 4855605Snate@binkert.org 4862SN/Ainline void 4875605Snate@binkert.orgEventQueue::schedule(Event *event, Tick when) 4882SN/A{ 4897823Ssteve.reinhardt@amd.com assert((UTick)when >= (UTick)curTick()); 4905605Snate@binkert.org assert(!event->scheduled()); 4917059Snate@binkert.org assert(event->initialized()); 4925605Snate@binkert.org 4935605Snate@binkert.org event->setWhen(when, this); 4945605Snate@binkert.org insert(event); 4955769Snate@binkert.org event->flags.set(Event::Scheduled); 4965605Snate@binkert.org if (this == &mainEventQueue) 4975769Snate@binkert.org event->flags.set(Event::IsMainQueue); 4985605Snate@binkert.org else 4995769Snate@binkert.org event->flags.clear(Event::IsMainQueue); 5005605Snate@binkert.org 5015605Snate@binkert.org if (DTRACE(Event)) 5025605Snate@binkert.org event->trace("scheduled"); 5032SN/A} 5042SN/A 5052SN/Ainline void 5065605Snate@binkert.orgEventQueue::deschedule(Event *event) 5072SN/A{ 5085605Snate@binkert.org assert(event->scheduled()); 5097059Snate@binkert.org assert(event->initialized()); 5105605Snate@binkert.org 5115605Snate@binkert.org remove(event); 5125605Snate@binkert.org 5135769Snate@binkert.org event->flags.clear(Event::Squashed); 5145769Snate@binkert.org event->flags.clear(Event::Scheduled); 5155605Snate@binkert.org 5165769Snate@binkert.org if (event->flags.isSet(Event::AutoDelete)) 5175605Snate@binkert.org delete event; 5185605Snate@binkert.org 5195605Snate@binkert.org if (DTRACE(Event)) 5205605Snate@binkert.org event->trace("descheduled"); 5212SN/A} 5222SN/A 5232SN/Ainline void 5245605Snate@binkert.orgEventQueue::reschedule(Event *event, Tick when, bool always) 5252SN/A{ 5267823Ssteve.reinhardt@amd.com assert(when >= curTick()); 5275605Snate@binkert.org assert(always || event->scheduled()); 5287059Snate@binkert.org assert(event->initialized()); 5295605Snate@binkert.org 5305605Snate@binkert.org if (event->scheduled()) 5315605Snate@binkert.org remove(event); 5325605Snate@binkert.org 5335605Snate@binkert.org event->setWhen(when, this); 5345605Snate@binkert.org insert(event); 5355769Snate@binkert.org event->flags.clear(Event::Squashed); 5365769Snate@binkert.org event->flags.set(Event::Scheduled); 5375605Snate@binkert.org if (this == &mainEventQueue) 5385769Snate@binkert.org event->flags.set(Event::IsMainQueue); 5395605Snate@binkert.org else 5405769Snate@binkert.org event->flags.clear(Event::IsMainQueue); 5415605Snate@binkert.org 5425605Snate@binkert.org if (DTRACE(Event)) 5435605Snate@binkert.org event->trace("rescheduled"); 5442SN/A} 5452SN/A 5467005Snate@binkert.orgtemplate <class T, void (T::* F)()> 5477005Snate@binkert.orgvoid 5487005Snate@binkert.orgDelayFunction(EventQueue *eventq, Tick when, T *object) 5495502Snate@binkert.org{ 5507005Snate@binkert.org class DelayEvent : public Event 5517005Snate@binkert.org { 5527005Snate@binkert.org private: 5537005Snate@binkert.org T *object; 5547005Snate@binkert.org 5557005Snate@binkert.org public: 5567005Snate@binkert.org DelayEvent(T *o) 5577005Snate@binkert.org : object(o) 5587005Snate@binkert.org { this->setFlags(AutoDelete); } 5597005Snate@binkert.org void process() { (object->*F)(); } 5607005Snate@binkert.org const char *description() const { return "delay"; } 5617005Snate@binkert.org }; 5627005Snate@binkert.org 5637005Snate@binkert.org eventq->schedule(new DelayEvent(object), when); 5645502Snate@binkert.org} 5655502Snate@binkert.org 5667005Snate@binkert.orgtemplate <class T, void (T::* F)()> 5677005Snate@binkert.orgclass EventWrapper : public Event 5685502Snate@binkert.org{ 5697005Snate@binkert.org private: 5707005Snate@binkert.org T *object; 5715502Snate@binkert.org 5727005Snate@binkert.org public: 5737005Snate@binkert.org EventWrapper(T *obj, bool del = false, Priority p = Default_Pri) 5747005Snate@binkert.org : Event(p), object(obj) 5757005Snate@binkert.org { 5767005Snate@binkert.org if (del) 5777005Snate@binkert.org setFlags(AutoDelete); 5787005Snate@binkert.org } 5795502Snate@binkert.org 5807066Snate@binkert.org EventWrapper(T &obj, bool del = false, Priority p = Default_Pri) 5817066Snate@binkert.org : Event(p), object(&obj) 5827066Snate@binkert.org { 5837066Snate@binkert.org if (del) 5847066Snate@binkert.org setFlags(AutoDelete); 5857066Snate@binkert.org } 5867066Snate@binkert.org 5877005Snate@binkert.org void process() { (object->*F)(); } 5885502Snate@binkert.org 5897005Snate@binkert.org const std::string 5907005Snate@binkert.org name() const 5917005Snate@binkert.org { 5927005Snate@binkert.org return object->name() + ".wrapped_event"; 5937005Snate@binkert.org } 5947005Snate@binkert.org 5957005Snate@binkert.org const char *description() const { return "EventWrapped"; } 5967005Snate@binkert.org}; 5975605Snate@binkert.org#endif 5982SN/A 5991354SN/A#endif // __SIM_EVENTQ_HH__ 600