1 | /* |
1 | /* |
2 | * static char *rcsid_arch_c = |
|
|
3 | * "$Id: arch.C,v 1.14 2006/09/08 17:14:07 root Exp $"; |
|
|
4 | */ |
|
|
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
8 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
10 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
11 | |
7 | * |
12 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
13 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
14 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
15 | (at your option) any later version. |
11 | * (at your option) any later version. |
16 | |
12 | * |
17 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
20 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
21 | |
17 | * |
22 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
23 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
25 | |
21 | * |
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
27 | */ |
23 | */ |
28 | |
24 | |
29 | #include <cassert> |
25 | #include <cassert> |
30 | |
26 | |
31 | #include <tr1/unordered_map> |
|
|
32 | |
|
|
33 | #include <global.h> |
27 | #include <global.h> |
34 | #include <arch.h> |
|
|
35 | #include <funcpoint.h> |
28 | #include <funcpoint.h> |
36 | #include <loader.h> |
29 | #include <loader.h> |
37 | |
30 | |
38 | /* IF set, does a little timing on the archetype load. */ |
31 | #include <tr1/functional> |
39 | #define TIME_ARCH_LOAD 0 |
32 | #include <tr1/unordered_map> |
40 | |
33 | |
41 | static void add_arch (archetype * at); |
|
|
42 | |
|
|
43 | static archetype *arch_table[ARCHTABLE]; |
|
|
44 | int arch_cmp = 0; /* How many strcmp's */ |
|
|
45 | int arch_search = 0; /* How many searches */ |
|
|
46 | int arch_init; /* True if doing arch initialization */ |
34 | int arch_init; /* True if doing arch initialization */ |
47 | |
35 | |
48 | /* The naming of these functions is really poor - they are all |
36 | /* The naming of these functions is really poor - they are all |
49 | * pretty much named '.._arch_...', but they may more may not |
37 | * pretty much named '.._arch_...', but they may more may not |
50 | * return archetypes. Some make the arch_to_object call, and thus |
38 | * return archetypes. Some make the arch_to_object call, and thus |
51 | * return an object. Perhaps those should be called 'archob' functions |
39 | * return an object. Perhaps those should be called 'archob' functions |
52 | * to denote they return an object derived from the archetype. |
40 | * to denote they return an object derived from the archetype. |
53 | * MSW 2003-04-29 |
41 | * MSW 2003-04-29 |
54 | */ |
42 | */ |
55 | |
43 | |
56 | #if USE_UNORDERED_MAP |
|
|
57 | // the hashtable |
44 | // the hashtable |
58 | typedef std::tr1::unordered_map<size_t, archetype *> HT; |
45 | typedef std::tr1::unordered_map |
|
|
46 | < |
|
|
47 | const char *, |
|
|
48 | arch_ptr, |
|
|
49 | str_hash, |
|
|
50 | str_equal, |
|
|
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
|
|
52 | > HT; |
59 | |
53 | |
60 | static HT ht; |
54 | static HT ht (5000); |
61 | #endif |
|
|
62 | |
55 | |
63 | /** |
56 | /** |
64 | * GROS - This function retrieves an archetype given the name that appears |
57 | * GROS - This function retrieves an archetype given the name that appears |
65 | * during the game (for example, "writing pen" instead of "stylus"). |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
66 | * It does not use the hashtable system, but browse the whole archlist each time. |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
72 | * - the archetype found or null if nothing was found. |
65 | * - the archetype found or null if nothing was found. |
73 | */ |
66 | */ |
74 | archetype * |
67 | archetype * |
75 | find_archetype_by_object_name (const char *name) |
68 | find_archetype_by_object_name (const char *name) |
76 | { |
69 | { |
77 | archetype *at; |
70 | shstr_cmp name_cmp (name); |
78 | |
71 | |
79 | if (name == NULL) |
|
|
80 | return (archetype *) NULL; |
|
|
81 | |
|
|
82 | for (at = first_archetype; at != NULL; at = at->next) |
72 | for (archetype *at = first_archetype; at; at = at->next) |
83 | { |
73 | if (at->clone.name == name_cmp) |
84 | if (!strcmp (at->clone.name, name)) |
|
|
85 | return at; |
74 | return at; |
86 | } |
75 | |
87 | return NULL; |
76 | return 0; |
88 | } |
77 | } |
89 | |
78 | |
90 | /** |
79 | /** |
91 | * This function retrieves an archetype by type and name that appears during |
80 | * This function retrieves an archetype by type and name that appears during |
92 | * the game. It is basically the same as find_archetype_by_object_name() |
81 | * the game. It is basically the same as find_archetype_by_object_name() |
93 | * except that it considers only items of the given type. |
82 | * except that it considers only items of the given type. |
94 | */ |
83 | */ |
95 | archetype * |
84 | archetype * |
96 | find_archetype_by_object_type_name (int type, const char *name) |
85 | find_archetype_by_object_type_name (int type, const char *name) |
97 | { |
86 | { |
98 | archetype *at; |
87 | shstr_cmp name_cmp (name); |
99 | |
88 | |
100 | if (name == NULL) |
|
|
101 | return NULL; |
|
|
102 | |
|
|
103 | for (at = first_archetype; at != NULL; at = at->next) |
89 | for (archetype *at = first_archetype; at; at = at->next) |
104 | { |
90 | if (at->clone.name == name_cmp && at->clone.type == type) |
105 | if (at->clone.type == type && strcmp (at->clone.name, name) == 0) |
|
|
106 | return at; |
91 | return at; |
107 | } |
|
|
108 | |
92 | |
109 | return NULL; |
93 | return 0; |
110 | } |
94 | } |
111 | |
95 | |
112 | /* This is a lot like the above function. Instead, we are trying to match |
96 | /* This is a lot like the above function. Instead, we are trying to match |
113 | * the arch->skill values. type is the type of object to match |
97 | * the arch->skill values. type is the type of object to match |
114 | * against (eg, to only match against skills or only skill objects for example). |
98 | * against (eg, to only match against skills or only skill objects for example). |
115 | * If type is -1, ew don't match on type. |
99 | * If type is -1, ew don't match on type. |
116 | */ |
100 | */ |
117 | object * |
101 | object * |
118 | get_archetype_by_skill_name (const char *skill, int type) |
102 | get_archetype_by_skill_name (const char *skill, int type) |
119 | { |
103 | { |
120 | archetype * |
104 | shstr_cmp skill_cmp (skill); |
121 | at; |
|
|
122 | |
105 | |
123 | if (skill == NULL) |
|
|
124 | return NULL; |
|
|
125 | |
|
|
126 | for (at = first_archetype; at != NULL; at = at->next) |
106 | for (archetype *at = first_archetype; at; at = at->next) |
127 | { |
107 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
128 | if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) |
|
|
129 | return arch_to_object (at); |
108 | return arch_to_object (at); |
130 | } |
109 | |
131 | return NULL; |
110 | return 0; |
132 | } |
111 | } |
133 | |
112 | |
134 | /* similiar to above - this returns the first archetype |
113 | /* similiar to above - this returns the first archetype |
135 | * that matches both the type and subtype. type and subtype |
114 | * that matches both the type and subtype. type and subtype |
136 | * can be -1 to say ignore, but in this case, the match it does |
115 | * can be -1 to say ignore, but in this case, the match it does |
… | |
… | |
139 | * (eg, skills) |
118 | * (eg, skills) |
140 | */ |
119 | */ |
141 | archetype * |
120 | archetype * |
142 | get_archetype_by_type_subtype (int type, int subtype) |
121 | get_archetype_by_type_subtype (int type, int subtype) |
143 | { |
122 | { |
144 | archetype * |
|
|
145 | at; |
|
|
146 | |
|
|
147 | for (at = first_archetype; at != NULL; at = at->next) |
123 | for (archetype *at = first_archetype; at; at = at->next) |
148 | { |
|
|
149 | if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) |
124 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
150 | return at; |
125 | return at; |
151 | } |
126 | |
152 | return NULL; |
127 | return 0; |
153 | } |
128 | } |
154 | |
129 | |
155 | /** |
130 | /** |
156 | * GROS - this returns a new object given the name that appears during the game |
131 | * GROS - this returns a new object given the name that appears during the game |
157 | * (for example, "writing pen" instead of "stylus"). |
132 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
165 | * but it otherwise had a big memory leak. |
140 | * but it otherwise had a big memory leak. |
166 | */ |
141 | */ |
167 | object * |
142 | object * |
168 | get_archetype_by_object_name (const char *name) |
143 | get_archetype_by_object_name (const char *name) |
169 | { |
144 | { |
170 | archetype * |
|
|
171 | at; |
|
|
172 | char |
|
|
173 | tmpname[MAX_BUF]; |
145 | char tmpname[MAX_BUF]; |
174 | int |
146 | int i; |
175 | i; |
|
|
176 | |
147 | |
177 | strncpy (tmpname, name, MAX_BUF - 1); |
148 | assign (tmpname, name); |
178 | tmpname[MAX_BUF - 1] = 0; |
149 | |
179 | for (i = strlen (tmpname); i > 0; i--) |
150 | for (i = strlen (tmpname); i > 0; i--) |
180 | { |
151 | { |
181 | tmpname[i] = 0; |
152 | tmpname[i] = 0; |
|
|
153 | |
182 | at = find_archetype_by_object_name (tmpname); |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
183 | if (at != NULL) |
|
|
184 | { |
|
|
185 | return arch_to_object (at); |
155 | return arch_to_object (at); |
186 | } |
|
|
187 | } |
156 | } |
|
|
157 | |
188 | return create_singularity (name); |
158 | return create_singularity (name); |
189 | } |
159 | } |
190 | |
160 | |
191 | /* This is a subset of the parse_id command. Basically, name can be |
161 | /* This is a subset of the parse_id command. Basically, name can be |
192 | * a string seperated lists of things to match, with certain keywords. |
162 | * a string seperated lists of things to match, with certain keywords. |
… | |
… | |
204 | * If count is 1, make a quick check on the name. |
174 | * If count is 1, make a quick check on the name. |
205 | * IF count is >1, we need to make plural name. Return if match. |
175 | * IF count is >1, we need to make plural name. Return if match. |
206 | * Last, make a check on the full name. |
176 | * Last, make a check on the full name. |
207 | */ |
177 | */ |
208 | int |
178 | int |
209 | item_matched_string (object * pl, object * op, const char *name) |
179 | item_matched_string (object *pl, object *op, const char *name) |
210 | { |
180 | { |
211 | char * |
|
|
212 | cp, |
|
|
213 | local_name[MAX_BUF]; |
181 | char *cp, local_name[MAX_BUF]; |
214 | int |
182 | int count, retval = 0; |
215 | count, |
183 | |
216 | retval = 0; |
|
|
217 | strcpy (local_name, name); /* strtok is destructive to name */ |
184 | assign (local_name, name); /* strtok is destructive to name */ |
218 | |
185 | |
219 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
186 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
220 | { |
187 | { |
221 | while (cp[0] == ' ') |
188 | while (cp[0] == ' ') |
222 | ++cp; /* get rid of spaces */ |
189 | ++cp; /* get rid of spaces */ |
… | |
… | |
272 | retval = 15; |
239 | retval = 15; |
273 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
240 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
274 | retval = 14; |
241 | retval = 14; |
275 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
242 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
276 | retval = 14; |
243 | retval = 14; |
277 | |
|
|
278 | /* Do substring checks, so things like 'Str+1' will match. |
244 | /* Do substring checks, so things like 'Str+1' will match. |
279 | * retval of these should perhaps be lower - they are lower |
245 | * retval of these should perhaps be lower - they are lower |
280 | * then the specific strcasecmp aboves, but still higher than |
246 | * then the specific strcasecmp aboves, but still higher than |
281 | * some other match criteria. |
247 | * some other match criteria. |
282 | */ |
248 | */ |
… | |
… | |
284 | retval = 12; |
250 | retval = 12; |
285 | else if (strstr (query_base_name (op, 0), cp)) |
251 | else if (strstr (query_base_name (op, 0), cp)) |
286 | retval = 12; |
252 | retval = 12; |
287 | else if (strstr (query_short_name (op), cp)) |
253 | else if (strstr (query_short_name (op), cp)) |
288 | retval = 12; |
254 | retval = 12; |
289 | |
|
|
290 | /* Check against plural/non plural based on count. */ |
255 | /* Check against plural/non plural based on count. */ |
291 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
256 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
292 | { |
|
|
293 | retval = 6; |
257 | retval = 6; |
294 | } |
|
|
295 | else if (count == 1 && !strcasecmp (op->name, cp)) |
258 | else if (count == 1 && !strcasecmp (op->name, cp)) |
296 | { |
|
|
297 | retval = 6; |
259 | retval = 6; |
298 | } |
|
|
299 | /* base name matched - not bad */ |
260 | /* base name matched - not bad */ |
300 | else if (strcasecmp (cp, op->name) == 0 && !count) |
261 | else if (strcasecmp (cp, op->name) == 0 && !count) |
301 | retval = 4; |
262 | retval = 4; |
302 | /* Check for partial custom name, but give a real low priority */ |
263 | /* Check for partial custom name, but give a real low priority */ |
303 | else if (op->custom_name && strstr (op->custom_name, cp)) |
264 | else if (op->custom_name && strstr (op->custom_name, cp)) |
… | |
… | |
305 | |
266 | |
306 | if (retval) |
267 | if (retval) |
307 | { |
268 | { |
308 | if (pl->type == PLAYER) |
269 | if (pl->type == PLAYER) |
309 | pl->contr->count = count; |
270 | pl->contr->count = count; |
|
|
271 | |
310 | return retval; |
272 | return retval; |
311 | } |
273 | } |
312 | } |
274 | } |
|
|
275 | |
313 | return 0; |
276 | return 0; |
314 | } |
277 | } |
315 | |
278 | |
316 | /* |
279 | /* |
317 | * Initialises the internal linked list of archetypes (read from file). |
280 | * Initialises the internal linked list of archetypes (read from file). |
… | |
… | |
322 | void |
285 | void |
323 | init_archetypes (void) |
286 | init_archetypes (void) |
324 | { /* called from add_player() and edit() */ |
287 | { /* called from add_player() and edit() */ |
325 | if (first_archetype != NULL) /* Only do this once */ |
288 | if (first_archetype != NULL) /* Only do this once */ |
326 | return; |
289 | return; |
|
|
290 | |
327 | arch_init = 1; |
291 | arch_init = 1; |
328 | load_archetypes (); |
292 | load_archetypes (); |
329 | arch_init = 0; |
293 | arch_init = 0; |
330 | empty_archetype = find_archetype ("empty_archetype"); |
294 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
295 | |
331 | /* init_blocksview();*/ |
296 | /* init_blocksview();*/ |
332 | } |
297 | } |
333 | |
298 | |
334 | /* |
299 | /* |
335 | * Stores debug-information about how efficient the hashtable |
|
|
336 | * used for archetypes has been in the static errmsg array. |
|
|
337 | */ |
|
|
338 | |
|
|
339 | void |
|
|
340 | arch_info (object * op) |
|
|
341 | { |
|
|
342 | sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); |
|
|
343 | new_draw_info (NDI_BLACK, 0, op, errmsg); |
|
|
344 | } |
|
|
345 | |
|
|
346 | /* |
|
|
347 | * Initialise the hashtable used by the archetypes. |
|
|
348 | */ |
|
|
349 | |
|
|
350 | void |
|
|
351 | clear_archetable (void) |
|
|
352 | { |
|
|
353 | memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); |
|
|
354 | } |
|
|
355 | |
|
|
356 | /* |
|
|
357 | * An alternative way to init the hashtable which is slower, but _works_... |
300 | * An alternative way to init the hashtable which is slower, but _works_... |
358 | */ |
301 | */ |
359 | |
|
|
360 | void |
302 | void |
361 | init_archetable (void) |
303 | init_archetable (void) |
362 | { |
304 | { |
363 | archetype *at; |
305 | archetype *at; |
364 | |
306 | |
365 | LOG (llevDebug, " Setting up archetable...\n"); |
307 | LOG (llevDebug, " Setting up archetable...\n"); |
366 | |
308 | |
367 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
309 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
368 | add_arch (at); |
310 | at->hash_add (); |
369 | |
311 | |
370 | LOG (llevDebug, "done\n"); |
312 | LOG (llevDebug, "done\n"); |
371 | } |
313 | } |
372 | |
314 | |
373 | /* |
|
|
374 | * Dumps an archetype to debug-level output. |
|
|
375 | */ |
|
|
376 | |
|
|
377 | void |
|
|
378 | dump_arch (archetype * at) |
|
|
379 | { |
|
|
380 | dump_object (&at->clone); |
|
|
381 | } |
|
|
382 | |
|
|
383 | /* |
|
|
384 | * Dumps _all_ archetypes to debug-level output. |
|
|
385 | * If you run crossfire with debug, and enter DM-mode, you can trigger |
|
|
386 | * this with the O key. |
|
|
387 | */ |
|
|
388 | |
|
|
389 | void |
|
|
390 | dump_all_archetypes (void) |
|
|
391 | { |
|
|
392 | archetype * |
|
|
393 | at; |
|
|
394 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
|
|
395 | { |
|
|
396 | dump_arch (at); |
|
|
397 | fprintf (logfile, "%s\n", errmsg); |
|
|
398 | } |
|
|
399 | } |
|
|
400 | |
|
|
401 | void |
315 | void |
402 | free_all_archs (void) |
316 | free_all_archs (void) |
403 | { |
317 | { |
404 | archetype * |
318 | archetype *at, *next; |
405 | at, * |
|
|
406 | next; |
|
|
407 | int |
|
|
408 | i = 0, f = 0; |
319 | int i = 0, f = 0; |
409 | |
320 | |
410 | for (at = first_archetype; at != NULL; at = next) |
321 | for (at = first_archetype; at; at = next) |
411 | { |
322 | { |
412 | if (at->more) |
323 | if (at->more) |
413 | next = at->more; |
324 | next = at->more; |
414 | else |
325 | else |
415 | next = at->next; |
326 | next = at->next; |
416 | |
327 | |
417 | delete |
328 | delete |
418 | at; |
329 | at; |
|
|
330 | |
419 | i++; |
331 | i++; |
420 | } |
332 | } |
|
|
333 | |
421 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
334 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
422 | } |
335 | } |
423 | |
336 | |
424 | archetype::archetype () |
337 | archetype::archetype () |
425 | { |
338 | { |
426 | clear_object (&clone); /* to initial state other also */ |
|
|
427 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ |
339 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
428 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
340 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
429 | } |
341 | } |
430 | |
342 | |
431 | archetype::~archetype () |
343 | archetype::~archetype () |
432 | { |
344 | { |
433 | } |
345 | } |
… | |
… | |
437 | * of archetype-structures. |
349 | * of archetype-structures. |
438 | */ |
350 | */ |
439 | void |
351 | void |
440 | first_arch_pass (object_thawer & fp) |
352 | first_arch_pass (object_thawer & fp) |
441 | { |
353 | { |
442 | archetype *at, *head = NULL, *last_more = NULL; |
354 | archetype *head = 0, *last_more = 0; |
443 | |
355 | |
|
|
356 | archetype *at = new archetype; |
444 | at->clone.arch = first_archetype = at = new archetype; |
357 | at->clone.arch = first_archetype = at; |
445 | |
358 | |
446 | while (int i = load_object (fp, &at->clone, 0)) |
359 | while (int i = load_object (fp, &at->clone, 0)) |
447 | { |
360 | { |
448 | at->clone.speed_left = (float) (-0.1); |
361 | at->clone.speed_left = (float) (-0.1); |
449 | /* copy the body_info to the body_used - this is only really |
362 | /* copy the body_info to the body_used - this is only really |
… | |
… | |
454 | */ |
367 | */ |
455 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
368 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
456 | |
369 | |
457 | switch (i) |
370 | switch (i) |
458 | { |
371 | { |
459 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
372 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
460 | if (last_more != NULL) |
373 | if (last_more != NULL) |
461 | last_more->next = at; |
374 | last_more->next = at; |
462 | if (head != NULL) |
375 | if (head != NULL) |
463 | head->next = at; |
376 | head->next = at; |
464 | head = last_more = at; |
377 | head = last_more = at; |
465 | #if 0 |
378 | #if 0 |
466 | if (!op->type) |
379 | if (!op->type) |
467 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
380 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
468 | #endif |
381 | #endif |
469 | at->tail_x = 0; |
382 | at->tail_x = 0; |
470 | at->tail_y = 0; |
383 | at->tail_y = 0; |
471 | break; |
384 | break; |
472 | |
385 | |
473 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
386 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
474 | |
387 | |
475 | at->head = head; |
388 | at->head = head; |
476 | at->clone.head = &head->clone; |
389 | at->clone.head = &head->clone; |
477 | if (last_more != NULL) |
390 | if (last_more != NULL) |
478 | { |
391 | { |
479 | last_more->more = at; |
392 | last_more->more = at; |
480 | last_more->clone.more = &at->clone; |
393 | last_more->clone.more = &at->clone; |
481 | } |
394 | } |
482 | last_more = at; |
395 | last_more = at; |
483 | |
396 | |
484 | /* If this multipart image is still composed of individual small |
397 | /* If this multipart image is still composed of individual small |
485 | * images, don't set the tail_.. values. We can't use them anyways, |
398 | * images, don't set the tail_.. values. We can't use them anyways, |
486 | * and setting these to zero makes the map sending to the client much |
399 | * and setting these to zero makes the map sending to the client much |
487 | * easier as just looking at the head, we know what to do. |
400 | * easier as just looking at the head, we know what to do. |
488 | */ |
401 | */ |
489 | if (at->clone.face != head->clone.face) |
402 | if (at->clone.face != head->clone.face) |
490 | { |
403 | { |
491 | head->tail_x = 0; |
404 | head->tail_x = 0; |
492 | head->tail_y = 0; |
405 | head->tail_y = 0; |
493 | } |
406 | } |
494 | else |
407 | else |
495 | { |
408 | { |
496 | if (at->clone.x > head->tail_x) |
409 | if (at->clone.x > head->tail_x) |
497 | head->tail_x = at->clone.x; |
410 | head->tail_x = at->clone.x; |
498 | if (at->clone.y > head->tail_y) |
411 | if (at->clone.y > head->tail_y) |
499 | head->tail_y = at->clone.y; |
412 | head->tail_y = at->clone.y; |
500 | } |
413 | } |
501 | break; |
414 | break; |
502 | |
415 | |
503 | } |
416 | } |
504 | |
417 | |
505 | at = new archetype; |
418 | at = new archetype; |
|
|
419 | |
506 | at->clone.arch = at; |
420 | at->clone.arch = at; |
507 | } |
421 | } |
508 | |
422 | |
509 | delete at; |
423 | delete at; |
510 | } |
424 | } |
… | |
… | |
522 | |
436 | |
523 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
437 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
524 | { |
438 | { |
525 | if (*buf == '#') |
439 | if (*buf == '#') |
526 | continue; |
440 | continue; |
|
|
441 | |
527 | if ((argument = strchr (buf, ' ')) != NULL) |
442 | if ((argument = strchr (buf, ' ')) != NULL) |
528 | { |
443 | { |
529 | *argument = '\0', argument++; |
444 | *argument = '\0', argument++; |
530 | cp = argument + strlen (argument) - 1; |
445 | cp = argument + strlen (argument) - 1; |
531 | while (isspace (*cp)) |
446 | while (isspace (*cp)) |
532 | { |
447 | { |
533 | *cp = '\0'; |
448 | *cp = '\0'; |
534 | cp--; |
449 | cp--; |
535 | } |
450 | } |
536 | } |
451 | } |
|
|
452 | |
537 | if (!strcmp ("Object", variable)) |
453 | if (!strcmp ("object", variable)) |
538 | { |
454 | { |
539 | if ((at = find_archetype (argument)) == NULL) |
455 | if ((at = archetype::find (argument)) == NULL) |
540 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
456 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
541 | } |
457 | } |
542 | else if (!strcmp ("other_arch", variable)) |
458 | else if (!strcmp ("other_arch", variable)) |
543 | { |
459 | { |
544 | if (at != NULL && at->clone.other_arch == NULL) |
460 | if (at != NULL && at->clone.other_arch == NULL) |
545 | { |
461 | { |
546 | if ((other = find_archetype (argument)) == NULL) |
462 | if ((other = archetype::find (argument)) == NULL) |
547 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
463 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
548 | else if (at != NULL) |
464 | else if (at != NULL) |
549 | at->clone.other_arch = other; |
465 | at->clone.other_arch = other; |
550 | } |
466 | } |
551 | } |
467 | } |
552 | else if (!strcmp ("randomitems", variable)) |
468 | else if (!strcmp ("randomitems", variable)) |
553 | { |
469 | { |
554 | if (at != NULL) |
470 | if (at) |
555 | { |
471 | { |
556 | treasurelist * |
|
|
557 | tl = find_treasurelist (argument); |
472 | treasurelist *tl = find_treasurelist (argument); |
|
|
473 | |
558 | if (tl == NULL) |
474 | if (tl == NULL) |
559 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
475 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
560 | else |
476 | else |
561 | at->clone.randomitems = tl; |
477 | at->clone.randomitems = tl; |
562 | } |
478 | } |
… | |
… | |
566 | |
482 | |
567 | #ifdef DEBUG |
483 | #ifdef DEBUG |
568 | void |
484 | void |
569 | check_generators (void) |
485 | check_generators (void) |
570 | { |
486 | { |
571 | archetype * |
487 | archetype *at; |
572 | at; |
488 | |
573 | for (at = first_archetype; at != NULL; at = at->next) |
489 | for (at = first_archetype; at != NULL; at = at->next) |
574 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
490 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
575 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
491 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
576 | } |
492 | } |
577 | #endif |
493 | #endif |
… | |
… | |
584 | */ |
500 | */ |
585 | |
501 | |
586 | void |
502 | void |
587 | load_archetypes (void) |
503 | load_archetypes (void) |
588 | { |
504 | { |
589 | char |
|
|
590 | filename[MAX_BUF]; |
505 | char filename[MAX_BUF]; |
591 | #if TIME_ARCH_LOAD |
|
|
592 | struct timeval |
|
|
593 | tv1, |
|
|
594 | tv2; |
|
|
595 | #endif |
|
|
596 | |
506 | |
597 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
507 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
598 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
508 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
599 | |
509 | |
600 | { |
510 | { |
601 | object_thawer |
511 | object_thawer |
602 | thawer (filename); |
512 | thawer (filename); |
603 | |
513 | |
604 | clear_archetable (); |
|
|
605 | LOG (llevDebug, " arch-pass 1...\n"); |
514 | LOG (llevDebug, " arch-pass 1...\n"); |
606 | first_arch_pass (thawer); |
515 | first_arch_pass (thawer); |
607 | LOG (llevDebug, " done\n"); |
516 | LOG (llevDebug, " done\n"); |
608 | } |
517 | } |
609 | |
518 | |
… | |
… | |
614 | object_thawer |
523 | object_thawer |
615 | thawer (filename); |
524 | thawer (filename); |
616 | |
525 | |
617 | LOG (llevDebug, " loading treasure...\n"); |
526 | LOG (llevDebug, " loading treasure...\n"); |
618 | load_treasures (); |
527 | load_treasures (); |
|
|
528 | LOG (llevDebug, " done\n"); |
619 | LOG (llevDebug, " done\n arch-pass 2...\n"); |
529 | LOG (llevDebug, " arch-pass 2...\n"); |
620 | second_arch_pass (thawer); |
530 | second_arch_pass (thawer); |
621 | LOG (llevDebug, " done\n"); |
531 | LOG (llevDebug, " done\n"); |
622 | #ifdef DEBUG |
532 | #ifdef DEBUG |
623 | check_generators (); |
533 | check_generators (); |
624 | #endif |
534 | #endif |
… | |
… | |
628 | |
538 | |
629 | /* |
539 | /* |
630 | * Creates and returns a new object which is a copy of the given archetype. |
540 | * Creates and returns a new object which is a copy of the given archetype. |
631 | * This function returns NULL on failure. |
541 | * This function returns NULL on failure. |
632 | */ |
542 | */ |
633 | |
|
|
634 | object * |
543 | object * |
635 | arch_to_object (archetype * at) |
544 | arch_to_object (archetype *at) |
636 | { |
545 | { |
637 | object * |
546 | object *op; |
638 | op; |
547 | |
639 | if (at == NULL) |
548 | if (at == NULL) |
640 | { |
549 | { |
641 | if (warn_archetypes) |
550 | if (warn_archetypes) |
642 | LOG (llevError, "Couldn't find archetype.\n"); |
551 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
552 | |
643 | return NULL; |
553 | return NULL; |
644 | } |
554 | } |
645 | op = get_object (); |
555 | |
646 | copy_object (&at->clone, op); |
556 | op = at->clone.clone (); |
|
|
557 | op->arch = at; |
647 | op->instantiate (); |
558 | op->instantiate (); |
648 | op->arch = at; |
|
|
649 | return op; |
559 | return op; |
650 | } |
560 | } |
651 | |
561 | |
652 | /* |
562 | /* |
653 | * Creates an object. This function is called by get_archetype() |
563 | * Creates an object. This function is called by get_archetype() |
654 | * if it fails to find the appropriate archetype. |
564 | * if it fails to find the appropriate archetype. |
655 | * Thus get_archetype() will be guaranteed to always return |
565 | * Thus get_archetype() will be guaranteed to always return |
656 | * an object, and never NULL. |
566 | * an object, and never NULL. |
657 | */ |
567 | */ |
658 | |
|
|
659 | object * |
568 | object * |
660 | create_singularity (const char *name) |
569 | create_singularity (const char *name) |
661 | { |
570 | { |
662 | object *op; |
571 | object *op; |
663 | char buf[MAX_BUF]; |
572 | char buf[MAX_BUF]; |
|
|
573 | |
664 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
574 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
665 | op = get_object (); |
575 | op = object::create (); |
666 | op->name = op->name_pl = buf; |
576 | op->name = op->name_pl = buf; |
667 | SET_FLAG (op, FLAG_NO_PICK); |
577 | SET_FLAG (op, FLAG_NO_PICK); |
668 | return op; |
578 | return op; |
669 | } |
579 | } |
670 | |
580 | |
671 | /* |
581 | /* |
672 | * Finds which archetype matches the given name, and returns a new |
582 | * Finds which archetype matches the given name, and returns a new |
673 | * object containing a copy of the archetype. |
583 | * object containing a copy of the archetype. |
674 | */ |
584 | */ |
675 | |
|
|
676 | object * |
585 | object * |
677 | get_archetype (const char *name) |
586 | get_archetype (const char *name) |
678 | { |
587 | { |
679 | archetype *at; |
588 | archetype *at = archetype::find (name); |
680 | at = find_archetype (name); |
589 | |
681 | if (at == NULL) |
590 | if (!at) |
682 | return create_singularity (name); |
591 | return create_singularity (name); |
|
|
592 | |
683 | return arch_to_object (at); |
593 | return arch_to_object (at); |
684 | } |
594 | } |
685 | |
595 | |
686 | /* |
596 | /* |
687 | * Hash-function used by the arch-hashtable. |
597 | * Hash-function used by the arch-hashtable. |
… | |
… | |
715 | |
625 | |
716 | /* |
626 | /* |
717 | * Finds, using the hashtable, which archetype matches the given name. |
627 | * Finds, using the hashtable, which archetype matches the given name. |
718 | * returns a pointer to the found archetype, otherwise NULL. |
628 | * returns a pointer to the found archetype, otherwise NULL. |
719 | */ |
629 | */ |
720 | |
|
|
721 | archetype * |
630 | archetype * |
722 | find_archetype (const char *name) |
631 | archetype::find (const char *name) |
723 | { |
632 | { |
724 | #if USE_UNORDERED_MAP |
|
|
725 | name = shstr::find (name); |
|
|
726 | |
|
|
727 | if (!name) |
633 | if (!name) |
728 | return 0; |
634 | return 0; |
729 | |
635 | |
730 | HT::const_iterator i = ht.find ((size_t)name); |
636 | AUTODECL (i, ht.find (name)); |
731 | |
637 | |
732 | if (i == ht.end ()) |
638 | if (i == ht.end ()) |
733 | return 0; |
639 | return 0; |
734 | else |
640 | else |
735 | return i->second; |
641 | return i->second; |
736 | #endif |
|
|
737 | |
|
|
738 | archetype *at; |
|
|
739 | unsigned long index; |
|
|
740 | |
|
|
741 | if (name == NULL) |
|
|
742 | return (archetype *) NULL; |
|
|
743 | |
|
|
744 | index = hasharch (name, ARCHTABLE); |
|
|
745 | arch_search++; |
|
|
746 | for (;;) |
|
|
747 | { |
|
|
748 | at = arch_table[index]; |
|
|
749 | if (at == NULL) |
|
|
750 | { |
|
|
751 | if (warn_archetypes) |
|
|
752 | LOG (llevError, "Couldn't find archetype %s\n", name); |
|
|
753 | return NULL; |
|
|
754 | } |
|
|
755 | arch_cmp++; |
|
|
756 | if (!strcmp ((const char *) at->name, name)) |
|
|
757 | return at; |
|
|
758 | if (++index >= ARCHTABLE) |
|
|
759 | index = 0; |
|
|
760 | } |
|
|
761 | } |
642 | } |
762 | |
643 | |
763 | /* |
644 | /* |
764 | * Adds an archetype to the hashtable. |
645 | * Adds an archetype to the hashtable. |
765 | */ |
646 | */ |
766 | |
647 | void |
767 | static void |
648 | archetype::hash_add () |
768 | add_arch (archetype *at) |
|
|
769 | { |
649 | { |
770 | #if USE_UNORDERED_MAP |
650 | ht.insert (std::make_pair (name, this)); |
771 | ht.insert (std::make_pair ((size_t)(const char *)at->name, at)); |
651 | } |
772 | #endif |
|
|
773 | |
652 | |
774 | int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; |
653 | void |
775 | |
654 | archetype::hash_del () |
776 | for (;;) |
655 | { |
777 | { |
656 | ht.erase (name); |
778 | if (arch_table[index] == NULL) |
|
|
779 | { |
|
|
780 | arch_table[index] = at; |
|
|
781 | return; |
|
|
782 | } |
|
|
783 | |
|
|
784 | if (++index == ARCHTABLE) |
|
|
785 | index = 0; |
|
|
786 | |
|
|
787 | if (index == org_index) |
|
|
788 | fatal (ARCHTABLE_TOO_SMALL); |
|
|
789 | } |
|
|
790 | } |
657 | } |
791 | |
658 | |
792 | /* |
659 | /* |
793 | * Returns the first archetype using the given type. |
660 | * Returns the first archetype using the given type. |
794 | * Used in treasure-generation. |
661 | * Used in treasure-generation. |
795 | */ |
662 | */ |
796 | |
|
|
797 | archetype * |
663 | archetype * |
798 | type_to_archetype (int type) |
664 | type_to_archetype (int type) |
799 | { |
665 | { |
800 | archetype * |
666 | archetype *at; |
801 | at; |
|
|
802 | |
667 | |
803 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
668 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
804 | if (at->clone.type == type) |
669 | if (at->clone.type == type) |
805 | return at; |
670 | return at; |
|
|
671 | |
806 | return NULL; |
672 | return 0; |
807 | } |
673 | } |
808 | |
674 | |
809 | /* |
675 | /* |
810 | * Returns a new object copied from the first archetype matching |
676 | * Returns a new object copied from the first archetype matching |
811 | * the given type. |
677 | * the given type. |
… | |
… | |
813 | */ |
679 | */ |
814 | |
680 | |
815 | object * |
681 | object * |
816 | clone_arch (int type) |
682 | clone_arch (int type) |
817 | { |
683 | { |
818 | archetype * |
684 | archetype *at; |
819 | at; |
|
|
820 | object * |
|
|
821 | op = get_object (); |
|
|
822 | |
685 | |
823 | if ((at = type_to_archetype (type)) == NULL) |
686 | if ((at = type_to_archetype (type)) == NULL) |
824 | { |
687 | { |
825 | LOG (llevError, "Can't clone archetype %d\n", type); |
688 | LOG (llevError, "Can't clone archetype %d\n", type); |
826 | free_object (op); |
|
|
827 | return NULL; |
689 | return 0; |
828 | } |
690 | } |
829 | copy_object (&at->clone, op); |
691 | |
|
|
692 | object *op = at->clone.clone (); |
830 | op->instantiate (); |
693 | op->instantiate (); |
831 | return op; |
694 | return op; |
832 | } |
695 | } |
833 | |
696 | |
834 | /* |
697 | /* |
835 | * member: make instance from class |
698 | * member: make instance from class |
836 | */ |
699 | */ |
837 | |
700 | |
838 | object * |
701 | object * |
839 | object_create_arch (archetype * at) |
702 | object_create_arch (archetype *at) |
840 | { |
703 | { |
841 | object * |
704 | object *op, *prev = 0, *head = 0; |
842 | op, * |
|
|
843 | prev = NULL, *head = NULL; |
|
|
844 | |
705 | |
845 | while (at) |
706 | while (at) |
846 | { |
707 | { |
847 | op = arch_to_object (at); |
708 | op = arch_to_object (at); |
848 | op->x = at->clone.x; |
709 | op->x = at->clone.x; |
849 | op->y = at->clone.y; |
710 | op->y = at->clone.y; |
|
|
711 | |
850 | if (head) |
712 | if (head) |
851 | op->head = head, prev->more = op; |
713 | op->head = head, prev->more = op; |
|
|
714 | |
852 | if (!head) |
715 | if (!head) |
853 | head = op; |
716 | head = op; |
|
|
717 | |
854 | prev = op; |
718 | prev = op; |
855 | at = at->more; |
719 | at = at->more; |
856 | } |
720 | } |
|
|
721 | |
857 | return (head); |
722 | return (head); |
858 | } |
723 | } |
859 | |
724 | |
860 | /*** end of arch.c ***/ |
|
|