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