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