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.1.1.1 by root, Fri Feb 3 07:12:48 2006 UTC vs.
Revision 1.42 by root, Sun Nov 11 04:29:11 2012 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines