score.c

   1 /* Variations on RockDodger
   2  * Copyright (C) 2004 Joshua Grams <josh@qualdan.com>
   3  *
   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.
   8  *
   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.
  13  *
  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
  17  */
  18
  19 #include <SDL.h>
  20 #include <SDL_keysym.h>
  21 #include <stdio.h>
  22 #include <stdlib.h>
  23 #include <string.h>
  24
  25 #include "font.h"
  26
  27 #include "common.h"
  28 #include "config.h"
  29 #include "file.h"
  30 #include "globals.h"
  31 #include "score.h"
  32
  33 // High score table
  34 struct highscore g_scores[2][N_SCORES] = {
  35         {
  36                 {1*60*1000,"-"},
  37                 {45*1000,"-"},
  38                 {30*1000,"-"},
  39                 {20*1000,"-"},
  40                 {10*1000,"-"},
  41                 {7*1000,"-"},
  42                 {5*1000,"-"},
  43                 {3*1000,"-"}
  44         },
  45         {
  46                 {1*60*1000,"-"},
  47                 {45*1000,"-"},
  48                 {30*1000,"-"},
  49                 {20*1000,"-"},
  50                 {10*1000,"-"},
  51                 {7*1000,"-"},
  52                 {5*1000,"-"},
  53                 {3*1000,"-"}
  54         }
  55 };
  56
  57 static char *titles[2] = { "Normal\n", "Easy\n" };
  58
  59 int g_easy = 0;
  60 int cur_score = -1; // which score we're currently entering.
  61
  62 void
  63 read_high_score_table()
  64 {
  65         FILE *f;
  66         int i, j;
  67
  68         f = open_score_file("r");
  69         if(f) {
  70                 // If the file exists, read from it
  71                 for(j=0; j<2; j++) {
  72                         fscanf(f, titles[j]);
  73                         for(i = 0; i<N_SCORES; i++) {
  74                                 fscanf(f, "%d %31[^\n]\n", &g_scores[j][i].score, g_scores[j][i].name);
  75                         }
  76                 }
  77                 fclose(f);
  78         }
  79 }
  80
  81 void
  82 write_high_score_table()
  83 {
  84         FILE *f;
  85         int i, j;
  86
  87         f = open_score_file("w");
  88         if(f) {
  89                 // If the file exists, write to it
  90                 for(j=0; j<2; j++) {
  91                         fprintf(f, titles[j]);
  92                         for(i = 0; i<N_SCORES; i++) {
  93                                 fprintf (f, "%d %.31s\n", g_scores[j][i].score, g_scores[j][i].name);
  94                         }
  95                 }
  96                 fclose(f);
  97         }
  98 }
  99
 100 int
 101 score_rank(int score)
 102 {
 103         int i;
 104
 105         for(i=0; i<N_SCORES; i++) {
 106                 if(score > g_scores[g_easy][i].score) return i;
 107         }
 108         return -1;
 109 }
 110
 111 int
 112 new_high_score(int score)
 113 {
 114         cur_score = -1;  // assume not a new high score
 115         if(score <= g_scores[g_easy][LOW_SCORE].score) return false;
 116         read_high_score_table();
 117         cur_score = score_rank(score);
 118         return cur_score >= 0;
 119 }
 120
 121 int
 122 insert_score(int score)
 123 {
 124         int i;
 125
 126         // Move all lower scores down a notch, losing lowest score forever.
 127         if(strcmp(g_scores[g_easy][cur_score].name, "-") != 0)
 128                 for(i=LOW_SCORE; i>cur_score; i--)
 129                         g_scores[g_easy][i] = g_scores[g_easy][i-1];
 130
 131         // initialize new score entry.
 132         g_scores[g_easy][cur_score].score = score;
 133         for(i=0; i<32; i++) g_scores[g_easy][cur_score].name[i] = 0;
 134         return true;
 135 }
 136
 137 int
 138 snprintscore(char *s, size_t n, int score)
 139 {
 140         int min = score/60000;
 141         int sec = score/1000%60;
 142         int tenths = score%1000/100;
 143         if(min) {
 144                 return snprintf(s, n, "%2d:%.2d.%d", min, sec, tenths);
 145         } else {
 146                 return snprintf(s, n, "%2d.%d", sec, tenths);
 147         }
 148 }
 149
 150 void
 151 show_score(void)
 152 {
 153         char s[16];
 154         int r = snprintf(s, 16, "Time: ");
 155         snprintscore(s+r, 16-r, score);
 156         font_write(XSIZE-250, 0, s);
 157 }
 158
 159 void
 160 display_scores(SDL_Surface *s, uint32_t x, uint32_t y)
 161 {
 162         char t[1024];
 163         int i,h = font_height();
 164
 165         font_write(x+30, y, "High scores");
 166         y += h;
 167         if(g_easy) font_write(x+75,y,"(easy)");
 168         else font_write(x+60,y,"(normal)");
 169         for(i = 0; i<N_SCORES; i++) {
 170                 y += h;
 171                 snprintf(t, 1024, "#%1d",i+1);
 172                 font_write(x, y, t);
 173                 snprintscore(t, 1024, g_scores[g_easy][i].score);
 174                 font_write(x+50, y, t);
 175                 if(i == cur_score) snprintf(t, 1024, "%s_", g_scores[g_easy][i].name);
 176                 else snprintf(t, 1024, "%s", g_scores[g_easy][i].name);
 177                 font_write(x+180, y, t);
 178         }
 179 }
 180
 181 int
 182 process_score_input(SDL_keysym *key)
 183 {
 184         char *name;
 185         int n;
 186
 187         name = g_scores[g_easy][cur_score].name;
 188         n = strlen(name);
 189
 190         if(key->sym == SDLK_BACKSPACE) {
 191                 if(n > 0) name[--n]=0;
 192         } else {
 193                 if(key->sym == SDLK_RETURN) {
 194                         SDL_EnableUNICODE(0);
 195                         cur_score = -1;
 196                         if(n == 0) {
 197                                 name[0] = '-';
 198                         }
 199                         return false;
 200                 } else if(n < 12) {
 201                         if(key->unicode >= 32 && key->unicode <= 126) {
 202                                 name[n++] = key->unicode;
 203                         }
 204                 } // else drop it
 205         }
 206         return true;
 207 }