| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * under the terms of the GNU General Public License as published by the Free |
9 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * any later version. |
11 | * option) any later version. |
| 12 | * |
12 | * |
| 13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
| 14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * for more details. |
16 | * GNU General Public License for more details. |
| 17 | * |
17 | * |
| 18 | * You should have received a copy of the GNU General Public License along |
18 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * and the GNU General Public License along with this program. If not, see |
| 20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
20 | * <http://www.gnu.org/licenses/>. |
| 21 | * |
21 | * |
| 22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 23 | */ |
23 | */ |
| 24 | |
24 | |
| 25 | #include <cassert> |
25 | #include <cassert> |
| 26 | |
26 | |
| 27 | #include <global.h> |
27 | #include <global.h> |
| 28 | #include <funcpoint.h> |
|
|
| 29 | #include <loader.h> |
28 | #include <loader.h> |
| 30 | |
29 | |
| 31 | #include <tr1/functional> |
30 | #include <tr1/functional> |
| 32 | #include <tr1/unordered_map> |
31 | #include <tr1/unordered_map> |
| 33 | |
32 | |
| 34 | /* The naming of these functions is really poor - they are all |
|
|
| 35 | * pretty much named '.._arch_...', but they may more may not |
|
|
| 36 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
| 37 | * return an object. Perhaps those should be called 'archob' functions |
|
|
| 38 | * to denote they return an object derived from the archetype. |
|
|
| 39 | * MSW 2003-04-29 |
|
|
| 40 | */ |
|
|
| 41 | |
|
|
| 42 | bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
|
|
34 | arch_ptr archetype::empty; |
| 43 | |
35 | |
| 44 | // the hashtable |
36 | // the hashtable |
| 45 | typedef std::tr1::unordered_map |
37 | typedef std::tr1::unordered_map |
| 46 | < |
38 | < |
| 47 | const char *, |
39 | const char *, |
| … | |
… | |
| 49 | str_hash, |
41 | str_hash, |
| 50 | str_equal, |
42 | str_equal, |
| 51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
43 | slice_allocator< std::pair<const char *const, arch_ptr> > |
| 52 | > HT; |
44 | > HT; |
| 53 | |
45 | |
| 54 | static HT ht (5000); |
46 | static HT ht (10000); |
| 55 | archvec archetypes; |
47 | archvec archetypes; |
|
|
48 | static unordered_vector<archetype *> allarch; |
|
|
49 | static int dirtycnt; |
|
|
50 | |
|
|
51 | // the vector of other_arch references to be resolved |
|
|
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
|
|
53 | // the vector of loaded but not yet committed archetypes |
|
|
54 | static std::vector<archetype *> postponed_arch; |
|
|
55 | |
|
|
56 | //+GPL |
| 56 | |
57 | |
| 57 | /** |
58 | /** |
| 58 | * GROS - This function retrieves an archetype given the name that appears |
59 | * GROS - This function retrieves an archetype given the name that appears |
| 59 | * during the game (for example, "writing pen" instead of "stylus"). |
60 | * during the game (for example, "writing pen" instead of "stylus"). |
| 60 | * It does not use the hashtable system, but browse the whole archlist each time. |
61 | * It does not use the hashtable system, but browse the whole archlist each time. |
| … | |
… | |
| 68 | archetype * |
69 | archetype * |
| 69 | find_archetype_by_object_name (const char *name) |
70 | find_archetype_by_object_name (const char *name) |
| 70 | { |
71 | { |
| 71 | shstr_cmp name_cmp (name); |
72 | shstr_cmp name_cmp (name); |
| 72 | |
73 | |
| 73 | for (archetype *at = first_archetype; at; at = at->next) |
74 | for_all_archetypes (at) |
| 74 | if (at->clone.name == name_cmp) |
75 | if (at->name == name_cmp) |
| 75 | return at; |
76 | return at; |
| 76 | |
77 | |
| 77 | return 0; |
78 | return 0; |
| 78 | } |
79 | } |
| 79 | |
80 | |
| … | |
… | |
| 85 | archetype * |
86 | archetype * |
| 86 | find_archetype_by_object_type_name (int type, const char *name) |
87 | find_archetype_by_object_type_name (int type, const char *name) |
| 87 | { |
88 | { |
| 88 | shstr_cmp name_cmp (name); |
89 | shstr_cmp name_cmp (name); |
| 89 | |
90 | |
| 90 | for (archetype *at = first_archetype; at; at = at->next) |
91 | for_all_archetypes (at) |
| 91 | if (at->clone.name == name_cmp && at->clone.type == type) |
92 | if (at->name == name_cmp && at->type == type) |
| 92 | return at; |
93 | return at; |
| 93 | |
94 | |
| 94 | return 0; |
95 | return 0; |
| 95 | } |
96 | } |
| 96 | |
97 | |
| … | |
… | |
| 102 | object * |
103 | object * |
| 103 | get_archetype_by_skill_name (const char *skill, int type) |
104 | get_archetype_by_skill_name (const char *skill, int type) |
| 104 | { |
105 | { |
| 105 | shstr_cmp skill_cmp (skill); |
106 | shstr_cmp skill_cmp (skill); |
| 106 | |
107 | |
| 107 | for (archetype *at = first_archetype; at; at = at->next) |
108 | for_all_archetypes (at) |
| 108 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
109 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
| 109 | return arch_to_object (at); |
110 | return at->instance (); |
| 110 | |
111 | |
| 111 | return 0; |
112 | return 0; |
| 112 | } |
113 | } |
| 113 | |
114 | |
| 114 | /* similiar to above - this returns the first archetype |
115 | /* similiar to above - this returns the first archetype |
| … | |
… | |
| 119 | * (eg, skills) |
120 | * (eg, skills) |
| 120 | */ |
121 | */ |
| 121 | archetype * |
122 | archetype * |
| 122 | get_archetype_by_type_subtype (int type, int subtype) |
123 | get_archetype_by_type_subtype (int type, int subtype) |
| 123 | { |
124 | { |
| 124 | for (archetype *at = first_archetype; at; at = at->next) |
125 | for_all_archetypes (at) |
| 125 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
126 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
| 126 | return at; |
127 | return at; |
| 127 | |
128 | |
| 128 | return 0; |
129 | return 0; |
| 129 | } |
130 | } |
| 130 | |
131 | |
| … | |
… | |
| 135 | * - name: The name we're searching for (ex: "writing pen"); |
136 | * - name: The name we're searching for (ex: "writing pen"); |
| 136 | * Return value: |
137 | * Return value: |
| 137 | * - a corresponding object if found; a singularity object if not found. |
138 | * - a corresponding object if found; a singularity object if not found. |
| 138 | * Note by MSW - it appears that it takes the full name and keeps |
139 | * Note by MSW - it appears that it takes the full name and keeps |
| 139 | * shortening it until it finds a match. I re-wrote this so that it |
140 | * shortening it until it finds a match. I re-wrote this so that it |
| 140 | * doesn't malloc it each time - not that this function is used much, |
141 | * doesn't allocate it each time - not that this function is used much, |
| 141 | * but it otherwise had a big memory leak. |
142 | * but it otherwise had a big memory leak. |
| 142 | */ |
143 | */ |
| 143 | object * |
144 | object * |
| 144 | get_archetype_by_object_name (const char *name) |
145 | get_archetype_by_object_name (const char *name) |
| 145 | { |
146 | { |
| 146 | char tmpname[MAX_BUF]; |
147 | char tmpname[MAX_BUF]; |
| 147 | int i; |
|
|
| 148 | |
148 | |
| 149 | assign (tmpname, name); |
149 | assign (tmpname, name); |
| 150 | |
150 | |
| 151 | for (i = strlen (tmpname); i > 0; i--) |
151 | for (int i = strlen (tmpname); i > 0; i--) |
| 152 | { |
152 | { |
| 153 | tmpname[i] = 0; |
153 | tmpname[i] = 0; |
| 154 | |
154 | |
| 155 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
155 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
| 156 | return arch_to_object (at); |
156 | return at->instance (); |
| 157 | } |
157 | } |
| 158 | |
158 | |
| 159 | return create_singularity (name); |
159 | return create_singularity (name); |
| 160 | } |
160 | } |
| 161 | |
161 | |
| 162 | /* This is a subset of the parse_id command. Basically, name can be |
162 | /* This is a subset of the parse_id command. Basically, name can be |
| 163 | * a string seperated lists of things to match, with certain keywords. |
163 | * a string seperated lists of things to match, with certain keywords. |
| 164 | * pl is the player (only needed to set count properly) |
164 | * pl is the player (only needed to set count properly) |
| 165 | * op is the item we are trying to match. Calling function takes care |
165 | * op is the item we are trying to match. Calling function takes care |
| 166 | * of what action might need to be done and if it is valid |
166 | * of what action might need to be done and if it is valid |
| 167 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
167 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
| 168 | * value means a better match. 0 means no match. |
168 | * value means a better match. 0 means no match. |
| 169 | * |
169 | * |
| 170 | * Brief outline of the procedure: |
170 | * Brief outline of the procedure: |
| 171 | * We take apart the name variable into the individual components. |
171 | * We take apart the name variable into the individual components. |
| 172 | * cases for 'all' and unpaid are pretty obvious. |
172 | * cases for 'all' and unpaid are pretty obvious. |
| 173 | * Next, we check for a count (either specified in name, or in the |
173 | * Next, we check for a count (either specified in name, or in the |
| 174 | * player object.) |
174 | * player object.) |
| 175 | * If count is 1, make a quick check on the name. |
175 | * If count is 1, make a quick check on the name. |
| 176 | * IF count is >1, we need to make plural name. Return if match. |
176 | * IF count is >1, we need to make plural name. Return if match. |
| 177 | * Last, make a check on the full name. |
177 | * Last, make a check on the full name. |
| 178 | */ |
178 | */ |
| 179 | int |
179 | int |
| 180 | item_matched_string (object *pl, object *op, const char *name) |
180 | item_matched_string (object *pl, object *op, const char *name) |
| 181 | { |
181 | { |
| 182 | char *cp, local_name[MAX_BUF]; |
182 | char *cp, local_name[MAX_BUF]; |
| 183 | int count, retval = 0; |
183 | int count, retval = 0; |
| … | |
… | |
| 195 | return 1; |
195 | return 1; |
| 196 | |
196 | |
| 197 | /* unpaid is a little more specific */ |
197 | /* unpaid is a little more specific */ |
| 198 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
198 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
| 199 | return 2; |
199 | return 2; |
|
|
200 | |
| 200 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
201 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
| 201 | return 2; |
202 | return 2; |
| 202 | |
203 | |
| 203 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
204 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
| 204 | return 2; |
205 | return 2; |
| … | |
… | |
| 226 | * is because of the 'else' handling - we don't want to match on |
227 | * is because of the 'else' handling - we don't want to match on |
| 227 | * something and set a low retval, even though it may match a higher retcal |
228 | * something and set a low retval, even though it may match a higher retcal |
| 228 | * later. So keep it in descending order here, so we try for the best |
229 | * later. So keep it in descending order here, so we try for the best |
| 229 | * match first, and work downward. |
230 | * match first, and work downward. |
| 230 | */ |
231 | */ |
|
|
232 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
233 | |
| 231 | if (!strcasecmp (cp, query_name (op))) |
234 | if (!strcasecmp (cp, query_name (op))) |
| 232 | retval = 20; |
235 | retval = 20; |
| 233 | else if (!strcasecmp (cp, query_short_name (op))) |
236 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
| 234 | retval = 18; |
237 | retval = 18; |
| 235 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
238 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
| 236 | retval = 16; |
239 | retval = 16; |
| 237 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
240 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
| 238 | retval = 16; |
241 | retval = 16; |
| 239 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
242 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
| 240 | retval = 15; |
243 | retval = 15; |
| 241 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
244 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
| 242 | retval = 14; |
245 | retval = 14; |
| 243 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
246 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
| 244 | retval = 14; |
247 | retval = 14; |
| 245 | /* Do substring checks, so things like 'Str+1' will match. |
248 | /* Do substring checks, so things like 'Str+1' will match. |
| 246 | * retval of these should perhaps be lower - they are lower |
249 | * retval of these should perhaps be lower - they are lower |
| 247 | * then the specific strcasecmp aboves, but still higher than |
250 | * then the specific strcasecmp aboves, but still higher than |
| 248 | * some other match criteria. |
251 | * some other match criteria. |
| 249 | */ |
252 | */ |
| 250 | else if (strstr (query_base_name (op, 1), cp)) |
253 | else if (strstr (qbn1, cp)) |
| 251 | retval = 12; |
254 | retval = 12; |
| 252 | else if (strstr (query_base_name (op, 0), cp)) |
255 | else if (strstr (qbn0, cp)) |
| 253 | retval = 12; |
256 | retval = 12; |
| 254 | else if (strstr (query_short_name (op), cp)) |
257 | else if (strstr (qsn, cp)) |
| 255 | retval = 12; |
258 | retval = 12; |
| 256 | /* Check against plural/non plural based on count. */ |
259 | /* Check against plural/non plural based on count. */ |
| 257 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
260 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
| 258 | retval = 6; |
261 | retval = 6; |
| 259 | else if (count == 1 && !strcasecmp (op->name, cp)) |
262 | else if (count == 1 && !strcasecmp (op->name, cp)) |
| 260 | retval = 6; |
263 | retval = 6; |
| 261 | /* base name matched - not bad */ |
264 | /* base name matched - not bad */ |
| 262 | else if (strcasecmp (cp, op->name) == 0 && !count) |
265 | else if (strcasecmp (cp, op->name) == 0 && !count) |
| 263 | retval = 4; |
266 | retval = 4; |
| 264 | /* Check for partial custom name, but give a real low priority */ |
267 | /* Check for partial custom name, but give a real low priority */ |
| 265 | else if (op->custom_name && strstr (op->custom_name, cp)) |
268 | else if (op->custom_name.contains (cp)) |
| 266 | retval = 3; |
269 | retval = 3; |
| 267 | |
270 | |
| 268 | if (retval) |
271 | if (retval) |
| 269 | { |
272 | { |
| 270 | if (pl->type == PLAYER) |
273 | if (pl->type == PLAYER) |
| … | |
… | |
| 275 | } |
278 | } |
| 276 | |
279 | |
| 277 | return 0; |
280 | return 0; |
| 278 | } |
281 | } |
| 279 | |
282 | |
| 280 | archetype::archetype () |
283 | //-GPL |
|
|
284 | |
|
|
285 | archetype::archetype (const char *name) |
| 281 | { |
286 | { |
| 282 | clone.arch = this; |
287 | arch = this; |
| 283 | |
288 | this->archname = this->name = this->name_pl = name; |
| 284 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
|
|
| 285 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
| 286 | } |
289 | } |
| 287 | |
290 | |
| 288 | archetype::~archetype () |
291 | archetype::~archetype () |
| 289 | { |
292 | { |
| 290 | //TODO: nuke ->more's |
293 | unlink (); |
| 291 | } |
294 | } |
| 292 | |
295 | |
| 293 | static void |
|
|
| 294 | unlink (archetype *at) |
|
|
| 295 | { |
|
|
| 296 | if (at->head) |
|
|
| 297 | at = at->head; |
|
|
| 298 | |
|
|
| 299 | // destroy this archetype's link, making singletons out of its parts |
|
|
| 300 | while (at) |
|
|
| 301 | { |
|
|
| 302 | archetype *more = at->more; |
|
|
| 303 | at->clone.destroy_inv (); |
|
|
| 304 | at->head = at->more = 0; |
|
|
| 305 | at = more; |
|
|
| 306 | } |
|
|
| 307 | } |
|
|
| 308 | |
|
|
| 309 | // dire hack, need to rationalise |
|
|
| 310 | void |
296 | void |
| 311 | overwrite (archetype *at, object *op) |
297 | archetype::link () |
| 312 | { |
298 | { |
| 313 | at->clone = *op; |
299 | if (!archetypes.contains (this)) |
| 314 | at->clone.arch = at; |
300 | { |
|
|
301 | archetypes.insert (this); |
|
|
302 | ht.insert (std::make_pair (archname, this)); |
|
|
303 | } |
|
|
304 | } |
| 315 | |
305 | |
| 316 | at->clone.inv = op->inv; op->inv = 0; |
306 | void |
|
|
307 | archetype::unlink () |
|
|
308 | { |
|
|
309 | if (archetypes.contains (this)) |
|
|
310 | { |
|
|
311 | archetypes.erase (this); |
|
|
312 | ht.erase (archname); |
|
|
313 | } |
|
|
314 | } |
| 317 | |
315 | |
| 318 | op->destroy (); |
316 | /* |
|
|
317 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
318 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
319 | */ |
|
|
320 | archetype * |
|
|
321 | archetype::find (const char *name) |
|
|
322 | { |
|
|
323 | if (!name) |
|
|
324 | return 0; |
|
|
325 | |
|
|
326 | auto (i, ht.find (name)); |
|
|
327 | |
|
|
328 | if (i == ht.end ()) |
|
|
329 | return 0; |
|
|
330 | else |
|
|
331 | return i->second; |
| 319 | } |
332 | } |
| 320 | |
333 | |
| 321 | archetype * |
334 | archetype * |
| 322 | archetype::read (object_thawer &f) |
335 | archetype::read (object_thawer &f) |
| 323 | { |
336 | { |
| 324 | assert (f.kw == KW_object); |
337 | assert (f.kw == KW_object); |
| 325 | |
338 | |
| 326 | loading_arch = true; // hack to tell parse_kv et al. to behave |
|
|
| 327 | |
|
|
| 328 | typedef std::pair<archetype *, object *> part; |
|
|
| 329 | std::vector<part> parts; |
339 | std::vector<archetype *> parts; |
| 330 | |
340 | |
| 331 | coroapi::cede_to_tick_every (100); |
341 | coroapi::cede_to_tick (); |
| 332 | |
342 | |
| 333 | for (;;) |
343 | for (;;) |
| 334 | { |
344 | { |
| 335 | object *op = object::create (); |
|
|
| 336 | archetype *at = get (f.get_str ()); |
345 | archetype *at = new archetype (f.get_str ()); |
| 337 | f.get (op->name); |
346 | |
| 338 | f.next (); |
347 | f.next (); |
| 339 | |
348 | |
| 340 | #if 0 |
349 | #if 0 |
|
|
350 | // implementing it here in the server does neither allow multiple inheritence |
|
|
351 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
352 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
|
|
353 | // not that any of this is relevant as of yet... |
| 341 | if (f.kw == KW_inherit) |
354 | if (f.kw == KW_inherit) |
| 342 | { |
355 | { |
| 343 | if (archetype *at = find (f.get_str ())) |
356 | if (archetype *at = find (f.get_str ())) |
| 344 | *op = at->clone; |
357 | *op = at->clone; |
| 345 | else |
358 | else |
| 346 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
359 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
| 347 | &at->name, f.get_str ()); |
360 | &at->archname, f.get_str ()); |
| 348 | |
361 | |
| 349 | f.next (); |
362 | f.next (); |
| 350 | } |
363 | } |
| 351 | #endif |
364 | #endif |
| 352 | |
365 | |
|
|
366 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
367 | bool parse_ok = at->parse_kv (f); |
|
|
368 | loading_arch = 0; |
|
|
369 | |
| 353 | if (!op->parse_kv (f)) |
370 | if (!parse_ok) |
| 354 | goto fail; |
371 | goto fail; |
| 355 | |
372 | |
|
|
373 | loading_arch = at; // hack to tell parse_kv et al. to behave |
| 356 | op->post_load_check (); |
374 | at->post_load_check (); |
|
|
375 | loading_arch = 0; |
| 357 | |
376 | |
| 358 | parts.push_back (std::make_pair (at, op)); |
377 | parts.push_back (at); |
| 359 | |
378 | |
| 360 | if (f.kw != KW_more) |
379 | if (f.kw != KW_more) |
| 361 | break; |
380 | break; |
| 362 | |
381 | |
| 363 | f.next (); |
382 | f.next (); |
| … | |
… | |
| 368 | goto fail; |
387 | goto fail; |
| 369 | } |
388 | } |
| 370 | } |
389 | } |
| 371 | |
390 | |
| 372 | { |
391 | { |
|
|
392 | auto (at, parts.begin ()); |
|
|
393 | |
| 373 | archetype *head = parts.front ().first; |
394 | archetype *new_head = parts.front (); |
|
|
395 | archetype *old_head = find (new_head->archname); |
| 374 | |
396 | |
| 375 | // check that all archetypes belong to the same object or are heads |
397 | if (old_head && !old_head->is_head ()) |
| 376 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
| 377 | { |
398 | { |
| 378 | archetype *at = p->first; |
399 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
400 | &new_head->archname, &old_head->archname); |
|
|
401 | goto fail; |
|
|
402 | } |
| 379 | |
403 | |
| 380 | if (at->head != head && at->head) |
404 | // check that all archetypes belong to the same old object or are new |
|
|
405 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
406 | { |
|
|
407 | archetype *new_part = *at; |
|
|
408 | archetype *old_part = find (new_part->archname); |
|
|
409 | |
|
|
410 | if (old_part && old_part->head_ () != old_head) |
| 381 | { |
411 | { |
| 382 | LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->archname); |
412 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
| 383 | goto fail; |
413 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
| 384 | } |
|
|
| 385 | |
|
|
| 386 | if (at->next && at != head) |
|
|
| 387 | { |
|
|
| 388 | LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->archname); |
|
|
| 389 | goto fail; |
414 | goto fail; |
| 390 | } |
415 | } |
| 391 | } |
416 | } |
| 392 | |
417 | |
| 393 | // sever chain of existing head object |
|
|
| 394 | for (archetype *more, *at = head; at; at = more) |
|
|
| 395 | { |
|
|
| 396 | more = at->more; |
|
|
| 397 | |
|
|
| 398 | at->head = 0; |
|
|
| 399 | at->more = 0; |
|
|
| 400 | } |
|
|
| 401 | |
|
|
| 402 | // replace/update head |
|
|
| 403 | overwrite (head, parts.front ().second); |
|
|
| 404 | head->tail_x = 0; |
|
|
| 405 | head->tail_y = 0; |
|
|
| 406 | |
|
|
| 407 | // link into list of heads, if not already there |
|
|
| 408 | if (!head->linked) |
|
|
| 409 | { |
|
|
| 410 | head->linked = true; |
|
|
| 411 | head->next = first_archetype; |
|
|
| 412 | first_archetype = head; |
|
|
| 413 | } |
|
|
| 414 | |
|
|
| 415 | // reassemble new chain |
418 | // assemble new chain |
|
|
419 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
420 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
421 | |
| 416 | archetype *prev = head; |
422 | archetype *less = new_head; |
| 417 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
423 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
| 418 | { |
424 | { |
| 419 | archetype *at = p->first; |
425 | archetype *at = *p; |
| 420 | overwrite (at, p->second); |
|
|
| 421 | |
426 | |
| 422 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
427 | // some flags get inherited from the head (probably a lot more) |
| 423 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
428 | // doing it here doesn't feel too cozy, but it allows code |
|
|
429 | // to ignore head checks for these flags, which saves time |
|
|
430 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
431 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
432 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
433 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
| 424 | |
434 | |
|
|
435 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
436 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
437 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
438 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
439 | |
| 425 | at->head = head; |
440 | at->head = new_head; |
| 426 | at->clone.head = &head->clone; |
|
|
| 427 | prev->more = at; |
441 | less->more = at; |
| 428 | prev->clone.more = &at->clone; |
|
|
| 429 | |
|
|
| 430 | prev = at; |
442 | less = at; |
| 431 | } |
443 | } |
| 432 | |
444 | |
| 433 | loading_arch = false; |
445 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
446 | |
| 434 | return head; |
447 | return new_head; |
| 435 | } |
448 | } |
| 436 | |
449 | |
| 437 | fail: |
450 | fail: |
| 438 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
451 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
| 439 | p->second->destroy (true); |
452 | (*p)->destroy (); |
| 440 | |
453 | |
| 441 | loading_arch = false; |
|
|
| 442 | return 0; |
454 | return 0; |
| 443 | } |
455 | } |
| 444 | |
456 | |
| 445 | /* |
|
|
| 446 | * Initialize global archtype pointers: |
|
|
| 447 | */ |
|
|
| 448 | void |
457 | void |
| 449 | init_archetype_pointers () |
458 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
| 450 | { |
459 | { |
| 451 | ring_arch = archetype::find ("ring"); |
460 | ref = 0; |
| 452 | amulet_arch = archetype::find ("amulet"); |
461 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
| 453 | staff_arch = archetype::find ("staff"); |
|
|
| 454 | crown_arch = archetype::find ("crown"); |
|
|
| 455 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
| 456 | } |
462 | } |
| 457 | |
463 | |
| 458 | /* |
464 | void |
| 459 | * Creates and returns a new object which is a copy of the given archetype. |
465 | archetype::commit_load () |
| 460 | * This function returns NULL on failure. |
|
|
| 461 | */ |
|
|
| 462 | object * |
|
|
| 463 | arch_to_object (archetype *at) |
|
|
| 464 | { |
466 | { |
|
|
467 | // unlink old archetypes and link in new ones */ |
|
|
468 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
|
|
469 | { |
|
|
470 | archetype *at = *p; |
|
|
471 | |
|
|
472 | if (archetype *old = find (at->archname)) |
|
|
473 | old->unlink (); |
|
|
474 | |
|
|
475 | allarch.push_back (at); |
|
|
476 | |
|
|
477 | at->link (); |
|
|
478 | ++dirtycnt; |
|
|
479 | } |
|
|
480 | |
|
|
481 | postponed_arch.clear (); |
|
|
482 | |
|
|
483 | // now resolve arch references |
|
|
484 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
485 | { |
|
|
486 | arch_ptr *ap = p->first; |
|
|
487 | archetype *at = find (p->second); |
|
|
488 | |
| 465 | if (!at) |
489 | if (!at) |
|
|
490 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
491 | |
|
|
492 | *ap = at; |
| 466 | { |
493 | } |
| 467 | LOG (llevError, "Couldn't find archetype.\n"); |
494 | |
|
|
495 | postponed_arch_ref.clear (); |
|
|
496 | |
|
|
497 | empty = find (shstr_empty_archetype); |
|
|
498 | } |
|
|
499 | |
|
|
500 | void |
|
|
501 | archetype::gc () |
|
|
502 | { |
|
|
503 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
|
|
504 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
505 | |
|
|
506 | do |
|
|
507 | { |
|
|
508 | static int idx; |
|
|
509 | |
|
|
510 | if (idx >= allarch.size ()) |
|
|
511 | if (idx) |
|
|
512 | idx = 0; |
|
|
513 | else |
| 468 | return 0; |
514 | return; |
| 469 | } |
|
|
| 470 | |
515 | |
|
|
516 | archetype *at = allarch [idx]; |
|
|
517 | |
|
|
518 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
519 | ++idx; |
|
|
520 | else |
|
|
521 | { |
|
|
522 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
|
|
523 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
|
|
524 | allarch.erase (idx); |
|
|
525 | |
|
|
526 | // break chain |
|
|
527 | for (object *op = at->head_ (); op; ) |
|
|
528 | { |
|
|
529 | object *next = op->more; |
|
|
530 | op->head = 0; |
|
|
531 | op->more = 0; |
|
|
532 | op = next; |
|
|
533 | } |
|
|
534 | |
|
|
535 | at->destroy (); |
|
|
536 | at->arch = 0; |
|
|
537 | } |
|
|
538 | } |
|
|
539 | while (--cnt); |
|
|
540 | } |
|
|
541 | |
|
|
542 | object * |
|
|
543 | archetype::instance () |
|
|
544 | { |
| 471 | object *op = at->clone.clone (); |
545 | object *op = clone (); |
| 472 | op->arch = at; |
|
|
| 473 | op->instantiate (); |
546 | op->instantiate (); |
| 474 | |
|
|
| 475 | return op; |
547 | return op; |
| 476 | } |
548 | } |
|
|
549 | |
|
|
550 | //+GPL |
| 477 | |
551 | |
| 478 | /* |
552 | /* |
| 479 | * Creates an object. This function is called by get_archetype() |
553 | * Creates an object. This function is called by get_archetype() |
| 480 | * if it fails to find the appropriate archetype. |
554 | * if it fails to find the appropriate archetype. |
| 481 | * Thus get_archetype() will be guaranteed to always return |
555 | * Thus get_archetype() will be guaranteed to always return |
| 482 | * an object, and never NULL. |
556 | * an object, and never NULL. |
| 483 | */ |
557 | */ |
| 484 | object * |
558 | object * |
| 485 | create_singularity (const char *name) |
559 | create_singularity (const char *name) |
| 486 | { |
560 | { |
| 487 | object *op; |
561 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
| 488 | char buf[MAX_BUF]; |
|
|
| 489 | |
562 | |
| 490 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
563 | if (!strcmp (name, "bug")) |
| 491 | op = object::create (); |
564 | abort (); |
| 492 | op->name = op->name_pl = buf; |
565 | |
| 493 | SET_FLAG (op, FLAG_NO_PICK); |
566 | object *op = archetype::get (shstr_bug); |
|
|
567 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
568 | |
| 494 | return op; |
569 | return op; |
| 495 | } |
570 | } |
| 496 | |
571 | |
| 497 | /* |
572 | /* |
| 498 | * Finds which archetype matches the given name, and returns a new |
573 | * Finds which archetype matches the given name, and returns a new |
| 499 | * object containing a copy of the archetype. |
574 | * object containing a copy of the archetype. |
| 500 | */ |
575 | */ |
| 501 | object * |
576 | object * |
| 502 | get_archetype (const char *name) |
577 | get_archetype (const char *name) |
| 503 | { |
578 | { |
|
|
579 | return archetype::get (name); |
|
|
580 | } |
|
|
581 | |
|
|
582 | object * |
|
|
583 | archetype::get (const char *name) |
|
|
584 | { |
| 504 | archetype *at = archetype::find (name); |
585 | archetype *at = find (name); |
| 505 | |
586 | |
| 506 | if (!at) |
587 | if (!at) |
| 507 | return create_singularity (name); |
588 | return create_singularity (name); |
| 508 | |
589 | |
| 509 | return arch_to_object (at); |
590 | return at->instance (); |
| 510 | } |
|
|
| 511 | |
|
|
| 512 | /* |
|
|
| 513 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
| 514 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
| 515 | */ |
|
|
| 516 | archetype * |
|
|
| 517 | archetype::find (const char *name) |
|
|
| 518 | { |
|
|
| 519 | if (!name) |
|
|
| 520 | return 0; |
|
|
| 521 | |
|
|
| 522 | auto (i, ht.find (name)); |
|
|
| 523 | |
|
|
| 524 | if (i == ht.end ()) |
|
|
| 525 | return 0; |
|
|
| 526 | else |
|
|
| 527 | return i->second; |
|
|
| 528 | } |
|
|
| 529 | |
|
|
| 530 | archetype * |
|
|
| 531 | archetype::get (const char *name) |
|
|
| 532 | { |
|
|
| 533 | if (!name) |
|
|
| 534 | { |
|
|
| 535 | LOG (llevError, "null archetype requested\n"); |
|
|
| 536 | name = "(null)"; |
|
|
| 537 | } |
|
|
| 538 | |
|
|
| 539 | archetype *at = find (name); |
|
|
| 540 | |
|
|
| 541 | if (!at) |
|
|
| 542 | { |
|
|
| 543 | archetypes.insert (at = new archetype); |
|
|
| 544 | at->archname = at->clone.name = at->clone.name_pl = name; |
|
|
| 545 | at->hash_add (); |
|
|
| 546 | } |
|
|
| 547 | |
|
|
| 548 | return at; |
|
|
| 549 | } |
|
|
| 550 | |
|
|
| 551 | /* |
|
|
| 552 | * Adds an archetype to the hashtable. |
|
|
| 553 | */ |
|
|
| 554 | void |
|
|
| 555 | archetype::hash_add () |
|
|
| 556 | { |
|
|
| 557 | ht.insert (std::make_pair (archname, this)); |
|
|
| 558 | } |
|
|
| 559 | |
|
|
| 560 | void |
|
|
| 561 | archetype::hash_del () |
|
|
| 562 | { |
|
|
| 563 | ht.erase (archname); |
|
|
| 564 | } |
591 | } |
| 565 | |
592 | |
| 566 | /* |
593 | /* |
| 567 | * Returns the first archetype using the given type. |
594 | * Returns the first archetype using the given type. |
| 568 | * Used in treasure-generation. |
595 | * Used in treasure-generation. |
| 569 | */ |
596 | */ |
| 570 | archetype * |
597 | archetype * |
| 571 | type_to_archetype (int type) |
598 | type_to_archetype (int type) |
| 572 | { |
599 | { |
| 573 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
600 | for_all_archetypes (at) |
| 574 | if (at->clone.type == type) |
601 | if (at->type == type && at->head_ () != at) |
| 575 | return at; |
602 | return at; |
| 576 | |
603 | |
| 577 | return 0; |
604 | return 0; |
| 578 | } |
605 | } |
| 579 | |
606 | |
| … | |
… | |
| 583 | * Used in treasure-generation. |
610 | * Used in treasure-generation. |
| 584 | */ |
611 | */ |
| 585 | object * |
612 | object * |
| 586 | clone_arch (int type) |
613 | clone_arch (int type) |
| 587 | { |
614 | { |
| 588 | archetype *at; |
615 | archetype *at = type_to_archetype (type); |
| 589 | |
616 | |
| 590 | if ((at = type_to_archetype (type)) == NULL) |
617 | if (!at) |
| 591 | { |
618 | { |
| 592 | LOG (llevError, "Can't clone archetype %d\n", type); |
619 | LOG (llevError, "Can't clone archetype %d\n", type); |
| 593 | return 0; |
620 | return 0; |
| 594 | } |
621 | } |
| 595 | |
622 | |
| 596 | object *op = at->clone.clone (); |
623 | return at->instance (); |
| 597 | op->instantiate (); |
|
|
| 598 | return op; |
|
|
| 599 | } |
624 | } |
| 600 | |
625 | |
| 601 | /* |
626 | /* |
| 602 | * member: make instance from class |
627 | * member: make instance from class |
| 603 | */ |
628 | */ |
| 604 | |
|
|
| 605 | object * |
629 | object * |
| 606 | object_create_arch (archetype *at) |
630 | object_create_arch (archetype *at) |
| 607 | { |
631 | { |
| 608 | object *op, *prev = 0, *head = 0; |
632 | object *op, *prev = 0, *head = 0; |
| 609 | |
633 | |
| 610 | while (at) |
634 | while (at) |
| 611 | { |
635 | { |
| 612 | op = arch_to_object (at); |
636 | op = at->instance (); |
|
|
637 | |
| 613 | op->x = at->clone.x; |
638 | op->x = at->x; |
| 614 | op->y = at->clone.y; |
639 | op->y = at->y; |
| 615 | |
640 | |
| 616 | if (head) |
641 | if (head) |
| 617 | op->head = head, prev->more = op; |
642 | op->head = head, prev->more = op; |
| 618 | |
643 | |
| 619 | if (!head) |
644 | if (!head) |
| 620 | head = op; |
645 | head = op; |
| 621 | |
646 | |
| 622 | prev = op; |
647 | prev = op; |
| 623 | at = at->more; |
648 | at = (archetype *)at->more; |
| 624 | } |
649 | } |
| 625 | |
650 | |
| 626 | return (head); |
651 | return head; |
| 627 | } |
652 | } |
| 628 | |
653 | |
|
|
654 | //-GPL |
|
|
655 | |
