1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/* Variations on RockDodger
* Copyright (C) 2004 Joshua Grams <josh@qualdan.com>
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <SDL.h>
#include <SDL_keysym.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "font.h"
#include "common.h"
#include "vorconfig.h"
#include "file.h"
#include "globals.h"
#include "score.h"
// High score table
// below are the defaults (when there's no high score file) in miliseconds
struct highscore g_scores[2][N_SCORES] = {
{
{120000,"-"},
{105000,"-"},
{ 90000,"-"},
{ 75000,"-"},
{ 60000,"-"},
{ 50000,"-"},
{ 40000,"-"},
{ 30000,"-"}
},
{
{120000,"-"},
{105000,"-"},
{ 90000,"-"},
{ 75000,"-"},
{ 60000,"-"},
{ 50000,"-"},
{ 40000,"-"},
{ 30000,"-"}
}
};
static char *titles[2] = { "Normal\n", "Easy\n" };
int g_easy = 0;
int cur_score = -1; // which score we're currently entering.
void
read_high_score_table()
{
FILE *f;
int i, j, ret;
f = open_score_file("r");
if(f) {
// If the file exists, read from it
for(j=0; j<2; j++) {
ret = fseek(f, strlen(titles[j]), SEEK_CUR);
if (ret != 0) {
break;
}
for(i = 0; i<N_SCORES; i++) {
ret = fscanf(f, "%d %31[^\n]\n", &g_scores[j][i].score, g_scores[j][i].name);
if (ret != 2) {
break;
}
}
}
fclose(f);
}
}
void
write_high_score_table()
{
FILE *f;
int i, j;
f = open_score_file("w");
if(f) {
// If the file exists, write to it
for(j=0; j<2; j++) {
fprintf(f, "%s", titles[j]);
for(i = 0; i<N_SCORES; i++) {
fprintf (f, "%d %.31s\n", g_scores[j][i].score, g_scores[j][i].name);
}
}
fclose(f);
}
}
int
score_rank(int score)
{
int i;
for(i=0; i<N_SCORES; i++) {
if(score > g_scores[g_easy][i].score) return i;
}
return -1;
}
int
new_high_score(int score)
{
cur_score = -1; // assume not a new high score
if(score <= g_scores[g_easy][LOW_SCORE].score) return false;
read_high_score_table();
cur_score = score_rank(score);
return cur_score >= 0;
}
int
insert_score(int score)
{
int i;
// Move all lower scores down a notch, losing lowest score forever.
if(strcmp(g_scores[g_easy][cur_score].name, "-") != 0)
for(i=LOW_SCORE; i>cur_score; i--)
g_scores[g_easy][i] = g_scores[g_easy][i-1];
// initialize new score entry.
g_scores[g_easy][cur_score].score = score;
for(i=0; i<32; i++) g_scores[g_easy][cur_score].name[i] = 0;
return true;
}
int
snprintscore(char *s, size_t n, int score)
{
int min = score/60000;
int sec = score/1000%60;
int tenths = score%1000/100;
if(min) {
return snprintf(s, n, "%2d:%.2d.%d", min, sec, tenths);
} else {
return snprintf(s, n, " %2d.%d", sec, tenths);
}
}
void
show_score(void)
{
char s[16];
int r = snprintf(s, 16, "Time: ");
snprintscore(s+r, 16-r, score);
font_write(XSIZE-250, 0, s);
}
void
display_scores(uint32_t x, uint32_t y)
{
char t[1024];
int i,h = font_height();
int display_cursor = (SDL_GetTicks() / CURSOR_BLINK_TIME) % 2;
font_write(x+30, y, "High scores");
y += h;
if(g_easy) font_write(x+75,y,"(easy)");
else font_write(x+60,y,"(normal)");
for(i = 0; i<N_SCORES; i++) {
y += h;
snprintf(t, 1024, "#%1d",i+1);
font_write(x, y, t);
snprintscore(t, 1024, g_scores[g_easy][i].score);
font_write(x+50, y, t);
if(display_cursor && i == cur_score) snprintf(t, 1024, "%s_", g_scores[g_easy][i].name);
else snprintf(t, 1024, "%s", g_scores[g_easy][i].name);
font_write(x+180, y, t);
}
}
int
process_score_input(SDL_keysym *key)
{
char *name;
int n;
name = g_scores[g_easy][cur_score].name;
n = strlen(name);
if(key->sym == SDLK_BACKSPACE) {
if(n > 0) name[--n]=0;
} else {
if(key->sym == SDLK_RETURN || key->sym == SDLK_KP_ENTER) {
SDL_EnableUNICODE(0);
cur_score = -1;
if(n == 0) {
name[0] = '-';
}
return false;
} else if(n < 12) {
if(key->unicode >= 32 && key->unicode <= 126) {
name[n++] = key->unicode;
}
} // else drop it
}
return true;
}
|
