mirror of https://github.com/axmolengine/axmol.git
953 lines
25 KiB
C++
953 lines
25 KiB
C++
/****************************************************************************
|
|
Copyright (c) 2010-2012 cocos2d-x.org
|
|
Copyright (c) 2008-2010 Ricardo Quesada
|
|
Copyright (c) 2011 Zynga Inc.
|
|
|
|
http://www.cocos2d-x.org
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
****************************************************************************/
|
|
|
|
#include "CCScheduler.h"
|
|
#include "ccMacros.h"
|
|
#include "CCDirector.h"
|
|
#include "support/data_support/utlist.h"
|
|
#include "support/data_support/ccCArray.h"
|
|
#include "cocoa/CCArray.h"
|
|
#include "script_support/CCScriptSupport.h"
|
|
|
|
using namespace std;
|
|
|
|
NS_CC_BEGIN
|
|
|
|
// data structures
|
|
|
|
// A list double-linked list used for "updates with priority"
|
|
typedef struct _listEntry
|
|
{
|
|
struct _listEntry *prev, *next;
|
|
Object *target; // not retained (retained by hashUpdateEntry)
|
|
int priority;
|
|
bool paused;
|
|
bool markedForDeletion; // selector will no longer be called and entry will be removed at end of the next tick
|
|
} tListEntry;
|
|
|
|
typedef struct _hashUpdateEntry
|
|
{
|
|
tListEntry **list; // Which list does it belong to ?
|
|
tListEntry *entry; // entry in the list
|
|
Object *target; // hash key (retained)
|
|
UT_hash_handle hh;
|
|
} tHashUpdateEntry;
|
|
|
|
// Hash Element used for "selectors with interval"
|
|
typedef struct _hashSelectorEntry
|
|
{
|
|
ccArray *timers;
|
|
Object *target; // hash key (retained)
|
|
unsigned int timerIndex;
|
|
Timer *currentTimer;
|
|
bool currentTimerSalvaged;
|
|
bool paused;
|
|
UT_hash_handle hh;
|
|
} tHashTimerEntry;
|
|
|
|
// implementation Timer
|
|
|
|
Timer::Timer()
|
|
: _target(NULL)
|
|
, _elapsed(-1)
|
|
, _runForever(false)
|
|
, _useDelay(false)
|
|
, _timesExecuted(0)
|
|
, _repeat(0)
|
|
, _delay(0.0f)
|
|
, _interval(0.0f)
|
|
, _selector(NULL)
|
|
, _scriptHandler(0)
|
|
{
|
|
}
|
|
|
|
Timer* Timer::create(Object *target, SEL_SCHEDULE selector)
|
|
{
|
|
Timer *pTimer = new Timer();
|
|
|
|
pTimer->initWithTarget(target, selector, 0.0f, kRepeatForever, 0.0f);
|
|
pTimer->autorelease();
|
|
|
|
return pTimer;
|
|
}
|
|
|
|
Timer* Timer::create(Object *target, SEL_SCHEDULE selector, float seconds)
|
|
{
|
|
Timer *pTimer = new Timer();
|
|
|
|
pTimer->initWithTarget(target, selector, seconds, kRepeatForever, 0.0f);
|
|
pTimer->autorelease();
|
|
|
|
return pTimer;
|
|
}
|
|
|
|
Timer* Timer::createWithScriptHandler(int handler, float seconds)
|
|
{
|
|
Timer *pTimer = new Timer();
|
|
|
|
pTimer->initWithScriptHandler(handler, seconds);
|
|
pTimer->autorelease();
|
|
|
|
return pTimer;
|
|
}
|
|
|
|
bool Timer::initWithScriptHandler(int handler, float seconds)
|
|
{
|
|
_scriptHandler = handler;
|
|
_elapsed = -1;
|
|
_interval = seconds;
|
|
|
|
return true;
|
|
}
|
|
|
|
bool Timer::initWithTarget(Object *target, SEL_SCHEDULE selector)
|
|
{
|
|
return initWithTarget(target, selector, 0, kRepeatForever, 0.0f);
|
|
}
|
|
|
|
bool Timer::initWithTarget(Object *target, SEL_SCHEDULE selector, float seconds, unsigned int repeat, float delay)
|
|
{
|
|
_target = target;
|
|
_selector = selector;
|
|
_elapsed = -1;
|
|
_interval = seconds;
|
|
_delay = delay;
|
|
_useDelay = (delay > 0.0f) ? true : false;
|
|
_repeat = repeat;
|
|
_runForever = (repeat == kRepeatForever) ? true : false;
|
|
return true;
|
|
}
|
|
|
|
void Timer::update(float dt)
|
|
{
|
|
if (_elapsed == -1)
|
|
{
|
|
_elapsed = 0;
|
|
_timesExecuted = 0;
|
|
}
|
|
else
|
|
{
|
|
if (_runForever && !_useDelay)
|
|
{//standard timer usage
|
|
_elapsed += dt;
|
|
if (_elapsed >= _interval)
|
|
{
|
|
if (_target && _selector)
|
|
{
|
|
(_target->*_selector)(_elapsed);
|
|
}
|
|
|
|
if (0 != _scriptHandler)
|
|
{
|
|
SchedulerScriptData data(_scriptHandler,_elapsed);
|
|
ScriptEvent event(kScheduleEvent,&data);
|
|
ScriptEngineManager::sharedManager()->getScriptEngine()->sendEvent(&event);
|
|
}
|
|
_elapsed = 0;
|
|
}
|
|
}
|
|
else
|
|
{//advanced usage
|
|
_elapsed += dt;
|
|
if (_useDelay)
|
|
{
|
|
if( _elapsed >= _delay )
|
|
{
|
|
if (_target && _selector)
|
|
{
|
|
(_target->*_selector)(_elapsed);
|
|
}
|
|
|
|
if (0 != _scriptHandler)
|
|
{
|
|
SchedulerScriptData data(_scriptHandler,_elapsed);
|
|
ScriptEvent event(kScheduleEvent,&data);
|
|
ScriptEngineManager::sharedManager()->getScriptEngine()->sendEvent(&event);
|
|
}
|
|
|
|
_elapsed = _elapsed - _delay;
|
|
_timesExecuted += 1;
|
|
_useDelay = false;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (_elapsed >= _interval)
|
|
{
|
|
if (_target && _selector)
|
|
{
|
|
(_target->*_selector)(_elapsed);
|
|
}
|
|
|
|
if (0 != _scriptHandler)
|
|
{
|
|
SchedulerScriptData data(_scriptHandler,_elapsed);
|
|
ScriptEvent event(kScheduleEvent,&data);
|
|
ScriptEngineManager::sharedManager()->getScriptEngine()->sendEvent(&event);
|
|
}
|
|
|
|
_elapsed = 0;
|
|
_timesExecuted += 1;
|
|
|
|
}
|
|
}
|
|
|
|
if (!_runForever && _timesExecuted > _repeat)
|
|
{ //unschedule timer
|
|
Director::getInstance()->getScheduler()->unscheduleSelector(_selector, _target);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
float Timer::getInterval() const
|
|
{
|
|
return _interval;
|
|
}
|
|
|
|
void Timer::setInterval(float interval)
|
|
{
|
|
_interval = interval;
|
|
}
|
|
|
|
SEL_SCHEDULE Timer::getSelector() const
|
|
{
|
|
return _selector;
|
|
}
|
|
|
|
// implementation of Scheduler
|
|
|
|
Scheduler::Scheduler(void)
|
|
: _timeScale(1.0f)
|
|
, _updatesNegList(NULL)
|
|
, _updates0List(NULL)
|
|
, _updatesPosList(NULL)
|
|
, _hashForUpdates(NULL)
|
|
, _hashForTimers(NULL)
|
|
, _currentTarget(NULL)
|
|
, _currentTargetSalvaged(false)
|
|
, _updateHashLocked(false)
|
|
, _scriptHandlerEntries(NULL)
|
|
{
|
|
|
|
}
|
|
|
|
Scheduler::~Scheduler(void)
|
|
{
|
|
unscheduleAll();
|
|
CC_SAFE_RELEASE(_scriptHandlerEntries);
|
|
}
|
|
|
|
void Scheduler::removeHashElement(_hashSelectorEntry *element)
|
|
{
|
|
|
|
cocos2d::Object *target = element->target;
|
|
|
|
ccArrayFree(element->timers);
|
|
HASH_DEL(_hashForTimers, element);
|
|
free(element);
|
|
|
|
// make sure the target is released after we have removed the hash element
|
|
// otherwise we access invalid memory when the release call deletes the target
|
|
// and the target calls removeAllSelectors() during its destructor
|
|
target->release();
|
|
|
|
}
|
|
|
|
void Scheduler::scheduleSelector(SEL_SCHEDULE selector, Object *target, float interval, bool paused)
|
|
{
|
|
this->scheduleSelector(selector, target, interval, kRepeatForever, 0.0f, paused);
|
|
}
|
|
|
|
void Scheduler::scheduleSelector(SEL_SCHEDULE selector, Object *target, float interval, unsigned int repeat, float delay, bool paused)
|
|
{
|
|
CCAssert(selector, "Argument selector must be non-NULL");
|
|
CCAssert(target, "Argument target must be non-NULL");
|
|
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
|
|
if (! element)
|
|
{
|
|
element = (tHashTimerEntry *)calloc(sizeof(*element), 1);
|
|
element->target = target;
|
|
if (target)
|
|
{
|
|
target->retain();
|
|
}
|
|
HASH_ADD_INT(_hashForTimers, target, element);
|
|
|
|
// Is this the 1st element ? Then set the pause level to all the selectors of this target
|
|
element->paused = paused;
|
|
}
|
|
else
|
|
{
|
|
CCAssert(element->paused == paused, "");
|
|
}
|
|
|
|
if (element->timers == NULL)
|
|
{
|
|
element->timers = ccArrayNew(10);
|
|
}
|
|
else
|
|
{
|
|
for (unsigned int i = 0; i < element->timers->num; ++i)
|
|
{
|
|
Timer *timer = (Timer*)element->timers->arr[i];
|
|
|
|
if (selector == timer->getSelector())
|
|
{
|
|
CCLOG("CCScheduler#scheduleSelector. Selector already scheduled. Updating interval from: %.4f to %.4f", timer->getInterval(), interval);
|
|
timer->setInterval(interval);
|
|
return;
|
|
}
|
|
}
|
|
ccArrayEnsureExtraCapacity(element->timers, 1);
|
|
}
|
|
|
|
Timer *pTimer = new Timer();
|
|
pTimer->initWithTarget(target, selector, interval, repeat, delay);
|
|
ccArrayAppendObject(element->timers, pTimer);
|
|
pTimer->release();
|
|
}
|
|
|
|
void Scheduler::unscheduleSelector(SEL_SCHEDULE selector, Object *target)
|
|
{
|
|
// explicity handle nil arguments when removing an object
|
|
if (target == 0 || selector == 0)
|
|
{
|
|
return;
|
|
}
|
|
|
|
//CCAssert(target);
|
|
//CCAssert(selector);
|
|
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
|
|
if (element)
|
|
{
|
|
for (unsigned int i = 0; i < element->timers->num; ++i)
|
|
{
|
|
Timer *pTimer = (Timer*)(element->timers->arr[i]);
|
|
|
|
if (selector == pTimer->getSelector())
|
|
{
|
|
if (pTimer == element->currentTimer && (! element->currentTimerSalvaged))
|
|
{
|
|
element->currentTimer->retain();
|
|
element->currentTimerSalvaged = true;
|
|
}
|
|
|
|
ccArrayRemoveObjectAtIndex(element->timers, i, true);
|
|
|
|
// update timerIndex in case we are in tick:, looping over the actions
|
|
if (element->timerIndex >= i)
|
|
{
|
|
element->timerIndex--;
|
|
}
|
|
|
|
if (element->timers->num == 0)
|
|
{
|
|
if (_currentTarget == element)
|
|
{
|
|
_currentTargetSalvaged = true;
|
|
}
|
|
else
|
|
{
|
|
removeHashElement(element);
|
|
}
|
|
}
|
|
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void Scheduler::priorityIn(tListEntry **list, Object *target, int priority, bool paused)
|
|
{
|
|
tListEntry *listElement = (tListEntry *)malloc(sizeof(*listElement));
|
|
|
|
listElement->target = target;
|
|
listElement->priority = priority;
|
|
listElement->paused = paused;
|
|
listElement->next = listElement->prev = NULL;
|
|
listElement->markedForDeletion = false;
|
|
|
|
// empty list ?
|
|
if (! *list)
|
|
{
|
|
DL_APPEND(*list, listElement);
|
|
}
|
|
else
|
|
{
|
|
bool bAdded = false;
|
|
|
|
for (tListEntry *element = *list; element; element = element->next)
|
|
{
|
|
if (priority < element->priority)
|
|
{
|
|
if (element == *list)
|
|
{
|
|
DL_PREPEND(*list, listElement);
|
|
}
|
|
else
|
|
{
|
|
listElement->next = element;
|
|
listElement->prev = element->prev;
|
|
|
|
element->prev->next = listElement;
|
|
element->prev = listElement;
|
|
}
|
|
|
|
bAdded = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
// Not added? priority has the higher value. Append it.
|
|
if (! bAdded)
|
|
{
|
|
DL_APPEND(*list, listElement);
|
|
}
|
|
}
|
|
|
|
// update hash entry for quick access
|
|
tHashUpdateEntry *pHashElement = (tHashUpdateEntry *)calloc(sizeof(*pHashElement), 1);
|
|
pHashElement->target = target;
|
|
target->retain();
|
|
pHashElement->list = list;
|
|
pHashElement->entry = listElement;
|
|
HASH_ADD_INT(_hashForUpdates, target, pHashElement);
|
|
}
|
|
|
|
void Scheduler::appendIn(_listEntry **list, Object *target, bool paused)
|
|
{
|
|
tListEntry *listElement = (tListEntry *)malloc(sizeof(*listElement));
|
|
|
|
listElement->target = target;
|
|
listElement->paused = paused;
|
|
listElement->markedForDeletion = false;
|
|
|
|
DL_APPEND(*list, listElement);
|
|
|
|
// update hash entry for quicker access
|
|
tHashUpdateEntry *pHashElement = (tHashUpdateEntry *)calloc(sizeof(*pHashElement), 1);
|
|
pHashElement->target = target;
|
|
target->retain();
|
|
pHashElement->list = list;
|
|
pHashElement->entry = listElement;
|
|
HASH_ADD_INT(_hashForUpdates, target, pHashElement);
|
|
}
|
|
|
|
void Scheduler::scheduleUpdateForTarget(Object *target, int priority, bool paused)
|
|
{
|
|
|
|
tHashUpdateEntry *pHashElement = NULL;
|
|
HASH_FIND_INT(_hashForUpdates, &target, pHashElement);
|
|
if (pHashElement)
|
|
{
|
|
#if COCOS2D_DEBUG >= 1
|
|
CCAssert(pHashElement->entry->markedForDeletion,"");
|
|
#endif
|
|
// TODO: check if priority has changed!
|
|
|
|
pHashElement->entry->markedForDeletion = false;
|
|
return;
|
|
}
|
|
|
|
// most of the updates are going to be 0, that's way there
|
|
// is an special list for updates with priority 0
|
|
if (priority == 0)
|
|
{
|
|
appendIn(&_updates0List, target, paused);
|
|
}
|
|
else if (priority < 0)
|
|
{
|
|
priorityIn(&_updatesNegList, target, priority, paused);
|
|
}
|
|
else
|
|
{
|
|
// priority > 0
|
|
priorityIn(&_updatesPosList, target, priority, paused);
|
|
}
|
|
}
|
|
|
|
bool Scheduler::isScheduledForTarget(SEL_SCHEDULE selector, Object *target)
|
|
{
|
|
CCAssert(selector, "Argument selector must be non-NULL");
|
|
CCAssert(target, "Argument target must be non-NULL");
|
|
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
|
|
if (!element)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
if (element->timers == NULL)
|
|
{
|
|
return false;
|
|
}else
|
|
{
|
|
for (unsigned int i = 0; i < element->timers->num; ++i)
|
|
{
|
|
Timer *timer = (Timer*)element->timers->arr[i];
|
|
|
|
if (selector == timer->getSelector())
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
return false; // should never get here
|
|
}
|
|
|
|
void Scheduler::removeUpdateFromHash(struct _listEntry *entry)
|
|
{
|
|
tHashUpdateEntry *element = NULL;
|
|
|
|
HASH_FIND_INT(_hashForUpdates, &entry->target, element);
|
|
if (element)
|
|
{
|
|
// list entry
|
|
DL_DELETE(*element->list, element->entry);
|
|
free(element->entry);
|
|
|
|
// hash entry
|
|
Object* target = element->target;
|
|
HASH_DEL(_hashForUpdates, element);
|
|
free(element);
|
|
|
|
// target#release should be the last one to prevent
|
|
// a possible double-free. eg: If the [target dealloc] might want to remove it itself from there
|
|
target->release();
|
|
}
|
|
}
|
|
|
|
void Scheduler::unscheduleUpdateForTarget(const Object *target)
|
|
{
|
|
if (target == NULL)
|
|
{
|
|
return;
|
|
}
|
|
|
|
tHashUpdateEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForUpdates, &target, element);
|
|
if (element)
|
|
{
|
|
if (_updateHashLocked)
|
|
{
|
|
element->entry->markedForDeletion = true;
|
|
}
|
|
else
|
|
{
|
|
this->removeUpdateFromHash(element->entry);
|
|
}
|
|
}
|
|
}
|
|
|
|
void Scheduler::unscheduleAll(void)
|
|
{
|
|
unscheduleAllWithMinPriority(kPrioritySystem);
|
|
}
|
|
|
|
void Scheduler::unscheduleAllWithMinPriority(int nMinPriority)
|
|
{
|
|
// Custom Selectors
|
|
tHashTimerEntry *element = NULL;
|
|
tHashTimerEntry *pNextElement = NULL;
|
|
for (element = _hashForTimers; element != NULL;)
|
|
{
|
|
// element may be removed in unscheduleAllSelectorsForTarget
|
|
pNextElement = (tHashTimerEntry *)element->hh.next;
|
|
unscheduleAllForTarget(element->target);
|
|
|
|
element = pNextElement;
|
|
}
|
|
|
|
// Updates selectors
|
|
tListEntry *pEntry, *pTmp;
|
|
if(nMinPriority < 0)
|
|
{
|
|
DL_FOREACH_SAFE(_updatesNegList, pEntry, pTmp)
|
|
{
|
|
if(pEntry->priority >= nMinPriority)
|
|
{
|
|
unscheduleUpdateForTarget(pEntry->target);
|
|
}
|
|
}
|
|
}
|
|
|
|
if(nMinPriority <= 0)
|
|
{
|
|
DL_FOREACH_SAFE(_updates0List, pEntry, pTmp)
|
|
{
|
|
unscheduleUpdateForTarget(pEntry->target);
|
|
}
|
|
}
|
|
|
|
DL_FOREACH_SAFE(_updatesPosList, pEntry, pTmp)
|
|
{
|
|
if(pEntry->priority >= nMinPriority)
|
|
{
|
|
unscheduleUpdateForTarget(pEntry->target);
|
|
}
|
|
}
|
|
|
|
if (_scriptHandlerEntries)
|
|
{
|
|
_scriptHandlerEntries->removeAllObjects();
|
|
}
|
|
}
|
|
|
|
void Scheduler::unscheduleAllForTarget(Object *target)
|
|
{
|
|
// explicit NULL handling
|
|
if (target == NULL)
|
|
{
|
|
return;
|
|
}
|
|
|
|
// Custom Selectors
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
|
|
if (element)
|
|
{
|
|
if (ccArrayContainsObject(element->timers, element->currentTimer)
|
|
&& (! element->currentTimerSalvaged))
|
|
{
|
|
element->currentTimer->retain();
|
|
element->currentTimerSalvaged = true;
|
|
}
|
|
ccArrayRemoveAllObjects(element->timers);
|
|
|
|
if (_currentTarget == element)
|
|
{
|
|
_currentTargetSalvaged = true;
|
|
}
|
|
else
|
|
{
|
|
removeHashElement(element);
|
|
}
|
|
}
|
|
|
|
// update selector
|
|
unscheduleUpdateForTarget(target);
|
|
}
|
|
|
|
unsigned int Scheduler::scheduleScriptFunc(unsigned int handler, float interval, bool paused)
|
|
{
|
|
SchedulerScriptHandlerEntry* pEntry = SchedulerScriptHandlerEntry::create(handler, interval, paused);
|
|
if (!_scriptHandlerEntries)
|
|
{
|
|
_scriptHandlerEntries = Array::createWithCapacity(20);
|
|
_scriptHandlerEntries->retain();
|
|
}
|
|
_scriptHandlerEntries->addObject(pEntry);
|
|
return pEntry->getEntryId();
|
|
}
|
|
|
|
void Scheduler::unscheduleScriptEntry(unsigned int uScheduleScriptEntryID)
|
|
{
|
|
for (int i = _scriptHandlerEntries->count() - 1; i >= 0; i--)
|
|
{
|
|
SchedulerScriptHandlerEntry* pEntry = static_cast<SchedulerScriptHandlerEntry*>(_scriptHandlerEntries->objectAtIndex(i));
|
|
if (pEntry->getEntryId() == (int)uScheduleScriptEntryID)
|
|
{
|
|
pEntry->markedForDeletion();
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
void Scheduler::resumeTarget(Object *target)
|
|
{
|
|
CCAssert(target != NULL, "");
|
|
|
|
// custom selectors
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
if (element)
|
|
{
|
|
element->paused = false;
|
|
}
|
|
|
|
// update selector
|
|
tHashUpdateEntry *elementUpdate = NULL;
|
|
HASH_FIND_INT(_hashForUpdates, &target, elementUpdate);
|
|
if (elementUpdate)
|
|
{
|
|
CCAssert(elementUpdate->entry != NULL, "");
|
|
elementUpdate->entry->paused = false;
|
|
}
|
|
}
|
|
|
|
void Scheduler::pauseTarget(Object *target)
|
|
{
|
|
CCAssert(target != NULL, "");
|
|
|
|
// custom selectors
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
if (element)
|
|
{
|
|
element->paused = true;
|
|
}
|
|
|
|
// update selector
|
|
tHashUpdateEntry *elementUpdate = NULL;
|
|
HASH_FIND_INT(_hashForUpdates, &target, elementUpdate);
|
|
if (elementUpdate)
|
|
{
|
|
CCAssert(elementUpdate->entry != NULL, "");
|
|
elementUpdate->entry->paused = true;
|
|
}
|
|
}
|
|
|
|
bool Scheduler::isTargetPaused(Object *target)
|
|
{
|
|
CCAssert( target != NULL, "target must be non nil" );
|
|
|
|
// Custom selectors
|
|
tHashTimerEntry *element = NULL;
|
|
HASH_FIND_INT(_hashForTimers, &target, element);
|
|
if( element )
|
|
{
|
|
return element->paused;
|
|
}
|
|
|
|
// We should check update selectors if target does not have custom selectors
|
|
tHashUpdateEntry *elementUpdate = NULL;
|
|
HASH_FIND_INT(_hashForUpdates, &target, elementUpdate);
|
|
if ( elementUpdate )
|
|
{
|
|
return elementUpdate->entry->paused;
|
|
}
|
|
|
|
return false; // should never get here
|
|
}
|
|
|
|
Set* Scheduler::pauseAllTargets()
|
|
{
|
|
return pauseAllTargetsWithMinPriority(kPrioritySystem);
|
|
}
|
|
|
|
Set* Scheduler::pauseAllTargetsWithMinPriority(int nMinPriority)
|
|
{
|
|
Set* idsWithSelectors = new Set();// setWithCapacity:50];
|
|
idsWithSelectors->autorelease();
|
|
|
|
// Custom Selectors
|
|
for(tHashTimerEntry *element = _hashForTimers; element != NULL;
|
|
element = (tHashTimerEntry*)element->hh.next)
|
|
{
|
|
element->paused = true;
|
|
idsWithSelectors->addObject(element->target);
|
|
}
|
|
|
|
// Updates selectors
|
|
tListEntry *entry, *tmp;
|
|
if(nMinPriority < 0)
|
|
{
|
|
DL_FOREACH_SAFE( _updatesNegList, entry, tmp )
|
|
{
|
|
if(entry->priority >= nMinPriority)
|
|
{
|
|
entry->paused = true;
|
|
idsWithSelectors->addObject(entry->target);
|
|
}
|
|
}
|
|
}
|
|
|
|
if(nMinPriority <= 0)
|
|
{
|
|
DL_FOREACH_SAFE( _updates0List, entry, tmp )
|
|
{
|
|
entry->paused = true;
|
|
idsWithSelectors->addObject(entry->target);
|
|
}
|
|
}
|
|
|
|
DL_FOREACH_SAFE( _updatesPosList, entry, tmp )
|
|
{
|
|
if(entry->priority >= nMinPriority)
|
|
{
|
|
entry->paused = true;
|
|
idsWithSelectors->addObject(entry->target);
|
|
}
|
|
}
|
|
|
|
return idsWithSelectors;
|
|
}
|
|
|
|
void Scheduler::resumeTargets(Set* targetsToResume)
|
|
{
|
|
SetIterator iter;
|
|
for (iter = targetsToResume->begin(); iter != targetsToResume->end(); ++iter)
|
|
{
|
|
resumeTarget(*iter);
|
|
}
|
|
}
|
|
|
|
// main loop
|
|
void Scheduler::update(float dt)
|
|
{
|
|
_updateHashLocked = true;
|
|
|
|
if (_timeScale != 1.0f)
|
|
{
|
|
dt *= _timeScale;
|
|
}
|
|
|
|
// Iterate over all the Updates' selectors
|
|
tListEntry *pEntry, *pTmp;
|
|
|
|
// updates with priority < 0
|
|
DL_FOREACH_SAFE(_updatesNegList, pEntry, pTmp)
|
|
{
|
|
if ((! pEntry->paused) && (! pEntry->markedForDeletion))
|
|
{
|
|
pEntry->target->update(dt);
|
|
}
|
|
}
|
|
|
|
// updates with priority == 0
|
|
DL_FOREACH_SAFE(_updates0List, pEntry, pTmp)
|
|
{
|
|
if ((! pEntry->paused) && (! pEntry->markedForDeletion))
|
|
{
|
|
pEntry->target->update(dt);
|
|
}
|
|
}
|
|
|
|
// updates with priority > 0
|
|
DL_FOREACH_SAFE(_updatesPosList, pEntry, pTmp)
|
|
{
|
|
if ((! pEntry->paused) && (! pEntry->markedForDeletion))
|
|
{
|
|
pEntry->target->update(dt);
|
|
}
|
|
}
|
|
|
|
// Iterate over all the custom selectors
|
|
for (tHashTimerEntry *elt = _hashForTimers; elt != NULL; )
|
|
{
|
|
_currentTarget = elt;
|
|
_currentTargetSalvaged = false;
|
|
|
|
if (! _currentTarget->paused)
|
|
{
|
|
// The 'timers' array may change while inside this loop
|
|
for (elt->timerIndex = 0; elt->timerIndex < elt->timers->num; ++(elt->timerIndex))
|
|
{
|
|
elt->currentTimer = (Timer*)(elt->timers->arr[elt->timerIndex]);
|
|
elt->currentTimerSalvaged = false;
|
|
|
|
elt->currentTimer->update(dt);
|
|
|
|
if (elt->currentTimerSalvaged)
|
|
{
|
|
// The currentTimer told the remove itself. To prevent the timer from
|
|
// accidentally deallocating itself before finishing its step, we retained
|
|
// it. Now that step is done, it's safe to release it.
|
|
elt->currentTimer->release();
|
|
}
|
|
|
|
elt->currentTimer = NULL;
|
|
}
|
|
}
|
|
|
|
// elt, at this moment, is still valid
|
|
// so it is safe to ask this here (issue #490)
|
|
elt = (tHashTimerEntry *)elt->hh.next;
|
|
|
|
// only delete currentTarget if no actions were scheduled during the cycle (issue #481)
|
|
if (_currentTargetSalvaged && _currentTarget->timers->num == 0)
|
|
{
|
|
removeHashElement(_currentTarget);
|
|
}
|
|
}
|
|
|
|
// Iterate over all the script callbacks
|
|
if (_scriptHandlerEntries)
|
|
{
|
|
for (int i = _scriptHandlerEntries->count() - 1; i >= 0; i--)
|
|
{
|
|
SchedulerScriptHandlerEntry* pEntry = static_cast<SchedulerScriptHandlerEntry*>(_scriptHandlerEntries->objectAtIndex(i));
|
|
if (pEntry->isMarkedForDeletion())
|
|
{
|
|
_scriptHandlerEntries->removeObjectAtIndex(i);
|
|
}
|
|
else if (!pEntry->isPaused())
|
|
{
|
|
pEntry->getTimer()->update(dt);
|
|
}
|
|
}
|
|
}
|
|
|
|
// delete all updates that are marked for deletion
|
|
// updates with priority < 0
|
|
DL_FOREACH_SAFE(_updatesNegList, pEntry, pTmp)
|
|
{
|
|
if (pEntry->markedForDeletion)
|
|
{
|
|
this->removeUpdateFromHash(pEntry);
|
|
}
|
|
}
|
|
|
|
// updates with priority == 0
|
|
DL_FOREACH_SAFE(_updates0List, pEntry, pTmp)
|
|
{
|
|
if (pEntry->markedForDeletion)
|
|
{
|
|
this->removeUpdateFromHash(pEntry);
|
|
}
|
|
}
|
|
|
|
// updates with priority > 0
|
|
DL_FOREACH_SAFE(_updatesPosList, pEntry, pTmp)
|
|
{
|
|
if (pEntry->markedForDeletion)
|
|
{
|
|
this->removeUpdateFromHash(pEntry);
|
|
}
|
|
}
|
|
|
|
_updateHashLocked = false;
|
|
|
|
_currentTarget = NULL;
|
|
}
|
|
|
|
|
|
NS_CC_END
|