2019-09-19 22:42:45 +00:00
|
|
|
|
//-------------------------------------------------------------------------
|
|
|
|
|
/*
|
|
|
|
|
Copyright (C) 2010-2019 EDuke32 developers and contributors
|
|
|
|
|
Copyright (C) 2019 Nuke.YKT
|
2020-11-21 14:09:38 +00:00
|
|
|
|
Copyright (C) 2020 Christoph Oelckers
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
This file is part of Raze.
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
Raze is free software; you can redistribute it and/or
|
2019-09-19 22:42:45 +00:00
|
|
|
|
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.
|
|
|
|
|
*/
|
|
|
|
|
//-------------------------------------------------------------------------
|
2019-09-21 18:59:54 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
#include "ns.h"
|
2020-11-08 08:47:32 +00:00
|
|
|
|
#include <set>
|
2019-09-19 22:42:45 +00:00
|
|
|
|
#include "build.h"
|
2020-11-21 14:09:38 +00:00
|
|
|
|
#include "printf.h"
|
2020-12-09 14:56:32 +00:00
|
|
|
|
#include "blood.h"
|
2019-11-12 23:44:33 +00:00
|
|
|
|
#include "secrets.h"
|
2020-11-21 14:09:38 +00:00
|
|
|
|
#include "serializer.h"
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2019-09-22 06:39:22 +00:00
|
|
|
|
BEGIN_BLD_NS
|
|
|
|
|
|
2020-11-08 08:47:32 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
const int kMaxID = 1024;
|
|
|
|
|
RXBUCKET rxBucket[kChannelMax];
|
|
|
|
|
unsigned short bucketHead[kMaxID + 1];
|
|
|
|
|
static int bucketCount;
|
|
|
|
|
static std::multiset<EVENT> queue;
|
2020-11-08 08:47:32 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
2020-11-08 08:47:32 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
static int GetBucketChannel(const RXBUCKET* pBucket)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
int nXIndex;
|
|
|
|
|
switch (pBucket->type)
|
|
|
|
|
{
|
|
|
|
|
case SS_SECTOR:
|
|
|
|
|
nXIndex = sector[pBucket->index].extra;
|
|
|
|
|
assert(nXIndex > 0);
|
|
|
|
|
return xsector[nXIndex].rxID;
|
|
|
|
|
|
|
|
|
|
case SS_WALL:
|
|
|
|
|
nXIndex = wall[pBucket->index].extra;
|
|
|
|
|
assert(nXIndex > 0);
|
|
|
|
|
return xwall[nXIndex].rxID;
|
|
|
|
|
|
|
|
|
|
case SS_SPRITE:
|
|
|
|
|
nXIndex = sprite[pBucket->index].extra;
|
|
|
|
|
assert(nXIndex > 0);
|
|
|
|
|
return xsprite[nXIndex].rxID;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Printf(PRINT_HIGH, "Unexpected rxBucket type %d", pBucket->type);
|
|
|
|
|
return 0;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
static int CompareChannels(const RXBUCKET* ref1, const RXBUCKET* ref2)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
return GetBucketChannel(ref1) - GetBucketChannel(ref2);
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
2020-11-21 14:09:38 +00:00
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
static RXBUCKET* SortGetMiddle(RXBUCKET* a1, RXBUCKET* a2, RXBUCKET* a3)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
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;
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
static void SortSwap(RXBUCKET* a, RXBUCKET* b)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
RXBUCKET t = *a;
|
|
|
|
|
*a = *b;
|
|
|
|
|
*b = t;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
static void SortRXBucket(int nCount)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
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 * middle = pArray + nCount / 2;
|
|
|
|
|
if (nCount > 29)
|
|
|
|
|
{
|
|
|
|
|
RXBUCKET* first = pArray;
|
|
|
|
|
RXBUCKET* last = pArray + nCount - 1;
|
|
|
|
|
if (nCount > 42)
|
|
|
|
|
{
|
|
|
|
|
int eighth = nCount / 8;
|
|
|
|
|
first = SortGetMiddle(first, first + eighth, first + eighth * 2);
|
|
|
|
|
middle = SortGetMiddle(middle - eighth, middle, middle + eighth);
|
|
|
|
|
last = SortGetMiddle(last - eighth * 2, last - eighth, last);
|
|
|
|
|
}
|
|
|
|
|
middle = SortGetMiddle(first, middle, last);
|
|
|
|
|
}
|
|
|
|
|
RXBUCKET pivot = *middle;
|
|
|
|
|
RXBUCKET* first = pArray;
|
|
|
|
|
RXBUCKET* last = pArray + nCount - 1;
|
|
|
|
|
RXBUCKET* vbx = first;
|
|
|
|
|
RXBUCKET* v4 = last;
|
|
|
|
|
while (true)
|
|
|
|
|
{
|
|
|
|
|
while (vbx <= v4)
|
|
|
|
|
{
|
|
|
|
|
int nCmp = CompareChannels(vbx, &pivot);
|
|
|
|
|
if (nCmp > 0)
|
|
|
|
|
break;
|
|
|
|
|
if (nCmp == 0)
|
|
|
|
|
{
|
|
|
|
|
SortSwap(vbx, first);
|
|
|
|
|
first++;
|
|
|
|
|
}
|
|
|
|
|
vbx++;
|
|
|
|
|
}
|
|
|
|
|
while (vbx <= v4)
|
|
|
|
|
{
|
|
|
|
|
int nCmp = CompareChannels(v4, &pivot);
|
|
|
|
|
if (nCmp < 0)
|
|
|
|
|
break;
|
|
|
|
|
if (nCmp == 0)
|
|
|
|
|
{
|
|
|
|
|
SortSwap(v4, last);
|
|
|
|
|
last--;
|
|
|
|
|
}
|
|
|
|
|
v4--;
|
|
|
|
|
}
|
|
|
|
|
if (vbx > v4)
|
|
|
|
|
break;
|
|
|
|
|
SortSwap(vbx, v4);
|
|
|
|
|
v4--;
|
|
|
|
|
vbx++;
|
|
|
|
|
}
|
|
|
|
|
RXBUCKET* v2c = pArray + nCount;
|
|
|
|
|
int vt = ClipHigh(vbx - first, first - pArray);
|
|
|
|
|
for (int i = 0; i < vt; i++)
|
|
|
|
|
{
|
|
|
|
|
SortSwap(&vbx[i - vt], &pArray[i]);
|
|
|
|
|
}
|
|
|
|
|
vt = ClipHigh(last - v4, v2c - last - 1);
|
|
|
|
|
for (int i = 0; i < vt; i++)
|
|
|
|
|
{
|
|
|
|
|
SortSwap(&v2c[i - vt], &vbx[i]);
|
|
|
|
|
}
|
|
|
|
|
int vvsi = last - v4;
|
|
|
|
|
int vvdi = vbx - first;
|
|
|
|
|
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];
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
static void createBucketHeads()
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
int i, j;
|
|
|
|
|
// create the list of header indices
|
|
|
|
|
for (i = 0, j = 0; i < kMaxID; i++)
|
|
|
|
|
{
|
|
|
|
|
bucketHead[i] = (short)j;
|
|
|
|
|
while (j < bucketCount && GetBucketChannel(&rxBucket[j]) == i)
|
|
|
|
|
{
|
|
|
|
|
j++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
bucketHead[i] = (short)j;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
void evInit()
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
int nCount = 0;
|
|
|
|
|
|
|
|
|
|
queue.clear();
|
|
|
|
|
memset(rxBucket, 0, sizeof(rxBucket));
|
|
|
|
|
|
|
|
|
|
// add all the tags to the bucket array
|
|
|
|
|
for (int i = 0; i < numsectors; i++)
|
|
|
|
|
{
|
|
|
|
|
int nXSector = sector[i].extra;
|
|
|
|
|
if (nXSector > 0 && xsector[nXSector].rxID > 0)
|
|
|
|
|
{
|
|
|
|
|
assert(nCount < kChannelMax);
|
|
|
|
|
rxBucket[nCount].type = SS_SECTOR;
|
|
|
|
|
rxBucket[nCount].index = i;
|
|
|
|
|
nCount++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < numwalls; i++)
|
|
|
|
|
{
|
|
|
|
|
int nXWall = wall[i].extra;
|
|
|
|
|
if (nXWall > 0 && xwall[nXWall].rxID > 0)
|
|
|
|
|
{
|
|
|
|
|
assert(nCount < kChannelMax);
|
|
|
|
|
rxBucket[nCount].type = SS_WALL;
|
|
|
|
|
rxBucket[nCount].index = i;
|
|
|
|
|
nCount++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < kMaxSprites; i++)
|
|
|
|
|
{
|
|
|
|
|
if (sprite[i].statnum < kMaxStatus)
|
|
|
|
|
{
|
|
|
|
|
int nXSprite = sprite[i].extra;
|
|
|
|
|
if (nXSprite > 0 && xsprite[nXSprite].rxID > 0)
|
|
|
|
|
{
|
|
|
|
|
assert(nCount < kChannelMax);
|
|
|
|
|
rxBucket[nCount].type = SS_SPRITE;
|
|
|
|
|
rxBucket[nCount].index = i;
|
|
|
|
|
nCount++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
SortRXBucket(nCount);
|
|
|
|
|
bucketCount = nCount;
|
|
|
|
|
createBucketHeads();
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
static bool evGetSourceState(int type, int nIndex)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
int nXIndex;
|
|
|
|
|
|
|
|
|
|
switch (type)
|
|
|
|
|
{
|
|
|
|
|
case SS_SECTOR:
|
|
|
|
|
nXIndex = sector[nIndex].extra;
|
|
|
|
|
assert(nXIndex > 0 && nXIndex < kMaxXSectors);
|
|
|
|
|
return xsector[nXIndex].state != 0;
|
|
|
|
|
|
|
|
|
|
case SS_WALL:
|
|
|
|
|
nXIndex = wall[nIndex].extra;
|
|
|
|
|
assert(nXIndex > 0 && nXIndex < kMaxXWalls);
|
|
|
|
|
return xwall[nXIndex].state != 0;
|
|
|
|
|
|
|
|
|
|
case SS_SPRITE:
|
|
|
|
|
nXIndex = sprite[nIndex].extra;
|
|
|
|
|
assert(nXIndex > 0 && nXIndex < kMaxXSprites);
|
|
|
|
|
return xsprite[nXIndex].state != 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// shouldn't reach this point
|
|
|
|
|
return false;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
2020-01-11 21:07:05 +00:00
|
|
|
|
void evSend(int nIndex, int nType, int rxId, COMMAND_ID command)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
switch (command) {
|
|
|
|
|
case kCmdState:
|
|
|
|
|
command = evGetSourceState(nType, nIndex) ? kCmdOn : kCmdOff;
|
|
|
|
|
break;
|
|
|
|
|
case kCmdNotState:
|
|
|
|
|
command = evGetSourceState(nType, nIndex) ? kCmdOff : kCmdOn;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EVENT event;
|
|
|
|
|
event.index = nIndex;
|
|
|
|
|
event.type = nType;
|
|
|
|
|
event.cmd = command;
|
|
|
|
|
|
|
|
|
|
switch (rxId) {
|
|
|
|
|
case kChannelTextOver:
|
|
|
|
|
if (command >= kCmdNumberic) trTextOver(command - kCmdNumberic);
|
|
|
|
|
else viewSetSystemMessage("Invalid TextOver command by xobject #%d (object type %d)", nIndex, nType);
|
|
|
|
|
return;
|
|
|
|
|
case kChannelLevelExitNormal:
|
|
|
|
|
levelEndLevel(0);
|
|
|
|
|
return;
|
|
|
|
|
case kChannelLevelExitSecret:
|
|
|
|
|
levelEndLevel(1);
|
|
|
|
|
return;
|
|
|
|
|
#ifdef NOONE_EXTENSIONS
|
|
|
|
|
// finished level and load custom level <20> via numbered command.
|
|
|
|
|
case kChannelModernEndLevelCustom:
|
|
|
|
|
if (command >= kCmdNumberic) levelEndLevelCustom(command - kCmdNumberic);
|
|
|
|
|
else viewSetSystemMessage("Invalid Level-Exit# command by xobject #%d (object type %d)", nIndex, nType);
|
|
|
|
|
return;
|
|
|
|
|
#endif
|
|
|
|
|
case kChannelSetTotalSecrets:
|
|
|
|
|
if (command >= kCmdNumberic) levelSetupSecret(command - kCmdNumberic);
|
|
|
|
|
else viewSetSystemMessage("Invalid Total-Secrets command by xobject #%d (object type %d)", nIndex, nType);
|
|
|
|
|
break;
|
|
|
|
|
case kChannelSecretFound:
|
2020-12-01 11:49:24 +00:00
|
|
|
|
if (SECRET_Trigger(nIndex + 65536 * nType)) // if the hint system knows this secret it's a retrigger - skip that.
|
|
|
|
|
{
|
|
|
|
|
if (command >= kCmdNumberic) levelTriggerSecret(command - kCmdNumberic);
|
|
|
|
|
else viewSetSystemMessage("Invalid Trigger-Secret command by xobject #%d (object type %d)", nIndex, nType);
|
|
|
|
|
}
|
2020-11-21 14:09:38 +00:00
|
|
|
|
break;
|
|
|
|
|
case kChannelRemoteBomb0:
|
|
|
|
|
case kChannelRemoteBomb1:
|
|
|
|
|
case kChannelRemoteBomb2:
|
|
|
|
|
case kChannelRemoteBomb3:
|
|
|
|
|
case kChannelRemoteBomb4:
|
|
|
|
|
case kChannelRemoteBomb5:
|
|
|
|
|
case kChannelRemoteBomb6:
|
|
|
|
|
case kChannelRemoteBomb7:
|
|
|
|
|
{
|
|
|
|
|
int nSprite;
|
|
|
|
|
StatIterator it(kStatThing);
|
|
|
|
|
while ((nSprite = it.NextIndex()) >= 0)
|
|
|
|
|
{
|
|
|
|
|
spritetype* pSprite = &sprite[nSprite];
|
|
|
|
|
if (pSprite->flags & 32)
|
|
|
|
|
continue;
|
|
|
|
|
int nXSprite = pSprite->extra;
|
|
|
|
|
if (nXSprite > 0)
|
|
|
|
|
{
|
|
|
|
|
XSPRITE* pXSprite = &xsprite[nXSprite];
|
|
|
|
|
if (pXSprite->rxID == rxId)
|
|
|
|
|
trMessageSprite(nSprite, event);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
case kChannelTeamAFlagCaptured:
|
|
|
|
|
case kChannelTeamBFlagCaptured:
|
|
|
|
|
{
|
|
|
|
|
int nSprite;
|
|
|
|
|
StatIterator it(kStatItem);
|
|
|
|
|
while ((nSprite = it.NextIndex()) >= 0)
|
|
|
|
|
{
|
|
|
|
|
spritetype* pSprite = &sprite[nSprite];
|
|
|
|
|
if (pSprite->flags & 32)
|
|
|
|
|
continue;
|
|
|
|
|
int nXSprite = pSprite->extra;
|
|
|
|
|
if (nXSprite > 0)
|
|
|
|
|
{
|
|
|
|
|
XSPRITE* pXSprite = &xsprite[nXSprite];
|
|
|
|
|
if (pXSprite->rxID == rxId)
|
|
|
|
|
trMessageSprite(nSprite, event);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#ifdef NOONE_EXTENSIONS
|
|
|
|
|
if (gModernMap)
|
|
|
|
|
{
|
|
|
|
|
// allow to send commands on player sprites
|
|
|
|
|
PLAYER* pPlayer = NULL;
|
|
|
|
|
if (playerRXRngIsFine(rxId))
|
|
|
|
|
{
|
|
|
|
|
if ((pPlayer = getPlayerById((kChannelPlayer0 - kChannelPlayer7) + kMaxPlayers)) != nullptr)
|
|
|
|
|
trMessageSprite(pPlayer->nSprite, event);
|
|
|
|
|
}
|
|
|
|
|
else if (rxId == kChannelAllPlayers)
|
|
|
|
|
{
|
|
|
|
|
for (int i = 0; i < kMaxPlayers; i++)
|
|
|
|
|
{
|
|
|
|
|
if ((pPlayer = getPlayerById(i)) != nullptr)
|
|
|
|
|
trMessageSprite(pPlayer->nSprite, event);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
for (int i = bucketHead[rxId]; i < bucketHead[rxId + 1]; i++)
|
|
|
|
|
{
|
|
|
|
|
if (event.type != rxBucket[i].type || event.index != rxBucket[i].index)
|
|
|
|
|
{
|
|
|
|
|
switch (rxBucket[i].type)
|
|
|
|
|
{
|
|
|
|
|
case 6:
|
|
|
|
|
trMessageSector(rxBucket[i].index, event);
|
|
|
|
|
break;
|
|
|
|
|
case 0:
|
|
|
|
|
trMessageWall(rxBucket[i].index, event);
|
|
|
|
|
break;
|
|
|
|
|
case 3:
|
|
|
|
|
{
|
|
|
|
|
int nSprite = rxBucket[i].index;
|
|
|
|
|
spritetype* pSprite = &sprite[nSprite];
|
|
|
|
|
if (pSprite->flags & 32)
|
|
|
|
|
continue;
|
|
|
|
|
int nXSprite = pSprite->extra;
|
|
|
|
|
if (nXSprite > 0)
|
|
|
|
|
{
|
|
|
|
|
XSPRITE* pXSprite = &xsprite[nXSprite];
|
|
|
|
|
if (pXSprite->rxID > 0)
|
|
|
|
|
trMessageSprite(nSprite, event);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
void evPost(int nIndex, int nType, unsigned int nDelta, COMMAND_ID command)
|
|
|
|
|
{
|
|
|
|
|
assert(command != kCmdCallback);
|
|
|
|
|
if (command == kCmdState) command = evGetSourceState(nType, nIndex) ? kCmdOn : kCmdOff;
|
|
|
|
|
else if (command == kCmdNotState) command = evGetSourceState(nType, nIndex) ? kCmdOff : kCmdOn;
|
|
|
|
|
EVENT evn = { (int16_t)nIndex, (int8_t)nType, (int8_t)command, 0, gFrameClock + (int)nDelta };
|
|
|
|
|
queue.insert(evn);
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
void evPost(int nIndex, int nType, unsigned int nDelta, CALLBACK_ID callback)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
EVENT evn = { (int16_t)nIndex, (int8_t)nType, kCmdCallback, (int16_t)callback, gFrameClock + (int)nDelta };
|
|
|
|
|
queue.insert(evn);
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
void evKill(int index, int type)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
for (auto ev = queue.begin(); ev != queue.end();)
|
|
|
|
|
{
|
|
|
|
|
if (ev->index == index && ev->type == type) ev = queue.erase(ev);
|
|
|
|
|
else ev++;
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
void evKill(int index, int type, CALLBACK_ID cb)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
for (auto ev = queue.begin(); ev != queue.end();)
|
|
|
|
|
{
|
|
|
|
|
if (ev->index == index && ev->type == type && ev->funcID == cb) ev = queue.erase(ev);
|
|
|
|
|
else ev++;
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
void evProcess(unsigned int time)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-12-31 14:48:42 +00:00
|
|
|
|
while (queue.size() > 0 && (int)time >= queue.begin()->priority)
|
2020-11-21 14:09:38 +00:00
|
|
|
|
{
|
|
|
|
|
EVENT event = *queue.begin();
|
|
|
|
|
queue.erase(queue.begin());
|
|
|
|
|
|
|
|
|
|
if (event.cmd == kCmdCallback)
|
|
|
|
|
{
|
|
|
|
|
assert(event.funcID < kCallbackMax);
|
|
|
|
|
assert(gCallback[event.funcID] != nullptr);
|
|
|
|
|
gCallback[event.funcID](event.index);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
switch (event.type)
|
|
|
|
|
{
|
|
|
|
|
case SS_SECTOR:
|
|
|
|
|
trMessageSector(event.index, event);
|
|
|
|
|
break;
|
|
|
|
|
case SS_WALL:
|
|
|
|
|
trMessageWall(event.index, event);
|
|
|
|
|
break;
|
|
|
|
|
case SS_SPRITE:
|
|
|
|
|
trMessageSprite(event.index, event);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
FSerializer& Serialize(FSerializer& arc, const char* keyname, EVENT& w, EVENT* def)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
if (arc.BeginObject(keyname))
|
|
|
|
|
{
|
|
|
|
|
arc("index", w.index)
|
|
|
|
|
("type", w.type)
|
|
|
|
|
("command", w.cmd)
|
|
|
|
|
("func", w.funcID)
|
|
|
|
|
("prio", w.priority)
|
|
|
|
|
.EndObject();
|
|
|
|
|
}
|
|
|
|
|
return arc;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
FSerializer& Serialize(FSerializer& arc, const char* keyname, RXBUCKET& w, RXBUCKET* def)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
if (arc.BeginObject(keyname))
|
|
|
|
|
{
|
|
|
|
|
arc("index", w.index)
|
|
|
|
|
("type", w.type)
|
|
|
|
|
.EndObject();
|
|
|
|
|
}
|
|
|
|
|
return arc;
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//
|
|
|
|
|
//---------------------------------------------------------------------------
|
2019-09-19 22:42:45 +00:00
|
|
|
|
|
2020-11-21 14:09:38 +00:00
|
|
|
|
void SerializeEvents(FSerializer& arc)
|
2019-09-19 22:42:45 +00:00
|
|
|
|
{
|
2020-11-21 14:09:38 +00:00
|
|
|
|
if (arc.BeginObject("events"))
|
|
|
|
|
{
|
|
|
|
|
arc("bucketcount", bucketCount)
|
2020-11-27 22:34:36 +00:00
|
|
|
|
.Array("buckets", rxBucket, bucketCount)
|
|
|
|
|
.Array("buckethead", bucketHead, countof(bucketHead));
|
2020-11-21 14:09:38 +00:00
|
|
|
|
|
|
|
|
|
int numEvents = (int)queue.size();
|
|
|
|
|
arc("eventcount", numEvents);
|
|
|
|
|
if (arc.BeginArray("events"))
|
|
|
|
|
{
|
|
|
|
|
if (arc.isReading())
|
|
|
|
|
{
|
|
|
|
|
queue.clear();
|
|
|
|
|
EVENT ev;
|
|
|
|
|
for (int i = 0; i < numEvents; i++)
|
|
|
|
|
{
|
|
|
|
|
arc(nullptr, ev);
|
|
|
|
|
queue.insert(ev);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (auto item : queue)
|
|
|
|
|
{
|
|
|
|
|
arc(nullptr, item);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
arc.EndArray();
|
|
|
|
|
}
|
|
|
|
|
arc.EndObject();
|
|
|
|
|
}
|
2019-09-19 22:42:45 +00:00
|
|
|
|
}
|
2019-09-22 06:39:22 +00:00
|
|
|
|
|
|
|
|
|
END_BLD_NS
|