1 | /* |
1 | /* |
2 | * static char *rcsid_init_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * "$Id: request.C,v 1.12 2006/08/29 08:01:38 root Exp $"; |
3 | * |
4 | */ |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
|
|
8 | |
|
|
9 | Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001 Mark Wedel |
10 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
11 | |
7 | * |
12 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
13 | it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
14 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
15 | (at your option) any later version. |
11 | * option) any later version. |
16 | |
12 | * |
17 | 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, |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
20 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
21 | |
17 | * |
22 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
23 | along with this program; if not, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
25 | |
21 | * |
26 | The author can be reached via e-mail to crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
27 | */ |
23 | */ |
|
|
24 | |
|
|
25 | //+GPL |
28 | |
26 | |
29 | /** |
27 | /** |
30 | * \file |
28 | * \file |
31 | * Client handling. |
29 | * Client handling. |
32 | * |
30 | * |
… | |
… | |
40 | * have the prototype of (char *data, int datalen, int client_num). This |
38 | * have the prototype of (char *data, int datalen, int client_num). This |
41 | * way, we can use one dispatch table. |
39 | * way, we can use one dispatch table. |
42 | * |
40 | * |
43 | * esrv_map_new starts updating the map |
41 | * esrv_map_new starts updating the map |
44 | * |
42 | * |
45 | * esrv_map_setbelow allows filling in all of the faces for the map. |
|
|
46 | * if a face has not already been sent to the client, it is sent now. |
|
|
47 | * |
|
|
48 | * mapcellchanged, compactlayer, compactstack, perform the map compressing |
|
|
49 | * operations |
|
|
50 | * |
|
|
51 | * esrv_map_doneredraw finishes the map update, and ships across the |
|
|
52 | * map updates. |
|
|
53 | * |
|
|
54 | * esrv_map_scroll tells the client to scroll the map, and does similarily |
|
|
55 | * for the locally cached copy. |
|
|
56 | */ |
43 | */ |
57 | |
44 | |
58 | #include <global.h> |
45 | #include <global.h> |
59 | #include <sproto.h> |
46 | #include <sproto.h> |
60 | |
47 | |
61 | #include <newclient.h> |
|
|
62 | #include <newserver.h> |
|
|
63 | #include <living.h> |
48 | #include <living.h> |
64 | #include <commands.h> |
|
|
65 | |
49 | |
66 | /* This block is basically taken from socket.c - I assume if it works there, |
50 | /* This block is basically taken from socket.c - I assume if it works there, |
67 | * it should work here. |
51 | * it should work here. |
68 | */ |
52 | */ |
69 | #ifndef WIN32 /* ---win32 exclude unix headers */ |
|
|
70 | #include <sys/types.h> |
53 | #include <sys/types.h> |
71 | #include <sys/time.h> |
54 | #include <sys/time.h> |
72 | #include <sys/socket.h> |
55 | #include <sys/socket.h> |
73 | #include <netinet/in.h> |
56 | #include <netinet/in.h> |
74 | #include <netdb.h> |
57 | #include <netdb.h> |
75 | #endif /* win32 */ |
|
|
76 | |
58 | |
77 | #ifdef HAVE_UNISTD_H |
|
|
78 | #include <unistd.h> |
59 | #include <unistd.h> |
79 | #endif |
|
|
80 | |
|
|
81 | #ifdef HAVE_SYS_TIME_H |
|
|
82 | #include <sys/time.h> |
60 | #include <sys/time.h> |
83 | #endif |
|
|
84 | |
61 | |
85 | #include "sounds.h" |
62 | #include "sounds.h" |
86 | |
63 | |
87 | /** |
64 | /** |
88 | * This table translates the attack numbers as used within the |
65 | * This table translates the attack numbers as used within the |
89 | * program to the value we use when sending STATS command to the |
66 | * program to the value we use when sending STATS command to the |
90 | * client. If a value is -1, then we don't send that to the |
67 | * client. If a value is -1, then we don't send that to the |
91 | * client. |
68 | * client. |
92 | */ |
69 | */ |
93 | short atnr_cs_stat[NROFATTACKS] = {CS_STAT_RES_PHYS, |
70 | static short atnr_cs_stat[NROFATTACKS] = |
94 | CS_STAT_RES_MAG,CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
71 | { |
95 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
72 | CS_STAT_RES_PHYS, |
96 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */, |
73 | CS_STAT_RES_MAG, |
97 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
74 | CS_STAT_RES_FIRE, |
98 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
75 | CS_STAT_RES_ELEC, |
99 | CS_STAT_RES_FEAR, -1 /* Cancellation */, |
76 | CS_STAT_RES_COLD, |
100 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
77 | CS_STAT_RES_CONF, |
101 | -1 /* Chaos */, -1 /* Counterspell */, |
78 | CS_STAT_RES_ACID, |
102 | -1 /* Godpower */, CS_STAT_RES_HOLYWORD, |
79 | CS_STAT_RES_DRAIN, |
|
|
80 | -1 /* weaponmagic */, |
|
|
81 | CS_STAT_RES_GHOSTHIT, |
|
|
82 | CS_STAT_RES_POISON, |
|
|
83 | CS_STAT_RES_SLOW, |
|
|
84 | CS_STAT_RES_PARA, |
|
|
85 | CS_STAT_TURN_UNDEAD, |
|
|
86 | CS_STAT_RES_FEAR, |
|
|
87 | -1 /* Cancellation */, |
|
|
88 | CS_STAT_RES_DEPLETE, |
|
|
89 | CS_STAT_RES_DEATH, |
|
|
90 | -1 /* Chaos */, |
|
|
91 | -1 /* Counterspell */, |
|
|
92 | -1 /* Godpower */, |
|
|
93 | CS_STAT_RES_HOLYWORD, |
103 | CS_STAT_RES_BLIND, |
94 | CS_STAT_RES_BLIND, |
104 | -1, /* Internal */ |
95 | -1, /* Internal */ |
105 | -1, /* life stealing */ |
96 | -1, /* life stealing */ |
106 | -1 /* Disease - not fully done yet */ |
97 | -1 /* Disease - not fully done yet */ |
107 | }; |
98 | }; |
108 | |
99 | |
109 | static void |
100 | static void |
110 | socket_map_scroll (NewSocket *ns, int dx, int dy) |
101 | socket_map_scroll (client *ns, int dx, int dy) |
111 | { |
102 | { |
112 | struct Map newmap; |
103 | struct Map newmap; |
113 | int x,y, mx, my; |
104 | int x, y, mx, my; |
114 | |
105 | |
115 | { |
|
|
116 | char buf[MAXSOCKBUF]; |
|
|
117 | |
|
|
118 | sprintf(buf,"map_scroll %d %d", dx, dy); |
106 | ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
119 | Write_String_To_Socket(ns, buf, strlen (buf)); |
|
|
120 | } |
|
|
121 | |
107 | |
122 | /* If we are using the Map1aCmd, we may in fact send |
108 | /* If we are using the Map1aCmd, we may in fact send |
123 | * head information that is outside the viewable map. |
109 | * head information that is outside the viewable map. |
124 | * So set the mx,my to the max value we want to |
110 | * So set the mx,my to the max value we want to |
125 | * look for. Removed code to do so - it caused extra |
111 | * look for. Removed code to do so - it caused extra |
126 | * complexities for the client, and probably doesn't make |
112 | * complexities for the client, and probably doesn't make |
127 | * that much difference in bandwidth. |
113 | * that much difference in bandwidth. |
128 | */ |
114 | */ |
129 | mx = ns->mapx; |
115 | mx = ns->mapx; |
130 | my = ns->mapy; |
116 | my = ns->mapy; |
131 | |
117 | |
132 | if (ns->mapmode == Map1aCmd) { |
|
|
133 | mx += MAX_HEAD_OFFSET; |
|
|
134 | my += MAX_HEAD_OFFSET; |
|
|
135 | } |
|
|
136 | |
|
|
137 | /* the x and y here are coordinates for the new map, i.e. if we moved |
118 | /* the x and y here are coordinates for the new map, i.e. if we moved |
138 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
119 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
139 | * if the destination x or y coordinate is outside the viewable |
120 | * if the destination x or y coordinate is outside the viewable |
140 | * area, we clear the values - otherwise, the old values |
121 | * area, we clear the values - otherwise, the old values |
141 | * are preserved, and the check_head thinks it needs to clear them. |
122 | * are preserved, and the check_head thinks it needs to clear them. |
142 | */ |
123 | */ |
143 | for(x=0; x<mx; x++) { |
124 | for (x = 0; x < mx; x++) |
144 | for(y=0; y<my; y++) { |
125 | for (y = 0; y < my; y++) |
145 | if(x >= ns->mapx || y >= ns->mapy) { |
126 | if (x >= ns->mapx || y >= ns->mapy) |
146 | /* clear cells outside the viewable area */ |
127 | /* clear cells outside the viewable area */ |
147 | memset(&newmap.cells[x][y], 0, sizeof(struct MapCell)); |
128 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
148 | } |
|
|
149 | else if ((x+dx) < 0 || (x+dx) >= ns->mapx || (y+dy) < 0 || (y + dy) >= ns->mapy) { |
129 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
150 | /* clear newly visible tiles within the viewable area */ |
130 | /* clear newly visible tiles within the viewable area */ |
151 | memset(&(newmap.cells[x][y]), 0, sizeof(struct MapCell)); |
131 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
152 | } |
132 | else |
153 | else { |
133 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
154 | memcpy(&(newmap.cells[x][y]), |
|
|
155 | &(ns->lastmap.cells[x+dx][y+dy]),sizeof(struct MapCell)); |
|
|
156 | } |
|
|
157 | } |
|
|
158 | } |
|
|
159 | |
134 | |
160 | memcpy(&(ns->lastmap), &newmap,sizeof(struct Map)); |
135 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
161 | |
136 | |
162 | /* Make sure that the next "map1" command will be sent (even if it is |
137 | /* Make sure that the next "map1" command will be sent (even if it is |
163 | * empty). |
138 | * empty). |
164 | */ |
139 | */ |
165 | ns->sent_scroll = 1; |
140 | ns->sent_scroll = 1; |
166 | } |
141 | } |
167 | |
142 | |
168 | static void |
143 | static void |
169 | clear_map (player *pl) |
144 | clear_map (player *pl) |
170 | { |
145 | { |
171 | NewSocket &socket = pl->socket; |
146 | pl->ns->mapinfo_queue_clear (); |
172 | |
147 | |
173 | memset (&socket.lastmap, 0, sizeof (socket.lastmap)); |
148 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
174 | |
149 | |
|
|
150 | pl->ns->force_newmap = false; |
|
|
151 | |
175 | if (socket.newmapcmd == 1) |
152 | if (pl->ns->newmapcmd == 1) |
176 | Write_String_To_Socket (&socket, "newmap", 6); |
153 | pl->ns->send_packet ("newmap"); |
177 | |
154 | |
178 | socket.update_look = 1; |
155 | pl->ns->floorbox_reset (); |
179 | socket.look_position = 0; |
|
|
180 | } |
156 | } |
181 | |
157 | |
|
|
158 | static void |
|
|
159 | send_map_info (player *pl) |
|
|
160 | { |
|
|
161 | client &socket = *pl->ns; |
|
|
162 | object *ob = pl->viewpoint; |
|
|
163 | |
|
|
164 | if (socket.mapinfocmd) |
|
|
165 | { |
|
|
166 | if (ob->map && ob->map->path[0]) |
|
|
167 | { |
|
|
168 | int flags = 0; |
|
|
169 | |
|
|
170 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
171 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
172 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
173 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
174 | |
|
|
175 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
176 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
177 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
178 | } |
|
|
179 | else |
|
|
180 | socket.send_packet ("mapinfo current"); |
|
|
181 | } |
|
|
182 | } |
|
|
183 | |
182 | /** check for map change and send new map data */ |
184 | /** check for map/region change and send new map data */ |
183 | static void |
185 | static void |
184 | check_map_change (player *pl) |
186 | check_map_change (player *pl) |
185 | { |
187 | { |
186 | NewSocket &socket = pl->socket; |
188 | client &socket = *pl->ns; |
187 | object *ob = pl->ob; |
189 | object *ob = pl->viewpoint; |
188 | char buf[MAX_BUF]; /* eauugggh */ |
|
|
189 | |
190 | |
190 | if (socket.current_map != ob->map) |
191 | region *reg = ob->region (); |
|
|
192 | if (socket.current_region != reg) |
|
|
193 | { |
|
|
194 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
195 | socket.current_region = reg; |
191 | { |
196 | } |
|
|
197 | |
|
|
198 | // first try to aovid a full newmap on tiled map scrolls |
|
|
199 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
200 | { |
|
|
201 | rv_vector rv; |
|
|
202 | |
|
|
203 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
204 | |
|
|
205 | // manhattan distance is very handy here |
|
|
206 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
207 | { |
|
|
208 | socket.current_map = ob->map; |
|
|
209 | socket.current_x = ob->x; |
|
|
210 | socket.current_y = ob->y; |
|
|
211 | |
|
|
212 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
213 | socket.floorbox_reset (); |
|
|
214 | send_map_info (pl); |
|
|
215 | } |
|
|
216 | } |
|
|
217 | |
|
|
218 | if (socket.current_map != ob->map || socket.force_newmap) |
|
|
219 | { |
|
|
220 | clear_map (pl); |
192 | socket.current_map = ob->map; |
221 | socket.current_map = ob->map; |
|
|
222 | send_map_info (pl); |
|
|
223 | } |
|
|
224 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
|
|
225 | { |
|
|
226 | int dx = ob->x - socket.current_x; |
|
|
227 | int dy = ob->y - socket.current_y; |
193 | |
228 | |
194 | clear_map (pl); |
229 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
|
|
230 | socket.floorbox_reset (); |
|
|
231 | } |
195 | |
232 | |
196 | if (socket.mapinfocmd) |
233 | socket.current_x = ob->x; |
|
|
234 | socket.current_y = ob->y; |
|
|
235 | } |
|
|
236 | |
|
|
237 | /** |
|
|
238 | * This sends the skill number to name mapping. We ignore |
|
|
239 | * the params - we always send the same info no matter what. |
|
|
240 | */ |
|
|
241 | static void |
|
|
242 | send_skill_info (client *ns, char *params) |
|
|
243 | { |
|
|
244 | packet sl; |
|
|
245 | sl << "replyinfo skill_info\n"; |
|
|
246 | |
|
|
247 | for (int i = 0; i < skillvec.size (); ++i) |
|
|
248 | sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name); |
|
|
249 | |
|
|
250 | if (sl.length () > MAXSOCKBUF) |
|
|
251 | { |
|
|
252 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
253 | fatal (0); |
|
|
254 | } |
|
|
255 | |
|
|
256 | ns->send_packet (sl); |
|
|
257 | } |
|
|
258 | |
|
|
259 | /** |
|
|
260 | * This sends the spell path to name mapping. We ignore |
|
|
261 | * the params - we always send the same info no matter what. |
|
|
262 | */ |
|
|
263 | static void |
|
|
264 | send_spell_paths (client * ns, char *params) |
|
|
265 | { |
|
|
266 | packet sl; |
|
|
267 | |
|
|
268 | sl << "replyinfo spell_paths\n"; |
|
|
269 | |
|
|
270 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
271 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
272 | |
|
|
273 | if (sl.length () > MAXSOCKBUF) |
|
|
274 | { |
|
|
275 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
276 | fatal (0); |
|
|
277 | } |
|
|
278 | |
|
|
279 | ns->send_packet (sl); |
|
|
280 | } |
|
|
281 | |
|
|
282 | /** |
|
|
283 | * RequestInfo is sort of a meta command. There is some specific |
|
|
284 | * request of information, but we call other functions to provide |
|
|
285 | * that information. |
|
|
286 | */ |
|
|
287 | void |
|
|
288 | RequestInfo (char *buf, int len, client *ns) |
|
|
289 | { |
|
|
290 | char *params; |
|
|
291 | |
|
|
292 | /* find the first space, make it null, and update the |
|
|
293 | * params pointer. |
|
|
294 | */ |
|
|
295 | for (params = buf; *params; params++) |
|
|
296 | if (*params == ' ') |
|
|
297 | { |
|
|
298 | *params++ = 0; |
|
|
299 | break; |
|
|
300 | } |
|
|
301 | |
|
|
302 | if (!strcmp (buf, "skill_info")) |
|
|
303 | send_skill_info (ns, params); |
|
|
304 | else if (!strcmp (buf, "spell_paths")) |
|
|
305 | send_spell_paths (ns, params); |
|
|
306 | else |
|
|
307 | { |
|
|
308 | // undo tokenisation above and send replyinfo with the request unchanged |
|
|
309 | if (*params) |
|
|
310 | *--params = ' '; |
|
|
311 | |
|
|
312 | ns->send_packet_printf ("replyinfo %s", buf); |
|
|
313 | } |
|
|
314 | } |
|
|
315 | |
|
|
316 | void |
|
|
317 | ExtCmd (char *buf, int len, player *pl) |
|
|
318 | { |
|
|
319 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
|
|
320 | } |
|
|
321 | |
|
|
322 | void |
|
|
323 | ExtiCmd (char *buf, int len, client *ns) |
|
|
324 | { |
|
|
325 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
326 | } |
|
|
327 | |
|
|
328 | //-GPL |
|
|
329 | |
|
|
330 | void |
|
|
331 | client::mapinfo_queue_clear () |
|
|
332 | { |
|
|
333 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
334 | free (*i); |
|
|
335 | |
|
|
336 | mapinfo_queue.clear (); |
|
|
337 | } |
|
|
338 | |
|
|
339 | bool |
|
|
340 | client::mapinfo_try (char *buf) |
|
|
341 | { |
|
|
342 | char *token = buf; |
|
|
343 | buf += strlen (buf) + 9; |
|
|
344 | |
|
|
345 | // initial map and its origin |
|
|
346 | maptile *map = pl->viewpoint->map; |
|
|
347 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
|
|
348 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
|
|
349 | int max_distance = 8; // limit maximum path length to something generous |
|
|
350 | |
|
|
351 | while (*buf && map && max_distance) |
|
|
352 | { |
|
|
353 | int dir = *buf++ - '1'; |
|
|
354 | |
|
|
355 | if (dir >= 0 && dir <= 3) |
197 | { |
356 | { |
198 | if (ob->map && ob->map->path [0]) |
357 | if (!map->tile_path [dir]) |
|
|
358 | map = 0; |
|
|
359 | else if (map->tile_available (dir, false)) |
199 | { |
360 | { |
200 | int flags = 0; |
361 | maptile *neigh = map->tile_map [dir]; |
201 | |
362 | |
202 | if (ob->map->tile_path [0]) flags |= 1; |
363 | switch (dir) |
203 | if (ob->map->tile_path [1]) flags |= 2; |
364 | { |
204 | if (ob->map->tile_path [2]) flags |= 4; |
365 | case 0: mapy -= neigh->height; break; |
205 | if (ob->map->tile_path [3]) flags |= 8; |
366 | case 2: mapy += map ->height; break; |
|
|
367 | case 3: mapx -= neigh->width ; break; |
|
|
368 | case 1: mapx += map ->width ; break; |
|
|
369 | } |
206 | |
370 | |
207 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
371 | map = neigh; |
208 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
372 | --max_distance; |
209 | ob->map->width, ob->map->height, ob->map->path); |
|
|
210 | } |
373 | } |
211 | else |
374 | else |
212 | snprintf (buf, MAX_BUF, "mapinfo current"); |
375 | return 0; |
213 | |
|
|
214 | Write_String_To_Socket (&socket, buf, strlen (buf)); |
|
|
215 | } |
376 | } |
216 | } |
|
|
217 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
|
|
218 | { |
|
|
219 | int dx = ob->x - socket.current_x; |
|
|
220 | int dy = ob->y - socket.current_y; |
|
|
221 | |
|
|
222 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
|
|
223 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
|
|
224 | else |
377 | else |
|
|
378 | max_distance = 0; |
|
|
379 | } |
|
|
380 | |
|
|
381 | if (!max_distance) |
|
|
382 | send_packet_printf ("mapinfo %s error", token); |
|
|
383 | else if (!map || !map->path) |
|
|
384 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
385 | else |
|
|
386 | { |
|
|
387 | int flags = 0; |
|
|
388 | |
|
|
389 | if (map->tile_path[0]) flags |= 1; |
|
|
390 | if (map->tile_path[1]) flags |= 2; |
|
|
391 | if (map->tile_path[2]) flags |= 4; |
|
|
392 | if (map->tile_path[3]) flags |= 8; |
|
|
393 | |
|
|
394 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
395 | } |
|
|
396 | |
|
|
397 | return 1; |
|
|
398 | } |
|
|
399 | |
|
|
400 | void |
|
|
401 | client::mapinfo_queue_run () |
|
|
402 | { |
|
|
403 | if (mapinfo_queue.empty () || !pl) |
|
|
404 | return; |
|
|
405 | |
|
|
406 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
407 | if (mapinfo_try (mapinfo_queue [i])) |
225 | { |
408 | { |
226 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
409 | free (mapinfo_queue [i]); |
227 | socket.update_look = 1; |
410 | mapinfo_queue.erase (i); |
228 | socket.look_position = 0; |
|
|
229 | } |
411 | } |
230 | } |
412 | else |
231 | |
413 | ++i; |
232 | socket.current_x = ob->x; |
|
|
233 | socket.current_y = ob->y; |
|
|
234 | } |
414 | } |
235 | |
415 | |
236 | void ExtCmd (char *buf, int len, player *pl) |
416 | void |
237 | { |
|
|
238 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
|
|
239 | } |
|
|
240 | |
|
|
241 | void MapInfoCmd (char *buf, int len, player *pl) |
417 | MapInfoCmd (char *buf, int len, player *pl) |
242 | { |
418 | { |
243 | // <mapinfo tag spatial tile-path |
419 | // <mapinfo tag spatial tile-path |
244 | // >mapinfo tag spatial flags x y w h hash |
420 | // >mapinfo tag spatial flags x y w h hash |
245 | |
|
|
246 | char bigbuf[MAX_BUF], *cp, *token; |
|
|
247 | |
421 | |
248 | token = buf; |
422 | char *token = buf; |
249 | // copy token |
423 | |
250 | if (!(buf = strchr (buf, ' '))) |
424 | if (!(buf = strchr (buf, ' '))) |
251 | return; |
425 | return; |
252 | |
426 | |
253 | *buf++ = 0; |
|
|
254 | |
|
|
255 | if (!strncmp (buf, "spatial ", 8)) |
427 | if (!strncmp (buf, " spatial ", 9)) |
256 | { |
428 | { |
257 | buf += 8; |
429 | char *copy = strdup (token); |
|
|
430 | copy [buf - token] = 0; |
258 | |
431 | |
259 | // initial map and its origin |
432 | #if 0 |
260 | mapstruct *map = pl->ob->map; |
433 | // this makes only sense when we flush the buffer immediately |
261 | sint16 dx, dy; |
434 | if (pl->ns->mapinfo_try (copy)) |
262 | int mapx = pl->socket.mapx / 2 - pl->ob->x; |
435 | free (copy); |
263 | int mapy = pl->socket.mapy / 2 - pl->ob->y; |
|
|
264 | int max_distance = 8; // limit maximum path length to something generous |
|
|
265 | |
|
|
266 | while (*buf && map && max_distance) |
|
|
267 | { |
|
|
268 | int dir = *buf++; |
|
|
269 | |
|
|
270 | switch (dir) |
|
|
271 | { |
|
|
272 | case '1': |
|
|
273 | dx = 0; dy = -1; map = get_map_from_coord (map, &dx, &dy); |
|
|
274 | map && (mapy -= map->height); |
|
|
275 | break; |
|
|
276 | case '2': |
|
|
277 | mapx += map->width; |
|
|
278 | dx = map->width; dy = 0; map = get_map_from_coord (map, &dx, &dy); |
|
|
279 | break; |
|
|
280 | case '3': |
|
|
281 | mapy += map->height; |
|
|
282 | dx = 0; dy = map->height; map = get_map_from_coord (map, &dx, &dy); |
|
|
283 | break; |
|
|
284 | case '4': |
|
|
285 | dx = -1; dy = 0; map = get_map_from_coord (map, &dx, &dy); |
|
|
286 | map && (mapx -= map->width); |
|
|
287 | break; |
|
|
288 | } |
|
|
289 | |
|
|
290 | --max_distance; |
|
|
291 | } |
|
|
292 | |
|
|
293 | if (!max_distance) |
|
|
294 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
295 | else if (map && map->path [0]) |
|
|
296 | { |
|
|
297 | int flags = 0; |
|
|
298 | |
|
|
299 | if (map->tile_path [0]) flags |= 1; |
|
|
300 | if (map->tile_path [1]) flags |= 2; |
|
|
301 | if (map->tile_path [2]) flags |= 4; |
|
|
302 | if (map->tile_path [3]) flags |= 8; |
|
|
303 | |
|
|
304 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", |
|
|
305 | token, flags, mapx, mapy, |
|
|
306 | map->width, map->height, map->path); |
|
|
307 | } |
|
|
308 | else |
436 | else |
309 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
437 | #endif |
|
|
438 | pl->ns->mapinfo_queue.push_back (copy); |
310 | } |
439 | } |
311 | else |
440 | else |
312 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
441 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
313 | |
|
|
314 | Write_String_To_Socket (&pl->socket, bigbuf, strlen (bigbuf)); |
|
|
315 | } |
442 | } |
316 | |
443 | |
317 | /** This is the Setup cmd - easy first implementation */ |
444 | /** This is the Setup cmd */ |
|
|
445 | void |
318 | void SetUp(char *buf, int len, NewSocket *ns) |
446 | SetUp (char *buf, int len, client * ns) |
319 | { |
447 | { |
320 | int s, slen; |
448 | INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
321 | char *cmd, *param, cmdback[HUGE_BUF]; |
|
|
322 | |
|
|
323 | /* run through the cmds of setup |
|
|
324 | * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ... |
|
|
325 | * |
|
|
326 | * we send the status of the cmd back, or a FALSE is the cmd is the server unknown |
|
|
327 | * The client then must sort this out |
|
|
328 | */ |
|
|
329 | |
|
|
330 | LOG(llevInfo,"Get SetupCmd:: %s\n", buf); |
|
|
331 | strcpy(cmdback,"setup"); |
|
|
332 | for(s=0;s<len; ) { |
|
|
333 | |
|
|
334 | cmd = &buf[s]; |
|
|
335 | |
|
|
336 | /* find the next space, and put a null there */ |
|
|
337 | for(;buf[s] && buf[s] != ' ';s++) ; |
|
|
338 | buf[s++]=0; |
|
|
339 | while (buf[s] == ' ') s++; |
|
|
340 | |
|
|
341 | if(s>=len) |
|
|
342 | break; |
|
|
343 | |
|
|
344 | param = &buf[s]; |
|
|
345 | |
|
|
346 | for(;buf[s] && buf[s] != ' ';s++) ; |
|
|
347 | buf[s++]=0; |
|
|
348 | while (buf[s] == ' ') s++; |
|
|
349 | |
|
|
350 | slen = strlen(cmdback); |
|
|
351 | safe_strcat(cmdback, " ", &slen, HUGE_BUF); |
|
|
352 | safe_strcat(cmdback, cmd, &slen, HUGE_BUF); |
|
|
353 | safe_strcat(cmdback, " ", &slen, HUGE_BUF); |
|
|
354 | |
|
|
355 | if (!strcmp(cmd,"sound")) { |
|
|
356 | ns->sound = atoi(param); |
|
|
357 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
358 | } |
|
|
359 | else if (!strcmp(cmd,"exp64")) { |
|
|
360 | ns->exp64 = atoi(param); |
|
|
361 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
362 | } else if (!strcmp(cmd, "spellmon")) { |
|
|
363 | ns->monitor_spells = atoi(param); |
|
|
364 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
365 | } else if (!strcmp(cmd,"darkness")) { |
|
|
366 | ns->darkness = atoi(param); |
|
|
367 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
368 | } else if (!strcmp(cmd,"map1cmd")) { |
|
|
369 | if (atoi(param)) ns->mapmode = Map1Cmd; |
|
|
370 | /* if beyond this size, need to use map1cmd no matter what */ |
|
|
371 | if (ns->mapx>11 || ns->mapy>11) ns->mapmode = Map1Cmd; |
|
|
372 | safe_strcat(cmdback, ns->mapmode == Map1Cmd?"1":"0", &slen, HUGE_BUF); |
|
|
373 | } else if (!strcmp(cmd,"map1acmd")) { |
|
|
374 | if (atoi(param)) ns->mapmode = Map1aCmd; |
|
|
375 | /* if beyond this size, need to use map1acmd no matter what */ |
|
|
376 | if (ns->mapx>11 || ns->mapy>11) ns->mapmode = Map1aCmd; |
|
|
377 | safe_strcat(cmdback, ns->mapmode == Map1aCmd?"1":"0", &slen, HUGE_BUF); |
|
|
378 | } else if (!strcmp(cmd,"newmapcmd")) { |
|
|
379 | ns->newmapcmd= atoi(param); |
|
|
380 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
381 | // } else if (!strcmp(cmd,"plugincmd")) { |
|
|
382 | // ns->plugincmd = atoi(param); |
|
|
383 | // safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
384 | } else if (!strcmp(cmd,"mapinfocmd")) { |
|
|
385 | ns->mapinfocmd = atoi(param); |
|
|
386 | safe_strcat(cmdback, "1", &slen, HUGE_BUF); |
|
|
387 | } else if (!strcmp(cmd,"extcmd")) { |
|
|
388 | ns->extcmd = atoi(param); |
|
|
389 | safe_strcat(cmdback, "1", &slen, HUGE_BUF); |
|
|
390 | } else if (!strcmp(cmd,"extmap")) { |
|
|
391 | ns->extmap = atoi(param); |
|
|
392 | safe_strcat(cmdback, "1", &slen, HUGE_BUF); |
|
|
393 | } else if (!strcmp(cmd,"facecache")) { |
|
|
394 | ns->facecache = atoi(param); |
|
|
395 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
396 | } else if (!strcmp(cmd,"faceset")) { |
|
|
397 | char tmpbuf[20]; |
|
|
398 | int q = atoi(param); |
|
|
399 | |
|
|
400 | if (is_valid_faceset(q)) |
|
|
401 | ns->faceset=q; |
|
|
402 | sprintf(tmpbuf,"%d", ns->faceset); |
|
|
403 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
404 | /* if the client is using faceset, it knows about image2 command */ |
|
|
405 | ns->image2=1; |
|
|
406 | } else if (!strcmp(cmd,"itemcmd")) { |
|
|
407 | /* Version of the item protocol command to use. Currently, |
|
|
408 | * only supported versions are 1 and 2. Using a numeric |
|
|
409 | * value will make it very easy to extend this in the future. |
|
|
410 | */ |
|
|
411 | char tmpbuf[20]; |
|
|
412 | int q = atoi(param); |
|
|
413 | if (q<1 || q>2) { |
|
|
414 | strcpy(tmpbuf,"FALSE"); |
|
|
415 | } else { |
|
|
416 | ns->itemcmd = q; |
|
|
417 | sprintf(tmpbuf,"%d", ns->itemcmd); |
|
|
418 | } |
|
|
419 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
420 | } else if (!strcmp(cmd,"mapsize")) { |
|
|
421 | int x, y=0; |
|
|
422 | char tmpbuf[MAX_BUF], *cp; |
|
|
423 | |
|
|
424 | x = atoi(param); |
|
|
425 | for (cp = param; *cp!=0; cp++) |
|
|
426 | if (*cp == 'x' || *cp == 'X') { |
|
|
427 | y = atoi(cp+1); |
|
|
428 | break; |
|
|
429 | } |
|
|
430 | if (x < 9 || y < 9 || x>MAP_CLIENT_X || y > MAP_CLIENT_Y) { |
|
|
431 | sprintf(tmpbuf," %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); |
|
|
432 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
433 | } else { |
|
|
434 | ns->mapx = x; |
|
|
435 | ns->mapy = y; |
|
|
436 | /* better to send back what we are really using and not the |
|
|
437 | * param as given to us in case it gets parsed differently. |
|
|
438 | */ |
|
|
439 | sprintf(tmpbuf,"%dx%d", x,y); |
|
|
440 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
441 | /* If beyond this size and still using orig map command, need to |
|
|
442 | * go to map1cmd. |
|
|
443 | */ |
|
|
444 | if ((x>11 || y>11) && ns->mapmode == Map0Cmd) ns->mapmode = Map1Cmd; |
|
|
445 | } |
|
|
446 | } else if (!strcmp(cmd,"extendedMapInfos")) { |
|
|
447 | /* Added by tchize |
|
|
448 | * prepare to use the mapextended command |
|
|
449 | */ |
|
|
450 | char tmpbuf[20]; |
|
|
451 | ns->ext_mapinfos = (atoi(param)); |
|
|
452 | sprintf(tmpbuf,"%d", ns->ext_mapinfos); |
|
|
453 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
454 | } else if (!strcmp(cmd,"extendedTextInfos")) { |
|
|
455 | /* Added by tchize |
|
|
456 | * prepare to use the extended text commands |
|
|
457 | * Client toggle this to non zero to get exttext |
|
|
458 | */ |
|
|
459 | char tmpbuf[20]; |
|
|
460 | |
|
|
461 | ns->has_readable_type = (atoi(param)); |
|
|
462 | sprintf(tmpbuf,"%d", ns->has_readable_type); |
|
|
463 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
464 | } else { |
|
|
465 | /* Didn't get a setup command we understood - |
|
|
466 | * report a failure to the client. |
|
|
467 | */ |
|
|
468 | safe_strcat(cmdback, "FALSE", &slen, HUGE_BUF); |
|
|
469 | } |
|
|
470 | } /* for processing all the setup commands */ |
|
|
471 | LOG(llevInfo,"SendBack SetupCmd:: %s\n", cmdback); |
|
|
472 | Write_String_To_Socket(ns, cmdback, strlen(cmdback)); |
|
|
473 | } |
449 | } |
474 | |
450 | |
475 | /** |
451 | /** |
476 | * The client has requested to be added to the game. |
452 | * The client has requested to be added to the game. |
477 | * This is what takes care of it. We tell the client how things worked out. |
453 | * This is what takes care of it. We tell the client how things worked out. |
478 | * I am not sure if this file is the best place for this function. however, |
454 | * I am not sure if this file is the best place for this function. however, |
479 | * it either has to be here or init_sockets needs to be exported. |
455 | * it either has to be here or init_sockets needs to be exported. |
480 | */ |
456 | */ |
|
|
457 | void |
481 | void AddMeCmd(char *buf, int len, NewSocket *ns) |
458 | AddMeCmd (char *buf, int len, client *ns) |
482 | { |
459 | { |
483 | Settings oldsettings; |
460 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
484 | oldsettings=settings; |
|
|
485 | if (ns->status != Ns_Add || add_player(ns)) { |
|
|
486 | Write_String_To_Socket(ns, "addme_failed",12); |
|
|
487 | } else { |
|
|
488 | /* Basically, the add_player copies the socket structure into |
|
|
489 | * the player structure, so this one (which is from init_sockets) |
|
|
490 | * is not needed anymore. The write below should still work, as the |
|
|
491 | * stuff in ns is still relevant. |
|
|
492 | */ |
|
|
493 | Write_String_To_Socket(ns, "addme_success",13); |
|
|
494 | socket_info.nconns--; |
|
|
495 | ns->status = Ns_Avail; |
|
|
496 | } |
|
|
497 | settings=oldsettings; |
|
|
498 | } |
461 | } |
499 | |
462 | |
500 | /** Reply to ExtendedInfos command */ |
463 | //+GPL |
501 | void ToggleExtendedInfos (char *buf, int len, NewSocket *ns){ |
|
|
502 | char cmdback[MAX_BUF]; |
|
|
503 | char command[50]; |
|
|
504 | int info,nextinfo; |
|
|
505 | cmdback[0]='\0'; |
|
|
506 | nextinfo=0; |
|
|
507 | while (1){ |
|
|
508 | /* 1. Extract an info*/ |
|
|
509 | info=nextinfo; |
|
|
510 | while ( (info<len) && (buf[info]==' ') ) info++; |
|
|
511 | if (info>=len) |
|
|
512 | break; |
|
|
513 | nextinfo=info+1; |
|
|
514 | while ( (nextinfo<len) && (buf[nextinfo]!=' ') ) |
|
|
515 | nextinfo++; |
|
|
516 | if (nextinfo-info>=49) /*Erroneous info asked*/ |
|
|
517 | continue; |
|
|
518 | strncpy (command,&(buf[info]),nextinfo-info); |
|
|
519 | command[nextinfo-info]='\0'; |
|
|
520 | /* 2. Interpret info*/ |
|
|
521 | if (!strcmp("smooth",command)){ |
|
|
522 | /* Toggle smoothing*/ |
|
|
523 | ns->EMI_smooth=!ns->EMI_smooth; |
|
|
524 | }else{ |
|
|
525 | /*bad value*/ |
|
|
526 | } |
|
|
527 | /*3. Next info*/ |
|
|
528 | } |
|
|
529 | strcpy (cmdback,"ExtendedInfoSet"); |
|
|
530 | if (ns->EMI_smooth){ |
|
|
531 | strcat (cmdback," "); |
|
|
532 | strcat (cmdback,"smoothing"); |
|
|
533 | } |
|
|
534 | Write_String_To_Socket(ns, cmdback,strlen(cmdback)); |
|
|
535 | } |
|
|
536 | /* |
|
|
537 | #define MSG_TYPE_BOOK 1 |
|
|
538 | #define MSG_TYPE_CARD 2 |
|
|
539 | #define MSG_TYPE_PAPER 3 |
|
|
540 | #define MSG_TYPE_SIGN 4 |
|
|
541 | #define MSG_TYPE_MONUMENT 5 |
|
|
542 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
|
|
543 | /** Reply to ExtendedInfos command */ |
|
|
544 | void ToggleExtendedText (char *buf, int len, NewSocket *ns){ |
|
|
545 | char cmdback[MAX_BUF]; |
|
|
546 | char temp[10]; |
|
|
547 | char command[50]; |
|
|
548 | int info,nextinfo,i,flag; |
|
|
549 | cmdback[0]='\0'; |
|
|
550 | nextinfo=0; |
|
|
551 | while (1){ |
|
|
552 | /* 1. Extract an info*/ |
|
|
553 | info=nextinfo; |
|
|
554 | while ( (info<len) && (buf[info]==' ') ) info++; |
|
|
555 | if (info>=len) |
|
|
556 | break; |
|
|
557 | nextinfo=info+1; |
|
|
558 | while ( (nextinfo<len) && (buf[nextinfo]!=' ') ) |
|
|
559 | nextinfo++; |
|
|
560 | if (nextinfo-info>=49) /*Erroneous info asked*/ |
|
|
561 | continue; |
|
|
562 | strncpy (command,&(buf[info]),nextinfo-info); |
|
|
563 | command[nextinfo-info]='\0'; |
|
|
564 | /* 2. Interpret info*/ |
|
|
565 | i = sscanf(command,"%d",&flag); |
|
|
566 | if ( (i==1) && (flag>0) && (flag<=MSG_TYPE_LAST)) |
|
|
567 | ns->supported_readables|=(1<<flag); |
|
|
568 | /*3. Next info*/ |
|
|
569 | } |
|
|
570 | /* Send resulting state */ |
|
|
571 | strcpy (cmdback,"ExtendedTextSet"); |
|
|
572 | for (i=0;i<=MSG_TYPE_LAST;i++) |
|
|
573 | if (ns->supported_readables &(1<<i)){ |
|
|
574 | strcat (cmdback," "); |
|
|
575 | snprintf(temp,sizeof(temp),"%d",i); |
|
|
576 | strcat (cmdback,temp); |
|
|
577 | } |
|
|
578 | Write_String_To_Socket(ns, cmdback,strlen(cmdback)); |
|
|
579 | } |
|
|
580 | |
|
|
581 | /** |
|
|
582 | * A lot like the old AskSmooth (in fact, now called by AskSmooth). |
|
|
583 | * Basically, it makes no sense to wait for the client to request a |
|
|
584 | * a piece of data from us that we know the client wants. So |
|
|
585 | * if we know the client wants it, might as well push it to the |
|
|
586 | * client. |
|
|
587 | */ |
|
|
588 | static void SendSmooth(NewSocket *ns, uint16 face) { |
|
|
589 | uint16 smoothface; |
|
|
590 | unsigned char reply[MAX_BUF]; |
|
|
591 | SockList sl; |
|
|
592 | |
|
|
593 | /* If we can't find a face, return and set it so we won't try to send this |
|
|
594 | * again. |
|
|
595 | */ |
|
|
596 | if ((!FindSmooth (face, &smoothface)) && |
|
|
597 | (!FindSmooth ( smooth_face->number, &smoothface))) { |
|
|
598 | |
|
|
599 | LOG(llevError,"could not findsmooth for %d. Neither default (%s)\n",face,smooth_face->name); |
|
|
600 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
601 | return; |
|
|
602 | } |
|
|
603 | |
|
|
604 | if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
|
|
605 | esrv_send_face(ns, smoothface, 0); |
|
|
606 | |
|
|
607 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
608 | |
|
|
609 | sl.buf=reply; |
|
|
610 | strcpy((char*)sl.buf,"smooth "); |
|
|
611 | sl.len=strlen((char*)sl.buf); |
|
|
612 | SockList_AddShort(&sl, face); |
|
|
613 | SockList_AddShort(&sl, smoothface); |
|
|
614 | Send_With_Handling(ns, &sl); |
|
|
615 | } |
|
|
616 | |
|
|
617 | /** |
|
|
618 | * Tells client the picture it has to use |
|
|
619 | * to smooth a picture number given as argument. |
|
|
620 | */ |
|
|
621 | void AskSmooth (char *buf, int len, NewSocket *ns){ |
|
|
622 | uint16 facenbr; |
|
|
623 | |
|
|
624 | facenbr=atoi (buf); |
|
|
625 | SendSmooth(ns, facenbr); |
|
|
626 | } |
|
|
627 | |
|
|
628 | |
|
|
629 | |
|
|
630 | |
|
|
631 | |
464 | |
632 | /** |
465 | /** |
633 | * This handles the general commands from the client (ie, north, fire, cast, |
466 | * This handles the general commands from the client (ie, north, fire, cast, |
634 | * etc.) |
467 | * etc.) |
635 | */ |
468 | */ |
|
|
469 | void |
636 | void PlayerCmd(char *buf, int len, player *pl) |
470 | PlayerCmd (char *buf, int len, player *pl) |
637 | { |
471 | { |
638 | |
472 | /* Check if there is a count. In theory, a zero count could also be |
639 | /* The following should never happen with a proper or honest client. |
473 | * sent, so check for that also. |
640 | * Therefore, the error message doesn't have to be too clear - if |
|
|
641 | * someone is playing with a hacked/non working client, this gives them |
|
|
642 | * an idea of the problem, but they deserve what they get |
|
|
643 | */ |
474 | */ |
644 | if (pl->state!=ST_PLAYING) { |
475 | if (atoi (buf) || buf[0] == '0') |
645 | new_draw_info_format(NDI_UNIQUE, 0,pl->ob, |
476 | { |
646 | "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
477 | pl->count = atoi ((char *) buf); |
|
|
478 | |
|
|
479 | buf = strchr (buf, ' '); /* advance beyond the numbers */ |
|
|
480 | if (!buf) |
647 | return; |
481 | return; |
648 | } |
482 | |
649 | /* Check if there is a count. In theory, a zero count could also be |
|
|
650 | * sent, so check for that also. |
|
|
651 | */ |
|
|
652 | if (atoi(buf) || buf[0]=='0') { |
|
|
653 | pl->count=atoi((char*)buf); |
|
|
654 | buf=strchr(buf,' '); /* advance beyond the numbers */ |
|
|
655 | if (!buf) { |
|
|
656 | #ifdef ESRV_DEBUG |
|
|
657 | LOG(llevDebug,"PlayerCmd: Got count but no command.\n"); |
|
|
658 | #endif |
|
|
659 | return; |
|
|
660 | } |
|
|
661 | buf++; |
483 | buf++; |
662 | } |
484 | } |
663 | /* This should not happen anymore. */ |
485 | |
664 | if (pl->ob->speed_left<-1.0) { |
|
|
665 | LOG(llevError,"Player has negative time - shouldn't do command.\n"); |
|
|
666 | } |
|
|
667 | /* In c_new.c */ |
|
|
668 | execute_newserver_command(pl->ob, (char*)buf); |
486 | execute_newserver_command (pl->ob, (char *)buf); |
|
|
487 | |
669 | /* Perhaps something better should be done with a left over count. |
488 | /* Perhaps something better should be done with a left over count. |
670 | * Cleaning up the input should probably be done first - all actions |
489 | * Cleaning up the input should probably be done first - all actions |
671 | * for the command that issued the count should be done before any other |
490 | * for the command that issued the count should be done before any other |
672 | * commands. |
491 | * commands. |
673 | */ |
492 | */ |
674 | |
|
|
675 | pl->count=0; |
493 | pl->count = 0; |
676 | |
|
|
677 | } |
494 | } |
678 | |
|
|
679 | |
495 | |
680 | /** |
496 | /** |
681 | * This handles the general commands from the client (ie, north, fire, cast, |
497 | * This handles the general commands from the client (ie, north, fire, cast, |
682 | * etc.). It is a lot like PlayerCmd above, but is called with the |
498 | * etc.). It is a lot like PlayerCmd above, but is called with the |
683 | * 'ncom' method which gives more information back to the client so it |
499 | * 'ncom' method which gives more information back to the client so it |
684 | * can throttle. |
500 | * can throttle. |
685 | */ |
501 | */ |
|
|
502 | void |
686 | void NewPlayerCmd(uint8 *buf, int len, player *pl) |
503 | NewPlayerCmd (char *buf, int len, player *pl) |
687 | { |
504 | { |
688 | int time,repeat; |
505 | if (len <= 6) |
689 | short packet; |
506 | { |
690 | unsigned char command[MAX_BUF]; |
|
|
691 | SockList sl; |
|
|
692 | |
|
|
693 | if (len < 7) { |
|
|
694 | LOG(llevDebug,"Corrupt ncom command <%s> not long enough - discarding\n", buf); |
507 | LOG (llevDebug, "%s: corrupt ncom command <%s>: not long enough (%d) - discarding\n", pl->ns->host, buf, len); |
695 | return; |
508 | return; |
696 | } |
509 | } |
697 | |
510 | |
698 | packet = GetShort_String(buf); |
511 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
699 | repeat = GetInt_String(buf+2); |
512 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
|
|
513 | |
700 | /* -1 is special - no repeat, but don't update */ |
514 | /* -1 is special - no repeat, but don't update */ |
701 | if (repeat!=-1) { |
515 | if (repeat != -1) |
702 | pl->count=repeat; |
516 | pl->count = repeat; |
703 | } |
|
|
704 | if ((len-4) >= MAX_BUF) len=MAX_BUF-5; |
|
|
705 | |
517 | |
706 | strncpy((char*)command, (char*)buf+6, len-4); |
518 | buf += 6; //len -= 6; |
707 | command[len-4]='\0'; |
|
|
708 | |
519 | |
709 | /* The following should never happen with a proper or honest client. |
|
|
710 | * Therefore, the error message doesn't have to be too clear - if |
|
|
711 | * someone is playing with a hacked/non working client, this gives them |
|
|
712 | * an idea of the problem, but they deserve what they get |
|
|
713 | */ |
|
|
714 | if (pl->state!=ST_PLAYING) { |
|
|
715 | new_draw_info_format(NDI_UNIQUE, 0,pl->ob, |
|
|
716 | "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
|
|
717 | return; |
|
|
718 | } |
|
|
719 | |
|
|
720 | /* This should not happen anymore. */ |
|
|
721 | if (pl->ob->speed_left<-1.0) { |
|
|
722 | LOG(llevError,"Player has negative time - shouldn't do command.\n"); |
|
|
723 | } |
|
|
724 | /* In c_new.c */ |
|
|
725 | execute_newserver_command(pl->ob, (char*)command); |
520 | execute_newserver_command (pl->ob, buf); |
|
|
521 | |
726 | /* Perhaps something better should be done with a left over count. |
522 | /* Perhaps something better should be done with a left over count. |
727 | * Cleaning up the input should probably be done first - all actions |
523 | * Cleaning up the input should probably be done first - all actions |
728 | * for the command that issued the count should be done before any other |
524 | * for the command that issued the count should be done before any other |
729 | * commands. |
525 | * commands. |
730 | */ |
526 | */ |
731 | pl->count=0; |
527 | pl->count = 0; |
732 | |
528 | |
|
|
529 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
|
|
530 | int time = pl->ob->has_active_speed () |
|
|
531 | ? (int) (MAX_TIME / pl->ob->speed) |
|
|
532 | : MAX_TIME * 100; |
|
|
533 | |
733 | /* Send confirmation of command execution now */ |
534 | /* Send confirmation of command execution now */ |
734 | sl.buf = command; |
535 | packet sl ("comc"); |
735 | strcpy((char*)sl.buf,"comc "); |
536 | sl << uint16 (cmdid) << uint32 (time); |
736 | sl.len=5; |
537 | pl->ns->send_packet (sl); |
737 | SockList_AddShort(&sl,packet); |
|
|
738 | if (FABS(pl->ob->speed) < 0.001) time=MAX_TIME * 100; |
|
|
739 | else |
|
|
740 | time = ( int )( MAX_TIME/ FABS(pl->ob->speed) ); |
|
|
741 | SockList_AddInt(&sl,time); |
|
|
742 | Send_With_Handling(&pl->socket, &sl); |
|
|
743 | } |
538 | } |
744 | |
|
|
745 | |
539 | |
746 | /** This is a reply to a previous query. */ |
540 | /** This is a reply to a previous query. */ |
|
|
541 | void |
747 | void ReplyCmd(char *buf, int len, player *pl) |
542 | ReplyCmd (char *buf, int len, client *ns) |
748 | { |
543 | { |
|
|
544 | if (ns->state == ST_CUSTOM) |
|
|
545 | { |
|
|
546 | INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
|
|
547 | return; |
|
|
548 | } |
|
|
549 | |
|
|
550 | if (!ns->pl) |
|
|
551 | return; //TODO: depends on the exact reply we are after |
|
|
552 | //TODO: but right now, we always have a ns->pl |
|
|
553 | |
|
|
554 | player *pl = ns->pl; |
|
|
555 | |
749 | /* This is to synthesize how the data would be stored if it |
556 | /* This is to synthesize how the data would be stored if it |
750 | * was normally entered. A bit of a hack, and should be cleaned up |
557 | * was normally entered. A bit of a hack, and should be cleaned up |
751 | * once all the X11 code is removed from the server. |
558 | * once all the X11 code is removed from the server. |
752 | * |
559 | * |
753 | * We pass 13 to many of the functions because this way they |
560 | * We pass 13 to many of the functions because this way they |
754 | * think it was the carriage return that was entered, and the |
561 | * think it was the carriage return that was entered, and the |
755 | * function then does not try to do additional input. |
562 | * function then does not try to do additional input. |
756 | */ |
563 | */ |
757 | snprintf(pl->write_buf, sizeof(pl->write_buf), ":%s", buf); |
564 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
758 | |
565 | |
759 | /* this avoids any hacking here */ |
566 | /* this avoids any hacking here */ |
|
|
567 | |
|
|
568 | switch (ns->state) |
760 | |
569 | { |
761 | switch (pl->state) { |
|
|
762 | case ST_PLAYING: |
570 | case ST_PLAYING: |
763 | LOG(llevError,"Got reply message with ST_PLAYING input state\n"); |
571 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
764 | break; |
|
|
765 | |
|
|
766 | case ST_PLAY_AGAIN: |
|
|
767 | /* We can check this for return value (2==quit). Maybe we |
|
|
768 | * should, and do something appropriate? |
|
|
769 | */ |
|
|
770 | receive_play_again(pl->ob, buf[0]); |
|
|
771 | break; |
|
|
772 | |
|
|
773 | case ST_ROLL_STAT: |
|
|
774 | key_roll_stat(pl->ob,buf[0]); |
|
|
775 | break; |
|
|
776 | |
|
|
777 | case ST_CHANGE_CLASS: |
|
|
778 | |
|
|
779 | key_change_class(pl->ob, buf[0]); |
|
|
780 | break; |
572 | break; |
781 | |
573 | |
782 | case ST_CONFIRM_QUIT: |
|
|
783 | key_confirm_quit(pl->ob, buf[0]); |
|
|
784 | break; |
|
|
785 | |
|
|
786 | case ST_CONFIGURE: |
|
|
787 | LOG(llevError,"In client input handling, but into configure state\n"); |
|
|
788 | pl->state = ST_PLAYING; |
|
|
789 | break; |
|
|
790 | |
|
|
791 | case ST_GET_NAME: |
|
|
792 | receive_player_name(pl->ob,13); |
|
|
793 | break; |
|
|
794 | |
|
|
795 | case ST_GET_PASSWORD: |
|
|
796 | case ST_CONFIRM_PASSWORD: |
|
|
797 | receive_player_password(pl->ob,13); |
|
|
798 | break; |
|
|
799 | |
|
|
800 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
574 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
801 | receive_party_password(pl->ob,13); |
575 | receive_party_password (pl->ob, 13); |
802 | break; |
576 | break; |
803 | |
577 | |
804 | default: |
578 | default: |
805 | LOG(llevError,"Unknown input state: %d\n", pl->state); |
579 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
806 | } |
580 | } |
807 | } |
581 | } |
808 | |
582 | |
809 | /** |
583 | /** |
810 | * Client tells its version. If there is a mismatch, we close the |
584 | * Client tells its version info. |
811 | * socket. In real life, all we should care about is the client having |
|
|
812 | * something older than the server. If we assume the client will be |
|
|
813 | * backwards compatible, having it be a later version should not be a |
|
|
814 | * problem. |
|
|
815 | */ |
585 | */ |
|
|
586 | void |
816 | void VersionCmd(char *buf, int len,NewSocket *ns) |
587 | VersionCmd (char *buf, int len, client *ns) |
817 | { |
588 | { |
818 | char *cp; |
589 | INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len)); |
819 | char version_warning[256]; |
|
|
820 | |
|
|
821 | if (!buf) { |
|
|
822 | LOG(llevError, "CS: received corrupted version command\n"); |
|
|
823 | return; |
|
|
824 | } |
|
|
825 | |
|
|
826 | ns->cs_version = atoi(buf); |
|
|
827 | ns->sc_version = ns->cs_version; |
|
|
828 | if (VERSION_CS != ns->cs_version) { |
|
|
829 | #ifdef ESRV_DEBUG |
|
|
830 | LOG(llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS,ns->cs_version); |
|
|
831 | #endif |
|
|
832 | } |
|
|
833 | cp = strchr(buf+1,' '); |
|
|
834 | if (!cp) return; |
|
|
835 | ns->sc_version = atoi(cp); |
|
|
836 | if (VERSION_SC != ns->sc_version) { |
|
|
837 | #ifdef ESRV_DEBUG |
|
|
838 | LOG(llevDebug, "CS: scversion mismatch (%d,%d)\n",VERSION_SC,ns->sc_version); |
|
|
839 | #endif |
|
|
840 | } |
|
|
841 | cp = strchr(cp+1, ' '); |
|
|
842 | if (cp) { |
|
|
843 | LOG(llevDebug,"CS: connection from client of type <%s>, ip %s\n", cp, ns->host); |
|
|
844 | |
|
|
845 | snprintf (ns->client, sizeof (ns->client), "%s", cp + 1); |
|
|
846 | |
|
|
847 | /* This is first implementation - i skip all beta DX clients with it |
|
|
848 | * Add later stuff here for other clients |
|
|
849 | */ |
|
|
850 | |
|
|
851 | /* these are old dxclients */ |
|
|
852 | /* Version 1024 added support for singular + plural name values - |
|
|
853 | * requiing this minimal value reduces complexity of that code, and it |
|
|
854 | * has been around for a long time. |
|
|
855 | */ |
|
|
856 | if(!strcmp(" CF DX CLIENT", cp) || ns->sc_version < 1024 ) |
|
|
857 | { |
|
|
858 | sprintf(version_warning,"drawinfo %d %s", NDI_RED, "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
|
|
859 | Write_String_To_Socket(ns, version_warning, strlen(version_warning)); |
|
|
860 | } |
|
|
861 | |
|
|
862 | } |
|
|
863 | } |
590 | } |
864 | |
591 | |
865 | /** sound related functions. */ |
592 | /** sound related functions. */ |
866 | |
593 | void |
867 | void SetSound(char *buf, int len, NewSocket *ns) |
594 | SetSound (char *buf, int len, client * ns) |
868 | { |
595 | { |
869 | ns->sound = atoi(buf); |
596 | ns->sound = atoi (buf); |
870 | } |
597 | } |
871 | |
598 | |
872 | /** client wants the map resent */ |
599 | /** client wants the map resent */ |
873 | |
600 | void |
874 | void MapRedrawCmd(char *buf, int len, player *pl) |
601 | MapRedrawCmd (char *buf, int len, player *pl) |
875 | { |
602 | { |
876 | /* This function is currently disabled; just clearing the map state results in |
603 | /* This function is currently disabled; just clearing the map state results in |
877 | * display errors. It should clear the cache and send a newmap command. |
604 | * display errors. It should clear the cache and send a newmap command. |
878 | * Unfortunately this solution does not work because some client versions send |
605 | * Unfortunately this solution does not work because some client versions send |
879 | * a mapredraw command after receiving a newmap command. |
606 | * a mapredraw command after receiving a newmap command. |
880 | */ |
607 | */ |
881 | #if 0 |
|
|
882 | /* Okay, this is MAJOR UGLY. but the only way I know how to |
|
|
883 | * clear the "cache" |
|
|
884 | */ |
|
|
885 | memset(&pl->socket.lastmap, 0, sizeof(struct Map)); |
|
|
886 | draw_client_map(pl->ob); |
|
|
887 | #endif |
|
|
888 | } |
608 | } |
889 | |
609 | |
890 | /** |
610 | /** |
891 | * Moves an object (typically, container to inventory). |
611 | * Moves an object (typically, container to inventory). |
892 | * syntax is: move (to) (tag) (nrof) |
612 | * syntax is: move (to) (tag) (nrof) |
893 | */ |
613 | */ |
|
|
614 | void |
894 | void MoveCmd(char *buf, int len,player *pl) |
615 | MoveCmd (char *buf, int len, player *pl) |
895 | { |
616 | { |
896 | int vals[3], i; |
617 | int to, tag, nrof; |
897 | |
618 | |
898 | /* A little funky here. We only cycle for 2 records, because |
619 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
899 | * we obviously am not going to find a space after the third |
620 | { |
900 | * record. Perhaps we should just replace this with a |
|
|
901 | * sscanf? |
|
|
902 | */ |
|
|
903 | for (i=0; i<2; i++) { |
|
|
904 | vals[i]=atoi(buf); |
|
|
905 | if (!(buf = strchr(buf, ' '))) { |
|
|
906 | LOG(llevError,"Incomplete move command: %s\n", buf); |
621 | LOG (llevError, "Incomplete move command: %s\n", buf); |
907 | return; |
622 | return; |
908 | } |
|
|
909 | buf++; |
|
|
910 | } |
623 | } |
911 | vals[2]=atoi(buf); |
|
|
912 | |
624 | |
913 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
625 | esrv_move_object (pl->ob, to, tag, nrof); |
914 | esrv_move_object(pl->ob,vals[0], vals[1], vals[2]); |
|
|
915 | } |
626 | } |
916 | |
|
|
917 | |
|
|
918 | |
627 | |
919 | /****************************************************************************** |
628 | /****************************************************************************** |
920 | * |
629 | * |
921 | * Start of commands the server sends to the client. |
630 | * Start of commands the server sends to the client. |
922 | * |
631 | * |
… | |
… | |
924 | |
633 | |
925 | /** |
634 | /** |
926 | * Asks the client to query the user. This way, the client knows |
635 | * Asks the client to query the user. This way, the client knows |
927 | * it needs to send something back (vs just printing out a message) |
636 | * it needs to send something back (vs just printing out a message) |
928 | */ |
637 | */ |
|
|
638 | void |
929 | void send_query(NewSocket *ns, uint8 flags, char *text) |
639 | send_query (client *ns, uint8 flags, const char *text) |
930 | { |
640 | { |
931 | char buf[MAX_BUF]; |
|
|
932 | |
|
|
933 | sprintf(buf,"query %d %s", flags, text?text:""); |
641 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
934 | Write_String_To_Socket(ns, buf, strlen(buf)); |
642 | } |
|
|
643 | |
|
|
644 | /** |
|
|
645 | * Get player's current range attack in obuf. |
|
|
646 | */ |
|
|
647 | static void |
|
|
648 | rangetostring (player *pl, char *obuf) |
|
|
649 | { |
|
|
650 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
|
|
651 | |
|
|
652 | #if 0 |
|
|
653 | // print ranged/chosen_skill etc. objects every call |
|
|
654 | printf ("%s %s => %s (%s)\n", |
|
|
655 | pl->ranged_ob ? &pl->ranged_ob->name : "-", |
|
|
656 | pl->combat_ob ? &pl->combat_ob->name : "-", |
|
|
657 | pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-", |
|
|
658 | pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-" |
|
|
659 | ); |
|
|
660 | #endif |
|
|
661 | |
|
|
662 | if (pl->ranged_ob) |
|
|
663 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
664 | |
|
|
665 | if (pl->combat_ob) |
|
|
666 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
667 | |
|
|
668 | #if 0 |
|
|
669 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
670 | if (pl->ob->chosen_skill) |
|
|
671 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
672 | #endif |
|
|
673 | |
|
|
674 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
675 | if (pl->golem) |
|
|
676 | buf << " Golem*: " << pl->golem->name; |
|
|
677 | |
|
|
678 | buf << '\0'; |
|
|
679 | buf.linearise (obuf); |
935 | } |
680 | } |
936 | |
681 | |
937 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
682 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
938 | Old = New; \ |
683 | Old = New; \ |
939 | SockList_AddChar(&sl, Type); \ |
684 | sl << uint8 (Type) << uint64 (New); \ |
940 | SockList_AddInt64(&sl, New); \ |
|
|
941 | } |
685 | } |
942 | |
686 | |
943 | #define AddIfInt(Old,New,Type) if (Old != New) {\ |
687 | #define AddIfInt(Old,New,Type) if (Old != New) {\ |
944 | Old = New; \ |
688 | Old = New; \ |
945 | SockList_AddChar(&sl, Type); \ |
689 | sl << uint8 (Type) << uint32 (New); \ |
946 | SockList_AddInt(&sl, New); \ |
|
|
947 | } |
690 | } |
948 | |
691 | |
949 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
692 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
950 | Old = New; \ |
693 | Old = New; \ |
951 | SockList_AddChar(&sl, Type); \ |
694 | sl << uint8 (Type) << uint16 (New); \ |
952 | SockList_AddShort(&sl, New); \ |
|
|
953 | } |
695 | } |
954 | |
696 | |
955 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
697 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
956 | Old = New; \ |
698 | Old = New; \ |
957 | SockList_AddChar(&sl, Type); \ |
699 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
958 | SockList_AddInt(&sl,(long)(New*FLOAT_MULTI));\ |
|
|
959 | } |
700 | } |
960 | |
701 | |
961 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
702 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
962 | if (Old) free(Old);\ |
|
|
963 | Old = strdup_local(New);\ |
703 | free(Old); Old = strdup (New);\ |
964 | SockList_AddChar(&sl, Type); \ |
704 | sl << uint8 (Type) << data8 (New); \ |
965 | SockList_AddChar(&sl, ( char )strlen(New)); \ |
|
|
966 | strcpy((char*)sl.buf + sl.len, New); \ |
|
|
967 | sl.len += strlen(New); \ |
|
|
968 | } |
705 | } |
969 | |
706 | |
970 | /** |
707 | /** |
971 | * Sends a statistics update. We look at the old values, |
708 | * Sends a statistics update. We look at the old values, |
972 | * and only send what has changed. Stat mapping values are in newclient.h |
709 | * and only send what has changed. Stat mapping values are in newclient.h |
973 | * Since this gets sent a lot, this is actually one of the few binary |
710 | * Since this gets sent a lot, this is actually one of the few binary |
974 | * commands for now. |
711 | * commands for now. |
975 | */ |
712 | */ |
|
|
713 | void |
976 | void esrv_update_stats(player *pl) |
714 | esrv_update_stats (player *pl) |
977 | { |
715 | { |
978 | SockList sl; |
716 | client *ns = pl->ns; |
979 | char buf[MAX_BUF]; |
717 | if (!ns) |
980 | uint16 flags; |
718 | return; |
981 | |
719 | |
982 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
720 | object *ob = pl->observe; |
983 | strcpy((char*)sl.buf,"stats "); |
721 | if (!ob) |
984 | sl.len=strlen((char*)sl.buf); |
722 | return; |
985 | |
723 | |
986 | if(pl->ob != NULL) |
724 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
987 | { |
725 | |
|
|
726 | packet sl ("stats"); |
|
|
727 | |
988 | AddIfShort(pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
728 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
989 | AddIfShort(pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
729 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
990 | AddIfShort(pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
730 | AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP); |
991 | AddIfShort(pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
731 | AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP); |
992 | AddIfShort(pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); |
732 | AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE); |
993 | AddIfShort(pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); |
733 | AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE); |
994 | AddIfShort(pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); |
734 | AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR); |
995 | AddIfShort(pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT); |
|
|
996 | AddIfShort(pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW); |
|
|
997 | AddIfShort(pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS); |
|
|
998 | AddIfShort(pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
735 | AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX); |
999 | AddIfShort(pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
736 | AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON); |
|
|
737 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
|
|
738 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
|
|
739 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
1000 | AddIfShort(pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
740 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
1001 | } |
741 | |
1002 | if(pl->socket.exp64) { |
742 | for (int s = 0; s < CS_NUM_SKILLS; s++) |
1003 | uint8 s; |
743 | if (object *skill = opl->last_skill_ob [s]) |
1004 | for(s=0;s<NUM_SKILLS;s++) { |
744 | if (skill->stats.exp != ns->last_skill_exp [s]) |
1005 | if (pl->last_skill_ob[s] && |
745 | { |
1006 | pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) { |
746 | ns->last_skill_exp [s] = skill->stats.exp; |
1007 | |
747 | |
1008 | /* Always send along the level if exp changes. This is only |
748 | /* Always send along the level if exp changes. This is only |
1009 | * 1 extra byte, but keeps processing simpler. |
749 | * 1 extra byte, but keeps processing simpler. |
1010 | */ |
|
|
1011 | SockList_AddChar(&sl, ( char )( s + CS_STAT_SKILLINFO )); |
|
|
1012 | SockList_AddChar(&sl, ( char )pl->last_skill_ob[s]->level); |
|
|
1013 | SockList_AddInt64(&sl, pl->last_skill_ob[s]->stats.exp); |
|
|
1014 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
|
|
1015 | } |
750 | */ |
|
|
751 | sl << uint8 (CS_STAT_SKILLINFO + s) |
|
|
752 | << uint8 (skill->level) |
|
|
753 | << uint64 (skill->stats.exp); |
1016 | } |
754 | } |
1017 | } |
755 | |
1018 | if (pl->socket.exp64) { |
|
|
1019 | AddIfInt64(pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64); |
756 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
1020 | } else { |
|
|
1021 | AddIfInt(pl->last_stats.exp, ( int )pl->ob->stats.exp, CS_STAT_EXP); |
|
|
1022 | } |
|
|
1023 | AddIfShort(pl->last_level, ( char )pl->ob->level, CS_STAT_LEVEL); |
757 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
1024 | AddIfShort(pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); |
758 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
1025 | AddIfShort(pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); |
759 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
1026 | AddIfShort(pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); |
760 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
1027 | AddIfFloat(pl->last_speed, pl->ob->speed, CS_STAT_SPEED); |
761 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK); |
1028 | AddIfShort(pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); |
762 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
1029 | AddIfFloat(pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
763 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK); |
1030 | AddIfInt(pl->last_weight_limit, (sint32)weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); |
764 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
1031 | flags=0; |
|
|
1032 | if (pl->fire_on) flags |=SF_FIREON; |
|
|
1033 | if (pl->run_on) flags |= SF_RUNON; |
|
|
1034 | |
765 | |
|
|
766 | int flags = (opl->fire_on ? SF_FIREON : 0) |
|
|
767 | | (opl->run_on ? SF_RUNON : 0); |
|
|
768 | |
1035 | AddIfShort(pl->last_flags, flags, CS_STAT_FLAGS); |
769 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
1036 | if (pl->socket.sc_version<1025) { |
|
|
1037 | AddIfShort(pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR); |
|
|
1038 | } else { |
|
|
1039 | int i; |
|
|
1040 | |
770 | |
1041 | for (i=0; i<NROFATTACKS; i++) { |
771 | for (int i = 0; i < NROFATTACKS; i++) |
1042 | /* Skip ones we won't send */ |
772 | /* Skip ones we won't send */ |
1043 | if (atnr_cs_stat[i]==-1) continue; |
773 | if (atnr_cs_stat[i] >= 0) |
1044 | AddIfShort(pl->last_resist[i], pl->ob->resist[i], ( char )atnr_cs_stat[i]); |
774 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
1045 | } |
775 | |
1046 | } |
|
|
1047 | if (pl->socket.monitor_spells) { |
776 | if (pl->ns->monitor_spells) |
|
|
777 | { |
1048 | AddIfInt(pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
778 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1049 | AddIfInt(pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
779 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
1050 | AddIfInt(pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
780 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
1051 | } |
781 | } |
|
|
782 | |
|
|
783 | char buf[MAX_BUF]; |
1052 | rangetostring(pl->ob, buf); /* we want use the new fire & run system in new client */ |
784 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
1053 | AddIfString(pl->socket.stats.range, buf, CS_STAT_RANGE); |
785 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
1054 | set_title(pl->ob, buf); |
786 | set_title (ob, buf); |
1055 | AddIfString(pl->socket.stats.title, buf, CS_STAT_TITLE); |
787 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
1056 | |
788 | |
1057 | /* Only send it away if we have some actual data */ |
789 | /* Only send it away if we have some actual data */ |
1058 | if (sl.len>6) { |
790 | if (sl.length () > 6) |
1059 | #ifdef ESRV_DEBUG |
791 | ns->send_packet (sl); |
1060 | LOG(llevDebug,"Sending stats command, %d bytes long.\n", sl.len); |
|
|
1061 | #endif |
|
|
1062 | Send_With_Handling(&pl->socket, &sl); |
|
|
1063 | } |
|
|
1064 | free(sl.buf); |
|
|
1065 | } |
792 | } |
1066 | |
|
|
1067 | |
793 | |
1068 | /** |
794 | /** |
1069 | * Tells the client that here is a player it should start using. |
795 | * Tells the client that here is a player it should start using. |
1070 | */ |
796 | */ |
1071 | void esrv_new_player(player *pl, uint32 weight) |
797 | void |
|
|
798 | esrv_new_player (player *pl) |
1072 | { |
799 | { |
1073 | SockList sl; |
800 | sint32 weight = pl->ob->client_weight (); |
1074 | |
801 | |
|
|
802 | packet sl ("player"); |
|
|
803 | |
|
|
804 | sl << uint32 (pl->ob->count) |
|
|
805 | << uint32 (weight) |
|
|
806 | << uint32 (pl->ob->face) |
|
|
807 | << data8 (pl->ob->name); |
|
|
808 | |
1075 | pl->last_weight = weight; |
809 | pl->ns->last_weight = weight; |
1076 | |
810 | pl->ns->send_packet (sl); |
1077 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1078 | |
|
|
1079 | strcpy((char*)sl.buf,"player "); |
|
|
1080 | sl.len=strlen((char*)sl.buf); |
|
|
1081 | SockList_AddInt(&sl, pl->ob->count); |
|
|
1082 | SockList_AddInt(&sl, weight); |
|
|
1083 | SockList_AddInt(&sl, pl->ob->face->number); |
|
|
1084 | |
|
|
1085 | SockList_AddChar(&sl, ( char )strlen(pl->ob->name)); |
|
|
1086 | strcpy((char*)sl.buf+sl.len, pl->ob->name); |
|
|
1087 | sl.len += strlen(pl->ob->name); |
|
|
1088 | |
|
|
1089 | Send_With_Handling(&pl->socket, &sl); |
|
|
1090 | free(sl.buf); |
|
|
1091 | SET_FLAG(pl->ob, FLAG_CLIENT_SENT); |
|
|
1092 | } |
811 | } |
1093 | |
|
|
1094 | |
|
|
1095 | /** |
|
|
1096 | * Need to send an animation sequence to the client. |
|
|
1097 | * We will send appropriate face commands to the client if we haven't |
|
|
1098 | * sent them the face yet (this can become quite costly in terms of |
|
|
1099 | * how much we are sending - on the other hand, this should only happen |
|
|
1100 | * when the player logs in and picks stuff up. |
|
|
1101 | */ |
|
|
1102 | void esrv_send_animation(NewSocket *ns, short anim_num) |
|
|
1103 | { |
|
|
1104 | SockList sl; |
|
|
1105 | int i; |
|
|
1106 | |
|
|
1107 | /* Do some checking on the anim_num we got. Note that the animations |
|
|
1108 | * are added in contigous order, so if the number is in the valid |
|
|
1109 | * range, it must be a valid animation. |
|
|
1110 | */ |
|
|
1111 | if (anim_num < 0 || anim_num > num_animations) { |
|
|
1112 | LOG(llevError,"esrv_send_anim (%d) out of bounds??\n",anim_num); |
|
|
1113 | return; |
|
|
1114 | } |
|
|
1115 | |
|
|
1116 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
|
|
1117 | strcpy((char*)sl.buf, "anim "); |
|
|
1118 | sl.len=5; |
|
|
1119 | SockList_AddShort(&sl, anim_num); |
|
|
1120 | SockList_AddShort(&sl, 0); /* flags - not used right now */ |
|
|
1121 | /* Build up the list of faces. Also, send any information (ie, the |
|
|
1122 | * the face itself) down to the client. |
|
|
1123 | */ |
|
|
1124 | for (i=0; i<animations[anim_num].num_animations; i++) { |
|
|
1125 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
|
|
1126 | esrv_send_face(ns,animations[anim_num].faces[i],0); |
|
|
1127 | SockList_AddShort(&sl, animations[anim_num].faces[i]); /* flags - not used right now */ |
|
|
1128 | } |
|
|
1129 | Send_With_Handling(ns, &sl); |
|
|
1130 | free(sl.buf); |
|
|
1131 | ns->anims_sent[anim_num] = 1; |
|
|
1132 | } |
|
|
1133 | |
|
|
1134 | |
812 | |
1135 | /****************************************************************************** |
813 | /****************************************************************************** |
1136 | * |
814 | * |
1137 | * Start of map related commands. |
815 | * Start of map related commands. |
1138 | * |
816 | * |
1139 | ******************************************************************************/ |
817 | ******************************************************************************/ |
1140 | |
818 | |
1141 | /** |
|
|
1142 | * This adds face_num to a map cell at x,y. If the client doesn't have |
|
|
1143 | * the face yet, we will also send it. |
|
|
1144 | */ |
|
|
1145 | static void esrv_map_setbelow(NewSocket *ns, int x,int y, |
|
|
1146 | short face_num, struct Map *newmap) |
|
|
1147 | { |
|
|
1148 | if(newmap->cells[x][y].count >= MAP_LAYERS) { |
|
|
1149 | LOG(llevError,"Too many faces in map cell %d %d\n",x,y); |
|
|
1150 | return; |
|
|
1151 | abort(); |
|
|
1152 | } |
|
|
1153 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
|
|
1154 | newmap->cells[x][y].count ++; |
|
|
1155 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1156 | esrv_send_face(ns,face_num,0); |
|
|
1157 | } |
|
|
1158 | |
|
|
1159 | struct LayerCell { |
|
|
1160 | uint16 xy; |
|
|
1161 | short face; |
|
|
1162 | }; |
|
|
1163 | |
|
|
1164 | struct MapLayer { |
|
|
1165 | int count; |
|
|
1166 | struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y]; |
|
|
1167 | }; |
|
|
1168 | |
|
|
1169 | /** Checkes if map cells have changed */ |
|
|
1170 | static int mapcellchanged(NewSocket *ns,int i,int j, struct Map *newmap) |
|
|
1171 | { |
|
|
1172 | int k; |
|
|
1173 | |
|
|
1174 | if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count) |
|
|
1175 | return 1; |
|
|
1176 | for(k=0;k<newmap->cells[i][j].count;k++) { |
|
|
1177 | if (ns->lastmap.cells[i][j].faces[k] != |
|
|
1178 | newmap->cells[i][j].faces[k]) { |
|
|
1179 | return 1; |
|
|
1180 | } |
|
|
1181 | } |
|
|
1182 | return 0; |
|
|
1183 | } |
|
|
1184 | |
|
|
1185 | /** |
|
|
1186 | * Basically, what this does is pack the data into layers. |
|
|
1187 | * cnum is the client number, cur is the the buffer we put all of |
|
|
1188 | * this data into. we return the end of the data. layers is |
|
|
1189 | * how many layers of data we should back. |
|
|
1190 | */ |
|
|
1191 | static uint8 *compactlayer(NewSocket *ns, unsigned char *cur, int numlayers, |
|
|
1192 | struct Map *newmap) |
|
|
1193 | { |
|
|
1194 | int x,y,k; |
|
|
1195 | int face; |
|
|
1196 | unsigned char *fcur; |
|
|
1197 | struct MapLayer layers[MAP_LAYERS]; |
|
|
1198 | |
|
|
1199 | for(k = 0;k<MAP_LAYERS;k++) |
|
|
1200 | layers[k].count = 0; |
|
|
1201 | fcur = cur; |
|
|
1202 | for(x=0;x<ns->mapx;x++) { |
|
|
1203 | for(y=0;y<ns->mapy;y++) { |
|
|
1204 | if (!mapcellchanged(ns,x,y,newmap)) |
|
|
1205 | continue; |
|
|
1206 | if (newmap->cells[x][y].count == 0) { |
|
|
1207 | *cur = x*ns->mapy+y; /* mark empty space */ |
|
|
1208 | cur++; |
|
|
1209 | continue; |
|
|
1210 | } |
|
|
1211 | for(k=0;k<newmap->cells[x][y].count;k++) { |
|
|
1212 | layers[k].lcells[layers[k].count].xy = x*ns->mapy+y; |
|
|
1213 | layers[k].lcells[layers[k].count].face = |
|
|
1214 | newmap->cells[x][y].faces[k]; |
|
|
1215 | layers[k].count++; |
|
|
1216 | } |
|
|
1217 | } |
|
|
1218 | } |
|
|
1219 | /* If no data, return now. */ |
|
|
1220 | if (fcur == cur && layers[0].count == 0) |
|
|
1221 | return cur; |
|
|
1222 | *cur = 255; /* mark end of explicitly cleared cells */ |
|
|
1223 | cur++; |
|
|
1224 | /* First pack by layers. */ |
|
|
1225 | for(k=0;k<numlayers;k++) { |
|
|
1226 | if (layers[k].count == 0) |
|
|
1227 | break; /* once a layer is entirely empty, no layer below it can |
|
|
1228 | have anything in it either */ |
|
|
1229 | /* Pack by entries in thie layer */ |
|
|
1230 | for(x=0;x<layers[k].count;) { |
|
|
1231 | fcur = cur; |
|
|
1232 | *cur = layers[k].lcells[x].face >> 8; |
|
|
1233 | cur++; |
|
|
1234 | *cur = layers[k].lcells[x].face & 0xFF; |
|
|
1235 | cur++; |
|
|
1236 | face = layers[k].lcells[x].face; |
|
|
1237 | /* Now, we back the redundant data into 1 byte xy pairings */ |
|
|
1238 | for(y=x;y<layers[k].count;y++) { |
|
|
1239 | if (layers[k].lcells[y].face == face) { |
|
|
1240 | *cur = ( uint8 )layers[k].lcells[y].xy; |
|
|
1241 | cur++; |
|
|
1242 | layers[k].lcells[y].face = -1; |
|
|
1243 | } |
|
|
1244 | } |
|
|
1245 | *(cur-1) = *(cur-1) | 128; /* mark for end of xy's; 11*11 < 128 */ |
|
|
1246 | /* forward over the now redundant data */ |
|
|
1247 | while(x < layers[k].count && |
|
|
1248 | layers[k].lcells[x].face == -1) |
|
|
1249 | x++; |
|
|
1250 | } |
|
|
1251 | *fcur = *fcur | 128; /* mark for end of faces at this layer */ |
|
|
1252 | } |
|
|
1253 | return cur; |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | static void esrv_map_doneredraw(NewSocket *ns, struct Map *newmap) |
|
|
1257 | { |
|
|
1258 | static long frames,bytes,tbytes,tframes; |
|
|
1259 | char *cur; |
|
|
1260 | SockList sl; |
|
|
1261 | |
|
|
1262 | |
|
|
1263 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1264 | strcpy((char*)sl.buf,"map "); |
|
|
1265 | sl.len=strlen((char*)sl.buf); |
|
|
1266 | |
|
|
1267 | cur = (char *) compactlayer(ns,(unsigned char*) sl.buf+sl.len,MAP_LAYERS,newmap); |
|
|
1268 | sl.len=cur-(char*)sl.buf; |
|
|
1269 | |
|
|
1270 | /* LOG(llevDebug, "Sending map command.\n");*/ |
|
|
1271 | |
|
|
1272 | if (sl.len>( int )strlen("map ") || ns->sent_scroll) { |
|
|
1273 | /* All of this is just accounting stuff */ |
|
|
1274 | if (tframes>100) { |
|
|
1275 | tframes = tbytes = 0; |
|
|
1276 | } |
|
|
1277 | tframes++; |
|
|
1278 | frames++; |
|
|
1279 | tbytes += sl.len; |
|
|
1280 | bytes += sl.len; |
|
|
1281 | memcpy(&ns->lastmap,newmap,sizeof(struct Map)); |
|
|
1282 | Send_With_Handling(ns, &sl); |
|
|
1283 | ns->sent_scroll = 0; |
|
|
1284 | } |
|
|
1285 | free(sl.buf); |
|
|
1286 | } |
|
|
1287 | |
|
|
1288 | |
|
|
1289 | /** Clears a map cell */ |
819 | /** Clears a map cell */ |
1290 | static void map_clearcell(struct MapCell *cell, int face0, int face1, int face2, int count) |
820 | static void |
|
|
821 | map_clearcell (struct MapCell *cell, int count) |
1291 | { |
822 | { |
1292 | cell->faces[0] = face0; |
823 | cell->faces[0] = 0; |
1293 | cell->faces[1] = face1; |
824 | cell->faces[1] = 0; |
1294 | cell->faces[2] = face2; |
825 | cell->faces[2] = 0; |
|
|
826 | cell->smooth[0] = 0; |
|
|
827 | cell->smooth[1] = 0; |
|
|
828 | cell->smooth[2] = 0; |
1295 | cell->count = count; |
829 | cell->count = count; |
1296 | cell->stat_hp = 0; |
830 | cell->stat_hp = 0; |
|
|
831 | cell->flags = 0; |
1297 | cell->player = 0; |
832 | cell->player = 0; |
1298 | } |
833 | } |
1299 | |
834 | |
1300 | #define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y) |
|
|
1301 | #define MAX_LAYERS 3 |
835 | #define MAX_LAYERS 3 |
1302 | |
|
|
1303 | /* Using a global really isn't a good approach, but saves the over head of |
|
|
1304 | * allocating and deallocating such a block of data each time run through, |
|
|
1305 | * and saves the space of allocating this in the socket object when we only |
|
|
1306 | * need it for this cycle. If the serve is ever threaded, this needs to be |
|
|
1307 | * re-examined. |
|
|
1308 | */ |
|
|
1309 | |
|
|
1310 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
|
|
1311 | |
|
|
1312 | /** |
|
|
1313 | * Returns true if any of the heads for this |
|
|
1314 | * space is set. Returns false if all are blank - this is used |
|
|
1315 | * for empty space checking. |
|
|
1316 | */ |
|
|
1317 | static inline int have_head(int ax, int ay) { |
|
|
1318 | |
|
|
1319 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
|
|
1320 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || |
|
|
1321 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) return 1; |
|
|
1322 | return 0; |
|
|
1323 | } |
|
|
1324 | |
|
|
1325 | /** |
|
|
1326 | * check_head is a bit simplistic version of update_space below. |
|
|
1327 | * basically, it only checks the that the head on space ax,ay at layer |
|
|
1328 | * needs to get sent - if so, it adds the data, sending the head |
|
|
1329 | * if needed, and returning 1. If this no data needs to get |
|
|
1330 | * sent, it returns zero. |
|
|
1331 | */ |
|
|
1332 | static int check_head (SockList &sl, NewSocket &ns, int ax, int ay, int layer) |
|
|
1333 | { |
|
|
1334 | short face_num; |
|
|
1335 | |
|
|
1336 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
|
|
1337 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
|
|
1338 | else |
|
|
1339 | face_num = 0; |
|
|
1340 | |
|
|
1341 | if (face_num != ns.lastmap.cells[ax][ay].faces[layer]) { |
|
|
1342 | SockList_AddShort (&sl, face_num); |
|
|
1343 | if (face_num && !(ns.faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1344 | esrv_send_face (&ns, face_num, 0); |
|
|
1345 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; |
|
|
1346 | ns.lastmap.cells[ax][ay].faces[layer] = face_num; |
|
|
1347 | return 1; |
|
|
1348 | } |
|
|
1349 | |
|
|
1350 | return 0; /* No change */ |
|
|
1351 | } |
|
|
1352 | |
836 | |
1353 | /** |
837 | /** |
1354 | * Removes the need to replicate the same code for each layer. |
838 | * Removes the need to replicate the same code for each layer. |
1355 | * this returns true if this space is now in fact different than |
839 | * this returns true if this space is now in fact different than |
1356 | * it was. |
840 | * it was. |
1357 | * sl is the socklist this data is going into. |
841 | * sl is the socklist this data is going into. |
1358 | * ns is the socket we are working on - all the info we care |
842 | * ns is the socket we are working on - all the info we care |
1359 | * about is in this socket structure, so now need not pass the |
843 | * about is in this socket structure, so now need not pass the |
1360 | * entire player object. |
844 | * entire player object. |
1361 | * mx and my are map coordinate offsets for map mp |
|
|
1362 | * sx and sy are the offsets into the socket structure that |
|
|
1363 | * holds the old values. |
|
|
1364 | * layer is the layer to update, with 2 being the floor and 0 the |
845 | * layer is the layer to update, with 2 being the floor and 0 the |
1365 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
846 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
1366 | * take. Interesting to note that before this function, the map1 function |
847 | * take. Interesting to note that before this function, the map1 function |
1367 | * numbers the spaces differently - I think this was a leftover from |
848 | * numbers the spaces differently - I think this was a leftover from |
1368 | * the map command, where the faces stack up. Sinces that is no longer |
849 | * the map command, where the faces stack up. Sinces that is no longer |
1369 | * the case, it seems to make more sense to have these layer values |
850 | * the case, it seems to make more sense to have these layer values |
1370 | * actually match. |
851 | * actually match. |
1371 | */ |
852 | */ |
1372 | |
853 | static int |
1373 | static int update_space(SockList *sl, NewSocket *ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer) |
854 | update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer) |
1374 | { |
855 | { |
1375 | object *ob, *head; |
856 | object *ob = ms.faces_obj [layer]; |
|
|
857 | |
|
|
858 | /* If there is no object for this space, or if the face for the object |
|
|
859 | * is the blank face, set the face number to zero. |
|
|
860 | * else if we have the stored head object for this space, that takes |
|
|
861 | * precedence over the other object for this space. |
|
|
862 | * otherwise, we do special head processing |
|
|
863 | */ |
|
|
864 | uint16 face_num = ob && ob->face != blank_face ? ob->face : 0; |
|
|
865 | |
|
|
866 | /* We've gotten what face we want to use for the object. Now see if |
|
|
867 | * if it has changed since we last sent it to the client. |
|
|
868 | */ |
|
|
869 | if (lastcell.faces[layer] != face_num) |
|
|
870 | { |
|
|
871 | lastcell.faces[layer] = face_num; |
|
|
872 | |
|
|
873 | if (!ns.faces_sent[face_num]) |
|
|
874 | if (ob) |
|
|
875 | ns.send_faces (ob); |
|
|
876 | else |
|
|
877 | ns.send_face (face_num, 10); |
|
|
878 | |
1376 | uint16 face_num; |
879 | sl << uint16 (face_num); |
1377 | int bx, by,i; |
880 | return 1; |
|
|
881 | } |
1378 | |
882 | |
1379 | /* If there is a multipart object stored away, treat that as more important. |
883 | /* Nothing changed */ |
1380 | * If not, then do the normal processing. |
884 | return 0; |
|
|
885 | } |
|
|
886 | |
|
|
887 | //-GPL |
|
|
888 | |
|
|
889 | // prefetch maps in an area of PREFETCH x PREFETCH around the player |
|
|
890 | #define PREFETCH 40 |
|
|
891 | |
|
|
892 | // prefetch a generous area around the player |
|
|
893 | static void |
|
|
894 | prefetch_surrounding_maps (object *op) |
|
|
895 | { |
|
|
896 | for (maprect *rect = op->map->split_to_tiles (mapwalk_buf, |
|
|
897 | op->x - PREFETCH , op->y - PREFETCH , |
|
|
898 | op->x + PREFETCH + 1, op->y + PREFETCH + 1); |
|
|
899 | rect->m; |
|
|
900 | ++rect) |
|
|
901 | rect->m->touch (); |
|
|
902 | } |
|
|
903 | |
|
|
904 | //+GPL |
|
|
905 | |
|
|
906 | /** |
|
|
907 | * Draws client map. |
|
|
908 | */ |
|
|
909 | void |
|
|
910 | draw_client_map (player *pl) |
|
|
911 | { |
|
|
912 | object *ob = pl->viewpoint; |
|
|
913 | if (!pl->observe->active) |
|
|
914 | return; |
|
|
915 | |
|
|
916 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
917 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
918 | * be OK once they really log in. |
|
|
919 | */ |
|
|
920 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
|
|
921 | return; |
|
|
922 | |
|
|
923 | int startlen, oldlen; |
|
|
924 | |
|
|
925 | check_map_change (pl); |
|
|
926 | prefetch_surrounding_maps (pl->ob); |
|
|
927 | |
|
|
928 | /* do LOS after calls to update_position */ |
|
|
929 | /* unfortunately, we need to udpate los when observing, currently */ |
|
|
930 | if (pl->do_los || pl->viewpoint != pl->ob) |
|
|
931 | { |
|
|
932 | pl->do_los = 0; |
|
|
933 | pl->update_los (); |
|
|
934 | } |
|
|
935 | |
|
|
936 | /** |
|
|
937 | * This function uses the new map1 protocol command to send the map |
|
|
938 | * to the client. It is necessary because the old map command supports |
|
|
939 | * a maximum map size of 15x15. |
|
|
940 | * This function is much simpler than the old one. This is because |
|
|
941 | * the old function optimized to send as few face identifiers as possible, |
|
|
942 | * at the expense of sending more coordinate location (coordinates were |
|
|
943 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
944 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
945 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
946 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
947 | * of what we send, see the doc/Protocol file. |
|
|
948 | * I will describe internally what we do: |
|
|
949 | * the ns->lastmap shows how the map last looked when sent to the client. |
|
|
950 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
951 | * maximum viewable size (As set in config.h). |
|
|
952 | * in the cells, there are faces and a count value. |
|
|
953 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
954 | * is not viewable. |
|
|
955 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
956 | * look like. |
|
|
957 | */ |
|
|
958 | |
|
|
959 | client &socket = *pl->ns; |
|
|
960 | |
|
|
961 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
|
|
962 | |
|
|
963 | startlen = sl.length (); |
|
|
964 | |
|
|
965 | int hx = socket.mapx / 2; |
|
|
966 | int hy = socket.mapy / 2; |
|
|
967 | |
|
|
968 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
|
|
969 | int ax = dx + hx; |
|
|
970 | int ay = dy + hy; |
|
|
971 | |
|
|
972 | int mask = (ax << 10) | (ay << 4); |
|
|
973 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
974 | |
|
|
975 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
976 | * we tell the client as such |
1381 | */ |
977 | */ |
1382 | |
978 | if (!m) |
1383 | head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer]; |
979 | { |
1384 | |
980 | /* space is out of map. Update space and clear values |
1385 | /* Check to see if this head is part of the set of objects |
981 | * if this hasn't already been done. If the space is out |
1386 | * we would normally send for this space. If so, then |
982 | * of the map, it shouldn't have a head. |
1387 | * don't use the head value. We need to do the check |
|
|
1388 | * here and not when setting up the heads[] value for two reasons - |
|
|
1389 | * 1) the heads[] values will get used even if the space is not visible. |
|
|
1390 | * 2) its possible the head is not on the same map as a part, and I'd |
|
|
1391 | * rather not need to do the map translation overhead. |
|
|
1392 | * 3) We need to do some extra checking to make sure that we will |
|
|
1393 | * otherwise send the image as this layer, eg, either it matches |
|
|
1394 | * the head value, or is not multipart. |
|
|
1395 | */ |
983 | */ |
1396 | if (head && !head->more) { |
984 | if (lastcell.count != -1) |
1397 | for (i=0; i<MAP_LAYERS; i++) { |
985 | { |
1398 | ob = GET_MAP_FACE_OBJ(mp, mx, my, i); |
986 | sl << uint16 (mask); |
1399 | if (!ob) continue; |
987 | map_clearcell (&lastcell, -1); |
|
|
988 | } |
1400 | |
989 | |
1401 | if (ob->head) ob=ob->head; |
990 | continue; |
|
|
991 | } |
1402 | |
992 | |
1403 | if (ob == head) { |
993 | int d = pl->blocked_los_uc (dx, dy); |
1404 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL; |
994 | |
1405 | head = NULL; |
995 | if (d > 3) |
1406 | break; |
996 | { |
|
|
997 | /* This block deals with spaces that are not visible for whatever |
|
|
998 | * reason. Still may need to send the head for this space. |
|
|
999 | */ |
|
|
1000 | if (lastcell.count != -1 |
|
|
1001 | || lastcell.faces[0] |
|
|
1002 | || lastcell.faces[1] |
|
|
1003 | || lastcell.faces[2] |
|
|
1004 | || lastcell.stat_hp |
|
|
1005 | || lastcell.flags |
|
|
1006 | || lastcell.player) |
|
|
1007 | sl << uint16 (mask); |
|
|
1008 | |
|
|
1009 | /* properly clear a previously sent big face */ |
|
|
1010 | map_clearcell (&lastcell, -1); |
|
|
1011 | } |
|
|
1012 | else |
|
|
1013 | { |
|
|
1014 | /* In this block, the space is visible. |
|
|
1015 | */ |
|
|
1016 | |
|
|
1017 | /* Rather than try to figure out what everything that we might |
|
|
1018 | * need to send is, then form the packet after that, |
|
|
1019 | * we presume that we will in fact form a packet, and update |
|
|
1020 | * the bits by what we do actually send. If we send nothing, |
|
|
1021 | * we just back out sl.length () to the old value, and no harm |
|
|
1022 | * is done. |
|
|
1023 | * I think this is simpler than doing a bunch of checks to see |
|
|
1024 | * what if anything we need to send, setting the bits, then |
|
|
1025 | * doing those checks again to add the real data. |
|
|
1026 | */ |
|
|
1027 | oldlen = sl.length (); |
|
|
1028 | |
|
|
1029 | sl << uint16 (mask); |
|
|
1030 | |
|
|
1031 | unsigned char dummy; |
|
|
1032 | unsigned char *last_ext = &dummy; |
|
|
1033 | |
|
|
1034 | /* Darkness changed */ |
|
|
1035 | if (lastcell.count != d) |
|
|
1036 | { |
|
|
1037 | mask |= 0x8; |
|
|
1038 | |
|
|
1039 | *last_ext |= 0x80; |
|
|
1040 | last_ext = &sl[sl.length ()]; |
|
|
1041 | sl << uint8 (d); |
|
|
1042 | } |
|
|
1043 | |
|
|
1044 | lastcell.count = d; |
|
|
1045 | |
|
|
1046 | mapspace &ms = m->at (nx, ny); |
|
|
1047 | ms.update (); |
|
|
1048 | |
|
|
1049 | // extmap handling |
|
|
1050 | uint8 stat_hp = 0; |
|
|
1051 | uint8 stat_width = 0; |
|
|
1052 | uint8 flags = 0; |
|
|
1053 | tag_t player = 0; |
|
|
1054 | |
|
|
1055 | // send hp information, if applicable |
|
|
1056 | if (object *op = ms.faces_obj [0]) |
|
|
1057 | if (op->is_head () && !op->invisible) |
|
|
1058 | { |
|
|
1059 | if (op->stats.maxhp > op->stats.hp |
|
|
1060 | && op->stats.maxhp > 0 |
|
|
1061 | && (op->type == PLAYER |
|
|
1062 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1063 | || op->flag [FLAG_MONSTER] |
|
|
1064 | || op->flag [FLAG_ALIVE] |
|
|
1065 | || op->flag [FLAG_GENERATOR])) |
|
|
1066 | { |
|
|
1067 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1068 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1069 | } |
|
|
1070 | |
|
|
1071 | if (expect_false (op->has_dialogue ())) |
|
|
1072 | flags |= 1; |
|
|
1073 | |
|
|
1074 | if (expect_false (op->type == PLAYER)) |
|
|
1075 | player = op == ob ? pl->ob->count |
|
|
1076 | : op == pl->ob ? ob->count |
|
|
1077 | : op->count; |
1407 | } |
1078 | } |
|
|
1079 | |
|
|
1080 | if (expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1081 | { |
|
|
1082 | lastcell.stat_hp = stat_hp; |
|
|
1083 | |
|
|
1084 | mask |= 0x8; |
|
|
1085 | *last_ext |= 0x80; |
|
|
1086 | last_ext = &sl[sl.length ()]; |
|
|
1087 | |
|
|
1088 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1089 | |
|
|
1090 | if (stat_width > 1) |
|
|
1091 | { |
|
|
1092 | *last_ext |= 0x80; |
|
|
1093 | last_ext = &sl[sl.length ()]; |
|
|
1094 | |
|
|
1095 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1096 | } |
1408 | } |
1097 | } |
1409 | } |
|
|
1410 | |
1098 | |
1411 | ob = head; |
1099 | if (expect_false (lastcell.player != player)) |
1412 | if (!ob) ob = GET_MAP_FACE_OBJ(mp, mx, my, layer); |
1100 | { |
|
|
1101 | lastcell.player = player; |
1413 | |
1102 | |
1414 | /* If there is no object for this space, or if the face for the object |
1103 | mask |= 0x8; |
1415 | * is the blank face, set the face number to zero. |
1104 | *last_ext |= 0x80; |
1416 | * else if we have the stored head object for this space, that takes |
1105 | last_ext = &sl[sl.length ()]; |
1417 | * precedence over the other object for this space. |
1106 | |
1418 | * otherwise, we do special head processing |
1107 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1419 | */ |
1108 | } |
1420 | if (!ob || ob->face == blank_face) face_num=0; |
1109 | |
1421 | else if (head){ |
1110 | if (expect_false (lastcell.flags != flags)) |
1422 | /* if this is a head that had previously been stored */ |
1111 | { |
1423 | face_num = ob->face->number; |
1112 | lastcell.flags = flags; |
1424 | } else { |
1113 | |
1425 | /* if the faces for the different parts of a multipart object |
1114 | mask |= 0x8; |
1426 | * are the same, we only want to send the bottom right most |
1115 | *last_ext |= 0x80; |
1427 | * portion of the object. That info is in the tail_.. values |
1116 | last_ext = &sl[sl.length ()]; |
1428 | * of the head. Note that for the head itself, ob->head will |
1117 | |
1429 | * be null, so we only do this block if we are working on |
1118 | sl << uint8 (8) << uint8 (flags); |
1430 | * a tail piece. |
1119 | } |
|
|
1120 | |
|
|
1121 | // faces |
|
|
1122 | |
|
|
1123 | /* Floor face */ |
|
|
1124 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1125 | mask |= 0x4; |
|
|
1126 | |
|
|
1127 | /* Middle face */ |
|
|
1128 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1129 | mask |= 0x2; |
|
|
1130 | |
|
|
1131 | if (expect_false (ob->invisible) |
|
|
1132 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1133 | && ms.player () == ob) |
|
|
1134 | { |
|
|
1135 | // force player to be visible to himself if invisible |
|
|
1136 | if (lastcell.faces[0] != ob->face) |
|
|
1137 | { |
|
|
1138 | lastcell.faces[0] = ob->face; |
|
|
1139 | |
|
|
1140 | mask |= 0x1; |
|
|
1141 | sl << uint16 (ob->face); |
|
|
1142 | |
|
|
1143 | socket.send_faces (ob); |
|
|
1144 | } |
|
|
1145 | } |
|
|
1146 | /* Top face */ |
|
|
1147 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1148 | mask |= 0x1; |
|
|
1149 | |
|
|
1150 | /* Check to see if we are in fact sending anything for this |
|
|
1151 | * space by checking the mask. If so, update the mask. |
|
|
1152 | * if not, reset the len to that from before adding the mask |
|
|
1153 | * value, so we don't send those bits. |
1431 | */ |
1154 | */ |
1432 | |
1155 | if (mask & 0xf) |
1433 | /* tail_x and tail_y will only be set in the head object. If |
1156 | sl[oldlen + 1] = mask & 0xff; |
1434 | * this is the head object and these are set, we proceed |
|
|
1435 | * with logic to only send bottom right. Similarly, if |
|
|
1436 | * this is one of the more parts but the head has those values |
|
|
1437 | * set, we want to do the processing. There can be cases where |
|
|
1438 | * the head is not visible but one of its parts is, so we just |
|
|
1439 | * can always expect that ob->arch->tail_x will be true for all |
|
|
1440 | * object we may want to display. |
|
|
1441 | */ |
|
|
1442 | if ((ob->arch->tail_x || ob->arch->tail_y) || |
|
|
1443 | (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y))) { |
|
|
1444 | |
|
|
1445 | if (ob->head) head = ob->head; |
|
|
1446 | else head = ob; |
|
|
1447 | |
|
|
1448 | /* Basically figure out where the offset is from where we are right |
|
|
1449 | * now. the ob->arch->clone.{x,y} values hold the offset that this current |
|
|
1450 | * piece is from the head, and the tail is where the tail is from the |
|
|
1451 | * head. Note that bx and by will equal sx and sy if we are already working |
|
|
1452 | * on the bottom right corner. If ob is the head, the clone values |
|
|
1453 | * will be zero, so the right thing will still happen. |
|
|
1454 | */ |
|
|
1455 | bx = sx + head->arch->tail_x - ob->arch->clone.x; |
|
|
1456 | by = sy + head->arch->tail_y - ob->arch->clone.y; |
|
|
1457 | |
|
|
1458 | /* I don't think this can ever happen, but better to check for it just |
|
|
1459 | * in case. |
|
|
1460 | */ |
|
|
1461 | if (bx < sx || by < sy) { |
|
|
1462 | LOG(llevError,"update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", |
|
|
1463 | bx, by, sx, sy); |
|
|
1464 | face_num = 0; |
|
|
1465 | } |
|
|
1466 | /* single part object, multipart object with non merged faces, |
|
|
1467 | * of multipart object already at lower right. |
|
|
1468 | */ |
|
|
1469 | else if (bx == sx && by == sy) { |
|
|
1470 | face_num = ob->face->number; |
|
|
1471 | |
|
|
1472 | /* if this face matches one stored away, clear that one away. |
|
|
1473 | * this code relies on the fact that the map1 commands |
|
|
1474 | * goes from 2 down to 0. |
|
|
1475 | */ |
|
|
1476 | for (i=0; i<MAP_LAYERS; i++) |
|
|
1477 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] && |
|
|
1478 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1479 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL; |
|
|
1480 | } |
|
|
1481 | else { |
|
|
1482 | /* If this head is stored away, clear it - otherwise, |
|
|
1483 | * there can be cases where a object is on multiple layers - |
|
|
1484 | * we only want to send it once. |
|
|
1485 | */ |
|
|
1486 | face_num = head->face->number; |
|
|
1487 | for (i=0; i<MAP_LAYERS; i++) |
|
|
1488 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] && |
|
|
1489 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1490 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL; |
|
|
1491 | |
|
|
1492 | /* First, try to put the new head on the same layer. If that is used up, |
|
|
1493 | * then find another layer. |
|
|
1494 | */ |
|
|
1495 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL) { |
|
|
1496 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head; |
|
|
1497 | } else for (i=0; i<MAX_LAYERS; i++) { |
|
|
1498 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL || |
|
|
1499 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head) { |
|
|
1500 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head; |
|
|
1501 | } |
|
|
1502 | } |
|
|
1503 | face_num = 0; /* Don't send this object - we'll send the head later */ |
|
|
1504 | } |
|
|
1505 | } else { |
1157 | else |
1506 | /* In this case, we are already at the lower right or single part object, |
1158 | sl.reset (oldlen); |
1507 | * so nothing special |
|
|
1508 | */ |
|
|
1509 | face_num = ob->face->number; |
|
|
1510 | |
|
|
1511 | /* clear out any head entries that have the same face as this one */ |
|
|
1512 | for (bx=0; bx<layer; bx++) |
|
|
1513 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] && |
|
|
1514 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num) |
|
|
1515 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL; |
|
|
1516 | } |
|
|
1517 | } /* else not already head object or blank face */ |
|
|
1518 | |
|
|
1519 | /* This is a real hack. Basically, if we have nothing to send for this layer, |
|
|
1520 | * but there is a head on the next layer, send that instead. |
|
|
1521 | * Without this, what happens is you can get the case where the player stands |
|
|
1522 | * on the same space as the head. However, if you have overlapping big objects |
|
|
1523 | * of the same type, what happens then is it doesn't think it needs to send |
|
|
1524 | * This tends to make stacking also work/look better. |
|
|
1525 | */ |
|
|
1526 | if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1]) { |
|
|
1527 | face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1]->face->number; |
|
|
1528 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1] = NULL; |
|
|
1529 | } |
|
|
1530 | |
|
|
1531 | /* Another hack - because of heads and whatnot, this face may match one |
|
|
1532 | * we already sent for a lower layer. In that case, don't send |
|
|
1533 | * this one. |
|
|
1534 | */ |
|
|
1535 | if (face_num && layer+1<MAP_LAYERS && ns->lastmap.cells[sx][sy].faces[layer+1] == face_num) { |
|
|
1536 | face_num = 0; |
|
|
1537 | } |
|
|
1538 | |
|
|
1539 | /* We've gotten what face we want to use for the object. Now see if |
|
|
1540 | * if it has changed since we last sent it to the client. |
|
|
1541 | */ |
|
|
1542 | if (ns->lastmap.cells[sx][sy].faces[layer] != face_num) { |
|
|
1543 | ns->lastmap.cells[sx][sy].faces[layer] = face_num; |
|
|
1544 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1545 | esrv_send_face(ns, face_num, 0); |
|
|
1546 | SockList_AddShort(sl, face_num); |
|
|
1547 | return 1; |
|
|
1548 | } |
|
|
1549 | /* Nothing changed */ |
|
|
1550 | return 0; |
|
|
1551 | } |
|
|
1552 | |
|
|
1553 | /** |
|
|
1554 | * This function is mainly a copy of update_space, |
|
|
1555 | * except it handles update of the smoothing updates, |
|
|
1556 | * not the face updates. |
|
|
1557 | * Removes the need to replicate the same code for each layer. |
|
|
1558 | * this returns true if this smooth is now in fact different |
|
|
1559 | * than it was. |
|
|
1560 | * sl is the socklist this data is going into. |
|
|
1561 | * ns is the socket we are working on - all the info we care |
|
|
1562 | * about is in this socket structure, so know need to pass the |
|
|
1563 | * entire player object. |
|
|
1564 | * mx and my are map coordinate offsets for map mp |
|
|
1565 | * sx and sy are the offsets into the socket structure that |
|
|
1566 | * holds the old values. |
|
|
1567 | * layer is the layer to update, with 2 being the floor and 0 the |
|
|
1568 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
|
|
1569 | * take. |
|
|
1570 | */ |
|
|
1571 | |
|
|
1572 | static inline int update_smooth(SockList *sl, NewSocket *ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer) |
|
|
1573 | { |
|
|
1574 | object *ob; |
|
|
1575 | int smoothlevel; /* old face_num;*/ |
|
|
1576 | |
|
|
1577 | ob = GET_MAP_FACE_OBJ(mp, mx, my, layer); |
|
|
1578 | |
|
|
1579 | /* If there is no object for this space, or if the face for the object |
|
|
1580 | * is the blank face, set the smoothlevel to zero. |
|
|
1581 | */ |
|
|
1582 | if (!ob || ob->face == blank_face || MAP_NOSMOOTH(mp)) smoothlevel=0; |
|
|
1583 | else { |
|
|
1584 | smoothlevel = ob->smoothlevel; |
|
|
1585 | if (smoothlevel && !(ns->faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) |
|
|
1586 | SendSmooth(ns, ob->face->number); |
|
|
1587 | } /* else not already head object or blank face */ |
|
|
1588 | |
|
|
1589 | /* We've gotten what face we want to use for the object. Now see if |
|
|
1590 | * if it has changed since we last sent it to the client. |
|
|
1591 | */ |
|
|
1592 | if (smoothlevel>255) |
|
|
1593 | smoothlevel=255; |
|
|
1594 | else if (smoothlevel<0) |
|
|
1595 | smoothlevel=0; |
|
|
1596 | if (ns->lastmap.cells[sx][sy].smooth[layer] != smoothlevel) { |
|
|
1597 | ns->lastmap.cells[sx][sy].smooth[layer] = smoothlevel; |
|
|
1598 | SockList_AddChar(sl, (uint8) (smoothlevel&0xFF)); |
|
|
1599 | return 1; |
|
|
1600 | } |
|
|
1601 | /* Nothing changed */ |
|
|
1602 | return 0; |
|
|
1603 | } |
|
|
1604 | |
|
|
1605 | /** |
|
|
1606 | * Returns the size of a data for a map square as returned by |
|
|
1607 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
1608 | * available. |
|
|
1609 | */ |
|
|
1610 | int getExtendedMapInfoSize(NewSocket* ns){ |
|
|
1611 | int result=0; |
|
|
1612 | if (ns->ext_mapinfos){ |
|
|
1613 | if (ns->EMI_smooth) |
|
|
1614 | result+=1; /*One byte for smoothlevel*/ |
|
|
1615 | } |
|
|
1616 | return result; |
|
|
1617 | } |
|
|
1618 | /** |
|
|
1619 | * This function uses the new map1 protocol command to send the map |
|
|
1620 | * to the client. It is necessary because the old map command supports |
|
|
1621 | * a maximum map size of 15x15. |
|
|
1622 | * This function is much simpler than the old one. This is because |
|
|
1623 | * the old function optimized to send as few face identifiers as possible, |
|
|
1624 | * at the expense of sending more coordinate location (coordinates were |
|
|
1625 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
|
|
1626 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
|
|
1627 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
|
|
1628 | * and use the other 4 bits for other informatiion. For full documentation |
|
|
1629 | * of what we send, see the doc/Protocol file. |
|
|
1630 | * I will describe internally what we do: |
|
|
1631 | * the socket->lastmap shows how the map last looked when sent to the client. |
|
|
1632 | * in the lastmap structure, there is a cells array, which is set to the |
|
|
1633 | * maximum viewable size (As set in config.h). |
|
|
1634 | * in the cells, there are faces and a count value. |
|
|
1635 | * we use the count value to hold the darkness value. If -1, then this space |
|
|
1636 | * is not viewable. |
|
|
1637 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
|
|
1638 | * look like. |
|
|
1639 | */ |
|
|
1640 | void draw_client_map1(object *pl) |
|
|
1641 | { |
|
|
1642 | int x,y,ax, ay, d, startlen, max_x, max_y, oldlen; |
|
|
1643 | sint16 nx, ny; |
|
|
1644 | int estartlen, eoldlen; |
|
|
1645 | SockList sl; |
|
|
1646 | SockList esl; /*For extended Map info*/ |
|
|
1647 | uint16 mask,emask; |
|
|
1648 | uint8 eentrysize; |
|
|
1649 | uint16 ewhatstart,ewhatflag; |
|
|
1650 | uint8 extendedinfos; |
|
|
1651 | mapstruct *m; |
|
|
1652 | NewSocket &socket = pl->contr->socket; |
|
|
1653 | |
|
|
1654 | check_map_change (pl->contr); |
|
|
1655 | |
|
|
1656 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1657 | if (socket.mapmode == Map1Cmd) |
|
|
1658 | strcpy((char*)sl.buf,"map1 "); |
|
|
1659 | else |
|
|
1660 | strcpy((char*)sl.buf,"map1a "); |
|
|
1661 | sl.len=strlen((char*)sl.buf); |
|
|
1662 | startlen = sl.len; |
|
|
1663 | /*Extendedmapinfo structure initialisation*/ |
|
|
1664 | if (socket.ext_mapinfos){ |
|
|
1665 | esl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1666 | strcpy((char*)esl.buf,"mapextended "); |
|
|
1667 | esl.len=strlen((char*)esl.buf); |
|
|
1668 | extendedinfos=EMI_NOREDRAW; |
|
|
1669 | if (socket.EMI_smooth) |
|
|
1670 | extendedinfos|=EMI_SMOOTH; |
|
|
1671 | ewhatstart=esl.len; |
|
|
1672 | ewhatflag=extendedinfos; /*The EMI_NOREDRAW bit |
|
|
1673 | could need to be taken away*/ |
|
|
1674 | SockList_AddChar(&esl, extendedinfos); |
|
|
1675 | eentrysize=getExtendedMapInfoSize(&socket); |
|
|
1676 | SockList_AddChar(&esl, eentrysize); |
|
|
1677 | estartlen = esl.len; |
|
|
1678 | } else { |
|
|
1679 | /* suppress compiler warnings */ |
|
|
1680 | ewhatstart = 0; |
|
|
1681 | ewhatflag = 0; |
|
|
1682 | estartlen = 0; |
|
|
1683 | } |
|
|
1684 | /* Init data to zero */ |
|
|
1685 | memset(heads, 0, sizeof(object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS); |
|
|
1686 | |
|
|
1687 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1688 | * locations. |
|
|
1689 | */ |
|
|
1690 | ay=0; |
|
|
1691 | |
|
|
1692 | /* We could do this logic as conditionals in the if statement, |
|
|
1693 | * but that started to get a bit messy to look at. |
|
|
1694 | */ |
|
|
1695 | max_x = pl->x+(socket.mapx+1)/2; |
|
|
1696 | max_y = pl->y+(socket.mapy+1)/2; |
|
|
1697 | if (socket.mapmode == Map1aCmd) { |
|
|
1698 | max_x += MAX_HEAD_OFFSET; |
|
|
1699 | max_y += MAX_HEAD_OFFSET; |
|
|
1700 | } |
|
|
1701 | |
|
|
1702 | for(y=pl->y-socket.mapy/2; y<max_y; y++,ay++) { |
|
|
1703 | ax=0; |
|
|
1704 | for(x=pl->x-socket.mapx/2;x<max_x;x++,ax++) { |
|
|
1705 | |
|
|
1706 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1707 | |
|
|
1708 | /* If this space is out of the normal viewable area, we only check |
|
|
1709 | * the heads value ax or ay will only be greater than what |
|
|
1710 | * the client wants if using the map1a command - this is because |
|
|
1711 | * if the map1a command is not used, max_x and max_y will be |
|
|
1712 | * set to lower values. |
|
|
1713 | */ |
|
|
1714 | if (ax >= socket.mapx || ay >= socket.mapy) { |
|
|
1715 | int i, got_one; |
|
|
1716 | |
|
|
1717 | oldlen = sl.len; |
|
|
1718 | |
|
|
1719 | SockList_AddShort(&sl, mask); |
|
|
1720 | |
|
|
1721 | if (check_head (sl, socket, ax, ay, 2)) |
|
|
1722 | mask |= 0x4; |
|
|
1723 | if (check_head (sl, socket, ax, ay, 1)) |
|
|
1724 | mask |= 0x2; |
|
|
1725 | if (check_head (sl, socket, ax, ay, 0)) |
|
|
1726 | mask |= 0x1; |
|
|
1727 | |
|
|
1728 | /* If all we are doing is sending 0 (blank) faces, we don't |
|
|
1729 | * actually need to send that - just the coordinates |
|
|
1730 | * with no faces tells the client to blank out the |
|
|
1731 | * space. |
|
|
1732 | */ |
|
|
1733 | got_one=0; |
|
|
1734 | for (i=oldlen+2; i<sl.len; i++) { |
|
|
1735 | if (sl.buf[i]) got_one=1; |
|
|
1736 | } |
|
|
1737 | |
|
|
1738 | if (got_one && (mask & 0xf)) { |
|
|
1739 | sl.buf[oldlen+1] = mask & 0xff; |
|
|
1740 | } else { /*either all faces blank, either no face at all*/ |
|
|
1741 | if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates*/ |
|
|
1742 | sl.len = oldlen + 2; |
|
|
1743 | else |
|
|
1744 | sl.len = oldlen; |
|
|
1745 | } |
|
|
1746 | /*What concerns extendinfos, nothing to be done for now |
|
|
1747 | * (perhaps effects layer later) |
|
|
1748 | */ |
|
|
1749 | continue; /* don't do processing below */ |
|
|
1750 | } |
|
|
1751 | |
|
|
1752 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
1753 | |
|
|
1754 | d = pl->contr->blocked_los[ax][ay]; |
|
|
1755 | |
|
|
1756 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
1757 | * we tell the client as such |
|
|
1758 | */ |
|
|
1759 | nx=x; |
|
|
1760 | ny=y; |
|
|
1761 | m = get_map_from_coord(pl->map, &nx, &ny); |
|
|
1762 | if (!m) { |
|
|
1763 | /* space is out of map. Update space and clear values |
|
|
1764 | * if this hasn't already been done. If the space is out |
|
|
1765 | * of the map, it shouldn't have a head |
|
|
1766 | */ |
|
|
1767 | if (lastcell.count != -1) { |
|
|
1768 | SockList_AddShort(&sl, mask); |
|
|
1769 | map_clearcell(&lastcell,0,0,0,-1); |
|
|
1770 | } |
|
|
1771 | } else if (d>3) { |
|
|
1772 | int need_send=0, count; |
|
|
1773 | /* This block deals with spaces that are not visible for whatever |
|
|
1774 | * reason. Still may need to send the head for this space. |
|
|
1775 | */ |
|
|
1776 | |
|
|
1777 | oldlen = sl.len; |
|
|
1778 | |
|
|
1779 | SockList_AddShort(&sl, mask); |
|
|
1780 | if (lastcell.count != -1) need_send=1; |
|
|
1781 | count = -1; |
|
|
1782 | |
|
|
1783 | if (socket.mapmode == Map1aCmd && have_head(ax, ay)) { |
|
|
1784 | /* Now check to see if any heads need to be sent */ |
|
|
1785 | |
|
|
1786 | if (check_head (sl, socket, ax, ay, 2)) |
|
|
1787 | mask |= 0x4; |
|
|
1788 | if (check_head (sl, socket, ax, ay, 1)) |
|
|
1789 | mask |= 0x2; |
|
|
1790 | if (check_head (sl, socket, ax, ay, 0)) |
|
|
1791 | mask |= 0x1; |
|
|
1792 | |
|
|
1793 | lastcell.count = count; |
|
|
1794 | |
|
|
1795 | } else { |
|
|
1796 | struct MapCell *cell = &lastcell; |
|
|
1797 | /* properly clear a previously sent big face */ |
|
|
1798 | if(cell->faces[0] != 0 |
|
|
1799 | || cell->faces[1] != 0 |
|
|
1800 | || cell->faces[2] != 0) |
|
|
1801 | need_send = 1; |
|
|
1802 | map_clearcell(&lastcell, 0, 0, 0, count); |
|
|
1803 | } |
|
|
1804 | |
|
|
1805 | if ((mask & 0xf) || need_send) { |
|
|
1806 | sl.buf[oldlen+1] = mask & 0xff; |
|
|
1807 | } else { |
|
|
1808 | sl.len = oldlen; |
|
|
1809 | } |
|
|
1810 | } else { |
|
|
1811 | /* In this block, the space is visible or there are head objects |
|
|
1812 | * we need to send. |
|
|
1813 | */ |
|
|
1814 | |
|
|
1815 | /* Rather than try to figure out what everything that we might |
|
|
1816 | * need to send is, then form the packet after that, |
|
|
1817 | * we presume that we will in fact form a packet, and update |
|
|
1818 | * the bits by what we do actually send. If we send nothing, |
|
|
1819 | * we just back out sl.len to the old value, and no harm |
|
|
1820 | * is done. |
|
|
1821 | * I think this is simpler than doing a bunch of checks to see |
|
|
1822 | * what if anything we need to send, setting the bits, then |
|
|
1823 | * doing those checks again to add the real data. |
|
|
1824 | */ |
|
|
1825 | oldlen = sl.len; |
|
|
1826 | mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1827 | eoldlen = esl.len; |
|
|
1828 | emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1829 | SockList_AddShort(&sl, mask); |
|
|
1830 | |
|
|
1831 | if (socket.ext_mapinfos) |
|
|
1832 | SockList_AddShort(&esl, emask); |
|
|
1833 | |
|
|
1834 | unsigned char dummy; |
|
|
1835 | unsigned char *last_ext = &dummy; |
|
|
1836 | |
|
|
1837 | /* Darkness changed */ |
|
|
1838 | if (lastcell.count != d && socket.darkness) { |
|
|
1839 | mask |= 0x8; |
|
|
1840 | |
|
|
1841 | if (socket.extmap) |
|
|
1842 | { |
|
|
1843 | *last_ext |= 0x80; last_ext = sl.buf + sl.len; SockList_AddChar (&sl, d); |
|
|
1844 | } |
|
|
1845 | else |
|
|
1846 | SockList_AddChar (&sl, 255 - 64 * d); |
|
|
1847 | } |
|
|
1848 | |
|
|
1849 | lastcell.count = d; |
|
|
1850 | |
|
|
1851 | if (socket.extmap) |
|
|
1852 | { |
|
|
1853 | uint8 stat_hp = 0; |
|
|
1854 | uint8 stat_width = 0; |
|
|
1855 | tag_t player = 0; |
|
|
1856 | |
|
|
1857 | // send hp information, if applicable |
|
|
1858 | if (object *op = GET_MAP_FACE_OBJ (m, nx, ny, 0)) |
|
|
1859 | { |
|
|
1860 | if (op->head || op->invisible) |
|
|
1861 | ; // do not show |
|
|
1862 | else if (op->type == PLAYER |
|
|
1863 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1864 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1865 | || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1866 | { |
|
|
1867 | if (op->stats.maxhp > 0 |
|
|
1868 | && (unsigned)op->stats.maxhp > (unsigned)op->stats.hp) |
|
|
1869 | { |
|
|
1870 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1871 | stat_width = op->arch->tail_x; |
|
|
1872 | } |
|
|
1873 | } |
|
|
1874 | |
|
|
1875 | if (op->type == PLAYER && op != pl) |
|
|
1876 | player = op->count; |
|
|
1877 | } |
|
|
1878 | |
|
|
1879 | if (lastcell.stat_hp != stat_hp && 0) |
|
|
1880 | { |
|
|
1881 | lastcell.stat_hp = stat_hp; |
|
|
1882 | |
|
|
1883 | mask |= 0x8; |
|
|
1884 | *last_ext |= 0x80; last_ext = sl.buf + sl.len; SockList_AddChar (&sl, 5); |
|
|
1885 | SockList_AddChar (&sl, stat_hp); |
|
|
1886 | |
|
|
1887 | if (stat_width > 1) |
|
|
1888 | { |
|
|
1889 | *last_ext |= 0x80; last_ext = sl.buf + sl.len; SockList_AddChar (&sl, 6); |
|
|
1890 | SockList_AddChar (&sl, stat_width); |
|
|
1891 | } |
|
|
1892 | } |
|
|
1893 | |
|
|
1894 | if (lastcell.player != player && 0) |
|
|
1895 | { |
|
|
1896 | lastcell.player = player; |
|
|
1897 | mask |= 0x8; |
|
|
1898 | *last_ext |= 0x80; last_ext = sl.buf + sl.len; SockList_AddChar (&sl, 0x47); |
|
|
1899 | SockList_AddChar (&sl, 4); |
|
|
1900 | SockList_AddInt (&sl, player); |
|
|
1901 | } |
|
|
1902 | } |
|
|
1903 | |
|
|
1904 | /* Floor face */ |
|
|
1905 | if (update_space(&sl, &socket, m, nx, ny, ax, ay, 2)) |
|
|
1906 | mask |= 0x4; |
|
|
1907 | |
|
|
1908 | if (socket.EMI_smooth) |
|
|
1909 | if (update_smooth(&esl, &socket, m, nx, ny, ax, ay, 2)) |
|
|
1910 | emask |= 0x4; |
|
|
1911 | |
|
|
1912 | /* Middle face */ |
|
|
1913 | if (update_space(&sl, &socket, m, nx, ny, ax, ay, 1)) |
|
|
1914 | mask |= 0x2; |
|
|
1915 | |
|
|
1916 | if (socket.EMI_smooth) |
|
|
1917 | if (update_smooth(&esl, &socket, m, nx, ny, ax, ay, 1)) |
|
|
1918 | emask |= 0x2; |
|
|
1919 | |
|
|
1920 | if(nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) { |
|
|
1921 | if (lastcell.faces[0] != pl->face->number) { |
|
|
1922 | lastcell.faces[0] = pl->face->number; |
|
|
1923 | mask |= 0x1; |
|
|
1924 | if (!(socket.faces_sent[pl->face->number] &NS_FACESENT_FACE)) |
|
|
1925 | esrv_send_face(&socket, pl->face->number, 0); |
|
|
1926 | SockList_AddShort(&sl, pl->face->number); |
|
|
1927 | } |
|
|
1928 | } |
|
|
1929 | /* Top face */ |
|
|
1930 | else { |
|
|
1931 | if (update_space(&sl, &socket, m, nx, ny, ax, ay, 0)) |
|
|
1932 | mask |= 0x1; |
|
|
1933 | if (socket.EMI_smooth) |
|
|
1934 | if (update_smooth(&esl, &socket, m, nx, ny, ax, ay, 0)){ |
|
|
1935 | emask |= 0x1; |
|
|
1936 | } |
|
|
1937 | } |
|
|
1938 | /* Check to see if we are in fact sending anything for this |
|
|
1939 | * space by checking the mask. If so, update the mask. |
|
|
1940 | * if not, reset the len to that from before adding the mask |
|
|
1941 | * value, so we don't send those bits. |
|
|
1942 | */ |
|
|
1943 | if (mask & 0xf) { |
|
|
1944 | sl.buf[oldlen+1] = mask & 0xff; |
|
|
1945 | } else { |
|
|
1946 | sl.len = oldlen; |
|
|
1947 | } |
|
|
1948 | if (emask & 0xf) { |
|
|
1949 | esl.buf[eoldlen+1] = emask & 0xff; |
|
|
1950 | } else { |
|
|
1951 | esl.len = eoldlen; |
|
|
1952 | } |
|
|
1953 | } /* else this is a viewable space */ |
1159 | } /* else this is a viewable space */ |
1954 | } /* for x loop */ |
1160 | ordered_mapwalk_end |
1955 | } /* for y loop */ |
|
|
1956 | |
1161 | |
1957 | /* Verify that we in fact do need to send this */ |
1162 | socket.flush_fx (); |
1958 | if (socket.ext_mapinfos){ |
1163 | |
1959 | if (!(sl.len>startlen || socket.sent_scroll)){ |
|
|
1960 | /* No map data will follow, so don't say the client |
|
|
1961 | * it doesn't need draw! |
|
|
1962 | */ |
|
|
1963 | ewhatflag&=(~EMI_NOREDRAW); |
|
|
1964 | esl.buf[ewhatstart+1] = ewhatflag & 0xff; |
|
|
1965 | } |
|
|
1966 | if (esl.len>estartlen) { |
|
|
1967 | Send_With_Handling(&socket, &esl); |
|
|
1968 | } |
|
|
1969 | free(esl.buf); |
|
|
1970 | } |
|
|
1971 | if (sl.len>startlen || socket.sent_scroll) { |
1164 | if (sl.length () > startlen || socket.sent_scroll) |
1972 | Send_With_Handling(&socket, &sl); |
1165 | { |
|
|
1166 | socket.send_packet (sl); |
1973 | socket.sent_scroll = 0; |
1167 | socket.sent_scroll = 0; |
1974 | } |
|
|
1975 | free(sl.buf); |
|
|
1976 | } |
|
|
1977 | |
|
|
1978 | /** |
|
|
1979 | * Draws client map. |
|
|
1980 | */ |
|
|
1981 | void draw_client_map(object *pl) |
|
|
1982 | { |
|
|
1983 | int i,j; |
|
|
1984 | sint16 ax, ay, nx, ny;/* ax and ay goes from 0 to max-size of arrays */ |
|
|
1985 | New_Face *face,*floor; |
|
|
1986 | New_Face *floor2; |
|
|
1987 | int d, mflags; |
|
|
1988 | struct Map newmap; |
|
|
1989 | mapstruct *m, *pm; |
|
|
1990 | |
|
|
1991 | if (pl->type != PLAYER) { |
|
|
1992 | LOG(llevError,"draw_client_map called with non player/non eric-server\n"); |
|
|
1993 | return; |
|
|
1994 | } |
|
|
1995 | |
|
|
1996 | pm = pl->map; |
|
|
1997 | |
|
|
1998 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1999 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
2000 | * be OK once they really log in. |
|
|
2001 | */ |
|
|
2002 | if (pm==NULL || pm->in_memory!=MAP_IN_MEMORY) return; |
|
|
2003 | |
|
|
2004 | memset(&newmap, 0, sizeof(struct Map)); |
|
|
2005 | |
|
|
2006 | for(j = (pl->y - pl->contr->socket.mapy/2) ; j < (pl->y + (pl->contr->socket.mapy+1)/2); j++) { |
|
|
2007 | for(i = (pl->x - pl->contr->socket.mapx/2) ; i < (pl->x + (pl->contr->socket.mapx+1)/2); i++) { |
|
|
2008 | ax=i; |
|
|
2009 | ay=j; |
|
|
2010 | m = pm; |
|
|
2011 | mflags = get_map_flags(m, &m, ax, ay, &ax, &ay); |
|
|
2012 | if (mflags & P_OUT_OF_MAP) |
|
|
2013 | continue; |
|
|
2014 | if (mflags & P_NEED_UPDATE) |
|
|
2015 | update_position(m, ax, ay); |
|
|
2016 | /* If a map is visible to the player, we don't want to swap it out |
|
|
2017 | * just to reload it. This should really call something like |
|
|
2018 | * swap_map, but this is much more efficient and 'good enough' |
|
|
2019 | */ |
|
|
2020 | if (mflags & P_NEW_MAP) |
|
|
2021 | m->timeout = 50; |
|
|
2022 | } |
|
|
2023 | } |
|
|
2024 | /* do LOS after calls to update_position */ |
|
|
2025 | if(pl->contr->do_los) { |
|
|
2026 | update_los(pl); |
|
|
2027 | pl->contr->do_los = 0; |
|
|
2028 | } |
|
|
2029 | |
|
|
2030 | if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd) { |
|
|
2031 | /* Big maps need a different drawing mechanism to work */ |
|
|
2032 | draw_client_map1(pl); |
|
|
2033 | return; |
|
|
2034 | } |
|
|
2035 | |
1168 | } |
2036 | if(pl->invisible & (pl->invisible < 50 ? 4 : 1)) { |
|
|
2037 | esrv_map_setbelow(&pl->contr->socket,pl->contr->socket.mapx/2, |
|
|
2038 | pl->contr->socket.mapy/2,pl->face->number,&newmap); |
|
|
2039 | } |
|
|
2040 | |
|
|
2041 | /* j and i are the y and x coordinates of the real map (which is |
|
|
2042 | * basically some number of spaces around the player) |
|
|
2043 | * ax and ay are values from within the viewport (ie, 0, 0 is upper |
|
|
2044 | * left corner) and are thus disconnected from the map values. |
|
|
2045 | * Subtract 1 from the max values so that we properly handle cases where |
|
|
2046 | * player has specified an even map. Otherwise, we try to send them too |
|
|
2047 | * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually |
|
|
2048 | * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is |
|
|
2049 | * odd, this still works fine. |
|
|
2050 | */ |
|
|
2051 | ay=0; |
|
|
2052 | for(j=pl->y-pl->contr->socket.mapy/2; j<=pl->y+(pl->contr->socket.mapy-1)/2;j++, ay++) { |
|
|
2053 | ax=0; |
|
|
2054 | for(i=pl->x-pl->contr->socket.mapx/2;i<=pl->x+(pl->contr->socket.mapx-1)/2;i++, ax++) { |
|
|
2055 | |
|
|
2056 | d = pl->contr->blocked_los[ax][ay]; |
|
|
2057 | /* note the out_of_map and d>3 checks are both within the same |
|
|
2058 | * negation check. |
|
|
2059 | */ |
|
|
2060 | nx = i; |
|
|
2061 | ny = j; |
|
|
2062 | m = get_map_from_coord(pm, &nx, &ny); |
|
|
2063 | if (m && d<4) { |
|
|
2064 | face = GET_MAP_FACE(m, nx, ny,0); |
|
|
2065 | floor2 = GET_MAP_FACE(m, nx, ny,1); |
|
|
2066 | floor = GET_MAP_FACE(m, nx, ny,2); |
|
|
2067 | |
|
|
2068 | /* If all is blank, send a blank face. */ |
|
|
2069 | if ((!face || face == blank_face) && |
|
|
2070 | (!floor2 || floor2 == blank_face) && |
|
|
2071 | (!floor || floor == blank_face)) { |
|
|
2072 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2073 | blank_face->number,&newmap); |
|
|
2074 | } else { /* actually have something interesting */ |
|
|
2075 | /* send the darkness mask, if any. */ |
|
|
2076 | if (d && pl->contr->socket.darkness) |
|
|
2077 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2078 | dark_faces[d-1]->number,&newmap); |
|
|
2079 | |
|
|
2080 | if (face && face != blank_face) |
|
|
2081 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2082 | face->number,&newmap); |
|
|
2083 | if (floor2 && floor2 != blank_face) |
|
|
2084 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2085 | floor2->number,&newmap); |
|
|
2086 | if (floor && floor != blank_face) |
|
|
2087 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2088 | floor->number,&newmap); |
|
|
2089 | } |
|
|
2090 | } /* Is a valid space */ |
|
|
2091 | } |
|
|
2092 | } |
|
|
2093 | esrv_map_doneredraw(&pl->contr->socket, &newmap); |
|
|
2094 | |
|
|
2095 | check_map_change (pl->contr); |
|
|
2096 | } |
|
|
2097 | |
|
|
2098 | |
|
|
2099 | /*****************************************************************************/ |
|
|
2100 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
|
|
2101 | /* a player. Of course, the client need to know the command to be able to */ |
|
|
2102 | /* manage it ! */ |
|
|
2103 | /*****************************************************************************/ |
|
|
2104 | void send_plugin_custom_message(object *pl, char *buf) |
|
|
2105 | { |
|
|
2106 | cs_write_string(&pl->contr->socket,buf,strlen(buf)); |
|
|
2107 | } |
|
|
2108 | |
|
|
2109 | /** |
|
|
2110 | * This sends the skill number to name mapping. We ignore |
|
|
2111 | * the params - we always send the same info no matter what. |
|
|
2112 | */ |
|
|
2113 | void send_skill_info(NewSocket *ns, char *params) |
|
|
2114 | { |
|
|
2115 | SockList sl; |
|
|
2116 | int i; |
|
|
2117 | |
|
|
2118 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
|
|
2119 | strcpy((char*)sl.buf,"replyinfo skill_info\n"); |
|
|
2120 | for (i=1; i< NUM_SKILLS; i++) { |
|
|
2121 | sprintf((char*)sl.buf + strlen((char*)sl.buf), "%d:%s\n", i + CS_STAT_SKILLINFO, |
|
|
2122 | skill_names[i]); |
|
|
2123 | } |
|
|
2124 | sl.len = strlen((char*)sl.buf); |
|
|
2125 | if (sl.len >= MAXSOCKBUF) { |
|
|
2126 | LOG(llevError,"Buffer overflow in send_skill_info!\n"); |
|
|
2127 | fatal(0); |
|
|
2128 | } |
|
|
2129 | Send_With_Handling(ns, &sl); |
|
|
2130 | free(sl.buf); |
|
|
2131 | } |
|
|
2132 | |
|
|
2133 | /** |
|
|
2134 | * This sends the spell path to name mapping. We ignore |
|
|
2135 | * the params - we always send the same info no matter what. |
|
|
2136 | */ |
|
|
2137 | void send_spell_paths (NewSocket *ns, char *params) { |
|
|
2138 | SockList sl; |
|
|
2139 | int i; |
|
|
2140 | |
|
|
2141 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
|
|
2142 | strcpy((char*)sl.buf,"replyinfo spell_paths\n"); |
|
|
2143 | for(i=0; i<NRSPELLPATHS; i++) |
|
|
2144 | sprintf((char*)sl.buf + strlen((char*)sl.buf), "%d:%s\n", 1<<i, spellpathnames[i]); |
|
|
2145 | sl.len = strlen((char*)sl.buf); |
|
|
2146 | if (sl.len >= MAXSOCKBUF) { |
|
|
2147 | LOG(llevError,"Buffer overflow in send_spell_paths!\n"); |
|
|
2148 | fatal(0); |
|
|
2149 | } |
|
|
2150 | Send_With_Handling(ns, &sl); |
|
|
2151 | free(sl.buf); |
|
|
2152 | } |
1169 | } |
2153 | |
1170 | |
2154 | /** |
1171 | /** |
2155 | * This looks for any spells the player may have that have changed their stats. |
1172 | * This looks for any spells the player may have that have changed their stats. |
2156 | * it then sends an updspell packet for each spell that has changed in this way |
1173 | * it then sends an updspell packet for each spell that has changed in this way |
2157 | */ |
1174 | */ |
|
|
1175 | void |
2158 | void esrv_update_spells(player *pl) { |
1176 | esrv_update_spells (player *pl) |
2159 | SockList sl; |
1177 | { |
2160 | int flags=0; |
1178 | if (!pl->ns) |
2161 | object *spell; |
1179 | return; |
2162 | if (!pl->socket.monitor_spells) return; |
1180 | |
|
|
1181 | pl->ns->update_spells = false; |
|
|
1182 | |
|
|
1183 | if (!pl->ns->monitor_spells) |
|
|
1184 | return; |
|
|
1185 | |
2163 | for (spell=pl->ob->inv; spell!=NULL; spell=spell->below) { |
1186 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
2164 | if (spell->type == SPELL) { |
1187 | if (spell->type == SPELL) |
|
|
1188 | { |
|
|
1189 | int flags = 0; |
|
|
1190 | int val; |
|
|
1191 | |
2165 | /* check if we need to update it*/ |
1192 | /* check if we need to update it */ |
2166 | if (spell->last_sp != SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA)) { |
|
|
2167 | spell->last_sp = SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA); |
1193 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
|
|
1194 | if (spell->cached_sp != val) |
|
|
1195 | { |
|
|
1196 | spell->cached_sp = val; |
2168 | flags |= UPD_SP_MANA; |
1197 | flags |= UPD_SP_MANA; |
2169 | } |
1198 | } |
2170 | if (spell->last_grace != SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE)) { |
1199 | |
2171 | spell->last_grace = SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE); |
1200 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
|
|
1201 | if (spell->cached_grace != val) |
|
|
1202 | { |
|
|
1203 | spell->cached_grace = val; |
2172 | flags |= UPD_SP_GRACE; |
1204 | flags |= UPD_SP_GRACE; |
2173 | } |
1205 | } |
2174 | if (spell->last_eat != spell->stats.dam+SP_level_dam_adjust(pl->ob, spell)) { |
1206 | |
2175 | spell->last_eat = spell->stats.dam+SP_level_dam_adjust(pl->ob, spell); |
1207 | val = casting_level (pl->ob, spell); |
|
|
1208 | if (spell->cached_eat != val) |
|
|
1209 | { |
|
|
1210 | spell->cached_eat = val; |
2176 | flags |= UPD_SP_DAMAGE; |
1211 | flags |= UPD_SP_LEVEL; |
2177 | } |
1212 | } |
|
|
1213 | |
2178 | if (flags !=0) { |
1214 | if (flags) |
2179 | sl.buf =(unsigned char*) malloc(MAXSOCKBUF); |
1215 | { |
2180 | strcpy((char*)sl.buf,"updspell "); |
1216 | packet sl; |
2181 | sl.len=strlen((char*)sl.buf); |
1217 | |
2182 | SockList_AddChar(&sl, flags); |
1218 | sl << "updspell " |
2183 | SockList_AddInt(&sl, spell->count); |
1219 | << uint8 (flags) |
2184 | if (flags & UPD_SP_MANA) SockList_AddShort(&sl, spell->last_sp); |
1220 | << uint32 (spell->count); |
2185 | if (flags & UPD_SP_GRACE) SockList_AddShort(&sl, spell->last_grace); |
1221 | |
2186 | if (flags & UPD_SP_DAMAGE) SockList_AddShort(&sl, spell->last_eat); |
1222 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
2187 | flags = 0; |
1223 | if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace); |
2188 | Send_With_Handling(&pl->socket, &sl); |
1224 | if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat); |
2189 | free(sl.buf); |
1225 | |
|
|
1226 | pl->ns->send_packet (sl); |
2190 | } |
1227 | } |
2191 | } |
1228 | } |
2192 | } |
|
|
2193 | } |
1229 | } |
2194 | |
1230 | |
|
|
1231 | void |
2195 | void esrv_remove_spell(player *pl, object *spell) { |
1232 | esrv_remove_spell (player *pl, object *spell) |
2196 | SockList sl; |
1233 | { |
|
|
1234 | if (!pl->ns->monitor_spells) |
|
|
1235 | return; |
2197 | |
1236 | |
2198 | if (!pl->socket.monitor_spells) return; |
|
|
2199 | if (!pl || !spell || spell->env != pl->ob) { |
1237 | if (!pl || !spell || spell->env != pl->ob) |
|
|
1238 | { |
2200 | LOG(llevError, "Invalid call to esrv_remove_spell"); |
1239 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2201 | return; |
1240 | return; |
2202 | } |
1241 | } |
2203 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
1242 | |
2204 | strcpy((char*)sl.buf,"delspell "); |
1243 | packet sl ("delspell"); |
2205 | sl.len=strlen((char*)sl.buf); |
1244 | |
2206 | SockList_AddInt(&sl, spell->count); |
1245 | sl << uint32 (spell->count); |
2207 | Send_With_Handling(&pl->socket, &sl); |
1246 | |
2208 | free(sl.buf); |
1247 | pl->ns->send_packet (sl); |
2209 | } |
1248 | } |
2210 | |
1249 | |
2211 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1250 | /* appends the spell *spell to the Socklist we will send the data to. */ |
|
|
1251 | static void |
2212 | static void append_spell (player *pl, SockList *sl, object *spell) { |
1252 | append_spell (player *pl, packet &sl, object *spell) |
|
|
1253 | { |
2213 | int len, i, skill=0; |
1254 | int i, skill = 0; |
2214 | |
1255 | |
2215 | if (!(spell->name)) { |
1256 | if (!(spell->name)) |
|
|
1257 | { |
2216 | LOG(llevError, "item number %d is a spell with no name.\n", spell->count); |
1258 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
2217 | return; |
1259 | return; |
2218 | } |
1260 | } |
2219 | SockList_AddInt(sl, spell->count); |
1261 | |
2220 | SockList_AddShort(sl, spell->level); |
|
|
2221 | SockList_AddShort(sl, spell->casting_time); |
|
|
2222 | /* store costs and damage in the object struct, to compare to later */ |
1262 | /* store costs and damage in the object struct, to compare to later */ |
2223 | spell->last_sp = SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA); |
1263 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
2224 | spell->last_grace = SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE); |
1264 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
2225 | spell->last_eat = spell->stats.dam+SP_level_dam_adjust(pl->ob, spell); |
1265 | spell->cached_eat = casting_level (pl->ob, spell); |
2226 | /* send the current values */ |
|
|
2227 | SockList_AddShort(sl, spell->last_sp); |
|
|
2228 | SockList_AddShort(sl, spell->last_grace); |
|
|
2229 | SockList_AddShort(sl, spell->last_eat); |
|
|
2230 | |
1266 | |
2231 | /* figure out which skill it uses, if it uses one */ |
1267 | /* figure out which skill it uses, if it uses one */ |
2232 | if (spell->skill) { |
1268 | if (spell->skill) |
2233 | for (i=1; i< NUM_SKILLS; i++) |
1269 | if (object *tmp = pl->find_skill (spell->skill)) |
2234 | if (!strcmp(spell->skill, skill_names[i])) { |
1270 | skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp); |
2235 | skill = i+CS_STAT_SKILLINFO; |
1271 | |
2236 | break; |
1272 | // spells better have a face |
2237 | } |
1273 | if (!spell->face) |
2238 | } |
1274 | { |
2239 | SockList_AddChar(sl, skill); |
1275 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
2240 | |
1276 | spell->face = face_find ("burnout.x11", blank_face); |
2241 | SockList_AddInt(sl, spell->path_attuned); |
|
|
2242 | SockList_AddInt(sl, (spell->face)?spell->face->number:0); |
|
|
2243 | |
|
|
2244 | len = strlen(spell->name); |
|
|
2245 | SockList_AddChar(sl, (char)len); |
|
|
2246 | memcpy(sl->buf+sl->len, spell->name, len); |
|
|
2247 | sl->len+=len; |
|
|
2248 | |
|
|
2249 | if (!spell->msg) { |
|
|
2250 | SockList_AddShort(sl, 0); |
|
|
2251 | } |
1277 | } |
2252 | else { |
1278 | |
2253 | len = strlen(spell->msg); |
1279 | pl->ns->send_face (spell->face); |
2254 | SockList_AddShort(sl, len); |
1280 | |
2255 | memcpy(sl->buf+sl->len, spell->msg, len); |
1281 | /* send the current values */ |
2256 | sl->len+=len; |
1282 | sl << uint32 (spell->count) |
2257 | } |
1283 | << uint16 (spell->level) |
|
|
1284 | << uint16 (spell->casting_time) |
|
|
1285 | << uint16 (spell->cached_sp) |
|
|
1286 | << uint16 (spell->cached_grace) |
|
|
1287 | << uint16 (spell->cached_eat) |
|
|
1288 | << uint8 (skill) |
|
|
1289 | << uint32 (spell->path_attuned) |
|
|
1290 | << uint32 (spell->face) |
|
|
1291 | << data8 (spell->name) |
|
|
1292 | << data16 (spell->msg); |
2258 | } |
1293 | } |
2259 | |
1294 | |
2260 | /** |
1295 | /** |
2261 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
1296 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
2262 | * all spells in the player's inventory. |
1297 | * all spells in the player's inventory. |
2263 | */ |
1298 | */ |
|
|
1299 | void |
2264 | void esrv_add_spells(player *pl, object *spell) { |
1300 | esrv_add_spells (player *pl, object *spell) |
2265 | SockList sl; |
1301 | { |
2266 | if (!pl) { |
1302 | if (!pl) |
|
|
1303 | { |
2267 | LOG(llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
1304 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2268 | return; |
1305 | return; |
2269 | } |
1306 | } |
2270 | if (!pl->socket.monitor_spells) return; |
1307 | |
2271 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
1308 | if (!pl->ns->monitor_spells) |
2272 | strcpy((char*)sl.buf,"addspell "); |
1309 | return; |
2273 | sl.len=strlen((char*)sl.buf); |
1310 | |
|
|
1311 | packet sl ("addspell"); |
|
|
1312 | |
2274 | if (!spell) { |
1313 | if (!spell) |
|
|
1314 | { |
2275 | for (spell=pl->ob->inv; spell!=NULL; spell=spell->below) { |
1315 | for (spell = pl->ob->inv; spell; spell = spell->below) |
|
|
1316 | { |
2276 | /* were we to simply keep appending data here, we could exceed |
1317 | /* were we to simply keep appending data here, we could exceed |
2277 | * MAXSOCKBUF if the player has enough spells to add, we know that |
1318 | * MAXSOCKBUF if the player has enough spells to add, we know that |
2278 | * append_spells will always append 19 data bytes, plus 4 length |
1319 | * append_spells will always append 19 data bytes, plus 4 length |
2279 | * bytes and 3 strings (because that is the spec) so we need to |
1320 | * bytes and 3 strings (because that is the spec) so we need to |
2280 | * check that the length of those 3 strings, plus the 23 bytes, |
1321 | * check that the length of those 3 strings, plus the 23 bytes, |
2281 | * won't take us over the length limit for the socket, if it does, |
1322 | * won't take us over the length limit for the socket, if it does, |
2282 | * we need to send what we already have, and restart packet formation |
1323 | * we need to send what we already have, and restart packet formation |
2283 | */ |
1324 | */ |
|
|
1325 | if (spell->type != SPELL) |
|
|
1326 | continue; |
|
|
1327 | |
2284 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1328 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
2285 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1329 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
2286 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1330 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
2287 | * like it will fix this |
1331 | * like it will fix this |
2288 | */ |
1332 | */ |
2289 | if (spell->type != SPELL) continue; |
1333 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2290 | if (sl.len >= (MAXSOCKBUF - (26 + strlen(spell->name) + |
1334 | { |
2291 | (spell->msg?strlen(spell->msg):0)))) { |
1335 | pl->ns->flush_fx (); |
2292 | Send_With_Handling(&pl->socket, &sl); |
1336 | pl->ns->send_packet (sl); |
2293 | strcpy((char*)sl.buf,"addspell "); |
1337 | |
2294 | sl.len=strlen((char*)sl.buf); |
1338 | sl.reset (); |
|
|
1339 | sl << "addspell "; |
2295 | } |
1340 | } |
|
|
1341 | |
2296 | append_spell(pl, &sl, spell); |
1342 | append_spell (pl, sl, spell); |
2297 | } |
1343 | } |
2298 | } |
1344 | } |
2299 | else if (spell->type != SPELL) { |
1345 | else if (spell->type != SPELL) |
|
|
1346 | { |
2300 | LOG(llevError, "Asked to send a non-spell object as a spell"); |
1347 | LOG (llevError, "Asked to send a non-spell object as a spell"); |
2301 | return; |
1348 | return; |
2302 | } |
1349 | } |
|
|
1350 | else |
2303 | else append_spell(pl, &sl, spell); |
1351 | append_spell (pl, sl, spell); |
|
|
1352 | |
2304 | if (sl.len >= MAXSOCKBUF) { |
1353 | if (sl.length () > MAXSOCKBUF) |
|
|
1354 | { |
2305 | LOG(llevError,"Buffer overflow in esrv_add_spells!\n"); |
1355 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2306 | fatal(0); |
1356 | fatal (0); |
2307 | } |
1357 | } |
|
|
1358 | |
2308 | /* finally, we can send the packet */ |
1359 | /* finally, we can send the packet */ |
2309 | Send_With_Handling(&pl->socket, &sl); |
1360 | pl->ns->flush_fx (); |
2310 | free(sl.buf); |
1361 | pl->ns->send_packet (sl); |
2311 | } |
1362 | } |
2312 | |
1363 | |
|
|
1364 | //-GPL |
|
|
1365 | |