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.132 by root, Sat Feb 10 21:01:09 2007 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 * 7 *
29#include <stdio.h> 29#include <stdio.h>
30#include <sys/types.h> 30#include <sys/types.h>
31#include <sys/uio.h> 31#include <sys/uio.h>
32#include <object.h> 32#include <object.h>
33#include <funcpoint.h> 33#include <funcpoint.h>
34#include <sproto.h>
34#include <loader.h> 35#include <loader.h>
35 36
36#include <bitset> 37#include <bitset>
37 38
38int nrofallocobjects = 0; 39int nrofallocobjects = 0;
324sum_weight (object *op) 325sum_weight (object *op)
325{ 326{
326 long sum; 327 long sum;
327 object *inv; 328 object *inv;
328 329
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 330 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 331 {
331 if (inv->inv) 332 if (inv->inv)
332 sum_weight (inv); 333 sum_weight (inv);
334
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 335 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 336 }
335 337
336 if (op->type == CONTAINER && op->stats.Str) 338 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 339 sum = (sum * (100 - op->stats.Str)) / 100;
357/* 359/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 360 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 361 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 362 * The result of the dump is stored in the static global errmsg array.
361 */ 363 */
362
363char * 364char *
364dump_object (object *op) 365dump_object (object *op)
365{ 366{
366 if (!op) 367 if (!op)
367 return strdup ("[NULLOBJ]"); 368 return strdup ("[NULLOBJ]");
368 369
369 object_freezer freezer; 370 object_freezer freezer;
370 save_object (freezer, op, 1); 371 op->write (freezer);
371 return freezer.as_string (); 372 return freezer.as_string ();
372} 373}
373 374
374/* 375/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 376 * get_nearest_part(multi-object, object 2) returns the part of the
449 owner = owner->owner; 450 owner = owner->owner;
450 451
451 this->owner = owner; 452 this->owner = owner;
452} 453}
453 454
455bool
456object::change_weapon (object *ob)
457{
458 if (current_weapon == ob)
459 return true;
460
461 if (chosen_skill)
462 chosen_skill->flag [FLAG_APPLIED] = false;
463
464 current_weapon = ob;
465 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
466
467 if (chosen_skill)
468 chosen_skill->flag [FLAG_APPLIED] = true;
469
470 update_stats ();
471
472 if (ob)
473 {
474 // now check wether any body locations became invalid, in which case
475 // we cannot apply the weapon at the moment.
476 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
477 if (slot[i].used < 0)
478 {
479 current_weapon = chosen_skill = 0;
480 update_stats ();
481
482 new_draw_info_format (NDI_UNIQUE, 0, this,
483 "You try to balance your applied items all at once, but the %s is too much. "
484 "You need to unapply some items first.", &ob->name);
485 return false;
486 }
487
488 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
489 }
490 else
491 new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
492
493 return true;
494}
495
454/* Zero the key_values on op, decrementing the shared-string 496/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 497 * refcounts and freeing the links.
456 */ 498 */
457static void 499static void
458free_key_values (object *op) 500free_key_values (object *op)
459{ 501{
460 for (key_value *i = op->key_values; i != 0;) 502 for (key_value *i = op->key_values; i; )
461 { 503 {
462 key_value *next = i->next; 504 key_value *next = i->next;
463 delete i; 505 delete i;
464 506
465 i = next; 507 i = next;
466 } 508 }
467 509
468 op->key_values = 0; 510 op->key_values = 0;
469} 511}
470 512
471/* 513object &
472 * copy_to first frees everything allocated by the dst object, 514object::operator =(const object &src)
473 * and then copies the contents of itself into the second
474 * object, allocating what needs to be allocated. Basically, any
475 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
476 * if the first object is freed, the pointers in the new object
477 * will point at garbage.
478 */
479void
480object::copy_to (object *dst)
481{ 515{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 516 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 517 bool is_removed = flag [FLAG_REMOVED];
484 518
485 *(object_copy *)dst = *this; 519 *(object_copy *)this = src;
486 520
487 if (is_freed) 521 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 522 flag [FLAG_REMOVED] = is_removed;
489
490 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED);
492
493 if (speed < 0)
494 dst->speed_left = speed_left - rndm ();
495 523
496 /* Copy over key_values, if any. */ 524 /* Copy over key_values, if any. */
497 if (key_values) 525 if (src.key_values)
498 { 526 {
499 key_value *tail = 0; 527 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 528 key_values = 0;
503 529
504 for (i = key_values; i; i = i->next) 530 for (key_value *i = src.key_values; i; i = i->next)
505 { 531 {
506 key_value *new_link = new key_value; 532 key_value *new_link = new key_value;
507 533
508 new_link->next = 0; 534 new_link->next = 0;
509 new_link->key = i->key; 535 new_link->key = i->key;
510 new_link->value = i->value; 536 new_link->value = i->value;
511 537
512 /* Try and be clever here, too. */ 538 /* Try and be clever here, too. */
513 if (!dst->key_values) 539 if (!key_values)
514 { 540 {
515 dst->key_values = new_link; 541 key_values = new_link;
516 tail = new_link; 542 tail = new_link;
517 } 543 }
518 else 544 else
519 { 545 {
520 tail->next = new_link; 546 tail->next = new_link;
521 tail = new_link; 547 tail = new_link;
522 } 548 }
523 } 549 }
524 } 550 }
551}
552
553/*
554 * copy_to first frees everything allocated by the dst object,
555 * and then copies the contents of itself into the second
556 * object, allocating what needs to be allocated. Basically, any
557 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
558 * if the first object is freed, the pointers in the new object
559 * will point at garbage.
560 */
561void
562object::copy_to (object *dst)
563{
564 *dst = *this;
565
566 if (speed < 0)
567 dst->speed_left = speed_left - rndm ();
525 568
526 dst->set_speed (dst->speed); 569 dst->set_speed (dst->speed);
570}
571
572void
573object::instantiate ()
574{
575 if (!uuid.seq) // HACK
576 uuid = gen_uuid ();
577
578 speed_left = -0.1f;
579 /* copy the body_info to the body_used - this is only really
580 * need for monsters, but doesn't hurt to do it for everything.
581 * by doing so, when a monster is created, it has good starting
582 * values for the body_used info, so when items are created
583 * for it, they can be properly equipped.
584 */
585 for (int i = NUM_BODY_LOCATIONS; i--; )
586 slot[i].used = slot[i].info;
587
588 attachable::instantiate ();
527} 589}
528 590
529object * 591object *
530object::clone () 592object::clone ()
531{ 593{
589 * UP_OBJ_FACE: only the objects face has changed. 651 * UP_OBJ_FACE: only the objects face has changed.
590 */ 652 */
591void 653void
592update_object (object *op, int action) 654update_object (object *op, int action)
593{ 655{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 656 if (op == NULL)
597 { 657 {
598 /* this should never happen */ 658 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 659 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 660 return;
819 879
820 if (flag [FLAG_IS_LINKED]) 880 if (flag [FLAG_IS_LINKED])
821 remove_button_link (this); 881 remove_button_link (this);
822 882
823 if (flag [FLAG_FRIENDLY]) 883 if (flag [FLAG_FRIENDLY])
824 {
825 remove_friendly_object (this); 884 remove_friendly_object (this);
826
827 if (type == GOLEM
828 && owner
829 && owner->type == PLAYER
830 && owner->contr->ranges[range_golem] == this)
831 owner->contr->ranges[range_golem] = 0;
832 }
833 885
834 if (!flag [FLAG_REMOVED]) 886 if (!flag [FLAG_REMOVED])
835 remove (); 887 remove ();
836 888
837 destroy_inv (true); 889 destroy_inv (true);
1094 return top; 1146 return top;
1095 } 1147 }
1096 } 1148 }
1097 1149
1098 return 0; 1150 return 0;
1151}
1152
1153void
1154object::expand_tail ()
1155{
1156 if (more)
1157 return;
1158
1159 object *prev = this;
1160
1161 for (archetype *at = arch->more; at; at = at->more)
1162 {
1163 object *op = arch_to_object (at);
1164
1165 op->name = name;
1166 op->name_pl = name_pl;
1167 op->title = title;
1168
1169 op->head = this;
1170 prev->more = op;
1171
1172 prev = op;
1173 }
1099} 1174}
1100 1175
1101/* 1176/*
1102 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1177 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1103 * job preparing multi-part monsters. 1178 * job preparing multi-part monsters.
1135 * just 'op' otherwise 1210 * just 'op' otherwise
1136 */ 1211 */
1137object * 1212object *
1138insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1213insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1139{ 1214{
1215 assert (!op->flag [FLAG_FREED]);
1216
1140 object *tmp, *top, *floor = NULL; 1217 object *tmp, *top, *floor = NULL;
1141 1218
1142 if (QUERY_FLAG (op, FLAG_FREED))
1143 {
1144 LOG (llevError, "Trying to insert freed object!\n");
1145 return NULL;
1146 }
1147
1148 if (!QUERY_FLAG (op, FLAG_REMOVED))
1149 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1150
1151 op->remove (); 1219 op->remove ();
1152 1220
1153 if (!m) 1221#if 0
1154 { 1222 if (!m->active != !op->active)
1155 char *dump = dump_object (op); 1223 if (m->active)
1156 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1224 op->activate_recursive ();
1157 free (dump); 1225 else
1158 return op; 1226 op->deactivate_recursive ();
1159 } 1227#endif
1160 1228
1161 if (out_of_map (m, op->x, op->y)) 1229 if (out_of_map (m, op->x, op->y))
1162 { 1230 {
1163 char *dump = dump_object (op);
1164 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1231 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1165#ifdef MANY_CORES 1232#ifdef MANY_CORES
1166 /* Better to catch this here, as otherwise the next use of this object 1233 /* Better to catch this here, as otherwise the next use of this object
1167 * is likely to cause a crash. Better to find out where it is getting 1234 * is likely to cause a crash. Better to find out where it is getting
1168 * improperly inserted. 1235 * improperly inserted.
1169 */ 1236 */
1170 abort (); 1237 abort ();
1171#endif 1238#endif
1172 free (dump);
1173 return op; 1239 return op;
1174 } 1240 }
1175 1241
1176 if (object *more = op->more) 1242 if (object *more = op->more)
1177 { 1243 {
1274 * looks like instead of lots of conditions here. 1340 * looks like instead of lots of conditions here.
1275 * makes things faster, and effectively the same result. 1341 * makes things faster, and effectively the same result.
1276 */ 1342 */
1277 1343
1278 /* Have object 'fall below' other objects that block view. 1344 /* Have object 'fall below' other objects that block view.
1279 * Unless those objects are exits, type 66 1345 * Unless those objects are exits.
1280 * If INS_ON_TOP is used, don't do this processing 1346 * If INS_ON_TOP is used, don't do this processing
1281 * Need to find the object that in fact blocks view, otherwise 1347 * Need to find the object that in fact blocks view, otherwise
1282 * stacking is a bit odd. 1348 * stacking is a bit odd.
1283 */ 1349 */
1284 if (!(flag & INS_ON_TOP) 1350 if (!(flag & INS_ON_TOP)
1285 && ms.flags () & P_BLOCKSVIEW 1351 && ms.flags () & P_BLOCKSVIEW
1286 && (op->face && !op->face->visibility)) 1352 && (op->face && !faces [op->face].visibility))
1287 { 1353 {
1288 for (last = top; last != floor; last = last->below) 1354 for (last = top; last != floor; last = last->below)
1289 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1355 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1290 break; 1356 break;
1291 1357
1417} 1483}
1418 1484
1419object * 1485object *
1420object::insert_at (object *where, object *originator, int flags) 1486object::insert_at (object *where, object *originator, int flags)
1421{ 1487{
1422 where->map->insert (this, where->x, where->y, originator, flags); 1488 return where->map->insert (this, where->x, where->y, originator, flags);
1423} 1489}
1424 1490
1425/* 1491/*
1426 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1492 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1427 * is returned contains nr objects, and the remaining parts contains 1493 * is returned contains nr objects, and the remaining parts contains
1467 * the amount of an object. If the amount reaches 0, the object 1533 * the amount of an object. If the amount reaches 0, the object
1468 * is subsequently removed and freed. 1534 * is subsequently removed and freed.
1469 * 1535 *
1470 * Return value: 'op' if something is left, NULL if the amount reached 0 1536 * Return value: 'op' if something is left, NULL if the amount reached 0
1471 */ 1537 */
1472
1473object * 1538object *
1474decrease_ob_nr (object *op, uint32 i) 1539decrease_ob_nr (object *op, uint32 i)
1475{ 1540{
1476 object *tmp; 1541 object *tmp;
1477 1542
1552 1617
1553/* 1618/*
1554 * add_weight(object, weight) adds the specified weight to an object, 1619 * add_weight(object, weight) adds the specified weight to an object,
1555 * and also updates how much the environment(s) is/are carrying. 1620 * and also updates how much the environment(s) is/are carrying.
1556 */ 1621 */
1557
1558void 1622void
1559add_weight (object *op, signed long weight) 1623add_weight (object *op, signed long weight)
1560{ 1624{
1561 while (op != NULL) 1625 while (op != NULL)
1562 { 1626 {
1594 * inside the object environment. 1658 * inside the object environment.
1595 * 1659 *
1596 * The function returns now pointer to inserted item, and return value can 1660 * The function returns now pointer to inserted item, and return value can
1597 * be != op, if items are merged. -Tero 1661 * be != op, if items are merged. -Tero
1598 */ 1662 */
1599
1600object * 1663object *
1601object::insert (object *op) 1664object::insert (object *op)
1602{ 1665{
1603 object *tmp, *otmp; 1666 object *tmp, *otmp;
1604 1667
2334 insert_ob_in_ob (object_create_clone (item), dst); 2397 insert_ob_in_ob (object_create_clone (item), dst);
2335 2398
2336 return dst; 2399 return dst;
2337} 2400}
2338 2401
2339/* GROS - Creates an object using a string representing its content. */
2340/* Basically, we save the content of the string to a temp file, then call */
2341/* load_object on it. I admit it is a highly inefficient way to make things, */
2342/* but it was simple to make and allows reusing the load_object function. */
2343/* Remember not to use load_object_str in a time-critical situation. */
2344/* Also remember that multiparts objects are not supported for now. */
2345object *
2346load_object_str (const char *obstr)
2347{
2348 object *op;
2349 char filename[MAX_BUF];
2350
2351 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2352
2353 FILE *tempfile = fopen (filename, "w");
2354
2355 if (tempfile == NULL)
2356 {
2357 LOG (llevError, "Error - Unable to access load object temp file\n");
2358 return NULL;
2359 }
2360
2361 fprintf (tempfile, obstr);
2362 fclose (tempfile);
2363
2364 op = object::create ();
2365
2366 object_thawer thawer (filename);
2367
2368 if (thawer)
2369 load_object (thawer, op, 0);
2370
2371 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2372 CLEAR_FLAG (op, FLAG_REMOVED);
2373
2374 return op;
2375}
2376
2377/* This returns the first object in who's inventory that 2402/* This returns the first object in who's inventory that
2378 * has the same type and subtype match. 2403 * has the same type and subtype match.
2379 * returns NULL if no match. 2404 * returns NULL if no match.
2380 */ 2405 */
2381object * 2406object *
2434 if (link->key == canonical_key) 2459 if (link->key == canonical_key)
2435 return link->value; 2460 return link->value;
2436 2461
2437 return 0; 2462 return 0;
2438} 2463}
2439
2440 2464
2441/* 2465/*
2442 * Updates the canonical_key in op to value. 2466 * Updates the canonical_key in op to value.
2443 * 2467 *
2444 * canonical_key is a shared string (value doesn't have to be). 2468 * canonical_key is a shared string (value doesn't have to be).
2603} 2627}
2604 2628
2605const char * 2629const char *
2606object::debug_desc () const 2630object::debug_desc () const
2607{ 2631{
2608 static char info[256 * 4]; 2632 static char info[3][256 * 4];
2633 static int info_idx;
2634
2609 return debug_desc (info); 2635 return debug_desc (info [++info_idx % 3]);
2610}
2611
2612const char *
2613object::debug_desc2 () const
2614{
2615 static char info[256 * 4];
2616 return debug_desc (info);
2617} 2636}
2618 2637
2619struct region * 2638struct region *
2620object::region () const 2639object::region () const
2621{ 2640{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines