mapdata.c

Go to the documentation of this file.

/*
 * Crossfire -- cooperative multi-player graphical RPG and adventure game
 *
 * Copyright (c) 1999-2013 Mark Wedel and the Crossfire Development Team
 * Copyright (c) 1992 Frank Tore Johansen
 *
 * Crossfire is free software and comes with ABSOLUTELY NO WARRANTY. You are
 * welcome to redistribute it under certain conditions. For details, please
 * see COPYING and LICENSE.
 *
 * The authors can be reached via e-mail at <crossfire@metalforge.org>.
 */
 
#include "client.h"
 
#include <assert.h>
#include <stdbool.h>
 
#include "external.h"
#include "mapdata.h"
 
PlayerPosition pl_pos;
 
PlayerPosition script_pos;
 
int move_to_x = 0, move_to_y = 0;
bool move_to_attack = false;
 
#define FOG_MAP_SIZE 512
 
#define FOG_BORDER_MIN 128
 
#define MAX_FACE_SIZE 16
 
/* Max it can currently be.  Important right now because
 * animation has to look at everything that may be viewable,
 * and reducing this size basically reduces processing it needs
 * to do by 75% (64^2 vs 33^2)
 */
#define CURRENT_MAX_VIEW    33
 
struct BigCell {
    struct BigCell *next;
    struct BigCell *prev;
 
    struct MapCellLayer head;
    struct MapCellTailLayer tail;
 
    guint16 x, y;
    guint8 layer;
};
 
/* Global map rendering offsets used for local scroll prediction. */
int global_offset_x = 0;
int global_offset_y = 0;
int want_offset_x = 0;
int want_offset_y = 0;
 
static void recenter_virtual_map_view(int diff_x, int diff_y);
static void mapdata_get_image_size(int face, guint8 *w, guint8 *h);
static void expand_need_update(int x, int y, int w, int h);
static void expand_need_update_from_layer(int x, int y, int layer);
 
static int width;   //< width of current map view
static int height;  //< height of current map view
 
static struct BigCell *bigfaces_head;
 
static struct BigCell bigfaces[MAX_VIEW][MAX_VIEW][MAXLAYERS];
 
static struct Map the_map;
 
static void clear_cells(int x, int y, int len_y) {
    int clear_cells_i, j;
    memset(mapdata_cell(x, y), 0, sizeof(struct MapCell)*len_y);
 
    for (clear_cells_i = 0; clear_cells_i < (len_y); clear_cells_i++) {
        struct MapCell *cell = mapdata_cell(x, y+clear_cells_i);
        for (j=0; j < MAXLAYERS; j++) {
            cell->heads[j].size_x = 1;
            cell->heads[j].size_y = 1;
        }
    }
}
 
extern void mapdata_clear_label(int px, int py);
 
inline struct MapCell *mapdata_cell(const int x, const int y) {
    return &the_map._cells[x][y];
}
 
bool mapdata_contains(int x, int y) {
    if (x < 0 || y < 0 || the_map.width <= x || the_map.height <= y) {
        return false;
    }
 
    return true;
}
 
bool mapdata_can_smooth(int x, int y, int layer) {
    return (mapdata_cell(x, y)->heads[layer].face == 0 && layer > 0) ||
            mapdata_cell(x, y)->smooth[layer];
}
 
void mapdata_size(int *x, int *y) {
    if (x != NULL) {
        *x = the_map.width;
    }
 
    if (y != NULL) {
        *y = the_map.height;
    }
}
 
static void set_darkness(int x, int y, int darkness)
{
    if (mapdata_cell(x, y)->darkness == darkness) {
        return;
    }
 
    mapdata_cell(x, y)->darkness = darkness;
    mapdata_cell(x, y)->need_update = 1;
}
 
void mapdata_clear(int x, int y) {
    int px = pl_pos.x + x;
    int py = pl_pos.y + y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    if (mapdata_cell(px, py) == EMPTY)
        return;
 
    if (mapdata_cell(px, py)->state == VISIBLE) {
        mapdata_cell(px, py)->need_update = 1;
        for (int i = 0; i < MAXLAYERS; i++) {
            if (mapdata_cell(px, py)->heads[i].face) {
                expand_need_update_from_layer(px, py, i);
            }
        }
    }
 
    mapdata_cell(px, py)->state = FOG;
    mapdata_clear_label(px, py);
}
 
static void mark_resmooth(int x, int y, int layer)
{
    int sdx,sdy;
    if (mapdata_cell(x, y)->smooth[layer]>1) {
        for (sdx=-1; sdx<2; sdx++)
            for (sdy=-1; sdy<2; sdy++)
                if ( (sdx || sdy) /* ignore (0,0) */
                        &&  ( (x+sdx >0) && (x+sdx < the_map.width) &&  /* only inside map */
                              (y+sdy >0) && (y+sdy < the_map.height) ) ) {
                    mapdata_cell(x+sdx, y+sdy)->need_resmooth=1;
                }
    }
}
static void expand_clear_face(int x, int y, int w, int h, int layer)
{
    int dx, dy;
    struct MapCell *cell;
 
    assert(0 <= x && x < the_map.width);
    assert(0 <= y && y < the_map.height);
    assert(1 <= w && w <= MAX_FACE_SIZE);
    assert(1 <= h && h <= MAX_FACE_SIZE);
 
    assert(0 <= x-w+1 && x-w+1 < the_map.width);
    assert(0 <= y-h+1 && y-h+1 < the_map.height);
 
    cell = mapdata_cell(x, y);
 
    for (dx = 0; dx < w; dx++) {
        for (dy = !dx; dy < h; dy++) {
            struct MapCellTailLayer *tail = &mapdata_cell(x-dx, y-dy)->tails[layer];
            assert(0 <= x-dx && x-dx < the_map.width);
            assert(0 <= y-dy && y-dy < the_map.height);
            assert(0 <= layer && layer < MAXLAYERS);
 
            /* Do not clear faces that already have been overwritten by another
             * face.
             */
            if (tail->face == cell->heads[layer].face
                    && tail->size_x == dx
                    && tail->size_y == dy) {
                tail->face = 0;
                tail->size_x = 0;
                tail->size_y = 0;
                mapdata_cell(x-dx, y-dy)->need_update = 1;
            }
            mark_resmooth(x-dx,y-dy,layer);
        }
    }
 
    cell->heads[layer].face = 0;
    cell->heads[layer].animation = 0;
    cell->heads[layer].animation_speed = 0;
    cell->heads[layer].animation_left = 0;
    cell->heads[layer].animation_phase = 0;
    cell->heads[layer].size_x = 1;
    cell->heads[layer].size_y = 1;
    cell->need_update = 1;
    cell->need_resmooth = 1;
    mark_resmooth(x,y,layer);
}
 
static void expand_clear_face_from_layer(int x, int y, int layer)
{
    const struct MapCellLayer *cell;
 
    assert(0 <= x && x < the_map.width);
    assert(0 <= y && y < the_map.height);
    assert(0 <= layer && layer < MAXLAYERS);
 
    cell = &mapdata_cell(x, y)->heads[layer];
    if (cell->size_x && cell->size_y) {
        expand_clear_face(x, y, cell->size_x, cell->size_y, layer);
    }
}
 
static void expand_set_face(int x, int y, int layer, gint16 face, int clear)
{
    struct MapCell *cell;
    int dx, dy;
    guint8 w, h;
 
    assert(0 <= x && x < the_map.width);
    assert(0 <= y && y < the_map.height);
    assert(0 <= layer && layer < MAXLAYERS);
 
    cell = mapdata_cell(x, y);
 
    if (clear) {
        expand_clear_face_from_layer(x, y, layer);
    }
 
    mapdata_get_image_size(face, &w, &h);
    assert(1 <= w && w <= MAX_FACE_SIZE);
    assert(1 <= h && h <= MAX_FACE_SIZE);
    cell->heads[layer].face = face;
    cell->heads[layer].size_x = w;
    cell->heads[layer].size_y = h;
    cell->need_update=1;
    mark_resmooth(x,y,layer);
 
    for (dx = 0; dx < w; dx++) {
        for (dy = !dx; dy < h; dy++) {
            struct MapCellTailLayer *tail = &mapdata_cell(x-dx, y-dy)->tails[layer];
            assert(0 <= x-dx && x-dx < the_map.width);
            assert(0 <= y-dy && y-dy < the_map.height);
            assert(0 <= layer && layer < MAXLAYERS);
 
            tail->face = face;
            tail->size_x = dx;
            tail->size_y = dy;
            mapdata_cell(x-dx, y-dy)->need_update = 1;
            mark_resmooth(x-dx,y-dy,layer);
        }
    }
}
 
static void expand_clear_bigface(int x, int y, int w, int h, int layer, int set_need_update)
{
    int dx, dy;
    struct MapCellLayer *head;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
    assert(1 <= w && w <= MAX_FACE_SIZE);
    assert(1 <= h && h <= MAX_FACE_SIZE);
 
    head = &bigfaces[x][y][layer].head;
 
    for (dx = 0; dx < w && dx <= x; dx++) {
        for (dy = !dx; dy < h && dy <= y; dy++) {
            struct MapCellTailLayer *tail = &bigfaces[x-dx][y-dy][layer].tail;
            assert(0 <= x-dx && x-dx < MAX_VIEW);
            assert(0 <= y-dy && y-dy < MAX_VIEW);
            assert(0 <= layer && layer < MAXLAYERS);
 
            /* Do not clear faces that already have been overwritten by another
             * face.
             */
            if (tail->face == head->face
                    && tail->size_x == dx
                    && tail->size_y == dy) {
                tail->face = 0;
                tail->size_x = 0;
                tail->size_y = 0;
 
                if (0 <= x-dx && x-dx < width
                        && 0 <= y-dy && y-dy < height) {
                    assert(0 <= pl_pos.x+x-dx && pl_pos.x+x-dx < the_map.width);
                    assert(0 <= pl_pos.y+y-dy && pl_pos.y+y-dy < the_map.height);
                    if (set_need_update) {
                        mapdata_cell(pl_pos.x+x-dx, pl_pos.y+y-dy)->need_update = 1;
                    }
                }
            }
        }
    }
 
    head->face = 0;
    head->size_x = 1;
    head->size_y = 1;
}
 
static void expand_clear_bigface_from_layer(int x, int y, int layer, int set_need_update)
{
    struct BigCell *headcell;
    const struct MapCellLayer *head;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
    assert(0 <= layer && layer < MAXLAYERS);
 
    headcell = &bigfaces[x][y][layer];
    head = &headcell->head;
    if (head->face != 0) {
        assert(headcell->prev != NULL || headcell == bigfaces_head);
 
        /* remove from bigfaces_head list */
        if (headcell->prev != NULL) {
            headcell->prev->next = headcell->next;
        }
        if (headcell->next != NULL) {
            headcell->next->prev = headcell->prev;
        }
        if (bigfaces_head == headcell) {
            assert(headcell->prev == NULL);
            bigfaces_head = headcell->next;
        } else {
            assert(headcell->prev != NULL);
        }
        headcell->prev = NULL;
        headcell->next = NULL;
 
        expand_clear_bigface(x, y, head->size_x, head->size_y, layer, set_need_update);
    } else {
        assert(headcell->prev == NULL && headcell != bigfaces_head);
        assert(head->size_x == 1);
        assert(head->size_y == 1);
    }
}
 
static void expand_set_bigface(int x, int y, int layer, gint16 face, int clear)
{
    struct BigCell *headcell;
    struct MapCellLayer *head;
    int dx, dy;
    guint8 w, h;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
    assert(0 <= layer && layer < MAXLAYERS);
 
    headcell = &bigfaces[x][y][layer];
    head = &headcell->head;
    if (clear) {
        expand_clear_bigface_from_layer(x, y, layer, 1);
    }
 
    /* add to bigfaces_head list */
    if (face != 0) {
        assert(headcell->prev == NULL);
        assert(headcell->next == NULL);
        assert(headcell != bigfaces_head);
        if (bigfaces_head != NULL) {
            assert(bigfaces_head->prev == NULL);
            bigfaces_head->prev = headcell;
        }
        headcell->next = bigfaces_head;
        bigfaces_head = headcell;
    }
 
    mapdata_get_image_size(face, &w, &h);
    assert(1 <= w && w <= MAX_FACE_SIZE);
    assert(1 <= h && h <= MAX_FACE_SIZE);
    head->face = face;
    head->size_x = w;
    head->size_y = h;
 
    for (dx = 0; dx < w && dx <= x; dx++) {
        for (dy = !dx; dy < h && dy <= y; dy++) {
            struct MapCellTailLayer *tail = &bigfaces[x-dx][y-dy][layer].tail;
            assert(0 <= x-dx && x-dx < MAX_VIEW);
            assert(0 <= y-dy && y-dy < MAX_VIEW);
            assert(0 <= layer && layer < MAXLAYERS);
 
            tail->face = face;
            tail->size_x = dx;
            tail->size_y = dy;
 
            if (0 <= x-dx && x-dx < width
                    && 0 <= y-dy && y-dy < height) {
                assert(0 <= pl_pos.x+x-dx && pl_pos.x+x-dx < the_map.width);
                assert(0 <= pl_pos.y+y-dy && pl_pos.y+y-dy < the_map.height);
                mapdata_cell(pl_pos.x+x-dx, pl_pos.y+y-dy)->need_update = 1;
            }
        }
    }
}
 
static void expand_need_update(int x, int y, int w, int h)
{
    int dx, dy;
 
    assert(0 <= x && x < the_map.width);
    assert(0 <= y && y < the_map.height);
    assert(1 <= w && w <= MAX_FACE_SIZE);
    assert(1 <= h && h <= MAX_FACE_SIZE);
 
    assert(0 <= x-w+1 && x-w+1 < the_map.width);
    assert(0 <= y-h+1 && y-h+1 < the_map.height);
 
    for (dx = 0; dx < w; dx++) {
        for (dy = 0; dy < h; dy++) {
            struct MapCell *cell = mapdata_cell(x-dx, y-dy);
            assert(0 <= x-dx && x-dx < the_map.width);
            assert(0 <= y-dy && y-dy < the_map.height);
            cell->need_update = 1;
        }
    }
}
 
static void expand_need_update_from_layer(int x, int y, int layer)
{
    struct MapCellLayer *head;
 
    assert(0 <= x && x < the_map.width);
    assert(0 <= y && y < the_map.height);
    assert(0 <= layer && layer < MAXLAYERS);
 
    head = &mapdata_cell(x, y)->heads[layer];
    if (head->face != 0) {
        expand_need_update(x, y, head->size_x, head->size_y);
    } else {
        assert(head->size_x == 1);
        assert(head->size_y == 1);
    }
}
 
static void mapdata_alloc(struct Map* const map, const int width, const int height) {
    map->_cells = (struct MapCell **)g_new(struct MapCell, width * (height + 1));
    g_assert(map->_cells != NULL); // g_new() always succeeds
    map->width = width;
    map->height = height;
 
    /* Skip past the first row of pointers to rows and assign the
     * start of the actual map data
     */
    map->_cells[0] = (struct MapCell *)((char *)map->_cells+(sizeof(struct MapCell *)*map->width));
 
    /* Finish assigning the beginning of each row relative to the
     * first row assigned above
     */
    for (int i = 0; i < map->width; i++) {
        map->_cells[i] = map->_cells[0]+i*map->height;
    }
}
 
static void mapdata_init(void)
{
    int x, y;
    int i;
 
    mapdata_alloc(&the_map, FOG_MAP_SIZE, FOG_MAP_SIZE);
 
    width = 0;
    height = 0;
    pl_pos.x = the_map.width/2-width/2;
    pl_pos.y = the_map.height/2-height/2;
 
    for (x = 0; x < the_map.width; x++) {
        clear_cells(x, 0, the_map.height);
    }
 
    for (y = 0; y < MAX_VIEW; y++) {
        for (x = 0; x < MAX_VIEW; x++) {
            for (i = 0; i < MAXLAYERS; i++) {
                bigfaces[x][y][i].next = NULL;
                bigfaces[x][y][i].prev = NULL;
                bigfaces[x][y][i].head.face = 0;
                bigfaces[x][y][i].head.size_x = 1;
                bigfaces[x][y][i].head.size_y = 1;
                bigfaces[x][y][i].tail.face = 0;
                bigfaces[x][y][i].tail.size_x = 0;
                bigfaces[x][y][i].tail.size_y = 0;
                bigfaces[x][y][i].x = x;
                bigfaces[x][y][i].y = y;
                bigfaces[x][y][i].layer = i;
            }
        }
    }
    bigfaces_head = NULL;
 
    global_offset_x = 0;
    global_offset_y = 0;
    want_offset_x = 0;
    want_offset_y = 0;
}
 
