diff options
Diffstat (limited to 'src')
-rw-r--r-- | src/Makefile.am | 2 | ||||
-rw-r--r-- | src/aabb.h | 38 | ||||
-rw-r--r-- | src/credits.c | 120 | ||||
-rw-r--r-- | src/credits.h | 26 | ||||
-rw-r--r-- | src/game.c | 361 | ||||
-rw-r--r-- | src/game.h | 26 | ||||
-rw-r--r-- | src/intro.c | 128 | ||||
-rw-r--r-- | src/intro.h | 26 | ||||
-rw-r--r-- | src/list.h | 252 | ||||
-rw-r--r-- | src/macros.h | 37 | ||||
-rw-r--r-- | src/splash-node.c | 115 | ||||
-rw-r--r-- | src/stage.c | 448 | ||||
-rw-r--r-- | src/stage.h | 57 | ||||
-rw-r--r-- | src/svg-node.c | 88 | ||||
-rw-r--r-- | src/svg-node.h | 28 | ||||
-rw-r--r-- | src/v2f.h | 71 | ||||
-rw-r--r-- | src/whale-svg.c | 171 | ||||
-rw-r--r-- | src/whale-svg.h | 29 | ||||
-rw-r--r-- | src/whale.c | 239 | ||||
-rw-r--r-- | src/whale.h | 46 |
20 files changed, 2308 insertions, 0 deletions
diff --git a/src/Makefile.am b/src/Makefile.am new file mode 100644 index 0000000..7586076 --- /dev/null +++ b/src/Makefile.am @@ -0,0 +1,2 @@ +bin_PROGRAMS = whale +whale_SOURCES = aabb.h credits.c credits.h list.h whale.c whale.h whale-svg.c whale-svg.h game.c game.h intro.c intro.h macros.h stage.c stage.h svg-node.c svg-node.h v2f.h diff --git a/src/aabb.h b/src/aabb.h new file mode 100644 index 0000000..b284022 --- /dev/null +++ b/src/aabb.h @@ -0,0 +1,38 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _AABB_H +#define _AABB_H + +#include "v2f.h" + +typedef struct aabb_t { + v2f_t min, max; +} aabb_t; + + +/* linearly interpolate between a and b by t */ +static inline aabb_t aabb_lerp(const aabb_t *a, const aabb_t *b, float t) +{ + aabb_t aabb; + + aabb.min = v2f_lerp(&a->min, &b->min, t); + aabb.max = v2f_lerp(&a->max, &b->max, t); + + return aabb; +} + +#endif diff --git a/src/credits.c b/src/credits.c new file mode 100644 index 0000000..c171d84 --- /dev/null +++ b/src/credits.c @@ -0,0 +1,120 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <assert.h> +#include <SDL.h> +#include <SDL_mixer.h> +#include <math.h> + +#include "aabb.h" +#include "macros.h" +#include "whale.h" +#include "stage.h" +#include "svg-node.h" + +/* the opening credits */ + +void whale_credits_event(whale_t *whale, SDL_Event *ev) +{ + /* no events handled in credits, their brief */ +} + +typedef enum credits_fsm_t { + CREDITS_FSM_FADEOUT, + CREDITS_FSM_FADEIN, + CREDITS_FSM_PLANETS_FADEOUT, + CREDITS_FSM_CREDITS_FADEOUT, +} credits_fsm_t; + +void whale_credits_update(whale_t *whale) +{ + static stage_node_t *bobby, *crater, *planets, *credits; + static unsigned initialized; + static credits_fsm_t state; + Uint32 now = whale_ticks(whale, WHALE_TICKS_TIMER); + stage_t *stage = whale_get_stage(whale); + + if (!initialized) { + whale_ticks_reset(whale, WHALE_TICKS_TIMER); /* get ticks approximately aligned with credits start */ + + bobby = stage_node_lookup_name(stage, "bobby"); + fatal_if(!bobby, "Unable to lookup whale node"); + + crater = stage_node_lookup_name(stage, "crater"); + fatal_if(!crater, "Unable to lookup crater node"); + + planets = stage_node_lookup_name(stage, "planets"); + fatal_if(!crater, "Unable to lookup planets node"); + + credits = svg_node_new_file(stage, "credits", "assets/credits.svg", 0, (aabb_t){{-.8f, -.8f}, {.8f, .8f}}); + fatal_if(!credits, "Unable to load credits svg"); + + now = whale_ticks(whale, WHALE_TICKS_TIMER); + + initialized = 1; + } + + + switch (state) { + case CREDITS_FSM_FADEOUT: + if (now < 2000) { + float t = 1.0f - ((float)now) * (1.0f / 2000.0f); + + stage_node_set_alpha(stage, bobby, t); + stage_node_set_alpha(stage, crater, t); + } else { + stage_node_free(stage, bobby); + stage_node_free(stage, crater); + stage_node_set_active(stage, credits); + state++; + } + break; + + case CREDITS_FSM_FADEIN: + if (now < 4000) { + stage_node_set_alpha(stage, planets, 1.0f - ((float)(now - 2000)) * (1.0f / 15000.0f)); + stage_node_set_alpha(stage, credits, ((float)(now - 2000)) * (1.0f / 2000.0f)); + } else { + stage_node_set_alpha(stage, credits, 1.0f); + state++; + } + break; + + case CREDITS_FSM_PLANETS_FADEOUT: + if (now < 17000) { + stage_node_set_alpha(stage, planets, 1.0f - ((float)(now - 2000)) * (1.0f / 15000.0f)); + } else { + stage_node_free(stage, planets); + state++; + } + break; + + case CREDITS_FSM_CREDITS_FADEOUT: + if (now < 20000) { + stage_node_set_alpha(stage, credits, 1.0f - ((float)(now - 17000)) * (1.0f / 3000.0f)); + } else { + stage_node_free(stage, credits); + exit(0); + } + break; + + default: + assert(0); + } + + if (!Mix_PlayingMusic() || now > 20000) + exit(0); +} diff --git a/src/credits.h b/src/credits.h new file mode 100644 index 0000000..08f1327 --- /dev/null +++ b/src/credits.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _CREDITS_H +#define _CREDITS_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_credits_event(whale_t *whale, SDL_Event *event); +void whale_credits_update(whale_t *whale); + +#endif diff --git a/src/game.c b/src/game.c new file mode 100644 index 0000000..41f9b1c --- /dev/null +++ b/src/game.c @@ -0,0 +1,361 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <SDL.h> +#include <SDL_mixer.h> +#include <stdarg.h> /* vsnprintf */ + +#include "aabb.h" +#include "whale.h" +#include "whale-svg.h" +#include "macros.h" +#include "stage.h" +#include "svg-node.h" + +/* the game */ + +typedef enum whale_game_fsm_t { + WHALE_GAME_SETTING_UP, + WHALE_GAME_STARTING, + WHALE_GAME_TARGETING, + WHALE_GAME_LAUNCHING, + WHALE_GAME_FLYING, + WHALE_GAME_INSIDE, + WHALE_GAME_OUTSIDE, + WHALE_GAME_LEAVE +} whale_game_fsm_t; + +static Mix_Chunk *launch_sfx, *crash_sfx, *winner_sfx; +static stage_node_t *bobby, *crater, *astro, *planets; +static unsigned bobby_armed; +static whale_game_fsm_t state; + +void whale_game_event(whale_t *whale, SDL_Event *ev) +{ + stage_t *stage = whale_get_stage(whale); + + switch (ev->type) { + case SDL_KEYDOWN: + switch (ev->key.keysym.sym) { + case SDLK_ESCAPE: + state = WHALE_GAME_LEAVE; + break; + + case SDLK_SPACE: + if (state == WHALE_GAME_INSIDE || state == WHALE_GAME_OUTSIDE) { + /* resetup game */ + state = WHALE_GAME_SETTING_UP; + } + + default: + break; + } + + break; + + case SDL_MOUSEBUTTONDOWN: + if (state == WHALE_GAME_TARGETING) { + if (!bobby_armed) + bobby_armed = whale_ticks(whale, WHALE_TICKS_TIMER); + } else if (state == WHALE_GAME_INSIDE || state == WHALE_GAME_OUTSIDE) { + /* resetup game */ + state = WHALE_GAME_SETTING_UP; + } + break; + + case SDL_MOUSEBUTTONUP: + if (state == WHALE_GAME_TARGETING) { + if (bobby_armed) { + /* launch bobby */ + Mix_PlayChannel(-1, launch_sfx, 0); + state = WHALE_GAME_LAUNCHING; + } + } + break; + + case SDL_MOUSEMOTION: + if (state == WHALE_GAME_TARGETING) { + /* convert the mouse X, Y coordinates into an angle, it's + * trivial since the whale is always in the bottom left + */ + int width, height; + double angle; + v2f_t v; + + stage_get_output_size(stage, &width, &height); + + v.x = (float)ev->motion.x; + v.y = (float)height - ev->motion.y; + + v = v2f_normalize(&v); + angle = -atan2f(v.y, v.x) * 57.4712f /* rad2deg */; + + stage_node_set_angle(stage, bobby, angle); + } + break; + + default: + break; + } +} + +#if 0 +stage_node_t * text_node(stage_t *stage, stage_node_t *node, const char *name, int layer, aabb_t aabb, int width, int height, int x, int y, const char *anchor, int font_size, const char *fmt, ...) +{ + char buf[2048]; + char str[1024]; + va_list ap; + + va_start(ap, fmt); + vsnprintf(str, sizeof(str), fmt, ap); + va_end(ap); + + snprintf(buf, sizeof(buf), + "<svg width=\"%i\" height=\"%i\"><g><text x=\"%i\" y=\"%i\" style=\"font-size:%i\" text-anchor=\"%s\">%s</text></g></svg>", + width, height, x, y, font_size, anchor, str); + if (!node) { + node = svg_node_new_buffer(stage, name, buf, strlen(buf), layer, aabb); + fatal_if(!node, "Unable to create quesiton svg \"%s\"", name); + } else { + svg_node_replace_buffer(stage, node, name, buf, strlen(buf)); + } + + return node; +} +#endif + + +stage_node_t * meter_node(stage_t *stage, const aabb_t aabb, float level) +{ + /* TODO: power meter */ +} + + +void whale_game_update(whale_t *whale) +{ + static const aabb_t bobby_end_aabb = {{-1.f, -1.f}, {-.8f, -.8f}}; + static aabb_t crater_end_aabb = {{0.f, -1.f}, {0.f, -.7f}}; + static aabb_t bobby_start_aabb, crater_start_aabb; + static int bobby_keyboard_armed, prev; + static whale_svg_t *bobby_svg, *dead_svg; + static int initialized; + static v2f_t bobby_vector; + stage_t *stage = whale_get_stage(whale); + unsigned now = whale_ticks(whale, WHALE_TICKS_TIMER); + + if (!initialized) { + bobby = stage_node_lookup_name(stage, "bobby"); + fatal_if(!bobby, "Unable to lookup whale node"); + stage_node_get_object(stage, bobby, (void **)&bobby_svg); /* XXX FIXME: NOO */ + + dead_svg = whale_svg_new_file("assets/dead.svg"); + fatal_if(!dead_svg, "Unable to load dead bobby svg"); + + crater = stage_node_lookup_name(stage, "crater"); + fatal_if(!crater, "Unable to lookup crater node"); + + astro = stage_node_lookup_name(stage, "astro"); + fatal_if(!astro, "Unable to lookup astro node"); + + planets = svg_node_new_file(stage, "planets", "assets/planets.svg", 0, (aabb_t){{-1.f, -.7f}, {1.f, 1.f}}); + fatal_if(!planets, "Unable to load planets svg"); + stage_node_set_active(stage, planets); + + stage_node_set_alpha(stage, bobby, 1.0f); + stage_node_set_alpha(stage, crater, 1.0f); + + winner_sfx = Mix_LoadWAV("assets/winner.wav"); + fatal_if(!winner_sfx, "Unable to load winner sfx"); + + launch_sfx = Mix_LoadWAV("assets/launch.wav"); + fatal_if(!launch_sfx, "Unable to load launch sfx"); + + crash_sfx = Mix_LoadWAV("assets/crash.wav"); + fatal_if(!crash_sfx, "Unable to load crash sfx"); + + initialized = 1; + } + + switch (state) { + case WHALE_GAME_SETTING_UP: { + float crater_x; + + stage_node_set_angle(stage, bobby, 0); + stage_node_get_aabb(stage, bobby, &bobby_start_aabb); + stage_node_get_aabb(stage, crater, &crater_start_aabb); + stage_node_set_object(stage, bobby, bobby_svg); + + /* place crater destination randomly along the bottom */ + crater_x = ((float)rand()) / RAND_MAX * .6f; + crater_end_aabb.min.x = crater_x - .2f; + crater_end_aabb.max.x = crater_x + .2f; + + bobby_keyboard_armed = bobby_armed = 0; + whale_ticks_reset(whale, WHALE_TICKS_TIMER); + prev = now = whale_ticks(whale, WHALE_TICKS_TIMER); + state++; + break; + } + + case WHALE_GAME_STARTING: + if (now < 500) { + float t = ((float)now) * (1.0f / 500.0f); + aabb_t aabb; + + t *= t; + + aabb = aabb_lerp(&bobby_start_aabb, &bobby_end_aabb, t); + stage_node_set_aabb(stage, bobby, &aabb); + + aabb = aabb_lerp(&crater_start_aabb, &crater_end_aabb, t); + stage_node_set_aabb(stage, crater, &aabb); + + if (astro) { /* XXX this is ugly; astro is serving as a "first start" flag */ + stage_node_set_alpha(stage, astro, 1.f - t); + stage_node_set_alpha(stage, planets, t); + } + } else { + stage_node_set_aabb(stage, bobby, &bobby_end_aabb); + stage_node_set_aabb(stage, crater, &crater_end_aabb); + + if (astro) { + astro = stage_node_free(stage, astro); + stage_node_set_alpha(stage, planets, 1.f); /* XXX: see above comment about astro abuse */ + } + + state++; + } + break; + + case WHALE_GAME_TARGETING: { + const Uint8 *key_state = SDL_GetKeyboardState(NULL); + float t = ((float)(now - prev)) * .05f; /* scale simulation things according to time passed */ + + if (key_state[SDL_SCANCODE_LEFT] || key_state[SDL_SCANCODE_A]) { + double angle; + + stage_node_get_angle(stage, bobby, &angle); + angle += -3.f * t; + stage_node_set_angle(stage, bobby, angle); + } + + if (key_state[SDL_SCANCODE_RIGHT] || key_state[SDL_SCANCODE_D]) { + double angle; + + stage_node_get_angle(stage, bobby, &angle); + angle += 3.f * t; + stage_node_set_angle(stage, bobby, angle); + } + + if (key_state[SDL_SCANCODE_SPACE]) { + /* arm bobby */ + if (!bobby_keyboard_armed) { + bobby_keyboard_armed = 1; + bobby_armed = now; + } + } else if (bobby_keyboard_armed) { + /* launch bobby */ + Mix_PlayChannel(-1, launch_sfx, 0); + state = WHALE_GAME_LAUNCHING; + } + break; + } + + case WHALE_GAME_LAUNCHING: { + double angle; + double power = (now - bobby_armed) * (1.0f / 5000); + + /* convert angle and power into a vector */ + stage_node_get_angle(stage, bobby, &angle); + angle *= -(M_PI / 180.f); /* to radians */ + bobby_vector.x = cos(angle) * power; + bobby_vector.y = sin(angle) * power; + + state++; + break; + } + + case WHALE_GAME_FLYING: { + float t = ((float)(now - prev)) * .05f; /* scale simulation things according to time passed */ + double angle; + v2f_t move; + aabb_t aabb; + + move = v2f_mult_scalar(&bobby_vector, t); + + /* spin the bobby while he's flying */ + stage_node_get_angle(stage, bobby, &angle); + angle += 4.0f * t; + stage_node_set_angle(stage, bobby, angle); + + /* move him on his trajectory */ + /* XXX: this is pretty silly, but it's the interfaces I have at the moment */ + stage_node_get_aabb(stage, bobby, &aabb); + aabb.min = v2f_add(&aabb.min, &move); + aabb.max = v2f_add(&aabb.max, &move); + stage_node_set_aabb(stage, bobby, &aabb); + + /* check if we're inside the crater (crater aabb is .4f wide) */ + /* FIXME: I should really add some generic aabb overlap test type stuff to aabb.h */ + /* FIXME XXX: yes I know the collision detection is janky/ad-hoc, there was no time! */ + if (aabb.min.x > (crater_end_aabb.min.x + .08f) && + aabb.max.x < (crater_end_aabb.max.x - .08f) && + aabb.min.y < (crater_end_aabb.max.y - .06f)) { + + state = WHALE_GAME_INSIDE; + Mix_PlayChannel(-1, winner_sfx, 0); + + } else if (aabb.min.y < -1.f) { /* or if we're in the ground */ + + state = WHALE_GAME_OUTSIDE; + Mix_PlayChannel(-1, crash_sfx, 0); + stage_node_set_object(stage, bobby, dead_svg); + } + + /* alter trajectory w/gravity */ + bobby_vector.y += -.01f * t; + break; + } + + case WHALE_GAME_INSIDE: { + aabb_t aabb; + + /* bobby simming inside crater lake */ + aabb.min.x = crater_end_aabb.min.x + .1f; + aabb.max.x = crater_end_aabb.max.x - .1f; + aabb.min.y = crater_end_aabb.max.y - .2f; + aabb.max.y = crater_end_aabb.max.y; + stage_node_set_aabb(stage, bobby, &aabb); + + stage_node_set_angle(stage, bobby, cos((double)now * .001) * 10.0); + + break; + } + + case WHALE_GAME_OUTSIDE: + break; + + case WHALE_GAME_LEAVE: + whale_set_context(whale, WHALE_CONTEXT_CREDITS); + break; + } + + /* last 20 seconds of song are credits */ + if (whale_ticks(whale, WHALE_TICKS_MUSIC) > 206000) + whale_set_context(whale, WHALE_CONTEXT_CREDITS); + + prev = now; +} diff --git a/src/game.h b/src/game.h new file mode 100644 index 0000000..7587182 --- /dev/null +++ b/src/game.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _GAME_H +#define _GAME_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_game_event(whale_t *whale, SDL_Event *event); +void whale_game_update(whale_t *whale); + +#endif diff --git a/src/intro.c b/src/intro.c new file mode 100644 index 0000000..7dc8476 --- /dev/null +++ b/src/intro.c @@ -0,0 +1,128 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <assert.h> +#include <SDL.h> +#include <SDL_mixer.h> +#include <math.h> + +#include "aabb.h" +//#include "filler-node.h" +#include "macros.h" +#include "whale.h" +#include "stage.h" +#include "svg-node.h" + +/* the opening intro */ + +void whale_intro_event(whale_t *whale, SDL_Event *ev) +{ + switch (ev->type) { + case SDL_KEYDOWN: + case SDL_MOUSEBUTTONDOWN: + /* skip intro sequence */ + whale_set_context(whale, WHALE_CONTEXT_GAME); + break; + + default: + break; + } +} + +typedef enum intro_fsm_t { + INTRO_FSM_BLACK, + INTRO_FSM_WHALE, + INTRO_FSM_ASTRO, + INTRO_FSM_CRATER, + INTRO_FSM_LEAVE, +} intro_fsm_t; + +void whale_intro_update(whale_t *whale) +{ + static stage_node_t *bobby, *astro, *crater; + static unsigned initialized; + static intro_fsm_t state; + Uint32 now = whale_ticks(whale, WHALE_TICKS_TIMER); + stage_t *stage = whale_get_stage(whale); + + if (!initialized) { + whale_set_music(whale, "assets/music.ogg", 0); + whale_ticks_reset(whale, WHALE_TICKS_MUSIC); /* get ticks approximately aligned with music start */ + whale_ticks_reset(whale, WHALE_TICKS_TIMER); /* TODO: there should be a "reset all" or something */ + + bobby = svg_node_new_file(stage, "bobby", "assets/whale.svg", 2, (aabb_t){{-1.f, -.2f},{-.4f, .2f}}); + fatal_if(!bobby, "Unable to load whale svg"); + + astro = svg_node_new_file(stage, "astro", "assets/astro.svg", 2, (aabb_t){{-.3f, -.2f},{.3f, .2f}}); + fatal_if(!astro, "Unable to load astro svg"); + + crater = svg_node_new_file(stage, "crater", "assets/crater.svg", 3, (aabb_t){{.4f, -.2f},{1.f, .2f}}); + fatal_if(!crater, "Unable to load crater svg"); + + stage_node_set_locked(stage, bobby); + stage_node_set_locked(stage, crater); + + stage_node_set_active(stage, bobby); + stage_node_set_active(stage, astro); + stage_node_set_active(stage, crater); + + now = whale_ticks(whale, WHALE_TICKS_TIMER); + + initialized = 1; + } + + + switch (state) { + case INTRO_FSM_BLACK: + if (now > 500) /* brief delay for things to settle for the viewer */ + state++; + break; + + case INTRO_FSM_WHALE: + if (now < 2000) { + stage_node_set_alpha(stage, bobby, ((float)(now - 500)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, bobby, 1.0f); + state++; + } + break; + + case INTRO_FSM_ASTRO: + if (now < 3500) { + stage_node_set_alpha(stage, astro, ((float)(now - 2000)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, astro, 1.0f); + state++; + } + break; + + case INTRO_FSM_CRATER: + if (now < 5000) { + stage_node_set_alpha(stage, crater, ((float)(now - 3500)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, crater, 1.0f); + state++; + } + break; + + case INTRO_FSM_LEAVE: + whale_set_context(whale, WHALE_CONTEXT_GAME); + break; + + default: + assert(0); + } +} diff --git a/src/intro.h b/src/intro.h new file mode 100644 index 0000000..004d514 --- /dev/null +++ b/src/intro.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _INTRO_H +#define _INTRO_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_intro_event(whale_t *whale, SDL_Event *event); +void whale_intro_update(whale_t *whale); + +#endif diff --git a/src/list.h b/src/list.h new file mode 100644 index 0000000..48bca36 --- /dev/null +++ b/src/list.h @@ -0,0 +1,252 @@ +#ifndef __LIST_H +#define __LIST_H + +/* linux kernel linked list interface */ + +/* + * Simple doubly linked list implementation. + * + * Some of the internal functions ("__xxx") are useful when + * manipulating whole lists rather than single entries, as + * sometimes we already know the next/prev entries and we can + * generate better code by using them directly rather than + * using the generic single-entry routines. + */ + +typedef struct list_head { + struct list_head *next, *prev; +} list_head_t; + +#define LIST_HEAD_INIT(name) { &(name), &(name) } + +#define LIST_HEAD(name) \ + struct list_head name = LIST_HEAD_INIT(name) + +#define INIT_LIST_HEAD(ptr) do { \ + (ptr)->next = (ptr); (ptr)->prev = (ptr); \ +} while (0) + +/* + * Insert a new entry between two known consecutive entries. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_add(struct list_head *new, + struct list_head *prev, + struct list_head *next) +{ + next->prev = new; + new->next = next; + new->prev = prev; + prev->next = new; +} + +/** + * list_add - add a new entry + * @new: new entry to be added + * @head: list head to add it after + * + * Insert a new entry after the specified head. + * This is good for implementing stacks. + */ +static inline void list_add(struct list_head *new, struct list_head *head) +{ + __list_add(new, head, head->next); +} + +/** + * list_add_tail - add a new entry + * @new: new entry to be added + * @head: list head to add it before + * + * Insert a new entry before the specified head. + * This is useful for implementing queues. + */ +static inline void list_add_tail(struct list_head *new, struct list_head *head) +{ + __list_add(new, head->prev, head); +} + +/* + * Delete a list entry by making the prev/next entries + * point to each other. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_del(struct list_head *prev, struct list_head *next) +{ + next->prev = prev; + prev->next = next; +} + +/** + * list_del - deletes entry from list. + * @entry: the element to delete from the list. + * Note: list_empty on entry does not return true after this, the entry is in an undefined state. + */ +static inline void list_del(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + entry->next = (void *) 0; + entry->prev = (void *) 0; +} + +/** + * list_del_init - deletes entry from list and reinitialize it. + * @entry: the element to delete from the list. + */ +static inline void list_del_init(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + INIT_LIST_HEAD(entry); +} + +/** + * list_move - delete from one list and add as another's head + * @list: the entry to move + * @head: the head that will precede our entry + */ +static inline void list_move(struct list_head *list, struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add(list, head); +} + +/** + * list_move_tail - delete from one list and add as another's tail + * @list: the entry to move + * @head: the head that will follow our entry + */ +static inline void list_move_tail(struct list_head *list, + struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add_tail(list, head); +} + +/** + * list_empty - tests whether a list is empty + * @head: the list to test. + */ +static inline int list_empty(struct list_head *head) +{ + return head->next == head; +} + +static inline void __list_splice(struct list_head *list, + struct list_head *head) +{ + struct list_head *first = list->next; + struct list_head *last = list->prev; + struct list_head *at = head->next; + + first->prev = head; + head->next = first; + + last->next = at; + at->prev = last; +} + +/** + * list_splice - join two lists + * @list: the new list to add. + * @head: the place to add it in the first list. + */ +static inline void list_splice(struct list_head *list, struct list_head *head) +{ + if (!list_empty(list)) + __list_splice(list, head); +} + +/** + * list_splice_init - join two lists and reinitialise the emptied list. + * @list: the new list to add. + * @head: the place to add it in the first list. + * + * The list at @list is reinitialised + */ +static inline void list_splice_init(struct list_head *list, + struct list_head *head) +{ + if (!list_empty(list)) { + __list_splice(list, head); + INIT_LIST_HEAD(list); + } +} + +/** + * list_entry - get the struct for this entry + * @ptr: the &struct list_head pointer. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. + */ +#define list_entry(ptr, type, member) \ + ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) + +/** + * list_for_each - iterate over a list + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); \ + pos = pos->next) +/** + * list_for_each_prev - iterate over a list backwards + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each_prev(pos, head) \ + for (pos = (head)->prev; pos != (head); \ + pos = pos->prev) + +/** + * list_for_each_safe - iterate over a list safe against removal of list entry + * @pos: the &struct list_head to use as a loop counter. + * @n: another &struct list_head to use as temporary storage + * @head: the head for your list. + */ +#define list_for_each_safe(pos, n, head) \ + for (pos = (head)->next, n = pos->next; pos != (head); \ + pos = n, n = pos->next) + +/** + * list_for_each_entry - iterate over list of given type + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry(pos, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/** + * list_for_each_entry_prev - iterate over list of given type backwards + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_prev(pos, head, member) \ + for (pos = list_entry((head)->prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.prev, typeof(*pos), member)) + + +/** + * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry + * @pos: the type * to use as a loop counter. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_safe(pos, n, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member), \ + n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + + +#endif diff --git a/src/macros.h b/src/macros.h new file mode 100644 index 0000000..8eb8cbf --- /dev/null +++ b/src/macros.h @@ -0,0 +1,37 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _MACROS_H +#define _MACROS_H + +#include <SDL.h> + +#define fatal_if(_cond, _fmt, ...) \ + if (_cond) { \ + SDL_Log("Fatal error: " _fmt "; %s\n", ##__VA_ARGS__, SDL_GetError()); \ + exit(EXIT_FAILURE); \ + } + +#define NELEMS(_a) \ + (sizeof(_a) / sizeof(_a[0])) + +#define CSTRLEN(_str) \ + (sizeof(_str) - 1) + +#define MIN(_a, _b) \ + ((_a) < (_b) ? (_a) : (_b)) + +#endif diff --git a/src/splash-node.c b/src/splash-node.c new file mode 100644 index 0000000..a077d06 --- /dev/null +++ b/src/splash-node.c @@ -0,0 +1,115 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "whale.h" +#include "macros.h" +#include "v2f.h" +#include "stage.h" + +typedef struct droplet_t { + v2f_t trajectory; + v2f_t coordinate; + int dead:1; +} droplet_t; + +typedef struct splash_t { + Uint32 color; + unsigned count; + droplet_t droplets[]; + int dead:1; +} splash_t; + + +static splash_t * splash_new(unsigned count) +{ + splash_t *splash; + unsigned i; + + splash = calloc(1, sizeof(splash_t) + count * sizeof(droplet_t)); + fatal_if(!splash, "Unable to allocate splash_t"); + + splash->count = count; + for (i = 0; i < count; i++) { + splash->droplets[i].trajectory.y = 1.f; + splash->droplets[i].trajectory.x = ((float)rand() * (1.0f / RAND_MAX) * .25f) - .125f; + splash->droplets[i].coordinate.x = 0.f; + splash->droplets[i].coordinate.y = -1.f; + } + + return splash; +} + + +static void splash_render(splash_t *splash, SDL_Surface *surface) +{ + unsigned i; + +/* TODO */ + /* currently every time we render the splash we update it as well, they're + * rolled into one */ + for (i = 0; i < splash->count; i++) { + + } +} + + +static int splash_node_render(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture) +{ + splash_t *splash = object; + SDL_Surface *surface; + + if (splash->dead) /* TODO: expand the stage node render api to support a "delete node" return from render */ + return 0; + + if (*texture) { + /* cached textures are useless to softwre rendered particles */ + SDL_DestroyTexture(*texture); + *texture = NULL; + } + + splash_render(splash, surface); + surface = whale_svg_render((whale_svg_t *)object, width, height); + fatal_if(!surface, "Unable to render svg surface"); + + *texture = SDL_CreateTextureFromSurface(renderer, surface); + fatal_if(!*texture, "Unable to create texture from svg surface"); + + SDL_FreeSurface(surface); + + return 1; +} + +static void splash_node_free(void *object) +{ + whale_svg_free(object); +} + +stage_node_t * splash_node_new(stage_t *stage, const char *name, int layer, aabb_t aabb, unsigned count) +{ + stage_node_t *node; + splash_t *splash; + + splash = splash_new(count); + node = stage_node_new(stage, layer, name, splash, splash_node_render, splash_node_free); + fatal_if(!node, "Unable to create stage node for splash"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} diff --git a/src/stage.c b/src/stage.c new file mode 100644 index 0000000..734b46a --- /dev/null +++ b/src/stage.c @@ -0,0 +1,448 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "list.h" +#include "macros.h" +#include "stage.h" + +typedef struct stage_cached_t { + int width, height; + SDL_Texture *texture; +} stage_cached_t; + +struct stage_node_t { + list_head_t nodes; + char name[STAGE_NODE_NAME_MAX]; + stage_cached_t cached; + aabb_t aabb; /* node coordinates expressed in the space of -1.0...1.0 */ + float alpha; /* alpha for the texture when composited */ + double angle; /* angle for the texture when composited */ + unsigned active:1; /* node is active */ + unsigned locked:1; /* node is locked */ + + stage_render_func_t render; /* render object into a texture */ + stage_free_func_t free; /* free object */ + void *object; /* object */ +}; + +struct stage_t { + list_head_t layers[STAGE_LAYERS_MAX]; + SDL_Renderer *renderer; /* target renderer */ + float aspect_ratio; /* width/height ratio of stage, -1.0...1.0 range of node coordinates map to this ratio. */ +}; + + +/* minimally initialize a node to carry an object */ +static void node_init(stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + strncpy(node->name, name, sizeof(node->name)); + node->render = render_func; + node->free = free_func; + node->object = object; +} + + +/* allocate a node, no list manipulation occurs, this purely creates a node in isolation and assigns its associated name, object and functions */ +static stage_node_t * node_new(const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + stage_node_t *node; + + node = calloc(1, sizeof(stage_node_t)); + if (!node) + return NULL; + + node_init(node, name, object, render_func, free_func); + + return node; +} + + +/* free a node, no list manipulation occurs, this is purely cleanup of the node and its associated texture and object */ +static void node_free(stage_node_t *node) +{ + if (node->free) + node->free(node->object); + if (node->cached.texture) + SDL_DestroyTexture(node->cached.texture); + free(node); +} + + +/* returns a new node installed at the specified layer */ +stage_node_t * stage_node_new(stage_t *stage, int layer, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + stage_node_t *node; + + node = node_new(name, object, render_func, free_func); + if (!node) + return NULL; + + list_add_tail(&node->nodes, &stage->layers[layer]); + + return node; +} + + +/* replace a given node's object only - retain render/free hooks and everything else, invalidates cache - DOES NOT FREE OLD OBJECT */ +/* FIXME: this is being used as a kludge to swap frames in an svg - + * eliminate this bullshit and add support for animations or at least frames, + * the stage really shouldn't have anything to do with it, we can dick with + * the svg behind its back. I just don't currently have the helpers for creating + * svg nodes actually giving out the bare svg handle currently, so the stage_node_t + * is all I have to dick with at the moment. Next time! This really dicks with + * the resource lifecycle - if the stage frees the node, which object was active + * at the time and which object still needs to be freed because it wasn't in + * the stage when the node was killed? It's totally shitty, and I'm aware. + */ +void stage_node_set_object(const stage_t *stage, stage_node_t *node, void *object) +{ + if (node->cached.texture) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + node->object = object; +} + +/* FIXME: GROSS fuck me */ +void stage_node_get_object(const stage_t *stage, stage_node_t *node, void **res_object) +{ + *res_object = node->object; +} + + +/* replaces a given node's object-related properties but otherwise keeping the existing state */ +void stage_node_replace(const stage_t *stage, stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + if (node->free) + node->free(node->object); + + if (node->cached.texture) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + node_init(node, name, object, render_func, free_func); +} + + +/* frees a given node removing it from the stage */ +stage_node_t * stage_node_free(stage_t *stage, stage_node_t *node) +{ + if (node) { + list_del(&node->nodes); + node_free(node); + } + + return NULL; +} + + +/* set the alpha on a node */ +void stage_node_set_alpha(const stage_t *stage, stage_node_t *node, float alpha) +{ + /* TODO: this should probably mark something dirty for when we stop always recomposing everything */ + node->alpha = alpha; +} + + +/* set the aabb for a node */ +void stage_node_set_aabb(const stage_t *stage, stage_node_t *node, const aabb_t *aabb) +{ + node->aabb = *aabb; +} + + +/* get the aabb for a node */ +void stage_node_get_aabb(const stage_t *stage, stage_node_t *node, aabb_t *res_aabb) +{ + *res_aabb = node->aabb; +} + + +/* set a node to active (participates in rendering) */ +void stage_node_set_active(const stage_t *stage, stage_node_t *node) +{ + node->active = 1; +} + + +/* set a node to inactive (doesn't participate in rendering) */ +void stage_node_set_inactive(const stage_t *stage, stage_node_t *node) +{ + /* TODO: should this discard the potentially cached texture? */ + node->active = 0; +} + + +/* set a node to locked (doesn't get freed by clears) */ +void stage_node_set_locked(const stage_t *stage, stage_node_t *node) +{ + node->locked = 1; +} + + +/* set a node to unlocked (default, gets freed by clears) */ +void stage_node_set_unlocked(const stage_t *stage, stage_node_t *node) +{ + node->locked = 0; +} + + +/* set a node's layer */ +void stage_node_set_layer(stage_t *stage, stage_node_t *node, int layer) +{ + /* TODO: assert layer sanity */ + list_del(&node->nodes); + list_add_tail(&node->nodes, &stage->layers[layer]); +} + + +void stage_node_set_angle(const stage_t *stage, stage_node_t *node, double angle) +{ + node->angle = angle; +} + + +void stage_node_get_angle(const stage_t *stage, stage_node_t *node, double *res_angle) +{ + *res_angle = node->angle; +} + + +/* create a new stage with the given aspect ratio */ +stage_t * stage_new(SDL_Renderer *renderer, float aspect_ratio) +{ + stage_t *stage; + int i; + + stage = calloc(1, sizeof(stage_t)); + if (!stage) + return NULL; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) + INIT_LIST_HEAD(&stage->layers[i]); + + stage->renderer = renderer; + stage->aspect_ratio = aspect_ratio; + + return stage; +} + +static void _stage_clear(stage_t *stage, int force) +{ + stage_node_t *node, *_node; + int i; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) { + list_for_each_entry_safe(node, _node, &stage->layers[i], nodes) { + if (force || !node->locked) + stage_node_free(stage, node); + } + } +} + +/* free everything in the stage, but keep the stage around */ +/* probably good hygiene to clear everything when there's no intention of + * reusing nodes at the start of a new context, in case something is left + * around unintentionally. */ +void stage_clear(stage_t *stage) +{ + _stage_clear(stage, 0); +} + + +/* free the supplied stage and all associated textures and objects */ +stage_t * stage_free(stage_t *stage) +{ + + if (stage) { + _stage_clear(stage, 1); + free(stage); + } + + return NULL; +} + + +/* fit a stage to the supplied dimensions, returns the fitted dimensions in the result pointers */ +/* the idea is this can be used in a window resize hook to enforce the stage's aspect ratio */ +void stage_fit(const stage_t *stage, int width, int height, int *res_width, int *res_height) +{ + float full_width = stage->aspect_ratio * ((float)height); + + if (full_width == width) { + /* perfect fit */ + *res_width = width; + *res_height = height; + } else if (full_width > width) { + /* height is too large */ + *res_height = (1.0f / stage->aspect_ratio) * ((float)width); + *res_width = width; + } else { + /* width is too large */ + *res_width = full_width; + *res_height = height; + } +} + + +static void aabb_to_rect(const aabb_t *aabb, const SDL_Rect *stage_rect, SDL_Rect *res_rect) +{ + float half_w = ((float)stage_rect->w) * .5f, half_h = ((float)stage_rect->h) * .5f; /* FIXME silly to recompute this repeatedly... */ + + res_rect->x = stage_rect->x; + res_rect->y = stage_rect->y; + res_rect->x += ((float)aabb->min.x) * half_w + half_w; + res_rect->y += stage_rect->h - (((float)aabb->max.y) * half_h + half_h); + + res_rect->w = (aabb->max.x - aabb->min.x) * half_w; + res_rect->h = (aabb->max.y - aabb->min.y) * half_h; +} + + +static void render_nodes(list_head_t *head, SDL_Renderer *renderer, SDL_Rect *dest_rect) +{ + stage_node_t *node; + + list_for_each_entry(node, head, nodes) { + SDL_Rect node_rect; + + if (!node->active) + continue; + + /* scale the node's aabb stage coordinates to destination renderer coordinates */ + aabb_to_rect(&node->aabb, dest_rect, &node_rect); + + /* if we have a cached texture, see if the dimensions changed */ + if (node->cached.texture && + (node_rect.w != node->cached.width || + node_rect.h != node->cached.height)) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + /* Tell the node to draw its cached texture */ + /* The draw function may either use the existing texture when non-NULL or destroy and create a new one, + * whatever is most convenient for it. + * If the texture is NULL, a create & render must be performed, and 1 returned. + * If the texture is non-NULL, and there's no animation or anything to be done, 0 may simply be returned. + * Otherwise, if supplied a non-NULL texture and it's modified, 1 must be returned. + */ + /* XXX: at this time, the return value is ignored (it always composites the stage even when unchanged) */ + node->render(renderer, node->object, node_rect.w, node_rect.h, &node->cached.texture); + node->cached.width = node_rect.w; + node->cached.height = node_rect.h; + SDL_SetTextureAlphaMod(node->cached.texture, ((float)node->alpha * 255.0f)); + + /* copy the texture to renderer */ + if (node->angle == 0) + SDL_RenderCopy(renderer, node->cached.texture, NULL, &node_rect); + else + SDL_RenderCopyEx(renderer, node->cached.texture, NULL, &node_rect, node->angle, NULL, SDL_FLIP_NONE); + } +} + + +/* XXX: ANOTHER KLUDGE FIXME */ +/* we shouldn't need to let this out of the stage, but for the mouse aiming + * it was easier this way for now. + */ +void stage_get_output_size(stage_t *stage, int *res_width, int *res_height) +{ + SDL_GetRendererOutputSize(stage->renderer, res_width, res_height); +} + + +/* render the supplied stage into the supplied renderer */ +/* the aspect_ratio of the stage will be enforced in filling the logical size + * of the renderer. Unless the aspect ratio matches precisely, stage_render() + * will center the rendering and leave blank borders on the edges left empty. + * The renderer may be sized precisely by first calling stage_fit(). + */ +void stage_render(stage_t *stage) +{ + SDL_Rect rect; + int i, width, height; + + /* XXX TODO: investigate renderer viewports and scale factors */ + SDL_GetRendererOutputSize(stage->renderer, &width, &height); + + stage_fit(stage, width, height, &rect.w, &rect.h); + rect.x = (width - rect.w) / 2; + rect.y = (height - rect.h) / 2; + + fatal_if(SDL_RenderClear(stage->renderer) == -1, + "Unable to clear renderer"); + + for (i = 0; i < STAGE_LAYERS_MAX; i++) + render_nodes(&stage->layers[i], stage->renderer, &rect); +} + + +/* lookup a node from a name */ +stage_node_t * stage_node_lookup_name(const stage_t *stage, const char *name) +{ + stage_node_t *node; + int i; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) { + list_for_each_entry(node, &stage->layers[i], nodes) { + if (!strncmp(node->name, name, sizeof(node->name))) + return node; + } + } + + return NULL; +} + + +/* lookup a node from a cartesian renderer coordinate */ +stage_node_t * stage_node_lookup_cartesian(const stage_t *stage, int x, int y) +{ + stage_node_t *node; + SDL_Rect rect; + int i, width, height; + + /* FIXME: copy-pasta with render, factor out */ + SDL_GetRendererOutputSize(stage->renderer, &width, &height); + + stage_fit(stage, width, height, &rect.w, &rect.h); + rect.x = (width - rect.w) / 2; + rect.y = (height - rect.h) / 2; + + /* this is currently very simple: find the first top-most node + * including the specified coordinate. + */ + for (i = STAGE_LAYERS_MAX - 1; i >= 0; i--) { + list_for_each_entry(node, &stage->layers[i], nodes) { + SDL_Rect node_rect; + + if (!node->active) + continue; + + aabb_to_rect(&node->aabb, &rect, &node_rect); + if (x >= node_rect.x && x < node_rect.x + node_rect.w && + y >= node_rect.y && y < node_rect.y + node_rect.h) + return node; + } + } + + return NULL; +} diff --git a/src/stage.h b/src/stage.h new file mode 100644 index 0000000..05ee3ec --- /dev/null +++ b/src/stage.h @@ -0,0 +1,57 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _STAGE_H +#define _STAGE_H + +#include <SDL.h> + +#define STAGE_NODE_NAME_MAX 16 +#define STAGE_LAYERS_MAX 10 + +typedef struct aabb_t aabb_t; +typedef struct stage_t stage_t; +typedef struct stage_node_t stage_node_t; + +typedef int (*stage_render_func_t)(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture); +typedef void (*stage_free_func_t)(void *object); + +stage_t * stage_new(SDL_Renderer *renderer, float aspect_ratio); +void stage_clear(stage_t *stage); +stage_t * stage_free(stage_t *stage); +void stage_fit(const stage_t *stage, int width, int height, int *res_width, int *res_height); +void stage_render(stage_t *stage); +stage_node_t * stage_node_new(stage_t *stage, int layer, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func); + +void stage_get_output_size(stage_t *stage, int *res_width, int *res_height); +void stage_node_set_object(const stage_t *stage, stage_node_t *node, void *object); +void stage_node_get_object(const stage_t *stage, stage_node_t *node, void **res_object); +void stage_node_replace(const stage_t *stage, stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func); +stage_node_t * stage_node_free(stage_t *stage, stage_node_t *node); +void stage_node_set_alpha(const stage_t *stage, stage_node_t *node, float alpha); +void stage_node_set_aabb(const stage_t *stage, stage_node_t *node, const aabb_t *aabb); +void stage_node_get_aabb(const stage_t *stage, stage_node_t *node, aabb_t *res_aabb); +void stage_node_set_active(const stage_t *stage, stage_node_t *node); +void stage_node_set_inactive(const stage_t *stage, stage_node_t *node); +void stage_node_set_locked(const stage_t *stage, stage_node_t *node); +void stage_node_set_unlocked(const stage_t *stage, stage_node_t *node); +void stage_node_set_layer(stage_t *stage, stage_node_t *node, int layer); +void stage_node_set_angle(const stage_t *stage, stage_node_t *node, double angle); +void stage_node_get_angle(const stage_t *stage, stage_node_t *node, double *res_angle); +stage_node_t * stage_node_lookup_name(const stage_t *stage, const char *name); +stage_node_t * stage_node_lookup_cartesian(const stage_t *stage, int x, int y); + +#endif diff --git a/src/svg-node.c b/src/svg-node.c new file mode 100644 index 0000000..7b5541b --- /dev/null +++ b/src/svg-node.c @@ -0,0 +1,88 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "macros.h" +#include "whale-svg.h" +#include "stage.h" + +static int svg_node_render(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture) +{ + SDL_Surface *surface; + + if (*texture) /* if there's a cached texture, do nothing. */ + return 0; + + surface = whale_svg_render((whale_svg_t *)object, width, height); + fatal_if(!surface, "Unable to render svg surface"); + + *texture = SDL_CreateTextureFromSurface(renderer, surface); + fatal_if(!*texture, "Unable to create texture from svg surface"); + + SDL_FreeSurface(surface); + + return 1; +} + +static void svg_node_free(void *object) +{ + whale_svg_free(object); +} + +stage_node_t * svg_node_new_file(stage_t *stage, const char *name, const char *file, int layer, aabb_t aabb) +{ + stage_node_t *node; + whale_svg_t *svg; + + svg = whale_svg_new_file(file); + fatal_if(!svg, "Unable to open svg \"%s\"", file); + + node = stage_node_new(stage, layer, name, svg, svg_node_render, svg_node_free); + fatal_if(!node, "Unable to create stage node"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} + +stage_node_t * svg_node_new_buffer(stage_t *stage, const char *name, const char *buf, size_t count, int layer, aabb_t aabb) +{ + stage_node_t *node; + whale_svg_t *svg; + + svg = whale_svg_new_buffer(buf, count); + fatal_if(!svg, "Unable to open svg buffer for \"%s\"", name); + + node = stage_node_new(stage, layer, name, svg, svg_node_render, svg_node_free); + fatal_if(!node, "Unable to create stage node"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} + + +void svg_node_replace_buffer(stage_t *stage, stage_node_t *node, const char *name, const char *buf, size_t count) +{ + whale_svg_t *svg; + + svg = whale_svg_new_buffer(buf, count); + fatal_if(!svg, "Unable to open svg buffer for \"%s\"", name); + + stage_node_replace(stage, node, name, svg, svg_node_render, svg_node_free); +} diff --git a/src/svg-node.h b/src/svg-node.h new file mode 100644 index 0000000..4ea2452 --- /dev/null +++ b/src/svg-node.h @@ -0,0 +1,28 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _SVG_NODE_H +#define _SVG_NODE_H + +typedef struct stage_t stage_t; +typedef struct stage_node_t stage_node_t; +typedef struct aabb_t aabb_t; + +stage_node_t * svg_node_new_file(stage_t *stage, const char *name, const char *file, int layer, aabb_t aabb); +stage_node_t * svg_node_new_buffer(stage_t *stage, const char *name, const char *buf, size_t count, int layer, aabb_t aabb); +void svg_node_replace_buffer(stage_t *stage, stage_node_t *node, const char *name, const char *buf, size_t count); + +#endif diff --git a/src/v2f.h b/src/v2f.h new file mode 100644 index 0000000..4d40a90 --- /dev/null +++ b/src/v2f.h @@ -0,0 +1,71 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _V2F_H +#define _V2F_H + +#include <math.h> + +typedef struct v2f_t { + float x, y; +} v2f_t; + + +static inline v2f_t v2f_add(const v2f_t *a, const v2f_t *b) +{ + return (v2f_t){a->x + b->x, a->y + b->y}; +} + + +static inline v2f_t v2f_mult_scalar(const v2f_t *v, float scalar) +{ + return (v2f_t){ v->x * scalar, v->y * scalar }; +} + + +static inline float v2f_dot(v2f_t *a, v2f_t *b) +{ + return a->x * b->x + a->y + b->y; +} + + +static inline float v2f_length(v2f_t *v) +{ + return sqrtf(v2f_dot(v, v)); +} + + +static inline v2f_t v2f_normalize(v2f_t *v) +{ + float f; + + f = 1.0f / v2f_length(v); + + return (v2f_t){ .x = f * v->x, .y = f * v->y }; +} + + +static inline v2f_t v2f_lerp(const v2f_t *a, const v2f_t *b, float t) +{ + v2f_t lerp_a, lerp_b; + + lerp_a = v2f_mult_scalar(a, 1.0f - t); + lerp_b = v2f_mult_scalar(b, t); + + return v2f_add(&lerp_a, &lerp_b); +} + +#endif diff --git a/src/whale-svg.c b/src/whale-svg.c new file mode 100644 index 0000000..2c4b655 --- /dev/null +++ b/src/whale-svg.c @@ -0,0 +1,171 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <stdio.h> /* this is needed by cairo headers of all things */ +#include <cairo.h> +#ifdef HAVE_SVG_CAIRO +#include <svg-cairo.h> +#else +#include <librsvg/rsvg.h> +#endif + +#include "macros.h" + +typedef struct whale_svg_t { +#ifdef HAVE_SVG_CAIRO + svg_cairo_t *cairo_svg; + unsigned width, height; +#else + RsvgHandle *rsvg; + RsvgDimensionData dimensions; +#endif +} whale_svg_t; + + +whale_svg_t * whale_svg_new_file(const char *file) +{ + whale_svg_t *svg; + + svg = calloc(1, sizeof(whale_svg_t)); + fatal_if(!svg, "Unable to create svg"); + +#ifdef HAVE_SVG_CAIRO + fatal_if(svg_cairo_create(&svg->cairo_svg) != 0, + "Unable to create svg-cairo context"); + fatal_if(svg_cairo_parse(svg->cairo_svg, file) != 0, + "Unable to parse \"%s\"", file); + svg_cairo_get_size(svg->cairo_svg, &svg->width, &svg->height); +#else + //rsvg_init(); + svg->rsvg = rsvg_handle_new_from_file(file, NULL); + fatal_if(!svg->rsvg, + "Unable to create rsvg handle from file \"%s\"", file); + rsvg_handle_get_dimensions(svg->rsvg, &svg->dimensions); +#endif + + return svg; +} + + +whale_svg_t * whale_svg_new_buffer(const char *buf, size_t count) +{ + whale_svg_t *svg; + + svg = calloc(1, sizeof(whale_svg_t)); + fatal_if(!svg, "Unable to create svg"); + +#ifdef HAVE_SVG_CAIRO + fatal_if(svg_cairo_create(&svg->cairo_svg) != 0, + "Unable to create svg-cairo context"); + fatal_if(svg_cairo_parse_buffer(svg->cairo_svg, buf, count) != 0, + "Unable to parse svg buffer"); + svg_cairo_get_size(svg->cairo_svg, &svg->width, &svg->height); +#else + //rsvg_init(); + svg->rsvg = rsvg_handle_new_from_data(buf, count, NULL); + fatal_if(!svg->rsvg, + "Unable to create rsvg handle from buffer"); + rsvg_handle_get_dimensions(svg->rsvg, &svg->dimensions); +#endif + + return svg; +} + + + +SDL_Surface * whale_svg_render(whale_svg_t *svg, int width, int height) +{ + cairo_surface_t *cairo_surface; + SDL_Surface *sdl_surface; + cairo_t *cairo; + double xscale, yscale, scale, tx, ty, svg_width, svg_height; + +#ifdef HAVE_SVG_CAIRO + svg_width = svg->width; + svg_height = svg->height; +#else + svg_width = svg->dimensions.width; + svg_height = svg->dimensions.height; +#endif + + /* cached size is different so redo the costly SVG render */ + sdl_surface = SDL_CreateRGBSurfaceWithFormat(0, width, height, 32, SDL_PIXELFORMAT_ARGB8888); + fatal_if(!sdl_surface, "Unable to create sdl surface"); + + cairo_surface = cairo_image_surface_create_for_data(sdl_surface->pixels, + CAIRO_FORMAT_ARGB32, + width, + height, + sdl_surface->pitch); + fatal_if(!cairo_surface, "Unable to create cairo surface"); + +#if 0 + /* useful for debugging */ + SDL_FillRect(sdl_surface, NULL, 0xffff0000); +#endif + + cairo = cairo_create(cairo_surface); + fatal_if(!cairo, "Unable to create cairo target"); + + /* XXX: this scaling attempts to preserve the svg's aspect ratio, + * while filling the destination surface + */ + xscale = (double)width / svg_width; + yscale = (double)height / svg_height; + scale = xscale < yscale ? xscale : yscale; + + /* if we have a mismatch between the desired width/height aspect ratio, + * and the svg's aspect ratio, we need to translate to center the rendering + * in the resulting surface + */ + tx = scale * svg_width; + ty = scale * svg_height; + + if ((int)((double)tx + 0.5) < width) + tx = ((double)width - tx + 0.5) / 2.0; + else + tx = 0; + + if ((int)((double)ty + 0.5) < height) + ty = ((double)height - ty + 0.5) / 2.0; + else + ty = 0; + + cairo_translate(cairo, tx, ty); + cairo_scale(cairo, scale, scale); + +#ifdef HAVE_SVG_CAIRO + svg_cairo_render(svg->cairo_svg, cairo); +#else + rsvg_handle_render_cairo(svg->rsvg, cairo); +#endif + cairo_surface_flush(cairo_surface); + cairo_surface_destroy(cairo_surface); + cairo_destroy(cairo); + + return sdl_surface; +} + + +void whale_svg_free(whale_svg_t *svg) +{ +#ifdef HAVE_SVG_CAIRO + svg_cairo_destroy(svg->cairo_svg); +#else + rsvg_handle_free(svg->rsvg); +#endif + free(svg); +} diff --git a/src/whale-svg.h b/src/whale-svg.h new file mode 100644 index 0000000..b69028d --- /dev/null +++ b/src/whale-svg.h @@ -0,0 +1,29 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _WHALE_SVG_H +#define _WHALE_SVG_H + +#include <SDL.h> + +typedef struct whale_svg_t whale_svg_t; + +whale_svg_t * whale_svg_new_file(const char *file); +whale_svg_t * whale_svg_new_buffer(const char *buf, size_t count); +SDL_Surface * whale_svg_render(whale_svg_t *svg, int width, int height); +void whale_svg_free(whale_svg_t *svg); + +#endif diff --git a/src/whale.c b/src/whale.c new file mode 100644 index 0000000..17cbb5d --- /dev/null +++ b/src/whale.c @@ -0,0 +1,239 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#include <SDL.h> +#include <SDL_mixer.h> +#include <assert.h> +#include <stdlib.h> /* exit, atexit */ + +#include "credits.h" +#include "whale.h" +#include "game.h" +#include "intro.h" +#include "macros.h" +#include "stage.h" + +/* whale - Blender 2018 entry */ +/* whales / doing astrophysics / crater lake */ + +#define DEFAULT_WIDTH 800 +#define DEFAULT_HEIGHT 450 +#define WINDOW_FLAGS (SDL_WINDOW_RESIZABLE) + +typedef struct whale_t { + struct { + SDL_Window *window; + SDL_Renderer *renderer; + + Mix_Music *music; + Uint32 tick_offsets[2]; + } sdl; + + whale_context_t context; + stage_t *stage; +} whale_t; + + +stage_t * whale_get_stage(const whale_t *whale) +{ + return whale->stage; +} + + +void whale_set_music(whale_t *whale, const char *file, unsigned flags) +{ + int loop = (flags & WHALE_MUSIC_FLAG_LOOP) ? -1 : 0; + int fade = (flags & WHALE_MUSIC_FLAG_FADEIN); + + if (whale->sdl.music) { + Mix_HaltMusic(); + Mix_FreeMusic(whale->sdl.music); + whale->sdl.music = NULL; + } + + whale->sdl.music = Mix_LoadMUS(file); + fatal_if(!whale->sdl.music, + "Unable to load music \"%s\"", file); + Mix_VolumeMusic(32); /* XXX: just hard-coding music volume for now */ + if (fade) { + fatal_if(Mix_FadeInMusic(whale->sdl.music, loop, 1000), + "Unable to play music"); + } else { + fatal_if(Mix_PlayMusic(whale->sdl.music, loop), + "Unable to play music"); + } +} + + +void whale_set_context(whale_t *whale, whale_context_t context) +{ + whale->context = context; +} + + +/* return ticks counter */ +unsigned whale_ticks(whale_t *whale, whale_ticks_t type) +{ + return SDL_GetTicks() - whale->sdl.tick_offsets[type]; +} + + +/* reset ticks counter to begin counting from now */ +void whale_ticks_reset(whale_t *whale, whale_ticks_t type) +{ + whale->sdl.tick_offsets[type] = SDL_GetTicks(); +} + + +static void whale_startup(whale_t *whale) +{ + fatal_if(SDL_Init(SDL_INIT_VIDEO|SDL_INIT_AUDIO) != 0, + "Unable to initialize SDL"); + fatal_if(atexit(SDL_Quit), + "Unable to set exit handler"); + + fatal_if(Mix_OpenAudio(44100, MIX_DEFAULT_FORMAT, 2, 2048) == -1, + "Unable to open audio"); + + whale->sdl.window = SDL_CreateWindow("whale", + SDL_WINDOWPOS_UNDEFINED, + SDL_WINDOWPOS_UNDEFINED, + DEFAULT_WIDTH, DEFAULT_HEIGHT, + WINDOW_FLAGS); + fatal_if(!whale->sdl.window, + "Unable to create SDL window"); + + whale->sdl.renderer = SDL_CreateRenderer(whale->sdl.window, -1, + SDL_RENDERER_PRESENTVSYNC); + fatal_if(!whale->sdl.renderer, + "Unable to create SDL renderer"); + + whale->stage = stage_new(whale->sdl.renderer, 1.7777f); + fatal_if(!whale->stage, + "Unable to create new stage"); +} + + +static void whale_update(whale_t *whale) +{ + switch (whale->context) { + case WHALE_CONTEXT_INTRO: + whale_intro_update(whale); + break; + + case WHALE_CONTEXT_GAME: + whale_game_update(whale); + break; + + case WHALE_CONTEXT_CREDITS: + whale_credits_update(whale); + break; + + default: + assert(0); + } + + stage_render(whale->stage); + SDL_RenderPresent(whale->sdl.renderer); +} + + +static void whale_event(whale_t *whale, SDL_Event *event) +{ + switch (whale->context) { + case WHALE_CONTEXT_INTRO: + whale_intro_event(whale, event); + break; + + case WHALE_CONTEXT_GAME: + whale_game_event(whale, event); + break; + + case WHALE_CONTEXT_CREDITS: + whale_credits_event(whale, event); + break; + + default: + assert(0); + } +} + + +static int whale_shutdown(whale_t *whale) +{ + stage_free(whale->stage); + SDL_DestroyRenderer(whale->sdl.renderer); + SDL_DestroyWindow(whale->sdl.window); + Mix_CloseAudio(); + + return EXIT_SUCCESS; +} + + +static void whale_loop(whale_t *whale) +{ + for (;;) { + SDL_Event ev; + + while (SDL_PollEvent(&ev)) { + switch (ev.type) { + case SDL_APP_TERMINATING: + case SDL_QUIT: + return; + + case SDL_WINDOWEVENT: + break; + + case SDL_MOUSEMOTION: + break; + + case SDL_MOUSEBUTTONDOWN: + case SDL_MOUSEBUTTONUP: + break; + + case SDL_MOUSEWHEEL: + break; + + case SDL_FINGERDOWN: + case SDL_FINGERUP: + case SDL_FINGERMOTION: + break; + + case SDL_KEYDOWN: + case SDL_KEYUP: + break; + + default: + break; + } + + whale_event(whale, &ev); + } + + whale_update(whale); + } +} + + +int main(int argc, char *argv[]) +{ + whale_t whale = {}; + + whale_startup(&whale); + whale_loop(&whale); + + return whale_shutdown(&whale); +} diff --git a/src/whale.h b/src/whale.h new file mode 100644 index 0000000..8e2f482 --- /dev/null +++ b/src/whale.h @@ -0,0 +1,46 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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, see <http://www.gnu.org/licenses/>. + */ + +#ifndef _WHALE_H +#define _WHALE_H + +#include <SDL.h> + +typedef enum whale_context_t { + WHALE_CONTEXT_INTRO, + WHALE_CONTEXT_GAME, + WHALE_CONTEXT_CREDITS +} whale_context_t; + +typedef enum whale_ticks_t { + WHALE_TICKS_TIMER, + WHALE_TICKS_MUSIC +} whale_ticks_t; + +#define WHALE_MUSIC_FLAG_LOOP (1L) +#define WHALE_MUSIC_FLAG_FADEIN (1L << 1) + +typedef struct whale_t whale_t; +typedef struct stage_t stage_t; + +stage_t * whale_get_stage(const whale_t *whale); +void whale_set_music(whale_t *whale, const char *file, unsigned flags); +void whale_set_context(whale_t *whale, whale_context_t context); +unsigned whale_ticks(whale_t *whale, whale_ticks_t type); +void whale_ticks_reset(whale_t *whale, whale_ticks_t type); + + +#endif |