server/src/kernel/magic.c

/*
Copyright (c) 1998-2010, 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 <kernel/types.h>
#include "magic.h"

#include "building.h"
#include "curse.h"
#include "faction.h"
#include "item.h"
#include "message.h"
#include "objtypes.h"
#include "order.h"
#include "pathfinder.h"
#include "plane.h"
#include "pool.h"
#include "race.h"
#include "region.h"
#include "save.h"
#include "ship.h"
#include "skill.h"
#include "spell.h"
#include "spellbook.h"
#include "teleport.h"
#include "terrain.h"
#include "unit.h"
#include "version.h"

#include <triggers/timeout.h>
#include <triggers/shock.h>
#include <triggers/killunit.h>
#include <triggers/giveitem.h>
#include <triggers/changerace.h>
#include <triggers/clonedied.h>

/* util includes */
#include <util/attrib.h>
#include <critbit.h>
#include <util/language.h>
#include <util/lists.h>
#include <util/log.h>
#include <util/parser.h>
#include <quicklist.h>
#include <util/resolve.h>
#include <util/rand.h>
#include <util/rng.h>
#include <util/storage.h>
#include <util/umlaut.h>
#include <util/base36.h>
#include <util/event.h>

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

const char *magic_school[MAXMAGIETYP] = {
  "gray",
  "illaun",
  "tybied",
  "cerddor",
  "gwyrrd",
  "draig",
  "common"
};

static void a_init_reportspell(struct attrib *a) {
  a->data.v = calloc(1, sizeof(spellbook_entry));
}

static void a_finalize_reportspell(struct attrib *a) {
  free(a->data.v);
}

attrib_type at_reportspell = {
  "reportspell", 
  a_init_reportspell,
  a_finalize_reportspell,
  0, NO_WRITE, NO_READ
};
/**
 ** at_icastle
 ** TODO: separate castle-appearance from illusion-effects
 **/

static double MagicRegeneration(void)
{
  static double value = -1.0;
  if (value < 0) {
    const char *str = get_param(global.parameters, "magic.regeneration");
    value = str ? atof(str) : 1.0;
  }
  return value;
}

double MagicPower(void)
{
  static double value = -1.0;
  if (value < 0) {
    const char *str = get_param(global.parameters, "magic.power");
    value = str ? atof(str) : 1.0;
  }
  return value;
}

static int a_readicastle(attrib * a, void *owner, struct storage *store)
{
  icastle_data *data = (icastle_data *) a->data.v;
  variant bno;
  char token[32];
  store->r_tok_buf(store, token, sizeof(token));
  bno.i = store->r_int(store);
  data->time = store->r_int(store);
  data->building = findbuilding(bno.i);
  if (!data->building) {
    /* this shouldn't happen, but just in case it does: */
    ur_add(bno, &data->building, resolve_building);
  }
  data->type = bt_find(token);
  return AT_READ_OK;
}

static void
a_writeicastle(const attrib * a, const void *owner, struct storage *store)
{
  icastle_data *data = (icastle_data *) a->data.v;
  store->w_tok(store, data->type->_name);
  store->w_int(store, data->building->no);
  store->w_int(store, data->time);
}

static int a_ageicastle(struct attrib *a)
{
  icastle_data *data = (icastle_data *) a->data.v;
  if (data->time <= 0) {
    building *b = data->building;
    region *r = b->region;
    ADDMSG(&r->msgs, msg_message("icastle_dissolve", "building", b));
    /* remove_building lets units leave the building */
    remove_building(&r->buildings, b);
    return AT_AGE_REMOVE;
  } else
    data->time--;
  return AT_AGE_KEEP;
}

static void a_initicastle(struct attrib *a)
{
  a->data.v = calloc(sizeof(icastle_data), 1);
}

static void a_finalizeicastle(struct attrib *a)
{
  free(a->data.v);
}

attrib_type at_icastle = {
  "zauber_icastle",
  a_initicastle,
  a_finalizeicastle,
  a_ageicastle,
  a_writeicastle,
  a_readicastle
};

/* ------------------------------------------------------------- */

extern int dice(int count, int value);

/* ------------------------------------------------------------- */
/* aus dem alten System <20>briggebliegene Funktionen, die bei der
 * Umwandlung von alt nach neu gebraucht werden */
/* ------------------------------------------------------------- */

static void init_mage(attrib * a)
{
  a->data.v = calloc(sizeof(sc_mage), 1);
}

static void free_mage(attrib * a)
{
  sc_mage *mage = (sc_mage *) a->data.v;
  if (mage->spellbook) {
    spellbook_clear(mage->spellbook);
    free(mage->spellbook);
  }
  free(mage);
}

int FactionSpells(void)
{
  static int rules_factionspells = -1;
  if (rules_factionspells < 0) {
    rules_factionspells =
      get_param_int(global.parameters, "rules.magic.factionlist", 0);
  }
  return rules_factionspells;
}

void read_spells(struct quicklist **slistp, magic_t mtype,
  struct storage *store)
{
  for (;;) {
    spell *sp;
    char spname[64];

    if (store->version < SPELLNAME_VERSION) {
      int i = store->r_int(store);
      if (i < 0)
        break;
      sp = find_spellbyid((unsigned int) i);
    } else {
      store->r_tok_buf(store, spname, sizeof(spname));
      if (strcmp(spname, "end") == 0)
        break;
      sp = find_spell(spname);
      if (!sp) {
        log_error("read_spells: could not find spell '%s' in school '%s'\n", spname, magic_school[mtype]);
      }
    }
    if (sp) {
      add_spell(slistp, sp);
    }
  }
}

int get_spell_level_mage(const spell * sp, void * cbdata)
{
  sc_mage *mage = (sc_mage *)cbdata;
  spellbook *book = get_spellbook(magic_school[mage->magietyp]);
  spellbook_entry *sbe = spellbook_get(book, sp);
  return sbe ? sbe->level : 0;
}

static int read_mage(attrib * a, void *owner, struct storage *store)
{
  int i, mtype;
  sc_mage *mage = (sc_mage *) a->data.v;
  char spname[64];

  mtype = store->r_int(store);
  mage->spellpoints = store->r_int(store);
  mage->spchange = store->r_int(store);
  mage->magietyp = (magic_t) mtype;
  for (i = 0; i != MAXCOMBATSPELLS; ++i) {
    spell *sp = NULL;
    int level = 0;
    if (store->version < SPELLNAME_VERSION) {
      int spid;
      spid = store->r_int(store);
      level = store->r_int(store);
      if (spid >= 0) {
        sp = find_spellbyid((unsigned int) spid);
      }
    } else {
      store->r_tok_buf(store, spname, sizeof(spname));
      level = store->r_int(store);

      if (strcmp("none", spname) != 0) {
        sp = find_spell(spname);
        if (!sp) {
          log_error("read_mage: could not find combat spell '%s' in school '%s'\n", spname, magic_school[mage->magietyp]);
        }
      }
    }
    if (sp && level >= 0) {
      int slot = -1;
      if (sp->sptyp & PRECOMBATSPELL)
        slot = 0;
      else if (sp->sptyp & COMBATSPELL)
        slot = 1;
      else if (sp->sptyp & POSTCOMBATSPELL)
        slot = 2;
      if (slot >= 0) {
        mage->combatspells[slot].level = level;
        mage->combatspells[slot].sp = sp;
      }
    }
  }
  if (mage->magietyp==M_GRAY) {
    read_spellbook(&mage->spellbook, store, get_spell_level_mage, mage);
  } else {
    read_spellbook(0, store, 0, mage);
  }
  return AT_READ_OK;
}

void write_spells(struct quicklist *slist, struct storage *store)
{
  quicklist *ql;
  int qi;

  for (ql = slist, qi = 0; ql; ql_advance(&ql, &qi, 1)) {
    spell *sp = (spell *) ql_get(ql, qi);
    store->w_tok(store, sp->sname);
  }
  store->w_tok(store, "end");
}

static void
write_mage(const attrib * a, const void *owner, struct storage *store)
{
  int i;
  sc_mage *mage = (sc_mage *) a->data.v;

  store->w_int(store, mage->magietyp);
  store->w_int(store, mage->spellpoints);
  store->w_int(store, mage->spchange);
  for (i = 0; i != MAXCOMBATSPELLS; ++i) {
    store->w_tok(store,
      mage->combatspells[i].sp ? mage->combatspells[i].sp->sname : "none");
    store->w_int(store, mage->combatspells[i].level);
  }
  write_spellbook(mage->spellbook, store);
}

attrib_type at_mage = {
  "mage",
  init_mage,
  free_mage,
  NULL,
  write_mage,
  read_mage,
  ATF_UNIQUE
};

bool is_mage(const unit * u)
{
  return i2b(get_mage(u) != NULL);
}

sc_mage *get_mage(const unit * u)
{
  if (has_skill(u, SK_MAGIC)) {
    attrib *a = a_find(u->attribs, &at_mage);
    if (a)
      return a->data.v;
  }
  return (sc_mage *) NULL;
}

/* ------------------------------------------------------------- */
/* Ausgabe der Spruchbeschreibungen
* Anzeige des Spruchs nur, wenn die Stufe des besten Magiers vorher
* kleiner war (u->faction->seenspells). Ansonsten muss nur gepr<EFBFBD>ft
* werden, ob dieser Magier den Spruch schon kennt, und andernfalls der
* Spruch zu seiner List-of-known-spells hinzugef<EFBFBD>gt werden.
*/

static int read_seenspell(attrib * a, void *owner, struct storage *store)
{
  int i;
  spell *sp = 0;
  char token[32];

  store->r_tok_buf(store, token, sizeof(token));
  i = atoi(token);
  if (i != 0) {
    sp = find_spellbyid((unsigned int) i);
  } else {
    if (store->version<UNIQUE_SPELLS_VERSION) {
      store->r_int(store); /* ignore mtype */
    }
    sp = find_spell(token);
    if (!sp) {
      log_error("read_seenspell: could not find spell '%s'\n", token);
    }
  }
  if (!sp) {
    return AT_READ_FAIL;
  }
  a->data.v = sp;
  return AT_READ_OK;
}

static void
write_seenspell(const attrib * a, const void *owner, struct storage *store)
{
  const spell *sp = (const spell *)a->data.v;
  store->w_tok(store, sp->sname);
}

attrib_type at_seenspell = {
  "seenspell", NULL, NULL, NULL, write_seenspell, read_seenspell
};

#define MAXSPELLS 256

static bool already_seen(const faction * f, const spell * sp)
{
  attrib *a;

  for (a = a_find(f->attribs, &at_seenspell); a && a->type == &at_seenspell;
    a = a->next) {
    if (a->data.v == sp)
      return true;
  }
  return false;
}

void show_new_spells(faction * f, int level, const spellbook *book)
{
  if (book) {
    quicklist *ql = book->spells;
    int qi;

    for (qi = 0; ql; ql_advance(&ql, &qi, 1)) {
      spellbook_entry *sbe = (spellbook_entry *) ql_get(ql, qi);
      if (sbe->level <= level) {

        if (!already_seen(f, sbe->sp)) {
          attrib * a = a_new(&at_reportspell);
          spellbook_entry * entry = (spellbook_entry *)a->data.v;
          entry->level = sbe->level;
          entry->sp = sbe->sp;
          a_add(&f->attribs, a);
          a_add(&f->attribs, a_new(&at_seenspell))->data.v = sbe->sp;
        }
      }
    }
  }
}

