diff options
Diffstat (limited to 'reference/game.c')
| -rw-r--r-- | reference/game.c | 500 |
1 files changed, 0 insertions, 500 deletions
diff --git a/reference/game.c b/reference/game.c index 722a5aa..dff762d 100644 --- a/reference/game.c +++ b/reference/game.c @@ -3914,80 +3914,6 @@ void _GLOBAL__I_StaticStringTable(void) return;
}
-
-
-// DWARF original prototype: listnode<TStaticStringTableBlock> *
-// append(list<TStaticStringTableBlock> * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x1000c);
- uVar2 = 0x1000c;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x10008;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
-
-
-// DWARF original prototype: listnode<TDynamicStringTableBlock> *
-// append(list<TDynamicStringTableBlock> * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x8314);
- uVar2 = 0x8314;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x8310;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
void __static_initialization_and_destruction_0(int __initialize_p,int __priority)
{
@@ -50016,205 +49942,6 @@ void _GLOBAL__I_PlayerList(void) return;
}
-// WARNING: Variable defined which should be unmapped: i
-// DWARF original prototype: TPlayerIndexLeafNode * getFreeItem(store<TPlayerIndexLeafNode,100> *
-// this)
-
-TPlayerIndexLeafNode * __thiscall store<>::getFreeItem(store<> *this)
-
-{
- int iVar1;
- listnode<> *plVar2;
- storeitem<> *psVar3;
- storeunit<> *psVar4;
- int iVar5;
- int local_1c;
- storeunit<> *local_18;
- int local_14;
- int i;
-
- psVar3 = this->firstFreeItem;
- if (psVar3 == (storeitem<> *)0x0) {
- plVar2 = list<>::append(this->Units);
- local_14 = 0;
- local_1c = 0;
- iVar5 = 0;
- do {
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- local_18 = (storeunit<> *)0x0;
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- local_18 = &plVar2->data;
- psVar4 = &plVar2->data;
- }
- iVar1 = local_1c + 0x170;
- local_1c = local_1c + 0x170;
- *(int *)((int)local_18->item + iVar5) = (int)psVar4->item + iVar1;
- local_14 = local_14 + 1;
- iVar5 = iVar5 + 0x170;
- } while (local_14 < 99);
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- psVar4 = &plVar2->data;
- }
- psVar4->item[99].next = (storeitem<> *)0x0;
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar3 = (storeitem<> *)0x0;
- }
- else {
- psVar3 = (plVar2->data).item;
- }
- this->firstFreeItem = psVar3;
- }
- this->firstFreeItem = psVar3->next;
- return (TPlayerIndexLeafNode *)psVar3;
-}
-
-
-
-// DWARF original prototype: TPlayerIndexInternalNode *
-// getFreeItem(store<TPlayerIndexInternalNode,100> * this)
-
-TPlayerIndexInternalNode * __thiscall store<>::getFreeItem(store<> *this)
-
-{
- int iVar1;
- listnode<> *plVar2;
- storeitem<> *psVar3;
- storeunit<> *psVar4;
- int i;
- int iVar5;
- int local_1c;
- int local_18;
- storeunit<> *local_14;
-
- psVar3 = this->firstFreeItem;
- if (psVar3 == (storeitem<> *)0x0) {
- plVar2 = list<>::append(this->Units);
- local_18 = 0;
- local_1c = 0;
- iVar5 = 0x62;
- do {
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- local_14 = (storeunit<> *)0x0;
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- local_14 = &plVar2->data;
- psVar4 = &plVar2->data;
- }
- iVar1 = local_18 + 0x70;
- local_18 = local_18 + 0x70;
- *(int *)((int)local_14->item + local_1c) = (int)psVar4->item + iVar1;
- local_1c = local_1c + 0x70;
- iVar5 = iVar5 + -1;
- } while (-1 < iVar5);
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- psVar4 = &plVar2->data;
- }
- psVar4->item[99].next = (storeitem<> *)0x0;
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar3 = (storeitem<> *)0x0;
- }
- else {
- psVar3 = (plVar2->data).item;
- }
- this->firstFreeItem = psVar3;
- }
- this->firstFreeItem = psVar3->next;
- return (TPlayerIndexInternalNode *)psVar3;
-}
-
-
-
-// DWARF original prototype: listnode<storeunit<TPlayerIndexLeafNode,_100>_> *
-// append(list<storeunit<TPlayerIndexLeafNode,_100>_> * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x8fc8);
- uVar2 = 0x8fc8;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x8fc4;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
-
-
-// DWARF original prototype: listnode<storeunit<TPlayerIndexInternalNode,_100>_> *
-// append(list<storeunit<TPlayerIndexInternalNode,_100>_> * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x2bc8);
- uVar2 = 0x2bc8;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x2bc4;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
-
-
void __static_initialization_and_destruction_0(int __initialize_p,int __priority)
{
@@ -58292,133 +58019,6 @@ ulong __thiscall TMonster::GetMaster(TMonster *this) return this->Master;
}
-
-
-// DWARF original prototype: TNode * getFreeItem(store<TNode,256> * this)
-
-TNode * __thiscall store<TNode,256>::getFreeItem(store<TNode,256> *this)
-
-{
- listnode<> *plVar1;
- storeitem<TNode> *psVar2;
- storeunit<TNode,256> *psVar3;
- int i;
- int iVar4;
- int iVar5;
- storeunit<TNode,256> *local_14;
-
- psVar2 = this->firstFreeItem;
- if (psVar2 == (storeitem<TNode> *)0x0) {
- plVar1 = list<>::append(this->Units);
- iVar4 = 0;
- do {
- if (plVar1 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- local_14 = (storeunit<TNode,256> *)0x0;
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar3 = (storeunit<TNode,256> *)0x0;
- }
- else {
- local_14 = &plVar1->data;
- psVar3 = &plVar1->data;
- }
- iVar5 = iVar4 + 1;
- local_14->item[iVar4].next = psVar3->item + iVar4 + 1;
- iVar4 = iVar5;
- } while (iVar5 < 0xff);
- if (plVar1 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar3 = (storeunit<TNode,256> *)0x0;
- }
- else {
- psVar3 = &plVar1->data;
- }
- psVar3->item[0xff].next = (storeitem<TNode> *)0x0;
- if (plVar1 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar2 = (storeitem<TNode> *)0x0;
- }
- else {
- psVar2 = (plVar1->data).item;
- }
- this->firstFreeItem = psVar2;
- }
- this->firstFreeItem = psVar2->next;
- return (TNode *)psVar2;
-}
-
-// DWARF original prototype: void remove(list<storeunit<TNode,_256>_> * this,
-// listnode<storeunit<TNode,_256>_> * node)
-
-int __thiscall list<>::remove(list<> *this,char *__filename)
-
-{
- int iVar1;
- int extraout_EAX;
- listnode<> *plVar2;
-
- if (__filename != (char *)0x0) {
- plVar2 = *(listnode<> **)(__filename + 4);
- if (plVar2 == (listnode<> *)0x0) {
- this->firstNode = *(listnode<> **)__filename;
- plVar2 = *(listnode<> **)(__filename + 4);
- }
- else {
- plVar2->next = *(listnode<> **)__filename;
- }
- iVar1 = *(int *)__filename;
- if (iVar1 == 0) {
- this->lastNode = plVar2;
- }
- else {
- *(listnode<> **)(iVar1 + 4) = plVar2;
- }
- operator_delete(__filename);
- return iVar1;
- }
- error("list::remove: node ist NULL.\n");
- return extraout_EAX;
-}
-
-
-
-// DWARF original prototype: listnode<storeunit<TNode,_256>_> * append(list<storeunit<TNode,_256>_>
-// * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x1008);
- uVar2 = 0x1008;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x1004;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
-
-
void __static_initialization_and_destruction_0(int __initialize_p,int __priority)
{
@@ -77129,106 +76729,6 @@ void _GLOBAL__I_TCPSocket(void) return;
}
-
-
-// DWARF original prototype: TWaitinglistEntry * getFreeItem(store<TWaitinglistEntry,100> * this)
-
-TWaitinglistEntry * __thiscall store<>::getFreeItem(store<> *this)
-
-{
- int iVar1;
- listnode<> *plVar2;
- storeitem<> *psVar3;
- storeunit<> *psVar4;
- int i;
- int iVar5;
- int local_1c;
- int local_18;
- storeunit<> *local_14;
-
- psVar3 = this->firstFreeItem;
- if (psVar3 == (storeitem<> *)0x0) {
- plVar2 = list<>::append(this->Units);
- local_18 = 0;
- local_1c = 0;
- iVar5 = 0x62;
- do {
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- local_14 = (storeunit<> *)0x0;
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- local_14 = &plVar2->data;
- psVar4 = &plVar2->data;
- }
- iVar1 = local_18 + 0x2c;
- local_18 = local_18 + 0x2c;
- *(int *)((int)local_14->item + local_1c) = (int)psVar4->item + iVar1;
- local_1c = local_1c + 0x2c;
- iVar5 = iVar5 + -1;
- } while (-1 < iVar5);
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar4 = (storeunit<> *)0x0;
- }
- else {
- psVar4 = &plVar2->data;
- }
- psVar4->item[99].next = (storeitem<> *)0x0;
- if (plVar2 == (listnode<> *)0x0) {
- error("listIterator::operator*: Iterator ist NULL.\n");
- psVar3 = (storeitem<> *)0x0;
- }
- else {
- psVar3 = (plVar2->data).item;
- }
- this->firstFreeItem = psVar3;
- }
- this->firstFreeItem = psVar3->next;
- return (TWaitinglistEntry *)psVar3;
-}
-
-
-
-// DWARF original prototype: listnode<storeunit<TWaitinglistEntry,_100>_> *
-// append(list<storeunit<TWaitinglistEntry,_100>_> * this)
-
-listnode<> * __thiscall list<>::append(list<> *this)
-
-{
- listnode<> *plVar1;
- uint uVar2;
- listnode<> *plVar3;
-
- plVar1 = (listnode<> *)operator_new(0x1138);
- uVar2 = 0x1138;
- plVar3 = plVar1;
- if (((uint)plVar1 & 4) != 0) {
- plVar1->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar1->prev;
- uVar2 = 0x1134;
- }
- for (uVar2 = uVar2 >> 2; uVar2 != 0; uVar2 = uVar2 - 1) {
- plVar3->next = (listnode<> *)0x0;
- plVar3 = (listnode<> *)&plVar3->prev;
- }
- plVar1->prev = (listnode<> *)0x0;
- plVar1->next = (listnode<> *)0x0;
- if (this->firstNode == (listnode<> *)0x0) {
- this->firstNode = plVar1;
- }
- else {
- this->lastNode->next = plVar1;
- plVar1->prev = this->lastNode;
- }
- this->lastNode = plVar1;
- return this->lastNode;
-}
-
-
-
void __static_initialization_and_destruction_0(int __initialize_p,int __priority)
{
|