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.5 by root, Wed Dec 13 21:27:09 2006 UTC vs.
Revision 1.47 by root, Sat Nov 17 23:40:01 2018 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6 *
7 * Deliantra is free software: you can redistribute it and/or modify it under
8 * the terms of the Affero GNU General Public License as published by the
9 * Free Software Foundation, either version 3 of the License, or (at your
10 * option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
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>
22 */
3 23
4 Copyright (C) 1994 Mark Wedel 24#ifndef FACE_H__
5 Copyright (C) 1992 Frank Tore Johansen 25#define FACE_H__
6 26
7 This program is free software; you can redistribute it and/or modify 27#include <util.h>
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
11 28
12 This program is distributed in the hope that it will be useful, 29#include "flat_hash_map.hpp"
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16 30
17 You should have received a copy of the GNU General Public License 31#define CHKSUM_MAXLEN 15
18 along with this program; if not, write to the Free Software 32#define MAX_FACES 65535 // we reserve face #65535
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 33
21 The author can be reached via e-mail to mark@pyramid.com 34extern faceidx blank_face, empty_face, magicmouth_face;
22*/ 35
36struct facedata
37{
38 uint8 chksum[CHKSUM_MAXLEN];
39 uint8 chksum_len;
40
41 facedata ()
42 : chksum_len (0)
43 { }
44};
23 45
24/* 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
25 * 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
26 * create a new face with that color. 48 * create a new face with that color.
27 */ 49 */
28struct New_Face 50struct faceinfo
29{ 51{
52 faceinfo ()
53 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1)
54 {
55 }
56
57 shstr name;
58 facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text
30 uint16 number; /* This is the image id. It should be the */ 59 faceidx number; /* This is the image id. It should be the */
31 /* same value as its position in the array */ 60 /* same value as its position in the array */
32 shstr name; 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
33 uint8 visibility; 64 uint8 visibility;
34 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 ();
35}; 72};
73
74inline void
75object_freezer::put (const keyword_string k, faceinfo *v)
76{
77 if (expect_true (v))
78 put (k, v->name);
79 else
80 put (k);
81}
82
83typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> facehash_t;
84
85extern facehash_t facehash;
86extern std::vector<faceinfo> faces;
87
88/* This returns an the face number of face 'name'. Number is constant
89 * during an invocation, but not necessarily between versions (this
90 * is because the faces are arranged in alphabetical order, so
91 * if a face is removed or added, all faces after that will now
92 * have a different number.
93 *
94 * If a face is not found, then defidx is returned. This can be useful
95 * if you want some default face used, or can be set to negative so that
96 * it will be known that the face could not be found.
97 */
98faceidx face_find (const char *name, faceidx defidx = 0);
99faceidx face_alloc ();
100faceinfo *face_info (faceidx idx);
101facedata *face_data (faceidx idx, int faceset);
36 102
37struct MapLook 103struct MapLook
38{ 104{
39 New_Face *face; 105 faceinfo *face;
40 uint8 flags; 106 uint8 flags;
41}; 107};
42 108
109typedef uint16 animidx;
110
43struct Animations 111struct animation
44{ 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;
45 shstr name; /* Name of the animation sequence */ 117 shstr name; /* Name of the animation sequence */
46 uint8 num_animations; /* How many different faces to animate */ 118
47 uint8 facings; /* How many facings (1,2,4,8) */ 119 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
48 uint16 *faces; /* The different animations */ 120 static animation &find (const char *name);
49 uint16 num; /* Where we are in the array */ 121
122 void resize (int new_size);
50}; 123};
51 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;
128
129#endif
130

Diff Legend

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