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.5 by root, Wed Dec 13 21:27:09 2006 UTC vs.
Revision 1.41 by root, Fri Nov 9 00:11:49 2012 UTC

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

Diff Legend

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