void mapdata_free(void) {
    if (the_map._cells != NULL) {
        g_free(the_map._cells);
        the_map._cells = NULL;
        the_map.width = 0;
        the_map.height = 0;
    }
}
 
void mapdata_set_size(int viewx, int viewy)
{
    mapdata_free();
    mapdata_init();
 
    width = viewx;
    height = viewy;
    pl_pos.x = the_map.width/2-width/2;
    pl_pos.y = the_map.height/2-height/2;
}
 
int mapdata_is_inside(int x, int y)
{
    return(x >= 0 && x < width && y >= 0 && y < height);
}
 
/* mapdate_clear_space() is used by Map2Cmd()
 * Basically, server has told us there is nothing on
 * this space.  So clear it.
 */
void mapdata_clear_space(int x, int y)
{
    int px, py;
    int i;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    if (x < width && y < height) {
        /* tile is visible */
        /* visible tile is now blank ==> do not clear but mark as cleared */
        mapdata_clear(x, y);
    } else {
        /* tile is invisible (outside view area, i.e. big face update) */
 
        for (i = 0; i < MAXLAYERS; i++) {
            expand_set_bigface(x, y, i, 0, TRUE);
        }
    }
}
 
 
/* With map2, we basically process a piece of data at a time.  Thus,
 * for each piece, we don't know what the final state of the space
 * will be.  So once Map2Cmd() has processed all the information for
 * a space, it calls mapdata_set_check_space() which can see if
 * the space is cleared or other inconsistencies.
 */
void mapdata_set_check_space(int x, int y)
{
    int px, py;
    int is_blank;
    int i;
    struct MapCell *cell;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
 
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
 
    is_blank=1;
    cell = mapdata_cell(px, py);
    for (i=0; i < MAXLAYERS; i++) {
        if (cell->heads[i].face>0 || cell->tails[i].face>0) {
            is_blank=0;
            break;
        }
    }
 
    if (cell->darkness != 0) {
        is_blank=0;
    }
 
    /* We only care if this space needs to be blanked out */
    if (!is_blank) {
        return;
    }
 
    if (x < width && y < height) {
        /* tile is visible */
 
        /* visible tile is now blank ==> do not clear but mark as cleared */
        mapdata_clear(x, y);
    }
}
 
 
 
/* This just sets the darkness for a space.
 * Used by Map2Cmd()
 */
void mapdata_set_darkness(int x, int y, int darkness)
{
    int px, py;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    /* Ignore darkness information for tile outside the viewable area: if
     * such a tile becomes visible again, it is either "fog of war" (and
     * darkness information is ignored) or it will be updated (including
     * the darkness information).
     */
    if (darkness != -1 && x < width && y < height) {
        set_darkness(px, py, 255-darkness);
    }
}
 
/* Sets smooth information for layer */
void mapdata_set_smooth(int x, int y, guint8 smooth, int layer)
{
    static int dx[8]= {0,1,1,1,0,-1,-1,-1};
    static int dy[8]= {-1,-1,0,1,1,1,0,-1};
    int rx, ry, px, py, i;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    if (mapdata_cell(px, py)->smooth[layer] != smooth) {
        for (i=0; i<8; i++) {
            rx=px+dx[i];
            ry=py+dy[i];
            if ( (rx<0) || (ry<0) || (the_map.width<=rx) || (the_map.height<=ry)) {
                continue;
            }
            mapdata_cell(rx, ry)->need_resmooth=1;
        }
        mapdata_cell(px, py)->need_resmooth=1;
        mapdata_cell(px, py)->smooth[layer] = smooth;
    }
}
 
void mapdata_add_label(int x, int y, int subtype, const char *label) {
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
    if (!(x < width && y < height))
        return;
 
    int px = pl_pos.x + x;
    int py = pl_pos.y + y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    if (subtype == 0) {
        mapdata_clear_label(px, py);
        return;
    }
 
    struct MapLabel *new = g_malloc(sizeof(struct MapLabel));
    new->subtype = subtype;
    new->label = g_strdup(label);
    new->next = mapdata_cell(px, py)->label;
    mapdata_cell(px, py)->label = new;
    mapdata_cell(px, py)->need_update = 1;
}
 
void mapdata_clear_label(int px, int py) {
    while (mapdata_cell(px, py)->label != NULL) {
        struct MapLabel *next = mapdata_cell(px, py)->label->next;
        g_free(mapdata_cell(px, py)->label->label);
        g_free(mapdata_cell(px, py)->label);
        mapdata_cell(px, py)->label = next;
    }
}
 
void mapdata_clear_old(int x, int y)
{
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
    if (!(x < width && y < height))
        return;
 
    int px = pl_pos.x + x;
    int py = pl_pos.y + y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    // In theory we only have to do this if this is a fog of war tile, because
    // the server remembers what tiles are visible to us and sends the
    // appropriate darkness updates.
    if (mapdata_cell(px, py)->state == FOG) {
        mapdata_cell(px, py)->need_update = 1;
        for (int i = 0; i < MAXLAYERS; i++) {
            expand_clear_face_from_layer(px, py, i);
        }
        mapdata_cell(px, py)->darkness = 0;
        mapdata_clear_label(px, py);
    }
 
    mapdata_cell(px, py)->state = VISIBLE;
}
 
