/* voc 2.1.0 [2025/06/24]. Bootstrapping compiler for address size 8, alignment 8. rtsSF */

#define SHORTINT INT8
#define INTEGER  INT16
#define LONGINT  INT32
#define SET      UINT32

#include "SYSTEM.h"

struct Heap__1 {
	CHAR ch;
	SYSTEM_PTR p;
};

typedef
	struct Heap_CmdDesc *Heap_Cmd;

typedef
	CHAR Heap_CmdName[24];

typedef
	void (*Heap_Command)(void);

typedef
	struct Heap_CmdDesc {
		Heap_Cmd next;
		Heap_CmdName name;
		Heap_Command cmd;
	} Heap_CmdDesc;

typedef
	void (*Heap_EnumProc)(void(*)(SYSTEM_PTR));

typedef
	struct Heap_FinDesc *Heap_FinNode;

typedef
	void (*Heap_Finalizer)(SYSTEM_PTR);

typedef
	struct Heap_FinDesc {
		Heap_FinNode next;
		INT32 obj;
		BOOLEAN marked;
		Heap_Finalizer finalize;
	} Heap_FinDesc;

typedef
	struct Heap_ModuleDesc *Heap_Module;

typedef
	CHAR Heap_ModuleName[20];

typedef
	struct Heap_ModuleDesc {
		Heap_Module next;
		Heap_ModuleName name;
		INT32 refcnt;
		Heap_Cmd cmds;
		INT32 types;
		Heap_EnumProc enumPtrs;
		INT32 reserved1, reserved2;
	} Heap_ModuleDesc;


export SYSTEM_PTR Heap_modules;
static INT32 Heap_freeList[10];
static INT32 Heap_bigBlocks;
export INT32 Heap_allocated;
static BOOLEAN Heap_firstTry;
static INT16 Heap_ldUnit;
export INT32 Heap_heap;
static INT32 Heap_heapMin, Heap_heapMax;
export INT32 Heap_heapsize, Heap_heapMinExpand;
static Heap_FinNode Heap_fin;
static INT16 Heap_lockdepth;
static BOOLEAN Heap_interrupted;
export INT16 Heap_FileCount;

export ADDRESS *Heap_ModuleDesc__typ;
export ADDRESS *Heap_CmdDesc__typ;
export ADDRESS *Heap_FinDesc__typ;
export ADDRESS *Heap__1__typ;

static void Heap_CheckFin (void);
static void Heap_ExtendHeap (INT32 blksz);
export void Heap_FINALL (void);
static void Heap_Finalize (void);
export INT32 Heap_FreeModule (CHAR *name, ADDRESS name__len);
export void Heap_GC (BOOLEAN markStack);
static void Heap_HeapSort (INT32 n, INT32 *a, ADDRESS a__len);
export void Heap_INCREF (Heap_Module m);
export void Heap_InitHeap (void);
export void Heap_Lock (void);
static void Heap_Mark (INT32 q);
static void Heap_MarkCandidates (INT32 n, INT32 *cand, ADDRESS cand__len);
static void Heap_MarkP (SYSTEM_PTR p);
static void Heap_MarkStack (INT32 n, INT32 *cand, ADDRESS cand__len);
export SYSTEM_PTR Heap_NEWBLK (INT32 size);
export SYSTEM_PTR Heap_NEWREC (INT32 tag);
static INT32 Heap_NewChunk (INT32 blksz);
export void Heap_REGCMD (Heap_Module m, Heap_CmdName name, Heap_Command cmd);
export SYSTEM_PTR Heap_REGMOD (Heap_ModuleName name, Heap_EnumProc enumPtrs);
export void Heap_REGTYP (Heap_Module m, INT32 typ);
export void Heap_RegisterFinalizer (SYSTEM_PTR obj, Heap_Finalizer finalize);
static void Heap_Scan (void);
static void Heap_Sift (INT32 l, INT32 r, INT32 *a, ADDRESS a__len);
export void Heap_Unlock (void);

extern void *Heap__init();
extern ADDRESS Modules_MainStackFrame;
extern ADDRESS Platform_OSAllocate(ADDRESS size);
#define Heap_HeapModuleInit()	Heap__init()
#define Heap_ModulesHalt(code)	Modules_Halt(code)
#define Heap_ModulesMainStackFrame()	Modules_MainStackFrame
#define Heap_OSAllocate(size)	Platform_OSAllocate(size)
#define Heap_uLE(x, y)	((size_t)x <= (size_t)y)
#define Heap_uLT(x, y)	((size_t)x <  (size_t)y)

