forked from github/server
korrektur.c[hc] are no longer in use. surprise!
This commit is contained in:
parent
db7ad62677
commit
a90235aa3c
|
@ -19,7 +19,6 @@
|
|||
|
||||
#include "eressea/console.c"
|
||||
#include "eressea/editing.c"
|
||||
#include "eressea/korrektur.c"
|
||||
|
||||
#include "common/gamecode/archetype.c"
|
||||
#include "common/gamecode/creation.c"
|
||||
|
|
|
@ -75,7 +75,6 @@ LUASERVER_SOURCES =
|
|||
<common!iniparser>iniparser.c
|
||||
<curses>listbox.c
|
||||
server.c
|
||||
korrektur.c
|
||||
console.c
|
||||
editing.c
|
||||
gmtool.c
|
||||
|
|
|
@ -381,10 +381,6 @@
|
|||
RelativePath=".\Jamfile"
|
||||
>
|
||||
</File>
|
||||
<File
|
||||
RelativePath=".\korrektur.c"
|
||||
>
|
||||
</File>
|
||||
<File
|
||||
RelativePath=".\server.c"
|
||||
>
|
||||
|
|
|
@ -1,966 +0,0 @@
|
|||
/* vi: set ts=2:
|
||||
*
|
||||
* Eressea PB(E)M host Copyright (C) 1998-2003
|
||||
* Christian Schlittchen (corwin@amber.kn-bremen.de)
|
||||
* Katja Zedel (katze@felidae.kn-bremen.de)
|
||||
* Henning Peters (faroul@beyond.kn-bremen.de)
|
||||
* Enno Rehling (enno@eressea.de)
|
||||
* Ingo Wilken (Ingo.Wilken@informatik.uni-oldenburg.de)
|
||||
*
|
||||
* based on:
|
||||
*
|
||||
* Atlantis v1.0 13 September 1993 Copyright 1993 by Russell Wallace
|
||||
* Atlantis v1.7 Copyright 1996 by Alex Schröder
|
||||
*
|
||||
* This program may not be used, modified or distributed without
|
||||
* prior permission by the authors of Eressea.
|
||||
* This program may not be sold or used commercially without prior written
|
||||
* permission from the authors.
|
||||
*/
|
||||
|
||||
#include <config.h>
|
||||
#include <kernel/types.h>
|
||||
|
||||
/* misc includes */
|
||||
#include <attributes/key.h>
|
||||
#include <attributes/otherfaction.h>
|
||||
#include <attributes/targetregion.h>
|
||||
#include <modules/autoseed.h>
|
||||
#include <modules/xecmd.h>
|
||||
#include <spells/spells.h>
|
||||
|
||||
/* gamecode includes */
|
||||
#include <gamecode/economy.h>
|
||||
#include <gamecode/monster.h>
|
||||
#include <gamecode/study.h>
|
||||
|
||||
/* kernel includes */
|
||||
#include <kernel/alchemy.h>
|
||||
#include <kernel/alliance.h>
|
||||
#include <kernel/connection.h>
|
||||
#include <kernel/building.h>
|
||||
#include <kernel/calendar.h>
|
||||
#include <kernel/equipment.h>
|
||||
#include <kernel/eressea.h>
|
||||
#include <kernel/faction.h>
|
||||
#include <kernel/item.h>
|
||||
#include <kernel/magic.h>
|
||||
#include <kernel/message.h>
|
||||
#include <kernel/move.h>
|
||||
#include <kernel/names.h>
|
||||
#include <kernel/pathfinder.h>
|
||||
#include <kernel/plane.h>
|
||||
#include <kernel/pool.h>
|
||||
#include <kernel/race.h>
|
||||
#include <kernel/region.h>
|
||||
#include <kernel/reports.h>
|
||||
#include <kernel/resources.h>
|
||||
#include <kernel/ship.h>
|
||||
#include <kernel/skill.h>
|
||||
#include <kernel/spell.h>
|
||||
#include <kernel/spellid.h>
|
||||
#include <kernel/teleport.h>
|
||||
#include <kernel/terrain.h>
|
||||
#include <kernel/terrainid.h>
|
||||
#include <kernel/unit.h>
|
||||
#include <kernel/version.h>
|
||||
|
||||
/* util includes */
|
||||
#include <util/attrib.h>
|
||||
#include <util/base36.h>
|
||||
#include <util/event.h>
|
||||
#include <util/goodies.h>
|
||||
#include <util/language.h>
|
||||
#include <util/log.h>
|
||||
#include <util/rand.h>
|
||||
#include <util/resolve.h>
|
||||
#include <util/rng.h>
|
||||
#include <util/sql.h>
|
||||
|
||||
/* libc includes */
|
||||
#include <stdio.h>
|
||||
#include <ctype.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <assert.h>
|
||||
|
||||
#undef XMAS1999
|
||||
#undef XMAS2000
|
||||
#undef XMAS2001
|
||||
#undef XMAS2002
|
||||
|
||||
static int
|
||||
curse_emptiness(void)
|
||||
{
|
||||
const curse_type * ct = ct_find("godcursezone");
|
||||
region * r;
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
unit * u = r->units;
|
||||
if (r->land==NULL) continue;
|
||||
if (fval(r, RF_CHAOTIC)) continue;
|
||||
if (r->terrain == newterrain(T_GLACIER)) continue;
|
||||
if (r->age<=200) continue;
|
||||
if (get_curse(r->attribs, ct)) continue;
|
||||
while (u && is_monsters(u->faction)) u=u->next;
|
||||
if (u==NULL) fset(r, RF_MARK);
|
||||
}
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
if (fval(r, RF_MARK)) {
|
||||
direction_t d;
|
||||
for (d=0;d!=MAXDIRECTIONS;++d) {
|
||||
region * rn = rconnect(r,d);
|
||||
if (rn==NULL) continue;
|
||||
if (fval(rn, RF_MARK) || get_curse(rn->attribs, ct)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (d!=MAXDIRECTIONS) {
|
||||
double effect = 0.0;
|
||||
curse * c;
|
||||
c = create_curse(NULL, &r->attribs, ct, 100, 100, effect, 0);
|
||||
}
|
||||
freset(r, RF_MARK);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void
|
||||
verify_owners(boolean bOnce)
|
||||
{
|
||||
region * r;
|
||||
|
||||
for (r=regions;r;r=r->next) {
|
||||
unit * u;
|
||||
boolean bFail = false;
|
||||
|
||||
for (u=r->units;u;u=u->next) {
|
||||
if (u->building) {
|
||||
unit * bo = buildingowner(r, u->building);
|
||||
if (!fval(bo, UFL_OWNER)) {
|
||||
log_error(("[verify_owners] %u ist Besitzer von %s, hat aber UFL_OWNER nicht.\n", unitname(bo), buildingname(u->building)));
|
||||
bFail = true;
|
||||
if (bOnce) break;
|
||||
}
|
||||
if (bo!=u && fval(u, UFL_OWNER)) {
|
||||
log_error(("[verify_owners] %u ist NICHT Besitzer von %s, hat aber UFL_OWNER.\n", unitname(u), buildingname(u->building)));
|
||||
bFail = true;
|
||||
if (bOnce) break;
|
||||
}
|
||||
}
|
||||
if (u->ship) {
|
||||
unit * bo = shipowner(u->ship);
|
||||
if (bo && !fval(bo, UFL_OWNER)) {
|
||||
log_error(("[verify_owners] %u ist Besitzer von %s, hat aber UFL_OWNER nicht.\n", unitname(bo), shipname(u->ship)));
|
||||
bFail = true;
|
||||
if (bOnce) break;
|
||||
}
|
||||
if (bo!=u && fval(u, UFL_OWNER)) {
|
||||
log_error(("[verify_owners] %u ist NICHT Besitzer von %s, hat aber UFL_OWNER.\n", unitname(u), shipname(u->ship)));
|
||||
bFail = true;
|
||||
if (bOnce) break;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (bFail) reorder_units(r);
|
||||
}
|
||||
}
|
||||
|
||||
/* make sure that this is done only once! */
|
||||
static void
|
||||
do_once(const char * magic_id, int (*fptr)(void))
|
||||
{
|
||||
attrib * a = find_key(global.attribs, atoi36(magic_id));
|
||||
if (!a) {
|
||||
log_warning(("[do_once] a unique fix %d=\"%s\" was applied.\n", atoi36(magic_id), magic_id));
|
||||
if (fptr() == 0) a_add(&global.attribs, make_key(atoi36(magic_id)));
|
||||
}
|
||||
}
|
||||
|
||||
int
|
||||
warn_items(void)
|
||||
{
|
||||
boolean found = 0;
|
||||
region * r;
|
||||
const item_type * it_money = it_find("money");
|
||||
for (r=regions;r;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units;u;u=u->next) {
|
||||
item * itm;
|
||||
for (itm=u->items;itm;itm=itm->next) {
|
||||
if (itm->number>100000 && itm->type!=it_money) {
|
||||
found = 1;
|
||||
log_error(("Einheit %s hat %u %s\n",
|
||||
unitid(u), itm->number,
|
||||
resourcename(itm->type->rtype, 0)));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return found;
|
||||
}
|
||||
|
||||
static boolean
|
||||
kor_teure_talente(unit *u)
|
||||
{
|
||||
const skill_t expskills[] = { SK_ALCHEMY, SK_HERBALISM, SK_MAGIC, SK_SPY, SK_TACTICS, NOSKILL };
|
||||
skill * sv = u->skills;
|
||||
for (;sv!=u->skills+u->skill_size;++sv) {
|
||||
int l = 0, h = 5;
|
||||
skill_t sk = sv->id;
|
||||
assert(expskills[h]==NOSKILL);
|
||||
while (l<h) {
|
||||
int m = (l+h)/2;
|
||||
if (sk==expskills[m]) return true;
|
||||
else if (sk>expskills[m]) l=m+1;
|
||||
else h=m;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
static void
|
||||
no_teurefremde(boolean convert)
|
||||
{
|
||||
const curse_type * slave_ct = ct_find("slavery");
|
||||
faction * f;
|
||||
|
||||
for (f=factions;f;f=f->next) {
|
||||
if (!is_monsters(f)) {
|
||||
unit *u;
|
||||
for (u=f->units;u;u=u->nextF) {
|
||||
if (is_migrant(u) && kor_teure_talente(u)) {
|
||||
if (slave_ct && curse_active(get_curse(u->attribs, slave_ct)))
|
||||
continue;
|
||||
log_warning(("Teurer Migrant: %s, Partei %s\n", unitname(u), factionname(f)));
|
||||
if (convert) {
|
||||
u->race = f->race;
|
||||
u->irace = NULL;
|
||||
ADDMSG(&u->faction->msgs, msg_message("migrant_conversion", "unit", u));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
extern plane * arena;
|
||||
|
||||
static void
|
||||
fix_age(void)
|
||||
{
|
||||
faction * f;
|
||||
const race * oldorc = rc_find("orc");
|
||||
const race * uruk = rc_find("uruk");
|
||||
for (f=factions;f;f=f->next) {
|
||||
if (!is_monsters(f) && playerrace(f->race)) continue;
|
||||
if (f->race==oldorc) f->race = uruk;
|
||||
else if (f->age!=turn) {
|
||||
log_printf("Alter von Partei %s auf %d angepasst.\n", factionid(f), turn);
|
||||
f->age = turn;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
fix_otherfaction(void)
|
||||
{
|
||||
int count = 0;
|
||||
region * r;
|
||||
for (r=regions;r;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units;u;u=u->next) {
|
||||
attrib * a = a_find(u->attribs, &at_otherfaction);
|
||||
if (a!=NULL) {
|
||||
faction * f = (faction*)a->data.v;
|
||||
if (f==u->faction) {
|
||||
a_remove(&u->attribs, a);
|
||||
++count;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
if (count) log_error(("%u units had otherfaction=own faction.\n", count));
|
||||
}
|
||||
|
||||
static int
|
||||
fix_demands(void)
|
||||
{
|
||||
region *r;
|
||||
|
||||
for (r=regions; r; r=r->next) {
|
||||
if (r->land!=NULL && r->land->demands==NULL) {
|
||||
fix_demand(r);
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
#include <kernel/group.h>
|
||||
static void
|
||||
fix_allies(void)
|
||||
{
|
||||
faction * f;
|
||||
for (f=factions;f;f=f->next) {
|
||||
group * g;
|
||||
for (g=f->groups;g;g=g->next) {
|
||||
ally ** ap=&g->allies;
|
||||
while (*ap) {
|
||||
ally * an, * a = *ap;
|
||||
for (an = a->next;an;an=an->next) {
|
||||
if (a->faction==an->faction) {
|
||||
*ap = a->next;
|
||||
free(a);
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (an==NULL) ap = &(*ap)->next;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#include <triggers/timeout.h>
|
||||
#include <triggers/changerace.h>
|
||||
#include <triggers/changefaction.h>
|
||||
#include <triggers/createcurse.h>
|
||||
#include <triggers/createunit.h>
|
||||
#include <triggers/killunit.h>
|
||||
#include <triggers/giveitem.h>
|
||||
|
||||
typedef struct handler_info {
|
||||
char * event;
|
||||
trigger * triggers;
|
||||
} handler_info;
|
||||
|
||||
typedef struct timeout_data_fix {
|
||||
trigger * triggers;
|
||||
int timer;
|
||||
variant trigger_data;
|
||||
} timeout_data_fix;
|
||||
|
||||
trigger *
|
||||
get_timeout(trigger * td, trigger * tfind)
|
||||
{
|
||||
trigger * t = td;
|
||||
while (t) {
|
||||
if (t->type==&tt_timeout) {
|
||||
timeout_data_fix * tdata = (timeout_data_fix *)t->data.v;
|
||||
trigger * tr = tdata->triggers;
|
||||
while (tr) {
|
||||
if (tr==tfind) break;
|
||||
tr=tr->next;
|
||||
}
|
||||
if (tr==tfind) break;
|
||||
}
|
||||
t=t->next;
|
||||
}
|
||||
return t;
|
||||
}
|
||||
|
||||
#include <triggers/shock.h>
|
||||
#include <triggers/killunit.h>
|
||||
|
||||
static int
|
||||
fix_undead(void)
|
||||
{
|
||||
region * r;
|
||||
for (r=regions;r;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units;u;u=u->next) {
|
||||
if (u->race!=u->faction->race && u->skill_size>20) {
|
||||
skill * sm = get_skill(u, SK_MAGIC);
|
||||
skill * sa = get_skill(u, SK_HERBALISM);
|
||||
|
||||
if (sm && sa) {
|
||||
int lvl = sm->level;
|
||||
attrib * a = a_find(u->attribs, &at_mage);
|
||||
if (a) {
|
||||
a_remove(&u->attribs, a);
|
||||
}
|
||||
free(u->skills);
|
||||
u->skills = 0;
|
||||
u->skill_size = 0;
|
||||
|
||||
log_warning(("fixing skills for %s %s, level %d.\n", u->race->_name[0], itoa36(u->no), lvl));
|
||||
|
||||
if (lvl>0) {
|
||||
const race * rc = u->race;
|
||||
skill_t sk;
|
||||
for (sk=0;sk!=MAXSKILLS;++sk) {
|
||||
if (rc->bonus[sk]>0) {
|
||||
set_level(u, sk, lvl);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int
|
||||
road_decay(void)
|
||||
{
|
||||
const struct building_type * bt_caravan, * bt_dam, * bt_tunnel;
|
||||
region * r;
|
||||
|
||||
bt_caravan = bt_find("caravan");
|
||||
bt_dam = bt_find("dam");
|
||||
bt_tunnel = bt_find("tunnel");
|
||||
|
||||
for (r=regions;r;r=r->next) {
|
||||
boolean half = false;
|
||||
if (r->terrain == newterrain(T_SWAMP)) {
|
||||
/* wenn kein Damm existiert */
|
||||
if (!buildingtype_exists(r, bt_dam)) {
|
||||
half = true;
|
||||
}
|
||||
}
|
||||
else if (r->terrain == newterrain(T_DESERT)) {
|
||||
/* wenn keine Karawanserei existiert */
|
||||
if (!buildingtype_exists(r, bt_caravan)) {
|
||||
half = true;
|
||||
}
|
||||
}
|
||||
else if (r->terrain == newterrain(T_GLACIER)) {
|
||||
/* wenn kein Tunnel existiert */
|
||||
if (!buildingtype_exists(r, bt_tunnel)) {
|
||||
half = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (half) {
|
||||
direction_t d;
|
||||
short maxt = r->terrain->max_road;
|
||||
/* Falls Karawanserei, Damm oder Tunnel einstürzen, wird die schon
|
||||
* gebaute Straße zur Hälfte vernichtet */
|
||||
for (d=0;d!=MAXDIRECTIONS;++d) {
|
||||
if (rroad(r, d) > maxt) {
|
||||
rsetroad(r, d, maxt);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
#if GLOBAL_WARMING
|
||||
|
||||
static void
|
||||
iceberg(region * r)
|
||||
{
|
||||
direction_t d;
|
||||
for (d=0;d!=MAXDIRECTIONS;++d) {
|
||||
region * rn = rconnect(r, d);
|
||||
if (rn!=NULL) {
|
||||
terrain_t rt = rterrain(rn);
|
||||
if (rt!=T_ICEBERG && rt!=T_ICEBERG_SLEEP && rt!=T_GLACIER && rt!=T_OCEAN) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (d==MAXDIRECTIONS) {
|
||||
terraform_region(r, newterrain(T_ICEBERG_SLEEP));
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
global_warming(void)
|
||||
{
|
||||
region * r;
|
||||
for (r=regions;r;r=r->next) {
|
||||
if (r->age<GLOBAL_WARMING) continue;
|
||||
if (rterrain(r)==T_GLACIER) {
|
||||
/* 1% chance that an existing glacier gets unstable */
|
||||
if (chance(0.01)) {
|
||||
iceberg(r);
|
||||
}
|
||||
} else if (rterrain(r)==T_ICEBERG || rterrain(r)==T_ICEBERG_SLEEP) {
|
||||
direction_t d;
|
||||
for (d=0;d!=MAXDIRECTIONS;++d) {
|
||||
region * rn = rconnect(r, d);
|
||||
if (rn && rterrain(rn)==T_GLACIER && chance(0.10)) {
|
||||
/* 10% chance that a glacier next to an iceberg gets unstable */
|
||||
iceberg(rn);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
static int
|
||||
fix_astralplane(void)
|
||||
{
|
||||
plane * astralplane = get_astralplane();
|
||||
region ** rs_p = ®ions;
|
||||
faction * monsters = get_monsters();
|
||||
int fixes = 0;
|
||||
|
||||
if (astralplane==NULL || monsters==NULL) return 0;
|
||||
|
||||
freset(astralplane, PFL_NOFEED);
|
||||
set_ursprung(monsters, astralplane->id, 0, 0);
|
||||
|
||||
while (*rs_p) {
|
||||
region * rs = *rs_p;
|
||||
if (rs->terrain == newterrain(T_FIREWALL) && rplane(rs)==NULL) {
|
||||
region * ra = r_standard_to_astral(rs);
|
||||
if (ra && ra->terrain != newterrain(T_ASTRALB)) {
|
||||
unit * u;
|
||||
char name[128];
|
||||
++fixes;
|
||||
for (u=ra->units;u;u=u->next) {
|
||||
if (!is_monsters(u->faction)) break;
|
||||
}
|
||||
if (u) {
|
||||
log_printf("could not fix fog in %s because of %s.\n", regionname(ra, NULL), unitname(u));
|
||||
}
|
||||
else {
|
||||
while (ra->units) {
|
||||
remove_unit(&ra->units, ra->units);
|
||||
}
|
||||
/* regionname uses an internal buffer, so we can't clal it twice (ugh) */
|
||||
write_regionname(rs, NULL, name, sizeof(name));
|
||||
log_printf("protecting %s by blocking astral space in %s.\n", name, regionname(ra, NULL));
|
||||
terraform_region(ra, newterrain(T_ASTRALB));
|
||||
}
|
||||
}
|
||||
}
|
||||
rs_p = &rs->next;
|
||||
}
|
||||
|
||||
for (rs_p = ®ions;*rs_p;) {
|
||||
region * rs = *rs_p;
|
||||
if (fval(rs->terrain, FORBIDDEN_REGION)) {
|
||||
while (rs->units) {
|
||||
unit * u = rs->units;
|
||||
if (is_monsters(u->faction)) {
|
||||
i_freeall(&u->items);
|
||||
remove_unit(&rs->units, u);
|
||||
} else {
|
||||
log_error(("unit %s is stuck in %s\n", unitname(u), regionname(rs, NULL)));
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
rs_p = &rs->next;
|
||||
}
|
||||
log_printf("fixed %d fog/firewall regions.\n", fixes);
|
||||
return 0;
|
||||
}
|
||||
|
||||
extern connection *borders[];
|
||||
|
||||
#define BORDER_MAXHASH 8191
|
||||
static void
|
||||
fix_road_borders(void)
|
||||
{
|
||||
#define MAXDEL 10000
|
||||
connection *deleted[MAXDEL];
|
||||
int hash;
|
||||
int fixes = 0;
|
||||
|
||||
for (hash=0; hash<BORDER_MAXHASH && fixes!=MAXDEL; hash++) {
|
||||
connection * blist;
|
||||
for (blist=borders[hash];blist && fixes!=MAXDEL;blist=blist->nexthash) {
|
||||
connection * b;
|
||||
for (b=blist;b && fixes!=MAXDEL;b=b->next) {
|
||||
if (b->type == &bt_road) {
|
||||
int x1, x2, y1, y2;
|
||||
region *r1, *r2;
|
||||
|
||||
x1 = b->from->x;
|
||||
y1 = b->from->y;
|
||||
x2 = b->to->x;
|
||||
y2 = b->to->y;
|
||||
|
||||
r1 = findregion(x1, y1);
|
||||
r2 = findregion(x2, y2);
|
||||
|
||||
if (r1->land == NULL || r2->land == NULL
|
||||
|| r1->terrain->max_road<=0
|
||||
|| r2->terrain->max_road<=0)
|
||||
{
|
||||
deleted[fixes++] = b;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
log_printf("fixed %d roads.\n", fixes);
|
||||
while (fixes>0) {
|
||||
fixes--;
|
||||
erase_border(deleted[fixes]);
|
||||
}
|
||||
}
|
||||
|
||||
static void
|
||||
fix_dissolve(unit * u, int value, char mode)
|
||||
{
|
||||
attrib * a = a_find(u->attribs, &at_unitdissolve);
|
||||
|
||||
if (a!=NULL) return;
|
||||
a = a_add(&u->attribs, a_new(&at_unitdissolve));
|
||||
a->data.ca[0] = mode;
|
||||
a->data.ca[1] = (char)value;
|
||||
log_warning(("unit %s has race %s and no dissolve-attrib\n", unitname(u), rc_name(u->race, 0)));
|
||||
}
|
||||
|
||||
static void
|
||||
check_dissolve(void)
|
||||
{
|
||||
region * r;
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units;u!=NULL;u=u->next) if (!is_monsters(u->faction)) {
|
||||
if (u->race==new_race[RC_STONEGOLEM]) {
|
||||
fix_dissolve(u, STONEGOLEM_CRUMBLE, 0);
|
||||
continue;
|
||||
}
|
||||
if (u->race==new_race[RC_IRONGOLEM]) {
|
||||
fix_dissolve(u, IRONGOLEM_CRUMBLE, 0);
|
||||
continue;
|
||||
}
|
||||
if (u->race==new_race[RC_PEASANT]) {
|
||||
fix_dissolve(u, 15, 1);
|
||||
continue;
|
||||
}
|
||||
if (u->race==new_race[RC_TREEMAN]) {
|
||||
fix_dissolve(u, 5, 2);
|
||||
continue;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static int
|
||||
check_mages(void)
|
||||
{
|
||||
faction * f;
|
||||
for (f=factions;f!=NULL;f=f->next) {
|
||||
if (!is_monsters(f)) {
|
||||
unit * u;
|
||||
int mages = 0;
|
||||
int maxmages = skill_limit(f, SK_MAGIC);
|
||||
|
||||
for (u = f->units;u!=NULL;u=u->nextF) {
|
||||
if (is_mage(u)) {
|
||||
if (is_familiar(u)) {
|
||||
unit * mage = get_familiar_mage(u);
|
||||
if (mage) {
|
||||
attrib * a = a_find(u->attribs, &at_eventhandler);
|
||||
trigger ** triggers = NULL;
|
||||
if (a==NULL) {
|
||||
log_error(("%s is a familar, but has no eventhandler.\n", unitname(u)));
|
||||
} else {
|
||||
triggers = get_triggers(a, "destroy");
|
||||
if (!triggers) {
|
||||
log_error(("%s is a familiar, but has no 'destroy' events.\n", unitname(u)));
|
||||
} else {
|
||||
while (*triggers) {
|
||||
trigger * t = *triggers;
|
||||
if (t->type==&tt_shock) break;
|
||||
triggers = &t->next;
|
||||
}
|
||||
if (*triggers == NULL) {
|
||||
log_error(("%s is a familiar, but has no 'destroy/shock' event.\n", unitname(u)));
|
||||
triggers = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!triggers) {
|
||||
add_trigger(&u->attribs, "destroy", trigger_shock(mage));
|
||||
}
|
||||
} else {
|
||||
log_error(("%s is a familiar, but has no mage - removing mage-attribute.\n", unitname(u)));
|
||||
a_removeall(&u->attribs, &at_mage);
|
||||
set_level(u, SK_MAGIC, 0);
|
||||
}
|
||||
} else {
|
||||
unit * familiar = get_familiar(u);
|
||||
if (familiar) {
|
||||
attrib * a = a_find(u->attribs, &at_eventhandler);
|
||||
trigger ** triggers = NULL;
|
||||
if (a==NULL) {
|
||||
log_error(("%s is a mage with a familiar, but has no eventhandler.\n", unitname(u)));
|
||||
} else {
|
||||
triggers = get_triggers(a, "destroy");
|
||||
if (!triggers) {
|
||||
log_error(("%s is a mage with a familiar, but has no 'destroy' events.\n", unitname(u)));
|
||||
} else {
|
||||
while (*triggers) {
|
||||
trigger * t = *triggers;
|
||||
if (t->type==&tt_killunit) break;
|
||||
triggers = &t->next;
|
||||
}
|
||||
if (*triggers == NULL) {
|
||||
log_error(("%s is a mage with a familiar, but has no 'destroy/killunit' event.\n", unitname(u)));
|
||||
triggers = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (!triggers) {
|
||||
add_trigger(&u->attribs, "destroy", trigger_killunit(familiar));
|
||||
}
|
||||
}
|
||||
++mages;
|
||||
}
|
||||
}
|
||||
}
|
||||
if (mages>maxmages) {
|
||||
log_error(("faction %s has %d of max %d magicians.\n",
|
||||
factionid(f), mages, maxmages));
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int
|
||||
fix_resources(void)
|
||||
{
|
||||
int retval = 0;
|
||||
region * r, * start = NULL;
|
||||
|
||||
for (r=regions;r;r=r->next) {
|
||||
if (r->resources==NULL) {
|
||||
if (r->terrain->production!=NULL) {
|
||||
terrain_production * prod = r->terrain->production;
|
||||
while (prod->type && prod->chance<1.0) ++prod;
|
||||
|
||||
if (prod->type!=NULL) {
|
||||
terraform_resources(r);
|
||||
log_warning(("fixing resources in '%s'\n", regionname(r, NULL)));
|
||||
retval = -1;
|
||||
if (start==NULL) start = r->next;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
start = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
for (r=start;r;r=r->next) {
|
||||
if (r->resources==NULL) {
|
||||
if (r->terrain->production!=NULL) {
|
||||
terraform_resources(r);
|
||||
log_warning(("fixing resources in '%s'\n", regionname(r, NULL)));
|
||||
retval = -1;
|
||||
}
|
||||
}
|
||||
}
|
||||
return retval;
|
||||
}
|
||||
|
||||
static int
|
||||
fix_attribflags(void)
|
||||
{
|
||||
region * r;
|
||||
for (r = regions; r; r=r->next) {
|
||||
unit * u = r->units;
|
||||
for (u=r->units;u!=NULL;u=u->next) {
|
||||
const attrib *a = u->attribs;
|
||||
while (a) {
|
||||
if (a->type==&at_guard) {
|
||||
fset(u, UFL_GUARD);
|
||||
fset(u->region, RF_GUARDED);
|
||||
}
|
||||
else if (a->type==&at_group) {
|
||||
fset(u, UFL_GROUP);
|
||||
}
|
||||
else if (a->type==&at_stealth) {
|
||||
fset(u, UFL_STEALTH);
|
||||
}
|
||||
a = a->next;
|
||||
}
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int
|
||||
fix_astral_firewalls(void)
|
||||
{
|
||||
region * r;
|
||||
for (r = regions; r; r=r->next) {
|
||||
if (is_astral(r) && r->terrain == newterrain(T_FIREWALL)) {
|
||||
terraform_region(r, newterrain(T_ASTRALB));
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int
|
||||
fix_chaosgates(void)
|
||||
{
|
||||
region * r;
|
||||
for (r = regions; r; r=r->next) {
|
||||
const attrib *a = a_findc(r->attribs, &at_direction);
|
||||
|
||||
while (a!=NULL && a->type==&at_direction) {
|
||||
spec_direction * sd = (spec_direction *)a->data.v;
|
||||
region * r2 = findregion(sd->x, sd->y);
|
||||
if (r2!=NULL) {
|
||||
connection * b = get_borders(r, r2);
|
||||
while (b) {
|
||||
if (b->type==&bt_chaosgate) break;
|
||||
b = b->next;
|
||||
}
|
||||
if (b==NULL) {
|
||||
b = new_border(&bt_chaosgate, r, r2);
|
||||
}
|
||||
}
|
||||
a = a->next;
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void
|
||||
fix_toads(void)
|
||||
{
|
||||
region * r;
|
||||
int fixes = 0;
|
||||
const struct race * toad = rc_find("toad");
|
||||
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units; u; u=u->next) {
|
||||
if (u->race==toad) {
|
||||
int found = 0;
|
||||
handler_info * td = NULL;
|
||||
attrib * a = a_find(u->attribs, &at_eventhandler);
|
||||
while (!found && a!=NULL && a->type==&at_eventhandler) {
|
||||
td = (handler_info *)a->data.v;
|
||||
if (strcmp(td->event, "timer")==0) {
|
||||
trigger * tr = td->triggers;
|
||||
while (tr && !found) {
|
||||
if (tr->type==&tt_timeout) {
|
||||
found = 1;
|
||||
}
|
||||
tr = tr->next;
|
||||
}
|
||||
}
|
||||
a = a->next;
|
||||
}
|
||||
if (!found) {
|
||||
log_error(("fixed toad %s.\n", unitname(u)));
|
||||
u->race=u->faction->race;
|
||||
++fixes;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
log_printf("fixed %d toads.\n", fixes);
|
||||
}
|
||||
|
||||
#ifdef REMOVE_ILLEGAL_MIGRANT_HEROES
|
||||
static void
|
||||
fix_heroes(void)
|
||||
{
|
||||
region * r;
|
||||
int fixes = 0;
|
||||
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
unit * u;
|
||||
for (u=r->units; u; u=u->next) {
|
||||
if (u->race!=u->faction->race) {
|
||||
log_error(("fixed race for hero %s (%s).\n", unitname(u), u->race->_name[0]));
|
||||
u->race=u->faction->race;
|
||||
++fixes;
|
||||
}
|
||||
}
|
||||
}
|
||||
log_printf("fixed %d heroes.\n", fixes);
|
||||
}
|
||||
#endif
|
||||
|
||||
|
||||
static void
|
||||
fix_groups(void)
|
||||
{
|
||||
region * r;
|
||||
|
||||
for (r=regions;r!=NULL;r=r->next) {
|
||||
unit * u;
|
||||
|
||||
if (r->display && !fval(r->terrain, LAND_REGION)) {
|
||||
free(r->display);
|
||||
r->display = NULL;
|
||||
}
|
||||
|
||||
for (u=r->units;u;u=u->next) {
|
||||
if (fval(u, UFL_GROUP)) {
|
||||
attrib * a = a_find(u->attribs, &at_group);
|
||||
if (a) {
|
||||
group * g = (group *)a->data.v;
|
||||
if (g) {
|
||||
faction * f = u->faction;
|
||||
group * fg;
|
||||
|
||||
for (fg=f->groups;fg;fg=fg->next) {
|
||||
if (fg==g) break;
|
||||
}
|
||||
/* assert(fg==g); */
|
||||
if (fg!=g) {
|
||||
log_error(("%s is in group %s which is not part of faction %s\n", unitname(u), g->name, factionname(f)));
|
||||
join_group(u, NULL);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
korrektur(void)
|
||||
{
|
||||
#if GLOBAL_WARMING
|
||||
gamedate date;
|
||||
get_gamedate(turn, &date);
|
||||
if (date.season == SEASON_SUMMER) {
|
||||
global_warming();
|
||||
}
|
||||
#endif
|
||||
check_dissolve();
|
||||
do_once("rdec", &road_decay);
|
||||
do_once("unfi", &fix_undead);
|
||||
do_once("chgt", &fix_chaosgates);
|
||||
do_once("atrx", &fix_attribflags);
|
||||
do_once("asfi", &fix_astral_firewalls);
|
||||
fix_astralplane();
|
||||
fix_toads();
|
||||
|
||||
/* fix_heroes(); */
|
||||
verify_owners(false);
|
||||
/* fix_herbtypes(); */
|
||||
/* In Vin 3+ können Parteien komplett übergeben werden. */
|
||||
if (!ExpensiveMigrants()) {
|
||||
no_teurefremde(true);
|
||||
}
|
||||
fix_allies();
|
||||
fix_groups();
|
||||
/* fix_unitrefs(); */
|
||||
fix_road_borders();
|
||||
if (turn>1000) curse_emptiness(); /*** disabled ***/
|
||||
/* seems something fishy is going on, do this just
|
||||
* to be on the safe side:
|
||||
*/
|
||||
fix_demands();
|
||||
fix_otherfaction();
|
||||
check_mages();
|
||||
do_once("tfrs", &fix_resources);
|
||||
/* trade_orders(); */
|
||||
|
||||
/* immer ausführen, wenn neue Sprüche dazugekommen sind, oder sich
|
||||
* Beschreibungen geändert haben */
|
||||
fix_age();
|
||||
|
||||
/* Immer ausführen! Erschafft neue Teleport-Regionen, wenn nötig */
|
||||
create_teleport_plane();
|
||||
}
|
|
@ -1,21 +0,0 @@
|
|||
/* vi: set ts=2:
|
||||
* Eressea PB(E)M host Christian Schlittchen (corwin@amber.kn-bremen.de)
|
||||
* (C) 1998-2003 Katja Zedel (katze@felidae.kn-bremen.de)
|
||||
* Henning Peters (faroul@beyond.kn-bremen.de)
|
||||
* Enno Rehling (enno@eressea-pbem.de)
|
||||
* Ingo Wilken (Ingo.Wilken@informatik.uni-oldenburg.de)
|
||||
*
|
||||
* This program may not be used, modified or distributed without
|
||||
* prior permission by the authors of Eressea.
|
||||
**/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
extern void korrektur(void);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
Loading…
Reference in New Issue