server/src/kernel/equipment.c

/*
Copyright (c) 1998-2015, Enno Rehling <enno@eressea.de>
Katja Zedel <katze@felidae.kn-bremen.de
Christian Schlittchen <corwin@amber.kn-bremen.de>

Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.

THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
**/

#include <platform.h>
#include <kernel/config.h>
#include "equipment.h"

/* kernel includes */
#include "item.h"
#include "unit.h"
#include "faction.h"
#include "race.h"
#include "spell.h"

/* util includes */
#include <selist.h>
#include <critbit.h>
#include <util/log.h>
#include <util/rand.h>
#include <util/rng.h>
#include <util/strings.h>

/* libc includes */
#include <assert.h>
#include <string.h>
#include <stdlib.h>

void equipment_setskill(equipment * eq, skill_t sk, const char *value)
{
    if (eq != NULL) {
        if (value != NULL) {
            eq->skills[sk] = str_strdup(value);
        }
        else if (eq->skills[sk]) {
            free(eq->skills[sk]);
        }
    }
}

typedef struct lazy_spell {
    struct spellref *spref;
    int level;
} lazy_spell;

void equipment_addspell(equipment * eq, const char * name, int level)
{
    if (eq) {
        lazy_spell *ls = malloc(sizeof(lazy_spell));
        ls->spref = spellref_create(NULL, name);
        ls->level = level;
        selist_push(&eq->spells, ls);
    }
}

void
equipment_setitem(equipment * eq, const item_type * itype, const char *value)
{
    if (eq != NULL) {
        if (itype != NULL) {
            itemdata *idata = eq->items;
            while (idata && idata->itype != itype) {
                idata = idata->next;
            }
            if (idata == NULL) {
                idata = (itemdata *)malloc(sizeof(itemdata));
                idata->itype = itype;
                idata->value = str_strdup(value);
                idata->next = eq->items;
                eq->items = idata;
            }
        }
    }
}

void
equipment_setcallback(struct equipment *eq,
void(*callback) (const struct equipment *, struct unit *))
{
    eq->callback = callback;
}

void equip_unit(struct unit *u, const struct equipment *eq)
{
    equip_unit_mask(u, eq, EQUIP_ALL);
}

void equip_unit_mask(struct unit *u, const struct equipment *eq, int mask)
{
    if (eq) {

        if (mask & EQUIP_SKILLS) {
            int sk;
            for (sk = 0; sk != MAXSKILLS; ++sk) {
                if (eq->skills[sk] != NULL) {
                    int i = dice_rand(eq->skills[sk]);
                    if (i > 0) {
                        set_level(u, (skill_t)sk, i);
                        if (sk == SK_STAMINA) {
                            u->hp = unit_max_hp(u) * u->number;
                        }
                    }
                }
            }
        }

        if (mask & EQUIP_SPELLS) {
            if (eq->spells) {
                selist * ql = eq->spells;
                int qi;
                sc_mage * mage = get_mage_depr(u);

                for (qi = 0; ql; selist_advance(&ql, &qi, 1)) {
                    lazy_spell *sbe = (lazy_spell *)selist_get(ql, qi);
                    spell *sp = spellref_get(sbe->spref);
                    unit_add_spell(u, mage, sp, sbe->level);
                }
            }
        }

        if (mask & EQUIP_ITEMS) {
            itemdata *idata;
            for (idata = eq->items; idata != NULL; idata = idata->next) {
                int i = u->number * dice_rand(idata->value);
                if (i > 0) {
                    i_add(&u->items, i_new(idata->itype, i));
                }
            }
        }

        if (eq->subsets) {
            int i;
            for (i = 0; eq->subsets[i].sets; ++i) {
                if (chance(eq->subsets[i].chance)) {
                    double rnd = (1 + rng_int() % 1000) / 1000.0;
                    int k;
                    for (k = 0; eq->subsets[i].sets[k].set; ++k) {
                        if (rnd <= eq->subsets[i].sets[k].chance) {
                            equip_unit_mask(u, eq->subsets[i].sets[k].set, mask);
                            break;
                        }
                        rnd -= eq->subsets[i].sets[k].chance;
                    }
                }
            }
        }

        if (mask & EQUIP_SPECIAL) {
            if (eq->callback)
                eq->callback(eq, u);
        }
    }
}