/* This is vaguely related to the mapdata_set_face() above, but rather
 * than take all the faces, takes 1 face and the layer this face is
 * on.  This is used by the Map2Cmd()
 */
void mapdata_set_face_layer(int x, int y, gint16 face, int layer)
{
    int px, py;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    if (x < width && y < height) {
        mapdata_cell(px, py)->need_update = 1;
        if (face >0) {
            expand_set_face(px, py, layer, face, TRUE);
        } else {
            expand_clear_face_from_layer(px, py, layer);
        }
    } else {
        expand_set_bigface(x, y, layer, face, TRUE);
    }
}
 
 
/* This is vaguely related to the mapdata_set_face() above, but rather
 * than take all the faces, takes 1 face and the layer this face is
 * on.  This is used by the Map2Cmd()
 */
void mapdata_set_anim_layer(int x, int y, guint16 anim, guint8 anim_speed, int layer)
{
    int px, py;
    int i, face, animation, phase, speed_left;
 
    assert(0 <= x && x < MAX_VIEW);
    assert(0 <= y && y < MAX_VIEW);
 
    px = pl_pos.x+x;
    py = pl_pos.y+y;
    assert(0 <= px && px < the_map.width);
    assert(0 <= py && py < the_map.height);
 
    animation = anim & ANIM_MASK;
    face = 0;
 
    /* Random animation is pretty easy */
    if ((anim & ANIM_FLAGS_MASK) == ANIM_RANDOM) {
        const guint8 num_animations = animations[animation].num_animations;
        if (num_animations == 0) {
            LOG(LOG_WARNING, "mapdata_set_anim_layer",
                "animating object with zero animations");
            return;
        }
        phase = g_random_int() % num_animations;
        face = animations[animation].faces[phase];
        speed_left = anim_speed % g_random_int();
    } else if ((anim & ANIM_FLAGS_MASK) == ANIM_SYNC) {
        animations[animation].speed = anim_speed;
        phase = animations[animation].phase;
        speed_left = animations[animation].speed_left;
        face = animations[animation].faces[phase];
    }
 
    if (x < width && y < height) {
        mapdata_clear_old(x, y);
        if (face >0) {
            expand_set_face(px, py, layer, face, TRUE);
            mapdata_cell(px, py)->heads[layer].animation = animation;
            mapdata_cell(px, py)->heads[layer].animation_phase = phase;
            mapdata_cell(px, py)->heads[layer].animation_speed = anim_speed;
            mapdata_cell(px, py)->heads[layer].animation_left = speed_left;
        } else {
            expand_clear_face_from_layer(px, py, layer);
        }
    } else {
        expand_set_bigface(x, y, layer, face, TRUE);
    }
}
 
 
void mapdata_scroll(int dx, int dy)
{
    script_pos.x += dx;
    script_pos.y += dy;
    int x, y;
 
    recenter_virtual_map_view(dx, dy);
 
    if (want_config[CONFIG_MAPSCROLL] && display_mapscroll(dx, dy)) {
        struct BigCell *cell;
 
        /* Mark all tiles as "need_update" that are overlapped by a big face
         * from outside the view area.
         */
        for (cell = bigfaces_head; cell != NULL; cell = cell->next) {
            for (x = 0; x < cell->head.size_x; x++) {
                for (y = !x; y < cell->head.size_y; y++) {
                    if (0 <= cell->x-x && cell->x-x < width
                            && 0 <= cell->y-y && cell->y-y < height) {
                        mapdata_cell(pl_pos.x+cell->x-x, pl_pos.y+cell->y-y)->need_update = 1;
                    }
                }
            }
        }
    } else {
        /* Emulate map scrolling by redrawing all tiles. */
        for (x = 0; x < width; x++) {
            for (y = 0; y < height; y++) {
                mapdata_cell(pl_pos.x+x, pl_pos.y+y)->need_update = 1;
            }
        }
    }
 
    pl_pos.x += dx;
    pl_pos.y += dy;
 
    /* clear all newly visible tiles */
    if (dx > 0) {
        for (y = 0; y < height; y++) {
            for (x = width-dx; x < width; x++) {
                mapdata_clear(x, y);
            }
        }
    } else {
        for (y = 0; y < height; y++) {
            for (x = 0; x < -dx; x++) {
                mapdata_clear(x, y);
            }
        }
    }
 
    if (dy > 0) {
        for (x = 0; x < width; x++) {
            for (y = height-dy; y < height; y++) {
                mapdata_clear(x, y);
            }
        }
    } else {
        for (x = 0; x < width; x++) {
            for (y = 0; y < -dy; y++) {
                mapdata_clear(x, y);
            }
        }
    }
 
    /* Remove all big faces outside the view area. */
    while (bigfaces_head != NULL) {
        expand_clear_bigface_from_layer(bigfaces_head->x, bigfaces_head->y, bigfaces_head->layer, 0);
    }
 
    run_move_to();
}
 
void mapdata_newmap(void)
{
    script_pos.x = 0;
    script_pos.y = 0;
    int x, y;
 
    global_offset_x = 0;
    global_offset_y = 0;
    want_offset_x = 0;
    want_offset_y = 0;
 
    // Clear past predictions.
    memset(csocket.dir, -1, sizeof(csocket.dir));
 
    /* Clear the_map.cells[]. */
    for (x = 0; x < the_map.width; x++) {
        clear_cells(x, 0, the_map.height);
        for (y = 0; y < the_map.height; y++) {
            mapdata_cell(x, y)->need_update = 1;
        }
    }
 
    /* Clear bigfaces[]. */
    while (bigfaces_head != NULL) {
        expand_clear_bigface_from_layer(bigfaces_head->x, bigfaces_head->y, bigfaces_head->layer, 0);
    }
 
    // Clear destination.
    clear_move_to();
}
 
