server/src/kernel/plane.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 "plane.h"

/* kernel includes */
#include "region.h"
#include "faction.h"

/* util includes */
#include <util/attrib.h>
#include <util/resolve.h>
#include <util/storage.h>
#include <util/lists.h>

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

struct plane *planes;

int plane_width(const plane * pl)
{
  if (pl) {
    return pl->maxx-pl->minx+1;
  }
  return 0;
}

int plane_height(const plane * pl)
{
  if (pl) {
    return pl->maxy-pl->miny+1;
  }
  return 0;
}

plane *
get_homeplane(void)
{
  return getplanebyid(0);
}


plane *
getplane(const region *r)
{
  if (r) {
    return r->_plane;
  }
  return get_homeplane();
}

plane *
getplanebyid(int id)
{
  plane *p;

  for (p=planes; p; p=p->next) {
    if (p->id == id) {
      return p;
    }
  }
  return NULL;
}

plane *
getplanebyname(const char * name)
{
  plane *p;

  for (p=planes; p; p=p->next)
    if (p->name && !strcmp(p->name, name))
      return p;
  return NULL;
}

plane *
findplane(int x, int y)
{
  plane *pl;

  for(pl=planes;pl;pl=pl->next) {
    if(x >= pl->minx && x <= pl->maxx
        && y >= pl->miny && y <= pl->maxy) {
      return pl;
    }
  }
  return NULL;
}

int
getplaneid(const region *r)

{
  if(r) {
    plane * pl = getplane(r);
    if (pl) return pl->id;

    for(pl=planes;pl;pl=pl->next) {
      if(r->x >= pl->minx && r->x <= pl->maxx
          && r->y >= pl->miny && r->y <= pl->maxy) {
        return pl->id;
      }
    }
  }
  return 0;
}

static int
ursprung_x(const faction *f, const plane *pl, const region * rdefault)
{
  ursprung *ur;
  int id = 0;

  if(!f)
    return 0;

  if(pl)
    id = pl->id;

  for(ur = f->ursprung; ur; ur = ur->next) {
    if(ur->id == id)
      return ur->x;
  }
  if (!rdefault) return 0;
  set_ursprung((faction*)f, id, rdefault->x - plane_center_x(pl), rdefault->y - plane_center_y(pl));
  return rdefault->x - plane_center_x(pl);
}

static int
ursprung_y(const faction *f, const plane *pl, const region * rdefault)
{
  ursprung *ur;
  int id = 0;

  if(!f)
    return 0;

  if(pl)
    id = pl->id;

  for(ur = f->ursprung; ur; ur = ur->next) {
    if(ur->id == id)
      return ur->y;
  }
  if (!rdefault) return 0;
  set_ursprung((faction*)f, id, rdefault->x - plane_center_x(pl), rdefault->y - plane_center_y(pl));
  return rdefault->y - plane_center_y(pl);
}

int 
plane_center_x(const plane *pl)
{
  if(pl == NULL)
    return 0;

  return(pl->minx + pl->maxx)/2;
}

int 
plane_center_y(const plane *pl)
{
  if(pl == NULL)
    return 0;

  return(pl->miny + pl->maxy)/2;
}

void
adjust_coordinates(const faction *f, int *x, int *y, const plane * pl, const region * r)
{
  int nx = *x;
  int ny = *y;
  if (f) {
    nx -= ursprung_x(f, pl, r);
    ny -= ursprung_y(f, pl, r);
  } 
  if (pl) {
    nx -= plane_center_x(pl);
    ny -= plane_center_y(pl);
  }

  if (pl) {
    int width = plane_width(pl);
    int height = plane_height(pl);
    int width_2 = width/2;
    int height_2 = height/2;

    if (nx<0) nx = (width-(-nx)%width);
    if (nx>width_2) nx -= width;
    if (ny<0) ny = (height-(-ny)%height);
    if (ny>height_2) ny -= height;
  }

  assert(!pl || nx<=pl->maxx - plane_center_x(pl));
  assert(!pl || nx>=pl->minx - plane_center_x(pl));
  assert(!pl || ny<=pl->maxy - plane_center_y(pl));
  assert(!pl || ny>=pl->miny - plane_center_y(pl));

  *x = nx;
  *y = ny;
}

void
set_ursprung(faction *f, int id, int x, int y)
{
  ursprung *ur;
  assert(f!=NULL);
  for(ur=f->ursprung;ur;ur=ur->next) {
    if (ur->id == id) {
      ur->x = ur->x + x;
      ur->y = ur->y + y;
      return;
    }
  }

  ur = calloc(1, sizeof(ursprung));
  ur->id   = id;
  ur->x    = x;
  ur->y    = y;

  addlist(&f->ursprung, ur);
}

plane *
create_new_plane(int id, const char *name, int minx, int maxx, int miny, int maxy, int flags)
{
  plane *pl = getplanebyid(id);

  if (pl) return pl;
  pl = calloc(1, sizeof(plane));

  pl->next  = NULL;
  pl->id    = id;
  if (name) pl->name  = strdup(name);
  pl->minx = minx;
  pl->maxx = maxx;
  pl->miny = miny;
  pl->maxy = maxy;
  pl->flags = flags;

  addlist(&planes, pl);
  return pl;
}

/* Umrechnung Relative-Absolute-Koordinaten */
int 
rel_to_abs(const struct plane *pl, const struct faction * f, int rel, unsigned char index)
{
  assert(index == 0 || index == 1);

  if(index == 0)
    return (rel + ursprung_x(f, pl, NULL) + plane_center_x(pl));

  return (rel + ursprung_y(f, pl, NULL) + plane_center_y(pl));
}


int
resolve_plane(variant id, void * addr)
{
  int result = 0;
  plane * pl = NULL;
  if (id.i!=0) {
    pl = getplanebyid(id.i);
    if (pl==NULL) {
      result = -1;
    }
  }
  *(plane**)addr = pl;
  return result;
}

void
write_plane_reference(const plane * u, struct storage * store)
{
  store->w_int(store, u?(u->id):0);
}

int
read_plane_reference(plane ** pp, struct storage * store)
{
  variant id;
  id.i = store->r_int(store);
  if (id.i==0) {
    *pp = NULL;
    return AT_READ_FAIL;
  }
  *pp = getplanebyid(id.i);
  if (*pp==NULL) ur_add(id, pp, resolve_plane);
  return AT_READ_OK;
}

boolean
is_watcher(const struct plane * p, const struct faction * f)
{
  struct watcher * w;
  if (!p) return false;
  w = p->watchers;
  while (w && w->faction!=f) w=w->next;
  return (w!=NULL);
}