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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.222 by root, Wed Apr 30 05:06:36 2008 UTC vs.
Revision 1.233 by root, Tue May 6 18:47:32 2008 UTC

… …
139 139
140/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 140/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141static bool 141static bool
142compare_ob_value_lists_one (const object *wants, const object *has) 142compare_ob_value_lists_one (const object *wants, const object *has)
143{ 143{
144 key_value *wants_field;
145
146 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both 144 /* n-squared behaviour (see kv_get), but I'm hoping both
147 * objects with lists are rare, and lists stay short. If not, use a 145 * objects with lists are rare, and lists stay short. If not, use a
148 * different structure or at least keep the lists sorted... 146 * different structure or at least keep the lists sorted...
149 */ 147 */
150 148
151 /* For each field in wants, */ 149 /* For each field in wants, */
152 for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) 150 for (key_value *kv = wants->key_values; kv; kv = kv->next)
153 { 151 if (has->kv_get (kv->key) != kv->value)
154 key_value *has_field; 152 return false;
155
156 /* Look for a field in has with the same key. */
157 has_field = get_ob_key_link (has, wants_field->key);
158
159 if (!has_field)
160 return 0; /* No field with that name. */
161
162 /* Found the matching field. */
163 if (has_field->value != wants_field->value)
164 return 0; /* Values don't match, so this half of the comparison is false. */
165
166 /* If we get here, we found a match. Now for the next field in wants. */
167 }
168 153
169 /* If we get here, every field in wants has a matching field in has. */ 154 /* If we get here, every field in wants has a matching field in has. */
170 return 1; 155 return true;
171} 156}
172 157
173/* Returns TRUE if ob1 has the same key_values as ob2. */ 158/* Returns TRUE if ob1 has the same key_values as ob2. */
174static bool 159static bool
175compare_ob_value_lists (const object *ob1, const object *ob2) 160compare_ob_value_lists (const object *ob1, const object *ob2)
176{ 161{
177 /* However, there may be fields in has which aren't partnered in wants, 162 /* However, there may be fields in has which aren't partnered in wants,
178 * so we need to run the comparison *twice*. :( 163 * so we need to run the comparison *twice*. :(
179 */ 164 */
180 return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); 165 return compare_ob_value_lists_one (ob1, ob2)
166 && compare_ob_value_lists_one (ob2, ob1);
181} 167}
182 168
183/* Function examines the 2 objects given to it, and returns true if 169/* Function examines the 2 objects given to it, and returns true if
184 * they can be merged together. 170 * they can be merged together.
185 * 171 *
… …
368 return 0; 354 return 0;
369} 355}
370 356
371// adjust weight per container type ("of holding") 357// adjust weight per container type ("of holding")
372static sint32 358static sint32
373weight_adjust (object *op, sint32 weight) 359weight_adjust_for (object *op, sint32 weight)
374{ 360{
375 return op->type == CONTAINER 361 return op->type == CONTAINER
376 ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) 362 ? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377 : weight; 363 : weight;
378} 364}
… …
384static void 370static void
385adjust_weight (object *op, sint32 weight) 371adjust_weight (object *op, sint32 weight)
386{ 372{
387 while (op) 373 while (op)
388 { 374 {
375 // adjust by actual difference to account for rounding errors
376 // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389 weight = weight_adjust (op, weight); 377 weight = weight_adjust_for (op, op->carrying)
378 - weight_adjust_for (op, op->carrying - weight);
390 379
391 if (!weight) 380 if (!weight)
392 return; 381 return;
393 382
394 op->carrying += weight; 383 op->carrying += weight;
… …
603 } 592 }
604 593
605 op->key_values = 0; 594 op->key_values = 0;
606} 595}
607 596
608object & 597/*
609object::operator =(const object &src) 598 * copy_to first frees everything allocated by the dst object,
599 * and then copies the contents of itself into the second
600 * object, allocating what needs to be allocated. Basically, any
601 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
602 * if the first object is freed, the pointers in the new object
603 * will point at garbage.
604 */
605void
606object::copy_to (object *dst)
610{ 607{
611 bool is_freed = flag [FLAG_FREED]; 608 dst->remove ();
612 bool is_removed = flag [FLAG_REMOVED];
613
614 *(object_copy *)this = src; 609 *(object_copy *)dst = *this;
615
616 flag [FLAG_FREED] = is_freed;
617 flag [FLAG_REMOVED] = is_removed; 610 dst->flag [FLAG_REMOVED] = true;
618 611
619 /* Copy over key_values, if any. */ 612 /* Copy over key_values, if any. */
620 if (src.key_values) 613 if (key_values)
621 { 614 {
622 key_value *tail = 0; 615 key_value *tail = 0;
623 key_values = 0; 616 dst->key_values = 0;
624 617
625 for (key_value *i = src.key_values; i; i = i->next) 618 for (key_value *i = key_values; i; i = i->next)
626 { 619 {
627 key_value *new_link = new key_value; 620 key_value *new_link = new key_value;
628 621
629 new_link->next = 0; 622 new_link->next = 0;
630 new_link->key = i->key; 623 new_link->key = i->key;
631 new_link->value = i->value; 624 new_link->value = i->value;
632 625
633 /* Try and be clever here, too. */ 626 /* Try and be clever here, too. */
634 if (!key_values) 627 if (!dst->key_values)
635 { 628 {
636 key_values = new_link; 629 dst->key_values = new_link;
637 tail = new_link; 630 tail = new_link;
638 } 631 }
639 else 632 else
640 { 633 {
641 tail->next = new_link; 634 tail->next = new_link;
642 tail = new_link; 635 tail = new_link;
643 } 636 }
644 } 637 }
645 } 638 }
646}
647
648/*
649 * copy_to first frees everything allocated by the dst object,
650 * and then copies the contents of itself into the second
651 * object, allocating what needs to be allocated. Basically, any
652 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
653 * if the first object is freed, the pointers in the new object
654 * will point at garbage.
655 */
656void
657object::copy_to (object *dst)
658{
659 *dst = *this;
660 639
661 if (speed < 0) 640 if (speed < 0)
662 dst->speed_left -= rndm (); 641 dst->speed_left -= rndm ();
663 642
664 dst->set_speed (dst->speed); 643 dst->set_speed (dst->speed);
… …
686object * 665object *
687object::clone () 666object::clone ()
688{ 667{
689 object *neu = create (); 668 object *neu = create ();
690 copy_to (neu); 669 copy_to (neu);
670 neu->map = map; // not copied by copy_to
691 return neu; 671 return neu;
692} 672}
693 673
694/* 674/*
695 * If an object with the IS_TURNABLE() flag needs to be turned due 675 * If an object with the IS_TURNABLE() flag needs to be turned due
… …
959 object *op = new object; 939 object *op = new object;
960 op->link (); 940 op->link ();
961 return op; 941 return op;
962} 942}
963 943
944static struct freed_map : maptile
945{
946 freed_map ()
947 {
948 path = "<freed objects map>";
949 name = "/internal/freed_objects_map";
950 width = 3;
951 height = 3;
952 nodrop = 1;
953
954 alloc ();
955 in_memory = MAP_ACTIVE;
956 }
957
958 ~freed_map ()
959 {
960 destroy ();
961 }
962} freed_map; // freed objects are moved here to avoid crashes
963
964void 964void
965object::do_destroy () 965object::do_destroy ()
966{ 966{
967 if (flag [FLAG_IS_LINKED]) 967 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 968 remove_button_link (this);
… …
978 unlink (); 978 unlink ();
979 979
980 flag [FLAG_FREED] = 1; 980 flag [FLAG_FREED] = 1;
981 981
982 // hack to ensure that freed objects still have a valid map 982 // hack to ensure that freed objects still have a valid map
983 {
984 static maptile *freed_map; // freed objects are moved here to avoid crashes
985
986 if (!freed_map)
987 {
988 freed_map = new maptile;
989
990 freed_map->path = "<freed objects map>";
991 freed_map->name = "/internal/freed_objects_map";
992 freed_map->width = 3;
993 freed_map->height = 3;
994 freed_map->nodrop = 1;
995
996 freed_map->alloc ();
997 freed_map->in_memory = MAP_ACTIVE;
998 }
999
1000 map = freed_map; 983 map = &freed_map;
1001 x = 1; 984 x = 1;
1002 y = 1; 985 y = 1;
1003 }
1004 986
1005 if (more) 987 if (more)
1006 { 988 {
1007 more->destroy (); 989 more->destroy ();
1008 more = 0; 990 more = 0;
… …
1025 1007
1026 if (!is_head () && !head->destroyed ()) 1008 if (!is_head () && !head->destroyed ())
1027 { 1009 {
1028 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1010 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1029 head->destroy (destroy_inventory); 1011 head->destroy (destroy_inventory);
1012 return;
1030 } 1013 }
1031 1014
1032 destroy_inv (!destroy_inventory); 1015 destroy_inv (!destroy_inventory);
1033 1016
1034 if (is_head ()) 1017 if (is_head ())
… …
1163 * appropriately. 1146 * appropriately.
1164 */ 1147 */
1165 pl->close_container (); 1148 pl->close_container ();
1166 1149
1167 //TODO: the floorbox prev/next might need updating 1150 //TODO: the floorbox prev/next might need updating
1168 esrv_del_item (pl->contr, count); 1151 //esrv_del_item (pl->contr, count);
1152 //TODO: update floorbox to preserve ordering
1153 if (pl->contr->ns)
1154 pl->contr->ns->floorbox_update ();
1169 } 1155 }
1170 1156
1171 for (tmp = ms.bot; tmp; tmp = tmp->above) 1157 for (tmp = ms.bot; tmp; tmp = tmp->above)
1172 { 1158 {
1173 /* No point updating the players look faces if he is the object 1159 /* No point updating the players look faces if he is the object
… …
1307 * of areas of callers (eg, anything that uses find_free_spot would now 1293 * of areas of callers (eg, anything that uses find_free_spot would now
1308 * need extra work 1294 * need extra work
1309 */ 1295 */
1310 if (!xy_normalise (m, op->x, op->y)) 1296 if (!xy_normalise (m, op->x, op->y))
1311 { 1297 {
1312 op->destroy (1); 1298 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1313 return 0; 1299 return 0;
1314 } 1300 }
1315 1301
1316 if (object *more = op->more) 1302 if (object *more = op->more)
1317 if (!insert_ob_in_map (more, m, originator, flag)) 1303 if (!insert_ob_in_map (more, m, originator, flag))
… …
1471 1457
1472 op->map->dirty = true; 1458 op->map->dirty = true;
1473 1459
1474 if (object *pl = ms.player ()) 1460 if (object *pl = ms.player ())
1475 //TODO: the floorbox prev/next might need updating 1461 //TODO: the floorbox prev/next might need updating
1476 esrv_send_item (pl, op); 1462 //esrv_send_item (pl, op);
1463 //TODO: update floorbox to preserve ordering
1464 if (pl->contr->ns)
1465 pl->contr->ns->floorbox_update ();
1477 1466
1478 /* If this object glows, it may affect lighting conditions that are 1467 /* If this object glows, it may affect lighting conditions that are
1479 * visible to others on this map. But update_all_los is really 1468 * visible to others on this map. But update_all_los is really
1480 * an inefficient way to do this, as it means los for all players 1469 * an inefficient way to do this, as it means los for all players
1481 * on the map will get recalculated. The players could very well 1470 * on the map will get recalculated. The players could very well
… …
1601 } 1590 }
1602 else 1591 else
1603 { 1592 {
1604 decrease (nr); 1593 decrease (nr);
1605 1594
1606 object *op = object_create_clone (this); 1595 object *op = deep_clone ();
1607 op->nrof = nr; 1596 op->nrof = nr;
1608 return op; 1597 return op;
1609 } 1598 }
1610} 1599}
1611 1600
… …
1832 LOG (llevError, "Present_arch called outside map.\n"); 1821 LOG (llevError, "Present_arch called outside map.\n");
1833 return NULL; 1822 return NULL;
1834 } 1823 }
1835 1824
1836 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) 1825 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1837 if (tmp->arch == at) 1826 if (tmp->arch->archname == at->archname)
1838 return tmp; 1827 return tmp;
1839 1828
1840 return NULL; 1829 return NULL;
1841} 1830}
1842 1831
… …
1906 * The first matching object is returned, or NULL if none. 1895 * The first matching object is returned, or NULL if none.
1907 */ 1896 */
1908object * 1897object *
1909present_arch_in_ob (const archetype *at, const object *op) 1898present_arch_in_ob (const archetype *at, const object *op)
1910{ 1899{
1911 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1900 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1912 if (tmp->arch == at) 1901 if (tmp->arch->archname == at->archname)
1913 return tmp; 1902 return tmp;
1914 1903
1915 return NULL; 1904 return NULL;
1916} 1905}
1917 1906
… …
2326 2315
2327/* 2316/*
2328 * create clone from object to another 2317 * create clone from object to another
2329 */ 2318 */
2330object * 2319object *
2331object_create_clone (object *asrc) 2320object::deep_clone ()
2332{ 2321{
2333 object *dst = 0, *tmp, *src, *prev, *item; 2322 assert (("deep_clone called on non-head object", is_head ()));
2334 2323
2335 if (!asrc) 2324 object *dst = clone ();
2336 return 0;
2337 2325
2338 src = asrc->head_ (); 2326 object *prev = dst;
2339
2340 prev = 0;
2341 for (object *part = src; part; part = part->more) 2327 for (object *part = this->more; part; part = part->more)
2342 { 2328 {
2343 tmp = part->clone (); 2329 object *tmp = part->clone ();
2344 tmp->x -= src->x;
2345 tmp->y -= src->y;
2346
2347 if (!part->head)
2348 {
2349 dst = tmp;
2350 tmp->head = 0;
2351 }
2352 else
2353 tmp->head = dst; 2330 tmp->head = dst;
2354
2355 tmp->more = 0;
2356
2357 if (prev)
2358 prev->more = tmp; 2331 prev->more = tmp;
2359
2360 prev = tmp; 2332 prev = tmp;
2361 } 2333 }
2362 2334
2363 for (item = src->inv; item; item = item->below) 2335 for (object *item = inv; item; item = item->below)
2364 insert_ob_in_ob (object_create_clone (item), dst); 2336 insert_ob_in_ob (item->deep_clone (), dst);
2365 2337
2366 return dst; 2338 return dst;
2367} 2339}
2368 2340
2369/* This returns the first object in who's inventory that 2341/* This returns the first object in who's inventory that
… …
2378 return tmp; 2350 return tmp;
2379 2351
2380 return 0; 2352 return 0;
2381} 2353}
2382 2354
2383/* If ob has a field named key, return the link from the list, 2355const shstr &
2384 * otherwise return NULL. 2356object::kv_get (const shstr &key) const
2385 *
2386 * key must be a passed in shared string - otherwise, this won't
2387 * do the desired thing.
2388 */
2389key_value *
2390get_ob_key_link (const object *ob, const char *key)
2391{ 2357{
2392 for (key_value *link = ob->key_values; link; link = link->next) 2358 for (key_value *kv = key_values; kv; kv = kv->next)
2393 if (link->key == key) 2359 if (kv->key == key)
2394 return link;
2395
2396 return 0;
2397}
2398
2399/*
2400 * Returns the value of op has an extra_field for key, or NULL.
2401 *
2402 * The argument doesn't need to be a shared string.
2403 *
2404 * The returned string is shared.
2405 */
2406const char *
2407get_ob_key_value (const object *op, const char *const key)
2408{
2409 key_value *link;
2410 shstr_cmp canonical_key (key);
2411
2412 if (!canonical_key)
2413 {
2414 /* 1. There being a field named key on any object
2415 * implies there'd be a shared string to find.
2416 * 2. Since there isn't, no object has this field.
2417 * 3. Therefore, *this* object doesn't have this field.
2418 */
2419 return 0;
2420 }
2421
2422 /* This is copied from get_ob_key_link() above -
2423 * only 4 lines, and saves the function call overhead.
2424 */
2425 for (link = op->key_values; link; link = link->next)
2426 if (link->key == canonical_key)
2427 return link->value; 2360 return kv->value;
2428 2361
2429 return 0; 2362 return shstr_null;
2430} 2363}
2431 2364
2432/* 2365void
2433 * Updates the canonical_key in op to value. 2366object::kv_set (const shstr &key, const shstr &value)
2434 *
2435 * canonical_key is a shared string (value doesn't have to be).
2436 *
2437 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2438 * keys.
2439 *
2440 * Returns TRUE on success.
2441 */
2442int
2443set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2444{ 2367{
2445 key_value *field = NULL, *last = NULL; 2368 for (key_value *kv = key_values; kv; kv = kv->next)
2446 2369 if (kv->key == key)
2447 for (field = op->key_values; field != NULL; field = field->next)
2448 {
2449 if (field->key != canonical_key)
2450 { 2370 {
2451 last = field; 2371 kv->value = value;
2452 continue; 2372 return;
2453 } 2373 }
2454 2374
2455 if (value) 2375 key_value *kv = new key_value;
2456 field->value = value; 2376
2457 else 2377 kv->next = key_values;
2378 kv->key = key;
2379 kv->value = value;
2380
2381 key_values = kv;
2382}
2383
2384void
2385object::kv_del (const shstr &key)
2386{
2387 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2388 if ((*kvp)->key == key)
2458 { 2389 {
2459 /* Basically, if the archetype has this key set, 2390 key_value *kv = *kvp;
2460 * we need to store the null value so when we save 2391 *kvp = (*kvp)->next;
2461 * it, we save the empty value so that when we load, 2392 delete kv;
2462 * we get this value back again. 2393 return;
2463 */
2464 if (get_ob_key_link (op->arch, canonical_key))
2465 field->value = 0;
2466 else
2467 {
2468 if (last)
2469 last->next = field->next;
2470 else
2471 op->key_values = field->next;
2472
2473 delete field;
2474 }
2475 } 2394 }
2476 return TRUE;
2477 }
2478 /* IF we get here, key doesn't exist */
2479
2480 /* No field, we'll have to add it. */
2481
2482 if (!add_key)
2483 return FALSE;
2484
2485 /* There isn't any good reason to store a null
2486 * value in the key/value list. If the archetype has
2487 * this key, then we should also have it, so shouldn't
2488 * be here. If user wants to store empty strings,
2489 * should pass in ""
2490 */
2491 if (value == NULL)
2492 return TRUE;
2493
2494 field = new key_value;
2495
2496 field->key = canonical_key;
2497 field->value = value;
2498 /* Usual prepend-addition. */
2499 field->next = op->key_values;
2500 op->key_values = field;
2501
2502 return TRUE;
2503}
2504
2505/*
2506 * Updates the key in op to value.
2507 *
2508 * If add_key is FALSE, this will only update existing keys,
2509 * and not add new ones.
2510 * In general, should be little reason FALSE is ever passed in for add_key
2511 *
2512 * Returns TRUE on success.
2513 */
2514int
2515set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2516{
2517 shstr key_ (key);
2518
2519 return set_ob_key_value_s (op, key_, value, add_key);
2520} 2395}
2521 2396
2522object::depth_iterator::depth_iterator (object *container) 2397object::depth_iterator::depth_iterator (object *container)
2523: iterator_base (container) 2398: iterator_base (container)
2524{ 2399{

Diff Legend

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