/*
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of 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.
 *
 *  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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/*
 * Author: Stas Sergeev <stsp@users.sourceforge.net>
 *
 * Management for the static 32K heap in a low memory.
 * Used by various dosemu internal subsystems.
 */

#include <signal.h>
#include <assert.h>
#include "emu.h"
#include "memory.h"
#include "misc/smalloc.h"
#include "utilities.h"
#include "emudpmi.h"
#include "lowmem.h"
#include "video.h"

static smpool mp;
unsigned char *dosemu_lmheap_base;
static void *rm_stack;
#define RM_STACK_SIZE 0x200

static void do_sm_error(int prio, const char *fmt, ...)
{
    char buf[1024];
    va_list al;

    va_start(al, fmt);
    vsnprintf(buf, sizeof(buf), fmt, al);
    va_end(al);
    if (prio)
	dosemu_error("%s\n", buf);
    else
	dbug_printf("%s\n", buf);
}

int lowmem_init(void)
{
    dosaddr_t base = SEGOFF2LINEAR(DOSEMU_LMHEAP_SEG, DOSEMU_LMHEAP_OFF);
    sminit(&mp, base, DOSEMU_LMHEAP_SIZE);
    dosemu_lmheap_base = LINEAR2UNIX(base);
    smregister_error_notifier(&mp, do_sm_error);
    return 1;
}

void * lowmem_alloc(int size)
{
	dosaddr_t ptr = smalloc(&mp, size);
	if (ptr == (dosaddr_t)-1) {
		error("lowmem_heap: OOM, size=%i\n", size);
		leavedos(86);
	}
	return LINEAR2UNIX(ptr);
}

void * lowmem_alloc_aligned(int align, int size)
{
	dosaddr_t ptr = smalloc_aligned(&mp, align, size);
	if (ptr == (dosaddr_t)-1) {
		error("lowmem_heap: OOM, size=%i\n", size);
		leavedos(86);
	}
	return LINEAR2UNIX(ptr);
}

void lowmem_free(void *p)
{
	if (!p) return;
	smfree(&mp, SEGOFF2LINEAR(DOSEMU_LMHEAP_SEG,
				  DOSEMU_LMHEAP_OFFS_OF(p)));
}

void lowmem_reset(void)
{
	lowmem_free(rm_stack);
	smfree_all(&mp);
	rm_stack = lowmem_alloc(RM_STACK_SIZE);
}

static int in_rm_stack;
static uint16_t rm_sp;
#define MAX_RM_STACKS 10
static uint64_t userval[MAX_RM_STACKS];

int get_rm_stack(Bit16u *ss_p, Bit16u *sp_p, uint64_t cookie)
{
	int ret = 0;

	assert(in_rm_stack < MAX_RM_STACKS);
	userval[in_rm_stack] = cookie;
	if (!(in_rm_stack++)) {
		rm_sp = DOSEMU_LMHEAP_OFFS_OF(rm_stack) + RM_STACK_SIZE;
		*ss_p = DOSEMU_LMHEAP_SEG;
		*sp_p = rm_sp;
		ret = 1;
	}

	return ret;
}

uint16_t put_rm_stack(uint64_t *cookie)
{
	int ret = 0;

	assert(in_rm_stack > 0);
	if (!(--in_rm_stack)) {
		ret = rm_sp;
	}
	if (cookie)
		*cookie = userval[in_rm_stack];
	return ret;
}

/* recursion is _very_unlikely, but define an array */
#define MAX_SAVED_REGS 5
static struct vm86_regs rm_regs_stack[MAX_SAVED_REGS];

static void switch_stack(struct vm86_regs *regs)
{
	Bit16u new_ss, new_sp;
	int stk;
	stk = get_rm_stack(&new_ss, &new_sp, 0);
	if (stk) {
		regs->ss = new_ss;
		regs->esp = new_sp;
	}
}

void get_rm_stack_regs(struct vm86_regs *regs, struct vm86_regs *saved_regs)
{
	*saved_regs = REGS;
	switch_stack(regs);
}

void rm_stack_enter(void)
{
	assert(in_rm_stack < MAX_SAVED_REGS);
	get_rm_stack_regs(&REGS, &rm_regs_stack[in_rm_stack]);
}

void rm_stack_leave(void)
{
	int old_tf = isset_TF();
	put_rm_stack(NULL);
	REGS = rm_regs_stack[in_rm_stack];
	if (old_tf)
		set_TF();
}

#define LMHEAP_OFF 0x8000
#define LMHEAP_SIZE 0x6000

static uint16_t lmheap_sub(void)
{
	return (config.dos_up == 2 ? FDPP_LMHEAP_ADD : 0) +
		(!(config.vga && config.chipset == VESA) ? VBE_LMHEAP_ADD : 0);
}

uint16_t lmheap_off(void)
{
	return LMHEAP_OFF + lmheap_sub();
}

uint16_t lmheap_size(void)
{
	return LMHEAP_SIZE - lmheap_sub();
}
