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.26 by root, Tue Jul 29 02:00:55 2008 UTC vs.
Revision 1.40 by root, Mon Oct 29 23:55:53 2012 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 1994,2007 Mark Wedel
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 5 *
8 * Deliantra 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 3 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 * 15 *
18 * You should have received a copy of the GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
20 * 19 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 20 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 21 */
23 22
24#ifndef FACE_H__ 23#ifndef FACE_H__
25#define FACE_H__ 24#define FACE_H__
26 25
27#include <string> 26#include <util.h>
28#include <tr1/unordered_map> 27#include <tr1/unordered_map>
29 28
30#define CHKSUM_SIZE 6 29#define CHKSUM_MAXLEN 15
31#define MAX_FACES 10000 // stupid gcfclient artificially limits 30#define MAX_FACES 10000 // stupid gcfclient artificially limits
32 31
33typedef uint16 faceidx; 32typedef uint16 faceidx;
34 33
35extern faceidx blank_face, empty_face; 34extern faceidx blank_face, empty_face, magicmouth_face;
36 35
37struct facedata 36struct facedata
38{ 37{
39 std::string data; 38 refcnt_buf data; // no need to be refcounted actually
40 uint8 chksum[CHKSUM_SIZE]; 39 uint8 chksum[CHKSUM_MAXLEN];
40 uint8 chksum_len;
41
42 facedata ()
43 : chksum_len (0)
44 { }
41}; 45};
42 46
43/* 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
44 * 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
45 * create a new face with that color. 49 * create a new face with that color.
46 */ 50 */
47struct faceinfo 51struct faceinfo
48{ 52{
49 faceinfo () 53 faceinfo ()
50 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0) 54 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0)
51 { 55 {
52 } 56 }
53 57
54 shstr name; 58 shstr name;
55 std::string meta; 59 HV *meta_hv; /* note, no destructor of copy constructor, must never be freed, but can be moved aorund */
56 facedata data32, data64; // either 32/64 face or data32 == generic resource 60 facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
57 faceidx number; /* This is the image id. It should be the */ 61 faceidx number; /* This is the image id. It should be the */
58 /* same value as its position in the array */ 62 /* same value as its position in the array */
59 faceidx smooth; /* the smooth face for this face, or 0 */ 63 faceidx smooth; /* the smooth face for this face, or 0 */
60 uint8 type; // 0 normal face, otherwise other resource 64 uint8 type; // 0 normal face, otherwise other resource
61 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers 65 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
62 uint8 visibility; 66 uint8 visibility;
63 uint8 magicmap; /* Color to show this in magic map */ 67 uint8 magicmap; /* Color to show this in magic map */
64 68
65 facedata *data (int faceset) const; 69 facedata *data (int faceset) const;
70
71 int refcnt; // reference count - 1
72 void ref () { ++refcnt; }
73 void unref ();
66}; 74};
67 75
68inline void 76inline void
69object_freezer::put (keyword k, faceinfo *v) 77object_freezer::put (const keyword_string k, faceinfo *v)
70{ 78{
71 put (k, v ? &v->name : (const char *)0); 79 if (expect_true (v))
80 put (k, v->name);
81 else
82 put (k);
72} 83}
73 84
74typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; 85typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t;
75 86
76extern facehash_t facehash; 87extern facehash_t facehash;
… …
85 * If a face is not found, then defidx is returned. This can be useful 96 * If a face is not found, then defidx is returned. This can be useful
86 * if you want some default face used, or can be set to negative so that 97 * if you want some default face used, or can be set to negative so that
87 * it will be known that the face could not be found. 98 * it will be known that the face could not be found.
88 */ 99 */
89faceidx face_find (const char *name, faceidx defidx = 0); 100faceidx face_find (const char *name, faceidx defidx = 0);
101faceidx face_alloc ();
90faceinfo *face_info (faceidx idx); 102faceinfo *face_info (faceidx idx);
91facedata *face_data (faceidx idx, int faceset); 103facedata *face_data (faceidx idx, int faceset);
92 104
93struct MapLook 105struct MapLook
94{ 106{
… …
112 void resize (int new_size); 124 void resize (int new_size);
113}; 125};
114 126
115typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; 127typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t;
116 128
117extern animhash_t animhash;
118extern std::vector<animation> animations; 129extern std::vector<animation> animations;
119 130
120#endif 131#endif
121 132

Diff Legend

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