1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_sock_info_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
4 | * "$Id: info.C,v 1.5 2006/09/10 13:43:33 root Exp $"; |
3 | * |
5 | */ |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
|
|
9 | |
|
|
10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
12 | |
7 | * |
13 | 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 |
14 | 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 |
15 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
16 | (at your option) any later version. |
11 | * option) any later version. |
17 | |
12 | * |
18 | 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, |
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
21 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
22 | |
17 | * |
23 | 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 |
24 | 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 |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
26 | |
21 | * |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
28 | */ |
23 | */ |
29 | |
24 | |
30 | /** |
25 | /** |
31 | * \file |
26 | * \file |
32 | * Basic client output functions. |
27 | * Basic client output functions. |
33 | * |
28 | * |
… | |
… | |
41 | #include <sproto.h> |
36 | #include <sproto.h> |
42 | #include <stdarg.h> |
37 | #include <stdarg.h> |
43 | #include <spells.h> |
38 | #include <spells.h> |
44 | #include <skills.h> |
39 | #include <skills.h> |
45 | |
40 | |
|
|
41 | #include <cstring> |
|
|
42 | |
46 | /** |
43 | /** |
47 | * Draws a normal message on the client. It is pretty |
44 | * Draws a normal message on the client. It is pretty |
48 | * much the same thing as the draw_info above, but takes a color |
45 | * much the same thing as the draw_info above, but takes a color |
49 | * parameter. the esrv_drawinfo functions should probably be |
46 | * parameter. the esrv_drawinfo functions should probably be |
50 | * replaced with this, just using black as the color. |
47 | * replaced with this, just using black as the color. |
51 | */ |
48 | */ |
52 | static void |
49 | static void |
53 | esrv_print_msg (NewSocket * ns, int color, const char *str) |
50 | esrv_print_msg (client *ns, int color, const char *str) |
54 | { |
51 | { |
55 | char buf[HUGE_BUF]; |
52 | ns->send_msg (color, "info", str); |
56 | |
|
|
57 | if (ns->status == Ns_Old) |
|
|
58 | { |
|
|
59 | snprintf (buf, HUGE_BUF, "%s\n", str); |
|
|
60 | } |
|
|
61 | else |
|
|
62 | { |
|
|
63 | snprintf (buf, HUGE_BUF, "drawinfo %d %s", color, str); |
|
|
64 | } |
|
|
65 | |
|
|
66 | /* LOG(llevDebug,"sending %s to socket, len=%d\n", buf, strlen(buf));*/ |
|
|
67 | Write_String_To_Socket (ns, buf, strlen (buf)); |
|
|
68 | } |
|
|
69 | |
|
|
70 | /** |
|
|
71 | * Draws an extended message on the client. |
|
|
72 | * ns the socket to send message to |
|
|
73 | * color color informations (used mainly if client does not support message type) |
|
|
74 | * type, |
|
|
75 | * subtype type and subtype of text message |
|
|
76 | * intro Intro message to send with main message if client does not support the message type |
|
|
77 | * message The main message |
|
|
78 | */ |
|
|
79 | static void |
|
|
80 | esrv_print_ext_msg (NewSocket * ns, int color, uint8 type, uint8 subtype, const char *message) |
|
|
81 | { |
|
|
82 | char buf[HUGE_BUF]; |
|
|
83 | |
|
|
84 | snprintf (buf, HUGE_BUF, "drawextinfo %d %hhu %hhu %s", color, type, subtype, message); |
|
|
85 | Write_String_To_Socket (ns, buf, strlen (buf)); |
|
|
86 | |
|
|
87 | /* LOG(llevDebug,"sending %s to socket, len=%d", buf, strlen(buf));*/ |
|
|
88 | |
|
|
89 | } |
53 | } |
90 | |
54 | |
91 | /** |
55 | /** |
92 | * Frontend for esrv_print_msg |
56 | * Frontend for esrv_print_msg |
93 | * \param colr message color |
57 | * \param colr message color |
… | |
… | |
96 | * |
60 | * |
97 | * If pl is NULL or without contr set, writes message to log. |
61 | * If pl is NULL or without contr set, writes message to log. |
98 | * |
62 | * |
99 | * Else sends message to player via esrv_print_msg |
63 | * Else sends message to player via esrv_print_msg |
100 | */ |
64 | */ |
101 | |
|
|
102 | static void |
65 | static void |
103 | print_message (int colr, const object *pl, const char *tmp) |
66 | print_message (int colr, const object *pl, const char *tmp) |
104 | { |
67 | { |
105 | |
68 | if (!tmp) |
106 | if (tmp == (char *) NULL) |
|
|
107 | { |
|
|
108 | tmp = "[NULL]"; |
69 | tmp = "[NULL]"; |
109 | } |
|
|
110 | |
70 | |
111 | if (!pl || (pl->type == PLAYER && pl->contr == NULL)) |
71 | if (!pl || (pl->type == PLAYER && pl->contr == NULL)) |
112 | return; |
72 | return; |
113 | |
73 | |
114 | if (pl->type == PLAYER) |
74 | if (pl->type == PLAYER) |
115 | { |
|
|
116 | esrv_print_msg (&pl->contr->socket, colr, (char *) tmp); |
75 | esrv_print_msg (pl->contr->ns, colr, (char *)tmp); |
117 | return; |
76 | } |
|
|
77 | |
|
|
78 | bool |
|
|
79 | client::msg_suppressed (const char *msg) |
|
|
80 | { |
|
|
81 | if (!pl) |
|
|
82 | return false; |
|
|
83 | |
|
|
84 | if (pl->outputs_count <= 1 || !pl->outputs_sync) |
|
|
85 | return false; |
|
|
86 | |
|
|
87 | int len = strlen (msg); |
|
|
88 | |
|
|
89 | if (len > MSG_BUF_SIZE) |
|
|
90 | return false; |
|
|
91 | |
|
|
92 | msg_buf *lru = msgbuf; |
|
|
93 | for (msg_buf *buf = msgbuf; buf < msgbuf + MSG_BUF_COUNT; ++buf) |
118 | } |
94 | { |
119 | } |
95 | if (len == buf->len && !memcmp (msg, buf->msg, len)) |
120 | |
|
|
121 | |
|
|
122 | /** |
|
|
123 | * Prints out the contents of specified buffer structures, |
|
|
124 | * and clears the string. |
|
|
125 | */ |
|
|
126 | |
|
|
127 | void |
|
|
128 | flush_output_element (const object *pl, Output_Buf * outputs) |
|
|
129 | { |
|
|
130 | char tbuf[MAX_BUF]; |
|
|
131 | |
|
|
132 | if (outputs->buf == NULL) |
|
|
133 | return; |
|
|
134 | if (outputs->count > 1) |
|
|
135 | { |
|
|
136 | snprintf (tbuf, MAX_BUF, "%d times %s", outputs->count, &outputs->buf); |
|
|
137 | print_message (NDI_BLACK, pl, tbuf); |
|
|
138 | } |
|
|
139 | else |
|
|
140 | print_message (NDI_BLACK, pl, &outputs->buf); |
|
|
141 | |
|
|
142 | outputs->buf = NULL; |
|
|
143 | outputs->first_update = 0; /* This way, it will be reused */ |
|
|
144 | } |
|
|
145 | |
|
|
146 | /** |
|
|
147 | * Sends message to player through output buffers. |
|
|
148 | * \param pl player to send message |
|
|
149 | * \param buf message to send |
|
|
150 | * |
|
|
151 | * If player's output_count is 1, sends message directly. |
|
|
152 | * |
|
|
153 | * Else checks output buffers for specified message. |
|
|
154 | * |
|
|
155 | * If found, checks if message should be sent now. |
|
|
156 | * |
|
|
157 | * If message not already in buffers, flushes olders buffer, |
|
|
158 | * and adds message to queue. |
|
|
159 | */ |
|
|
160 | |
|
|
161 | static void |
|
|
162 | check_output_buffers (const object *pl, const char *buf) |
|
|
163 | { |
|
|
164 | int i, oldest = 0; |
|
|
165 | |
|
|
166 | if (pl->contr->outputs_count < 2) |
|
|
167 | { |
|
|
168 | print_message (NDI_BLACK, pl, buf); |
|
|
169 | return; |
|
|
170 | } |
|
|
171 | else |
|
|
172 | { |
|
|
173 | for (i = 0; i < NUM_OUTPUT_BUFS; i++) |
|
|
174 | { |
96 | { |
175 | if (pl->contr->outputs[i].buf && !strcmp (buf, pl->contr->outputs[i].buf)) |
97 | // found matching buf, see if expired |
|
|
98 | if (buf->expire <= pticks || !buf->count) |
176 | break; |
99 | { |
177 | else if (pl->contr->outputs[i].first_update < pl->contr->outputs[oldest].first_update) |
100 | // yes, take over matching buffer, print |
178 | oldest = i; |
101 | buf->expire = pticks + pl->outputs_sync; |
|
|
102 | buf->count = pl->outputs_count; |
|
|
103 | |
|
|
104 | return false; |
|
|
105 | } |
|
|
106 | |
|
|
107 | // no, suppress |
|
|
108 | --buf->count; |
|
|
109 | return true; |
179 | } |
110 | } |
180 | /* We found a match */ |
|
|
181 | if (i < NUM_OUTPUT_BUFS) |
|
|
182 | { |
|
|
183 | pl->contr->outputs[i].count++; |
|
|
184 | if (pl->contr->outputs[i].count >= pl->contr->outputs_count) |
|
|
185 | { |
|
|
186 | flush_output_element (pl, &pl->contr->outputs[i]); |
|
|
187 | } |
|
|
188 | } |
|
|
189 | /* No match - flush the oldest, and put the new one in */ |
|
|
190 | else |
|
|
191 | { |
|
|
192 | flush_output_element (pl, &pl->contr->outputs[oldest]); |
|
|
193 | |
111 | |
194 | pl->contr->outputs[oldest].first_update = pticks; |
112 | if (lru->expire > buf->expire) |
195 | pl->contr->outputs[oldest].count = 1; |
113 | lru = buf; |
196 | pl->contr->outputs[oldest].buf = buf; |
|
|
197 | } |
|
|
198 | } |
114 | } |
199 | } |
|
|
200 | |
115 | |
|
|
116 | // new message, evoke oldest buffer |
|
|
117 | lru->expire = pticks + pl->outputs_sync; |
|
|
118 | lru->count = pl->outputs_count; |
|
|
119 | lru->len = len; |
|
|
120 | memcpy (lru->msg, msg, len); |
201 | |
121 | |
|
|
122 | return false; |
|
|
123 | } |
202 | |
124 | |
203 | /** |
125 | /** |
204 | * Sends message to player(s). |
126 | * Sends message to player(s). |
205 | * |
127 | * |
206 | * flags is various flags - mostly color, plus a few specials. |
128 | * flags is various flags - mostly color, plus a few specials. |
207 | * |
129 | * |
208 | * pri is priority. It is a little odd - the lower the value, the more |
130 | * pri is unused. |
209 | * important it is. Thus, 0 gets sent no matter what. Otherwise, the |
|
|
210 | * value must be less than the listening level that the player has set. |
|
|
211 | * Unfortunately, there is no clear guideline on what each level does what. |
|
|
212 | * |
131 | * |
213 | * pl can be passed as NULL - in fact, this will be done if NDI_ALL is set |
132 | * pl can be passed as NULL - in fact, this will be done if NDI_ALL is set |
214 | * in the flags. |
133 | * in the flags. |
215 | * |
134 | * |
216 | * If message is black, and not NDI_UNIQUE, gets sent through output buffers. |
135 | * If message is black, and not NDI_UNIQUE, gets sent through output buffers. |
217 | * |
136 | * |
218 | */ |
137 | */ |
219 | |
|
|
220 | void |
138 | void |
221 | new_draw_info (int flags, int pri, const object *pl, const char *buf) |
139 | new_draw_info (int flags, int pri, const object *op, const char *buf) |
222 | { |
140 | { |
223 | |
|
|
224 | if (flags & NDI_ALL) |
141 | if (flags & NDI_ALL) |
225 | { |
142 | { |
226 | player *tmppl; |
143 | for_all_players (pl) |
227 | int i; |
|
|
228 | |
|
|
229 | for (tmppl = first_player; tmppl != NULL; tmppl = tmppl->next) |
|
|
230 | new_draw_info ((flags & ~NDI_ALL), pri, tmppl->ob, buf); |
144 | new_draw_info (flags & ~NDI_ALL, 0, pl->ob, buf); |
231 | |
|
|
232 | for (i = 1; i < socket_info.allocated_sockets; i++) |
|
|
233 | { |
|
|
234 | if (init_sockets[i].status == Ns_Old && init_sockets[i].old_mode != Old_Listen && pri < 10) |
|
|
235 | { |
|
|
236 | cs_write_string (&init_sockets[i], buf, strlen (buf)); |
|
|
237 | /* Most messages don't have a newline, so add one */ |
|
|
238 | cs_write_string (&init_sockets[i], "\n", 1); |
|
|
239 | } |
|
|
240 | } |
|
|
241 | |
|
|
242 | return; |
|
|
243 | } |
|
|
244 | if (!pl || (pl->type == PLAYER && pl->contr == NULL)) |
|
|
245 | { |
|
|
246 | /* Write to the socket? */ |
|
|
247 | print_message (0, NULL, buf); |
|
|
248 | return; |
|
|
249 | } |
|
|
250 | if (pl->type != PLAYER) |
|
|
251 | return; |
|
|
252 | if (pri >= pl->contr->listening) |
|
|
253 | return; |
|
|
254 | |
|
|
255 | if ((flags & NDI_COLOR_MASK) == NDI_BLACK && !(flags & NDI_UNIQUE)) |
|
|
256 | { |
|
|
257 | /* following prints stuff out, as appropriate */ |
|
|
258 | check_output_buffers (pl, buf); |
|
|
259 | } |
145 | } |
260 | else |
146 | else |
261 | { |
147 | { |
|
|
148 | if (!op || !op->contr || !op->contr->ns) |
|
|
149 | return; |
|
|
150 | |
|
|
151 | if ((flags & (NDI_COLOR_MASK | NDI_UNIQUE)) != NDI_BLACK |
|
|
152 | || !op->contr->ns->msg_suppressed (buf)) |
262 | print_message (flags & NDI_COLOR_MASK, pl, buf); |
153 | print_message (flags & NDI_COLOR_MASK, op, buf); |
263 | } |
154 | } |
264 | } |
155 | } |
265 | |
156 | |
266 | /** |
157 | /** |
267 | * Wrapper for new_draw_info printf-like. |
158 | * Wrapper for new_draw_info printf-like. |
… | |
… | |
269 | * This is a pretty trivial function, but it allows us to use printf style |
160 | * This is a pretty trivial function, but it allows us to use printf style |
270 | * formatting, so instead of the calling function having to do it, we do |
161 | * formatting, so instead of the calling function having to do it, we do |
271 | * it here. It may also have advantages in the future for reduction of |
162 | * it here. It may also have advantages in the future for reduction of |
272 | * client/server bandwidth (client could keep track of various strings |
163 | * client/server bandwidth (client could keep track of various strings |
273 | */ |
164 | */ |
274 | |
|
|
275 | void |
165 | void |
276 | new_draw_info_format (int flags, int pri, const object *pl, const char *format, ...) |
166 | new_draw_info_format (int flags, int pri, const object *pl, const char *format, ...) |
277 | { |
167 | { |
278 | char buf[HUGE_BUF]; |
|
|
279 | |
|
|
280 | va_list ap; |
168 | va_list ap; |
281 | |
|
|
282 | va_start (ap, format); |
169 | va_start (ap, format); |
283 | |
170 | new_draw_info (flags, pri, pl, vformat (format, ap)); |
284 | vsnprintf (buf, HUGE_BUF, format, ap); |
|
|
285 | |
|
|
286 | va_end (ap); |
171 | va_end (ap); |
287 | |
|
|
288 | new_draw_info (flags, pri, pl, buf); |
|
|
289 | } |
|
|
290 | |
|
|
291 | |
|
|
292 | void |
|
|
293 | draw_ext_info (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *message, const char *oldmessage) |
|
|
294 | { |
|
|
295 | |
|
|
296 | if (!pl || (pl->type != PLAYER) || (pl->contr == NULL)) |
|
|
297 | return; |
|
|
298 | |
|
|
299 | if (pri >= pl->contr->listening) |
|
|
300 | return; |
|
|
301 | if (!CLIENT_SUPPORT_READABLES (&pl->contr->socket, type)) |
|
|
302 | { |
|
|
303 | char *buf = (char *) malloc (strlen (oldmessage == NULL ? message : oldmessage) + 1); |
|
|
304 | |
|
|
305 | if (buf == NULL) |
|
|
306 | LOG (llevError, "info::draw_ext_info -> Out of memory!"); |
|
|
307 | else |
|
|
308 | { |
|
|
309 | strcpy (buf, oldmessage == NULL ? message : oldmessage); |
|
|
310 | strip_media_tag (buf); |
|
|
311 | new_draw_info (flags, pri, pl, buf); |
|
|
312 | free (buf); |
|
|
313 | } |
|
|
314 | } |
|
|
315 | else |
|
|
316 | { |
|
|
317 | esrv_print_ext_msg (&pl->contr->socket, flags & NDI_COLOR_MASK, type, subtype, message); |
|
|
318 | } |
|
|
319 | } |
|
|
320 | |
|
|
321 | void |
|
|
322 | draw_ext_info_format (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *old_format, char *new_format, ...) |
|
|
323 | { |
|
|
324 | |
|
|
325 | char buf[HUGE_BUF]; |
|
|
326 | |
|
|
327 | if (!pl || (pl->type != PLAYER) || (pl->contr == NULL)) |
|
|
328 | return; |
|
|
329 | |
|
|
330 | if (pri >= pl->contr->listening) |
|
|
331 | return; |
|
|
332 | if (!CLIENT_SUPPORT_READABLES (&pl->contr->socket, type)) |
|
|
333 | { |
|
|
334 | va_list ap; |
|
|
335 | |
|
|
336 | LOG (llevDebug, "Non supported extension text type for client.\n"); |
|
|
337 | va_start (ap, new_format); |
|
|
338 | vsnprintf (buf, HUGE_BUF, old_format, ap); |
|
|
339 | va_end (ap); |
|
|
340 | new_draw_info (flags, pri, pl, buf); |
|
|
341 | return; |
|
|
342 | } |
|
|
343 | else |
|
|
344 | { |
|
|
345 | va_list ap; |
|
|
346 | |
|
|
347 | va_start (ap, new_format); |
|
|
348 | vsnprintf (buf, HUGE_BUF, new_format, ap); |
|
|
349 | va_end (ap); |
|
|
350 | strip_media_tag (buf); |
|
|
351 | esrv_print_ext_msg (&pl->contr->socket, flags & NDI_COLOR_MASK, type, subtype, buf); |
|
|
352 | } |
|
|
353 | } |
172 | } |
354 | |
173 | |
355 | /** |
174 | /** |
356 | * Writes to everyone on the map *except* op. This is useful for emotions. |
175 | * Writes to everyone on the map *except* op. This is useful for emotions. |
357 | */ |
176 | */ |
358 | |
|
|
359 | void |
177 | void |
360 | new_info_map_except (int color, mapstruct *map, object *op, const char *str) |
178 | new_info_map_except (int color, maptile * map, object *op, const char *str) |
361 | { |
179 | { |
362 | player *pl; |
180 | for_all_players (pl) |
363 | |
|
|
364 | for (pl = first_player; pl != NULL; pl = pl->next) |
|
|
365 | if (pl->ob != NULL && pl->ob->map == map && pl->ob != op) |
181 | if (pl->ob->map == map && pl->ob != op) |
366 | { |
|
|
367 | new_draw_info (color, 0, pl->ob, str); |
182 | new_draw_info (color, 0, pl->ob, str); |
368 | } |
|
|
369 | } |
|
|
370 | |
|
|
371 | /** |
|
|
372 | * Writes to everyone on the map except op1 and op2 |
|
|
373 | */ |
|
|
374 | |
|
|
375 | void |
|
|
376 | new_info_map_except2 (int color, mapstruct *map, object *op1, object *op2, const char *str) |
|
|
377 | { |
|
|
378 | player *pl; |
|
|
379 | |
|
|
380 | for (pl = first_player; pl != NULL; pl = pl->next) |
|
|
381 | if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2) |
|
|
382 | { |
|
|
383 | new_draw_info (color, 0, pl->ob, str); |
|
|
384 | } |
|
|
385 | } |
183 | } |
386 | |
184 | |
387 | /** |
185 | /** |
388 | * Writes to everyone on the specified map |
186 | * Writes to everyone on the specified map |
389 | */ |
187 | */ |
390 | |
|
|
391 | void |
188 | void |
392 | new_info_map (int color, mapstruct *map, const char *str) |
189 | new_info_map (int color, maptile * map, const char *str) |
393 | { |
190 | { |
394 | player *pl; |
191 | for_all_players (pl) |
395 | |
|
|
396 | for (pl = first_player; pl != NULL; pl = pl->next) |
|
|
397 | if (pl->ob != NULL && pl->ob->map == map) |
192 | if (pl->ob->map == map) |
398 | { |
|
|
399 | new_draw_info (color, 0, pl->ob, str); |
193 | new_draw_info (color, 0, pl->ob, str); |
400 | } |
|
|
401 | } |
|
|
402 | |
|
|
403 | |
|
|
404 | /** |
|
|
405 | * This does nothing now. However, in theory, we should probably send |
|
|
406 | * something to the client and let the client figure out how it might want |
|
|
407 | * to handle this |
|
|
408 | */ |
|
|
409 | void |
|
|
410 | clear_win_info (object *op) |
|
|
411 | { |
|
|
412 | } |
|
|
413 | |
|
|
414 | /** |
|
|
415 | * Get player's current range attack in obuf. |
|
|
416 | */ |
|
|
417 | void |
|
|
418 | rangetostring (object *pl, char *obuf) |
|
|
419 | { |
|
|
420 | switch (pl->contr->shoottype) |
|
|
421 | { |
|
|
422 | case range_none: |
|
|
423 | strcpy (obuf, "Range: nothing"); |
|
|
424 | break; |
|
|
425 | |
|
|
426 | case range_bow: |
|
|
427 | { |
|
|
428 | object *op; |
|
|
429 | |
|
|
430 | for (op = pl->inv; op; op = op->below) |
|
|
431 | if (op->type == BOW && QUERY_FLAG (op, FLAG_APPLIED)) |
|
|
432 | break; |
|
|
433 | if (op == NULL) |
|
|
434 | break; |
|
|
435 | |
|
|
436 | sprintf (obuf, "Range: %s (%s)", query_base_name (op, 0), op->race ? (const char *) op->race : "nothing"); |
|
|
437 | } |
|
|
438 | break; |
|
|
439 | |
|
|
440 | case range_magic: |
|
|
441 | if (settings.casting_time == TRUE) |
|
|
442 | { |
|
|
443 | if (pl->casting_time > -1) |
|
|
444 | { |
|
|
445 | if (pl->casting_time == 0) |
|
|
446 | sprintf (obuf, "Range: Holding spell (%s)", (const char *) pl->spell->name); |
|
|
447 | else |
|
|
448 | sprintf (obuf, "Range: Casting spell (%s)", (const char *) pl->spell->name); |
|
|
449 | } |
|
|
450 | else |
|
|
451 | sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name); |
|
|
452 | } |
|
|
453 | else |
|
|
454 | sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name); |
|
|
455 | break; |
|
|
456 | |
|
|
457 | case range_misc: |
|
|
458 | sprintf (obuf, "Range: %s", pl->contr->ranges[range_misc] ? query_base_name (pl->contr->ranges[range_misc], 0) : "none"); |
|
|
459 | break; |
|
|
460 | |
|
|
461 | /* range_scroll is only used for controlling golems. If the |
|
|
462 | * the player does not have a golem, reset some things. |
|
|
463 | */ |
|
|
464 | case range_golem: |
|
|
465 | if (pl->contr->ranges[range_golem] != NULL) |
|
|
466 | sprintf (obuf, "Range: golem (%s)", &pl->contr->ranges[range_golem]->name); |
|
|
467 | else |
|
|
468 | { |
|
|
469 | pl->contr->shoottype = range_none; |
|
|
470 | strcpy (obuf, "Range: nothing"); |
|
|
471 | } |
|
|
472 | break; |
|
|
473 | |
|
|
474 | case range_skill: |
|
|
475 | sprintf (obuf, "Skill: %s", pl->chosen_skill != NULL ? (const char *) pl->chosen_skill->name : "none"); |
|
|
476 | break; |
|
|
477 | |
|
|
478 | case range_builder: |
|
|
479 | sprintf (obuf, "Builder: %s", query_base_name (pl->contr->ranges[range_builder], 0)); |
|
|
480 | break; |
|
|
481 | |
|
|
482 | default: |
|
|
483 | strcpy (obuf, "Range: illegal"); |
|
|
484 | } |
|
|
485 | } |
194 | } |
486 | |
195 | |
487 | /** |
196 | /** |
488 | * Sets player title. |
197 | * Sets player title. |
489 | */ |
198 | */ |
… | |
… | |
495 | sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title); |
204 | sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title); |
496 | else |
205 | else |
497 | sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title); |
206 | sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title); |
498 | } |
207 | } |
499 | |
208 | |
|
|
209 | // formerly a macro, used only by magic map, so optimised it out |
|
|
210 | static inline faceidx |
|
|
211 | GET_MAP_FACE (mapspace &ms, int layer) |
|
|
212 | { |
|
|
213 | if (object *op = ms.faces_obj [layer]) |
|
|
214 | return op->face; |
|
|
215 | else |
|
|
216 | return 0; |
|
|
217 | } |
500 | |
218 | |
501 | /** |
219 | /** |
502 | * Helper for magic map creation. |
220 | * Helper for magic map creation. |
503 | * |
221 | * |
504 | * Takes a player, the map_mark array and an x and y starting position. |
222 | * Takes a player, the map_mark array and an x and y starting position. |
… | |
… | |
510 | * for various code values. |
228 | * for various code values. |
511 | */ |
229 | */ |
512 | static void |
230 | static void |
513 | magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py) |
231 | magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py) |
514 | { |
232 | { |
515 | int x, y, dx, dy, mflags; |
|
|
516 | sint16 nx, ny; |
|
|
517 | mapstruct *mp; |
|
|
518 | New_Face *f; |
|
|
519 | |
|
|
520 | for (dx = -1; dx <= 1; dx++) |
233 | for (int dx = -1; dx <= 1; dx++) |
521 | { |
234 | { |
522 | for (dy = -1; dy <= 1; dy++) |
235 | for (int dy = -1; dy <= 1; dy++) |
523 | { |
236 | { |
524 | x = px + dx; |
237 | int x = px + dx; |
525 | y = py + dy; |
238 | int y = py + dy; |
526 | |
239 | |
527 | if (FABS (x) >= MAGIC_MAP_HALF || FABS (y) >= MAGIC_MAP_HALF) |
240 | if (abs (x) >= MAGIC_MAP_HALF || abs (y) >= MAGIC_MAP_HALF) |
528 | continue; |
241 | continue; |
529 | |
242 | |
530 | mp = pl->map; |
243 | mapxy pos (pl); |
531 | nx = pl->x + x; |
244 | pos.move (x, y); |
532 | ny = pl->y + y; |
|
|
533 | |
245 | |
534 | mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny); |
246 | if (!pos.normalise ()) |
535 | if (mflags & P_OUT_OF_MAP) |
|
|
536 | continue; |
247 | continue; |
|
|
248 | |
|
|
249 | mapspace &ms = pos.ms (); |
537 | |
250 | |
538 | if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0) |
251 | if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0) |
539 | { |
252 | { |
|
|
253 | int mflags = ms.flags (); |
|
|
254 | |
540 | f = GET_MAP_FACE (mp, nx, ny, 0); |
255 | int f = GET_MAP_FACE (ms, 0); |
541 | if (f == blank_face) |
256 | if (f == blank_face) |
|
|
257 | { |
542 | f = GET_MAP_FACE (mp, nx, ny, 1); |
258 | f = GET_MAP_FACE (ms, 1); |
543 | if (f == blank_face) |
259 | if (f == blank_face) |
544 | f = GET_MAP_FACE (mp, nx, ny, 2); |
260 | f = GET_MAP_FACE (ms, 2); |
|
|
261 | } |
|
|
262 | |
|
|
263 | int magicmap = faces [f].magicmap; |
545 | |
264 | |
546 | /* Should probably have P_NO_MAGIC here also, but then shops don't |
265 | /* Should probably have P_NO_MAGIC here also, but then shops don't |
547 | * work. |
266 | * work. |
548 | */ |
267 | */ |
549 | if (mflags & P_BLOCKSVIEW) |
268 | if (mflags & P_BLOCKSVIEW) |
550 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); |
269 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap; |
551 | else |
270 | else |
552 | { |
271 | { |
553 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); |
272 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap; |
554 | magic_mapping_mark_recursive (pl, map_mark, x, y); |
273 | magic_mapping_mark_recursive (pl, map_mark, x, y); |
555 | } |
274 | } |
556 | } |
275 | } |
557 | } |
276 | } |
558 | } |
277 | } |
559 | } |
278 | } |
560 | |
279 | |
561 | |
|
|
562 | /** |
280 | /** |
563 | * Creates magic map for player. |
281 | * Creates magic map for player. |
564 | * |
282 | * |
565 | * Note: For improved magic mapping display, the space that blocks |
283 | * Note: For improved magic mapping display, the space that blocks |
566 | * the view is now marked with value 2. Any dependencies of map_mark |
284 | * the view is now marked with value 2. Any dependencies of map_mark |
567 | * being nonzero have been changed to check for 1. Also, since |
285 | * being nonzero have been changed to check for 1. Also, since |
568 | * map_mark is a char value, putting 2 in should cause no problems. |
286 | * map_mark is a char value, putting 2 in should cause no problems. |
569 | * |
287 | * |
570 | * This function examines the map the player is on, and determines what |
288 | * This function examines the map the player is on, and determines what |
571 | * is visible. 2 is set for walls or objects that blocks view. 1 |
289 | * is visible. 2 is set for walls or objects that blocks view. 1 |
572 | * is for open spaces. map_mark should already have been initialized |
290 | * is for open spaces. map_mark should already have been initialised |
573 | * to zero before this is called. |
291 | * to zero before this is called. |
574 | * strength is an initial strength*2 rectangular area that we automatically |
292 | * strength is an initial strength*2 rectangular area that we automatically |
575 | * see in/penetrate through. |
293 | * see in/penetrate through. |
576 | */ |
294 | */ |
577 | |
295 | static void |
578 | void |
|
|
579 | magic_mapping_mark (object *pl, char *map_mark, int strength) |
296 | magic_mapping_mark (object *pl, char *map_mark, int strength) |
580 | { |
297 | { |
581 | int x, y, mflags; |
|
|
582 | sint16 nx, ny; |
|
|
583 | mapstruct *mp; |
|
|
584 | New_Face *f; |
|
|
585 | |
|
|
586 | for (x = -strength; x < strength; x++) |
298 | for (int x = -strength; x < strength; x++) |
587 | { |
299 | { |
588 | for (y = -strength; y < strength; y++) |
300 | for (int y = -strength; y < strength; y++) |
589 | { |
301 | { |
590 | mp = pl->map; |
302 | mapxy pos (pl); |
591 | nx = pl->x + x; |
303 | pos.move (x, y); |
592 | ny = pl->y + y; |
304 | |
593 | mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny); |
305 | if (!pos.normalise ()) |
594 | if (mflags & P_OUT_OF_MAP) |
|
|
595 | continue; |
306 | continue; |
|
|
307 | |
|
|
308 | mapspace &ms = pos.ms (); |
|
|
309 | |
|
|
310 | int mflags = ms.flags (); |
|
|
311 | |
|
|
312 | int f = GET_MAP_FACE (ms, 0); |
|
|
313 | if (f == blank_face) |
|
|
314 | { |
|
|
315 | f = GET_MAP_FACE (ms, 1); |
|
|
316 | if (f == blank_face) |
|
|
317 | f = GET_MAP_FACE (ms, 2); |
|
|
318 | } |
|
|
319 | |
|
|
320 | int magicmap = faces [f].magicmap; |
|
|
321 | |
|
|
322 | if (mflags & P_BLOCKSVIEW) |
|
|
323 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap; |
596 | else |
324 | else |
597 | { |
325 | { |
598 | f = GET_MAP_FACE (mp, nx, ny, 0); |
|
|
599 | if (f == blank_face) |
|
|
600 | f = GET_MAP_FACE (mp, nx, ny, 1); |
|
|
601 | if (f == blank_face) |
|
|
602 | f = GET_MAP_FACE (mp, nx, ny, 2); |
|
|
603 | } |
|
|
604 | |
|
|
605 | if (mflags & P_BLOCKSVIEW) |
|
|
606 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); |
|
|
607 | else |
|
|
608 | { |
|
|
609 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); |
326 | map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap; |
610 | magic_mapping_mark_recursive (pl, map_mark, x, y); |
327 | magic_mapping_mark_recursive (pl, map_mark, x, y); |
611 | } |
328 | } |
612 | } |
329 | } |
613 | } |
330 | } |
614 | } |
331 | } |
615 | |
332 | |
616 | |
|
|
617 | /** |
333 | /** |
618 | * Creates and sends magic map to player. |
334 | * Creates and sends magic map to player. |
619 | * |
335 | * |
620 | * The following function is a lot messier than it really should be, |
336 | * The following function is a lot messier than it really should be, |
621 | * but there is no real easy solution. |
337 | * but there is no real easy solution. |
622 | * |
338 | * |
623 | * Mark Wedel |
339 | * Mark Wedel |
624 | */ |
340 | */ |
625 | |
|
|
626 | void |
341 | void |
627 | draw_magic_map (object *pl) |
342 | draw_magic_map (object *pl) |
628 | { |
343 | { |
629 | int x, y; |
|
|
630 | char *map_mark = (char *) calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); |
344 | char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); |
631 | int xmin, xmax, ymin, ymax; |
345 | int xmin, xmax, ymin, ymax; |
632 | SockList sl; |
|
|
633 | |
346 | |
634 | if (pl->type != PLAYER) |
347 | if (pl->type != PLAYER) |
635 | { |
348 | { |
636 | LOG (llevError, "Non player object called draw_map.\n"); |
349 | LOG (llevError, "Non player object called draw_map.\n"); |
637 | return; |
350 | return; |
… | |
… | |
647 | */ |
360 | */ |
648 | xmin = MAGIC_MAP_SIZE; |
361 | xmin = MAGIC_MAP_SIZE; |
649 | ymin = MAGIC_MAP_SIZE; |
362 | ymin = MAGIC_MAP_SIZE; |
650 | xmax = 0; |
363 | xmax = 0; |
651 | ymax = 0; |
364 | ymax = 0; |
|
|
365 | |
652 | for (x = 0; x < MAGIC_MAP_SIZE; x++) |
366 | for (int x = 0; x < MAGIC_MAP_SIZE; x++) |
653 | { |
|
|
654 | for (y = 0; y < MAGIC_MAP_SIZE; y++) |
367 | for (int y = 0; y < MAGIC_MAP_SIZE; y++) |
|
|
368 | if (map_mark[x + pl->map->width * y] | FACE_FLOOR) |
655 | { |
369 | { |
656 | if (map_mark[x + MAP_WIDTH (pl->map) * y] | FACE_FLOOR) |
|
|
657 | { |
|
|
658 | xmin = x < xmin ? x : xmin; |
370 | xmin = x < xmin ? x : xmin; |
659 | xmax = x > xmax ? x : xmax; |
371 | xmax = x > xmax ? x : xmax; |
660 | ymin = y < ymin ? y : ymin; |
372 | ymin = y < ymin ? y : ymin; |
661 | ymax = y > ymax ? y : ymax; |
373 | ymax = y > ymax ? y : ymax; |
662 | } |
|
|
663 | } |
374 | } |
664 | } |
|
|
665 | |
375 | |
666 | sl.buf = (unsigned char *) malloc (MAXSOCKBUF); |
376 | packet sl; |
667 | snprintf ((char *) sl.buf, MAXSOCKBUF, "magicmap %d %d %d %d ", (xmax - xmin + 1), (ymax - ymin + 1), |
377 | sl.printf ("magicmap %d %d %d %d ", (xmax - xmin + 1), (ymax - ymin + 1), |
668 | MAGIC_MAP_HALF - xmin, MAGIC_MAP_HALF - ymin); |
378 | MAGIC_MAP_HALF - xmin, MAGIC_MAP_HALF - ymin); |
669 | sl.len = strlen ((char *) sl.buf); |
|
|
670 | |
379 | |
671 | for (y = ymin; y <= ymax; y++) |
380 | for (int y = ymin; y <= ymax; y++) |
672 | { |
|
|
673 | for (x = xmin; x <= xmax; x++) |
381 | for (int x = xmin; x <= xmax; x++) |
674 | { |
|
|
675 | sl.buf[sl.len++] = map_mark[x + MAGIC_MAP_SIZE * y] & ~FACE_FLOOR; |
382 | sl << uint8 (map_mark[x + MAGIC_MAP_SIZE * y] & ~FACE_FLOOR); |
676 | } /* x loop */ |
|
|
677 | } /* y loop */ |
|
|
678 | |
383 | |
679 | Send_With_Handling (&pl->contr->socket, &sl); |
384 | pl->contr->ns->send_packet (sl); |
680 | free (sl.buf); |
385 | |
681 | free (map_mark); |
386 | free (map_mark); |
682 | } |
387 | } |
683 | |
388 | |
684 | |
|
|
685 | /** |
|
|
686 | * Send a kill log record to sockets |
|
|
687 | */ |
|
|
688 | |
|
|
689 | void |
|
|
690 | Log_Kill (const char *Who, const char *What, int WhatType, const char *With, int WithType) |
|
|
691 | { |
|
|
692 | int i; |
|
|
693 | size_t len; |
|
|
694 | char buf[MAX_BUF]; |
|
|
695 | |
|
|
696 | if (With != NULL) |
|
|
697 | { |
|
|
698 | snprintf (buf, MAX_BUF, "%s\t%s\t%d\t%s\t%d\n", Who, What, WhatType, With, WithType); |
|
|
699 | } |
|
|
700 | else |
|
|
701 | { |
|
|
702 | snprintf (buf, MAX_BUF, "%s\t%s\t%d\n", Who, What, WhatType); |
|
|
703 | } |
|
|
704 | len = strlen (buf); |
|
|
705 | for (i = 1; i < socket_info.allocated_sockets; i++) |
|
|
706 | { |
|
|
707 | if (init_sockets[i].old_mode == Old_Listen) |
|
|
708 | { |
|
|
709 | cs_write_string (&init_sockets[i], buf, len); |
|
|
710 | } |
|
|
711 | } |
|
|
712 | } |
|
|