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.228 by root, Sat May 3 11:14:50 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 *
… …
603 } 589 }
604 590
605 op->key_values = 0; 591 op->key_values = 0;
606} 592}
607 593
608object & 594/*
609object::operator =(const object &src) 595 * copy_to first frees everything allocated by the dst object,
596 * and then copies the contents of itself into the second
597 * object, allocating what needs to be allocated. Basically, any
598 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
599 * if the first object is freed, the pointers in the new object
600 * will point at garbage.
601 */
602void
603object::copy_to (object *dst)
610{ 604{
611 bool is_freed = flag [FLAG_FREED]; 605 dst->remove ();
612 bool is_removed = flag [FLAG_REMOVED];
613
614 *(object_copy *)this = src; 606 *(object_copy *)dst = *this;
615
616 flag [FLAG_FREED] = is_freed;
617 flag [FLAG_REMOVED] = is_removed; 607 dst->flag [FLAG_REMOVED] = true;
618 608
619 /* Copy over key_values, if any. */ 609 /* Copy over key_values, if any. */
620 if (src.key_values) 610 if (key_values)
621 { 611 {
622 key_value *tail = 0; 612 key_value *tail = 0;
623 key_values = 0; 613 dst->key_values = 0;
624 614
625 for (key_value *i = src.key_values; i; i = i->next) 615 for (key_value *i = key_values; i; i = i->next)
626 { 616 {
627 key_value *new_link = new key_value; 617 key_value *new_link = new key_value;
628 618
629 new_link->next = 0; 619 new_link->next = 0;
630 new_link->key = i->key; 620 new_link->key = i->key;
631 new_link->value = i->value; 621 new_link->value = i->value;
632 622
633 /* Try and be clever here, too. */ 623 /* Try and be clever here, too. */
634 if (!key_values) 624 if (!dst->key_values)
635 { 625 {
636 key_values = new_link; 626 dst->key_values = new_link;
637 tail = new_link; 627 tail = new_link;
638 } 628 }
639 else 629 else
640 { 630 {
641 tail->next = new_link; 631 tail->next = new_link;
642 tail = new_link; 632 tail = new_link;
643 } 633 }
644 } 634 }
645 } 635 }
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 636
661 if (speed < 0) 637 if (speed < 0)
662 dst->speed_left -= rndm (); 638 dst->speed_left -= rndm ();
663 639
664 dst->set_speed (dst->speed); 640 dst->set_speed (dst->speed);
… …
686object * 662object *
687object::clone () 663object::clone ()
688{ 664{
689 object *neu = create (); 665 object *neu = create ();
690 copy_to (neu); 666 copy_to (neu);
667 neu->map = map; // not copied by copy_to
691 return neu; 668 return neu;
692} 669}
693 670
694/* 671/*
695 * If an object with the IS_TURNABLE() flag needs to be turned due 672 * If an object with the IS_TURNABLE() flag needs to be turned due
… …
959 object *op = new object; 936 object *op = new object;
960 op->link (); 937 op->link ();
961 return op; 938 return op;
962} 939}
963 940
941static struct freed_map : maptile
942{
943 freed_map ()
944 {
945 path = "<freed objects map>";
946 name = "/internal/freed_objects_map";
947 width = 3;
948 height = 3;
949 nodrop = 1;
950
951 alloc ();
952 in_memory = MAP_ACTIVE;
953 }
954} freed_map; // freed objects are moved here to avoid crashes
955
964void 956void
965object::do_destroy () 957object::do_destroy ()
966{ 958{
967 if (flag [FLAG_IS_LINKED]) 959 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 960 remove_button_link (this);
… …
978 unlink (); 970 unlink ();
979 971
980 flag [FLAG_FREED] = 1; 972 flag [FLAG_FREED] = 1;
981 973
982 // hack to ensure that freed objects still have a valid map 974 // 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; 975 map = &freed_map;
1001 x = 1; 976 x = 1;
1002 y = 1; 977 y = 1;
1003 }
1004 978
1005 if (more) 979 if (more)
1006 { 980 {
1007 more->destroy (); 981 more->destroy ();
1008 more = 0; 982 more = 0;
… …
1025 999
1026 if (!is_head () && !head->destroyed ()) 1000 if (!is_head () && !head->destroyed ())
1027 { 1001 {
1028 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1002 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1029 head->destroy (destroy_inventory); 1003 head->destroy (destroy_inventory);
1004 return;
1030 } 1005 }
1031 1006
1032 destroy_inv (!destroy_inventory); 1007 destroy_inv (!destroy_inventory);
1033 1008
1034 if (is_head ()) 1009 if (is_head ())
… …
1163 * appropriately. 1138 * appropriately.
1164 */ 1139 */
1165 pl->close_container (); 1140 pl->close_container ();
1166 1141
1167 //TODO: the floorbox prev/next might need updating 1142 //TODO: the floorbox prev/next might need updating
1168 esrv_del_item (pl->contr, count); 1143 //esrv_del_item (pl->contr, count);
1144 //TODO: update floorbox to preserve ordering
1145 if (pl->contr->ns)
1146 pl->contr->ns->floorbox_update ();
1169 } 1147 }
1170 1148
1171 for (tmp = ms.bot; tmp; tmp = tmp->above) 1149 for (tmp = ms.bot; tmp; tmp = tmp->above)
1172 { 1150 {
1173 /* No point updating the players look faces if he is the object 1151 /* No point updating the players look faces if he is the object
… …
1471 1449
1472 op->map->dirty = true; 1450 op->map->dirty = true;
1473 1451
1474 if (object *pl = ms.player ()) 1452 if (object *pl = ms.player ())
1475 //TODO: the floorbox prev/next might need updating 1453 //TODO: the floorbox prev/next might need updating
1476 esrv_send_item (pl, op); 1454 //esrv_send_item (pl, op);
1455 //TODO: update floorbox to preserve ordering
1456 if (pl->contr->ns)
1457 pl->contr->ns->floorbox_update ();
1477 1458
1478 /* If this object glows, it may affect lighting conditions that are 1459 /* If this object glows, it may affect lighting conditions that are
1479 * visible to others on this map. But update_all_los is really 1460 * 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 1461 * 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 1462 * on the map will get recalculated. The players could very well
… …
2328 * create clone from object to another 2309 * create clone from object to another
2329 */ 2310 */
2330object * 2311object *
2331object_create_clone (object *asrc) 2312object_create_clone (object *asrc)
2332{ 2313{
2333 object *dst = 0, *tmp, *src, *prev, *item; 2314 object *dst = 0;
2334 2315
2335 if (!asrc) 2316 if (!asrc)
2336 return 0; 2317 return 0;
2337 2318
2338 src = asrc->head_ (); 2319 object *src = asrc->head_ ();
2339 2320
2340 prev = 0; 2321 object *prev = 0;
2341 for (object *part = src; part; part = part->more) 2322 for (object *part = src; part; part = part->more)
2342 { 2323 {
2343 tmp = part->clone (); 2324 object *tmp = part->clone ();
2325
2344 tmp->x -= src->x; 2326 tmp->x -= src->x;
2345 tmp->y -= src->y; 2327 tmp->y -= src->y;
2346 2328
2347 if (!part->head) 2329 if (!part->head)
2348 { 2330 {
… …
2358 prev->more = tmp; 2340 prev->more = tmp;
2359 2341
2360 prev = tmp; 2342 prev = tmp;
2361 } 2343 }
2362 2344
2363 for (item = src->inv; item; item = item->below) 2345 for (object *item = src->inv; item; item = item->below)
2364 insert_ob_in_ob (object_create_clone (item), dst); 2346 insert_ob_in_ob (object_create_clone (item), dst);
2365 2347
2366 return dst; 2348 return dst;
2367} 2349}
2368 2350
… …
2378 return tmp; 2360 return tmp;
2379 2361
2380 return 0; 2362 return 0;
2381} 2363}
2382 2364
2383/* If ob has a field named key, return the link from the list, 2365const shstr &
2384 * otherwise return NULL. 2366object::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{ 2367{
2392 for (key_value *link = ob->key_values; link; link = link->next) 2368 for (key_value *kv = key_values; kv; kv = kv->next)
2393 if (link->key == key) 2369 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; 2370 return kv->value;
2428 2371
2429 return 0; 2372 return shstr_null;
2430} 2373}
2431 2374
2432/* 2375void
2433 * Updates the canonical_key in op to value. 2376object::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{ 2377{
2445 key_value *field = NULL, *last = NULL; 2378 for (key_value *kv = key_values; kv; kv = kv->next)
2446 2379 if (kv->key == key)
2447 for (field = op->key_values; field != NULL; field = field->next)
2448 {
2449 if (field->key != canonical_key)
2450 { 2380 {
2451 last = field; 2381 kv->value = value;
2452 continue; 2382 return;
2453 } 2383 }
2454 2384
2455 if (value) 2385 key_value *kv = new key_value;
2456 field->value = value; 2386
2457 else 2387 kv->next = key_values;
2388 kv->key = key;
2389 kv->value = value;
2390
2391 key_values = kv;
2392}
2393
2394void
2395object::kv_del (const shstr &key)
2396{
2397 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2398 if ((*kvp)->key == key)
2458 { 2399 {
2459 /* Basically, if the archetype has this key set, 2400 key_value *kv = *kvp;
2460 * we need to store the null value so when we save 2401 *kvp = (*kvp)->next;
2461 * it, we save the empty value so that when we load, 2402 delete kv;
2462 * we get this value back again. 2403 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 } 2404 }
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} 2405}
2521 2406
2522object::depth_iterator::depth_iterator (object *container) 2407object::depth_iterator::depth_iterator (object *container)
2523: iterator_base (container) 2408: iterator_base (container)
2524{ 2409{

Diff Legend

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