/** update the spellbook with a new level
* Written for E3
*/
void pick_random_spells(faction * f, int level, spellbook * book, int num_spells)
{
  spellbook_entry *commonspells[MAXSPELLS];
  int qi, numspells = 0;
  quicklist *ql;

  if (level <= f->max_spelllevel) {
    return;
  }

  for (qi = 0, ql = book->spells; ql; ql_advance(&ql, &qi, 1)) {
    spellbook_entry * sbe = (spellbook_entry *) ql_get(ql, qi);
    if (sbe->level <= level) {
      commonspells[numspells++] = sbe;
    }
  }

  while (numspells > 0 && level > f->max_spelllevel) {
    int i;

    ++f->max_spelllevel;
    for (i = 0; i < num_spells; ++i) {
      int maxspell = numspells;
      int spellno = -1;
      spellbook_entry *sbe = 0;
      while (!sbe && maxspell>0) {
        spellno = rng_int() % maxspell;
        sbe = commonspells[spellno];
        if (sbe->level>f->max_spelllevel) {
          commonspells[spellno] = commonspells[--maxspell];
          commonspells[maxspell] = sbe;
          sbe = 0;
        } else if (f->spellbook && spellbook_get(f->spellbook, sbe->sp)) {
          commonspells[spellno] = commonspells[--numspells];
          if (maxspell>numspells) {
            maxspell = numspells;
          }
          sbe = 0;
        }
      }

      if (spellno<maxspell) {
        if (!f->spellbook) {
          f->spellbook = create_spellbook(0);
        }
        spellbook_add(f->spellbook, sbe->sp, sbe->level);
        commonspells[spellno] = commonspells[--numspells];
      }
    }
  }
}

/* ------------------------------------------------------------- */
/* Erzeugen eines neuen Magiers */
sc_mage *create_mage(unit * u, magic_t mtyp)
{
  sc_mage *mage;
  attrib *a;

  a = a_find(u->attribs, &at_mage);
  if (a != NULL) {
    a_remove(&u->attribs, a);
  }
  a = a_add(&u->attribs, a_new(&at_mage));
  mage = a->data.v;

  mage->magietyp = mtyp;
  return mage;
}

/* ------------------------------------------------------------- */
/* Funktionen f<>r die Bearbeitung der List-of-known-spells */

int u_hasspell(const unit *u, const struct spell *sp)
{
  spellbook * book = unit_get_spellbook(u);
  spellbook_entry * sbe = book ? spellbook_get(book, sp) : 0;
  if (sbe) {
    return sbe->level<=effskill(u, SK_MAGIC);
  }
  return 0;
}

/* ------------------------------------------------------------- */
/* Eingestellte Kampfzauberstufe ermitteln */

int get_combatspelllevel(const unit * u, int nr)
{
  sc_mage *m = get_mage(u);

  assert(nr < MAXCOMBATSPELLS);
  if (m) {
    int level = eff_skill(u, SK_MAGIC, u->region);
    return MIN(m->combatspells[nr].level, level);
  }
  return -1;
}

/* ------------------------------------------------------------- */
/* Kampfzauber ermitteln, setzen oder l<>schen */

const spell *get_combatspell(const unit * u, int nr)
{
  sc_mage *m;

  assert(nr < MAXCOMBATSPELLS);
  m = get_mage(u);
  if (m) {
    return m->combatspells[nr].sp;
  } else if (u->race->precombatspell != NULL) {
    return u->race->precombatspell;
  }

  return NULL;
}

void set_combatspell(unit * u, spell * sp, struct order *ord, int level)
{
  sc_mage *mage = get_mage(u);
  int i = -1;

  assert(mage || !"trying to set a combat spell for non-mage");

  /* knowsspell pr<70>ft auf ist_magier, ist_spruch, kennt_spruch */
  if (!knowsspell(u->region, u, sp)) {
    /* Fehler 'Spell not found' */
    cmistake(u, ord, 173, MSG_MAGIC);
    return;
  }
  if (!u_hasspell(u, sp)) {
    /* Diesen Zauber kennt die Einheit nicht */
    cmistake(u, ord, 169, MSG_MAGIC);
    return;
  }
  if (!(sp->sptyp & ISCOMBATSPELL)) {
    /* Diesen Kampfzauber gibt es nicht */
    cmistake(u, ord, 171, MSG_MAGIC);
    return;
  }

  if (sp->sptyp & PRECOMBATSPELL)
    i = 0;
  else if (sp->sptyp & COMBATSPELL)
    i = 1;
  else if (sp->sptyp & POSTCOMBATSPELL)
    i = 2;
  assert(i >= 0);
  mage->combatspells[i].sp = sp;
  mage->combatspells[i].level = level;
  return;
}

void unset_combatspell(unit * u, spell * sp)
{
  sc_mage *m;
  int nr = 0;
  int i;

  m = get_mage(u);
  if (!m)
    return;

  if (!sp) {
    for (i = 0; i < MAXCOMBATSPELLS; i++) {
      m->combatspells[i].sp = NULL;
    }
  } else if (sp->sptyp & PRECOMBATSPELL) {
    if (sp != get_combatspell(u, 0))
      return;
  } else if (sp->sptyp & COMBATSPELL) {
    if (sp != get_combatspell(u, 1)) {
      return;
    }
    nr = 1;
  } else if (sp->sptyp & POSTCOMBATSPELL) {
    if (sp != get_combatspell(u, 2)) {
      return;
    }
    nr = 2;
  }
  m->combatspells[nr].sp = NULL;
  m->combatspells[nr].level = 0;
  return;
}

/* ------------------------------------------------------------- */
/* Gibt die aktuelle Anzahl der Magiepunkte der Einheit zur<75>ck */
int get_spellpoints(const unit * u)
{
  sc_mage *m;

  m = get_mage(u);
  if (!m)
    return 0;

  return m->spellpoints;
}

void set_spellpoints(unit * u, int sp)
{
  sc_mage *m;

  m = get_mage(u);
  if (!m)
    return;

  m->spellpoints = sp;

  return;
}

/*
 * ver<EFBFBD>ndert die Anzahl der Magiepunkte der Einheit um +mp
 */
int change_spellpoints(unit * u, int mp)
{
  sc_mage *m;
  int sp;

  m = get_mage(u);
  if (!m) {
    return 0;
  }

  /* verhindere negative Magiepunkte */
  sp = MAX(m->spellpoints + mp, 0);
  m->spellpoints = sp;

  return sp;
}

/* bietet die M<>glichkeit, die maximale Anzahl der Magiepunkte mit
 * Regionszaubern oder Attributen zu beinflussen
 */
static int get_spchange(const unit * u)
{
  sc_mage *m;

  m = get_mage(u);
  if (!m)
    return 0;

  return m->spchange;
}

/* ein Magier kann normalerweise maximal Stufe^2.1/1.2+1 Magiepunkte
 * haben.
 * Manche Rassen haben einen zus<EFBFBD>tzlichen Multiplikator
 * Durch Talentverlust (zB Insekten im Berg) k<EFBFBD>nnen negative Werte
 * entstehen
 */

/* Artefakt der St<53>rke
 * Erm<EFBFBD>glicht dem Magier mehr Magiepunkte zu 'speichern'
 */
/** TODO: at_skillmod daraus machen */
static int use_item_aura(const region * r, const unit * u)
{
  int sk, n;

  sk = eff_skill(u, SK_MAGIC, r);
  n = (int)(sk * sk * u->race->maxaura / 4);

  return n;
}

int max_spellpoints(const region * r, const unit * u)
{
  int sk;
  double n, msp;
  double potenz = 2.1;
  double divisor = 1.2;

  sk = eff_skill(u, SK_MAGIC, r);
  msp = u->race->maxaura * (pow(sk, potenz) / divisor + 1) + get_spchange(u);

  if (get_item(u, I_AURAKULUM) > 0) {
    msp += use_item_aura(r, u);
  }
  n = get_curseeffect(u->attribs, C_AURA, 0);
  if (n > 0)
    msp = (msp * n) / 100;

  return MAX((int)msp, 0);
}

int change_maxspellpoints(unit * u, int csp)
{
  sc_mage *m;

  m = get_mage(u);
  if (!m)
    return 0;

  m->spchange += csp;
  return max_spellpoints(u->region, u);
}

/* ------------------------------------------------------------- */
/* Counter f<>r die bereits gezauberte Anzahl Spr<70>che pro Runde.
 * Um nur die Zahl der bereits gezauberten Spr<EFBFBD>che zu ermitteln mit
 * step = 0 aufrufen.
 */
int countspells(unit * u, int step)
{
  sc_mage *m;
  int count;

  m = get_mage(u);
  if (!m)
    return 0;

  if (step == 0)
    return m->spellcount;

  count = m->spellcount + step;

  /* negative Werte abfangen. */
  m->spellcount = MAX(0, count);

  return m->spellcount;
}

/* ------------------------------------------------------------- */
/* Die f<>r den Spruch ben<65>tigte Aura pro Stufe.
 * Die Grundkosten pro Stufe werden hier um 2^count erh<EFBFBD>ht. Der
 * Parameter count ist dabei die Anzahl der bereits gezauberten Spr<EFBFBD>che
 */
int spellcost(unit * u, const spell * sp)
{
  int k, aura = 0;
  int count = countspells(u, 0);

  for (k = 0; sp->components[k].type; k++) {
    if (sp->components[k].type == r_aura) {
      aura = sp->components[k].amount;
    }
  }
  aura *= (1 << count);
  return aura;
}

/* ------------------------------------------------------------- */
/* SPC_LINEAR ist am h<>chstwertigen, dann m<>ssen Komponenten f<>r die
 * Stufe des Magiers vorhanden sein.
 * SPC_LINEAR hat die gew<EFBFBD>nschte Stufe als multiplikator,
 * nur SPC_FIX muss nur einmal vorhanden sein, ist also am
 * niedrigstwertigen und sollte von den beiden anderen Typen
 * <EFBFBD>berschrieben werden */
static int spl_costtyp(const spell * sp)
{
  int k;
  int costtyp = SPC_FIX;

  for (k = 0; sp->components[k].type; k++) {
    if (costtyp == SPC_LINEAR)
      return SPC_LINEAR;

    if (sp->components[k].cost == SPC_LINEAR) {
      return SPC_LINEAR;
    }

    /* wenn keine Fixkosten, Typ <20>bernehmen */
    if (sp->components[k].cost != SPC_FIX) {
      costtyp = sp->components[k].cost;
    }
  }
  return costtyp;
}

/* ------------------------------------------------------------- */
/* durch Komponenten und cast_level begrenzter maximal m<>glicher
 * Level
 * Da die Funktion nicht alle Komponenten durchprobiert sondern beim
 * ersten Fehler abbricht, muss die Fehlermeldung sp<EFBFBD>ter mit cancast()
 * generiert werden.
 * */
