putt/hole.c

   1 /*
   2  * Copyright (C) 2003 Robert Kooima
   3  *
   4  * NEVERPUTT is  free software; you can redistribute  it and/or modify
   5  * it under the  terms of the GNU General  Public License as published
   6  * by the Free  Software Foundation; either version 2  of the License,
   7  * or (at your option) any later version.
   8  *
   9  * This program is distributed in the hope that it will be useful, but
  10  * WITHOUT  ANY  WARRANTY;  without   even  the  implied  warranty  of
  11  * MERCHANTABILITY or  FITNESS FOR A PARTICULAR PURPOSE.   See the GNU
  12  * General Public License for more details.
  13  */
  14
  15 #include <stdio.h>
  16 #include <string.h>
  17 #include <math.h>
  18
  19 #include "hole.h"
  20 #include "glext.h"
  21 #include "image.h"
  22 #include "game.h"
  23 #include "geom.h"
  24 #include "hud.h"
  25 #include "audio.h"
  26 #include "config.h"
  27 #include "fs.h"
  28
  29 /*---------------------------------------------------------------------------*/
  30
  31 struct hole
  32 {
  33     char   file[MAXSTR];
  34     char   back[MAXSTR];
  35     char   song[MAXSTR];
  36     int    par;
  37 };
  38
  39 static int hole;
  40 static int party;
  41 static int player;
  42 static int count;
  43 static int done;
  44
  45 static int         stat_v[MAXPLY];
  46 static float       ball_p[MAXPLY][3];
  47 static float       ball_e[MAXPLY][3][3];
  48 static struct hole hole_v[MAXHOL];
  49 static int        score_v[MAXHOL][MAXPLY];
  50
  51 /*---------------------------------------------------------------------------*/
  52
  53 static void hole_init_rc(const char *filename)
  54 {
  55     fs_file fin;
  56     char buff[MAXSTR];
  57
  58     hole   = 0;
  59     player = 0;
  60     count  = 0;
  61     done   = 0;
  62
  63     /* Load the holes list. */
  64
  65     if ((fin = fs_open(filename, "r")))
  66     {
  67         /* Skip shot and description. */
  68
  69         if (fs_gets(buff, sizeof (buff), fin) &&
  70             fs_gets(buff, sizeof (buff), fin))
  71         {
  72             /* Read the list. */
  73
  74             while (fs_gets(buff, sizeof (buff), fin) &&
  75                    sscanf(buff, "%s %s %d %s",
  76                           hole_v[count].file,
  77                           hole_v[count].back,
  78                           &hole_v[count].par,
  79                           hole_v[count].song) >= 1)
  80                 count++;
  81         }
  82
  83         fs_close(fin);
  84     }
  85 }
  86
  87 /*---------------------------------------------------------------------------*/
  88
  89 int hole_load(int h, const char *filename)
  90 {
  91     struct s_base base;
  92
  93     if (filename != hole_v[h].file)
  94     {
  95         /* Note filename if it came from elsewhere. */
  96
  97         SAFECPY(hole_v[h].file, filename);
  98     }
  99
 100     if (sol_load_meta(&base, filename))
 101     {
 102         int i;
 103
 104         for (i = 0; i < base.dc; i++)
 105         {
 106             const char *k = base.av + base.dv[i].ai;
 107             const char *v = base.av + base.dv[i].aj;
 108
 109             if      (strcmp("grad", k) == 0)
 110                 SAFECPY(hole_v[h].back, v);
 111             else if (strcmp("par", k) == 0)
 112                 hole_v[h].par = atoi(v);
 113             else if (strcmp("song", k) == 0)
 114                 SAFECPY(hole_v[h].song, v);
 115         }
 116
 117         score_v[h][0] = hole_v[h].par;
 118
 119         sol_free_base(&base);
 120         return 1;
 121     }
 122     return 0;
 123 }
 124
 125 void hole_init(const char *filename)
 126 {
 127     int i;
 128
 129     memset(hole_v,  0, sizeof (struct hole) * MAXHOL);
 130     memset(score_v, 0, sizeof (int) * MAXPLY * MAXHOL);
 131
 132     if (filename)
 133     {
 134         hole_init_rc(filename);
 135
 136         for (i = 0; i < count; i++)
 137             hole_load(i, hole_v[i].file);
 138     }
 139     else
 140     {
 141         /* Standalone mode.                       */
 142         /* Why is this 2, you ask? Good question. */
 143
 144         count = 2;
 145     }
 146 }
 147
 148 void hole_free(void)
 149 {
 150     game_free();
 151     back_free();
 152
 153     count = 0;
 154 }
 155
 156 /*---------------------------------------------------------------------------*/
 157
 158 char *hole_player(int p)
 159 {
 160     if (p == 0)               return _("Par");
 161
 162     if (p == 1 && 1 <= party) return _("P1");
 163     if (p == 2 && 2 <= party) return _("P2");
 164     if (p == 3 && 3 <= party) return _("P3");
 165     if (p == 4 && 4 <= party) return _("P4");
 166
 167     return NULL;
 168 }
 169
 170 char *hole_score(int h, int p)
 171 {
 172     static char str[MAXSTR];
 173
 174     if (1 <= h && h <= hole)
 175     {
 176         if (h <= hole && 0 <= p && p <= party)
 177         {
 178             sprintf(str, "%d", score_v[h][p]);
 179             return str;
 180         }
 181     }
 182     return NULL;
 183 }
 184
 185 char *hole_tot(int p)
 186 {
 187     static char str[MAXSTR];
 188
 189     int h, T = 0;
 190
 191     if (p <= party)
 192     {
 193         for (h = 1; h <= hole && h < count; h++)
 194             T += score_v[h][p];
 195
 196         sprintf(str, "%d", T);
 197
 198         return str;
 199     }
 200     return NULL;
 201 }
 202
 203 char *hole_out(int p)
 204 {
 205     static char str[MAXSTR];
 206
 207     int h, T = 0;
 208
 209     if (p <= party)
 210     {
 211         for (h = 1; h <= hole && h <= count / 2; h++)
 212             T += score_v[h][p];
 213
 214         sprintf(str, "%d", T);
 215
 216         return str;
 217     }
 218     return NULL;
 219 }
 220
 221 char *hole_in(int p)
 222 {
 223     static char str[MAXSTR];
 224
 225     int h, T = 0;
 226     int out = count / 2;
 227
 228     if (hole > out && p <= party)
 229     {
 230         for (h = out + 1; h <= hole && h < count; h++)
 231             T += score_v[h][p];
 232
 233         sprintf(str, "%d", T);
 234
 235         return str;
 236     }
 237     return NULL;
 238 }
 239
 240 /*---------------------------------------------------------------------------*/
 241
 242 int curr_hole(void)   { return hole;   }
 243 int curr_party(void)  { return party;  }
 244 int curr_player(void) { return player; }
 245 int curr_count(void)  { return count;  }
 246
 247 const char *curr_scr(void)
 248 {
 249     static char buf[8];
 250
 251     sprintf(buf, "%d", score_v[hole][player]);
 252
 253     return buf;
 254 }
 255
 256 const char *curr_par(void)
 257 {
 258     static char buf[8];
 259
 260     sprintf(buf, "%d", score_v[hole][0]);
 261
 262     return buf;
 263 }
 264
 265 /*---------------------------------------------------------------------------*/
 266
 267 int hole_goto(int h, int p)
 268 {
 269     int i;
 270
 271     if (h < count)
 272     {
 273         if (h >= 0) hole  = h;
 274         if (p >= 0) party = p;
 275
 276         if (game_init(hole_v[hole].file))
 277         {
 278             back_init(hole_v[hole].back);
 279
 280             player = (hole - 1) % party + 1;
 281             done   = 0;
 282
 283             for (i = 1; i <= party; i++)
 284             {
 285                 game_get_pos(ball_p[i], ball_e[i]);
 286                 stat_v[i] = 0;
 287             }
 288             game_ball(player);
 289             hole_song();
 290             return 1;
 291         }
 292     }
 293     return 0;
 294 }
 295
 296 int hole_next(void)
 297 {
 298     if (done < party)
 299     {
 300         do
 301         {
 302             player = player % party + 1;
 303         }
 304         while (stat_v[player]);
 305
 306         game_ball(player);
 307         game_get_pos(ball_p[player], ball_e[player]);
 308
 309         return 1;
 310     }
 311     return 0;
 312 }
 313
 314 int hole_move(void)
 315 {
 316     if (hole + 1 < count)
 317     {
 318         hole++;
 319
 320         game_free();
 321         back_free();
 322
 323         if (hole_goto(hole, party))
 324             return 1;
 325     }
 326     return 0;
 327 }
 328
 329 void hole_goal(void)
 330 {
 331     score_v[hole][player]++;
 332
 333     if (score_v[hole][player] == 1)
 334         audio_play(AUD_ONE, 1.0f);
 335
 336     else if (score_v[hole][player] == score_v[hole][0] - 2)
 337         audio_play(AUD_EAGLE, 1.0f);
 338     else if (score_v[hole][player] == score_v[hole][0] - 1)
 339         audio_play(AUD_BIRDIE, 1.0f);
 340     else if (score_v[hole][player] == score_v[hole][0])
 341         audio_play(AUD_PAR, 1.0f);
 342     else if (score_v[hole][player] == score_v[hole][0] + 1)
 343         audio_play(AUD_BOGEY, 1.0f);
 344     else if (score_v[hole][player] == score_v[hole][0] + 2)
 345         audio_play(AUD_DOUBLE, 1.0f);
 346     else
 347         audio_play(AUD_SUCCESS, 1.0f);
 348
 349     stat_v[player] = 1;
 350     done++;
 351
 352     if (done == party)
 353         audio_music_fade_out(2.0f);
 354 }
 355
 356 void hole_stop(void)
 357 {
 358     score_v[hole][player]++;
 359
 360     /* Cap scores at 12 or par plus 3. */
 361
 362     if (score_v[hole][player] >= 12 &&
 363         score_v[hole][player] >= score_v[hole][0] + 3)
 364     {
 365         score_v[hole][player] = (score_v[hole][0] > 12 - 3) ? score_v[hole][0] + 3 : 12;
 366         stat_v[player] = 1;
 367         done++;
 368     }
 369 }
 370
 371 void hole_fall(void)
 372 {
 373     audio_play(AUD_PENALTY, 1.0f);
 374
 375     /* Reset to the position of the putt, and apply a one-stroke penalty. */
 376
 377     game_set_pos(ball_p[player], ball_e[player]);
 378     score_v[hole][player] += 2;
 379
 380     /* Cap scores at 12 or par plus 3. */
 381
 382     if (score_v[hole][player] >= 12 &&
 383         score_v[hole][player] >= score_v[hole][0] + 3)
 384     {
 385         score_v[hole][player] = (score_v[hole][0] > 12 - 3) ? score_v[hole][0] + 3 : 12;
 386         stat_v[player] = 1;
 387         done++;
 388     }
 389 }
 390
 391 /*---------------------------------------------------------------------------*/
 392
 393 void hole_song(void)
 394 {
 395     audio_music_fade_to(0.5f, hole_v[hole].song);
 396 }