1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
… | |
… | |
32 | #include <bitset> |
32 | #include <bitset> |
33 | |
33 | |
34 | UUID UUID::cur; |
34 | UUID UUID::cur; |
35 | static uint64_t seq_next_save; |
35 | static uint64_t seq_next_save; |
36 | static const uint64 UUID_GAP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
37 | uint32_t mapspace::smellcount; |
37 | uint32_t mapspace::smellcount = 10000; |
38 | |
38 | |
39 | objectvec objects; |
39 | objectvec objects; |
40 | activevec actives; |
40 | activevec actives; |
41 | |
41 | |
42 | short freearr_x[SIZEOFFREE] = { |
42 | short freearr_x[SIZEOFFREE] = { |
… | |
… | |
963 | |
963 | |
964 | void |
964 | void |
965 | object::do_destroy () |
965 | object::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 (); |
… | |
… | |
1097 | |
1097 | |
1098 | if (object *pl = ms.player ()) |
1098 | if (object *pl = ms.player ()) |
1099 | { |
1099 | { |
1100 | if (is_player ()) |
1100 | if (is_player ()) |
1101 | { |
1101 | { |
|
|
1102 | if (!flag [FLAG_WIZPASS]) |
1102 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
1103 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
1103 | |
1104 | |
1104 | // leaving a spot always closes any open container on the ground |
1105 | // leaving a spot always closes any open container on the ground |
1105 | if (container && !container->env) |
1106 | if (container && !container->env) |
1106 | // this causes spurious floorbox updates, but it ensures |
1107 | // this causes spurious floorbox updates, but it ensures |
1107 | // that the CLOSE event is being sent. |
1108 | // that the CLOSE event is being sent. |
… | |
… | |
1285 | |
1286 | |
1286 | /* Ideally, the caller figures this out. However, it complicates a lot |
1287 | /* Ideally, the caller figures this out. However, it complicates a lot |
1287 | * 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 |
1288 | * need extra work |
1289 | * need extra work |
1289 | */ |
1290 | */ |
|
|
1291 | maptile *newmap = m; |
1290 | if (!xy_normalise (m, op->x, op->y)) |
1292 | if (!xy_normalise (newmap, op->x, op->y)) |
1291 | { |
1293 | { |
1292 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1294 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1293 | return 0; |
1295 | return 0; |
1294 | } |
1296 | } |
1295 | |
1297 | |
… | |
… | |
1297 | if (!insert_ob_in_map (more, m, originator, flag)) |
1299 | if (!insert_ob_in_map (more, m, originator, flag)) |
1298 | return 0; |
1300 | return 0; |
1299 | |
1301 | |
1300 | CLEAR_FLAG (op, FLAG_REMOVED); |
1302 | CLEAR_FLAG (op, FLAG_REMOVED); |
1301 | |
1303 | |
1302 | op->map = m; |
1304 | op->map = newmap; |
1303 | mapspace &ms = op->ms (); |
1305 | mapspace &ms = op->ms (); |
1304 | |
1306 | |
1305 | /* this has to be done after we translate the coordinates. |
1307 | /* this has to be done after we translate the coordinates. |
1306 | */ |
1308 | */ |
1307 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1309 | if (op->nrof && !(flag & INS_NO_MERGE)) |
… | |
… | |
1492 | /* this function inserts an object in the map, but if it |
1494 | /* this function inserts an object in the map, but if it |
1493 | * 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. |
1494 | * 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. |
1495 | */ |
1497 | */ |
1496 | void |
1498 | void |
1497 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1499 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1498 | { |
1500 | { |
1499 | /* first search for itself and remove any old instances */ |
1501 | /* first search for itself and remove any old instances */ |
1500 | |
1502 | |
1501 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1503 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1502 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1504 | if (tmp->arch->archname == archname) /* same archetype */ |
1503 | tmp->destroy (); |
1505 | tmp->destroy (); |
1504 | |
1506 | |
1505 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1507 | object *tmp = arch_to_object (archetype::find (archname)); |
1506 | |
1508 | |
1507 | tmp->x = op->x; |
1509 | tmp->x = op->x; |
1508 | tmp->y = op->y; |
1510 | tmp->y = op->y; |
1509 | |
1511 | |
1510 | insert_ob_in_map (tmp, op->map, op, 0); |
1512 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
2055 | * there is capable of. |
2057 | * there is capable of. |
2056 | */ |
2058 | */ |
2057 | int |
2059 | int |
2058 | find_dir (maptile *m, int x, int y, object *exclude) |
2060 | find_dir (maptile *m, int x, int y, object *exclude) |
2059 | { |
2061 | { |
2060 | int i, max = SIZEOFFREE, mflags; |
2062 | int max = SIZEOFFREE, mflags; |
2061 | |
|
|
2062 | sint16 nx, ny; |
|
|
2063 | object *tmp; |
|
|
2064 | maptile *mp; |
|
|
2065 | |
|
|
2066 | MoveType blocked, move_type; |
2063 | MoveType move_type; |
2067 | |
2064 | |
2068 | if (exclude && exclude->head_ () != exclude) |
2065 | if (exclude && exclude->head_ () != exclude) |
2069 | { |
2066 | { |
2070 | exclude = exclude->head; |
2067 | exclude = exclude->head; |
2071 | move_type = exclude->move_type; |
2068 | move_type = exclude->move_type; |
… | |
… | |
2074 | { |
2071 | { |
2075 | /* 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. */ |
2076 | move_type = MOVE_ALL; |
2073 | move_type = MOVE_ALL; |
2077 | } |
2074 | } |
2078 | |
2075 | |
2079 | for (i = 1; i < max; i++) |
2076 | for (int i = 1; i < max; i++) |
2080 | { |
2077 | { |
2081 | mp = m; |
2078 | mapxy pos (m, x, y); |
2082 | nx = x + freearr_x[i]; |
2079 | pos.move (i); |
2083 | ny = y + freearr_y[i]; |
|
|
2084 | |
2080 | |
2085 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2081 | if (!pos.normalise ()) |
2086 | |
|
|
2087 | if (mflags & P_OUT_OF_MAP) |
|
|
2088 | max = maxfree[i]; |
2082 | max = maxfree[i]; |
2089 | else |
2083 | else |
2090 | { |
2084 | { |
2091 | mapspace &ms = mp->at (nx, ny); |
2085 | mapspace &ms = *pos; |
2092 | |
2086 | |
2093 | blocked = ms.move_block; |
|
|
2094 | |
|
|
2095 | if ((move_type & blocked) == move_type) |
2087 | if ((move_type & ms.move_block) == move_type) |
2096 | max = maxfree[i]; |
2088 | max = maxfree [i]; |
2097 | else if (mflags & P_IS_ALIVE) |
2089 | else if (ms.flags () & P_IS_ALIVE) |
2098 | { |
2090 | { |
2099 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2091 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2100 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2092 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2101 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2093 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2102 | break; |
|
|
2103 | |
|
|
2104 | if (tmp) |
|
|
2105 | return freedir[i]; |
2094 | return freedir [i]; |
2106 | } |
2095 | } |
2107 | } |
2096 | } |
2108 | } |
2097 | } |
2109 | |
2098 | |
2110 | return 0; |
2099 | return 0; |
… | |
… | |
2185 | * 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 |
2186 | * 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. |
2187 | * 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 |
2188 | * functions. |
2177 | * functions. |
2189 | */ |
2178 | */ |
2190 | int reduction_dir[SIZEOFFREE][3] = { |
2179 | const int reduction_dir[SIZEOFFREE][3] = { |
2191 | {0, 0, 0}, /* 0 */ |
2180 | {0, 0, 0}, /* 0 */ |
2192 | {0, 0, 0}, /* 1 */ |
2181 | {0, 0, 0}, /* 1 */ |
2193 | {0, 0, 0}, /* 2 */ |
2182 | {0, 0, 0}, /* 2 */ |
2194 | {0, 0, 0}, /* 3 */ |
2183 | {0, 0, 0}, /* 3 */ |
2195 | {0, 0, 0}, /* 4 */ |
2184 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2333 | return tmp; |
2322 | return tmp; |
2334 | |
2323 | |
2335 | return 0; |
2324 | return 0; |
2336 | } |
2325 | } |
2337 | |
2326 | |
2338 | const shstr & |
2327 | shstr_tmp |
2339 | object::kv_get (const shstr &key) const |
2328 | object::kv_get (shstr_tmp key) const |
2340 | { |
2329 | { |
2341 | for (key_value *kv = key_values; kv; kv = kv->next) |
2330 | for (key_value *kv = key_values; kv; kv = kv->next) |
2342 | if (kv->key == key) |
2331 | if (kv->key == key) |
2343 | return kv->value; |
2332 | return kv->value; |
2344 | |
2333 | |
2345 | return shstr_null; |
2334 | return shstr (); |
2346 | } |
2335 | } |
2347 | |
2336 | |
2348 | void |
2337 | void |
2349 | object::kv_set (const shstr &key, const shstr &value) |
2338 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2350 | { |
2339 | { |
2351 | for (key_value *kv = key_values; kv; kv = kv->next) |
2340 | for (key_value *kv = key_values; kv; kv = kv->next) |
2352 | if (kv->key == key) |
2341 | if (kv->key == key) |
2353 | { |
2342 | { |
2354 | kv->value = value; |
2343 | kv->value = value; |
… | |
… | |
2363 | |
2352 | |
2364 | key_values = kv; |
2353 | key_values = kv; |
2365 | } |
2354 | } |
2366 | |
2355 | |
2367 | void |
2356 | void |
2368 | object::kv_del (const shstr &key) |
2357 | object::kv_del (shstr_tmp key) |
2369 | { |
2358 | { |
2370 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2359 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2371 | if ((*kvp)->key == key) |
2360 | if ((*kvp)->key == key) |
2372 | { |
2361 | { |
2373 | key_value *kv = *kvp; |
2362 | key_value *kv = *kvp; |
… | |
… | |
2504 | container = 0; |
2493 | container = 0; |
2505 | |
2494 | |
2506 | // client needs item update to make it work, client bug requires this to be separate |
2495 | // client needs item update to make it work, client bug requires this to be separate |
2507 | esrv_update_item (UPD_FLAGS, this, old_container); |
2496 | esrv_update_item (UPD_FLAGS, this, old_container); |
2508 | |
2497 | |
2509 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2498 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ()); |
2510 | play_sound (sound_find ("chest_close")); |
2499 | play_sound (sound_find ("chest_close")); |
2511 | } |
2500 | } |
2512 | |
2501 | |
2513 | if (new_container) |
2502 | if (new_container) |
2514 | { |
2503 | { |
… | |
… | |
2524 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2513 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2525 | new_container->insert (closer); |
2514 | new_container->insert (closer); |
2526 | } |
2515 | } |
2527 | #endif |
2516 | #endif |
2528 | |
2517 | |
2529 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2518 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ()); |
2530 | |
2519 | |
2531 | // make sure the container is available, client bug requires this to be separate |
2520 | // make sure the container is available, client bug requires this to be separate |
2532 | esrv_send_item (this, new_container); |
2521 | esrv_send_item (this, new_container); |
2533 | |
2522 | |
2534 | new_container->flag [FLAG_APPLIED] = true; |
2523 | new_container->flag [FLAG_APPLIED] = true; |
… | |
… | |
2542 | // else if (!old_container->env && contr && contr->ns) |
2531 | // else if (!old_container->env && contr && contr->ns) |
2543 | // contr->ns->floorbox_reset (); |
2532 | // contr->ns->floorbox_reset (); |
2544 | } |
2533 | } |
2545 | |
2534 | |
2546 | object * |
2535 | object * |
2547 | object::force_find (const shstr name) |
2536 | object::force_find (shstr_tmp name) |
2548 | { |
2537 | { |
2549 | /* 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 |
2550 | * place |
2539 | * place |
2551 | */ |
2540 | */ |
2552 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2541 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2555 | |
2544 | |
2556 | return 0; |
2545 | return 0; |
2557 | } |
2546 | } |
2558 | |
2547 | |
2559 | object * |
2548 | object * |
2560 | object::force_add (const shstr name, int duration) |
2549 | object::force_add (shstr_tmp name, int duration) |
2561 | { |
2550 | { |
2562 | if (object *force = force_find (name)) |
2551 | if (object *force = force_find (name)) |
2563 | force->destroy (); |
2552 | force->destroy (); |
2564 | |
2553 | |
2565 | object *force = get_archetype (FORCE_NAME); |
2554 | object *force = get_archetype (FORCE_NAME); |
… | |
… | |
2574 | |
2563 | |
2575 | return insert (force); |
2564 | return insert (force); |
2576 | } |
2565 | } |
2577 | |
2566 | |
2578 | void |
2567 | void |
2579 | object::play_sound (faceidx sound) |
2568 | object::play_sound (faceidx sound) const |
2580 | { |
2569 | { |
2581 | if (!sound) |
2570 | if (!sound) |
2582 | return; |
2571 | return; |
2583 | |
2572 | |
2584 | if (flag [FLAG_REMOVED]) |
2573 | if (is_on_map ()) |
2585 | return; |
|
|
2586 | |
|
|
2587 | if (env) |
|
|
2588 | { |
|
|
2589 | if (object *pl = in_player ()) |
|
|
2590 | pl->contr->play_sound (sound); |
|
|
2591 | } |
|
|
2592 | else |
|
|
2593 | 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 | |
|
|
2579 | void |
|
|
2580 | object::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); |
2594 | } |
2586 | } |
2595 | |
2587 | |
2596 | void |
2588 | void |
2597 | object::make_noise () |
2589 | object::make_noise () |
2598 | { |
2590 | { |