| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785 |
- """Undocumented Module"""
- __all__ = ['Task', 'TaskPriorityList', 'TaskManager']
- # This module may not import pandac.PandaModules, since it is imported
- # by the Toontown Launcher before the complete PandaModules have been
- # downloaded. Instead, it imports only libpandaexpressModules, the
- # subset of PandaModules that we know is available immediately.
- # Methods that require more advanced C++ methods may import the
- # appropriate files within their own scope.
- from pandac.libpandaexpressModules import *
- from direct.directnotify.DirectNotifyGlobal import *
- from direct.showbase.PythonUtil import *
- from direct.showbase.MessengerGlobal import *
- import time
- import fnmatch
- import string
- import signal
- try:
- Dtool_PreloadDLL("libp3heapq")
- from libp3heapq import heappush, heappop, heapify
- except:
- Dtool_PreloadDLL("libheapq")
- from libheapq import heappush, heappop, heapify
- import types
- if __debug__:
- # For pstats
- from pandac.PandaModules import PStatCollector
- def print_exc_plus():
- """
- Print the usual traceback information, followed by a listing of all the
- local variables in each frame.
- """
- import sys
- import traceback
- tb = sys.exc_info()[2]
- while 1:
- if not tb.tb_next:
- break
- tb = tb.tb_next
- stack = []
- f = tb.tb_frame
- while f:
- stack.append(f)
- f = f.f_back
- stack.reverse()
- traceback.print_exc()
- print "Locals by frame, innermost last"
- for frame in stack:
- print
- print "Frame %s in %s at line %s" % (frame.f_code.co_name,
- frame.f_code.co_filename,
- frame.f_lineno)
- for key, value in frame.f_locals.items():
- print "\t%20s = " % key,
- #We have to be careful not to cause a new error in our error
- #printer! Calling str() on an unknown object could cause an
- #error we don't want.
- try:
- print value
- except:
- print "<ERROR WHILE PRINTING VALUE>"
- class Task:
- # This enum is a copy of the one at the top-level.
- exit = -1
- done = 0
- cont = 1
- again = 2
- count = 0
- def __init__(self, callback, priority = 0):
- try:
- config
- except:
- pass
- else:
- if config.GetBool('record-task-creation-stack', 0):
- self.debugInitTraceback = StackTrace("Task "+str(callback), 1, 10)
- # Unique ID for each task
- self.id = Task.count
- Task.count += 1
- #set to have the task managed
- self.owner = None
- self.__call__ = callback
- self._priority = priority
- self._removed = 0
- self.dt = 0.0
- if TaskManager.taskTimerVerbose:
- self.avgDt = 0.0
- self.maxDt = 0.0
- self.runningTotal = 0.0
- self.pstats = None
- self.pstatCollector = None
- self.extraArgs = []
- # Used for doLaters
- self.wakeTime = 0.0
- # for repeating doLaters
- self.delayTime = 0.0
- self.time = 0.0
- # # Used for putting into the doLaterList
- # # the heapq calls __cmp__ via the rich compare function
- # def __cmp__(self, other):
- # if isinstance(other, Task):
- # if self.wakeTime < other.wakeTime:
- # return -1
- # elif self.wakeTime > other.wakeTime:
- # return 1
- # # If the wakeTimes happen to be the same, just
- # # sort them based on id
- # else:
- # return cmp(id(self), id(other))
- # # This is important for people doing a (task != None) and such.
- # else:
- # return cmp(id(self), id(other))
- # # According to the Python manual (3.3.1), if you define a cmp operator
- # # you should also define a hash operator or your objects will not be
- # # usable in dictionaries. Since no two task objects are unique, we can
- # # just return the unique id.
- # def __hash__(self):
- # return self.id
- def remove(self):
- if not self._removed:
- if(self.owner):
- self.owner._clearTask(self)
- self._removed = 1
- # Remove any refs to real objects
- # In case we hang around the doLaterList for a while
- del self.__call__
- del self.extraArgs
- if TaskManager.taskTimerVerbose and self.pstatCollector:
- self.pstatCollector.subLevelNow(1)
- def isRemoved(self):
- return self._removed
- def getPriority(self):
- return self._priority
- def setPriority(self, pri):
- self._priority = pri
- def setStartTimeFrame(self, startTime, startFrame):
- self.starttime = startTime
- self.startframe = startFrame
- def setCurrentTimeFrame(self, currentTime, currentFrame):
- # Calculate and store this task's time (relative to when it started)
- self.time = currentTime - self.starttime
- self.frame = currentFrame - self.startframe
- def setupPStats(self):
- if __debug__ and TaskManager.taskTimerVerbose and not self.pstats:
- # Get the PStats name for the task. By convention,
- # this is everything until the first hyphen; the part
- # of the task name following the hyphen is generally
- # used to differentiate particular tasks that do the
- # same thing to different objects.
- name = self.name
- hyphen = name.find('-')
- if hyphen >= 0:
- name = name[0:hyphen]
- self.pstats = PStatCollector("App:Show code:" + name)
- if self.wakeTime or self.delayTime:
- self.pstatCollector = PStatCollector("Tasks:doLaters:" + name)
- else:
- self.pstatCollector = PStatCollector("Tasks:" + name)
- self.pstatCollector.addLevelNow(1)
- def finishTask(self, verbose):
- if hasattr(self, "uponDeath"):
- self.uponDeath(self)
- if verbose:
- # We regret to announce...
- messenger.send('TaskManager-removeTask', sentArgs = [self, self.name])
- del self.uponDeath
- def __repr__(self):
- if hasattr(self, 'name'):
- return ('Task id: %s, name %s' % (self.id, self.name))
- else:
- return ('Task id: %s, no name' % (self.id))
- def pause(delayTime):
- def func(self):
- if (self.time < self.delayTime):
- return cont
- else:
- return done
- task = Task(func)
- task.name = 'pause'
- task.delayTime = delayTime
- return task
- Task.pause = staticmethod(pause)
- def sequence(*taskList):
- return make_sequence(taskList)
- Task.sequence = staticmethod(sequence)
- def make_sequence(taskList):
- def func(self):
- frameFinished = 0
- taskDoneStatus = -1
- while not frameFinished:
- task = self.taskList[self.index]
- # If this is a new task, set its start time and frame
- if self.index > self.prevIndex:
- task.setStartTimeFrame(self.time, self.frame)
- self.prevIndex = self.index
- # Calculate this task's time since it started
- task.setCurrentTimeFrame(self.time, self.frame)
- # Execute the current task
- ret = task(task)
- # Check the return value from the task
- if ret == cont:
- # If this current task wants to continue,
- # come back to it next frame
- taskDoneStatus = cont
- frameFinished = 1
- elif ret == done:
- # If this task is done, increment the index so that next frame
- # we will start executing the next task on the list
- self.index = self.index + 1
- taskDoneStatus = cont
- frameFinished = 0
- elif ret == exit:
- # If this task wants to exit, the sequence exits
- taskDoneStatus = exit
- frameFinished = 1
- # If we got to the end of the list, this sequence is done
- if self.index >= len(self.taskList):
- # TaskManager.notify.debug('sequence done: ' + self.name)
- frameFinished = 1
- taskDoneStatus = done
- return taskDoneStatus
- task = Task(func)
- task.name = 'sequence'
- task.taskList = taskList
- task.prevIndex = -1
- task.index = 0
- return task
- def resetSequence(task):
- # Should this automatically be done as part of spawnTaskNamed?
- # Or should one have to create a new task instance every time
- # one wishes to spawn a task (currently sequences and can
- # only be fired off once
- task.index = 0
- task.prevIndex = -1
- def loop(*taskList):
- return make_loop(taskList)
- Task.loop = staticmethod(loop)
- def make_loop(taskList):
- def func(self):
- frameFinished = 0
- taskDoneStatus = -1
- while (not frameFinished):
- task = self.taskList[self.index]
- # If this is a new task, set its start time and frame
- if (self.index > self.prevIndex):
- task.setStartTimeFrame(self.time, self.frame)
- self.prevIndex = self.index
- # Calculate this task's time since it started
- task.setCurrentTimeFrame(self.time, self.frame)
- # Execute the current task
- ret = task(task)
- # Check the return value from the task
- if (ret == cont):
- # If this current task wants to continue,
- # come back to it next frame
- taskDoneStatus = cont
- frameFinished = 1
- elif (ret == done):
- # If this task is done, increment the index so that next frame
- # we will start executing the next task on the list
- # TODO: we should go to the next frame now
- self.index = self.index + 1
- taskDoneStatus = cont
- frameFinished = 0
- elif (ret == exit):
- # If this task wants to exit, the sequence exits
- taskDoneStatus = exit
- frameFinished = 1
- if (self.index >= len(self.taskList)):
- # If we got to the end of the list, wrap back around
- self.prevIndex = -1
- self.index = 0
- frameFinished = 1
- return taskDoneStatus
- task = Task(func)
- task.name = 'loop'
- task.taskList = taskList
- task.prevIndex = -1
- task.index = 0
- return task
- class TaskPriorityList(list):
- def __init__(self, priority):
- self._priority = priority
- self.__emptyIndex = 0
- def getPriority(self):
- return self._priority
- def add(self, task):
- if (self.__emptyIndex >= len(self)):
- self.append(task)
- self.__emptyIndex += 1
- else:
- self[self.__emptyIndex] = task
- self.__emptyIndex += 1
- def remove(self, i):
- assert i <= len(self)
- if (len(self) == 1) and (i == 1):
- self[i] = None
- self.__emptyIndex = 0
- else:
- # Swap the last element for this one
- lastElement = self[self.__emptyIndex-1]
- self[i] = lastElement
- self[self.__emptyIndex-1] = None
- self.__emptyIndex -= 1
- class TaskManager:
- # These class vars are generally overwritten by Config variables which
- # are read in at the start of a show (ShowBase.py or AIStart.py)
- notify = None
- # TODO: there is a bit of a bug when you default this to 0. The first
- # task we make, the doLaterProcessor, needs to have this set to 1 or
- # else we get an error.
- taskTimerVerbose = 1
- extendedExceptions = 0
- pStatsTasks = 0
- doLaterCleanupCounter = 2000
- OsdPrefix = 'task.'
- DefTaskDurationWarningThreshold = 3.
- def __init__(self):
- self.running = 0
- self.stepping = 0
- self.taskList = []
- # Dictionary of priority to newTaskLists
- self.pendingTaskDict = {}
- # List of tasks scheduled to execute in the future
- self.__doLaterList = []
- self._profileFrames = False
- self.MaxEpockSpeed = 1.0/30.0;
- # We copy this value in from __builtins__ when it gets set.
- # But since the TaskManager might have to run before it gets
- # set--before it can even be available--we also have to have
- # special-case code that handles the possibility that we don't
- # have a globalClock yet.
- self.globalClock = None
- # To help cope with the possibly-missing globalClock, we get a
- # handle to Panda's low-level TrueClock object for measuring
- # small intervals.
- self.trueClock = TrueClock.getGlobalPtr()
- # We don't have a base yet, but we can query the config
- # variables directly.
- self.warnTaskDuration = ConfigVariableBool('task-duration-warnings', 1).getValue()
- self.taskDurationWarningThreshold = ConfigVariableDouble(
- 'task-duration-warning-threshold',
- TaskManager.DefTaskDurationWarningThreshold).getValue()
- self.currentTime, self.currentFrame = self.__getTimeFrame()
- if (TaskManager.notify == None):
- TaskManager.notify = directNotify.newCategory("TaskManager")
- self.fKeyboardInterrupt = 0
- self.interruptCount = 0
- self.resumeFunc = None
- self.fVerbose = 0
- # Dictionary of task name to list of tasks with that name
- self.nameDict = {}
- # A default task.
- self.add(self.__doLaterProcessor, "doLaterProcessor", -10)
- def destroy(self):
- del self.nameDict
- del self.trueClock
- del self.globalClock
- del self.__doLaterList
- del self.pendingTaskDict
- del self.taskList
- def setStepping(self, value):
- self.stepping = value
- def setVerbose(self, value):
- self.fVerbose = value
- messenger.send('TaskManager-setVerbose', sentArgs = [value])
- def invokeDefaultHandler(self, signalNumber, stackFrame):
- print '*** allowing mid-frame keyboard interrupt.'
- # Restore default interrupt handler
- signal.signal(signal.SIGINT, signal.default_int_handler)
- # and invoke it
- raise KeyboardInterrupt
- def keyboardInterruptHandler(self, signalNumber, stackFrame):
- self.fKeyboardInterrupt = 1
- self.interruptCount += 1
- if self.interruptCount == 1:
- print '* interrupt by keyboard'
- elif self.interruptCount == 2:
- print '** waiting for end of frame before interrupting...'
- # The user must really want to interrupt this process
- # Next time around invoke the default handler
- signal.signal(signal.SIGINT, self.invokeDefaultHandler)
- def hasTaskNamed(self, taskName):
- # TODO: check pending task list
- # Get the tasks with this name
- # If we found some, see if any of them are still active (not removed)
- for task in self.nameDict.get(taskName, []):
- if not task._removed:
- return 1
- # Didnt find any, return 0
- return 0
- def getTasksNamed(self, taskName):
- # TODO: check pending tasks
- # Get the tasks with this name
- return [task for task in self.nameDict.get(taskName, []) #grab all tasks with name
- if not task._removed] #filter removed tasks
- def __doLaterFilter(self):
- # Filter out all the tasks that have been removed like a mark and
- # sweep garbage collector. Returns the number of tasks that have
- # been removed Warning: this creates an entirely new doLaterList.
- oldLen = len(self.__doLaterList)
- # grab all the tasks being removed so we can remove them from the nameDict
- # TODO: would be more efficient to remove from nameDict in task.remove()
- removedTasks = [task for task in self.__doLaterList
- if task._removed]
- self.__doLaterList = [task for task in self.__doLaterList #grab all tasks with name
- if not task._removed] #filter removed tasks
- for task in removedTasks:
- self.__removeTaskFromNameDict(task)
- # Re heapify to maintain ordering after filter
- heapify(self.__doLaterList)
- newLen = len(self.__doLaterList)
- return oldLen - newLen
-
- def __getNextDoLaterTime(self):
- if self.__doLaterList:
- dl = self.__doLaterList[0]
- return dl.wakeTime
- return -1;
-
- def __doLaterProcessor(self, task):
- # Removing the tasks during the for loop is a bad idea
- # Instead we just flag them as removed
- # Later, somebody else cleans them out
- currentTime = self.__getTime()
- while self.__doLaterList:
- # Check the first one on the list to see if it is ready
- dl = self.__doLaterList[0]
- if dl._removed:
- # Get rid of this task forever
- heappop(self.__doLaterList)
- continue
- # If the time now is less than the start of the doLater + delay
- # then we are not ready yet, continue to next one
- elif currentTime < dl.wakeTime:
- # Since the list is sorted, the first one we get to, that
- # is not ready to go, we can return
- break
- else:
- # Take it off the doLaterList, set its time, and make
- # it pending
- heappop(self.__doLaterList)
- dl.setStartTimeFrame(self.currentTime, self.currentFrame)
- self.__addPendingTask(dl)
- continue
-
- # Every nth pass, let's clean out the list of removed tasks
- # This is basically a mark and sweep garbage collection of doLaters
- if ((task.frame % self.doLaterCleanupCounter) == 0):
- numRemoved = self.__doLaterFilter()
- # TaskManager.notify.debug("filtered %s removed doLaters" % numRemoved)
- return cont
- def doMethodLater(self, delayTime, funcOrTask, name, extraArgs=None,
- priority=0, uponDeath=None, appendTask=False, owner = None):
- if delayTime < 0:
- assert self.notify.warning('doMethodLater: added task: %s with negative delay: %s' % (name, delayTime))
- if isinstance(funcOrTask, Task):
- task = funcOrTask
- elif callable(funcOrTask):
- task = Task(funcOrTask, priority)
- else:
- self.notify.error('doMethodLater: Tried to add a task that was not a Task or a func')
- assert isinstance(name, str), 'Name must be a string type'
- task.setPriority(priority)
- task.name = name
- task.owner = owner
- if extraArgs == None:
- extraArgs = []
- appendTask = True
- # if told to, append the task object to the extra args list so the
- # method called will be able to access any properties on the task
- if appendTask:
- extraArgs.append(task)
-
- task.extraArgs = extraArgs
- if uponDeath:
- task.uponDeath = uponDeath
- # TaskManager.notify.debug('spawning doLater: %s' % (task))
- # Add this task to the nameDict
- nameList = self.nameDict.get(name)
- if nameList:
- nameList.append(task)
- else:
- self.nameDict[name] = [task]
- currentTime = self.__getTime()
- # Cache the time we should wake up for easier sorting
- task.delayTime = delayTime
- task.wakeTime = currentTime + delayTime
- # Push this onto the doLaterList. The heap maintains the sorting.
- heappush(self.__doLaterList, task)
- if self.fVerbose:
- # Alert the world, a new task is born!
- messenger.send('TaskManager-spawnDoLater',
- sentArgs = [task, task.name, task.id])
- return task
- def add(self, funcOrTask, name, priority=0, extraArgs=None, uponDeath=None,
- appendTask = False, owner = None):
-
- """
- Add a new task to the taskMgr.
- You can add a Task object or a method that takes one argument.
- """
- # TaskManager.notify.debug('add: %s' % (name))
- if isinstance(funcOrTask, Task):
- task = funcOrTask
- elif callable(funcOrTask):
- task = Task(funcOrTask, priority)
- else:
- self.notify.error(
- 'add: Tried to add a task that was not a Task or a func')
- assert isinstance(name, str), 'Name must be a string type'
- task.setPriority(priority)
- task.name = name
- task.owner = owner
- if extraArgs == None:
- extraArgs = []
- appendTask = True
- # if told to, append the task object to the extra args list so the
- # method called will be able to access any properties on the task
- if appendTask:
- extraArgs.append(task)
- task.extraArgs = extraArgs
- if uponDeath:
- task.uponDeath = uponDeath
- currentTime = self.__getTime()
- task.setStartTimeFrame(currentTime, self.currentFrame)
- nameList = self.nameDict.get(name)
- if nameList:
- nameList.append(task)
- else:
- self.nameDict[name] = [task]
- # Put it on the list for the end of this frame
- self.__addPendingTask(task)
- return task
- def __addPendingTask(self, task):
- # TaskManager.notify.debug('__addPendingTask: %s' % (task.name))
- pri = task._priority
- taskPriList = self.pendingTaskDict.get(pri)
- if not taskPriList:
- taskPriList = TaskPriorityList(pri)
- self.pendingTaskDict[pri] = taskPriList
- taskPriList.add(task)
- def __addNewTask(self, task):
- # The taskList is really an ordered list of TaskPriorityLists
- # search back from the end of the list until we find a
- # taskList with a lower priority, or we hit the start of the list
- taskPriority = task._priority
- index = len(self.taskList) - 1
- while (1):
- if (index < 0):
- newList = TaskPriorityList(taskPriority)
- newList.add(task)
- # Add the new list to the beginning of the taskList
- self.taskList.insert(0, newList)
- break
- taskListPriority = self.taskList[index]._priority
- if (taskListPriority == taskPriority):
- self.taskList[index].add(task)
- break
- elif (taskListPriority > taskPriority):
- index = index - 1
- elif (taskListPriority < taskPriority):
- # Time to insert
- newList = TaskPriorityList(taskPriority)
- newList.add(task)
- # Insert this new priority level
- # If we are already at the end, just append it
- if (index == len(self.taskList)-1):
- self.taskList.append(newList)
- else:
- # Otherwise insert it
- self.taskList.insert(index+1, newList)
- break
- if __debug__:
- if self.pStatsTasks and task.name != "igLoop":
- task.setupPStats()
- if self.fVerbose:
- # Alert the world, a new task is born!
- messenger.send(
- 'TaskManager-spawnTask', sentArgs = [task, task.name, index])
- return task
- def remove(self, taskOrName):
- if type(taskOrName) == type(''):
- return self.__removeTasksNamed(taskOrName)
- elif isinstance(taskOrName, Task):
- return self.__removeTasksEqual(taskOrName)
- else:
- self.notify.error('remove takes a string or a Task')
- def removeTasksMatching(self, taskPattern):
- """removeTasksMatching(self, string taskPattern)
- Removes tasks whose names match the pattern, which can include
- standard shell globbing characters like *, ?, and [].
- """
- # TaskManager.notify.debug('removing tasks matching: ' + taskPattern)
- num = 0
- keyList = filter(
- lambda key: fnmatch.fnmatchcase(key, taskPattern),
- self.nameDict.keys())
- for key in keyList:
- num += self.__removeTasksNamed(key)
- return num
- def __removeTasksEqual(self, task):
- # Remove this task from the nameDict (should be a short list)
- if self.__removeTaskFromNameDict(task):
- # TaskManager.notify.debug(
- # '__removeTasksEqual: removing task: %s' % (task))
- # Flag the task for removal from the real list
- task.remove()
- task.finishTask(self.fVerbose)
- return 1
- else:
- return 0
- def __removeTasksNamed(self, taskName):
- tasks = self.nameDict.get(taskName)
- if not tasks:
- return 0
- # TaskManager.notify.debug(
- # '__removeTasksNamed: removing tasks named: %s' % (taskName))
- for task in tasks:
- # Flag for removal
- task.remove()
- task.finishTask(self.fVerbose)
- # Record the number of tasks removed
- num = len(tasks)
- # Blow away the nameDict entry completely
- del self.nameDict[taskName]
- return num
- def __removeTaskFromNameDict(self, task):
- taskName = task.name
- # If this is the only task with that name, remove the dict entry
- tasksWithName = self.nameDict.get(taskName)
- if tasksWithName:
- if task in tasksWithName:
- # If this is the last element, just remove the entry
- # from the dictionary
- if len(tasksWithName) == 1:
- del self.nameDict[taskName]
- else:
- tasksWithName.remove(task)
- return 1
- return 0
- def __executeTask(self, task):
- task.setCurrentTimeFrame(self.currentTime, self.currentFrame)
- if not self.taskTimerVerbose:
- startTime = self.trueClock.getShortTime()
-
- # don't record timing info
- ret = task(*task.extraArgs)
- endTime = self.trueClock.getShortTime()
-
- # Record the dt
- dt = endTime - startTime
- task.dt = dt
- else:
- # Run the task and check the return value
- if task.pstats:
- task.pstats.start()
- startTime = self.trueClock.getShortTime()
- ret = task(*task.extraArgs)
- endTime = self.trueClock.getShortTime()
- if task.pstats:
- task.pstats.stop()
- # Record the dt
- dt = endTime - startTime
- task.dt = dt
- # See if this is the new max
- if dt > task.maxDt:
- task.maxDt = dt
- # Record the running total of all dts so we can compute an average
- task.runningTotal = task.runningTotal + dt
- if (task.frame > 0):
- task.avgDt = (task.runningTotal / task.frame)
- else:
- task.avgDt = 0
- # warn if the task took too long
- if self.warnTaskDuration:
- if dt >= self.taskDurationWarningThreshold:
- assert TaskManager.notify.warning('task %s ran for %.2f seconds' % (
- task.name, dt))
-
- return ret
- def __repeatDoMethod(self, task):
- """
- Called when a task execute function returns Task.again because
- it wants the task to execute again after the same or a modified
- delay (set 'delayTime' on the task object to change the delay)
- """
- if (not task._removed):
- # be sure to ask the globalClock for the current frame time
- # rather than use a cached value; globalClock's frame time may
- # have been synced since the start of this frame
- currentTime = self.__getTime()
- # Cache the time we should wake up for easier sorting
- task.wakeTime = currentTime + task.delayTime
- # Push this onto the doLaterList. The heap maintains the sorting.
- heappush(self.__doLaterList, task)
- if self.fVerbose:
- # Alert the world, a new task is born!
- messenger.send('TaskManager-againDoLater',
- sentArgs = [task, task.name, task.id])
- def __stepThroughList(self, taskPriList):
- # Traverse the taskPriList with an iterator
- i = 0
- while (i < len(taskPriList)):
- task = taskPriList[i]
- # See if we are at the end of the real tasks
- if task is None:
- break
- # See if this task has been removed in show code
- if task._removed:
- # assert TaskManager.notify.debug(
- # '__stepThroughList: task is flagged for removal %s' % (task))
- # If it was removed in show code, it will need finishTask run
- # If it was removed by the taskMgr, it will not, but that is ok
- # because finishTask is safe to call twice
- task.finishTask(self.fVerbose)
- taskPriList.remove(i)
- self.__removeTaskFromNameDict(task)
- # Do not increment the iterator
- continue
- # Now actually execute the task
- ret = self.__executeTask(task)
- # See if the task is done
- if (ret == cont):
- # Leave it for next frame, its not done yet
- pass
- elif (ret == again):
- # repeat doLater again after a delay
- self.__repeatDoMethod(task)
- taskPriList.remove(i)
- continue
- elif ((ret == done) or (ret == exit) or (ret == None)):
- # assert TaskManager.notify.debug(
- # '__stepThroughList: task is finished %s' % (task))
- # Remove the task
- if not task._removed:
- # assert TaskManager.notify.debug(
- # '__stepThroughList: task not removed %s' % (task))
- task.remove()
- # Note: Should not need to remove from doLaterList here
- # because this task is not in the doLaterList
- task.finishTask(self.fVerbose)
- self.__removeTaskFromNameDict(task)
- else:
- # assert TaskManager.notify.debug(
- # '__stepThroughList: task already removed %s' % (task))
- self.__removeTaskFromNameDict(task)
- taskPriList.remove(i)
- # Do not increment the iterator
- continue
- else:
- raise StandardError, \
- "Task named %s did not return cont, exit, done, or None" % \
- (task.name,)
- # Move to the next element
- i += 1
- def __addPendingTasksToTaskList(self):
- # Now that we are all done, add any left over pendingTasks
- # generated in priority levels lower or higher than where
- # we were when we iterated
- for taskList in self.pendingTaskDict.values():
- for task in taskList:
- if (task and not task._removed):
- # assert TaskManager.notify.debug(
- # 'step: moving %s from pending to taskList' % (task.name))
- self.__addNewTask(task)
- self.pendingTaskDict.clear()
- def profileFrames(self, num=None):
- self._profileFrames = True
- if num is None:
- num = 1
- self._profileFrameCount = num
-
- # in the event we want to do frame time managment.. this is the function to
- # replace or overload..
- def doYield(self , frameStartTime, nextScheuledTaksTime):
- None
-
- def doYieldExample(self , frameStartTime, nextScheuledTaksTime):
- minFinTime = frameStartTime + self.MaxEpockSpeed
- if nextScheuledTaksTime > 0 and nextScheuledTaksTime < minFinTime:
- print ' Adjusting Time'
- minFinTime = nextScheuledTaksTime;
- delta = minFinTime - self.globalClock.getRealTime();
- while(delta > 0.002):
- print ' sleep %s'% (delta)
- time.sleep(delta)
- delta = minFinTime - self.globalClock.getRealTime();
-
- @profiled()
- def _doProfiledFrames(self, *args, **kArgs):
- print '** profiling %s frames' % self._profileFrameCount
- for i in xrange(self._profileFrameCount):
- result = self.step(*args, **kArgs)
- return result
- def step(self):
- # assert TaskManager.notify.debug('step: begin')
- self.currentTime, self.currentFrame = self.__getTimeFrame()
- startFrameTime = None
- if self.globalClock:
- startFrameTime = self.globalClock.getRealTime()
-
- # Replace keyboard interrupt handler during task list processing
- # so we catch the keyboard interrupt but don't handle it until
- # after task list processing is complete.
- self.fKeyboardInterrupt = 0
- self.interruptCount = 0
- signal.signal(signal.SIGINT, self.keyboardInterruptHandler)
- # Traverse the task list in order because it is in priority order
- priIndex = 0
- while priIndex < len(self.taskList):
- taskPriList = self.taskList[priIndex]
- pri = taskPriList._priority
- # assert TaskManager.notify.debug(
- # 'step: running through taskList at pri: %s, priIndex: %s' %
- # (pri, priIndex))
- self.__stepThroughList(taskPriList)
- # Now see if that generated any pending tasks for this taskPriList
- pendingTasks = self.pendingTaskDict.get(pri)
- while pendingTasks:
- # assert TaskManager.notify.debug('step: running through pending tasks at pri: %s' % (pri))
- # Remove them from the pendingTaskDict
- del self.pendingTaskDict[pri]
- # Execute them
- self.__stepThroughList(pendingTasks)
- # Add these to the real taskList
- for task in pendingTasks:
- if (task and not task._removed):
- # assert TaskManager.notify.debug('step: moving %s from pending to taskList' % (task.name))
- self.__addNewTask(task)
- # See if we generated any more for this pri level
- pendingTasks = self.pendingTaskDict.get(pri)
- # Any new tasks that were made pending should be converted
- # to real tasks now in case they need to run this frame at a
- # later priority level
- self.__addPendingTasksToTaskList()
- # Go to the next priority level
- priIndex += 1
- # Add new pending tasks
- self.__addPendingTasksToTaskList()
-
- if startFrameTime:
- #this is the spot for a Internal Yield Function
- nextTaskTime = self.__getNextDoLaterTime()
- self.doYield(startFrameTime,nextTaskTime)
-
- # Restore default interrupt handler
- signal.signal(signal.SIGINT, signal.default_int_handler)
- if self.fKeyboardInterrupt:
- raise KeyboardInterrupt
- def run(self):
- # Set the clock to have last frame's time in case we were
- # Paused at the prompt for a long time
- if self.globalClock:
- t = self.globalClock.getFrameTime()
- timeDelta = t - globalClock.getRealTime()
- self.globalClock.setRealTime(t)
- messenger.send("resetClock", [timeDelta])
- if self.resumeFunc != None:
- self.resumeFunc()
- if self.stepping:
- self.step()
- else:
- self.running = 1
- while self.running:
- try:
- if self._profileFrames:
- self._profileFrames = False
- self._doProfiledFrames()
- else:
- self.step()
- except KeyboardInterrupt:
- self.stop()
- except IOError, ioError:
- code, message = self._unpackIOError(ioError)
- # Since upgrading to Python 2.4.1, pausing the execution
- # often gives this IOError during the sleep function:
- # IOError: [Errno 4] Interrupted function call
- # So, let's just handle that specific exception and stop.
- # All other IOErrors should still get raised.
- # Only problem: legit IOError 4s will be obfuscated.
- if code == 4:
- self.stop()
- else:
- raise
- except:
- if self.extendedExceptions:
- self.stop()
- print_exc_plus()
- else:
- raise
- def _unpackIOError(self, ioError):
- # IOError unpack from http://www.python.org/doc/essays/stdexceptions/
- # this needs to be in its own method, exceptions that occur inside
- # a nested try block are not caught by the inner try block's except
- try:
- (code, message) = ioError
- except:
- code = 0
- message = ioError
- return code, message
- def stop(self):
- # Set a flag so we will stop before beginning next frame
- self.running = 0
- def __tryReplaceTaskMethod(self, task, oldMethod, newFunction):
- if (task is None) or task._removed:
- return 0
- method = task.__call__
- if (type(method) == types.MethodType):
- function = method.im_func
- else:
- function = method
- #print ('function: ' + `function` + '\n' +
- # 'method: ' + `method` + '\n' +
- # 'oldMethod: ' + `oldMethod` + '\n' +
- # 'newFunction: ' + `newFunction` + '\n')
- if (function == oldMethod):
- import new
- newMethod = new.instancemethod(newFunction,
- method.im_self,
- method.im_class)
- task.__call__ = newMethod
- # Found a match
- return 1
- return 0
- def replaceMethod(self, oldMethod, newFunction):
- numFound = 0
- # Look through the regular tasks
- for taskPriList in self.taskList:
- for task in taskPriList:
- if task:
- numFound += self.__tryReplaceTaskMethod(task, oldMethod, newFunction)
- # Look through the pending tasks
- for pri, taskList in self.pendingTaskDict.items():
- for task in taskList:
- if task:
- numFound += self.__tryReplaceTaskMethod(task, oldMethod, newFunction)
- # Look through the doLaters
- for task in self.__doLaterList:
- if task:
- numFound += self.__tryReplaceTaskMethod(task, oldMethod, newFunction)
- return numFound
- def __repr__(self):
- taskNameWidth = 32
- dtWidth = 10
- priorityWidth = 10
- totalDt = 0
- totalAvgDt = 0
- str = "The taskMgr is handling:\n"
- str += ('taskList'.ljust(taskNameWidth)
- + 'dt(ms)'.rjust(dtWidth)
- + 'avg'.rjust(dtWidth)
- + 'max'.rjust(dtWidth)
- + 'priority'.rjust(priorityWidth)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- dtfmt = '%%%d.2f' % (dtWidth)
- for taskPriList in self.taskList:
- priority = `taskPriList._priority`
- for task in taskPriList:
- if task is None:
- break
- if task._removed:
- taskName = '(R)' + task.name
- else:
- taskName = task.name
- if self.taskTimerVerbose:
- totalDt = totalDt + task.dt
- totalAvgDt = totalAvgDt + task.avgDt
- str += (taskName.ljust(taskNameWidth)
- + dtfmt % (task.dt*1000)
- + dtfmt % (task.avgDt*1000)
- + dtfmt % (task.maxDt*1000)
- + priority.rjust(priorityWidth)
- + '\n')
- else:
- str += (task.name.ljust(taskNameWidth)
- + '----'.rjust(dtWidth)
- + '----'.rjust(dtWidth)
- + '----'.rjust(dtWidth)
- + priority.rjust(priorityWidth)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- str += 'pendingTasks\n'
- str += '-------------------------------------------------------------------------\n'
- for pri, taskList in self.pendingTaskDict.items():
- for task in taskList:
- if task._removed:
- taskName = '(PR)' + task.name
- else:
- taskName = '(P)' + task.name
- if (self.taskTimerVerbose):
- str += (' ' + taskName.ljust(taskNameWidth-2)
- + dtfmt % (pri)
- + '\n')
- else:
- str += (' ' + taskName.ljust(taskNameWidth-2)
- + '----'.rjust(dtWidth)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- if (self.taskTimerVerbose):
- str += ('total'.ljust(taskNameWidth)
- + dtfmt % (totalDt*1000)
- + dtfmt % (totalAvgDt*1000)
- + '\n')
- else:
- str += ('total'.ljust(taskNameWidth)
- + '----'.rjust(dtWidth)
- + '----'.rjust(dtWidth)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- str += ('doLaterList'.ljust(taskNameWidth)
- + 'waitTime(s)'.rjust(dtWidth)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- # When we print, show the doLaterList in actual sorted order.
- # The priority heap is not actually in order - it is a tree
- # Make a shallow copy so we can sort it
- sortedDoLaterList = self.__doLaterList[:]
- sortedDoLaterList.sort(lambda a, b: cmp(a.wakeTime, b.wakeTime))
- sortedDoLaterList.reverse()
- for task in sortedDoLaterList:
- remainingTime = ((task.wakeTime) - self.currentTime)
- if task._removed:
- taskName = '(R)' + task.name
- else:
- taskName = task.name
- str += (' ' + taskName.ljust(taskNameWidth-2)
- + dtfmt % (remainingTime)
- + '\n')
- str += '-------------------------------------------------------------------------\n'
- str += "End of taskMgr info\n"
- return str
- def getTasks(self):
- # returns list of all tasks in arbitrary order
- tasks = []
- for taskPriList in self.taskList:
- for task in taskPriList:
- if task is not None and not task._removed:
- tasks.append(task)
- for pri, taskList in self.pendingTaskDict.iteritems():
- for task in taskList:
- if not task._removed:
- tasks.append(task)
- return tasks
- def getDoLaters(self):
- # returns list of all doLaters in arbitrary order
- return [doLater for doLater in self.__doLaterList
- if not doLater._removed]
- def resetStats(self):
- # WARNING: this screws up your do-later timings
- if self.taskTimerVerbose:
- for task in self.taskList:
- task.dt = 0
- task.avgDt = 0
- task.maxDt = 0
- task.runningTotal = 0
- task.setStartTimeFrame(self.currentTime, self.currentFrame)
- def popupControls(self):
- from direct.tkpanels import TaskManagerPanel
- return TaskManagerPanel.TaskManagerPanel(self)
- def __getTimeFrame(self):
- # WARNING: If you are testing tasks without an igLoop,
- # you must manually tick the clock
- # Ask for the time last frame
- if self.globalClock:
- return self.globalClock.getFrameTime(), self.globalClock.getFrameCount()
- # OK, we don't have a globalClock yet. This is therefore
- # running before the first frame.
- return self.trueClock.getShortTime(), 0
- def __getTime(self):
- if self.globalClock:
- return self.globalClock.getFrameTime()
- return self.trueClock.getShortTime()
- if __debug__:
- # to catch memory leaks during the tests at the bottom of the file
- def _startTrackingMemLeaks(self):
- self._memUsage = ScratchPad()
- mu = self._memUsage
- mu.lenTaskList = len(self.taskList)
- mu.lenPendingTaskDict = len(self.pendingTaskDict)
- mu.lenDoLaterList = len(self.__doLaterList)
- mu.lenNameDict = len(self.nameDict)
- def _stopTrackingMemLeaks(self):
- self._memUsage.destroy()
- del self._memUsage
- def _checkMemLeaks(self):
- # flush removed doLaters
- self.__doLaterFilter()
- # give the mgr a chance to clear out removed tasks
- self.step()
- mu = self._memUsage
- # the task list looks like it grows and never shrinks, replacing finished
- # tasks with 'None' in the TaskPriorityLists.
- # TODO: look at reducing memory usage here--clear out excess at the end of every frame?
- #assert mu.lenTaskList == len(self.taskList)
- assert mu.lenPendingTaskDict == len(self.pendingTaskDict)
- assert mu.lenDoLaterList == len(self.__doLaterList)
- assert mu.lenNameDict == len(self.nameDict)
- def startOsd(self):
- self.add(self.doOsd, 'taskMgr.doOsd')
- self._osdEnabled = None
- def osdEnabled(self):
- return hasattr(self, '_osdEnabled')
- def stopOsd(self):
- onScreenDebug.removeAllWithPrefix(TaskManager.OsdPrefix)
- self.remove('taskMgr.doOsd')
- del self._osdEnabled
- def doOsd(self, task):
- if not onScreenDebug.enabled:
- return
- prefix = TaskManager.OsdPrefix
- onScreenDebug.removeAllWithPrefix(prefix)
- taskNameWidth = 32
- dtWidth = 10
- priorityWidth = 10
- totalDt = 0
- totalAvgDt = 0
- i = 0
- onScreenDebug.add(
- ('%s%02i.taskList' % (prefix, i)).ljust(taskNameWidth),
- '%s %s %s %s' % (
- 'dt(ms)'.rjust(dtWidth),
- 'avg'.rjust(dtWidth),
- 'max'.rjust(dtWidth),
- 'priority'.rjust(priorityWidth),))
- i += 1
- for taskPriList in self.taskList:
- priority = `taskPriList._priority`
- for task in taskPriList:
- if task is None:
- break
- if task._removed:
- taskName = '(R)' + task.name
- else:
- taskName = task.name
- totalDt = totalDt + task.dt
- totalAvgDt = totalAvgDt + task.avgDt
- onScreenDebug.add(
- ('%s%02i.%s' % (prefix, i, task.name)).ljust(taskNameWidth),
- '%s %s %s %s' % (
- dtfmt % (task.dt*1000),
- dtfmt % (task.avgDt*1000),
- dtfmt % (task.maxDt*1000),
- priority.rjust(priorityWidth)))
- i += 1
- onScreenDebug.add(('%s%02i.total' % (prefix, i)).ljust(taskNameWidth),
- '%s %s' % (
- dtfmt % (totalDt*1000),
- dtfmt % (totalAvgDt*1000),))
- return cont
- # These constants are moved to the top level of the module,
- # to make it easier for legacy code. In general though, putting
- # constants at the top level of a module is deprecated.
- exit = Task.exit
- done = Task.done
- cont = Task.cont
- again = Task.again
- if __debug__:
- # keep everything in a function namespace so it's easier to clean up
- def runTests():
- tm = TaskManager()
- # looks like nothing runs on the first frame...?
- # step to get past the first frame
- tm.step()
- # check for memory leaks after every test
- tm._startTrackingMemLeaks()
- tm._checkMemLeaks()
- # run-once task
- l = []
- def _testDone(task, l=l):
- l.append(None)
- return task.done
- tm.add(_testDone, 'testDone')
- tm.step()
- assert len(l) == 1
- tm.step()
- assert len(l) == 1
- _testDone = None
- tm._checkMemLeaks()
- # remove by name
- def _testRemoveByName(task):
- return task.done
- tm.add(_testRemoveByName, 'testRemoveByName')
- assert tm.remove('testRemoveByName') == 1
- assert tm.remove('testRemoveByName') == 0
- _testRemoveByName = None
- tm._checkMemLeaks()
- # duplicate named tasks
- def _testDupNamedTasks(task):
- return task.done
- tm.add(_testDupNamedTasks, 'testDupNamedTasks')
- tm.add(_testDupNamedTasks, 'testDupNamedTasks')
- assert tm.remove('testRemoveByName') == 0
- _testDupNamedTasks = None
- tm._checkMemLeaks()
- # continued task
- l = []
- def _testCont(task, l = l):
- l.append(None)
- return task.cont
- tm.add(_testCont, 'testCont')
- tm.step()
- assert len(l) == 1
- tm.step()
- assert len(l) == 2
- tm.remove('testCont')
- _testCont = None
- tm._checkMemLeaks()
- # continue until done task
- l = []
- def _testContDone(task, l = l):
- l.append(None)
- if len(l) >= 2:
- return task.done
- else:
- return task.cont
- tm.add(_testContDone, 'testContDone')
- tm.step()
- assert len(l) == 1
- tm.step()
- assert len(l) == 2
- tm.step()
- assert len(l) == 2
- assert not tm.hasTaskNamed('testContDone')
- _testContDone = None
- tm._checkMemLeaks()
- # hasTaskNamed
- def _testHasTaskNamed(task):
- return task.done
- tm.add(_testHasTaskNamed, 'testHasTaskNamed')
- assert tm.hasTaskNamed('testHasTaskNamed')
- tm.step()
- assert not tm.hasTaskNamed('testHasTaskNamed')
- _testHasTaskNamed = None
- tm._checkMemLeaks()
- # task priority
- l = []
- def _testPri1(task, l = l):
- l.append(1)
- return task.cont
- def _testPri2(task, l = l):
- l.append(2)
- return task.cont
- tm.add(_testPri1, 'testPri1', priority = 1)
- tm.add(_testPri2, 'testPri2', priority = 2)
- tm.step()
- assert len(l) == 2
- assert l == [1, 2,]
- tm.step()
- assert len(l) == 4
- assert l == [1, 2, 1, 2,]
- tm.remove('testPri1')
- tm.remove('testPri2')
- _testPri1 = None
- _testPri2 = None
- tm._checkMemLeaks()
- # task extraArgs
- l = []
- def _testExtraArgs(arg1, arg2, l=l):
- l.extend([arg1, arg2,])
- return done
- tm.add(_testExtraArgs, 'testExtraArgs', extraArgs=[4,5])
- tm.step()
- assert len(l) == 2
- assert l == [4, 5,]
- _testExtraArgs = None
- tm._checkMemLeaks()
- # task appendTask
- l = []
- def _testAppendTask(arg1, arg2, task, l=l):
- l.extend([arg1, arg2,])
- return task.done
- tm.add(_testAppendTask, '_testAppendTask', extraArgs=[4,5], appendTask=True)
- tm.step()
- assert len(l) == 2
- assert l == [4, 5,]
- _testAppendTask = None
- tm._checkMemLeaks()
- # task uponDeath
- l = []
- def _uponDeathFunc(task, l=l):
- l.append(task.name)
- def _testUponDeath(task):
- return done
- tm.add(_testUponDeath, 'testUponDeath', uponDeath=_uponDeathFunc)
- tm.step()
- assert len(l) == 1
- assert l == ['testUponDeath']
- _testUponDeath = None
- _uponDeathFunc = None
- tm._checkMemLeaks()
- # task owner
- class _TaskOwner:
- def _clearTask(self, task):
- self.clearedTaskName = task.name
- to = _TaskOwner()
- l = []
- def _testOwner(task):
- return done
- tm.add(_testOwner, 'testOwner', owner=to)
- tm.step()
- assert hasattr(to, 'clearedTaskName')
- assert to.clearedTaskName == 'testOwner'
- _testOwner = None
- del to
- _TaskOwner = None
- tm._checkMemLeaks()
- doLaterTests = [0,]
- # doLater
- l = []
- def _testDoLater1(task, l=l):
- l.append(1)
- def _testDoLater2(task, l=l):
- l.append(2)
- def _monitorDoLater(task, tm=tm, l=l, doLaterTests=doLaterTests):
- if task.time > .03:
- assert l == [1, 2,]
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLater1, 'testDoLater1')
- tm.doMethodLater(.02, _testDoLater2, 'testDoLater2')
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLater, 'monitorDoLater', priority=10)
- _testDoLater1 = None
- _testDoLater2 = None
- _monitorDoLater = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # doLater priority
- l = []
- def _testDoLaterPri1(task, l=l):
- l.append(1)
- def _testDoLaterPri2(task, l=l):
- l.append(2)
- def _monitorDoLaterPri(task, tm=tm, l=l, doLaterTests=doLaterTests):
- if task.time > .02:
- assert l == [1, 2,]
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLaterPri1, 'testDoLaterPri1', priority=1)
- tm.doMethodLater(.01, _testDoLaterPri2, 'testDoLaterPri2', priority=2)
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLaterPri, 'monitorDoLaterPri', priority=10)
- _testDoLaterPri1 = None
- _testDoLaterPri2 = None
- _monitorDoLaterPri = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # doLater extraArgs
- l = []
- def _testDoLaterExtraArgs(arg1, l=l):
- l.append(arg1)
- def _monitorDoLaterExtraArgs(task, tm=tm, l=l, doLaterTests=doLaterTests):
- if task.time > .02:
- assert l == [3,]
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLaterExtraArgs, 'testDoLaterExtraArgs', extraArgs=[3,])
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLaterExtraArgs, 'monitorDoLaterExtraArgs', priority=10)
- _testDoLaterExtraArgs = None
- _monitorDoLaterExtraArgs = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # doLater appendTask
- l = []
- def _testDoLaterAppendTask(arg1, task, l=l):
- assert task.name == 'testDoLaterAppendTask'
- l.append(arg1)
- def _monitorDoLaterAppendTask(task, tm=tm, l=l, doLaterTests=doLaterTests):
- if task.time > .02:
- assert l == [4,]
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLaterAppendTask, 'testDoLaterAppendTask',
- extraArgs=[4,], appendTask=True)
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLaterAppendTask, 'monitorDoLaterAppendTask', priority=10)
- _testDoLaterAppendTask = None
- _monitorDoLaterAppendTask = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # doLater uponDeath
- l = []
- def _testUponDeathFunc(task, l=l):
- assert task.name == 'testDoLaterUponDeath'
- l.append(10)
- def _testDoLaterUponDeath(arg1, l=l):
- return done
- def _monitorDoLaterUponDeath(task, tm=tm, l=l, doLaterTests=doLaterTests):
- if task.time > .02:
- assert l == [10,]
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLaterUponDeath, 'testDoLaterUponDeath',
- uponDeath=_testUponDeathFunc)
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLaterUponDeath, 'monitorDoLaterUponDeath', priority=10)
- _testUponDeathFunc = None
- _testDoLaterUponDeath = None
- _monitorDoLaterUponDeath = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # doLater owner
- class _DoLaterOwner:
- def _clearTask(self, task):
- self.clearedTaskName = task.name
- doLaterOwner = _DoLaterOwner()
- l = []
- def _testDoLaterOwner(l=l):
- pass
- def _monitorDoLaterOwner(task, tm=tm, l=l, doLaterOwner=doLaterOwner,
- doLaterTests=doLaterTests):
- if task.time > .02:
- assert hasattr(doLaterOwner, 'clearedTaskName')
- assert doLaterOwner.clearedTaskName == 'testDoLaterOwner'
- doLaterTests[0] -= 1
- return task.done
- return task.cont
- tm.doMethodLater(.01, _testDoLaterOwner, 'testDoLaterOwner',
- owner=doLaterOwner)
- doLaterTests[0] += 1
- # make sure we run this task after the doLaters if they all occur on the same frame
- tm.add(_monitorDoLaterOwner, 'monitorDoLaterOwner', priority=10)
- _testDoLaterOwner = None
- _monitorDoLaterOwner = None
- del doLaterOwner
- _DoLaterOwner = None
- # don't check until all the doLaters are finished
- #tm._checkMemLeaks()
- # run the doLater tests
- while doLaterTests[0] > 0:
- tm.step()
- del doLaterTests
- tm._checkMemLeaks()
- # getTasks
- def _testGetTasks(task):
- return task.cont
- # the doLaterProcessor is always running
- assert len(tm.getTasks()) == 1
- tm.add(_testGetTasks, 'testGetTasks1')
- assert len(tm.getTasks()) == 2
- assert (tm.getTasks()[0].name == 'testGetTasks1' or
- tm.getTasks()[1].name == 'testGetTasks1')
- tm.add(_testGetTasks, 'testGetTasks2')
- tm.add(_testGetTasks, 'testGetTasks3')
- assert len(tm.getTasks()) == 4
- tm.remove('testGetTasks2')
- assert len(tm.getTasks()) == 3
- tm.remove('testGetTasks1')
- tm.remove('testGetTasks3')
- assert len(tm.getTasks()) == 1
- _testGetTasks = None
- tm._checkMemLeaks()
- # getDoLaters
- def _testGetDoLaters():
- pass
- # the doLaterProcessor is always running
- assert len(tm.getDoLaters()) == 0
- tm.doMethodLater(.1, _testGetDoLaters, 'testDoLater1')
- assert len(tm.getDoLaters()) == 1
- assert tm.getDoLaters()[0].name == 'testDoLater1'
- tm.doMethodLater(.1, _testGetDoLaters, 'testDoLater2')
- tm.doMethodLater(.1, _testGetDoLaters, 'testDoLater3')
- assert len(tm.getDoLaters()) == 3
- tm.remove('testDoLater2')
- assert len(tm.getDoLaters()) == 2
- tm.remove('testDoLater1')
- tm.remove('testDoLater3')
- assert len(tm.getDoLaters()) == 0
- _testGetDoLaters = None
- tm._checkMemLeaks()
- # duplicate named doLaters removed via taskMgr.remove
- def _testDupNameDoLaters():
- pass
- # the doLaterProcessor is always running
- tm.doMethodLater(.1, _testDupNameDoLaters, 'testDupNameDoLater')
- tm.doMethodLater(.1, _testDupNameDoLaters, 'testDupNameDoLater')
- assert len(tm.getDoLaters()) == 2
- tm.remove('testDupNameDoLater')
- assert len(tm.getDoLaters()) == 0
- _testDupNameDoLaters = None
- tm._checkMemLeaks()
- # duplicate named doLaters removed via remove()
- def _testDupNameDoLatersRemove():
- pass
- # the doLaterProcessor is always running
- dl1 = tm.doMethodLater(.1, _testDupNameDoLatersRemove, 'testDupNameDoLaterRemove')
- dl2 = tm.doMethodLater(.1, _testDupNameDoLatersRemove, 'testDupNameDoLaterRemove')
- assert len(tm.getDoLaters()) == 2
- dl2.remove()
- assert len(tm.getDoLaters()) == 1
- dl1.remove()
- assert len(tm.getDoLaters()) == 0
- _testDupNameDoLatersRemove = None
- # nameDict etc. isn't cleared out right away with task.remove()
- tm._checkMemLeaks()
- # getTasksNamed
- def _testGetTasksNamed(task):
- return task.cont
- assert len(tm.getTasksNamed('testGetTasksNamed')) == 0
- tm.add(_testGetTasksNamed, 'testGetTasksNamed')
- assert len(tm.getTasksNamed('testGetTasksNamed')) == 1
- assert tm.getTasksNamed('testGetTasksNamed')[0].name == 'testGetTasksNamed'
- tm.add(_testGetTasksNamed, 'testGetTasksNamed')
- tm.add(_testGetTasksNamed, 'testGetTasksNamed')
- assert len(tm.getTasksNamed('testGetTasksNamed')) == 3
- tm.remove('testGetTasksNamed')
- assert len(tm.getTasksNamed('testGetTasksNamed')) == 0
- _testGetTasksNamed = None
- tm._checkMemLeaks()
- # removeTasksMatching
- def _testRemoveTasksMatching(task):
- return task.cont
- tm.add(_testRemoveTasksMatching, 'testRemoveTasksMatching')
- assert len(tm.getTasksNamed('testRemoveTasksMatching')) == 1
- tm.removeTasksMatching('testRemoveTasksMatching')
- assert len(tm.getTasksNamed('testRemoveTasksMatching')) == 0
- tm.add(_testRemoveTasksMatching, 'testRemoveTasksMatching1')
- tm.add(_testRemoveTasksMatching, 'testRemoveTasksMatching2')
- assert len(tm.getTasksNamed('testRemoveTasksMatching1')) == 1
- assert len(tm.getTasksNamed('testRemoveTasksMatching2')) == 1
- tm.removeTasksMatching('testRemoveTasksMatching*')
- assert len(tm.getTasksNamed('testRemoveTasksMatching1')) == 0
- assert len(tm.getTasksNamed('testRemoveTasksMatching2')) == 0
- tm.add(_testRemoveTasksMatching, 'testRemoveTasksMatching1a')
- tm.add(_testRemoveTasksMatching, 'testRemoveTasksMatching2a')
- assert len(tm.getTasksNamed('testRemoveTasksMatching1a')) == 1
- assert len(tm.getTasksNamed('testRemoveTasksMatching2a')) == 1
- tm.removeTasksMatching('testRemoveTasksMatching?a')
- assert len(tm.getTasksNamed('testRemoveTasksMatching1a')) == 0
- assert len(tm.getTasksNamed('testRemoveTasksMatching2a')) == 0
- _testRemoveTasksMatching = None
- tm._checkMemLeaks()
- # create Task object and add to mgr
- l = []
- def _testTaskObj(task, l=l):
- l.append(None)
- return task.cont
- t = Task(_testTaskObj)
- tm.add(t, 'testTaskObj')
- tm.step()
- assert len(l) == 1
- tm.step()
- assert len(l) == 2
- tm.remove('testTaskObj')
- tm.step()
- assert len(l) == 2
- _testTaskObj = None
- tm._checkMemLeaks()
-
- # remove Task via task.remove()
- l = []
- def _testTaskObjRemove(task, l=l):
- l.append(None)
- return task.cont
- t = Task(_testTaskObjRemove)
- tm.add(t, 'testTaskObjRemove')
- tm.step()
- assert len(l) == 1
- tm.step()
- assert len(l) == 2
- t.remove()
- tm.step()
- assert len(l) == 2
- del t
- _testTaskObjRemove = None
- tm._checkMemLeaks()
- """
- # this test fails, and it's not clear what the correct behavior should be.
- # priority passed to Task.__init__ is always overridden by taskMgr.add()
- # even if no priority is specified, and calling Task.setPriority() has no
- # effect on the taskMgr's behavior.
- # set/get Task priority
- l = []
- def _testTaskObjPriority(arg, task, l=l):
- l.append(arg)
- return task.cont
- t1 = Task(_testTaskObjPriority, priority=1)
- t2 = Task(_testTaskObjPriority, priority=2)
- tm.add(t1, 'testTaskObjPriority1', extraArgs=['a',], appendTask=True)
- tm.add(t2, 'testTaskObjPriority2', extraArgs=['b',], appendTask=True)
- tm.step()
- assert len(l) == 2
- assert l == ['a', 'b']
- assert t1.getPriority() == 1
- assert t2.getPriority() == 2
- t1.setPriority(3)
- assert t1.getPriority() == 3
- tm.step()
- assert len(l) == 4
- assert l == ['a', 'b', 'b', 'a',]
- t1.remove()
- t2.remove()
- tm.step()
- assert len(l) == 4
- del t1
- del t2
- _testTaskObjPriority = None
- tm._checkMemLeaks()
- """
-
- del l
- tm.destroy()
- del tm
- runTests()
- del runTests
- """
- import Task
- def goo(task):
- print 'goo'
- return Task.done
- def bar(task):
- print 'bar'
- taskMgr.add(goo, 'goo')
- return Task.done
- def foo(task):
- print 'foo'
- taskMgr.add(bar, 'bar')
- return Task.done
- taskMgr.add(foo, 'foo')
- """
|