1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
27 | variable. */ |
27 | #include <global.h> |
28 | #include <global.h> |
… | |
… | |
30 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
31 | #include <object.h> |
32 | #include <object.h> |
32 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
33 | #include <loader.h> |
34 | #include <loader.h> |
34 | |
35 | |
|
|
36 | #include <bitset> |
|
|
37 | |
35 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
36 | static UUID uuid; |
39 | static UUID uuid; |
37 | const uint64 UUID_SKIP = 1<<19; |
40 | const uint64 UUID_SKIP = 1<<19; |
38 | |
41 | |
39 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
43 | activevec actives; |
40 | |
44 | |
41 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
42 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
43 | }; |
47 | }; |
44 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
… | |
… | |
104 | _exit (1); |
108 | _exit (1); |
105 | } |
109 | } |
106 | |
110 | |
107 | uuid.seq = uid; |
111 | uuid.seq = uid; |
108 | write_uuid (); |
112 | write_uuid (); |
109 | LOG (llevDebug, "read UID: %lld\n", uid); |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
110 | fclose (fp); |
114 | fclose (fp); |
111 | } |
115 | } |
112 | |
116 | |
113 | UUID |
117 | UUID |
114 | gen_uuid () |
118 | gen_uuid () |
… | |
… | |
139 | * objects with lists are rare, and lists stay short. If not, use a |
143 | * objects with lists are rare, and lists stay short. If not, use a |
140 | * different structure or at least keep the lists sorted... |
144 | * different structure or at least keep the lists sorted... |
141 | */ |
145 | */ |
142 | |
146 | |
143 | /* For each field in wants, */ |
147 | /* For each field in wants, */ |
144 | for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) |
148 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
145 | { |
149 | { |
146 | key_value *has_field; |
150 | key_value *has_field; |
147 | |
151 | |
148 | /* Look for a field in has with the same key. */ |
152 | /* Look for a field in has with the same key. */ |
149 | has_field = get_ob_key_link (has, wants_field->key); |
153 | has_field = get_ob_key_link (has, wants_field->key); |
… | |
… | |
183 | * |
187 | * |
184 | * Note that this function appears a lot longer than the macro it |
188 | * Note that this function appears a lot longer than the macro it |
185 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
189 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
186 | * reduce this to the same efficiency. |
190 | * reduce this to the same efficiency. |
187 | * |
191 | * |
188 | * Check nrof variable *before* calling CAN_MERGE() |
192 | * Check nrof variable *before* calling can_merge() |
189 | * |
193 | * |
190 | * Improvements made with merge: Better checking on potion, and also |
194 | * Improvements made with merge: Better checking on potion, and also |
191 | * check weight |
195 | * check weight |
192 | */ |
196 | */ |
193 | |
|
|
194 | bool object::can_merge (object *ob1, object *ob2) |
197 | bool object::can_merge_slow (object *ob1, object *ob2) |
195 | { |
198 | { |
196 | /* A couple quicksanity checks */ |
199 | /* A couple quicksanity checks */ |
197 | if ((ob1 == ob2) || (ob1->type != ob2->type)) |
200 | if (ob1 == ob2 |
|
|
201 | || ob1->type != ob2->type |
|
|
202 | || ob1->speed != ob2->speed |
|
|
203 | || ob1->value != ob2->value |
|
|
204 | || ob1->name != ob2->name) |
198 | return 0; |
205 | return 0; |
199 | |
206 | |
200 | if (ob1->speed != ob2->speed) |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
201 | return 0; |
|
|
202 | |
|
|
203 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
208 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
204 | * value could not be stored in a sint32 (which unfortunately sometimes is |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
205 | * used to store nrof). |
210 | * used to store nrof). |
206 | */ |
211 | */ |
207 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
… | |
… | |
217 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
218 | |
223 | |
219 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
220 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
221 | |
226 | |
222 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
223 | /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something |
228 | || ob1->arch != ob2->arch |
224 | * being locked in inventory should prevent merging. |
|
|
225 | * 0x4 in flags3 is CLIENT_SENT |
|
|
226 | */ |
|
|
227 | if ((ob1->arch != ob2->arch) || |
|
|
228 | (ob1->flags[0] != ob2->flags[0]) || |
|
|
229 | (ob1->flags[1] != ob2->flags[1]) || |
|
|
230 | ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) || |
|
|
231 | ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) || |
|
|
232 | (ob1->name != ob2->name) || |
229 | || ob1->name != ob2->name |
233 | (ob1->title != ob2->title) || |
230 | || ob1->title != ob2->title |
234 | (ob1->msg != ob2->msg) || |
231 | || ob1->msg != ob2->msg |
235 | (ob1->weight != ob2->weight) || |
232 | || ob1->weight != ob2->weight |
236 | (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || |
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
237 | (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || |
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
238 | (ob1->attacktype != ob2->attacktype) || |
235 | || ob1->attacktype != ob2->attacktype |
239 | (ob1->magic != ob2->magic) || |
236 | || ob1->magic != ob2->magic |
240 | (ob1->slaying != ob2->slaying) || |
237 | || ob1->slaying != ob2->slaying |
241 | (ob1->skill != ob2->skill) || |
238 | || ob1->skill != ob2->skill |
242 | (ob1->value != ob2->value) || |
239 | || ob1->value != ob2->value |
243 | (ob1->animation_id != ob2->animation_id) || |
240 | || ob1->animation_id != ob2->animation_id |
244 | (ob1->client_type != ob2->client_type) || |
241 | || ob1->client_type != ob2->client_type |
245 | (ob1->materialname != ob2->materialname) || |
242 | || ob1->materialname != ob2->materialname |
246 | (ob1->lore != ob2->lore) || |
243 | || ob1->lore != ob2->lore |
247 | (ob1->subtype != ob2->subtype) || |
244 | || ob1->subtype != ob2->subtype |
248 | (ob1->move_type != ob2->move_type) || |
245 | || ob1->move_type != ob2->move_type |
249 | (ob1->move_block != ob2->move_block) || |
246 | || ob1->move_block != ob2->move_block |
250 | (ob1->move_allow != ob2->move_allow) || |
247 | || ob1->move_allow != ob2->move_allow |
251 | (ob1->move_on != ob2->move_on) || |
248 | || ob1->move_on != ob2->move_on |
252 | (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) |
249 | || ob1->move_off != ob2->move_off |
|
|
250 | || ob1->move_slow != ob2->move_slow |
|
|
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
253 | return 0; |
252 | return 0; |
254 | |
253 | |
255 | /* This is really a spellbook check - really, we should |
254 | /* This is really a spellbook check - really, we should |
256 | * check all objects in the inventory. |
255 | * check all objects in the inventory. |
257 | */ |
256 | */ |
… | |
… | |
260 | /* if one object has inventory but the other doesn't, not equiv */ |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
261 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
262 | return 0; |
261 | return 0; |
263 | |
262 | |
264 | /* Now check to see if the two inventory objects could merge */ |
263 | /* Now check to see if the two inventory objects could merge */ |
265 | if (!CAN_MERGE (ob1->inv, ob2->inv)) |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; |
265 | return 0; |
267 | |
266 | |
268 | /* inventory ok - still need to check rest of this object to see |
267 | /* inventory ok - still need to check rest of this object to see |
269 | * if it is valid. |
268 | * if it is valid. |
270 | */ |
269 | */ |
… | |
… | |
279 | |
278 | |
280 | /* Note sure why the following is the case - either the object has to |
279 | /* Note sure why the following is the case - either the object has to |
281 | * be animated or have a very low speed. Is this an attempted monster |
280 | * be animated or have a very low speed. Is this an attempted monster |
282 | * check? |
281 | * check? |
283 | */ |
282 | */ |
284 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
283 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
285 | return 0; |
284 | return 0; |
286 | |
285 | |
287 | switch (ob1->type) |
286 | switch (ob1->type) |
288 | { |
287 | { |
289 | case SCROLL: |
288 | case SCROLL: |
… | |
… | |
314 | |
313 | |
315 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
316 | return 1; |
315 | return 1; |
317 | } |
316 | } |
318 | |
317 | |
|
|
318 | void |
|
|
319 | player::set_range (rangetype r) |
|
|
320 | { |
|
|
321 | shoottype = r; |
|
|
322 | } |
|
|
323 | |
319 | /* |
324 | /* |
320 | * sum_weight() is a recursive function which calculates the weight |
325 | * sum_weight() is a recursive function which calculates the weight |
321 | * an object is carrying. It goes through in figures out how much |
326 | * an object is carrying. It goes through in figures out how much |
322 | * containers are carrying, and sums it up. |
327 | * containers are carrying, and sums it up. |
323 | */ |
328 | */ |
… | |
… | |
354 | op = op->env; |
359 | op = op->env; |
355 | return op; |
360 | return op; |
356 | } |
361 | } |
357 | |
362 | |
358 | /* |
363 | /* |
359 | * Eneq(@csd.uu.se): Since we can have items buried in a character we need |
|
|
360 | * a better check. We basically keeping traversing up until we can't |
|
|
361 | * or find a player. |
|
|
362 | */ |
|
|
363 | |
|
|
364 | object * |
|
|
365 | is_player_inv (object *op) |
|
|
366 | { |
|
|
367 | for (; op != NULL && op->type != PLAYER; op = op->env) |
|
|
368 | if (op->env == op) |
|
|
369 | op->env = NULL; |
|
|
370 | return op; |
|
|
371 | } |
|
|
372 | |
|
|
373 | /* |
|
|
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
364 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
375 | * Some error messages. |
365 | * Some error messages. |
376 | * The result of the dump is stored in the static global errmsg array. |
366 | * The result of the dump is stored in the static global errmsg array. |
377 | */ |
367 | */ |
378 | |
|
|
379 | char * |
368 | char * |
380 | dump_object (object *op) |
369 | dump_object (object *op) |
381 | { |
370 | { |
382 | if (!op) |
371 | if (!op) |
383 | return strdup ("[NULLOBJ]"); |
372 | return strdup ("[NULLOBJ]"); |
384 | |
373 | |
385 | object_freezer freezer; |
374 | object_freezer freezer; |
386 | save_object (freezer, op, 3); |
375 | op->write (freezer); |
387 | return freezer.as_string (); |
376 | return freezer.as_string (); |
388 | } |
377 | } |
389 | |
378 | |
390 | /* |
379 | /* |
391 | * get_nearest_part(multi-object, object 2) returns the part of the |
380 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
408 | } |
397 | } |
409 | |
398 | |
410 | /* |
399 | /* |
411 | * Returns the object which has the count-variable equal to the argument. |
400 | * Returns the object which has the count-variable equal to the argument. |
412 | */ |
401 | */ |
413 | |
|
|
414 | object * |
402 | object * |
415 | find_object (tag_t i) |
403 | find_object (tag_t i) |
416 | { |
404 | { |
417 | object *op; |
405 | for_all_objects (op) |
418 | |
|
|
419 | for (op = object::first; op != NULL; op = op->next) |
|
|
420 | if (op->count == i) |
406 | if (op->count == i) |
421 | break; |
|
|
422 | |
|
|
423 | return op; |
407 | return op; |
|
|
408 | |
|
|
409 | return 0; |
424 | } |
410 | } |
425 | |
411 | |
426 | /* |
412 | /* |
427 | * Returns the first object which has a name equal to the argument. |
413 | * Returns the first object which has a name equal to the argument. |
428 | * Used only by the patch command, but not all that useful. |
414 | * Used only by the patch command, but not all that useful. |
429 | * Enables features like "patch <name-of-other-player> food 999" |
415 | * Enables features like "patch <name-of-other-player> food 999" |
430 | */ |
416 | */ |
431 | |
|
|
432 | object * |
417 | object * |
433 | find_object_name (const char *str) |
418 | find_object_name (const char *str) |
434 | { |
419 | { |
435 | shstr_cmp str_ (str); |
420 | shstr_cmp str_ (str); |
436 | object *op; |
421 | object *op; |
437 | |
422 | |
438 | for (op = object::first; op != NULL; op = op->next) |
423 | for_all_objects (op) |
439 | if (op->name == str_) |
424 | if (op->name == str_) |
440 | break; |
425 | break; |
441 | |
426 | |
442 | return op; |
427 | return op; |
443 | } |
428 | } |
… | |
… | |
475 | * refcounts and freeing the links. |
460 | * refcounts and freeing the links. |
476 | */ |
461 | */ |
477 | static void |
462 | static void |
478 | free_key_values (object *op) |
463 | free_key_values (object *op) |
479 | { |
464 | { |
480 | for (key_value *i = op->key_values; i != 0;) |
465 | for (key_value *i = op->key_values; i; ) |
481 | { |
466 | { |
482 | key_value *next = i->next; |
467 | key_value *next = i->next; |
483 | delete i; |
468 | delete i; |
484 | |
469 | |
485 | i = next; |
470 | i = next; |
486 | } |
471 | } |
487 | |
472 | |
488 | op->key_values = 0; |
473 | op->key_values = 0; |
489 | } |
474 | } |
490 | |
475 | |
491 | void object::clear () |
476 | object & |
|
|
477 | object::operator =(const object &src) |
492 | { |
478 | { |
493 | attachable_base::clear (); |
479 | bool is_freed = flag [FLAG_FREED]; |
|
|
480 | bool is_removed = flag [FLAG_REMOVED]; |
494 | |
481 | |
495 | free_key_values (this); |
482 | *(object_copy *)this = src; |
496 | |
483 | |
497 | owner = 0; |
484 | flag [FLAG_FREED] = is_freed; |
498 | name = 0; |
485 | flag [FLAG_REMOVED] = is_removed; |
499 | name_pl = 0; |
|
|
500 | title = 0; |
|
|
501 | race = 0; |
|
|
502 | slaying = 0; |
|
|
503 | skill = 0; |
|
|
504 | msg = 0; |
|
|
505 | lore = 0; |
|
|
506 | custom_name = 0; |
|
|
507 | materialname = 0; |
|
|
508 | contr = 0; |
|
|
509 | below = 0; |
|
|
510 | above = 0; |
|
|
511 | inv = 0; |
|
|
512 | container = 0; |
|
|
513 | env = 0; |
|
|
514 | more = 0; |
|
|
515 | head = 0; |
|
|
516 | map = 0; |
|
|
517 | active_next = 0; |
|
|
518 | active_prev = 0; |
|
|
519 | |
|
|
520 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
|
|
521 | |
|
|
522 | SET_FLAG (this, FLAG_REMOVED); |
|
|
523 | |
|
|
524 | /* What is not cleared is next, prev, and count */ |
|
|
525 | |
|
|
526 | expmul = 1.0; |
|
|
527 | face = blank_face; |
|
|
528 | |
|
|
529 | if (settings.casting_time) |
|
|
530 | casting_time = -1; |
|
|
531 | } |
|
|
532 | |
|
|
533 | void object::clone (object *destination) |
|
|
534 | { |
|
|
535 | *(object_copy *)destination = *this; |
|
|
536 | *(object_pod *)destination = *this; |
|
|
537 | |
|
|
538 | if (self || cb) |
|
|
539 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
540 | } |
|
|
541 | |
|
|
542 | /* |
|
|
543 | * copy object first frees everything allocated by the second object, |
|
|
544 | * and then copies the contends of the first object into the second |
|
|
545 | * object, allocating what needs to be allocated. Basically, any |
|
|
546 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
547 | * if the first object is freed, the pointers in the new object |
|
|
548 | * will point at garbage. |
|
|
549 | */ |
|
|
550 | void |
|
|
551 | copy_object (object *op2, object *op) |
|
|
552 | { |
|
|
553 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
|
|
554 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
|
|
555 | |
|
|
556 | op2->clone (op); |
|
|
557 | |
|
|
558 | if (is_freed) |
|
|
559 | SET_FLAG (op, FLAG_FREED); |
|
|
560 | if (is_removed) |
|
|
561 | SET_FLAG (op, FLAG_REMOVED); |
|
|
562 | |
|
|
563 | if (op2->speed < 0) |
|
|
564 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
|
|
565 | |
486 | |
566 | /* Copy over key_values, if any. */ |
487 | /* Copy over key_values, if any. */ |
567 | if (op2->key_values) |
488 | if (src.key_values) |
568 | { |
489 | { |
569 | key_value *tail = 0; |
490 | key_value *tail = 0; |
570 | key_value *i; |
|
|
571 | |
|
|
572 | op->key_values = 0; |
491 | key_values = 0; |
573 | |
492 | |
574 | for (i = op2->key_values; i; i = i->next) |
493 | for (key_value *i = src.key_values; i; i = i->next) |
575 | { |
494 | { |
576 | key_value *new_link = new key_value; |
495 | key_value *new_link = new key_value; |
577 | |
496 | |
578 | new_link->next = 0; |
497 | new_link->next = 0; |
579 | new_link->key = i->key; |
498 | new_link->key = i->key; |
580 | new_link->value = i->value; |
499 | new_link->value = i->value; |
581 | |
500 | |
582 | /* Try and be clever here, too. */ |
501 | /* Try and be clever here, too. */ |
583 | if (!op->key_values) |
502 | if (!key_values) |
584 | { |
503 | { |
585 | op->key_values = new_link; |
504 | key_values = new_link; |
586 | tail = new_link; |
505 | tail = new_link; |
587 | } |
506 | } |
588 | else |
507 | else |
589 | { |
508 | { |
590 | tail->next = new_link; |
509 | tail->next = new_link; |
591 | tail = new_link; |
510 | tail = new_link; |
592 | } |
511 | } |
593 | } |
512 | } |
594 | } |
513 | } |
|
|
514 | } |
595 | |
515 | |
596 | update_ob_speed (op); |
516 | /* |
|
|
517 | * copy_to first frees everything allocated by the dst object, |
|
|
518 | * and then copies the contents of itself into the second |
|
|
519 | * object, allocating what needs to be allocated. Basically, any |
|
|
520 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
521 | * if the first object is freed, the pointers in the new object |
|
|
522 | * will point at garbage. |
|
|
523 | */ |
|
|
524 | void |
|
|
525 | object::copy_to (object *dst) |
|
|
526 | { |
|
|
527 | *dst = *this; |
|
|
528 | |
|
|
529 | if (speed < 0) |
|
|
530 | dst->speed_left = speed_left - rndm (); |
|
|
531 | |
|
|
532 | dst->set_speed (dst->speed); |
|
|
533 | } |
|
|
534 | |
|
|
535 | void |
|
|
536 | object::instantiate () |
|
|
537 | { |
|
|
538 | if (!uuid.seq) // HACK |
|
|
539 | uuid = gen_uuid (); |
|
|
540 | |
|
|
541 | speed_left = -0.1f; |
|
|
542 | /* copy the body_info to the body_used - this is only really |
|
|
543 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
544 | * by doing so, when a monster is created, it has good starting |
|
|
545 | * values for the body_used info, so when items are created |
|
|
546 | * for it, they can be properly equipped. |
|
|
547 | */ |
|
|
548 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
549 | |
|
|
550 | attachable::instantiate (); |
|
|
551 | } |
|
|
552 | |
|
|
553 | object * |
|
|
554 | object::clone () |
|
|
555 | { |
|
|
556 | object *neu = create (); |
|
|
557 | copy_to (neu); |
|
|
558 | return neu; |
597 | } |
559 | } |
598 | |
560 | |
599 | /* |
561 | /* |
600 | * If an object with the IS_TURNABLE() flag needs to be turned due |
562 | * If an object with the IS_TURNABLE() flag needs to be turned due |
601 | * to the closest player being on the other side, this function can |
563 | * to the closest player being on the other side, this function can |
602 | * be called to update the face variable, _and_ how it looks on the map. |
564 | * be called to update the face variable, _and_ how it looks on the map. |
603 | */ |
565 | */ |
604 | |
|
|
605 | void |
566 | void |
606 | update_turn_face (object *op) |
567 | update_turn_face (object *op) |
607 | { |
568 | { |
608 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
569 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
609 | return; |
570 | return; |
|
|
571 | |
610 | SET_ANIMATION (op, op->direction); |
572 | SET_ANIMATION (op, op->direction); |
611 | update_object (op, UP_OBJ_FACE); |
573 | update_object (op, UP_OBJ_FACE); |
612 | } |
574 | } |
613 | |
575 | |
614 | /* |
576 | /* |
615 | * Updates the speed of an object. If the speed changes from 0 to another |
577 | * Updates the speed of an object. If the speed changes from 0 to another |
616 | * value, or vice versa, then add/remove the object from the active list. |
578 | * value, or vice versa, then add/remove the object from the active list. |
617 | * This function needs to be called whenever the speed of an object changes. |
579 | * This function needs to be called whenever the speed of an object changes. |
618 | */ |
580 | */ |
619 | void |
581 | void |
620 | update_ob_speed (object *op) |
582 | object::set_speed (float speed) |
621 | { |
583 | { |
622 | extern int arch_init; |
584 | if (flag [FLAG_FREED] && speed) |
623 | |
|
|
624 | /* No reason putting the archetypes objects on the speed list, |
|
|
625 | * since they never really need to be updated. |
|
|
626 | */ |
|
|
627 | |
|
|
628 | if (QUERY_FLAG (op, FLAG_FREED) && op->speed) |
|
|
629 | { |
585 | { |
630 | LOG (llevError, "Object %s is freed but has speed.\n", &op->name); |
586 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
631 | #ifdef MANY_CORES |
|
|
632 | abort (); |
|
|
633 | #else |
|
|
634 | op->speed = 0; |
587 | speed = 0; |
635 | #endif |
|
|
636 | } |
|
|
637 | |
|
|
638 | if (arch_init) |
|
|
639 | return; |
|
|
640 | |
|
|
641 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
|
|
642 | { |
588 | } |
643 | /* If already on active list, don't do anything */ |
|
|
644 | if (op->active_next || op->active_prev || op == active_objects) |
|
|
645 | return; |
|
|
646 | |
589 | |
647 | /* process_events() expects us to insert the object at the beginning |
590 | this->speed = speed; |
648 | * of the list. */ |
|
|
649 | op->active_next = active_objects; |
|
|
650 | |
591 | |
651 | if (op->active_next != NULL) |
592 | if (has_active_speed ()) |
652 | op->active_next->active_prev = op; |
593 | activate (); |
653 | |
|
|
654 | active_objects = op; |
|
|
655 | } |
|
|
656 | else |
594 | else |
657 | { |
595 | deactivate (); |
658 | /* If not on the active list, nothing needs to be done */ |
|
|
659 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
660 | return; |
|
|
661 | |
|
|
662 | if (op->active_prev == NULL) |
|
|
663 | { |
|
|
664 | active_objects = op->active_next; |
|
|
665 | |
|
|
666 | if (op->active_next != NULL) |
|
|
667 | op->active_next->active_prev = NULL; |
|
|
668 | } |
|
|
669 | else |
|
|
670 | { |
|
|
671 | op->active_prev->active_next = op->active_next; |
|
|
672 | |
|
|
673 | if (op->active_next) |
|
|
674 | op->active_next->active_prev = op->active_prev; |
|
|
675 | } |
|
|
676 | |
|
|
677 | op->active_next = NULL; |
|
|
678 | op->active_prev = NULL; |
|
|
679 | } |
|
|
680 | } |
596 | } |
681 | |
597 | |
682 | /* This function removes object 'op' from the list of active |
|
|
683 | * objects. |
|
|
684 | * This should only be used for style maps or other such |
|
|
685 | * reference maps where you don't want an object that isn't |
|
|
686 | * in play chewing up cpu time getting processed. |
|
|
687 | * The reverse of this is to call update_ob_speed, which |
|
|
688 | * will do the right thing based on the speed of the object. |
|
|
689 | */ |
|
|
690 | void |
|
|
691 | remove_from_active_list (object *op) |
|
|
692 | { |
|
|
693 | /* If not on the active list, nothing needs to be done */ |
|
|
694 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
695 | return; |
|
|
696 | |
|
|
697 | if (op->active_prev == NULL) |
|
|
698 | { |
|
|
699 | active_objects = op->active_next; |
|
|
700 | if (op->active_next != NULL) |
|
|
701 | op->active_next->active_prev = NULL; |
|
|
702 | } |
|
|
703 | else |
|
|
704 | { |
|
|
705 | op->active_prev->active_next = op->active_next; |
|
|
706 | if (op->active_next) |
|
|
707 | op->active_next->active_prev = op->active_prev; |
|
|
708 | } |
|
|
709 | op->active_next = NULL; |
|
|
710 | op->active_prev = NULL; |
|
|
711 | } |
|
|
712 | |
|
|
713 | /* |
598 | /* |
714 | * update_object() updates the array which represents the map. |
599 | * update_object() updates the the map. |
715 | * It takes into account invisible objects (and represent squares covered |
600 | * It takes into account invisible objects (and represent squares covered |
716 | * by invisible objects by whatever is below them (unless it's another |
601 | * by invisible objects by whatever is below them (unless it's another |
717 | * invisible object, etc...) |
602 | * invisible object, etc...) |
718 | * If the object being updated is beneath a player, the look-window |
603 | * If the object being updated is beneath a player, the look-window |
719 | * of that player is updated (this might be a suboptimal way of |
604 | * of that player is updated (this might be a suboptimal way of |
720 | * updating that window, though, since update_object() is called _often_) |
605 | * updating that window, though, since update_object() is called _often_) |
721 | * |
606 | * |
722 | * action is a hint of what the caller believes need to be done. |
607 | * action is a hint of what the caller believes need to be done. |
723 | * For example, if the only thing that has changed is the face (due to |
|
|
724 | * an animation), we don't need to call update_position until that actually |
|
|
725 | * comes into view of a player. OTOH, many other things, like addition/removal |
|
|
726 | * of walls or living creatures may need us to update the flags now. |
|
|
727 | * current action are: |
608 | * current action are: |
728 | * UP_OBJ_INSERT: op was inserted |
609 | * UP_OBJ_INSERT: op was inserted |
729 | * UP_OBJ_REMOVE: op was removed |
610 | * UP_OBJ_REMOVE: op was removed |
730 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
611 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
731 | * as that is easier than trying to look at what may have changed. |
612 | * as that is easier than trying to look at what may have changed. |
732 | * UP_OBJ_FACE: only the objects face has changed. |
613 | * UP_OBJ_FACE: only the objects face has changed. |
733 | */ |
614 | */ |
734 | |
|
|
735 | void |
615 | void |
736 | update_object (object *op, int action) |
616 | update_object (object *op, int action) |
737 | { |
617 | { |
738 | int update_now = 0, flags; |
|
|
739 | MoveType move_on, move_off, move_block, move_slow; |
|
|
740 | |
|
|
741 | if (op == NULL) |
618 | if (op == NULL) |
742 | { |
619 | { |
743 | /* this should never happen */ |
620 | /* this should never happen */ |
744 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
621 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
745 | return; |
622 | return; |
746 | } |
623 | } |
747 | |
624 | |
748 | if (op->env != NULL) |
625 | if (op->env) |
749 | { |
626 | { |
750 | /* Animation is currently handled by client, so nothing |
627 | /* Animation is currently handled by client, so nothing |
751 | * to do in this case. |
628 | * to do in this case. |
752 | */ |
629 | */ |
753 | return; |
630 | return; |
… | |
… | |
758 | */ |
635 | */ |
759 | if (!op->map || op->map->in_memory == MAP_SAVING) |
636 | if (!op->map || op->map->in_memory == MAP_SAVING) |
760 | return; |
637 | return; |
761 | |
638 | |
762 | /* make sure the object is within map boundaries */ |
639 | /* make sure the object is within map boundaries */ |
763 | if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) |
640 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
764 | { |
641 | { |
765 | LOG (llevError, "update_object() called for object out of map!\n"); |
642 | LOG (llevError, "update_object() called for object out of map!\n"); |
766 | #ifdef MANY_CORES |
643 | #ifdef MANY_CORES |
767 | abort (); |
644 | abort (); |
768 | #endif |
645 | #endif |
769 | return; |
646 | return; |
770 | } |
647 | } |
771 | |
648 | |
772 | flags = GET_MAP_FLAGS (op->map, op->x, op->y); |
649 | mapspace &m = op->ms (); |
773 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE); |
|
|
774 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
|
|
775 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
|
|
776 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
|
|
777 | move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y); |
|
|
778 | |
650 | |
|
|
651 | if (!(m.flags_ & P_UPTODATE)) |
|
|
652 | /* nop */; |
779 | if (action == UP_OBJ_INSERT) |
653 | else if (action == UP_OBJ_INSERT) |
780 | { |
654 | { |
|
|
655 | // this is likely overkill, TODO: revisit (schmorp) |
781 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) |
656 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
782 | update_now = 1; |
|
|
783 | |
|
|
784 | if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) |
657 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
785 | update_now = 1; |
658 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
786 | |
659 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
|
|
660 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
787 | if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) |
661 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
788 | update_now = 1; |
|
|
789 | |
|
|
790 | if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) |
|
|
791 | update_now = 1; |
|
|
792 | |
|
|
793 | if (op->type == SAFE_GROUND && !(flags & P_SAFE)) |
|
|
794 | update_now = 1; |
|
|
795 | |
|
|
796 | if ((move_on | op->move_on) != move_on) |
662 | || (m.move_on | op->move_on ) != m.move_on |
797 | update_now = 1; |
|
|
798 | |
|
|
799 | if ((move_off | op->move_off) != move_off) |
663 | || (m.move_off | op->move_off ) != m.move_off |
800 | update_now = 1; |
664 | || (m.move_slow | op->move_slow) != m.move_slow |
801 | |
|
|
802 | /* This isn't perfect, but I don't expect a lot of objects to |
665 | /* This isn't perfect, but I don't expect a lot of objects to |
803 | * to have move_allow right now. |
666 | * to have move_allow right now. |
804 | */ |
667 | */ |
805 | if (((move_block | op->move_block) & ~op->move_allow) != move_block) |
668 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
806 | update_now = 1; |
669 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
807 | |
670 | m.flags_ = 0; |
808 | if ((move_slow | op->move_slow) != move_slow) |
|
|
809 | update_now = 1; |
|
|
810 | } |
671 | } |
811 | /* if the object is being removed, we can't make intelligent |
672 | /* if the object is being removed, we can't make intelligent |
812 | * decisions, because remove_ob can't really pass the object |
673 | * decisions, because remove_ob can't really pass the object |
813 | * that is being removed. |
674 | * that is being removed. |
814 | */ |
675 | */ |
815 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
676 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
816 | update_now = 1; |
677 | m.flags_ = 0; |
817 | else if (action == UP_OBJ_FACE) |
678 | else if (action == UP_OBJ_FACE) |
818 | /* Nothing to do for that case */ ; |
679 | /* Nothing to do for that case */ ; |
819 | else |
680 | else |
820 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
681 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
821 | |
682 | |
822 | if (update_now) |
|
|
823 | { |
|
|
824 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
|
|
825 | update_position (op->map, op->x, op->y); |
|
|
826 | } |
|
|
827 | |
|
|
828 | if (op->more != NULL) |
683 | if (op->more) |
829 | update_object (op->more, action); |
684 | update_object (op->more, action); |
830 | } |
|
|
831 | |
|
|
832 | object::vector object::mortals; |
|
|
833 | object::vector object::objects; // not yet used |
|
|
834 | object *object::first; |
|
|
835 | |
|
|
836 | void object::free_mortals () |
|
|
837 | { |
|
|
838 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
|
|
839 | if ((*i)->refcnt) |
|
|
840 | ++i; // further delay freeing |
|
|
841 | else |
|
|
842 | { |
|
|
843 | delete *i; |
|
|
844 | mortals.erase (i); |
|
|
845 | } |
|
|
846 | |
|
|
847 | static int lastmortals = 0;//D |
|
|
848 | |
|
|
849 | if (mortals.size() != lastmortals && lastmortals > 100)//D |
|
|
850 | { |
|
|
851 | lastmortals = mortals.size ();//D |
|
|
852 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
853 | } |
|
|
854 | } |
685 | } |
855 | |
686 | |
856 | object::object () |
687 | object::object () |
857 | { |
688 | { |
858 | SET_FLAG (this, FLAG_REMOVED); |
689 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
861 | face = blank_face; |
692 | face = blank_face; |
862 | } |
693 | } |
863 | |
694 | |
864 | object::~object () |
695 | object::~object () |
865 | { |
696 | { |
|
|
697 | unlink (); |
|
|
698 | |
866 | free_key_values (this); |
699 | free_key_values (this); |
867 | } |
700 | } |
868 | |
701 | |
|
|
702 | static int object_count; |
|
|
703 | |
869 | void object::link () |
704 | void object::link () |
870 | { |
705 | { |
871 | count = ++ob_count; |
706 | assert (!index);//D |
872 | uuid = gen_uuid (); |
707 | uuid = gen_uuid (); |
|
|
708 | count = ++object_count; |
873 | |
709 | |
874 | prev = 0; |
710 | refcnt_inc (); |
875 | next = object::first; |
711 | objects.insert (this); |
876 | |
|
|
877 | if (object::first) |
|
|
878 | object::first->prev = this; |
|
|
879 | |
|
|
880 | object::first = this; |
|
|
881 | } |
712 | } |
882 | |
713 | |
883 | void object::unlink () |
714 | void object::unlink () |
884 | { |
715 | { |
885 | if (this == object::first) |
716 | if (!index) |
886 | object::first = next; |
717 | return; |
887 | |
718 | |
888 | /* Remove this object from the list of used objects */ |
719 | objects.erase (this); |
889 | if (prev) prev->next = next; |
720 | refcnt_dec (); |
890 | if (next) next->prev = prev; |
721 | } |
891 | |
722 | |
892 | prev = 0; |
723 | void |
893 | next = 0; |
724 | object::activate () |
|
|
725 | { |
|
|
726 | /* If already on active list, don't do anything */ |
|
|
727 | if (active) |
|
|
728 | return; |
|
|
729 | |
|
|
730 | if (has_active_speed ()) |
|
|
731 | actives.insert (this); |
|
|
732 | } |
|
|
733 | |
|
|
734 | void |
|
|
735 | object::activate_recursive () |
|
|
736 | { |
|
|
737 | activate (); |
|
|
738 | |
|
|
739 | for (object *op = inv; op; op = op->below) |
|
|
740 | op->activate_recursive (); |
|
|
741 | } |
|
|
742 | |
|
|
743 | /* This function removes object 'op' from the list of active |
|
|
744 | * objects. |
|
|
745 | * This should only be used for style maps or other such |
|
|
746 | * reference maps where you don't want an object that isn't |
|
|
747 | * in play chewing up cpu time getting processed. |
|
|
748 | * The reverse of this is to call update_ob_speed, which |
|
|
749 | * will do the right thing based on the speed of the object. |
|
|
750 | */ |
|
|
751 | void |
|
|
752 | object::deactivate () |
|
|
753 | { |
|
|
754 | /* If not on the active list, nothing needs to be done */ |
|
|
755 | if (!active) |
|
|
756 | return; |
|
|
757 | |
|
|
758 | actives.erase (this); |
|
|
759 | } |
|
|
760 | |
|
|
761 | void |
|
|
762 | object::deactivate_recursive () |
|
|
763 | { |
|
|
764 | for (object *op = inv; op; op = op->below) |
|
|
765 | op->deactivate_recursive (); |
|
|
766 | |
|
|
767 | deactivate (); |
|
|
768 | } |
|
|
769 | |
|
|
770 | void |
|
|
771 | object::set_flag_inv (int flag, int value) |
|
|
772 | { |
|
|
773 | for (object *op = inv; op; op = op->below) |
|
|
774 | { |
|
|
775 | op->flag [flag] = value; |
|
|
776 | op->set_flag_inv (flag, value); |
|
|
777 | } |
|
|
778 | } |
|
|
779 | |
|
|
780 | /* |
|
|
781 | * Remove and free all objects in the inventory of the given object. |
|
|
782 | * object.c ? |
|
|
783 | */ |
|
|
784 | void |
|
|
785 | object::destroy_inv (bool drop_to_ground) |
|
|
786 | { |
|
|
787 | // need to check first, because the checks below might segfault |
|
|
788 | // as we might be on an invalid mapspace and crossfire code |
|
|
789 | // is too buggy to ensure that the inventory is empty. |
|
|
790 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
791 | // cf will crash below with off-map x and y |
|
|
792 | if (!inv) |
|
|
793 | return; |
|
|
794 | |
|
|
795 | /* Only if the space blocks everything do we not process - |
|
|
796 | * if some form of movement is allowed, let objects |
|
|
797 | * drop on that space. |
|
|
798 | */ |
|
|
799 | if (!drop_to_ground |
|
|
800 | || !map |
|
|
801 | || map->in_memory != MAP_IN_MEMORY |
|
|
802 | || map->nodrop |
|
|
803 | || ms ().move_block == MOVE_ALL) |
|
|
804 | { |
|
|
805 | while (inv) |
|
|
806 | { |
|
|
807 | inv->destroy_inv (drop_to_ground); |
|
|
808 | inv->destroy (); |
|
|
809 | } |
|
|
810 | } |
|
|
811 | else |
|
|
812 | { /* Put objects in inventory onto this space */ |
|
|
813 | while (inv) |
|
|
814 | { |
|
|
815 | object *op = inv; |
|
|
816 | |
|
|
817 | if (op->flag [FLAG_STARTEQUIP] |
|
|
818 | || op->flag [FLAG_NO_DROP] |
|
|
819 | || op->type == RUNE |
|
|
820 | || op->type == TRAP |
|
|
821 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
822 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
|
|
823 | op->destroy (); |
|
|
824 | else |
|
|
825 | map->insert (op, x, y); |
|
|
826 | } |
|
|
827 | } |
894 | } |
828 | } |
895 | |
829 | |
896 | object *object::create () |
830 | object *object::create () |
897 | { |
831 | { |
898 | object *op = new object; |
832 | object *op = new object; |
899 | op->link (); |
833 | op->link (); |
900 | return op; |
834 | return op; |
901 | } |
835 | } |
902 | |
836 | |
903 | /* |
837 | void |
904 | * free_object() frees everything allocated by an object, removes |
838 | object::do_destroy () |
905 | * it from the list of used objects, and puts it on the list of |
|
|
906 | * free objects. The IS_FREED() flag is set in the object. |
|
|
907 | * The object must have been removed by remove_ob() first for |
|
|
908 | * this function to succeed. |
|
|
909 | * |
|
|
910 | * If destroy_inventory is set, free inventory as well. Else drop items in |
|
|
911 | * inventory to the ground. |
|
|
912 | */ |
|
|
913 | void object::destroy (bool destroy_inventory) |
|
|
914 | { |
839 | { |
915 | if (QUERY_FLAG (this, FLAG_FREED)) |
840 | attachable::do_destroy (); |
916 | return; |
|
|
917 | |
841 | |
918 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
842 | if (flag [FLAG_IS_LINKED]) |
|
|
843 | remove_button_link (this); |
|
|
844 | |
|
|
845 | if (flag [FLAG_FRIENDLY]) |
919 | remove_friendly_object (this); |
846 | remove_friendly_object (this); |
920 | |
847 | |
921 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
848 | if (!flag [FLAG_REMOVED]) |
922 | remove_ob (this); |
849 | remove (); |
923 | |
850 | |
924 | SET_FLAG (this, FLAG_FREED); |
851 | destroy_inv (true); |
|
|
852 | |
|
|
853 | deactivate (); |
|
|
854 | unlink (); |
|
|
855 | |
|
|
856 | flag [FLAG_FREED] = 1; |
|
|
857 | |
|
|
858 | // hack to ensure that freed objects still have a valid map |
|
|
859 | { |
|
|
860 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
861 | |
|
|
862 | if (!freed_map) |
|
|
863 | { |
|
|
864 | freed_map = new maptile; |
|
|
865 | |
|
|
866 | freed_map->name = "/internal/freed_objects_map"; |
|
|
867 | freed_map->width = 3; |
|
|
868 | freed_map->height = 3; |
|
|
869 | |
|
|
870 | freed_map->alloc (); |
|
|
871 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
872 | } |
|
|
873 | |
|
|
874 | map = freed_map; |
|
|
875 | x = 1; |
|
|
876 | y = 1; |
|
|
877 | } |
|
|
878 | |
|
|
879 | head = 0; |
925 | |
880 | |
926 | if (more) |
881 | if (more) |
927 | { |
882 | { |
928 | more->destroy (destroy_inventory); |
883 | more->destroy (); |
929 | more = 0; |
884 | more = 0; |
930 | } |
|
|
931 | |
|
|
932 | if (inv) |
|
|
933 | { |
|
|
934 | /* Only if the space blocks everything do we not process - |
|
|
935 | * if some form of movement is allowed, let objects |
|
|
936 | * drop on that space. |
|
|
937 | */ |
|
|
938 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
|
|
939 | { |
|
|
940 | object *op = inv; |
|
|
941 | |
|
|
942 | while (op) |
|
|
943 | { |
|
|
944 | object *tmp = op->below; |
|
|
945 | op->destroy (destroy_inventory); |
|
|
946 | op = tmp; |
|
|
947 | } |
|
|
948 | } |
|
|
949 | else |
|
|
950 | { /* Put objects in inventory onto this space */ |
|
|
951 | object *op = inv; |
|
|
952 | |
|
|
953 | while (op) |
|
|
954 | { |
|
|
955 | object *tmp = op->below; |
|
|
956 | |
|
|
957 | remove_ob (op); |
|
|
958 | |
|
|
959 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
|
|
960 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
|
|
961 | free_object (op); |
|
|
962 | else |
|
|
963 | { |
|
|
964 | op->x = x; |
|
|
965 | op->y = y; |
|
|
966 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
967 | } |
|
|
968 | |
|
|
969 | op = tmp; |
|
|
970 | } |
|
|
971 | } |
|
|
972 | } |
885 | } |
973 | |
886 | |
974 | // clear those pointers that likely might have circular references to us |
887 | // clear those pointers that likely might have circular references to us |
975 | owner = 0; |
888 | owner = 0; |
976 | enemy = 0; |
889 | enemy = 0; |
977 | attacked_by = 0; |
890 | attacked_by = 0; |
|
|
891 | } |
978 | |
892 | |
979 | // only relevant for players(?), but make sure of it anyways |
893 | void |
980 | contr = 0; |
894 | object::destroy (bool destroy_inventory) |
|
|
895 | { |
|
|
896 | if (destroyed ()) |
|
|
897 | return; |
981 | |
898 | |
982 | /* Remove object from the active list */ |
899 | if (destroy_inventory) |
983 | speed = 0; |
900 | destroy_inv (false); |
984 | update_ob_speed (this); |
|
|
985 | |
901 | |
986 | unlink (); |
902 | attachable::destroy (); |
987 | |
|
|
988 | mortals.push_back (this); |
|
|
989 | } |
903 | } |
990 | |
904 | |
991 | /* |
905 | /* |
992 | * sub_weight() recursively (outwards) subtracts a number from the |
906 | * sub_weight() recursively (outwards) subtracts a number from the |
993 | * weight of an object (and what is carried by it's environment(s)). |
907 | * weight of an object (and what is carried by it's environment(s)). |
994 | */ |
908 | */ |
995 | |
|
|
996 | void |
909 | void |
997 | sub_weight (object *op, signed long weight) |
910 | sub_weight (object *op, signed long weight) |
998 | { |
911 | { |
999 | while (op != NULL) |
912 | while (op != NULL) |
1000 | { |
913 | { |
… | |
… | |
1004 | op->carrying -= weight; |
917 | op->carrying -= weight; |
1005 | op = op->env; |
918 | op = op->env; |
1006 | } |
919 | } |
1007 | } |
920 | } |
1008 | |
921 | |
1009 | /* remove_ob(op): |
922 | /* op->remove (): |
1010 | * This function removes the object op from the linked list of objects |
923 | * This function removes the object op from the linked list of objects |
1011 | * which it is currently tied to. When this function is done, the |
924 | * which it is currently tied to. When this function is done, the |
1012 | * object will have no environment. If the object previously had an |
925 | * object will have no environment. If the object previously had an |
1013 | * environment, the x and y coordinates will be updated to |
926 | * environment, the x and y coordinates will be updated to |
1014 | * the previous environment. |
927 | * the previous environment. |
1015 | * Beware: This function is called from the editor as well! |
|
|
1016 | */ |
928 | */ |
1017 | |
|
|
1018 | void |
929 | void |
1019 | remove_ob (object *op) |
930 | object::do_remove () |
1020 | { |
931 | { |
1021 | object *tmp, *last = 0; |
932 | object *tmp, *last = 0; |
1022 | object *otmp; |
933 | object *otmp; |
1023 | |
934 | |
1024 | int check_walk_off; |
|
|
1025 | maptile *m; |
|
|
1026 | |
|
|
1027 | sint16 x, y; |
|
|
1028 | |
|
|
1029 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
935 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1030 | return; |
936 | return; |
1031 | |
937 | |
1032 | SET_FLAG (op, FLAG_REMOVED); |
938 | SET_FLAG (this, FLAG_REMOVED); |
|
|
939 | INVOKE_OBJECT (REMOVE, this); |
1033 | |
940 | |
1034 | if (op->more != NULL) |
941 | if (more) |
1035 | remove_ob (op->more); |
942 | more->remove (); |
1036 | |
943 | |
1037 | /* |
944 | /* |
1038 | * In this case, the object to be removed is in someones |
945 | * In this case, the object to be removed is in someones |
1039 | * inventory. |
946 | * inventory. |
1040 | */ |
947 | */ |
1041 | if (op->env != NULL) |
948 | if (env) |
1042 | { |
949 | { |
1043 | if (op->nrof) |
950 | if (nrof) |
1044 | sub_weight (op->env, op->weight * op->nrof); |
951 | sub_weight (env, weight * nrof); |
1045 | else |
952 | else |
1046 | sub_weight (op->env, op->weight + op->carrying); |
953 | sub_weight (env, weight + carrying); |
1047 | |
954 | |
1048 | /* NO_FIX_PLAYER is set when a great many changes are being |
955 | /* NO_FIX_PLAYER is set when a great many changes are being |
1049 | * made to players inventory. If set, avoiding the call |
956 | * made to players inventory. If set, avoiding the call |
1050 | * to save cpu time. |
957 | * to save cpu time. |
1051 | */ |
958 | */ |
1052 | if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
959 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1053 | fix_player (otmp); |
960 | otmp->update_stats (); |
1054 | |
961 | |
1055 | if (op->above != NULL) |
962 | if (above) |
1056 | op->above->below = op->below; |
963 | above->below = below; |
1057 | else |
964 | else |
1058 | op->env->inv = op->below; |
965 | env->inv = below; |
1059 | |
966 | |
1060 | if (op->below != NULL) |
967 | if (below) |
1061 | op->below->above = op->above; |
968 | below->above = above; |
1062 | |
969 | |
1063 | /* we set up values so that it could be inserted into |
970 | /* we set up values so that it could be inserted into |
1064 | * the map, but we don't actually do that - it is up |
971 | * the map, but we don't actually do that - it is up |
1065 | * to the caller to decide what we want to do. |
972 | * to the caller to decide what we want to do. |
1066 | */ |
973 | */ |
1067 | op->x = op->env->x, op->y = op->env->y; |
974 | x = env->x, y = env->y; |
1068 | op->map = op->env->map; |
975 | map = env->map; |
1069 | op->above = NULL, op->below = NULL; |
976 | above = 0, below = 0; |
1070 | op->env = NULL; |
977 | env = 0; |
1071 | } |
978 | } |
1072 | else if (op->map) |
979 | else if (map) |
1073 | { |
980 | { |
1074 | x = op->x; |
981 | if (type == PLAYER) |
1075 | y = op->y; |
|
|
1076 | m = get_map_from_coord (op->map, &x, &y); |
|
|
1077 | |
|
|
1078 | if (!m) |
|
|
1079 | { |
|
|
1080 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
|
|
1081 | op->map->path, op->x, op->y); |
|
|
1082 | /* in old days, we used to set x and y to 0 and continue. |
|
|
1083 | * it seems if we get into this case, something is probablye |
|
|
1084 | * screwed up and should be fixed. |
|
|
1085 | */ |
|
|
1086 | abort (); |
|
|
1087 | } |
982 | { |
|
|
983 | // leaving a spot always closes any open container on the ground |
|
|
984 | if (container && !container->env) |
|
|
985 | // this causes spurious floorbox updates, but it ensures |
|
|
986 | // that the CLOSE event is being sent. |
|
|
987 | close_container (); |
1088 | |
988 | |
1089 | if (op->map != m) |
989 | --map->players; |
1090 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
990 | map->touch (); |
1091 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1092 | |
|
|
1093 | /* Re did the following section of code - it looks like it had |
|
|
1094 | * lots of logic for things we no longer care about |
|
|
1095 | */ |
991 | } |
|
|
992 | |
|
|
993 | map->dirty = true; |
|
|
994 | mapspace &ms = this->ms (); |
1096 | |
995 | |
1097 | /* link the object above us */ |
996 | /* link the object above us */ |
1098 | if (op->above) |
997 | if (above) |
1099 | op->above->below = op->below; |
998 | above->below = below; |
1100 | else |
999 | else |
1101 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1000 | ms.top = below; /* we were top, set new top */ |
1102 | |
1001 | |
1103 | /* Relink the object below us, if there is one */ |
1002 | /* Relink the object below us, if there is one */ |
1104 | if (op->below) |
1003 | if (below) |
1105 | op->below->above = op->above; |
1004 | below->above = above; |
1106 | else |
1005 | else |
1107 | { |
1006 | { |
1108 | /* Nothing below, which means we need to relink map object for this space |
1007 | /* Nothing below, which means we need to relink map object for this space |
1109 | * use translated coordinates in case some oddness with map tiling is |
1008 | * use translated coordinates in case some oddness with map tiling is |
1110 | * evident |
1009 | * evident |
1111 | */ |
1010 | */ |
1112 | if (GET_MAP_OB (m, x, y) != op) |
1011 | if (GET_MAP_OB (map, x, y) != this) |
1113 | { |
|
|
1114 | char *dump = dump_object (op); |
|
|
1115 | LOG (llevError, |
|
|
1116 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1012 | 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 ()); |
1117 | free (dump); |
1013 | |
1118 | dump = dump_object (GET_MAP_OB (m, x, y)); |
1014 | ms.bot = above; /* goes on above it. */ |
1119 | LOG (llevError, "%s\n", dump); |
|
|
1120 | free (dump); |
|
|
1121 | } |
1015 | } |
1122 | |
1016 | |
1123 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
|
|
1124 | } |
|
|
1125 | |
|
|
1126 | op->above = 0; |
1017 | above = 0; |
1127 | op->below = 0; |
1018 | below = 0; |
1128 | |
1019 | |
1129 | if (op->map->in_memory == MAP_SAVING) |
1020 | if (map->in_memory == MAP_SAVING) |
1130 | return; |
1021 | return; |
1131 | |
1022 | |
1132 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1023 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1133 | |
1024 | |
1134 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1025 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1135 | { |
1026 | { |
1136 | /* No point updating the players look faces if he is the object |
1027 | /* No point updating the players look faces if he is the object |
1137 | * being removed. |
1028 | * being removed. |
1138 | */ |
1029 | */ |
1139 | |
1030 | |
1140 | if (tmp->type == PLAYER && tmp != op) |
1031 | if (tmp->type == PLAYER && tmp != this) |
1141 | { |
1032 | { |
1142 | /* If a container that the player is currently using somehow gets |
1033 | /* If a container that the player is currently using somehow gets |
1143 | * removed (most likely destroyed), update the player view |
1034 | * removed (most likely destroyed), update the player view |
1144 | * appropriately. |
1035 | * appropriately. |
1145 | */ |
1036 | */ |
1146 | if (tmp->container == op) |
1037 | if (tmp->container == this) |
1147 | { |
1038 | { |
1148 | CLEAR_FLAG (op, FLAG_APPLIED); |
1039 | flag [FLAG_APPLIED] = 0; |
1149 | tmp->container = NULL; |
1040 | tmp->container = 0; |
1150 | } |
1041 | } |
1151 | |
1042 | |
1152 | tmp->contr->socket.update_look = 1; |
1043 | if (tmp->contr->ns) |
|
|
1044 | tmp->contr->ns->floorbox_update (); |
1153 | } |
1045 | } |
1154 | |
1046 | |
1155 | /* See if player moving off should effect something */ |
1047 | /* See if object moving off should effect something */ |
1156 | if (check_walk_off |
1048 | if (check_walk_off |
1157 | && ((op->move_type & tmp->move_off) |
1049 | && ((move_type & tmp->move_off) |
1158 | && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1050 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1159 | { |
1051 | { |
1160 | move_apply (tmp, op, NULL); |
1052 | move_apply (tmp, this, 0); |
1161 | |
1053 | |
1162 | if (op->destroyed ()) |
1054 | if (destroyed ()) |
1163 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1055 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1164 | } |
1056 | } |
1165 | |
1057 | |
1166 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1058 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1167 | |
1059 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1168 | if (tmp->above == tmp) |
1060 | if (tmp->above == tmp) |
1169 | tmp->above = NULL; |
1061 | tmp->above = 0; |
1170 | |
1062 | |
1171 | last = tmp; |
1063 | last = tmp; |
1172 | } |
1064 | } |
1173 | |
1065 | |
1174 | /* last == NULL of there are no objects on this space */ |
1066 | /* last == NULL if there are no objects on this space */ |
|
|
1067 | //TODO: this makes little sense, why only update the topmost object? |
1175 | if (last == NULL) |
1068 | if (!last) |
1176 | { |
1069 | map->at (x, y).flags_ = 0; |
1177 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
|
|
1178 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
|
|
1179 | * those out anyways, and if there are any flags set right now, they won't |
|
|
1180 | * be correct anyways. |
|
|
1181 | */ |
|
|
1182 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
|
|
1183 | update_position (op->map, op->x, op->y); |
|
|
1184 | } |
|
|
1185 | else |
1070 | else |
1186 | update_object (last, UP_OBJ_REMOVE); |
1071 | update_object (last, UP_OBJ_REMOVE); |
1187 | |
1072 | |
1188 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1073 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1189 | update_all_los (op->map, op->x, op->y); |
1074 | update_all_los (map, x, y); |
1190 | } |
1075 | } |
1191 | } |
1076 | } |
1192 | |
1077 | |
1193 | /* |
1078 | /* |
1194 | * merge_ob(op,top): |
1079 | * merge_ob(op,top): |
… | |
… | |
1202 | merge_ob (object *op, object *top) |
1087 | merge_ob (object *op, object *top) |
1203 | { |
1088 | { |
1204 | if (!op->nrof) |
1089 | if (!op->nrof) |
1205 | return 0; |
1090 | return 0; |
1206 | |
1091 | |
1207 | if (top == NULL) |
1092 | if (top) |
1208 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1093 | for (top = op; top && top->above; top = top->above) |
|
|
1094 | ; |
1209 | |
1095 | |
1210 | for (; top != NULL; top = top->below) |
1096 | for (; top; top = top->below) |
1211 | { |
1097 | { |
1212 | if (top == op) |
1098 | if (top == op) |
1213 | continue; |
1099 | continue; |
1214 | if (CAN_MERGE (op, top)) |
1100 | |
|
|
1101 | if (object::can_merge (op, top)) |
1215 | { |
1102 | { |
1216 | top->nrof += op->nrof; |
1103 | top->nrof += op->nrof; |
1217 | |
1104 | |
1218 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1105 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1219 | op->weight = 0; /* Don't want any adjustements now */ |
1106 | op->weight = 0; /* Don't want any adjustements now */ |
1220 | remove_ob (op); |
1107 | op->destroy (); |
1221 | free_object (op); |
|
|
1222 | return top; |
1108 | return top; |
1223 | } |
1109 | } |
1224 | } |
1110 | } |
1225 | |
1111 | |
1226 | return 0; |
1112 | return 0; |
1227 | } |
1113 | } |
1228 | |
1114 | |
|
|
1115 | void |
|
|
1116 | object::expand_tail () |
|
|
1117 | { |
|
|
1118 | if (more) |
|
|
1119 | return; |
|
|
1120 | |
|
|
1121 | object *prev = this; |
|
|
1122 | |
|
|
1123 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1124 | { |
|
|
1125 | object *op = arch_to_object (at); |
|
|
1126 | |
|
|
1127 | op->name = name; |
|
|
1128 | op->name_pl = name_pl; |
|
|
1129 | op->title = title; |
|
|
1130 | |
|
|
1131 | op->head = this; |
|
|
1132 | prev->more = op; |
|
|
1133 | |
|
|
1134 | prev = op; |
|
|
1135 | } |
|
|
1136 | } |
|
|
1137 | |
1229 | /* |
1138 | /* |
1230 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1139 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1231 | * job preparing multi-part monsters |
1140 | * job preparing multi-part monsters. |
1232 | */ |
1141 | */ |
1233 | object * |
1142 | object * |
1234 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1143 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1235 | { |
1144 | { |
1236 | object *tmp; |
|
|
1237 | |
|
|
1238 | if (op->head) |
|
|
1239 | op = op->head; |
|
|
1240 | |
|
|
1241 | for (tmp = op; tmp; tmp = tmp->more) |
1145 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1242 | { |
1146 | { |
1243 | tmp->x = x + tmp->arch->clone.x; |
1147 | tmp->x = x + tmp->arch->clone.x; |
1244 | tmp->y = y + tmp->arch->clone.y; |
1148 | tmp->y = y + tmp->arch->clone.y; |
1245 | } |
1149 | } |
1246 | |
1150 | |
… | |
… | |
1265 | * Return value: |
1169 | * Return value: |
1266 | * new object if 'op' was merged with other object |
1170 | * new object if 'op' was merged with other object |
1267 | * NULL if 'op' was destroyed |
1171 | * NULL if 'op' was destroyed |
1268 | * just 'op' otherwise |
1172 | * just 'op' otherwise |
1269 | */ |
1173 | */ |
1270 | |
|
|
1271 | object * |
1174 | object * |
1272 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1175 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1273 | { |
1176 | { |
|
|
1177 | assert (!op->flag [FLAG_FREED]); |
|
|
1178 | |
1274 | object *tmp, *top, *floor = NULL; |
1179 | object *tmp, *top, *floor = NULL; |
1275 | sint16 x, y; |
|
|
1276 | |
1180 | |
1277 | if (QUERY_FLAG (op, FLAG_FREED)) |
1181 | op->remove (); |
1278 | { |
|
|
1279 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1280 | return NULL; |
|
|
1281 | } |
|
|
1282 | |
1182 | |
1283 | if (m == NULL) |
1183 | #if 0 |
1284 | { |
1184 | if (!m->active != !op->active) |
1285 | char *dump = dump_object (op); |
1185 | if (m->active) |
1286 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1186 | op->activate_recursive (); |
1287 | free (dump); |
1187 | else |
1288 | return op; |
1188 | op->deactivate_recursive (); |
1289 | } |
1189 | #endif |
1290 | |
1190 | |
1291 | if (out_of_map (m, op->x, op->y)) |
1191 | if (out_of_map (m, op->x, op->y)) |
1292 | { |
1192 | { |
1293 | char *dump = dump_object (op); |
|
|
1294 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1193 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1295 | #ifdef MANY_CORES |
1194 | #ifdef MANY_CORES |
1296 | /* Better to catch this here, as otherwise the next use of this object |
1195 | /* Better to catch this here, as otherwise the next use of this object |
1297 | * is likely to cause a crash. Better to find out where it is getting |
1196 | * is likely to cause a crash. Better to find out where it is getting |
1298 | * improperly inserted. |
1197 | * improperly inserted. |
1299 | */ |
1198 | */ |
1300 | abort (); |
1199 | abort (); |
1301 | #endif |
1200 | #endif |
1302 | free (dump); |
|
|
1303 | return op; |
1201 | return op; |
1304 | } |
1202 | } |
1305 | |
1203 | |
1306 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1307 | { |
|
|
1308 | char *dump = dump_object (op); |
|
|
1309 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1310 | free (dump); |
|
|
1311 | return op; |
|
|
1312 | } |
|
|
1313 | |
|
|
1314 | if (op->more != NULL) |
|
|
1315 | { |
|
|
1316 | /* The part may be on a different map. */ |
|
|
1317 | |
|
|
1318 | object *more = op->more; |
1204 | if (object *more = op->more) |
1319 | |
1205 | { |
1320 | /* We really need the caller to normalize coordinates - if |
|
|
1321 | * we set the map, that doesn't work if the location is within |
|
|
1322 | * a map and this is straddling an edge. So only if coordinate |
|
|
1323 | * is clear wrong do we normalize it. |
|
|
1324 | */ |
|
|
1325 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1326 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1327 | else if (!more->map) |
|
|
1328 | { |
|
|
1329 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1330 | * more->map should always point to the parent. |
|
|
1331 | */ |
|
|
1332 | more->map = m; |
|
|
1333 | } |
|
|
1334 | |
|
|
1335 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1206 | if (!insert_ob_in_map (more, m, originator, flag)) |
1336 | { |
1207 | { |
1337 | if (!op->head) |
1208 | if (!op->head) |
1338 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1209 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1339 | |
1210 | |
1340 | return NULL; |
1211 | return 0; |
1341 | } |
1212 | } |
1342 | } |
1213 | } |
1343 | |
1214 | |
1344 | CLEAR_FLAG (op, FLAG_REMOVED); |
1215 | CLEAR_FLAG (op, FLAG_REMOVED); |
1345 | |
1216 | |
1346 | /* Ideally, the caller figures this out. However, it complicates a lot |
1217 | /* Ideally, the caller figures this out. However, it complicates a lot |
1347 | * of areas of callers (eg, anything that uses find_free_spot would now |
1218 | * of areas of callers (eg, anything that uses find_free_spot would now |
1348 | * need extra work |
1219 | * need extra work |
1349 | */ |
1220 | */ |
1350 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1221 | if (!xy_normalise (m, op->x, op->y)) |
1351 | x = op->x; |
1222 | return 0; |
1352 | y = op->y; |
1223 | |
|
|
1224 | op->map = m; |
|
|
1225 | mapspace &ms = op->ms (); |
1353 | |
1226 | |
1354 | /* this has to be done after we translate the coordinates. |
1227 | /* this has to be done after we translate the coordinates. |
1355 | */ |
1228 | */ |
1356 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1229 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1357 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1230 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1358 | if (CAN_MERGE (op, tmp)) |
1231 | if (object::can_merge (op, tmp)) |
1359 | { |
1232 | { |
1360 | op->nrof += tmp->nrof; |
1233 | op->nrof += tmp->nrof; |
1361 | remove_ob (tmp); |
1234 | tmp->destroy (); |
1362 | free_object (tmp); |
|
|
1363 | } |
1235 | } |
1364 | |
1236 | |
1365 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1237 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1366 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1238 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1367 | |
1239 | |
… | |
… | |
1380 | op->below = originator->below; |
1252 | op->below = originator->below; |
1381 | |
1253 | |
1382 | if (op->below) |
1254 | if (op->below) |
1383 | op->below->above = op; |
1255 | op->below->above = op; |
1384 | else |
1256 | else |
1385 | SET_MAP_OB (op->map, op->x, op->y, op); |
1257 | ms.bot = op; |
1386 | |
1258 | |
1387 | /* since *below* originator, no need to update top */ |
1259 | /* since *below* originator, no need to update top */ |
1388 | originator->below = op; |
1260 | originator->below = op; |
1389 | } |
1261 | } |
1390 | else |
1262 | else |
1391 | { |
1263 | { |
|
|
1264 | top = ms.bot; |
|
|
1265 | |
1392 | /* If there are other objects, then */ |
1266 | /* If there are other objects, then */ |
1393 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1267 | if ((!(flag & INS_MAP_LOAD)) && top) |
1394 | { |
1268 | { |
1395 | object *last = NULL; |
1269 | object *last = 0; |
1396 | |
1270 | |
1397 | /* |
1271 | /* |
1398 | * If there are multiple objects on this space, we do some trickier handling. |
1272 | * If there are multiple objects on this space, we do some trickier handling. |
1399 | * We've already dealt with merging if appropriate. |
1273 | * We've already dealt with merging if appropriate. |
1400 | * Generally, we want to put the new object on top. But if |
1274 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1404 | * once we get to them. This reduces the need to traverse over all of |
1278 | * once we get to them. This reduces the need to traverse over all of |
1405 | * them when adding another one - this saves quite a bit of cpu time |
1279 | * them when adding another one - this saves quite a bit of cpu time |
1406 | * when lots of spells are cast in one area. Currently, it is presumed |
1280 | * when lots of spells are cast in one area. Currently, it is presumed |
1407 | * that flying non pickable objects are spell objects. |
1281 | * that flying non pickable objects are spell objects. |
1408 | */ |
1282 | */ |
1409 | |
1283 | for (top = ms.bot; top; top = top->above) |
1410 | while (top != NULL) |
|
|
1411 | { |
1284 | { |
1412 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1285 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1413 | floor = top; |
1286 | floor = top; |
1414 | |
1287 | |
1415 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1288 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1418 | top = top->below; |
1291 | top = top->below; |
1419 | break; |
1292 | break; |
1420 | } |
1293 | } |
1421 | |
1294 | |
1422 | last = top; |
1295 | last = top; |
1423 | top = top->above; |
|
|
1424 | } |
1296 | } |
1425 | |
1297 | |
1426 | /* Don't want top to be NULL, so set it to the last valid object */ |
1298 | /* Don't want top to be NULL, so set it to the last valid object */ |
1427 | top = last; |
1299 | top = last; |
1428 | |
1300 | |
… | |
… | |
1430 | * looks like instead of lots of conditions here. |
1302 | * looks like instead of lots of conditions here. |
1431 | * makes things faster, and effectively the same result. |
1303 | * makes things faster, and effectively the same result. |
1432 | */ |
1304 | */ |
1433 | |
1305 | |
1434 | /* Have object 'fall below' other objects that block view. |
1306 | /* Have object 'fall below' other objects that block view. |
1435 | * Unless those objects are exits, type 66 |
1307 | * Unless those objects are exits. |
1436 | * If INS_ON_TOP is used, don't do this processing |
1308 | * If INS_ON_TOP is used, don't do this processing |
1437 | * Need to find the object that in fact blocks view, otherwise |
1309 | * Need to find the object that in fact blocks view, otherwise |
1438 | * stacking is a bit odd. |
1310 | * stacking is a bit odd. |
1439 | */ |
1311 | */ |
1440 | if (!(flag & INS_ON_TOP) && |
1312 | if (!(flag & INS_ON_TOP) |
1441 | (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1313 | && ms.flags () & P_BLOCKSVIEW |
|
|
1314 | && (op->face && !faces [op->face].visibility)) |
1442 | { |
1315 | { |
1443 | for (last = top; last != floor; last = last->below) |
1316 | for (last = top; last != floor; last = last->below) |
1444 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1317 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1445 | break; |
1318 | break; |
|
|
1319 | |
1446 | /* Check to see if we found the object that blocks view, |
1320 | /* Check to see if we found the object that blocks view, |
1447 | * and make sure we have a below pointer for it so that |
1321 | * and make sure we have a below pointer for it so that |
1448 | * we can get inserted below this one, which requires we |
1322 | * we can get inserted below this one, which requires we |
1449 | * set top to the object below us. |
1323 | * set top to the object below us. |
1450 | */ |
1324 | */ |
… | |
… | |
1452 | top = last->below; |
1326 | top = last->below; |
1453 | } |
1327 | } |
1454 | } /* If objects on this space */ |
1328 | } /* If objects on this space */ |
1455 | |
1329 | |
1456 | if (flag & INS_MAP_LOAD) |
1330 | if (flag & INS_MAP_LOAD) |
1457 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1331 | top = ms.top; |
1458 | |
1332 | |
1459 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1333 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1460 | top = floor; |
1334 | top = floor; |
1461 | |
1335 | |
1462 | /* Top is the object that our object (op) is going to get inserted above. |
1336 | /* Top is the object that our object (op) is going to get inserted above. |
1463 | */ |
1337 | */ |
1464 | |
1338 | |
1465 | /* First object on this space */ |
1339 | /* First object on this space */ |
1466 | if (!top) |
1340 | if (!top) |
1467 | { |
1341 | { |
1468 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1342 | op->above = ms.bot; |
1469 | |
1343 | |
1470 | if (op->above) |
1344 | if (op->above) |
1471 | op->above->below = op; |
1345 | op->above->below = op; |
1472 | |
1346 | |
1473 | op->below = NULL; |
1347 | op->below = 0; |
1474 | SET_MAP_OB (op->map, op->x, op->y, op); |
1348 | ms.bot = op; |
1475 | } |
1349 | } |
1476 | else |
1350 | else |
1477 | { /* get inserted into the stack above top */ |
1351 | { /* get inserted into the stack above top */ |
1478 | op->above = top->above; |
1352 | op->above = top->above; |
1479 | |
1353 | |
… | |
… | |
1482 | |
1356 | |
1483 | op->below = top; |
1357 | op->below = top; |
1484 | top->above = op; |
1358 | top->above = op; |
1485 | } |
1359 | } |
1486 | |
1360 | |
1487 | if (op->above == NULL) |
1361 | if (!op->above) |
1488 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1362 | ms.top = op; |
1489 | } /* else not INS_BELOW_ORIGINATOR */ |
1363 | } /* else not INS_BELOW_ORIGINATOR */ |
1490 | |
1364 | |
1491 | if (op->type == PLAYER) |
1365 | if (op->type == PLAYER) |
|
|
1366 | { |
1492 | op->contr->do_los = 1; |
1367 | op->contr->do_los = 1; |
|
|
1368 | ++op->map->players; |
|
|
1369 | op->map->touch (); |
|
|
1370 | } |
|
|
1371 | |
|
|
1372 | op->map->dirty = true; |
1493 | |
1373 | |
1494 | /* If we have a floor, we know the player, if any, will be above |
1374 | /* If we have a floor, we know the player, if any, will be above |
1495 | * it, so save a few ticks and start from there. |
1375 | * it, so save a few ticks and start from there. |
1496 | */ |
1376 | */ |
1497 | if (!(flag & INS_MAP_LOAD)) |
1377 | if (!(flag & INS_MAP_LOAD)) |
1498 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1378 | if (object *pl = ms.player ()) |
1499 | if (tmp->type == PLAYER) |
1379 | if (pl->contr->ns) |
1500 | tmp->contr->socket.update_look = 1; |
1380 | pl->contr->ns->floorbox_update (); |
1501 | |
1381 | |
1502 | /* If this object glows, it may affect lighting conditions that are |
1382 | /* If this object glows, it may affect lighting conditions that are |
1503 | * visible to others on this map. But update_all_los is really |
1383 | * visible to others on this map. But update_all_los is really |
1504 | * an inefficient way to do this, as it means los for all players |
1384 | * an inefficient way to do this, as it means los for all players |
1505 | * on the map will get recalculated. The players could very well |
1385 | * on the map will get recalculated. The players could very well |
1506 | * be far away from this change and not affected in any way - |
1386 | * be far away from this change and not affected in any way - |
1507 | * this should get redone to only look for players within range, |
1387 | * this should get redone to only look for players within range, |
1508 | * or just updating the P_NEED_UPDATE for spaces within this area |
1388 | * or just updating the P_UPTODATE for spaces within this area |
1509 | * of effect may be sufficient. |
1389 | * of effect may be sufficient. |
1510 | */ |
1390 | */ |
1511 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1391 | if (op->map->darkness && (op->glow_radius != 0)) |
1512 | update_all_los (op->map, op->x, op->y); |
1392 | update_all_los (op->map, op->x, op->y); |
1513 | |
1393 | |
1514 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1394 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1515 | update_object (op, UP_OBJ_INSERT); |
1395 | update_object (op, UP_OBJ_INSERT); |
1516 | |
1396 | |
|
|
1397 | INVOKE_OBJECT (INSERT, op); |
|
|
1398 | |
1517 | /* Don't know if moving this to the end will break anything. However, |
1399 | /* Don't know if moving this to the end will break anything. However, |
1518 | * we want to have update_look set above before calling this. |
1400 | * we want to have floorbox_update called before calling this. |
1519 | * |
1401 | * |
1520 | * check_move_on() must be after this because code called from |
1402 | * check_move_on() must be after this because code called from |
1521 | * check_move_on() depends on correct map flags (so functions like |
1403 | * check_move_on() depends on correct map flags (so functions like |
1522 | * blocked() and wall() work properly), and these flags are updated by |
1404 | * blocked() and wall() work properly), and these flags are updated by |
1523 | * update_object(). |
1405 | * update_object(). |
… | |
… | |
1525 | |
1407 | |
1526 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1408 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1527 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1409 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1528 | { |
1410 | { |
1529 | if (check_move_on (op, originator)) |
1411 | if (check_move_on (op, originator)) |
1530 | return NULL; |
1412 | return 0; |
1531 | |
1413 | |
1532 | /* If we are a multi part object, lets work our way through the check |
1414 | /* If we are a multi part object, lets work our way through the check |
1533 | * walk on's. |
1415 | * walk on's. |
1534 | */ |
1416 | */ |
1535 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1417 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1536 | if (check_move_on (tmp, originator)) |
1418 | if (check_move_on (tmp, originator)) |
1537 | return NULL; |
1419 | return 0; |
1538 | } |
1420 | } |
1539 | |
1421 | |
1540 | return op; |
1422 | return op; |
1541 | } |
1423 | } |
1542 | |
1424 | |
1543 | /* this function inserts an object in the map, but if it |
1425 | /* this function inserts an object in the map, but if it |
1544 | * finds an object of its own type, it'll remove that one first. |
1426 | * finds an object of its own type, it'll remove that one first. |
1545 | * op is the object to insert it under: supplies x and the map. |
1427 | * op is the object to insert it under: supplies x and the map. |
1546 | */ |
1428 | */ |
1547 | void |
1429 | void |
1548 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1430 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1549 | { |
1431 | { |
1550 | object * |
1432 | object *tmp, *tmp1; |
1551 | tmp; |
|
|
1552 | object * |
|
|
1553 | tmp1; |
|
|
1554 | |
1433 | |
1555 | /* first search for itself and remove any old instances */ |
1434 | /* first search for itself and remove any old instances */ |
1556 | |
1435 | |
1557 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1436 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1558 | { |
|
|
1559 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1437 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1560 | { |
1438 | tmp->destroy (); |
1561 | remove_ob (tmp); |
|
|
1562 | free_object (tmp); |
|
|
1563 | } |
|
|
1564 | } |
|
|
1565 | |
1439 | |
1566 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1440 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1567 | |
1441 | |
1568 | tmp1->x = op->x; |
1442 | tmp1->x = op->x; |
1569 | tmp1->y = op->y; |
1443 | tmp1->y = op->y; |
1570 | insert_ob_in_map (tmp1, op->map, op, 0); |
1444 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1445 | } |
|
|
1446 | |
|
|
1447 | object * |
|
|
1448 | object::insert_at (object *where, object *originator, int flags) |
|
|
1449 | { |
|
|
1450 | return where->map->insert (this, where->x, where->y, originator, flags); |
1571 | } |
1451 | } |
1572 | |
1452 | |
1573 | /* |
1453 | /* |
1574 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1454 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1575 | * is returned contains nr objects, and the remaining parts contains |
1455 | * is returned contains nr objects, and the remaining parts contains |
1576 | * the rest (or is removed and freed if that number is 0). |
1456 | * the rest (or is removed and freed if that number is 0). |
1577 | * On failure, NULL is returned, and the reason put into the |
1457 | * On failure, NULL is returned, and the reason put into the |
1578 | * global static errmsg array. |
1458 | * global static errmsg array. |
1579 | */ |
1459 | */ |
1580 | |
|
|
1581 | object * |
1460 | object * |
1582 | get_split_ob (object *orig_ob, uint32 nr) |
1461 | get_split_ob (object *orig_ob, uint32 nr) |
1583 | { |
1462 | { |
1584 | object * |
1463 | object *newob; |
1585 | newob; |
|
|
1586 | int |
|
|
1587 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1464 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1588 | |
1465 | |
1589 | if (orig_ob->nrof < nr) |
1466 | if (orig_ob->nrof < nr) |
1590 | { |
1467 | { |
1591 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1468 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1592 | return NULL; |
1469 | return NULL; |
1593 | } |
1470 | } |
1594 | |
1471 | |
1595 | newob = object_create_clone (orig_ob); |
1472 | newob = object_create_clone (orig_ob); |
1596 | |
1473 | |
1597 | if ((orig_ob->nrof -= nr) < 1) |
1474 | if ((orig_ob->nrof -= nr) < 1) |
1598 | { |
1475 | orig_ob->destroy (1); |
1599 | if (!is_removed) |
|
|
1600 | remove_ob (orig_ob); |
|
|
1601 | free_object2 (orig_ob, 1); |
|
|
1602 | } |
|
|
1603 | else if (!is_removed) |
1476 | else if (!is_removed) |
1604 | { |
1477 | { |
1605 | if (orig_ob->env != NULL) |
1478 | if (orig_ob->env != NULL) |
1606 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1479 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1607 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1480 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
… | |
… | |
1622 | * the amount of an object. If the amount reaches 0, the object |
1495 | * the amount of an object. If the amount reaches 0, the object |
1623 | * is subsequently removed and freed. |
1496 | * is subsequently removed and freed. |
1624 | * |
1497 | * |
1625 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1498 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1626 | */ |
1499 | */ |
1627 | |
|
|
1628 | object * |
1500 | object * |
1629 | decrease_ob_nr (object *op, uint32 i) |
1501 | decrease_ob_nr (object *op, uint32 i) |
1630 | { |
1502 | { |
1631 | object *tmp; |
1503 | object *tmp; |
1632 | player *pl; |
|
|
1633 | |
1504 | |
1634 | if (i == 0) /* objects with op->nrof require this check */ |
1505 | if (i == 0) /* objects with op->nrof require this check */ |
1635 | return op; |
1506 | return op; |
1636 | |
1507 | |
1637 | if (i > op->nrof) |
1508 | if (i > op->nrof) |
1638 | i = op->nrof; |
1509 | i = op->nrof; |
1639 | |
1510 | |
1640 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1511 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1641 | op->nrof -= i; |
1512 | op->nrof -= i; |
1642 | else if (op->env != NULL) |
1513 | else if (op->env) |
1643 | { |
1514 | { |
1644 | /* is this object in the players inventory, or sub container |
1515 | /* is this object in the players inventory, or sub container |
1645 | * therein? |
1516 | * therein? |
1646 | */ |
1517 | */ |
1647 | tmp = is_player_inv (op->env); |
1518 | tmp = op->in_player (); |
1648 | /* nope. Is this a container the player has opened? |
1519 | /* nope. Is this a container the player has opened? |
1649 | * If so, set tmp to that player. |
1520 | * If so, set tmp to that player. |
1650 | * IMO, searching through all the players will mostly |
1521 | * IMO, searching through all the players will mostly |
1651 | * likely be quicker than following op->env to the map, |
1522 | * likely be quicker than following op->env to the map, |
1652 | * and then searching the map for a player. |
1523 | * and then searching the map for a player. |
1653 | */ |
1524 | */ |
1654 | if (!tmp) |
1525 | if (!tmp) |
1655 | { |
1526 | for_all_players (pl) |
1656 | for (pl = first_player; pl; pl = pl->next) |
|
|
1657 | if (pl->ob->container == op->env) |
1527 | if (pl->ob->container == op->env) |
|
|
1528 | { |
|
|
1529 | tmp = pl->ob; |
1658 | break; |
1530 | break; |
1659 | if (pl) |
|
|
1660 | tmp = pl->ob; |
|
|
1661 | else |
|
|
1662 | tmp = NULL; |
|
|
1663 | } |
1531 | } |
1664 | |
1532 | |
1665 | if (i < op->nrof) |
1533 | if (i < op->nrof) |
1666 | { |
1534 | { |
1667 | sub_weight (op->env, op->weight * i); |
1535 | sub_weight (op->env, op->weight * i); |
1668 | op->nrof -= i; |
1536 | op->nrof -= i; |
1669 | if (tmp) |
1537 | if (tmp) |
1670 | { |
|
|
1671 | esrv_send_item (tmp, op); |
1538 | esrv_send_item (tmp, op); |
1672 | } |
|
|
1673 | } |
1539 | } |
1674 | else |
1540 | else |
1675 | { |
1541 | { |
1676 | remove_ob (op); |
1542 | op->remove (); |
1677 | op->nrof = 0; |
1543 | op->nrof = 0; |
1678 | if (tmp) |
1544 | if (tmp) |
1679 | { |
|
|
1680 | esrv_del_item (tmp->contr, op->count); |
1545 | esrv_del_item (tmp->contr, op->count); |
1681 | } |
|
|
1682 | } |
1546 | } |
1683 | } |
1547 | } |
1684 | else |
1548 | else |
1685 | { |
1549 | { |
1686 | object *above = op->above; |
1550 | object *above = op->above; |
1687 | |
1551 | |
1688 | if (i < op->nrof) |
1552 | if (i < op->nrof) |
1689 | op->nrof -= i; |
1553 | op->nrof -= i; |
1690 | else |
1554 | else |
1691 | { |
1555 | { |
1692 | remove_ob (op); |
1556 | op->remove (); |
1693 | op->nrof = 0; |
1557 | op->nrof = 0; |
1694 | } |
1558 | } |
1695 | |
1559 | |
1696 | /* Since we just removed op, op->above is null */ |
1560 | /* Since we just removed op, op->above is null */ |
1697 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1561 | for (tmp = above; tmp; tmp = tmp->above) |
1698 | if (tmp->type == PLAYER) |
1562 | if (tmp->type == PLAYER) |
1699 | { |
1563 | { |
1700 | if (op->nrof) |
1564 | if (op->nrof) |
1701 | esrv_send_item (tmp, op); |
1565 | esrv_send_item (tmp, op); |
1702 | else |
1566 | else |
… | |
… | |
1706 | |
1570 | |
1707 | if (op->nrof) |
1571 | if (op->nrof) |
1708 | return op; |
1572 | return op; |
1709 | else |
1573 | else |
1710 | { |
1574 | { |
1711 | free_object (op); |
1575 | op->destroy (); |
1712 | return NULL; |
1576 | return 0; |
1713 | } |
1577 | } |
1714 | } |
1578 | } |
1715 | |
1579 | |
1716 | /* |
1580 | /* |
1717 | * add_weight(object, weight) adds the specified weight to an object, |
1581 | * add_weight(object, weight) adds the specified weight to an object, |
1718 | * and also updates how much the environment(s) is/are carrying. |
1582 | * and also updates how much the environment(s) is/are carrying. |
1719 | */ |
1583 | */ |
1720 | |
|
|
1721 | void |
1584 | void |
1722 | add_weight (object *op, signed long weight) |
1585 | add_weight (object *op, signed long weight) |
1723 | { |
1586 | { |
1724 | while (op != NULL) |
1587 | while (op != NULL) |
1725 | { |
1588 | { |
… | |
… | |
1729 | op->carrying += weight; |
1592 | op->carrying += weight; |
1730 | op = op->env; |
1593 | op = op->env; |
1731 | } |
1594 | } |
1732 | } |
1595 | } |
1733 | |
1596 | |
1734 | /* |
|
|
1735 | * insert_ob_in_ob(op,environment): |
|
|
1736 | * This function inserts the object op in the linked list |
|
|
1737 | * inside the object environment. |
|
|
1738 | * |
|
|
1739 | * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter |
|
|
1740 | * the inventory at the last position or next to other objects of the same |
|
|
1741 | * type. |
|
|
1742 | * Frank: Now sorted by type, archetype and magic! |
|
|
1743 | * |
|
|
1744 | * The function returns now pointer to inserted item, and return value can |
|
|
1745 | * be != op, if items are merged. -Tero |
|
|
1746 | */ |
|
|
1747 | |
|
|
1748 | object * |
1597 | object * |
1749 | insert_ob_in_ob (object *op, object *where) |
1598 | insert_ob_in_ob (object *op, object *where) |
1750 | { |
1599 | { |
1751 | object * |
1600 | if (!where) |
1752 | tmp, * |
|
|
1753 | otmp; |
|
|
1754 | |
|
|
1755 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1756 | { |
|
|
1757 | char *dump = dump_object (op); |
|
|
1758 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump); |
|
|
1759 | free (dump); |
|
|
1760 | return op; |
|
|
1761 | } |
|
|
1762 | |
|
|
1763 | if (where == NULL) |
|
|
1764 | { |
1601 | { |
1765 | char *dump = dump_object (op); |
1602 | char *dump = dump_object (op); |
1766 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1603 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1767 | free (dump); |
1604 | free (dump); |
1768 | return op; |
1605 | return op; |
1769 | } |
1606 | } |
1770 | |
1607 | |
1771 | if (where->head) |
1608 | if (where->head) |
1772 | { |
1609 | { |
1773 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
1610 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1774 | where = where->head; |
1611 | where = where->head; |
1775 | } |
1612 | } |
|
|
1613 | |
|
|
1614 | return where->insert (op); |
|
|
1615 | } |
|
|
1616 | |
|
|
1617 | /* |
|
|
1618 | * env->insert (op) |
|
|
1619 | * This function inserts the object op in the linked list |
|
|
1620 | * inside the object environment. |
|
|
1621 | * |
|
|
1622 | * The function returns now pointer to inserted item, and return value can |
|
|
1623 | * be != op, if items are merged. -Tero |
|
|
1624 | */ |
|
|
1625 | object * |
|
|
1626 | object::insert (object *op) |
|
|
1627 | { |
|
|
1628 | object *tmp, *otmp; |
|
|
1629 | |
|
|
1630 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1631 | op->remove (); |
1776 | |
1632 | |
1777 | if (op->more) |
1633 | if (op->more) |
1778 | { |
1634 | { |
1779 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1635 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1780 | return op; |
1636 | return op; |
… | |
… | |
1782 | |
1638 | |
1783 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1639 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1784 | CLEAR_FLAG (op, FLAG_REMOVED); |
1640 | CLEAR_FLAG (op, FLAG_REMOVED); |
1785 | if (op->nrof) |
1641 | if (op->nrof) |
1786 | { |
1642 | { |
1787 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1643 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1788 | if (CAN_MERGE (tmp, op)) |
1644 | if (object::can_merge (tmp, op)) |
1789 | { |
1645 | { |
1790 | /* return the original object and remove inserted object |
1646 | /* return the original object and remove inserted object |
1791 | (client needs the original object) */ |
1647 | (client needs the original object) */ |
1792 | tmp->nrof += op->nrof; |
1648 | tmp->nrof += op->nrof; |
1793 | /* Weight handling gets pretty funky. Since we are adding to |
1649 | /* Weight handling gets pretty funky. Since we are adding to |
1794 | * tmp->nrof, we need to increase the weight. |
1650 | * tmp->nrof, we need to increase the weight. |
1795 | */ |
1651 | */ |
1796 | add_weight (where, op->weight * op->nrof); |
1652 | add_weight (this, op->weight * op->nrof); |
1797 | SET_FLAG (op, FLAG_REMOVED); |
1653 | SET_FLAG (op, FLAG_REMOVED); |
1798 | free_object (op); /* free the inserted object */ |
1654 | op->destroy (); /* free the inserted object */ |
1799 | op = tmp; |
1655 | op = tmp; |
1800 | remove_ob (op); /* and fix old object's links */ |
1656 | op->remove (); /* and fix old object's links */ |
1801 | CLEAR_FLAG (op, FLAG_REMOVED); |
1657 | CLEAR_FLAG (op, FLAG_REMOVED); |
1802 | break; |
1658 | break; |
1803 | } |
1659 | } |
1804 | |
1660 | |
1805 | /* I assume combined objects have no inventory |
1661 | /* I assume combined objects have no inventory |
1806 | * We add the weight - this object could have just been removed |
1662 | * We add the weight - this object could have just been removed |
1807 | * (if it was possible to merge). calling remove_ob will subtract |
1663 | * (if it was possible to merge). calling remove_ob will subtract |
1808 | * the weight, so we need to add it in again, since we actually do |
1664 | * the weight, so we need to add it in again, since we actually do |
1809 | * the linking below |
1665 | * the linking below |
1810 | */ |
1666 | */ |
1811 | add_weight (where, op->weight * op->nrof); |
1667 | add_weight (this, op->weight * op->nrof); |
1812 | } |
1668 | } |
1813 | else |
1669 | else |
1814 | add_weight (where, (op->weight + op->carrying)); |
1670 | add_weight (this, (op->weight + op->carrying)); |
1815 | |
1671 | |
1816 | otmp = is_player_inv (where); |
1672 | otmp = this->in_player (); |
1817 | if (otmp && otmp->contr != NULL) |
1673 | if (otmp && otmp->contr) |
1818 | { |
|
|
1819 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1674 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1820 | fix_player (otmp); |
1675 | otmp->update_stats (); |
1821 | } |
|
|
1822 | |
1676 | |
1823 | op->map = NULL; |
1677 | op->map = 0; |
1824 | op->env = where; |
1678 | op->env = this; |
1825 | op->above = NULL; |
1679 | op->above = 0; |
1826 | op->below = NULL; |
1680 | op->below = 0; |
1827 | op->x = 0, op->y = 0; |
1681 | op->x = 0, op->y = 0; |
1828 | |
1682 | |
1829 | /* reset the light list and los of the players on the map */ |
1683 | /* reset the light list and los of the players on the map */ |
1830 | if ((op->glow_radius != 0) && where->map) |
1684 | if ((op->glow_radius != 0) && map) |
1831 | { |
1685 | { |
1832 | #ifdef DEBUG_LIGHTS |
1686 | #ifdef DEBUG_LIGHTS |
1833 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1687 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1834 | #endif /* DEBUG_LIGHTS */ |
1688 | #endif /* DEBUG_LIGHTS */ |
1835 | if (MAP_DARKNESS (where->map)) |
1689 | if (map->darkness) |
1836 | update_all_los (where->map, where->x, where->y); |
1690 | update_all_los (map, x, y); |
1837 | } |
1691 | } |
1838 | |
1692 | |
1839 | /* Client has no idea of ordering so lets not bother ordering it here. |
1693 | /* Client has no idea of ordering so lets not bother ordering it here. |
1840 | * It sure simplifies this function... |
1694 | * It sure simplifies this function... |
1841 | */ |
1695 | */ |
1842 | if (where->inv == NULL) |
1696 | if (!inv) |
1843 | where->inv = op; |
1697 | inv = op; |
1844 | else |
1698 | else |
1845 | { |
1699 | { |
1846 | op->below = where->inv; |
1700 | op->below = inv; |
1847 | op->below->above = op; |
1701 | op->below->above = op; |
1848 | where->inv = op; |
1702 | inv = op; |
1849 | } |
1703 | } |
|
|
1704 | |
|
|
1705 | INVOKE_OBJECT (INSERT, this); |
|
|
1706 | |
1850 | return op; |
1707 | return op; |
1851 | } |
1708 | } |
1852 | |
1709 | |
1853 | /* |
1710 | /* |
1854 | * Checks if any objects has a move_type that matches objects |
1711 | * Checks if any objects has a move_type that matches objects |
… | |
… | |
1868 | * |
1725 | * |
1869 | * MSW 2001-07-08: Check all objects on space, not just those below |
1726 | * MSW 2001-07-08: Check all objects on space, not just those below |
1870 | * object being inserted. insert_ob_in_map may not put new objects |
1727 | * object being inserted. insert_ob_in_map may not put new objects |
1871 | * on top. |
1728 | * on top. |
1872 | */ |
1729 | */ |
1873 | |
|
|
1874 | int |
1730 | int |
1875 | check_move_on (object *op, object *originator) |
1731 | check_move_on (object *op, object *originator) |
1876 | { |
1732 | { |
1877 | object *tmp; |
1733 | object *tmp; |
1878 | maptile *m = op->map; |
1734 | maptile *m = op->map; |
… | |
… | |
1905 | |
1761 | |
1906 | /* The objects have to be checked from top to bottom. |
1762 | /* The objects have to be checked from top to bottom. |
1907 | * Hence, we first go to the top: |
1763 | * Hence, we first go to the top: |
1908 | */ |
1764 | */ |
1909 | |
1765 | |
1910 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) |
1766 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1911 | { |
1767 | { |
1912 | /* Trim the search when we find the first other spell effect |
1768 | /* Trim the search when we find the first other spell effect |
1913 | * this helps performance so that if a space has 50 spell objects, |
1769 | * this helps performance so that if a space has 50 spell objects, |
1914 | * we don't need to check all of them. |
1770 | * we don't need to check all of them. |
1915 | */ |
1771 | */ |
… | |
… | |
1933 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1789 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1934 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1790 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1935 | { |
1791 | { |
1936 | |
1792 | |
1937 | float |
1793 | float |
1938 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1794 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1939 | |
1795 | |
1940 | if (op->type == PLAYER) |
1796 | if (op->type == PLAYER) |
1941 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1797 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1942 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1798 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1943 | diff /= 4.0; |
1799 | diff /= 4.0; |
… | |
… | |
1970 | /* |
1826 | /* |
1971 | * present_arch(arch, map, x, y) searches for any objects with |
1827 | * present_arch(arch, map, x, y) searches for any objects with |
1972 | * a matching archetype at the given map and coordinates. |
1828 | * a matching archetype at the given map and coordinates. |
1973 | * The first matching object is returned, or NULL if none. |
1829 | * The first matching object is returned, or NULL if none. |
1974 | */ |
1830 | */ |
1975 | |
|
|
1976 | object * |
1831 | object * |
1977 | present_arch (const archetype *at, maptile *m, int x, int y) |
1832 | present_arch (const archetype *at, maptile *m, int x, int y) |
1978 | { |
1833 | { |
1979 | object * |
|
|
1980 | tmp; |
|
|
1981 | |
|
|
1982 | if (m == NULL || out_of_map (m, x, y)) |
1834 | if (!m || out_of_map (m, x, y)) |
1983 | { |
1835 | { |
1984 | LOG (llevError, "Present_arch called outside map.\n"); |
1836 | LOG (llevError, "Present_arch called outside map.\n"); |
1985 | return NULL; |
1837 | return NULL; |
1986 | } |
1838 | } |
1987 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1839 | |
|
|
1840 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1988 | if (tmp->arch == at) |
1841 | if (tmp->arch == at) |
1989 | return tmp; |
1842 | return tmp; |
|
|
1843 | |
1990 | return NULL; |
1844 | return NULL; |
1991 | } |
1845 | } |
1992 | |
1846 | |
1993 | /* |
1847 | /* |
1994 | * present(type, map, x, y) searches for any objects with |
1848 | * present(type, map, x, y) searches for any objects with |
1995 | * a matching type variable at the given map and coordinates. |
1849 | * a matching type variable at the given map and coordinates. |
1996 | * The first matching object is returned, or NULL if none. |
1850 | * The first matching object is returned, or NULL if none. |
1997 | */ |
1851 | */ |
1998 | |
|
|
1999 | object * |
1852 | object * |
2000 | present (unsigned char type, maptile *m, int x, int y) |
1853 | present (unsigned char type, maptile *m, int x, int y) |
2001 | { |
1854 | { |
2002 | object * |
|
|
2003 | tmp; |
|
|
2004 | |
|
|
2005 | if (out_of_map (m, x, y)) |
1855 | if (out_of_map (m, x, y)) |
2006 | { |
1856 | { |
2007 | LOG (llevError, "Present called outside map.\n"); |
1857 | LOG (llevError, "Present called outside map.\n"); |
2008 | return NULL; |
1858 | return NULL; |
2009 | } |
1859 | } |
2010 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1860 | |
|
|
1861 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
2011 | if (tmp->type == type) |
1862 | if (tmp->type == type) |
2012 | return tmp; |
1863 | return tmp; |
|
|
1864 | |
2013 | return NULL; |
1865 | return NULL; |
2014 | } |
1866 | } |
2015 | |
1867 | |
2016 | /* |
1868 | /* |
2017 | * present_in_ob(type, object) searches for any objects with |
1869 | * present_in_ob(type, object) searches for any objects with |
2018 | * a matching type variable in the inventory of the given object. |
1870 | * a matching type variable in the inventory of the given object. |
2019 | * The first matching object is returned, or NULL if none. |
1871 | * The first matching object is returned, or NULL if none. |
2020 | */ |
1872 | */ |
2021 | |
|
|
2022 | object * |
1873 | object * |
2023 | present_in_ob (unsigned char type, const object *op) |
1874 | present_in_ob (unsigned char type, const object *op) |
2024 | { |
1875 | { |
2025 | object * |
|
|
2026 | tmp; |
|
|
2027 | |
|
|
2028 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1876 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2029 | if (tmp->type == type) |
1877 | if (tmp->type == type) |
2030 | return tmp; |
1878 | return tmp; |
|
|
1879 | |
2031 | return NULL; |
1880 | return NULL; |
2032 | } |
1881 | } |
2033 | |
1882 | |
2034 | /* |
1883 | /* |
2035 | * present_in_ob (type, str, object) searches for any objects with |
1884 | * present_in_ob (type, str, object) searches for any objects with |
… | |
… | |
2043 | * str is the string to match against. Note that we match against |
1892 | * str is the string to match against. Note that we match against |
2044 | * the object name, not the archetype name. this is so that the |
1893 | * the object name, not the archetype name. this is so that the |
2045 | * spell code can use one object type (force), but change it's name |
1894 | * spell code can use one object type (force), but change it's name |
2046 | * to be unique. |
1895 | * to be unique. |
2047 | */ |
1896 | */ |
2048 | |
|
|
2049 | object * |
1897 | object * |
2050 | present_in_ob_by_name (int type, const char *str, const object *op) |
1898 | present_in_ob_by_name (int type, const char *str, const object *op) |
2051 | { |
1899 | { |
2052 | object * |
|
|
2053 | tmp; |
|
|
2054 | |
|
|
2055 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1900 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2056 | { |
|
|
2057 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1901 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
2058 | return tmp; |
1902 | return tmp; |
2059 | } |
1903 | |
2060 | return NULL; |
1904 | return 0; |
2061 | } |
1905 | } |
2062 | |
1906 | |
2063 | /* |
1907 | /* |
2064 | * present_arch_in_ob(archetype, object) searches for any objects with |
1908 | * present_arch_in_ob(archetype, object) searches for any objects with |
2065 | * a matching archetype in the inventory of the given object. |
1909 | * a matching archetype in the inventory of the given object. |
2066 | * The first matching object is returned, or NULL if none. |
1910 | * The first matching object is returned, or NULL if none. |
2067 | */ |
1911 | */ |
2068 | |
|
|
2069 | object * |
1912 | object * |
2070 | present_arch_in_ob (const archetype *at, const object *op) |
1913 | present_arch_in_ob (const archetype *at, const object *op) |
2071 | { |
1914 | { |
2072 | object * |
|
|
2073 | tmp; |
|
|
2074 | |
|
|
2075 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1915 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2076 | if (tmp->arch == at) |
1916 | if (tmp->arch == at) |
2077 | return tmp; |
1917 | return tmp; |
|
|
1918 | |
2078 | return NULL; |
1919 | return NULL; |
2079 | } |
1920 | } |
2080 | |
1921 | |
2081 | /* |
1922 | /* |
2082 | * activate recursively a flag on an object inventory |
1923 | * activate recursively a flag on an object inventory |
2083 | */ |
1924 | */ |
2084 | void |
1925 | void |
2085 | flag_inv (object *op, int flag) |
1926 | flag_inv (object *op, int flag) |
2086 | { |
1927 | { |
2087 | object * |
|
|
2088 | tmp; |
|
|
2089 | |
|
|
2090 | if (op->inv) |
1928 | if (op->inv) |
2091 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1929 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2092 | { |
1930 | { |
2093 | SET_FLAG (tmp, flag); |
1931 | SET_FLAG (tmp, flag); |
2094 | flag_inv (tmp, flag); |
1932 | flag_inv (tmp, flag); |
2095 | } |
1933 | } |
2096 | } /* |
1934 | } |
|
|
1935 | |
|
|
1936 | /* |
2097 | * desactivate recursively a flag on an object inventory |
1937 | * deactivate recursively a flag on an object inventory |
2098 | */ |
1938 | */ |
2099 | void |
1939 | void |
2100 | unflag_inv (object *op, int flag) |
1940 | unflag_inv (object *op, int flag) |
2101 | { |
1941 | { |
2102 | object * |
|
|
2103 | tmp; |
|
|
2104 | |
|
|
2105 | if (op->inv) |
1942 | if (op->inv) |
2106 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1943 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2107 | { |
1944 | { |
2108 | CLEAR_FLAG (tmp, flag); |
1945 | CLEAR_FLAG (tmp, flag); |
2109 | unflag_inv (tmp, flag); |
1946 | unflag_inv (tmp, flag); |
2110 | } |
1947 | } |
2111 | } |
1948 | } |
… | |
… | |
2114 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
1951 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
2115 | * all it's inventory (recursively). |
1952 | * all it's inventory (recursively). |
2116 | * If checksums are used, a player will get set_cheat called for |
1953 | * If checksums are used, a player will get set_cheat called for |
2117 | * him/her-self and all object carried by a call to this function. |
1954 | * him/her-self and all object carried by a call to this function. |
2118 | */ |
1955 | */ |
2119 | |
|
|
2120 | void |
1956 | void |
2121 | set_cheat (object *op) |
1957 | set_cheat (object *op) |
2122 | { |
1958 | { |
2123 | SET_FLAG (op, FLAG_WAS_WIZ); |
1959 | SET_FLAG (op, FLAG_WAS_WIZ); |
2124 | flag_inv (op, FLAG_WAS_WIZ); |
1960 | flag_inv (op, FLAG_WAS_WIZ); |
… | |
… | |
2143 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1979 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2144 | * to know if the space in question will block the object. We can't use |
1980 | * to know if the space in question will block the object. We can't use |
2145 | * the archetype because that isn't correct if the monster has been |
1981 | * the archetype because that isn't correct if the monster has been |
2146 | * customized, changed states, etc. |
1982 | * customized, changed states, etc. |
2147 | */ |
1983 | */ |
2148 | |
|
|
2149 | int |
1984 | int |
2150 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1985 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2151 | { |
1986 | { |
2152 | int |
|
|
2153 | i, |
|
|
2154 | index = 0, flag; |
1987 | int index = 0, flag; |
2155 | static int |
|
|
2156 | altern[SIZEOFFREE]; |
1988 | int altern[SIZEOFFREE]; |
2157 | |
1989 | |
2158 | for (i = start; i < stop; i++) |
1990 | for (int i = start; i < stop; i++) |
2159 | { |
1991 | { |
2160 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1992 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2161 | if (!flag) |
1993 | if (!flag) |
2162 | altern[index++] = i; |
1994 | altern [index++] = i; |
2163 | |
1995 | |
2164 | /* Basically, if we find a wall on a space, we cut down the search size. |
1996 | /* Basically, if we find a wall on a space, we cut down the search size. |
2165 | * In this way, we won't return spaces that are on another side of a wall. |
1997 | * In this way, we won't return spaces that are on another side of a wall. |
2166 | * This mostly work, but it cuts down the search size in all directions - |
1998 | * This mostly work, but it cuts down the search size in all directions - |
2167 | * if the space being examined only has a wall to the north and empty |
1999 | * if the space being examined only has a wall to the north and empty |
2168 | * spaces in all the other directions, this will reduce the search space |
2000 | * spaces in all the other directions, this will reduce the search space |
2169 | * to only the spaces immediately surrounding the target area, and |
2001 | * to only the spaces immediately surrounding the target area, and |
2170 | * won't look 2 spaces south of the target space. |
2002 | * won't look 2 spaces south of the target space. |
2171 | */ |
2003 | */ |
2172 | else if ((flag & AB_NO_PASS) && maxfree[i] < stop) |
2004 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2173 | stop = maxfree[i]; |
2005 | stop = maxfree[i]; |
2174 | } |
2006 | } |
|
|
2007 | |
2175 | if (!index) |
2008 | if (!index) |
2176 | return -1; |
2009 | return -1; |
|
|
2010 | |
2177 | return altern[RANDOM () % index]; |
2011 | return altern [rndm (index)]; |
2178 | } |
2012 | } |
2179 | |
2013 | |
2180 | /* |
2014 | /* |
2181 | * find_first_free_spot(archetype, maptile, x, y) works like |
2015 | * find_first_free_spot(archetype, maptile, x, y) works like |
2182 | * find_free_spot(), but it will search max number of squares. |
2016 | * find_free_spot(), but it will search max number of squares. |
2183 | * But it will return the first available spot, not a random choice. |
2017 | * But it will return the first available spot, not a random choice. |
2184 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2018 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2185 | */ |
2019 | */ |
2186 | |
|
|
2187 | int |
2020 | int |
2188 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2021 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2189 | { |
2022 | { |
2190 | int |
|
|
2191 | i; |
|
|
2192 | |
|
|
2193 | for (i = 0; i < SIZEOFFREE; i++) |
2023 | for (int i = 0; i < SIZEOFFREE; i++) |
2194 | { |
|
|
2195 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2024 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2196 | return i; |
2025 | return i; |
2197 | } |
2026 | |
2198 | return -1; |
2027 | return -1; |
2199 | } |
2028 | } |
2200 | |
2029 | |
2201 | /* |
2030 | /* |
2202 | * The function permute(arr, begin, end) randomly reorders the array |
2031 | * The function permute(arr, begin, end) randomly reorders the array |
2203 | * arr[begin..end-1]. |
2032 | * arr[begin..end-1]. |
|
|
2033 | * now uses a fisher-yates shuffle, old permute was broken |
2204 | */ |
2034 | */ |
2205 | static void |
2035 | static void |
2206 | permute (int *arr, int begin, int end) |
2036 | permute (int *arr, int begin, int end) |
2207 | { |
2037 | { |
2208 | int |
2038 | arr += begin; |
2209 | i, |
|
|
2210 | j, |
|
|
2211 | tmp, |
|
|
2212 | len; |
|
|
2213 | |
|
|
2214 | len = end - begin; |
2039 | end -= begin; |
2215 | for (i = begin; i < end; i++) |
|
|
2216 | { |
|
|
2217 | j = begin + RANDOM () % len; |
|
|
2218 | |
2040 | |
2219 | tmp = arr[i]; |
2041 | while (--end) |
2220 | arr[i] = arr[j]; |
2042 | swap (arr [end], arr [rndm (end + 1)]); |
2221 | arr[j] = tmp; |
|
|
2222 | } |
|
|
2223 | } |
2043 | } |
2224 | |
2044 | |
2225 | /* new function to make monster searching more efficient, and effective! |
2045 | /* new function to make monster searching more efficient, and effective! |
2226 | * This basically returns a randomized array (in the passed pointer) of |
2046 | * This basically returns a randomized array (in the passed pointer) of |
2227 | * the spaces to find monsters. In this way, it won't always look for |
2047 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2230 | * the 3x3 area will be searched, just not in a predictable order. |
2050 | * the 3x3 area will be searched, just not in a predictable order. |
2231 | */ |
2051 | */ |
2232 | void |
2052 | void |
2233 | get_search_arr (int *search_arr) |
2053 | get_search_arr (int *search_arr) |
2234 | { |
2054 | { |
2235 | int |
2055 | int i; |
2236 | i; |
|
|
2237 | |
2056 | |
2238 | for (i = 0; i < SIZEOFFREE; i++) |
2057 | for (i = 0; i < SIZEOFFREE; i++) |
2239 | { |
|
|
2240 | search_arr[i] = i; |
2058 | search_arr[i] = i; |
2241 | } |
|
|
2242 | |
2059 | |
2243 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2060 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2244 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2061 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2245 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2062 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2246 | } |
2063 | } |
… | |
… | |
2255 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2072 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2256 | * is actually want is going to try and move there. We need this info |
2073 | * is actually want is going to try and move there. We need this info |
2257 | * because we have to know what movement the thing looking to move |
2074 | * because we have to know what movement the thing looking to move |
2258 | * there is capable of. |
2075 | * there is capable of. |
2259 | */ |
2076 | */ |
2260 | |
|
|
2261 | int |
2077 | int |
2262 | find_dir (maptile *m, int x, int y, object *exclude) |
2078 | find_dir (maptile *m, int x, int y, object *exclude) |
2263 | { |
2079 | { |
2264 | int |
|
|
2265 | i, |
|
|
2266 | max = SIZEOFFREE, mflags; |
2080 | int i, max = SIZEOFFREE, mflags; |
2267 | |
2081 | |
2268 | sint16 nx, ny; |
2082 | sint16 nx, ny; |
2269 | object * |
2083 | object *tmp; |
2270 | tmp; |
|
|
2271 | maptile * |
2084 | maptile *mp; |
2272 | mp; |
|
|
2273 | |
2085 | |
2274 | MoveType blocked, move_type; |
2086 | MoveType blocked, move_type; |
2275 | |
2087 | |
2276 | if (exclude && exclude->head) |
2088 | if (exclude && exclude->head) |
2277 | { |
2089 | { |
… | |
… | |
2289 | mp = m; |
2101 | mp = m; |
2290 | nx = x + freearr_x[i]; |
2102 | nx = x + freearr_x[i]; |
2291 | ny = y + freearr_y[i]; |
2103 | ny = y + freearr_y[i]; |
2292 | |
2104 | |
2293 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2105 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
|
|
2106 | |
2294 | if (mflags & P_OUT_OF_MAP) |
2107 | if (mflags & P_OUT_OF_MAP) |
2295 | { |
|
|
2296 | max = maxfree[i]; |
2108 | max = maxfree[i]; |
2297 | } |
|
|
2298 | else |
2109 | else |
2299 | { |
2110 | { |
2300 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2111 | mapspace &ms = mp->at (nx, ny); |
|
|
2112 | |
|
|
2113 | blocked = ms.move_block; |
2301 | |
2114 | |
2302 | if ((move_type & blocked) == move_type) |
2115 | if ((move_type & blocked) == move_type) |
2303 | { |
|
|
2304 | max = maxfree[i]; |
2116 | max = maxfree[i]; |
2305 | } |
|
|
2306 | else if (mflags & P_IS_ALIVE) |
2117 | else if (mflags & P_IS_ALIVE) |
2307 | { |
2118 | { |
2308 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) |
2119 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2309 | { |
2120 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2310 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2121 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2311 | { |
|
|
2312 | break; |
2122 | break; |
2313 | } |
2123 | |
2314 | } |
|
|
2315 | if (tmp) |
2124 | if (tmp) |
2316 | { |
|
|
2317 | return freedir[i]; |
2125 | return freedir[i]; |
2318 | } |
|
|
2319 | } |
2126 | } |
2320 | } |
2127 | } |
2321 | } |
2128 | } |
|
|
2129 | |
2322 | return 0; |
2130 | return 0; |
2323 | } |
2131 | } |
2324 | |
2132 | |
2325 | /* |
2133 | /* |
2326 | * distance(object 1, object 2) will return the square of the |
2134 | * distance(object 1, object 2) will return the square of the |
2327 | * distance between the two given objects. |
2135 | * distance between the two given objects. |
2328 | */ |
2136 | */ |
2329 | |
|
|
2330 | int |
2137 | int |
2331 | distance (const object *ob1, const object *ob2) |
2138 | distance (const object *ob1, const object *ob2) |
2332 | { |
2139 | { |
2333 | int |
|
|
2334 | i; |
|
|
2335 | |
|
|
2336 | i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2140 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2337 | return i; |
|
|
2338 | } |
2141 | } |
2339 | |
2142 | |
2340 | /* |
2143 | /* |
2341 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2144 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2342 | * an object which has subtracted the x and y coordinates of another |
2145 | * an object which has subtracted the x and y coordinates of another |
2343 | * object, needs to travel toward it. |
2146 | * object, needs to travel toward it. |
2344 | */ |
2147 | */ |
2345 | |
|
|
2346 | int |
2148 | int |
2347 | find_dir_2 (int x, int y) |
2149 | find_dir_2 (int x, int y) |
2348 | { |
2150 | { |
2349 | int |
2151 | int q; |
2350 | q; |
|
|
2351 | |
2152 | |
2352 | if (y) |
2153 | if (y) |
2353 | q = x * 100 / y; |
2154 | q = x * 100 / y; |
2354 | else if (x) |
2155 | else if (x) |
2355 | q = -300 * x; |
2156 | q = -300 * x; |
… | |
… | |
2380 | |
2181 | |
2381 | return 3; |
2182 | return 3; |
2382 | } |
2183 | } |
2383 | |
2184 | |
2384 | /* |
2185 | /* |
2385 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2386 | * the "absolute" direction of a number (it actually takes care of |
|
|
2387 | * "overflow" in previous calculations of a direction). |
|
|
2388 | */ |
|
|
2389 | |
|
|
2390 | int |
|
|
2391 | absdir (int d) |
|
|
2392 | { |
|
|
2393 | while (d < 1) |
|
|
2394 | d += 8; |
|
|
2395 | while (d > 8) |
|
|
2396 | d -= 8; |
|
|
2397 | return d; |
|
|
2398 | } |
|
|
2399 | |
|
|
2400 | /* |
|
|
2401 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2186 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2402 | * between two directions (which are expected to be absolute (see absdir()) |
2187 | * between two directions (which are expected to be absolute (see absdir()) |
2403 | */ |
2188 | */ |
2404 | |
|
|
2405 | int |
2189 | int |
2406 | dirdiff (int dir1, int dir2) |
2190 | dirdiff (int dir1, int dir2) |
2407 | { |
2191 | { |
2408 | int |
2192 | int d; |
2409 | d; |
|
|
2410 | |
2193 | |
2411 | d = abs (dir1 - dir2); |
2194 | d = abs (dir1 - dir2); |
2412 | if (d > 4) |
2195 | if (d > 4) |
2413 | d = 8 - d; |
2196 | d = 8 - d; |
|
|
2197 | |
2414 | return d; |
2198 | return d; |
2415 | } |
2199 | } |
2416 | |
2200 | |
2417 | /* peterm: |
2201 | /* peterm: |
2418 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2202 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
… | |
… | |
2421 | * This basically means that if direction is 15, then it could either go |
2205 | * This basically means that if direction is 15, then it could either go |
2422 | * direction 4, 14, or 16 to get back to where we are. |
2206 | * direction 4, 14, or 16 to get back to where we are. |
2423 | * Moved from spell_util.c to object.c with the other related direction |
2207 | * Moved from spell_util.c to object.c with the other related direction |
2424 | * functions. |
2208 | * functions. |
2425 | */ |
2209 | */ |
2426 | |
|
|
2427 | int |
|
|
2428 | reduction_dir[SIZEOFFREE][3] = { |
2210 | int reduction_dir[SIZEOFFREE][3] = { |
2429 | {0, 0, 0}, /* 0 */ |
2211 | {0, 0, 0}, /* 0 */ |
2430 | {0, 0, 0}, /* 1 */ |
2212 | {0, 0, 0}, /* 1 */ |
2431 | {0, 0, 0}, /* 2 */ |
2213 | {0, 0, 0}, /* 2 */ |
2432 | {0, 0, 0}, /* 3 */ |
2214 | {0, 0, 0}, /* 3 */ |
2433 | {0, 0, 0}, /* 4 */ |
2215 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2481 | * find a path to that monster that we found. If not, |
2263 | * find a path to that monster that we found. If not, |
2482 | * we don't bother going toward it. Returns 1 if we |
2264 | * we don't bother going toward it. Returns 1 if we |
2483 | * can see a direct way to get it |
2265 | * can see a direct way to get it |
2484 | * Modified to be map tile aware -.MSW |
2266 | * Modified to be map tile aware -.MSW |
2485 | */ |
2267 | */ |
2486 | |
|
|
2487 | |
|
|
2488 | int |
2268 | int |
2489 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2269 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2490 | { |
2270 | { |
2491 | sint16 dx, dy; |
2271 | sint16 dx, dy; |
2492 | int |
|
|
2493 | mflags; |
2272 | int mflags; |
2494 | |
2273 | |
2495 | if (dir < 0) |
2274 | if (dir < 0) |
2496 | return 0; /* exit condition: invalid direction */ |
2275 | return 0; /* exit condition: invalid direction */ |
2497 | |
2276 | |
2498 | dx = x + freearr_x[dir]; |
2277 | dx = x + freearr_x[dir]; |
… | |
… | |
2511 | return 0; |
2290 | return 0; |
2512 | |
2291 | |
2513 | /* yes, can see. */ |
2292 | /* yes, can see. */ |
2514 | if (dir < 9) |
2293 | if (dir < 9) |
2515 | return 1; |
2294 | return 1; |
|
|
2295 | |
2516 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | |
2296 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2517 | can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2297 | | can_see_monsterP (m, x, y, reduction_dir[dir][1]) |
|
|
2298 | | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2518 | } |
2299 | } |
2519 | |
|
|
2520 | |
|
|
2521 | |
2300 | |
2522 | /* |
2301 | /* |
2523 | * can_pick(picker, item): finds out if an object is possible to be |
2302 | * can_pick(picker, item): finds out if an object is possible to be |
2524 | * picked up by the picker. Returnes 1 if it can be |
2303 | * picked up by the picker. Returnes 1 if it can be |
2525 | * picked up, otherwise 0. |
2304 | * picked up, otherwise 0. |
… | |
… | |
2536 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2315 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2537 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2316 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2538 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2317 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2539 | } |
2318 | } |
2540 | |
2319 | |
2541 | |
|
|
2542 | /* |
2320 | /* |
2543 | * create clone from object to another |
2321 | * create clone from object to another |
2544 | */ |
2322 | */ |
2545 | object * |
2323 | object * |
2546 | object_create_clone (object *asrc) |
2324 | object_create_clone (object *asrc) |
2547 | { |
2325 | { |
2548 | object * |
|
|
2549 | dst = NULL, *tmp, *src, *part, *prev, *item; |
2326 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2550 | |
2327 | |
2551 | if (!asrc) |
2328 | if (!asrc) |
2552 | return NULL; |
2329 | return 0; |
|
|
2330 | |
2553 | src = asrc; |
2331 | src = asrc; |
2554 | if (src->head) |
2332 | if (src->head) |
2555 | src = src->head; |
2333 | src = src->head; |
2556 | |
2334 | |
2557 | prev = NULL; |
2335 | prev = 0; |
2558 | for (part = src; part; part = part->more) |
2336 | for (part = src; part; part = part->more) |
2559 | { |
2337 | { |
2560 | tmp = get_object (); |
2338 | tmp = part->clone (); |
2561 | copy_object (part, tmp); |
|
|
2562 | tmp->x -= src->x; |
2339 | tmp->x -= src->x; |
2563 | tmp->y -= src->y; |
2340 | tmp->y -= src->y; |
|
|
2341 | |
2564 | if (!part->head) |
2342 | if (!part->head) |
2565 | { |
2343 | { |
2566 | dst = tmp; |
2344 | dst = tmp; |
2567 | tmp->head = NULL; |
2345 | tmp->head = 0; |
2568 | } |
2346 | } |
2569 | else |
2347 | else |
2570 | { |
|
|
2571 | tmp->head = dst; |
2348 | tmp->head = dst; |
2572 | } |
2349 | |
2573 | tmp->more = NULL; |
2350 | tmp->more = 0; |
|
|
2351 | |
2574 | if (prev) |
2352 | if (prev) |
2575 | prev->more = tmp; |
2353 | prev->more = tmp; |
|
|
2354 | |
2576 | prev = tmp; |
2355 | prev = tmp; |
2577 | } |
2356 | } |
2578 | |
2357 | |
2579 | for (item = src->inv; item; item = item->below) |
2358 | for (item = src->inv; item; item = item->below) |
2580 | insert_ob_in_ob (object_create_clone (item), dst); |
2359 | insert_ob_in_ob (object_create_clone (item), dst); |
2581 | |
2360 | |
2582 | return dst; |
2361 | return dst; |
2583 | } |
|
|
2584 | |
|
|
2585 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2586 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2587 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2588 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2589 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2590 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2591 | |
|
|
2592 | object * |
|
|
2593 | load_object_str (const char *obstr) |
|
|
2594 | { |
|
|
2595 | object *op; |
|
|
2596 | char filename[MAX_BUF]; |
|
|
2597 | |
|
|
2598 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2599 | |
|
|
2600 | FILE *tempfile = fopen (filename, "w"); |
|
|
2601 | |
|
|
2602 | if (tempfile == NULL) |
|
|
2603 | { |
|
|
2604 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2605 | return NULL; |
|
|
2606 | } |
|
|
2607 | |
|
|
2608 | fprintf (tempfile, obstr); |
|
|
2609 | fclose (tempfile); |
|
|
2610 | |
|
|
2611 | op = get_object (); |
|
|
2612 | |
|
|
2613 | object_thawer thawer (filename); |
|
|
2614 | |
|
|
2615 | if (thawer) |
|
|
2616 | load_object (thawer, op, 0); |
|
|
2617 | |
|
|
2618 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2619 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2620 | |
|
|
2621 | return op; |
|
|
2622 | } |
2362 | } |
2623 | |
2363 | |
2624 | /* This returns the first object in who's inventory that |
2364 | /* This returns the first object in who's inventory that |
2625 | * has the same type and subtype match. |
2365 | * has the same type and subtype match. |
2626 | * returns NULL if no match. |
2366 | * returns NULL if no match. |
2627 | */ |
2367 | */ |
2628 | object * |
2368 | object * |
2629 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2369 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2630 | { |
2370 | { |
2631 | object *tmp; |
|
|
2632 | |
|
|
2633 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2371 | for (object *tmp = who->inv; tmp; tmp = tmp->below) |
2634 | if (tmp->type == type && tmp->subtype == subtype) |
2372 | if (tmp->type == type && tmp->subtype == subtype) |
2635 | return tmp; |
2373 | return tmp; |
2636 | |
2374 | |
2637 | return NULL; |
2375 | return 0; |
2638 | } |
2376 | } |
2639 | |
2377 | |
2640 | /* If ob has a field named key, return the link from the list, |
2378 | /* If ob has a field named key, return the link from the list, |
2641 | * otherwise return NULL. |
2379 | * otherwise return NULL. |
2642 | * |
2380 | * |
… | |
… | |
2644 | * do the desired thing. |
2382 | * do the desired thing. |
2645 | */ |
2383 | */ |
2646 | key_value * |
2384 | key_value * |
2647 | get_ob_key_link (const object *ob, const char *key) |
2385 | get_ob_key_link (const object *ob, const char *key) |
2648 | { |
2386 | { |
2649 | key_value *link; |
|
|
2650 | |
|
|
2651 | for (link = ob->key_values; link != NULL; link = link->next) |
2387 | for (key_value *link = ob->key_values; link; link = link->next) |
2652 | if (link->key == key) |
2388 | if (link->key == key) |
2653 | return link; |
2389 | return link; |
2654 | |
2390 | |
2655 | return NULL; |
2391 | return 0; |
2656 | } |
2392 | } |
2657 | |
2393 | |
2658 | /* |
2394 | /* |
2659 | * Returns the value of op has an extra_field for key, or NULL. |
2395 | * Returns the value of op has an extra_field for key, or NULL. |
2660 | * |
2396 | * |
… | |
… | |
2685 | if (link->key == canonical_key) |
2421 | if (link->key == canonical_key) |
2686 | return link->value; |
2422 | return link->value; |
2687 | |
2423 | |
2688 | return 0; |
2424 | return 0; |
2689 | } |
2425 | } |
2690 | |
|
|
2691 | |
2426 | |
2692 | /* |
2427 | /* |
2693 | * Updates the canonical_key in op to value. |
2428 | * Updates the canonical_key in op to value. |
2694 | * |
2429 | * |
2695 | * canonical_key is a shared string (value doesn't have to be). |
2430 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2700 | * Returns TRUE on success. |
2435 | * Returns TRUE on success. |
2701 | */ |
2436 | */ |
2702 | int |
2437 | int |
2703 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2438 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2704 | { |
2439 | { |
2705 | key_value * |
|
|
2706 | field = NULL, *last = NULL; |
2440 | key_value *field = NULL, *last = NULL; |
2707 | |
2441 | |
2708 | for (field = op->key_values; field != NULL; field = field->next) |
2442 | for (field = op->key_values; field != NULL; field = field->next) |
2709 | { |
2443 | { |
2710 | if (field->key != canonical_key) |
2444 | if (field->key != canonical_key) |
2711 | { |
2445 | { |
… | |
… | |
2739 | /* IF we get here, key doesn't exist */ |
2473 | /* IF we get here, key doesn't exist */ |
2740 | |
2474 | |
2741 | /* No field, we'll have to add it. */ |
2475 | /* No field, we'll have to add it. */ |
2742 | |
2476 | |
2743 | if (!add_key) |
2477 | if (!add_key) |
2744 | { |
|
|
2745 | return FALSE; |
2478 | return FALSE; |
2746 | } |
2479 | |
2747 | /* There isn't any good reason to store a null |
2480 | /* There isn't any good reason to store a null |
2748 | * value in the key/value list. If the archetype has |
2481 | * value in the key/value list. If the archetype has |
2749 | * this key, then we should also have it, so shouldn't |
2482 | * this key, then we should also have it, so shouldn't |
2750 | * be here. If user wants to store empty strings, |
2483 | * be here. If user wants to store empty strings, |
2751 | * should pass in "" |
2484 | * should pass in "" |
… | |
… | |
2800 | } |
2533 | } |
2801 | else |
2534 | else |
2802 | item = item->env; |
2535 | item = item->env; |
2803 | } |
2536 | } |
2804 | |
2537 | |
|
|
2538 | |
|
|
2539 | const char * |
|
|
2540 | object::flag_desc (char *desc, int len) const |
|
|
2541 | { |
|
|
2542 | char *p = desc; |
|
|
2543 | bool first = true; |
|
|
2544 | |
|
|
2545 | *p = 0; |
|
|
2546 | |
|
|
2547 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2548 | { |
|
|
2549 | if (len <= 10) // magic constant! |
|
|
2550 | { |
|
|
2551 | snprintf (p, len, ",..."); |
|
|
2552 | break; |
|
|
2553 | } |
|
|
2554 | |
|
|
2555 | if (flag [i]) |
|
|
2556 | { |
|
|
2557 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2558 | len -= cnt; |
|
|
2559 | p += cnt; |
|
|
2560 | first = false; |
|
|
2561 | } |
|
|
2562 | } |
|
|
2563 | |
|
|
2564 | return desc; |
|
|
2565 | } |
|
|
2566 | |
2805 | // return a suitable string describing an objetc in enough detail to find it |
2567 | // return a suitable string describing an object in enough detail to find it |
2806 | const char * |
2568 | const char * |
2807 | object::debug_desc (char *info) const |
2569 | object::debug_desc (char *info) const |
2808 | { |
2570 | { |
|
|
2571 | char flagdesc[512]; |
2809 | char info2[256 * 3]; |
2572 | char info2[256 * 4]; |
2810 | char *p = info; |
2573 | char *p = info; |
2811 | |
2574 | |
2812 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2575 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2813 | count, |
2576 | count, uuid.seq, |
2814 | &name, |
2577 | &name, |
2815 | title ? " " : "", |
2578 | title ? "\",title:\"" : "", |
2816 | title ? (const char *)title : ""); |
2579 | title ? (const char *)title : "", |
|
|
2580 | flag_desc (flagdesc, 512), type); |
2817 | |
2581 | |
2818 | if (env) |
2582 | if (env) |
2819 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2583 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2820 | |
2584 | |
2821 | if (map) |
2585 | if (map) |
2822 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2586 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2823 | |
2587 | |
2824 | return info; |
2588 | return info; |
2825 | } |
2589 | } |
2826 | |
2590 | |
2827 | const char * |
2591 | const char * |
2828 | object::debug_desc () const |
2592 | object::debug_desc () const |
2829 | { |
2593 | { |
2830 | static char info[256 * 3]; |
2594 | static char info[256 * 4]; |
2831 | return debug_desc (info); |
2595 | return debug_desc (info); |
2832 | } |
2596 | } |
2833 | |
2597 | |
|
|
2598 | const char * |
|
|
2599 | object::debug_desc2 () const |
|
|
2600 | { |
|
|
2601 | static char info[256 * 4]; |
|
|
2602 | return debug_desc (info); |
|
|
2603 | } |
|
|
2604 | |
|
|
2605 | struct region * |
|
|
2606 | object::region () const |
|
|
2607 | { |
|
|
2608 | return map ? map->region (x, y) |
|
|
2609 | : region::default_region (); |
|
|
2610 | } |
|
|
2611 | |
|
|
2612 | const materialtype_t * |
|
|
2613 | object::dominant_material () const |
|
|
2614 | { |
|
|
2615 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2616 | return mat; |
|
|
2617 | |
|
|
2618 | // omfg this is slow, this has to be temporary :) |
|
|
2619 | shstr unknown ("unknown"); |
|
|
2620 | |
|
|
2621 | return name_to_material (unknown); |
|
|
2622 | } |
|
|
2623 | |
|
|
2624 | void |
|
|
2625 | object::open_container (object *new_container) |
|
|
2626 | { |
|
|
2627 | if (container == new_container) |
|
|
2628 | return; |
|
|
2629 | |
|
|
2630 | if (object *old_container = container) |
|
|
2631 | { |
|
|
2632 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2633 | return; |
|
|
2634 | |
|
|
2635 | #if 0 |
|
|
2636 | // remove the "Close old_container" object. |
|
|
2637 | if (object *closer = old_container->inv) |
|
|
2638 | if (closer->type == CLOSE_CON) |
|
|
2639 | closer->destroy (); |
|
|
2640 | #endif |
|
|
2641 | |
|
|
2642 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2643 | container = 0; |
|
|
2644 | |
|
|
2645 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2646 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2647 | } |
|
|
2648 | |
|
|
2649 | if (new_container) |
|
|
2650 | { |
|
|
2651 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2652 | return; |
|
|
2653 | |
|
|
2654 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2655 | #if 0 |
|
|
2656 | // insert the "Close Container" object. |
|
|
2657 | if (archetype *closer = new_container->other_arch) |
|
|
2658 | { |
|
|
2659 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2660 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2661 | new_container->insert (closer); |
|
|
2662 | } |
|
|
2663 | #endif |
|
|
2664 | |
|
|
2665 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2666 | |
|
|
2667 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2668 | container = new_container; |
|
|
2669 | |
|
|
2670 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2671 | esrv_send_inventory (this, new_container); |
|
|
2672 | } |
|
|
2673 | } |
|
|
2674 | |
|
|
2675 | |