ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/face.h
(Generate patch)

Comparing deliantra/server/include/face.h (file contents):
Revision 1.7 by pippijn, Mon Jan 15 21:06:19 2007 UTC vs.
Revision 1.27 by root, Mon Oct 12 14:00:58 2009 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines