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.40 by root, Mon Oct 29 23:55:53 2012 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,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 1994 Mark Wedel
6 * Copyright (C) 1992 Frank Tore Johansen
7 * 5 *
8 * This program is free software; you can redistribute it and/or modify 6 * 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 7 * 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 8 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 9 * option) any later version.
12 * 10 *
13 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 14 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 15 *
22 * The author can be reached via e-mail to mark@pyramid.com 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>
23 */ 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 10000 // stupid gcfclient artificially limits
31
32typedef uint16 faceidx;
33
34extern faceidx blank_face, empty_face, magicmouth_face;
35
36struct facedata
37{
38 refcnt_buf data; // no need to be refcounted actually
39 uint8 chksum[CHKSUM_MAXLEN];
40 uint8 chksum_len;
41
42 facedata ()
43 : chksum_len (0)
44 { }
45};
24 46
25/* 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
26 * 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
27 * create a new face with that color. 49 * create a new face with that color.
28 */ 50 */
29struct New_Face 51struct faceinfo
30{ 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
31 uint16 number; /* This is the image id. It should be the */ 61 faceidx number; /* This is the image id. It should be the */
32 /* same value as its position in the array */ 62 /* same value as its position in the array */
33 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
34 uint8 visibility; 66 uint8 visibility;
35 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 ();
36}; 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);
37 104
38struct MapLook 105struct MapLook
39{ 106{
40 New_Face *face; 107 faceinfo *face;
41 uint8 flags; 108 uint8 flags;
42}; 109};
43 110
111typedef uint16 animidx;
112
44struct Animations 113struct animation
45{ 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;
46 shstr name; /* Name of the animation sequence */ 119 shstr name; /* Name of the animation sequence */
47 uint8 num_animations; /* How many different faces to animate */ 120
48 uint8 facings; /* How many facings (1,2,4,8) */ 121 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
49 uint16 *faces; /* The different animations */ 122 static animation &find (const char *name);
50 uint16 num; /* Where we are in the array */ 123
124 void resize (int new_size);
51}; 125};
52 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