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.12 by elmex, Sun Sep 3 14:33:47 2006 UTC vs.
Revision 1.37 by root, Tue Sep 12 20:55:40 2006 UTC

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

Diff Legend

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