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.223 by root, Wed Apr 30 08:29:31 2008 UTC vs.
Revision 1.251 by root, Sun Jul 20 16:56:34 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 *
… …
220 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 206 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
221 207
222 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 208 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
223 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 209 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
224 210
225 if (ob1->arch->name != ob2->arch->name 211 if (ob1->arch->archname != ob2->arch->archname
226 || ob1->name != ob2->name 212 || ob1->name != ob2->name
227 || ob1->title != ob2->title 213 || ob1->title != ob2->title
228 || ob1->msg != ob2->msg 214 || ob1->msg != ob2->msg
229 || ob1->weight != ob2->weight 215 || ob1->weight != ob2->weight
230 || ob1->attacktype != ob2->attacktype 216 || ob1->attacktype != ob2->attacktype
231 || ob1->magic != ob2->magic 217 || ob1->magic != ob2->magic
232 || ob1->slaying != ob2->slaying 218 || ob1->slaying != ob2->slaying
233 || ob1->skill != ob2->skill 219 || ob1->skill != ob2->skill
234 || ob1->value != ob2->value 220 || ob1->value != ob2->value
235 || ob1->animation_id != ob2->animation_id 221 || ob1->animation_id != ob2->animation_id
222 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
236 || ob1->client_type != ob2->client_type 223 || ob1->client_type != ob2->client_type
237 || ob1->materialname != ob2->materialname 224 || ob1->materialname != ob2->materialname
238 || ob1->lore != ob2->lore 225 || ob1->lore != ob2->lore
239 || ob1->subtype != ob2->subtype 226 || ob1->subtype != ob2->subtype
240 || ob1->move_type != ob2->move_type 227 || ob1->move_type != ob2->move_type
… …
358 else 345 else
359 { 346 {
360 // maybe there is a player standing on the same mapspace 347 // maybe there is a player standing on the same mapspace
361 // this will catch the case where "this" is a player 348 // this will catch the case where "this" is a player
362 if (object *pl = ms ().player ()) 349 if (object *pl = ms ().player ())
350 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look)
363 if (!pl->container || this == pl->container) 351 || this == pl->container)
364 return pl; 352 return pl;
365 } 353 }
366 } 354 }
367 355
368 return 0; 356 return 0;
369} 357}
370 358
371// adjust weight per container type ("of holding") 359// adjust weight per container type ("of holding")
372static sint32 360static sint32
373weight_adjust (object *op, sint32 weight) 361weight_adjust_for (object *op, sint32 weight)
374{ 362{
375 return op->type == CONTAINER 363 return op->type == CONTAINER
376 ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) 364 ? lerp (weight, 0, 100, 0, 100 - op->stats.Str)
377 : weight; 365 : weight;
378} 366}
… …
384static void 372static void
385adjust_weight (object *op, sint32 weight) 373adjust_weight (object *op, sint32 weight)
386{ 374{
387 while (op) 375 while (op)
388 { 376 {
377 // adjust by actual difference to account for rounding errors
378 // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct
389 weight = weight_adjust (op, weight); 379 weight = weight_adjust_for (op, op->carrying)
380 - weight_adjust_for (op, op->carrying - weight);
390 381
391 if (!weight) 382 if (!weight)
392 return; 383 return;
393 384
394 op->carrying += weight; 385 op->carrying += weight;
… …
417 op->update_weight (); 408 op->update_weight ();
418 409
419 sum += op->total_weight (); 410 sum += op->total_weight ();
420 } 411 }
421 412
422 sum = weight_adjust (this, sum); 413 sum = weight_adjust_for (this, sum);
423 414
424 if (sum != carrying) 415 if (sum != carrying)
425 { 416 {
426 carrying = sum; 417 carrying = sum;
427 418
… …
489 */ 480 */
490object * 481object *
491find_object_name (const char *str) 482find_object_name (const char *str)
492{ 483{
493 shstr_cmp str_ (str); 484 shstr_cmp str_ (str);
494 object *op;
495 485
486 if (str_)
496 for_all_objects (op) 487 for_all_objects (op)
497 if (op->name == str_) 488 if (op->name == str_)
498 break; 489 return op;
499 490
500 return op; 491 return 0;
501} 492}
502 493
503/* 494/*
504 * Sets the owner and sets the skill and exp pointers to owner's current 495 * Sets the owner and sets the skill and exp pointers to owner's current
505 * skill and experience objects. 496 * skill and experience objects.
… …
603 } 594 }
604 595
605 op->key_values = 0; 596 op->key_values = 0;
606} 597}
607 598
608object & 599/*
609object::operator =(const object &src) 600 * copy_to first frees everything allocated by the dst object,
601 * and then copies the contents of itself into the second
602 * object, allocating what needs to be allocated. Basically, any
603 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
604 * if the first object is freed, the pointers in the new object
605 * will point at garbage.
606 */
607void
608object::copy_to (object *dst)
610{ 609{
611 bool is_freed = flag [FLAG_FREED]; 610 dst->remove ();
612 bool is_removed = flag [FLAG_REMOVED];
613
614 *(object_copy *)this = src; 611 *(object_copy *)dst = *this;
615
616 flag [FLAG_FREED] = is_freed;
617 flag [FLAG_REMOVED] = is_removed; 612 dst->flag [FLAG_REMOVED] = true;
618 613
619 /* Copy over key_values, if any. */ 614 /* Copy over key_values, if any. */
620 if (src.key_values) 615 if (key_values)
621 { 616 {
622 key_value *tail = 0; 617 key_value *tail = 0;
623 key_values = 0; 618 dst->key_values = 0;
624 619
625 for (key_value *i = src.key_values; i; i = i->next) 620 for (key_value *i = key_values; i; i = i->next)
626 { 621 {
627 key_value *new_link = new key_value; 622 key_value *new_link = new key_value;
628 623
629 new_link->next = 0; 624 new_link->next = 0;
630 new_link->key = i->key; 625 new_link->key = i->key;
631 new_link->value = i->value; 626 new_link->value = i->value;
632 627
633 /* Try and be clever here, too. */ 628 /* Try and be clever here, too. */
634 if (!key_values) 629 if (!dst->key_values)
635 { 630 {
636 key_values = new_link; 631 dst->key_values = new_link;
637 tail = new_link; 632 tail = new_link;
638 } 633 }
639 else 634 else
640 { 635 {
641 tail->next = new_link; 636 tail->next = new_link;
642 tail = new_link; 637 tail = new_link;
643 } 638 }
644 } 639 }
645 } 640 }
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 641
661 if (speed < 0) 642 if (speed < 0)
662 dst->speed_left -= rndm (); 643 dst->speed_left -= rndm ();
663 644
664 dst->set_speed (dst->speed); 645 dst->set_speed (dst->speed);
… …
686object * 667object *
687object::clone () 668object::clone ()
688{ 669{
689 object *neu = create (); 670 object *neu = create ();
690 copy_to (neu); 671 copy_to (neu);
672 neu->map = map; // not copied by copy_to
691 return neu; 673 return neu;
692} 674}
693 675
694/* 676/*
695 * If an object with the IS_TURNABLE() flag needs to be turned due 677 * If an object with the IS_TURNABLE() flag needs to be turned due
… …
924 * drop on that space. 906 * drop on that space.
925 */ 907 */
926 if (!drop_to_ground 908 if (!drop_to_ground
927 || !map 909 || !map
928 || map->in_memory != MAP_ACTIVE 910 || map->in_memory != MAP_ACTIVE
929 || map->nodrop 911 || map->no_drop
930 || ms ().move_block == MOVE_ALL) 912 || ms ().move_block == MOVE_ALL)
931 { 913 {
932 while (inv) 914 while (inv)
933 {
934 inv->destroy_inv (false);
935 inv->destroy (); 915 inv->destroy (true);
936 }
937 } 916 }
938 else 917 else
939 { /* Put objects in inventory onto this space */ 918 { /* Put objects in inventory onto this space */
940 while (inv) 919 while (inv)
941 { 920 {
… …
963 942
964static struct freed_map : maptile 943static struct freed_map : maptile
965{ 944{
966 freed_map () 945 freed_map ()
967 { 946 {
968 path = "<freed objects map>"; 947 path = "<freed objects map>";
969 name = "/internal/freed_objects_map"; 948 name = "/internal/freed_objects_map";
970 width = 3; 949 width = 3;
971 height = 3; 950 height = 3;
972 nodrop = 1; 951 no_drop = 1;
952 no_reset = 1;
973 953
974 alloc (); 954 alloc ();
975 in_memory = MAP_ACTIVE; 955 in_memory = MAP_ACTIVE;
956 }
957
958 ~freed_map ()
959 {
960 destroy ();
976 } 961 }
977} freed_map; // freed objects are moved here to avoid crashes 962} freed_map; // freed objects are moved here to avoid crashes
978 963
979void 964void
980object::do_destroy () 965object::do_destroy ()
… …
1071 if (object *pl = visible_to ()) 1056 if (object *pl = visible_to ())
1072 esrv_del_item (pl->contr, count); 1057 esrv_del_item (pl->contr, count);
1073 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
1074 1059
1075 adjust_weight (env, -total_weight ()); 1060 adjust_weight (env, -total_weight ());
1076
1077 *(above ? &above->below : &env->inv) = below;
1078
1079 if (below)
1080 below->above = above;
1081 1061
1082 /* we set up values so that it could be inserted into 1062 /* we set up values so that it could be inserted into
1083 * the map, but we don't actually do that - it is up 1063 * the map, but we don't actually do that - it is up
1084 * to the caller to decide what we want to do. 1064 * to the caller to decide what we want to do.
1085 */ 1065 */
1086 map = env->map; 1066 map = env->map;
1087 x = env->x; 1067 x = env->x;
1088 y = env->y; 1068 y = env->y;
1069
1070 // make sure cmov optimisation is applicable
1071 *(above ? &above->below : &env->inv) = below;
1072 *(below ? &below->above : &above ) = above; // &above is just a dummy
1073
1089 above = 0; 1074 above = 0;
1090 below = 0; 1075 below = 0;
1091 env = 0; 1076 env = 0;
1092 1077
1093 /* 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
… …
1123 1108
1124 esrv_del_item (pl->contr, count); 1109 esrv_del_item (pl->contr, count);
1125 } 1110 }
1126 1111
1127 /* link the object above us */ 1112 /* link the object above us */
1128 if (above) 1113 // re-link, make sure compiler can easily use cmove
1129 above->below = below; 1114 *(above ? &above->below : &ms.top) = below;
1130 else 1115 *(below ? &below->above : &ms.bot) = above;
1131 ms.top = below; /* we were top, set new top */
1132
1133 /* Relink the object below us, if there is one */
1134 if (below)
1135 below->above = above;
1136 else
1137 {
1138 /* Nothing below, which means we need to relink map object for this space
1139 * use translated coordinates in case some oddness with map tiling is
1140 * evident
1141 */
1142 if (GET_MAP_OB (map, x, y) != this)
1143 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 ());
1144
1145 ms.bot = above; /* goes on above it. */
1146 }
1147 1116
1148 above = 0; 1117 above = 0;
1149 below = 0; 1118 below = 0;
1150 1119
1151 if (map->in_memory == MAP_SAVING) 1120 if (map->in_memory == MAP_SAVING)
… …
1161 * appropriately. 1130 * appropriately.
1162 */ 1131 */
1163 pl->close_container (); 1132 pl->close_container ();
1164 1133
1165 //TODO: the floorbox prev/next might need updating 1134 //TODO: the floorbox prev/next might need updating
1166 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 ();
1167 } 1139 }
1168 1140
1169 for (tmp = ms.bot; tmp; tmp = tmp->above) 1141 for (tmp = ms.bot; tmp; tmp = tmp->above)
1170 { 1142 {
1171 /* 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
… …
1263 * job preparing multi-part monsters. 1235 * job preparing multi-part monsters.
1264 */ 1236 */
1265object * 1237object *
1266insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1238insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1267{ 1239{
1240 op->remove ();
1241
1268 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1242 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1269 { 1243 {
1270 tmp->x = x + tmp->arch->x; 1244 tmp->x = x + tmp->arch->x;
1271 tmp->y = y + tmp->arch->y; 1245 tmp->y = y + tmp->arch->y;
1272 } 1246 }
… …
1295 * just 'op' otherwise 1269 * just 'op' otherwise
1296 */ 1270 */
1297object * 1271object *
1298insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1272insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1299{ 1273{
1300 assert (!op->flag [FLAG_FREED]); 1274 if (op->is_on_map ())
1275 {
1276 LOG (llevError, "insert_ob_in_map called for object already on map");
1277 abort ();
1278 }
1301 1279
1280 if (op->env)
1281 {
1282 LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1302 op->remove (); 1283 op->remove ();
1284 }
1285
1286 if (op->face && !face_info (op->face))//D TODO: remove soon
1287 {//D
1288 LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D
1289 op->face = 1;//D
1290 }//D
1303 1291
1304 /* Ideally, the caller figures this out. However, it complicates a lot 1292 /* Ideally, the caller figures this out. However, it complicates a lot
1305 * 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
1306 * need extra work 1294 * need extra work
1307 */ 1295 */
1308 if (!xy_normalise (m, op->x, op->y)) 1296 if (!xy_normalise (m, op->x, op->y))
1309 { 1297 {
1310 op->destroy (1); 1298 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found
1311 return 0; 1299 return 0;
1312 } 1300 }
1313 1301
1314 if (object *more = op->more) 1302 if (object *more = op->more)
1315 if (!insert_ob_in_map (more, m, originator, flag)) 1303 if (!insert_ob_in_map (more, m, originator, flag))
… …
1324 */ 1312 */
1325 if (op->nrof && !(flag & INS_NO_MERGE)) 1313 if (op->nrof && !(flag & INS_NO_MERGE))
1326 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 1314 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1327 if (object::can_merge (op, tmp)) 1315 if (object::can_merge (op, tmp))
1328 { 1316 {
1329 // TODO: we atcually want to update tmp, not op, 1317 // TODO: we actually want to update tmp, not op,
1330 // but some caller surely breaks when we return tmp 1318 // but some caller surely breaks when we return tmp
1331 // from here :/ 1319 // from here :/
1332 op->nrof += tmp->nrof; 1320 op->nrof += tmp->nrof;
1333 tmp->destroy (1); 1321 tmp->destroy (1);
1334 } 1322 }
… …
1345 { 1333 {
1346 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1334 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1347 abort (); 1335 abort ();
1348 } 1336 }
1349 1337
1338 if (!originator->is_on_map ())
1339 LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1340 op->debug_desc (), originator->debug_desc ());
1341
1350 op->above = originator; 1342 op->above = originator;
1351 op->below = originator->below; 1343 op->below = originator->below;
1352
1353 if (op->below)
1354 op->below->above = op;
1355 else
1356 ms.bot = op;
1357
1358 /* since *below* originator, no need to update top */
1359 originator->below = op; 1344 originator->below = op;
1345
1346 *(op->below ? &op->below->above : &ms.bot) = op;
1360 } 1347 }
1361 else 1348 else
1362 { 1349 {
1363 object *top, *floor = NULL; 1350 object *floor = 0;
1364 1351 object *top = ms.top;
1365 top = ms.bot;
1366 1352
1367 /* If there are other objects, then */ 1353 /* If there are other objects, then */
1368 if (top) 1354 if (top)
1369 { 1355 {
1370 object *last = 0;
1371
1372 /* 1356 /*
1373 * If there are multiple objects on this space, we do some trickier handling. 1357 * If there are multiple objects on this space, we do some trickier handling.
1374 * We've already dealt with merging if appropriate. 1358 * We've already dealt with merging if appropriate.
1375 * Generally, we want to put the new object on top. But if 1359 * Generally, we want to put the new object on top. But if
1376 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last 1360 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
… …
1379 * once we get to them. This reduces the need to traverse over all of 1363 * once we get to them. This reduces the need to traverse over all of
1380 * them when adding another one - this saves quite a bit of cpu time 1364 * them when adding another one - this saves quite a bit of cpu time
1381 * when lots of spells are cast in one area. Currently, it is presumed 1365 * when lots of spells are cast in one area. Currently, it is presumed
1382 * that flying non pickable objects are spell objects. 1366 * that flying non pickable objects are spell objects.
1383 */ 1367 */
1384 for (top = ms.bot; top; top = top->above) 1368 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1385 { 1369 {
1386 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1370 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1387 floor = top; 1371 floor = tmp;
1388 1372
1389 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1373 if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1390 { 1374 {
1391 /* We insert above top, so we want this object below this */ 1375 /* We insert above top, so we want this object below this */
1392 top = top->below; 1376 top = tmp->below;
1393 break; 1377 break;
1394 } 1378 }
1395 1379
1396 last = top; 1380 top = tmp;
1397 } 1381 }
1398
1399 /* Don't want top to be NULL, so set it to the last valid object */
1400 top = last;
1401 1382
1402 /* We let update_position deal with figuring out what the space 1383 /* We let update_position deal with figuring out what the space
1403 * looks like instead of lots of conditions here. 1384 * looks like instead of lots of conditions here.
1404 * makes things faster, and effectively the same result. 1385 * makes things faster, and effectively the same result.
1405 */ 1386 */
… …
1412 */ 1393 */
1413 if (!(flag & INS_ON_TOP) 1394 if (!(flag & INS_ON_TOP)
1414 && ms.flags () & P_BLOCKSVIEW 1395 && ms.flags () & P_BLOCKSVIEW
1415 && (op->face && !faces [op->face].visibility)) 1396 && (op->face && !faces [op->face].visibility))
1416 { 1397 {
1398 object *last;
1399
1417 for (last = top; last != floor; last = last->below) 1400 for (last = top; last != floor; last = last->below)
1418 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1401 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1419 break; 1402 break;
1420 1403
1421 /* Check to see if we found the object that blocks view, 1404 /* Check to see if we found the object that blocks view,
… …
1429 } /* If objects on this space */ 1412 } /* If objects on this space */
1430 1413
1431 if (flag & INS_ABOVE_FLOOR_ONLY) 1414 if (flag & INS_ABOVE_FLOOR_ONLY)
1432 top = floor; 1415 top = floor;
1433 1416
1434 /* Top is the object that our object (op) is going to get inserted above. 1417 // insert object above top, or bottom-most if top = 0
1435 */
1436
1437 /* First object on this space */
1438 if (!top) 1418 if (!top)
1439 { 1419 {
1420 op->below = 0;
1440 op->above = ms.bot; 1421 op->above = ms.bot;
1441
1442 if (op->above)
1443 op->above->below = op;
1444
1445 op->below = 0;
1446 ms.bot = op; 1422 ms.bot = op;
1423
1424 *(op->above ? &op->above->below : &ms.top) = op;
1447 } 1425 }
1448 else 1426 else
1449 { /* get inserted into the stack above top */ 1427 {
1450 op->above = top->above; 1428 op->above = top->above;
1451
1452 if (op->above)
1453 op->above->below = op; 1429 top->above = op;
1454 1430
1455 op->below = top; 1431 op->below = top;
1456 top->above = op; 1432 *(op->above ? &op->above->below : &ms.top) = op;
1457 } 1433 }
1458 1434 }
1459 if (!op->above)
1460 ms.top = op;
1461 } /* else not INS_BELOW_ORIGINATOR */
1462 1435
1463 if (op->type == PLAYER) 1436 if (op->type == PLAYER)
1464 { 1437 {
1465 op->contr->do_los = 1; 1438 op->contr->do_los = 1;
1466 ++op->map->players; 1439 ++op->map->players;
… …
1469 1442
1470 op->map->dirty = true; 1443 op->map->dirty = true;
1471 1444
1472 if (object *pl = ms.player ()) 1445 if (object *pl = ms.player ())
1473 //TODO: the floorbox prev/next might need updating 1446 //TODO: the floorbox prev/next might need updating
1474 esrv_send_item (pl, op); 1447 //esrv_send_item (pl, op);
1448 //TODO: update floorbox to preserve ordering
1449 if (pl->contr->ns)
1450 pl->contr->ns->floorbox_update ();
1475 1451
1476 /* If this object glows, it may affect lighting conditions that are 1452 /* If this object glows, it may affect lighting conditions that are
1477 * visible to others on this map. But update_all_los is really 1453 * visible to others on this map. But update_all_los is really
1478 * an inefficient way to do this, as it means los for all players 1454 * an inefficient way to do this, as it means los for all players
1479 * on the map will get recalculated. The players could very well 1455 * on the map will get recalculated. The players could very well
… …
1559 if (!nr) 1535 if (!nr)
1560 return true; 1536 return true;
1561 1537
1562 nr = min (nr, nrof); 1538 nr = min (nr, nrof);
1563 1539
1540 if (nrof > nr)
1541 {
1564 nrof -= nr; 1542 nrof -= nr;
1565
1566 if (nrof)
1567 {
1568 adjust_weight (env, -weight * nr); // carrying == 0 1543 adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1569 1544
1570 if (object *pl = visible_to ()) 1545 if (object *pl = visible_to ())
1571 esrv_update_item (UPD_NROF, pl, this); 1546 esrv_update_item (UPD_NROF, pl, this);
1572 1547
1573 return true; 1548 return true;
1574 } 1549 }
1575 else 1550 else
1576 { 1551 {
1577 destroy (1); 1552 destroy ();
1578 return false; 1553 return false;
1579 } 1554 }
1580} 1555}
1581 1556
1582/* 1557/*
… …
1599 } 1574 }
1600 else 1575 else
1601 { 1576 {
1602 decrease (nr); 1577 decrease (nr);
1603 1578
1604 object *op = object_create_clone (this); 1579 object *op = deep_clone ();
1605 op->nrof = nr; 1580 op->nrof = nr;
1606 return op; 1581 return op;
1607 } 1582 }
1608} 1583}
1609 1584
… …
1830 LOG (llevError, "Present_arch called outside map.\n"); 1805 LOG (llevError, "Present_arch called outside map.\n");
1831 return NULL; 1806 return NULL;
1832 } 1807 }
1833 1808
1834 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)
1835 if (tmp->arch == at) 1810 if (tmp->arch->archname == at->archname)
1836 return tmp; 1811 return tmp;
1837 1812
1838 return NULL; 1813 return NULL;
1839} 1814}
1840 1815
… …
1904 * The first matching object is returned, or NULL if none. 1879 * The first matching object is returned, or NULL if none.
1905 */ 1880 */
1906object * 1881object *
1907present_arch_in_ob (const archetype *at, const object *op) 1882present_arch_in_ob (const archetype *at, const object *op)
1908{ 1883{
1909 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1884 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1910 if (tmp->arch == at) 1885 if (tmp->arch->archname == at->archname)
1911 return tmp; 1886 return tmp;
1912 1887
1913 return NULL; 1888 return NULL;
1914} 1889}
1915 1890
… …
2324 2299
2325/* 2300/*
2326 * create clone from object to another 2301 * create clone from object to another
2327 */ 2302 */
2328object * 2303object *
2329object_create_clone (object *asrc) 2304object::deep_clone ()
2330{ 2305{
2331 object *dst = 0, *tmp, *src, *prev, *item; 2306 assert (("deep_clone called on non-head object", is_head ()));
2332 2307
2333 if (!asrc) 2308 object *dst = clone ();
2334 return 0;
2335 2309
2336 src = asrc->head_ (); 2310 object *prev = dst;
2337
2338 prev = 0;
2339 for (object *part = src; part; part = part->more) 2311 for (object *part = this->more; part; part = part->more)
2340 { 2312 {
2341 tmp = part->clone (); 2313 object *tmp = part->clone ();
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 (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{
… …
2572{ 2433{
2573 char flagdesc[512]; 2434 char flagdesc[512];
2574 char info2[256 * 4]; 2435 char info2[256 * 4];
2575 char *p = info; 2436 char *p = info;
2576 2437
2577 p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", 2438 p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2578 count, 2439 count,
2579 uuid.c_str (), 2440 uuid.c_str (),
2580 &name, 2441 &name,
2581 title ? "\",title:\"" : "", 2442 title ? ",title:\"" : "",
2582 title ? (const char *)title : "", 2443 title ? (const char *)title : "",
2444 title ? "\"" : "",
2583 flag_desc (flagdesc, 512), type); 2445 flag_desc (flagdesc, 512), type);
2584 2446
2585 if (!flag[FLAG_REMOVED] && env) 2447 if (!flag[FLAG_REMOVED] && env)
2586 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2448 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2587 2449

Diff Legend

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