arcattackandClaude Opus 4.8
7b7d465e5e
Clean, self-contained extraction of the BattleTech-specific work from the
reverse-engineering workspace -- engine + game + content + build, with nothing
from Red Planet or the raw archive dumps. Builds green (Win32) and runs the
single-player drive->animate->target->fire->damage->destroy loop out of the box.
Layout:
engine/ MUNGA + MUNGA_L4 shared 2007 engine, carrying our BT render/loader
work (bgfload/L4D3D/L4VIDEO: BSL bit-slice decode, LOD/ground/shadow
models) + image codec; the minimal rp/ headers the audio HAL needs
game/ reconstructed BT logic + surviving-original BT source + fwd shims
+ WinMain launcher
content/ full runtime tree (BTL4.RES, VIDEO/, GAUGE/, AUDIO/, eggs, BTDPL.INI)
docs/ format specs + reconstruction ledgers
reference/ raw Ghidra pseudocode (recon source-of-truth) + decomp exporter
tools/ MP console emulator + map/resource scanners
One top-level CMake builds munga_engine lib + bt410_l4 game lib + btl4.exe.
All paths relativized (186 fwd shims + ~437 CMake abs paths -> repo-relative);
DXSDK is the one external, overridable via -DDXSDK. Verified: builds to a
byte-identical 2.27MB exe and runs combat (TARGET DESTROYED, 0 crashes) against
the bundled content.
Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
108 lines
2.2 KiB
C++
108 lines
2.2 KiB
C++
#pragma once
|
|
|
|
#include "style.h"
|
|
|
|
class MemoryBlockHeader
|
|
{
|
|
public:
|
|
#if defined(USE_SIGNATURE)
|
|
friend int Is_Signature_Bad(const volatile MemoryBlockHeader *p);
|
|
#endif
|
|
|
|
MemoryBlockHeader *nextBlock;
|
|
size_t blockSize;
|
|
|
|
Logical TestInstance();
|
|
};
|
|
|
|
class MemoryBlockBase SIGNATURED
|
|
{
|
|
public:
|
|
Logical TestInstance() { return blockMemory != NULL; }
|
|
|
|
static void UsageReport();
|
|
static void Collapse();
|
|
|
|
protected:
|
|
const char *blockName;
|
|
|
|
MemoryBlockHeader *blockMemory;
|
|
|
|
size_t blockSize, recordSize, deltaSize;
|
|
|
|
Byte *firstHeaderRecord, *freeRecord, *deletedRecord;
|
|
|
|
MemoryBlockBase(size_t rec_size, size_t start, size_t delta, const char* name = NULL);
|
|
~MemoryBlockBase();
|
|
|
|
void *Grow();
|
|
|
|
private:
|
|
static MemoryBlockBase *firstBlock;
|
|
MemoryBlockBase *nextBlock, *previousBlock;
|
|
|
|
static void SortDeletions();
|
|
};
|
|
|
|
class MemoryBlock : public MemoryBlockBase
|
|
{
|
|
public:
|
|
static Logical TestClass();
|
|
|
|
MemoryBlock(size_t rec_size, size_t start, size_t delta, const char *name = NULL)
|
|
: MemoryBlockBase(rec_size, start, delta, name)
|
|
{
|
|
}
|
|
|
|
void *New();
|
|
void Delete(void *Where);
|
|
|
|
void *operator[](size_t Index);
|
|
};
|
|
|
|
template <class T> class MemoryBlockOf : public MemoryBlock
|
|
{
|
|
public:
|
|
MemoryBlockOf(size_t start, size_t delta, const char *name = NULL)
|
|
: MemoryBlock(sizeof(T), start, delta, name)
|
|
{
|
|
}
|
|
|
|
T* New() { return (T*)MemoryBlock::New(); }
|
|
void Delete(void *where) { MemoryBlock::Delete(where); }
|
|
|
|
T* operator[](size_t index) { return (T*)MemoryBlock::operator [](index); }
|
|
};
|
|
|
|
class MemoryStack : public MemoryBlockBase
|
|
{
|
|
public:
|
|
static Logical TestClass();
|
|
|
|
protected:
|
|
Byte *topOfStack;
|
|
|
|
MemoryStack(size_t rec_size, size_t start, size_t delta, const char* name = NULL)
|
|
: MemoryBlockBase(rec_size, start, delta, name)
|
|
{
|
|
topOfStack = NULL;
|
|
}
|
|
|
|
void *Push(const void *What);
|
|
void *Push();
|
|
void *Peek() { return (void*)topOfStack; }
|
|
void Pop();
|
|
};
|
|
|
|
template <class T> class MemoryStackOf : public MemoryStack
|
|
{
|
|
public:
|
|
MemoryStackOf(size_t start, size_t delta, const char *name)
|
|
: MemoryStack(sizeof(T), start, delta, nome)
|
|
{
|
|
}
|
|
|
|
T *Push(const T *what) { return (T*)MemoryStack::Push(what); }
|
|
T *Peek() { return (T*)MemoryStack::Peek(); }
|
|
void Pop() { MemoryStack::Pop(); }
|
|
}; |