void Heap_Lock (void)
{
	Heap_lockdepth += 1;
}

void Heap_Unlock (void)
{
	Heap_lockdepth -= 1;
	if ((Heap_interrupted && Heap_lockdepth == 0)) {
		Heap_ModulesHalt(-9);
	}
}

SYSTEM_PTR Heap_REGMOD (Heap_ModuleName name, Heap_EnumProc enumPtrs)
{
	Heap_Module m;
	if (__STRCMP(name, "Heap") == 0) {
		__SYSNEW(m, 48);
	} else {
		__NEW(m, Heap_ModuleDesc);
	}
	m->types = 0;
	m->cmds = NIL;
	__COPY(name, m->name, 20);
	m->refcnt = 0;
	m->enumPtrs = enumPtrs;
	m->next = (Heap_Module)(ADDRESS)Heap_modules;
	Heap_modules = (SYSTEM_PTR)m;
	return (void*)m;
}

INT32 Heap_FreeModule (CHAR *name, ADDRESS name__len)
{
	Heap_Module m, p;
	__DUP(name, name__len, CHAR);
	m = (Heap_Module)(ADDRESS)Heap_modules;
	while ((m != NIL && __STRCMP(m->name, name) != 0)) {
		p = m;
		m = m->next;
	}
	if ((m != NIL && m->refcnt == 0)) {
		if (m == (Heap_Module)(ADDRESS)Heap_modules) {
			Heap_modules = (SYSTEM_PTR)m->next;
		} else {
			p->next = m->next;
		}
		__DEL(name);
		return 0;
	} else {
		if (m == NIL) {
			__DEL(name);
			return -1;
		} else {
			__DEL(name);
			return m->refcnt;
		}
	}
	__RETCHK;
}

void Heap_REGCMD (Heap_Module m, Heap_CmdName name, Heap_Command cmd)
{
	Heap_Cmd c;
	if (__STRCMP(m->name, "Heap") == 0) {
		__SYSNEW(c, 32);
	} else {
		__NEW(c, Heap_CmdDesc);
	}
	__COPY(name, c->name, 24);
	c->cmd = cmd;
	c->next = m->cmds;
	m->cmds = c;
}

void Heap_REGTYP (Heap_Module m, INT32 typ)
{
	__PUT(typ, m->types, INT32);
	m->types = typ;
}

void Heap_INCREF (Heap_Module m)
{
	m->refcnt += 1;
}

static INT32 Heap_NewChunk (INT32 blksz)
{
	INT32 chnk, blk, end;
	chnk = Heap_OSAllocate(blksz + 12);
	if (chnk != 0) {
		blk = chnk + 12;
		end = blk + blksz;
		__PUT(chnk + 4, end, INT32);
		__PUT(blk, blk + 4, INT32);
		__PUT(blk + 4, blksz, INT32);
		__PUT(blk + 8, -4, INT32);
		__PUT(blk + 12, Heap_bigBlocks, INT32);
		Heap_bigBlocks = blk;
		Heap_heapsize += blksz;
		if (Heap_uLT(blk + 4, Heap_heapMin)) {
			Heap_heapMin = blk + 4;
		}
		if (Heap_uLT(Heap_heapMax, end)) {
			Heap_heapMax = end;
		}
	}
	return chnk;
}

static void Heap_ExtendHeap (INT32 blksz)
{
	INT32 size, chnk, j, next;
		if (Heap_uLT(Heap_heapMinExpand, blksz)) {
		size = blksz;
	} else {
		size = Heap_heapMinExpand;
	}
	chnk = Heap_NewChunk(size);
	if (chnk != 0) {
		if (Heap_uLT(chnk, Heap_heap)) {
			__PUT(chnk, Heap_heap, INT32);
			Heap_heap = chnk;
		} else {
			j = Heap_heap;
			__GET(j, next, INT32);
			while ((next != 0 && Heap_uLT(next, chnk))) {
				j = next;
				__GET(j, next, INT32);
			}
			__PUT(chnk, next, INT32);
			__PUT(j, chnk, INT32);
		}
	} else if (!Heap_firstTry) {
		Heap_heapMinExpand = 16;
	}
}

SYSTEM_PTR Heap_NEWREC (INT32 tag)
{
	INT32 i, i0, di, blksz, restsize, t, adr, end, next, prev;
	SYSTEM_PTR new;
	Heap_Lock();
	__GET(tag, blksz, INT32);
		i0 = __LSH(blksz, -Heap_ldUnit, 32);
	i = i0;
	if (i < 9) {
		adr = Heap_freeList[i];
		while (adr == 0) {
			i += 1;
			adr = Heap_freeList[i];
		}
	}
	if (i < 9) {
		__GET(adr + 12, next, INT32);
		Heap_freeList[i] = next;
		if (i != i0) {
			di = i - i0;
			restsize = __ASHL(di, 4);
			end = adr + restsize;
			__PUT(end + 4, blksz, INT32);
			__PUT(end + 8, -4, INT32);
			__PUT(end, end + 4, INT32);
			__PUT(adr + 4, restsize, INT32);
			__PUT(adr + 12, Heap_freeList[di], INT32);
			Heap_freeList[di] = adr;
			adr += restsize;
		}
	} else {
		adr = Heap_bigBlocks;
		prev = 0;
		for (;;) {
			if (adr == 0) {
				if (Heap_firstTry) {
					Heap_GC(1);
					blksz += 16;
					t = __LSH(Heap_allocated + blksz, -(2 + Heap_ldUnit), 32) * 80;
					if (Heap_uLT(Heap_heapsize, t)) {
						Heap_ExtendHeap(t - Heap_heapsize);
					}
					Heap_firstTry = 0;
					new = Heap_NEWREC(tag);
					if (new == NIL) {
						Heap_ExtendHeap(blksz);
						new = Heap_NEWREC(tag);
					}
					Heap_firstTry = 1;
					Heap_Unlock();
					return new;
				} else {
					Heap_Unlock();
					return NIL;
				}
			}
			__GET(adr + 4, t, INT32);
			if (Heap_uLE(blksz, t)) {
				break;
			}
			prev = adr;
			__GET(adr + 12, adr, INT32);
		}
		restsize = t - blksz;
		end = adr + restsize;
		__PUT(end + 4, blksz, INT32);
		__PUT(end + 8, -4, INT32);
		__PUT(end, end + 4, INT32);
		if (Heap_uLT(144, restsize)) {
			__PUT(adr + 4, restsize, INT32);
		} else {
			__GET(adr + 12, next, INT32);
			if (prev == 0) {
				Heap_bigBlocks = next;
			} else {
				__PUT(prev + 12, next, INT32);
			}
			if (restsize != 0) {
				di = __ASHR(restsize, 4);
				__PUT(adr + 4, restsize, INT32);
				__PUT(adr + 12, Heap_freeList[di], INT32);
				Heap_freeList[di] = adr;
			}
		}
		adr += restsize;
	}
	i = adr + 16;
	end = adr + blksz;
	while (Heap_uLT(i, end)) {
		__PUT(i, 0, INT32);
		__PUT(i + 4, 0, INT32);
		__PUT(i + 8, 0, INT32);
		__PUT(i + 12, 0, INT32);
		i += 16;
	}
	__PUT(adr + 12, 0, INT32);
	__PUT(adr, tag, INT32);
	__PUT(adr + 4, 0, INT32);
	__PUT(adr + 8, 0, INT32);
	Heap_allocated += blksz;
	Heap_Unlock();
	return (SYSTEM_PTR)(ADDRESS)(adr + 4);
}

SYSTEM_PTR Heap_NEWBLK (INT32 size)
{
	INT32 blksz, tag;
	SYSTEM_PTR new;
	Heap_Lock();
	blksz = __ASHL(__ASHR(size + 31, 4), 4);
	new = Heap_NEWREC((ADDRESS)&blksz);
	tag = ((INT32)(ADDRESS)new + blksz) - 12;
	__PUT(tag - 4, 0, INT32);
	__PUT(tag, blksz, INT32);
	__PUT(tag + 4, -4, INT32);
	__PUT((INT32)(ADDRESS)new - 4, tag, INT32);
	Heap_Unlock();
	return new;
}