int eff_spelllevel(unit * u, const spell * sp, int cast_level, int range)
{
  int k, maxlevel, needplevel;
  int costtyp = SPC_FIX;

  for (k = 0; sp->components[k].type; k++) {
    if (cast_level == 0)
      return 0;

    if (sp->components[k].amount > 0) {
      /* Die Kosten f<>r Aura sind auch von der Zahl der bereits
       * gezauberten Spr<EFBFBD>che abh<EFBFBD>ngig */
      if (sp->components[k].type == r_aura) {
        needplevel = spellcost(u, sp) * range;
      } else {
        needplevel = sp->components[k].amount * range;
      }
      maxlevel =
        get_pooled(u, sp->components[k].type, GET_DEFAULT,
        needplevel * cast_level) / needplevel;

      /* sind die Kosten fix, so muss die Komponente nur einmal vorhanden
       * sein und der cast_level <EFBFBD>ndert sich nicht */
      if (sp->components[k].cost == SPC_FIX) {
        if (maxlevel < 1)
          cast_level = 0;
        /* ansonsten wird das Minimum aus maximal m<>glicher Stufe und der
         * gew<EFBFBD>nschten gebildet */
      } else if (sp->components[k].cost == SPC_LEVEL) {
        costtyp = SPC_LEVEL;
        cast_level = MIN(cast_level, maxlevel);
        /* bei Typ Linear m<>ssen die Kosten in H<>he der Stufe vorhanden
         * sein, ansonsten schl<EFBFBD>gt der Spruch fehl */
      } else if (sp->components[k].cost == SPC_LINEAR) {
        costtyp = SPC_LINEAR;
        if (maxlevel < cast_level)
          cast_level = 0;
      }
    }
  }
  /* Ein Spruch mit Fixkosten wird immer mit der Stufe des Spruchs und
   * nicht auf der Stufe des Magiers gezaubert */
  if (costtyp == SPC_FIX) {
    spellbook * spells = unit_get_spellbook(u);
    if (spells) {
      spellbook_entry * sbe = spellbook_get(spells, sp); 
      if (sbe) {
        return MIN(cast_level, sbe->level);
      }
    }
    log_error("spell %s is not in the spellbook for %s\n", sp->sname, unitname(u));
  }
  return cast_level;
}

/* ------------------------------------------------------------- */
/* Die Spruchgrundkosten werden mit der Entfernung (Farcasting)
 * multipliziert, wobei die Aurakosten ein Sonderfall sind, da sie sich
 * auch durch die Menge der bereits gezauberten Spr<EFBFBD>che erh<EFBFBD>ht.
 * Je nach Kostenart werden dann die Komponenten noch mit cast_level
 * multipliziert.
 */
void pay_spell(unit * u, const spell * sp, int cast_level, int range)
{
  int k;
  int resuse;

  assert(cast_level>0);
  for (k = 0; sp->components[k].type; k++) {
    if (sp->components[k].type == r_aura) {
      resuse = spellcost(u, sp) * range;
    } else {
      resuse = sp->components[k].amount * range;
    }

    if (sp->components[k].cost == SPC_LINEAR
      || sp->components[k].cost == SPC_LEVEL) {
      resuse *= cast_level;
    }

    use_pooled(u, sp->components[k].type, GET_DEFAULT, resuse);
  }
}

/* ------------------------------------------------------------- */
/* Ein Magier kennt den Spruch und kann sich die Beschreibung anzeigen
 * lassen, wenn diese in seiner Spruchliste steht. Zaubern muss er ihn
 * aber dann immer noch nicht k<EFBFBD>nnen, vieleicht ist seine Stufe derzeit
 * nicht ausreichend oder die Komponenten fehlen.
 */
bool knowsspell(const region * r, const unit * u, const spell * sp)
{
  /* Ist <20>berhaupt ein g<>ltiger Spruch angegeben? */
  if (!sp || sp->id == 0) {
    return false;
  }
  /* steht der Spruch in der Spruchliste? */
  return u_hasspell(u, sp)!=0;
}

/* Um einen Spruch zu beherrschen, muss der Magier die Stufe des
 * Spruchs besitzen, nicht nur wissen, das es ihn gibt (also den Spruch
 * in seiner Spruchliste haben).
 * Kosten f<EFBFBD>r einen Spruch k<EFBFBD>nnen Magiepunkte, Silber, Kraeuter
 * und sonstige Gegenstaende sein.
 */

bool
cancast(unit * u, const spell * sp, int level, int range, struct order * ord)
{
  int k;
  int itemanz;
  resource *reslist = NULL;

  if (!knowsspell(u->region, u, sp)) {
    /* Diesen Zauber kennt die Einheit nicht */
    cmistake(u, ord, 173, MSG_MAGIC);
    return false;
  }
  /* reicht die Stufe aus? */
  if (eff_skill(u, SK_MAGIC, u->region) < level) {
    /* die Einheit ist nicht erfahren genug f<>r diesen Zauber */
    cmistake(u, ord, 169, MSG_MAGIC);
    return false;
  }

  for (k = 0; sp->components[k].type; ++k) {
    if (sp->components[k].amount > 0) {
      const resource_type *rtype = sp->components[k].type;
      int itemhave;

      /* Die Kosten f<>r Aura sind auch von der Zahl der bereits
       * gezauberten Spr<EFBFBD>che abh<EFBFBD>ngig */
      if (rtype == r_aura) {
        itemanz = spellcost(u, sp) * range;
      } else {
        itemanz = sp->components[k].amount * range;
      }

      /* sind die Kosten stufenabh<62>ngig, so muss itemanz noch mit dem
       * level multipliziert werden */
      switch (sp->components[k].cost) {
      case SPC_LEVEL:
      case SPC_LINEAR:
        itemanz *= level;
        break;
      case SPC_FIX:
      default:
        break;
      }

      itemhave = get_pooled(u, rtype, GET_DEFAULT, itemanz);
      if (itemhave < itemanz) {
        resource *res = malloc(sizeof(resource));
        res->number = itemanz - itemhave;
        res->type = rtype;
        res->next = reslist;
        reslist = res;
      }
    }
  }
  if (reslist != NULL) {
    ADDMSG(&u->faction->msgs, msg_feedback(u, ord, "missing_components_list",
        "list", reslist));
    return false;
  }
  return true;
}

/* ------------------------------------------------------------- */
/* generische Spruchstaerke,
 *
 * setzt sich derzeit aus der Stufe des Magiers, Magieturmeffekt,
 * Spruchitems und Antimagiefeldern zusammen. Es koennen noch die
 * Stufe des Spruchs und Magiekosten mit einfliessen.
 *
 * Die effektive Spruchst<EFBFBD>rke und ihre Auswirkungen werden in der
 * Spruchfunktionsroutine ermittelt.
 */

double
spellpower(region * r, unit * u, const spell * sp, int cast_level,
  struct order *ord)
{
  curse *c;
  double force = cast_level;
  int elf_power = -1;

  if (sp == NULL) {
    return 0;
  } else {
    /* Bonus durch Magieturm und gesegneten Steinkreis */
    struct building *b = inside_building(u);
    const struct building_type *btype = b ? b->type : NULL;
    if (btype && btype->flags & BTF_MAGIC)
      ++force;
  }

  if (get_item(u, I_RING_OF_POWER) > 0)
    ++force;
  if (elf_power < 0) {
    elf_power = get_param_int(global.parameters, "rules.magic.elfpower", 0);
  }
  if (elf_power && u->race == new_race[RC_ELF] && r_isforest(r)) {
    ++force;
  }

  /* Antimagie in der Zielregion */
  c = get_curse(r->attribs, ct_find("antimagiczone"));
  if (curse_active(c)) {
    unit *mage = c->magician;
    force -= curse_geteffect(c);
    curse_changevigour(&r->attribs, c, (float)-cast_level);
    cmistake(u, ord, 185, MSG_MAGIC);
    if (mage != NULL && mage->faction != NULL) {
      if (force > 0) {
        ADDMSG(&mage->faction->msgs, msg_message("reduce_spell",
            "self mage region", mage, u, r));
      } else {
        ADDMSG(&mage->faction->msgs, msg_message("block_spell",
            "self mage region", mage, u, r));
      }
    }
  }

  /* Patzerfluch-Effekt: */
  c = get_curse(r->attribs, ct_find("fumble"));
  if (curse_active(c)) {
    unit *mage = c->magician;
    force -= curse_geteffect(c);
    curse_changevigour(&u->attribs, c, -1);
    cmistake(u, ord, 185, MSG_MAGIC);
    if (mage != NULL && mage->faction != NULL) {
      if (force > 0) {
        ADDMSG(&mage->faction->msgs, msg_message("reduce_spell",
            "self mage region", mage, u, r));
      } else {
        ADDMSG(&mage->faction->msgs, msg_message("block_spell",
            "self mage region", mage, u, r));
      }
    }
  }

  force = force * MagicPower();

  return MAX(force, 0);
}

/* ------------------------------------------------------------- */
/* farcasting() == 1 -> gleiche Region, da man mit Null nicht vern<72>nfigt
 * rechnen kann */
static int farcasting(unit * magician, region * r)
{
  int dist;
  int mult;

  if (!r) {
    return INT_MAX;
  }

  dist = koor_distance(r->x, r->y, magician->region->x, magician->region->y);

  if (dist > 24)
    return INT_MAX;

  mult = 1 << dist;
  if (dist > 1) {
    if (!path_exists(magician->region, r, dist * 2, allowed_fly))
      mult = INT_MAX;
  }

  return mult;
}

/* ------------------------------------------------------------- */
/* Antimagie - Magieresistenz */
/* ------------------------------------------------------------- */

/* allgemeine Magieresistenz einer Einheit,
 * reduziert magischen Schaden */
double magic_resistance(unit * target)
{
  attrib *a;
  curse *c;
  int n;
  const curse_type * ct_goodresist = 0, * ct_badresist = 0;

  /* Bonus durch Rassenmagieresistenz */
  double probability = target->race->magres;
  assert(target->number > 0);

  /* Magier haben einen Resistenzbonus vom Magietalent * 5% */
  probability += effskill(target, SK_MAGIC) * 0.05;

  /* Auswirkungen von Zaubern auf der Einheit */
  c = get_curse(target->attribs, ct_find("magicresistance"));
  if (c) {
    probability += 0.01 * curse_geteffect(c) * get_cursedmen(target, c);
  }

  /* Unicorn +10 */
  n = get_item(target, I_ELVENHORSE);
  if (n)
    probability += n * 0.1 / target->number;

  /* Auswirkungen von Zaubern auf der Region */
  a = a_find(target->region->attribs, &at_curse);
  if (a) {
    ct_badresist = ct_find("badmagicresistancezone");
    ct_goodresist = ct_find("goodmagicresistancezone");
  }
  while (a && a->type == &at_curse) {
    curse *c = (curse *) a->data.v;
    unit *mage = c->magician;

    if (mage != NULL) {
      if (ct_goodresist && c->type == ct_goodresist) {
        if (alliedunit(mage, target->faction, HELP_GUARD)) {
          probability += curse_geteffect(c) * 0.01;
          ct_goodresist = 0; /* only one effect per region */
        }
      } else if (ct_badresist && c->type == ct_badresist) {
        if (!alliedunit(mage, target->faction, HELP_GUARD)) {
          probability -= curse_geteffect(c) * 0.01;
          ct_badresist = 0; /* only one effect per region */
        }
      }
    }
    a = a->next;
  }
  /* Bonus durch Artefakte */
  /* TODO (noch gibs keine) */

  /* Bonus durch Geb<65>ude */
  {
    struct building *b = inside_building(target);
    const struct building_type *btype = b ? b->type : NULL;

    /* gesegneter Steinkreis gibt 30% dazu */
    if (btype)
      probability += btype->magresbonus * 0.01;
  }
  return probability;
}

