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