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