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.273 by root, Sat Dec 27 04:15:56 2008 UTC vs.
Revision 1.280 by root, Thu Jan 8 19:23:44 2009 UTC

963 963
964void 964void
965object::do_destroy () 965object::do_destroy ()
966{ 966{
967 if (flag [FLAG_IS_LINKED]) 967 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 968 remove_link ();
969 969
970 if (flag [FLAG_FRIENDLY]) 970 if (flag [FLAG_FRIENDLY])
971 remove_friendly_object (this); 971 remove_friendly_object (this);
972 972
973 remove (); 973 remove ();
1286 1286
1287 /* Ideally, the caller figures this out. However, it complicates a lot 1287 /* Ideally, the caller figures this out. However, it complicates a lot
1288 * of areas of callers (eg, anything that uses find_free_spot would now 1288 * of areas of callers (eg, anything that uses find_free_spot would now
1289 * need extra work 1289 * need extra work
1290 */ 1290 */
1291 maptile *newmap = m;
1291 if (!xy_normalise (m, op->x, op->y)) 1292 if (!xy_normalise (newmap, op->x, op->y))
1292 { 1293 {
1293 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found 1294 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1294 return 0; 1295 return 0;
1295 } 1296 }
1296 1297
1298 if (!insert_ob_in_map (more, m, originator, flag)) 1299 if (!insert_ob_in_map (more, m, originator, flag))
1299 return 0; 1300 return 0;
1300 1301
1301 CLEAR_FLAG (op, FLAG_REMOVED); 1302 CLEAR_FLAG (op, FLAG_REMOVED);
1302 1303
1303 op->map = m; 1304 op->map = newmap;
1304 mapspace &ms = op->ms (); 1305 mapspace &ms = op->ms ();
1305 1306
1306 /* this has to be done after we translate the coordinates. 1307 /* this has to be done after we translate the coordinates.
1307 */ 1308 */
1308 if (op->nrof && !(flag & INS_NO_MERGE)) 1309 if (op->nrof && !(flag & INS_NO_MERGE))
1493/* this function inserts an object in the map, but if it 1494/* this function inserts an object in the map, but if it
1494 * finds an object of its own type, it'll remove that one first. 1495 * finds an object of its own type, it'll remove that one first.
1495 * op is the object to insert it under: supplies x and the map. 1496 * op is the object to insert it under: supplies x and the map.
1496 */ 1497 */
1497void 1498void
1498replace_insert_ob_in_map (const char *arch_string, object *op) 1499replace_insert_ob_in_map (shstr_tmp archname, object *op)
1499{ 1500{
1500 /* first search for itself and remove any old instances */ 1501 /* first search for itself and remove any old instances */
1501 1502
1502 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1503 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1503 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1504 if (tmp->arch->archname == archname) /* same archetype */
1504 tmp->destroy (); 1505 tmp->destroy ();
1505 1506
1506 object *tmp = arch_to_object (archetype::find (arch_string)); 1507 object *tmp = arch_to_object (archetype::find (archname));
1507 1508
1508 tmp->x = op->x; 1509 tmp->x = op->x;
1509 tmp->y = op->y; 1510 tmp->y = op->y;
1510 1511
1511 insert_ob_in_map (tmp, op->map, op, 0); 1512 insert_ob_in_map (tmp, op->map, op, 0);
2056 * there is capable of. 2057 * there is capable of.
2057 */ 2058 */
2058int 2059int
2059find_dir (maptile *m, int x, int y, object *exclude) 2060find_dir (maptile *m, int x, int y, object *exclude)
2060{ 2061{
2061 int i, max = SIZEOFFREE, mflags; 2062 int max = SIZEOFFREE, mflags;
2062
2063 sint16 nx, ny;
2064 object *tmp;
2065 maptile *mp;
2066
2067 MoveType blocked, move_type; 2063 MoveType move_type;
2068 2064
2069 if (exclude && exclude->head_ () != exclude) 2065 if (exclude && exclude->head_ () != exclude)
2070 { 2066 {
2071 exclude = exclude->head; 2067 exclude = exclude->head;
2072 move_type = exclude->move_type; 2068 move_type = exclude->move_type;
2075 { 2071 {
2076 /* If we don't have anything, presume it can use all movement types. */ 2072 /* If we don't have anything, presume it can use all movement types. */
2077 move_type = MOVE_ALL; 2073 move_type = MOVE_ALL;
2078 } 2074 }
2079 2075
2080 for (i = 1; i < max; i++) 2076 for (int i = 1; i < max; i++)
2081 { 2077 {
2082 mp = m; 2078 mapxy pos (m, x, y);
2083 nx = x + freearr_x[i]; 2079 pos.move (i);
2084 ny = y + freearr_y[i];
2085 2080
2086 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2081 if (!pos.normalise ())
2087
2088 if (mflags & P_OUT_OF_MAP)
2089 max = maxfree[i]; 2082 max = maxfree[i];
2090 else 2083 else
2091 { 2084 {
2092 mapspace &ms = mp->at (nx, ny); 2085 mapspace &ms = *pos;
2093 2086
2094 blocked = ms.move_block;
2095
2096 if ((move_type & blocked) == move_type) 2087 if ((move_type & ms.move_block) == move_type)
2097 max = maxfree[i]; 2088 max = maxfree [i];
2098 else if (mflags & P_IS_ALIVE) 2089 else if (ms.flags () & P_IS_ALIVE)
2099 { 2090 {
2100 for (tmp = ms.bot; tmp; tmp = tmp->above) 2091 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2101 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) 2092 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2102 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2093 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2103 break;
2104
2105 if (tmp)
2106 return freedir[i]; 2094 return freedir [i];
2107 } 2095 }
2108 } 2096 }
2109 } 2097 }
2110 2098
2111 return 0; 2099 return 0;
2186 * This basically means that if direction is 15, then it could either go 2174 * This basically means that if direction is 15, then it could either go
2187 * direction 4, 14, or 16 to get back to where we are. 2175 * direction 4, 14, or 16 to get back to where we are.
2188 * Moved from spell_util.c to object.c with the other related direction 2176 * Moved from spell_util.c to object.c with the other related direction
2189 * functions. 2177 * functions.
2190 */ 2178 */
2191int reduction_dir[SIZEOFFREE][3] = { 2179const int reduction_dir[SIZEOFFREE][3] = {
2192 {0, 0, 0}, /* 0 */ 2180 {0, 0, 0}, /* 0 */
2193 {0, 0, 0}, /* 1 */ 2181 {0, 0, 0}, /* 1 */
2194 {0, 0, 0}, /* 2 */ 2182 {0, 0, 0}, /* 2 */
2195 {0, 0, 0}, /* 3 */ 2183 {0, 0, 0}, /* 3 */
2196 {0, 0, 0}, /* 4 */ 2184 {0, 0, 0}, /* 4 */
2334 return tmp; 2322 return tmp;
2335 2323
2336 return 0; 2324 return 0;
2337} 2325}
2338 2326
2339const shstr & 2327shstr_tmp
2340object::kv_get (const shstr &key) const 2328object::kv_get (shstr_tmp key) const
2341{ 2329{
2342 for (key_value *kv = key_values; kv; kv = kv->next) 2330 for (key_value *kv = key_values; kv; kv = kv->next)
2343 if (kv->key == key) 2331 if (kv->key == key)
2344 return kv->value; 2332 return kv->value;
2345 2333
2346 return shstr_null; 2334 return shstr ();
2347} 2335}
2348 2336
2349void 2337void
2350object::kv_set (const shstr &key, const shstr &value) 2338object::kv_set (shstr_tmp key, shstr_tmp value)
2351{ 2339{
2352 for (key_value *kv = key_values; kv; kv = kv->next) 2340 for (key_value *kv = key_values; kv; kv = kv->next)
2353 if (kv->key == key) 2341 if (kv->key == key)
2354 { 2342 {
2355 kv->value = value; 2343 kv->value = value;
2364 2352
2365 key_values = kv; 2353 key_values = kv;
2366} 2354}
2367 2355
2368void 2356void
2369object::kv_del (const shstr &key) 2357object::kv_del (shstr_tmp key)
2370{ 2358{
2371 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2359 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2372 if ((*kvp)->key == key) 2360 if ((*kvp)->key == key)
2373 { 2361 {
2374 key_value *kv = *kvp; 2362 key_value *kv = *kvp;
2543// else if (!old_container->env && contr && contr->ns) 2531// else if (!old_container->env && contr && contr->ns)
2544// contr->ns->floorbox_reset (); 2532// contr->ns->floorbox_reset ();
2545} 2533}
2546 2534
2547object * 2535object *
2548object::force_find (const shstr name) 2536object::force_find (shstr_tmp name)
2549{ 2537{
2550 /* cycle through his inventory to look for the MARK we want to 2538 /* cycle through his inventory to look for the MARK we want to
2551 * place 2539 * place
2552 */ 2540 */
2553 for (object *tmp = inv; tmp; tmp = tmp->below) 2541 for (object *tmp = inv; tmp; tmp = tmp->below)
2556 2544
2557 return 0; 2545 return 0;
2558} 2546}
2559 2547
2560object * 2548object *
2561object::force_add (const shstr name, int duration) 2549object::force_add (shstr_tmp name, int duration)
2562{ 2550{
2563 if (object *force = force_find (name)) 2551 if (object *force = force_find (name))
2564 force->destroy (); 2552 force->destroy ();
2565 2553
2566 object *force = get_archetype (FORCE_NAME); 2554 object *force = get_archetype (FORCE_NAME);
2575 2563
2576 return insert (force); 2564 return insert (force);
2577} 2565}
2578 2566
2579void 2567void
2580object::play_sound (faceidx sound) 2568object::play_sound (faceidx sound) const
2581{ 2569{
2582 if (!sound) 2570 if (!sound)
2583 return; 2571 return;
2584 2572
2585 if (flag [FLAG_REMOVED]) 2573 if (is_on_map ())
2586 return;
2587
2588 if (env)
2589 {
2590 if (object *pl = in_player ())
2591 pl->contr->play_sound (sound);
2592 }
2593 else
2594 map->play_sound (sound, x, y); 2574 map->play_sound (sound, x, y);
2575 else if (object *pl = in_player ())
2576 pl->contr->play_sound (sound);
2577}
2578
2579void
2580object::say_msg (const char *msg) const
2581{
2582 if (is_on_map ())
2583 map->say_msg (msg, x, y);
2584 else if (object *pl = in_player ())
2585 pl->contr->play_sound (sound);
2595} 2586}
2596 2587
2597void 2588void
2598object::make_noise () 2589object::make_noise ()
2599{ 2590{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines