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