#include "../uxn.h" #include "apu.h" /* Copyright (c) 2021 Devine Lu Linvega Copyright (c) 2021 Andrew Alderwick Permission to use, copy, modify, and distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE. */ #define NOTE_PERIOD (SAMPLE_FREQUENCY * 0x4000 / 11025) #define ADSR_STEP (SAMPLE_FREQUENCY / 0xf) /* clang-format off */ static Uint32 advances[12] = { 0x80000, 0x879c8, 0x8facd, 0x9837f, 0xa1451, 0xaadc1, 0xb504f, 0xbfc88, 0xcb2ff, 0xd7450, 0xe411f, 0xf1a1c }; /* clang-format on */ static Sint32 envelope(Apu *c, Uint32 age) { if(!c->r) return 0x0888; if(age < c->a) return 0x0888 * age / c->a; if(age < c->d) return 0x0444 * (2 * c->d - c->a - age) / (c->d - c->a); if(age < c->s) return 0x0444; if(age < c->r) return 0x0444 * (c->r - age) / (c->r - c->s); c->advance = 0; return 0x0000; } void apu_render(Apu *c, Sint16 *sample, Sint16 *end) { Sint32 s; if(!c->advance || !c->period) return; while(sample < end) { c->count += c->advance; c->i += c->count / c->period; c->count %= c->period; if(c->i >= c->len) { if(!c->repeat) { c->advance = 0; return; } c->i %= c->len; } s = (Sint8)(c->addr[c->i] + 0x80) * envelope(c, c->age++); *sample++ += s * c->volume[0] / 0x180; *sample++ += s * c->volume[1] / 0x180; } } void apu_start(Apu *c, Uint16 adsr, Uint8 pitch) { if(pitch < 108 && c->len) c->advance = advances[pitch % 12] >> (8 - pitch / 12); else { c->advance = 0; return; } c->a = ADSR_STEP * (adsr >> 12); c->d = ADSR_STEP * (adsr >> 8 & 0xf) + c->a; c->s = ADSR_STEP * (adsr >> 4 & 0xf) + c->d; c->r = ADSR_STEP * (adsr >> 0 & 0xf) + c->s; c->age = 0; c->i = 0; if(c->len <= 0x100) /* single cycle mode */ c->period = NOTE_PERIOD * 337 / 2 / c->len; else /* sample repeat mode */ c->period = NOTE_PERIOD; } Uint8 apu_get_vu(Apu *c) { size_t i; Sint32 sum[2]; if(!c->advance || !c->period) return 0; for(i = 0; i < 2; ++i) { sum[i] = envelope(c, c->age) * c->volume[i] / 0x800; if(sum[i] > 0xf) sum[i] = 0xf; } return (sum[0] << 4) | sum[1]; }