static bool mapdata_has_tile(int x, int y, int layer) {
    if (0 <= x && x < width && 0 <= y && y < height) {
        if (0 <= layer && layer < MAXLAYERS) {
            return true;
        }
    }
 
    return false;
}
 
gint16 mapdata_face(int x, int y, int layer) {
    if (!mapdata_has_tile(x, y, layer)) {
        return 0;
    }
 
    return mapdata_cell(pl_pos.x+x, pl_pos.y+y)->heads[layer].face;
}
 
gint16 mapdata_face_info(int mx, int my, int layer, int *dx, int *dy) {
    struct MapCellLayer *head = &mapdata_cell(mx, my)->heads[layer];
    struct MapCellTailLayer *tail = &mapdata_cell(mx, my)->tails[layer];
    if (head->face != 0) {
        const int width = head->size_x, height = head->size_y;
        *dx = 1 - width, *dy = 1 - height;
        return head->face;
    } else if (tail->face != 0) {
        struct MapCellLayer *head_ptr = &mapdata_cell(mx + tail->size_x, my + tail->size_y)->heads[layer];
        const int width = head_ptr->size_x, height = head_ptr->size_y;
        *dx = tail->size_x - width + 1, *dy = tail->size_y - height + 1;
        return tail->face;
    } else {
        return 0;
    }
}
 
gint16 mapdata_bigface(int x, int y, int layer, int *ww, int *hh) {
    gint16 result;
 
    if (!mapdata_has_tile(x, y, layer)) {
        return 0;
    }
 
    result = mapdata_cell(pl_pos.x+x, pl_pos.y+y)->tails[layer].face;
    if (result != 0) {
        int clear_bigface;
        int dx = mapdata_cell(pl_pos.x+x, pl_pos.y+y)->tails[layer].size_x;
        int dy = mapdata_cell(pl_pos.x+x, pl_pos.y+y)->tails[layer].size_y;
        int w = mapdata_cell(pl_pos.x+x+dx, pl_pos.y+y+dy)->heads[layer].size_x;
        int h = mapdata_cell(pl_pos.x+x+dx, pl_pos.y+y+dy)->heads[layer].size_y;
        assert(1 <= w && w <= MAX_FACE_SIZE);
        assert(1 <= h && h <= MAX_FACE_SIZE);
        assert(0 <= dx && dx < w);
        assert(0 <= dy && dy < h);
 
        /* Now check if we are about to display an obsolete big face: such a
         * face has a cleared ("fog of war") head but the current tile is not
         * fog of war. Since the server would have sent an appropriate head
         * tile if it was already valid, just clear the big face and do not
         * return it.
         */
        if (mapdata_cell(pl_pos.x+x, pl_pos.y+y)->state == FOG) {
            /* Current face is a "fog of war" tile ==> do not clear
             * old information.
             */
            clear_bigface = 0;
        } else {
            if (x+dx < width && y+dy < height) {
                /* Clear face if current tile is valid but the
                 * head is marked as cleared.
                 */
                clear_bigface = mapdata_cell(pl_pos.x+x+dx, pl_pos.y+y+dy)->state == FOG;
            } else {
                /* Clear face if current tile is valid but the
                 * head is not set.
                 */
                clear_bigface = bigfaces[x+dx][y+dy][layer].head.face == 0;
            }
        }
 
        if (!clear_bigface) {
            *ww = w-1-dx;
            *hh = h-1-dy;
            return(result);
        }
 
        assert(mapdata_cell(pl_pos.x+x, pl_pos.y+y)->tails[layer].face == result);
        expand_clear_face_from_layer(pl_pos.x+x+dx, pl_pos.y+y+dy, layer);
        assert(mapdata_cell(pl_pos.x+x, pl_pos.y+y)->tails[layer].face == 0);
    }
 
    result = bigfaces[x][y][layer].tail.face;
    if (result != 0) {
        int dx = bigfaces[x][y][layer].tail.size_x;
        int dy = bigfaces[x][y][layer].tail.size_y;
        int w = bigfaces[x+dx][y+dy][layer].head.size_x;
        int h = bigfaces[x+dx][y+dy][layer].head.size_y;
        assert(0 <= dx && dx < w);
        assert(0 <= dy && dy < h);
        *ww = w-1-dx;
        *hh = h-1-dy;
        return(result);
    }
 
    *ww = 1;
    *hh = 1;
    return(0);
}
 
/* This is used by the opengl logic.
 * Basically the opengl code draws the the entire image,
 * and doesn't care if if portions are off the edge
 * (opengl takes care of that).  So basically, this
 * function returns only if the head for a space is set,
 * otherwise, returns 0 - we don't care about the tails
 * or other details really.
 */
gint16 mapdata_bigface_head(int x, int y, int layer, int *ww, int *hh) {
    gint16 result;
 
    if (!mapdata_has_tile(x, y, layer)) {
        return 0;
    }
 
    result = bigfaces[x][y][layer].head.face;
    if (result != 0) {
        int w = bigfaces[x][y][layer].head.size_x;
        int h = bigfaces[x][y][layer].head.size_y;
        *ww = w;
        *hh = h;
        return(result);
    }
 
    *ww = 1;
    *hh = 1;
    return(0);
}
 
