mirror of
https://github.com/ZDoom/Raze.git
synced 2024-12-15 15:11:41 +00:00
612 lines
16 KiB
C++
612 lines
16 KiB
C++
|
//-------------------------------------------------------------------------
|
|||
|
/*
|
|||
|
Copyright (C) 2010-2019 EDuke32 developers and contributors
|
|||
|
Copyright (C) 2019 Nuke.YKT
|
|||
|
|
|||
|
This file is part of NBlood.
|
|||
|
|
|||
|
NBlood is free software; you can redistribute it and/or
|
|||
|
modify it under the terms of the GNU General Public License version 2
|
|||
|
as published by the Free Software Foundation.
|
|||
|
|
|||
|
This program is distributed in the hope that it will be useful,
|
|||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|||
|
|
|||
|
See the GNU General Public License for more details.
|
|||
|
|
|||
|
You should have received a copy of the GNU General Public License
|
|||
|
along with this program; if not, write to the Free Software
|
|||
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|||
|
*/
|
|||
|
//-------------------------------------------------------------------------
|
|||
|
#include <stdio.h>
|
|||
|
#include <stdlib.h>
|
|||
|
#include <string.h>
|
|||
|
#include "build.h"
|
|||
|
#include "common_game.h"
|
|||
|
|
|||
|
#include "callback.h"
|
|||
|
#include "db.h"
|
|||
|
#include "eventq.h"
|
|||
|
#include "globals.h"
|
|||
|
#include "loadsave.h"
|
|||
|
#include "pqueue.h"
|
|||
|
#include "triggers.h"
|
|||
|
|
|||
|
class EventQueue
|
|||
|
{
|
|||
|
public:
|
|||
|
PriorityQueue* PQueue;
|
|||
|
EventQueue()
|
|||
|
{
|
|||
|
PQueue = NULL;
|
|||
|
}
|
|||
|
bool IsNotEmpty(unsigned int nTime)
|
|||
|
{
|
|||
|
return PQueue->Size() > 0 && nTime >= PQueue->LowestPriority();
|
|||
|
}
|
|||
|
EVENT ERemove(void)
|
|||
|
{
|
|||
|
unsigned int node = PQueue->Remove();
|
|||
|
return *(EVENT*)&node;
|
|||
|
}
|
|||
|
void Kill(int, int);
|
|||
|
void Kill(int, int, CALLBACK_ID);
|
|||
|
};
|
|||
|
|
|||
|
EventQueue eventQ;
|
|||
|
void EventQueue::Kill(int a1, int a2)
|
|||
|
{
|
|||
|
EVENT evn = { (unsigned int)a1, (unsigned int)a2, 0, 0 };
|
|||
|
//evn.at0_0 = a1;
|
|||
|
//evn.at1_5 = a2;
|
|||
|
|
|||
|
short vs = *(short*)&evn;
|
|||
|
PQueue->Kill([=](unsigned int nItem)->bool {return !memcmp(&nItem, &vs, 2); });
|
|||
|
}
|
|||
|
|
|||
|
void EventQueue::Kill(int a1, int a2, CALLBACK_ID a3)
|
|||
|
{
|
|||
|
EVENT evn = { (unsigned int)a1, (unsigned int)a2, kCommandCallback, (unsigned int)a3 };
|
|||
|
unsigned int vc = *(unsigned int*)&evn;
|
|||
|
PQueue->Kill([=](unsigned int nItem)->bool {return nItem == vc; });
|
|||
|
}
|
|||
|
|
|||
|
//struct RXBUCKET
|
|||
|
//{
|
|||
|
// unsigned int at0_0 : 13;
|
|||
|
// unsigned int at1_5 : 3;
|
|||
|
//};
|
|||
|
|
|||
|
RXBUCKET rxBucket[kMaxChannels+1];
|
|||
|
|
|||
|
int GetBucketChannel(const RXBUCKET *pRX)
|
|||
|
{
|
|||
|
switch (pRX->type)
|
|||
|
{
|
|||
|
case 6:
|
|||
|
{
|
|||
|
int nIndex = pRX->index;
|
|||
|
int nXIndex = sector[nIndex].extra;
|
|||
|
dassert(nXIndex > 0);
|
|||
|
return xsector[nXIndex].rxID;
|
|||
|
}
|
|||
|
case 0:
|
|||
|
{
|
|||
|
int nIndex = pRX->index;
|
|||
|
int nXIndex = wall[nIndex].extra;
|
|||
|
dassert(nXIndex > 0);
|
|||
|
return xwall[nXIndex].rxID;
|
|||
|
}
|
|||
|
case 3:
|
|||
|
{
|
|||
|
int nIndex = pRX->index;
|
|||
|
int nXIndex = sprite[nIndex].extra;
|
|||
|
dassert(nXIndex > 0);
|
|||
|
return xsprite[nXIndex].rxID;
|
|||
|
}
|
|||
|
default:
|
|||
|
ThrowError("Unexpected rxBucket type %d, index %d", pRX->type, pRX->index);
|
|||
|
break;
|
|||
|
}
|
|||
|
return 0;
|
|||
|
}
|
|||
|
|
|||
|
#if 0
|
|||
|
int CompareChannels(const void *a, const void *b)
|
|||
|
{
|
|||
|
return GetBucketChannel((const RXBUCKET*)a)-GetBucketChannel((const RXBUCKET*)b);
|
|||
|
}
|
|||
|
#else
|
|||
|
static int CompareChannels(RXBUCKET *a, RXBUCKET *b)
|
|||
|
{
|
|||
|
return GetBucketChannel(a) - GetBucketChannel(b);
|
|||
|
}
|
|||
|
#endif
|
|||
|
|
|||
|
static RXBUCKET *SortGetMiddle(RXBUCKET *a1, RXBUCKET *a2, RXBUCKET *a3)
|
|||
|
{
|
|||
|
if (CompareChannels(a1, a2) > 0)
|
|||
|
{
|
|||
|
if (CompareChannels(a1, a3) > 0)
|
|||
|
{
|
|||
|
if (CompareChannels(a2, a3) > 0)
|
|||
|
return a2;
|
|||
|
return a3;
|
|||
|
}
|
|||
|
return a1;
|
|||
|
}
|
|||
|
else
|
|||
|
{
|
|||
|
if (CompareChannels(a1, a3) < 0)
|
|||
|
{
|
|||
|
if (CompareChannels(a2, a3) > 0)
|
|||
|
return a3;
|
|||
|
return a2;
|
|||
|
}
|
|||
|
return a1;
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
static void SortSwap(RXBUCKET *a, RXBUCKET *b)
|
|||
|
{
|
|||
|
RXBUCKET t = *a;
|
|||
|
*a = *b;
|
|||
|
*b = t;
|
|||
|
}
|
|||
|
|
|||
|
static void SortRXBucket(int nCount)
|
|||
|
{
|
|||
|
RXBUCKET *v144[32];
|
|||
|
int vc4[32];
|
|||
|
int v14 = 0;
|
|||
|
RXBUCKET *pArray = rxBucket;
|
|||
|
while (true)
|
|||
|
{
|
|||
|
while (nCount > 1)
|
|||
|
{
|
|||
|
if (nCount < 16)
|
|||
|
{
|
|||
|
for (int nDist = 3; nDist > 0; nDist -= 2)
|
|||
|
{
|
|||
|
for (RXBUCKET *pI = pArray+nDist; pI < pArray+nCount; pI += nDist)
|
|||
|
{
|
|||
|
for (RXBUCKET *pJ = pI; pJ > pArray && CompareChannels(pJ-nDist, pJ) > 0; pJ -= nDist)
|
|||
|
{
|
|||
|
SortSwap(pJ, pJ-nDist);
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
break;
|
|||
|
}
|
|||
|
RXBUCKET *v30, *vdi, *vsi;
|
|||
|
vdi = pArray + nCount / 2;
|
|||
|
if (nCount > 29)
|
|||
|
{
|
|||
|
v30 = pArray;
|
|||
|
vsi = pArray + nCount-1;
|
|||
|
if (nCount > 42)
|
|||
|
{
|
|||
|
int v20 = nCount / 8;
|
|||
|
v30 = SortGetMiddle(v30, v30+v20, v30+v20*2);
|
|||
|
vdi = SortGetMiddle(vdi-v20, vdi, vdi+v20);
|
|||
|
vsi = SortGetMiddle(vsi-v20*2, vsi-v20, vsi);
|
|||
|
}
|
|||
|
vdi = SortGetMiddle(v30, vdi, vsi);
|
|||
|
}
|
|||
|
RXBUCKET v44 = *vdi;
|
|||
|
RXBUCKET *vc = pArray;
|
|||
|
RXBUCKET *v8 = pArray+nCount-1;
|
|||
|
RXBUCKET *vbx = vc;
|
|||
|
RXBUCKET *v4 = v8;
|
|||
|
while (true)
|
|||
|
{
|
|||
|
while (vbx <= v4)
|
|||
|
{
|
|||
|
int nCmp = CompareChannels(vbx, &v44);
|
|||
|
if (nCmp > 0)
|
|||
|
break;
|
|||
|
if (nCmp == 0)
|
|||
|
{
|
|||
|
SortSwap(vbx, vc);
|
|||
|
vc++;
|
|||
|
}
|
|||
|
vbx++;
|
|||
|
}
|
|||
|
while (vbx <= v4)
|
|||
|
{
|
|||
|
int nCmp = CompareChannels(v4, &v44);
|
|||
|
if (nCmp < 0)
|
|||
|
break;
|
|||
|
if (nCmp == 0)
|
|||
|
{
|
|||
|
SortSwap(v4, v8);
|
|||
|
v8--;
|
|||
|
}
|
|||
|
v4--;
|
|||
|
}
|
|||
|
if (vbx > v4)
|
|||
|
break;
|
|||
|
SortSwap(vbx, v4);
|
|||
|
v4--;
|
|||
|
vbx++;
|
|||
|
}
|
|||
|
RXBUCKET *v2c = pArray+nCount;
|
|||
|
int vt = ClipHigh(vbx-vc, vc-pArray);
|
|||
|
for (int i = 0; i < vt; i++)
|
|||
|
{
|
|||
|
SortSwap(&vbx[i-vt], &pArray[i]);
|
|||
|
}
|
|||
|
vt = ClipHigh(v8-v4, v2c-v8-1);
|
|||
|
for (int i = 0; i < vt; i++)
|
|||
|
{
|
|||
|
SortSwap(&v2c[i-vt], &vbx[i]);
|
|||
|
}
|
|||
|
int vvsi = v8-v4;
|
|||
|
int vvdi = vbx-vc;
|
|||
|
if (vvsi >= vvdi)
|
|||
|
{
|
|||
|
vc4[v14] = vvsi;
|
|||
|
v144[v14] = v2c-vvsi;
|
|||
|
nCount = vvdi;
|
|||
|
v14++;
|
|||
|
}
|
|||
|
else
|
|||
|
{
|
|||
|
vc4[v14] = vvdi;
|
|||
|
v144[v14] = pArray;
|
|||
|
nCount = vvsi;
|
|||
|
pArray = v2c - vvsi;
|
|||
|
v14++;
|
|||
|
}
|
|||
|
}
|
|||
|
if (v14 == 0)
|
|||
|
return;
|
|||
|
v14--;
|
|||
|
pArray = v144[v14];
|
|||
|
nCount = vc4[v14];
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
unsigned short bucketHead[1024+1];
|
|||
|
|
|||
|
void evInit(void)
|
|||
|
{
|
|||
|
if (eventQ.PQueue)
|
|||
|
delete eventQ.PQueue;
|
|||
|
if (VanillaMode())
|
|||
|
eventQ.PQueue = new VanillaPriorityQueue();
|
|||
|
else
|
|||
|
eventQ.PQueue = new StdPriorityQueue();
|
|||
|
eventQ.PQueue->Clear();
|
|||
|
int nCount = 0;
|
|||
|
for (int i = 0; i < numsectors; i++)
|
|||
|
{
|
|||
|
int nXSector = sector[i].extra;
|
|||
|
if (nXSector >= kMaxXSectors)
|
|||
|
ThrowError("Invalid xsector reference in sector %d", i);
|
|||
|
if (nXSector > 0 && xsector[nXSector].rxID > 0)
|
|||
|
{
|
|||
|
dassert(nCount < kMaxChannels);
|
|||
|
rxBucket[nCount].type = 6;
|
|||
|
rxBucket[nCount].index = i;
|
|||
|
nCount++;
|
|||
|
}
|
|||
|
}
|
|||
|
for (int i = 0; i < numwalls; i++)
|
|||
|
{
|
|||
|
int nXWall = wall[i].extra;
|
|||
|
if (nXWall >= kMaxXWalls)
|
|||
|
ThrowError("Invalid xwall reference in wall %d", i);
|
|||
|
if (nXWall > 0 && xwall[nXWall].rxID > 0)
|
|||
|
{
|
|||
|
dassert(nCount < kMaxChannels);
|
|||
|
rxBucket[nCount].type = 0;
|
|||
|
rxBucket[nCount].index = i;
|
|||
|
nCount++;
|
|||
|
}
|
|||
|
}
|
|||
|
for (int i = 0; i < kMaxSprites; i++)
|
|||
|
{
|
|||
|
if (sprite[i].statnum < kMaxStatus)
|
|||
|
{
|
|||
|
int nXSprite = sprite[i].extra;
|
|||
|
if (nXSprite >= kMaxXSprites)
|
|||
|
ThrowError("Invalid xsprite reference in sprite %d", i);
|
|||
|
if (nXSprite > 0 && xsprite[nXSprite].rxID > 0)
|
|||
|
{
|
|||
|
dassert(nCount < kMaxChannels);
|
|||
|
rxBucket[nCount].type = 3;
|
|||
|
rxBucket[nCount].index = i;
|
|||
|
nCount++;
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
SortRXBucket(nCount);
|
|||
|
int i, j = 0;
|
|||
|
for (i = 0; i < 1024; i++)
|
|||
|
{
|
|||
|
bucketHead[i] = j;
|
|||
|
while(j < nCount && GetBucketChannel(&rxBucket[j]) == i)
|
|||
|
j++;
|
|||
|
}
|
|||
|
bucketHead[i] = j;
|
|||
|
}
|
|||
|
|
|||
|
char evGetSourceState(int nType, int nIndex)
|
|||
|
{
|
|||
|
switch (nType)
|
|||
|
{
|
|||
|
case 6:
|
|||
|
{
|
|||
|
int nXIndex = sector[nIndex].extra;
|
|||
|
dassert(nXIndex > 0 && nXIndex < kMaxXSectors);
|
|||
|
return xsector[nXIndex].state;
|
|||
|
}
|
|||
|
case 0:
|
|||
|
{
|
|||
|
int nXIndex = wall[nIndex].extra;
|
|||
|
dassert(nXIndex > 0 && nXIndex < kMaxXWalls);
|
|||
|
return xwall[nXIndex].state;
|
|||
|
}
|
|||
|
case 3:
|
|||
|
{
|
|||
|
int nXIndex = sprite[nIndex].extra;
|
|||
|
dassert(nXIndex > 0 && nXIndex < kMaxXSprites);
|
|||
|
return xsprite[nXIndex].state;
|
|||
|
}
|
|||
|
}
|
|||
|
return 0;
|
|||
|
}
|
|||
|
|
|||
|
void evSend(int nIndex, int nType, int rxId, COMMAND_ID command)
|
|||
|
{
|
|||
|
if (command == COMMAND_ID_2)
|
|||
|
command = evGetSourceState(nType, nIndex) ? COMMAND_ID_1 : COMMAND_ID_0;
|
|||
|
else if (command == COMMAND_ID_4)
|
|||
|
command = evGetSourceState(nType, nIndex) ? COMMAND_ID_0 : COMMAND_ID_1;
|
|||
|
EVENT evn;
|
|||
|
evn.index = nIndex;
|
|||
|
evn.type = nType;
|
|||
|
evn.cmd = command;
|
|||
|
if (rxId > 0)
|
|||
|
{
|
|||
|
switch (rxId)
|
|||
|
{
|
|||
|
case 7:
|
|||
|
case 10:
|
|||
|
break;
|
|||
|
case 3:
|
|||
|
if (command < COMMAND_ID_64)
|
|||
|
ThrowError("Invalid TextOver command by xobject %d(type %d)", nIndex, nType);
|
|||
|
trTextOver(command-COMMAND_ID_64);
|
|||
|
return;
|
|||
|
case 4:
|
|||
|
levelEndLevel(0);
|
|||
|
return;
|
|||
|
case 5:
|
|||
|
levelEndLevel(1);
|
|||
|
return;
|
|||
|
// By NoOne: finished level and load custom level <20> via numbered command.
|
|||
|
case kGDXChannelEndLevelCustom:
|
|||
|
levelEndLevelCustom(command - 64);
|
|||
|
return;
|
|||
|
case 1:
|
|||
|
if (command < COMMAND_ID_64)
|
|||
|
ThrowError("Invalid SetupSecret command by xobject %d(type %d)", nIndex, nType);
|
|||
|
levelSetupSecret(command - COMMAND_ID_64);
|
|||
|
break;
|
|||
|
case 2:
|
|||
|
if (command < COMMAND_ID_64)
|
|||
|
ThrowError("Invalid Secret command by xobject %d(type %d)", nIndex, nType);
|
|||
|
levelTriggerSecret(command - COMMAND_ID_64);
|
|||
|
break;
|
|||
|
case 90:
|
|||
|
case 91:
|
|||
|
case 92:
|
|||
|
case 93:
|
|||
|
case 94:
|
|||
|
case 95:
|
|||
|
case 96:
|
|||
|
case 97:
|
|||
|
for (int nSprite = headspritestat[4]; nSprite >= 0; nSprite = nextspritestat[nSprite])
|
|||
|
{
|
|||
|
spritetype *pSprite = &sprite[nSprite];
|
|||
|
if (pSprite->hitag&32)
|
|||
|
continue;
|
|||
|
int nXSprite = pSprite->extra;
|
|||
|
if (nXSprite > 0)
|
|||
|
{
|
|||
|
XSPRITE *pXSprite = &xsprite[nXSprite];
|
|||
|
if (pXSprite->rxID == rxId)
|
|||
|
trMessageSprite(nSprite, evn);
|
|||
|
}
|
|||
|
}
|
|||
|
return;
|
|||
|
case 80:
|
|||
|
case 81:
|
|||
|
for (int nSprite = headspritestat[3]; nSprite >= 0; nSprite = nextspritestat[nSprite])
|
|||
|
{
|
|||
|
spritetype *pSprite = &sprite[nSprite];
|
|||
|
if (pSprite->hitag&32)
|
|||
|
continue;
|
|||
|
int nXSprite = pSprite->extra;
|
|||
|
if (nXSprite > 0)
|
|||
|
{
|
|||
|
XSPRITE *pXSprite = &xsprite[nXSprite];
|
|||
|
if (pXSprite->rxID == rxId)
|
|||
|
trMessageSprite(nSprite, evn);
|
|||
|
}
|
|||
|
}
|
|||
|
return;
|
|||
|
}
|
|||
|
}
|
|||
|
for (int i = bucketHead[rxId]; i < bucketHead[rxId+1]; i++)
|
|||
|
{
|
|||
|
if (evn.type != rxBucket[i].type || evn.index != rxBucket[i].index)
|
|||
|
{
|
|||
|
switch (rxBucket[i].type)
|
|||
|
{
|
|||
|
case 6:
|
|||
|
trMessageSector(rxBucket[i].index, evn);
|
|||
|
break;
|
|||
|
case 0:
|
|||
|
trMessageWall(rxBucket[i].index, evn);
|
|||
|
break;
|
|||
|
case 3:
|
|||
|
{
|
|||
|
int nSprite = rxBucket[i].index;
|
|||
|
spritetype *pSprite = &sprite[nSprite];
|
|||
|
if (pSprite->hitag&32)
|
|||
|
continue;
|
|||
|
int nXSprite = pSprite->extra;
|
|||
|
if (nXSprite > 0)
|
|||
|
{
|
|||
|
XSPRITE *pXSprite = &xsprite[nXSprite];
|
|||
|
if (pXSprite->rxID > 0)
|
|||
|
trMessageSprite(nSprite, evn);
|
|||
|
}
|
|||
|
break;
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
void evPost(int nIndex, int nType, unsigned int nDelta, COMMAND_ID command)
|
|||
|
{
|
|||
|
dassert(command != kCommandCallback);
|
|||
|
if (command == COMMAND_ID_2)
|
|||
|
command = evGetSourceState(nType, nIndex) ? COMMAND_ID_1 : COMMAND_ID_0;
|
|||
|
else if (command == COMMAND_ID_4)
|
|||
|
command = evGetSourceState(nType, nIndex) ? COMMAND_ID_0 : COMMAND_ID_1;
|
|||
|
EVENT evn;
|
|||
|
evn.index = nIndex;
|
|||
|
evn.type = nType;
|
|||
|
evn.cmd = command;
|
|||
|
// Inlined?
|
|||
|
eventQ.PQueue->Insert(gFrameClock+nDelta, *(unsigned int*)&evn);
|
|||
|
}
|
|||
|
|
|||
|
void evPost(int nIndex, int nType, unsigned int nDelta, CALLBACK_ID a4)
|
|||
|
{
|
|||
|
EVENT evn;
|
|||
|
evn.index = nIndex;
|
|||
|
evn.type = nType;
|
|||
|
evn.cmd = kCommandCallback;
|
|||
|
evn.funcID = a4;
|
|||
|
eventQ.PQueue->Insert(gFrameClock+nDelta, *(unsigned int*)&evn);
|
|||
|
}
|
|||
|
|
|||
|
void evProcess(unsigned int nTime)
|
|||
|
{
|
|||
|
#if 0
|
|||
|
while (1)
|
|||
|
{
|
|||
|
// Inlined?
|
|||
|
char bDone;
|
|||
|
if (eventQ.fNodeCount > 0 && nTime >= eventQ.queueItems[1])
|
|||
|
bDone = 1;
|
|||
|
else
|
|||
|
bDone = 0;
|
|||
|
if (!bDone)
|
|||
|
break;
|
|||
|
#endif
|
|||
|
while(eventQ.IsNotEmpty(nTime))
|
|||
|
{
|
|||
|
EVENT event = eventQ.ERemove();
|
|||
|
if (event.cmd == kCommandCallback)
|
|||
|
{
|
|||
|
dassert(event.funcID < kCallbackMax);
|
|||
|
dassert(gCallback[event.funcID] != NULL);
|
|||
|
gCallback[event.funcID](event.index);
|
|||
|
}
|
|||
|
else
|
|||
|
{
|
|||
|
switch (event.type)
|
|||
|
{
|
|||
|
case 6:
|
|||
|
trMessageSector(event.index, event);
|
|||
|
break;
|
|||
|
case 0:
|
|||
|
trMessageWall(event.index, event);
|
|||
|
break;
|
|||
|
case 3:
|
|||
|
trMessageSprite(event.index, event);
|
|||
|
break;
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
void evKill(int a1, int a2)
|
|||
|
{
|
|||
|
eventQ.Kill(a1, a2);
|
|||
|
}
|
|||
|
|
|||
|
void evKill(int a1, int a2, CALLBACK_ID a3)
|
|||
|
{
|
|||
|
eventQ.Kill(a1, a2, a3);
|
|||
|
}
|
|||
|
|
|||
|
class EventQLoadSave : public LoadSave
|
|||
|
{
|
|||
|
public:
|
|||
|
virtual void Load();
|
|||
|
virtual void Save();
|
|||
|
};
|
|||
|
|
|||
|
void EventQLoadSave::Load()
|
|||
|
{
|
|||
|
if (eventQ.PQueue)
|
|||
|
delete eventQ.PQueue;
|
|||
|
Read(&eventQ, sizeof(eventQ));
|
|||
|
if (VanillaMode())
|
|||
|
eventQ.PQueue = new VanillaPriorityQueue();
|
|||
|
else
|
|||
|
eventQ.PQueue = new StdPriorityQueue();
|
|||
|
int nEvents;
|
|||
|
Read(&nEvents, sizeof(nEvents));
|
|||
|
for (int i = 0; i < nEvents; i++)
|
|||
|
{
|
|||
|
EVENT event;
|
|||
|
unsigned int eventtime;
|
|||
|
Read(&eventtime, sizeof(eventtime));
|
|||
|
Read(&event, sizeof(event));
|
|||
|
eventQ.PQueue->Insert(eventtime, *(unsigned int*)&event);
|
|||
|
}
|
|||
|
Read(rxBucket, sizeof(rxBucket));
|
|||
|
Read(bucketHead, sizeof(bucketHead));
|
|||
|
}
|
|||
|
|
|||
|
void EventQLoadSave::Save()
|
|||
|
{
|
|||
|
EVENT events[1024];
|
|||
|
unsigned int eventstime[1024];
|
|||
|
Write(&eventQ, sizeof(eventQ));
|
|||
|
int nEvents = eventQ.PQueue->Size();
|
|||
|
Write(&nEvents, sizeof(nEvents));
|
|||
|
for (int i = 0; i < nEvents; i++)
|
|||
|
{
|
|||
|
eventstime[i] = eventQ.PQueue->LowestPriority();
|
|||
|
events[i] = eventQ.ERemove();
|
|||
|
Write(&eventstime[i], sizeof(eventstime[i]));
|
|||
|
Write(&events[i], sizeof(events[i]));
|
|||
|
}
|
|||
|
dassert(eventQ.PQueue->Size() == 0);
|
|||
|
for (int i = 0; i < nEvents; i++)
|
|||
|
{
|
|||
|
eventQ.PQueue->Insert(eventstime[i], *(unsigned int*)&events[i]);
|
|||
|
}
|
|||
|
Write(rxBucket, sizeof(rxBucket));
|
|||
|
Write(bucketHead, sizeof(bucketHead));
|
|||
|
}
|
|||
|
|
|||
|
static EventQLoadSave *myLoadSave;
|
|||
|
|
|||
|
void EventQLoadSaveConstruct(void)
|
|||
|
{
|
|||
|
myLoadSave = new EventQLoadSave();
|
|||
|
}
|