/* ------------------------------------------------------------- */
/* Pr<50>ft, ob das Objekt dem Zauber widerstehen kann.
 * Objekte k<EFBFBD>nnen Regionen, Units, Geb<EFBFBD>ude oder Schiffe sein.
 * TYP_UNIT:
 * Das h<EFBFBD>chste Talent des Ziels ist sein 'Magieresistenz-Talent', Magier
 * bekommen einen Bonus. Grundchance ist 50%, f<EFBFBD>r jede Stufe
 * Unterschied gibt es 5%, minimalchance ist 5% f<EFBFBD>r jeden (5-95%)
 * Scheitert der Spruch an der Magieresistenz, so gibt die Funktion
 * true zur<EFBFBD>ck
 */

bool
target_resists_magic(unit * magician, void *obj, int objtyp, int t_bonus)
{
  double probability = 0.0;

  if (magician == NULL)
    return true;
  if (obj == NULL)
    return true;

  switch (objtyp) {
  case TYP_UNIT:
  {
    int at, pa = 0;
    skill *sv;
    unit *u = (unit *) obj;

    at = effskill(magician, SK_MAGIC);

    for (sv = u->skills; sv != u->skills + u->skill_size; ++sv) {
      int sk = effskill(u, sv->id);
      if (pa < sk)
        pa = sk;
    }

    /* Contest */
    probability = 0.05 * (10 + pa - at);

    probability += magic_resistance((unit *) obj);
    break;
  }

  case TYP_REGION:
    /* Bonus durch Zauber */
    probability +=
      0.01 * get_curseeffect(((region *) obj)->attribs, C_RESIST_MAGIC, 0);
    break;

  case TYP_BUILDING:
    /* Bonus durch Zauber */
    probability +=
      0.01 * get_curseeffect(((building *) obj)->attribs, C_RESIST_MAGIC, 0);

    /* Bonus durch Typ */
    probability += 0.01 * ((building *) obj)->type->magres;

    break;

  case TYP_SHIP:
    /* Bonus durch Zauber */
    probability +=
      0.01 * get_curseeffect(((ship *) obj)->attribs, C_RESIST_MAGIC, 0);
    break;
  }

  probability = MAX(0.02, probability + t_bonus * 0.01);
  probability = MIN(0.98, probability);

  /* gibt true, wenn die Zufallszahl kleiner als die chance ist und
   * false, wenn sie gleich oder gr<EFBFBD><EFBFBD>er ist, dh je gr<EFBFBD><EFBFBD>er die
   * Magieresistenz (chance) desto eher gibt die Funktion true zur<EFBFBD>ck */
  return chance(probability);
}

/* ------------------------------------------------------------- */

bool is_magic_resistant(unit * magician, unit * target, int resist_bonus)
{
  return (bool) target_resists_magic(magician, target, TYP_UNIT,
    resist_bonus);
}

/* ------------------------------------------------------------- */
/* Patzer */
/* ------------------------------------------------------------- */
/* allgemeine Zauberpatzer:
 * Treten auf, wenn die Stufe des Magieres zu niedrig ist.
 * Abhaengig von Staerke des Spruchs.
 *
 * Die Warscheinlichkeit reicht von 20% (beherrscht den Spruch gerade
 * eben) bis zu etwa 1% bei doppelt so gut wie notwendig
 */

bool fumble(region * r, unit * u, const spell * sp, int cast_grade)
{
/* X ergibt Zahl zwischen 1 und 0, je kleiner, desto besser der Magier.
 * 0,5*40-20=0, dh wenn der Magier doppelt so gut ist, wie der Spruch
 * ben<EFBFBD>tigt, gelingt er immer, ist er gleich gut, gelingt der Spruch mit
 * 20% Warscheinlichkeit nicht
 * */

  int rnd = 0;
  double x = (double)cast_grade / (double)eff_skill(u, SK_MAGIC, r);
  int patzer = (int)(((double)x * 40.0) - 20.0);
  struct building *b = inside_building(u);
  const struct building_type *btype = b ? b->type : NULL;
  int fumble_enabled = get_param_int(global.parameters, "magic.fumble.enable", 1);
  sc_mage * mage;

  if (!fumble_enabled) {
    return false;
  }
  if (btype)
    patzer -= btype->fumblebonus;

  /* CHAOSPATZERCHANCE 10 : +10% Chance zu Patzern */
  mage = get_mage(u);
  if (mage->magietyp == M_DRAIG) {
    patzer += CHAOSPATZERCHANCE;
  }
  if (is_cursed(u->attribs, C_MBOOST, 0)) {
    patzer += CHAOSPATZERCHANCE;
  }
  if (is_cursed(u->attribs, C_FUMBLE, 0)) {
    patzer += CHAOSPATZERCHANCE;
  }

  /* wenn die Chance kleiner als 0 ist, k<>nnen wir gleich false
   * zur<EFBFBD>ckgeben */
  if (patzer <= 0) {
    return false;
  }
  rnd = rng_int() % 100;

  if (rnd > patzer) {
    /* Gl<47>ck gehabt, kein Patzer */
    return false;
  }
  return true;
}

/* ------------------------------------------------------------- */
/* Dummy-Zauberpatzer, Platzhalter f<>r speziel auf die Spr<70>che
* zugeschnittene Patzer */
static void patzer(castorder * co)
{
  unit *mage = co->magician.u;

  cmistake(mage, co->order, 180, MSG_MAGIC);

  return;
}

/* Die normalen Spruchkosten m<>ssen immer bezahlt werden, hier noch
 * alle weiteren Folgen eines Patzers
 */

static void do_fumble(castorder * co)
{
  curse *c;
  region *r = co_get_region(co);
  unit *u = co->magician.u;
  const spell *sp = co->sp;
  int level = co->level;
  int duration;
  double effect;

  ADDMSG(&u->faction->msgs, msg_message("patzer", "unit region spell",
      u, r, sp));
  switch (rng_int() % 10) {
  case 0:
    /* wenn vorhanden spezieller Patzer, ansonsten nix */
    if (sp->patzer)
      sp->patzer(co);
    else
      patzer(co);
    break;

  case 1:
    /* Kr<4B>te */
  {
    /* one or two things will happen: the toad changes her race back,
     * and may or may not get toadslime.
     * The list of things to happen are attached to a timeout
     * trigger and that's added to the triggerlit of the mage gone toad.
     */
    trigger *trestore = trigger_changerace(u, u->race, u->irace);

    if (chance(0.7)) {
      const item_type *it_toadslime = it_find("toadslime");
      if (it_toadslime != NULL) {
        t_add(&trestore, trigger_giveitem(u, it_toadslime, 1));
      }
    }

    duration = rng_int() % level / 2;
    if (duration < 2)
      duration = 2;
    add_trigger(&u->attribs, "timer", trigger_timeout(duration, trestore));
    u->race = new_race[RC_TOAD];
    u->irace = NULL;
    ADDMSG(&r->msgs, msg_message("patzer6", "unit region spell", u, r, sp));
    break;
  }
    /* fall-through is intentional! */

  case 2:
    /* tempor<6F>rer Stufenverlust */
    duration = MAX(rng_int() % level / 2, 2);
    effect = -0.5 * level;
    c =
      create_curse(u, &u->attribs, ct_find("skillmod"), (float)level,
      duration, effect, 1);
    c->data.i = SK_MAGIC;
    ADDMSG(&u->faction->msgs, msg_message("patzer2", "unit region", u, r));
    break;
  case 3:
  case 4:
    /* Spruch schl<68>gt fehl, alle Magiepunkte weg */
    set_spellpoints(u, 0);
    ADDMSG(&u->faction->msgs, msg_message("patzer3", "unit region spell",
        u, r, sp));
    break;

  case 5:
  case 6:
    /* Spruch gelingt, aber alle Magiepunkte weg */
    co->level = sp->cast(co);
    set_spellpoints(u, 0);
    ADDMSG(&u->faction->msgs, msg_message("patzer4", "unit region spell",
        u, r, sp));
    break;

  case 7:
  case 8:
  case 9:
  default:
    /* Spruch gelingt, alle nachfolgenden Spr<70>che werden 2^4 so teuer */
    co->level = sp->cast(co);
    ADDMSG(&u->faction->msgs, msg_message("patzer5", "unit region spell",
        u, r, sp));
    countspells(u, 3);
  }

  return;
}

/* ------------------------------------------------------------- */
/* Regeneration von Aura */
/* ------------------------------------------------------------- */

/* Ein Magier regeneriert pro Woche W(Stufe^1.5/2+1), mindestens 1
 * Zwerge nur die H<EFBFBD>lfte
 */
static double regeneration(unit * u)
{
  int sk;
  double aura, d;
  double potenz = 1.5;
  double divisor = 2.0;

  sk = effskill(u, SK_MAGIC);
  /* Rassenbonus/-malus */
  d = pow(sk, potenz) * u->race->regaura / divisor;
  d++;

  /* Einfluss von Artefakten */
  /* TODO (noch gibs keine) */

  /* W<>rfeln */
  aura = (rng_double() * d + rng_double() * d) / 2 + 1;

  aura *= MagicRegeneration();

  return aura;
}

void regenerate_aura(void)
{
  region *r;
  unit *u;
  int aura, auramax;
  double reg_aura;
  int regen;
  double mod;
  int regen_enabled = get_param_int(global.parameters, "magic.regeneration.enable", 1);

  if (!regen_enabled) return;

  for (r = regions; r; r = r->next) {
    for (u = r->units; u; u = u->next) {
      if (u->number && is_mage(u)) {
        aura = get_spellpoints(u);
        auramax = max_spellpoints(r, u);
        if (aura < auramax) {
          struct building *b = inside_building(u);
          const struct building_type *btype = b ? b->type : NULL;
          reg_aura = regeneration(u);

          /* Magierturm erh<72>ht die Regeneration um 75% */
          /* Steinkreis erh<72>ht die Regeneration um 50% */
          if (btype)
            reg_aura *= btype->auraregen;

          /* Bonus/Malus durch Zauber */
          mod = get_curseeffect(u->attribs, C_AURA, 0);
          if (mod > 0) {
            reg_aura = (reg_aura * mod) / 100.0;
          }

          /* Einfluss von Artefakten */
          /* TODO (noch gibs keine) */

          /* maximal Differenz bis Maximale-Aura regenerieren
           * mindestens 1 Aura pro Monat */
          regen = (int)reg_aura;
          reg_aura -= regen;
          if (chance(reg_aura))
            ++regen;
          regen = MAX(1, regen);
          regen = MIN((auramax - aura), regen);

          aura += regen;
          ADDMSG(&u->faction->msgs, msg_message("regenaura",
              "unit region amount", u, r, regen));
        }
        set_spellpoints(u, MIN(aura, auramax));
      }
    }
  }
}

