1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
9 | * option) any later version. |
10 | * |
10 | * |
11 | * 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, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the Affero GNU General Public License |
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 |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
18 | * <http://www.gnu.org/licenses/>. |
19 | * |
19 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
21 | */ |
22 | |
22 | |
23 | #ifndef FACE_H__ |
23 | #ifndef FACE_H__ |
24 | #define FACE_H__ |
24 | #define FACE_H__ |
25 | |
25 | |
26 | #include <string> |
26 | #include <util.h> |
27 | #include <tr1/unordered_map> |
27 | #include <tr1/unordered_map> |
28 | |
28 | |
29 | #define CHKSUM_SIZE 6 |
29 | #define CHKSUM_MAXLEN 15 |
30 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
30 | #define MAX_FACES 65535 // we reserve face #65535 |
31 | |
31 | |
32 | typedef uint16 faceidx; |
|
|
33 | |
|
|
34 | extern faceidx blank_face, empty_face; |
32 | extern faceidx blank_face, empty_face, magicmouth_face; |
35 | |
33 | |
36 | struct facedata |
34 | struct facedata |
37 | { |
35 | { |
38 | std::string data; |
36 | uint32_t size; |
|
|
37 | uint32_t fofs; // file offste in facedatax |
39 | 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 | { } |
40 | }; |
44 | }; |
41 | |
45 | |
42 | /* 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 |
43 | * 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 |
44 | * create a new face with that color. |
48 | * create a new face with that color. |
45 | */ |
49 | */ |
46 | struct faceinfo |
50 | struct faceinfo |
47 | { |
51 | { |
48 | faceinfo () |
52 | faceinfo () |
49 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0) |
53 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1), meta_hv (0) |
50 | { |
54 | { |
51 | } |
55 | } |
52 | |
56 | |
53 | shstr name; |
57 | shstr name; |
54 | std::string meta; |
58 | HV *meta_hv; /* note, no destructor of copy constructor, must never be freed, but can be moved aorund */ |
55 | facedata data32, data64; // either 32/64 face or data32 == generic resource |
59 | facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
56 | faceidx number; /* This is the image id. It should be the */ |
60 | faceidx number; /* This is the image id. It should be the */ |
57 | /* same value as its position in the array */ |
61 | /* same value as its position in the array */ |
58 | faceidx smooth; /* the smooth face for this face, or 0 */ |
62 | faceidx smooth; /* the smooth face for this face, or 0 */ |
59 | uint8 type; // 0 normal face, otherwise other resource |
63 | uint8 type; // 0 normal face, otherwise other resource |
60 | uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
64 | uint8 smoothlevel; // smoothlevel is per-face in 2.x servers |
61 | uint8 visibility; |
65 | uint8 visibility; |
62 | uint8 magicmap; /* Color to show this in magic map */ |
66 | uint8 magicmap; /* Color to show this in magic map */ |
63 | |
67 | |
64 | facedata *data (int faceset) const; |
68 | facedata *data (int faceset) const; |
|
|
69 | |
|
|
70 | int refcnt; // reference count - 1 |
|
|
71 | void ref () { ++refcnt; } |
|
|
72 | void unref (); |
65 | }; |
73 | }; |
66 | |
74 | |
67 | inline void |
75 | inline void |
68 | object_freezer::put (keyword k, faceinfo *v) |
76 | object_freezer::put (const keyword_string k, faceinfo *v) |
69 | { |
77 | { |
70 | put (k, v ? &v->name : (const char *)0); |
78 | if (expect_true (v)) |
|
|
79 | put (k, v->name); |
|
|
80 | else |
|
|
81 | put (k); |
71 | } |
82 | } |
72 | |
83 | |
73 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
84 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
74 | |
85 | |
75 | extern facehash_t facehash; |
86 | extern facehash_t facehash; |
… | |
… | |
84 | * 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 |
85 | * 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 |
86 | * it will be known that the face could not be found. |
97 | * it will be known that the face could not be found. |
87 | */ |
98 | */ |
88 | faceidx face_find (const char *name, faceidx defidx = 0); |
99 | faceidx face_find (const char *name, faceidx defidx = 0); |
|
|
100 | faceidx face_alloc (); |
89 | faceinfo *face_info (faceidx idx); |
101 | faceinfo *face_info (faceidx idx); |
90 | facedata *face_data (faceidx idx, int faceset); |
102 | facedata *face_data (faceidx idx, int faceset); |
91 | |
103 | |
92 | struct MapLook |
104 | struct MapLook |
93 | { |
105 | { |
… | |
… | |
111 | void resize (int new_size); |
123 | void resize (int new_size); |
112 | }; |
124 | }; |
113 | |
125 | |
114 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
126 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
115 | |
127 | |
116 | extern animhash_t animhash; |
|
|
117 | extern std::vector<animation> animations; |
128 | extern std::vector<animation> animations; |
118 | |
129 | |
119 | #endif |
130 | #endif |
120 | |
131 | |