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