static bool
verify_ship(region * r, unit * mage, const spell * sp, spllprm * spobj,
  order * ord)
{
  ship *sh = findship(spobj->data.i);

  if (sh != NULL && sh->region != r && (sp->sptyp & SEARCHLOCAL)) {
    /* Burg muss in gleicher Region sein */
    sh = NULL;
  }

  if (sh == NULL) {
    /* Burg nicht gefunden */
    spobj->flag = TARGET_NOTFOUND;
    ADDMSG(&mage->faction->msgs, msg_message("spellshipnotfound",
        "unit region command id", mage, mage->region, ord, spobj->data.i));
    return false;
  }
  spobj->flag = 0;
  spobj->data.sh = sh;
  return true;
}

static bool
verify_building(region * r, unit * mage, const spell * sp, spllprm * spobj,
  order * ord)
{
  building *b = findbuilding(spobj->data.i);

  if (b != NULL && b->region != r && (sp->sptyp & SEARCHLOCAL)) {
    /* Burg muss in gleicher Region sein */
    b = NULL;
  }

  if (b == NULL) {
    /* Burg nicht gefunden */
    spobj->flag = TARGET_NOTFOUND;
    ADDMSG(&mage->faction->msgs, msg_message("spellbuildingnotfound",
        "unit region command id", mage, mage->region, ord, spobj->data.i));
    return false;
  }
  spobj->flag = 0;
  spobj->data.b = b;
  return true;
}

message *msg_unitnotfound(const struct unit * mage, struct order * ord,
  const struct spllprm * spobj)
{
  /* Einheit nicht gefunden */
  char tbuf[20];
  const char *uid;

  if (spobj->typ == SPP_UNIT) {
    uid = itoa36(spobj->data.i);
  } else {
    sprintf(tbuf, "%s %s", LOC(mage->faction->locale,
        parameters[P_TEMP]), itoa36(spobj->data.i));
    uid = tbuf;
  }
  return msg_message("unitnotfound_id",
    "unit region command id", mage, mage->region, ord, uid);
}

static bool
verify_unit(region * r, unit * mage, const spell * sp, spllprm * spobj,
  order * ord)
{
  unit *u = NULL;
  switch (spobj->typ) {
  case SPP_UNIT:
    u = findunit(spobj->data.i);
    break;
  case SPP_TEMP:
    u = findnewunit(r, mage->faction, spobj->data.i);
    if (u == NULL)
      u = findnewunit(mage->region, mage->faction, spobj->data.i);
    break;
  default:
    assert(!"shouldn't happen, this");
  }
  if (u != NULL && (sp->sptyp & SEARCHLOCAL)) {
    if (u->region != r)
      u = NULL;
    else if (sp->sptyp & TESTCANSEE) {
      if (!cansee(mage->faction, r, u, 0) && !ucontact(u, mage)) {
        u = NULL;
      }
    }
  }

  if (u == NULL) {
    /* Einheit nicht gefunden */
    spobj->flag = TARGET_NOTFOUND;
    ADDMSG(&mage->faction->msgs, msg_unitnotfound(mage, ord, spobj));
    return false;
  }
  /* Einheit wurde gefunden, pointer setzen */
  spobj->flag = 0;
  spobj->data.u = u;
  return true;
}

/* ------------------------------------------------------------- */
/* Zuerst wird versucht alle noch nicht gefundenen Objekte zu finden
 * oder zu pr<EFBFBD>fen, ob das gefundene Objekt wirklich h<EFBFBD>tte gefunden
 * werden d<EFBFBD>rfen (nicht alle Zauber wirken global). Dabei z<EFBFBD>hlen wir die
 * Misserfolge (failed).
 * Dann folgen die Tests der gefundenen Objekte auf Magieresistenz und
 * Sichtbarkeit. Dabei z<EFBFBD>hlen wir die magieresistenten (resists)
 * Objekte. Alle anderen werten wir als Erfolge (success) */

/* gibt bei Misserfolg 0 zur<75>ck, bei Magieresistenz zumindeste eines
 * Objektes 1 und bei Erfolg auf ganzer Linie 2 */
static void
verify_targets(castorder * co, int *invalid, int *resist, int *success)
{
  unit *mage = co->magician.u;
  const spell *sp = co->sp;
  region *target_r = co_get_region(co);
  spellparameter *sa = co->par;
  int i;

  *invalid = 0;
  *resist = 0;
  *success = 0;

  if (sa && sa->length) {
    /* zuerst versuchen wir vorher nicht gefundene Objekte zu finden.
     * Wurde ein Objekt durch globalsuche gefunden, obwohl der Zauber
     * gar nicht global h<EFBFBD>tte suchen d<EFBFBD>rften, setzen wir das Objekt
     * zur<EFBFBD>ck. */
    for (i = 0; i < sa->length; i++) {
      spllprm *spobj = sa->param[i];

      switch (spobj->typ) {
      case SPP_TEMP:
      case SPP_UNIT:
        if (!verify_unit(target_r, mage, sp, spobj, co->order))
          ++ * invalid;
        break;
      case SPP_BUILDING:
        if (!verify_building(target_r, mage, sp, spobj, co->order))
          ++ * invalid;
        break;
      case SPP_SHIP:
        if (!verify_ship(target_r, mage, sp, spobj, co->order))
          ++ * invalid;
        break;
      default:
        break;
      }
    }

    /* Nun folgen die Tests auf cansee und Magieresistenz */
    for (i = 0; i < sa->length; i++) {
      spllprm *spobj = sa->param[i];
      unit *u;
      building *b;
      ship *sh;
      region *tr;

      if (spobj->flag == TARGET_NOTFOUND)
        continue;
      switch (spobj->typ) {
      case SPP_TEMP:
      case SPP_UNIT:
        u = spobj->data.u;

        if ((sp->sptyp & TESTRESISTANCE)
          && target_resists_magic(mage, u, TYP_UNIT, 0)) {
          /* Fehlermeldung */
          spobj->data.i = u->no;
          spobj->flag = TARGET_RESISTS;
          ++*resist;
          ADDMSG(&mage->faction->msgs, msg_message("spellunitresists",
              "unit region command target", mage, mage->region, co->order, u));
          break;
        }

        /* TODO: Test auf Parteieigenschaft Magieresistsenz */
        ++*success;
        break;
      case SPP_BUILDING:
        b = spobj->data.b;

        if ((sp->sptyp & TESTRESISTANCE)
          && target_resists_magic(mage, b, TYP_BUILDING, 0)) {  /* Fehlermeldung */
          spobj->data.i = b->no;
          spobj->flag = TARGET_RESISTS;
          ++*resist;
          ADDMSG(&mage->faction->msgs, msg_message("spellbuildingresists",
              "unit region command id",
              mage, mage->region, co->order, spobj->data.i));
          break;
        }
        ++*success;
        break;
      case SPP_SHIP:
        sh = spobj->data.sh;

        if ((sp->sptyp & TESTRESISTANCE)
          && target_resists_magic(mage, sh, TYP_SHIP, 0)) {     /* Fehlermeldung */
          spobj->data.i = sh->no;
          spobj->flag = TARGET_RESISTS;
          ++*resist;
          ADDMSG(&mage->faction->msgs, msg_feedback(mage, co->order,
              "spellshipresists", "ship", sh));
          break;
        }
        ++*success;
        break;

      case SPP_REGION:
        /* haben wir ein Regionsobjekt, dann wird auch dieses und
           nicht target_r <EFBFBD>berpr<EFBFBD>ft. */
        tr = spobj->data.r;

        if ((sp->sptyp & TESTRESISTANCE)
          && target_resists_magic(mage, tr, TYP_REGION, 0)) {   /* Fehlermeldung */
          spobj->flag = TARGET_RESISTS;
          ++*resist;
          ADDMSG(&mage->faction->msgs, msg_message("spellregionresists",
              "unit region command", mage, mage->region, co->order));
          break;
        }
        ++*success;
        break;
      case SPP_INT:
      case SPP_STRING:
        ++*success;
        break;

      default:
        break;
      }
    }
  } else {
    /* der Zauber hat keine expliziten Parameter/Ziele, es kann sich
     * aber um einen Regionszauber handeln. Wenn notwendig hier die
     * Magieresistenz der Region pr<EFBFBD>fen. */
    if ((sp->sptyp & REGIONSPELL)) {
      /* Zielobjekt Region anlegen */
      spllprm *spobj = (spllprm *)malloc(sizeof(spllprm));
      spobj->flag = 0;
      spobj->typ = SPP_REGION;
      spobj->data.r = target_r;

      sa = calloc(1, sizeof(spellparameter));
      sa->length = 1;
      sa->param = calloc(sa->length, sizeof(spllprm *));
      sa->param[0] = spobj;
      co->par = sa;

      if ((sp->sptyp & TESTRESISTANCE)) {
        if (target_resists_magic(mage, target_r, TYP_REGION, 0)) {
          /* Fehlermeldung */
          ADDMSG(&mage->faction->msgs, msg_message("spellregionresists",
              "unit region command", mage, mage->region, co->order));
          spobj->flag = TARGET_RESISTS;
          ++*resist;
        } else {
          ++*success;
        }
      } else {
        ++*success;
      }
    } else {
      ++*success;
    }
  }
}

/* ------------------------------------------------------------- */
/* Hilfsstrukturen f<>r ZAUBERE */
/* ------------------------------------------------------------- */

static void free_spellparameter(spellparameter * pa)
{
  int i;

  /* Elemente free'en */
  for (i = 0; i < pa->length; i++) {

    switch (pa->param[i]->typ) {
    case SPP_STRING:
      free(pa->param[i]->data.s);
      break;
    default:
      break;
    }
    free(pa->param[i]);
  }

  if (pa->param)
    free(pa->param);
  /* struct free'en */
  free(pa);
}

static int addparam_string(const char *const param[], spllprm ** spobjp)
{
  spllprm *spobj = *spobjp = malloc(sizeof(spllprm));
  assert(param[0]);

  spobj->flag = 0;
  spobj->typ = SPP_STRING;
  spobj->data.xs = strdup(param[0]);
  return 1;
}

static int addparam_int(const char *const param[], spllprm ** spobjp)
{
  spllprm *spobj = *spobjp = malloc(sizeof(spllprm));
  assert(param[0]);

  spobj->flag = 0;
  spobj->typ = SPP_INT;
  spobj->data.i = atoi((char *)param[0]);
  return 1;
}

static int addparam_ship(const char *const param[], spllprm ** spobjp)
{
  spllprm *spobj = *spobjp = malloc(sizeof(spllprm));
  int id = atoi36((const char *)param[0]);

  spobj->flag = 0;
  spobj->typ = SPP_SHIP;
  spobj->data.i = id;
  return 1;
}

static int addparam_building(const char *const param[], spllprm ** spobjp)
{
  spllprm *spobj = *spobjp = malloc(sizeof(spllprm));
  int id = atoi36((const char *)param[0]);

  spobj->flag = 0;
  spobj->typ = SPP_BUILDING;
  spobj->data.i = id;
  return 1;
}

static int
addparam_region(const char *const param[], spllprm ** spobjp, const unit * u,
  order * ord, plane * pl)
{
  assert(param[0]);
  if (param[1] == 0) {
    /* Fehler: Zielregion vergessen */
    cmistake(u, ord, 194, MSG_MAGIC);
    return -1;
  } else {
    int tx = atoi((const char *)param[0]), ty = atoi((const char *)param[1]);
    int x = rel_to_abs(pl, u->faction, tx, 0);
    int y = rel_to_abs(pl, u->faction, ty, 1);
    region *rt;

    pnormalize(&x, &y, pl);
    rt = findregion(x, y);

    if (rt != NULL) {
      spllprm *spobj = *spobjp = (spllprm *)malloc(sizeof(spllprm));

      spobj->flag = 0;
      spobj->typ = SPP_REGION;
      spobj->data.r = rt;
    } else {
      /* Fehler: Zielregion vergessen */
      cmistake(u, ord, 194, MSG_MAGIC);
      return -1;
    }
    return 2;
  }
}

