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,2010 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 it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <stdio.h> |
26 | #include <stdio.h> |
26 | #include <sys/types.h> |
27 | #include <sys/types.h> |
27 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
28 | #include <object.h> |
29 | #include <object.h> |
29 | #include <sproto.h> |
30 | #include <sproto.h> |
30 | #include <loader.h> |
|
|
31 | |
31 | |
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 = 10000; |
37 | |
38 | |
38 | objectvec objects; |
39 | objectvec objects; |
39 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | //+GPL |
40 | |
43 | |
41 | short freearr_x[SIZEOFFREE] = { |
44 | short freearr_x[SIZEOFFREE] = { |
42 | 0, |
45 | 0, |
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
46 | 0, 1, 1, 1, 0, -1, -1, -1, |
44 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
47 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
… | |
… | |
48 | 0, |
51 | 0, |
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
52 | -1, -1, 0, 1, 1, 1, 0, -1, |
50 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
53 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
51 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
54 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
52 | }; |
55 | }; |
53 | int maxfree[SIZEOFFREE] = { |
|
|
54 | 0, |
|
|
55 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
56 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
57 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
58 | }; |
|
|
59 | int freedir[SIZEOFFREE] = { |
56 | int freedir[SIZEOFFREE] = { |
60 | 0, |
57 | 0, |
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
58 | 1, 2, 3, 4, 5, 6, 7, 8, |
62 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
59 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
63 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
60 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
64 | }; |
61 | }; |
65 | |
62 | |
|
|
63 | static int maxfree[SIZEOFFREE] = { |
|
|
64 | 0, |
|
|
65 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
66 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
67 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
68 | }; |
|
|
69 | |
66 | static void |
70 | static void |
67 | write_uuid (uval64 skip, bool sync) |
71 | write_uuid (uval64 skip, bool sync) |
68 | { |
72 | { |
69 | CALL_BEGIN (2); |
73 | CALL_BEGIN (2); |
70 | CALL_ARG_SV (newSVval64 (skip)); |
74 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
73 | CALL_END; |
77 | CALL_END; |
74 | } |
78 | } |
75 | |
79 | |
76 | static void |
80 | static void |
77 | read_uuid (void) |
81 | read_uuid () |
78 | { |
82 | { |
79 | char filename[MAX_BUF]; |
83 | char filename[MAX_BUF]; |
80 | |
84 | |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
82 | |
86 | |
… | |
… | |
96 | |
100 | |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | _exit (1); |
102 | _exit (1); |
99 | } |
103 | } |
100 | |
104 | |
101 | UUID::BUF buf; |
105 | char buf [UUID::MAX_LEN]; |
102 | buf[0] = 0; |
106 | buf[0] = 0; |
103 | fgets (buf, sizeof (buf), fp); |
107 | fgets (buf, sizeof (buf), fp); |
104 | |
108 | |
105 | if (!UUID::cur.parse (buf)) |
109 | if (!UUID::cur.parse (buf)) |
106 | { |
110 | { |
… | |
… | |
133 | |
137 | |
134 | void |
138 | void |
135 | UUID::init () |
139 | UUID::init () |
136 | { |
140 | { |
137 | read_uuid (); |
141 | read_uuid (); |
|
|
142 | } |
|
|
143 | |
|
|
144 | bool |
|
|
145 | UUID::parse (const char *s) |
|
|
146 | { |
|
|
147 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
148 | return false; |
|
|
149 | |
|
|
150 | seq = 0; |
|
|
151 | |
|
|
152 | while (*s != '>') |
|
|
153 | { |
|
|
154 | if (*s < '0') |
|
|
155 | return false; |
|
|
156 | |
|
|
157 | // this gives nice branchless code with gcc |
|
|
158 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
159 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
160 | |
|
|
161 | seq = (seq << 4) | digit; |
|
|
162 | |
|
|
163 | ++s; |
|
|
164 | } |
|
|
165 | |
|
|
166 | return true; |
|
|
167 | } |
|
|
168 | |
|
|
169 | char * |
|
|
170 | UUID::append (char *buf) const |
|
|
171 | { |
|
|
172 | *buf++ = '<'; |
|
|
173 | *buf++ = '1'; |
|
|
174 | *buf++ = '.'; |
|
|
175 | |
|
|
176 | uint64_t seq = this->seq; |
|
|
177 | const int bits = 64; |
|
|
178 | char nz = 0; |
|
|
179 | static const char tohex [] = "0123456789abcdef"; |
|
|
180 | |
|
|
181 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
182 | for (int i = bits / 4; --i; ) |
|
|
183 | { |
|
|
184 | uint8_t digit = seq >> (bits - 4); |
|
|
185 | |
|
|
186 | *buf = tohex [digit]; |
|
|
187 | nz |= digit; |
|
|
188 | buf += nz ? 1 : 0; |
|
|
189 | seq <<= 4; |
|
|
190 | } |
|
|
191 | |
|
|
192 | // last digit is special - always emit |
|
|
193 | uint8_t digit = seq >> (bits - 4); |
|
|
194 | *buf++ = tohex [digit]; |
|
|
195 | |
|
|
196 | *buf++ = '>'; |
|
|
197 | |
|
|
198 | return buf; |
|
|
199 | } |
|
|
200 | |
|
|
201 | char * |
|
|
202 | UUID::c_str () const |
|
|
203 | { |
|
|
204 | static char buf [MAX_LEN]; |
|
|
205 | *append (buf) = 0; |
|
|
206 | return buf; |
138 | } |
207 | } |
139 | |
208 | |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
209 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
141 | static bool |
210 | static bool |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
211 | compare_ob_value_lists_one (const object *wants, const object *has) |
143 | { |
212 | { |
144 | key_value *wants_field; |
|
|
145 | |
|
|
146 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
213 | /* n-squared behaviour (see kv_get), but I'm hoping both |
147 | * objects with lists are rare, and lists stay short. If not, use a |
214 | * objects with lists are rare, and lists stay short. If not, use a |
148 | * different structure or at least keep the lists sorted... |
215 | * different structure or at least keep the lists sorted... |
149 | */ |
216 | */ |
150 | |
217 | |
151 | /* For each field in wants, */ |
218 | /* For each field in wants, */ |
152 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
219 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
153 | { |
220 | if (has->kv_get (kv->key) != kv->value) |
154 | key_value *has_field; |
221 | return false; |
155 | |
|
|
156 | /* Look for a field in has with the same key. */ |
|
|
157 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
158 | |
|
|
159 | if (!has_field) |
|
|
160 | return 0; /* No field with that name. */ |
|
|
161 | |
|
|
162 | /* Found the matching field. */ |
|
|
163 | if (has_field->value != wants_field->value) |
|
|
164 | return 0; /* Values don't match, so this half of the comparison is false. */ |
|
|
165 | |
|
|
166 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
167 | } |
|
|
168 | |
222 | |
169 | /* If we get here, every field in wants has a matching field in has. */ |
223 | /* If we get here, every field in wants has a matching field in has. */ |
170 | return 1; |
224 | return true; |
171 | } |
225 | } |
172 | |
226 | |
173 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
227 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 | static bool |
228 | static bool |
175 | compare_ob_value_lists (const object *ob1, const object *ob2) |
229 | compare_ob_value_lists (const object *ob1, const object *ob2) |
176 | { |
230 | { |
177 | /* However, there may be fields in has which aren't partnered in wants, |
231 | /* However, there may be fields in has which aren't partnered in wants, |
178 | * so we need to run the comparison *twice*. :( |
232 | * so we need to run the comparison *twice*. :( |
179 | */ |
233 | */ |
180 | return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
234 | return compare_ob_value_lists_one (ob1, ob2) |
|
|
235 | && compare_ob_value_lists_one (ob2, ob1); |
181 | } |
236 | } |
182 | |
237 | |
183 | /* Function examines the 2 objects given to it, and returns true if |
238 | /* Function examines the 2 objects given to it, and returns true if |
184 | * they can be merged together. |
239 | * they can be merged together. |
185 | * |
240 | * |
… | |
… | |
192 | * Improvements made with merge: Better checking on potion, and also |
247 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
248 | * check weight |
194 | */ |
249 | */ |
195 | bool object::can_merge_slow (object *ob1, object *ob2) |
250 | bool object::can_merge_slow (object *ob1, object *ob2) |
196 | { |
251 | { |
197 | /* A couple quicksanity checks */ |
252 | /* A couple quick sanity checks */ |
198 | if (ob1 == ob2 |
253 | if (ob1 == ob2 |
199 | || ob1->type != ob2->type |
254 | || ob1->type != ob2->type |
200 | || ob1->speed != ob2->speed |
|
|
201 | || ob1->value != ob2->value |
255 | || ob1->value != ob2->value |
202 | || ob1->name != ob2->name) |
256 | || ob1->name != ob2->name |
|
|
257 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
203 | return 0; |
258 | return 0; |
204 | |
259 | |
205 | /* Do not merge objects if nrof would overflow. First part checks |
260 | /* Do not merge objects if nrof would overflow, assume nrof |
206 | * for unsigned overflow (2c), second part checks whether the result |
261 | * is always 0 .. 2**31-1 */ |
207 | * would fit into a 32 bit signed int, which is often used to hold |
262 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
208 | * nrof values. |
|
|
209 | */ |
|
|
210 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
|
|
211 | return 0; |
263 | return 0; |
212 | |
264 | |
213 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
265 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
214 | * This is to the comparison of the flags below will be OK. We |
266 | * This is to the comparison of the flags below will be OK. We |
215 | * just can't ignore the been applied or identified flags, as they |
267 | * just can't ignore the been applied or identified flags, as they |
… | |
… | |
220 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
272 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 | |
273 | |
222 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
274 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
275 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 | |
276 | |
225 | if (ob1->arch->name != ob2->arch->name |
277 | if (ob1->arch->archname != ob2->arch->archname |
226 | || ob1->name != ob2->name |
278 | || ob1->name != ob2->name |
227 | || ob1->title != ob2->title |
279 | || ob1->title != ob2->title |
228 | || ob1->msg != ob2->msg |
280 | || ob1->msg != ob2->msg |
229 | || ob1->weight != ob2->weight |
281 | || ob1->weight != ob2->weight |
230 | || ob1->attacktype != ob2->attacktype |
282 | || ob1->attacktype != ob2->attacktype |
231 | || ob1->magic != ob2->magic |
283 | || ob1->magic != ob2->magic |
232 | || ob1->slaying != ob2->slaying |
284 | || ob1->slaying != ob2->slaying |
233 | || ob1->skill != ob2->skill |
285 | || ob1->skill != ob2->skill |
234 | || ob1->value != ob2->value |
286 | || ob1->value != ob2->value |
235 | || ob1->animation_id != ob2->animation_id |
287 | || ob1->animation_id != ob2->animation_id |
|
|
288 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
236 | || ob1->client_type != ob2->client_type |
289 | || ob1->client_type != ob2->client_type |
237 | || ob1->materialname != ob2->materialname |
290 | || ob1->material != ob2->material |
238 | || ob1->lore != ob2->lore |
291 | || ob1->lore != ob2->lore |
239 | || ob1->subtype != ob2->subtype |
292 | || ob1->subtype != ob2->subtype |
240 | || ob1->move_type != ob2->move_type |
293 | || ob1->move_type != ob2->move_type |
241 | || ob1->move_block != ob2->move_block |
294 | || ob1->move_block != ob2->move_block |
242 | || ob1->move_allow != ob2->move_allow |
295 | || ob1->move_allow != ob2->move_allow |
243 | || ob1->move_on != ob2->move_on |
296 | || ob1->move_on != ob2->move_on |
244 | || ob1->move_off != ob2->move_off |
297 | || ob1->move_off != ob2->move_off |
245 | || ob1->move_slow != ob2->move_slow |
298 | || ob1->move_slow != ob2->move_slow |
246 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
299 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
247 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
300 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
248 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
301 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
249 | return 0; |
302 | return 0; |
250 | |
303 | |
251 | if ((ob1->flag ^ ob2->flag) |
304 | if ((ob1->flag ^ ob2->flag) |
252 | .reset (FLAG_INV_LOCKED) |
305 | .reset (FLAG_INV_LOCKED) |
253 | .reset (FLAG_CLIENT_SENT) |
|
|
254 | .reset (FLAG_REMOVED) |
306 | .reset (FLAG_REMOVED) |
255 | .any ()) |
307 | .any ()) |
256 | return 0; |
308 | return 0; |
257 | |
309 | |
258 | /* This is really a spellbook check - we should in general |
310 | /* This is really a spellbook check - we should in general |
… | |
… | |
340 | { |
392 | { |
341 | // see if we are in a container of sorts |
393 | // see if we are in a container of sorts |
342 | if (env) |
394 | if (env) |
343 | { |
395 | { |
344 | // the player inventory itself is always visible |
396 | // the player inventory itself is always visible |
345 | if (env->type == PLAYER) |
397 | if (env->is_player ()) |
346 | return env; |
398 | return env; |
347 | |
399 | |
348 | // else a player could have our env open |
400 | // else a player could have our env open |
349 | object *envest = env->outer_env (); |
401 | object *envest = env->outer_env_or_self (); |
350 | |
402 | |
351 | // the player itself is always on a map, so we will find him here |
403 | // the player itself is always on a map, so we will find him here |
352 | // even if our inv is in a player. |
404 | // even if our inv is in a player. |
353 | if (envest->is_on_map ()) |
405 | if (envest->is_on_map ()) |
354 | if (object *pl = envest->ms ().player ()) |
406 | if (object *pl = envest->ms ().player ()) |
355 | if (pl->container == env) |
407 | if (pl->container_ () == env) |
356 | return pl; |
408 | return pl; |
357 | } |
409 | } |
358 | else |
410 | else |
359 | { |
411 | { |
360 | // maybe there is a player standing on the same mapspace |
412 | // maybe there is a player standing on the same mapspace |
361 | // this will catch the case where "this" is a player |
413 | // this will catch the case where "this" is a player |
362 | if (object *pl = ms ().player ()) |
414 | if (object *pl = ms ().player ()) |
363 | if (!pl->container || this == pl->container) |
415 | if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look) |
|
|
416 | || pl->container_ () == this) |
364 | return pl; |
417 | return pl; |
365 | } |
418 | } |
366 | } |
419 | } |
367 | |
420 | |
368 | return 0; |
421 | return 0; |
369 | } |
422 | } |
370 | |
423 | |
371 | // adjust weight per container type ("of holding") |
424 | // adjust weight per container type ("of holding") |
372 | static sint32 |
425 | static sint32 |
373 | weight_adjust (object *op, sint32 weight) |
426 | weight_adjust_for (object *op, sint32 weight) |
374 | { |
427 | { |
375 | return op->type == CONTAINER |
428 | return op->type == CONTAINER |
376 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
429 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
377 | : weight; |
430 | : weight; |
378 | } |
431 | } |
… | |
… | |
384 | static void |
437 | static void |
385 | adjust_weight (object *op, sint32 weight) |
438 | adjust_weight (object *op, sint32 weight) |
386 | { |
439 | { |
387 | while (op) |
440 | while (op) |
388 | { |
441 | { |
|
|
442 | // adjust by actual difference to account for rounding errors |
|
|
443 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
389 | weight = weight_adjust (op, weight); |
444 | weight = weight_adjust_for (op, op->carrying) |
|
|
445 | - weight_adjust_for (op, op->carrying - weight); |
390 | |
446 | |
391 | if (!weight) |
447 | if (!weight) |
392 | return; |
448 | return; |
393 | |
449 | |
394 | op->carrying += weight; |
450 | op->carrying += weight; |
… | |
… | |
417 | op->update_weight (); |
473 | op->update_weight (); |
418 | |
474 | |
419 | sum += op->total_weight (); |
475 | sum += op->total_weight (); |
420 | } |
476 | } |
421 | |
477 | |
422 | sum = weight_adjust (this, sum); |
478 | sum = weight_adjust_for (this, sum); |
423 | |
479 | |
424 | if (sum != carrying) |
480 | if (sum != carrying) |
425 | { |
481 | { |
426 | carrying = sum; |
482 | carrying = sum; |
427 | |
483 | |
… | |
… | |
443 | object_freezer freezer; |
499 | object_freezer freezer; |
444 | op->write (freezer); |
500 | op->write (freezer); |
445 | return freezer.as_string (); |
501 | return freezer.as_string (); |
446 | } |
502 | } |
447 | |
503 | |
448 | /* |
504 | char * |
449 | * get_nearest_part(multi-object, object 2) returns the part of the |
505 | object::as_string () |
450 | * multi-object 1 which is closest to the second object. |
|
|
451 | * If it's not a multi-object, it is returned. |
|
|
452 | */ |
|
|
453 | object * |
|
|
454 | get_nearest_part (object *op, const object *pl) |
|
|
455 | { |
506 | { |
456 | object *tmp, *closest; |
507 | return dump_object (this); |
457 | int last_dist, i; |
|
|
458 | |
|
|
459 | if (!op->more) |
|
|
460 | return op; |
|
|
461 | |
|
|
462 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
463 | tmp; |
|
|
464 | tmp = tmp->more) |
|
|
465 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
466 | closest = tmp, last_dist = i; |
|
|
467 | |
|
|
468 | return closest; |
|
|
469 | } |
508 | } |
470 | |
509 | |
471 | /* |
510 | /* |
472 | * Returns the object which has the count-variable equal to the argument. |
511 | * Returns the object which has the count-variable equal to the argument. |
473 | * VERRRY slow. |
512 | * VERRRY slow. |
… | |
… | |
481 | |
520 | |
482 | return 0; |
521 | return 0; |
483 | } |
522 | } |
484 | |
523 | |
485 | /* |
524 | /* |
|
|
525 | * Returns the object which has the uuid equal to the argument. |
|
|
526 | * MOAR VERRRY slow. |
|
|
527 | */ |
|
|
528 | |
|
|
529 | object * |
|
|
530 | find_object_uuid (UUID i) |
|
|
531 | { |
|
|
532 | for_all_objects (op) |
|
|
533 | if (op->uuid == i) |
|
|
534 | return op; |
|
|
535 | |
|
|
536 | return 0; |
|
|
537 | } |
|
|
538 | |
|
|
539 | /* |
486 | * Returns the first object which has a name equal to the argument. |
540 | * Returns the first object which has a name equal to the argument. |
487 | * Used only by the patch command, but not all that useful. |
541 | * Used only by the patch command, but not all that useful. |
488 | * Enables features like "patch <name-of-other-player> food 999" |
542 | * Enables features like "patch <name-of-other-player> food 999" |
489 | */ |
543 | */ |
490 | object * |
544 | object * |
491 | find_object_name (const char *str) |
545 | find_object_name (const char *str) |
492 | { |
546 | { |
493 | shstr_cmp str_ (str); |
547 | shstr_cmp str_ (str); |
494 | object *op; |
|
|
495 | |
548 | |
|
|
549 | if (str_) |
496 | for_all_objects (op) |
550 | for_all_objects (op) |
497 | if (op->name == str_) |
551 | if (op->name == str_) |
498 | break; |
552 | return op; |
499 | |
553 | |
500 | return op; |
554 | return 0; |
501 | } |
555 | } |
502 | |
556 | |
503 | /* |
557 | /* |
504 | * Sets the owner and sets the skill and exp pointers to owner's current |
558 | * Sets the owner and sets the skill and exp pointers to owner's current |
505 | * skill and experience objects. |
559 | * skill and experience objects. |
… | |
… | |
567 | update_stats (); |
621 | update_stats (); |
568 | |
622 | |
569 | new_draw_info_format (NDI_UNIQUE, 0, this, |
623 | new_draw_info_format (NDI_UNIQUE, 0, this, |
570 | "You try to balance all your items at once, " |
624 | "You try to balance all your items at once, " |
571 | "but the %s is just too much for your body. " |
625 | "but the %s is just too much for your body. " |
572 | "[You need to unapply some items first.]", &ob->name); |
626 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
627 | "how many items you cna wera on a specific body part.]", &ob->name); |
573 | return false; |
628 | return false; |
574 | } |
629 | } |
575 | |
630 | |
576 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
631 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
577 | } |
632 | } |
… | |
… | |
603 | } |
658 | } |
604 | |
659 | |
605 | op->key_values = 0; |
660 | op->key_values = 0; |
606 | } |
661 | } |
607 | |
662 | |
608 | object & |
663 | /* |
609 | object::operator =(const object &src) |
664 | * copy_to first frees everything allocated by the dst object, |
|
|
665 | * and then copies the contents of itself into the second |
|
|
666 | * object, allocating what needs to be allocated. Basically, any |
|
|
667 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
668 | * if the first object is freed, the pointers in the new object |
|
|
669 | * will point at garbage. |
|
|
670 | */ |
|
|
671 | void |
|
|
672 | object::copy_to (object *dst) |
610 | { |
673 | { |
611 | remove (); |
674 | dst->remove (); |
612 | |
|
|
613 | *(object_copy *)this = src; |
675 | *(object_copy *)dst = *this; |
614 | |
|
|
615 | flag [FLAG_REMOVED] = true; |
676 | dst->flag [FLAG_REMOVED] = true; |
616 | |
677 | |
617 | /* Copy over key_values, if any. */ |
678 | /* Copy over key_values, if any. */ |
618 | if (src.key_values) |
679 | if (key_values) |
619 | { |
680 | { |
620 | key_value *tail = 0; |
681 | key_value *tail = 0; |
621 | key_values = 0; |
682 | dst->key_values = 0; |
622 | |
683 | |
623 | for (key_value *i = src.key_values; i; i = i->next) |
684 | for (key_value *i = key_values; i; i = i->next) |
624 | { |
685 | { |
625 | key_value *new_link = new key_value; |
686 | key_value *new_link = new key_value; |
626 | |
687 | |
627 | new_link->next = 0; |
688 | new_link->next = 0; |
628 | new_link->key = i->key; |
689 | new_link->key = i->key; |
629 | new_link->value = i->value; |
690 | new_link->value = i->value; |
630 | |
691 | |
631 | /* Try and be clever here, too. */ |
692 | /* Try and be clever here, too. */ |
632 | if (!key_values) |
693 | if (!dst->key_values) |
633 | { |
694 | { |
634 | key_values = new_link; |
695 | dst->key_values = new_link; |
635 | tail = new_link; |
696 | tail = new_link; |
636 | } |
697 | } |
637 | else |
698 | else |
638 | { |
699 | { |
639 | tail->next = new_link; |
700 | tail->next = new_link; |
640 | tail = new_link; |
701 | tail = new_link; |
641 | } |
702 | } |
642 | } |
703 | } |
643 | } |
704 | } |
644 | } |
|
|
645 | |
705 | |
646 | /* |
706 | dst->activate (); |
647 | * copy_to first frees everything allocated by the dst object, |
|
|
648 | * and then copies the contents of itself into the second |
|
|
649 | * object, allocating what needs to be allocated. Basically, any |
|
|
650 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
651 | * if the first object is freed, the pointers in the new object |
|
|
652 | * will point at garbage. |
|
|
653 | */ |
|
|
654 | void |
|
|
655 | object::copy_to (object *dst) |
|
|
656 | { |
|
|
657 | *dst = *this; |
|
|
658 | |
|
|
659 | if (speed < 0) |
|
|
660 | dst->speed_left -= rndm (); |
|
|
661 | |
|
|
662 | dst->set_speed (dst->speed); |
|
|
663 | } |
707 | } |
664 | |
708 | |
665 | void |
709 | void |
666 | object::instantiate () |
710 | object::instantiate () |
667 | { |
711 | { |
668 | if (!uuid.seq) // HACK |
712 | if (!uuid.seq) // HACK |
669 | uuid = UUID::gen (); |
713 | uuid = UUID::gen (); |
670 | |
714 | |
|
|
715 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
|
|
716 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
717 | speed_left = - speed - rndm (); // TODO animation |
|
|
718 | else |
671 | speed_left = -0.1f; |
719 | speed_left = -1.; |
|
|
720 | |
672 | /* copy the body_info to the body_used - this is only really |
721 | /* copy the body_info to the body_used - this is only really |
673 | * need for monsters, but doesn't hurt to do it for everything. |
722 | * need for monsters, but doesn't hurt to do it for everything. |
674 | * by doing so, when a monster is created, it has good starting |
723 | * by doing so, when a monster is created, it has good starting |
675 | * values for the body_used info, so when items are created |
724 | * values for the body_used info, so when items are created |
676 | * for it, they can be properly equipped. |
725 | * for it, they can be properly equipped. |
… | |
… | |
684 | object * |
733 | object * |
685 | object::clone () |
734 | object::clone () |
686 | { |
735 | { |
687 | object *neu = create (); |
736 | object *neu = create (); |
688 | copy_to (neu); |
737 | copy_to (neu); |
|
|
738 | |
|
|
739 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
740 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
741 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
742 | |
689 | neu->map = map; // not copied by copy_to |
743 | neu->map = map; // not copied by copy_to |
690 | return neu; |
744 | return neu; |
691 | } |
745 | } |
692 | |
746 | |
693 | /* |
747 | /* |
… | |
… | |
711 | * This function needs to be called whenever the speed of an object changes. |
765 | * This function needs to be called whenever the speed of an object changes. |
712 | */ |
766 | */ |
713 | void |
767 | void |
714 | object::set_speed (float speed) |
768 | object::set_speed (float speed) |
715 | { |
769 | { |
716 | if (flag [FLAG_FREED] && speed) |
|
|
717 | { |
|
|
718 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
719 | speed = 0; |
|
|
720 | } |
|
|
721 | |
|
|
722 | this->speed = speed; |
770 | this->speed = speed; |
723 | |
771 | |
724 | if (has_active_speed ()) |
772 | if (has_active_speed ()) |
725 | activate (); |
773 | activate (); |
726 | else |
774 | else |
… | |
… | |
776 | |
824 | |
777 | if (!(m.flags_ & P_UPTODATE)) |
825 | if (!(m.flags_ & P_UPTODATE)) |
778 | /* nop */; |
826 | /* nop */; |
779 | else if (action == UP_OBJ_INSERT) |
827 | else if (action == UP_OBJ_INSERT) |
780 | { |
828 | { |
|
|
829 | #if 0 |
781 | // this is likely overkill, TODO: revisit (schmorp) |
830 | // this is likely overkill, TODO: revisit (schmorp) |
782 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
831 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
783 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
832 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
784 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
833 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
785 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
834 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
786 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
835 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
787 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
836 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
788 | || (m.move_on | op->move_on ) != m.move_on |
837 | || (m.move_on | op->move_on ) != m.move_on |
789 | || (m.move_off | op->move_off ) != m.move_off |
838 | || (m.move_off | op->move_off ) != m.move_off |
790 | || (m.move_slow | op->move_slow) != m.move_slow |
839 | || (m.move_slow | op->move_slow) != m.move_slow |
791 | /* This isn't perfect, but I don't expect a lot of objects to |
840 | /* This isn't perfect, but I don't expect a lot of objects to |
792 | * to have move_allow right now. |
841 | * have move_allow right now. |
793 | */ |
842 | */ |
794 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
843 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
|
|
844 | m.invalidate (); |
|
|
845 | #else |
795 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
846 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
796 | m.flags_ = 0; |
847 | m.invalidate (); |
|
|
848 | #endif |
797 | } |
849 | } |
798 | /* if the object is being removed, we can't make intelligent |
850 | /* if the object is being removed, we can't make intelligent |
799 | * decisions, because remove_ob can't really pass the object |
851 | * decisions, because remove_ob can't really pass the object |
800 | * that is being removed. |
852 | * that is being removed. |
801 | */ |
853 | */ |
802 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
854 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
803 | m.flags_ = 0; |
855 | m.invalidate (); |
804 | else if (action == UP_OBJ_FACE) |
856 | else if (action == UP_OBJ_FACE) |
805 | /* Nothing to do for that case */ ; |
857 | /* Nothing to do for that case */ ; |
806 | else |
858 | else |
807 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
859 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
808 | |
860 | |
… | |
… | |
812 | |
864 | |
813 | object::object () |
865 | object::object () |
814 | { |
866 | { |
815 | SET_FLAG (this, FLAG_REMOVED); |
867 | SET_FLAG (this, FLAG_REMOVED); |
816 | |
868 | |
817 | expmul = 1.0; |
869 | //expmul = 1.0; declared const for the time being |
818 | face = blank_face; |
870 | face = blank_face; |
|
|
871 | material = MATERIAL_NULL; |
819 | } |
872 | } |
820 | |
873 | |
821 | object::~object () |
874 | object::~object () |
822 | { |
875 | { |
823 | unlink (); |
876 | unlink (); |
… | |
… | |
852 | /* If already on active list, don't do anything */ |
905 | /* If already on active list, don't do anything */ |
853 | if (active) |
906 | if (active) |
854 | return; |
907 | return; |
855 | |
908 | |
856 | if (has_active_speed ()) |
909 | if (has_active_speed ()) |
|
|
910 | { |
|
|
911 | if (flag [FLAG_FREED]) |
|
|
912 | LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
913 | |
857 | actives.insert (this); |
914 | actives.insert (this); |
|
|
915 | } |
858 | } |
916 | } |
859 | |
917 | |
860 | void |
918 | void |
861 | object::activate_recursive () |
919 | object::activate_recursive () |
862 | { |
920 | { |
… | |
… | |
923 | * drop on that space. |
981 | * drop on that space. |
924 | */ |
982 | */ |
925 | if (!drop_to_ground |
983 | if (!drop_to_ground |
926 | || !map |
984 | || !map |
927 | || map->in_memory != MAP_ACTIVE |
985 | || map->in_memory != MAP_ACTIVE |
928 | || map->nodrop |
986 | || map->no_drop |
929 | || ms ().move_block == MOVE_ALL) |
987 | || ms ().move_block == MOVE_ALL) |
930 | { |
988 | { |
931 | while (inv) |
989 | while (inv) |
932 | { |
|
|
933 | inv->destroy_inv (false); |
|
|
934 | inv->destroy (); |
990 | inv->destroy (); |
935 | } |
|
|
936 | } |
991 | } |
937 | else |
992 | else |
938 | { /* Put objects in inventory onto this space */ |
993 | { /* Put objects in inventory onto this space */ |
939 | while (inv) |
994 | while (inv) |
940 | { |
995 | { |
… | |
… | |
944 | || op->flag [FLAG_NO_DROP] |
999 | || op->flag [FLAG_NO_DROP] |
945 | || op->type == RUNE |
1000 | || op->type == RUNE |
946 | || op->type == TRAP |
1001 | || op->type == TRAP |
947 | || op->flag [FLAG_IS_A_TEMPLATE] |
1002 | || op->flag [FLAG_IS_A_TEMPLATE] |
948 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
1003 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
949 | op->destroy (true); |
1004 | op->destroy (); |
950 | else |
1005 | else |
951 | map->insert (op, x, y); |
1006 | map->insert (op, x, y); |
952 | } |
1007 | } |
953 | } |
1008 | } |
954 | } |
1009 | } |
… | |
… | |
962 | |
1017 | |
963 | static struct freed_map : maptile |
1018 | static struct freed_map : maptile |
964 | { |
1019 | { |
965 | freed_map () |
1020 | freed_map () |
966 | { |
1021 | { |
967 | path = "<freed objects map>"; |
1022 | path = "<freed objects map>"; |
968 | name = "/internal/freed_objects_map"; |
1023 | name = "/internal/freed_objects_map"; |
969 | width = 3; |
1024 | width = 3; |
970 | height = 3; |
1025 | height = 3; |
971 | nodrop = 1; |
1026 | no_drop = 1; |
|
|
1027 | no_reset = 1; |
972 | |
1028 | |
973 | alloc (); |
1029 | alloc (); |
974 | in_memory = MAP_ACTIVE; |
1030 | in_memory = MAP_ACTIVE; |
975 | } |
1031 | } |
|
|
1032 | |
|
|
1033 | ~freed_map () |
|
|
1034 | { |
|
|
1035 | destroy (); |
|
|
1036 | } |
976 | } freed_map; // freed objects are moved here to avoid crashes |
1037 | } freed_map; // freed objects are moved here to avoid crashes |
977 | |
1038 | |
978 | void |
1039 | void |
979 | object::do_destroy () |
1040 | object::do_destroy () |
980 | { |
1041 | { |
981 | if (flag [FLAG_IS_LINKED]) |
1042 | if (flag [FLAG_IS_LINKED]) |
982 | remove_button_link (this); |
1043 | remove_link (); |
983 | |
1044 | |
984 | if (flag [FLAG_FRIENDLY]) |
1045 | if (flag [FLAG_FRIENDLY]) |
985 | remove_friendly_object (this); |
1046 | remove_friendly_object (this); |
986 | |
1047 | |
987 | remove (); |
1048 | remove (); |
… | |
… | |
1012 | attacked_by = 0; |
1073 | attacked_by = 0; |
1013 | current_weapon = 0; |
1074 | current_weapon = 0; |
1014 | } |
1075 | } |
1015 | |
1076 | |
1016 | void |
1077 | void |
1017 | object::destroy (bool destroy_inventory) |
1078 | object::destroy () |
1018 | { |
1079 | { |
1019 | if (destroyed ()) |
1080 | if (destroyed ()) |
1020 | return; |
1081 | return; |
1021 | |
1082 | |
1022 | if (!is_head () && !head->destroyed ()) |
1083 | if (!is_head () && !head->destroyed ()) |
1023 | { |
1084 | { |
1024 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1085 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1025 | head->destroy (destroy_inventory); |
1086 | head->destroy (); |
1026 | return; |
1087 | return; |
1027 | } |
1088 | } |
1028 | |
1089 | |
1029 | destroy_inv (!destroy_inventory); |
1090 | destroy_inv (false); |
1030 | |
1091 | |
1031 | if (is_head ()) |
1092 | if (is_head ()) |
1032 | if (sound_destroy) |
1093 | if (sound_destroy) |
1033 | play_sound (sound_destroy); |
1094 | play_sound (sound_destroy); |
1034 | else if (flag [FLAG_MONSTER]) |
1095 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1045 | * the previous environment. |
1106 | * the previous environment. |
1046 | */ |
1107 | */ |
1047 | void |
1108 | void |
1048 | object::do_remove () |
1109 | object::do_remove () |
1049 | { |
1110 | { |
1050 | object *tmp, *last = 0; |
|
|
1051 | object *otmp; |
|
|
1052 | |
|
|
1053 | if (flag [FLAG_REMOVED]) |
1111 | if (flag [FLAG_REMOVED]) |
1054 | return; |
1112 | return; |
1055 | |
1113 | |
1056 | INVOKE_OBJECT (REMOVE, this); |
1114 | INVOKE_OBJECT (REMOVE, this); |
1057 | |
1115 | |
… | |
… | |
1071 | esrv_del_item (pl->contr, count); |
1129 | esrv_del_item (pl->contr, count); |
1072 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1130 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1073 | |
1131 | |
1074 | adjust_weight (env, -total_weight ()); |
1132 | adjust_weight (env, -total_weight ()); |
1075 | |
1133 | |
1076 | *(above ? &above->below : &env->inv) = below; |
1134 | object *pl = in_player (); |
1077 | |
|
|
1078 | if (below) |
|
|
1079 | below->above = above; |
|
|
1080 | |
1135 | |
1081 | /* we set up values so that it could be inserted into |
1136 | /* we set up values so that it could be inserted into |
1082 | * the map, but we don't actually do that - it is up |
1137 | * the map, but we don't actually do that - it is up |
1083 | * to the caller to decide what we want to do. |
1138 | * to the caller to decide what we want to do. |
1084 | */ |
1139 | */ |
1085 | map = env->map; |
1140 | map = env->map; |
1086 | x = env->x; |
1141 | x = env->x; |
1087 | y = env->y; |
1142 | y = env->y; |
|
|
1143 | |
|
|
1144 | // make sure cmov optimisation is applicable |
|
|
1145 | *(above ? &above->below : &env->inv) = below; |
|
|
1146 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1147 | |
1088 | above = 0; |
1148 | above = 0; |
1089 | below = 0; |
1149 | below = 0; |
1090 | env = 0; |
1150 | env = 0; |
1091 | |
1151 | |
1092 | /* NO_FIX_PLAYER is set when a great many changes are being |
1152 | if (pl && pl->is_player ()) |
1093 | * made to players inventory. If set, avoiding the call |
|
|
1094 | * to save cpu time. |
|
|
1095 | */ |
1153 | { |
1096 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1154 | pl->contr->queue_stats_update (); |
1097 | otmp->update_stats (); |
1155 | |
|
|
1156 | if (glow_radius && pl->is_on_map ()) |
|
|
1157 | update_all_los (pl->map, pl->x, pl->y); |
|
|
1158 | } |
1098 | } |
1159 | } |
1099 | else if (map) |
1160 | else if (map) |
1100 | { |
1161 | { |
1101 | map->dirty = true; |
1162 | map->dirty = true; |
1102 | mapspace &ms = this->ms (); |
1163 | mapspace &ms = this->ms (); |
1103 | |
1164 | |
1104 | if (object *pl = ms.player ()) |
1165 | if (object *pl = ms.player ()) |
1105 | { |
1166 | { |
1106 | if (type == PLAYER) // this == pl(!) |
1167 | if (is_player ()) |
1107 | { |
1168 | { |
|
|
1169 | if (!flag [FLAG_WIZPASS]) |
|
|
1170 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
|
|
1171 | |
1108 | // leaving a spot always closes any open container on the ground |
1172 | // leaving a spot always closes any open container on the ground |
1109 | if (container && !container->env) |
1173 | if (container && !container->env) |
1110 | // this causes spurious floorbox updates, but it ensures |
1174 | // this causes spurious floorbox updates, but it ensures |
1111 | // that the CLOSE event is being sent. |
1175 | // that the CLOSE event is being sent. |
1112 | close_container (); |
1176 | close_container (); |
1113 | |
1177 | |
1114 | --map->players; |
1178 | --map->players; |
1115 | map->touch (); |
1179 | map->touch (); |
1116 | } |
1180 | } |
1117 | else if (pl->container == this) |
1181 | else if (pl->container_ () == this) |
1118 | { |
1182 | { |
1119 | // removing a container should close it |
1183 | // removing a container should close it |
1120 | close_container (); |
1184 | close_container (); |
1121 | } |
1185 | } |
1122 | |
1186 | |
1123 | esrv_del_item (pl->contr, count); |
1187 | esrv_del_item (pl->contr, count); |
1124 | } |
1188 | } |
1125 | |
1189 | |
1126 | /* link the object above us */ |
1190 | /* link the object above us */ |
1127 | if (above) |
1191 | // re-link, make sure compiler can easily use cmove |
1128 | above->below = below; |
1192 | *(above ? &above->below : &ms.top) = below; |
1129 | else |
1193 | *(below ? &below->above : &ms.bot) = above; |
1130 | ms.top = below; /* we were top, set new top */ |
|
|
1131 | |
|
|
1132 | /* Relink the object below us, if there is one */ |
|
|
1133 | if (below) |
|
|
1134 | below->above = above; |
|
|
1135 | else |
|
|
1136 | { |
|
|
1137 | /* Nothing below, which means we need to relink map object for this space |
|
|
1138 | * use translated coordinates in case some oddness with map tiling is |
|
|
1139 | * evident |
|
|
1140 | */ |
|
|
1141 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1142 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
|
|
1143 | |
|
|
1144 | ms.bot = above; /* goes on above it. */ |
|
|
1145 | } |
|
|
1146 | |
1194 | |
1147 | above = 0; |
1195 | above = 0; |
1148 | below = 0; |
1196 | below = 0; |
1149 | |
1197 | |
|
|
1198 | ms.invalidate (); |
|
|
1199 | |
1150 | if (map->in_memory == MAP_SAVING) |
1200 | if (map->in_memory == MAP_SAVING) |
1151 | return; |
1201 | return; |
1152 | |
1202 | |
1153 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1203 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1154 | |
1204 | |
1155 | if (object *pl = ms.player ()) |
1205 | if (object *pl = ms.player ()) |
1156 | { |
1206 | { |
1157 | if (pl->container == this) |
1207 | if (pl->container_ () == this) |
1158 | /* If a container that the player is currently using somehow gets |
1208 | /* If a container that the player is currently using somehow gets |
1159 | * removed (most likely destroyed), update the player view |
1209 | * removed (most likely destroyed), update the player view |
1160 | * appropriately. |
1210 | * appropriately. |
1161 | */ |
1211 | */ |
1162 | pl->close_container (); |
1212 | pl->close_container (); |
… | |
… | |
1166 | //TODO: update floorbox to preserve ordering |
1216 | //TODO: update floorbox to preserve ordering |
1167 | if (pl->contr->ns) |
1217 | if (pl->contr->ns) |
1168 | pl->contr->ns->floorbox_update (); |
1218 | pl->contr->ns->floorbox_update (); |
1169 | } |
1219 | } |
1170 | |
1220 | |
|
|
1221 | if (check_walk_off) |
1171 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1222 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1172 | { |
1223 | { |
|
|
1224 | above = tmp->above; |
|
|
1225 | |
1173 | /* No point updating the players look faces if he is the object |
1226 | /* No point updating the players look faces if he is the object |
1174 | * being removed. |
1227 | * being removed. |
1175 | */ |
1228 | */ |
1176 | |
1229 | |
1177 | /* See if object moving off should effect something */ |
1230 | /* See if object moving off should effect something */ |
1178 | if (check_walk_off |
|
|
1179 | && ((move_type & tmp->move_off) |
1231 | if ((move_type & tmp->move_off) |
1180 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1232 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1181 | { |
|
|
1182 | move_apply (tmp, this, 0); |
1233 | move_apply (tmp, this, 0); |
1183 | |
|
|
1184 | if (destroyed ()) |
|
|
1185 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1186 | } |
1234 | } |
1187 | |
1235 | |
1188 | last = tmp; |
1236 | if (affects_los ()) |
1189 | } |
|
|
1190 | |
|
|
1191 | /* last == NULL if there are no objects on this space */ |
|
|
1192 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1193 | if (!last) |
|
|
1194 | map->at (x, y).flags_ = 0; |
|
|
1195 | else |
|
|
1196 | update_object (last, UP_OBJ_REMOVE); |
|
|
1197 | |
|
|
1198 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
|
|
1199 | update_all_los (map, x, y); |
1237 | update_all_los (map, x, y); |
1200 | } |
1238 | } |
1201 | } |
1239 | } |
1202 | |
1240 | |
1203 | /* |
1241 | /* |
… | |
… | |
1227 | esrv_update_item (UPD_NROF, pl, top); |
1265 | esrv_update_item (UPD_NROF, pl, top); |
1228 | |
1266 | |
1229 | op->weight = 0; // cancel the addition above |
1267 | op->weight = 0; // cancel the addition above |
1230 | op->carrying = 0; // must be 0 already |
1268 | op->carrying = 0; // must be 0 already |
1231 | |
1269 | |
1232 | op->destroy (1); |
1270 | op->destroy (); |
1233 | |
1271 | |
1234 | return top; |
1272 | return top; |
1235 | } |
1273 | } |
1236 | |
1274 | |
1237 | return 0; |
1275 | return 0; |
… | |
… | |
1245 | |
1283 | |
1246 | object *prev = this; |
1284 | object *prev = this; |
1247 | |
1285 | |
1248 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1286 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1249 | { |
1287 | { |
1250 | object *op = arch_to_object (at); |
1288 | object *op = at->instance (); |
1251 | |
1289 | |
1252 | op->name = name; |
1290 | op->name = name; |
1253 | op->name_pl = name_pl; |
1291 | op->name_pl = name_pl; |
1254 | op->title = title; |
1292 | op->title = title; |
1255 | |
1293 | |
… | |
… | |
1265 | * job preparing multi-part monsters. |
1303 | * job preparing multi-part monsters. |
1266 | */ |
1304 | */ |
1267 | object * |
1305 | object * |
1268 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1306 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1269 | { |
1307 | { |
|
|
1308 | op->remove (); |
|
|
1309 | |
1270 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1310 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1271 | { |
1311 | { |
1272 | tmp->x = x + tmp->arch->x; |
1312 | tmp->x = x + tmp->arch->x; |
1273 | tmp->y = y + tmp->arch->y; |
1313 | tmp->y = y + tmp->arch->y; |
1274 | } |
1314 | } |
… | |
… | |
1297 | * just 'op' otherwise |
1337 | * just 'op' otherwise |
1298 | */ |
1338 | */ |
1299 | object * |
1339 | object * |
1300 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1340 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1301 | { |
1341 | { |
1302 | assert (!op->flag [FLAG_FREED]); |
|
|
1303 | |
|
|
1304 | op->remove (); |
1342 | op->remove (); |
|
|
1343 | |
|
|
1344 | if (m == &freed_map)//D TODO: remove soon |
|
|
1345 | {//D |
|
|
1346 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
|
|
1347 | }//D |
1305 | |
1348 | |
1306 | /* Ideally, the caller figures this out. However, it complicates a lot |
1349 | /* Ideally, the caller figures this out. However, it complicates a lot |
1307 | * of areas of callers (eg, anything that uses find_free_spot would now |
1350 | * of areas of callers (eg, anything that uses find_free_spot would now |
1308 | * need extra work |
1351 | * need extra work |
1309 | */ |
1352 | */ |
|
|
1353 | maptile *newmap = m; |
1310 | if (!xy_normalise (m, op->x, op->y)) |
1354 | if (!xy_normalise (newmap, op->x, op->y)) |
1311 | { |
1355 | { |
1312 | op->destroy (1); |
1356 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1313 | return 0; |
1357 | return 0; |
1314 | } |
1358 | } |
1315 | |
1359 | |
1316 | if (object *more = op->more) |
1360 | if (object *more = op->more) |
1317 | if (!insert_ob_in_map (more, m, originator, flag)) |
1361 | if (!insert_ob_in_map (more, m, originator, flag)) |
1318 | return 0; |
1362 | return 0; |
1319 | |
1363 | |
1320 | CLEAR_FLAG (op, FLAG_REMOVED); |
1364 | op->flag [FLAG_REMOVED] = false; |
1321 | |
1365 | op->env = 0; |
1322 | op->map = m; |
1366 | op->map = newmap; |
|
|
1367 | |
1323 | mapspace &ms = op->ms (); |
1368 | mapspace &ms = op->ms (); |
1324 | |
1369 | |
1325 | /* this has to be done after we translate the coordinates. |
1370 | /* this has to be done after we translate the coordinates. |
1326 | */ |
1371 | */ |
1327 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1372 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1328 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1373 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1329 | if (object::can_merge (op, tmp)) |
1374 | if (object::can_merge (op, tmp)) |
1330 | { |
1375 | { |
1331 | // TODO: we atcually want to update tmp, not op, |
1376 | // TODO: we actually want to update tmp, not op, |
1332 | // but some caller surely breaks when we return tmp |
1377 | // but some caller surely breaks when we return tmp |
1333 | // from here :/ |
1378 | // from here :/ |
1334 | op->nrof += tmp->nrof; |
1379 | op->nrof += tmp->nrof; |
1335 | tmp->destroy (1); |
1380 | tmp->destroy (); |
1336 | } |
1381 | } |
1337 | |
1382 | |
1338 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1383 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1339 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1384 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1340 | |
1385 | |
… | |
… | |
1347 | { |
1392 | { |
1348 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1393 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1349 | abort (); |
1394 | abort (); |
1350 | } |
1395 | } |
1351 | |
1396 | |
|
|
1397 | if (!originator->is_on_map ()) |
|
|
1398 | { |
|
|
1399 | LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
|
|
1400 | op->debug_desc (), originator->debug_desc ()); |
|
|
1401 | abort (); |
|
|
1402 | } |
|
|
1403 | |
1352 | op->above = originator; |
1404 | op->above = originator; |
1353 | op->below = originator->below; |
1405 | op->below = originator->below; |
1354 | |
|
|
1355 | if (op->below) |
|
|
1356 | op->below->above = op; |
|
|
1357 | else |
|
|
1358 | ms.bot = op; |
|
|
1359 | |
|
|
1360 | /* since *below* originator, no need to update top */ |
|
|
1361 | originator->below = op; |
1406 | originator->below = op; |
|
|
1407 | |
|
|
1408 | *(op->below ? &op->below->above : &ms.bot) = op; |
1362 | } |
1409 | } |
1363 | else |
1410 | else |
1364 | { |
1411 | { |
1365 | object *top, *floor = NULL; |
1412 | object *floor = 0; |
1366 | |
1413 | object *top = ms.top; |
1367 | top = ms.bot; |
|
|
1368 | |
1414 | |
1369 | /* If there are other objects, then */ |
1415 | /* If there are other objects, then */ |
1370 | if (top) |
1416 | if (top) |
1371 | { |
1417 | { |
1372 | object *last = 0; |
|
|
1373 | |
|
|
1374 | /* |
1418 | /* |
1375 | * If there are multiple objects on this space, we do some trickier handling. |
1419 | * If there are multiple objects on this space, we do some trickier handling. |
1376 | * We've already dealt with merging if appropriate. |
1420 | * We've already dealt with merging if appropriate. |
1377 | * Generally, we want to put the new object on top. But if |
1421 | * Generally, we want to put the new object on top. But if |
1378 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1422 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1381 | * once we get to them. This reduces the need to traverse over all of |
1425 | * once we get to them. This reduces the need to traverse over all of |
1382 | * them when adding another one - this saves quite a bit of cpu time |
1426 | * them when adding another one - this saves quite a bit of cpu time |
1383 | * when lots of spells are cast in one area. Currently, it is presumed |
1427 | * when lots of spells are cast in one area. Currently, it is presumed |
1384 | * that flying non pickable objects are spell objects. |
1428 | * that flying non pickable objects are spell objects. |
1385 | */ |
1429 | */ |
1386 | for (top = ms.bot; top; top = top->above) |
1430 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1387 | { |
1431 | { |
1388 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1432 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1389 | floor = top; |
1433 | floor = tmp; |
1390 | |
1434 | |
1391 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1435 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1392 | { |
1436 | { |
1393 | /* We insert above top, so we want this object below this */ |
1437 | /* We insert above top, so we want this object below this */ |
1394 | top = top->below; |
1438 | top = tmp->below; |
1395 | break; |
1439 | break; |
1396 | } |
1440 | } |
1397 | |
1441 | |
1398 | last = top; |
1442 | top = tmp; |
1399 | } |
1443 | } |
1400 | |
|
|
1401 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1402 | top = last; |
|
|
1403 | |
1444 | |
1404 | /* We let update_position deal with figuring out what the space |
1445 | /* We let update_position deal with figuring out what the space |
1405 | * looks like instead of lots of conditions here. |
1446 | * looks like instead of lots of conditions here. |
1406 | * makes things faster, and effectively the same result. |
1447 | * makes things faster, and effectively the same result. |
1407 | */ |
1448 | */ |
… | |
… | |
1414 | */ |
1455 | */ |
1415 | if (!(flag & INS_ON_TOP) |
1456 | if (!(flag & INS_ON_TOP) |
1416 | && ms.flags () & P_BLOCKSVIEW |
1457 | && ms.flags () & P_BLOCKSVIEW |
1417 | && (op->face && !faces [op->face].visibility)) |
1458 | && (op->face && !faces [op->face].visibility)) |
1418 | { |
1459 | { |
|
|
1460 | object *last; |
|
|
1461 | |
1419 | for (last = top; last != floor; last = last->below) |
1462 | for (last = top; last != floor; last = last->below) |
1420 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1463 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1421 | break; |
1464 | break; |
1422 | |
1465 | |
1423 | /* Check to see if we found the object that blocks view, |
1466 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1431 | } /* If objects on this space */ |
1474 | } /* If objects on this space */ |
1432 | |
1475 | |
1433 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1476 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1434 | top = floor; |
1477 | top = floor; |
1435 | |
1478 | |
1436 | /* Top is the object that our object (op) is going to get inserted above. |
1479 | // insert object above top, or bottom-most if top = 0 |
1437 | */ |
|
|
1438 | |
|
|
1439 | /* First object on this space */ |
|
|
1440 | if (!top) |
1480 | if (!top) |
1441 | { |
1481 | { |
|
|
1482 | op->below = 0; |
1442 | op->above = ms.bot; |
1483 | op->above = ms.bot; |
1443 | |
|
|
1444 | if (op->above) |
|
|
1445 | op->above->below = op; |
|
|
1446 | |
|
|
1447 | op->below = 0; |
|
|
1448 | ms.bot = op; |
1484 | ms.bot = op; |
|
|
1485 | |
|
|
1486 | *(op->above ? &op->above->below : &ms.top) = op; |
1449 | } |
1487 | } |
1450 | else |
1488 | else |
1451 | { /* get inserted into the stack above top */ |
1489 | { |
1452 | op->above = top->above; |
1490 | op->above = top->above; |
1453 | |
|
|
1454 | if (op->above) |
|
|
1455 | op->above->below = op; |
1491 | top->above = op; |
1456 | |
1492 | |
1457 | op->below = top; |
1493 | op->below = top; |
1458 | top->above = op; |
1494 | *(op->above ? &op->above->below : &ms.top) = op; |
1459 | } |
1495 | } |
|
|
1496 | } |
1460 | |
1497 | |
1461 | if (!op->above) |
1498 | if (op->is_player ()) |
1462 | ms.top = op; |
|
|
1463 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1464 | |
|
|
1465 | if (op->type == PLAYER) |
|
|
1466 | { |
1499 | { |
1467 | op->contr->do_los = 1; |
1500 | op->contr->do_los = 1; |
1468 | ++op->map->players; |
1501 | ++op->map->players; |
1469 | op->map->touch (); |
1502 | op->map->touch (); |
1470 | } |
1503 | } |
… | |
… | |
1485 | * be far away from this change and not affected in any way - |
1518 | * be far away from this change and not affected in any way - |
1486 | * this should get redone to only look for players within range, |
1519 | * this should get redone to only look for players within range, |
1487 | * or just updating the P_UPTODATE for spaces within this area |
1520 | * or just updating the P_UPTODATE for spaces within this area |
1488 | * of effect may be sufficient. |
1521 | * of effect may be sufficient. |
1489 | */ |
1522 | */ |
1490 | if (op->map->darkness && (op->glow_radius != 0)) |
1523 | if (op->affects_los ()) |
|
|
1524 | { |
|
|
1525 | op->ms ().invalidate (); |
1491 | update_all_los (op->map, op->x, op->y); |
1526 | update_all_los (op->map, op->x, op->y); |
|
|
1527 | } |
1492 | |
1528 | |
1493 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1529 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1494 | update_object (op, UP_OBJ_INSERT); |
1530 | update_object (op, UP_OBJ_INSERT); |
1495 | |
1531 | |
1496 | INVOKE_OBJECT (INSERT, op); |
1532 | INVOKE_OBJECT (INSERT, op); |
… | |
… | |
1503 | * blocked() and wall() work properly), and these flags are updated by |
1539 | * blocked() and wall() work properly), and these flags are updated by |
1504 | * update_object(). |
1540 | * update_object(). |
1505 | */ |
1541 | */ |
1506 | |
1542 | |
1507 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1543 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1508 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1544 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1509 | { |
1545 | { |
1510 | if (check_move_on (op, originator)) |
1546 | if (check_move_on (op, originator)) |
1511 | return 0; |
1547 | return 0; |
1512 | |
1548 | |
1513 | /* If we are a multi part object, lets work our way through the check |
1549 | /* If we are a multi part object, lets work our way through the check |
… | |
… | |
1524 | /* this function inserts an object in the map, but if it |
1560 | /* this function inserts an object in the map, but if it |
1525 | * finds an object of its own type, it'll remove that one first. |
1561 | * finds an object of its own type, it'll remove that one first. |
1526 | * op is the object to insert it under: supplies x and the map. |
1562 | * op is the object to insert it under: supplies x and the map. |
1527 | */ |
1563 | */ |
1528 | void |
1564 | void |
1529 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1565 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1530 | { |
1566 | { |
1531 | /* first search for itself and remove any old instances */ |
1567 | /* first search for itself and remove any old instances */ |
1532 | |
1568 | |
1533 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1569 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1534 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1570 | if (tmp->arch->archname == archname) /* same archetype */ |
1535 | tmp->destroy (1); |
1571 | tmp->destroy (); |
1536 | |
1572 | |
1537 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1573 | object *tmp = archetype::find (archname)->instance (); |
1538 | |
1574 | |
1539 | tmp->x = op->x; |
1575 | tmp->x = op->x; |
1540 | tmp->y = op->y; |
1576 | tmp->y = op->y; |
1541 | |
1577 | |
1542 | insert_ob_in_map (tmp, op->map, op, 0); |
1578 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1547 | { |
1583 | { |
1548 | if (where->env) |
1584 | if (where->env) |
1549 | return where->env->insert (this); |
1585 | return where->env->insert (this); |
1550 | else |
1586 | else |
1551 | return where->map->insert (this, where->x, where->y, originator, flags); |
1587 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1591 | bool |
|
|
1592 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1593 | { |
|
|
1594 | mapspace &ms = m->at (x, y); |
|
|
1595 | |
|
|
1596 | int items = ms.items (); |
|
|
1597 | |
|
|
1598 | if (!items // testing !items ensures we can drop at least one item |
|
|
1599 | || (items < m->max_items |
|
|
1600 | && ms.volume () < m->max_volume)) |
|
|
1601 | return true; |
|
|
1602 | |
|
|
1603 | if (originator && originator->is_player ()) |
|
|
1604 | originator->contr->failmsg (format ( |
|
|
1605 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1606 | query_name () |
|
|
1607 | )); |
|
|
1608 | |
|
|
1609 | return false; |
1552 | } |
1610 | } |
1553 | |
1611 | |
1554 | /* |
1612 | /* |
1555 | * decrease(object, number) decreases a specified number from |
1613 | * decrease(object, number) decreases a specified number from |
1556 | * the amount of an object. If the amount reaches 0, the object |
1614 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1564 | if (!nr) |
1622 | if (!nr) |
1565 | return true; |
1623 | return true; |
1566 | |
1624 | |
1567 | nr = min (nr, nrof); |
1625 | nr = min (nr, nrof); |
1568 | |
1626 | |
|
|
1627 | if (nrof > nr) |
|
|
1628 | { |
1569 | nrof -= nr; |
1629 | nrof -= nr; |
1570 | |
|
|
1571 | if (nrof) |
|
|
1572 | { |
|
|
1573 | adjust_weight (env, -weight * nr); // carrying == 0 |
1630 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
1574 | |
1631 | |
1575 | if (object *pl = visible_to ()) |
1632 | if (object *pl = visible_to ()) |
1576 | esrv_update_item (UPD_NROF, pl, this); |
1633 | esrv_update_item (UPD_NROF, pl, this); |
1577 | |
1634 | |
1578 | return true; |
1635 | return true; |
1579 | } |
1636 | } |
1580 | else |
1637 | else |
1581 | { |
1638 | { |
1582 | destroy (1); |
1639 | destroy (); |
1583 | return false; |
1640 | return false; |
1584 | } |
1641 | } |
1585 | } |
1642 | } |
1586 | |
1643 | |
1587 | /* |
1644 | /* |
… | |
… | |
1604 | } |
1661 | } |
1605 | else |
1662 | else |
1606 | { |
1663 | { |
1607 | decrease (nr); |
1664 | decrease (nr); |
1608 | |
1665 | |
1609 | object *op = object_create_clone (this); |
1666 | object *op = deep_clone (); |
1610 | op->nrof = nr; |
1667 | op->nrof = nr; |
1611 | return op; |
1668 | return op; |
1612 | } |
1669 | } |
1613 | } |
1670 | } |
1614 | |
1671 | |
… | |
… | |
1664 | if (object *pl = tmp->visible_to ()) |
1721 | if (object *pl = tmp->visible_to ()) |
1665 | esrv_update_item (UPD_NROF, pl, tmp); |
1722 | esrv_update_item (UPD_NROF, pl, tmp); |
1666 | |
1723 | |
1667 | adjust_weight (this, op->total_weight ()); |
1724 | adjust_weight (this, op->total_weight ()); |
1668 | |
1725 | |
1669 | op->destroy (1); |
1726 | op->destroy (); |
1670 | op = tmp; |
1727 | op = tmp; |
1671 | goto inserted; |
1728 | goto inserted; |
1672 | } |
1729 | } |
1673 | |
1730 | |
1674 | op->owner = 0; // it's his/hers now. period. |
1731 | op->owner = 0; // it's his/hers now. period. |
… | |
… | |
1692 | |
1749 | |
1693 | adjust_weight (this, op->total_weight ()); |
1750 | adjust_weight (this, op->total_weight ()); |
1694 | |
1751 | |
1695 | inserted: |
1752 | inserted: |
1696 | /* reset the light list and los of the players on the map */ |
1753 | /* reset the light list and los of the players on the map */ |
1697 | if (op->glow_radius && map && map->darkness) |
1754 | if (op->glow_radius && is_on_map ()) |
|
|
1755 | { |
|
|
1756 | update_stats (); |
1698 | update_all_los (map, x, y); |
1757 | update_all_los (map, x, y); |
1699 | |
1758 | } |
|
|
1759 | else if (is_player ()) |
1700 | // if this is a player's inventory, update stats |
1760 | // if this is a player's inventory, update stats |
1701 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1761 | contr->queue_stats_update (); |
1702 | update_stats (); |
|
|
1703 | |
1762 | |
1704 | INVOKE_OBJECT (INSERT, this); |
1763 | INVOKE_OBJECT (INSERT, this); |
1705 | |
1764 | |
1706 | return op; |
1765 | return op; |
1707 | } |
1766 | } |
… | |
… | |
1727 | * on top. |
1786 | * on top. |
1728 | */ |
1787 | */ |
1729 | int |
1788 | int |
1730 | check_move_on (object *op, object *originator) |
1789 | check_move_on (object *op, object *originator) |
1731 | { |
1790 | { |
|
|
1791 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1792 | return 0; |
|
|
1793 | |
1732 | object *tmp; |
1794 | object *tmp; |
1733 | maptile *m = op->map; |
1795 | maptile *m = op->map; |
1734 | int x = op->x, y = op->y; |
1796 | int x = op->x, y = op->y; |
1735 | |
1797 | |
1736 | MoveType move_on, move_slow, move_block; |
1798 | mapspace &ms = m->at (x, y); |
1737 | |
1799 | |
1738 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1800 | ms.update (); |
1739 | return 0; |
|
|
1740 | |
1801 | |
1741 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1802 | MoveType move_on = ms.move_on; |
1742 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1803 | MoveType move_slow = ms.move_slow; |
1743 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1804 | MoveType move_block = ms.move_block; |
1744 | |
1805 | |
1745 | /* if nothing on this space will slow op down or be applied, |
1806 | /* if nothing on this space will slow op down or be applied, |
1746 | * no need to do checking below. have to make sure move_type |
1807 | * no need to do checking below. have to make sure move_type |
1747 | * is set, as lots of objects don't have it set - we treat that |
1808 | * is set, as lots of objects don't have it set - we treat that |
1748 | * as walking. |
1809 | * as walking. |
… | |
… | |
1759 | return 0; |
1820 | return 0; |
1760 | |
1821 | |
1761 | /* The objects have to be checked from top to bottom. |
1822 | /* The objects have to be checked from top to bottom. |
1762 | * Hence, we first go to the top: |
1823 | * Hence, we first go to the top: |
1763 | */ |
1824 | */ |
1764 | |
1825 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1765 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1766 | { |
|
|
1767 | /* Trim the search when we find the first other spell effect |
|
|
1768 | * this helps performance so that if a space has 50 spell objects, |
|
|
1769 | * we don't need to check all of them. |
|
|
1770 | */ |
|
|
1771 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1772 | break; |
|
|
1773 | } |
1826 | { |
|
|
1827 | next = tmp->below; |
1774 | |
1828 | |
1775 | for (; tmp; tmp = tmp->below) |
|
|
1776 | { |
|
|
1777 | if (tmp == op) |
1829 | if (tmp == op) |
1778 | continue; /* Can't apply yourself */ |
1830 | continue; /* Can't apply yourself */ |
1779 | |
1831 | |
1780 | /* Check to see if one of the movement types should be slowed down. |
1832 | /* Check to see if one of the movement types should be slowed down. |
1781 | * Second check makes sure that the movement types not being slowed |
1833 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1786 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1838 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1787 | { |
1839 | { |
1788 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1840 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1789 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1841 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1790 | { |
1842 | { |
1791 | |
|
|
1792 | float |
|
|
1793 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1843 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1794 | |
1844 | |
1795 | if (op->type == PLAYER) |
1845 | if (op->is_player ()) |
1796 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1846 | if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) || |
1797 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1847 | (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN))) |
1798 | diff /= 4.0; |
1848 | diff /= 4.0; |
1799 | |
1849 | |
1800 | op->speed_left -= diff; |
1850 | op->speed_left -= diff; |
1801 | } |
1851 | } |
1802 | } |
1852 | } |
… | |
… | |
1835 | LOG (llevError, "Present_arch called outside map.\n"); |
1885 | LOG (llevError, "Present_arch called outside map.\n"); |
1836 | return NULL; |
1886 | return NULL; |
1837 | } |
1887 | } |
1838 | |
1888 | |
1839 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1889 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1840 | if (tmp->arch == at) |
1890 | if (tmp->arch->archname == at->archname) |
1841 | return tmp; |
1891 | return tmp; |
1842 | |
1892 | |
1843 | return NULL; |
1893 | return NULL; |
1844 | } |
1894 | } |
1845 | |
1895 | |
… | |
… | |
1909 | * The first matching object is returned, or NULL if none. |
1959 | * The first matching object is returned, or NULL if none. |
1910 | */ |
1960 | */ |
1911 | object * |
1961 | object * |
1912 | present_arch_in_ob (const archetype *at, const object *op) |
1962 | present_arch_in_ob (const archetype *at, const object *op) |
1913 | { |
1963 | { |
1914 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1964 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1915 | if (tmp->arch == at) |
1965 | if (tmp->arch->archname == at->archname) |
1916 | return tmp; |
1966 | return tmp; |
1917 | |
1967 | |
1918 | return NULL; |
1968 | return NULL; |
1919 | } |
1969 | } |
1920 | |
1970 | |
… | |
… | |
2008 | * head of the object should correspond for the entire object. |
2058 | * head of the object should correspond for the entire object. |
2009 | */ |
2059 | */ |
2010 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2060 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2011 | continue; |
2061 | continue; |
2012 | |
2062 | |
2013 | if (ob->blocked (m, pos.x, pos.y)) |
2063 | if (ob->blocked (pos.m, pos.x, pos.y)) |
2014 | continue; |
2064 | continue; |
2015 | |
2065 | |
2016 | altern [index++] = i; |
2066 | altern [index++] = i; |
2017 | } |
2067 | } |
2018 | |
2068 | |
… | |
… | |
2086 | * there is capable of. |
2136 | * there is capable of. |
2087 | */ |
2137 | */ |
2088 | int |
2138 | int |
2089 | find_dir (maptile *m, int x, int y, object *exclude) |
2139 | find_dir (maptile *m, int x, int y, object *exclude) |
2090 | { |
2140 | { |
2091 | int i, max = SIZEOFFREE, mflags; |
2141 | int max = SIZEOFFREE, mflags; |
2092 | |
|
|
2093 | sint16 nx, ny; |
|
|
2094 | object *tmp; |
|
|
2095 | maptile *mp; |
|
|
2096 | |
|
|
2097 | MoveType blocked, move_type; |
2142 | MoveType move_type; |
2098 | |
2143 | |
2099 | if (exclude && exclude->head_ () != exclude) |
2144 | if (exclude && exclude->head_ () != exclude) |
2100 | { |
2145 | { |
2101 | exclude = exclude->head; |
2146 | exclude = exclude->head; |
2102 | move_type = exclude->move_type; |
2147 | move_type = exclude->move_type; |
… | |
… | |
2105 | { |
2150 | { |
2106 | /* If we don't have anything, presume it can use all movement types. */ |
2151 | /* If we don't have anything, presume it can use all movement types. */ |
2107 | move_type = MOVE_ALL; |
2152 | move_type = MOVE_ALL; |
2108 | } |
2153 | } |
2109 | |
2154 | |
2110 | for (i = 1; i < max; i++) |
2155 | for (int i = 1; i < max; i++) |
2111 | { |
2156 | { |
2112 | mp = m; |
2157 | mapxy pos (m, x, y); |
2113 | nx = x + freearr_x[i]; |
2158 | pos.move (i); |
2114 | ny = y + freearr_y[i]; |
|
|
2115 | |
2159 | |
2116 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2160 | if (!pos.normalise ()) |
2117 | |
|
|
2118 | if (mflags & P_OUT_OF_MAP) |
|
|
2119 | max = maxfree[i]; |
2161 | max = maxfree[i]; |
2120 | else |
2162 | else |
2121 | { |
2163 | { |
2122 | mapspace &ms = mp->at (nx, ny); |
2164 | mapspace &ms = *pos; |
2123 | |
2165 | |
2124 | blocked = ms.move_block; |
|
|
2125 | |
|
|
2126 | if ((move_type & blocked) == move_type) |
2166 | if ((move_type & ms.move_block) == move_type) |
2127 | max = maxfree[i]; |
2167 | max = maxfree [i]; |
2128 | else if (mflags & P_IS_ALIVE) |
2168 | else if (ms.flags () & P_IS_ALIVE) |
2129 | { |
2169 | { |
2130 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2170 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2131 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2171 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2132 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2172 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2133 | break; |
|
|
2134 | |
|
|
2135 | if (tmp) |
|
|
2136 | return freedir[i]; |
2173 | return freedir [i]; |
2137 | } |
2174 | } |
2138 | } |
2175 | } |
2139 | } |
2176 | } |
2140 | |
2177 | |
2141 | return 0; |
2178 | return 0; |
… | |
… | |
2216 | * This basically means that if direction is 15, then it could either go |
2253 | * This basically means that if direction is 15, then it could either go |
2217 | * direction 4, 14, or 16 to get back to where we are. |
2254 | * direction 4, 14, or 16 to get back to where we are. |
2218 | * Moved from spell_util.c to object.c with the other related direction |
2255 | * Moved from spell_util.c to object.c with the other related direction |
2219 | * functions. |
2256 | * functions. |
2220 | */ |
2257 | */ |
2221 | int reduction_dir[SIZEOFFREE][3] = { |
2258 | static const int reduction_dir[SIZEOFFREE][3] = { |
2222 | {0, 0, 0}, /* 0 */ |
2259 | {0, 0, 0}, /* 0 */ |
2223 | {0, 0, 0}, /* 1 */ |
2260 | {0, 0, 0}, /* 1 */ |
2224 | {0, 0, 0}, /* 2 */ |
2261 | {0, 0, 0}, /* 2 */ |
2225 | {0, 0, 0}, /* 3 */ |
2262 | {0, 0, 0}, /* 3 */ |
2226 | {0, 0, 0}, /* 4 */ |
2263 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2322 | int |
2359 | int |
2323 | can_pick (const object *who, const object *item) |
2360 | can_pick (const object *who, const object *item) |
2324 | { |
2361 | { |
2325 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2362 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2326 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2363 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2327 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2364 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2328 | } |
2365 | } |
2329 | |
2366 | |
2330 | /* |
2367 | /* |
2331 | * create clone from object to another |
2368 | * create clone from object to another |
2332 | */ |
2369 | */ |
2333 | object * |
2370 | object * |
2334 | object_create_clone (object *asrc) |
2371 | object::deep_clone () |
2335 | { |
2372 | { |
|
|
2373 | assert (("deep_clone called on non-head object", is_head ())); |
|
|
2374 | |
2336 | object *dst = 0; |
2375 | object *dst = clone (); |
2337 | |
2376 | |
2338 | if (!asrc) |
|
|
2339 | return 0; |
|
|
2340 | |
|
|
2341 | object *src = asrc->head_ (); |
|
|
2342 | |
|
|
2343 | object *prev = 0; |
2377 | object *prev = dst; |
2344 | for (object *part = src; part; part = part->more) |
2378 | for (object *part = this->more; part; part = part->more) |
2345 | { |
2379 | { |
2346 | object *tmp = part->clone (); |
2380 | object *tmp = part->clone (); |
2347 | |
|
|
2348 | tmp->x -= src->x; |
|
|
2349 | tmp->y -= src->y; |
|
|
2350 | |
|
|
2351 | if (!part->head) |
|
|
2352 | { |
|
|
2353 | dst = tmp; |
|
|
2354 | tmp->head = 0; |
|
|
2355 | } |
|
|
2356 | else |
|
|
2357 | tmp->head = dst; |
2381 | tmp->head = dst; |
2358 | |
|
|
2359 | tmp->more = 0; |
|
|
2360 | |
|
|
2361 | if (prev) |
|
|
2362 | prev->more = tmp; |
2382 | prev->more = tmp; |
2363 | |
|
|
2364 | prev = tmp; |
2383 | prev = tmp; |
2365 | } |
2384 | } |
2366 | |
2385 | |
2367 | for (object *item = src->inv; item; item = item->below) |
2386 | for (object *item = inv; item; item = item->below) |
2368 | insert_ob_in_ob (object_create_clone (item), dst); |
2387 | insert_ob_in_ob (item->deep_clone (), dst); |
2369 | |
2388 | |
2370 | return dst; |
2389 | return dst; |
2371 | } |
2390 | } |
2372 | |
2391 | |
2373 | /* This returns the first object in who's inventory that |
2392 | /* This returns the first object in who's inventory that |
… | |
… | |
2382 | return tmp; |
2401 | return tmp; |
2383 | |
2402 | |
2384 | return 0; |
2403 | return 0; |
2385 | } |
2404 | } |
2386 | |
2405 | |
2387 | /* If ob has a field named key, return the link from the list, |
2406 | shstr_tmp |
2388 | * otherwise return NULL. |
2407 | object::kv_get (shstr_tmp key) const |
2389 | * |
|
|
2390 | * key must be a passed in shared string - otherwise, this won't |
|
|
2391 | * do the desired thing. |
|
|
2392 | */ |
|
|
2393 | key_value * |
|
|
2394 | get_ob_key_link (const object *ob, const char *key) |
|
|
2395 | { |
2408 | { |
2396 | for (key_value *link = ob->key_values; link; link = link->next) |
2409 | for (key_value *kv = key_values; kv; kv = kv->next) |
2397 | if (link->key == key) |
2410 | if (kv->key == key) |
2398 | return link; |
|
|
2399 | |
|
|
2400 | return 0; |
|
|
2401 | } |
|
|
2402 | |
|
|
2403 | /* |
|
|
2404 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2405 | * |
|
|
2406 | * The argument doesn't need to be a shared string. |
|
|
2407 | * |
|
|
2408 | * The returned string is shared. |
|
|
2409 | */ |
|
|
2410 | const char * |
|
|
2411 | get_ob_key_value (const object *op, const char *const key) |
|
|
2412 | { |
|
|
2413 | key_value *link; |
|
|
2414 | shstr_cmp canonical_key (key); |
|
|
2415 | |
|
|
2416 | if (!canonical_key) |
|
|
2417 | { |
|
|
2418 | /* 1. There being a field named key on any object |
|
|
2419 | * implies there'd be a shared string to find. |
|
|
2420 | * 2. Since there isn't, no object has this field. |
|
|
2421 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2422 | */ |
|
|
2423 | return 0; |
|
|
2424 | } |
|
|
2425 | |
|
|
2426 | /* This is copied from get_ob_key_link() above - |
|
|
2427 | * only 4 lines, and saves the function call overhead. |
|
|
2428 | */ |
|
|
2429 | for (link = op->key_values; link; link = link->next) |
|
|
2430 | if (link->key == canonical_key) |
|
|
2431 | return link->value; |
2411 | return kv->value; |
2432 | |
2412 | |
2433 | return 0; |
2413 | return shstr (); |
2434 | } |
2414 | } |
2435 | |
2415 | |
2436 | /* |
2416 | void |
2437 | * Updates the canonical_key in op to value. |
2417 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2438 | * |
|
|
2439 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2440 | * |
|
|
2441 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2442 | * keys. |
|
|
2443 | * |
|
|
2444 | * Returns TRUE on success. |
|
|
2445 | */ |
|
|
2446 | int |
|
|
2447 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2448 | { |
2418 | { |
2449 | key_value *field = NULL, *last = NULL; |
2419 | for (key_value *kv = key_values; kv; kv = kv->next) |
2450 | |
2420 | if (kv->key == key) |
2451 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2452 | { |
|
|
2453 | if (field->key != canonical_key) |
|
|
2454 | { |
2421 | { |
2455 | last = field; |
2422 | kv->value = value; |
2456 | continue; |
2423 | return; |
2457 | } |
2424 | } |
2458 | |
2425 | |
2459 | if (value) |
2426 | key_value *kv = new key_value; |
2460 | field->value = value; |
2427 | |
2461 | else |
2428 | kv->next = key_values; |
|
|
2429 | kv->key = key; |
|
|
2430 | kv->value = value; |
|
|
2431 | |
|
|
2432 | key_values = kv; |
|
|
2433 | } |
|
|
2434 | |
|
|
2435 | void |
|
|
2436 | object::kv_del (shstr_tmp key) |
|
|
2437 | { |
|
|
2438 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2439 | if ((*kvp)->key == key) |
2462 | { |
2440 | { |
2463 | /* Basically, if the archetype has this key set, |
2441 | key_value *kv = *kvp; |
2464 | * we need to store the null value so when we save |
2442 | *kvp = (*kvp)->next; |
2465 | * it, we save the empty value so that when we load, |
2443 | delete kv; |
2466 | * we get this value back again. |
2444 | return; |
2467 | */ |
|
|
2468 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2469 | field->value = 0; |
|
|
2470 | else |
|
|
2471 | { |
|
|
2472 | if (last) |
|
|
2473 | last->next = field->next; |
|
|
2474 | else |
|
|
2475 | op->key_values = field->next; |
|
|
2476 | |
|
|
2477 | delete field; |
|
|
2478 | } |
|
|
2479 | } |
2445 | } |
2480 | return TRUE; |
|
|
2481 | } |
|
|
2482 | /* IF we get here, key doesn't exist */ |
|
|
2483 | |
|
|
2484 | /* No field, we'll have to add it. */ |
|
|
2485 | |
|
|
2486 | if (!add_key) |
|
|
2487 | return FALSE; |
|
|
2488 | |
|
|
2489 | /* There isn't any good reason to store a null |
|
|
2490 | * value in the key/value list. If the archetype has |
|
|
2491 | * this key, then we should also have it, so shouldn't |
|
|
2492 | * be here. If user wants to store empty strings, |
|
|
2493 | * should pass in "" |
|
|
2494 | */ |
|
|
2495 | if (value == NULL) |
|
|
2496 | return TRUE; |
|
|
2497 | |
|
|
2498 | field = new key_value; |
|
|
2499 | |
|
|
2500 | field->key = canonical_key; |
|
|
2501 | field->value = value; |
|
|
2502 | /* Usual prepend-addition. */ |
|
|
2503 | field->next = op->key_values; |
|
|
2504 | op->key_values = field; |
|
|
2505 | |
|
|
2506 | return TRUE; |
|
|
2507 | } |
|
|
2508 | |
|
|
2509 | /* |
|
|
2510 | * Updates the key in op to value. |
|
|
2511 | * |
|
|
2512 | * If add_key is FALSE, this will only update existing keys, |
|
|
2513 | * and not add new ones. |
|
|
2514 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2515 | * |
|
|
2516 | * Returns TRUE on success. |
|
|
2517 | */ |
|
|
2518 | int |
|
|
2519 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2520 | { |
|
|
2521 | shstr key_ (key); |
|
|
2522 | |
|
|
2523 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2524 | } |
2446 | } |
2525 | |
2447 | |
2526 | object::depth_iterator::depth_iterator (object *container) |
2448 | object::depth_iterator::depth_iterator (object *container) |
2527 | : iterator_base (container) |
2449 | : iterator_base (container) |
2528 | { |
2450 | { |
… | |
… | |
2578 | { |
2500 | { |
2579 | char flagdesc[512]; |
2501 | char flagdesc[512]; |
2580 | char info2[256 * 4]; |
2502 | char info2[256 * 4]; |
2581 | char *p = info; |
2503 | char *p = info; |
2582 | |
2504 | |
2583 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2505 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}", |
2584 | count, |
2506 | count, |
2585 | uuid.c_str (), |
2507 | uuid.c_str (), |
2586 | &name, |
2508 | &name, |
2587 | title ? "\",title:\"" : "", |
2509 | title ? ",title:\"" : "", |
2588 | title ? (const char *)title : "", |
2510 | title ? (const char *)title : "", |
|
|
2511 | title ? "\"" : "", |
2589 | flag_desc (flagdesc, 512), type); |
2512 | flag_desc (flagdesc, 512), type); |
2590 | |
2513 | |
2591 | if (!flag[FLAG_REMOVED] && env) |
2514 | if (!flag[FLAG_REMOVED] && env) |
2592 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2515 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2593 | |
2516 | |
… | |
… | |
2609 | struct region * |
2532 | struct region * |
2610 | object::region () const |
2533 | object::region () const |
2611 | { |
2534 | { |
2612 | return map ? map->region (x, y) |
2535 | return map ? map->region (x, y) |
2613 | : region::default_region (); |
2536 | : region::default_region (); |
2614 | } |
|
|
2615 | |
|
|
2616 | const materialtype_t * |
|
|
2617 | object::dominant_material () const |
|
|
2618 | { |
|
|
2619 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2620 | return mt; |
|
|
2621 | |
|
|
2622 | return name_to_material (shstr_unknown); |
|
|
2623 | } |
2537 | } |
2624 | |
2538 | |
2625 | void |
2539 | void |
2626 | object::open_container (object *new_container) |
2540 | object::open_container (object *new_container) |
2627 | { |
2541 | { |
… | |
… | |
2649 | container = 0; |
2563 | container = 0; |
2650 | |
2564 | |
2651 | // client needs item update to make it work, client bug requires this to be separate |
2565 | // client needs item update to make it work, client bug requires this to be separate |
2652 | esrv_update_item (UPD_FLAGS, this, old_container); |
2566 | esrv_update_item (UPD_FLAGS, this, old_container); |
2653 | |
2567 | |
2654 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2568 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ()); |
2655 | play_sound (sound_find ("chest_close")); |
2569 | play_sound (sound_find ("chest_close")); |
2656 | } |
2570 | } |
2657 | |
2571 | |
2658 | if (new_container) |
2572 | if (new_container) |
2659 | { |
2573 | { |
… | |
… | |
2663 | // TODO: this does not seem to serve any purpose anymore? |
2577 | // TODO: this does not seem to serve any purpose anymore? |
2664 | #if 0 |
2578 | #if 0 |
2665 | // insert the "Close Container" object. |
2579 | // insert the "Close Container" object. |
2666 | if (archetype *closer = new_container->other_arch) |
2580 | if (archetype *closer = new_container->other_arch) |
2667 | { |
2581 | { |
2668 | object *closer = arch_to_object (new_container->other_arch); |
2582 | object *closer = new_container->other_arch->instance (); |
2669 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2583 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2670 | new_container->insert (closer); |
2584 | new_container->insert (closer); |
2671 | } |
2585 | } |
2672 | #endif |
2586 | #endif |
2673 | |
2587 | |
2674 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2588 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ()); |
2675 | |
2589 | |
2676 | // make sure the container is available, client bug requires this to be separate |
2590 | // make sure the container is available, client bug requires this to be separate |
2677 | esrv_send_item (this, new_container); |
2591 | esrv_send_item (this, new_container); |
2678 | |
2592 | |
2679 | new_container->flag [FLAG_APPLIED] = true; |
2593 | new_container->flag [FLAG_APPLIED] = true; |
… | |
… | |
2687 | // else if (!old_container->env && contr && contr->ns) |
2601 | // else if (!old_container->env && contr && contr->ns) |
2688 | // contr->ns->floorbox_reset (); |
2602 | // contr->ns->floorbox_reset (); |
2689 | } |
2603 | } |
2690 | |
2604 | |
2691 | object * |
2605 | object * |
2692 | object::force_find (const shstr name) |
2606 | object::force_find (shstr_tmp name) |
2693 | { |
2607 | { |
2694 | /* cycle through his inventory to look for the MARK we want to |
2608 | /* cycle through his inventory to look for the MARK we want to |
2695 | * place |
2609 | * place |
2696 | */ |
2610 | */ |
2697 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2611 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2699 | return splay (tmp); |
2613 | return splay (tmp); |
2700 | |
2614 | |
2701 | return 0; |
2615 | return 0; |
2702 | } |
2616 | } |
2703 | |
2617 | |
|
|
2618 | //-GPL |
|
|
2619 | |
2704 | void |
2620 | void |
|
|
2621 | object::force_set_timer (int duration) |
|
|
2622 | { |
|
|
2623 | this->duration = 1; |
|
|
2624 | this->speed_left = -1.f; |
|
|
2625 | |
|
|
2626 | this->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2627 | } |
|
|
2628 | |
|
|
2629 | object * |
2705 | object::force_add (const shstr name, int duration) |
2630 | object::force_add (shstr_tmp name, int duration) |
2706 | { |
2631 | { |
2707 | if (object *force = force_find (name)) |
2632 | if (object *force = force_find (name)) |
2708 | force->destroy (); |
2633 | force->destroy (); |
2709 | |
2634 | |
2710 | object *force = get_archetype (FORCE_NAME); |
2635 | object *force = get_archetype (FORCE_NAME); |
2711 | |
2636 | |
2712 | force->slaying = name; |
2637 | force->slaying = name; |
2713 | force->stats.food = 1; |
2638 | force->force_set_timer (duration); |
2714 | force->speed_left = -1.f; |
|
|
2715 | |
|
|
2716 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2717 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2718 | force->flag [FLAG_APPLIED] = true; |
2639 | force->flag [FLAG_APPLIED] = true; |
2719 | |
2640 | |
2720 | insert (force); |
2641 | return insert (force); |
2721 | } |
2642 | } |
2722 | |
2643 | |
2723 | void |
2644 | void |
2724 | object::play_sound (faceidx sound) |
2645 | object::play_sound (faceidx sound) const |
2725 | { |
2646 | { |
2726 | if (!sound) |
2647 | if (!sound) |
2727 | return; |
2648 | return; |
2728 | |
2649 | |
2729 | if (flag [FLAG_REMOVED]) |
2650 | if (is_on_map ()) |
|
|
2651 | map->play_sound (sound, x, y); |
|
|
2652 | else if (object *pl = in_player ()) |
|
|
2653 | pl->contr->play_sound (sound); |
|
|
2654 | } |
|
|
2655 | |
|
|
2656 | void |
|
|
2657 | object::say_msg (const char *msg) const |
|
|
2658 | { |
|
|
2659 | if (is_on_map ()) |
|
|
2660 | map->say_msg (msg, x, y); |
|
|
2661 | else if (object *pl = in_player ()) |
|
|
2662 | pl->contr->play_sound (sound); |
|
|
2663 | } |
|
|
2664 | |
|
|
2665 | void |
|
|
2666 | object::make_noise () |
|
|
2667 | { |
|
|
2668 | // we do not model noise in the map, so instead put |
|
|
2669 | // a temporary light into the noise source |
|
|
2670 | // could use the map instead, but that's less reliable for our |
|
|
2671 | // goal, which is to make invisibility a bit harder to exploit |
|
|
2672 | |
|
|
2673 | // currently only works sensibly for players |
|
|
2674 | if (!is_player ()) |
2730 | return; |
2675 | return; |
2731 | |
2676 | |
2732 | if (env) |
2677 | // find old force, or create new one |
2733 | { |
2678 | object *force = force_find (shstr_noise_force); |
2734 | if (object *pl = in_player ()) |
2679 | |
2735 | pl->contr->play_sound (sound); |
2680 | if (force) |
2736 | } |
2681 | force->speed_left = -1.f; // patch old speed up |
2737 | else |
2682 | else |
2738 | map->play_sound (sound, x, y); |
2683 | { |
2739 | } |
2684 | force = archetype::get (shstr_noise_force); |
2740 | |
2685 | |
|
|
2686 | force->slaying = shstr_noise_force; |
|
|
2687 | force->stats.food = 1; |
|
|
2688 | force->speed_left = -1.f; |
|
|
2689 | |
|
|
2690 | force->set_speed (1.f / 4.f); |
|
|
2691 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2692 | force->flag [FLAG_APPLIED] = true; |
|
|
2693 | |
|
|
2694 | insert (force); |
|
|
2695 | } |
|
|
2696 | } |
|
|
2697 | |