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