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