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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
… | |
… | |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
25 | sub/add_weight will transcend the environment updating the carrying |
|
|
26 | variable. */ |
|
|
27 | #include <global.h> |
24 | #include <global.h> |
28 | #include <stdio.h> |
25 | #include <stdio.h> |
29 | #include <sys/types.h> |
26 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
27 | #include <sys/uio.h> |
31 | #include <object.h> |
28 | #include <object.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
29 | #include <sproto.h> |
34 | #include <loader.h> |
30 | #include <loader.h> |
35 | |
31 | |
36 | #include <bitset> |
32 | #include <bitset> |
37 | |
33 | |
… | |
… | |
143 | |
139 | |
144 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
145 | static bool |
141 | static bool |
146 | compare_ob_value_lists_one (const object *wants, const object *has) |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
147 | { |
143 | { |
148 | key_value *wants_field; |
|
|
149 | |
|
|
150 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
144 | /* n-squared behaviour (see kv_get), but I'm hoping both |
151 | * objects with lists are rare, and lists stay short. If not, use a |
145 | * objects with lists are rare, and lists stay short. If not, use a |
152 | * different structure or at least keep the lists sorted... |
146 | * different structure or at least keep the lists sorted... |
153 | */ |
147 | */ |
154 | |
148 | |
155 | /* For each field in wants, */ |
149 | /* For each field in wants, */ |
156 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
150 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
157 | { |
151 | if (has->kv_get (kv->key) != kv->value) |
158 | key_value *has_field; |
152 | return false; |
159 | |
|
|
160 | /* Look for a field in has with the same key. */ |
|
|
161 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
162 | |
|
|
163 | if (!has_field) |
|
|
164 | return 0; /* No field with that name. */ |
|
|
165 | |
|
|
166 | /* Found the matching field. */ |
|
|
167 | if (has_field->value != wants_field->value) |
|
|
168 | return 0; /* Values don't match, so this half of the comparison is false. */ |
|
|
169 | |
|
|
170 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
171 | } |
|
|
172 | |
153 | |
173 | /* If we get here, every field in wants has a matching field in has. */ |
154 | /* If we get here, every field in wants has a matching field in has. */ |
174 | return 1; |
155 | return true; |
175 | } |
156 | } |
176 | |
157 | |
177 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
158 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
178 | static bool |
159 | static bool |
179 | compare_ob_value_lists (const object *ob1, const object *ob2) |
160 | compare_ob_value_lists (const object *ob1, const object *ob2) |
180 | { |
161 | { |
181 | /* However, there may be fields in has which aren't partnered in wants, |
162 | /* However, there may be fields in has which aren't partnered in wants, |
182 | * so we need to run the comparison *twice*. :( |
163 | * so we need to run the comparison *twice*. :( |
183 | */ |
164 | */ |
184 | return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
165 | return compare_ob_value_lists_one (ob1, ob2) |
|
|
166 | && compare_ob_value_lists_one (ob2, ob1); |
185 | } |
167 | } |
186 | |
168 | |
187 | /* Function examines the 2 objects given to it, and returns true if |
169 | /* Function examines the 2 objects given to it, and returns true if |
188 | * they can be merged together. |
170 | * they can be merged together. |
189 | * |
171 | * |
… | |
… | |
205 | || ob1->value != ob2->value |
187 | || ob1->value != ob2->value |
206 | || ob1->name != ob2->name) |
188 | || ob1->name != ob2->name) |
207 | return 0; |
189 | return 0; |
208 | |
190 | |
209 | /* Do not merge objects if nrof would overflow. First part checks |
191 | /* Do not merge objects if nrof would overflow. First part checks |
210 | * for unsigned overflow (2c), second part checks wether the result |
192 | * for unsigned overflow (2c), second part checks whether the result |
211 | * would fit into a 32 bit signed int, which is often used to hold |
193 | * would fit into a 32 bit signed int, which is often used to hold |
212 | * nrof values. |
194 | * nrof values. |
213 | */ |
195 | */ |
214 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
215 | return 0; |
197 | return 0; |
… | |
… | |
224 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
206 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
225 | |
207 | |
226 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
208 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
227 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
209 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
228 | |
210 | |
229 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
211 | if (ob1->arch->name != ob2->arch->name |
230 | || ob1->arch != ob2->arch |
|
|
231 | || ob1->name != ob2->name |
212 | || ob1->name != ob2->name |
232 | || ob1->title != ob2->title |
213 | || ob1->title != ob2->title |
233 | || ob1->msg != ob2->msg |
214 | || ob1->msg != ob2->msg |
234 | || ob1->weight != ob2->weight |
215 | || ob1->weight != ob2->weight |
235 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
236 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
237 | || ob1->attacktype != ob2->attacktype |
216 | || ob1->attacktype != ob2->attacktype |
238 | || ob1->magic != ob2->magic |
217 | || ob1->magic != ob2->magic |
239 | || ob1->slaying != ob2->slaying |
218 | || ob1->slaying != ob2->slaying |
240 | || ob1->skill != ob2->skill |
219 | || ob1->skill != ob2->skill |
241 | || ob1->value != ob2->value |
220 | || ob1->value != ob2->value |
… | |
… | |
248 | || ob1->move_block != ob2->move_block |
227 | || ob1->move_block != ob2->move_block |
249 | || ob1->move_allow != ob2->move_allow |
228 | || ob1->move_allow != ob2->move_allow |
250 | || ob1->move_on != ob2->move_on |
229 | || ob1->move_on != ob2->move_on |
251 | || ob1->move_off != ob2->move_off |
230 | || ob1->move_off != ob2->move_off |
252 | || ob1->move_slow != ob2->move_slow |
231 | || ob1->move_slow != ob2->move_slow |
253 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
232 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
|
|
235 | return 0; |
|
|
236 | |
|
|
237 | if ((ob1->flag ^ ob2->flag) |
|
|
238 | .reset (FLAG_INV_LOCKED) |
|
|
239 | .reset (FLAG_CLIENT_SENT) |
|
|
240 | .reset (FLAG_REMOVED) |
|
|
241 | .any ()) |
254 | return 0; |
242 | return 0; |
255 | |
243 | |
256 | /* This is really a spellbook check - we should in general |
244 | /* This is really a spellbook check - we should in general |
257 | * not merge objects with real inventories, as splitting them |
245 | * not merge objects with real inventories, as splitting them |
258 | * is hard. |
246 | * is hard. |
… | |
… | |
297 | |
285 | |
298 | if (ob1->key_values || ob2->key_values) |
286 | if (ob1->key_values || ob2->key_values) |
299 | { |
287 | { |
300 | /* At least one of these has key_values. */ |
288 | /* At least one of these has key_values. */ |
301 | if ((!ob1->key_values) != (!ob2->key_values)) |
289 | if ((!ob1->key_values) != (!ob2->key_values)) |
302 | /* One has fields, but the other one doesn't. */ |
290 | return 0; /* One has fields, but the other one doesn't. */ |
303 | return 0; |
291 | |
304 | else if (!compare_ob_value_lists (ob1, ob2)) |
292 | if (!compare_ob_value_lists (ob1, ob2)) |
305 | return 0; |
293 | return 0; |
306 | } |
294 | } |
307 | |
295 | |
308 | if (ob1->self || ob2->self) |
296 | if (ob1->self || ob2->self) |
309 | { |
297 | { |
… | |
… | |
315 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
303 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
316 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
304 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
317 | |
305 | |
318 | if (k1 != k2) |
306 | if (k1 != k2) |
319 | return 0; |
307 | return 0; |
|
|
308 | |
320 | else if (k1 == 0) |
309 | if (k1 == 0) |
321 | return 1; |
310 | return 1; |
|
|
311 | |
322 | else if (!cfperl_can_merge (ob1, ob2)) |
312 | if (!cfperl_can_merge (ob1, ob2)) |
323 | return 0; |
313 | return 0; |
324 | } |
314 | } |
325 | } |
315 | } |
326 | |
316 | |
327 | /* Everything passes, must be OK. */ |
317 | /* Everything passes, must be OK. */ |
328 | return 1; |
318 | return 1; |
329 | } |
319 | } |
330 | |
320 | |
|
|
321 | // find player who can see this object |
|
|
322 | object * |
|
|
323 | object::visible_to () const |
|
|
324 | { |
|
|
325 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
326 | { |
|
|
327 | // see if we are in a container of sorts |
|
|
328 | if (env) |
|
|
329 | { |
|
|
330 | // the player inventory itself is always visible |
|
|
331 | if (env->type == PLAYER) |
|
|
332 | return env; |
|
|
333 | |
|
|
334 | // else a player could have our env open |
|
|
335 | object *envest = env->outer_env (); |
|
|
336 | |
|
|
337 | // the player itself is always on a map, so we will find him here |
|
|
338 | // even if our inv is in a player. |
|
|
339 | if (envest->is_on_map ()) |
|
|
340 | if (object *pl = envest->ms ().player ()) |
|
|
341 | if (pl->container == env) |
|
|
342 | return pl; |
|
|
343 | } |
|
|
344 | else |
|
|
345 | { |
|
|
346 | // maybe there is a player standing on the same mapspace |
|
|
347 | // this will catch the case where "this" is a player |
|
|
348 | if (object *pl = ms ().player ()) |
|
|
349 | if (!pl->container || this == pl->container) |
|
|
350 | return pl; |
|
|
351 | } |
|
|
352 | } |
|
|
353 | |
|
|
354 | return 0; |
|
|
355 | } |
|
|
356 | |
|
|
357 | // adjust weight per container type ("of holding") |
|
|
358 | static sint32 |
|
|
359 | weight_adjust_for (object *op, sint32 weight) |
|
|
360 | { |
|
|
361 | return op->type == CONTAINER |
|
|
362 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
363 | : weight; |
|
|
364 | } |
|
|
365 | |
331 | /* |
366 | /* |
|
|
367 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
368 | * and also updates how much the environment(s) is/are carrying. |
|
|
369 | */ |
|
|
370 | static void |
|
|
371 | adjust_weight (object *op, sint32 weight) |
|
|
372 | { |
|
|
373 | while (op) |
|
|
374 | { |
|
|
375 | // adjust by actual difference to account for rounding errors |
|
|
376 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
377 | weight = weight_adjust_for (op, op->carrying) |
|
|
378 | - weight_adjust_for (op, op->carrying - weight); |
|
|
379 | |
|
|
380 | if (!weight) |
|
|
381 | return; |
|
|
382 | |
|
|
383 | op->carrying += weight; |
|
|
384 | |
|
|
385 | if (object *pl = op->visible_to ()) |
|
|
386 | if (pl != op) // player is handled lazily |
|
|
387 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
388 | |
|
|
389 | op = op->env; |
|
|
390 | } |
|
|
391 | } |
|
|
392 | |
|
|
393 | /* |
332 | * sum_weight() is a recursive function which calculates the weight |
394 | * this is a recursive function which calculates the weight |
333 | * an object is carrying. It goes through in figures out how much |
395 | * an object is carrying. It goes through op and figures out how much |
334 | * containers are carrying, and sums it up. |
396 | * containers are carrying, and sums it up. |
335 | */ |
397 | */ |
336 | long |
398 | void |
337 | sum_weight (object *op) |
399 | object::update_weight () |
338 | { |
400 | { |
339 | long sum; |
401 | sint32 sum = 0; |
340 | object *inv; |
|
|
341 | |
402 | |
342 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
403 | for (object *op = inv; op; op = op->below) |
343 | { |
404 | { |
344 | if (inv->inv) |
405 | if (op->inv) |
345 | sum_weight (inv); |
406 | op->update_weight (); |
346 | |
407 | |
347 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
408 | sum += op->total_weight (); |
|
|
409 | } |
|
|
410 | |
|
|
411 | sum = weight_adjust_for (this, sum); |
|
|
412 | |
|
|
413 | if (sum != carrying) |
348 | } |
414 | { |
349 | |
|
|
350 | if (op->type == CONTAINER && op->stats.Str) |
|
|
351 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
352 | |
|
|
353 | if (op->carrying != sum) |
|
|
354 | op->carrying = sum; |
415 | carrying = sum; |
355 | |
416 | |
356 | return sum; |
417 | if (object *pl = visible_to ()) |
|
|
418 | if (pl != this) // player is handled lazily |
|
|
419 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
420 | } |
357 | } |
421 | } |
358 | |
422 | |
359 | /** |
423 | /* |
360 | * Return the outermost environment object for a given object. |
424 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
361 | */ |
|
|
362 | |
|
|
363 | object * |
|
|
364 | object_get_env_recursive (object *op) |
|
|
365 | { |
|
|
366 | while (op->env != NULL) |
|
|
367 | op = op->env; |
|
|
368 | return op; |
|
|
369 | } |
|
|
370 | |
|
|
371 | /* |
|
|
372 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
373 | * Some error messages. |
|
|
374 | * The result of the dump is stored in the static global errmsg array. |
|
|
375 | */ |
425 | */ |
376 | char * |
426 | char * |
377 | dump_object (object *op) |
427 | dump_object (object *op) |
378 | { |
428 | { |
379 | if (!op) |
429 | if (!op) |
… | |
… | |
393 | get_nearest_part (object *op, const object *pl) |
443 | get_nearest_part (object *op, const object *pl) |
394 | { |
444 | { |
395 | object *tmp, *closest; |
445 | object *tmp, *closest; |
396 | int last_dist, i; |
446 | int last_dist, i; |
397 | |
447 | |
398 | if (op->more == NULL) |
448 | if (!op->more) |
399 | return op; |
449 | return op; |
|
|
450 | |
400 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
451 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
452 | tmp; |
|
|
453 | tmp = tmp->more) |
401 | if ((i = distance (tmp, pl)) < last_dist) |
454 | if ((i = distance (tmp, pl)) < last_dist) |
402 | closest = tmp, last_dist = i; |
455 | closest = tmp, last_dist = i; |
|
|
456 | |
403 | return closest; |
457 | return closest; |
404 | } |
458 | } |
405 | |
459 | |
406 | /* |
460 | /* |
407 | * Returns the object which has the count-variable equal to the argument. |
461 | * Returns the object which has the count-variable equal to the argument. |
|
|
462 | * VERRRY slow. |
408 | */ |
463 | */ |
409 | object * |
464 | object * |
410 | find_object (tag_t i) |
465 | find_object (tag_t i) |
411 | { |
466 | { |
412 | for_all_objects (op) |
467 | for_all_objects (op) |
… | |
… | |
537 | } |
592 | } |
538 | |
593 | |
539 | op->key_values = 0; |
594 | op->key_values = 0; |
540 | } |
595 | } |
541 | |
596 | |
542 | object & |
597 | /* |
543 | object::operator =(const object &src) |
598 | * copy_to first frees everything allocated by the dst object, |
|
|
599 | * and then copies the contents of itself into the second |
|
|
600 | * object, allocating what needs to be allocated. Basically, any |
|
|
601 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
602 | * if the first object is freed, the pointers in the new object |
|
|
603 | * will point at garbage. |
|
|
604 | */ |
|
|
605 | void |
|
|
606 | object::copy_to (object *dst) |
544 | { |
607 | { |
545 | bool is_freed = flag [FLAG_FREED]; |
608 | dst->remove (); |
546 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
547 | |
|
|
548 | *(object_copy *)this = src; |
609 | *(object_copy *)dst = *this; |
549 | |
|
|
550 | flag [FLAG_FREED] = is_freed; |
|
|
551 | flag [FLAG_REMOVED] = is_removed; |
610 | dst->flag [FLAG_REMOVED] = true; |
552 | |
611 | |
553 | /* Copy over key_values, if any. */ |
612 | /* Copy over key_values, if any. */ |
554 | if (src.key_values) |
613 | if (key_values) |
555 | { |
614 | { |
556 | key_value *tail = 0; |
615 | key_value *tail = 0; |
557 | key_values = 0; |
616 | dst->key_values = 0; |
558 | |
617 | |
559 | for (key_value *i = src.key_values; i; i = i->next) |
618 | for (key_value *i = key_values; i; i = i->next) |
560 | { |
619 | { |
561 | key_value *new_link = new key_value; |
620 | key_value *new_link = new key_value; |
562 | |
621 | |
563 | new_link->next = 0; |
622 | new_link->next = 0; |
564 | new_link->key = i->key; |
623 | new_link->key = i->key; |
565 | new_link->value = i->value; |
624 | new_link->value = i->value; |
566 | |
625 | |
567 | /* Try and be clever here, too. */ |
626 | /* Try and be clever here, too. */ |
568 | if (!key_values) |
627 | if (!dst->key_values) |
569 | { |
628 | { |
570 | key_values = new_link; |
629 | dst->key_values = new_link; |
571 | tail = new_link; |
630 | tail = new_link; |
572 | } |
631 | } |
573 | else |
632 | else |
574 | { |
633 | { |
575 | tail->next = new_link; |
634 | tail->next = new_link; |
576 | tail = new_link; |
635 | tail = new_link; |
577 | } |
636 | } |
578 | } |
637 | } |
579 | } |
638 | } |
580 | } |
|
|
581 | |
|
|
582 | /* |
|
|
583 | * copy_to first frees everything allocated by the dst object, |
|
|
584 | * and then copies the contents of itself into the second |
|
|
585 | * object, allocating what needs to be allocated. Basically, any |
|
|
586 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
587 | * if the first object is freed, the pointers in the new object |
|
|
588 | * will point at garbage. |
|
|
589 | */ |
|
|
590 | void |
|
|
591 | object::copy_to (object *dst) |
|
|
592 | { |
|
|
593 | *dst = *this; |
|
|
594 | |
639 | |
595 | if (speed < 0) |
640 | if (speed < 0) |
596 | dst->speed_left -= rndm (); |
641 | dst->speed_left -= rndm (); |
597 | |
642 | |
598 | dst->set_speed (dst->speed); |
643 | dst->set_speed (dst->speed); |
… | |
… | |
620 | object * |
665 | object * |
621 | object::clone () |
666 | object::clone () |
622 | { |
667 | { |
623 | object *neu = create (); |
668 | object *neu = create (); |
624 | copy_to (neu); |
669 | copy_to (neu); |
|
|
670 | neu->map = map; // not copied by copy_to |
625 | return neu; |
671 | return neu; |
626 | } |
672 | } |
627 | |
673 | |
628 | /* |
674 | /* |
629 | * If an object with the IS_TURNABLE() flag needs to be turned due |
675 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
680 | * UP_OBJ_FACE: only the objects face has changed. |
726 | * UP_OBJ_FACE: only the objects face has changed. |
681 | */ |
727 | */ |
682 | void |
728 | void |
683 | update_object (object *op, int action) |
729 | update_object (object *op, int action) |
684 | { |
730 | { |
685 | if (op == NULL) |
731 | if (!op) |
686 | { |
732 | { |
687 | /* this should never happen */ |
733 | /* this should never happen */ |
688 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
734 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
689 | return; |
735 | return; |
690 | } |
736 | } |
691 | |
737 | |
692 | if (op->env) |
738 | if (!op->is_on_map ()) |
693 | { |
739 | { |
694 | /* Animation is currently handled by client, so nothing |
740 | /* Animation is currently handled by client, so nothing |
695 | * to do in this case. |
741 | * to do in this case. |
696 | */ |
742 | */ |
697 | return; |
743 | return; |
698 | } |
744 | } |
699 | |
|
|
700 | /* If the map is saving, don't do anything as everything is |
|
|
701 | * going to get freed anyways. |
|
|
702 | */ |
|
|
703 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
704 | return; |
|
|
705 | |
745 | |
706 | /* make sure the object is within map boundaries */ |
746 | /* make sure the object is within map boundaries */ |
707 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
747 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
708 | { |
748 | { |
709 | LOG (llevError, "update_object() called for object out of map!\n"); |
749 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
852 | object::destroy_inv (bool drop_to_ground) |
892 | object::destroy_inv (bool drop_to_ground) |
853 | { |
893 | { |
854 | // need to check first, because the checks below might segfault |
894 | // need to check first, because the checks below might segfault |
855 | // as we might be on an invalid mapspace and crossfire code |
895 | // as we might be on an invalid mapspace and crossfire code |
856 | // is too buggy to ensure that the inventory is empty. |
896 | // is too buggy to ensure that the inventory is empty. |
857 | // corollary: if you create arrows etc. with stuff in tis inventory, |
897 | // corollary: if you create arrows etc. with stuff in its inventory, |
858 | // cf will crash below with off-map x and y |
898 | // cf will crash below with off-map x and y |
859 | if (!inv) |
899 | if (!inv) |
860 | return; |
900 | return; |
861 | |
901 | |
862 | /* Only if the space blocks everything do we not process - |
902 | /* Only if the space blocks everything do we not process - |
863 | * if some form of movement is allowed, let objects |
903 | * if some form of movement is allowed, let objects |
864 | * drop on that space. |
904 | * drop on that space. |
865 | */ |
905 | */ |
866 | if (!drop_to_ground |
906 | if (!drop_to_ground |
867 | || !map |
907 | || !map |
868 | || map->in_memory != MAP_IN_MEMORY |
908 | || map->in_memory != MAP_ACTIVE |
869 | || map->nodrop |
909 | || map->no_drop |
870 | || ms ().move_block == MOVE_ALL) |
910 | || ms ().move_block == MOVE_ALL) |
871 | { |
911 | { |
872 | while (inv) |
912 | while (inv) |
873 | { |
913 | { |
874 | inv->destroy_inv (drop_to_ground); |
914 | inv->destroy_inv (false); |
875 | inv->destroy (); |
915 | inv->destroy (); |
876 | } |
916 | } |
877 | } |
917 | } |
878 | else |
918 | else |
879 | { /* Put objects in inventory onto this space */ |
919 | { /* Put objects in inventory onto this space */ |
… | |
… | |
885 | || op->flag [FLAG_NO_DROP] |
925 | || op->flag [FLAG_NO_DROP] |
886 | || op->type == RUNE |
926 | || op->type == RUNE |
887 | || op->type == TRAP |
927 | || op->type == TRAP |
888 | || op->flag [FLAG_IS_A_TEMPLATE] |
928 | || op->flag [FLAG_IS_A_TEMPLATE] |
889 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
929 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
890 | op->destroy (); |
930 | op->destroy (true); |
891 | else |
931 | else |
892 | map->insert (op, x, y); |
932 | map->insert (op, x, y); |
893 | } |
933 | } |
894 | } |
934 | } |
895 | } |
935 | } |
… | |
… | |
899 | object *op = new object; |
939 | object *op = new object; |
900 | op->link (); |
940 | op->link (); |
901 | return op; |
941 | return op; |
902 | } |
942 | } |
903 | |
943 | |
|
|
944 | static struct freed_map : maptile |
|
|
945 | { |
|
|
946 | freed_map () |
|
|
947 | { |
|
|
948 | path = "<freed objects map>"; |
|
|
949 | name = "/internal/freed_objects_map"; |
|
|
950 | width = 3; |
|
|
951 | height = 3; |
|
|
952 | no_drop = 1; |
|
|
953 | no_reset = 1; |
|
|
954 | |
|
|
955 | alloc (); |
|
|
956 | in_memory = MAP_ACTIVE; |
|
|
957 | } |
|
|
958 | |
|
|
959 | ~freed_map () |
|
|
960 | { |
|
|
961 | destroy (); |
|
|
962 | } |
|
|
963 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
964 | |
904 | void |
965 | void |
905 | object::do_destroy () |
966 | object::do_destroy () |
906 | { |
967 | { |
907 | attachable::do_destroy (); |
|
|
908 | |
|
|
909 | if (flag [FLAG_IS_LINKED]) |
968 | if (flag [FLAG_IS_LINKED]) |
910 | remove_button_link (this); |
969 | remove_button_link (this); |
911 | |
970 | |
912 | if (flag [FLAG_FRIENDLY]) |
971 | if (flag [FLAG_FRIENDLY]) |
913 | remove_friendly_object (this); |
972 | remove_friendly_object (this); |
914 | |
973 | |
915 | if (!flag [FLAG_REMOVED]) |
|
|
916 | remove (); |
974 | remove (); |
917 | |
975 | |
918 | destroy_inv (true); |
976 | attachable::do_destroy (); |
919 | |
977 | |
920 | deactivate (); |
978 | deactivate (); |
921 | unlink (); |
979 | unlink (); |
922 | |
980 | |
923 | flag [FLAG_FREED] = 1; |
981 | flag [FLAG_FREED] = 1; |
924 | |
982 | |
925 | // hack to ensure that freed objects still have a valid map |
983 | // hack to ensure that freed objects still have a valid map |
926 | { |
|
|
927 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
928 | |
|
|
929 | if (!freed_map) |
|
|
930 | { |
|
|
931 | freed_map = new maptile; |
|
|
932 | |
|
|
933 | freed_map->path = "<freed objects map>"; |
|
|
934 | freed_map->name = "/internal/freed_objects_map"; |
|
|
935 | freed_map->width = 3; |
|
|
936 | freed_map->height = 3; |
|
|
937 | freed_map->nodrop = 1; |
|
|
938 | |
|
|
939 | freed_map->alloc (); |
|
|
940 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
941 | } |
|
|
942 | |
|
|
943 | map = freed_map; |
984 | map = &freed_map; |
944 | x = 1; |
985 | x = 1; |
945 | y = 1; |
986 | y = 1; |
946 | } |
|
|
947 | |
987 | |
948 | if (more) |
988 | if (more) |
949 | { |
989 | { |
950 | more->destroy (); |
990 | more->destroy (); |
951 | more = 0; |
991 | more = 0; |
… | |
… | |
964 | object::destroy (bool destroy_inventory) |
1004 | object::destroy (bool destroy_inventory) |
965 | { |
1005 | { |
966 | if (destroyed ()) |
1006 | if (destroyed ()) |
967 | return; |
1007 | return; |
968 | |
1008 | |
|
|
1009 | if (!is_head () && !head->destroyed ()) |
|
|
1010 | { |
|
|
1011 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1012 | head->destroy (destroy_inventory); |
|
|
1013 | return; |
|
|
1014 | } |
|
|
1015 | |
969 | if (destroy_inventory) |
1016 | destroy_inv (!destroy_inventory); |
970 | destroy_inv (false); |
|
|
971 | |
1017 | |
972 | if (is_head ()) |
1018 | if (is_head ()) |
973 | if (sound_destroy) |
1019 | if (sound_destroy) |
974 | play_sound (sound_destroy); |
1020 | play_sound (sound_destroy); |
975 | else if (flag [FLAG_MONSTER]) |
1021 | else if (flag [FLAG_MONSTER]) |
976 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
1022 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
977 | |
1023 | |
978 | attachable::destroy (); |
1024 | attachable::destroy (); |
979 | } |
|
|
980 | |
|
|
981 | /* |
|
|
982 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
983 | * weight of an object (and what is carried by it's environment(s)). |
|
|
984 | */ |
|
|
985 | void |
|
|
986 | sub_weight (object *op, signed long weight) |
|
|
987 | { |
|
|
988 | while (op != NULL) |
|
|
989 | { |
|
|
990 | if (op->type == CONTAINER) |
|
|
991 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
992 | |
|
|
993 | op->carrying -= weight; |
|
|
994 | op = op->env; |
|
|
995 | } |
|
|
996 | } |
1025 | } |
997 | |
1026 | |
998 | /* op->remove (): |
1027 | /* op->remove (): |
999 | * This function removes the object op from the linked list of objects |
1028 | * This function removes the object op from the linked list of objects |
1000 | * which it is currently tied to. When this function is done, the |
1029 | * which it is currently tied to. When this function is done, the |
… | |
… | |
1006 | object::do_remove () |
1035 | object::do_remove () |
1007 | { |
1036 | { |
1008 | object *tmp, *last = 0; |
1037 | object *tmp, *last = 0; |
1009 | object *otmp; |
1038 | object *otmp; |
1010 | |
1039 | |
1011 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1040 | if (flag [FLAG_REMOVED]) |
1012 | return; |
1041 | return; |
1013 | |
1042 | |
1014 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1015 | INVOKE_OBJECT (REMOVE, this); |
1043 | INVOKE_OBJECT (REMOVE, this); |
|
|
1044 | |
|
|
1045 | flag [FLAG_REMOVED] = true; |
1016 | |
1046 | |
1017 | if (more) |
1047 | if (more) |
1018 | more->remove (); |
1048 | more->remove (); |
1019 | |
1049 | |
1020 | /* |
1050 | /* |
1021 | * In this case, the object to be removed is in someones |
1051 | * In this case, the object to be removed is in someones |
1022 | * inventory. |
1052 | * inventory. |
1023 | */ |
1053 | */ |
1024 | if (env) |
1054 | if (env) |
1025 | { |
1055 | { |
1026 | if (nrof) |
1056 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1027 | sub_weight (env, weight * nrof); |
1057 | if (object *pl = visible_to ()) |
1028 | else |
1058 | esrv_del_item (pl->contr, count); |
1029 | sub_weight (env, weight + carrying); |
1059 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1060 | |
|
|
1061 | adjust_weight (env, -total_weight ()); |
|
|
1062 | |
|
|
1063 | /* we set up values so that it could be inserted into |
|
|
1064 | * the map, but we don't actually do that - it is up |
|
|
1065 | * to the caller to decide what we want to do. |
|
|
1066 | */ |
|
|
1067 | map = env->map; |
|
|
1068 | x = env->x; |
|
|
1069 | y = env->y; |
|
|
1070 | |
|
|
1071 | // make sure cmov optimisation is applicable |
|
|
1072 | *(above ? &above->below : &env->inv) = below; |
|
|
1073 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1074 | |
|
|
1075 | above = 0; |
|
|
1076 | below = 0; |
|
|
1077 | env = 0; |
1030 | |
1078 | |
1031 | /* NO_FIX_PLAYER is set when a great many changes are being |
1079 | /* NO_FIX_PLAYER is set when a great many changes are being |
1032 | * made to players inventory. If set, avoiding the call |
1080 | * made to players inventory. If set, avoiding the call |
1033 | * to save cpu time. |
1081 | * to save cpu time. |
1034 | */ |
1082 | */ |
1035 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1083 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1036 | otmp->update_stats (); |
1084 | otmp->update_stats (); |
1037 | |
|
|
1038 | if (above) |
|
|
1039 | above->below = below; |
|
|
1040 | else |
|
|
1041 | env->inv = below; |
|
|
1042 | |
|
|
1043 | if (below) |
|
|
1044 | below->above = above; |
|
|
1045 | |
|
|
1046 | /* we set up values so that it could be inserted into |
|
|
1047 | * the map, but we don't actually do that - it is up |
|
|
1048 | * to the caller to decide what we want to do. |
|
|
1049 | */ |
|
|
1050 | x = env->x, y = env->y; |
|
|
1051 | map = env->map; |
|
|
1052 | above = 0, below = 0; |
|
|
1053 | env = 0; |
|
|
1054 | } |
1085 | } |
1055 | else if (map) |
1086 | else if (map) |
1056 | { |
1087 | { |
1057 | if (type == PLAYER) |
|
|
1058 | { |
|
|
1059 | // leaving a spot always closes any open container on the ground |
|
|
1060 | if (container && !container->env) |
|
|
1061 | // this causes spurious floorbox updates, but it ensures |
|
|
1062 | // that the CLOSE event is being sent. |
|
|
1063 | close_container (); |
|
|
1064 | |
|
|
1065 | --map->players; |
|
|
1066 | map->touch (); |
|
|
1067 | } |
|
|
1068 | |
|
|
1069 | map->dirty = true; |
1088 | map->dirty = true; |
1070 | mapspace &ms = this->ms (); |
1089 | mapspace &ms = this->ms (); |
1071 | |
1090 | |
|
|
1091 | if (object *pl = ms.player ()) |
|
|
1092 | { |
|
|
1093 | if (type == PLAYER) // this == pl(!) |
|
|
1094 | { |
|
|
1095 | // leaving a spot always closes any open container on the ground |
|
|
1096 | if (container && !container->env) |
|
|
1097 | // this causes spurious floorbox updates, but it ensures |
|
|
1098 | // that the CLOSE event is being sent. |
|
|
1099 | close_container (); |
|
|
1100 | |
|
|
1101 | --map->players; |
|
|
1102 | map->touch (); |
|
|
1103 | } |
|
|
1104 | else if (pl->container == this) |
|
|
1105 | { |
|
|
1106 | // removing a container should close it |
|
|
1107 | close_container (); |
|
|
1108 | } |
|
|
1109 | |
|
|
1110 | esrv_del_item (pl->contr, count); |
|
|
1111 | } |
|
|
1112 | |
1072 | /* link the object above us */ |
1113 | /* link the object above us */ |
1073 | if (above) |
1114 | // re-link, make sure compiler can easily use cmove |
1074 | above->below = below; |
1115 | *(above ? &above->below : &ms.top) = below; |
1075 | else |
1116 | *(below ? &below->above : &ms.bot) = above; |
1076 | ms.top = below; /* we were top, set new top */ |
|
|
1077 | |
|
|
1078 | /* Relink the object below us, if there is one */ |
|
|
1079 | if (below) |
|
|
1080 | below->above = above; |
|
|
1081 | else |
|
|
1082 | { |
|
|
1083 | /* Nothing below, which means we need to relink map object for this space |
|
|
1084 | * use translated coordinates in case some oddness with map tiling is |
|
|
1085 | * evident |
|
|
1086 | */ |
|
|
1087 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1088 | 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 ()); |
|
|
1089 | |
|
|
1090 | ms.bot = above; /* goes on above it. */ |
|
|
1091 | } |
|
|
1092 | |
1117 | |
1093 | above = 0; |
1118 | above = 0; |
1094 | below = 0; |
1119 | below = 0; |
1095 | |
1120 | |
1096 | if (map->in_memory == MAP_SAVING) |
1121 | if (map->in_memory == MAP_SAVING) |
… | |
… | |
1105 | * removed (most likely destroyed), update the player view |
1130 | * removed (most likely destroyed), update the player view |
1106 | * appropriately. |
1131 | * appropriately. |
1107 | */ |
1132 | */ |
1108 | pl->close_container (); |
1133 | pl->close_container (); |
1109 | |
1134 | |
|
|
1135 | //TODO: the floorbox prev/next might need updating |
|
|
1136 | //esrv_del_item (pl->contr, count); |
|
|
1137 | //TODO: update floorbox to preserve ordering |
|
|
1138 | if (pl->contr->ns) |
1110 | pl->contr->ns->floorbox_update (); |
1139 | pl->contr->ns->floorbox_update (); |
1111 | } |
1140 | } |
1112 | |
1141 | |
1113 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1142 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1114 | { |
1143 | { |
1115 | /* No point updating the players look faces if he is the object |
1144 | /* No point updating the players look faces if he is the object |
… | |
… | |
1159 | if (!top) |
1188 | if (!top) |
1160 | for (top = op; top && top->above; top = top->above) |
1189 | for (top = op; top && top->above; top = top->above) |
1161 | ; |
1190 | ; |
1162 | |
1191 | |
1163 | for (; top; top = top->below) |
1192 | for (; top; top = top->below) |
1164 | { |
|
|
1165 | if (top == op) |
|
|
1166 | continue; |
|
|
1167 | |
|
|
1168 | if (object::can_merge (op, top)) |
1193 | if (object::can_merge (op, top)) |
1169 | { |
1194 | { |
1170 | top->nrof += op->nrof; |
1195 | top->nrof += op->nrof; |
1171 | |
1196 | |
1172 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1197 | if (object *pl = top->visible_to ()) |
1173 | op->weight = 0; /* Don't want any adjustements now */ |
1198 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1199 | |
|
|
1200 | op->weight = 0; // cancel the addition above |
|
|
1201 | op->carrying = 0; // must be 0 already |
|
|
1202 | |
1174 | op->destroy (); |
1203 | op->destroy (1); |
|
|
1204 | |
1175 | return top; |
1205 | return top; |
1176 | } |
1206 | } |
1177 | } |
|
|
1178 | |
1207 | |
1179 | return 0; |
1208 | return 0; |
1180 | } |
1209 | } |
1181 | |
1210 | |
1182 | void |
1211 | void |
… | |
… | |
1239 | * just 'op' otherwise |
1268 | * just 'op' otherwise |
1240 | */ |
1269 | */ |
1241 | object * |
1270 | object * |
1242 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1271 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1243 | { |
1272 | { |
1244 | assert (!op->flag [FLAG_FREED]); |
|
|
1245 | |
|
|
1246 | object *top, *floor = NULL; |
|
|
1247 | |
|
|
1248 | op->remove (); |
1273 | op->remove (); |
1249 | |
1274 | |
1250 | /* Ideally, the caller figures this out. However, it complicates a lot |
1275 | /* Ideally, the caller figures this out. However, it complicates a lot |
1251 | * of areas of callers (eg, anything that uses find_free_spot would now |
1276 | * of areas of callers (eg, anything that uses find_free_spot would now |
1252 | * need extra work |
1277 | * need extra work |
1253 | */ |
1278 | */ |
1254 | if (!xy_normalise (m, op->x, op->y)) |
1279 | if (!xy_normalise (m, op->x, op->y)) |
1255 | { |
1280 | { |
1256 | op->destroy (); |
1281 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1257 | return 0; |
1282 | return 0; |
1258 | } |
1283 | } |
1259 | |
1284 | |
1260 | if (object *more = op->more) |
1285 | if (object *more = op->more) |
1261 | if (!insert_ob_in_map (more, m, originator, flag)) |
1286 | if (!insert_ob_in_map (more, m, originator, flag)) |
… | |
… | |
1270 | */ |
1295 | */ |
1271 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1296 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1272 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1297 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1273 | if (object::can_merge (op, tmp)) |
1298 | if (object::can_merge (op, tmp)) |
1274 | { |
1299 | { |
|
|
1300 | // TODO: we actually want to update tmp, not op, |
|
|
1301 | // but some caller surely breaks when we return tmp |
|
|
1302 | // from here :/ |
1275 | op->nrof += tmp->nrof; |
1303 | op->nrof += tmp->nrof; |
1276 | tmp->destroy (); |
1304 | tmp->destroy (1); |
1277 | } |
1305 | } |
1278 | |
1306 | |
1279 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1307 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1280 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1308 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1281 | |
1309 | |
… | |
… | |
1288 | { |
1316 | { |
1289 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1317 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1290 | abort (); |
1318 | abort (); |
1291 | } |
1319 | } |
1292 | |
1320 | |
|
|
1321 | if (!originator->is_on_map ()) |
|
|
1322 | LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
|
|
1323 | op->debug_desc (), originator->debug_desc ()); |
|
|
1324 | |
1293 | op->above = originator; |
1325 | op->above = originator; |
1294 | op->below = originator->below; |
1326 | op->below = originator->below; |
1295 | |
|
|
1296 | if (op->below) |
|
|
1297 | op->below->above = op; |
|
|
1298 | else |
|
|
1299 | ms.bot = op; |
|
|
1300 | |
|
|
1301 | /* since *below* originator, no need to update top */ |
|
|
1302 | originator->below = op; |
1327 | originator->below = op; |
|
|
1328 | |
|
|
1329 | *(op->below ? &op->below->above : &ms.bot) = op; |
1303 | } |
1330 | } |
1304 | else |
1331 | else |
1305 | { |
1332 | { |
1306 | top = ms.bot; |
1333 | object *floor = 0; |
|
|
1334 | object *top = ms.top; |
1307 | |
1335 | |
1308 | /* If there are other objects, then */ |
1336 | /* If there are other objects, then */ |
1309 | if (top) |
1337 | if (top) |
1310 | { |
1338 | { |
1311 | object *last = 0; |
|
|
1312 | |
|
|
1313 | /* |
1339 | /* |
1314 | * If there are multiple objects on this space, we do some trickier handling. |
1340 | * If there are multiple objects on this space, we do some trickier handling. |
1315 | * We've already dealt with merging if appropriate. |
1341 | * We've already dealt with merging if appropriate. |
1316 | * Generally, we want to put the new object on top. But if |
1342 | * Generally, we want to put the new object on top. But if |
1317 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1343 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1320 | * once we get to them. This reduces the need to traverse over all of |
1346 | * once we get to them. This reduces the need to traverse over all of |
1321 | * them when adding another one - this saves quite a bit of cpu time |
1347 | * them when adding another one - this saves quite a bit of cpu time |
1322 | * when lots of spells are cast in one area. Currently, it is presumed |
1348 | * when lots of spells are cast in one area. Currently, it is presumed |
1323 | * that flying non pickable objects are spell objects. |
1349 | * that flying non pickable objects are spell objects. |
1324 | */ |
1350 | */ |
1325 | for (top = ms.bot; top; top = top->above) |
1351 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1326 | { |
1352 | { |
1327 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1353 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1328 | floor = top; |
1354 | floor = tmp; |
1329 | |
1355 | |
1330 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1356 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1331 | { |
1357 | { |
1332 | /* We insert above top, so we want this object below this */ |
1358 | /* We insert above top, so we want this object below this */ |
1333 | top = top->below; |
1359 | top = tmp->below; |
1334 | break; |
1360 | break; |
1335 | } |
1361 | } |
1336 | |
1362 | |
1337 | last = top; |
1363 | top = tmp; |
1338 | } |
1364 | } |
1339 | |
|
|
1340 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1341 | top = last; |
|
|
1342 | |
1365 | |
1343 | /* We let update_position deal with figuring out what the space |
1366 | /* We let update_position deal with figuring out what the space |
1344 | * looks like instead of lots of conditions here. |
1367 | * looks like instead of lots of conditions here. |
1345 | * makes things faster, and effectively the same result. |
1368 | * makes things faster, and effectively the same result. |
1346 | */ |
1369 | */ |
… | |
… | |
1353 | */ |
1376 | */ |
1354 | if (!(flag & INS_ON_TOP) |
1377 | if (!(flag & INS_ON_TOP) |
1355 | && ms.flags () & P_BLOCKSVIEW |
1378 | && ms.flags () & P_BLOCKSVIEW |
1356 | && (op->face && !faces [op->face].visibility)) |
1379 | && (op->face && !faces [op->face].visibility)) |
1357 | { |
1380 | { |
|
|
1381 | object *last; |
|
|
1382 | |
1358 | for (last = top; last != floor; last = last->below) |
1383 | for (last = top; last != floor; last = last->below) |
1359 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1384 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1360 | break; |
1385 | break; |
1361 | |
1386 | |
1362 | /* Check to see if we found the object that blocks view, |
1387 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1370 | } /* If objects on this space */ |
1395 | } /* If objects on this space */ |
1371 | |
1396 | |
1372 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1397 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1373 | top = floor; |
1398 | top = floor; |
1374 | |
1399 | |
1375 | /* Top is the object that our object (op) is going to get inserted above. |
1400 | // insert object above top, or bottom-most if top = 0 |
1376 | */ |
|
|
1377 | |
|
|
1378 | /* First object on this space */ |
|
|
1379 | if (!top) |
1401 | if (!top) |
1380 | { |
1402 | { |
|
|
1403 | op->below = 0; |
1381 | op->above = ms.bot; |
1404 | op->above = ms.bot; |
1382 | |
|
|
1383 | if (op->above) |
|
|
1384 | op->above->below = op; |
|
|
1385 | |
|
|
1386 | op->below = 0; |
|
|
1387 | ms.bot = op; |
1405 | ms.bot = op; |
|
|
1406 | |
|
|
1407 | *(op->above ? &op->above->below : &ms.top) = op; |
1388 | } |
1408 | } |
1389 | else |
1409 | else |
1390 | { /* get inserted into the stack above top */ |
1410 | { |
1391 | op->above = top->above; |
1411 | op->above = top->above; |
1392 | |
|
|
1393 | if (op->above) |
|
|
1394 | op->above->below = op; |
1412 | top->above = op; |
1395 | |
1413 | |
1396 | op->below = top; |
1414 | op->below = top; |
1397 | top->above = op; |
1415 | *(op->above ? &op->above->below : &ms.top) = op; |
1398 | } |
1416 | } |
1399 | |
1417 | } |
1400 | if (!op->above) |
|
|
1401 | ms.top = op; |
|
|
1402 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1403 | |
1418 | |
1404 | if (op->type == PLAYER) |
1419 | if (op->type == PLAYER) |
1405 | { |
1420 | { |
1406 | op->contr->do_los = 1; |
1421 | op->contr->do_los = 1; |
1407 | ++op->map->players; |
1422 | ++op->map->players; |
… | |
… | |
1409 | } |
1424 | } |
1410 | |
1425 | |
1411 | op->map->dirty = true; |
1426 | op->map->dirty = true; |
1412 | |
1427 | |
1413 | if (object *pl = ms.player ()) |
1428 | if (object *pl = ms.player ()) |
|
|
1429 | //TODO: the floorbox prev/next might need updating |
|
|
1430 | //esrv_send_item (pl, op); |
|
|
1431 | //TODO: update floorbox to preserve ordering |
|
|
1432 | if (pl->contr->ns) |
1414 | pl->contr->ns->floorbox_update (); |
1433 | pl->contr->ns->floorbox_update (); |
1415 | |
1434 | |
1416 | /* If this object glows, it may affect lighting conditions that are |
1435 | /* If this object glows, it may affect lighting conditions that are |
1417 | * visible to others on this map. But update_all_los is really |
1436 | * visible to others on this map. But update_all_los is really |
1418 | * an inefficient way to do this, as it means los for all players |
1437 | * an inefficient way to do this, as it means los for all players |
1419 | * on the map will get recalculated. The players could very well |
1438 | * on the map will get recalculated. The players could very well |
… | |
… | |
1461 | * op is the object to insert it under: supplies x and the map. |
1480 | * op is the object to insert it under: supplies x and the map. |
1462 | */ |
1481 | */ |
1463 | void |
1482 | void |
1464 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1483 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1465 | { |
1484 | { |
1466 | object *tmp, *tmp1; |
|
|
1467 | |
|
|
1468 | /* first search for itself and remove any old instances */ |
1485 | /* first search for itself and remove any old instances */ |
1469 | |
1486 | |
1470 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1487 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1471 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1488 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1472 | tmp->destroy (); |
1489 | tmp->destroy (1); |
1473 | |
1490 | |
1474 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1491 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1475 | |
1492 | |
1476 | tmp1->x = op->x; |
1493 | tmp->x = op->x; |
1477 | tmp1->y = op->y; |
1494 | tmp->y = op->y; |
|
|
1495 | |
1478 | insert_ob_in_map (tmp1, op->map, op, 0); |
1496 | insert_ob_in_map (tmp, op->map, op, 0); |
1479 | } |
1497 | } |
1480 | |
1498 | |
1481 | object * |
1499 | object * |
1482 | object::insert_at (object *where, object *originator, int flags) |
1500 | object::insert_at (object *where, object *originator, int flags) |
1483 | { |
1501 | { |
… | |
… | |
1486 | else |
1504 | else |
1487 | return where->map->insert (this, where->x, where->y, originator, flags); |
1505 | return where->map->insert (this, where->x, where->y, originator, flags); |
1488 | } |
1506 | } |
1489 | |
1507 | |
1490 | /* |
1508 | /* |
1491 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1492 | * is returned contains nr objects, and the remaining parts contains |
|
|
1493 | * the rest (or is removed and freed if that number is 0). |
|
|
1494 | * On failure, NULL is returned, and the reason put into the |
|
|
1495 | * global static errmsg array. |
|
|
1496 | */ |
|
|
1497 | object * |
|
|
1498 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1499 | { |
|
|
1500 | object *newob; |
|
|
1501 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1502 | |
|
|
1503 | if (orig_ob->nrof < nr) |
|
|
1504 | { |
|
|
1505 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1506 | return NULL; |
|
|
1507 | } |
|
|
1508 | |
|
|
1509 | newob = object_create_clone (orig_ob); |
|
|
1510 | |
|
|
1511 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1512 | orig_ob->destroy (1); |
|
|
1513 | else if (!is_removed) |
|
|
1514 | { |
|
|
1515 | if (orig_ob->env != NULL) |
|
|
1516 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1517 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1518 | { |
|
|
1519 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1520 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1521 | return NULL; |
|
|
1522 | } |
|
|
1523 | } |
|
|
1524 | |
|
|
1525 | newob->nrof = nr; |
|
|
1526 | |
|
|
1527 | return newob; |
|
|
1528 | } |
|
|
1529 | |
|
|
1530 | /* |
|
|
1531 | * decrease_ob_nr(object, number) decreases a specified number from |
1509 | * decrease(object, number) decreases a specified number from |
1532 | * the amount of an object. If the amount reaches 0, the object |
1510 | * the amount of an object. If the amount reaches 0, the object |
1533 | * is subsequently removed and freed. |
1511 | * is subsequently removed and freed. |
1534 | * |
1512 | * |
1535 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1513 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1536 | */ |
1514 | */ |
|
|
1515 | bool |
|
|
1516 | object::decrease (sint32 nr) |
|
|
1517 | { |
|
|
1518 | if (!nr) |
|
|
1519 | return true; |
|
|
1520 | |
|
|
1521 | nr = min (nr, nrof); |
|
|
1522 | |
|
|
1523 | nrof -= nr; |
|
|
1524 | |
|
|
1525 | if (nrof) |
|
|
1526 | { |
|
|
1527 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1528 | |
|
|
1529 | if (object *pl = visible_to ()) |
|
|
1530 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1531 | |
|
|
1532 | return true; |
|
|
1533 | } |
|
|
1534 | else |
|
|
1535 | { |
|
|
1536 | destroy (1); |
|
|
1537 | return false; |
|
|
1538 | } |
|
|
1539 | } |
|
|
1540 | |
|
|
1541 | /* |
|
|
1542 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1543 | * is returned contains nr objects, and the remaining parts contains |
|
|
1544 | * the rest (or is removed and returned if that number is 0). |
|
|
1545 | * On failure, NULL is returned. |
|
|
1546 | */ |
1537 | object * |
1547 | object * |
1538 | decrease_ob_nr (object *op, uint32 i) |
1548 | object::split (sint32 nr) |
1539 | { |
1549 | { |
1540 | object *tmp; |
1550 | int have = number_of (); |
1541 | |
1551 | |
1542 | if (i == 0) /* objects with op->nrof require this check */ |
1552 | if (have < nr) |
1543 | return op; |
1553 | return 0; |
1544 | |
1554 | else if (have == nr) |
1545 | if (i > op->nrof) |
|
|
1546 | i = op->nrof; |
|
|
1547 | |
|
|
1548 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1549 | op->nrof -= i; |
|
|
1550 | else if (op->env) |
|
|
1551 | { |
1555 | { |
1552 | /* is this object in the players inventory, or sub container |
|
|
1553 | * therein? |
|
|
1554 | */ |
|
|
1555 | tmp = op->in_player (); |
|
|
1556 | /* nope. Is this a container the player has opened? |
|
|
1557 | * If so, set tmp to that player. |
|
|
1558 | * IMO, searching through all the players will mostly |
|
|
1559 | * likely be quicker than following op->env to the map, |
|
|
1560 | * and then searching the map for a player. |
|
|
1561 | */ |
|
|
1562 | if (!tmp) |
|
|
1563 | for_all_players (pl) |
|
|
1564 | if (pl->ob->container == op->env) |
|
|
1565 | { |
|
|
1566 | tmp = pl->ob; |
|
|
1567 | break; |
|
|
1568 | } |
|
|
1569 | |
|
|
1570 | if (i < op->nrof) |
|
|
1571 | { |
|
|
1572 | sub_weight (op->env, op->weight * i); |
|
|
1573 | op->nrof -= i; |
|
|
1574 | if (tmp) |
|
|
1575 | esrv_send_item (tmp, op); |
|
|
1576 | } |
|
|
1577 | else |
|
|
1578 | { |
|
|
1579 | op->remove (); |
1556 | remove (); |
1580 | op->nrof = 0; |
1557 | return this; |
1581 | if (tmp) |
|
|
1582 | esrv_del_item (tmp->contr, op->count); |
|
|
1583 | } |
|
|
1584 | } |
1558 | } |
1585 | else |
1559 | else |
1586 | { |
1560 | { |
1587 | object *above = op->above; |
1561 | decrease (nr); |
1588 | |
1562 | |
1589 | if (i < op->nrof) |
1563 | object *op = deep_clone (); |
1590 | op->nrof -= i; |
1564 | op->nrof = nr; |
1591 | else |
|
|
1592 | { |
|
|
1593 | op->remove (); |
|
|
1594 | op->nrof = 0; |
|
|
1595 | } |
|
|
1596 | |
|
|
1597 | /* Since we just removed op, op->above is null */ |
|
|
1598 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1599 | if (tmp->type == PLAYER) |
|
|
1600 | { |
|
|
1601 | if (op->nrof) |
|
|
1602 | esrv_send_item (tmp, op); |
|
|
1603 | else |
|
|
1604 | esrv_del_item (tmp->contr, op->count); |
|
|
1605 | } |
|
|
1606 | } |
|
|
1607 | |
|
|
1608 | if (op->nrof) |
|
|
1609 | return op; |
1565 | return op; |
1610 | else |
|
|
1611 | { |
|
|
1612 | op->destroy (); |
|
|
1613 | return 0; |
|
|
1614 | } |
|
|
1615 | } |
|
|
1616 | |
|
|
1617 | /* |
|
|
1618 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1619 | * and also updates how much the environment(s) is/are carrying. |
|
|
1620 | */ |
|
|
1621 | void |
|
|
1622 | add_weight (object *op, signed long weight) |
|
|
1623 | { |
|
|
1624 | while (op != NULL) |
|
|
1625 | { |
|
|
1626 | if (op->type == CONTAINER) |
|
|
1627 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1628 | |
|
|
1629 | op->carrying += weight; |
|
|
1630 | op = op->env; |
|
|
1631 | } |
1566 | } |
1632 | } |
1567 | } |
1633 | |
1568 | |
1634 | object * |
1569 | object * |
1635 | insert_ob_in_ob (object *op, object *where) |
1570 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1660 | * be != op, if items are merged. -Tero |
1595 | * be != op, if items are merged. -Tero |
1661 | */ |
1596 | */ |
1662 | object * |
1597 | object * |
1663 | object::insert (object *op) |
1598 | object::insert (object *op) |
1664 | { |
1599 | { |
1665 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1666 | op->remove (); |
|
|
1667 | |
|
|
1668 | if (op->more) |
1600 | if (op->more) |
1669 | { |
1601 | { |
1670 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1602 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1671 | return op; |
1603 | return op; |
1672 | } |
1604 | } |
1673 | |
1605 | |
1674 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1606 | op->remove (); |
1675 | CLEAR_FLAG (op, FLAG_REMOVED); |
1607 | |
|
|
1608 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1676 | |
1609 | |
1677 | if (op->nrof) |
1610 | if (op->nrof) |
1678 | { |
|
|
1679 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1611 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1680 | if (object::can_merge (tmp, op)) |
1612 | if (object::can_merge (tmp, op)) |
1681 | { |
1613 | { |
1682 | /* return the original object and remove inserted object |
1614 | /* return the original object and remove inserted object |
1683 | (client needs the original object) */ |
1615 | (client needs the original object) */ |
1684 | tmp->nrof += op->nrof; |
1616 | tmp->nrof += op->nrof; |
1685 | /* Weight handling gets pretty funky. Since we are adding to |
1617 | |
1686 | * tmp->nrof, we need to increase the weight. |
1618 | if (object *pl = tmp->visible_to ()) |
1687 | */ |
1619 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1620 | |
1688 | add_weight (this, op->weight * op->nrof); |
1621 | adjust_weight (this, op->total_weight ()); |
1689 | SET_FLAG (op, FLAG_REMOVED); |
1622 | |
1690 | op->destroy (); /* free the inserted object */ |
1623 | op->destroy (1); |
1691 | op = tmp; |
1624 | op = tmp; |
1692 | op->remove (); /* and fix old object's links */ |
1625 | goto inserted; |
1693 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1694 | break; |
|
|
1695 | } |
1626 | } |
1696 | |
1627 | |
1697 | /* I assume combined objects have no inventory |
|
|
1698 | * We add the weight - this object could have just been removed |
|
|
1699 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1700 | * the weight, so we need to add it in again, since we actually do |
|
|
1701 | * the linking below |
|
|
1702 | */ |
|
|
1703 | add_weight (this, op->weight * op->nrof); |
|
|
1704 | } |
|
|
1705 | else |
|
|
1706 | add_weight (this, (op->weight + op->carrying)); |
|
|
1707 | |
|
|
1708 | if (object *otmp = this->in_player ()) |
|
|
1709 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1710 | otmp->update_stats (); |
|
|
1711 | |
|
|
1712 | op->owner = 0; // its his/hers now. period. |
1628 | op->owner = 0; // it's his/hers now. period. |
1713 | op->map = 0; |
1629 | op->map = 0; |
|
|
1630 | op->x = 0; |
|
|
1631 | op->y = 0; |
|
|
1632 | |
|
|
1633 | op->above = 0; |
|
|
1634 | op->below = inv; |
1714 | op->env = this; |
1635 | op->env = this; |
1715 | op->above = 0; |
|
|
1716 | op->below = 0; |
|
|
1717 | op->x = op->y = 0; |
|
|
1718 | |
1636 | |
|
|
1637 | if (inv) |
|
|
1638 | inv->above = op; |
|
|
1639 | |
|
|
1640 | inv = op; |
|
|
1641 | |
|
|
1642 | op->flag [FLAG_REMOVED] = 0; |
|
|
1643 | |
|
|
1644 | if (object *pl = op->visible_to ()) |
|
|
1645 | esrv_send_item (pl, op); |
|
|
1646 | |
|
|
1647 | adjust_weight (this, op->total_weight ()); |
|
|
1648 | |
|
|
1649 | inserted: |
1719 | /* reset the light list and los of the players on the map */ |
1650 | /* reset the light list and los of the players on the map */ |
1720 | if (op->glow_radius && map) |
1651 | if (op->glow_radius && map && map->darkness) |
1721 | { |
|
|
1722 | #ifdef DEBUG_LIGHTS |
|
|
1723 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1724 | #endif /* DEBUG_LIGHTS */ |
|
|
1725 | if (map->darkness) |
|
|
1726 | update_all_los (map, x, y); |
1652 | update_all_los (map, x, y); |
1727 | } |
|
|
1728 | |
1653 | |
1729 | /* Client has no idea of ordering so lets not bother ordering it here. |
1654 | // if this is a player's inventory, update stats |
1730 | * It sure simplifies this function... |
1655 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1731 | */ |
1656 | update_stats (); |
1732 | if (!inv) |
|
|
1733 | inv = op; |
|
|
1734 | else |
|
|
1735 | { |
|
|
1736 | op->below = inv; |
|
|
1737 | op->below->above = op; |
|
|
1738 | inv = op; |
|
|
1739 | } |
|
|
1740 | |
1657 | |
1741 | INVOKE_OBJECT (INSERT, this); |
1658 | INVOKE_OBJECT (INSERT, this); |
1742 | |
1659 | |
1743 | return op; |
1660 | return op; |
1744 | } |
1661 | } |
… | |
… | |
1872 | LOG (llevError, "Present_arch called outside map.\n"); |
1789 | LOG (llevError, "Present_arch called outside map.\n"); |
1873 | return NULL; |
1790 | return NULL; |
1874 | } |
1791 | } |
1875 | |
1792 | |
1876 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1793 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1877 | if (tmp->arch == at) |
1794 | if (tmp->arch->archname == at->archname) |
1878 | return tmp; |
1795 | return tmp; |
1879 | |
1796 | |
1880 | return NULL; |
1797 | return NULL; |
1881 | } |
1798 | } |
1882 | |
1799 | |
… | |
… | |
1946 | * The first matching object is returned, or NULL if none. |
1863 | * The first matching object is returned, or NULL if none. |
1947 | */ |
1864 | */ |
1948 | object * |
1865 | object * |
1949 | present_arch_in_ob (const archetype *at, const object *op) |
1866 | present_arch_in_ob (const archetype *at, const object *op) |
1950 | { |
1867 | { |
1951 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1868 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1952 | if (tmp->arch == at) |
1869 | if (tmp->arch->archname == at->archname) |
1953 | return tmp; |
1870 | return tmp; |
1954 | |
1871 | |
1955 | return NULL; |
1872 | return NULL; |
1956 | } |
1873 | } |
1957 | |
1874 | |
… | |
… | |
2366 | |
2283 | |
2367 | /* |
2284 | /* |
2368 | * create clone from object to another |
2285 | * create clone from object to another |
2369 | */ |
2286 | */ |
2370 | object * |
2287 | object * |
2371 | object_create_clone (object *asrc) |
2288 | object::deep_clone () |
2372 | { |
2289 | { |
2373 | object *dst = 0, *tmp, *src, *prev, *item; |
2290 | assert (("deep_clone called on non-head object", is_head ())); |
2374 | |
2291 | |
2375 | if (!asrc) |
2292 | object *dst = clone (); |
2376 | return 0; |
|
|
2377 | |
2293 | |
2378 | src = asrc->head_ (); |
2294 | object *prev = dst; |
2379 | |
|
|
2380 | prev = 0; |
|
|
2381 | for (object *part = src; part; part = part->more) |
2295 | for (object *part = this->more; part; part = part->more) |
2382 | { |
2296 | { |
2383 | tmp = part->clone (); |
2297 | object *tmp = part->clone (); |
2384 | tmp->x -= src->x; |
|
|
2385 | tmp->y -= src->y; |
|
|
2386 | |
|
|
2387 | if (!part->head) |
|
|
2388 | { |
|
|
2389 | dst = tmp; |
|
|
2390 | tmp->head = 0; |
|
|
2391 | } |
|
|
2392 | else |
|
|
2393 | tmp->head = dst; |
2298 | tmp->head = dst; |
2394 | |
|
|
2395 | tmp->more = 0; |
|
|
2396 | |
|
|
2397 | if (prev) |
|
|
2398 | prev->more = tmp; |
2299 | prev->more = tmp; |
2399 | |
|
|
2400 | prev = tmp; |
2300 | prev = tmp; |
2401 | } |
2301 | } |
2402 | |
2302 | |
2403 | for (item = src->inv; item; item = item->below) |
2303 | for (object *item = inv; item; item = item->below) |
2404 | insert_ob_in_ob (object_create_clone (item), dst); |
2304 | insert_ob_in_ob (item->deep_clone (), dst); |
2405 | |
2305 | |
2406 | return dst; |
2306 | return dst; |
2407 | } |
2307 | } |
2408 | |
2308 | |
2409 | /* This returns the first object in who's inventory that |
2309 | /* This returns the first object in who's inventory that |
… | |
… | |
2418 | return tmp; |
2318 | return tmp; |
2419 | |
2319 | |
2420 | return 0; |
2320 | return 0; |
2421 | } |
2321 | } |
2422 | |
2322 | |
2423 | /* If ob has a field named key, return the link from the list, |
2323 | const shstr & |
2424 | * otherwise return NULL. |
2324 | object::kv_get (const shstr &key) const |
2425 | * |
|
|
2426 | * key must be a passed in shared string - otherwise, this won't |
|
|
2427 | * do the desired thing. |
|
|
2428 | */ |
|
|
2429 | key_value * |
|
|
2430 | get_ob_key_link (const object *ob, const char *key) |
|
|
2431 | { |
2325 | { |
2432 | for (key_value *link = ob->key_values; link; link = link->next) |
2326 | for (key_value *kv = key_values; kv; kv = kv->next) |
2433 | if (link->key == key) |
2327 | if (kv->key == key) |
2434 | return link; |
|
|
2435 | |
|
|
2436 | return 0; |
|
|
2437 | } |
|
|
2438 | |
|
|
2439 | /* |
|
|
2440 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2441 | * |
|
|
2442 | * The argument doesn't need to be a shared string. |
|
|
2443 | * |
|
|
2444 | * The returned string is shared. |
|
|
2445 | */ |
|
|
2446 | const char * |
|
|
2447 | get_ob_key_value (const object *op, const char *const key) |
|
|
2448 | { |
|
|
2449 | key_value *link; |
|
|
2450 | shstr_cmp canonical_key (key); |
|
|
2451 | |
|
|
2452 | if (!canonical_key) |
|
|
2453 | { |
|
|
2454 | /* 1. There being a field named key on any object |
|
|
2455 | * implies there'd be a shared string to find. |
|
|
2456 | * 2. Since there isn't, no object has this field. |
|
|
2457 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2458 | */ |
|
|
2459 | return 0; |
|
|
2460 | } |
|
|
2461 | |
|
|
2462 | /* This is copied from get_ob_key_link() above - |
|
|
2463 | * only 4 lines, and saves the function call overhead. |
|
|
2464 | */ |
|
|
2465 | for (link = op->key_values; link; link = link->next) |
|
|
2466 | if (link->key == canonical_key) |
|
|
2467 | return link->value; |
2328 | return kv->value; |
2468 | |
2329 | |
2469 | return 0; |
2330 | return shstr_null; |
2470 | } |
2331 | } |
2471 | |
2332 | |
2472 | /* |
2333 | void |
2473 | * Updates the canonical_key in op to value. |
2334 | object::kv_set (const shstr &key, const shstr &value) |
2474 | * |
|
|
2475 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2476 | * |
|
|
2477 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2478 | * keys. |
|
|
2479 | * |
|
|
2480 | * Returns TRUE on success. |
|
|
2481 | */ |
|
|
2482 | int |
|
|
2483 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2484 | { |
2335 | { |
2485 | key_value *field = NULL, *last = NULL; |
2336 | for (key_value *kv = key_values; kv; kv = kv->next) |
2486 | |
2337 | if (kv->key == key) |
2487 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2488 | { |
|
|
2489 | if (field->key != canonical_key) |
|
|
2490 | { |
2338 | { |
2491 | last = field; |
2339 | kv->value = value; |
2492 | continue; |
2340 | return; |
2493 | } |
2341 | } |
2494 | |
2342 | |
2495 | if (value) |
2343 | key_value *kv = new key_value; |
2496 | field->value = value; |
2344 | |
2497 | else |
2345 | kv->next = key_values; |
|
|
2346 | kv->key = key; |
|
|
2347 | kv->value = value; |
|
|
2348 | |
|
|
2349 | key_values = kv; |
|
|
2350 | } |
|
|
2351 | |
|
|
2352 | void |
|
|
2353 | object::kv_del (const shstr &key) |
|
|
2354 | { |
|
|
2355 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2356 | if ((*kvp)->key == key) |
2498 | { |
2357 | { |
2499 | /* Basically, if the archetype has this key set, |
2358 | key_value *kv = *kvp; |
2500 | * we need to store the null value so when we save |
2359 | *kvp = (*kvp)->next; |
2501 | * it, we save the empty value so that when we load, |
2360 | delete kv; |
2502 | * we get this value back again. |
2361 | return; |
2503 | */ |
|
|
2504 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2505 | field->value = 0; |
|
|
2506 | else |
|
|
2507 | { |
|
|
2508 | if (last) |
|
|
2509 | last->next = field->next; |
|
|
2510 | else |
|
|
2511 | op->key_values = field->next; |
|
|
2512 | |
|
|
2513 | delete field; |
|
|
2514 | } |
|
|
2515 | } |
2362 | } |
2516 | return TRUE; |
|
|
2517 | } |
|
|
2518 | /* IF we get here, key doesn't exist */ |
|
|
2519 | |
|
|
2520 | /* No field, we'll have to add it. */ |
|
|
2521 | |
|
|
2522 | if (!add_key) |
|
|
2523 | return FALSE; |
|
|
2524 | |
|
|
2525 | /* There isn't any good reason to store a null |
|
|
2526 | * value in the key/value list. If the archetype has |
|
|
2527 | * this key, then we should also have it, so shouldn't |
|
|
2528 | * be here. If user wants to store empty strings, |
|
|
2529 | * should pass in "" |
|
|
2530 | */ |
|
|
2531 | if (value == NULL) |
|
|
2532 | return TRUE; |
|
|
2533 | |
|
|
2534 | field = new key_value; |
|
|
2535 | |
|
|
2536 | field->key = canonical_key; |
|
|
2537 | field->value = value; |
|
|
2538 | /* Usual prepend-addition. */ |
|
|
2539 | field->next = op->key_values; |
|
|
2540 | op->key_values = field; |
|
|
2541 | |
|
|
2542 | return TRUE; |
|
|
2543 | } |
|
|
2544 | |
|
|
2545 | /* |
|
|
2546 | * Updates the key in op to value. |
|
|
2547 | * |
|
|
2548 | * If add_key is FALSE, this will only update existing keys, |
|
|
2549 | * and not add new ones. |
|
|
2550 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2551 | * |
|
|
2552 | * Returns TRUE on success. |
|
|
2553 | */ |
|
|
2554 | int |
|
|
2555 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2556 | { |
|
|
2557 | shstr key_ (key); |
|
|
2558 | |
|
|
2559 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2560 | } |
2363 | } |
2561 | |
2364 | |
2562 | object::depth_iterator::depth_iterator (object *container) |
2365 | object::depth_iterator::depth_iterator (object *container) |
2563 | : iterator_base (container) |
2366 | : iterator_base (container) |
2564 | { |
2367 | { |
… | |
… | |
2614 | { |
2417 | { |
2615 | char flagdesc[512]; |
2418 | char flagdesc[512]; |
2616 | char info2[256 * 4]; |
2419 | char info2[256 * 4]; |
2617 | char *p = info; |
2420 | char *p = info; |
2618 | |
2421 | |
2619 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2422 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}", |
2620 | count, |
2423 | count, |
2621 | uuid.c_str (), |
2424 | uuid.c_str (), |
2622 | &name, |
2425 | &name, |
2623 | title ? "\",title:\"" : "", |
2426 | title ? ",title:\"" : "", |
2624 | title ? (const char *)title : "", |
2427 | title ? (const char *)title : "", |
|
|
2428 | title ? "\"" : "", |
2625 | flag_desc (flagdesc, 512), type); |
2429 | flag_desc (flagdesc, 512), type); |
2626 | |
2430 | |
2627 | if (!this->flag[FLAG_REMOVED] && env) |
2431 | if (!flag[FLAG_REMOVED] && env) |
2628 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2432 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2629 | |
2433 | |
2630 | if (map) |
2434 | if (map) |
2631 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2435 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2632 | |
2436 | |
… | |
… | |
2662 | object::open_container (object *new_container) |
2466 | object::open_container (object *new_container) |
2663 | { |
2467 | { |
2664 | if (container == new_container) |
2468 | if (container == new_container) |
2665 | return; |
2469 | return; |
2666 | |
2470 | |
2667 | if (object *old_container = container) |
2471 | object *old_container = container; |
|
|
2472 | |
|
|
2473 | if (old_container) |
2668 | { |
2474 | { |
2669 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2475 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2670 | return; |
2476 | return; |
2671 | |
2477 | |
2672 | #if 0 |
2478 | #if 0 |
… | |
… | |
2674 | if (object *closer = old_container->inv) |
2480 | if (object *closer = old_container->inv) |
2675 | if (closer->type == CLOSE_CON) |
2481 | if (closer->type == CLOSE_CON) |
2676 | closer->destroy (); |
2482 | closer->destroy (); |
2677 | #endif |
2483 | #endif |
2678 | |
2484 | |
|
|
2485 | // make sure the container is available |
|
|
2486 | esrv_send_item (this, old_container); |
|
|
2487 | |
2679 | old_container->flag [FLAG_APPLIED] = 0; |
2488 | old_container->flag [FLAG_APPLIED] = false; |
2680 | container = 0; |
2489 | container = 0; |
2681 | |
2490 | |
|
|
2491 | // client needs item update to make it work, client bug requires this to be separate |
2682 | esrv_update_item (UPD_FLAGS, this, old_container); |
2492 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2493 | |
2683 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2494 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2684 | play_sound (sound_find ("chest_close")); |
2495 | play_sound (sound_find ("chest_close")); |
2685 | } |
2496 | } |
2686 | |
2497 | |
2687 | if (new_container) |
2498 | if (new_container) |
… | |
… | |
2700 | } |
2511 | } |
2701 | #endif |
2512 | #endif |
2702 | |
2513 | |
2703 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2514 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2704 | |
2515 | |
|
|
2516 | // make sure the container is available, client bug requires this to be separate |
|
|
2517 | esrv_send_item (this, new_container); |
|
|
2518 | |
2705 | new_container->flag [FLAG_APPLIED] = 1; |
2519 | new_container->flag [FLAG_APPLIED] = true; |
2706 | container = new_container; |
2520 | container = new_container; |
2707 | |
2521 | |
|
|
2522 | // client needs flag change |
2708 | esrv_update_item (UPD_FLAGS, this, new_container); |
2523 | esrv_update_item (UPD_FLAGS, this, new_container); |
2709 | esrv_send_inventory (this, new_container); |
2524 | esrv_send_inventory (this, new_container); |
2710 | play_sound (sound_find ("chest_open")); |
2525 | play_sound (sound_find ("chest_open")); |
2711 | } |
2526 | } |
|
|
2527 | // else if (!old_container->env && contr && contr->ns) |
|
|
2528 | // contr->ns->floorbox_reset (); |
2712 | } |
2529 | } |
2713 | |
2530 | |
2714 | object * |
2531 | object * |
2715 | object::force_find (const shstr name) |
2532 | object::force_find (const shstr name) |
2716 | { |
2533 | { |
… | |
… | |
2742 | |
2559 | |
2743 | insert (force); |
2560 | insert (force); |
2744 | } |
2561 | } |
2745 | |
2562 | |
2746 | void |
2563 | void |
2747 | object::play_sound (faceidx sound) const |
2564 | object::play_sound (faceidx sound) |
2748 | { |
2565 | { |
2749 | if (!sound) |
2566 | if (!sound) |
2750 | return; |
2567 | return; |
2751 | |
2568 | |
2752 | if (flag [FLAG_REMOVED]) |
2569 | if (flag [FLAG_REMOVED]) |