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 // below are the defaults (when there's no high score file) in miliseconds
35 struct highscore g_scores[2][N_SCORES] = {
58 static char *titles[2] = { "Normal\n", "Easy\n" };
61 int cur_score = -1; // which score we're currently entering.
64 read_high_score_table()
69 f = open_score_file("r");
71 // If the file exists, read from it
74 for(i = 0; i<N_SCORES; i++) {
75 fscanf(f, "%d %31[^\n]\n", &g_scores[j][i].score, g_scores[j][i].name);
83 write_high_score_table()
88 f = open_score_file("w");
90 // If the file exists, write to it
92 fprintf(f, titles[j]);
93 for(i = 0; i<N_SCORES; i++) {
94 fprintf (f, "%d %.31s\n", g_scores[j][i].score, g_scores[j][i].name);
102 score_rank(int score)
106 for(i=0; i<N_SCORES; i++) {
107 if(score > g_scores[g_easy][i].score) return i;
113 new_high_score(int score)
115 cur_score = -1; // assume not a new high score
116 if(score <= g_scores[g_easy][LOW_SCORE].score) return false;
117 read_high_score_table();
118 cur_score = score_rank(score);
119 return cur_score >= 0;
123 insert_score(int score)
127 // Move all lower scores down a notch, losing lowest score forever.
128 if(strcmp(g_scores[g_easy][cur_score].name, "-") != 0)
129 for(i=LOW_SCORE; i>cur_score; i--)
130 g_scores[g_easy][i] = g_scores[g_easy][i-1];
132 // initialize new score entry.
133 g_scores[g_easy][cur_score].score = score;
134 for(i=0; i<32; i++) g_scores[g_easy][cur_score].name[i] = 0;
139 snprintscore(char *s, size_t n, int score)
141 int min = score/60000;
142 int sec = score/1000%60;
143 int tenths = score%1000/100;
145 return snprintf(s, n, "%2d:%.2d.%d", min, sec, tenths);
147 return snprintf(s, n, " %2d.%d", sec, tenths);
155 int r = snprintf(s, 16, "Time: ");
156 snprintscore(s+r, 16-r, score);
157 font_write(XSIZE-250, 0, s);
161 display_scores(uint32_t x, uint32_t y)
164 int i,h = font_height();
165 int display_cursor = (SDL_GetTicks() / CURSOR_BLINK_TIME) % 2;
168 font_write(x+30, y, "High scores");
170 if(g_easy) font_write(x+75,y,"(easy)");
171 else font_write(x+60,y,"(normal)");
172 for(i = 0; i<N_SCORES; i++) {
174 snprintf(t, 1024, "#%1d",i+1);
176 snprintscore(t, 1024, g_scores[g_easy][i].score);
177 font_write(x+50, y, t);
178 if(display_cursor && i == cur_score) snprintf(t, 1024, "%s_", g_scores[g_easy][i].name);
179 else snprintf(t, 1024, "%s", g_scores[g_easy][i].name);
180 font_write(x+180, y, t);
185 process_score_input(SDL_keysym *key)
190 name = g_scores[g_easy][cur_score].name;
193 if(key->sym == SDLK_BACKSPACE) {
194 if(n > 0) name[--n]=0;
196 if(key->sym == SDLK_RETURN || key->sym == SDLK_KP_ENTER) {
197 SDL_EnableUNICODE(0);
204 if(key->unicode >= 32 && key->unicode <= 126) {
205 name[n++] = key->unicode;