ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/face.h
Revision: 1.41
Committed: Fri Nov 9 00:11:49 2012 UTC (11 years, 6 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.40: +2 -2 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 /*
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 */
22
23 #ifndef FACE_H__
24 #define FACE_H__
25
26 #include <util.h>
27 #include <tr1/unordered_map>
28
29 #define CHKSUM_MAXLEN 15
30 #define MAX_FACES 65535 // we reserve face #65535
31
32 typedef uint16 faceidx;
33
34 extern faceidx blank_face, empty_face, magicmouth_face;
35
36 struct facedata
37 {
38 refcnt_buf data;
39 uint8 chksum[CHKSUM_MAXLEN];
40 uint8 chksum_len;
41
42 facedata ()
43 : chksum_len (0)
44 { }
45 };
46
47 /* New face structure - this enforces the notion that data is face by
48 * face only - you can not change the color of an item - you need to instead
49 * create a new face with that color.
50 */
51 struct faceinfo
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
61 faceidx number; /* This is the image id. It should be the */
62 /* same value as its position in the array */
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
66 uint8 visibility;
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 ();
74 };
75
76 inline void
77 object_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
85 typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t;
86
87 extern facehash_t facehash;
88 extern 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 */
100 faceidx face_find (const char *name, faceidx defidx = 0);
101 faceidx face_alloc ();
102 faceinfo *face_info (faceidx idx);
103 facedata *face_data (faceidx idx, int faceset);
104
105 struct MapLook
106 {
107 faceinfo *face;
108 uint8 flags;
109 };
110
111 typedef uint16 animidx;
112
113 struct animation
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;
119 shstr name; /* Name of the animation sequence */
120
121 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
122 static animation &find (const char *name);
123
124 void resize (int new_size);
125 };
126
127 typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t;
128
129 extern std::vector<animation> animations;
130
131 #endif
132