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