/* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */
/* hack.o_init.c - version 1.0.3 */
/* $FreeBSD: src/games/hack/hack.o_init.c,v 1.6 1999/11/16 10:26:37 marcel Exp $ */
/* $DragonFly: src/games/hack/hack.o_init.c,v 1.4 2006/08/21 19:45:32 pavalos Exp $ */

#include "def.objects.h"
#include "hack.h"

static void setgemprobs(void);
static bool interesting_to_discover(int);

int
letindex(char let)
{
	int i = 0;
	char ch;

	while ((ch = obj_symbols[i++]) != 0)
		if (ch == let)
			return (i);
	return (0);
}

void
init_objects(void)
{
	int i, j, first, last, sum, end;
	char let;
	const char *tmp;

	/*
	 * init base; if probs given check that they add up to 100, otherwise
	 * compute probs; shuffle descriptions
	 */
	end = SIZE(objects);
	first = 0;
	while (first < end) {
		let = objects[first].oc_olet;
		last = first + 1;
		while (last < end && objects[last].oc_olet == let
		       && objects[last].oc_name != NULL)
			last++;
		i = letindex(let);
		if ((!i && let != ILLOBJ_SYM) || bases[i] != 0)
			error("initialization error");
		bases[i] = first;

		if (let == GEM_SYM)
			setgemprobs();
check:
		sum = 0;
		for (j = first; j < last; j++)
			sum += objects[j].oc_prob;
		if (sum == 0) {
			for (j = first; j < last; j++)
				objects[j].oc_prob = (100 + j - first) / (last - first);
			goto check;
		}
		if (sum != 100)
			error("init-prob error for %c", let);

		if (objects[first].oc_descr != NULL && let != TOOL_SYM) {
			/* shuffle, also some additional descriptions */
			while (last < end && objects[last].oc_olet == let)
				last++;
			j = last;
			while (--j > first) {
				i = first + rn2(j + 1 - first);
				tmp = objects[j].oc_descr;
				objects[j].oc_descr = objects[i].oc_descr;
				objects[i].oc_descr = tmp;
			}
		}
		first = last;
	}
}

int
probtype(char let)
{
	int i = bases[letindex(let)];
	int prob = rn2(100);

	while ((prob -= objects[i].oc_prob) >= 0)
		i++;
	if (objects[i].oc_olet != let || !objects[i].oc_name)
		panic("probtype(%c) error, i=%d", let, i);
	return (i);
}

static void
setgemprobs(void)
{
	int j, first;

	first = bases[letindex(GEM_SYM)];

	for (j = 0; j < 9 - dlevel / 3; j++)
		objects[first + j].oc_prob = 0;
	first += j;
	if (first >= LAST_GEM || first >= SIZE(objects) ||
	    objects[first].oc_olet != GEM_SYM ||
	    objects[first].oc_name == NULL)
		printf("Not enough gems? - first=%d j=%d LAST_GEM=%d\n",
		       first, j, LAST_GEM);
	for (j = first; j < LAST_GEM; j++)
		objects[j].oc_prob = (20 + j - first) / (LAST_GEM - first);
}

void
oinit(void)		/* level dependent initialization */
{
	setgemprobs();
}

void
savenames(int fd)
{
	int i;
	unsigned len;

	bwrite(fd, (char *)bases, sizeof(bases));
	bwrite(fd, (char *)objects, sizeof(objects));
	/*
	 * as long as we use only one version of Hack/Quest we need not save
	 * oc_name and oc_descr, but we must save oc_uname for all objects
	 */
	for (i = 0; i < SIZE(objects); i++) {
		if (objects[i].oc_uname) {
			len = strlen(objects[i].oc_uname) + 1;
			bwrite(fd, (char *)&len, sizeof(len));
			bwrite(fd, objects[i].oc_uname, len);
		}
	}
}

void
restnames(int fd)
{
	int i;
	unsigned len;

	mread(fd, (char *)bases, sizeof(bases));
	mread(fd, (char *)objects, sizeof(objects));
	for (i = 0; i < SIZE(objects); i++)
		if (objects[i].oc_uname) {
			mread(fd, (char *)&len, sizeof(len));
			objects[i].oc_uname = alloc(len);
			mread(fd, objects[i].oc_uname, len);
		}
}

int
dodiscovered(void)		/* free after Robert Viduya */
{
	int i, end;
	int ct = 0;

	cornline(0, "Discoveries");

	end = SIZE(objects);
	for (i = 0; i < end; i++) {
		if (interesting_to_discover(i)) {
			ct++;
			cornline(1, typename(i));
		}
	}
	if (ct == 0) {
		pline("You haven't discovered anything yet...");
		cornline(3, NULL);
	} else
		cornline(2, NULL);

	return (0);
}

static bool
interesting_to_discover(int i)
{
	return (
		objects[i].oc_uname != NULL ||
		(objects[i].oc_name_known && objects[i].oc_descr != NULL)
		);
}