| 1 | /* |
1 | /* |
| 2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 | * |
3 | * |
| 4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 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. |
|
|
| 21 | * |
20 | * |
| 22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 23 | */ |
22 | */ |
| 24 | |
23 | |
| 25 | #include <global.h> |
24 | #include <global.h> |
| 26 | #include <sproto.h> |
25 | #include <sproto.h> |
| 27 | |
26 | |
| … | |
… | |
| 41 | |
40 | |
| 42 | /* |
41 | /* |
| 43 | * spool works mostly like strtok(char *, ":"), but it can also |
42 | * spool works mostly like strtok(char *, ":"), but it can also |
| 44 | * log a specified error message if something goes wrong. |
43 | * log a specified error message if something goes wrong. |
| 45 | */ |
44 | */ |
| 46 | |
|
|
| 47 | char * |
45 | char * |
| 48 | spool (char *bp, char *error) |
46 | spool (char *bp, const char *error) |
| 49 | { |
47 | { |
| 50 | static char *prev_pos = NULL; |
48 | static char *prev_pos = NULL; |
| 51 | char *next_pos; |
49 | char *next_pos; |
| 52 | |
50 | |
| 53 | if (bp == NULL) |
51 | if (bp == NULL) |
| … | |
… | |
| 76 | |
74 | |
| 77 | /* |
75 | /* |
| 78 | * Does what it says, copies the contents of the first score structure |
76 | * Does what it says, copies the contents of the first score structure |
| 79 | * to the second one. |
77 | * to the second one. |
| 80 | */ |
78 | */ |
| 81 | |
|
|
| 82 | static void |
79 | static void |
| 83 | copy_score (score *sc1, score *sc2) |
80 | copy_score (score *sc1, score *sc2) |
| 84 | { |
81 | { |
| 85 | assign (sc2->name , sc1->name); |
82 | assign (sc2->name , sc1->name); |
| 86 | assign (sc2->title , sc1->title); |
83 | assign (sc2->title , sc1->title); |
| … | |
… | |
| 94 | |
91 | |
| 95 | /* |
92 | /* |
| 96 | * Writes the given score structure to a static buffer, and returns |
93 | * Writes the given score structure to a static buffer, and returns |
| 97 | * a pointer to it. |
94 | * a pointer to it. |
| 98 | */ |
95 | */ |
| 99 | |
|
|
| 100 | static char * |
96 | static char * |
| 101 | put_score (score *sc) |
97 | put_score (score *sc) |
| 102 | { |
98 | { |
| 103 | static char buf[MAX_BUF]; |
99 | static char buf[MAX_BUF]; |
| 104 | |
100 | |
| … | |
… | |
| 170 | static char retbuf[MAX_BUF]; |
166 | static char retbuf[MAX_BUF]; |
| 171 | |
167 | |
| 172 | if (!strncmp (sc->killer, "quit", MAX_NAME)) |
168 | if (!strncmp (sc->killer, "quit", MAX_NAME)) |
| 173 | sprintf (retbuf, "%3d %10lld %s the %s quit the game on map %s [%d][%d][%d].", |
169 | sprintf (retbuf, "%3d %10lld %s the %s quit the game on map %s [%d][%d][%d].", |
| 174 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
170 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
| 175 | else if (!strncmp (sc->killer, "left", MAX_NAME)) |
171 | else if (!strncmp (sc->killer, "leaving", MAX_NAME)) |
| 176 | sprintf (retbuf, "%3d %10lld %s the %s left the game on map %s [%d][%d][%d].", |
172 | sprintf (retbuf, "%3d %10lld %s the %s left the game on map %s [%d][%d][%d].", |
| 177 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
173 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
| 178 | else |
174 | else |
| 179 | sprintf (retbuf, "%3d %10lld %s the %s was killed by %s on map %s [%d][%d][%d].", |
175 | sprintf (retbuf, "%3d %10lld %s the %s was killed by %s on map %s [%d][%d][%d].", |
| 180 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->killer, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
176 | sc->position, (long long) sc->exp, sc->name, sc->title, sc->killer, sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
|
|
177 | |
| 181 | return retbuf; |
178 | return retbuf; |
| 182 | } |
179 | } |
| 183 | |
180 | |
| 184 | /* |
181 | /* |
| 185 | * add_score() adds the given score-structure to the high-score list, but |
182 | * add_score() adds the given score-structure to the high-score list, but |
| … | |
… | |
| 268 | if (op->stats.exp == 0) |
265 | if (op->stats.exp == 0) |
| 269 | return; |
266 | return; |
| 270 | |
267 | |
| 271 | assign (new_score.name, op->name); |
268 | assign (new_score.name, op->name); |
| 272 | assign (new_score.title, op->title.length () ? &op->title : op->contr->title); |
269 | assign (new_score.title, op->title.length () ? &op->title : op->contr->title); |
| 273 | assign (new_score.killer, op->contr->killer[0] ? op->contr->killer : "a dungeon collapse"); |
270 | assign (new_score.killer, op->contr->killer_name ()); |
| 274 | assign (new_score.maplevel, op->map ? op->map->name ? &op->map->name : &op->map->path : ""); |
271 | assign (new_score.maplevel, op->map ? op->map->name ? &op->map->name : &op->map->path : ""); |
| 275 | |
272 | |
| 276 | new_score.exp = op->stats.exp; |
273 | new_score.exp = op->stats.exp; |
| 277 | new_score.maxhp = op->stats.maxhp; |
274 | new_score.maxhp = op->stats.maxhp; |
| 278 | new_score.maxsp = op->stats.maxsp; |
275 | new_score.maxsp = op->stats.maxsp; |
| … | |
… | |
| 326 | LOG (llevError, "Cannot open highscore file %s: %s\n", buf, strerror (errno)); |
323 | LOG (llevError, "Cannot open highscore file %s: %s\n", buf, strerror (errno)); |
| 327 | if (op != NULL) |
324 | if (op != NULL) |
| 328 | new_draw_info (NDI_UNIQUE, 0, op, "There is no highscore file."); |
325 | new_draw_info (NDI_UNIQUE, 0, op, "There is no highscore file."); |
| 329 | return; |
326 | return; |
| 330 | } |
327 | } |
| 331 | if (op != NULL) |
328 | |
| 332 | clear_win_info (op); |
|
|
| 333 | new_draw_info (NDI_UNIQUE, 0, op, "Nr Score Who [max hp][max sp][max grace]"); |
329 | new_draw_info (NDI_UNIQUE, 0, op, "Nr Score Who [max hp][max sp][max grace]"); |
| 334 | |
330 | |
| 335 | while (fgets (buf, MAX_BUF, fp) != NULL) |
331 | while (fgets (buf, MAX_BUF, fp) != NULL) |
| 336 | { |
332 | { |
| 337 | if (j >= HIGHSCORE_LENGTH || i >= (max - 1)) |
333 | if (j >= HIGHSCORE_LENGTH || i >= (max - 1)) |
| 338 | break; |
334 | break; |
|
|
335 | |
| 339 | if ((sc = get_score (buf)) == NULL) |
336 | if ((sc = get_score (buf)) == NULL) |
| 340 | break; |
337 | break; |
|
|
338 | |
| 341 | sc->position = ++j; |
339 | sc->position = ++j; |
| 342 | if (match == NULL) |
340 | if (match == NULL) |
| 343 | { |
341 | { |
| 344 | scorebuf = draw_one_high_score (sc); |
342 | scorebuf = draw_one_high_score (sc); |
| 345 | i++; |
343 | i++; |
| … | |
… | |
| 352 | i++; |
350 | i++; |
| 353 | } |
351 | } |
| 354 | else |
352 | else |
| 355 | continue; |
353 | continue; |
| 356 | } |
354 | } |
|
|
355 | |
| 357 | /* Replaced what seemed to an overly complicated word wrap method |
356 | /* Replaced what seemed to an overly complicated word wrap method |
| 358 | * still word wraps, but assumes at most 2 lines of data. |
357 | * still word wraps, but assumes at most 2 lines of data. |
| 359 | * mw - 2-12-97 |
358 | * mw - 2-12-97 |
| 360 | */ |
359 | */ |
| 361 | assign (buf, scorebuf); |
360 | assign (buf, scorebuf); |
| … | |
… | |
| 384 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
383 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
| 385 | } |
384 | } |
| 386 | |
385 | |
| 387 | close_and_delete (fp, comp); |
386 | close_and_delete (fp, comp); |
| 388 | } |
387 | } |
|
|
388 | |
