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