… | |
… | |
29 | #include <loader.h> |
29 | #include <loader.h> |
30 | |
30 | |
31 | #include <tr1/functional> |
31 | #include <tr1/functional> |
32 | #include <tr1/unordered_map> |
32 | #include <tr1/unordered_map> |
33 | |
33 | |
34 | int arch_init; /* True if doing arch initialization */ |
|
|
35 | |
|
|
36 | /* The naming of these functions is really poor - they are all |
34 | /* The naming of these functions is really poor - they are all |
37 | * pretty much named '.._arch_...', but they may more may not |
35 | * pretty much named '.._arch_...', but they may more may not |
38 | * return archetypes. Some make the arch_to_object call, and thus |
36 | * return archetypes. Some make the arch_to_object call, and thus |
39 | * return an object. Perhaps those should be called 'archob' functions |
37 | * return an object. Perhaps those should be called 'archob' functions |
40 | * to denote they return an object derived from the archetype. |
38 | * to denote they return an object derived from the archetype. |
41 | * MSW 2003-04-29 |
39 | * MSW 2003-04-29 |
42 | */ |
40 | */ |
|
|
41 | |
|
|
42 | bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing |
43 | |
43 | |
44 | // the hashtable |
44 | // the hashtable |
45 | typedef std::tr1::unordered_map |
45 | typedef std::tr1::unordered_map |
46 | < |
46 | < |
47 | const char *, |
47 | const char *, |
… | |
… | |
50 | str_equal, |
50 | str_equal, |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
52 | > HT; |
52 | > HT; |
53 | |
53 | |
54 | static HT ht (5000); |
54 | static HT ht (5000); |
|
|
55 | static std::vector<archetype *> archetypes; |
55 | |
56 | |
56 | /** |
57 | /** |
57 | * GROS - This function retrieves an archetype given the name that appears |
58 | * GROS - This function retrieves an archetype given the name that appears |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
60 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
65 | * - the archetype found or null if nothing was found. |
66 | * - the archetype found or null if nothing was found. |
66 | */ |
67 | */ |
67 | archetype * |
68 | archetype * |
68 | find_archetype_by_object_name (const char *name) |
69 | find_archetype_by_object_name (const char *name) |
69 | { |
70 | { |
70 | archetype *at; |
71 | shstr_cmp name_cmp (name); |
71 | |
72 | |
72 | if (name == NULL) |
|
|
73 | return (archetype *) NULL; |
|
|
74 | |
|
|
75 | for (at = first_archetype; at != NULL; at = at->next) |
73 | for (archetype *at = first_archetype; at; at = at->next) |
76 | { |
74 | if (at->clone.name == name_cmp) |
77 | if (!strcmp (at->clone.name, name)) |
|
|
78 | return at; |
75 | return at; |
79 | } |
76 | |
80 | return NULL; |
77 | return 0; |
81 | } |
78 | } |
82 | |
79 | |
83 | /** |
80 | /** |
84 | * This function retrieves an archetype by type and name that appears during |
81 | * This function retrieves an archetype by type and name that appears during |
85 | * the game. It is basically the same as find_archetype_by_object_name() |
82 | * the game. It is basically the same as find_archetype_by_object_name() |
86 | * except that it considers only items of the given type. |
83 | * except that it considers only items of the given type. |
87 | */ |
84 | */ |
88 | archetype * |
85 | archetype * |
89 | find_archetype_by_object_type_name (int type, const char *name) |
86 | find_archetype_by_object_type_name (int type, const char *name) |
90 | { |
87 | { |
91 | archetype *at; |
88 | shstr_cmp name_cmp (name); |
92 | |
89 | |
93 | if (name == NULL) |
|
|
94 | return NULL; |
|
|
95 | |
|
|
96 | for (at = first_archetype; at != NULL; at = at->next) |
90 | for (archetype *at = first_archetype; at; at = at->next) |
97 | { |
91 | if (at->clone.name == name_cmp && at->clone.type == type) |
98 | if (at->clone.type == type && strcmp (at->clone.name, name) == 0) |
|
|
99 | return at; |
92 | return at; |
100 | } |
|
|
101 | |
93 | |
102 | return NULL; |
94 | return 0; |
103 | } |
95 | } |
104 | |
96 | |
105 | /* This is a lot like the above function. Instead, we are trying to match |
97 | /* This is a lot like the above function. Instead, we are trying to match |
106 | * the arch->skill values. type is the type of object to match |
98 | * the arch->skill values. type is the type of object to match |
107 | * against (eg, to only match against skills or only skill objects for example). |
99 | * against (eg, to only match against skills or only skill objects for example). |
108 | * If type is -1, ew don't match on type. |
100 | * If type is -1, ew don't match on type. |
109 | */ |
101 | */ |
110 | object * |
102 | object * |
111 | get_archetype_by_skill_name (const char *skill, int type) |
103 | get_archetype_by_skill_name (const char *skill, int type) |
112 | { |
104 | { |
113 | archetype *at; |
105 | shstr_cmp skill_cmp (skill); |
114 | |
106 | |
115 | if (skill) |
|
|
116 | for (at = first_archetype; at; at = at->next) |
107 | for (archetype *at = first_archetype; at; at = at->next) |
117 | if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) |
108 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
118 | return arch_to_object (at); |
109 | return arch_to_object (at); |
119 | |
110 | |
120 | return 0; |
111 | return 0; |
121 | } |
112 | } |
122 | |
113 | |
123 | /* similiar to above - this returns the first archetype |
114 | /* similiar to above - this returns the first archetype |
… | |
… | |
128 | * (eg, skills) |
119 | * (eg, skills) |
129 | */ |
120 | */ |
130 | archetype * |
121 | archetype * |
131 | get_archetype_by_type_subtype (int type, int subtype) |
122 | get_archetype_by_type_subtype (int type, int subtype) |
132 | { |
123 | { |
133 | archetype * |
|
|
134 | at; |
|
|
135 | |
|
|
136 | for (at = first_archetype; at != NULL; at = at->next) |
124 | for (archetype *at = first_archetype; at; at = at->next) |
137 | { |
|
|
138 | if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) |
125 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
139 | return at; |
126 | return at; |
140 | } |
127 | |
141 | return NULL; |
128 | return 0; |
142 | } |
129 | } |
143 | |
130 | |
144 | /** |
131 | /** |
145 | * GROS - this returns a new object given the name that appears during the game |
132 | * GROS - this returns a new object given the name that appears during the game |
146 | * (for example, "writing pen" instead of "stylus"). |
133 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
154 | * but it otherwise had a big memory leak. |
141 | * but it otherwise had a big memory leak. |
155 | */ |
142 | */ |
156 | object * |
143 | object * |
157 | get_archetype_by_object_name (const char *name) |
144 | get_archetype_by_object_name (const char *name) |
158 | { |
145 | { |
159 | archetype *at; |
|
|
160 | char tmpname[MAX_BUF]; |
146 | char tmpname[MAX_BUF]; |
161 | int i; |
147 | int i; |
162 | |
148 | |
163 | assign (tmpname, name); |
149 | assign (tmpname, name); |
164 | |
150 | |
165 | for (i = strlen (tmpname); i > 0; i--) |
151 | for (i = strlen (tmpname); i > 0; i--) |
166 | { |
152 | { |
167 | tmpname[i] = 0; |
153 | tmpname[i] = 0; |
|
|
154 | |
168 | at = find_archetype_by_object_name (tmpname); |
155 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
169 | |
|
|
170 | if (at) |
|
|
171 | return arch_to_object (at); |
156 | return arch_to_object (at); |
172 | } |
157 | } |
173 | |
158 | |
174 | return create_singularity (name); |
159 | return create_singularity (name); |
175 | } |
160 | } |
… | |
… | |
195 | item_matched_string (object *pl, object *op, const char *name) |
180 | item_matched_string (object *pl, object *op, const char *name) |
196 | { |
181 | { |
197 | char *cp, local_name[MAX_BUF]; |
182 | char *cp, local_name[MAX_BUF]; |
198 | int count, retval = 0; |
183 | int count, retval = 0; |
199 | |
184 | |
200 | strcpy (local_name, name); /* strtok is destructive to name */ |
185 | assign (local_name, name); /* strtok is destructive to name */ |
201 | |
186 | |
202 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
187 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
203 | { |
188 | { |
204 | while (cp[0] == ' ') |
189 | while (cp[0] == ' ') |
205 | ++cp; /* get rid of spaces */ |
190 | ++cp; /* get rid of spaces */ |
… | |
… | |
290 | } |
275 | } |
291 | |
276 | |
292 | return 0; |
277 | return 0; |
293 | } |
278 | } |
294 | |
279 | |
295 | /* |
|
|
296 | * Initialises the internal linked list of archetypes (read from file). |
|
|
297 | * Then the global "empty_archetype" pointer is initialised. |
|
|
298 | * Then the blocksview[] array is initialised. |
|
|
299 | */ |
|
|
300 | |
|
|
301 | void |
280 | void |
302 | init_archetypes (void) |
281 | init_archetypes (void) |
303 | { /* called from add_player() and edit() */ |
282 | { |
304 | if (first_archetype != NULL) /* Only do this once */ |
|
|
305 | return; |
|
|
306 | |
|
|
307 | arch_init = 1; |
|
|
308 | load_archetypes (); |
283 | load_archetypes (); |
309 | arch_init = 0; |
284 | |
310 | empty_archetype = archetype::find ("empty_archetype"); |
285 | empty_archetype = archetype::find ("empty_archetype"); |
311 | |
|
|
312 | /* init_blocksview();*/ |
|
|
313 | } |
|
|
314 | |
|
|
315 | /* |
|
|
316 | * An alternative way to init the hashtable which is slower, but _works_... |
|
|
317 | */ |
|
|
318 | void |
|
|
319 | init_archetable (void) |
|
|
320 | { |
|
|
321 | archetype *at; |
|
|
322 | |
|
|
323 | LOG (llevDebug, " Setting up archetable...\n"); |
|
|
324 | |
|
|
325 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
|
|
326 | at->hash_add (); |
|
|
327 | |
|
|
328 | LOG (llevDebug, "done\n"); |
|
|
329 | } |
|
|
330 | |
|
|
331 | void |
|
|
332 | free_all_archs (void) |
|
|
333 | { |
|
|
334 | archetype *at, *next; |
|
|
335 | int i = 0, f = 0; |
|
|
336 | |
|
|
337 | for (at = first_archetype; at; at = next) |
|
|
338 | { |
|
|
339 | if (at->more) |
|
|
340 | next = at->more; |
|
|
341 | else |
|
|
342 | next = at->next; |
|
|
343 | |
|
|
344 | delete |
|
|
345 | at; |
|
|
346 | |
|
|
347 | i++; |
|
|
348 | } |
|
|
349 | |
|
|
350 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
|
|
351 | } |
286 | } |
352 | |
287 | |
353 | archetype::archetype () |
288 | archetype::archetype () |
354 | { |
289 | { |
|
|
290 | clone.arch = this; |
|
|
291 | |
355 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
292 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
356 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
293 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
357 | } |
294 | } |
358 | |
295 | |
359 | archetype::~archetype () |
296 | archetype::~archetype () |
360 | { |
297 | { |
|
|
298 | //TODO: nuke ->more's |
|
|
299 | } |
|
|
300 | |
|
|
301 | static void |
|
|
302 | unlink (archetype *at) |
|
|
303 | { |
|
|
304 | if (at->head) |
|
|
305 | at = at->head; |
|
|
306 | |
|
|
307 | // destroy this archetype's link, making singletons out of its parts |
|
|
308 | while (at) |
|
|
309 | { |
|
|
310 | archetype *more = at->more; |
|
|
311 | at->clone.destroy_inv (); |
|
|
312 | at->head = at->more = 0; |
|
|
313 | at = more; |
|
|
314 | } |
|
|
315 | } |
|
|
316 | |
|
|
317 | // dire hack, need to rationalise |
|
|
318 | void |
|
|
319 | overwrite (archetype *at, object *op) |
|
|
320 | { |
|
|
321 | at->clone = *op; |
|
|
322 | |
|
|
323 | at->clone.arch = at; |
|
|
324 | //TODO: inv et al. |
|
|
325 | } |
|
|
326 | |
|
|
327 | archetype * |
|
|
328 | archetype::read (object_thawer &f) |
|
|
329 | { |
|
|
330 | assert (f.kw == KW_object); |
|
|
331 | |
|
|
332 | archetype *head = get (f.get_str ()); |
|
|
333 | unlink (head); |
|
|
334 | object *op = object::create (); |
|
|
335 | |
|
|
336 | if (!op->parse_kv (f)) |
|
|
337 | { |
|
|
338 | op->destroy (true); |
|
|
339 | // leak head |
|
|
340 | return 0; |
|
|
341 | } |
|
|
342 | |
|
|
343 | overwrite (head, op); |
|
|
344 | op->destroy (); |
|
|
345 | |
|
|
346 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
347 | { |
|
|
348 | f.next (); |
|
|
349 | assert (f.kw == KW_object); |
|
|
350 | |
|
|
351 | archetype *more = get (f.get_str ()); |
|
|
352 | unlink (more); |
|
|
353 | object *op = object::create (); |
|
|
354 | |
|
|
355 | if (!op->parse_kv (f)) |
|
|
356 | { |
|
|
357 | op->destroy (true); |
|
|
358 | // leak head more* |
|
|
359 | return 0; |
|
|
360 | } |
|
|
361 | |
|
|
362 | overwrite (more, op); |
|
|
363 | op->destroy (); |
|
|
364 | |
|
|
365 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
|
|
366 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
367 | |
|
|
368 | more->head = head; |
|
|
369 | more->clone.head = &head->clone; |
|
|
370 | prev->more = more; |
|
|
371 | prev->clone.more = &more->clone; |
|
|
372 | |
|
|
373 | prev = more; |
|
|
374 | } |
|
|
375 | |
|
|
376 | if (!head->next) |
|
|
377 | { |
|
|
378 | head->next = first_archetype; |
|
|
379 | first_archetype = head; |
|
|
380 | } |
|
|
381 | |
|
|
382 | return head; |
361 | } |
383 | } |
362 | |
384 | |
363 | /* |
385 | /* |
364 | * Reads/parses the archetype-file, and copies into a linked list |
386 | * Reads/parses the archetype-file, and copies into a linked list |
365 | * of archetype-structures. |
387 | * of archetype-structures. |
366 | */ |
388 | */ |
367 | void |
389 | static bool |
368 | first_arch_pass (object_thawer & fp) |
390 | load_archetypes (object_thawer &f) |
369 | { |
391 | { |
370 | archetype *head = 0, *last_more = 0; |
392 | for (;;) |
371 | |
|
|
372 | archetype *at = new archetype; |
|
|
373 | at->clone.arch = first_archetype = at; |
|
|
374 | |
|
|
375 | while (int i = load_object (fp, &at->clone, 0)) |
|
|
376 | { |
393 | { |
377 | at->clone.speed_left = (float) (-0.1); |
|
|
378 | /* copy the body_info to the body_used - this is only really |
|
|
379 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
380 | * by doing so, when a monster is created, it has good starting |
|
|
381 | * values for the body_used info, so when items are created |
|
|
382 | * for it, they can be properly equipped. |
|
|
383 | */ |
|
|
384 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
|
|
385 | |
|
|
386 | switch (i) |
394 | switch (f.kw) |
387 | { |
395 | { |
388 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
396 | case KW_object: |
389 | if (last_more != NULL) |
397 | loading_arch = true; |
390 | last_more->next = at; |
398 | if (!archetype::read (f)) |
391 | if (head != NULL) |
|
|
392 | head->next = at; |
|
|
393 | head = last_more = at; |
|
|
394 | #if 0 |
|
|
395 | if (!op->type) |
|
|
396 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
397 | #endif |
|
|
398 | at->tail_x = 0; |
|
|
399 | at->tail_y = 0; |
|
|
400 | break; |
|
|
401 | |
|
|
402 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
|
|
403 | |
|
|
404 | at->head = head; |
|
|
405 | at->clone.head = &head->clone; |
|
|
406 | if (last_more != NULL) |
|
|
407 | { |
399 | { |
408 | last_more->more = at; |
400 | loading_arch = false; |
409 | last_more->clone.more = &at->clone; |
401 | return false; |
410 | } |
402 | } |
411 | last_more = at; |
|
|
412 | |
403 | |
413 | /* If this multipart image is still composed of individual small |
404 | loading_arch = false; |
414 | * images, don't set the tail_.. values. We can't use them anyways, |
405 | continue; |
415 | * and setting these to zero makes the map sending to the client much |
406 | |
416 | * easier as just looking at the head, we know what to do. |
407 | case KW_EOF: |
417 | */ |
408 | return true; |
418 | if (at->clone.face != head->clone.face) |
409 | |
419 | { |
410 | default: |
420 | head->tail_x = 0; |
411 | if (!f.parse_error ("archetypes file")) |
421 | head->tail_y = 0; |
|
|
422 | } |
|
|
423 | else |
412 | return false; |
424 | { |
|
|
425 | if (at->clone.x > head->tail_x) |
|
|
426 | head->tail_x = at->clone.x; |
|
|
427 | if (at->clone.y > head->tail_y) |
|
|
428 | head->tail_y = at->clone.y; |
|
|
429 | } |
|
|
430 | break; |
|
|
431 | |
|
|
432 | } |
413 | } |
433 | |
414 | |
434 | at = new archetype; |
415 | f.next (); |
435 | |
|
|
436 | at->clone.arch = at; |
|
|
437 | } |
|
|
438 | |
|
|
439 | delete at; |
|
|
440 | } |
|
|
441 | |
|
|
442 | /* |
|
|
443 | * Reads the archetype file once more, and links all pointers between |
|
|
444 | * archetypes. |
|
|
445 | */ |
|
|
446 | |
|
|
447 | void |
|
|
448 | second_arch_pass (object_thawer & thawer) |
|
|
449 | { |
|
|
450 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
|
|
451 | archetype *at = NULL, *other; |
|
|
452 | |
|
|
453 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
454 | { |
416 | } |
455 | if (*buf == '#') |
|
|
456 | continue; |
|
|
457 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
458 | { |
|
|
459 | *argument = '\0', argument++; |
|
|
460 | cp = argument + strlen (argument) - 1; |
|
|
461 | while (isspace (*cp)) |
|
|
462 | { |
|
|
463 | *cp = '\0'; |
|
|
464 | cp--; |
|
|
465 | } |
|
|
466 | } |
|
|
467 | if (!strcmp ("Object", variable)) |
|
|
468 | { |
|
|
469 | if ((at = archetype::find (argument)) == NULL) |
|
|
470 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
471 | } |
|
|
472 | else if (!strcmp ("other_arch", variable)) |
|
|
473 | { |
|
|
474 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
475 | { |
|
|
476 | if ((other = archetype::find (argument)) == NULL) |
|
|
477 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
478 | else if (at != NULL) |
|
|
479 | at->clone.other_arch = other; |
|
|
480 | } |
|
|
481 | } |
|
|
482 | else if (!strcmp ("randomitems", variable)) |
|
|
483 | { |
|
|
484 | if (at != NULL) |
|
|
485 | { |
|
|
486 | treasurelist *tl = find_treasurelist (argument); |
|
|
487 | |
|
|
488 | if (tl == NULL) |
|
|
489 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
490 | else |
|
|
491 | at->clone.randomitems = tl; |
|
|
492 | } |
|
|
493 | } |
|
|
494 | } |
|
|
495 | } |
417 | } |
496 | |
|
|
497 | #ifdef DEBUG |
|
|
498 | void |
|
|
499 | check_generators (void) |
|
|
500 | { |
|
|
501 | archetype *at; |
|
|
502 | |
|
|
503 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
504 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
|
|
505 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
|
|
506 | } |
|
|
507 | #endif |
|
|
508 | |
418 | |
509 | /* |
419 | /* |
510 | * First initialises the archtype hash-table (init_archetable()). |
420 | * First initialises the archtype hash-table (init_archetable()). |
511 | * Reads and parses the archetype file (with the first and second-pass |
421 | * Reads and parses the archetype file (with the first and second-pass |
512 | * functions). |
422 | * functions). |
513 | * Then initialises treasures by calling load_treasures(). |
|
|
514 | */ |
423 | */ |
515 | |
|
|
516 | void |
424 | void |
517 | load_archetypes (void) |
425 | load_archetypes (void) |
518 | { |
426 | { |
519 | char filename[MAX_BUF]; |
427 | char filename[MAX_BUF]; |
520 | |
428 | |
521 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
429 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
522 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
430 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
523 | |
431 | |
524 | { |
|
|
525 | object_thawer |
|
|
526 | thawer (filename); |
432 | object_thawer f (filename); |
527 | |
433 | |
528 | LOG (llevDebug, " arch-pass 1...\n"); |
434 | f.next (); |
529 | first_arch_pass (thawer); |
|
|
530 | LOG (llevDebug, " done\n"); |
|
|
531 | } |
|
|
532 | |
435 | |
533 | init_archetable (); |
436 | if (!load_archetypes (f)) |
|
|
437 | cleanup ("unable to load archetypes"); |
|
|
438 | |
534 | warn_archetypes = 1; |
439 | warn_archetypes = 1; |
535 | |
440 | |
536 | { |
|
|
537 | object_thawer |
|
|
538 | thawer (filename); |
|
|
539 | |
|
|
540 | LOG (llevDebug, " loading treasure...\n"); |
|
|
541 | load_treasures (); |
441 | load_treasures (); |
542 | LOG (llevDebug, " done\n"); |
|
|
543 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
544 | second_arch_pass (thawer); |
|
|
545 | LOG (llevDebug, " done\n"); |
|
|
546 | #ifdef DEBUG |
|
|
547 | check_generators (); |
|
|
548 | #endif |
|
|
549 | } |
|
|
550 | LOG (llevDebug, " done\n"); |
|
|
551 | } |
442 | } |
552 | |
443 | |
553 | /* |
444 | /* |
554 | * Creates and returns a new object which is a copy of the given archetype. |
445 | * Creates and returns a new object which is a copy of the given archetype. |
555 | * This function returns NULL on failure. |
446 | * This function returns NULL on failure. |
556 | */ |
447 | */ |
557 | object * |
448 | object * |
558 | arch_to_object (archetype *at) |
449 | arch_to_object (archetype *at) |
559 | { |
450 | { |
560 | object *op; |
451 | if (!at) |
561 | |
|
|
562 | if (at == NULL) |
|
|
563 | { |
452 | { |
564 | if (warn_archetypes) |
453 | if (warn_archetypes) |
565 | LOG (llevError, "Couldn't find archetype.\n"); |
454 | LOG (llevError, "Couldn't find archetype.\n"); |
566 | |
455 | |
567 | return NULL; |
456 | return NULL; |
568 | } |
457 | } |
569 | |
458 | |
570 | op = at->clone.clone (); |
459 | object *op = at->clone.clone (); |
571 | op->arch = at; |
460 | op->arch = at; |
572 | op->instantiate (); |
461 | op->instantiate (); |
573 | return op; |
462 | return op; |
574 | } |
463 | } |
575 | |
464 | |
… | |
… | |
653 | return 0; |
542 | return 0; |
654 | else |
543 | else |
655 | return i->second; |
544 | return i->second; |
656 | } |
545 | } |
657 | |
546 | |
|
|
547 | archetype * |
|
|
548 | archetype::get (const char *name) |
|
|
549 | { |
|
|
550 | archetype *at = find (name); |
|
|
551 | |
|
|
552 | if (!at) |
|
|
553 | { |
|
|
554 | archetypes.push_back (at = new archetype); |
|
|
555 | at->name = name; |
|
|
556 | at->hash_add (); |
|
|
557 | } |
|
|
558 | |
|
|
559 | return at; |
|
|
560 | } |
|
|
561 | |
658 | /* |
562 | /* |
659 | * Adds an archetype to the hashtable. |
563 | * Adds an archetype to the hashtable. |
660 | */ |
564 | */ |
661 | void |
565 | void |
662 | archetype::hash_add () |
566 | archetype::hash_add () |
… | |
… | |
675 | * Used in treasure-generation. |
579 | * Used in treasure-generation. |
676 | */ |
580 | */ |
677 | archetype * |
581 | archetype * |
678 | type_to_archetype (int type) |
582 | type_to_archetype (int type) |
679 | { |
583 | { |
680 | archetype *at; |
|
|
681 | |
|
|
682 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
584 | for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
683 | if (at->clone.type == type) |
585 | if (at->clone.type == type) |
684 | return at; |
586 | return at; |
685 | |
587 | |
686 | return 0; |
588 | return 0; |
687 | } |
589 | } |
… | |
… | |
689 | /* |
591 | /* |
690 | * Returns a new object copied from the first archetype matching |
592 | * Returns a new object copied from the first archetype matching |
691 | * the given type. |
593 | * the given type. |
692 | * Used in treasure-generation. |
594 | * Used in treasure-generation. |
693 | */ |
595 | */ |
694 | |
|
|
695 | object * |
596 | object * |
696 | clone_arch (int type) |
597 | clone_arch (int type) |
697 | { |
598 | { |
698 | archetype *at; |
599 | archetype *at; |
699 | |
600 | |