static void recenter_virtual_map_view(int diff_x, int diff_y)
{
    int new_x, new_y;
    int shift_x, shift_y;
    int src_x, src_y;
    int dst_x, dst_y;
    int len_x, len_y;
    int sx;
    int dx;
    int i;
 
    /* shift player position in virtual map */
    new_x = pl_pos.x+diff_x;
    new_y = pl_pos.y+diff_y;
 
    /* determine neccessary amount to shift */
 
    /* if(new_x < 1) is not possible: a big face may reach up to
     * (MAX_FACE_SIZE-1) tiles to the left of pl_pos. Therefore maintain a
     * border of at least MAX_FACE_SIZE to the left of the virtual map
     * edge.
     */
    if (new_x < MAX_FACE_SIZE) {
        shift_x = FOG_BORDER_MIN+MAX_FACE_SIZE-new_x;
        /* This yields: new_x+shift_x == FOG_BORDER_MIN+MAX_FACE_SIZE,
         * i.e. left border is FOG_BORDER_MIN+MAX_FACE_SIZE after
         * shifting.
         */
    } else if (new_x+MAX_VIEW > the_map.width) {
        shift_x = the_map.width-FOG_BORDER_MIN-MAX_VIEW-new_x;
        /* This yields: new_x+shift_x ==
         * the_map.width-FOG_BODER_MIN-MAX_VIEW, i.e. right border is
         * FOGBORDER_MIN after shifting.
         */
    } else {
        shift_x = 0;
    }
 
    /* Same as above but for y. */
    if (new_y < MAX_FACE_SIZE) {
        shift_y = FOG_BORDER_MIN+MAX_FACE_SIZE-new_y;
    } else if (new_y+MAX_VIEW > the_map.height) {
        shift_y = the_map.height-FOG_BORDER_MIN-MAX_VIEW-new_y;
    } else {
        shift_y = 0;
    }
 
    /* No shift neccessary? ==> nothing to do. */
    if (shift_x == 0 && shift_y == 0) {
        return;
    }
 
    /* If shifting at all: maintain a border size of FOG_BORDER_MIN to all
     * directions. For example: if pl_pos=30/MAX_FACE_SIZE, and map_scroll is
     * 0/-1: shift pl_pos to FOG_BORDER_MIN+1/FOG_BORDER_MIN+1, not to
     * 30/FOG_BORDER_MIN+1.
     */
    if (shift_x == 0) {
        if (new_x < FOG_BORDER_MIN+MAX_FACE_SIZE) {
            shift_x = FOG_BORDER_MIN+MAX_FACE_SIZE-new_x;
        } else if (new_x+MAX_VIEW+FOG_BORDER_MIN > the_map.width) {
            shift_x = the_map.width-FOG_BORDER_MIN-MAX_VIEW-new_x;
        }
    }
    if (shift_y == 0) {
        if (new_y < FOG_BORDER_MIN+MAX_FACE_SIZE) {
            shift_y = FOG_BORDER_MIN+MAX_FACE_SIZE-new_y;
        } else if (new_y+MAX_VIEW+FOG_BORDER_MIN > the_map.height) {
            shift_y = the_map.height-FOG_BORDER_MIN-MAX_VIEW-new_y;
        }
    }
 
    /* Shift for more than virtual map size? ==> clear whole virtual map
     * and recenter.
     */
    if (shift_x <= -the_map.width || shift_x >= the_map.width
            || shift_y <= -the_map.height || shift_y >= the_map.height) {
        for (dx = 0; dx < the_map.width; dx++) {
            clear_cells(dx, 0, the_map.height);
        }
 
        pl_pos.x = the_map.width/2-width/2;
        pl_pos.y = the_map.height/2-height/2;
        return;
    }
 
    /* Move player position. */
    pl_pos.x += shift_x;
    pl_pos.y += shift_y;
 
    /* Actually shift the virtual map by shift_x/shift_y */
    if (shift_x < 0) {
        src_x = -shift_x;
        dst_x = 0;
        len_x = the_map.width+shift_x;
    } else {
        src_x = 0;
        dst_x = shift_x;
        len_x = the_map.width-shift_x;
    }
 
    if (shift_y < 0) {
        src_y = -shift_y;
        dst_y = 0;
        len_y = the_map.height+shift_y;
    } else {
        src_y = 0;
        dst_y = shift_y;
        len_y = the_map.height-shift_y;
    }
 
    if (shift_x < 0) {
        for (sx = src_x, dx = dst_x, i = 0; i < len_x; sx++, dx++, i++) {
            /* srcx!=dstx ==> can use memcpy since source and
             * destination to not overlap.
             */
            memcpy(mapdata_cell(dx, dst_y), mapdata_cell(sx, src_y), len_y*sizeof(struct MapCell));
        }
    } else if (shift_x > 0) {
        for (sx = src_x+len_x-1, dx = dst_x+len_x-1, i = 0; i < len_x; sx--, dx--, i++) {
            /* srcx!=dstx ==> can use memcpy since source and
             * destination to not overlap.
             */
            memcpy(mapdata_cell(dx, dst_y), mapdata_cell(sx, src_y), len_y*sizeof(struct MapCell));
        }
    } else {
        assert(src_x == dst_x);
        for (dx = src_x, i = 0; i < len_x; dx++, i++) {
            /* srcx==dstx ==> use memmove since source and
             * destination probably do overlap.
             */
            memmove(mapdata_cell(dx, dst_y), mapdata_cell(dx, src_y), len_y*sizeof(struct MapCell));
        }
    }
 
    /* Clear newly opened area */
    for (dx = 0; dx < dst_x; dx++) {
        clear_cells(dx, 0, the_map.height);
    }
    for (dx = dst_x+len_x; dx < the_map.width; dx++) {
        clear_cells(dx, 0, the_map.height);
    }
    if (shift_y > 0) {
        for (dx = 0; dx < len_x; dx++) {
            clear_cells(dx+dst_x, 0, shift_y);
        }
    } else if (shift_y < 0) {
        for (dx = 0; dx < len_x; dx++) {
            clear_cells(dx+dst_x, the_map.height+shift_y, -shift_y);
        }
    }
}
 
