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

Diff Legend

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