ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/socket/info.C
(Generate patch)

Comparing deliantra/server/socket/info.C (file contents):
Revision 1.29 by pippijn, Wed Jan 3 00:21:36 2007 UTC vs.
Revision 1.47 by root, Thu Nov 8 19:43:29 2007 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
4 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 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,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
21 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 22 */
24 23
25/** 24/**
26 * \file 25 * \file
27 * Basic client output functions. 26 * Basic client output functions.
28 * 27 *
… …
36#include <sproto.h> 35#include <sproto.h>
37#include <stdarg.h> 36#include <stdarg.h>
38#include <spells.h> 37#include <spells.h>
39#include <skills.h> 38#include <skills.h>
40 39
40#include <cstring>
41
41/** 42/**
42 * Draws a normal message on the client. It is pretty 43 * Draws a normal message on the client. It is pretty
43 * much the same thing as the draw_info above, but takes a color 44 * much the same thing as the draw_info above, but takes a color
44 * parameter. the esrv_drawinfo functions should probably be 45 * parameter. the esrv_drawinfo functions should probably be
45 * replaced with this, just using black as the color. 46 * replaced with this, just using black as the color.
46 */ 47 */
47static void 48static void
48esrv_print_msg (client *ns, int color, const char *str) 49esrv_print_msg (client *ns, int color, const char *str)
49{ 50{
50 ns->send_packet_printf ("drawinfo %d %s", color, str); 51 ns->send_msg (color, "info", str);
51} 52}
52 53
53/** 54/**
54 * Draws an extended message on the client. 55 * Draws an extended message on the client.
55 * ns the socket to send message to 56 * ns the socket to send message to
… …
60 * message The main message 61 * message The main message
61 */ 62 */
62static void 63static void
63esrv_print_ext_msg (client *ns, int color, uint8 type, uint8 subtype, const char *message) 64esrv_print_ext_msg (client *ns, int color, uint8 type, uint8 subtype, const char *message)
64{ 65{
65 ns->send_packet_printf ("drawextinfo %d %hhu %hhu %s", color, type, subtype, message); 66 ns->send_packet_printf ("drawextinfo %d %u %u %s", color, type, subtype, message);
66} 67}
67 68
68/** 69/**
69 * Frontend for esrv_print_msg 70 * Frontend for esrv_print_msg
70 * \param colr message color 71 * \param colr message color
… …
83 84
84 if (!pl || (pl->type == PLAYER && pl->contr == NULL)) 85 if (!pl || (pl->type == PLAYER && pl->contr == NULL))
85 return; 86 return;
86 87
87 if (pl->type == PLAYER) 88 if (pl->type == PLAYER)
88 esrv_print_msg (pl->contr->ns, colr, (char *) tmp); 89 esrv_print_msg (pl->contr->ns, colr, (char *)tmp);
89} 90}
90 91
91/** 92bool
92 * Prints out the contents of specified buffer structures, 93client::msg_suppressed (const char *msg)
93 * and clears the string.
94 */
95void
96flush_output_element (const object *pl, Output_Buf * outputs)
97{ 94{
98 char tbuf[MAX_BUF]; 95 if (!pl)
99
100 if (outputs->buf == NULL)
101 return; 96 return false;
102 if (outputs->count > 1) 97
103 { 98 if (pl->outputs_count <= 1 || !pl->outputs_sync)
104 snprintf (tbuf, MAX_BUF, "%d times %s", outputs->count, &outputs->buf); 99 return false;
105 print_message (NDI_BLACK, pl, tbuf); 100
101 int len = strlen (msg);
102
103 if (len > MSG_BUF_SIZE)
104 return false;
105
106 msg_buf *lru = msgbuf;
107 for (msg_buf *buf = msgbuf; buf < msgbuf + MSG_BUF_COUNT; ++buf)
106 } 108 {
107 else 109 if (len == buf->len && !memcmp (msg, buf->msg, len))
108 print_message (NDI_BLACK, pl, &outputs->buf);
109
110 outputs->buf = NULL;
111 outputs->first_update = 0; /* This way, it will be reused */
112}
113
114/**
115 * Sends message to player through output buffers.
116 * \param pl player to send message
117 * \param buf message to send
118 *
119 * If player's output_count is 1, sends message directly.
120 *
121 * Else checks output buffers for specified message.
122 *
123 * If found, checks if message should be sent now.
124 *
125 * If message not already in buffers, flushes olders buffer,
126 * and adds message to queue.
127 */
128static void
129check_output_buffers (const object *pl, const char *buf)
130{
131 int i, oldest = 0;
132
133 if (pl->contr->outputs_count < 2)
134 {
135 print_message (NDI_BLACK, pl, buf);
136 return;
137 }
138 else
139 {
140 for (i = 0; i < NUM_OUTPUT_BUFS; i++)
141 { 110 {
142 if (pl->contr->outputs[i].buf && !strcmp (buf, pl->contr->outputs[i].buf)) 111 // found matching buf, see if expired
112 if (buf->expire <= pticks || !buf->count)
143 break; 113 {
144 else if (pl->contr->outputs[i].first_update < pl->contr->outputs[oldest].first_update) 114 // yes, take over matching buffer, print
145 oldest = i; 115 buf->expire = pticks + pl->outputs_sync;
116 buf->count = pl->outputs_count;
117
118 return false;
119 }
120
121 // no, suppress
122 --buf->count;
123 return true;
146 } 124 }
147 /* We found a match */
148 if (i < NUM_OUTPUT_BUFS)
149 {
150 pl->contr->outputs[i].count++;
151 if (pl->contr->outputs[i].count >= pl->contr->outputs_count)
152 {
153 flush_output_element (pl, &pl->contr->outputs[i]);
154 }
155 }
156 /* No match - flush the oldest, and put the new one in */
157 else
158 {
159 flush_output_element (pl, &pl->contr->outputs[oldest]);
160 125
161 pl->contr->outputs[oldest].first_update = pticks; 126 if (lru->expire > buf->expire)
162 pl->contr->outputs[oldest].count = 1; 127 lru = buf;
163 pl->contr->outputs[oldest].buf = buf;
164 }
165 } 128 }
129
130 // new message, evoke oldest buffer
131 lru->expire = pticks + pl->outputs_sync;
132 lru->count = pl->outputs_count;
133 lru->len = len;
134 memcpy (lru->msg, msg, len);
135
136 return false;
166} 137}
167 138
168/** 139/**
169 * Sends message to player(s). 140 * Sends message to player(s).
170 * 141 *
… …
179 * in the flags. 150 * in the flags.
180 * 151 *
181 * If message is black, and not NDI_UNIQUE, gets sent through output buffers. 152 * If message is black, and not NDI_UNIQUE, gets sent through output buffers.
182 * 153 *
183 */ 154 */
184
185void 155void
186new_draw_info (int flags, int pri, const object *pl, const char *buf) 156new_draw_info (int flags, int pri, const object *op, const char *buf)
187{ 157{
188 if (flags & NDI_ALL) 158 if (flags & NDI_ALL)
189 { 159 {
190 for_all_players (pl) 160 for_all_players (pl)
191 new_draw_info (flags & ~NDI_ALL, pri, pl->ob, buf); 161 new_draw_info (flags & ~NDI_ALL, pri, pl->ob, buf);
192
193 return;
194 } 162 }
195
196 if (!pl || pl->type != PLAYER || !pl->contr || !pl->contr->ns)
197 return;
198
199 if (pri >= pl->contr->listening)
200 return;
201
202 if ((flags & NDI_COLOR_MASK) == NDI_BLACK && !(flags & NDI_UNIQUE))
203 check_output_buffers (pl, buf);
204 else 163 else
164 {
165 if (!op || !op->contr || !op->contr->ns)
166 return;
167
168 if (pri >= op->contr->listening)
169 return;
170
171 if ((flags & (NDI_COLOR_MASK | NDI_UNIQUE)) != NDI_BLACK
172 || !op->contr->ns->msg_suppressed (buf))
205 print_message (flags & NDI_COLOR_MASK, pl, buf); 173 print_message (flags & NDI_COLOR_MASK, op, buf);
174 }
206} 175}
207 176
208/** 177/**
209 * Wrapper for new_draw_info printf-like. 178 * Wrapper for new_draw_info printf-like.
210 * 179 *
… …
255} 224}
256 225
257void 226void
258draw_ext_info_format (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *old_format, char *new_format, ...) 227draw_ext_info_format (int flags, int pri, const object *pl, uint8 type, uint8 subtype, const char *old_format, char *new_format, ...)
259{ 228{
260
261 char buf[HUGE_BUF]; 229 char buf[HUGE_BUF];
262 230
263 if (!pl || (pl->type != PLAYER) || (pl->contr == NULL)) 231 if (!pl || (pl->type != PLAYER) || (pl->contr == NULL))
264 return; 232 return;
265 233
… …
294 */ 262 */
295 263
296void 264void
297new_info_map_except (int color, maptile * map, object *op, const char *str) 265new_info_map_except (int color, maptile * map, object *op, const char *str)
298{ 266{
299 player *pl;
300
301 for_all_players (pl) 267 for_all_players (pl)
302 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op) 268 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op)
303 {
304 new_draw_info (color, 0, pl->ob, str); 269 new_draw_info (color, 0, pl->ob, str);
305 }
306} 270}
307 271
308/** 272/**
309 * Writes to everyone on the map except op1 and op2 273 * Writes to everyone on the map except op1 and op2
310 */ 274 */
311
312void 275void
313new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str) 276new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str)
314{ 277{
315 player *pl;
316
317 for_all_players (pl) 278 for_all_players (pl)
318 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2) 279 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2)
319 {
320 new_draw_info (color, 0, pl->ob, str); 280 new_draw_info (color, 0, pl->ob, str);
321 }
322} 281}
323 282
324/** 283/**
325 * Writes to everyone on the specified map 284 * Writes to everyone on the specified map
326 */ 285 */
327
328void 286void
329new_info_map (int color, maptile * map, const char *str) 287new_info_map (int color, maptile * map, const char *str)
330{ 288{
331 player *pl;
332
333 for_all_players (pl) 289 for_all_players (pl)
334 if (pl->ob != NULL && pl->ob->map == map) 290 if (pl->ob != NULL && pl->ob->map == map)
335 {
336 new_draw_info (color, 0, pl->ob, str); 291 new_draw_info (color, 0, pl->ob, str);
337 }
338}
339
340
341/**
342 * This does nothing now. However, in theory, we should probably send
343 * something to the client and let the client figure out how it might want
344 * to handle this
345 */
346void
347clear_win_info (object *op)
348{
349}
350
351/**
352 * Get player's current range attack in obuf.
353 */
354void
355rangetostring (object *pl, char *obuf)
356{
357 switch (pl->contr->shoottype)
358 {
359 case range_none:
360 strcpy (obuf, "Range: nothing");
361 break;
362
363 case range_bow:
364 {
365 object *op;
366
367 for (op = pl->inv; op; op = op->below)
368 if (op->type == BOW && QUERY_FLAG (op, FLAG_APPLIED))
369 break;
370
371 if (op == NULL)
372 break;
373
374 sprintf (obuf, "Range: %s (%s)", query_base_name (op, 0), op->race ? (const char *) op->race : "nothing");
375 }
376 break;
377
378 case range_magic:
379 if (settings.casting_time == TRUE)
380 {
381 if (pl->casting_time > -1)
382 {
383 if (pl->casting_time == 0)
384 sprintf (obuf, "Range: Holding spell (%s)", &pl->spell->name);
385 else
386 sprintf (obuf, "Range: Casting spell (%s)", &pl->spell->name);
387 }
388 else
389 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
390 }
391 else
392 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
393 break;
394
395 case range_misc:
396 sprintf (obuf, "Range: %s", pl->contr->ranges[range_misc] ? query_base_name (pl->contr->ranges[range_misc], 0) : "none");
397 break;
398
399 /* range_scroll is only used for controlling golems. If the
400 * the player does not have a golem, reset some things.
401 */
402 case range_golem:
403 if (pl->contr->ranges[range_golem] != NULL)
404 sprintf (obuf, "Range: golem (%s)", &pl->contr->ranges[range_golem]->name);
405 else
406 {
407 pl->contr->shoottype = range_none;
408 strcpy (obuf, "Range: nothing");
409 }
410 break;
411
412 case range_skill:
413 sprintf (obuf, "Skill: %s", pl->chosen_skill != NULL ? (const char *) pl->chosen_skill->name : "none");
414 break;
415
416 case range_builder:
417 sprintf (obuf, "Builder: %s", query_base_name (pl->contr->ranges[range_builder], 0));
418 break;
419
420 default:
421 strcpy (obuf, "Range: illegal");
422 }
423} 292}
424 293
425/** 294/**
426 * Sets player title. 295 * Sets player title.
427 */ 296 */
… …
433 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title); 302 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title);
434 else 303 else
435 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title); 304 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title);
436} 305}
437 306
307// formerly a macro, used only by magic map, so optimised it out
308static inline faceidx
309GET_MAP_FACE (maptile *m, int x, int y, int layer)
310{
311 if (object *op = GET_MAP_FACE_OBJ (m, x, y, layer))
312 return op->face;
313 else
314 return 0;
315}
438 316
439/** 317/**
440 * Helper for magic map creation. 318 * Helper for magic map creation.
441 * 319 *
442 * Takes a player, the map_mark array and an x and y starting position. 320 * Takes a player, the map_mark array and an x and y starting position.
… …
451magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py) 329magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py)
452{ 330{
453 int x, y, dx, dy, mflags; 331 int x, y, dx, dy, mflags;
454 sint16 nx, ny; 332 sint16 nx, ny;
455 maptile *mp; 333 maptile *mp;
456 New_Face *f;
457 334
458 for (dx = -1; dx <= 1; dx++) 335 for (dx = -1; dx <= 1; dx++)
459 { 336 {
460 for (dy = -1; dy <= 1; dy++) 337 for (dy = -1; dy <= 1; dy++)
461 { 338 {
… …
473 if (mflags & P_OUT_OF_MAP) 350 if (mflags & P_OUT_OF_MAP)
474 continue; 351 continue;
475 352
476 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0) 353 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0)
477 { 354 {
478 f = GET_MAP_FACE (mp, nx, ny, 0); 355 int f = GET_MAP_FACE (mp, nx, ny, 0);
479 if (f == blank_face) 356 if (f == blank_face)
357 {
480 f = GET_MAP_FACE (mp, nx, ny, 1); 358 f = GET_MAP_FACE (mp, nx, ny, 1);
481 if (f == blank_face) 359 if (f == blank_face)
482 f = GET_MAP_FACE (mp, nx, ny, 2); 360 f = GET_MAP_FACE (mp, nx, ny, 2);
361 }
362
363 int magicmap = faces [f].magicmap;
483 364
484 /* Should probably have P_NO_MAGIC here also, but then shops don't 365 /* Should probably have P_NO_MAGIC here also, but then shops don't
485 * work. 366 * work.
486 */ 367 */
487 if (mflags & P_BLOCKSVIEW) 368 if (mflags & P_BLOCKSVIEW)
488 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 369 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
489 else 370 else
490 { 371 {
491 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 372 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
492 magic_mapping_mark_recursive (pl, map_mark, x, y); 373 magic_mapping_mark_recursive (pl, map_mark, x, y);
493 } 374 }
494 } 375 }
495 } 376 }
496 } 377 }
497} 378}
498
499 379
500/** 380/**
501 * Creates magic map for player. 381 * Creates magic map for player.
502 * 382 *
503 * Note: For improved magic mapping display, the space that blocks 383 * Note: For improved magic mapping display, the space that blocks
… …
510 * is for open spaces. map_mark should already have been initialised 390 * is for open spaces. map_mark should already have been initialised
511 * to zero before this is called. 391 * to zero before this is called.
512 * strength is an initial strength*2 rectangular area that we automatically 392 * strength is an initial strength*2 rectangular area that we automatically
513 * see in/penetrate through. 393 * see in/penetrate through.
514 */ 394 */
515
516void 395void
517magic_mapping_mark (object *pl, char *map_mark, int strength) 396magic_mapping_mark (object *pl, char *map_mark, int strength)
518{ 397{
519 int x, y, mflags; 398 int x, y, mflags;
520 sint16 nx, ny; 399 sint16 nx, ny;
521 maptile *mp; 400 maptile *mp;
522 New_Face *f;
523 401
524 for (x = -strength; x < strength; x++) 402 for (x = -strength; x < strength; x++)
525 { 403 {
526 for (y = -strength; y < strength; y++) 404 for (y = -strength; y < strength; y++)
527 { 405 {
528 mp = pl->map; 406 mp = pl->map;
529 nx = pl->x + x; 407 nx = pl->x + x;
530 ny = pl->y + y; 408 ny = pl->y + y;
409
531 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny); 410 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny);
532 if (mflags & P_OUT_OF_MAP) 411 if (mflags & P_OUT_OF_MAP)
533 continue; 412 continue;
534 else 413
414 int f = GET_MAP_FACE (mp, nx, ny, 0);
415 if (f == blank_face)
535 { 416 {
536 f = GET_MAP_FACE (mp, nx, ny, 0);
537 if (f == blank_face)
538 f = GET_MAP_FACE (mp, nx, ny, 1); 417 f = GET_MAP_FACE (mp, nx, ny, 1);
539 if (f == blank_face) 418 if (f == blank_face)
540 f = GET_MAP_FACE (mp, nx, ny, 2); 419 f = GET_MAP_FACE (mp, nx, ny, 2);
541 } 420 }
542 421
422 int magicmap = faces [f].magicmap;
423
543 if (mflags & P_BLOCKSVIEW) 424 if (mflags & P_BLOCKSVIEW)
544 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 425 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
545 else 426 else
546 { 427 {
547 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 428 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
548 magic_mapping_mark_recursive (pl, map_mark, x, y); 429 magic_mapping_mark_recursive (pl, map_mark, x, y);
549 } 430 }
550 } 431 }
551 } 432 }
552} 433}
… …
557 * The following function is a lot messier than it really should be, 438 * The following function is a lot messier than it really should be,
558 * but there is no real easy solution. 439 * but there is no real easy solution.
559 * 440 *
560 * Mark Wedel 441 * Mark Wedel
561 */ 442 */
562
563void 443void
564draw_magic_map (object *pl) 444draw_magic_map (object *pl)
565{ 445{
566 char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1); 446 char *map_mark = (char *)calloc (MAGIC_MAP_SIZE * MAGIC_MAP_SIZE, 1);
567 int xmin, xmax, ymin, ymax; 447 int xmin, xmax, ymin, ymax;

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines