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