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.9 by root, Sun Mar 11 02:12:44 2007 UTC vs.
Revision 1.46 by root, Sat Nov 17 23:33:18 2018 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,2013,2014,2015,2016 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
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>
29 27
30#define CHKSUM_SIZE (128 / 8) 28#include "flat_hash_map.hpp"
31#define MAX_FACES 10000 // stupid gcfclient artificially limits
32 29
33typedef uint16 faceidx; 30#define CHKSUM_MAXLEN 15
31#define MAX_FACES 65535 // we reserve face #65535
34 32
35extern faceidx blank_face, empty_face; 33extern faceidx blank_face, empty_face, magicmouth_face;
34
35struct facedata
36{
37 uint8 chksum[CHKSUM_MAXLEN];
38 uint8 chksum_len;
39
40 facedata ()
41 : chksum_len (0)
42 { }
43};
36 44
37/* New face structure - this enforces the notion that data is face by 45/* New face structure - this enforces the notion that data is face by
38 * face only - you can not change the color of an item - you need to instead 46 * face only - you can not change the color of an item - you need to instead
39 * create a new face with that color. 47 * create a new face with that color.
40 */ 48 */
41struct faceinfo 49struct faceinfo
42{ 50{
51 faceinfo ()
52 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1)
53 {
54 }
55
43 shstr name; 56 shstr name;
57 facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
44 faceidx number; /* This is the image id. It should be the */ 58 faceidx number; /* This is the image id. It should be the */
45 /* same value as its position in the array */ 59 /* same value as its position in the array */
60 faceidx smooth; /* the smooth face for this face, or 0 */
61 uint8 type; // 0 normal face, otherwise other resource
62 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
46 uint8 visibility; 63 uint8 visibility;
47 uint8 magicmap; /* Color to show this in magic map */ 64 uint8 magicmap; /* Color to show this in magic map */
65
66 facedata *data (int faceset) const;
67
68 int refcnt; // reference count - 1
69 void ref () { ++refcnt; }
70 void unref ();
48}; 71};
49 72
50struct facedata 73inline void
74object_freezer::put (const keyword_string k, faceinfo *v)
51{ 75{
52 std::string data; 76 if (expect_true (v))
53 uint8 chksum[CHKSUM_SIZE]; 77 put (k, v->name);
54}; 78 else
79 put (k);
80}
55 81
56typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; 82typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> facehash_t;
57 83
58extern facehash_t facehash; 84extern facehash_t facehash;
59extern std::vector<faceinfo> faces; 85extern std::vector<faceinfo> faces;
60extern std::vector<facedata> face32, face64;
61 86
62/* This returns an the face number of face 'name'. Number is constant 87/* This returns an the face number of face 'name'. Number is constant
63 * during an invocation, but not necessarily between versions (this 88 * during an invocation, but not necessarily between versions (this
64 * is because the faces are arranged in alphabetical order, so 89 * is because the faces are arranged in alphabetical order, so
65 * if a face is removed or added, all faces after that will now 90 * if a face is removed or added, all faces after that will now
… …
67 * 92 *
68 * If a face is not found, then defidx is returned. This can be useful 93 * If a face is not found, then defidx is returned. This can be useful
69 * if you want some default face used, or can be set to negative so that 94 * if you want some default face used, or can be set to negative so that
70 * it will be known that the face could not be found. 95 * it will be known that the face could not be found.
71 */ 96 */
72int face_find (const char *name, int defidx = 0); 97faceidx face_find (const char *name, faceidx defidx = 0);
98faceidx face_alloc ();
99faceinfo *face_info (faceidx idx);
73facedata *face_data (int idx, int faceset); 100facedata *face_data (faceidx idx, int faceset);
74 101
75struct MapLook 102struct MapLook
76{ 103{
77 faceinfo *face; 104 faceinfo *face;
78 uint8 flags; 105 uint8 flags;
79}; 106};
80 107
108typedef uint16 animidx;
109
81struct animation 110struct animation
82{ 111{
112 faceidx *faces; /* The different animations */
113 int num_animations; /* How many different faces to animate */
114 sint8 facings; /* How many facings (1,2,4,8) */
115 animidx number;
83 shstr name; /* Name of the animation sequence */ 116 shstr name; /* Name of the animation sequence */
84 uint8 num_animations; /* How many different faces to animate */ 117
85 uint8 facings; /* How many facings (1,2,4,8) */ 118 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
86 faceidx *faces; /* The different animations */ 119 static animation &find (const char *name);
87 uint16 num; /* Where we are in the array */ 120
121 void resize (int new_size);
88}; 122};
123
124typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> animhash_t;
125
126extern std::vector<animation> animations;
89 127
90#endif 128#endif
91 129

Diff Legend

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