static int
addparam_unit(const char *const param[], spllprm ** spobjp, const unit * u,
  order * ord)
{
  spllprm *spobj;
  int i = 0;
  sppobj_t otype = SPP_UNIT;

  *spobjp = NULL;
  if (isparam(param[0], u->faction->locale, P_TEMP)) {
    if (param[1] == NULL) {
      /* Fehler: Ziel vergessen */
      cmistake(u, ord, 203, MSG_MAGIC);
      return -1;
    }
    ++i;
    otype = SPP_TEMP;
  }

  spobj = *spobjp = malloc(sizeof(spllprm));
  spobj->flag = 0;
  spobj->typ = otype;
  spobj->data.i = atoi36((const char *)param[i]);

  return i + 1;
}

static spellparameter *add_spellparameter(region * target_r, unit * u,
  const char *syntax, const char *const param[], int size, struct order *ord)
{
  bool fail = false;
  int i = 0;
  int p = 0;
  const char *c;
  spellparameter *par;
  int minlen = 0;

  for (c = syntax; *c != 0; ++c) {
    /* this makes sure that:
     *  minlen("kc?") = 0
     *  minlen("kc+") = 1
     *  minlen("cccc+c?") = 4
     */
    if (*c == '?')
      --minlen;
    else if (*c != '+' && *c != 'k')
      ++minlen;
  }
  c = syntax;

  /* mindestens ein Ziel (Ziellose Zauber werden nicht
   * geparst) */
  if (minlen && size == 0) {
    /* Fehler: Ziel vergessen */
    cmistake(u, ord, 203, MSG_MAGIC);
    return 0;
  }

  par = malloc(sizeof(spellparameter));
  par->length = size;
  if (!size) {
    par->param = NULL;
    return par;
  }
  par->param = malloc(size * sizeof(spllprm *));

  while (!fail && *c && i < size && param[i] != NULL) {
    spllprm *spobj = NULL;
    int j = -1;
    switch (*c) {
    case '?':
      /* tja. das sollte moeglichst nur am Ende passieren, 
       * weil sonst die kacke dampft. */
      j = 0;
      ++c;
      assert(*c == 0);
      break;
    case '+':
      /* das vorhergehende Element kommt ein oder mehrmals vor, wir
       * springen zum key zur<EFBFBD>ck */
      j = 0;
      --c;
      break;
    case 'u':
      /* Parameter ist eine Einheit, evtl. TEMP */
      j = addparam_unit(param + i, &spobj, u, ord);
      ++c;
      break;
    case 'r':
      /* Parameter sind zwei Regionskoordinaten */
      /* this silly thing only works in the normal plane! */
      j = addparam_region(param + i, &spobj, u, ord, get_normalplane());
      ++c;
      break;
    case 'b':
      /* Parameter ist eine Burgnummer */
      j = addparam_building(param + i, &spobj);
      ++c;
      break;
    case 's':
      j = addparam_ship(param + i, &spobj);
      ++c;
      break;
    case 'c':
      /* Text, wird im Spruch ausgewertet */
      j = addparam_string(param + i, &spobj);
      ++c;
      break;
    case 'i':                  /* Zahl */
      j = addparam_int(param + i, &spobj);
      ++c;
      break;
    case 'k':
      ++c;
      switch (findparam_ex(param[i++], u->faction->locale)) {
      case P_REGION:
        spobj = (spllprm *)malloc(sizeof(spllprm));
        spobj->flag = 0;
        spobj->typ = SPP_REGION;
        spobj->data.r = target_r;
        j = 0;
        ++c;
        break;
      case P_UNIT:
        if (i < size) {
          j = addparam_unit(param + i, &spobj, u, ord);
          ++c;
        }
        break;
      case P_BUILDING:
      case P_GEBAEUDE:
        if (i < size) {
          j = addparam_building(param + i, &spobj);
          ++c;
        }
        break;
      case P_SHIP:
        if (i < size) {
          j = addparam_ship(param + i, &spobj);
          ++c;
        }
        break;
      default:
        j = -1;
        break;
      }
      break;
    default:
      j = -1;
      break;
    }
    if (j < 0)
      fail = true;
    else {
      if (spobj != NULL)
        par->param[p++] = spobj;
      i += j;
    }
  }

  /* im Endeffekt waren es evtl. nur p parameter (wegen TEMP) */
  par->length = p;
  if (fail || par->length < minlen) {
    cmistake(u, ord, 209, MSG_MAGIC);
    free_spellparameter(par);
    return NULL;
  }

  return par;
}

struct unit * co_get_caster(struct castorder * co) {
  return co->_familiar ? co->_familiar : co->magician.u;
}

struct region * co_get_region(struct castorder * co) {
  return co->_rtarget;
}

castorder *create_castorder(castorder * co, unit *caster, unit * familiar, const spell * sp, region * r,
  int lev, double force, int range, struct order * ord, spellparameter * p)
{
  if (!co) co = (castorder*)calloc(1, sizeof(castorder));

  co->magician.u = caster;
  co->_familiar = familiar;
  co->sp = sp;
  co->level = lev;
  co->force = force;
  co->_rtarget = r ? r : (familiar ? familiar->region : (caster ? caster->region : 0));
  co->distance = range;
  co->order = copy_order(ord);
  co->par = p;

  return co;
}

void free_castorder(struct castorder *co)
{
  if (co->par) free_spellparameter(co->par);
  if (co->order) free_order(co->order);
}

/* H<>nge c-order co an die letze c-order von cll an */
void add_castorder(spellrank * cll, castorder * co)
{
  if (cll->begin == NULL) {
    cll->end = &cll->begin;
  }

  *cll->end = co;
  cll->end = &co->next;

  return;
}

void free_castorders(castorder * co)
{
  castorder *co2;

  while (co) {
    co2 = co;
    co = co->next;
    free_castorder(co2);
    free(co2);
  }
  return;
}

/* ------------------------------------------------------------- */
/***
 ** at_familiarmage
 **/

typedef struct familiar_data {
  unit *mage;
  unit *familiar;
} famililar_data;

bool is_familiar(const unit * u)
{
  attrib *a = a_find(u->attribs, &at_familiarmage);
  return i2b(a != NULL);
}

static void
a_write_unit(const attrib * a, const void *owner, struct storage *store)
{
  unit *u = (unit *) a->data.v;
  write_unit_reference(u, store);
}

static int sm_familiar(const unit * u, const region * r, skill_t sk, int value)
{                               /* skillmod */
  if (sk == SK_MAGIC)
    return value;
  else {
    int mod;
    unit *familiar = get_familiar(u);
    if (familiar == NULL) {
      /* the familiar is dead */
      return value;
    }
    mod = eff_skill(familiar, sk, r) / 2;
    if (r != familiar->region) {
      mod /= distance(r, familiar->region);
    }
    return value + mod;
  }
}

static void set_familiar(unit * mage, unit * familiar)
{
  /* if the skill modifier for the mage does not yet exist, add it */
  attrib *a = a_find(mage->attribs, &at_skillmod);
  while (a && a->type == &at_skillmod) {
    skillmod_data *smd = (skillmod_data *) a->data.v;
    if (smd->special == sm_familiar)
      break;
    a = a->next;
  }
  if (a == NULL) {
    attrib *an = a_add(&mage->attribs, a_new(&at_skillmod));
    skillmod_data *smd = (skillmod_data *) an->data.v;
    smd->special = sm_familiar;
    smd->skill = NOSKILL;
  }

  a = a_find(mage->attribs, &at_familiar);
  if (a == NULL) {
    a = a_add(&mage->attribs, a_new(&at_familiar));
    a->data.v = familiar;
  } else
    assert(!a->data.v || a->data.v == familiar);
  /* TODO: Diese Attribute beim Tod des Familiars entfernen: */

  a = a_find(familiar->attribs, &at_familiarmage);
  if (a == NULL) {
    a = a_add(&familiar->attribs, a_new(&at_familiarmage));
    a->data.v = mage;
  } else
    assert(!a->data.v || a->data.v == mage);
}

void remove_familiar(unit * mage)
{
  attrib *a = a_find(mage->attribs, &at_familiar);
  attrib *an;
  skillmod_data *smd;

  if (a != NULL) {
    a_remove(&mage->attribs, a);
  }
  a = a_find(mage->attribs, &at_skillmod);
  while (a && a->type == &at_skillmod) {
    an = a->next;
    smd = (skillmod_data *) a->data.v;
    if (smd->special == sm_familiar)
      a_remove(&mage->attribs, a);
    a = an;
  }
}

bool create_newfamiliar(unit * mage, unit * familiar)
{
  /* if the skill modifier for the mage does not yet exist, add it */
  attrib *a;
  attrib *afam = a_find(mage->attribs, &at_familiar);
  attrib *amage = a_find(familiar->attribs, &at_familiarmage);

  if (afam == NULL) {
    afam = a_add(&mage->attribs, a_new(&at_familiar));
  }
  afam->data.v = familiar;
  if (amage == NULL) {
    amage = a_add(&familiar->attribs, a_new(&at_familiarmage));
  }
  amage->data.v = mage;

  /* TODO: Diese Attribute beim Tod des Familiars entfernen: */
  /* Wenn der Magier stirbt, dann auch der Vertraute */
  add_trigger(&mage->attribs, "destroy", trigger_killunit(familiar));
  /* Wenn der Vertraute stirbt, dann bekommt der Magier einen Schock */
  add_trigger(&familiar->attribs, "destroy", trigger_shock(mage));

  a = a_find(mage->attribs, &at_skillmod);
  while (a && a->type == &at_skillmod) {
    skillmod_data *smd = (skillmod_data *) a->data.v;
    if (smd->special == sm_familiar)
      break;
    a = a->next;
  }
  if (a == NULL) {
    attrib *an = a_add(&mage->attribs, a_new(&at_skillmod));
    skillmod_data *smd = (skillmod_data *) an->data.v;
    smd->special = sm_familiar;
    smd->skill = NOSKILL;
  }
  return true;
}

static int resolve_familiar(variant data, void *addr)
{
  unit *familiar;
  int result = resolve_unit(data, &familiar);
  if (result == 0 && familiar) {
    attrib *a = a_find(familiar->attribs, &at_familiarmage);
    if (a != NULL && a->data.v) {
      unit *mage = (unit *) a->data.v;
      set_familiar(mage, familiar);
    }
  }
  *(unit **) addr = familiar;
  return result;
}

static int read_familiar(attrib * a, void *owner, struct storage *store)
{
  int result =
    read_reference(&a->data.v, store, read_unit_reference, resolve_familiar);
  if (result == 0 && a->data.v == NULL) {
    return AT_READ_FAIL;
  }
  return AT_READ_OK;
}

/* clones */

void create_newclone(unit * mage, unit * clone)
{
  attrib *a;

  a = a_find(mage->attribs, &at_clone);
  if (a == NULL) {
    a = a_add(&mage->attribs, a_new(&at_clone));
    a->data.v = clone;
  } else
    assert(!a->data.v || a->data.v == clone);
  /* TODO: Diese Attribute beim Tod des Klons entfernen: */

  a = a_find(clone->attribs, &at_clonemage);
  if (a == NULL) {
    a = a_add(&clone->attribs, a_new(&at_clonemage));
    a->data.v = mage;
  } else
    assert(!a->data.v || a->data.v == mage);

  /* Wenn der Magier stirbt, wird das in destroy_unit abgefangen.
   * Kein Trigger, zu kompliziert. */

  /* Wenn der Klon stirbt, dann bekommt der Magier einen Schock */
  add_trigger(&clone->attribs, "destroy", trigger_clonedied(mage));
}

static void set_clone(unit * mage, unit * clone)
{
  attrib *a;

  a = a_find(mage->attribs, &at_clone);
  if (a == NULL) {
    a = a_add(&mage->attribs, a_new(&at_clone));
    a->data.v = clone;
  } else
    assert(!a->data.v || a->data.v == clone);

  a = a_find(clone->attribs, &at_clonemage);
  if (a == NULL) {
    a = a_add(&clone->attribs, a_new(&at_clonemage));
    a->data.v = mage;
  } else
    assert(!a->data.v || a->data.v == mage);
}

unit *has_clone(unit * mage)
{
  attrib *a = a_find(mage->attribs, &at_clone);
  if (a)
    return (unit *) a->data.v;
  return NULL;
}

static int resolve_clone(variant data, void *addr)
{
  unit *clone;
  int result = resolve_unit(data, &clone);
  if (result == 0 && clone) {
    attrib *a = a_find(clone->attribs, &at_clonemage);
    if (a != NULL && a->data.v) {
      unit *mage = (unit *) a->data.v;
      set_clone(mage, clone);
    }
  }
  *(unit **) addr = clone;
  return result;
}

static int read_clone(attrib * a, void *owner, struct storage *store)
{
  int result =
    read_reference(&a->data.v, store, read_unit_reference, resolve_clone);
  if (result == 0 && a->data.v == NULL) {
    return AT_READ_FAIL;
  }
  return AT_READ_OK;
}

/* mages */

static int resolve_mage(variant data, void *addr)
{
  unit *mage;
  int result = resolve_unit(data, &mage);
  if (result == 0 && mage) {
    attrib *a = a_find(mage->attribs, &at_familiar);
    if (a != NULL && a->data.v) {
      unit *familiar = (unit *) a->data.v;
      set_familiar(mage, familiar);
    }
  }
  *(unit **) addr = mage;
  return result;
}

static int read_magician(attrib * a, void *owner, struct storage *store)
{
  int result =
    read_reference(&a->data.v, store, read_unit_reference, resolve_mage);
  if (result == 0 && a->data.v == NULL) {
    return AT_READ_FAIL;
  }
  return AT_READ_OK;
}

static int age_unit(attrib * a)
/* if unit is gone or dead, remove the attribute */
{
  unit *u = (unit *) a->data.v;
  return (u != NULL && u->number > 0) ? AT_AGE_KEEP : AT_AGE_REMOVE;
}

attrib_type at_familiarmage = {
  "familiarmage",
  NULL,
  NULL,
  age_unit,
  a_write_unit,
  read_magician,
  ATF_UNIQUE
};

attrib_type at_familiar = {
  "familiar",
  NULL,
  NULL,
  age_unit,
  a_write_unit,
  read_familiar,
  ATF_UNIQUE
};

attrib_type at_clonemage = {
  "clonemage",
  NULL,
  NULL,
  age_unit,
  a_write_unit,
  read_magician,
  ATF_UNIQUE
};

attrib_type at_clone = {
  "clone",
  NULL,
  NULL,
  age_unit,
  a_write_unit,
  read_clone,
  ATF_UNIQUE
};

unit *get_familiar(const unit * u)
{
  attrib *a = a_find(u->attribs, &at_familiar);
  if (a != NULL) {
    unit *u = (unit *) a->data.v;
    if (u->number > 0)
      return u;
  }
  return NULL;
}

unit *get_familiar_mage(const unit * u)
{
  attrib *a = a_find(u->attribs, &at_familiarmage);
  if (a != NULL) {
    unit *u = (unit *) a->data.v;
    if (u->number > 0)
      return u;
  }
  return NULL;
}

unit *get_clone(const unit * u)
{
  attrib *a = a_find(u->attribs, &at_clone);
  if (a != NULL) {
    unit *u = (unit *) a->data.v;
    if (u->number > 0)
      return u;
  }
  return NULL;
}

unit *get_clone_mage(const unit * u)
{
  attrib *a = a_find(u->attribs, &at_clonemage);
  if (a != NULL) {
    unit *u = (unit *) a->data.v;
    if (u->number > 0)
      return u;
  }
  return NULL;
}

static bool is_moving_ship(const region * r, ship * sh)
{
  const unit *u = ship_owner(sh);

  if (u)
    switch (get_keyword(u->thisorder)) {
    case K_ROUTE:
    case K_MOVE:
    case K_FOLLOW:
      return true;
    default:
      return false;
    }
  return false;
}

static castorder *cast_cmd(unit * u, order * ord)
{
  region *r = u->region;
  region *target_r = r;
  int level, range;
  unit *familiar = NULL;
  const char *s;
  spell *sp = 0;
  plane *pl;
  spellparameter *args = NULL;
  unit * caster = u;
  param_t param;

  if (LongHunger(u)) {
    cmistake(u, ord, 224, MSG_MAGIC);
    return 0;
  }
  pl = rplane(r);
  if (pl && fval(pl, PFL_NOMAGIC)) {
    cmistake(u, ord, 269, MSG_MAGIC);
    return 0;
  }
  level = eff_skill(u, SK_MAGIC, r);

  init_tokens(ord);
  skip_token();
  s = getstrtoken();
  param = findparam(s, u->faction->locale);
  /* f<>r Syntax ' STUFE x REGION y z ' */
  if (param == P_LEVEL) {
    int p = getint();
    level = MIN(p, level);
    if (level < 1) {
      /* Fehler "Das macht wenig Sinn" */
      cmistake(u, ord, 10, MSG_MAGIC);
      return 0;
    }
    s = getstrtoken();
    param = findparam(s, u->faction->locale);
  }
  if (param == P_REGION) {
    int t_x = getint();
    int t_y = getint();
    plane *pl = getplane(u->region);
    t_x = rel_to_abs(pl, u->faction, t_x, 0);
    t_y = rel_to_abs(pl, u->faction, t_y, 1);
    pnormalize(&t_x, &t_y, pl);
    target_r = findregion(t_x, t_y);
    if (!target_r) {
      /* Fehler "Die Region konnte nicht verzaubert werden" */
      ADDMSG(&u->faction->msgs, msg_message("spellregionresists",
          "unit region command", u, u->region, ord));
      return 0;
    }
    s = getstrtoken();
    param = findparam(s, u->faction->locale);
  }
  /* f<>r Syntax ' REGION x y STUFE z '
   * hier nach REGION nochmal auf STUFE pr<EFBFBD>fen */
  if (param == P_LEVEL) {
    int p = getint();
    level = MIN(p, level);
    if (level < 1) {
      /* Fehler "Das macht wenig Sinn" */
      cmistake(u, ord, 10, MSG_MAGIC);
      return 0;
    }
    s = getstrtoken();
  }
  if (!s[0] || strlen(s) == 0) {
    /* Fehler "Es wurde kein Zauber angegeben" */
    cmistake(u, ord, 172, MSG_MAGIC);
    return 0;
  }

  sp = unit_getspell(u, s, u->faction->locale);

  /* Vertraute k<>nnen auch Zauber sprechen, die sie selbst nicht
   * k<EFBFBD>nnen. unit_getspell findet aber nur jene Spr<EFBFBD>che, die
   * die Einheit beherrscht. */
  if (!sp && is_familiar(u)) {
    caster = get_familiar_mage(u);
    if (caster) {
      familiar = u;
      sp = unit_getspell(caster, s, caster->faction->locale);
    } else {
      /* somehow, this familiar has no mage! */
      log_error("cast_cmd: familiar %s is without a mage?\n", unitname(u));
      caster = u;
    }
  }

  if (!sp) {
    /* Fehler 'Spell not found' */
    cmistake(u, ord, 173, MSG_MAGIC);
    return 0;
  }
  /* um testen auf spruchnamen zu unterbinden sollte vor allen
   * fehlermeldungen die anzeigen das der magier diesen Spruch
   * nur in diese Situation nicht anwenden kann, noch eine
   * einfache Sicherheitspr<EFBFBD>fung kommen */
  if (!knowsspell(r, u, sp)) {
    /* vorsicht! u kann der familiar sein */
    if (!familiar) {
      cmistake(u, ord, 173, MSG_MAGIC);
      return 0;
    }
  }
  if (sp->sptyp & ISCOMBATSPELL) {
    /* Fehler: "Dieser Zauber ist nur im Kampf sinnvoll" */
    cmistake(u, ord, 174, MSG_MAGIC);
    return 0;
  }
  /* Auf dem Ozean Zaubern als quasi-langer Befehl k<>nnen
   * normalerweise nur Meermenschen, ausgenommen explizit als
   * OCEANCASTABLE deklarierte Spr<EFBFBD>che */
  if (fval(r->terrain, SEA_REGION)) {
    if (u->race != new_race[RC_AQUARIAN]
      && !fval(u->race, RCF_SWIM)
      && !(sp->sptyp & OCEANCASTABLE)) {
      /* Fehlermeldung */
      ADDMSG(&u->faction->msgs, msg_message("spellfail_onocean",
          "unit region command", u, u->region, ord));
      return 0;
    }
    /* Auf bewegenden Schiffen kann man nur explizit als
     * ONSHIPCAST deklarierte Zauber sprechen */
  } else if (u->ship) {
    if (is_moving_ship(r, u->ship)) {
      if (!(sp->sptyp & ONSHIPCAST)) {
        /* Fehler: "Diesen Spruch kann man nicht auf einem sich
         * bewegenden Schiff stehend zaubern" */
        cmistake(u, ord, 175, MSG_MAGIC);
        return 0;
      }
    }
  }
  /* Farcasting bei nicht farcastbaren Spr<70>chen abfangen */
  range = farcasting(u, target_r);
  if (range > 1) {
    if (!(sp->sptyp & FARCASTING)) {
      /* Fehler "Diesen Spruch kann man nicht in die Ferne
       * richten" */
      cmistake(u, ord, 176, MSG_MAGIC);
      return 0;
    }
    if (range > 1024) {         /* (2^10) weiter als 10 Regionen entfernt */
      ADDMSG(&u->faction->msgs, msg_feedback(u, ord, "spellfail::nocontact",
          "target", target_r));
      return 0;
    }
  }
  /* Stufenangabe bei nicht Stufenvariierbaren Spr<70>chen abfangen */
  if (!(sp->sptyp & SPELLLEVEL)) {
    int ilevel = eff_skill(u, SK_MAGIC, u->region);
    if (ilevel != level) {
      level = ilevel;
      ADDMSG(&u->faction->msgs, msg_message("spellfail::nolevel",
          "mage region command", u, u->region, ord));
    }
  }
  /* Vertrautenmagie */
  /* Kennt der Vertraute den Spruch, so zaubert er ganz normal.
   * Ansonsten zaubert der Magier durch seinen Vertrauten, dh
   * zahlt Komponenten und Aura. Dabei ist die maximale Stufe
   * die des Vertrauten!
   * Der Spruch wirkt dann auf die Region des Vertrauten und
   * gilt nicht als Farcasting. */
  if (familiar) {
    if ((sp->sptyp & NOTFAMILIARCAST)) {
      /* Fehler: "Diesen Spruch kann der Vertraute nicht zaubern" */
      cmistake(u, ord, 177, MSG_MAGIC);
      return 0;
    }
    if (caster != familiar) {        /* Magier zaubert durch Vertrauten */
      if (range > 1) {          /* Fehler! Versucht zu Farcasten */
        ADDMSG(&u->faction->msgs, msg_feedback(u, ord, "familiar_farcast",
            "mage", caster));
        return 0;
      }
      if (distance(caster->region, r) > eff_skill(caster, SK_MAGIC, caster->region)) {
        ADDMSG(&u->faction->msgs, msg_feedback(u, ord, "familiar_toofar",
            "mage", caster));
        return 0;
      }
      /* mage auf magier setzen, level anpassen, range f<>r Erh<72>hung
       * der Spruchkosten nutzen, langen Befehl des Magiers
       * l<EFBFBD>schen, zaubern kann er noch */
      range *= 2;
      set_order(&caster->thisorder, NULL);
      level = MIN(level, eff_skill(caster, SK_MAGIC, caster->region) / 2);
    }
  }
  /* Weitere Argumente zusammenbasteln */
  if (sp->parameter) {
    char **params = (char**)malloc(2 * sizeof(char *));
    int p = 0, size = 2;
    for (;;) {
      s = getstrtoken();
      if (*s == 0)
        break;
      if (p + 1 >= size) {
        size *= 2;
        params = (char**)realloc(params, sizeof(char *) * size);
      }
      params[p++] = strdup(s);
    }
    params[p] = 0;
    args =
      add_spellparameter(target_r, caster, sp->parameter,
      (const char *const *)params, p, ord);
    for (p = 0; params[p]; ++p)
      free(params[p]);
    free(params);
    if (args == NULL) {
      /* Syntax war falsch */
      return 0;
    }
  }
  return create_castorder(0, caster, familiar, sp, target_r, level, 0, range, ord,
    args);
}

