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.221 by root, Thu Apr 24 12:06:01 2008 UTC vs.
Revision 1.235 by root, Tue May 6 20:00:12 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;
… …
417 op->update_weight (); 406 op->update_weight ();
418 407
419 sum += op->total_weight (); 408 sum += op->total_weight ();
420 } 409 }
421 410
422 sum = weight_adjust (this, sum); 411 sum = weight_adjust_for (this, sum);
423 412
424 if (sum != carrying) 413 if (sum != carrying)
425 { 414 {
426 carrying = sum; 415 carrying = sum;
427 416
… …
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
… …
746 * UP_OBJ_FACE: only the objects face has changed. 726 * UP_OBJ_FACE: only the objects face has changed.
747 */ 727 */
748void 728void
749update_object (object *op, int action) 729update_object (object *op, int action)
750{ 730{
751 if (op == NULL) 731 if (!op)
752 { 732 {
753 /* this should never happen */ 733 /* this should never happen */
754 LOG (llevDebug, "update_object() called for NULL object.\n"); 734 LOG (llevError | logBacktrace, "update_object() called for NULL object.\n");
755 return; 735 return;
756 } 736 }
757 737
758 if (op->env) 738 if (!op->is_on_map ())
759 { 739 {
760 /* Animation is currently handled by client, so nothing 740 /* Animation is currently handled by client, so nothing
761 * to do in this case. 741 * to do in this case.
762 */ 742 */
763 return; 743 return;
764 } 744 }
765
766 /* If the map is saving, don't do anything as everything is
767 * going to get freed anyways.
768 */
769 if (!op->map || op->map->in_memory == MAP_SAVING)
770 return;
771 745
772 /* make sure the object is within map boundaries */ 746 /* make sure the object is within map boundaries */
773 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) 747 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
774 { 748 {
775 LOG (llevError, "update_object() called for object out of map!\n"); 749 LOG (llevError, "update_object() called for object out of map!\n");
… …
965 object *op = new object; 939 object *op = new object;
966 op->link (); 940 op->link ();
967 return op; 941 return op;
968} 942}
969 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
970void 964void
971object::do_destroy () 965object::do_destroy ()
972{ 966{
973 if (flag [FLAG_IS_LINKED]) 967 if (flag [FLAG_IS_LINKED])
974 remove_button_link (this); 968 remove_button_link (this);
… …
984 unlink (); 978 unlink ();
985 979
986 flag [FLAG_FREED] = 1; 980 flag [FLAG_FREED] = 1;
987 981
988 // hack to ensure that freed objects still have a valid map 982 // hack to ensure that freed objects still have a valid map
989 {
990 static maptile *freed_map; // freed objects are moved here to avoid crashes
991
992 if (!freed_map)
993 {
994 freed_map = new maptile;
995
996 freed_map->path = "<freed objects map>";
997 freed_map->name = "/internal/freed_objects_map";
998 freed_map->width = 3;
999 freed_map->height = 3;
1000 freed_map->nodrop = 1;
1001
1002 freed_map->alloc ();
1003 freed_map->in_memory = MAP_ACTIVE;
1004 }
1005
1006 map = freed_map; 983 map = &freed_map;
1007 x = 1; 984 x = 1;
1008 y = 1; 985 y = 1;
1009 }
1010 986
1011 if (more) 987 if (more)
1012 { 988 {
1013 more->destroy (); 989 more->destroy ();
1014 more = 0; 990 more = 0;
… …
1031 1007
1032 if (!is_head () && !head->destroyed ()) 1008 if (!is_head () && !head->destroyed ())
1033 { 1009 {
1034 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1010 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1035 head->destroy (destroy_inventory); 1011 head->destroy (destroy_inventory);
1012 return;
1036 } 1013 }
1037 1014
1038 destroy_inv (!destroy_inventory); 1015 destroy_inv (!destroy_inventory);
1039 1016
1040 if (is_head ()) 1017 if (is_head ())
… …
1140 1117
1141 /* Relink the object below us, if there is one */ 1118 /* Relink the object below us, if there is one */
1142 if (below) 1119 if (below)
1143 below->above = above; 1120 below->above = above;
1144 else 1121 else
1145 { 1122 ms.bot = above;
1146 /* Nothing below, which means we need to relink map object for this space
1147 * use translated coordinates in case some oddness with map tiling is
1148 * evident
1149 */
1150 if (GET_MAP_OB (map, x, y) != this)
1151 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1152
1153 ms.bot = above; /* goes on above it. */
1154 }
1155 1123
1156 above = 0; 1124 above = 0;
1157 below = 0; 1125 below = 0;
1158 1126
1159 if (map->in_memory == MAP_SAVING) 1127 if (map->in_memory == MAP_SAVING)
… …
1169 * appropriately. 1137 * appropriately.
1170 */ 1138 */
1171 pl->close_container (); 1139 pl->close_container ();
1172 1140
1173 //TODO: the floorbox prev/next might need updating 1141 //TODO: the floorbox prev/next might need updating
1174 esrv_del_item (pl->contr, count); 1142 //esrv_del_item (pl->contr, count);
1143 //TODO: update floorbox to preserve ordering
1144 if (pl->contr->ns)
1145 pl->contr->ns->floorbox_update ();
1175 } 1146 }
1176 1147
1177 for (tmp = ms.bot; tmp; tmp = tmp->above) 1148 for (tmp = ms.bot; tmp; tmp = tmp->above)
1178 { 1149 {
1179 /* No point updating the players look faces if he is the object 1150 /* No point updating the players look faces if he is the object
… …
1313 * of areas of callers (eg, anything that uses find_free_spot would now 1284 * of areas of callers (eg, anything that uses find_free_spot would now
1314 * need extra work 1285 * need extra work
1315 */ 1286 */
1316 if (!xy_normalise (m, op->x, op->y)) 1287 if (!xy_normalise (m, op->x, op->y))
1317 { 1288 {
1318 op->destroy (1); 1289 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1319 return 0; 1290 return 0;
1320 } 1291 }
1321 1292
1322 if (object *more = op->more) 1293 if (object *more = op->more)
1323 if (!insert_ob_in_map (more, m, originator, flag)) 1294 if (!insert_ob_in_map (more, m, originator, flag))
… …
1477 1448
1478 op->map->dirty = true; 1449 op->map->dirty = true;
1479 1450
1480 if (object *pl = ms.player ()) 1451 if (object *pl = ms.player ())
1481 //TODO: the floorbox prev/next might need updating 1452 //TODO: the floorbox prev/next might need updating
1482 esrv_send_item (pl, op); 1453 //esrv_send_item (pl, op);
1454 //TODO: update floorbox to preserve ordering
1455 if (pl->contr->ns)
1456 pl->contr->ns->floorbox_update ();
1483 1457
1484 /* If this object glows, it may affect lighting conditions that are 1458 /* If this object glows, it may affect lighting conditions that are
1485 * visible to others on this map. But update_all_los is really 1459 * visible to others on this map. But update_all_los is really
1486 * an inefficient way to do this, as it means los for all players 1460 * an inefficient way to do this, as it means los for all players
1487 * on the map will get recalculated. The players could very well 1461 * on the map will get recalculated. The players could very well
… …
1607 } 1581 }
1608 else 1582 else
1609 { 1583 {
1610 decrease (nr); 1584 decrease (nr);
1611 1585
1612 object *op = object_create_clone (this); 1586 object *op = deep_clone ();
1613 op->nrof = nr; 1587 op->nrof = nr;
1614 return op; 1588 return op;
1615 } 1589 }
1616} 1590}
1617 1591
… …
1838 LOG (llevError, "Present_arch called outside map.\n"); 1812 LOG (llevError, "Present_arch called outside map.\n");
1839 return NULL; 1813 return NULL;
1840 } 1814 }
1841 1815
1842 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) 1816 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1843 if (tmp->arch == at) 1817 if (tmp->arch->archname == at->archname)
1844 return tmp; 1818 return tmp;
1845 1819
1846 return NULL; 1820 return NULL;
1847} 1821}
1848 1822
… …
1912 * The first matching object is returned, or NULL if none. 1886 * The first matching object is returned, or NULL if none.
1913 */ 1887 */
1914object * 1888object *
1915present_arch_in_ob (const archetype *at, const object *op) 1889present_arch_in_ob (const archetype *at, const object *op)
1916{ 1890{
1917 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1891 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1918 if (tmp->arch == at) 1892 if (tmp->arch->archname == at->archname)
1919 return tmp; 1893 return tmp;
1920 1894
1921 return NULL; 1895 return NULL;
1922} 1896}
1923 1897
… …
2332 2306
2333/* 2307/*
2334 * create clone from object to another 2308 * create clone from object to another
2335 */ 2309 */
2336object * 2310object *
2337object_create_clone (object *asrc) 2311object::deep_clone ()
2338{ 2312{
2339 object *dst = 0, *tmp, *src, *prev, *item; 2313 assert (("deep_clone called on non-head object", is_head ()));
2340 2314
2341 if (!asrc) 2315 object *dst = clone ();
2342 return 0;
2343 2316
2344 src = asrc->head_ (); 2317 object *prev = dst;
2345
2346 prev = 0;
2347 for (object *part = src; part; part = part->more) 2318 for (object *part = this->more; part; part = part->more)
2348 { 2319 {
2349 tmp = part->clone (); 2320 object *tmp = part->clone ();
2350 tmp->x -= src->x;
2351 tmp->y -= src->y;
2352
2353 if (!part->head)
2354 {
2355 dst = tmp;
2356 tmp->head = 0;
2357 }
2358 else
2359 tmp->head = dst; 2321 tmp->head = dst;
2360
2361 tmp->more = 0;
2362
2363 if (prev)
2364 prev->more = tmp; 2322 prev->more = tmp;
2365
2366 prev = tmp; 2323 prev = tmp;
2367 } 2324 }
2368 2325
2369 for (item = src->inv; item; item = item->below) 2326 for (object *item = inv; item; item = item->below)
2370 insert_ob_in_ob (object_create_clone (item), dst); 2327 insert_ob_in_ob (item->deep_clone (), dst);
2371 2328
2372 return dst; 2329 return dst;
2373} 2330}
2374 2331
2375/* This returns the first object in who's inventory that 2332/* This returns the first object in who's inventory that
… …
2384 return tmp; 2341 return tmp;
2385 2342
2386 return 0; 2343 return 0;
2387} 2344}
2388 2345
2389/* If ob has a field named key, return the link from the list, 2346const shstr &
2390 * otherwise return NULL. 2347object::kv_get (const shstr &key) const
2391 *
2392 * key must be a passed in shared string - otherwise, this won't
2393 * do the desired thing.
2394 */
2395key_value *
2396get_ob_key_link (const object *ob, const char *key)
2397{ 2348{
2398 for (key_value *link = ob->key_values; link; link = link->next) 2349 for (key_value *kv = key_values; kv; kv = kv->next)
2399 if (link->key == key) 2350 if (kv->key == key)
2400 return link;
2401
2402 return 0;
2403}
2404
2405/*
2406 * Returns the value of op has an extra_field for key, or NULL.
2407 *
2408 * The argument doesn't need to be a shared string.
2409 *
2410 * The returned string is shared.
2411 */
2412const char *
2413get_ob_key_value (const object *op, const char *const key)
2414{
2415 key_value *link;
2416 shstr_cmp canonical_key (key);
2417
2418 if (!canonical_key)
2419 {
2420 /* 1. There being a field named key on any object
2421 * implies there'd be a shared string to find.
2422 * 2. Since there isn't, no object has this field.
2423 * 3. Therefore, *this* object doesn't have this field.
2424 */
2425 return 0;
2426 }
2427
2428 /* This is copied from get_ob_key_link() above -
2429 * only 4 lines, and saves the function call overhead.
2430 */
2431 for (link = op->key_values; link; link = link->next)
2432 if (link->key == canonical_key)
2433 return link->value; 2351 return kv->value;
2434 2352
2435 return 0; 2353 return shstr_null;
2436} 2354}
2437 2355
2438/* 2356void
2439 * Updates the canonical_key in op to value. 2357object::kv_set (const shstr &key, const shstr &value)
2440 *
2441 * canonical_key is a shared string (value doesn't have to be).
2442 *
2443 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2444 * keys.
2445 *
2446 * Returns TRUE on success.
2447 */
2448int
2449set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2450{ 2358{
2451 key_value *field = NULL, *last = NULL; 2359 for (key_value *kv = key_values; kv; kv = kv->next)
2452 2360 if (kv->key == key)
2453 for (field = op->key_values; field != NULL; field = field->next)
2454 {
2455 if (field->key != canonical_key)
2456 { 2361 {
2457 last = field; 2362 kv->value = value;
2458 continue; 2363 return;
2459 } 2364 }
2460 2365
2461 if (value) 2366 key_value *kv = new key_value;
2462 field->value = value; 2367
2463 else 2368 kv->next = key_values;
2369 kv->key = key;
2370 kv->value = value;
2371
2372 key_values = kv;
2373}
2374
2375void
2376object::kv_del (const shstr &key)
2377{
2378 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2379 if ((*kvp)->key == key)
2464 { 2380 {
2465 /* Basically, if the archetype has this key set, 2381 key_value *kv = *kvp;
2466 * we need to store the null value so when we save 2382 *kvp = (*kvp)->next;
2467 * it, we save the empty value so that when we load, 2383 delete kv;
2468 * we get this value back again. 2384 return;
2469 */
2470 if (get_ob_key_link (op->arch, canonical_key))
2471 field->value = 0;
2472 else
2473 {
2474 if (last)
2475 last->next = field->next;
2476 else
2477 op->key_values = field->next;
2478
2479 delete field;
2480 }
2481 } 2385 }
2482 return TRUE;
2483 }
2484 /* IF we get here, key doesn't exist */
2485
2486 /* No field, we'll have to add it. */
2487
2488 if (!add_key)
2489 return FALSE;
2490
2491 /* There isn't any good reason to store a null
2492 * value in the key/value list. If the archetype has
2493 * this key, then we should also have it, so shouldn't
2494 * be here. If user wants to store empty strings,
2495 * should pass in ""
2496 */
2497 if (value == NULL)
2498 return TRUE;
2499
2500 field = new key_value;
2501
2502 field->key = canonical_key;
2503 field->value = value;
2504 /* Usual prepend-addition. */
2505 field->next = op->key_values;
2506 op->key_values = field;
2507
2508 return TRUE;
2509}
2510
2511/*
2512 * Updates the key in op to value.
2513 *
2514 * If add_key is FALSE, this will only update existing keys,
2515 * and not add new ones.
2516 * In general, should be little reason FALSE is ever passed in for add_key
2517 *
2518 * Returns TRUE on success.
2519 */
2520int
2521set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2522{
2523 shstr key_ (key);
2524
2525 return set_ob_key_value_s (op, key_, value, add_key);
2526} 2386}
2527 2387
2528object::depth_iterator::depth_iterator (object *container) 2388object::depth_iterator::depth_iterator (object *container)
2529: iterator_base (container) 2389: iterator_base (container)
2530{ 2390{

Diff Legend

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