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