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.118 by root, Thu Jan 18 19:42:09 2007 UTC vs.
Revision 1.141 by root, Sun Apr 29 21:44:34 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 *
313 313
314 /* Everything passes, must be OK. */ 314 /* Everything passes, must be OK. */
315 return 1; 315 return 1;
316} 316}
317 317
318void
319player::set_range (rangetype r)
320{
321 shoottype = r;
322}
323
318/* 324/*
319 * sum_weight() is a recursive function which calculates the weight 325 * sum_weight() is a recursive function which calculates the weight
320 * an object is carrying. It goes through in figures out how much 326 * an object is carrying. It goes through in figures out how much
321 * containers are carrying, and sums it up. 327 * containers are carrying, and sums it up.
322 */ 328 */
357/* 363/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 364 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 365 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 366 * The result of the dump is stored in the static global errmsg array.
361 */ 367 */
362
363char * 368char *
364dump_object (object *op) 369dump_object (object *op)
365{ 370{
366 if (!op) 371 if (!op)
367 return strdup ("[NULLOBJ]"); 372 return strdup ("[NULLOBJ]");
368 373
369 object_freezer freezer; 374 object_freezer freezer;
370 save_object (freezer, op, 1); 375 op->write (freezer);
371 return freezer.as_string (); 376 return freezer.as_string ();
372} 377}
373 378
374/* 379/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 380 * get_nearest_part(multi-object, object 2) returns the part of the
455 * refcounts and freeing the links. 460 * refcounts and freeing the links.
456 */ 461 */
457static void 462static void
458free_key_values (object *op) 463free_key_values (object *op)
459{ 464{
460 for (key_value *i = op->key_values; i != 0;) 465 for (key_value *i = op->key_values; i; )
461 { 466 {
462 key_value *next = i->next; 467 key_value *next = i->next;
463 delete i; 468 delete i;
464 469
465 i = next; 470 i = next;
466 } 471 }
467 472
468 op->key_values = 0; 473 op->key_values = 0;
469} 474}
470 475
471/* 476object &
472 * copy_to first frees everything allocated by the dst object, 477object::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{ 478{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 479 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 480 bool is_removed = flag [FLAG_REMOVED];
484 481
485 *(object_copy *)dst = *this; 482 *(object_copy *)this = src;
486 483
487 if (is_freed) 484 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 485 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 486
496 /* Copy over key_values, if any. */ 487 /* Copy over key_values, if any. */
497 if (key_values) 488 if (src.key_values)
498 { 489 {
499 key_value *tail = 0; 490 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 491 key_values = 0;
503 492
504 for (i = key_values; i; i = i->next) 493 for (key_value *i = src.key_values; i; i = i->next)
505 { 494 {
506 key_value *new_link = new key_value; 495 key_value *new_link = new key_value;
507 496
508 new_link->next = 0; 497 new_link->next = 0;
509 new_link->key = i->key; 498 new_link->key = i->key;
510 new_link->value = i->value; 499 new_link->value = i->value;
511 500
512 /* Try and be clever here, too. */ 501 /* Try and be clever here, too. */
513 if (!dst->key_values) 502 if (!key_values)
514 { 503 {
515 dst->key_values = new_link; 504 key_values = new_link;
516 tail = new_link; 505 tail = new_link;
517 } 506 }
518 else 507 else
519 { 508 {
520 tail->next = new_link; 509 tail->next = new_link;
521 tail = new_link; 510 tail = new_link;
522 } 511 }
523 } 512 }
524 } 513 }
514}
515
516/*
517 * copy_to first frees everything allocated by the dst object,
518 * and then copies the contents of itself into the second
519 * object, allocating what needs to be allocated. Basically, any
520 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
521 * if the first object is freed, the pointers in the new object
522 * will point at garbage.
523 */
524void
525object::copy_to (object *dst)
526{
527 *dst = *this;
528
529 if (speed < 0)
530 dst->speed_left = speed_left - rndm ();
525 531
526 dst->set_speed (dst->speed); 532 dst->set_speed (dst->speed);
533}
534
535void
536object::instantiate ()
537{
538 if (!uuid.seq) // HACK
539 uuid = gen_uuid ();
540
541 speed_left = -0.1f;
542 /* copy the body_info to the body_used - this is only really
543 * need for monsters, but doesn't hurt to do it for everything.
544 * by doing so, when a monster is created, it has good starting
545 * values for the body_used info, so when items are created
546 * for it, they can be properly equipped.
547 */
548 memcpy (body_used, body_info, sizeof (body_used));
549
550 attachable::instantiate ();
527} 551}
528 552
529object * 553object *
530object::clone () 554object::clone ()
531{ 555{
589 * UP_OBJ_FACE: only the objects face has changed. 613 * UP_OBJ_FACE: only the objects face has changed.
590 */ 614 */
591void 615void
592update_object (object *op, int action) 616update_object (object *op, int action)
593{ 617{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 618 if (op == NULL)
597 { 619 {
598 /* this should never happen */ 620 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 621 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 622 return;
670 face = blank_face; 692 face = blank_face;
671} 693}
672 694
673object::~object () 695object::~object ()
674{ 696{
697 unlink ();
698
675 free_key_values (this); 699 free_key_values (this);
676} 700}
677 701
678static int object_count; 702static int object_count;
679 703
687 objects.insert (this); 711 objects.insert (this);
688} 712}
689 713
690void object::unlink () 714void object::unlink ()
691{ 715{
692 assert (index);//D 716 if (!index)
717 return;
718
693 objects.erase (this); 719 objects.erase (this);
694 refcnt_dec (); 720 refcnt_dec ();
695} 721}
696 722
697void 723void
771 * drop on that space. 797 * drop on that space.
772 */ 798 */
773 if (!drop_to_ground 799 if (!drop_to_ground
774 || !map 800 || !map
775 || map->in_memory != MAP_IN_MEMORY 801 || map->in_memory != MAP_IN_MEMORY
802 || map->nodrop
776 || ms ().move_block == MOVE_ALL) 803 || ms ().move_block == MOVE_ALL)
777 { 804 {
778 while (inv) 805 while (inv)
779 { 806 {
780 inv->destroy_inv (drop_to_ground); 807 inv->destroy_inv (drop_to_ground);
896 * This function removes the object op from the linked list of objects 923 * This function removes the object op from the linked list of objects
897 * which it is currently tied to. When this function is done, the 924 * which it is currently tied to. When this function is done, the
898 * object will have no environment. If the object previously had an 925 * object will have no environment. If the object previously had an
899 * environment, the x and y coordinates will be updated to 926 * environment, the x and y coordinates will be updated to
900 * the previous environment. 927 * the previous environment.
901 * Beware: This function is called from the editor as well!
902 */ 928 */
903void 929void
904object::remove_slow () 930object::do_remove ()
905{ 931{
906 object *tmp, *last = 0; 932 object *tmp, *last = 0;
907 object *otmp; 933 object *otmp;
908 934
909 if (QUERY_FLAG (this, FLAG_REMOVED)) 935 if (QUERY_FLAG (this, FLAG_REMOVED))
952 } 978 }
953 else if (map) 979 else if (map)
954 { 980 {
955 if (type == PLAYER) 981 if (type == PLAYER)
956 { 982 {
983 // leaving a spot always closes any open container on the ground
984 if (container && !container->env)
985 // this causes spurious floorbox updates, but it ensures
986 // that the CLOSE event is being sent.
987 close_container ();
988
957 --map->players; 989 --map->players;
958 map->touch (); 990 map->touch ();
959 } 991 }
960 992
961 map->dirty = true; 993 map->dirty = true;
1076 return top; 1108 return top;
1077 } 1109 }
1078 } 1110 }
1079 1111
1080 return 0; 1112 return 0;
1113}
1114
1115void
1116object::expand_tail ()
1117{
1118 if (more)
1119 return;
1120
1121 object *prev = this;
1122
1123 for (archetype *at = arch->more; at; at = at->more)
1124 {
1125 object *op = arch_to_object (at);
1126
1127 op->name = name;
1128 op->name_pl = name_pl;
1129 op->title = title;
1130
1131 op->head = this;
1132 prev->more = op;
1133
1134 prev = op;
1135 }
1081} 1136}
1082 1137
1083/* 1138/*
1084 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1139 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1085 * job preparing multi-part monsters. 1140 * job preparing multi-part monsters.
1117 * just 'op' otherwise 1172 * just 'op' otherwise
1118 */ 1173 */
1119object * 1174object *
1120insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1175insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1121{ 1176{
1177 assert (!op->flag [FLAG_FREED]);
1178
1122 object *tmp, *top, *floor = NULL; 1179 object *tmp, *top, *floor = NULL;
1123 1180
1124 if (QUERY_FLAG (op, FLAG_FREED))
1125 {
1126 LOG (llevError, "Trying to insert freed object!\n");
1127 return NULL;
1128 }
1129
1130 if (!QUERY_FLAG (op, FLAG_REMOVED))
1131 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1132
1133 op->remove (); 1181 op->remove ();
1134 1182
1135 if (!m) 1183#if 0
1136 { 1184 if (!m->active != !op->active)
1137 char *dump = dump_object (op); 1185 if (m->active)
1138 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1186 op->activate_recursive ();
1139 free (dump); 1187 else
1140 return op; 1188 op->deactivate_recursive ();
1141 } 1189#endif
1142 1190
1143 if (out_of_map (m, op->x, op->y)) 1191 if (out_of_map (m, op->x, op->y))
1144 { 1192 {
1145 char *dump = dump_object (op);
1146 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1193 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1147#ifdef MANY_CORES 1194#ifdef MANY_CORES
1148 /* Better to catch this here, as otherwise the next use of this object 1195 /* Better to catch this here, as otherwise the next use of this object
1149 * is likely to cause a crash. Better to find out where it is getting 1196 * is likely to cause a crash. Better to find out where it is getting
1150 * improperly inserted. 1197 * improperly inserted.
1151 */ 1198 */
1152 abort (); 1199 abort ();
1153#endif 1200#endif
1154 free (dump);
1155 return op; 1201 return op;
1156 } 1202 }
1157 1203
1158 if (object *more = op->more) 1204 if (object *more = op->more)
1159 { 1205 {
1256 * looks like instead of lots of conditions here. 1302 * looks like instead of lots of conditions here.
1257 * makes things faster, and effectively the same result. 1303 * makes things faster, and effectively the same result.
1258 */ 1304 */
1259 1305
1260 /* Have object 'fall below' other objects that block view. 1306 /* Have object 'fall below' other objects that block view.
1261 * Unless those objects are exits, type 66 1307 * Unless those objects are exits.
1262 * If INS_ON_TOP is used, don't do this processing 1308 * If INS_ON_TOP is used, don't do this processing
1263 * Need to find the object that in fact blocks view, otherwise 1309 * Need to find the object that in fact blocks view, otherwise
1264 * stacking is a bit odd. 1310 * stacking is a bit odd.
1265 */ 1311 */
1266 if (!(flag & INS_ON_TOP) 1312 if (!(flag & INS_ON_TOP)
1267 && ms.flags () & P_BLOCKSVIEW 1313 && ms.flags () & P_BLOCKSVIEW
1268 && (op->face && !op->face->visibility)) 1314 && (op->face && !faces [op->face].visibility))
1269 { 1315 {
1270 for (last = top; last != floor; last = last->below) 1316 for (last = top; last != floor; last = last->below)
1271 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1317 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1272 break; 1318 break;
1273 1319
1399} 1445}
1400 1446
1401object * 1447object *
1402object::insert_at (object *where, object *originator, int flags) 1448object::insert_at (object *where, object *originator, int flags)
1403{ 1449{
1404 where->map->insert (this, where->x, where->y, originator, flags); 1450 return where->map->insert (this, where->x, where->y, originator, flags);
1405} 1451}
1406 1452
1407/* 1453/*
1408 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1454 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1409 * is returned contains nr objects, and the remaining parts contains 1455 * is returned contains nr objects, and the remaining parts contains
1449 * the amount of an object. If the amount reaches 0, the object 1495 * the amount of an object. If the amount reaches 0, the object
1450 * is subsequently removed and freed. 1496 * is subsequently removed and freed.
1451 * 1497 *
1452 * Return value: 'op' if something is left, NULL if the amount reached 0 1498 * Return value: 'op' if something is left, NULL if the amount reached 0
1453 */ 1499 */
1454
1455object * 1500object *
1456decrease_ob_nr (object *op, uint32 i) 1501decrease_ob_nr (object *op, uint32 i)
1457{ 1502{
1458 object *tmp; 1503 object *tmp;
1459 1504
1534 1579
1535/* 1580/*
1536 * add_weight(object, weight) adds the specified weight to an object, 1581 * add_weight(object, weight) adds the specified weight to an object,
1537 * and also updates how much the environment(s) is/are carrying. 1582 * and also updates how much the environment(s) is/are carrying.
1538 */ 1583 */
1539
1540void 1584void
1541add_weight (object *op, signed long weight) 1585add_weight (object *op, signed long weight)
1542{ 1586{
1543 while (op != NULL) 1587 while (op != NULL)
1544 { 1588 {
1576 * inside the object environment. 1620 * inside the object environment.
1577 * 1621 *
1578 * The function returns now pointer to inserted item, and return value can 1622 * The function returns now pointer to inserted item, and return value can
1579 * be != op, if items are merged. -Tero 1623 * be != op, if items are merged. -Tero
1580 */ 1624 */
1581
1582object * 1625object *
1583object::insert (object *op) 1626object::insert (object *op)
1584{ 1627{
1585 object *tmp, *otmp; 1628 object *tmp, *otmp;
1586 1629
1746 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1789 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1747 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1790 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1748 { 1791 {
1749 1792
1750 float 1793 float
1751 diff = tmp->move_slow_penalty * FABS (op->speed); 1794 diff = tmp->move_slow_penalty * fabs (op->speed);
1752 1795
1753 if (op->type == PLAYER) 1796 if (op->type == PLAYER)
1754 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1797 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1755 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1798 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1756 diff /= 4.0; 1799 diff /= 4.0;
1963 } 2006 }
1964 2007
1965 if (!index) 2008 if (!index)
1966 return -1; 2009 return -1;
1967 2010
1968 return altern[RANDOM () % index]; 2011 return altern [rndm (index)];
1969} 2012}
1970 2013
1971/* 2014/*
1972 * find_first_free_spot(archetype, maptile, x, y) works like 2015 * find_first_free_spot(archetype, maptile, x, y) works like
1973 * find_free_spot(), but it will search max number of squares. 2016 * find_free_spot(), but it will search max number of squares.
1994{ 2037{
1995 arr += begin; 2038 arr += begin;
1996 end -= begin; 2039 end -= begin;
1997 2040
1998 while (--end) 2041 while (--end)
1999 swap (arr [end], arr [RANDOM () % (end + 1)]); 2042 swap (arr [end], arr [rndm (end + 1)]);
2000} 2043}
2001 2044
2002/* new function to make monster searching more efficient, and effective! 2045/* new function to make monster searching more efficient, and effective!
2003 * This basically returns a randomized array (in the passed pointer) of 2046 * This basically returns a randomized array (in the passed pointer) of
2004 * the spaces to find monsters. In this way, it won't always look for 2047 * the spaces to find monsters. In this way, it won't always look for
2316 insert_ob_in_ob (object_create_clone (item), dst); 2359 insert_ob_in_ob (object_create_clone (item), dst);
2317 2360
2318 return dst; 2361 return dst;
2319} 2362}
2320 2363
2321/* GROS - Creates an object using a string representing its content. */
2322/* Basically, we save the content of the string to a temp file, then call */
2323/* load_object on it. I admit it is a highly inefficient way to make things, */
2324/* but it was simple to make and allows reusing the load_object function. */
2325/* Remember not to use load_object_str in a time-critical situation. */
2326/* Also remember that multiparts objects are not supported for now. */
2327object *
2328load_object_str (const char *obstr)
2329{
2330 object *op;
2331 char filename[MAX_BUF];
2332
2333 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2334
2335 FILE *tempfile = fopen (filename, "w");
2336
2337 if (tempfile == NULL)
2338 {
2339 LOG (llevError, "Error - Unable to access load object temp file\n");
2340 return NULL;
2341 }
2342
2343 fprintf (tempfile, obstr);
2344 fclose (tempfile);
2345
2346 op = object::create ();
2347
2348 object_thawer thawer (filename);
2349
2350 if (thawer)
2351 load_object (thawer, op, 0);
2352
2353 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2354 CLEAR_FLAG (op, FLAG_REMOVED);
2355
2356 return op;
2357}
2358
2359/* This returns the first object in who's inventory that 2364/* This returns the first object in who's inventory that
2360 * has the same type and subtype match. 2365 * has the same type and subtype match.
2361 * returns NULL if no match. 2366 * returns NULL if no match.
2362 */ 2367 */
2363object * 2368object *
2416 if (link->key == canonical_key) 2421 if (link->key == canonical_key)
2417 return link->value; 2422 return link->value;
2418 2423
2419 return 0; 2424 return 0;
2420} 2425}
2421
2422 2426
2423/* 2427/*
2424 * Updates the canonical_key in op to value. 2428 * Updates the canonical_key in op to value.
2425 * 2429 *
2426 * canonical_key is a shared string (value doesn't have to be). 2430 * canonical_key is a shared string (value doesn't have to be).
2566{ 2570{
2567 char flagdesc[512]; 2571 char flagdesc[512];
2568 char info2[256 * 4]; 2572 char info2[256 * 4];
2569 char *p = info; 2573 char *p = info;
2570 2574
2571 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2575 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2572 count, uuid.seq, 2576 count, uuid.seq,
2573 &name, 2577 &name,
2574 title ? "\",title:\"" : "", 2578 title ? "\",title:\"" : "",
2575 title ? (const char *)title : "", 2579 title ? (const char *)title : "",
2576 flag_desc (flagdesc, 512), type); 2580 flag_desc (flagdesc, 512), type);
2596{ 2600{
2597 static char info[256 * 4]; 2601 static char info[256 * 4];
2598 return debug_desc (info); 2602 return debug_desc (info);
2599} 2603}
2600 2604
2605struct region *
2606object::region () const
2607{
2608 return map ? map->region (x, y)
2609 : region::default_region ();
2610}
2611
2612const materialtype_t *
2613object::dominant_material () const
2614{
2615 if (materialtype_t *mat = name_to_material (materialname))
2616 return mat;
2617
2618 // omfg this is slow, this has to be temporary :)
2619 shstr unknown ("unknown");
2620
2621 return name_to_material (unknown);
2622}
2623
2624void
2625object::open_container (object *new_container)
2626{
2627 if (container == new_container)
2628 return;
2629
2630 if (object *old_container = container)
2631 {
2632 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2633 return;
2634
2635#if 0
2636 // remove the "Close old_container" object.
2637 if (object *closer = old_container->inv)
2638 if (closer->type == CLOSE_CON)
2639 closer->destroy ();
2640#endif
2641
2642 old_container->flag [FLAG_APPLIED] = 0;
2643 container = 0;
2644
2645 esrv_update_item (UPD_FLAGS, this, old_container);
2646 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2647 }
2648
2649 if (new_container)
2650 {
2651 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2652 return;
2653
2654 // TODO: this does not seem to serve any purpose anymore?
2655#if 0
2656 // insert the "Close Container" object.
2657 if (archetype *closer = new_container->other_arch)
2658 {
2659 object *closer = arch_to_object (new_container->other_arch);
2660 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2661 new_container->insert (closer);
2662 }
2663#endif
2664
2665 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2666
2667 new_container->flag [FLAG_APPLIED] = 1;
2668 container = new_container;
2669
2670 esrv_update_item (UPD_FLAGS, this, new_container);
2671 esrv_send_inventory (this, new_container);
2672 }
2673}
2674
2675

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines