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.13 by root, Tue Apr 10 09:35:23 2007 UTC vs.
Revision 1.42 by root, Sun Nov 11 04:29:11 2012 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 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> 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 65535 // we reserve face #65535
32 31
33typedef uint16 faceidx;
34
35extern faceidx blank_face, empty_face; 32extern faceidx blank_face, empty_face, magicmouth_face;
36 33
37struct facedata 34struct facedata
38{ 35{
39 std::string data; 36 uint32_t size;
37 uint32_t fofs; // file offste in facedatax
40 uint8 chksum[CHKSUM_SIZE]; 38 uint8 chksum[CHKSUM_MAXLEN];
39 uint8 chksum_len;
40
41 facedata ()
42 : size (0), fofs (0), 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 50struct faceinfo
48{ 51{
52 faceinfo ()
53 : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0)
54 {
55 }
56
49 shstr name; 57 shstr name;
50 facedata data32, data64; 58 HV *meta_hv; /* note, no destructor of copy constructor, must never be freed, but can be moved aorund */
59 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 */ 60 faceidx number; /* This is the image id. It should be the */
52 /* same value as its position in the array */ 61 /* same value as its position in the array */
53 faceidx smooth; /* the smooth face for this face, or 0 */ 62 faceidx smooth; /* the smooth face for this face, or 0 */
63 uint8 type; // 0 normal face, otherwise other resource
54 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers 64 uint8 smoothlevel; // smoothlevel is per-face in 2.x servers
55 uint8 visibility; 65 uint8 visibility;
56 uint8 magicmap; /* Color to show this in magic map */ 66 uint8 magicmap; /* Color to show this in magic map */
57 67
58 faceinfo () 68 facedata *data (int faceset) const;
59 : number (0), smooth (0), smoothlevel (0), visibility (0), magicmap (0) 69
60 { } 70 int refcnt; // reference count - 1
71 void ref () { ++refcnt; }
72 void unref ();
61}; 73};
62 74
75inline void
76object_freezer::put (const keyword_string k, faceinfo *v)
77{
78 if (expect_true (v))
79 put (k, v->name);
80 else
81 put (k);
82}
83
63typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> >, true> facehash_t; 84typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t;
64 85
65extern facehash_t facehash; 86extern facehash_t facehash;
66extern std::vector<faceinfo> faces; 87extern std::vector<faceinfo> faces;
67 88
68/* This returns an the face number of face 'name'. Number is constant 89/* This returns an the face number of face 'name'. Number is constant
… …
74 * If a face is not found, then defidx is returned. This can be useful 95 * If a face is not found, then defidx is returned. This can be useful
75 * if you want some default face used, or can be set to negative so that 96 * if you want some default face used, or can be set to negative so that
76 * it will be known that the face could not be found. 97 * it will be known that the face could not be found.
77 */ 98 */
78faceidx face_find (const char *name, faceidx defidx = 0); 99faceidx face_find (const char *name, faceidx defidx = 0);
100faceidx face_alloc ();
79faceinfo *face_info (faceidx idx); 101faceinfo *face_info (faceidx idx);
80facedata *face_data (faceidx idx, int faceset); 102facedata *face_data (faceidx idx, int faceset);
81 103
82struct MapLook 104struct MapLook
83{ 105{
84 faceinfo *face; 106 faceinfo *face;
85 uint8 flags; 107 uint8 flags;
86}; 108};
87 109
110typedef uint16 animidx;
111
88struct animation 112struct animation
89{ 113{
114 faceidx *faces; /* The different animations */
115 int num_animations; /* How many different faces to animate */
116 sint8 facings; /* How many facings (1,2,4,8) */
117 animidx number;
90 shstr name; /* Name of the animation sequence */ 118 shstr name; /* Name of the animation sequence */
91 uint8 num_animations; /* How many different faces to animate */ 119
92 uint8 facings; /* How many facings (1,2,4,8) */ 120 static animation &create (const char *name, uint8 frames, uint8 facings = 1);
93 faceidx *faces; /* The different animations */ 121 static animation &find (const char *name);
94 uint16 num; /* Where we are in the array */ 122
123 void resize (int new_size);
95}; 124};
125
126typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t;
127
128extern std::vector<animation> animations;
96 129
97#endif 130#endif
98 131

Diff Legend

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