1 /* Variations on RockDodger
2 * Copyright (C) 2004 Joshua Grams <josh@qualdan.com>
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License as published by the
6 * Free Software Foundation; either version 2 of the License, or (at your
7 * option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 #include <SDL_keysym.h>
34 struct highscore g_scores[2][N_SCORES] = {
57 static char *titles[2] = { "Normal\n", "Easy\n" };
59 extern SFont_Font *g_font;
62 int cur_score = -1; // which score we're currently entering.
65 read_high_score_table()
70 f = open_score_file("r");
72 // If the file exists, read from it
75 for(i = 0; i<N_SCORES; i++) {
76 fscanf(f, "%d %31[^\n]\n", &g_scores[j][i].score, g_scores[j][i].name);
84 write_high_score_table()
89 f = open_score_file("w");
91 // If the file exists, write to it
93 fprintf(f, titles[j]);
94 for(i = 0; i<N_SCORES; i++) {
95 fprintf (f, "%d %.31s\n", g_scores[j][i].score, g_scores[j][i].name);
103 score_rank(int score)
107 for(i=0; i<N_SCORES; i++) {
108 if(score > g_scores[g_easy][i].score) return i;
114 new_high_score(int score)
116 cur_score = -1; // assume not a new high score
117 if(score <= g_scores[g_easy][LOW_SCORE].score) return false;
118 read_high_score_table();
119 cur_score = score_rank(score);
120 return cur_score >= 0;
124 insert_score(int score)
128 // Move all lower scores down a notch, losing lowest score forever.
129 if(strcmp(g_scores[g_easy][cur_score].name, "-") != 0)
130 for(i=LOW_SCORE; i>cur_score; i--)
131 g_scores[g_easy][i] = g_scores[g_easy][i-1];
133 // initialize new score entry.
134 g_scores[g_easy][cur_score].score = score;
135 for(i=0; i<32; i++) g_scores[g_easy][cur_score].name[i] = 0;
140 snprintscore(char *s, size_t n, int score)
142 int min = score/60000;
143 int sec = score/1000%60;
144 int tenths = score%1000/100;
146 return snprintf(s, n, "%2d:%.2d.%d", min, sec, tenths);
148 return snprintf(s, n, "%2d.%d", sec, tenths);
156 int r = snprintf(s, 16, "Time: ");
157 snprintscore(s+r, 16-r, score);
158 SFont_Write(surf_screen, g_font, XSIZE-250, 0, s);
162 display_scores(SDL_Surface *s, uint32_t x, uint32_t y)
165 int i,h = SFont_TextHeight(g_font);
167 SFont_Write(s,g_font,x+30,y,"High scores");
169 if(g_easy) SFont_Write(s,g_font,x+75,y,"(easy)");
170 else SFont_Write(s,g_font,x+60,y,"(normal)");
171 for(i = 0; i<N_SCORES; i++) {
173 snprintf(t, 1024, "#%1d",i+1);
174 SFont_Write(s, g_font, x, y, t);
175 snprintscore(t, 1024, g_scores[g_easy][i].score);
176 SFont_Write(s, g_font, x+50, y, t);
177 if(i == cur_score) snprintf(t, 1024, "%s_", g_scores[g_easy][i].name);
178 else snprintf(t, 1024, "%s", g_scores[g_easy][i].name);
179 SFont_Write(s, g_font, x+180, y, t);
184 process_score_input(SDL_keysym *key)
189 name = g_scores[g_easy][cur_score].name;
192 if(key->sym == SDLK_BACKSPACE) {
193 if(n > 0) name[--n]=0;
195 if(key->sym == SDLK_RETURN) {
196 SDL_EnableUNICODE(0);
199 } else name[n++] = key->unicode;