1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #ifndef __CEXTRACT__ |
|
|
26 | # include <sproto.h> |
26 | #include <sproto.h> |
27 | #endif |
|
|
28 | |
27 | |
29 | /* |
28 | /* |
30 | * The score structure is used when treating new high-scores |
29 | * The score structure is used when treating new high-scores |
31 | */ |
30 | */ |
32 | |
|
|
33 | typedef struct scr |
31 | typedef struct scr |
34 | { |
32 | { |
35 | char name[64]; // name */ |
33 | char name[64]; // name */ |
36 | char title[64]; // Title */ |
34 | char title[64]; // Title */ |
37 | char killer[64]; // name (+ title) or "quit" */ |
35 | char killer[64]; // name (+ title) or "quit" */ |
… | |
… | |
43 | |
41 | |
44 | /* |
42 | /* |
45 | * spool works mostly like strtok(char *, ":"), but it can also |
43 | * spool works mostly like strtok(char *, ":"), but it can also |
46 | * log a specified error message if something goes wrong. |
44 | * log a specified error message if something goes wrong. |
47 | */ |
45 | */ |
48 | |
|
|
49 | char * |
46 | char * |
50 | spool (char *bp, char *error) |
47 | spool (char *bp, const char *error) |
51 | { |
48 | { |
52 | static char *prev_pos = NULL; |
49 | static char *prev_pos = NULL; |
53 | char *next_pos; |
50 | char *next_pos; |
54 | |
51 | |
55 | if (bp == NULL) |
52 | if (bp == NULL) |
… | |
… | |
78 | |
75 | |
79 | /* |
76 | /* |
80 | * Does what it says, copies the contents of the first score structure |
77 | * Does what it says, copies the contents of the first score structure |
81 | * to the second one. |
78 | * to the second one. |
82 | */ |
79 | */ |
83 | |
|
|
84 | static void |
80 | static void |
85 | copy_score (score *sc1, score *sc2) |
81 | copy_score (score *sc1, score *sc2) |
86 | { |
82 | { |
87 | assign (sc2->name , sc1->name); |
83 | assign (sc2->name , sc1->name); |
88 | assign (sc2->title , sc1->title); |
84 | assign (sc2->title , sc1->title); |
… | |
… | |
96 | |
92 | |
97 | /* |
93 | /* |
98 | * Writes the given score structure to a static buffer, and returns |
94 | * Writes the given score structure to a static buffer, and returns |
99 | * a pointer to it. |
95 | * a pointer to it. |
100 | */ |
96 | */ |
101 | |
|
|
102 | static char * |
97 | static char * |
103 | put_score (score *sc) |
98 | put_score (score *sc) |
104 | { |
99 | { |
105 | static char buf[MAX_BUF]; |
100 | static char buf[MAX_BUF]; |
106 | |
101 | |
107 | sprintf (buf, "%s:%s:%lld:%s:%s:%d:%d:%d", sc->name, sc->title, (long long) sc->exp, sc->killer, sc->maplevel, |
102 | sprintf (buf, "%s:%s:%" PRId64 ":%s:%s:%d:%d:%d", |
|
|
103 | sc->name, sc->title, (sint64)sc->exp, sc->killer, |
108 | sc->maxhp, sc->maxsp, sc->maxgrace); |
104 | sc->maplevel, sc->maxhp, sc->maxsp, sc->maxgrace); |
109 | return buf; |
105 | return buf; |
110 | } |
106 | } |
111 | |
107 | |
112 | /* |
108 | /* |
113 | * The oposite of put_score, get_score reads from the given buffer into |
109 | * The oposite of put_score, get_score reads from the given buffer into |
… | |
… | |
134 | assign (sc.title, cp); |
130 | assign (sc.title, cp); |
135 | |
131 | |
136 | if ((cp = spool (0, "score")) == NULL) |
132 | if ((cp = spool (0, "score")) == NULL) |
137 | return 0; |
133 | return 0; |
138 | |
134 | |
139 | long long exp; |
|
|
140 | sscanf (cp, "%lld", &exp); |
135 | sscanf (cp, "%" SCNd64, &sc.exp); |
141 | sc.exp = exp; |
|
|
142 | |
136 | |
143 | if ((cp = spool (0, "killer")) == NULL) |
137 | if ((cp = spool (0, "killer")) == NULL) |
144 | return 0; |
138 | return 0; |
145 | |
139 | |
146 | assign (sc.killer, cp); |
140 | assign (sc.killer, cp); |
… | |
… | |
269 | score *old_score; |
263 | score *old_score; |
270 | |
264 | |
271 | if (op->stats.exp == 0) |
265 | if (op->stats.exp == 0) |
272 | return; |
266 | return; |
273 | |
267 | |
274 | if (!op->contr->name_changed) |
|
|
275 | { |
|
|
276 | if (op->stats.exp > 0) |
|
|
277 | { |
|
|
278 | new_draw_info (NDI_UNIQUE, 0, op, "As you haven't changed your name, you won't"); |
|
|
279 | new_draw_info (NDI_UNIQUE, 0, op, "get into the high-score list."); |
|
|
280 | } |
|
|
281 | return; |
|
|
282 | } |
|
|
283 | |
|
|
284 | if (op->contr->explore) |
|
|
285 | { |
|
|
286 | new_draw_info (NDI_UNIQUE, 0, op, "Since you were in explore mode,"); |
|
|
287 | new_draw_info (NDI_UNIQUE, 0, op, "you can't enter the high-score list."); |
|
|
288 | return; |
|
|
289 | } |
|
|
290 | |
|
|
291 | assign (new_score.name, op->name); |
268 | assign (new_score.name, op->name); |
292 | 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); |
293 | assign (new_score.killer, op->contr->killer[0] ? op->contr->killer : "a dungeon collapse"); |
270 | assign (new_score.killer, op->contr->killer[0] ? op->contr->killer : "a dungeon collapse"); |
294 | 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 : ""); |
295 | |
272 | |
296 | new_score.exp = op->stats.exp; |
273 | new_score.exp = op->stats.exp; |
297 | new_score.maxhp = op->stats.maxhp; |
274 | new_score.maxhp = op->stats.maxhp; |
298 | new_score.maxsp = op->stats.maxsp; |
275 | new_score.maxsp = op->stats.maxsp; |
299 | new_score.maxgrace = op->stats.maxgrace; |
276 | new_score.maxgrace = op->stats.maxgrace; |