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.146 by root, Fri May 11 21:07:13 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
455void
456object::set_weapon (object *ob)
457{
458 if (current_weapon == ob)
459 return;
460
461 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
462
463 if (chosen_skill)
464 chosen_skill->flag [FLAG_APPLIED] = false;
465
466 current_weapon = ob;
467 chosen_skill = ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
468
469 if (chosen_skill)
470 chosen_skill->flag [FLAG_APPLIED] = true;
471
472 update_stats ();
473}
474
454/* Zero the key_values on op, decrementing the shared-string 475/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 476 * refcounts and freeing the links.
456 */ 477 */
457static void 478static void
458free_key_values (object *op) 479free_key_values (object *op)
459{ 480{
460 for (key_value *i = op->key_values; i != 0;) 481 for (key_value *i = op->key_values; i; )
461 { 482 {
462 key_value *next = i->next; 483 key_value *next = i->next;
463 delete i; 484 delete i;
464 485
465 i = next; 486 i = next;
466 } 487 }
467 488
468 op->key_values = 0; 489 op->key_values = 0;
469} 490}
470 491
471/* 492object &
472 * copy_to first frees everything allocated by the dst object, 493object::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{ 494{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 495 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 496 bool is_removed = flag [FLAG_REMOVED];
484 497
485 *(object_copy *)dst = *this; 498 *(object_copy *)this = src;
486 499
487 if (is_freed) 500 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 501 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 502
496 /* Copy over key_values, if any. */ 503 /* Copy over key_values, if any. */
497 if (key_values) 504 if (src.key_values)
498 { 505 {
499 key_value *tail = 0; 506 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 507 key_values = 0;
503 508
504 for (i = key_values; i; i = i->next) 509 for (key_value *i = src.key_values; i; i = i->next)
505 { 510 {
506 key_value *new_link = new key_value; 511 key_value *new_link = new key_value;
507 512
508 new_link->next = 0; 513 new_link->next = 0;
509 new_link->key = i->key; 514 new_link->key = i->key;
510 new_link->value = i->value; 515 new_link->value = i->value;
511 516
512 /* Try and be clever here, too. */ 517 /* Try and be clever here, too. */
513 if (!dst->key_values) 518 if (!key_values)
514 { 519 {
515 dst->key_values = new_link; 520 key_values = new_link;
516 tail = new_link; 521 tail = new_link;
517 } 522 }
518 else 523 else
519 { 524 {
520 tail->next = new_link; 525 tail->next = new_link;
521 tail = new_link; 526 tail = new_link;
522 } 527 }
523 } 528 }
524 } 529 }
530}
531
532/*
533 * copy_to first frees everything allocated by the dst object,
534 * and then copies the contents of itself into the second
535 * object, allocating what needs to be allocated. Basically, any
536 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
537 * if the first object is freed, the pointers in the new object
538 * will point at garbage.
539 */
540void
541object::copy_to (object *dst)
542{
543 *dst = *this;
544
545 if (speed < 0)
546 dst->speed_left = speed_left - rndm ();
525 547
526 dst->set_speed (dst->speed); 548 dst->set_speed (dst->speed);
549}
550
551void
552object::instantiate ()
553{
554 if (!uuid.seq) // HACK
555 uuid = gen_uuid ();
556
557 speed_left = -0.1f;
558 /* copy the body_info to the body_used - this is only really
559 * need for monsters, but doesn't hurt to do it for everything.
560 * by doing so, when a monster is created, it has good starting
561 * values for the body_used info, so when items are created
562 * for it, they can be properly equipped.
563 */
564 for (int i = NUM_BODY_LOCATIONS; i--; )
565 slot[i].used = slot[i].info;
566
567 attachable::instantiate ();
527} 568}
528 569
529object * 570object *
530object::clone () 571object::clone ()
531{ 572{
589 * UP_OBJ_FACE: only the objects face has changed. 630 * UP_OBJ_FACE: only the objects face has changed.
590 */ 631 */
591void 632void
592update_object (object *op, int action) 633update_object (object *op, int action)
593{ 634{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 635 if (op == NULL)
597 { 636 {
598 /* this should never happen */ 637 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 638 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 639 return;
819 858
820 if (flag [FLAG_IS_LINKED]) 859 if (flag [FLAG_IS_LINKED])
821 remove_button_link (this); 860 remove_button_link (this);
822 861
823 if (flag [FLAG_FRIENDLY]) 862 if (flag [FLAG_FRIENDLY])
824 {
825 remove_friendly_object (this); 863 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 864
834 if (!flag [FLAG_REMOVED]) 865 if (!flag [FLAG_REMOVED])
835 remove (); 866 remove ();
836 867
837 destroy_inv (true); 868 destroy_inv (true);
1094 return top; 1125 return top;
1095 } 1126 }
1096 } 1127 }
1097 1128
1098 return 0; 1129 return 0;
1130}
1131
1132void
1133object::expand_tail ()
1134{
1135 if (more)
1136 return;
1137
1138 object *prev = this;
1139
1140 for (archetype *at = arch->more; at; at = at->more)
1141 {
1142 object *op = arch_to_object (at);
1143
1144 op->name = name;
1145 op->name_pl = name_pl;
1146 op->title = title;
1147
1148 op->head = this;
1149 prev->more = op;
1150
1151 prev = op;
1152 }
1099} 1153}
1100 1154
1101/* 1155/*
1102 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1156 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1103 * job preparing multi-part monsters. 1157 * job preparing multi-part monsters.
1135 * just 'op' otherwise 1189 * just 'op' otherwise
1136 */ 1190 */
1137object * 1191object *
1138insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1192insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1139{ 1193{
1194 assert (!op->flag [FLAG_FREED]);
1195
1140 object *tmp, *top, *floor = NULL; 1196 object *tmp, *top, *floor = NULL;
1141 1197
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 (); 1198 op->remove ();
1152 1199
1153 if (!m) 1200#if 0
1154 { 1201 if (!m->active != !op->active)
1155 char *dump = dump_object (op); 1202 if (m->active)
1156 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1203 op->activate_recursive ();
1157 free (dump); 1204 else
1158 return op; 1205 op->deactivate_recursive ();
1159 } 1206#endif
1160 1207
1161 if (out_of_map (m, op->x, op->y)) 1208 if (out_of_map (m, op->x, op->y))
1162 { 1209 {
1163 char *dump = dump_object (op);
1164 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1210 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1165#ifdef MANY_CORES 1211#ifdef MANY_CORES
1166 /* Better to catch this here, as otherwise the next use of this object 1212 /* 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 1213 * is likely to cause a crash. Better to find out where it is getting
1168 * improperly inserted. 1214 * improperly inserted.
1169 */ 1215 */
1170 abort (); 1216 abort ();
1171#endif 1217#endif
1172 free (dump);
1173 return op; 1218 return op;
1174 } 1219 }
1175 1220
1176 if (object *more = op->more) 1221 if (object *more = op->more)
1177 { 1222 {
1274 * looks like instead of lots of conditions here. 1319 * looks like instead of lots of conditions here.
1275 * makes things faster, and effectively the same result. 1320 * makes things faster, and effectively the same result.
1276 */ 1321 */
1277 1322
1278 /* Have object 'fall below' other objects that block view. 1323 /* Have object 'fall below' other objects that block view.
1279 * Unless those objects are exits, type 66 1324 * Unless those objects are exits.
1280 * If INS_ON_TOP is used, don't do this processing 1325 * If INS_ON_TOP is used, don't do this processing
1281 * Need to find the object that in fact blocks view, otherwise 1326 * Need to find the object that in fact blocks view, otherwise
1282 * stacking is a bit odd. 1327 * stacking is a bit odd.
1283 */ 1328 */
1284 if (!(flag & INS_ON_TOP) 1329 if (!(flag & INS_ON_TOP)
1285 && ms.flags () & P_BLOCKSVIEW 1330 && ms.flags () & P_BLOCKSVIEW
1286 && (op->face && !op->face->visibility)) 1331 && (op->face && !faces [op->face].visibility))
1287 { 1332 {
1288 for (last = top; last != floor; last = last->below) 1333 for (last = top; last != floor; last = last->below)
1289 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1334 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1290 break; 1335 break;
1291 1336
1417} 1462}
1418 1463
1419object * 1464object *
1420object::insert_at (object *where, object *originator, int flags) 1465object::insert_at (object *where, object *originator, int flags)
1421{ 1466{
1422 where->map->insert (this, where->x, where->y, originator, flags); 1467 return where->map->insert (this, where->x, where->y, originator, flags);
1423} 1468}
1424 1469
1425/* 1470/*
1426 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1471 * 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 1472 * is returned contains nr objects, and the remaining parts contains
1467 * the amount of an object. If the amount reaches 0, the object 1512 * the amount of an object. If the amount reaches 0, the object
1468 * is subsequently removed and freed. 1513 * is subsequently removed and freed.
1469 * 1514 *
1470 * Return value: 'op' if something is left, NULL if the amount reached 0 1515 * Return value: 'op' if something is left, NULL if the amount reached 0
1471 */ 1516 */
1472
1473object * 1517object *
1474decrease_ob_nr (object *op, uint32 i) 1518decrease_ob_nr (object *op, uint32 i)
1475{ 1519{
1476 object *tmp; 1520 object *tmp;
1477 1521
1552 1596
1553/* 1597/*
1554 * add_weight(object, weight) adds the specified weight to an object, 1598 * add_weight(object, weight) adds the specified weight to an object,
1555 * and also updates how much the environment(s) is/are carrying. 1599 * and also updates how much the environment(s) is/are carrying.
1556 */ 1600 */
1557
1558void 1601void
1559add_weight (object *op, signed long weight) 1602add_weight (object *op, signed long weight)
1560{ 1603{
1561 while (op != NULL) 1604 while (op != NULL)
1562 { 1605 {
1594 * inside the object environment. 1637 * inside the object environment.
1595 * 1638 *
1596 * The function returns now pointer to inserted item, and return value can 1639 * The function returns now pointer to inserted item, and return value can
1597 * be != op, if items are merged. -Tero 1640 * be != op, if items are merged. -Tero
1598 */ 1641 */
1599
1600object * 1642object *
1601object::insert (object *op) 1643object::insert (object *op)
1602{ 1644{
1603 object *tmp, *otmp; 1645 object *tmp, *otmp;
1604 1646
2334 insert_ob_in_ob (object_create_clone (item), dst); 2376 insert_ob_in_ob (object_create_clone (item), dst);
2335 2377
2336 return dst; 2378 return dst;
2337} 2379}
2338 2380
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 2381/* This returns the first object in who's inventory that
2378 * has the same type and subtype match. 2382 * has the same type and subtype match.
2379 * returns NULL if no match. 2383 * returns NULL if no match.
2380 */ 2384 */
2381object * 2385object *
2434 if (link->key == canonical_key) 2438 if (link->key == canonical_key)
2435 return link->value; 2439 return link->value;
2436 2440
2437 return 0; 2441 return 0;
2438} 2442}
2439
2440 2443
2441/* 2444/*
2442 * Updates the canonical_key in op to value. 2445 * Updates the canonical_key in op to value.
2443 * 2446 *
2444 * canonical_key is a shared string (value doesn't have to be). 2447 * canonical_key is a shared string (value doesn't have to be).
2603} 2606}
2604 2607
2605const char * 2608const char *
2606object::debug_desc () const 2609object::debug_desc () const
2607{ 2610{
2608 static char info[256 * 4]; 2611 static char info[3][256 * 4];
2612 static int info_idx;
2613
2609 return debug_desc (info); 2614 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} 2615}
2618 2616
2619struct region * 2617struct region *
2620object::region () const 2618object::region () const
2621{ 2619{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines