ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.48 by root, Mon Apr 16 11:09:30 2007 UTC vs.
Revision 1.55 by root, Tue Apr 17 19:12:32 2007 UTC

… …
309// dire hack, need to rationalise 309// dire hack, need to rationalise
310void 310void
311overwrite (archetype *at, object *op) 311overwrite (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;
316 //TODO: inv et al. 315
316 at->clone.inv = op->inv; op->inv = 0;
317
318 op->destroy ();
317} 319}
318 320
319archetype * 321archetype *
320archetype::read (object_thawer &f) 322archetype::read (object_thawer &f)
321{ 323{
322 assert (f.kw == KW_object); 324 assert (f.kw == KW_object);
323 325
324 archetype *head = get (f.get_str ()); 326 loading_arch = true; // hack to tell parse_kv et al. to behave
325 unlink (head); 327
328 typedef std::pair<archetype *, object *> part;
329 std::vector<part> parts;
330
331 coroapi::cede_to_tick_every (100);
332
333 for (;;)
334 {
326 object *op = object::create (); 335 object *op = object::create ();
327 336 archetype *at = get (f.get_str ());
328 if (!op->parse_kv (f)) 337 f.get (op->name);
329 {
330 op->destroy (true);
331 // leak head
332 return 0;
333 }
334
335 overwrite (head, op);
336 op->destroy ();
337
338 for (archetype *prev = head; f.kw == KW_more; )
339 {
340 f.next (); 338 f.next ();
341 assert (f.kw == KW_object);
342 339
340 if (f.kw == KW_inherit)
341 {
343 archetype *more = get (f.get_str ()); 342 if (archetype *at = find (f.get_str ()))
344 unlink (more); 343 *op = at->clone;
345 object *op = object::create (); 344 else
345 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
346 &at->name, f.get_str ());
347
348 f.next ();
349 }
346 350
347 if (!op->parse_kv (f)) 351 if (!op->parse_kv (f))
352 goto fail;
353
354 parts.push_back (std::make_pair (at, op));
355
356 if (f.kw != KW_more)
357 break;
358
359 f.next ();
360
361 if (f.kw != KW_object)
348 { 362 {
349 op->destroy (true); 363 f.parse_error ("more object");
350 // leak head more* 364 goto fail;
351 return 0;
352 } 365 }
353
354 overwrite (more, op);
355 op->destroy ();
356
357 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;
358 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
359
360 more->head = head;
361 more->clone.head = &head->clone;
362 prev->more = more;
363 prev->clone.more = &more->clone;
364
365 prev = more;
366 } 366 }
367 367
368 if (!head->next) 368 {
369 archetype *head = parts.front ().first;
370
371 // check that all archetypes belong to the same object or are heads
372 for (auto (p, parts.begin ()); p != parts.end (); ++p)
369 { 373 {
374 archetype *at = p->first;
375
376 if (at->head != head && at->head)
377 {
378 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
379 goto fail;
380 }
381
382 if (at->next && at != head)
383 {
384 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
385 goto fail;
386 }
387 }
388
389 // sever chain of existing head object
390 for (archetype *more, *at = head; at; at = more)
391 {
392 more = at->more;
393
394 at->head = 0;
395 at->more = 0;
396 }
397
398 // replace/update head
399 overwrite (head, parts.front ().second);
400 head->tail_x = 0;
401 head->tail_y = 0;
402
403 // link into list of heads, if not already there
404 if (!head->linked)
405 {
406 head->linked = true;
370 head->next = first_archetype; 407 head->next = first_archetype;
371 first_archetype = head; 408 first_archetype = head;
372 } 409 }
373 410
411 // reassemble new chain
412 archetype *prev = head;
413 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
414 {
415 archetype *at = p->first;
416 overwrite (at, p->second);
417
418 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
419 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
420
421 at->head = head;
422 at->clone.head = &head->clone;
423 prev->more = at;
424 prev->clone.more = &at->clone;
425
426 prev = at;
427 }
428
429 loading_arch = false;
374 return head; 430 return head;
375} 431 }
376 432
377/* 433fail:
378 * Reads/parses the archetype-file, and copies into a linked list 434 for (auto (p, parts.begin ()); p != parts.end (); ++p)
379 * of archetype-structures. 435 p->second->destroy (true);
380 */
381static bool
382load_archetypes (object_thawer &f)
383{
384 for (;;)
385 {
386 switch (f.kw)
387 {
388 case KW_object:
389 loading_arch = true;
390 if (!archetype::read (f))
391 {
392 loading_arch = false;
393 return false;
394 }
395 436
396 loading_arch = false; 437 loading_arch = false;
397 continue; 438 return 0;
398
399 case KW_EOF:
400 return true;
401
402 default:
403 if (!f.parse_error ("archetypes file"))
404 return false;
405 }
406
407 f.next ();
408 }
409} 439}
410 440
411/* 441/*
412 * First initialises the archtype hash-table (init_archetable()). 442 * Initialize global archtype pointers:
413 * Reads and parses the archetype file (with the first and second-pass
414 * functions).
415 */ 443 */
416bool 444void
417load_archetype_file (const char *filename) 445init_archetype_pointers ()
418{ 446{
419 object_thawer f (filename); 447 ring_arch = archetype::find ("ring");
420 448 amulet_arch = archetype::find ("amulet");
421 f.next (); 449 staff_arch = archetype::find ("staff");
422 450 crown_arch = archetype::find ("crown");
423 // make sure the next - long - step is only done after a tick
424 coroapi::wait_for_tick_begin ();
425
426 if (!load_archetypes (f))
427 return false;
428
429 warn_archetypes = 1;
430
431 empty_archetype = archetype::find ("empty_archetype"); 451 empty_archetype = archetype::find ("empty_archetype");
432 if (!empty_archetype)
433 return false;
434
435 coroapi::cede ();
436
437 return true;
438} 452}
439 453
440/* 454/*
441 * Creates and returns a new object which is a copy of the given archetype. 455 * Creates and returns a new object which is a copy of the given archetype.
442 * This function returns NULL on failure. 456 * This function returns NULL on failure.
… …
444object * 458object *
445arch_to_object (archetype *at) 459arch_to_object (archetype *at)
446{ 460{
447 if (!at) 461 if (!at)
448 { 462 {
449 if (warn_archetypes)
450 LOG (llevError, "Couldn't find archetype.\n"); 463 LOG (llevError, "Couldn't find archetype.\n");
451
452 return NULL; 464 return 0;
453 } 465 }
454 466
455 object *op = at->clone.clone (); 467 object *op = at->clone.clone ();
456 op->arch = at; 468 op->arch = at;
457 op->instantiate (); 469 op->instantiate ();
470
458 return op; 471 return op;
459} 472}
460 473
461/* 474/*
462 * Creates an object. This function is called by get_archetype() 475 * Creates an object. This function is called by get_archetype()
… …
491 504
492 return arch_to_object (at); 505 return arch_to_object (at);
493} 506}
494 507
495/* 508/*
496 * Hash-function used by the arch-hashtable.
497 */
498
499unsigned long
500hasharch (const char *str, int tablesize)
501{
502 unsigned long hash = 0;
503 unsigned int i = 0;
504 const char *p;
505
506 /* use the one-at-a-time hash function, which supposedly is
507 * better than the djb2-like one used by perl5.005, but
508 * certainly is better then the bug used here before.
509 * see http://burtleburtle.net/bob/hash/doobs.html
510 */
511 for (p = str; i < MAXSTRING && *p; p++, i++)
512 {
513 hash += *p;
514 hash += hash << 10;
515 hash ^= hash >> 6;
516 }
517
518 hash += hash << 3;
519 hash ^= hash >> 11;
520 hash += hash << 15;
521
522 return hash % tablesize;
523}
524
525/*
526 * Finds, using the hashtable, which archetype matches the given name. 509 * Finds, using the hashtable, which archetype matches the given name.
527 * returns a pointer to the found archetype, otherwise NULL. 510 * returns a pointer to the found archetype, otherwise NULL.
528 */ 511 */
529archetype * 512archetype *
530archetype::find (const char *name) 513archetype::find (const char *name)
531{ 514{
532 if (!name) 515 if (!name)
533 return 0; 516 return 0;
534 517
535 AUTODECL (i, ht.find (name)); 518 auto (i, ht.find (name));
536 519
537 if (i == ht.end ()) 520 if (i == ht.end ())
538 return 0; 521 return 0;
539 else 522 else
540 return i->second; 523 return i->second;

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines