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 (©) 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 |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * This program is free software; you can redistribute it and/or modify |
9 | * 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 |
10 | * 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 |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * 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 | * |
18 | * |
|
|
19 | * You should have received a copy of the Affero GNU General Public License |
|
|
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
|
|
22 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #include <cassert> |
26 | #include <cassert> |
|
|
27 | #include <functional> |
|
|
28 | |
|
|
29 | #include <flat_hash_map.hpp> |
26 | |
30 | |
27 | #include <global.h> |
31 | #include <global.h> |
28 | #include <funcpoint.h> |
|
|
29 | #include <loader.h> |
|
|
30 | |
32 | |
31 | #include <tr1/functional> |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
32 | #include <tr1/unordered_map> |
34 | arch_ptr archetype::empty; |
33 | |
|
|
34 | int arch_init; /* True if doing arch initialization */ |
|
|
35 | |
|
|
36 | /* The naming of these functions is really poor - they are all |
|
|
37 | * pretty much named '.._arch_...', but they may more may not |
|
|
38 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
39 | * return an object. Perhaps those should be called 'archob' functions |
|
|
40 | * to denote they return an object derived from the archetype. |
|
|
41 | * MSW 2003-04-29 |
|
|
42 | */ |
|
|
43 | |
35 | |
44 | // the hashtable |
36 | // the hashtable |
45 | typedef std::tr1::unordered_map |
37 | typedef ska::flat_hash_map |
46 | < |
38 | < |
47 | const char *, |
39 | const char *, |
48 | arch_ptr, |
40 | arch_ptr, |
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); |
|
|
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 |
|
|
57 | |
|
|
58 | /* |
|
|
59 | * Creates an object. This function is called by archetype::get () |
|
|
60 | * if it fails to find the appropriate archetype. |
|
|
61 | * Thus archetype::get() will be guaranteed to always return |
|
|
62 | * an object, and never NULL. |
|
|
63 | */ |
|
|
64 | static object * |
|
|
65 | create_singularity (const char *name) |
|
|
66 | { |
|
|
67 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
68 | |
|
|
69 | if (!strcmp (name, "bug")) |
|
|
70 | abort (); |
|
|
71 | |
|
|
72 | object *op = archetype::get (shstr_bug); |
|
|
73 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
74 | |
|
|
75 | return op; |
|
|
76 | } |
55 | |
77 | |
56 | /** |
78 | /** |
57 | * GROS - This function retrieves an archetype given the name that appears |
79 | * GROS - This function retrieves an archetype given the name that appears |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
80 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
81 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
67 | archetype * |
89 | archetype * |
68 | find_archetype_by_object_name (const char *name) |
90 | find_archetype_by_object_name (const char *name) |
69 | { |
91 | { |
70 | shstr_cmp name_cmp (name); |
92 | shstr_cmp name_cmp (name); |
71 | |
93 | |
72 | for (archetype *at = first_archetype; at; at = at->next) |
94 | for_all_archetypes (at) |
73 | if (at->clone.name == name_cmp) |
95 | if (at->name == name_cmp) |
74 | return at; |
96 | return at; |
75 | |
97 | |
76 | return 0; |
98 | return 0; |
77 | } |
99 | } |
78 | |
100 | |
… | |
… | |
84 | archetype * |
106 | archetype * |
85 | find_archetype_by_object_type_name (int type, const char *name) |
107 | find_archetype_by_object_type_name (int type, const char *name) |
86 | { |
108 | { |
87 | shstr_cmp name_cmp (name); |
109 | shstr_cmp name_cmp (name); |
88 | |
110 | |
89 | for (archetype *at = first_archetype; at; at = at->next) |
111 | for_all_archetypes (at) |
90 | if (at->clone.name == name_cmp && at->clone.type == type) |
112 | if (at->name == name_cmp && at->type == type) |
91 | return at; |
113 | return at; |
92 | |
114 | |
93 | return 0; |
115 | return 0; |
94 | } |
116 | } |
95 | |
117 | |
… | |
… | |
101 | object * |
123 | object * |
102 | get_archetype_by_skill_name (const char *skill, int type) |
124 | get_archetype_by_skill_name (const char *skill, int type) |
103 | { |
125 | { |
104 | shstr_cmp skill_cmp (skill); |
126 | shstr_cmp skill_cmp (skill); |
105 | |
127 | |
106 | for (archetype *at = first_archetype; at; at = at->next) |
128 | for_all_archetypes (at) |
107 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
129 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
108 | return arch_to_object (at); |
130 | return at->instance (); |
109 | |
131 | |
110 | return 0; |
132 | return 0; |
111 | } |
133 | } |
112 | |
134 | |
113 | /* similiar to above - this returns the first archetype |
135 | /* similiar to above - this returns the first archetype |
… | |
… | |
118 | * (eg, skills) |
140 | * (eg, skills) |
119 | */ |
141 | */ |
120 | archetype * |
142 | archetype * |
121 | get_archetype_by_type_subtype (int type, int subtype) |
143 | get_archetype_by_type_subtype (int type, int subtype) |
122 | { |
144 | { |
123 | for (archetype *at = first_archetype; at; at = at->next) |
145 | for_all_archetypes (at) |
124 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
146 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
125 | return at; |
147 | return at; |
126 | |
148 | |
127 | return 0; |
149 | return 0; |
128 | } |
150 | } |
129 | |
151 | |
… | |
… | |
134 | * - name: The name we're searching for (ex: "writing pen"); |
156 | * - name: The name we're searching for (ex: "writing pen"); |
135 | * Return value: |
157 | * Return value: |
136 | * - a corresponding object if found; a singularity object if not found. |
158 | * - a corresponding object if found; a singularity object if not found. |
137 | * Note by MSW - it appears that it takes the full name and keeps |
159 | * Note by MSW - it appears that it takes the full name and keeps |
138 | * shortening it until it finds a match. I re-wrote this so that it |
160 | * shortening it until it finds a match. I re-wrote this so that it |
139 | * doesn't malloc it each time - not that this function is used much, |
161 | * doesn't allocate it each time - not that this function is used much, |
140 | * but it otherwise had a big memory leak. |
162 | * but it otherwise had a big memory leak. |
141 | */ |
163 | */ |
142 | object * |
164 | object * |
143 | get_archetype_by_object_name (const char *name) |
165 | get_archetype_by_object_name (const char *name) |
144 | { |
166 | { |
145 | char tmpname[MAX_BUF]; |
167 | char tmpname[MAX_BUF]; |
146 | int i; |
|
|
147 | |
168 | |
148 | assign (tmpname, name); |
169 | assign (tmpname, name); |
149 | |
170 | |
150 | for (i = strlen (tmpname); i > 0; i--) |
171 | for (int i = strlen (tmpname); i > 0; i--) |
151 | { |
172 | { |
152 | tmpname[i] = 0; |
173 | tmpname[i] = 0; |
153 | |
174 | |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
175 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
155 | return arch_to_object (at); |
176 | return at->instance (); |
156 | } |
177 | } |
157 | |
178 | |
158 | return create_singularity (name); |
179 | return create_singularity (name); |
159 | } |
180 | } |
160 | |
181 | |
161 | /* This is a subset of the parse_id command. Basically, name can be |
182 | /* This is a subset of the parse_id command. Basically, name can be |
162 | * a string seperated lists of things to match, with certain keywords. |
183 | * a string seperated lists of things to match, with certain keywords. |
163 | * pl is the player (only needed to set count properly) |
184 | * pl is the player (only needed to set count properly) |
164 | * op is the item we are trying to match. Calling function takes care |
185 | * op is the item we are trying to match. Calling function takes care |
165 | * of what action might need to be done and if it is valid |
186 | * of what action might need to be done and if it is valid |
166 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
187 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
167 | * value means a better match. 0 means no match. |
188 | * value means a better match. 0 means no match. |
168 | * |
189 | * |
169 | * Brief outline of the procedure: |
190 | * Brief outline of the procedure: |
170 | * We take apart the name variable into the individual components. |
191 | * We take apart the name variable into the individual components. |
171 | * cases for 'all' and unpaid are pretty obvious. |
192 | * cases for 'all' and unpaid are pretty obvious. |
172 | * Next, we check for a count (either specified in name, or in the |
193 | * Next, we check for a count (either specified in name, or in the |
173 | * player object.) |
194 | * player object.) |
174 | * If count is 1, make a quick check on the name. |
195 | * If count is 1, make a quick check on the name. |
175 | * IF count is >1, we need to make plural name. Return if match. |
196 | * IF count is >1, we need to make plural name. Return if match. |
176 | * Last, make a check on the full name. |
197 | * Last, make a check on the full name. |
177 | */ |
198 | */ |
178 | int |
199 | int |
179 | item_matched_string (object *pl, object *op, const char *name) |
200 | item_matched_string (object *pl, object *op, const char *name) |
180 | { |
201 | { |
181 | char *cp, local_name[MAX_BUF]; |
202 | char *cp, local_name[MAX_BUF]; |
182 | int count, retval = 0; |
203 | int count, retval = 0; |
… | |
… | |
192 | /* All is a very generic match - low match value */ |
213 | /* All is a very generic match - low match value */ |
193 | if (!strcmp (cp, "all")) |
214 | if (!strcmp (cp, "all")) |
194 | return 1; |
215 | return 1; |
195 | |
216 | |
196 | /* unpaid is a little more specific */ |
217 | /* unpaid is a little more specific */ |
197 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
218 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
198 | return 2; |
219 | return 2; |
199 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
220 | |
|
|
221 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
200 | return 2; |
222 | return 2; |
201 | |
223 | |
202 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
224 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
203 | return 2; |
225 | return 2; |
204 | |
226 | |
205 | /* Allow for things like '100 arrows' */ |
227 | /* Allow for things like '100 arrows' */ |
206 | if ((count = atoi (cp)) != 0) |
228 | if ((count = atoi (cp)) != 0) |
207 | { |
229 | { |
… | |
… | |
225 | * is because of the 'else' handling - we don't want to match on |
247 | * is because of the 'else' handling - we don't want to match on |
226 | * something and set a low retval, even though it may match a higher retcal |
248 | * something and set a low retval, even though it may match a higher retcal |
227 | * later. So keep it in descending order here, so we try for the best |
249 | * later. So keep it in descending order here, so we try for the best |
228 | * match first, and work downward. |
250 | * match first, and work downward. |
229 | */ |
251 | */ |
|
|
252 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
253 | |
230 | if (!strcasecmp (cp, query_name (op))) |
254 | if (!strcasecmp (cp, query_name (op))) |
231 | retval = 20; |
255 | retval = 20; |
232 | else if (!strcasecmp (cp, query_short_name (op))) |
256 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
233 | retval = 18; |
257 | retval = 18; |
234 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
258 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
235 | retval = 16; |
259 | retval = 16; |
236 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
260 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
237 | retval = 16; |
261 | retval = 16; |
238 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
262 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
239 | retval = 15; |
263 | retval = 15; |
240 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
264 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
241 | retval = 14; |
265 | retval = 14; |
242 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
266 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
243 | retval = 14; |
267 | retval = 14; |
244 | /* Do substring checks, so things like 'Str+1' will match. |
268 | /* Do substring checks, so things like 'Str+1' will match. |
245 | * retval of these should perhaps be lower - they are lower |
269 | * retval of these should perhaps be lower - they are lower |
246 | * then the specific strcasecmp aboves, but still higher than |
270 | * then the specific strcasecmp aboves, but still higher than |
247 | * some other match criteria. |
271 | * some other match criteria. |
248 | */ |
272 | */ |
249 | else if (strstr (query_base_name (op, 1), cp)) |
273 | else if (strstr (qbn1, cp)) |
250 | retval = 12; |
274 | retval = 12; |
251 | else if (strstr (query_base_name (op, 0), cp)) |
275 | else if (strstr (qbn0, cp)) |
252 | retval = 12; |
276 | retval = 12; |
253 | else if (strstr (query_short_name (op), cp)) |
277 | else if (strstr (qsn, cp)) |
254 | retval = 12; |
278 | retval = 12; |
255 | /* Check against plural/non plural based on count. */ |
279 | /* Check against plural/non plural based on count. */ |
256 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
280 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
257 | retval = 6; |
281 | retval = 6; |
258 | else if (count == 1 && !strcasecmp (op->name, cp)) |
282 | else if (count == 1 && !strcasecmp (op->name, cp)) |
259 | retval = 6; |
283 | retval = 6; |
260 | /* base name matched - not bad */ |
284 | /* base name matched - not bad */ |
261 | else if (strcasecmp (cp, op->name) == 0 && !count) |
285 | else if (strcasecmp (cp, op->name) == 0 && !count) |
262 | retval = 4; |
286 | retval = 4; |
263 | /* Check for partial custom name, but give a real low priority */ |
287 | /* Check for partial custom name, but give a real low priority */ |
264 | else if (op->custom_name && strstr (op->custom_name, cp)) |
288 | else if (op->custom_name.contains (cp)) |
265 | retval = 3; |
289 | retval = 3; |
266 | |
290 | |
267 | if (retval) |
291 | if (retval) |
268 | { |
292 | { |
269 | if (pl->type == PLAYER) |
293 | if (pl->type == PLAYER) |
… | |
… | |
274 | } |
298 | } |
275 | |
299 | |
276 | return 0; |
300 | return 0; |
277 | } |
301 | } |
278 | |
302 | |
279 | /* |
303 | //-GPL |
280 | * Initialises the internal linked list of archetypes (read from file). |
|
|
281 | * Then the global "empty_archetype" pointer is initialised. |
|
|
282 | * Then the blocksview[] array is initialised. |
|
|
283 | */ |
|
|
284 | |
304 | |
285 | void |
305 | void |
286 | init_archetypes (void) |
306 | archetype::do_delete () |
287 | { /* called from add_player() and edit() */ |
307 | { |
288 | if (first_archetype != NULL) /* Only do this once */ |
308 | delete this; |
289 | return; |
|
|
290 | |
|
|
291 | arch_init = 1; |
|
|
292 | load_archetypes (); |
|
|
293 | arch_init = 0; |
|
|
294 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
295 | |
|
|
296 | /* init_blocksview();*/ |
|
|
297 | } |
309 | } |
298 | |
310 | |
299 | /* |
311 | archetype::archetype (const char *name) |
300 | * An alternative way to init the hashtable which is slower, but _works_... |
312 | { |
301 | */ |
313 | arch = this; |
|
|
314 | this->archname = this->name = this->name_pl = name; |
|
|
315 | } |
|
|
316 | |
|
|
317 | archetype::~archetype () |
|
|
318 | { |
|
|
319 | unlink (); |
|
|
320 | } |
|
|
321 | |
302 | void |
322 | void |
303 | init_archetable (void) |
323 | archetype::link () |
304 | { |
324 | { |
305 | archetype *at; |
325 | if (!archetypes.contains (this)) |
306 | |
326 | { |
307 | LOG (llevDebug, " Setting up archetable...\n"); |
327 | archetypes.insert (this); |
308 | |
328 | ht.insert (std::make_pair (archname, this)); |
309 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
329 | } |
310 | at->hash_add (); |
|
|
311 | |
|
|
312 | LOG (llevDebug, "done\n"); |
|
|
313 | } |
330 | } |
314 | |
331 | |
315 | void |
332 | void |
316 | free_all_archs (void) |
333 | archetype::unlink () |
317 | { |
334 | { |
318 | archetype *at, *next; |
335 | if (archetypes.contains (this)) |
319 | int i = 0, f = 0; |
|
|
320 | |
|
|
321 | for (at = first_archetype; at; at = next) |
|
|
322 | { |
|
|
323 | if (at->more) |
|
|
324 | next = at->more; |
|
|
325 | else |
|
|
326 | next = at->next; |
|
|
327 | |
|
|
328 | delete |
|
|
329 | at; |
|
|
330 | |
|
|
331 | i++; |
|
|
332 | } |
336 | { |
333 | |
337 | archetypes.erase (this); |
334 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
338 | ht.erase (archname); |
335 | } |
|
|
336 | |
|
|
337 | archetype::archetype () |
|
|
338 | { |
|
|
339 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
|
|
340 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
341 | } |
|
|
342 | |
|
|
343 | archetype::~archetype () |
|
|
344 | { |
|
|
345 | } |
|
|
346 | |
|
|
347 | /* |
|
|
348 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
349 | * of archetype-structures. |
|
|
350 | */ |
|
|
351 | void |
|
|
352 | first_arch_pass (object_thawer & fp) |
|
|
353 | { |
|
|
354 | archetype *head = 0, *last_more = 0; |
|
|
355 | |
|
|
356 | archetype *at = new archetype; |
|
|
357 | at->clone.arch = first_archetype = at; |
|
|
358 | |
|
|
359 | while (int i = load_object (fp, &at->clone, 0)) |
|
|
360 | { |
339 | } |
361 | at->clone.speed_left = (float) (-0.1); |
|
|
362 | /* copy the body_info to the body_used - this is only really |
|
|
363 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
364 | * by doing so, when a monster is created, it has good starting |
|
|
365 | * values for the body_used info, so when items are created |
|
|
366 | * for it, they can be properly equipped. |
|
|
367 | */ |
|
|
368 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
|
|
369 | |
|
|
370 | switch (i) |
|
|
371 | { |
|
|
372 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
|
|
373 | if (last_more != NULL) |
|
|
374 | last_more->next = at; |
|
|
375 | if (head != NULL) |
|
|
376 | head->next = at; |
|
|
377 | head = last_more = at; |
|
|
378 | #if 0 |
|
|
379 | if (!op->type) |
|
|
380 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
381 | #endif |
|
|
382 | at->tail_x = 0; |
|
|
383 | at->tail_y = 0; |
|
|
384 | break; |
|
|
385 | |
|
|
386 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
|
|
387 | |
|
|
388 | at->head = head; |
|
|
389 | at->clone.head = &head->clone; |
|
|
390 | if (last_more != NULL) |
|
|
391 | { |
|
|
392 | last_more->more = at; |
|
|
393 | last_more->clone.more = &at->clone; |
|
|
394 | } |
|
|
395 | last_more = at; |
|
|
396 | |
|
|
397 | /* If this multipart image is still composed of individual small |
|
|
398 | * images, don't set the tail_.. values. We can't use them anyways, |
|
|
399 | * and setting these to zero makes the map sending to the client much |
|
|
400 | * easier as just looking at the head, we know what to do. |
|
|
401 | */ |
|
|
402 | if (at->clone.face != head->clone.face) |
|
|
403 | { |
|
|
404 | head->tail_x = 0; |
|
|
405 | head->tail_y = 0; |
|
|
406 | } |
|
|
407 | else |
|
|
408 | { |
|
|
409 | if (at->clone.x > head->tail_x) |
|
|
410 | head->tail_x = at->clone.x; |
|
|
411 | if (at->clone.y > head->tail_y) |
|
|
412 | head->tail_y = at->clone.y; |
|
|
413 | } |
|
|
414 | break; |
|
|
415 | |
|
|
416 | } |
|
|
417 | |
|
|
418 | at = new archetype; |
|
|
419 | |
|
|
420 | at->clone.arch = at; |
|
|
421 | } |
|
|
422 | |
|
|
423 | delete at; |
|
|
424 | } |
|
|
425 | |
|
|
426 | /* |
|
|
427 | * Reads the archetype file once more, and links all pointers between |
|
|
428 | * archetypes. |
|
|
429 | */ |
|
|
430 | |
|
|
431 | void |
|
|
432 | second_arch_pass (object_thawer & thawer) |
|
|
433 | { |
|
|
434 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
|
|
435 | archetype *at = NULL, *other; |
|
|
436 | |
|
|
437 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
438 | { |
|
|
439 | if (*buf == '#') |
|
|
440 | continue; |
|
|
441 | |
|
|
442 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
443 | { |
|
|
444 | *argument = '\0', argument++; |
|
|
445 | cp = argument + strlen (argument) - 1; |
|
|
446 | while (isspace (*cp)) |
|
|
447 | { |
|
|
448 | *cp = '\0'; |
|
|
449 | cp--; |
|
|
450 | } |
|
|
451 | } |
|
|
452 | |
|
|
453 | if (!strcmp ("object", variable)) |
|
|
454 | { |
|
|
455 | if ((at = archetype::find (argument)) == NULL) |
|
|
456 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
457 | } |
|
|
458 | else if (!strcmp ("other_arch", variable)) |
|
|
459 | { |
|
|
460 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
461 | { |
|
|
462 | if ((other = archetype::find (argument)) == NULL) |
|
|
463 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
464 | else if (at != NULL) |
|
|
465 | at->clone.other_arch = other; |
|
|
466 | } |
|
|
467 | } |
|
|
468 | else if (!strcmp ("randomitems", variable)) |
|
|
469 | { |
|
|
470 | if (at) |
|
|
471 | { |
|
|
472 | treasurelist *tl = find_treasurelist (argument); |
|
|
473 | |
|
|
474 | if (tl == NULL) |
|
|
475 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
476 | else |
|
|
477 | at->clone.randomitems = tl; |
|
|
478 | } |
|
|
479 | } |
|
|
480 | } |
|
|
481 | } |
|
|
482 | |
|
|
483 | #ifdef DEBUG |
|
|
484 | void |
|
|
485 | check_generators (void) |
|
|
486 | { |
|
|
487 | archetype *at; |
|
|
488 | |
|
|
489 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
490 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
|
|
491 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
|
|
492 | } |
|
|
493 | #endif |
|
|
494 | |
|
|
495 | /* |
|
|
496 | * First initialises the archtype hash-table (init_archetable()). |
|
|
497 | * Reads and parses the archetype file (with the first and second-pass |
|
|
498 | * functions). |
|
|
499 | * Then initialises treasures by calling load_treasures(). |
|
|
500 | */ |
|
|
501 | |
|
|
502 | void |
|
|
503 | load_archetypes (void) |
|
|
504 | { |
|
|
505 | char filename[MAX_BUF]; |
|
|
506 | |
|
|
507 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
508 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
509 | |
|
|
510 | { |
|
|
511 | object_thawer |
|
|
512 | thawer (filename); |
|
|
513 | |
|
|
514 | LOG (llevDebug, " arch-pass 1...\n"); |
|
|
515 | first_arch_pass (thawer); |
|
|
516 | LOG (llevDebug, " done\n"); |
|
|
517 | } |
|
|
518 | |
|
|
519 | init_archetable (); |
|
|
520 | warn_archetypes = 1; |
|
|
521 | |
|
|
522 | { |
|
|
523 | object_thawer |
|
|
524 | thawer (filename); |
|
|
525 | |
|
|
526 | LOG (llevDebug, " loading treasure...\n"); |
|
|
527 | load_treasures (); |
|
|
528 | LOG (llevDebug, " done\n"); |
|
|
529 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
530 | second_arch_pass (thawer); |
|
|
531 | LOG (llevDebug, " done\n"); |
|
|
532 | #ifdef DEBUG |
|
|
533 | check_generators (); |
|
|
534 | #endif |
|
|
535 | } |
|
|
536 | LOG (llevDebug, " done\n"); |
|
|
537 | } |
|
|
538 | |
|
|
539 | /* |
|
|
540 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
541 | * This function returns NULL on failure. |
|
|
542 | */ |
|
|
543 | object * |
|
|
544 | arch_to_object (archetype *at) |
|
|
545 | { |
|
|
546 | object *op; |
|
|
547 | |
|
|
548 | if (at == NULL) |
|
|
549 | { |
|
|
550 | if (warn_archetypes) |
|
|
551 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
552 | |
|
|
553 | return NULL; |
|
|
554 | } |
|
|
555 | |
|
|
556 | op = at->clone.clone (); |
|
|
557 | op->arch = at; |
|
|
558 | op->instantiate (); |
|
|
559 | return op; |
|
|
560 | } |
|
|
561 | |
|
|
562 | /* |
|
|
563 | * Creates an object. This function is called by get_archetype() |
|
|
564 | * if it fails to find the appropriate archetype. |
|
|
565 | * Thus get_archetype() will be guaranteed to always return |
|
|
566 | * an object, and never NULL. |
|
|
567 | */ |
|
|
568 | object * |
|
|
569 | create_singularity (const char *name) |
|
|
570 | { |
|
|
571 | object *op; |
|
|
572 | char buf[MAX_BUF]; |
|
|
573 | |
|
|
574 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
|
|
575 | op = object::create (); |
|
|
576 | op->name = op->name_pl = buf; |
|
|
577 | SET_FLAG (op, FLAG_NO_PICK); |
|
|
578 | return op; |
|
|
579 | } |
|
|
580 | |
|
|
581 | /* |
|
|
582 | * Finds which archetype matches the given name, and returns a new |
|
|
583 | * object containing a copy of the archetype. |
|
|
584 | */ |
|
|
585 | object * |
|
|
586 | get_archetype (const char *name) |
|
|
587 | { |
|
|
588 | archetype *at = archetype::find (name); |
|
|
589 | |
|
|
590 | if (!at) |
|
|
591 | return create_singularity (name); |
|
|
592 | |
|
|
593 | return arch_to_object (at); |
|
|
594 | } |
|
|
595 | |
|
|
596 | /* |
|
|
597 | * Hash-function used by the arch-hashtable. |
|
|
598 | */ |
|
|
599 | |
|
|
600 | unsigned long |
|
|
601 | hasharch (const char *str, int tablesize) |
|
|
602 | { |
|
|
603 | unsigned long hash = 0; |
|
|
604 | unsigned int i = 0; |
|
|
605 | const char *p; |
|
|
606 | |
|
|
607 | /* use the one-at-a-time hash function, which supposedly is |
|
|
608 | * better than the djb2-like one used by perl5.005, but |
|
|
609 | * certainly is better then the bug used here before. |
|
|
610 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
611 | */ |
|
|
612 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
613 | { |
|
|
614 | hash += *p; |
|
|
615 | hash += hash << 10; |
|
|
616 | hash ^= hash >> 6; |
|
|
617 | } |
|
|
618 | |
|
|
619 | hash += hash << 3; |
|
|
620 | hash ^= hash >> 11; |
|
|
621 | hash += hash << 15; |
|
|
622 | |
|
|
623 | return hash % tablesize; |
|
|
624 | } |
340 | } |
625 | |
341 | |
626 | /* |
342 | /* |
627 | * Finds, using the hashtable, which archetype matches the given name. |
343 | * Finds, using the hashtable, which archetype matches the given name. |
628 | * returns a pointer to the found archetype, otherwise NULL. |
344 | * returns a pointer to the found archetype, otherwise NULL. |
… | |
… | |
631 | archetype::find (const char *name) |
347 | archetype::find (const char *name) |
632 | { |
348 | { |
633 | if (!name) |
349 | if (!name) |
634 | return 0; |
350 | return 0; |
635 | |
351 | |
636 | AUTODECL (i, ht.find (name)); |
352 | auto (i, ht.find (name)); |
637 | |
353 | |
638 | if (i == ht.end ()) |
354 | if (i == ht.end ()) |
639 | return 0; |
355 | return 0; |
640 | else |
356 | else |
641 | return i->second; |
357 | return i->second; |
642 | } |
358 | } |
643 | |
359 | |
|
|
360 | void |
|
|
361 | archetype::post_load_check () |
|
|
362 | { |
|
|
363 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
|
|
364 | |
|
|
365 | if (type == SKILL) |
|
|
366 | add_skill_archetype (this); |
|
|
367 | |
|
|
368 | object::post_load_check (); |
|
|
369 | } |
|
|
370 | |
|
|
371 | archetype * |
|
|
372 | archetype::read (object_thawer &f) |
|
|
373 | { |
|
|
374 | assert (f.kw == KW_object); |
|
|
375 | |
|
|
376 | std::vector<archetype *> parts; |
|
|
377 | |
|
|
378 | coroapi::cede_to_tick (); |
|
|
379 | |
|
|
380 | for (;;) |
|
|
381 | { |
|
|
382 | archetype *at = new archetype (f.get_str ()); |
|
|
383 | |
|
|
384 | f.next (); |
|
|
385 | |
|
|
386 | #if 0 |
|
|
387 | // implementing it here in the server does neither allow multiple inheritence |
|
|
388 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
389 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
|
|
390 | // not that any of this is relevant as of yet... |
|
|
391 | if (f.kw == KW_inherit) |
|
|
392 | { |
|
|
393 | if (archetype *at = find (f.get_str ())) |
|
|
394 | *op = at->clone; |
|
|
395 | else |
|
|
396 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
397 | &at->archname, f.get_str ()); |
|
|
398 | |
|
|
399 | f.next (); |
|
|
400 | } |
|
|
401 | #endif |
|
|
402 | |
|
|
403 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
404 | bool parse_ok = at->parse_kv (f); |
|
|
405 | loading_arch = 0; |
|
|
406 | |
|
|
407 | if (!parse_ok) |
|
|
408 | goto fail; |
|
|
409 | |
|
|
410 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
411 | at->post_load_check (); |
|
|
412 | loading_arch = 0; |
|
|
413 | |
|
|
414 | parts.push_back (at); |
|
|
415 | |
|
|
416 | if (f.kw != KW_more) |
|
|
417 | break; |
|
|
418 | |
|
|
419 | f.next (); |
|
|
420 | |
|
|
421 | if (f.kw != KW_object) |
|
|
422 | { |
|
|
423 | f.parse_error ("more object"); |
|
|
424 | goto fail; |
|
|
425 | } |
|
|
426 | } |
|
|
427 | |
|
|
428 | { |
|
|
429 | archetype *new_head = parts.front (); |
|
|
430 | archetype *old_head = find (new_head->archname); |
|
|
431 | |
|
|
432 | if (old_head && !old_head->is_head ()) |
|
|
433 | { |
|
|
434 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
435 | &new_head->archname, &old_head->archname); |
|
|
436 | goto fail; |
|
|
437 | } |
|
|
438 | |
|
|
439 | // check that all archetypes belong to the same old object or are new |
|
|
440 | for (auto &&at : parts) |
|
|
441 | { |
|
|
442 | archetype *new_part = at; |
|
|
443 | archetype *old_part = find (new_part->archname); |
|
|
444 | |
|
|
445 | if (old_part && old_part->head_ () != old_head) |
|
|
446 | { |
|
|
447 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
448 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
449 | goto fail; |
|
|
450 | } |
|
|
451 | } |
|
|
452 | |
|
|
453 | // assemble new chain |
|
|
454 | new_head->max_x = new_head->x; |
|
|
455 | |
|
|
456 | archetype *less = new_head; |
|
|
457 | for (auto &&p = parts.begin () + 1; p != parts.end (); ++p) |
|
|
458 | { |
|
|
459 | archetype *at = *p; |
|
|
460 | |
|
|
461 | // some flags get inherited from the head (probably a lot more) |
|
|
462 | // doing it here doesn't feel too cozy, but it allows code |
|
|
463 | // to ignore head checks for these flags, which saves time |
|
|
464 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
465 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
466 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
467 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
468 | |
|
|
469 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
470 | |
|
|
471 | at->head = new_head; |
|
|
472 | less->more = at; |
|
|
473 | less = at; |
|
|
474 | } |
|
|
475 | |
|
|
476 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
477 | |
|
|
478 | return new_head; |
|
|
479 | } |
|
|
480 | |
|
|
481 | fail: |
|
|
482 | for (auto &&at : parts) |
|
|
483 | at->destroy (); |
|
|
484 | |
|
|
485 | return 0; |
|
|
486 | } |
|
|
487 | |
|
|
488 | void |
|
|
489 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
|
|
490 | { |
|
|
491 | ref = 0; |
|
|
492 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
|
|
493 | } |
|
|
494 | |
|
|
495 | void |
|
|
496 | archetype::commit_load () |
|
|
497 | { |
|
|
498 | // unlink old archetypes and link in new ones */ |
|
|
499 | for (auto &&at : postponed_arch) |
|
|
500 | { |
|
|
501 | if (archetype *old = find (at->archname)) |
|
|
502 | old->unlink (); |
|
|
503 | |
|
|
504 | allarch.push_back (at); |
|
|
505 | |
|
|
506 | at->link (); |
|
|
507 | ++dirtycnt; |
|
|
508 | } |
|
|
509 | |
|
|
510 | postponed_arch.clear (); |
|
|
511 | |
|
|
512 | // now resolve arch references |
|
|
513 | for (auto &&p : postponed_arch_ref) // not yet C++17 |
|
|
514 | { |
|
|
515 | arch_ptr *ap = p.first; |
|
|
516 | archetype *at = find (p.second); |
|
|
517 | |
|
|
518 | if (!at) |
|
|
519 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p.second); |
|
|
520 | |
|
|
521 | *ap = at; |
|
|
522 | } |
|
|
523 | |
|
|
524 | postponed_arch_ref.clear (); |
|
|
525 | |
|
|
526 | empty = find (shstr_empty_archetype); |
|
|
527 | } |
|
|
528 | |
|
|
529 | void |
|
|
530 | archetype::gc () |
|
|
531 | { |
|
|
532 | int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt)); |
|
|
533 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
534 | |
|
|
535 | do |
|
|
536 | { |
|
|
537 | static int idx; |
|
|
538 | |
|
|
539 | if (idx >= allarch.size ()) |
|
|
540 | if (idx) |
|
|
541 | idx = 0; |
|
|
542 | else |
|
|
543 | return; |
|
|
544 | |
|
|
545 | archetype *at = allarch [idx]; |
|
|
546 | |
|
|
547 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
548 | ++idx; |
|
|
549 | else |
|
|
550 | { |
|
|
551 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
|
|
552 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
|
|
553 | allarch.erase (idx); |
|
|
554 | |
|
|
555 | // break chain |
|
|
556 | for (object *op = at->head_ (); op; ) |
|
|
557 | { |
|
|
558 | object *next = op->more; |
|
|
559 | op->head = 0; |
|
|
560 | op->more = 0; |
|
|
561 | op = next; |
|
|
562 | } |
|
|
563 | |
|
|
564 | at->destroy (); |
|
|
565 | at->arch = 0; |
|
|
566 | } |
|
|
567 | } |
|
|
568 | while (--cnt); |
|
|
569 | } |
|
|
570 | |
|
|
571 | object * |
|
|
572 | archetype::instance () |
|
|
573 | { |
|
|
574 | object *op = clone (); |
|
|
575 | op->instantiate (); |
|
|
576 | return op; |
|
|
577 | } |
|
|
578 | |
|
|
579 | //+GPL |
|
|
580 | |
644 | /* |
581 | /* |
645 | * Adds an archetype to the hashtable. |
582 | * Finds which archetype matches the given name, and returns a new |
|
|
583 | * object containing a copy of the archetype. |
646 | */ |
584 | */ |
647 | void |
585 | object * |
648 | archetype::hash_add () |
586 | archetype::get (const char *name) |
649 | { |
587 | { |
650 | ht.insert (std::make_pair (name, this)); |
588 | archetype *at = find (name); |
651 | } |
|
|
652 | |
589 | |
653 | void |
590 | if (!at) |
654 | archetype::hash_del () |
591 | return create_singularity (name); |
655 | { |
592 | |
656 | ht.erase (name); |
593 | return at->instance (); |
657 | } |
594 | } |
658 | |
595 | |
659 | /* |
596 | /* |
660 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
661 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
662 | */ |
599 | */ |
663 | archetype * |
600 | static archetype * |
664 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
665 | { |
602 | { |
666 | archetype *at; |
603 | for_all_archetypes (at) |
667 | |
604 | if (at->type == type && at->head_ () != at) |
668 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
|
|
669 | if (at->clone.type == type) |
|
|
670 | return at; |
605 | return at; |
671 | |
606 | |
672 | return 0; |
607 | return 0; |
673 | } |
608 | } |
674 | |
609 | |
675 | /* |
610 | /* |
676 | * Returns a new object copied from the first archetype matching |
611 | * Returns a new object copied from the first archetype matching |
677 | * the given type. |
612 | * the given type. |
678 | * Used in treasure-generation. |
613 | * Used in treasure-generation. |
679 | */ |
614 | */ |
680 | |
|
|
681 | object * |
615 | object * |
682 | clone_arch (int type) |
616 | clone_arch (int type) |
683 | { |
617 | { |
684 | archetype *at; |
618 | archetype *at = type_to_archetype (type); |
685 | |
619 | |
686 | if ((at = type_to_archetype (type)) == NULL) |
620 | if (!at) |
687 | { |
621 | { |
688 | LOG (llevError, "Can't clone archetype %d\n", type); |
622 | LOG (llevError, "Can't clone archetype %d\n", type); |
689 | return 0; |
623 | return 0; |
690 | } |
624 | } |
691 | |
625 | |
692 | object *op = at->clone.clone (); |
626 | return at->instance (); |
693 | op->instantiate (); |
|
|
694 | return op; |
|
|
695 | } |
627 | } |
696 | |
628 | |
697 | /* |
629 | /* |
698 | * member: make instance from class |
630 | * member: make instance from class |
699 | */ |
631 | */ |
700 | |
|
|
701 | object * |
632 | object * |
702 | object_create_arch (archetype *at) |
633 | object_create_arch (archetype *at) |
703 | { |
634 | { |
704 | object *op, *prev = 0, *head = 0; |
635 | object *op, *prev = 0, *head = 0; |
705 | |
636 | |
706 | while (at) |
637 | while (at) |
707 | { |
638 | { |
708 | op = arch_to_object (at); |
639 | op = at->instance (); |
|
|
640 | |
709 | op->x = at->clone.x; |
641 | op->x = at->x; |
710 | op->y = at->clone.y; |
642 | op->y = at->y; |
711 | |
643 | |
712 | if (head) |
644 | if (head) |
713 | op->head = head, prev->more = op; |
645 | op->head = head, prev->more = op; |
714 | |
646 | |
715 | if (!head) |
647 | if (!head) |
716 | head = op; |
648 | head = op; |
717 | |
649 | |
718 | prev = op; |
650 | prev = op; |
719 | at = at->more; |
651 | at = (archetype *)at->more; |
720 | } |
652 | } |
721 | |
653 | |
722 | return (head); |
654 | return head; |
723 | } |
655 | } |
724 | |
656 | |
|
|
657 | //-GPL |
|
|
658 | |