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.225 by root, Fri May 2 20:28:44 2008 UTC vs.
Revision 1.236 by root, Tue May 6 20:08:37 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 remove (); 608 dst->remove ();
612
613 *(object_copy *)this = src; 609 *(object_copy *)dst = *this;
614
615 flag [FLAG_REMOVED] = true; 610 dst->flag [FLAG_REMOVED] = true;
616 611
617 /* Copy over key_values, if any. */ 612 /* Copy over key_values, if any. */
618 if (src.key_values) 613 if (key_values)
619 { 614 {
620 key_value *tail = 0; 615 key_value *tail = 0;
621 key_values = 0; 616 dst->key_values = 0;
622 617
623 for (key_value *i = src.key_values; i; i = i->next) 618 for (key_value *i = key_values; i; i = i->next)
624 { 619 {
625 key_value *new_link = new key_value; 620 key_value *new_link = new key_value;
626 621
627 new_link->next = 0; 622 new_link->next = 0;
628 new_link->key = i->key; 623 new_link->key = i->key;
629 new_link->value = i->value; 624 new_link->value = i->value;
630 625
631 /* Try and be clever here, too. */ 626 /* Try and be clever here, too. */
632 if (!key_values) 627 if (!dst->key_values)
633 { 628 {
634 key_values = new_link; 629 dst->key_values = new_link;
635 tail = new_link; 630 tail = new_link;
636 } 631 }
637 else 632 else
638 { 633 {
639 tail->next = new_link; 634 tail->next = new_link;
640 tail = new_link; 635 tail = new_link;
641 } 636 }
642 } 637 }
643 } 638 }
644}
645
646/*
647 * copy_to first frees everything allocated by the dst object,
648 * and then copies the contents of itself into the second
649 * object, allocating what needs to be allocated. Basically, any
650 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
651 * if the first object is freed, the pointers in the new object
652 * will point at garbage.
653 */
654void
655object::copy_to (object *dst)
656{
657 *dst = *this;
658 639
659 if (speed < 0) 640 if (speed < 0)
660 dst->speed_left -= rndm (); 641 dst->speed_left -= rndm ();
661 642
662 dst->set_speed (dst->speed); 643 dst->set_speed (dst->speed);
… …
971 nodrop = 1; 952 nodrop = 1;
972 953
973 alloc (); 954 alloc ();
974 in_memory = MAP_ACTIVE; 955 in_memory = MAP_ACTIVE;
975 } 956 }
957
958 ~freed_map ()
959 {
960 destroy ();
961 }
976} freed_map; // freed objects are moved here to avoid crashes 962} freed_map; // freed objects are moved here to avoid crashes
977 963
978void 964void
979object::do_destroy () 965object::do_destroy ()
980{ 966{
… …
1071 esrv_del_item (pl->contr, count); 1057 esrv_del_item (pl->contr, count);
1072 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed 1058 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1073 1059
1074 adjust_weight (env, -total_weight ()); 1060 adjust_weight (env, -total_weight ());
1075 1061
1062 // make sure cmov optimisation is applicable
1076 *(above ? &above->below : &env->inv) = below; 1063 *(above ? &above->below : &env->inv) = below;
1064 *(below ? &below->above : &above ) = above; // &above is just a dummy
1077 1065
1078 if (below) 1066 above = 0;
1079 below->above = above; 1067 below = 0;
1068 env = 0;
1080 1069
1081 /* we set up values so that it could be inserted into 1070 /* we set up values so that it could be inserted into
1082 * the map, but we don't actually do that - it is up 1071 * the map, but we don't actually do that - it is up
1083 * to the caller to decide what we want to do. 1072 * to the caller to decide what we want to do.
1084 */ 1073 */
1085 map = env->map; 1074 map = env->map;
1086 x = env->x; 1075 x = env->x;
1087 y = env->y; 1076 y = env->y;
1088 above = 0;
1089 below = 0;
1090 env = 0;
1091 1077
1092 /* NO_FIX_PLAYER is set when a great many changes are being 1078 /* NO_FIX_PLAYER is set when a great many changes are being
1093 * made to players inventory. If set, avoiding the call 1079 * made to players inventory. If set, avoiding the call
1094 * to save cpu time. 1080 * to save cpu time.
1095 */ 1081 */
… …
1122 1108
1123 esrv_del_item (pl->contr, count); 1109 esrv_del_item (pl->contr, count);
1124 } 1110 }
1125 1111
1126 /* link the object above us */ 1112 /* link the object above us */
1127 if (above) 1113 // re-link, make sure compiler can easily use cmove
1128 above->below = below; 1114 *(above ? &above->below : &ms.top) = below;
1129 else 1115 *(below ? &below->above : &ms.bot) = above;
1130 ms.top = below; /* we were top, set new top */
1131
1132 /* Relink the object below us, if there is one */
1133 if (below)
1134 below->above = above;
1135 else
1136 {
1137 /* Nothing below, which means we need to relink map object for this space
1138 * use translated coordinates in case some oddness with map tiling is
1139 * evident
1140 */
1141 if (GET_MAP_OB (map, x, y) != this)
1142 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 ());
1143
1144 ms.bot = above; /* goes on above it. */
1145 }
1146 1116
1147 above = 0; 1117 above = 0;
1148 below = 0; 1118 below = 0;
1149 1119
1150 if (map->in_memory == MAP_SAVING) 1120 if (map->in_memory == MAP_SAVING)
… …
1160 * appropriately. 1130 * appropriately.
1161 */ 1131 */
1162 pl->close_container (); 1132 pl->close_container ();
1163 1133
1164 //TODO: the floorbox prev/next might need updating 1134 //TODO: the floorbox prev/next might need updating
1165 esrv_del_item (pl->contr, count); 1135 //esrv_del_item (pl->contr, count);
1136 //TODO: update floorbox to preserve ordering
1137 if (pl->contr->ns)
1138 pl->contr->ns->floorbox_update ();
1166 } 1139 }
1167 1140
1168 for (tmp = ms.bot; tmp; tmp = tmp->above) 1141 for (tmp = ms.bot; tmp; tmp = tmp->above)
1169 { 1142 {
1170 /* No point updating the players look faces if he is the object 1143 /* No point updating the players look faces if he is the object
… …
1304 * of areas of callers (eg, anything that uses find_free_spot would now 1277 * of areas of callers (eg, anything that uses find_free_spot would now
1305 * need extra work 1278 * need extra work
1306 */ 1279 */
1307 if (!xy_normalise (m, op->x, op->y)) 1280 if (!xy_normalise (m, op->x, op->y))
1308 { 1281 {
1309 op->destroy (1); 1282 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1310 return 0; 1283 return 0;
1311 } 1284 }
1312 1285
1313 if (object *more = op->more) 1286 if (object *more = op->more)
1314 if (!insert_ob_in_map (more, m, originator, flag)) 1287 if (!insert_ob_in_map (more, m, originator, flag))
… …
1468 1441
1469 op->map->dirty = true; 1442 op->map->dirty = true;
1470 1443
1471 if (object *pl = ms.player ()) 1444 if (object *pl = ms.player ())
1472 //TODO: the floorbox prev/next might need updating 1445 //TODO: the floorbox prev/next might need updating
1473 esrv_send_item (pl, op); 1446 //esrv_send_item (pl, op);
1447 //TODO: update floorbox to preserve ordering
1448 if (pl->contr->ns)
1449 pl->contr->ns->floorbox_update ();
1474 1450
1475 /* If this object glows, it may affect lighting conditions that are 1451 /* If this object glows, it may affect lighting conditions that are
1476 * visible to others on this map. But update_all_los is really 1452 * visible to others on this map. But update_all_los is really
1477 * an inefficient way to do this, as it means los for all players 1453 * an inefficient way to do this, as it means los for all players
1478 * on the map will get recalculated. The players could very well 1454 * on the map will get recalculated. The players could very well
… …
1598 } 1574 }
1599 else 1575 else
1600 { 1576 {
1601 decrease (nr); 1577 decrease (nr);
1602 1578
1603 object *op = object_create_clone (this); 1579 object *op = deep_clone ();
1604 op->nrof = nr; 1580 op->nrof = nr;
1605 return op; 1581 return op;
1606 } 1582 }
1607} 1583}
1608 1584
… …
1829 LOG (llevError, "Present_arch called outside map.\n"); 1805 LOG (llevError, "Present_arch called outside map.\n");
1830 return NULL; 1806 return NULL;
1831 } 1807 }
1832 1808
1833 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) 1809 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1834 if (tmp->arch == at) 1810 if (tmp->arch->archname == at->archname)
1835 return tmp; 1811 return tmp;
1836 1812
1837 return NULL; 1813 return NULL;
1838} 1814}
1839 1815
… …
1903 * The first matching object is returned, or NULL if none. 1879 * The first matching object is returned, or NULL if none.
1904 */ 1880 */
1905object * 1881object *
1906present_arch_in_ob (const archetype *at, const object *op) 1882present_arch_in_ob (const archetype *at, const object *op)
1907{ 1883{
1908 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1884 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1909 if (tmp->arch == at) 1885 if (tmp->arch->archname == at->archname)
1910 return tmp; 1886 return tmp;
1911 1887
1912 return NULL; 1888 return NULL;
1913} 1889}
1914 1890
… …
2323 2299
2324/* 2300/*
2325 * create clone from object to another 2301 * create clone from object to another
2326 */ 2302 */
2327object * 2303object *
2328object_create_clone (object *asrc) 2304object::deep_clone ()
2329{ 2305{
2306 assert (("deep_clone called on non-head object", is_head ()));
2307
2330 object *dst = 0; 2308 object *dst = clone ();
2331 2309
2332 if (!asrc)
2333 return 0;
2334
2335 object *src = asrc->head_ ();
2336
2337 object *prev = 0; 2310 object *prev = dst;
2338 for (object *part = src; part; part = part->more) 2311 for (object *part = this->more; part; part = part->more)
2339 { 2312 {
2340 object *tmp = part->clone (); 2313 object *tmp = part->clone ();
2341
2342 tmp->x -= src->x;
2343 tmp->y -= src->y;
2344
2345 if (!part->head)
2346 {
2347 dst = tmp;
2348 tmp->head = 0;
2349 }
2350 else
2351 tmp->head = dst; 2314 tmp->head = dst;
2352
2353 tmp->more = 0;
2354
2355 if (prev)
2356 prev->more = tmp; 2315 prev->more = tmp;
2357
2358 prev = tmp; 2316 prev = tmp;
2359 } 2317 }
2360 2318
2361 for (object *item = src->inv; item; item = item->below) 2319 for (object *item = inv; item; item = item->below)
2362 insert_ob_in_ob (object_create_clone (item), dst); 2320 insert_ob_in_ob (item->deep_clone (), dst);
2363 2321
2364 return dst; 2322 return dst;
2365} 2323}
2366 2324
2367/* This returns the first object in who's inventory that 2325/* This returns the first object in who's inventory that
… …
2376 return tmp; 2334 return tmp;
2377 2335
2378 return 0; 2336 return 0;
2379} 2337}
2380 2338
2381/* If ob has a field named key, return the link from the list, 2339const shstr &
2382 * otherwise return NULL. 2340object::kv_get (const shstr &key) const
2383 *
2384 * key must be a passed in shared string - otherwise, this won't
2385 * do the desired thing.
2386 */
2387key_value *
2388get_ob_key_link (const object *ob, const char *key)
2389{ 2341{
2390 for (key_value *link = ob->key_values; link; link = link->next) 2342 for (key_value *kv = key_values; kv; kv = kv->next)
2391 if (link->key == key) 2343 if (kv->key == key)
2392 return link;
2393
2394 return 0;
2395}
2396
2397/*
2398 * Returns the value of op has an extra_field for key, or NULL.
2399 *
2400 * The argument doesn't need to be a shared string.
2401 *
2402 * The returned string is shared.
2403 */
2404const char *
2405get_ob_key_value (const object *op, const char *const key)
2406{
2407 key_value *link;
2408 shstr_cmp canonical_key (key);
2409
2410 if (!canonical_key)
2411 {
2412 /* 1. There being a field named key on any object
2413 * implies there'd be a shared string to find.
2414 * 2. Since there isn't, no object has this field.
2415 * 3. Therefore, *this* object doesn't have this field.
2416 */
2417 return 0;
2418 }
2419
2420 /* This is copied from get_ob_key_link() above -
2421 * only 4 lines, and saves the function call overhead.
2422 */
2423 for (link = op->key_values; link; link = link->next)
2424 if (link->key == canonical_key)
2425 return link->value; 2344 return kv->value;
2426 2345
2427 return 0; 2346 return shstr_null;
2428} 2347}
2429 2348
2430/* 2349void
2431 * Updates the canonical_key in op to value. 2350object::kv_set (const shstr &key, const shstr &value)
2432 *
2433 * canonical_key is a shared string (value doesn't have to be).
2434 *
2435 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2436 * keys.
2437 *
2438 * Returns TRUE on success.
2439 */
2440int
2441set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2442{ 2351{
2443 key_value *field = NULL, *last = NULL; 2352 for (key_value *kv = key_values; kv; kv = kv->next)
2444 2353 if (kv->key == key)
2445 for (field = op->key_values; field != NULL; field = field->next)
2446 {
2447 if (field->key != canonical_key)
2448 { 2354 {
2449 last = field; 2355 kv->value = value;
2450 continue; 2356 return;
2451 } 2357 }
2452 2358
2453 if (value) 2359 key_value *kv = new key_value;
2454 field->value = value; 2360
2455 else 2361 kv->next = key_values;
2362 kv->key = key;
2363 kv->value = value;
2364
2365 key_values = kv;
2366}
2367
2368void
2369object::kv_del (const shstr &key)
2370{
2371 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2372 if ((*kvp)->key == key)
2456 { 2373 {
2457 /* Basically, if the archetype has this key set, 2374 key_value *kv = *kvp;
2458 * we need to store the null value so when we save 2375 *kvp = (*kvp)->next;
2459 * it, we save the empty value so that when we load, 2376 delete kv;
2460 * we get this value back again. 2377 return;
2461 */
2462 if (get_ob_key_link (op->arch, canonical_key))
2463 field->value = 0;
2464 else
2465 {
2466 if (last)
2467 last->next = field->next;
2468 else
2469 op->key_values = field->next;
2470
2471 delete field;
2472 }
2473 } 2378 }
2474 return TRUE;
2475 }
2476 /* IF we get here, key doesn't exist */
2477
2478 /* No field, we'll have to add it. */
2479
2480 if (!add_key)
2481 return FALSE;
2482
2483 /* There isn't any good reason to store a null
2484 * value in the key/value list. If the archetype has
2485 * this key, then we should also have it, so shouldn't
2486 * be here. If user wants to store empty strings,
2487 * should pass in ""
2488 */
2489 if (value == NULL)
2490 return TRUE;
2491
2492 field = new key_value;
2493
2494 field->key = canonical_key;
2495 field->value = value;
2496 /* Usual prepend-addition. */
2497 field->next = op->key_values;
2498 op->key_values = field;
2499
2500 return TRUE;
2501}
2502
2503/*
2504 * Updates the key in op to value.
2505 *
2506 * If add_key is FALSE, this will only update existing keys,
2507 * and not add new ones.
2508 * In general, should be little reason FALSE is ever passed in for add_key
2509 *
2510 * Returns TRUE on success.
2511 */
2512int
2513set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2514{
2515 shstr key_ (key);
2516
2517 return set_ob_key_value_s (op, key_, value, add_key);
2518} 2379}
2519 2380
2520object::depth_iterator::depth_iterator (object *container) 2381object::depth_iterator::depth_iterator (object *container)
2521: iterator_base (container) 2382: iterator_base (container)
2522{ 2383{

Diff Legend

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