void equip_items(struct item **items, const struct equipment *eq)
{
    if (eq) {
        itemdata *idata;

        for (idata = eq->items; idata != NULL; idata = idata->next) {
            int i = dice_rand(idata->value);
            if (i > 0) {
                i_add(items, i_new(idata->itype, i));
            }
        }
        if (eq->subsets) {
            int i;
            for (i = 0; eq->subsets[i].sets; ++i) {
                if (chance(eq->subsets[i].chance)) {
                    double rnd = (1 + rng_int() % 1000) / 1000.0;
                    int k;
                    for (k = 0; eq->subsets[i].sets[k].set; ++k) {
                        if (rnd <= eq->subsets[i].sets[k].chance) {
                            equip_items(items, eq->subsets[i].sets[k].set);
                            break;
                        }
                        rnd -= eq->subsets[i].sets[k].chance;
                    }
                }
            }
        }
    }
}

void free_ls(void *arg) {
    lazy_spell *ls = (lazy_spell*)arg;
    spellref_free(ls->spref);
    free(ls);
}

static critbit_tree cb_equipments = { 0 };

#define EQNAMELEN 24

typedef struct eq_entry {
    char key[EQNAMELEN];
    equipment *value;
} eq_entry;

typedef struct name_cb_data {
    const equipment *find;
    const char *result;
} name_cb_data;


static int equipment_name_cb(const void * match, const void * key, size_t keylen, void *cbdata) {
    const eq_entry *ent = (const eq_entry *)match;
    name_cb_data *query = (name_cb_data *)cbdata;
    if (ent->value == query->find) {
        query->result = ent->key;
        return 1;
    }
    return 0;
}

const char *equipment_name(const struct equipment *eq)
{
    name_cb_data data;

    data.find = eq;
    data.result = NULL;
    cb_foreach(&cb_equipments, "", 0, equipment_name_cb, &data);
    return data.result;
}

equipment *get_equipment(const char *eqname)
{
    const void *match;

    if (strlen(eqname) >= EQNAMELEN) {
        log_warning("equipment name is longer than %d bytes: %s", EQNAMELEN - 1, eqname);
        return NULL;
    }

    match = cb_find_str(&cb_equipments, eqname);
    if (match) {
        const eq_entry *ent = (const eq_entry *)match;
        return ent->value;
    }
    return NULL;
}

equipment *create_equipment(const char *eqname)
{
    size_t len = strlen(eqname);
    eq_entry ent;

    if (len >= EQNAMELEN) {
        log_error("equipment name is longer than %d bytes: %s", EQNAMELEN-1, eqname);
        len = EQNAMELEN-1;
    }
    memset(ent.key, 0, EQNAMELEN);
    memcpy(ent.key, eqname, len);

    ent.value = (equipment *)calloc(1, sizeof(equipment));

    cb_insert(&cb_equipments, &ent, sizeof(ent));
    return ent.value;
}

equipment *get_or_create_equipment(const char *eqname)
{
    equipment *eq = get_equipment(eqname);
    if (!eq) {
        return create_equipment(eqname);
    }
    return eq;
}

static void free_equipment(equipment *eq) {
    int i;
    if (eq->spells) {
        selist_foreach(eq->spells, free_ls);
        selist_free(eq->spells);
    }
    while (eq->items) {
        itemdata *next = eq->items->next;
        free(eq->items->value);
        free(eq->items);
        eq->items = next;
    }
    if (eq->subsets) {
        for (i = 0; eq->subsets[i].sets; ++i) {
            free(eq->subsets[i].sets);
        }
        free(eq->subsets);
    }
    for (i = 0; i != MAXSKILLS; ++i) {
        free(eq->skills[i]);
    }
}

static int free_equipment_cb(const void * match, const void * key, size_t keylen, void *cbdata) {
    const eq_entry * ent = (const eq_entry *)match;
    free_equipment(ent->value);
    free(ent->value);
    return 0;
}

void equipment_done(void) {
    cb_foreach(&cb_equipments, "", 0, free_equipment_cb, 0);
    cb_clear(&cb_equipments);
}