| 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,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 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 <util.h> |
26 | #include <util.h> |
| 27 | #include <tr1/unordered_map> |
27 | |
|
|
28 | #include "flat_hash_map.hpp" |
| 28 | |
29 | |
| 29 | #define CHKSUM_MAXLEN 15 |
30 | #define CHKSUM_MAXLEN 15 |
| 30 | #define MAX_FACES 10000 // stupid gcfclient artificially limits |
31 | #define MAX_FACES 65535 // we reserve face #65535 |
| 31 | |
|
|
| 32 | typedef uint16 faceidx; |
|
|
| 33 | |
32 | |
| 34 | extern faceidx blank_face, empty_face, magicmouth_face; |
33 | extern faceidx blank_face, empty_face, magicmouth_face; |
| 35 | |
34 | |
| 36 | struct facedata |
35 | struct facedata |
| 37 | { |
36 | { |
| 38 | refcnt_buf data; // no need to be refcounted actually |
|
|
| 39 | uint8 chksum[CHKSUM_MAXLEN]; |
37 | uint8 chksum[CHKSUM_MAXLEN]; |
| 40 | uint8 chksum_len; |
38 | uint8 chksum_len; |
| 41 | |
39 | |
| 42 | facedata () |
40 | facedata () |
| 43 | : chksum_len (0) |
41 | : chksum_len (0) |
| … | |
… | |
| 54 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1) |
52 | : number (0), smooth (0), type (0), smoothlevel (0), visibility (0), magicmap (0), refcnt (1) |
| 55 | { |
53 | { |
| 56 | } |
54 | } |
| 57 | |
55 | |
| 58 | shstr name; |
56 | shstr name; |
| 59 | std::string meta; |
|
|
| 60 | facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
57 | facedata face[3]; // indexed by faceset, 0 == 32 bit or generic, 1 == 64, 2 == text |
| 61 | faceidx number; /* This is the image id. It should be the */ |
58 | faceidx number; /* This is the image id. It should be the */ |
| 62 | /* same value as its position in the array */ |
59 | /* same value as its position in the array */ |
| 63 | faceidx smooth; /* the smooth face for this face, or 0 */ |
60 | faceidx smooth; /* the smooth face for this face, or 0 */ |
| 64 | uint8 type; // 0 normal face, otherwise other resource |
61 | uint8 type; // 0 normal face, otherwise other resource |
| … | |
… | |
| 80 | put (k, v->name); |
77 | put (k, v->name); |
| 81 | else |
78 | else |
| 82 | put (k); |
79 | put (k); |
| 83 | } |
80 | } |
| 84 | |
81 | |
| 85 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > facehash_t; |
82 | typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> facehash_t; |
| 86 | |
83 | |
| 87 | extern facehash_t facehash; |
84 | extern facehash_t facehash; |
| 88 | extern std::vector<faceinfo> faces; |
85 | extern std::vector<faceinfo> faces; |
| 89 | |
86 | |
| 90 | /* 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 |
| … | |
… | |
| 122 | static animation &find (const char *name); |
119 | static animation &find (const char *name); |
| 123 | |
120 | |
| 124 | void resize (int new_size); |
121 | void resize (int new_size); |
| 125 | }; |
122 | }; |
| 126 | |
123 | |
| 127 | typedef std::tr1::unordered_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int> > > animhash_t; |
124 | typedef ska::flat_hash_map<const char *, int, str_hash, str_equal, slice_allocator< std::pair<const char *const, int>>> animhash_t; |
| 128 | |
125 | |
| 129 | extern std::vector<animation> animations; |
126 | extern std::vector<animation> animations; |
| 130 | |
127 | |
| 131 | #endif |
128 | #endif |
| 132 | |
129 | |
