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.15 by root, Mon May 28 21:15:56 2007 UTC vs.
Revision 1.48 by root, Wed Dec 5 19:03:26 2018 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 1994,2007 Mark Wedel 5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 6 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 7 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 8 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 9 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 10 * option) any later version.
12 * 11 *
13 * This program is distributed in the hope that it will be useful, but 12 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * for more details. 15 * GNU General Public License for more details.
17 * 16 *
18 * You should have received a copy of the GNU General Public License along 17 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 18 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 19 * <http://www.gnu.org/licenses/>.
21 * 20 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25#ifndef FACE_H__ 24#ifndef FACE_H__
26#define FACE_H__ 25#define FACE_H__
27 26
28#include <string> 27#include <util.h>
29#include <tr1/unordered_map>
30 28
31#define CHKSUM_SIZE 6 29#include "flat_hash_map.hpp"
32#define MAX_FACES 10000 // stupid gcfclient artificially limits
33 30
34typedef uint16 faceidx; 31#define CHKSUM_MAXLEN 15
32#define MAX_FACES 65535 // we reserve face #65535
35 33
36extern faceidx blank_face, empty_face; 34extern faceidx blank_face, empty_face, magicmouth_face;
37 35
38struct facedata 36struct facedata
39{ 37{
40 std::string data;
41 uint8 chksum[CHKSUM_SIZE]; 38 uint8 chksum[CHKSUM_MAXLEN];
39 uint8 chksum_len;
40
41 facedata ()
42 : chksum_len (0)
43 { }
42}; 44};
43 45
44/* 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
45 * 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
46 * create a new face with that color. 48 * create a new face with that color.
47 */ 49 */
48struct faceinfo 50struct faceinfo
49{ 51{
52 faceinfo ()
53 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1)
54 {
55 }
56
50 shstr name; 57 shstr name;
51 facedata data32, data64; 58 facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
52 faceidx number; /* This is the image id. It should be the */ 59 faceidx number; /* This is the image id. It should be the */
53 /* same value as its position in the array */ 60 /* same value as its position in the array */
54 faceidx smooth; /* the smooth face for this face, or 0 */ 61 faceidx smooth; /* the smooth face for this face, or 0 */
62 uint8 type; // 0 normal face, otherwise other resource
55 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers 63 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
56 uint8 visibility; 64 uint8 visibility;
57 uint8 magicmap; /* Color to show this in magic map */ 65 uint8 magicmap; /* Color to show this in magic map */
58 66
59 faceinfo () 67 facedata *data (int faceset) const;
60 : number (0), smooth (0), smoothlevel (0), visibility (0), magicmap (0) 68
61 { } 69 int refcnt; // reference count - 1
70 void ref () { ++refcnt; }
71 void unref ();
62}; 72};
63 73
74inline void
75object_freezer::put (const keyword_string k, faceinfo *v)
76{
77 if (ecb_expect_true (v))
78 put (k, v->name);
79 else
80 put (k);
81}
82
64typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; 83typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> facehash_t;
65 84
66extern facehash_t facehash; 85extern facehash_t facehash;
67extern std::vector<faceinfo> faces; 86extern std::vector<faceinfo> faces;
68 87
69/* This returns an the face number of face 'name'. Number is constant 88/* This returns an the face number of face 'name'. Number is constant
… …
75 * If a face is not found, then defidx is returned. This can be useful 94 * If a face is not found, then defidx is returned. This can be useful
76 * if you want some default face used, or can be set to negative so that 95 * if you want some default face used, or can be set to negative so that
77 * it will be known that the face could not be found. 96 * it will be known that the face could not be found.
78 */ 97 */
79faceidx face_find (const char *name, faceidx defidx = 0); 98faceidx face_find (const char *name, faceidx defidx = 0);
99faceidx face_alloc ();
80faceinfo *face_info (faceidx idx); 100faceinfo *face_info (faceidx idx);
81facedata *face_data (faceidx idx, int faceset); 101facedata *face_data (faceidx idx, int faceset);
82 102
83struct MapLook 103struct MapLook
84{ 104{
… …
88 108
89typedef uint16 animidx; 109typedef uint16 animidx;
90 110
91struct animation 111struct animation
92{ 112{
113 faceidx *faces; /* The different animations */
114 int num_animations; /* How many different faces to animate */
115 sint8 facings; /* How many facings (1,2,4,8) */
116 animidx number;
93 shstr name; /* Name of the animation sequence */ 117 shstr name; /* Name of the animation sequence */
94 animidx number;
95 uint8 num_animations; /* How many different faces to animate */
96 uint8 facings; /* How many facings (1,2,4,8) */
97 faceidx *faces; /* The different animations */
98 118
99 static animation &create (const char *name, uint8 frames, uint8 facings = 1); 119 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
100 static animation &find (const char *name); 120 static animation &find (const char *name);
101 121
102 void resize (int new_size); 122 void resize (int new_size);
103}; 123};
104 124
105typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> animhash_t; 125typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> animhash_t;
106 126
107extern animhash_t animhash;
108extern std::vector<animation> animations; 127extern std::vector<animation> animations;
109 128
110#endif 129#endif
111 130

Diff Legend

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