static void mapdata_get_image_size(int face, guint8 *w, guint8 *h)
{
    get_map_image_size(face, w, h);
    if (*w < 1) {
        *w = 1;
    }
    if (*h < 1) {
        *h = 1;
    }
    if (*w > MAX_FACE_SIZE) {
        *w = MAX_FACE_SIZE;
    }
    if (*h > MAX_FACE_SIZE) {
        *h = MAX_FACE_SIZE;
    }
}
 
/* This basically goes through all the map spaces and does the necessary
 * animation.
 */
void mapdata_animation(void)
{
    int x, y, layer, face;
    struct MapCellLayer *cell;
 
 
    /* For synchronized animations, what we do is set the initial values
     * in the mapdata to the fields in the animations[] array.  In this way,
     * the code below the iterates the spaces doesn't need to do anything
     * special.  But we have to update the animations[] array here to
     * keep in sync.
     */
    for (x=0; x < MAXANIM; x++) {
        if (animations[x].speed) {
            animations[x].speed_left++;
            if (animations[x].speed_left >= animations[x].speed) {
                animations[x].speed_left=0;
                animations[x].phase++;
                if (animations[x].phase >= animations[x].num_animations) {
                    animations[x].phase=0;
                }
            }
        }
    }
 
    for (x=0; x < MIN(width, CURRENT_MAX_VIEW); x++) {
        for (y=0; y < MIN(height, CURRENT_MAX_VIEW); y++) {
            struct MapCell *map_space = mapdata_cell(pl_pos.x + x, pl_pos.y + y);
            
            /* Short cut some processing here.  It makes sense to me
             * not to animate stuff out of view
             */
            if (map_space->state != VISIBLE) {
                continue;
            }
 
            for (layer=0; layer<MAXLAYERS; layer++) {
                /* Using the cell structure just makes life easier here */
                cell = &map_space->heads[layer];
 
                if (cell->animation) {
                    cell->animation_left++;
                    if (cell->animation_left >= cell->animation_speed) {
                        cell->animation_left=0;
                        cell->animation_phase++;
                        if (cell->animation_phase >= animations[cell->animation].num_animations) {
                            cell->animation_phase=0;
                        }
                        face = animations[cell->animation].faces[cell->animation_phase];
 
                        /* I don't think we send any to the client, but it is possible
                         * for animations to have blank faces.
                         */
                        if (face >0) {
                            expand_set_face(pl_pos.x + x, pl_pos.y + y, layer, face, FALSE);
                        } else {
                            expand_clear_face_from_layer(pl_pos.x + x, pl_pos.y + y , layer);
                        }
                    }
                }
                cell = &bigfaces[x][y][layer].head;
                if (cell->animation) {
                    cell->animation_left++;
                    if (cell->animation_left >= cell->animation_speed) {
                        cell->animation_left=0;
                        cell->animation_phase++;
                        if (cell->animation_phase >= animations[cell->animation].num_animations) {
                            cell->animation_phase=0;
                        }
                        face = animations[cell->animation].faces[cell->animation_phase];
 
                        /* I don't think we send any to the client, but it is possible
                         * for animations to have blank faces.
                         */
                        expand_set_bigface(x, y, layer, face, FALSE);
                    }
                }
            }
        }
    }
}
 
void pl_mpos(int *px, int *py) {
    const int vw = use_config[CONFIG_MAPWIDTH];
    const int vh = use_config[CONFIG_MAPHEIGHT];
    *px = pl_pos.x + vw/2;
    *py = pl_pos.y + vh/2;
}
 
void set_move_to(int dx, int dy) {
    int old_move_to_x = move_to_x;
    int old_move_to_y = move_to_y;
 
    pl_mpos(&move_to_x, &move_to_y);
    move_to_x += dx;
    move_to_y += dy;
 
    if (move_to_x == old_move_to_x && move_to_y == old_move_to_y) {
        // Detect double-click.
        move_to_attack = true;
    } else {
        move_to_attack = false;
    }
}
 
void clear_move_to() {
    move_to_x = 0;
    move_to_y = 0;
    move_to_attack = false;
}
 
bool is_at_moveto() {
    if (move_to_x == 0 && move_to_y == 0) {
        return true;
    }
 
    int px, py;
    pl_mpos(&px, &py);
    return !(move_to_x != px || move_to_y != py);
}
 
void run_move_to() {
    if (move_to_x == 0 && move_to_y == 0) {
        // If not moving to a tile, skip to avoid calling stop_run().
        return;
    }
 
    if (is_at_moveto()) {
        clear_move_to();
        stop_run();
        return;
    }
 
    int px, py;
    pl_mpos(&px, &py);
    int dx = move_to_x - px;
    int dy = move_to_y - py;
    int dir = relative_direction(dx, dy);
 
    if (move_to_attack) {
        run_dir(dir);
    } else {
        walk_dir(dir);
    }
}