/* ------------------------------------------------------------- */
/* Damit man keine Rituale in fremden Gebiet machen kann, diese vor
 * Bewegung zaubern. Magier sind also in einem fremden Gebiet eine Runde
 * lang verletzlich, da sie es betreten, und angegriffen werden k<EFBFBD>nnen,
 * bevor sie ein Ritual machen k<EFBFBD>nnen.
 *
 * Syntax: ZAUBER [REGION X Y] [STUFE <stufe>] "Spruchname" [Einheit-1
 * Einheit-2 ..]
 *
 * Nach Priorit<EFBFBD>t geordnet die Zauber global auswerten.
 *
 * Die Kosten f<EFBFBD>r Farcasting multiplizieren sich mit der Entfernung,
 * cast_level gibt die virtuelle Stufe an, die den durch das Farcasten
 * entstandenen Spruchkosten entspricht.  Sind die Spruchkosten nicht
 * levelabh<EFBFBD>ngig, so sind die Kosten nur von der Entfernung bestimmt,
 * die St<EFBFBD>rke/Level durch den realen Skill des Magiers
 */

void magic(void)
{
  region *r;
  int rank;
  castorder *co;
  spellrank spellranks[MAX_SPELLRANK];

  memset(spellranks, 0, sizeof(spellranks));

  for (r = regions; r; r = r->next) {
    unit *u;
    for (u = r->units; u; u = u->next) {
      order *ord;

      if (u->number <= 0 || u->race == new_race[RC_SPELL])
        continue;

      if (u->race == new_race[RC_INSECT] && r_insectstalled(r) &&
        !is_cursed(u->attribs, C_KAELTESCHUTZ, 0))
        continue;

      if (fval(u, UFL_WERE | UFL_LONGACTION)) {
        continue;
      }

      for (ord = u->orders; ord; ord = ord->next) {
        if (get_keyword(ord) == K_CAST) {
          castorder *co = cast_cmd(u, ord);
          fset(u, UFL_LONGACTION | UFL_NOTMOVING);
          if (co) {
            const spell *sp = co->sp;
            add_castorder(&spellranks[sp->rank], co);
          }
        }
      }
    }
  }

  /* Da sich die Aura und Komponenten in der Zwischenzeit ver<65>ndert
   * haben k<EFBFBD>nnen und sich durch vorherige Spr<EFBFBD>che das Zaubern
   * erschwert haben kann, muss beim zaubern erneut gepr<EFBFBD>ft werden, ob der
   * Spruch <EFBFBD>berhaupt gezaubert werden kann.
   * (level) die effektive St<EFBFBD>rke des Spruchs (= Stufe, auf der der
   * Spruch gezaubert wird) */

  for (rank = 0; rank < MAX_SPELLRANK; rank++) {
    for (co = spellranks[rank].begin; co; co = co->next) {
      order *ord = co->order;
      int invalid, resist, success, cast_level = co->level;
      bool fumbled = false;
      unit *u = co->magician.u;
      const spell *sp = co->sp;
      region *target_r = co_get_region(co);

      /* reichen die Komponenten nicht, wird der Level reduziert. */
      co->level = eff_spelllevel(u, sp, cast_level, co->distance);

      if (co->level < 1) {
        /* Fehlermeldung mit Komponenten generieren */
        cancast(u, sp, cast_level, co->distance, ord);
        continue;
      }

      if (cast_level > co->level) {
        /* Spr<70>che mit Fixkosten werden immer auf Stufe des Spruchs
         * gezaubert, co->level ist aber defaultm<EFBFBD><EFBFBD>ig Stufe des Magiers */
        if (spl_costtyp(sp) != SPC_FIX) {
          ADDMSG(&u->faction->msgs, msg_message("missing_components",
              "unit spell level", u, sp, cast_level));
        }
      }

      /* Pr<50>fen, ob die realen Kosten f<>r die gew<65>nschten Stufe bezahlt
       * werden k<EFBFBD>nnen */
      if (!cancast(u, sp, co->level, co->distance, ord)) {
        /* die Fehlermeldung wird in cancast generiert */
        continue;
      }

      co->force = spellpower(target_r, u, sp, co->level, ord);
      /* die St<53>rke kann durch Antimagie auf 0 sinken */
      if (co->force <= 0) {
        co->force = 0;
        ADDMSG(&u->faction->msgs, msg_message("missing_force",
            "unit spell level", u, sp, co->level));
      }

      /* Ziele auf Existenz pr<70>fen und Magieresistenz feststellen. Wurde
       * kein Ziel gefunden, so ist verify_targets=0. Scheitert der
       * Spruch an der Magieresistenz, so ist verify_targets = 1, bei
       * Erfolg auf ganzer Linie ist verify_targets= 2
       */
      verify_targets(co, &invalid, &resist, &success);
      if (success + resist == 0) {
        /* kein Ziel gefunden, Fehlermeldungen sind in verify_targets */
        /* keine kosten f<>r den zauber */
        continue;               /* <20>u<EFBFBD>ere Schleife, n<>chster Zauberer */
      } else if (co->force > 0 && resist > 0) {
        /* einige oder alle Ziele waren magieresistent */
        if (success == 0) {
          co->force = 0;
          /* zwar wurde mindestens ein Ziel gefunden, das widerstand
           * jedoch dem Zauber. Kosten abziehen und abbrechen. */
          ADDMSG(&u->faction->msgs, msg_message("spell_resist",
              "unit region spell", u, r, sp));
        }
      }

      /* Auch f<>r Patzer gibt es Erfahrung, m<>ssen die Spruchkosten
       * bezahlt werden und die nachfolgenden Spr<EFBFBD>che werden teurer */
      if (co->force > 0) {
        if (fumble(target_r, u, sp, co->level)) {
          /* zuerst bezahlen, dann evt in do_fumble alle Aura verlieren */
          fumbled = true;
        } else {
          co->level = sp->cast(co);
          if (co->level <= 0) {
            /* Kosten nur f<>r real ben<65>tige Stufe berechnen */
            continue;
          }
        }
      }
      /* erst bezahlen, dann Kostenz<6E>hler erh<72>hen */
      if (fumbled) {
        do_fumble(co);
      }
      if (co->level>0) {
        pay_spell(u, sp, co->level, co->distance);
      }
      countspells(u, 1);
    }
  }

  /* Sind alle Zauber gesprochen gibts Erfahrung */
  for (r = regions; r; r = r->next) {
    unit *u;
    for (u = r->units; u; u = u->next) {
      if (is_mage(u) && countspells(u, 0) > 0) {
        produceexp(u, SK_MAGIC, u->number);
        /* Spruchlistenaktualiesierung ist in Regeneration */
      }
    }
  }
  for (rank = 0; rank < MAX_SPELLRANK; rank++) {
    free_castorders(spellranks[rank].begin);
  }
  remove_empty_units();
}

const char *spell_info(const spell * sp, const struct locale *lang)
{
  return LOC(lang, mkname("spellinfo", sp->sname));
}

const char *spell_name(const spell * sp, const struct locale *lang)
{
  return LOC(lang, mkname("spell", sp->sname));
}

const char *curse_name(const curse_type * ctype, const struct locale *lang)
{
  return LOC(lang, mkname("spell", ctype->cname));
}

spell *unit_getspell(struct unit *u, const char *name, const struct locale * lang)
{
  sc_mage * mage = get_mage(u);
  if (mage) {
    variant token;
    void * tokens = 0;
    spellbook *sb = unit_get_spellbook(u);

    if (sb) {
      quicklist * ql;
      int qi;

      for (qi = 0, ql = sb->spells; ql; ql_advance(&ql, &qi, 1)) {
        spellbook_entry *sbe = (spellbook_entry *)ql_get(ql, qi);
        spell *sp = sbe->sp;
        const char *n = spell_name(sp, lang);
        if (!n) {
          log_error("no translation in locale %s for spell %s\n", locale_name(lang), sp->sname);
        } else {
          token.v = sp;
          addtoken(&tokens, n, token);
        }
      }
    }

    if (tokens) {
      if (findtoken(tokens, name, &token) != E_TOK_NOMATCH) {
        freetokens(tokens);
        return (spell *) token.v;
      }
      freetokens(tokens);
    }
  }
  return 0;
}

static critbit_tree cb_spellbooks;

spellbook * get_spellbook(const char * name)
{
  char buffer[64];
  spellbook * result;
  const void * match;

  if (cb_find_prefix(&cb_spellbooks, name, strlen(name), &match, 1, 0)) {
    cb_get_kv(match, &result, sizeof(result));
  } else {
    size_t len = strlen(name);
    result = create_spellbook(name);
    assert(strlen(name)+sizeof(result)<sizeof(buffer));
    len = cb_new_kv(name, len, &result, sizeof(result), buffer);
    cb_insert(&cb_spellbooks, buffer, len);
  }
  return result;
}

void free_spellbooks(void)
{
  cb_clear(&cb_spellbooks);
}