| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 |
* |
| 6 |
* Deliantra is free software: you can redistribute it and/or modify it under |
| 7 |
* the terms of the Affero GNU General Public License as published by the |
| 8 |
* Free Software Foundation, either version 3 of the License, or (at your |
| 9 |
* option) any later version. |
| 10 |
* |
| 11 |
* This program is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the Affero GNU General Public License |
| 17 |
* and the GNU General Public License along with this program. If not, see |
| 18 |
* <http://www.gnu.org/licenses/>. |
| 19 |
* |
| 20 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 21 |
*/ |
| 22 |
|
| 23 |
#ifndef FACE_H__ |
| 24 |
#define FACE_H__ |
| 25 |
|
| 26 |
#include <util.h> |
| 27 |
#include <unordered_map> |
| 28 |
|
| 29 |
#define CHKSUM_MAXLEN 15 |
| 30 |
#define MAX_FACES 65535 // we reserve face #65535 |
| 31 |
|
| 32 |
extern faceidx blank_face, empty_face, magicmouth_face; |
| 33 |
|
| 34 |
struct facedata |
| 35 |
{ |
| 36 |
uint8 chksum[CHKSUM_MAXLEN]; |
| 37 |
uint8 chksum_len; |
| 38 |
|
| 39 |
facedata () |
| 40 |
: chksum_len (0) |
| 41 |
{ } |
| 42 |
}; |
| 43 |
|
| 44 |
/* New face structure - this enforces the notion that data is face by |
| 45 |
* face only - you can not change the color of an item - you need to instead |
| 46 |
* create a new face with that color. |
| 47 |
*/ |
| 48 |
struct faceinfo |
| 49 |
{ |
| 50 |
faceinfo () |
| 51 |
: number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1) |
| 52 |
{ |
| 53 |
} |
| 54 |
|
| 55 |
shstr name; |
| 56 |
facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
| 57 |
faceidx number; /* This is the image id. It should be the */ |
| 58 |
/* same value as its position in the array */ |
| 59 |
faceidx smooth; /* the smooth face for this face, or 0 */ |
| 60 |
uint8 type; // 0 normal face, otherwise other resource |
| 61 |
uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
| 62 |
uint8 visibility; |
| 63 |
uint8 magicmap; /* Color to show this in magic map */ |
| 64 |
|
| 65 |
facedata *data (int faceset) const; |
| 66 |
|
| 67 |
int refcnt; // reference count - 1 |
| 68 |
void ref () { ++refcnt; } |
| 69 |
void unref (); |
| 70 |
}; |
| 71 |
|
| 72 |
inline void |
| 73 |
object_freezer::put (const keyword_string k, faceinfo *v) |
| 74 |
{ |
| 75 |
if (expect_true (v)) |
| 76 |
put (k, v->name); |
| 77 |
else |
| 78 |
put (k); |
| 79 |
} |
| 80 |
|
| 81 |
typedef std::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
| 82 |
|
| 83 |
extern facehash_t facehash; |
| 84 |
extern std::vector<faceinfo> faces; |
| 85 |
|
| 86 |
/* This returns an the face number of face 'name'. Number is constant |
| 87 |
* during an invocation, but not necessarily between versions (this |
| 88 |
* is because the faces are arranged in alphabetical order, so |
| 89 |
* if a face is removed or added, all faces after that will now |
| 90 |
* have a different number. |
| 91 |
* |
| 92 |
* If a face is not found, then defidx is returned. This can be useful |
| 93 |
* if you want some default face used, or can be set to negative so that |
| 94 |
* it will be known that the face could not be found. |
| 95 |
*/ |
| 96 |
faceidx face_find (const char *name, faceidx defidx = 0); |
| 97 |
faceidx face_alloc (); |
| 98 |
faceinfo *face_info (faceidx idx); |
| 99 |
facedata *face_data (faceidx idx, int faceset); |
| 100 |
|
| 101 |
struct MapLook |
| 102 |
{ |
| 103 |
faceinfo *face; |
| 104 |
uint8 flags; |
| 105 |
}; |
| 106 |
|
| 107 |
typedef uint16 animidx; |
| 108 |
|
| 109 |
struct animation |
| 110 |
{ |
| 111 |
faceidx *faces; /* The different animations */ |
| 112 |
int num_animations; /* How many different faces to animate */ |
| 113 |
sint8 facings; /* How many facings (1,2,4,8) */ |
| 114 |
animidx number; |
| 115 |
shstr name; /* Name of the animation sequence */ |
| 116 |
|
| 117 |
static animation &create (const char *name, uint8 frames, uint8 facings = 1); |
| 118 |
static animation &find (const char *name); |
| 119 |
|
| 120 |
void resize (int new_size); |
| 121 |
}; |
| 122 |
|
| 123 |
typedef std::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
| 124 |
|
| 125 |
extern std::vector<animation> animations; |
| 126 |
|
| 127 |
#endif |
| 128 |
|
