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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
|
|
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001 Mark Wedel |
6 | * Copyright (©) 2001 Mark Wedel |
6 | * Copyright (C) 1992 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * This program is free software; you can redistribute it and/or modify |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation; either version 2 of the License, or |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program; if not, write to the Free Software |
|
|
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
18 | * |
22 | * The author can be reached via e-mail to <crossfire@schmorp.de> |
19 | * You should have received a copy of the Affero GNU General Public License |
|
|
20 | * and the GNU General Public License along with this program. If not, see |
|
|
21 | * <http://www.gnu.org/licenses/>. |
23 | */ |
22 | * |
|
|
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
24 | */ |
|
|
25 | |
|
|
26 | //+GPL |
24 | |
27 | |
25 | /** |
28 | /** |
26 | * \file |
29 | * \file |
27 | * Client handling. |
30 | * Client handling. |
28 | * |
31 | * |
29 | * \date 2003-12-02 |
32 | * \date 2003-12-02 |
30 | * |
33 | * |
31 | * This file implements all of the goo on the server side for handling |
34 | * This file implements all of the goo on the server side for handling |
32 | * clients. It's got a bunch of global variables for keeping track of |
35 | * clients. It's got a bunch of global variables for keeping track of |
33 | * each of the clients. |
36 | * each of the clients. |
34 | * |
37 | * |
35 | * Note: All functions that are used to process data from the client |
38 | * Note: All functions that are used to process data from the client |
36 | * have the prototype of (char *data, int datalen, int client_num). This |
39 | * have the prototype of (char *data, int datalen, int client_num). This |
37 | * way, we can use one dispatch table. |
40 | * way, we can use one dispatch table. |
38 | * |
41 | * |
… | |
… | |
42 | |
45 | |
43 | #include <global.h> |
46 | #include <global.h> |
44 | #include <sproto.h> |
47 | #include <sproto.h> |
45 | |
48 | |
46 | #include <living.h> |
49 | #include <living.h> |
47 | #include <commands.h> |
|
|
48 | |
50 | |
49 | /* This block is basically taken from socket.c - I assume if it works there, |
51 | /* This block is basically taken from socket.c - I assume if it works there, |
50 | * it should work here. |
52 | * it should work here. |
51 | */ |
53 | */ |
52 | #include <sys/types.h> |
54 | #include <sys/types.h> |
… | |
… | |
64 | * This table translates the attack numbers as used within the |
66 | * This table translates the attack numbers as used within the |
65 | * program to the value we use when sending STATS command to the |
67 | * program to the value we use when sending STATS command to the |
66 | * client. If a value is -1, then we don't send that to the |
68 | * client. If a value is -1, then we don't send that to the |
67 | * client. |
69 | * client. |
68 | */ |
70 | */ |
69 | short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
71 | static short atnr_cs_stat[NROFATTACKS] = |
70 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
72 | { |
71 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
73 | CS_STAT_RES_PHYS, |
72 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
74 | CS_STAT_RES_MAG, |
73 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
75 | CS_STAT_RES_FIRE, |
74 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
76 | CS_STAT_RES_ELEC, |
75 | CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
77 | CS_STAT_RES_COLD, |
76 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
78 | CS_STAT_RES_CONF, |
77 | -1 /* Chaos */ , -1 /* Counterspell */ , |
79 | CS_STAT_RES_ACID, |
78 | -1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
80 | CS_STAT_RES_DRAIN, |
|
|
81 | -1 /* weaponmagic */, |
|
|
82 | CS_STAT_RES_GHOSTHIT, |
|
|
83 | CS_STAT_RES_POISON, |
|
|
84 | CS_STAT_RES_SLOW, |
|
|
85 | CS_STAT_RES_PARA, |
|
|
86 | CS_STAT_TURN_UNDEAD, |
|
|
87 | CS_STAT_RES_FEAR, |
|
|
88 | -1 /* Cancellation */, |
|
|
89 | CS_STAT_RES_DEPLETE, |
|
|
90 | CS_STAT_RES_DEATH, |
|
|
91 | -1 /* Chaos */, |
|
|
92 | -1 /* Counterspell */, |
|
|
93 | -1 /* Godpower */, |
|
|
94 | CS_STAT_RES_HOLYWORD, |
79 | CS_STAT_RES_BLIND, |
95 | CS_STAT_RES_BLIND, |
80 | -1, /* Internal */ |
96 | -1, /* Internal */ |
81 | -1, /* life stealing */ |
97 | -1, /* life stealing */ |
82 | -1 /* Disease - not fully done yet */ |
98 | -1 /* Disease - not fully done yet */ |
83 | }; |
99 | }; |
… | |
… | |
99 | */ |
115 | */ |
100 | mx = ns->mapx; |
116 | mx = ns->mapx; |
101 | my = ns->mapy; |
117 | my = ns->mapy; |
102 | |
118 | |
103 | /* the x and y here are coordinates for the new map, i.e. if we moved |
119 | /* the x and y here are coordinates for the new map, i.e. if we moved |
104 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
120 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
105 | * if the destination x or y coordinate is outside the viewable |
121 | * if the destination x or y coordinate is outside the viewable |
106 | * area, we clear the values - otherwise, the old values |
122 | * area, we clear the values - otherwise, the old values |
107 | * are preserved, and the check_head thinks it needs to clear them. |
123 | * are preserved, and the check_head thinks it needs to clear them. |
108 | */ |
124 | */ |
109 | for (x = 0; x < mx; x++) |
125 | for (x = 0; x < mx; x++) |
110 | { |
|
|
111 | for (y = 0; y < my; y++) |
126 | for (y = 0; y < my; y++) |
112 | { |
|
|
113 | if (x >= ns->mapx || y >= ns->mapy) |
127 | if (x >= ns->mapx || y >= ns->mapy) |
114 | /* clear cells outside the viewable area */ |
128 | /* clear cells outside the viewable area */ |
115 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
129 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
116 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
130 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
117 | /* clear newly visible tiles within the viewable area */ |
131 | /* clear newly visible tiles within the viewable area */ |
118 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
132 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
119 | else |
133 | else |
120 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
134 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
121 | } |
|
|
122 | } |
|
|
123 | |
135 | |
124 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
136 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
125 | |
137 | |
126 | /* Make sure that the next "map1" command will be sent (even if it is |
138 | /* Make sure that the next "map1" command will be sent (even if it is |
127 | * empty). |
139 | * empty). |
… | |
… | |
130 | } |
142 | } |
131 | |
143 | |
132 | static void |
144 | static void |
133 | clear_map (player *pl) |
145 | clear_map (player *pl) |
134 | { |
146 | { |
|
|
147 | pl->ns->mapinfo_queue_clear (); |
|
|
148 | |
135 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
149 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
136 | |
150 | |
137 | pl->ns->force_newmap = false; |
151 | pl->ns->force_newmap = false; |
138 | |
|
|
139 | if (pl->ns->newmapcmd == 1) |
|
|
140 | pl->ns->send_packet ("newmap"); |
152 | pl->ns->send_packet ("newmap"); |
141 | |
|
|
142 | pl->ns->floorbox_reset (); |
153 | pl->ns->floorbox_reset (); |
|
|
154 | } |
|
|
155 | |
|
|
156 | static void |
|
|
157 | send_map_info (player *pl) |
|
|
158 | { |
|
|
159 | client &socket = *pl->ns; |
|
|
160 | object *ob = pl->viewpoint; |
|
|
161 | |
|
|
162 | if (socket.mapinfocmd) |
|
|
163 | { |
|
|
164 | if (ob->map && ob->map->path) |
|
|
165 | { |
|
|
166 | int flags = 0; |
|
|
167 | |
|
|
168 | // due to historical glitches, the bit ordering and map index ordering differs |
|
|
169 | if (ob->map->tile_path [TILE_NORTH]) flags |= 0x01; |
|
|
170 | if (ob->map->tile_path [TILE_EAST ]) flags |= 0x02; |
|
|
171 | if (ob->map->tile_path [TILE_SOUTH]) flags |= 0x04; |
|
|
172 | if (ob->map->tile_path [TILE_WEST ]) flags |= 0x08; |
|
|
173 | // these two are debatable |
|
|
174 | if (ob->map->tile_path [TILE_UP ]) flags |= 0x10; |
|
|
175 | if (ob->map->tile_path [TILE_DOWN ]) flags |= 0x20; |
|
|
176 | |
|
|
177 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
178 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
179 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
180 | } |
|
|
181 | else |
|
|
182 | socket.send_packet ("mapinfo current"); |
|
|
183 | } |
143 | } |
184 | } |
144 | |
185 | |
145 | /** check for map/region change and send new map data */ |
186 | /** check for map/region change and send new map data */ |
146 | static void |
187 | static void |
147 | check_map_change (player *pl) |
188 | check_map_change (player *pl) |
148 | { |
189 | { |
149 | client &socket = *pl->ns; |
190 | client &socket = *pl->ns; |
150 | object *ob = pl->ob; |
191 | object *ob = pl->viewpoint; |
151 | char buf[MAX_BUF]; /* eauugggh */ |
192 | |
|
|
193 | region *reg = ob->region (); |
|
|
194 | if (socket.current_region != reg) |
|
|
195 | { |
|
|
196 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
197 | socket.current_region = reg; |
|
|
198 | } |
|
|
199 | |
|
|
200 | // first try to avoid a full newmap on tiled map scrolls |
|
|
201 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
202 | { |
|
|
203 | rv_vector rv; |
|
|
204 | |
|
|
205 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
206 | |
|
|
207 | // manhattan distance is very handy here |
|
|
208 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
209 | { |
|
|
210 | socket.current_map = ob->map; |
|
|
211 | socket.current_x = ob->x; |
|
|
212 | socket.current_y = ob->y; |
|
|
213 | |
|
|
214 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
215 | socket.floorbox_reset (); |
|
|
216 | send_map_info (pl); |
|
|
217 | } |
|
|
218 | } |
152 | |
219 | |
153 | if (socket.current_map != ob->map || socket.force_newmap) |
220 | if (socket.current_map != ob->map || socket.force_newmap) |
154 | { |
221 | { |
155 | clear_map (pl); |
222 | clear_map (pl); |
156 | socket.current_map = ob->map; |
223 | socket.current_map = ob->map; |
157 | |
224 | send_map_info (pl); |
158 | if (socket.mapinfocmd) |
|
|
159 | { |
|
|
160 | if (ob->map && ob->map->path[0]) |
|
|
161 | { |
|
|
162 | int flags = 0; |
|
|
163 | |
|
|
164 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
165 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
166 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
167 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
168 | |
|
|
169 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
|
|
170 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, ob->map->width, ob->map->height, &ob->map->path); |
|
|
171 | } |
|
|
172 | else |
|
|
173 | snprintf (buf, MAX_BUF, "mapinfo current"); |
|
|
174 | |
|
|
175 | socket.send_packet (buf); |
|
|
176 | } |
|
|
177 | } |
225 | } |
178 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
226 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
179 | { |
227 | { |
180 | int dx = ob->x - socket.current_x; |
228 | int dx = ob->x - socket.current_x; |
181 | int dy = ob->y - socket.current_y; |
229 | int dy = ob->y - socket.current_y; |
182 | |
230 | |
183 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
|
|
184 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
|
|
185 | else |
|
|
186 | { |
|
|
187 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
231 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
188 | socket.floorbox_reset (); |
232 | socket.floorbox_reset (); |
189 | } |
|
|
190 | } |
233 | } |
191 | |
234 | |
192 | socket.current_x = ob->x; |
235 | socket.current_x = ob->x; |
193 | socket.current_y = ob->y; |
236 | socket.current_y = ob->y; |
|
|
237 | } |
194 | |
238 | |
195 | region *reg = ob->region (); |
239 | /** |
196 | if (socket.current_region != reg) |
240 | * This sends the skill number to name mapping. We ignore |
197 | { |
241 | * the params - we always send the same info no matter what. |
198 | socket.current_region = reg; |
242 | */ |
199 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
243 | static void |
200 | } |
244 | send_skill_info (client *ns, char *params) |
|
|
245 | { |
|
|
246 | packet sl; |
|
|
247 | sl << "replyinfo skill_info\n"; |
|
|
248 | |
|
|
249 | for (int i = 0; i < skillvec.size (); ++i) |
|
|
250 | sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name); |
|
|
251 | |
|
|
252 | if (sl.length () > MAXSOCKBUF) |
|
|
253 | cleanup ("buffer overflow in send_skill_info!"); |
|
|
254 | |
|
|
255 | ns->send_packet (sl); |
|
|
256 | } |
|
|
257 | |
|
|
258 | /** |
|
|
259 | * This sends the spell path to name mapping. We ignore |
|
|
260 | * the params - we always send the same info no matter what. |
|
|
261 | */ |
|
|
262 | static void |
|
|
263 | send_spell_paths (client * ns, char *params) |
|
|
264 | { |
|
|
265 | packet sl; |
|
|
266 | |
|
|
267 | sl << "replyinfo spell_paths\n"; |
|
|
268 | |
|
|
269 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
270 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
271 | |
|
|
272 | if (sl.length () > MAXSOCKBUF) |
|
|
273 | cleanup ("buffer overflow in send_spell_paths!"); |
|
|
274 | |
|
|
275 | ns->send_packet (sl); |
201 | } |
276 | } |
202 | |
277 | |
203 | /** |
278 | /** |
204 | * RequestInfo is sort of a meta command. There is some specific |
279 | * RequestInfo is sort of a meta command. There is some specific |
205 | * request of information, but we call other functions to provide |
280 | * request of information, but we call other functions to provide |
206 | * that information. |
281 | * that information. |
|
|
282 | * requestinfo is completely deprecated, use resource exti request |
|
|
283 | * and the fxix or http protocols. |
207 | */ |
284 | */ |
208 | void |
285 | void |
209 | RequestInfo (char *buf, int len, client * ns) |
286 | RequestInfo (char *buf, int len, client *ns) |
210 | { |
287 | { |
211 | char *params = NULL, *cp; |
288 | char *params; |
212 | |
|
|
213 | /* No match */ |
|
|
214 | char bigbuf[MAX_BUF]; |
|
|
215 | int slen; |
|
|
216 | |
|
|
217 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
218 | * if we don't find a match. |
|
|
219 | */ |
|
|
220 | strcpy (bigbuf, "replyinfo "); |
|
|
221 | slen = strlen (bigbuf); |
|
|
222 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
223 | |
289 | |
224 | /* find the first space, make it null, and update the |
290 | /* find the first space, make it null, and update the |
225 | * params pointer. |
291 | * params pointer. |
226 | */ |
292 | */ |
227 | for (cp = buf; *cp != '\0'; cp++) |
293 | for (params = buf; *params; params++) |
228 | if (*cp == ' ') |
294 | if (*params == ' ') |
229 | { |
295 | { |
230 | *cp = '\0'; |
|
|
231 | params = cp + 1; |
296 | *params++ = 0; |
232 | break; |
297 | break; |
233 | } |
298 | } |
234 | |
299 | |
235 | if (!strcmp (buf, "image_info")) |
|
|
236 | send_image_info (ns, params); |
|
|
237 | else if (!strcmp (buf, "image_sums")) |
|
|
238 | send_image_sums (ns, params); |
|
|
239 | else if (!strcmp (buf, "skill_info")) |
300 | if (!strcmp (buf, "skill_info")) |
240 | send_skill_info (ns, params); |
301 | send_skill_info (ns, params); |
241 | else if (!strcmp (buf, "spell_paths")) |
302 | else if (!strcmp (buf, "spell_paths")) |
242 | send_spell_paths (ns, params); |
303 | send_spell_paths (ns, params); |
243 | else |
304 | else |
244 | ns->send_packet (bigbuf, len); |
305 | { |
|
|
306 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
307 | if (*params) |
|
|
308 | *--params = ' '; |
|
|
309 | |
|
|
310 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
311 | } |
245 | } |
312 | } |
246 | |
313 | |
247 | void |
314 | void |
248 | ExtCmd (char *buf, int len, player *pl) |
315 | ExtCmd (char *buf, int len, player *pl) |
249 | { |
316 | { |
… | |
… | |
252 | |
319 | |
253 | void |
320 | void |
254 | ExtiCmd (char *buf, int len, client *ns) |
321 | ExtiCmd (char *buf, int len, client *ns) |
255 | { |
322 | { |
256 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
323 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
324 | } |
|
|
325 | |
|
|
326 | //-GPL |
|
|
327 | |
|
|
328 | void |
|
|
329 | client::mapinfo_queue_clear () |
|
|
330 | { |
|
|
331 | for (auto &&i : mapinfo_queue) |
|
|
332 | free (i); |
|
|
333 | |
|
|
334 | mapinfo_queue.clear (); |
|
|
335 | } |
|
|
336 | |
|
|
337 | bool |
|
|
338 | client::mapinfo_try (char *buf) |
|
|
339 | { |
|
|
340 | char *token = buf; |
|
|
341 | buf += strlen (buf) + 9; |
|
|
342 | |
|
|
343 | // initial map and its origin |
|
|
344 | maptile *map = pl->viewpoint->map; |
|
|
345 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
|
|
346 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
|
|
347 | int max_distance = 8; // limit maximum path length to something generous |
|
|
348 | |
|
|
349 | while (*buf && map && max_distance) |
|
|
350 | { |
|
|
351 | int dir = *buf++ - '1'; |
|
|
352 | |
|
|
353 | // due to historical glitches, the mapinfo index and tile index differs |
|
|
354 | static unsigned char dirmap [] = { TILE_NORTH, TILE_EAST, TILE_SOUTH, TILE_WEST, TILE_UP, TILE_DOWN }; |
|
|
355 | |
|
|
356 | // maybe we should only allow the four flat directions |
|
|
357 | if (IN_RANGE_EXC (dir, 0, ecb_array_length (dirmap))) |
|
|
358 | { |
|
|
359 | dir = dirmap [dir]; |
|
|
360 | |
|
|
361 | if (!map->tile_path [dir]) |
|
|
362 | map = 0; |
|
|
363 | else if (map->tile_available (dir, false)) |
|
|
364 | { |
|
|
365 | maptile *neigh = map->tile_map [dir]; |
|
|
366 | |
|
|
367 | switch (dir) |
|
|
368 | { |
|
|
369 | case 0: mapy -= neigh->height; break; |
|
|
370 | case 2: mapy += map ->height; break; |
|
|
371 | case 3: mapx -= neigh->width ; break; |
|
|
372 | case 1: mapx += map ->width ; break; |
|
|
373 | } |
|
|
374 | |
|
|
375 | map = neigh; |
|
|
376 | --max_distance; |
|
|
377 | } |
|
|
378 | else |
|
|
379 | return 0; |
|
|
380 | } |
|
|
381 | else |
|
|
382 | max_distance = 0; |
|
|
383 | } |
|
|
384 | |
|
|
385 | if (!max_distance) |
|
|
386 | send_packet_printf ("mapinfo %s error", token); |
|
|
387 | else if (!map || !map->path) |
|
|
388 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
389 | else |
|
|
390 | { |
|
|
391 | int flags = 0; |
|
|
392 | |
|
|
393 | // due to historical glitches, the bit ordering and map index ordering differs |
|
|
394 | if (map->tile_path [TILE_NORTH]) flags |= 0x01; |
|
|
395 | if (map->tile_path [TILE_EAST ]) flags |= 0x02; |
|
|
396 | if (map->tile_path [TILE_SOUTH]) flags |= 0x04; |
|
|
397 | if (map->tile_path [TILE_WEST ]) flags |= 0x08; |
|
|
398 | // these two are debatable |
|
|
399 | if (map->tile_path [TILE_UP ]) flags |= 0x10; |
|
|
400 | if (map->tile_path [TILE_DOWN ]) flags |= 0x20; |
|
|
401 | |
|
|
402 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
403 | } |
|
|
404 | |
|
|
405 | return 1; |
|
|
406 | } |
|
|
407 | |
|
|
408 | void |
|
|
409 | client::mapinfo_queue_run () |
|
|
410 | { |
|
|
411 | if (mapinfo_queue.empty () || !pl) |
|
|
412 | return; |
|
|
413 | |
|
|
414 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
415 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
416 | { |
|
|
417 | free (mapinfo_queue [i]); |
|
|
418 | mapinfo_queue.erase (i); |
|
|
419 | } |
|
|
420 | else |
|
|
421 | ++i; |
257 | } |
422 | } |
258 | |
423 | |
259 | void |
424 | void |
260 | MapInfoCmd (char *buf, int len, player *pl) |
425 | MapInfoCmd (char *buf, int len, player *pl) |
261 | { |
426 | { |
262 | // <mapinfo tag spatial tile-path |
427 | // <mapinfo tag spatial tile-path |
263 | // >mapinfo tag spatial flags x y w h hash |
428 | // >mapinfo tag spatial flags x y w h hash |
264 | |
429 | |
265 | char bigbuf[MAX_BUF], *token; |
|
|
266 | |
|
|
267 | token = buf; |
430 | char *token = buf; |
268 | // copy token |
431 | |
269 | if (!(buf = strchr (buf, ' '))) |
432 | if (!(buf = strchr (buf, ' '))) |
270 | return; |
433 | return; |
271 | |
434 | |
272 | *buf++ = 0; |
|
|
273 | |
|
|
274 | if (!strncmp (buf, "spatial ", 8)) |
435 | if (!strncmp (buf, " spatial ", 9)) |
275 | { |
436 | { |
276 | buf += 8; |
437 | char *copy = strdup (token); |
|
|
438 | copy [buf - token] = 0; |
277 | |
439 | |
278 | // initial map and its origin |
440 | #if 0 |
279 | maptile *map = pl->ob->map; |
441 | // this makes only sense when we flush the buffer immediately |
280 | sint16 dx, dy; |
442 | if (pl->ns->mapinfo_try (copy)) |
281 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
443 | free (copy); |
282 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
283 | int max_distance = 8; // limit maximum path length to something generous |
|
|
284 | |
|
|
285 | while (*buf && map && max_distance) |
|
|
286 | { |
|
|
287 | int dir = *buf++; |
|
|
288 | |
|
|
289 | switch (dir) |
|
|
290 | { |
|
|
291 | case '1': |
|
|
292 | dx = 0; |
|
|
293 | dy = -1; |
|
|
294 | map = map->xy_find (dx, dy); |
|
|
295 | map && (mapy -= map->height); |
|
|
296 | break; |
|
|
297 | case '2': |
|
|
298 | mapx += map->width; |
|
|
299 | dx = map->width; |
|
|
300 | dy = 0; |
|
|
301 | map = map->xy_find (dx, dy); |
|
|
302 | break; |
|
|
303 | case '3': |
|
|
304 | mapy += map->height; |
|
|
305 | dx = 0; |
|
|
306 | dy = map->height; |
|
|
307 | map = map->xy_find (dx, dy); |
|
|
308 | break; |
|
|
309 | case '4': |
|
|
310 | dx = -1; |
|
|
311 | dy = 0; |
|
|
312 | map = map->xy_find (dx, dy); |
|
|
313 | map && (mapx -= map->width); |
|
|
314 | break; |
|
|
315 | } |
|
|
316 | |
|
|
317 | --max_distance; |
|
|
318 | } |
|
|
319 | |
|
|
320 | if (!max_distance) |
|
|
321 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
322 | else if (map && map->path[0]) |
|
|
323 | { |
|
|
324 | int flags = 0; |
|
|
325 | |
|
|
326 | if (map->tile_path[0]) flags |= 1; |
|
|
327 | if (map->tile_path[1]) flags |= 2; |
|
|
328 | if (map->tile_path[2]) flags |= 4; |
|
|
329 | if (map->tile_path[3]) flags |= 8; |
|
|
330 | |
|
|
331 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
332 | } |
|
|
333 | else |
444 | else |
334 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
445 | #endif |
|
|
446 | pl->ns->mapinfo_queue.push_back (copy); |
335 | } |
447 | } |
336 | else |
448 | else |
337 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
449 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
338 | |
|
|
339 | pl->ns->send_packet (bigbuf); |
|
|
340 | } |
450 | } |
341 | |
451 | |
342 | /** This is the Setup cmd */ |
452 | /** This is the Setup cmd */ |
343 | void |
453 | void |
344 | SetUp (char *buf, int len, client * ns) |
454 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
356 | AddMeCmd (char *buf, int len, client *ns) |
466 | AddMeCmd (char *buf, int len, client *ns) |
357 | { |
467 | { |
358 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
468 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
359 | } |
469 | } |
360 | |
470 | |
361 | /** Reply to ExtendedInfos command */ |
471 | //+GPL |
362 | void |
|
|
363 | ToggleExtendedInfos (char *buf, int len, client * ns) |
|
|
364 | { |
|
|
365 | char cmdback[MAX_BUF]; |
|
|
366 | char command[50]; |
|
|
367 | int info, nextinfo; |
|
|
368 | |
|
|
369 | cmdback[0] = '\0'; |
|
|
370 | nextinfo = 0; |
|
|
371 | |
|
|
372 | while (1) |
|
|
373 | { |
|
|
374 | /* 1. Extract an info */ |
|
|
375 | info = nextinfo; |
|
|
376 | |
|
|
377 | while ((info < len) && (buf[info] == ' ')) |
|
|
378 | info++; |
|
|
379 | |
|
|
380 | if (info >= len) |
|
|
381 | break; |
|
|
382 | |
|
|
383 | nextinfo = info + 1; |
|
|
384 | |
|
|
385 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
386 | nextinfo++; |
|
|
387 | |
|
|
388 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
389 | continue; |
|
|
390 | |
|
|
391 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
392 | |
|
|
393 | /* 2. Interpret info */ |
|
|
394 | if (!strcmp ("smooth", command)) |
|
|
395 | /* Toggle smoothing */ |
|
|
396 | ns->EMI_smooth = !ns->EMI_smooth; |
|
|
397 | else |
|
|
398 | /*bad value */; |
|
|
399 | |
|
|
400 | /*3. Next info */ |
|
|
401 | } |
|
|
402 | |
|
|
403 | strcpy (cmdback, "ExtendedInfoSet"); |
|
|
404 | |
|
|
405 | if (ns->EMI_smooth) |
|
|
406 | { |
|
|
407 | strcat (cmdback, " "); |
|
|
408 | strcat (cmdback, "smoothing"); |
|
|
409 | } |
|
|
410 | |
|
|
411 | ns->send_packet (cmdback); |
|
|
412 | } |
|
|
413 | |
|
|
414 | /* |
|
|
415 | #define MSG_TYPE_BOOK 1 |
|
|
416 | #define MSG_TYPE_CARD 2 |
|
|
417 | #define MSG_TYPE_PAPER 3 |
|
|
418 | #define MSG_TYPE_SIGN 4 |
|
|
419 | #define MSG_TYPE_MONUMENT 5 |
|
|
420 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
|
|
421 | |
|
|
422 | /** Reply to ExtendedInfos command */ |
|
|
423 | void |
|
|
424 | ToggleExtendedText (char *buf, int len, client * ns) |
|
|
425 | { |
|
|
426 | char cmdback[MAX_BUF]; |
|
|
427 | char temp[10]; |
|
|
428 | char command[50]; |
|
|
429 | int info, nextinfo, i, flag; |
|
|
430 | |
|
|
431 | cmdback[0] = '\0'; |
|
|
432 | |
|
|
433 | nextinfo = 0; |
|
|
434 | while (1) |
|
|
435 | { |
|
|
436 | /* 1. Extract an info */ |
|
|
437 | info = nextinfo; |
|
|
438 | |
|
|
439 | while ((info < len) && (buf[info] == ' ')) |
|
|
440 | info++; |
|
|
441 | |
|
|
442 | if (info >= len) |
|
|
443 | break; |
|
|
444 | |
|
|
445 | nextinfo = info + 1; |
|
|
446 | |
|
|
447 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
448 | nextinfo++; |
|
|
449 | |
|
|
450 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
451 | continue; |
|
|
452 | |
|
|
453 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
454 | command[nextinfo - info] = '\0'; |
|
|
455 | /* 2. Interpret info */ |
|
|
456 | i = sscanf (command, "%d", &flag); |
|
|
457 | |
|
|
458 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
|
|
459 | ns->supported_readables |= (1 << flag); |
|
|
460 | /*3. Next info */ |
|
|
461 | } |
|
|
462 | |
|
|
463 | /* Send resulting state */ |
|
|
464 | strcpy (cmdback, "ExtendedTextSet"); |
|
|
465 | |
|
|
466 | for (i = 0; i <= MSG_TYPE_LAST; i++) |
|
|
467 | if (ns->supported_readables & (1 << i)) |
|
|
468 | { |
|
|
469 | strcat (cmdback, " "); |
|
|
470 | snprintf (temp, sizeof (temp), "%d", i); |
|
|
471 | strcat (cmdback, temp); |
|
|
472 | } |
|
|
473 | |
|
|
474 | ns->send_packet (cmdback); |
|
|
475 | } |
|
|
476 | |
|
|
477 | /** |
|
|
478 | * client requested an image. send it rate-limited |
|
|
479 | * before flushing. |
|
|
480 | */ |
|
|
481 | void |
|
|
482 | AskFaceCmd (char *buf, int len, client *ns) |
|
|
483 | { |
|
|
484 | ns->askface.push_back (atoi (buf)); |
|
|
485 | } |
|
|
486 | |
|
|
487 | /** |
|
|
488 | * Tells client the picture it has to use |
|
|
489 | * to smooth a picture number given as argument. |
|
|
490 | */ |
|
|
491 | void |
|
|
492 | AskSmooth (char *buf, int len, client *ns) |
|
|
493 | { |
|
|
494 | ns->send_face (atoi (buf)); |
|
|
495 | ns->flush_fx (); |
|
|
496 | } |
|
|
497 | |
472 | |
498 | /** |
473 | /** |
499 | * This handles the general commands from the client (ie, north, fire, cast, |
474 | * This handles the general commands from the client (ie, north, fire, cast, |
500 | * etc.) |
475 | * etc.) |
501 | */ |
476 | */ |
… | |
… | |
514 | return; |
489 | return; |
515 | |
490 | |
516 | buf++; |
491 | buf++; |
517 | } |
492 | } |
518 | |
493 | |
519 | execute_newserver_command (pl->ob, (char *) buf); |
494 | execute_newserver_command (pl->ob, (char *)buf); |
520 | |
495 | |
521 | /* Perhaps something better should be done with a left over count. |
496 | /* Perhaps something better should be done with a left over count. |
522 | * Cleaning up the input should probably be done first - all actions |
497 | * Cleaning up the input should probably be done first - all actions |
523 | * for the command that issued the count should be done before any other |
498 | * for the command that issued the count should be done before any other |
524 | * commands. |
499 | * commands. |
525 | */ |
500 | */ |
526 | pl->count = 0; |
501 | pl->count = 0; |
527 | } |
|
|
528 | |
|
|
529 | |
|
|
530 | /** |
|
|
531 | * This handles the general commands from the client (ie, north, fire, cast, |
|
|
532 | * etc.). It is a lot like PlayerCmd above, but is called with the |
|
|
533 | * 'ncom' method which gives more information back to the client so it |
|
|
534 | * can throttle. |
|
|
535 | */ |
|
|
536 | void |
|
|
537 | NewPlayerCmd (char *buf, int len, player *pl) |
|
|
538 | { |
|
|
539 | if (len <= 6) |
|
|
540 | { |
|
|
541 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
|
|
542 | return; |
|
|
543 | } |
|
|
544 | |
|
|
545 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
|
|
546 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
|
|
547 | |
|
|
548 | /* -1 is special - no repeat, but don't update */ |
|
|
549 | if (repeat != -1) |
|
|
550 | pl->count = repeat; |
|
|
551 | |
|
|
552 | buf += 6; //len -= 6; |
|
|
553 | |
|
|
554 | execute_newserver_command (pl->ob, buf); |
|
|
555 | |
|
|
556 | /* Perhaps something better should be done with a left over count. |
|
|
557 | * Cleaning up the input should probably be done first - all actions |
|
|
558 | * for the command that issued the count should be done before any other |
|
|
559 | * commands. |
|
|
560 | */ |
|
|
561 | pl->count = 0; |
|
|
562 | |
|
|
563 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
|
|
564 | int time = fabs (pl->ob->speed) < 0.001 |
|
|
565 | ? time = MAX_TIME * 100 |
|
|
566 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
|
|
567 | |
|
|
568 | /* Send confirmation of command execution now */ |
|
|
569 | packet sl ("comc"); |
|
|
570 | sl << uint16 (cmdid) << uint32 (time); |
|
|
571 | pl->ns->send_packet (sl); |
|
|
572 | } |
502 | } |
573 | |
503 | |
574 | /** This is a reply to a previous query. */ |
504 | /** This is a reply to a previous query. */ |
575 | void |
505 | void |
576 | ReplyCmd (char *buf, int len, client *ns) |
506 | ReplyCmd (char *buf, int len, client *ns) |
… | |
… | |
613 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
543 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
614 | } |
544 | } |
615 | } |
545 | } |
616 | |
546 | |
617 | /** |
547 | /** |
618 | * Client tells its version. If there is a mismatch, we close the |
548 | * Client tells its version info. |
619 | * socket. In real life, all we should care about is the client having |
|
|
620 | * something older than the server. If we assume the client will be |
|
|
621 | * backwards compatible, having it be a later version should not be a |
|
|
622 | * problem. |
|
|
623 | */ |
549 | */ |
624 | void |
550 | void |
625 | VersionCmd (char *buf, int len, client * ns) |
551 | VersionCmd (char *buf, int len, client *ns) |
626 | { |
552 | { |
627 | if (!buf) |
553 | INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len)); |
628 | { |
|
|
629 | LOG (llevError, "CS: received corrupted version command\n"); |
|
|
630 | return; |
|
|
631 | } |
|
|
632 | |
|
|
633 | ns->cs_version = atoi (buf); |
|
|
634 | ns->sc_version = ns->cs_version; |
|
|
635 | |
|
|
636 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
637 | |
|
|
638 | //TODO: should log here just for statistics |
|
|
639 | |
|
|
640 | //if (VERSION_CS != ns->cs_version) |
|
|
641 | // unchecked; |
|
|
642 | |
|
|
643 | char *cp = strchr (buf + 1, ' '); |
|
|
644 | if (!cp) |
|
|
645 | return; |
|
|
646 | |
|
|
647 | ns->sc_version = atoi (cp); |
|
|
648 | |
|
|
649 | //if (VERSION_SC != ns->sc_version) |
|
|
650 | // unchecked; |
|
|
651 | |
|
|
652 | cp = strchr (cp + 1, ' '); |
|
|
653 | |
|
|
654 | if (cp) |
|
|
655 | { |
|
|
656 | ns->version = cp + 1; |
|
|
657 | |
|
|
658 | if (ns->sc_version < 1026) |
|
|
659 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
|
|
660 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
|
|
661 | } |
|
|
662 | } |
554 | } |
663 | |
555 | |
664 | /** sound related functions. */ |
556 | /** sound related functions. */ |
665 | void |
557 | void |
666 | SetSound (char *buf, int len, client * ns) |
558 | SetSound (char *buf, int len, client * ns) |
… | |
… | |
684 | * syntax is: move (to) (tag) (nrof) |
576 | * syntax is: move (to) (tag) (nrof) |
685 | */ |
577 | */ |
686 | void |
578 | void |
687 | MoveCmd (char *buf, int len, player *pl) |
579 | MoveCmd (char *buf, int len, player *pl) |
688 | { |
580 | { |
689 | int vals[3], i; |
581 | int to, tag, nrof; |
690 | |
582 | |
691 | /* A little funky here. We only cycle for 2 records, because |
583 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
692 | * we obviously are not going to find a space after the third |
|
|
693 | * record. Perhaps we should just replace this with a |
|
|
694 | * sscanf? |
|
|
695 | */ |
|
|
696 | for (i = 0; i < 2; i++) |
|
|
697 | { |
584 | { |
698 | vals[i] = atoi (buf); |
|
|
699 | |
|
|
700 | if (!(buf = strchr (buf, ' '))) |
|
|
701 | { |
|
|
702 | LOG (llevError, "Incomplete move command: %s\n", buf); |
585 | LOG (llevError, "Incomplete move command: %s\n", buf); |
703 | return; |
586 | return; |
704 | } |
|
|
705 | |
|
|
706 | buf++; |
|
|
707 | } |
587 | } |
708 | |
588 | |
709 | vals[2] = atoi (buf); |
589 | esrv_move_object (pl->ob, to, tag, nrof); |
710 | |
|
|
711 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
712 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
713 | } |
590 | } |
714 | |
591 | |
715 | /****************************************************************************** |
592 | /****************************************************************************** |
716 | * |
593 | * |
717 | * Start of commands the server sends to the client. |
594 | * Start of commands the server sends to the client. |
… | |
… | |
730 | |
607 | |
731 | /** |
608 | /** |
732 | * Get player's current range attack in obuf. |
609 | * Get player's current range attack in obuf. |
733 | */ |
610 | */ |
734 | static void |
611 | static void |
735 | rangetostring (object *ob, char *obuf) |
612 | rangetostring (player *pl, char *obuf) |
736 | { |
613 | { |
737 | dynbuf_text buf; |
614 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
738 | |
615 | |
739 | player *pl = ob->contr; |
616 | #if 0 |
|
|
617 | // print ranged/chosen_skill etc. objects every call |
|
|
618 | printf ("%s %s => %s (%s)\n", |
|
|
619 | pl->ranged_ob ? &pl->ranged_ob->name : "-", |
|
|
620 | pl->combat_ob ? &pl->combat_ob->name : "-", |
|
|
621 | pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-", |
|
|
622 | pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-" |
|
|
623 | ); |
|
|
624 | #endif |
740 | |
625 | |
741 | if (pl->ranged_ob) |
626 | if (pl->ranged_ob) |
742 | buf << " Range: " << pl->ranged_ob->name; |
627 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
743 | |
628 | |
744 | if (pl->combat_ob) |
629 | if (pl->combat_ob) |
745 | buf << " Combat: " << pl->combat_ob->name; |
630 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
746 | |
631 | |
|
|
632 | #if 0 |
|
|
633 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
634 | if (pl->ob->chosen_skill) |
|
|
635 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
636 | #endif |
|
|
637 | |
|
|
638 | //TODO: maybe golem should become the current_weapon, quite simply? |
747 | if (pl->golem) |
639 | if (pl->golem) |
748 | buf << " Golem: " << pl->golem->name; |
640 | buf << " Golem*: " << pl->golem->name; |
749 | |
641 | |
750 | if (buf.empty ()) |
642 | buf << '\0'; |
751 | *obuf = 0; |
643 | buf.linearise (obuf); |
752 | else |
|
|
753 | { |
|
|
754 | memcpy (obuf, buf.linearise () + 1, buf.size () - 1); |
|
|
755 | obuf [buf.size ()] = 0; |
|
|
756 | } |
|
|
757 | } |
644 | } |
758 | |
645 | |
759 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
646 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
760 | Old = New; \ |
647 | Old = New; \ |
761 | sl << uint8 (Type) << uint64 (New); \ |
648 | sl << uint8 (Type) << uint64 (New); \ |
… | |
… | |
769 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
656 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
770 | Old = New; \ |
657 | Old = New; \ |
771 | sl << uint8 (Type) << uint16 (New); \ |
658 | sl << uint8 (Type) << uint16 (New); \ |
772 | } |
659 | } |
773 | |
660 | |
774 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
661 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
775 | Old = New; \ |
662 | Old = New; \ |
776 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI); \ |
663 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
777 | } |
664 | } |
778 | |
665 | |
779 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
666 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
780 | free(Old); Old = strdup (New);\ |
667 | free(Old); Old = strdup (New);\ |
781 | sl << uint8 (Type) << data8 (New); \ |
668 | sl << uint8 (Type) << data8 (New); \ |
… | |
… | |
788 | * commands for now. |
675 | * commands for now. |
789 | */ |
676 | */ |
790 | void |
677 | void |
791 | esrv_update_stats (player *pl) |
678 | esrv_update_stats (player *pl) |
792 | { |
679 | { |
793 | char buf[MAX_BUF]; |
|
|
794 | uint16 flags; |
|
|
795 | |
|
|
796 | client *ns = pl->ns; |
680 | client *ns = pl->ns; |
797 | if (!ns) |
681 | if (!ns) |
798 | return; |
682 | return; |
799 | |
683 | |
800 | object *ob = pl->ob; |
684 | object *ob = pl->observe; |
801 | if (!ob) |
685 | if (!ob) |
802 | return; |
686 | return; |
|
|
687 | |
|
|
688 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
803 | |
689 | |
804 | packet sl ("stats"); |
690 | packet sl ("stats"); |
805 | |
691 | |
806 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
692 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
807 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
693 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
… | |
… | |
815 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
701 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
816 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
702 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
817 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
703 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
818 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
704 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
819 | |
705 | |
820 | for (int s = 0; s < NUM_SKILLS; s++) |
706 | for (int s = 0; s < CS_NUM_SKILLS; s++) |
821 | if (object *skill = pl->last_skill_ob[s]) |
707 | if (object *skill = opl->last_skill_ob [s]) |
822 | if (skill->stats.exp != ns->last_skill_exp [s]) |
708 | if (skill->stats.exp != ns->last_skill_exp [s]) |
823 | { |
709 | { |
824 | ns->last_skill_exp [s] = skill->stats.exp; |
710 | ns->last_skill_exp [s] = skill->stats.exp; |
825 | |
711 | |
826 | /* Always send along the level if exp changes. This is only |
712 | /* Always send along the level if exp changes. This is only |
827 | * 1 extra byte, but keeps processing simpler. |
713 | * 1 extra byte, but keeps processing simpler. |
828 | */ |
714 | */ |
829 | sl << uint8 (s + CS_STAT_SKILLINFO) |
715 | sl << uint8 (CS_STAT_SKILLINFO + s) |
830 | << uint8 (skill->level) |
716 | << uint8 (skill->level) |
831 | << uint64 (skill->stats.exp); |
717 | << uint64 (skill->stats.exp); |
832 | } |
718 | } |
833 | |
719 | |
834 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
720 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
835 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
721 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
836 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
722 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
837 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
723 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
838 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
724 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
839 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED); |
725 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK); |
840 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
726 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
841 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
727 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK); |
842 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
728 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
843 | |
729 | |
844 | flags = 0; |
730 | int flags = (opl->fire_on ? SF_FIREON : 0) |
845 | |
731 | | (opl->run_on ? SF_RUNON : 0); |
846 | if (pl->fire_on) |
|
|
847 | flags |= SF_FIREON; |
|
|
848 | |
|
|
849 | if (pl->run_on) |
|
|
850 | flags |= SF_RUNON; |
|
|
851 | |
732 | |
852 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
733 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
853 | |
734 | |
854 | if (ns->sc_version < 1025) |
|
|
855 | { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
|
|
856 | else |
|
|
857 | for (int i = 0; i < NROFATTACKS; i++) |
735 | for (int i = 0; i < NROFATTACKS; i++) |
858 | { |
|
|
859 | /* Skip ones we won't send */ |
736 | /* Skip ones we won't send */ |
860 | if (atnr_cs_stat[i] == -1) |
737 | if (atnr_cs_stat[i] >= 0) |
861 | continue; |
|
|
862 | |
|
|
863 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
738 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
864 | } |
|
|
865 | |
739 | |
866 | if (pl->ns->monitor_spells) |
740 | if (pl->ns->monitor_spells) |
867 | { |
741 | { |
868 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
742 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
869 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
743 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
870 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
744 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
871 | } |
745 | } |
872 | |
746 | |
|
|
747 | char buf[MAX_BUF]; |
873 | rangetostring (ob, buf); /* we want use the new fire & run system in new client */ |
748 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
874 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
749 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
875 | set_title (ob, buf); |
750 | set_title (ob, buf); |
876 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
751 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
877 | |
752 | |
878 | /* Only send it away if we have some actual data */ |
753 | /* Only send it away if we have some actual data */ |
… | |
… | |
882 | |
757 | |
883 | /** |
758 | /** |
884 | * Tells the client that here is a player it should start using. |
759 | * Tells the client that here is a player it should start using. |
885 | */ |
760 | */ |
886 | void |
761 | void |
887 | esrv_new_player (player *pl, uint32 weight) |
762 | esrv_new_player (player *pl) |
888 | { |
763 | { |
|
|
764 | sint32 weight = pl->ob->client_weight (); |
|
|
765 | |
889 | packet sl ("player"); |
766 | packet sl ("player"); |
890 | |
767 | |
891 | sl << uint32 (pl->ob->count) |
768 | sl << uint32 (pl->ob->count) |
892 | << uint32 (weight) |
769 | << uint32 (weight) |
893 | << uint32 (pl->ob->face) |
770 | << uint32 (pl->ob->face) |
894 | << data8 (pl->ob->name); |
771 | << data8 (pl->ob->name); |
895 | |
772 | |
896 | pl->ns->last_weight = weight; |
773 | pl->ns->last_weight = weight; |
897 | pl->ns->send_packet (sl); |
774 | pl->ns->send_packet (sl); |
898 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
899 | } |
775 | } |
900 | |
776 | |
901 | /****************************************************************************** |
777 | /****************************************************************************** |
902 | * |
778 | * |
903 | * Start of map related commands. |
779 | * Start of map related commands. |
… | |
… | |
960 | |
836 | |
961 | if (!ns.faces_sent[face_num]) |
837 | if (!ns.faces_sent[face_num]) |
962 | if (ob) |
838 | if (ob) |
963 | ns.send_faces (ob); |
839 | ns.send_faces (ob); |
964 | else |
840 | else |
965 | ns.send_face (face_num); |
841 | ns.send_face (face_num, 10); |
966 | |
842 | |
967 | sl << uint16 (face_num); |
843 | sl << uint16 (face_num); |
968 | return 1; |
844 | return 1; |
969 | } |
845 | } |
970 | |
846 | |
971 | /* Nothing changed */ |
847 | /* Nothing changed */ |
972 | return 0; |
848 | return 0; |
973 | } |
849 | } |
974 | |
850 | |
975 | /** |
851 | /** |
976 | * Returns the size of a data for a map square as returned by |
852 | * Draws client map. |
977 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
978 | * available. |
|
|
979 | */ |
853 | */ |
980 | int |
|
|
981 | getExtendedMapInfoSize (client * ns) |
|
|
982 | { |
|
|
983 | int result = 0; |
|
|
984 | |
|
|
985 | if (ns->ext_mapinfos) |
|
|
986 | { |
|
|
987 | if (ns->EMI_smooth) |
|
|
988 | result += 1; /*One byte for smoothlevel */ |
|
|
989 | } |
|
|
990 | |
|
|
991 | return result; |
|
|
992 | } |
|
|
993 | |
|
|
994 | // prefetch (and touch) all maps within a specific distancd |
|
|
995 | static void |
|
|
996 | prefetch_surrounding_maps (maptile *map, int distance) |
|
|
997 | { |
|
|
998 | map->last_access = runtime; |
|
|
999 | |
|
|
1000 | if (--distance) |
|
|
1001 | for (int dir = 4; --dir; ) |
|
|
1002 | if (const shstr &path = map->tile_path [dir]) |
|
|
1003 | if (maptile *&neigh = map->tile_map [dir]) |
|
|
1004 | prefetch_surrounding_maps (neigh, distance); |
|
|
1005 | else |
|
|
1006 | neigh = maptile::find_async (path, map); |
|
|
1007 | } |
|
|
1008 | |
|
|
1009 | // prefetch a generous area around the player |
|
|
1010 | static void |
|
|
1011 | prefetch_surrounding_maps (object *op) |
|
|
1012 | { |
|
|
1013 | prefetch_surrounding_maps (op->map, 3); |
|
|
1014 | } |
|
|
1015 | |
|
|
1016 | /** |
|
|
1017 | * This function uses the new map1 protocol command to send the map |
|
|
1018 | * to the client. It is necessary because the old map command supports |
|
|
1019 | * a maximum map size of 15x15. |
|
|
1020 | * This function is much simpler than the old one. This is because |
|
|
1021 | * the old function optimized to send as few face identifiers as possible, |
|
|
1022 | * at the expense of sending more coordinate location (coordinates were |
|
|
1023 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1024 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1025 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1026 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1027 | * of what we send, see the doc/Protocol file. |
|
|
1028 | * I will describe internally what we do: |
|
|
1029 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
1030 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1031 | * maximum viewable size (As set in config.h). |
|
|
1032 | * in the cells, there are faces and a count value. |
|
|
1033 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1034 | * is not viewable. |
|
|
1035 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1036 | * look like. |
|
|
1037 | */ |
|
|
1038 | void |
854 | void |
1039 | draw_client_map1 (object *pl) |
855 | draw_client_map (player *pl) |
1040 | { |
856 | { |
1041 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
857 | object *ob = pl->viewpoint; |
1042 | sint16 nx, ny; |
|
|
1043 | int estartlen, eoldlen; |
|
|
1044 | uint8 eentrysize; |
|
|
1045 | uint16 ewhatstart, ewhatflag; |
|
|
1046 | uint8 extendedinfos; |
|
|
1047 | maptile *m; |
|
|
1048 | |
|
|
1049 | client &socket = *pl->contr->ns; |
|
|
1050 | |
|
|
1051 | if (!pl->active) |
858 | if (!pl->observe->active) |
1052 | return; |
859 | return; |
1053 | |
|
|
1054 | check_map_change (pl->contr); |
|
|
1055 | prefetch_surrounding_maps (pl); |
|
|
1056 | |
|
|
1057 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
|
|
1058 | packet esl; |
|
|
1059 | |
|
|
1060 | startlen = sl.length (); |
|
|
1061 | |
|
|
1062 | /*Extendedmapinfo structure initialisation */ |
|
|
1063 | if (socket.ext_mapinfos) |
|
|
1064 | { |
|
|
1065 | extendedinfos = EMI_NOREDRAW; |
|
|
1066 | |
|
|
1067 | if (socket.EMI_smooth) |
|
|
1068 | extendedinfos |= EMI_SMOOTH; |
|
|
1069 | |
|
|
1070 | ewhatstart = esl.length (); |
|
|
1071 | ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
|
|
1072 | could need to be taken away */ |
|
|
1073 | eentrysize = getExtendedMapInfoSize (&socket); |
|
|
1074 | esl << "mapextended " |
|
|
1075 | << uint8 (extendedinfos) |
|
|
1076 | << uint8 (eentrysize); |
|
|
1077 | |
|
|
1078 | estartlen = esl.length (); |
|
|
1079 | } |
|
|
1080 | |
|
|
1081 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1082 | * locations. |
|
|
1083 | */ |
|
|
1084 | ay = 0; |
|
|
1085 | |
|
|
1086 | /* We could do this logic as conditionals in the if statement, |
|
|
1087 | * but that started to get a bit messy to look at. |
|
|
1088 | */ |
|
|
1089 | max_x = pl->x + (socket.mapx + 1) / 2; |
|
|
1090 | max_y = pl->y + (socket.mapy + 1) / 2; |
|
|
1091 | |
|
|
1092 | maptile *plmap = pl->map; |
|
|
1093 | |
|
|
1094 | for (y = pl->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1095 | { |
|
|
1096 | ax = 0; |
|
|
1097 | for (x = pl->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1098 | { |
|
|
1099 | int emask, mask; |
|
|
1100 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1101 | |
|
|
1102 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
1103 | |
|
|
1104 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
1105 | * we tell the client as such |
|
|
1106 | */ |
|
|
1107 | nx = x; |
|
|
1108 | ny = y; |
|
|
1109 | m = get_map_from_coord (plmap, &nx, &ny); |
|
|
1110 | |
|
|
1111 | if (!m) |
|
|
1112 | { |
|
|
1113 | /* space is out of map. Update space and clear values |
|
|
1114 | * if this hasn't already been done. If the space is out |
|
|
1115 | * of the map, it shouldn't have a head |
|
|
1116 | */ |
|
|
1117 | if (lastcell.count != -1) |
|
|
1118 | { |
|
|
1119 | sl << uint16 (mask); |
|
|
1120 | map_clearcell (&lastcell, -1); |
|
|
1121 | } |
|
|
1122 | |
|
|
1123 | continue; |
|
|
1124 | } |
|
|
1125 | |
|
|
1126 | m->touch (); |
|
|
1127 | |
|
|
1128 | int d = pl->contr->blocked_los[ax][ay]; |
|
|
1129 | |
|
|
1130 | if (d > 3) |
|
|
1131 | { |
|
|
1132 | |
|
|
1133 | int need_send = 0, count; |
|
|
1134 | |
|
|
1135 | /* This block deals with spaces that are not visible for whatever |
|
|
1136 | * reason. Still may need to send the head for this space. |
|
|
1137 | */ |
|
|
1138 | |
|
|
1139 | oldlen = sl.length (); |
|
|
1140 | |
|
|
1141 | sl << uint16 (mask); |
|
|
1142 | |
|
|
1143 | if (lastcell.count != -1) |
|
|
1144 | need_send = 1; |
|
|
1145 | |
|
|
1146 | count = -1; |
|
|
1147 | |
|
|
1148 | /* properly clear a previously sent big face */ |
|
|
1149 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
|
|
1150 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
|
|
1151 | need_send = 1; |
|
|
1152 | |
|
|
1153 | map_clearcell (&lastcell, count); |
|
|
1154 | |
|
|
1155 | if ((mask & 0xf) || need_send) |
|
|
1156 | sl[oldlen + 1] = mask & 0xff; |
|
|
1157 | else |
|
|
1158 | sl.reset (oldlen); |
|
|
1159 | } |
|
|
1160 | else |
|
|
1161 | { |
|
|
1162 | /* In this block, the space is visible. |
|
|
1163 | */ |
|
|
1164 | |
|
|
1165 | /* Rather than try to figure out what everything that we might |
|
|
1166 | * need to send is, then form the packet after that, |
|
|
1167 | * we presume that we will in fact form a packet, and update |
|
|
1168 | * the bits by what we do actually send. If we send nothing, |
|
|
1169 | * we just back out sl.length () to the old value, and no harm |
|
|
1170 | * is done. |
|
|
1171 | * I think this is simpler than doing a bunch of checks to see |
|
|
1172 | * what if anything we need to send, setting the bits, then |
|
|
1173 | * doing those checks again to add the real data. |
|
|
1174 | */ |
|
|
1175 | oldlen = sl.length (); |
|
|
1176 | eoldlen = esl.length (); |
|
|
1177 | |
|
|
1178 | sl << uint16 (mask); |
|
|
1179 | |
|
|
1180 | unsigned char dummy; |
|
|
1181 | unsigned char *last_ext = &dummy; |
|
|
1182 | |
|
|
1183 | /* Darkness changed */ |
|
|
1184 | if (lastcell.count != d && socket.darkness) |
|
|
1185 | { |
|
|
1186 | mask |= 0x8; |
|
|
1187 | |
|
|
1188 | if (socket.extmap) |
|
|
1189 | { |
|
|
1190 | *last_ext |= 0x80; |
|
|
1191 | last_ext = &sl[sl.length ()]; |
|
|
1192 | sl << uint8 (d); |
|
|
1193 | } |
|
|
1194 | else |
|
|
1195 | sl << uint8 (255 - 64 * d); |
|
|
1196 | } |
|
|
1197 | |
|
|
1198 | lastcell.count = d; |
|
|
1199 | |
|
|
1200 | mapspace &ms = m->at (nx, ny); |
|
|
1201 | |
|
|
1202 | if (socket.extmap) |
|
|
1203 | { |
|
|
1204 | uint8 stat_hp = 0; |
|
|
1205 | uint8 stat_width = 0; |
|
|
1206 | uint8 flags = 0; |
|
|
1207 | tag_t player = 0; |
|
|
1208 | |
|
|
1209 | // send hp information, if applicable |
|
|
1210 | if (object *op = ms.faces_obj [0]) |
|
|
1211 | { |
|
|
1212 | if (op->head || op->invisible) |
|
|
1213 | ; // do not show |
|
|
1214 | else if (op->type == PLAYER |
|
|
1215 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1216 | { |
|
|
1217 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
|
|
1218 | { |
|
|
1219 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1220 | stat_width = op->arch->tail_x; |
|
|
1221 | } |
|
|
1222 | } |
|
|
1223 | |
|
|
1224 | if (op->msg && op->msg[0] == '@') |
|
|
1225 | flags |= 1; |
|
|
1226 | |
|
|
1227 | if (op->type == PLAYER && op != pl) |
|
|
1228 | player = op->count; |
|
|
1229 | } |
|
|
1230 | |
|
|
1231 | if (lastcell.stat_hp != stat_hp) |
|
|
1232 | { |
|
|
1233 | lastcell.stat_hp = stat_hp; |
|
|
1234 | |
|
|
1235 | mask |= 0x8; |
|
|
1236 | *last_ext |= 0x80; |
|
|
1237 | last_ext = &sl[sl.length ()]; |
|
|
1238 | |
|
|
1239 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1240 | |
|
|
1241 | if (stat_width > 1) |
|
|
1242 | { |
|
|
1243 | *last_ext |= 0x80; |
|
|
1244 | last_ext = &sl[sl.length ()]; |
|
|
1245 | |
|
|
1246 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1247 | } |
|
|
1248 | } |
|
|
1249 | |
|
|
1250 | if (lastcell.player != player) |
|
|
1251 | { |
|
|
1252 | lastcell.player = player; |
|
|
1253 | |
|
|
1254 | mask |= 0x8; |
|
|
1255 | *last_ext |= 0x80; |
|
|
1256 | last_ext = &sl[sl.length ()]; |
|
|
1257 | |
|
|
1258 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1259 | } |
|
|
1260 | |
|
|
1261 | if (lastcell.flags != flags) |
|
|
1262 | { |
|
|
1263 | lastcell.flags = flags; |
|
|
1264 | |
|
|
1265 | mask |= 0x8; |
|
|
1266 | *last_ext |= 0x80; |
|
|
1267 | last_ext = &sl[sl.length ()]; |
|
|
1268 | |
|
|
1269 | sl << uint8 (8) << uint8 (flags); |
|
|
1270 | } |
|
|
1271 | } |
|
|
1272 | |
|
|
1273 | /* Floor face */ |
|
|
1274 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1275 | mask |= 0x4; |
|
|
1276 | |
|
|
1277 | /* Middle face */ |
|
|
1278 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1279 | mask |= 0x2; |
|
|
1280 | |
|
|
1281 | if (ms.player () == pl |
|
|
1282 | && (pl->invisible & (pl->invisible < 50 ? 1 : 7))) |
|
|
1283 | { |
|
|
1284 | // force player to be visible to himself if invisible |
|
|
1285 | if (lastcell.faces[0] != pl->face) |
|
|
1286 | { |
|
|
1287 | lastcell.faces[0] = pl->face; |
|
|
1288 | |
|
|
1289 | mask |= 0x1; |
|
|
1290 | sl << uint16 (pl->face); |
|
|
1291 | |
|
|
1292 | socket.send_faces (pl); |
|
|
1293 | } |
|
|
1294 | } |
|
|
1295 | /* Top face */ |
|
|
1296 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1297 | mask |= 0x1; |
|
|
1298 | |
|
|
1299 | |
|
|
1300 | /* Check to see if we are in fact sending anything for this |
|
|
1301 | * space by checking the mask. If so, update the mask. |
|
|
1302 | * if not, reset the len to that from before adding the mask |
|
|
1303 | * value, so we don't send those bits. |
|
|
1304 | */ |
|
|
1305 | if (mask & 0xf) |
|
|
1306 | sl[oldlen + 1] = mask & 0xff; |
|
|
1307 | else |
|
|
1308 | sl.reset (oldlen); |
|
|
1309 | |
|
|
1310 | if (socket.ext_mapinfos) |
|
|
1311 | esl << uint16 (emask); |
|
|
1312 | |
|
|
1313 | if (socket.EMI_smooth) |
|
|
1314 | { |
|
|
1315 | for (int layer = 2+1; layer--; ) |
|
|
1316 | { |
|
|
1317 | object *ob = ms.faces_obj [layer]; |
|
|
1318 | |
|
|
1319 | // If there is no object for this space, or if the face for the object |
|
|
1320 | // is the blank face, set the smoothlevel to zero. |
|
|
1321 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1322 | |
|
|
1323 | // We've gotten what face we want to use for the object. Now see if |
|
|
1324 | // if it has changed since we last sent it to the client. |
|
|
1325 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1326 | { |
|
|
1327 | lastcell.smooth[layer] = smoothlevel; |
|
|
1328 | esl << uint8 (smoothlevel); |
|
|
1329 | emask |= 1 << layer; |
|
|
1330 | } |
|
|
1331 | } |
|
|
1332 | |
|
|
1333 | if (emask & 0xf) |
|
|
1334 | esl[eoldlen + 1] = emask & 0xff; |
|
|
1335 | else |
|
|
1336 | esl.reset (eoldlen); |
|
|
1337 | } |
|
|
1338 | } /* else this is a viewable space */ |
|
|
1339 | } /* for x loop */ |
|
|
1340 | } /* for y loop */ |
|
|
1341 | |
|
|
1342 | socket.flush_fx (); |
|
|
1343 | |
|
|
1344 | /* Verify that we in fact do need to send this */ |
|
|
1345 | if (socket.ext_mapinfos) |
|
|
1346 | { |
|
|
1347 | if (!(sl.length () > startlen || socket.sent_scroll)) |
|
|
1348 | { |
|
|
1349 | /* No map data will follow, so don't say the client |
|
|
1350 | * it doesn't need draw! |
|
|
1351 | */ |
|
|
1352 | ewhatflag &= ~EMI_NOREDRAW; |
|
|
1353 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
|
|
1354 | } |
|
|
1355 | |
|
|
1356 | if (esl.length () > estartlen) |
|
|
1357 | socket.send_packet (esl); |
|
|
1358 | } |
|
|
1359 | |
|
|
1360 | if (sl.length () > startlen || socket.sent_scroll) |
|
|
1361 | { |
|
|
1362 | socket.send_packet (sl); |
|
|
1363 | socket.sent_scroll = 0; |
|
|
1364 | } |
|
|
1365 | } |
|
|
1366 | |
|
|
1367 | /** |
|
|
1368 | * Draws client map. |
|
|
1369 | */ |
|
|
1370 | void |
|
|
1371 | draw_client_map (object *pl) |
|
|
1372 | { |
|
|
1373 | int i, j; |
|
|
1374 | sint16 ax, ay; /* ax and ay goes from 0 to max-size of arrays */ |
|
|
1375 | int mflags; |
|
|
1376 | struct Map newmap; |
|
|
1377 | maptile *m, *pm; |
|
|
1378 | |
|
|
1379 | if (pl->type != PLAYER) |
|
|
1380 | { |
|
|
1381 | LOG (llevError, "draw_client_map called with non player/non eric-server\n"); |
|
|
1382 | return; |
|
|
1383 | } |
|
|
1384 | |
|
|
1385 | pm = pl->map; |
|
|
1386 | |
860 | |
1387 | /* If player is just joining the game, he isn't here yet, so the map |
861 | /* If player is just joining the game, he isn't here yet, so the map |
1388 | * can get swapped out. If so, don't try to send them a map. All will |
862 | * can get swapped out. If so, don't try to send them a map. All will |
1389 | * be OK once they really log in. |
863 | * be OK once they really log in. |
1390 | */ |
864 | */ |
1391 | if (pm == NULL || pm->in_memory != MAP_IN_MEMORY) |
865 | if (!ob->map || ob->map->state != MAP_ACTIVE) |
1392 | return; |
866 | return; |
1393 | |
867 | |
1394 | memset (&newmap, 0, sizeof (struct Map)); |
868 | int startlen, oldlen; |
1395 | |
869 | |
1396 | for (j = (pl->y - pl->contr->ns->mapy / 2); j < (pl->y + (pl->contr->ns->mapy + 1) / 2); j++) |
870 | check_map_change (pl); |
1397 | for (i = (pl->x - pl->contr->ns->mapx / 2); i < (pl->x + (pl->contr->ns->mapx + 1) / 2); i++) |
871 | pl->ob->prefetch_surrounding_maps (); |
|
|
872 | |
|
|
873 | /* do LOS after calls to update_position */ |
|
|
874 | /* unfortunately, we need to udpate los when observing, currently */ |
|
|
875 | if (pl->do_los || pl->viewpoint != pl->ob) |
|
|
876 | { |
|
|
877 | pl->do_los = 0; |
|
|
878 | pl->update_los (); |
|
|
879 | } |
|
|
880 | |
|
|
881 | /** |
|
|
882 | * This function uses the new map1 protocol command to send the map |
|
|
883 | * to the client. It is necessary because the old map command supports |
|
|
884 | * a maximum map size of 15x15. |
|
|
885 | * This function is much simpler than the old one. This is because |
|
|
886 | * the old function optimized to send as few face identifiers as possible, |
|
|
887 | * at the expense of sending more coordinate location (coordinates were |
|
|
888 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
889 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
890 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
891 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
892 | * of what we send, see the doc/Protocol file. |
|
|
893 | * I will describe internally what we do: |
|
|
894 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
895 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
896 | * maximum viewable size (As set in config.h). |
|
|
897 | * in the cells, there are faces and a count value. |
|
|
898 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
899 | * is not viewable. |
|
|
900 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
901 | * look like. |
|
|
902 | */ |
|
|
903 | |
|
|
904 | client &socket = *pl->ns; |
|
|
905 | |
|
|
906 | packet sl ("map1a"); |
|
|
907 | |
|
|
908 | startlen = sl.length (); |
|
|
909 | |
|
|
910 | int hx = socket.mapx / 2; |
|
|
911 | int hy = socket.mapy / 2; |
|
|
912 | |
|
|
913 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
|
|
914 | int ax = dx + hx; |
|
|
915 | int ay = dy + hy; |
|
|
916 | |
|
|
917 | int mask = (ax << 10) | (ay << 4); |
|
|
918 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
919 | |
|
|
920 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
921 | * we tell the client as such |
|
|
922 | */ |
|
|
923 | if (!m) |
1398 | { |
924 | { |
1399 | ax = i; |
925 | /* space is out of map. Update space and clear values |
1400 | ay = j; |
926 | * if this hasn't already been done. If the space is out |
1401 | m = pm; |
927 | * of the map, it shouldn't have a head. |
1402 | mflags = get_map_flags (m, &m, ax, ay, &ax, &ay); |
|
|
1403 | |
|
|
1404 | if (mflags & P_OUT_OF_MAP) |
|
|
1405 | continue; |
|
|
1406 | |
|
|
1407 | /* If a map is visible to the player, we don't want to swap it out |
|
|
1408 | * just to reload it. This should really call something like |
|
|
1409 | * swap_map, but this is much more efficient and 'good enough' |
|
|
1410 | */ |
928 | */ |
1411 | if (mflags & P_NEW_MAP) |
929 | if (lastcell.count != -1) |
1412 | m->timeout = 50; |
930 | { |
|
|
931 | sl << uint16 (mask); |
|
|
932 | map_clearcell (&lastcell, -1); |
|
|
933 | } |
|
|
934 | |
|
|
935 | continue; |
1413 | } |
936 | } |
1414 | |
937 | |
1415 | /* do LOS after calls to update_position */ |
938 | int d = pl->blocked_los_uc (dx, dy); |
1416 | if (pl->contr->do_los) |
939 | |
|
|
940 | if (d > 3) |
1417 | { |
941 | { |
1418 | update_los (pl); |
942 | /* This block deals with spaces that are not visible for whatever |
1419 | pl->contr->do_los = 0; |
943 | * reason. Still may need to send the head for this space. |
|
|
944 | */ |
|
|
945 | if (lastcell.count != -1 |
|
|
946 | || lastcell.faces[0] |
|
|
947 | || lastcell.faces[1] |
|
|
948 | || lastcell.faces[2] |
|
|
949 | || lastcell.stat_hp |
|
|
950 | || lastcell.flags |
|
|
951 | || lastcell.player) |
|
|
952 | sl << uint16 (mask); |
|
|
953 | |
|
|
954 | /* properly clear a previously sent big face */ |
|
|
955 | map_clearcell (&lastcell, -1); |
1420 | } |
956 | } |
1421 | |
957 | else |
1422 | /* Big maps need a different drawing mechanism to work */ |
|
|
1423 | draw_client_map1 (pl); |
|
|
1424 | } |
|
|
1425 | |
|
|
1426 | |
|
|
1427 | /*****************************************************************************/ |
|
|
1428 | |
|
|
1429 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
|
|
1430 | |
|
|
1431 | /* a player. Of course, the client need to know the command to be able to */ |
|
|
1432 | |
|
|
1433 | /* manage it ! */ |
|
|
1434 | |
|
|
1435 | /*****************************************************************************/ |
|
|
1436 | void |
|
|
1437 | send_plugin_custom_message (object *pl, char *buf) |
|
|
1438 | { |
|
|
1439 | pl->contr->ns->send_packet (buf); |
|
|
1440 | } |
|
|
1441 | |
|
|
1442 | /** |
|
|
1443 | * This sends the skill number to name mapping. We ignore |
|
|
1444 | * the params - we always send the same info no matter what. |
|
|
1445 | */ |
|
|
1446 | void |
|
|
1447 | send_skill_info (client *ns, char *params) |
|
|
1448 | { |
|
|
1449 | packet sl; |
|
|
1450 | sl << "replyinfo skill_info\n"; |
|
|
1451 | |
|
|
1452 | for (int i = 1; i < NUM_SKILLS; i++) |
|
|
1453 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
|
|
1454 | |
|
|
1455 | if (sl.length () >= MAXSOCKBUF) |
|
|
1456 | { |
958 | { |
1457 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
959 | /* In this block, the space is visible. |
1458 | fatal (0); |
960 | */ |
|
|
961 | |
|
|
962 | /* Rather than try to figure out what everything that we might |
|
|
963 | * need to send is, then form the packet after that, |
|
|
964 | * we presume that we will in fact form a packet, and update |
|
|
965 | * the bits by what we do actually send. If we send nothing, |
|
|
966 | * we just back out sl.length () to the old value, and no harm |
|
|
967 | * is done. |
|
|
968 | * I think this is simpler than doing a bunch of checks to see |
|
|
969 | * what if anything we need to send, setting the bits, then |
|
|
970 | * doing those checks again to add the real data. |
|
|
971 | */ |
|
|
972 | oldlen = sl.length (); |
|
|
973 | |
|
|
974 | sl << uint16 (mask); |
|
|
975 | |
|
|
976 | unsigned char dummy; |
|
|
977 | unsigned char *last_ext = &dummy; |
|
|
978 | |
|
|
979 | /* Darkness changed */ |
|
|
980 | if (lastcell.count != d) |
|
|
981 | { |
|
|
982 | mask |= 0x8; |
|
|
983 | |
|
|
984 | *last_ext |= 0x80; |
|
|
985 | last_ext = &sl[sl.length ()]; |
|
|
986 | sl << uint8 (d); |
|
|
987 | } |
|
|
988 | |
|
|
989 | lastcell.count = d; |
|
|
990 | |
|
|
991 | mapspace &ms = m->at (nx, ny); |
|
|
992 | ms.update (); |
|
|
993 | |
|
|
994 | // extmap handling |
|
|
995 | uint8 stat_hp = 0; |
|
|
996 | uint8 stat_width = 0; |
|
|
997 | uint8 flags = 0; |
|
|
998 | tag_t player = 0; |
|
|
999 | |
|
|
1000 | // send hp information, if applicable |
|
|
1001 | if (object *op = ms.faces_obj [0]) |
|
|
1002 | if (op->is_head () && !op->invisible) |
|
|
1003 | { |
|
|
1004 | if (op->stats.maxhp > op->stats.hp |
|
|
1005 | && op->stats.maxhp > 0 |
|
|
1006 | && (op->type == PLAYER |
|
|
1007 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1008 | || op->flag [FLAG_MONSTER] |
|
|
1009 | || op->flag [FLAG_ALIVE] |
|
|
1010 | || op->flag [FLAG_GENERATOR])) |
|
|
1011 | { |
|
|
1012 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1013 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1014 | } |
|
|
1015 | |
|
|
1016 | if (ecb_expect_false (op->has_dialogue ())) |
|
|
1017 | flags |= 1; |
|
|
1018 | |
|
|
1019 | if (ecb_expect_false (op->type == PLAYER)) |
|
|
1020 | player = op == ob ? pl->ob->count |
|
|
1021 | : op == pl->ob ? ob->count |
|
|
1022 | : op->count; |
|
|
1023 | } |
|
|
1024 | |
|
|
1025 | if (ecb_expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1026 | { |
|
|
1027 | lastcell.stat_hp = stat_hp; |
|
|
1028 | |
|
|
1029 | mask |= 0x8; |
|
|
1030 | *last_ext |= 0x80; |
|
|
1031 | last_ext = &sl[sl.length ()]; |
|
|
1032 | |
|
|
1033 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1034 | |
|
|
1035 | if (stat_width > 1) |
|
|
1036 | { |
|
|
1037 | *last_ext |= 0x80; |
|
|
1038 | last_ext = &sl[sl.length ()]; |
|
|
1039 | |
|
|
1040 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1041 | } |
|
|
1042 | } |
|
|
1043 | |
|
|
1044 | if (ecb_expect_false (lastcell.player != player)) |
|
|
1045 | { |
|
|
1046 | lastcell.player = player; |
|
|
1047 | |
|
|
1048 | mask |= 0x8; |
|
|
1049 | *last_ext |= 0x80; |
|
|
1050 | last_ext = &sl[sl.length ()]; |
|
|
1051 | |
|
|
1052 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1053 | } |
|
|
1054 | |
|
|
1055 | if (ecb_expect_false (lastcell.flags != flags)) |
|
|
1056 | { |
|
|
1057 | lastcell.flags = flags; |
|
|
1058 | |
|
|
1059 | mask |= 0x8; |
|
|
1060 | *last_ext |= 0x80; |
|
|
1061 | last_ext = &sl[sl.length ()]; |
|
|
1062 | |
|
|
1063 | sl << uint8 (8) << uint8 (flags); |
|
|
1064 | } |
|
|
1065 | |
|
|
1066 | // faces |
|
|
1067 | |
|
|
1068 | /* Floor face */ |
|
|
1069 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1070 | mask |= 0x4; |
|
|
1071 | |
|
|
1072 | /* Middle face */ |
|
|
1073 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1074 | mask |= 0x2; |
|
|
1075 | |
|
|
1076 | if (ecb_expect_false (ob->invisible) |
|
|
1077 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1078 | && ms.player () == ob) |
|
|
1079 | { |
|
|
1080 | // force player to be visible to himself if invisible |
|
|
1081 | if (lastcell.faces[0] != ob->face) |
|
|
1082 | { |
|
|
1083 | lastcell.faces[0] = ob->face; |
|
|
1084 | |
|
|
1085 | mask |= 0x1; |
|
|
1086 | sl << uint16 (ob->face); |
|
|
1087 | |
|
|
1088 | socket.send_faces (ob); |
|
|
1089 | } |
|
|
1090 | } |
|
|
1091 | /* Top face */ |
|
|
1092 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1093 | mask |= 0x1; |
|
|
1094 | |
|
|
1095 | /* Check to see if we are in fact sending anything for this |
|
|
1096 | * space by checking the mask. If so, update the mask. |
|
|
1097 | * if not, reset the len to that from before adding the mask |
|
|
1098 | * value, so we don't send those bits. |
|
|
1099 | */ |
|
|
1100 | if (mask & 0xf) |
|
|
1101 | sl[oldlen + 1] = mask & 0xff; |
|
|
1102 | else |
|
|
1103 | sl.reset (oldlen); |
|
|
1104 | } /* else this is a viewable space */ |
|
|
1105 | ordered_mapwalk_end |
|
|
1106 | |
|
|
1107 | socket.flush_fx (); |
|
|
1108 | |
|
|
1109 | if (sl.length () > startlen || socket.sent_scroll) |
1459 | } |
1110 | { |
1460 | |
|
|
1461 | ns->send_packet (sl); |
1111 | socket.send_packet (sl); |
1462 | } |
1112 | socket.sent_scroll = 0; |
1463 | |
|
|
1464 | /** |
|
|
1465 | * This sends the spell path to name mapping. We ignore |
|
|
1466 | * the params - we always send the same info no matter what. |
|
|
1467 | */ |
|
|
1468 | void |
|
|
1469 | send_spell_paths (client * ns, char *params) |
|
|
1470 | { |
|
|
1471 | packet sl; |
|
|
1472 | |
|
|
1473 | sl << "replyinfo spell_paths\n"; |
|
|
1474 | |
|
|
1475 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
1476 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
1477 | |
|
|
1478 | if (sl.length () >= MAXSOCKBUF) |
|
|
1479 | { |
1113 | } |
1480 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
1481 | fatal (0); |
|
|
1482 | } |
|
|
1483 | |
|
|
1484 | ns->send_packet (sl); |
|
|
1485 | } |
1114 | } |
1486 | |
1115 | |
1487 | /** |
1116 | /** |
1488 | * This looks for any spells the player may have that have changed their stats. |
1117 | * This looks for any spells the player may have that have changed their stats. |
1489 | * it then sends an updspell packet for each spell that has changed in this way |
1118 | * it then sends an updspell packet for each spell that has changed in this way |
… | |
… | |
1492 | esrv_update_spells (player *pl) |
1121 | esrv_update_spells (player *pl) |
1493 | { |
1122 | { |
1494 | if (!pl->ns) |
1123 | if (!pl->ns) |
1495 | return; |
1124 | return; |
1496 | |
1125 | |
|
|
1126 | pl->ns->update_spells = false; |
|
|
1127 | |
1497 | if (!pl->ns->monitor_spells) |
1128 | if (!pl->ns->monitor_spells) |
1498 | return; |
1129 | return; |
1499 | |
1130 | |
1500 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1131 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1501 | { |
|
|
1502 | if (spell->type == SPELL) |
1132 | if (spell->type == SPELL) |
1503 | { |
1133 | { |
1504 | int flags = 0; |
1134 | int flags = 0; |
|
|
1135 | int val; |
1505 | |
1136 | |
1506 | /* check if we need to update it */ |
1137 | /* check if we need to update it */ |
1507 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1138 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
|
|
1139 | if (spell->cached_sp != val) |
1508 | { |
1140 | { |
1509 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1141 | spell->cached_sp = val; |
1510 | flags |= UPD_SP_MANA; |
1142 | flags |= UPD_SP_MANA; |
1511 | } |
1143 | } |
1512 | |
1144 | |
1513 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1145 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
|
|
1146 | if (spell->cached_grace != val) |
1514 | { |
1147 | { |
1515 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1148 | spell->cached_grace = val; |
1516 | flags |= UPD_SP_GRACE; |
1149 | flags |= UPD_SP_GRACE; |
1517 | } |
1150 | } |
1518 | |
1151 | |
1519 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1152 | val = casting_level (pl->ob, spell); |
|
|
1153 | if (spell->cached_eat != val) |
1520 | { |
1154 | { |
1521 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1155 | spell->cached_eat = val; |
1522 | flags |= UPD_SP_DAMAGE; |
1156 | flags |= UPD_SP_LEVEL; |
1523 | } |
1157 | } |
1524 | |
1158 | |
1525 | if (flags) |
1159 | if (flags) |
1526 | { |
1160 | { |
1527 | packet sl; |
1161 | packet sl; |
1528 | |
1162 | |
1529 | sl << "updspell " |
1163 | sl << "updspell " |
1530 | << uint8 (flags) |
1164 | << uint8 (flags) |
1531 | << uint32 (spell->count); |
1165 | << uint32 (spell->count); |
1532 | |
1166 | |
1533 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1167 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1534 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1168 | if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace); |
1535 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1169 | if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat); |
1536 | |
1170 | |
1537 | pl->ns->send_packet (sl); |
1171 | pl->ns->send_packet (sl); |
1538 | } |
1172 | } |
1539 | } |
1173 | } |
1540 | } |
|
|
1541 | } |
1174 | } |
1542 | |
1175 | |
1543 | void |
1176 | void |
1544 | esrv_remove_spell (player *pl, object *spell) |
1177 | esrv_remove_spell (player *pl, object *spell) |
1545 | { |
1178 | { |
… | |
… | |
1561 | |
1194 | |
1562 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1195 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1563 | static void |
1196 | static void |
1564 | append_spell (player *pl, packet &sl, object *spell) |
1197 | append_spell (player *pl, packet &sl, object *spell) |
1565 | { |
1198 | { |
1566 | int i, skill = 0; |
1199 | int skill = 0; |
1567 | |
1200 | |
1568 | if (!(spell->name)) |
1201 | if (!(spell->name)) |
1569 | { |
1202 | { |
1570 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1203 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1571 | return; |
1204 | return; |
1572 | } |
1205 | } |
1573 | |
1206 | |
1574 | /* store costs and damage in the object struct, to compare to later */ |
1207 | /* store costs and damage in the object struct, to compare to later */ |
1575 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1208 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1576 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1209 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1577 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1210 | spell->cached_eat = casting_level (pl->ob, spell); |
1578 | |
1211 | |
1579 | /* figure out which skill it uses, if it uses one */ |
1212 | /* figure out which skill it uses, if it uses one */ |
1580 | if (spell->skill) |
1213 | if (spell->skill) |
1581 | { |
1214 | if (object *tmp = pl->find_skill (spell->skill)) |
1582 | for (i = 1; i < NUM_SKILLS; i++) |
1215 | skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp); |
1583 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1584 | { |
|
|
1585 | skill = i + CS_STAT_SKILLINFO; |
|
|
1586 | break; |
|
|
1587 | } |
|
|
1588 | } |
|
|
1589 | |
1216 | |
1590 | // spells better have a face |
1217 | // spells better have a face |
1591 | if (!spell->face) |
1218 | if (!spell->face) |
1592 | { |
1219 | { |
1593 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1220 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1594 | spell->face = face_find ("burnout.x11", blank_face); |
1221 | spell->face = face_find ("burnout.x11", blank_face); |
1595 | } |
1222 | } |
|
|
1223 | |
|
|
1224 | pl->ns->send_face (spell->face); |
1596 | |
1225 | |
1597 | /* send the current values */ |
1226 | /* send the current values */ |
1598 | sl << uint32 (spell->count) |
1227 | sl << uint32 (spell->count) |
1599 | << uint16 (spell->level) |
1228 | << uint16 (spell->level) |
1600 | << uint16 (spell->casting_time) |
1229 | << uint16 (spell->casting_time) |
1601 | << uint16 (spell->last_sp) |
1230 | << uint16 (spell->cached_sp) |
1602 | << uint16 (spell->last_grace) |
1231 | << uint16 (spell->cached_grace) |
1603 | << uint16 (spell->last_eat) |
1232 | << uint16 (spell->cached_eat) |
1604 | << uint8 (skill) |
1233 | << uint8 (skill) |
1605 | << uint32 (spell->path_attuned) |
1234 | << uint32 (spell->path_attuned) |
1606 | << uint32 (spell->face) |
1235 | << uint32 (spell->face) |
1607 | << data8 (spell->name) |
1236 | << data8 (spell->name); |
|
|
1237 | |
|
|
1238 | if (pl->ns->monitor_spells < 2) |
1608 | << data16 (spell->msg); |
1239 | sl << data16 (spell->msg); |
1609 | } |
1240 | } |
1610 | |
1241 | |
1611 | /** |
1242 | /** |
1612 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
1243 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
1613 | * all spells in the player's inventory. |
1244 | * all spells in the player's inventory. |
1614 | */ |
1245 | */ |
1615 | void |
1246 | void |
1616 | esrv_add_spells (player *pl, object *spell) |
1247 | esrv_add_spells (player *pl, object *spell) |
1617 | { |
1248 | { |
… | |
… | |
1628 | |
1259 | |
1629 | if (!spell) |
1260 | if (!spell) |
1630 | { |
1261 | { |
1631 | for (spell = pl->ob->inv; spell; spell = spell->below) |
1262 | for (spell = pl->ob->inv; spell; spell = spell->below) |
1632 | { |
1263 | { |
1633 | /* were we to simply keep appending data here, we could exceed |
1264 | /* were we to simply keep appending data here, we could exceed |
1634 | * MAXSOCKBUF if the player has enough spells to add, we know that |
1265 | * MAXSOCKBUF if the player has enough spells to add, we know that |
1635 | * append_spells will always append 19 data bytes, plus 4 length |
1266 | * append_spells will always append 19 data bytes, plus 4 length |
1636 | * bytes and 3 strings (because that is the spec) so we need to |
1267 | * bytes and 3 strings (because that is the spec) so we need to |
1637 | * check that the length of those 3 strings, plus the 23 bytes, |
1268 | * check that the length of those 3 strings, plus the 23 bytes, |
1638 | * won't take us over the length limit for the socket, if it does, |
1269 | * won't take us over the length limit for the socket, if it does, |
1639 | * we need to send what we already have, and restart packet formation |
1270 | * we need to send what we already have, and restart packet formation |
1640 | */ |
1271 | */ |
|
|
1272 | if (spell->type != SPELL) |
|
|
1273 | continue; |
|
|
1274 | |
1641 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1275 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1642 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1276 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1643 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1277 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1644 | * like it will fix this |
1278 | * like it will fix this |
1645 | */ |
1279 | */ |
1646 | if (spell->type != SPELL) |
|
|
1647 | continue; |
|
|
1648 | |
|
|
1649 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1280 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1650 | { |
1281 | { |
|
|
1282 | pl->ns->flush_fx (); |
1651 | pl->ns->send_packet (sl); |
1283 | pl->ns->send_packet (sl); |
1652 | |
1284 | |
1653 | sl.reset (); |
1285 | sl.reset (); |
1654 | sl << "addspell "; |
1286 | sl << "addspell "; |
1655 | } |
1287 | } |
… | |
… | |
1663 | return; |
1295 | return; |
1664 | } |
1296 | } |
1665 | else |
1297 | else |
1666 | append_spell (pl, sl, spell); |
1298 | append_spell (pl, sl, spell); |
1667 | |
1299 | |
1668 | if (sl.length () >= MAXSOCKBUF) |
1300 | if (sl.length () > MAXSOCKBUF) |
1669 | { |
|
|
1670 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1301 | cleanup ("buffer overflow in esrv_add_spells!"); |
1671 | fatal (0); |
|
|
1672 | } |
|
|
1673 | |
1302 | |
1674 | /* finally, we can send the packet */ |
1303 | /* finally, we can send the packet */ |
|
|
1304 | pl->ns->flush_fx (); |
1675 | pl->ns->send_packet (sl); |
1305 | pl->ns->send_packet (sl); |
1676 | } |
1306 | } |
1677 | |
1307 | |
|
|
1308 | //-GPL |
|
|
1309 | |