[ViewVC] Diff of: cvs/deliantra/server/common/loader.C

Comparing deliantra/server/common/loader.C (file contents):
Revision 1.159 by root, Thu May 6 22:57:48 2010 UTC vs.
Revision 1.169 by root, Sun May 1 16:58:15 2011 UTC

 /*
  * This file is part of Deliantra, the Roguelike Realtime MMORPG.
  *
- * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
+ * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
  * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
  * Copyright (©) 1992 Frank Tore Johansen
  *
  * Deliantra is free software: you can redistribute it and/or modify it under
  * the terms of the Affero GNU General Public License as published by the
       type = 0;
     }
   switch (type)
     {
+      case RANGED:
       case BOW:
       case WAND:
       case ROD:
       case HORN:
         if (slot [body_range].info != -1)
       // TODO: fix firewall object on map
       /* Firewall is bizarre in that spell type was stored in dam. Rest are 'normal'
        * in that spell was stored in sp.
        */
       //LOG (llevError, "old spellcasting object found: %s", debug_desc ());
-      object *tmp = get_archetype (spell_mapping[type == FIREWALL ? stats.dam : stats.sp]);
+      object *tmp = archetype::get (spell_mapping[type == FIREWALL ? stats.dam : stats.sp]);
       insert_ob_in_ob (tmp, this);
       randomitems = 0;
     }
   /* spellbooks & runes use slaying.  But not to arch name, but to spell name */
 bool
 object::parse_kv (object_thawer &f)
 {
   object *op_inv = inv;
-  key_value *last_kv = key_values;
+  key_value *last_kv = kv.first;
   for (;;)
     {
       switch (f.kw)
         {
           case KW_is_buildable:         GET_FLAG (this, FLAG_IS_BUILDABLE); break;
           case KW_destroy_on_death:     GET_FLAG (this, FLAG_DESTROY_ON_DEATH); break;
           case KW_treasure_env:         GET_FLAG (this, FLAG_TREASURE_ENV); break;
           case KW_precious:             GET_FLAG (this, FLAG_PRECIOUS); break;
           case KW_random_speed:         GET_FLAG (this, FLAG_RANDOM_SPEED); break;
+          case KW_is_quad:              GET_FLAG (this, FLAG_IS_QUAD); break;
           case KW_armour:               f.get (resist[ATNR_PHYSICAL]); break;
           case KW_resist_physical:      f.get (resist[ATNR_PHYSICAL]); break;
           case KW_resist_magic:         f.get (resist[ATNR_MAGIC]); break;
           case KW_resist_fire:          f.get (resist[ATNR_FIRE]); break;
             f.next ();
             return true;
           case KW_ERROR:
-            // append as key value pair (do not use kv_set as it prepends)
-            // we also do not even try to find old values, duplicate keys stay duplicate
+            // we do not even try to find old values, duplicate keys stay duplicate
-            {
+            // the list gets reversed after loading
-              key_value *kv = new key_value;
+            kv.add (shstr (f.kw_str), shstr (f.value));
-              kv->next  = 0;
-              kv->key   = shstr (f.kw_str);
-              kv->value = shstr (f.value);
-              if (!last_kv)
-                key_values = last_kv = kv;
-              else
-                {
-                  while (last_kv->next)
-                    last_kv = last_kv->next;
-                  last_kv->next = kv;
-                  last_kv       = kv;
-                }
-            }
-            //fprintf (stderr, "addkv(%s,%s)\n", f.kw_str, f.value);//D
             break;
           default:
             if (!f.parse_error ("object", name))
               return false;
   archetype *arch = archetype::find (f.get_str ());
   if (!arch)
     {
-      LOG (llevError, "object refering to nonexistant archetype '%s'.\n", f.get_str ());
+      LOG (llevError, "object referring to nonexistent archetype '%s'.\n", f.get_str ());
       arch = archetype::find (shstr_earthwall);
     }
   assert (arch); //D maybe use exception handling of sorts?
   if (!op->parse_kv (f))
     {
       op->destroy ();
       return  0;
     }
+  // the loader reverses the ordering of kv-pairs, so we reverse it again after loading
+  // that greatly simplifies the loading code.
+  op->kv.reverse ();
   op->post_load_check ();
   return op;
 }
  * override values and in c_wiz to mutate values.
  */
 int
 set_variable (object *op, char *buf)
 {
-  object_thawer f (buf, (AV *)0);
+  object_thawer f (format ("%s\nend", buf), (AV *)0);
   return op->parse_kv (f);
 }
 // compare *op against *arch and output differences
   } flagmask;
   /* This saves the key/value lists.  We do it first so that any
    * keys that match field names will be overwritten by the loader.
    */
-  for (key_value *kv = op->key_values; kv; kv = kv->next)
+  for (key_value *kv = op->kv.first; kv; kv = kv->next)
-    if (!arch->key_values || arch->kv (kv->key) != kv->value)
+    if (arch->kv.empty () || arch->kv [kv->key] != kv->value)
       f.put (kv->key, kv->value);
   if (op->uuid)
     {
       // highly optimised - this is often 25% of all data written
 #endif
   // save body locations. gcc's memcmp does an abysmal job when used
   for (int i = 0; i < NUM_BODY_LOCATIONS; i++)
     if (expect_false (op->slot[i].info != arch->slot[i].info))
-      f.put (body_locations[i].save_name, op->slot[i].info);
+      f.put (body_locations[i].kw, op->slot[i].info);
 }
 /*
  * Dumps all variables in an object to a file.
  * If bit 0 of flag is set, unpaid objects will be saved.  As of now,
 {
   object_thawer f (filename);
   for (;;)
     {
-      coroapi.cede_to_tick ();
+      coroapi::cede_to_tick ();
       switch (f.kw)
         {
           case KW_region:
             if (!region::read (f))

Diff Legend

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

Comparing deliantra/server/common/loader.C (file contents): Revision 1.159 by root, Thu May 6 22:57:48 2010 UTC vs. Revision 1.169 by root, Sun May 1 16:58:15 2011 UTC

Diff Legend

Comparing deliantra/server/common/loader.C (file contents):
Revision 1.159 by root, Thu May 6 22:57:48 2010 UTC vs.
Revision 1.169 by root, Sun May 1 16:58:15 2011 UTC