1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
… | |
… | |
309 | // dire hack, need to rationalise |
309 | // dire hack, need to rationalise |
310 | void |
310 | void |
311 | overwrite (archetype *at, object *op) |
311 | overwrite (archetype *at, object *op) |
312 | { |
312 | { |
313 | at->clone = *op; |
313 | at->clone = *op; |
314 | |
|
|
315 | at->clone.arch = at; |
314 | at->clone.arch = at; |
|
|
315 | |
316 | at->clone.inv = op->inv; op->inv = 0; |
316 | at->clone.inv = op->inv; op->inv = 0; |
317 | |
317 | |
318 | op->destroy (); |
318 | op->destroy (); |
319 | } |
319 | } |
320 | |
320 | |
321 | bool |
321 | archetype * |
322 | archetype::load (object_thawer &f) |
322 | archetype::read (object_thawer &f) |
323 | { |
323 | { |
324 | assert (f.kw == KW_object); |
324 | assert (f.kw == KW_object); |
|
|
325 | |
|
|
326 | loading_arch = true; // hack to tell parse_kv et al. to behave |
325 | |
327 | |
326 | typedef std::pair<archetype *, object *> part; |
328 | typedef std::pair<archetype *, object *> part; |
327 | std::vector<part> parts; |
329 | std::vector<part> parts; |
328 | |
330 | |
|
|
331 | coroapi::cede_to_tick_every (100); |
|
|
332 | |
329 | for (;;) |
333 | for (;;) |
330 | { |
334 | { |
|
|
335 | object *op = object::create (); |
331 | archetype *at = get (f.get_str ()); |
336 | archetype *at = get (f.get_str ()); |
332 | object *op = object::create (); |
337 | f.get (op->name); |
|
|
338 | f.next (); |
|
|
339 | |
|
|
340 | #if 0 |
|
|
341 | if (f.kw == KW_inherit) |
|
|
342 | { |
|
|
343 | if (archetype *at = find (f.get_str ())) |
|
|
344 | *op = at->clone; |
|
|
345 | else |
|
|
346 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
347 | &at->name, f.get_str ()); |
|
|
348 | |
|
|
349 | f.next (); |
|
|
350 | } |
|
|
351 | #endif |
333 | |
352 | |
334 | if (!op->parse_kv (f)) |
353 | if (!op->parse_kv (f)) |
335 | goto fail; |
354 | goto fail; |
336 | |
355 | |
|
|
356 | op->post_load_check (); |
|
|
357 | |
337 | parts.push_back (std::make_pair (at, op)); |
358 | parts.push_back (std::make_pair (at, op)); |
338 | |
359 | |
339 | if (f.kw != KW_more) |
360 | if (f.kw != KW_more) |
340 | break; |
361 | break; |
341 | |
362 | |
342 | f.next (); |
363 | f.next (); |
|
|
364 | |
343 | assert (f.kw == KW_object); |
365 | if (f.kw != KW_object) |
|
|
366 | { |
|
|
367 | f.parse_error ("more object"); |
|
|
368 | goto fail; |
|
|
369 | } |
344 | } |
370 | } |
345 | |
371 | |
346 | { |
372 | { |
347 | archetype *head = parts.front ().first; |
373 | archetype *head = parts.front ().first; |
348 | |
374 | |
… | |
… | |
401 | prev->more = at; |
427 | prev->more = at; |
402 | prev->clone.more = &at->clone; |
428 | prev->clone.more = &at->clone; |
403 | |
429 | |
404 | prev = at; |
430 | prev = at; |
405 | } |
431 | } |
|
|
432 | |
|
|
433 | loading_arch = false; |
|
|
434 | return head; |
406 | } |
435 | } |
407 | |
|
|
408 | return true; |
|
|
409 | |
436 | |
410 | fail: |
437 | fail: |
411 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
438 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
412 | p->second->destroy (true); |
439 | p->second->destroy (true); |
413 | |
440 | |
414 | return false; |
|
|
415 | } |
|
|
416 | |
|
|
417 | /* |
|
|
418 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
419 | * of archetype-structures. |
|
|
420 | */ |
|
|
421 | static bool |
|
|
422 | load_archetypes (object_thawer &f) |
|
|
423 | { |
|
|
424 | for (;;) |
|
|
425 | { |
|
|
426 | switch (f.kw) |
|
|
427 | { |
|
|
428 | case KW_object: |
|
|
429 | loading_arch = true; |
|
|
430 | if (!archetype::load (f)) |
|
|
431 | { |
|
|
432 | loading_arch = false; |
|
|
433 | return false; |
|
|
434 | } |
|
|
435 | |
|
|
436 | loading_arch = false; |
441 | loading_arch = false; |
437 | continue; |
442 | return 0; |
438 | |
|
|
439 | case KW_EOF: |
|
|
440 | return true; |
|
|
441 | |
|
|
442 | default: |
|
|
443 | if (!f.parse_error ("archetypes file")) |
|
|
444 | return false; |
|
|
445 | } |
|
|
446 | |
|
|
447 | f.next (); |
|
|
448 | } |
|
|
449 | } |
443 | } |
450 | |
444 | |
451 | /* |
445 | /* |
452 | * First initialises the archtype hash-table (init_archetable()). |
446 | * Initialize global archtype pointers: |
453 | * Reads and parses the archetype file (with the first and second-pass |
|
|
454 | * functions). |
|
|
455 | */ |
447 | */ |
456 | bool |
448 | void |
457 | load_archetype_file (const char *filename) |
449 | init_archetype_pointers () |
458 | { |
450 | { |
459 | object_thawer f (filename); |
451 | ring_arch = archetype::find ("ring"); |
460 | |
452 | amulet_arch = archetype::find ("amulet"); |
461 | f.next (); |
453 | staff_arch = archetype::find ("staff"); |
462 | |
454 | crown_arch = archetype::find ("crown"); |
463 | // make sure the next - long - step is only done after a tick |
|
|
464 | coroapi::wait_for_tick_begin (); |
|
|
465 | |
|
|
466 | if (!load_archetypes (f)) |
|
|
467 | return false; |
|
|
468 | |
|
|
469 | warn_archetypes = 1; |
|
|
470 | |
|
|
471 | empty_archetype = archetype::find ("empty_archetype"); |
455 | empty_archetype = archetype::find ("empty_archetype"); |
472 | if (!empty_archetype) |
|
|
473 | return false; |
|
|
474 | |
|
|
475 | coroapi::cede (); |
|
|
476 | |
|
|
477 | return true; |
|
|
478 | } |
456 | } |
479 | |
457 | |
480 | /* |
458 | /* |
481 | * Creates and returns a new object which is a copy of the given archetype. |
459 | * Creates and returns a new object which is a copy of the given archetype. |
482 | * This function returns NULL on failure. |
460 | * This function returns NULL on failure. |
… | |
… | |
484 | object * |
462 | object * |
485 | arch_to_object (archetype *at) |
463 | arch_to_object (archetype *at) |
486 | { |
464 | { |
487 | if (!at) |
465 | if (!at) |
488 | { |
466 | { |
489 | if (warn_archetypes) |
|
|
490 | LOG (llevError, "Couldn't find archetype.\n"); |
467 | LOG (llevError, "Couldn't find archetype.\n"); |
491 | |
|
|
492 | return NULL; |
468 | return 0; |
493 | } |
469 | } |
494 | |
470 | |
495 | object *op = at->clone.clone (); |
471 | object *op = at->clone.clone (); |
496 | op->arch = at; |
472 | op->arch = at; |
497 | op->instantiate (); |
473 | op->instantiate (); |
|
|
474 | |
498 | return op; |
475 | return op; |
499 | } |
476 | } |
500 | |
477 | |
501 | /* |
478 | /* |
502 | * Creates an object. This function is called by get_archetype() |
479 | * Creates an object. This function is called by get_archetype() |
… | |
… | |
551 | } |
528 | } |
552 | |
529 | |
553 | archetype * |
530 | archetype * |
554 | archetype::get (const char *name) |
531 | archetype::get (const char *name) |
555 | { |
532 | { |
|
|
533 | if (!name) |
|
|
534 | { |
|
|
535 | LOG (llevError, "null archetype requested\n"); |
|
|
536 | name = "(null)"; |
|
|
537 | } |
|
|
538 | |
556 | archetype *at = find (name); |
539 | archetype *at = find (name); |
557 | |
540 | |
558 | if (!at) |
541 | if (!at) |
559 | { |
542 | { |
560 | archetypes.push_back (at = new archetype); |
543 | archetypes.push_back (at = new archetype); |
561 | at->name = name; |
544 | at->name = at->clone.name = at->clone.name_pl = name; |
562 | at->hash_add (); |
545 | at->hash_add (); |
563 | } |
546 | } |
564 | |
547 | |
565 | return at; |
548 | return at; |
566 | } |
549 | } |