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