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