static void Heap_Mark (INT32 q)
{
	INT32 p, tag, offset, fld, n, tagbits;
	if (q != 0) {
		__GET(q - 4, tagbits, INT32);
		if (!__ODD(tagbits)) {
			__PUT(q - 4, tagbits + 1, INT32);
			p = 0;
			tag = tagbits + 4;
			for (;;) {
				__GET(tag, offset, INT32);
				if (offset < 0) {
					__PUT(q - 4, (tag + offset) + 1, INT32);
					if (p == 0) {
						break;
					}
					n = q;
					q = p;
					__GET(q - 4, tag, INT32);
					tag -= 1;
					__GET(tag, offset, INT32);
					fld = q + offset;
					__GET(fld, p, INT32);
					__PUT(fld, (SYSTEM_PTR)(ADDRESS)n, SYSTEM_PTR);
				} else {
					fld = q + offset;
					__GET(fld, n, INT32);
					if (n != 0) {
						__GET(n - 4, tagbits, INT32);
						if (!__ODD(tagbits)) {
							__PUT(n - 4, tagbits + 1, INT32);
							__PUT(q - 4, tag + 1, INT32);
							__PUT(fld, (SYSTEM_PTR)(ADDRESS)p, SYSTEM_PTR);
							p = q;
							q = n;
							tag = tagbits;
						}
					}
				}
				tag += 4;
			}
		}
	}
}

static void Heap_MarkP (SYSTEM_PTR p)
{
	Heap_Mark((INT32)(ADDRESS)p);
}

static void Heap_Scan (void)
{
	INT32 chnk, adr, end, start, tag, i, size, freesize;
	Heap_bigBlocks = 0;
	i = 1;
	while (i < 9) {
		Heap_freeList[i] = 0;
		i += 1;
	}
	freesize = 0;
	Heap_allocated = 0;
	chnk = Heap_heap;
	while (chnk != 0) {
		adr = chnk + 12;
		__GET(chnk + 4, end, INT32);
		while (Heap_uLT(adr, end)) {
			__GET(adr, tag, INT32);
			if (__ODD(tag)) {
				if (freesize != 0) {
					start = adr - freesize;
					__PUT(start, start + 4, INT32);
					__PUT(start + 4, freesize, INT32);
					__PUT(start + 8, -4, INT32);
					i = __LSH(freesize, -Heap_ldUnit, 32);
					freesize = 0;
					if (Heap_uLT(i, 9)) {
						__PUT(start + 12, Heap_freeList[i], INT32);
						Heap_freeList[i] = start;
					} else {
						__PUT(start + 12, Heap_bigBlocks, INT32);
						Heap_bigBlocks = start;
					}
				}
				tag -= 1;
				__PUT(adr, tag, INT32);
				__GET(tag, size, INT32);
				Heap_allocated += size;
				adr += size;
			} else {
				__GET(tag, size, INT32);
				freesize += size;
				adr += size;
			}
		}
		if (freesize != 0) {
			start = adr - freesize;
			__PUT(start, start + 4, INT32);
			__PUT(start + 4, freesize, INT32);
			__PUT(start + 8, -4, INT32);
			i = __LSH(freesize, -Heap_ldUnit, 32);
			freesize = 0;
			if (Heap_uLT(i, 9)) {
				__PUT(start + 12, Heap_freeList[i], INT32);
				Heap_freeList[i] = start;
			} else {
				__PUT(start + 12, Heap_bigBlocks, INT32);
				Heap_bigBlocks = start;
			}
		}
		__GET(chnk, chnk, INT32);
	}
}

static void Heap_Sift (INT32 l, INT32 r, INT32 *a, ADDRESS a__len)
{
	INT32 i, j;
	INT32 x;
	j = l;
	x = a[j];
	for (;;) {
		i = j;
		j = __ASHL(j, 1) + 1;
		if ((j < r && Heap_uLT(a[j], a[j + 1]))) {
			j += 1;
		}
		if (j > r || Heap_uLE(a[j], x)) {
			break;
		}
		a[i] = a[j];
	}
	a[i] = x;
}

static void Heap_HeapSort (INT32 n, INT32 *a, ADDRESS a__len)
{
	INT32 l, r;
	INT32 x;
	l = __ASHR(n, 1);
	r = n - 1;
	while (l > 0) {
		l -= 1;
		Heap_Sift(l, r, (void*)a, a__len);
	}
	while (r > 0) {
		x = a[0];
		a[0] = a[r];
		a[r] = x;
		r -= 1;
		Heap_Sift(l, r, (void*)a, a__len);
	}
}

