ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.30 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.140 by root, Tue Apr 24 12:32:14 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines