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.10 by root, Wed Mar 14 00:04:58 2007 UTC vs.
Revision 1.48 by root, Wed Dec 5 19:03:26 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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (C) 1994 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 (C) 1992 Frank Tore Johansen
7 * 6 *
8 * This program is free software; you can redistribute it and/or modify 7 * 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 8 * 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 9 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 10 * option) any later version.
12 * 11 *
13 * This program is distributed in the hope that it will be useful, 12 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 15 * 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 * 16 *
22 * The author can be reached via e-mail to mark@pyramid.com 17 * You should have received a copy of the Affero GNU General Public License
18 * and the GNU General Public License along with this program. If not, see
19 * <http://www.gnu.org/licenses/>.
20 *
21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
23
24#ifndef FACE_H__ 24#ifndef FACE_H__
25#define FACE_H__ 25#define FACE_H__
26 26
27#include <string> 27#include <util.h>
28#include <tr1/unordered_map>
29 28
30#define CHKSUM_SIZE (128 / 8) 29#include "flat_hash_map.hpp"
31#define MAX_FACES 10000 // stupid gcfclient artificially limits
32 30
33typedef uint16 faceidx; 31#define CHKSUM_MAXLEN 15
32#define MAX_FACES 65535 // we reserve face #65535
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;
40 uint8 chksum[CHKSUM_SIZE]; 38 uint8 chksum[CHKSUM_MAXLEN];
39 uint8 chksum_len;
40
41 facedata ()
42 : chksum_len (0)
43 { }
41}; 44};
42 45
43/* 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
44 * 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
45 * create a new face with that color. 48 * create a new face with that color.
46 */ 49 */
47struct faceinfo : zero_initialised 50struct faceinfo
48{ 51{
52 faceinfo ()
53 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1)
54 {
55 }
56
49 shstr name; 57 shstr name;
50 facedata data32, data64; 58 facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
51 faceidx number; /* This is the image id. It should be the */ 59 faceidx number; /* This is the image id. It should be the */
52 /* same value as its position in the array */ 60 /* same value as its position in the array */
53 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
63 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
54 uint8 visibility; 64 uint8 visibility;
55 uint8 magicmap; /* Color to show this in magic map */ 65 uint8 magicmap; /* Color to show this in magic map */
66
67 facedata *data (int faceset) const;
68
69 int refcnt; // reference count - 1
70 void ref () { ++refcnt; }
71 void unref ();
56}; 72};
57 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
58typedef 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;
59 84
60extern facehash_t facehash; 85extern facehash_t facehash;
61extern std::vector<faceinfo> faces; 86extern std::vector<faceinfo> faces;
62 87
63/* 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
… …
69 * 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
70 * 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
71 * it will be known that the face could not be found. 96 * it will be known that the face could not be found.
72 */ 97 */
73faceidx face_find (const char *name, faceidx defidx = 0); 98faceidx face_find (const char *name, faceidx defidx = 0);
99faceidx face_alloc ();
74faceinfo *face_info (faceidx idx); 100faceinfo *face_info (faceidx idx);
75facedata *face_data (faceidx idx, int faceset); 101facedata *face_data (faceidx idx, int faceset);
76 102
77struct MapLook 103struct MapLook
78{ 104{
79 faceinfo *face; 105 faceinfo *face;
80 uint8 flags; 106 uint8 flags;
81}; 107};
82 108
109typedef uint16 animidx;
110
83struct animation 111struct animation
84{ 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;
85 shstr name; /* Name of the animation sequence */ 117 shstr name; /* Name of the animation sequence */
86 uint8 num_animations; /* How many different faces to animate */ 118
87 uint8 facings; /* How many facings (1,2,4,8) */ 119 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
88 faceidx *faces; /* The different animations */ 120 static animation &find (const char *name);
89 uint16 num; /* Where we are in the array */ 121
122 void resize (int new_size);
90}; 123};
124
125typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> animhash_t;
126
127extern std::vector<animation> animations;
91 128
92#endif 129#endif
93 130

Diff Legend

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