mirror of
https://github.com/dashr9230/SA-MP.git
synced 2025-07-19 01:48:56 +08:00
108 lines
2.8 KiB
C++
108 lines
2.8 KiB
C++
/// \file
|
|
///
|
|
/// This file is part of RakNet Copyright 2003 Kevin Jenkins.
|
|
///
|
|
/// Usage of RakNet is subject to the appropriate license agreement.
|
|
/// Creative Commons Licensees are subject to the
|
|
/// license found at
|
|
/// http://creativecommons.org/licenses/by-nc/2.5/
|
|
/// Single application licensees are subject to the license found at
|
|
/// http://www.rakkarsoft.com/SingleApplicationLicense.html
|
|
/// Custom license users are subject to the terms therein.
|
|
/// GPL license users are subject to the GNU General Public
|
|
/// License as published by the Free
|
|
/// Software Foundation; either version 2 of the License, or (at your
|
|
/// option) any later version.
|
|
|
|
#include "RPCMap.h"
|
|
#include <string.h>
|
|
|
|
RPCMap::RPCMap()
|
|
{
|
|
}
|
|
RPCMap::~RPCMap()
|
|
{
|
|
Clear();
|
|
}
|
|
void RPCMap::Clear(void)
|
|
{
|
|
unsigned i;
|
|
RPCNode *node;
|
|
for (i=0; i < rpcSet.Size(); i++)
|
|
{
|
|
node=rpcSet[i];
|
|
if (node)
|
|
{
|
|
delete [] node->uniqueIdentifier;
|
|
delete node;
|
|
}
|
|
}
|
|
rpcSet.Clear();
|
|
}
|
|
RPCNode *RPCMap::GetNodeFromIndex(RPCIndex index)
|
|
{
|
|
if ((unsigned)index < rpcSet.Size())
|
|
return rpcSet[(unsigned)index];
|
|
return 0;
|
|
}
|
|
RPCNode *RPCMap::GetNodeFromFunctionName(char *uniqueIdentifier)
|
|
{
|
|
unsigned index;
|
|
index=(unsigned)GetIndexFromFunctionName(uniqueIdentifier);
|
|
if ((RPCIndex)index!=UNDEFINED_RPC_INDEX)
|
|
return rpcSet[index];
|
|
return 0;
|
|
}
|
|
RPCIndex RPCMap::GetIndexFromFunctionName(char *uniqueIdentifier)
|
|
{
|
|
unsigned index;
|
|
for (index=0; index < rpcSet.Size(); index++)
|
|
if (rpcSet[index] && strcmp(rpcSet[index]->uniqueIdentifier, uniqueIdentifier)==0)
|
|
return (RPCIndex) index;
|
|
return UNDEFINED_RPC_INDEX;
|
|
}
|
|
|
|
// Called from the user thread for the local system
|
|
void RPCMap::AddIdentifierWithFunction(char *uniqueIdentifier, void *functionPointer, bool isPointerToMember)
|
|
{
|
|
#ifdef _DEBUG
|
|
assert(rpcSet.Size()+1 < MAX_RPC_MAP_SIZE); // If this hits change the typedef of RPCIndex to use an unsigned short
|
|
assert(uniqueIdentifier && uniqueIdentifier[0]);
|
|
assert(functionPointer);
|
|
#endif
|
|
|
|
unsigned index, existingNodeIndex;
|
|
RPCNode *node;
|
|
|
|
existingNodeIndex=GetIndexFromFunctionName(uniqueIdentifier);
|
|
if ((RPCIndex)existingNodeIndex!=UNDEFINED_RPC_INDEX) // Insert at any free spot.
|
|
{
|
|
// Trying to insert an identifier at any free slot and that identifier already exists
|
|
// The user should not insert nodes that already exist in the list
|
|
#ifdef _DEBUG
|
|
// assert(0);
|
|
#endif
|
|
return;
|
|
}
|
|
|
|
node = new RPCNode;
|
|
node->uniqueIdentifier = new char [strlen(uniqueIdentifier)+1];
|
|
strcpy(node->uniqueIdentifier, uniqueIdentifier);
|
|
node->functionPointer=functionPointer;
|
|
node->isPointerToMember=isPointerToMember;
|
|
|
|
// Insert into an empty spot if possible
|
|
for (index=0; index < rpcSet.Size(); index++)
|
|
{
|
|
if (rpcSet[index]==0)
|
|
{
|
|
rpcSet.Replace(node, 0, index);
|
|
return;
|
|
}
|
|
}
|
|
|
|
rpcSet.Insert(node); // No empty spots available so just add to the end of the list
|
|
|
|
}
|
|
|