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.7 by root, Tue Aug 29 05:03:54 2006 UTC vs.
Revision 1.24 by root, Sun Sep 10 16:00:23 2006 UTC

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

Diff Legend

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