static void Heap_MarkCandidates (INT32 n, INT32 *cand, ADDRESS cand__len)
{
	INT32 chnk, end, adr, tag, next, i, ptr, size;
		chnk = Heap_heap;
	i = 0;
	while (chnk != 0) {
		__GET(chnk + 4, end, INT32);
		adr = chnk + 12;
		while (Heap_uLT(adr, end)) {
			__GET(adr, tag, INT32);
			if (__ODD(tag)) {
				__GET(tag - 1, size, INT32);
				adr += size;
				ptr = adr + 4;
				while (Heap_uLT(cand[i], ptr)) {
					i += 1;
					if (i == n) {
						return;
					}
				}
			} else {
				__GET(tag, size, INT32);
				ptr = adr + 4;
				adr += size;
				while (Heap_uLT(cand[i], ptr)) {
					i += 1;
					if (i == n) {
						return;
					}
				}
				if (Heap_uLT(cand[i], adr)) {
					Heap_Mark(ptr);
				}
			}
			if (Heap_uLE(end, cand[i])) {
				adr = end;
			}
		}
		__GET(chnk, chnk, INT32);
	}
}

static void Heap_CheckFin (void)
{
	Heap_FinNode n;
	INT32 tag;
	n = Heap_fin;
	while (n != NIL) {
		__GET(n->obj - 4, tag, INT32);
		if (!__ODD(tag)) {
			n->marked = 0;
			Heap_Mark(n->obj);
		} else {
			n->marked = 1;
		}
		n = n->next;
	}
}

static void Heap_Finalize (void)
{
	Heap_FinNode n, prev;
	n = Heap_fin;
	prev = NIL;
	while (n != NIL) {
		if (!n->marked) {
			if (n == Heap_fin) {
				Heap_fin = Heap_fin->next;
			} else {
				prev->next = n->next;
			}
			(*n->finalize)((SYSTEM_PTR)(ADDRESS)n->obj);
			if (prev == NIL) {
				n = Heap_fin;
			} else {
				n = n->next;
			}
		} else {
			prev = n;
			n = n->next;
		}
	}
}

void Heap_FINALL (void)
{
	Heap_FinNode n;
	while (Heap_fin != NIL) {
		n = Heap_fin;
		Heap_fin = Heap_fin->next;
		(*n->finalize)((SYSTEM_PTR)(ADDRESS)n->obj);
	}
}

static void Heap_MarkStack (INT32 n, INT32 *cand, ADDRESS cand__len)
{
	SYSTEM_PTR frame;
	INT32 nofcand;
	INT32 inc, sp, p, stack0;
	struct Heap__1 align;
	if (n > 0) {
		Heap_MarkStack(n - 1, cand, cand__len);
		if (n > 100) {
			return;
		}
	}
	if (n == 0) {
		nofcand = 0;
		sp = (ADDRESS)&frame;
		stack0 = Heap_ModulesMainStackFrame();
		inc = (ADDRESS)&align.p - (ADDRESS)&align;
		if (Heap_uLT(stack0, sp)) {
			inc = -inc;
		}
		while (sp != stack0) {
			__GET(sp, p, INT32);
			if ((Heap_uLE(Heap_heapMin, p) && Heap_uLT(p, Heap_heapMax))) {
				if (nofcand == cand__len) {
					Heap_HeapSort(nofcand, (void*)cand, cand__len);
					Heap_MarkCandidates(nofcand, (void*)cand, cand__len);
					nofcand = 0;
				}
				cand[nofcand] = p;
				nofcand += 1;
			}
			sp += inc;
		}
		if (nofcand > 0) {
			Heap_HeapSort(nofcand, (void*)cand, cand__len);
			Heap_MarkCandidates(nofcand, (void*)cand, cand__len);
		}
	}
}

void Heap_GC (BOOLEAN markStack)
{
	Heap_Module m;
	INT32 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14, i15, i16, i17, i18, i19, i20, i21, i22, i23;
	INT32 cand[10000];
	Heap_Lock();
	m = (Heap_Module)(ADDRESS)Heap_modules;
	while (m != NIL) {
		if (m->enumPtrs != NIL) {
			(*m->enumPtrs)(Heap_MarkP);
		}
		m = m->next;
	}
	if (markStack) {
		i0 = -100;
		i1 = -101;
		i2 = -102;
		i3 = -103;
		i4 = -104;
		i5 = -105;
		i6 = -106;
		i7 = -107;
		i8 = 1;
		i9 = 2;
		i10 = 3;
		i11 = 4;
		i12 = 5;
		i13 = 6;
		i14 = 7;
		i15 = 8;
		i16 = 9;
		i17 = 10;
		i18 = 11;
		i19 = 12;
		i20 = 13;
		i21 = 14;
		i22 = 15;
		i23 = 16;
		for (;;) {
			i0 += 1;
			i1 += 2;
			i2 += 3;
			i3 += 4;
			i4 += 5;
			i5 += 6;
			i6 += 7;
			i7 += 8;
			i8 += 9;
			i9 += 10;
			i10 += 11;
			i11 += 12;
			i12 += 13;
			i13 += 14;
			i14 += 15;
			i15 += 16;
			i16 += 17;
			i17 += 18;
			i18 += 19;
			i19 += 20;
			i20 += 21;
			i21 += 22;
			i22 += 23;
			i23 += 24;
			if ((i0 == -99 && i15 == 24)) {
				Heap_MarkStack(32, (void*)cand, 10000);
				break;
			}
		}
		if (((((((((((((((((((((((i0 + i1) + i2) + i3) + i4) + i5) + i6) + i7) + i8) + i9) + i10) + i11) + i12) + i13) + i14) + i15) + i16) + i17) + i18) + i19) + i20) + i21) + i22) + i23 > 10000) {
			return;
		}
	}
	Heap_CheckFin();
	Heap_Scan();
	Heap_Finalize();
	Heap_Unlock();
}

void Heap_RegisterFinalizer (SYSTEM_PTR obj, Heap_Finalizer finalize)
{
	Heap_FinNode f;
	__NEW(f, Heap_FinDesc);
	f->obj = (INT32)(ADDRESS)obj;
	f->finalize = finalize;
	f->marked = 1;
	f->next = Heap_fin;
	Heap_fin = f;
}

void Heap_InitHeap (void)
{
	Heap_heap = 0;
	Heap_heapsize = 0;
	Heap_allocated = 0;
	Heap_lockdepth = 0;
	Heap_heapMin = -1;
	Heap_heapMax = 0;
	Heap_bigBlocks = 0;
	Heap_heapMinExpand = 128000;
	Heap_ldUnit = 4;
	Heap_heap = Heap_NewChunk(128000);
	__PUT(Heap_heap, 0, INT32);
	Heap_firstTry = 1;
	Heap_freeList[9] = 1;
	Heap_FileCount = 0;
	Heap_modules = NIL;
	Heap_fin = NIL;
	Heap_interrupted = 0;
	Heap_HeapModuleInit();
}

static void EnumPtrs(void (*P)(void*))
{
	P(Heap_modules);
	P(Heap_fin);
}

__TDESC(Heap_ModuleDesc, 1, 2) = {__TDFLDS("ModuleDesc", 48), {0, 28, -12}};
__TDESC(Heap_CmdDesc, 1, 1) = {__TDFLDS("CmdDesc", 32), {0, -8}};
__TDESC(Heap_FinDesc, 1, 1) = {__TDFLDS("FinDesc", 16), {0, -8}};
__TDESC(Heap__1, 1, 1) = {__TDFLDS("", 8), {4, -8}};

export void *Heap__init(void)
{
	__DEFMOD;
	__REGMOD("Heap", EnumPtrs);
	__REGCMD("FINALL", Heap_FINALL);
	__REGCMD("InitHeap", Heap_InitHeap);
	__REGCMD("Lock", Heap_Lock);
	__REGCMD("Unlock", Heap_Unlock);
	__INITYP(Heap_ModuleDesc, Heap_ModuleDesc, 0);
	__INITYP(Heap_CmdDesc, Heap_CmdDesc, 0);
	__INITYP(Heap_FinDesc, Heap_FinDesc, 0);
	__INITYP(Heap__1, Heap__1, 0);
/* BEGIN */
	__ENDMOD;
}