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.34 by pippijn, Thu Mar 1 12:28:17 2007 UTC vs.
Revision 1.44 by root, Tue Jun 5 13:05:03 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25/** 25/**
26 * \file 26 * \file
27 * Basic client output functions. 27 * Basic client output functions.
… …
86 86
87 if (pl->type == PLAYER) 87 if (pl->type == PLAYER)
88 esrv_print_msg (pl->contr->ns, colr, (char *) tmp); 88 esrv_print_msg (pl->contr->ns, colr, (char *) tmp);
89} 89}
90 90
91/** 91bool
92 * Prints out the contents of specified buffer structures, 92client::msg_suppressed (const char *msg)
93 * and clears the string.
94 */
95void
96flush_output_element (const object *pl, Output_Buf * outputs)
97{ 93{
98 char tbuf[MAX_BUF]; 94 if (!pl)
99
100 if (outputs->buf == NULL)
101 return; 95 return false;
102 if (outputs->count > 1) 96
103 { 97 if (pl->outputs_count <= 1 || !pl->outputs_sync)
104 snprintf (tbuf, MAX_BUF, "%d times %s", outputs->count, &outputs->buf); 98 return false;
105 print_message (NDI_BLACK, pl, tbuf); 99
100 int len = strlen (msg);
101
102 if (len > MSG_BUF_SIZE)
103 return false;
104
105 msg_buf *lru = msgbuf;
106 for (msg_buf *buf = msgbuf; buf < msgbuf + MSG_BUF_COUNT; ++buf)
106 } 107 {
107 else 108 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 { 109 {
142 if (pl->contr->outputs[i].buf && !strcmp (buf, pl->contr->outputs[i].buf)) 110 // found matching buf, see if expired
111 if (buf->expire <= pticks || !buf->count)
143 break; 112 {
144 else if (pl->contr->outputs[i].first_update < pl->contr->outputs[oldest].first_update) 113 // yes, take over matching buffer, print
145 oldest = i; 114 buf->expire = pticks + pl->outputs_sync;
115 buf->count = pl->outputs_count;
116
117 return false;
118 }
119
120 // no, suppress
121 --buf->count;
122 return true;
146 } 123 }
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 124
161 pl->contr->outputs[oldest].first_update = pticks; 125 if (lru->expire > buf->expire)
162 pl->contr->outputs[oldest].count = 1; 126 lru = buf;
163 pl->contr->outputs[oldest].buf = buf;
164 }
165 } 127 }
128
129 // new message, evoke oldest buffer
130 lru->expire = pticks + pl->outputs_sync;
131 lru->count = pl->outputs_count;
132 lru->len = len;
133 memcpy (lru->msg, msg, len);
134
135 return false;
166} 136}
167 137
168/** 138/**
169 * Sends message to player(s). 139 * Sends message to player(s).
170 * 140 *
… …
179 * in the flags. 149 * in the flags.
180 * 150 *
181 * If message is black, and not NDI_UNIQUE, gets sent through output buffers. 151 * If message is black, and not NDI_UNIQUE, gets sent through output buffers.
182 * 152 *
183 */ 153 */
184
185void 154void
186new_draw_info (int flags, int pri, const object *pl, const char *buf) 155new_draw_info (int flags, int pri, const object *op, const char *buf)
187{ 156{
188 if (flags & NDI_ALL) 157 if (flags & NDI_ALL)
189 { 158 {
190 for_all_players (pl) 159 for_all_players (pl)
191 new_draw_info (flags & ~NDI_ALL, pri, pl->ob, buf); 160 new_draw_info (flags & ~NDI_ALL, pri, pl->ob, buf);
192
193 return;
194 } 161 }
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 162 else
163 {
164 if (!op || !op->contr || !op->contr->ns)
165 return;
166
167 if (pri >= op->contr->listening)
168 return;
169
170 if ((flags & (NDI_COLOR_MASK | NDI_UNIQUE)) != NDI_BLACK
171 || !op->contr->ns->msg_suppressed (buf))
205 print_message (flags & NDI_COLOR_MASK, pl, buf); 172 print_message (flags & NDI_COLOR_MASK, op, buf);
173 }
206} 174}
207 175
208/** 176/**
209 * Wrapper for new_draw_info printf-like. 177 * Wrapper for new_draw_info printf-like.
210 * 178 *
… …
301} 269}
302 270
303/** 271/**
304 * Writes to everyone on the map except op1 and op2 272 * Writes to everyone on the map except op1 and op2
305 */ 273 */
306
307void 274void
308new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str) 275new_info_map_except2 (int color, maptile * map, object *op1, object *op2, const char *str)
309{ 276{
310 for_all_players (pl) 277 for_all_players (pl)
311 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2) 278 if (pl->ob != NULL && pl->ob->map == map && pl->ob != op1 && pl->ob != op2)
… …
313} 280}
314 281
315/** 282/**
316 * Writes to everyone on the specified map 283 * Writes to everyone on the specified map
317 */ 284 */
318
319void 285void
320new_info_map (int color, maptile * map, const char *str) 286new_info_map (int color, maptile * map, const char *str)
321{ 287{
322 for_all_players (pl) 288 for_all_players (pl)
323 if (pl->ob != NULL && pl->ob->map == map) 289 if (pl->ob != NULL && pl->ob->map == map)
324 new_draw_info (color, 0, pl->ob, str); 290 new_draw_info (color, 0, pl->ob, str);
325}
326
327/**
328 * This does nothing now. However, in theory, we should probably send
329 * something to the client and let the client figure out how it might want
330 * to handle this
331 */
332void
333clear_win_info (object *op)
334{
335}
336
337/**
338 * Get player's current range attack in obuf.
339 */
340void
341rangetostring (object *pl, char *obuf)
342{
343 switch (pl->contr->shoottype)
344 {
345 case range_none:
346 strcpy (obuf, "Range: nothing");
347 break;
348
349 case range_bow:
350 {
351 object *op;
352
353 for (op = pl->inv; op; op = op->below)
354 if (op->type == BOW && QUERY_FLAG (op, FLAG_APPLIED))
355 break;
356
357 if (op == NULL)
358 break;
359
360 sprintf (obuf, "Range: %s (%s)", query_base_name (op, 0), op->race ? (const char *) op->race : "nothing");
361 }
362 break;
363
364 case range_magic:
365 if (settings.casting_time == TRUE)
366 {
367 if (pl->casting_time > -1)
368 {
369 if (pl->casting_time == 0)
370 sprintf (obuf, "Range: Holding spell (%s)", &pl->spell->name);
371 else
372 sprintf (obuf, "Range: Casting spell (%s)", &pl->spell->name);
373 }
374 else
375 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
376 }
377 else
378 sprintf (obuf, "Range: spell (%s)", &pl->contr->ranges[range_magic]->name);
379 break;
380
381 case range_misc:
382 sprintf (obuf, "Range: %s", pl->contr->ranges[range_misc] ? query_base_name (pl->contr->ranges[range_misc], 0) : "none");
383 break;
384
385 /* range_scroll is only used for controlling golems. If the
386 * the player does not have a golem, reset some things.
387 */
388 case range_golem:
389 if (pl->contr->ranges[range_golem] != NULL)
390 sprintf (obuf, "Range: golem (%s)", &pl->contr->ranges[range_golem]->name);
391 else
392 {
393 pl->contr->shoottype = range_none;
394 strcpy (obuf, "Range: nothing");
395 }
396 break;
397
398 case range_skill:
399 sprintf (obuf, "Skill: %s", pl->chosen_skill != NULL ? (const char *) pl->chosen_skill->name : "none");
400 break;
401
402 case range_builder:
403 sprintf (obuf, "Builder: %s", query_base_name (pl->contr->ranges[range_builder], 0));
404 break;
405
406 default:
407 strcpy (obuf, "Range: illegal");
408 }
409} 291}
410 292
411/** 293/**
412 * Sets player title. 294 * Sets player title.
413 */ 295 */
… …
419 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title); 301 sprintf (buf, "Player: %s the %s", (const char *) pl->name, (const char *) pl->contr->title);
420 else 302 else
421 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title); 303 sprintf (buf, "Player: %s %s", (const char *) pl->name, (const char *) pl->contr->own_title);
422} 304}
423 305
306// formerly a macro, used only by magic map, so optimised it out
307static inline faceidx
308GET_MAP_FACE (maptile *m, int x, int y, int layer)
309{
310 if (object *op = GET_MAP_FACE_OBJ (m, x, y, layer))
311 return op->face;
312 else
313 return 0;
314}
424 315
425/** 316/**
426 * Helper for magic map creation. 317 * Helper for magic map creation.
427 * 318 *
428 * Takes a player, the map_mark array and an x and y starting position. 319 * Takes a player, the map_mark array and an x and y starting position.
… …
437magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py) 328magic_mapping_mark_recursive (object *pl, char *map_mark, int px, int py)
438{ 329{
439 int x, y, dx, dy, mflags; 330 int x, y, dx, dy, mflags;
440 sint16 nx, ny; 331 sint16 nx, ny;
441 maptile *mp; 332 maptile *mp;
442 facetile *f;
443 333
444 for (dx = -1; dx <= 1; dx++) 334 for (dx = -1; dx <= 1; dx++)
445 { 335 {
446 for (dy = -1; dy <= 1; dy++) 336 for (dy = -1; dy <= 1; dy++)
447 { 337 {
… …
459 if (mflags & P_OUT_OF_MAP) 349 if (mflags & P_OUT_OF_MAP)
460 continue; 350 continue;
461 351
462 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0) 352 if (map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] == 0)
463 { 353 {
464 f = GET_MAP_FACE (mp, nx, ny, 0); 354 int f = GET_MAP_FACE (mp, nx, ny, 0);
465 if (f == blank_face) 355 if (f == blank_face)
356 {
466 f = GET_MAP_FACE (mp, nx, ny, 1); 357 f = GET_MAP_FACE (mp, nx, ny, 1);
467 if (f == blank_face) 358 if (f == blank_face)
468 f = GET_MAP_FACE (mp, nx, ny, 2); 359 f = GET_MAP_FACE (mp, nx, ny, 2);
360 }
361
362 int magicmap = faces [f].magicmap;
469 363
470 /* Should probably have P_NO_MAGIC here also, but then shops don't 364 /* Should probably have P_NO_MAGIC here also, but then shops don't
471 * work. 365 * work.
472 */ 366 */
473 if (mflags & P_BLOCKSVIEW) 367 if (mflags & P_BLOCKSVIEW)
474 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 368 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
475 else 369 else
476 { 370 {
477 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 371 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
478 magic_mapping_mark_recursive (pl, map_mark, x, y); 372 magic_mapping_mark_recursive (pl, map_mark, x, y);
479 } 373 }
480 } 374 }
481 } 375 }
482 } 376 }
483} 377}
484
485 378
486/** 379/**
487 * Creates magic map for player. 380 * Creates magic map for player.
488 * 381 *
489 * Note: For improved magic mapping display, the space that blocks 382 * Note: For improved magic mapping display, the space that blocks
… …
496 * is for open spaces. map_mark should already have been initialised 389 * is for open spaces. map_mark should already have been initialised
497 * to zero before this is called. 390 * to zero before this is called.
498 * strength is an initial strength*2 rectangular area that we automatically 391 * strength is an initial strength*2 rectangular area that we automatically
499 * see in/penetrate through. 392 * see in/penetrate through.
500 */ 393 */
501
502void 394void
503magic_mapping_mark (object *pl, char *map_mark, int strength) 395magic_mapping_mark (object *pl, char *map_mark, int strength)
504{ 396{
505 int x, y, mflags; 397 int x, y, mflags;
506 sint16 nx, ny; 398 sint16 nx, ny;
507 maptile *mp; 399 maptile *mp;
508 facetile *f;
509 400
510 for (x = -strength; x < strength; x++) 401 for (x = -strength; x < strength; x++)
511 { 402 {
512 for (y = -strength; y < strength; y++) 403 for (y = -strength; y < strength; y++)
513 { 404 {
514 mp = pl->map; 405 mp = pl->map;
515 nx = pl->x + x; 406 nx = pl->x + x;
516 ny = pl->y + y; 407 ny = pl->y + y;
408
517 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny); 409 mflags = get_map_flags (pl->map, &mp, nx, ny, &nx, &ny);
518 if (mflags & P_OUT_OF_MAP) 410 if (mflags & P_OUT_OF_MAP)
519 continue; 411 continue;
520 else 412
413 int f = GET_MAP_FACE (mp, nx, ny, 0);
414 if (f == blank_face)
521 { 415 {
522 f = GET_MAP_FACE (mp, nx, ny, 0);
523 if (f == blank_face)
524 f = GET_MAP_FACE (mp, nx, ny, 1); 416 f = GET_MAP_FACE (mp, nx, ny, 1);
525 if (f == blank_face) 417 if (f == blank_face)
526 f = GET_MAP_FACE (mp, nx, ny, 2); 418 f = GET_MAP_FACE (mp, nx, ny, 2);
527 } 419 }
528 420
421 int magicmap = faces [f].magicmap;
422
529 if (mflags & P_BLOCKSVIEW) 423 if (mflags & P_BLOCKSVIEW)
530 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | (f ? f->magicmap : 0); 424 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_WALL | magicmap;
531 else 425 else
532 { 426 {
533 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | (f ? f->magicmap : 0); 427 map_mark[MAGIC_MAP_HALF + x + MAGIC_MAP_SIZE * (MAGIC_MAP_HALF + y)] = FACE_FLOOR | magicmap;
534 magic_mapping_mark_recursive (pl, map_mark, x, y); 428 magic_mapping_mark_recursive (pl, map_mark, x, y);
535 } 429 }
536 } 430 }
537 } 431 }
538} 432}

Diff Legend

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