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.130 by root, Sat Feb 10 01:52:25 2007 UTC vs.
Revision 1.149 by root, Mon May 14 19:56:45 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
455int
456object::slottype () const
457{
458 if (type == SKILL)
459 {
460 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
461 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
462 }
463 else
464 {
465 if (slot [body_combat].info) return slot_combat;
466 if (slot [body_range ].info) return slot_ranged;
467 }
468
469 return slot_none;
470}
471
472bool
473object::change_weapon (object *ob)
474{
475 if (current_weapon == ob)
476 return true;
477
478 current_weapon = ob;
479 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
480
481 update_stats ();
482
483 if (ob)
484 {
485 // now check wether any body locations became invalid, in which case
486 // we cannot apply the weapon at the moment.
487 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
488 if (slot[i].used < 0)
489 {
490 current_weapon = chosen_skill = 0;
491 update_stats ();
492
493 new_draw_info_format (NDI_UNIQUE, 0, this,
494 "You try to balance your applied items all at once, but the %s is too much. "
495 "You need to unapply some items first.", &ob->name);
496 return false;
497 }
498
499 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
500 }
501 else
502 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
503
504 return true;
505}
506
454/* Zero the key_values on op, decrementing the shared-string 507/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 508 * refcounts and freeing the links.
456 */ 509 */
457static void 510static void
458free_key_values (object *op) 511free_key_values (object *op)
459{ 512{
460 for (key_value *i = op->key_values; i != 0;) 513 for (key_value *i = op->key_values; i; )
461 { 514 {
462 key_value *next = i->next; 515 key_value *next = i->next;
463 delete i; 516 delete i;
464 517
465 i = next; 518 i = next;
466 } 519 }
467 520
468 op->key_values = 0; 521 op->key_values = 0;
469} 522}
470 523
471/* 524object &
472 * copy_to first frees everything allocated by the dst object, 525object::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{ 526{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 527 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 528 bool is_removed = flag [FLAG_REMOVED];
484 529
485 *(object_copy *)dst = *this; 530 *(object_copy *)this = src;
486 531
487 if (is_freed) 532 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 533 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 534
496 /* Copy over key_values, if any. */ 535 /* Copy over key_values, if any. */
497 if (key_values) 536 if (src.key_values)
498 { 537 {
499 key_value *tail = 0; 538 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 539 key_values = 0;
503 540
504 for (i = key_values; i; i = i->next) 541 for (key_value *i = src.key_values; i; i = i->next)
505 { 542 {
506 key_value *new_link = new key_value; 543 key_value *new_link = new key_value;
507 544
508 new_link->next = 0; 545 new_link->next = 0;
509 new_link->key = i->key; 546 new_link->key = i->key;
510 new_link->value = i->value; 547 new_link->value = i->value;
511 548
512 /* Try and be clever here, too. */ 549 /* Try and be clever here, too. */
513 if (!dst->key_values) 550 if (!key_values)
514 { 551 {
515 dst->key_values = new_link; 552 key_values = new_link;
516 tail = new_link; 553 tail = new_link;
517 } 554 }
518 else 555 else
519 { 556 {
520 tail->next = new_link; 557 tail->next = new_link;
521 tail = new_link; 558 tail = new_link;
522 } 559 }
523 } 560 }
524 } 561 }
562}
563
564/*
565 * copy_to first frees everything allocated by the dst object,
566 * and then copies the contents of itself into the second
567 * object, allocating what needs to be allocated. Basically, any
568 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
569 * if the first object is freed, the pointers in the new object
570 * will point at garbage.
571 */
572void
573object::copy_to (object *dst)
574{
575 *dst = *this;
576
577 if (speed < 0)
578 dst->speed_left = speed_left - rndm ();
525 579
526 dst->set_speed (dst->speed); 580 dst->set_speed (dst->speed);
581}
582
583void
584object::instantiate ()
585{
586 if (!uuid.seq) // HACK
587 uuid = gen_uuid ();
588
589 speed_left = -0.1f;
590 /* copy the body_info to the body_used - this is only really
591 * need for monsters, but doesn't hurt to do it for everything.
592 * by doing so, when a monster is created, it has good starting
593 * values for the body_used info, so when items are created
594 * for it, they can be properly equipped.
595 */
596 for (int i = NUM_BODY_LOCATIONS; i--; )
597 slot[i].used = slot[i].info;
598
599 attachable::instantiate ();
527} 600}
528 601
529object * 602object *
530object::clone () 603object::clone ()
531{ 604{
589 * UP_OBJ_FACE: only the objects face has changed. 662 * UP_OBJ_FACE: only the objects face has changed.
590 */ 663 */
591void 664void
592update_object (object *op, int action) 665update_object (object *op, int action)
593{ 666{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 667 if (op == NULL)
597 { 668 {
598 /* this should never happen */ 669 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 670 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 671 return;
819 890
820 if (flag [FLAG_IS_LINKED]) 891 if (flag [FLAG_IS_LINKED])
821 remove_button_link (this); 892 remove_button_link (this);
822 893
823 if (flag [FLAG_FRIENDLY]) 894 if (flag [FLAG_FRIENDLY])
824 {
825 remove_friendly_object (this); 895 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 896
834 if (!flag [FLAG_REMOVED]) 897 if (!flag [FLAG_REMOVED])
835 remove (); 898 remove ();
836 899
837 destroy_inv (true); 900 destroy_inv (true);
1094 return top; 1157 return top;
1095 } 1158 }
1096 } 1159 }
1097 1160
1098 return 0; 1161 return 0;
1162}
1163
1164void
1165object::expand_tail ()
1166{
1167 if (more)
1168 return;
1169
1170 object *prev = this;
1171
1172 for (archetype *at = arch->more; at; at = at->more)
1173 {
1174 object *op = arch_to_object (at);
1175
1176 op->name = name;
1177 op->name_pl = name_pl;
1178 op->title = title;
1179
1180 op->head = this;
1181 prev->more = op;
1182
1183 prev = op;
1184 }
1099} 1185}
1100 1186
1101/* 1187/*
1102 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1188 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1103 * job preparing multi-part monsters. 1189 * job preparing multi-part monsters.
1135 * just 'op' otherwise 1221 * just 'op' otherwise
1136 */ 1222 */
1137object * 1223object *
1138insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1224insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1139{ 1225{
1226 assert (!op->flag [FLAG_FREED]);
1227
1140 object *tmp, *top, *floor = NULL; 1228 object *tmp, *top, *floor = NULL;
1141 1229
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 (); 1230 op->remove ();
1152 1231
1153 if (!m) 1232#if 0
1154 { 1233 if (!m->active != !op->active)
1155 char *dump = dump_object (op); 1234 if (m->active)
1156 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1235 op->activate_recursive ();
1157 free (dump); 1236 else
1158 return op; 1237 op->deactivate_recursive ();
1159 } 1238#endif
1160 1239
1161 if (out_of_map (m, op->x, op->y)) 1240 if (out_of_map (m, op->x, op->y))
1162 { 1241 {
1163 char *dump = dump_object (op);
1164 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1242 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1165#ifdef MANY_CORES 1243#ifdef MANY_CORES
1166 /* Better to catch this here, as otherwise the next use of this object 1244 /* 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 1245 * is likely to cause a crash. Better to find out where it is getting
1168 * improperly inserted. 1246 * improperly inserted.
1169 */ 1247 */
1170 abort (); 1248 abort ();
1171#endif 1249#endif
1172 free (dump);
1173 return op; 1250 return op;
1174 } 1251 }
1175 1252
1176 if (object *more = op->more) 1253 if (object *more = op->more)
1177 { 1254 {
1274 * looks like instead of lots of conditions here. 1351 * looks like instead of lots of conditions here.
1275 * makes things faster, and effectively the same result. 1352 * makes things faster, and effectively the same result.
1276 */ 1353 */
1277 1354
1278 /* Have object 'fall below' other objects that block view. 1355 /* Have object 'fall below' other objects that block view.
1279 * Unless those objects are exits, type 66 1356 * Unless those objects are exits.
1280 * If INS_ON_TOP is used, don't do this processing 1357 * If INS_ON_TOP is used, don't do this processing
1281 * Need to find the object that in fact blocks view, otherwise 1358 * Need to find the object that in fact blocks view, otherwise
1282 * stacking is a bit odd. 1359 * stacking is a bit odd.
1283 */ 1360 */
1284 if (!(flag & INS_ON_TOP) 1361 if (!(flag & INS_ON_TOP)
1285 && ms.flags () & P_BLOCKSVIEW 1362 && ms.flags () & P_BLOCKSVIEW
1286 && (op->face && !op->face->visibility)) 1363 && (op->face && !faces [op->face].visibility))
1287 { 1364 {
1288 for (last = top; last != floor; last = last->below) 1365 for (last = top; last != floor; last = last->below)
1289 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1366 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1290 break; 1367 break;
1291 1368
1417} 1494}
1418 1495
1419object * 1496object *
1420object::insert_at (object *where, object *originator, int flags) 1497object::insert_at (object *where, object *originator, int flags)
1421{ 1498{
1422 where->map->insert (this, where->x, where->y, originator, flags); 1499 return where->map->insert (this, where->x, where->y, originator, flags);
1423} 1500}
1424 1501
1425/* 1502/*
1426 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1503 * 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 1504 * is returned contains nr objects, and the remaining parts contains
1467 * the amount of an object. If the amount reaches 0, the object 1544 * the amount of an object. If the amount reaches 0, the object
1468 * is subsequently removed and freed. 1545 * is subsequently removed and freed.
1469 * 1546 *
1470 * Return value: 'op' if something is left, NULL if the amount reached 0 1547 * Return value: 'op' if something is left, NULL if the amount reached 0
1471 */ 1548 */
1472
1473object * 1549object *
1474decrease_ob_nr (object *op, uint32 i) 1550decrease_ob_nr (object *op, uint32 i)
1475{ 1551{
1476 object *tmp; 1552 object *tmp;
1477 1553
1552 1628
1553/* 1629/*
1554 * add_weight(object, weight) adds the specified weight to an object, 1630 * add_weight(object, weight) adds the specified weight to an object,
1555 * and also updates how much the environment(s) is/are carrying. 1631 * and also updates how much the environment(s) is/are carrying.
1556 */ 1632 */
1557
1558void 1633void
1559add_weight (object *op, signed long weight) 1634add_weight (object *op, signed long weight)
1560{ 1635{
1561 while (op != NULL) 1636 while (op != NULL)
1562 { 1637 {
1594 * inside the object environment. 1669 * inside the object environment.
1595 * 1670 *
1596 * The function returns now pointer to inserted item, and return value can 1671 * The function returns now pointer to inserted item, and return value can
1597 * be != op, if items are merged. -Tero 1672 * be != op, if items are merged. -Tero
1598 */ 1673 */
1599
1600object * 1674object *
1601object::insert (object *op) 1675object::insert (object *op)
1602{ 1676{
1603 object *tmp, *otmp; 1677 object *tmp, *otmp;
1604 1678
2334 insert_ob_in_ob (object_create_clone (item), dst); 2408 insert_ob_in_ob (object_create_clone (item), dst);
2335 2409
2336 return dst; 2410 return dst;
2337} 2411}
2338 2412
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 2413/* This returns the first object in who's inventory that
2378 * has the same type and subtype match. 2414 * has the same type and subtype match.
2379 * returns NULL if no match. 2415 * returns NULL if no match.
2380 */ 2416 */
2381object * 2417object *
2434 if (link->key == canonical_key) 2470 if (link->key == canonical_key)
2435 return link->value; 2471 return link->value;
2436 2472
2437 return 0; 2473 return 0;
2438} 2474}
2439
2440 2475
2441/* 2476/*
2442 * Updates the canonical_key in op to value. 2477 * Updates the canonical_key in op to value.
2443 * 2478 *
2444 * canonical_key is a shared string (value doesn't have to be). 2479 * canonical_key is a shared string (value doesn't have to be).
2603} 2638}
2604 2639
2605const char * 2640const char *
2606object::debug_desc () const 2641object::debug_desc () const
2607{ 2642{
2608 static char info[256 * 4]; 2643 static char info[3][256 * 4];
2644 static int info_idx;
2645
2609 return debug_desc (info); 2646 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} 2647}
2618 2648
2619struct region * 2649struct region *
2620object::region () const 2650object::region () const
2621{ 2651{
2674 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2704 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2675 new_container->insert (closer); 2705 new_container->insert (closer);
2676 } 2706 }
2677#endif 2707#endif
2678 2708
2709 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2710
2679 new_container->flag [FLAG_APPLIED] = 1; 2711 new_container->flag [FLAG_APPLIED] = 1;
2680 container = new_container; 2712 container = new_container;
2681 2713
2682 esrv_update_item (UPD_FLAGS, this, new_container); 2714 esrv_update_item (UPD_FLAGS, this, new_container);
2683 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2715 esrv_send_inventory (this, new_container);
2684 } 2716 }
2685
2686 if (contr && contr->ns)
2687 contr->ns->floorbox_update ();
2688} 2717}
2689 2718
2690 2719

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines