Remove engine file; add icon support; add QOI and QOA support
This commit is contained in:
parent
53ceb9bbf7
commit
a58da54994
|
@ -1,51 +0,0 @@
|
||||||
#include "engine.h"
|
|
||||||
|
|
||||||
#define STB_DS_IMPLEMENTATION
|
|
||||||
#include <stb_ds.h>
|
|
||||||
|
|
||||||
#define STB_TRUETYPE_IMPLEMENTATION
|
|
||||||
#include <stb_truetype.h>
|
|
||||||
|
|
||||||
#define STB_IMAGE_IMPLEMENTATION
|
|
||||||
#define STBI_FAILURE_USERMSG
|
|
||||||
#include "stb_image.h"
|
|
||||||
|
|
||||||
#define STB_IMAGE_WRITE_IMPLEMENTATION
|
|
||||||
#include "stb_image_write.h"
|
|
||||||
|
|
||||||
#define PL_MPEG_IMPLEMENTATION
|
|
||||||
#include <pl_mpeg.h>
|
|
||||||
|
|
||||||
#include "render.h"
|
|
||||||
|
|
||||||
#include "2dphysics.h"
|
|
||||||
#include "camera.h"
|
|
||||||
#include "gameobject.h"
|
|
||||||
#include "input.h"
|
|
||||||
#include "log.h"
|
|
||||||
#include "openglrender.h"
|
|
||||||
#include "resources.h"
|
|
||||||
#include "script.h"
|
|
||||||
#include "sprite.h"
|
|
||||||
#include "timer.h"
|
|
||||||
#include "window.h"
|
|
||||||
#include "sound.h"
|
|
||||||
#include "engine.h"
|
|
||||||
|
|
||||||
void error_callback(int error, const char *description) {
|
|
||||||
fprintf(stderr, "Error: %s\n", description);
|
|
||||||
YughError("GLFW Error: %s", description);
|
|
||||||
}
|
|
||||||
|
|
||||||
void engine_init() {
|
|
||||||
resources_init();
|
|
||||||
|
|
||||||
YughInfo("Starting physics ...");
|
|
||||||
phys2d_init();
|
|
||||||
|
|
||||||
YughInfo("Starting sound ...");
|
|
||||||
sound_init();
|
|
||||||
|
|
||||||
YughInfo("Starting scripts ...");
|
|
||||||
script_init();
|
|
||||||
}
|
|
|
@ -1,10 +0,0 @@
|
||||||
#ifndef ENGINE_H
|
|
||||||
#define ENGINE_H
|
|
||||||
|
|
||||||
extern double renderMS;
|
|
||||||
extern double physMS;
|
|
||||||
extern double updateMS;
|
|
||||||
|
|
||||||
void engine_init();
|
|
||||||
|
|
||||||
#endif
|
|
|
@ -5,7 +5,6 @@
|
||||||
#include "anim.h"
|
#include "anim.h"
|
||||||
#include "debug.h"
|
#include "debug.h"
|
||||||
#include "debugdraw.h"
|
#include "debugdraw.h"
|
||||||
#include "engine.h"
|
|
||||||
#include "font.h"
|
#include "font.h"
|
||||||
#include "gameobject.h"
|
#include "gameobject.h"
|
||||||
#include "input.h"
|
#include "input.h"
|
||||||
|
|
|
@ -114,8 +114,25 @@ static sg_trace_hooks hooks = {
|
||||||
.destroy_shader = destroy_shader,
|
.destroy_shader = destroy_shader,
|
||||||
};
|
};
|
||||||
|
|
||||||
|
void sg_logging(const char *tag, uint32_t lvl, uint32_t id, const char *msg, uint32_t line, const char *file, void *data) {
|
||||||
|
// mYughLog(0, 1, line, file, "tag: %s, msg: %s", tag, sg);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
void openglInit() {
|
void openglInit() {
|
||||||
|
mainwin.width = sapp_width();
|
||||||
|
mainwin.height = sapp_height();
|
||||||
|
|
||||||
|
sg_setup(&(sg_desc){
|
||||||
|
.logger = {
|
||||||
|
.func = sg_logging,
|
||||||
|
.user_data = NULL,
|
||||||
|
},
|
||||||
|
|
||||||
|
.buffer_pool_size = 1024,
|
||||||
|
.context.sample_count = 1,
|
||||||
|
});
|
||||||
|
|
||||||
sg_trace_hooks hh = sg_install_trace_hooks(&hooks);
|
sg_trace_hooks hh = sg_install_trace_hooks(&hooks);
|
||||||
|
|
||||||
font_init(NULL);
|
font_init(NULL);
|
||||||
|
|
728
source/engine/qoa.h
Normal file
728
source/engine/qoa.h
Normal file
|
@ -0,0 +1,728 @@
|
||||||
|
/*
|
||||||
|
|
||||||
|
Copyright (c) 2023, Dominic Szablewski - https://phoboslab.org
|
||||||
|
SPDX-License-Identifier: MIT
|
||||||
|
|
||||||
|
QOA - The "Quite OK Audio" format for fast, lossy audio compression
|
||||||
|
|
||||||
|
|
||||||
|
-- Data Format
|
||||||
|
|
||||||
|
QOA encodes pulse-code modulated (PCM) audio data with up to 255 channels,
|
||||||
|
sample rates from 1 up to 16777215 hertz and a bit depth of 16 bits.
|
||||||
|
|
||||||
|
The compression method employed in QOA is lossy; it discards some information
|
||||||
|
from the uncompressed PCM data. For many types of audio signals this compression
|
||||||
|
is "transparent", i.e. the difference from the original file is often not
|
||||||
|
audible.
|
||||||
|
|
||||||
|
QOA encodes 20 samples of 16 bit PCM data into slices of 64 bits. A single
|
||||||
|
sample therefore requires 3.2 bits of storage space, resulting in a 5x
|
||||||
|
compression (16 / 3.2).
|
||||||
|
|
||||||
|
A QOA file consists of an 8 byte file header, followed by a number of frames.
|
||||||
|
Each frame contains an 8 byte frame header, the current 16 byte en-/decoder
|
||||||
|
state per channel and 256 slices per channel. Each slice is 8 bytes wide and
|
||||||
|
encodes 20 samples of audio data.
|
||||||
|
|
||||||
|
All values, including the slices, are big endian. The file layout is as follows:
|
||||||
|
|
||||||
|
struct {
|
||||||
|
struct {
|
||||||
|
char magic[4]; // magic bytes "qoaf"
|
||||||
|
uint32_t samples; // samples per channel in this file
|
||||||
|
} file_header;
|
||||||
|
|
||||||
|
struct {
|
||||||
|
struct {
|
||||||
|
uint8_t num_channels; // no. of channels
|
||||||
|
uint24_t samplerate; // samplerate in hz
|
||||||
|
uint16_t fsamples; // samples per channel in this frame
|
||||||
|
uint16_t fsize; // frame size (includes this header)
|
||||||
|
} frame_header;
|
||||||
|
|
||||||
|
struct {
|
||||||
|
int16_t history[4]; // most recent last
|
||||||
|
int16_t weights[4]; // most recent last
|
||||||
|
} lms_state[num_channels];
|
||||||
|
|
||||||
|
qoa_slice_t slices[256][num_channels];
|
||||||
|
|
||||||
|
} frames[ceil(samples / (256 * 20))];
|
||||||
|
} qoa_file_t;
|
||||||
|
|
||||||
|
Each `qoa_slice_t` contains a quantized scalefactor `sf_quant` and 20 quantized
|
||||||
|
residuals `qrNN`:
|
||||||
|
|
||||||
|
.- QOA_SLICE -- 64 bits, 20 samples --------------------------/ /------------.
|
||||||
|
| Byte[0] | Byte[1] | Byte[2] \ \ Byte[7] |
|
||||||
|
| 7 6 5 4 3 2 1 0 | 7 6 5 4 3 2 1 0 | 7 6 5 / / 2 1 0 |
|
||||||
|
|------------+--------+--------+--------+---------+---------+-\ \--+---------|
|
||||||
|
| sf_quant | qr00 | qr01 | qr02 | qr03 | qr04 | / / | qr19 |
|
||||||
|
`-------------------------------------------------------------\ \------------`
|
||||||
|
|
||||||
|
Each frame except the last must contain exactly 256 slices per channel. The last
|
||||||
|
frame may contain between 1 .. 256 (inclusive) slices per channel. The last
|
||||||
|
slice (for each channel) in the last frame may contain less than 20 samples; the
|
||||||
|
slice still must be 8 bytes wide, with the unused samples zeroed out.
|
||||||
|
|
||||||
|
Channels are interleaved per slice. E.g. for 2 channel stereo:
|
||||||
|
slice[0] = L, slice[1] = R, slice[2] = L, slice[3] = R ...
|
||||||
|
|
||||||
|
A valid QOA file or stream must have at least one frame. Each frame must contain
|
||||||
|
at least one channel and one sample with a samplerate between 1 .. 16777215
|
||||||
|
(inclusive).
|
||||||
|
|
||||||
|
If the total number of samples is not known by the encoder, the samples in the
|
||||||
|
file header may be set to 0x00000000 to indicate that the encoder is
|
||||||
|
"streaming". In a streaming context, the samplerate and number of channels may
|
||||||
|
differ from frame to frame. For static files (those with samples set to a
|
||||||
|
non-zero value), each frame must have the same number of channels and same
|
||||||
|
samplerate.
|
||||||
|
|
||||||
|
Note that this implementation of QOA only handles files with a known total
|
||||||
|
number of samples.
|
||||||
|
|
||||||
|
A decoder should support at least 8 channels. The channel layout for channel
|
||||||
|
counts 1 .. 8 is:
|
||||||
|
|
||||||
|
1. Mono
|
||||||
|
2. L, R
|
||||||
|
3. L, R, C
|
||||||
|
4. FL, FR, B/SL, B/SR
|
||||||
|
5. FL, FR, C, B/SL, B/SR
|
||||||
|
6. FL, FR, C, LFE, B/SL, B/SR
|
||||||
|
7. FL, FR, C, LFE, B, SL, SR
|
||||||
|
8. FL, FR, C, LFE, BL, BR, SL, SR
|
||||||
|
|
||||||
|
QOA predicts each audio sample based on the previously decoded ones using a
|
||||||
|
"Sign-Sign Least Mean Squares Filter" (LMS). This prediction plus the
|
||||||
|
dequantized residual forms the final output sample.
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Header - Public functions */
|
||||||
|
|
||||||
|
#ifndef QOA_H
|
||||||
|
#define QOA_H
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define QOA_MIN_FILESIZE 16
|
||||||
|
#define QOA_MAX_CHANNELS 8
|
||||||
|
|
||||||
|
#define QOA_SLICE_LEN 20
|
||||||
|
#define QOA_SLICES_PER_FRAME 256
|
||||||
|
#define QOA_FRAME_LEN (QOA_SLICES_PER_FRAME * QOA_SLICE_LEN)
|
||||||
|
#define QOA_LMS_LEN 4
|
||||||
|
#define QOA_MAGIC 0x716f6166 /* 'qoaf' */
|
||||||
|
|
||||||
|
#define QOA_FRAME_SIZE(channels, slices) \
|
||||||
|
(8 + QOA_LMS_LEN * 4 * channels + 8 * slices * channels)
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
int history[QOA_LMS_LEN];
|
||||||
|
int weights[QOA_LMS_LEN];
|
||||||
|
} qoa_lms_t;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
unsigned int channels;
|
||||||
|
unsigned int samplerate;
|
||||||
|
unsigned int samples;
|
||||||
|
qoa_lms_t lms[QOA_MAX_CHANNELS];
|
||||||
|
#ifdef QOA_RECORD_TOTAL_ERROR
|
||||||
|
double error;
|
||||||
|
#endif
|
||||||
|
} qoa_desc;
|
||||||
|
|
||||||
|
unsigned int qoa_encode_header(qoa_desc *qoa, unsigned char *bytes);
|
||||||
|
unsigned int qoa_encode_frame(const short *sample_data, qoa_desc *qoa, unsigned int frame_len, unsigned char *bytes);
|
||||||
|
void *qoa_encode(const short *sample_data, qoa_desc *qoa, unsigned int *out_len);
|
||||||
|
|
||||||
|
unsigned int qoa_max_frame_size(qoa_desc *qoa);
|
||||||
|
unsigned int qoa_decode_header(const unsigned char *bytes, int size, qoa_desc *qoa);
|
||||||
|
unsigned int qoa_decode_frame(const unsigned char *bytes, unsigned int size, qoa_desc *qoa, short *sample_data, unsigned int *frame_len);
|
||||||
|
short *qoa_decode(const unsigned char *bytes, int size, qoa_desc *file);
|
||||||
|
|
||||||
|
#ifndef QOA_NO_STDIO
|
||||||
|
|
||||||
|
int qoa_write(const char *filename, const short *sample_data, qoa_desc *qoa);
|
||||||
|
void *qoa_read(const char *filename, qoa_desc *qoa);
|
||||||
|
|
||||||
|
#endif /* QOA_NO_STDIO */
|
||||||
|
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#endif /* QOA_H */
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Implementation */
|
||||||
|
|
||||||
|
#ifdef QOA_IMPLEMENTATION
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#ifndef QOA_MALLOC
|
||||||
|
#define QOA_MALLOC(sz) malloc(sz)
|
||||||
|
#define QOA_FREE(p) free(p)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
typedef unsigned long long qoa_uint64_t;
|
||||||
|
|
||||||
|
|
||||||
|
/* The quant_tab provides an index into the dequant_tab for residuals in the
|
||||||
|
range of -8 .. 8. It maps this range to just 3bits and becomes less accurate at
|
||||||
|
the higher end. Note that the residual zero is identical to the lowest positive
|
||||||
|
value. This is mostly fine, since the qoa_div() function always rounds away
|
||||||
|
from zero. */
|
||||||
|
|
||||||
|
static const int qoa_quant_tab[17] = {
|
||||||
|
7, 7, 7, 5, 5, 3, 3, 1, /* -8..-1 */
|
||||||
|
0, /* 0 */
|
||||||
|
0, 2, 2, 4, 4, 6, 6, 6 /* 1.. 8 */
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
/* We have 16 different scalefactors. Like the quantized residuals these become
|
||||||
|
less accurate at the higher end. In theory, the highest scalefactor that we
|
||||||
|
would need to encode the highest 16bit residual is (2**16)/8 = 8192. However we
|
||||||
|
rely on the LMS filter to predict samples accurately enough that a maximum
|
||||||
|
residual of one quarter of the 16 bit range is sufficient. I.e. with the
|
||||||
|
scalefactor 2048 times the quant range of 8 we can encode residuals up to 2**14.
|
||||||
|
|
||||||
|
The scalefactor values are computed as:
|
||||||
|
scalefactor_tab[s] <- round(pow(s + 1, 2.75)) */
|
||||||
|
|
||||||
|
static const int qoa_scalefactor_tab[16] = {
|
||||||
|
1, 7, 21, 45, 84, 138, 211, 304, 421, 562, 731, 928, 1157, 1419, 1715, 2048
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
/* The reciprocal_tab maps each of the 16 scalefactors to their rounded
|
||||||
|
reciprocals 1/scalefactor. This allows us to calculate the scaled residuals in
|
||||||
|
the encoder with just one multiplication instead of an expensive division. We
|
||||||
|
do this in .16 fixed point with integers, instead of floats.
|
||||||
|
|
||||||
|
The reciprocal_tab is computed as:
|
||||||
|
reciprocal_tab[s] <- ((1<<16) + scalefactor_tab[s] - 1) / scalefactor_tab[s] */
|
||||||
|
|
||||||
|
static const int qoa_reciprocal_tab[16] = {
|
||||||
|
65536, 9363, 3121, 1457, 781, 475, 311, 216, 156, 117, 90, 71, 57, 47, 39, 32
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
/* The dequant_tab maps each of the scalefactors and quantized residuals to
|
||||||
|
their unscaled & dequantized version.
|
||||||
|
|
||||||
|
Since qoa_div rounds away from the zero, the smallest entries are mapped to 3/4
|
||||||
|
instead of 1. The dequant_tab assumes the following dequantized values for each
|
||||||
|
of the quant_tab indices and is computed as:
|
||||||
|
float dqt[8] = {0.75, -0.75, 2.5, -2.5, 4.5, -4.5, 7, -7};
|
||||||
|
dequant_tab[s][q] <- round_ties_away_from_zero(scalefactor_tab[s] * dqt[q])
|
||||||
|
|
||||||
|
The rounding employed here is "to nearest, ties away from zero", i.e. positive
|
||||||
|
and negative values are treated symmetrically.
|
||||||
|
*/
|
||||||
|
|
||||||
|
static const int qoa_dequant_tab[16][8] = {
|
||||||
|
{ 1, -1, 3, -3, 5, -5, 7, -7},
|
||||||
|
{ 5, -5, 18, -18, 32, -32, 49, -49},
|
||||||
|
{ 16, -16, 53, -53, 95, -95, 147, -147},
|
||||||
|
{ 34, -34, 113, -113, 203, -203, 315, -315},
|
||||||
|
{ 63, -63, 210, -210, 378, -378, 588, -588},
|
||||||
|
{ 104, -104, 345, -345, 621, -621, 966, -966},
|
||||||
|
{ 158, -158, 528, -528, 950, -950, 1477, -1477},
|
||||||
|
{ 228, -228, 760, -760, 1368, -1368, 2128, -2128},
|
||||||
|
{ 316, -316, 1053, -1053, 1895, -1895, 2947, -2947},
|
||||||
|
{ 422, -422, 1405, -1405, 2529, -2529, 3934, -3934},
|
||||||
|
{ 548, -548, 1828, -1828, 3290, -3290, 5117, -5117},
|
||||||
|
{ 696, -696, 2320, -2320, 4176, -4176, 6496, -6496},
|
||||||
|
{ 868, -868, 2893, -2893, 5207, -5207, 8099, -8099},
|
||||||
|
{1064, -1064, 3548, -3548, 6386, -6386, 9933, -9933},
|
||||||
|
{1286, -1286, 4288, -4288, 7718, -7718, 12005, -12005},
|
||||||
|
{1536, -1536, 5120, -5120, 9216, -9216, 14336, -14336},
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
/* The Least Mean Squares Filter is the heart of QOA. It predicts the next
|
||||||
|
sample based on the previous 4 reconstructed samples. It does so by continuously
|
||||||
|
adjusting 4 weights based on the residual of the previous prediction.
|
||||||
|
|
||||||
|
The next sample is predicted as the sum of (weight[i] * history[i]).
|
||||||
|
|
||||||
|
The adjustment of the weights is done with a "Sign-Sign-LMS" that adds or
|
||||||
|
subtracts the residual to each weight, based on the corresponding sample from
|
||||||
|
the history. This, surprisingly, is sufficient to get worthwhile predictions.
|
||||||
|
|
||||||
|
This is all done with fixed point integers. Hence the right-shifts when updating
|
||||||
|
the weights and calculating the prediction. */
|
||||||
|
|
||||||
|
static int qoa_lms_predict(qoa_lms_t *lms) {
|
||||||
|
int prediction = 0;
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN; i++) {
|
||||||
|
prediction += lms->weights[i] * lms->history[i];
|
||||||
|
}
|
||||||
|
return prediction >> 13;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void qoa_lms_update(qoa_lms_t *lms, int sample, int residual) {
|
||||||
|
int delta = residual >> 4;
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN; i++) {
|
||||||
|
lms->weights[i] += lms->history[i] < 0 ? -delta : delta;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN-1; i++) {
|
||||||
|
lms->history[i] = lms->history[i+1];
|
||||||
|
}
|
||||||
|
lms->history[QOA_LMS_LEN-1] = sample;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* qoa_div() implements a rounding division, but avoids rounding to zero for
|
||||||
|
small numbers. E.g. 0.1 will be rounded to 1. Note that 0 itself still
|
||||||
|
returns as 0, which is handled in the qoa_quant_tab[].
|
||||||
|
qoa_div() takes an index into the .16 fixed point qoa_reciprocal_tab as an
|
||||||
|
argument, so it can do the division with a cheaper integer multiplication. */
|
||||||
|
|
||||||
|
static inline int qoa_div(int v, int scalefactor) {
|
||||||
|
int reciprocal = qoa_reciprocal_tab[scalefactor];
|
||||||
|
int n = (v * reciprocal + (1 << 15)) >> 16;
|
||||||
|
n = n + ((v > 0) - (v < 0)) - ((n > 0) - (n < 0)); /* round away from 0 */
|
||||||
|
return n;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline int qoa_clamp(int v, int min, int max) {
|
||||||
|
if (v < min) { return min; }
|
||||||
|
if (v > max) { return max; }
|
||||||
|
return v;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* This specialized clamp function for the signed 16 bit range improves decode
|
||||||
|
performance quite a bit. The extra if() statement works nicely with the CPUs
|
||||||
|
branch prediction as this branch is rarely taken. */
|
||||||
|
|
||||||
|
static inline int qoa_clamp_s16(int v) {
|
||||||
|
if ((unsigned int)(v + 32768) > 65535) {
|
||||||
|
if (v < -32768) { return -32768; }
|
||||||
|
if (v > 32767) { return 32767; }
|
||||||
|
}
|
||||||
|
return v;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline qoa_uint64_t qoa_read_u64(const unsigned char *bytes, unsigned int *p) {
|
||||||
|
bytes += *p;
|
||||||
|
*p += 8;
|
||||||
|
return
|
||||||
|
((qoa_uint64_t)(bytes[0]) << 56) | ((qoa_uint64_t)(bytes[1]) << 48) |
|
||||||
|
((qoa_uint64_t)(bytes[2]) << 40) | ((qoa_uint64_t)(bytes[3]) << 32) |
|
||||||
|
((qoa_uint64_t)(bytes[4]) << 24) | ((qoa_uint64_t)(bytes[5]) << 16) |
|
||||||
|
((qoa_uint64_t)(bytes[6]) << 8) | ((qoa_uint64_t)(bytes[7]) << 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline void qoa_write_u64(qoa_uint64_t v, unsigned char *bytes, unsigned int *p) {
|
||||||
|
bytes += *p;
|
||||||
|
*p += 8;
|
||||||
|
bytes[0] = (v >> 56) & 0xff;
|
||||||
|
bytes[1] = (v >> 48) & 0xff;
|
||||||
|
bytes[2] = (v >> 40) & 0xff;
|
||||||
|
bytes[3] = (v >> 32) & 0xff;
|
||||||
|
bytes[4] = (v >> 24) & 0xff;
|
||||||
|
bytes[5] = (v >> 16) & 0xff;
|
||||||
|
bytes[6] = (v >> 8) & 0xff;
|
||||||
|
bytes[7] = (v >> 0) & 0xff;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Encoder */
|
||||||
|
|
||||||
|
unsigned int qoa_encode_header(qoa_desc *qoa, unsigned char *bytes) {
|
||||||
|
unsigned int p = 0;
|
||||||
|
qoa_write_u64(((qoa_uint64_t)QOA_MAGIC << 32) | qoa->samples, bytes, &p);
|
||||||
|
return p;
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int qoa_encode_frame(const short *sample_data, qoa_desc *qoa, unsigned int frame_len, unsigned char *bytes) {
|
||||||
|
unsigned int channels = qoa->channels;
|
||||||
|
|
||||||
|
unsigned int p = 0;
|
||||||
|
unsigned int slices = (frame_len + QOA_SLICE_LEN - 1) / QOA_SLICE_LEN;
|
||||||
|
unsigned int frame_size = QOA_FRAME_SIZE(channels, slices);
|
||||||
|
int prev_scalefactor[QOA_MAX_CHANNELS] = {0};
|
||||||
|
|
||||||
|
/* Write the frame header */
|
||||||
|
qoa_write_u64((
|
||||||
|
(qoa_uint64_t)qoa->channels << 56 |
|
||||||
|
(qoa_uint64_t)qoa->samplerate << 32 |
|
||||||
|
(qoa_uint64_t)frame_len << 16 |
|
||||||
|
(qoa_uint64_t)frame_size
|
||||||
|
), bytes, &p);
|
||||||
|
|
||||||
|
|
||||||
|
for (int c = 0; c < channels; c++) {
|
||||||
|
/* If the weights have grown too large, reset them to 0. This may happen
|
||||||
|
with certain high-frequency sounds. This is a last resort and will
|
||||||
|
introduce quite a bit of noise, but should at least prevent pops/clicks */
|
||||||
|
int weights_sum =
|
||||||
|
qoa->lms[c].weights[0] * qoa->lms[c].weights[0] +
|
||||||
|
qoa->lms[c].weights[1] * qoa->lms[c].weights[1] +
|
||||||
|
qoa->lms[c].weights[2] * qoa->lms[c].weights[2] +
|
||||||
|
qoa->lms[c].weights[3] * qoa->lms[c].weights[3];
|
||||||
|
if (weights_sum > 0x2fffffff) {
|
||||||
|
qoa->lms[c].weights[0] = 0;
|
||||||
|
qoa->lms[c].weights[1] = 0;
|
||||||
|
qoa->lms[c].weights[2] = 0;
|
||||||
|
qoa->lms[c].weights[3] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Write the current LMS state */
|
||||||
|
qoa_uint64_t weights = 0;
|
||||||
|
qoa_uint64_t history = 0;
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN; i++) {
|
||||||
|
history = (history << 16) | (qoa->lms[c].history[i] & 0xffff);
|
||||||
|
weights = (weights << 16) | (qoa->lms[c].weights[i] & 0xffff);
|
||||||
|
}
|
||||||
|
qoa_write_u64(history, bytes, &p);
|
||||||
|
qoa_write_u64(weights, bytes, &p);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* We encode all samples with the channels interleaved on a slice level.
|
||||||
|
E.g. for stereo: (ch-0, slice 0), (ch 1, slice 0), (ch 0, slice 1), ...*/
|
||||||
|
for (int sample_index = 0; sample_index < frame_len; sample_index += QOA_SLICE_LEN) {
|
||||||
|
|
||||||
|
for (int c = 0; c < channels; c++) {
|
||||||
|
int slice_len = qoa_clamp(QOA_SLICE_LEN, 0, frame_len - sample_index);
|
||||||
|
int slice_start = sample_index * channels + c;
|
||||||
|
int slice_end = (sample_index + slice_len) * channels + c;
|
||||||
|
|
||||||
|
/* Brute for search for the best scalefactor. Just go through all
|
||||||
|
16 scalefactors, encode all samples for the current slice and
|
||||||
|
meassure the total squared error. */
|
||||||
|
qoa_uint64_t best_error = -1;
|
||||||
|
qoa_uint64_t best_slice;
|
||||||
|
qoa_lms_t best_lms;
|
||||||
|
int best_scalefactor;
|
||||||
|
|
||||||
|
for (int sfi = 0; sfi < 16; sfi++) {
|
||||||
|
/* There is a strong correlation between the scalefactors of
|
||||||
|
neighboring slices. As an optimization, start testing
|
||||||
|
the best scalefactor of the previous slice first. */
|
||||||
|
int scalefactor = (sfi + prev_scalefactor[c]) % 16;
|
||||||
|
|
||||||
|
/* We have to reset the LMS state to the last known good one
|
||||||
|
before trying each scalefactor, as each pass updates the LMS
|
||||||
|
state when encoding. */
|
||||||
|
qoa_lms_t lms = qoa->lms[c];
|
||||||
|
qoa_uint64_t slice = scalefactor;
|
||||||
|
qoa_uint64_t current_error = 0;
|
||||||
|
|
||||||
|
for (int si = slice_start; si < slice_end; si += channels) {
|
||||||
|
int sample = sample_data[si];
|
||||||
|
int predicted = qoa_lms_predict(&lms);
|
||||||
|
|
||||||
|
int residual = sample - predicted;
|
||||||
|
int scaled = qoa_div(residual, scalefactor);
|
||||||
|
int clamped = qoa_clamp(scaled, -8, 8);
|
||||||
|
int quantized = qoa_quant_tab[clamped + 8];
|
||||||
|
int dequantized = qoa_dequant_tab[scalefactor][quantized];
|
||||||
|
int reconstructed = qoa_clamp_s16(predicted + dequantized);
|
||||||
|
|
||||||
|
long long error = (sample - reconstructed);
|
||||||
|
current_error += error * error;
|
||||||
|
if (current_error > best_error) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
qoa_lms_update(&lms, reconstructed, dequantized);
|
||||||
|
slice = (slice << 3) | quantized;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (current_error < best_error) {
|
||||||
|
best_error = current_error;
|
||||||
|
best_slice = slice;
|
||||||
|
best_lms = lms;
|
||||||
|
best_scalefactor = scalefactor;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
prev_scalefactor[c] = best_scalefactor;
|
||||||
|
|
||||||
|
qoa->lms[c] = best_lms;
|
||||||
|
#ifdef QOA_RECORD_TOTAL_ERROR
|
||||||
|
qoa->error += best_error;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* If this slice was shorter than QOA_SLICE_LEN, we have to left-
|
||||||
|
shift all encoded data, to ensure the rightmost bits are the empty
|
||||||
|
ones. This should only happen in the last frame of a file as all
|
||||||
|
slices are completely filled otherwise. */
|
||||||
|
best_slice <<= (QOA_SLICE_LEN - slice_len) * 3;
|
||||||
|
qoa_write_u64(best_slice, bytes, &p);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return p;
|
||||||
|
}
|
||||||
|
|
||||||
|
void *qoa_encode(const short *sample_data, qoa_desc *qoa, unsigned int *out_len) {
|
||||||
|
if (
|
||||||
|
qoa->samples == 0 ||
|
||||||
|
qoa->samplerate == 0 || qoa->samplerate > 0xffffff ||
|
||||||
|
qoa->channels == 0 || qoa->channels > QOA_MAX_CHANNELS
|
||||||
|
) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Calculate the encoded size and allocate */
|
||||||
|
unsigned int num_frames = (qoa->samples + QOA_FRAME_LEN-1) / QOA_FRAME_LEN;
|
||||||
|
unsigned int num_slices = (qoa->samples + QOA_SLICE_LEN-1) / QOA_SLICE_LEN;
|
||||||
|
unsigned int encoded_size = 8 + /* 8 byte file header */
|
||||||
|
num_frames * 8 + /* 8 byte frame headers */
|
||||||
|
num_frames * QOA_LMS_LEN * 4 * qoa->channels + /* 4 * 4 bytes lms state per channel */
|
||||||
|
num_slices * 8 * qoa->channels; /* 8 byte slices */
|
||||||
|
|
||||||
|
unsigned char *bytes = QOA_MALLOC(encoded_size);
|
||||||
|
|
||||||
|
for (int c = 0; c < qoa->channels; c++) {
|
||||||
|
/* Set the initial LMS weights to {0, 0, -1, 2}. This helps with the
|
||||||
|
prediction of the first few ms of a file. */
|
||||||
|
qoa->lms[c].weights[0] = 0;
|
||||||
|
qoa->lms[c].weights[1] = 0;
|
||||||
|
qoa->lms[c].weights[2] = -(1<<13);
|
||||||
|
qoa->lms[c].weights[3] = (1<<14);
|
||||||
|
|
||||||
|
/* Explicitly set the history samples to 0, as we might have some
|
||||||
|
garbage in there. */
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN; i++) {
|
||||||
|
qoa->lms[c].history[i] = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Encode the header and go through all frames */
|
||||||
|
unsigned int p = qoa_encode_header(qoa, bytes);
|
||||||
|
#ifdef QOA_RECORD_TOTAL_ERROR
|
||||||
|
qoa->error = 0;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
int frame_len = QOA_FRAME_LEN;
|
||||||
|
for (int sample_index = 0; sample_index < qoa->samples; sample_index += frame_len) {
|
||||||
|
frame_len = qoa_clamp(QOA_FRAME_LEN, 0, qoa->samples - sample_index);
|
||||||
|
const short *frame_samples = sample_data + sample_index * qoa->channels;
|
||||||
|
unsigned int frame_size = qoa_encode_frame(frame_samples, qoa, frame_len, bytes + p);
|
||||||
|
p += frame_size;
|
||||||
|
}
|
||||||
|
|
||||||
|
*out_len = p;
|
||||||
|
return bytes;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Decoder */
|
||||||
|
|
||||||
|
unsigned int qoa_max_frame_size(qoa_desc *qoa) {
|
||||||
|
return QOA_FRAME_SIZE(qoa->channels, QOA_SLICES_PER_FRAME);
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int qoa_decode_header(const unsigned char *bytes, int size, qoa_desc *qoa) {
|
||||||
|
unsigned int p = 0;
|
||||||
|
if (size < QOA_MIN_FILESIZE) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Read the file header, verify the magic number ('qoaf') and read the
|
||||||
|
total number of samples. */
|
||||||
|
qoa_uint64_t file_header = qoa_read_u64(bytes, &p);
|
||||||
|
|
||||||
|
if ((file_header >> 32) != QOA_MAGIC) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
qoa->samples = file_header & 0xffffffff;
|
||||||
|
if (!qoa->samples) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Peek into the first frame header to get the number of channels and
|
||||||
|
the samplerate. */
|
||||||
|
qoa_uint64_t frame_header = qoa_read_u64(bytes, &p);
|
||||||
|
qoa->channels = (frame_header >> 56) & 0x0000ff;
|
||||||
|
qoa->samplerate = (frame_header >> 32) & 0xffffff;
|
||||||
|
|
||||||
|
if (qoa->channels == 0 || qoa->samples == 0 || qoa->samplerate == 0) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 8;
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int qoa_decode_frame(const unsigned char *bytes, unsigned int size, qoa_desc *qoa, short *sample_data, unsigned int *frame_len) {
|
||||||
|
unsigned int p = 0;
|
||||||
|
*frame_len = 0;
|
||||||
|
|
||||||
|
if (size < 8 + QOA_LMS_LEN * 4 * qoa->channels) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Read and verify the frame header */
|
||||||
|
qoa_uint64_t frame_header = qoa_read_u64(bytes, &p);
|
||||||
|
int channels = (frame_header >> 56) & 0x0000ff;
|
||||||
|
int samplerate = (frame_header >> 32) & 0xffffff;
|
||||||
|
int samples = (frame_header >> 16) & 0x00ffff;
|
||||||
|
int frame_size = (frame_header ) & 0x00ffff;
|
||||||
|
|
||||||
|
int data_size = frame_size - 8 - QOA_LMS_LEN * 4 * channels;
|
||||||
|
int num_slices = data_size / 8;
|
||||||
|
int max_total_samples = num_slices * QOA_SLICE_LEN;
|
||||||
|
|
||||||
|
if (
|
||||||
|
channels != qoa->channels ||
|
||||||
|
samplerate != qoa->samplerate ||
|
||||||
|
frame_size > size ||
|
||||||
|
samples * channels > max_total_samples
|
||||||
|
) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Read the LMS state: 4 x 2 bytes history, 4 x 2 bytes weights per channel */
|
||||||
|
for (int c = 0; c < channels; c++) {
|
||||||
|
qoa_uint64_t history = qoa_read_u64(bytes, &p);
|
||||||
|
qoa_uint64_t weights = qoa_read_u64(bytes, &p);
|
||||||
|
for (int i = 0; i < QOA_LMS_LEN; i++) {
|
||||||
|
qoa->lms[c].history[i] = ((signed short)(history >> 48));
|
||||||
|
history <<= 16;
|
||||||
|
qoa->lms[c].weights[i] = ((signed short)(weights >> 48));
|
||||||
|
weights <<= 16;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Decode all slices for all channels in this frame */
|
||||||
|
for (int sample_index = 0; sample_index < samples; sample_index += QOA_SLICE_LEN) {
|
||||||
|
for (int c = 0; c < channels; c++) {
|
||||||
|
qoa_uint64_t slice = qoa_read_u64(bytes, &p);
|
||||||
|
|
||||||
|
int scalefactor = (slice >> 60) & 0xf;
|
||||||
|
int slice_start = sample_index * channels + c;
|
||||||
|
int slice_end = qoa_clamp(sample_index + QOA_SLICE_LEN, 0, samples) * channels + c;
|
||||||
|
|
||||||
|
for (int si = slice_start; si < slice_end; si += channels) {
|
||||||
|
int predicted = qoa_lms_predict(&qoa->lms[c]);
|
||||||
|
int quantized = (slice >> 57) & 0x7;
|
||||||
|
int dequantized = qoa_dequant_tab[scalefactor][quantized];
|
||||||
|
int reconstructed = qoa_clamp_s16(predicted + dequantized);
|
||||||
|
|
||||||
|
sample_data[si] = reconstructed;
|
||||||
|
slice <<= 3;
|
||||||
|
|
||||||
|
qoa_lms_update(&qoa->lms[c], reconstructed, dequantized);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
*frame_len = samples;
|
||||||
|
return p;
|
||||||
|
}
|
||||||
|
|
||||||
|
short *qoa_decode(const unsigned char *bytes, int size, qoa_desc *qoa) {
|
||||||
|
unsigned int p = qoa_decode_header(bytes, size, qoa);
|
||||||
|
if (!p) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Calculate the required size of the sample buffer and allocate */
|
||||||
|
int total_samples = qoa->samples * qoa->channels;
|
||||||
|
short *sample_data = QOA_MALLOC(total_samples * sizeof(short));
|
||||||
|
|
||||||
|
unsigned int sample_index = 0;
|
||||||
|
unsigned int frame_len;
|
||||||
|
unsigned int frame_size;
|
||||||
|
|
||||||
|
/* Decode all frames */
|
||||||
|
do {
|
||||||
|
short *sample_ptr = sample_data + sample_index * qoa->channels;
|
||||||
|
frame_size = qoa_decode_frame(bytes + p, size - p, qoa, sample_ptr, &frame_len);
|
||||||
|
|
||||||
|
p += frame_size;
|
||||||
|
sample_index += frame_len;
|
||||||
|
} while (frame_size && sample_index < qoa->samples);
|
||||||
|
|
||||||
|
qoa->samples = sample_index;
|
||||||
|
return sample_data;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
File read/write convenience functions */
|
||||||
|
|
||||||
|
#ifndef QOA_NO_STDIO
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
int qoa_write(const char *filename, const short *sample_data, qoa_desc *qoa) {
|
||||||
|
FILE *f = fopen(filename, "wb");
|
||||||
|
unsigned int size;
|
||||||
|
void *encoded;
|
||||||
|
|
||||||
|
if (!f) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
encoded = qoa_encode(sample_data, qoa, &size);
|
||||||
|
if (!encoded) {
|
||||||
|
fclose(f);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
fwrite(encoded, 1, size, f);
|
||||||
|
fclose(f);
|
||||||
|
|
||||||
|
QOA_FREE(encoded);
|
||||||
|
return size;
|
||||||
|
}
|
||||||
|
|
||||||
|
void *qoa_read(const char *filename, qoa_desc *qoa) {
|
||||||
|
FILE *f = fopen(filename, "rb");
|
||||||
|
int size, bytes_read;
|
||||||
|
void *data;
|
||||||
|
short *sample_data;
|
||||||
|
|
||||||
|
if (!f) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
fseek(f, 0, SEEK_END);
|
||||||
|
size = ftell(f);
|
||||||
|
if (size <= 0) {
|
||||||
|
fclose(f);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
fseek(f, 0, SEEK_SET);
|
||||||
|
|
||||||
|
data = QOA_MALLOC(size);
|
||||||
|
if (!data) {
|
||||||
|
fclose(f);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
bytes_read = fread(data, 1, size, f);
|
||||||
|
fclose(f);
|
||||||
|
|
||||||
|
sample_data = qoa_decode(data, bytes_read, qoa);
|
||||||
|
QOA_FREE(data);
|
||||||
|
return sample_data;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* QOA_NO_STDIO */
|
||||||
|
#endif /* QOA_IMPLEMENTATION */
|
649
source/engine/qoi.h
Normal file
649
source/engine/qoi.h
Normal file
|
@ -0,0 +1,649 @@
|
||||||
|
/*
|
||||||
|
|
||||||
|
Copyright (c) 2021, Dominic Szablewski - https://phoboslab.org
|
||||||
|
SPDX-License-Identifier: MIT
|
||||||
|
|
||||||
|
|
||||||
|
QOI - The "Quite OK Image" format for fast, lossless image compression
|
||||||
|
|
||||||
|
-- About
|
||||||
|
|
||||||
|
QOI encodes and decodes images in a lossless format. Compared to stb_image and
|
||||||
|
stb_image_write QOI offers 20x-50x faster encoding, 3x-4x faster decoding and
|
||||||
|
20% better compression.
|
||||||
|
|
||||||
|
|
||||||
|
-- Synopsis
|
||||||
|
|
||||||
|
// Define `QOI_IMPLEMENTATION` in *one* C/C++ file before including this
|
||||||
|
// library to create the implementation.
|
||||||
|
|
||||||
|
#define QOI_IMPLEMENTATION
|
||||||
|
#include "qoi.h"
|
||||||
|
|
||||||
|
// Encode and store an RGBA buffer to the file system. The qoi_desc describes
|
||||||
|
// the input pixel data.
|
||||||
|
qoi_write("image_new.qoi", rgba_pixels, &(qoi_desc){
|
||||||
|
.width = 1920,
|
||||||
|
.height = 1080,
|
||||||
|
.channels = 4,
|
||||||
|
.colorspace = QOI_SRGB
|
||||||
|
});
|
||||||
|
|
||||||
|
// Load and decode a QOI image from the file system into a 32bbp RGBA buffer.
|
||||||
|
// The qoi_desc struct will be filled with the width, height, number of channels
|
||||||
|
// and colorspace read from the file header.
|
||||||
|
qoi_desc desc;
|
||||||
|
void *rgba_pixels = qoi_read("image.qoi", &desc, 4);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
-- Documentation
|
||||||
|
|
||||||
|
This library provides the following functions;
|
||||||
|
- qoi_read -- read and decode a QOI file
|
||||||
|
- qoi_decode -- decode the raw bytes of a QOI image from memory
|
||||||
|
- qoi_write -- encode and write a QOI file
|
||||||
|
- qoi_encode -- encode an rgba buffer into a QOI image in memory
|
||||||
|
|
||||||
|
See the function declaration below for the signature and more information.
|
||||||
|
|
||||||
|
If you don't want/need the qoi_read and qoi_write functions, you can define
|
||||||
|
QOI_NO_STDIO before including this library.
|
||||||
|
|
||||||
|
This library uses malloc() and free(). To supply your own malloc implementation
|
||||||
|
you can define QOI_MALLOC and QOI_FREE before including this library.
|
||||||
|
|
||||||
|
This library uses memset() to zero-initialize the index. To supply your own
|
||||||
|
implementation you can define QOI_ZEROARR before including this library.
|
||||||
|
|
||||||
|
|
||||||
|
-- Data Format
|
||||||
|
|
||||||
|
A QOI file has a 14 byte header, followed by any number of data "chunks" and an
|
||||||
|
8-byte end marker.
|
||||||
|
|
||||||
|
struct qoi_header_t {
|
||||||
|
char magic[4]; // magic bytes "qoif"
|
||||||
|
uint32_t width; // image width in pixels (BE)
|
||||||
|
uint32_t height; // image height in pixels (BE)
|
||||||
|
uint8_t channels; // 3 = RGB, 4 = RGBA
|
||||||
|
uint8_t colorspace; // 0 = sRGB with linear alpha, 1 = all channels linear
|
||||||
|
};
|
||||||
|
|
||||||
|
Images are encoded row by row, left to right, top to bottom. The decoder and
|
||||||
|
encoder start with {r: 0, g: 0, b: 0, a: 255} as the previous pixel value. An
|
||||||
|
image is complete when all pixels specified by width * height have been covered.
|
||||||
|
|
||||||
|
Pixels are encoded as
|
||||||
|
- a run of the previous pixel
|
||||||
|
- an index into an array of previously seen pixels
|
||||||
|
- a difference to the previous pixel value in r,g,b
|
||||||
|
- full r,g,b or r,g,b,a values
|
||||||
|
|
||||||
|
The color channels are assumed to not be premultiplied with the alpha channel
|
||||||
|
("un-premultiplied alpha").
|
||||||
|
|
||||||
|
A running array[64] (zero-initialized) of previously seen pixel values is
|
||||||
|
maintained by the encoder and decoder. Each pixel that is seen by the encoder
|
||||||
|
and decoder is put into this array at the position formed by a hash function of
|
||||||
|
the color value. In the encoder, if the pixel value at the index matches the
|
||||||
|
current pixel, this index position is written to the stream as QOI_OP_INDEX.
|
||||||
|
The hash function for the index is:
|
||||||
|
|
||||||
|
index_position = (r * 3 + g * 5 + b * 7 + a * 11) % 64
|
||||||
|
|
||||||
|
Each chunk starts with a 2- or 8-bit tag, followed by a number of data bits. The
|
||||||
|
bit length of chunks is divisible by 8 - i.e. all chunks are byte aligned. All
|
||||||
|
values encoded in these data bits have the most significant bit on the left.
|
||||||
|
|
||||||
|
The 8-bit tags have precedence over the 2-bit tags. A decoder must check for the
|
||||||
|
presence of an 8-bit tag first.
|
||||||
|
|
||||||
|
The byte stream's end is marked with 7 0x00 bytes followed a single 0x01 byte.
|
||||||
|
|
||||||
|
|
||||||
|
The possible chunks are:
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_INDEX ----------.
|
||||||
|
| Byte[0] |
|
||||||
|
| 7 6 5 4 3 2 1 0 |
|
||||||
|
|-------+-----------------|
|
||||||
|
| 0 0 | index |
|
||||||
|
`-------------------------`
|
||||||
|
2-bit tag b00
|
||||||
|
6-bit index into the color index array: 0..63
|
||||||
|
|
||||||
|
A valid encoder must not issue 2 or more consecutive QOI_OP_INDEX chunks to the
|
||||||
|
same index. QOI_OP_RUN should be used instead.
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_DIFF -----------.
|
||||||
|
| Byte[0] |
|
||||||
|
| 7 6 5 4 3 2 1 0 |
|
||||||
|
|-------+-----+-----+-----|
|
||||||
|
| 0 1 | dr | dg | db |
|
||||||
|
`-------------------------`
|
||||||
|
2-bit tag b01
|
||||||
|
2-bit red channel difference from the previous pixel between -2..1
|
||||||
|
2-bit green channel difference from the previous pixel between -2..1
|
||||||
|
2-bit blue channel difference from the previous pixel between -2..1
|
||||||
|
|
||||||
|
The difference to the current channel values are using a wraparound operation,
|
||||||
|
so "1 - 2" will result in 255, while "255 + 1" will result in 0.
|
||||||
|
|
||||||
|
Values are stored as unsigned integers with a bias of 2. E.g. -2 is stored as
|
||||||
|
0 (b00). 1 is stored as 3 (b11).
|
||||||
|
|
||||||
|
The alpha value remains unchanged from the previous pixel.
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_LUMA -------------------------------------.
|
||||||
|
| Byte[0] | Byte[1] |
|
||||||
|
| 7 6 5 4 3 2 1 0 | 7 6 5 4 3 2 1 0 |
|
||||||
|
|-------+-----------------+-------------+-----------|
|
||||||
|
| 1 0 | green diff | dr - dg | db - dg |
|
||||||
|
`---------------------------------------------------`
|
||||||
|
2-bit tag b10
|
||||||
|
6-bit green channel difference from the previous pixel -32..31
|
||||||
|
4-bit red channel difference minus green channel difference -8..7
|
||||||
|
4-bit blue channel difference minus green channel difference -8..7
|
||||||
|
|
||||||
|
The green channel is used to indicate the general direction of change and is
|
||||||
|
encoded in 6 bits. The red and blue channels (dr and db) base their diffs off
|
||||||
|
of the green channel difference and are encoded in 4 bits. I.e.:
|
||||||
|
dr_dg = (cur_px.r - prev_px.r) - (cur_px.g - prev_px.g)
|
||||||
|
db_dg = (cur_px.b - prev_px.b) - (cur_px.g - prev_px.g)
|
||||||
|
|
||||||
|
The difference to the current channel values are using a wraparound operation,
|
||||||
|
so "10 - 13" will result in 253, while "250 + 7" will result in 1.
|
||||||
|
|
||||||
|
Values are stored as unsigned integers with a bias of 32 for the green channel
|
||||||
|
and a bias of 8 for the red and blue channel.
|
||||||
|
|
||||||
|
The alpha value remains unchanged from the previous pixel.
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_RUN ------------.
|
||||||
|
| Byte[0] |
|
||||||
|
| 7 6 5 4 3 2 1 0 |
|
||||||
|
|-------+-----------------|
|
||||||
|
| 1 1 | run |
|
||||||
|
`-------------------------`
|
||||||
|
2-bit tag b11
|
||||||
|
6-bit run-length repeating the previous pixel: 1..62
|
||||||
|
|
||||||
|
The run-length is stored with a bias of -1. Note that the run-lengths 63 and 64
|
||||||
|
(b111110 and b111111) are illegal as they are occupied by the QOI_OP_RGB and
|
||||||
|
QOI_OP_RGBA tags.
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_RGB ------------------------------------------.
|
||||||
|
| Byte[0] | Byte[1] | Byte[2] | Byte[3] |
|
||||||
|
| 7 6 5 4 3 2 1 0 | 7 .. 0 | 7 .. 0 | 7 .. 0 |
|
||||||
|
|-------------------------+---------+---------+---------|
|
||||||
|
| 1 1 1 1 1 1 1 0 | red | green | blue |
|
||||||
|
`-------------------------------------------------------`
|
||||||
|
8-bit tag b11111110
|
||||||
|
8-bit red channel value
|
||||||
|
8-bit green channel value
|
||||||
|
8-bit blue channel value
|
||||||
|
|
||||||
|
The alpha value remains unchanged from the previous pixel.
|
||||||
|
|
||||||
|
|
||||||
|
.- QOI_OP_RGBA ---------------------------------------------------.
|
||||||
|
| Byte[0] | Byte[1] | Byte[2] | Byte[3] | Byte[4] |
|
||||||
|
| 7 6 5 4 3 2 1 0 | 7 .. 0 | 7 .. 0 | 7 .. 0 | 7 .. 0 |
|
||||||
|
|-------------------------+---------+---------+---------+---------|
|
||||||
|
| 1 1 1 1 1 1 1 1 | red | green | blue | alpha |
|
||||||
|
`-----------------------------------------------------------------`
|
||||||
|
8-bit tag b11111111
|
||||||
|
8-bit red channel value
|
||||||
|
8-bit green channel value
|
||||||
|
8-bit blue channel value
|
||||||
|
8-bit alpha channel value
|
||||||
|
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Header - Public functions */
|
||||||
|
|
||||||
|
#ifndef QOI_H
|
||||||
|
#define QOI_H
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* A pointer to a qoi_desc struct has to be supplied to all of qoi's functions.
|
||||||
|
It describes either the input format (for qoi_write and qoi_encode), or is
|
||||||
|
filled with the description read from the file header (for qoi_read and
|
||||||
|
qoi_decode).
|
||||||
|
|
||||||
|
The colorspace in this qoi_desc is an enum where
|
||||||
|
0 = sRGB, i.e. gamma scaled RGB channels and a linear alpha channel
|
||||||
|
1 = all channels are linear
|
||||||
|
You may use the constants QOI_SRGB or QOI_LINEAR. The colorspace is purely
|
||||||
|
informative. It will be saved to the file header, but does not affect
|
||||||
|
how chunks are en-/decoded. */
|
||||||
|
|
||||||
|
#define QOI_SRGB 0
|
||||||
|
#define QOI_LINEAR 1
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
unsigned int width;
|
||||||
|
unsigned int height;
|
||||||
|
unsigned char channels;
|
||||||
|
unsigned char colorspace;
|
||||||
|
} qoi_desc;
|
||||||
|
|
||||||
|
#ifndef QOI_NO_STDIO
|
||||||
|
|
||||||
|
/* Encode raw RGB or RGBA pixels into a QOI image and write it to the file
|
||||||
|
system. The qoi_desc struct must be filled with the image width, height,
|
||||||
|
number of channels (3 = RGB, 4 = RGBA) and the colorspace.
|
||||||
|
|
||||||
|
The function returns 0 on failure (invalid parameters, or fopen or malloc
|
||||||
|
failed) or the number of bytes written on success. */
|
||||||
|
|
||||||
|
int qoi_write(const char *filename, const void *data, const qoi_desc *desc);
|
||||||
|
|
||||||
|
|
||||||
|
/* Read and decode a QOI image from the file system. If channels is 0, the
|
||||||
|
number of channels from the file header is used. If channels is 3 or 4 the
|
||||||
|
output format will be forced into this number of channels.
|
||||||
|
|
||||||
|
The function either returns NULL on failure (invalid data, or malloc or fopen
|
||||||
|
failed) or a pointer to the decoded pixels. On success, the qoi_desc struct
|
||||||
|
will be filled with the description from the file header.
|
||||||
|
|
||||||
|
The returned pixel data should be free()d after use. */
|
||||||
|
|
||||||
|
void *qoi_read(const char *filename, qoi_desc *desc, int channels);
|
||||||
|
|
||||||
|
#endif /* QOI_NO_STDIO */
|
||||||
|
|
||||||
|
|
||||||
|
/* Encode raw RGB or RGBA pixels into a QOI image in memory.
|
||||||
|
|
||||||
|
The function either returns NULL on failure (invalid parameters or malloc
|
||||||
|
failed) or a pointer to the encoded data on success. On success the out_len
|
||||||
|
is set to the size in bytes of the encoded data.
|
||||||
|
|
||||||
|
The returned qoi data should be free()d after use. */
|
||||||
|
|
||||||
|
void *qoi_encode(const void *data, const qoi_desc *desc, int *out_len);
|
||||||
|
|
||||||
|
|
||||||
|
/* Decode a QOI image from memory.
|
||||||
|
|
||||||
|
The function either returns NULL on failure (invalid parameters or malloc
|
||||||
|
failed) or a pointer to the decoded pixels. On success, the qoi_desc struct
|
||||||
|
is filled with the description from the file header.
|
||||||
|
|
||||||
|
The returned pixel data should be free()d after use. */
|
||||||
|
|
||||||
|
void *qoi_decode(const void *data, int size, qoi_desc *desc, int channels);
|
||||||
|
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#endif /* QOI_H */
|
||||||
|
|
||||||
|
|
||||||
|
/* -----------------------------------------------------------------------------
|
||||||
|
Implementation */
|
||||||
|
|
||||||
|
#ifdef QOI_IMPLEMENTATION
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
#ifndef QOI_MALLOC
|
||||||
|
#define QOI_MALLOC(sz) malloc(sz)
|
||||||
|
#define QOI_FREE(p) free(p)
|
||||||
|
#endif
|
||||||
|
#ifndef QOI_ZEROARR
|
||||||
|
#define QOI_ZEROARR(a) memset((a),0,sizeof(a))
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define QOI_OP_INDEX 0x00 /* 00xxxxxx */
|
||||||
|
#define QOI_OP_DIFF 0x40 /* 01xxxxxx */
|
||||||
|
#define QOI_OP_LUMA 0x80 /* 10xxxxxx */
|
||||||
|
#define QOI_OP_RUN 0xc0 /* 11xxxxxx */
|
||||||
|
#define QOI_OP_RGB 0xfe /* 11111110 */
|
||||||
|
#define QOI_OP_RGBA 0xff /* 11111111 */
|
||||||
|
|
||||||
|
#define QOI_MASK_2 0xc0 /* 11000000 */
|
||||||
|
|
||||||
|
#define QOI_COLOR_HASH(C) (C.rgba.r*3 + C.rgba.g*5 + C.rgba.b*7 + C.rgba.a*11)
|
||||||
|
#define QOI_MAGIC \
|
||||||
|
(((unsigned int)'q') << 24 | ((unsigned int)'o') << 16 | \
|
||||||
|
((unsigned int)'i') << 8 | ((unsigned int)'f'))
|
||||||
|
#define QOI_HEADER_SIZE 14
|
||||||
|
|
||||||
|
/* 2GB is the max file size that this implementation can safely handle. We guard
|
||||||
|
against anything larger than that, assuming the worst case with 5 bytes per
|
||||||
|
pixel, rounded down to a nice clean value. 400 million pixels ought to be
|
||||||
|
enough for anybody. */
|
||||||
|
#define QOI_PIXELS_MAX ((unsigned int)400000000)
|
||||||
|
|
||||||
|
typedef union {
|
||||||
|
struct { unsigned char r, g, b, a; } rgba;
|
||||||
|
unsigned int v;
|
||||||
|
} qoi_rgba_t;
|
||||||
|
|
||||||
|
static const unsigned char qoi_padding[8] = {0,0,0,0,0,0,0,1};
|
||||||
|
|
||||||
|
static void qoi_write_32(unsigned char *bytes, int *p, unsigned int v) {
|
||||||
|
bytes[(*p)++] = (0xff000000 & v) >> 24;
|
||||||
|
bytes[(*p)++] = (0x00ff0000 & v) >> 16;
|
||||||
|
bytes[(*p)++] = (0x0000ff00 & v) >> 8;
|
||||||
|
bytes[(*p)++] = (0x000000ff & v);
|
||||||
|
}
|
||||||
|
|
||||||
|
static unsigned int qoi_read_32(const unsigned char *bytes, int *p) {
|
||||||
|
unsigned int a = bytes[(*p)++];
|
||||||
|
unsigned int b = bytes[(*p)++];
|
||||||
|
unsigned int c = bytes[(*p)++];
|
||||||
|
unsigned int d = bytes[(*p)++];
|
||||||
|
return a << 24 | b << 16 | c << 8 | d;
|
||||||
|
}
|
||||||
|
|
||||||
|
void *qoi_encode(const void *data, const qoi_desc *desc, int *out_len) {
|
||||||
|
int i, max_size, p, run;
|
||||||
|
int px_len, px_end, px_pos, channels;
|
||||||
|
unsigned char *bytes;
|
||||||
|
const unsigned char *pixels;
|
||||||
|
qoi_rgba_t index[64];
|
||||||
|
qoi_rgba_t px, px_prev;
|
||||||
|
|
||||||
|
if (
|
||||||
|
data == NULL || out_len == NULL || desc == NULL ||
|
||||||
|
desc->width == 0 || desc->height == 0 ||
|
||||||
|
desc->channels < 3 || desc->channels > 4 ||
|
||||||
|
desc->colorspace > 1 ||
|
||||||
|
desc->height >= QOI_PIXELS_MAX / desc->width
|
||||||
|
) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
max_size =
|
||||||
|
desc->width * desc->height * (desc->channels + 1) +
|
||||||
|
QOI_HEADER_SIZE + sizeof(qoi_padding);
|
||||||
|
|
||||||
|
p = 0;
|
||||||
|
bytes = (unsigned char *) QOI_MALLOC(max_size);
|
||||||
|
if (!bytes) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
qoi_write_32(bytes, &p, QOI_MAGIC);
|
||||||
|
qoi_write_32(bytes, &p, desc->width);
|
||||||
|
qoi_write_32(bytes, &p, desc->height);
|
||||||
|
bytes[p++] = desc->channels;
|
||||||
|
bytes[p++] = desc->colorspace;
|
||||||
|
|
||||||
|
|
||||||
|
pixels = (const unsigned char *)data;
|
||||||
|
|
||||||
|
QOI_ZEROARR(index);
|
||||||
|
|
||||||
|
run = 0;
|
||||||
|
px_prev.rgba.r = 0;
|
||||||
|
px_prev.rgba.g = 0;
|
||||||
|
px_prev.rgba.b = 0;
|
||||||
|
px_prev.rgba.a = 255;
|
||||||
|
px = px_prev;
|
||||||
|
|
||||||
|
px_len = desc->width * desc->height * desc->channels;
|
||||||
|
px_end = px_len - desc->channels;
|
||||||
|
channels = desc->channels;
|
||||||
|
|
||||||
|
for (px_pos = 0; px_pos < px_len; px_pos += channels) {
|
||||||
|
px.rgba.r = pixels[px_pos + 0];
|
||||||
|
px.rgba.g = pixels[px_pos + 1];
|
||||||
|
px.rgba.b = pixels[px_pos + 2];
|
||||||
|
|
||||||
|
if (channels == 4) {
|
||||||
|
px.rgba.a = pixels[px_pos + 3];
|
||||||
|
}
|
||||||
|
|
||||||
|
if (px.v == px_prev.v) {
|
||||||
|
run++;
|
||||||
|
if (run == 62 || px_pos == px_end) {
|
||||||
|
bytes[p++] = QOI_OP_RUN | (run - 1);
|
||||||
|
run = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
int index_pos;
|
||||||
|
|
||||||
|
if (run > 0) {
|
||||||
|
bytes[p++] = QOI_OP_RUN | (run - 1);
|
||||||
|
run = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
index_pos = QOI_COLOR_HASH(px) % 64;
|
||||||
|
|
||||||
|
if (index[index_pos].v == px.v) {
|
||||||
|
bytes[p++] = QOI_OP_INDEX | index_pos;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
index[index_pos] = px;
|
||||||
|
|
||||||
|
if (px.rgba.a == px_prev.rgba.a) {
|
||||||
|
signed char vr = px.rgba.r - px_prev.rgba.r;
|
||||||
|
signed char vg = px.rgba.g - px_prev.rgba.g;
|
||||||
|
signed char vb = px.rgba.b - px_prev.rgba.b;
|
||||||
|
|
||||||
|
signed char vg_r = vr - vg;
|
||||||
|
signed char vg_b = vb - vg;
|
||||||
|
|
||||||
|
if (
|
||||||
|
vr > -3 && vr < 2 &&
|
||||||
|
vg > -3 && vg < 2 &&
|
||||||
|
vb > -3 && vb < 2
|
||||||
|
) {
|
||||||
|
bytes[p++] = QOI_OP_DIFF | (vr + 2) << 4 | (vg + 2) << 2 | (vb + 2);
|
||||||
|
}
|
||||||
|
else if (
|
||||||
|
vg_r > -9 && vg_r < 8 &&
|
||||||
|
vg > -33 && vg < 32 &&
|
||||||
|
vg_b > -9 && vg_b < 8
|
||||||
|
) {
|
||||||
|
bytes[p++] = QOI_OP_LUMA | (vg + 32);
|
||||||
|
bytes[p++] = (vg_r + 8) << 4 | (vg_b + 8);
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
bytes[p++] = QOI_OP_RGB;
|
||||||
|
bytes[p++] = px.rgba.r;
|
||||||
|
bytes[p++] = px.rgba.g;
|
||||||
|
bytes[p++] = px.rgba.b;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
bytes[p++] = QOI_OP_RGBA;
|
||||||
|
bytes[p++] = px.rgba.r;
|
||||||
|
bytes[p++] = px.rgba.g;
|
||||||
|
bytes[p++] = px.rgba.b;
|
||||||
|
bytes[p++] = px.rgba.a;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
px_prev = px;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < (int)sizeof(qoi_padding); i++) {
|
||||||
|
bytes[p++] = qoi_padding[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
*out_len = p;
|
||||||
|
return bytes;
|
||||||
|
}
|
||||||
|
|
||||||
|
void *qoi_decode(const void *data, int size, qoi_desc *desc, int channels) {
|
||||||
|
const unsigned char *bytes;
|
||||||
|
unsigned int header_magic;
|
||||||
|
unsigned char *pixels;
|
||||||
|
qoi_rgba_t index[64];
|
||||||
|
qoi_rgba_t px;
|
||||||
|
int px_len, chunks_len, px_pos;
|
||||||
|
int p = 0, run = 0;
|
||||||
|
|
||||||
|
if (
|
||||||
|
data == NULL || desc == NULL ||
|
||||||
|
(channels != 0 && channels != 3 && channels != 4) ||
|
||||||
|
size < QOI_HEADER_SIZE + (int)sizeof(qoi_padding)
|
||||||
|
) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
bytes = (const unsigned char *)data;
|
||||||
|
|
||||||
|
header_magic = qoi_read_32(bytes, &p);
|
||||||
|
desc->width = qoi_read_32(bytes, &p);
|
||||||
|
desc->height = qoi_read_32(bytes, &p);
|
||||||
|
desc->channels = bytes[p++];
|
||||||
|
desc->colorspace = bytes[p++];
|
||||||
|
|
||||||
|
if (
|
||||||
|
desc->width == 0 || desc->height == 0 ||
|
||||||
|
desc->channels < 3 || desc->channels > 4 ||
|
||||||
|
desc->colorspace > 1 ||
|
||||||
|
header_magic != QOI_MAGIC ||
|
||||||
|
desc->height >= QOI_PIXELS_MAX / desc->width
|
||||||
|
) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (channels == 0) {
|
||||||
|
channels = desc->channels;
|
||||||
|
}
|
||||||
|
|
||||||
|
px_len = desc->width * desc->height * channels;
|
||||||
|
pixels = (unsigned char *) QOI_MALLOC(px_len);
|
||||||
|
if (!pixels) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
QOI_ZEROARR(index);
|
||||||
|
px.rgba.r = 0;
|
||||||
|
px.rgba.g = 0;
|
||||||
|
px.rgba.b = 0;
|
||||||
|
px.rgba.a = 255;
|
||||||
|
|
||||||
|
chunks_len = size - (int)sizeof(qoi_padding);
|
||||||
|
for (px_pos = 0; px_pos < px_len; px_pos += channels) {
|
||||||
|
if (run > 0) {
|
||||||
|
run--;
|
||||||
|
}
|
||||||
|
else if (p < chunks_len) {
|
||||||
|
int b1 = bytes[p++];
|
||||||
|
|
||||||
|
if (b1 == QOI_OP_RGB) {
|
||||||
|
px.rgba.r = bytes[p++];
|
||||||
|
px.rgba.g = bytes[p++];
|
||||||
|
px.rgba.b = bytes[p++];
|
||||||
|
}
|
||||||
|
else if (b1 == QOI_OP_RGBA) {
|
||||||
|
px.rgba.r = bytes[p++];
|
||||||
|
px.rgba.g = bytes[p++];
|
||||||
|
px.rgba.b = bytes[p++];
|
||||||
|
px.rgba.a = bytes[p++];
|
||||||
|
}
|
||||||
|
else if ((b1 & QOI_MASK_2) == QOI_OP_INDEX) {
|
||||||
|
px = index[b1];
|
||||||
|
}
|
||||||
|
else if ((b1 & QOI_MASK_2) == QOI_OP_DIFF) {
|
||||||
|
px.rgba.r += ((b1 >> 4) & 0x03) - 2;
|
||||||
|
px.rgba.g += ((b1 >> 2) & 0x03) - 2;
|
||||||
|
px.rgba.b += ( b1 & 0x03) - 2;
|
||||||
|
}
|
||||||
|
else if ((b1 & QOI_MASK_2) == QOI_OP_LUMA) {
|
||||||
|
int b2 = bytes[p++];
|
||||||
|
int vg = (b1 & 0x3f) - 32;
|
||||||
|
px.rgba.r += vg - 8 + ((b2 >> 4) & 0x0f);
|
||||||
|
px.rgba.g += vg;
|
||||||
|
px.rgba.b += vg - 8 + (b2 & 0x0f);
|
||||||
|
}
|
||||||
|
else if ((b1 & QOI_MASK_2) == QOI_OP_RUN) {
|
||||||
|
run = (b1 & 0x3f);
|
||||||
|
}
|
||||||
|
|
||||||
|
index[QOI_COLOR_HASH(px) % 64] = px;
|
||||||
|
}
|
||||||
|
|
||||||
|
pixels[px_pos + 0] = px.rgba.r;
|
||||||
|
pixels[px_pos + 1] = px.rgba.g;
|
||||||
|
pixels[px_pos + 2] = px.rgba.b;
|
||||||
|
|
||||||
|
if (channels == 4) {
|
||||||
|
pixels[px_pos + 3] = px.rgba.a;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return pixels;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifndef QOI_NO_STDIO
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
int qoi_write(const char *filename, const void *data, const qoi_desc *desc) {
|
||||||
|
FILE *f = fopen(filename, "wb");
|
||||||
|
int size, err;
|
||||||
|
void *encoded;
|
||||||
|
|
||||||
|
if (!f) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
encoded = qoi_encode(data, desc, &size);
|
||||||
|
if (!encoded) {
|
||||||
|
fclose(f);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
fwrite(encoded, 1, size, f);
|
||||||
|
fflush(f);
|
||||||
|
err = ferror(f);
|
||||||
|
fclose(f);
|
||||||
|
|
||||||
|
QOI_FREE(encoded);
|
||||||
|
return err ? 0 : size;
|
||||||
|
}
|
||||||
|
|
||||||
|
void *qoi_read(const char *filename, qoi_desc *desc, int channels) {
|
||||||
|
FILE *f = fopen(filename, "rb");
|
||||||
|
int size, bytes_read;
|
||||||
|
void *pixels, *data;
|
||||||
|
|
||||||
|
if (!f) {
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
fseek(f, 0, SEEK_END);
|
||||||
|
size = ftell(f);
|
||||||
|
if (size <= 0 || fseek(f, 0, SEEK_SET) != 0) {
|
||||||
|
fclose(f);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
data = QOI_MALLOC(size);
|
||||||
|
if (!data) {
|
||||||
|
fclose(f);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
bytes_read = fread(data, 1, size, f);
|
||||||
|
fclose(f);
|
||||||
|
pixels = (bytes_read != size) ? NULL : qoi_decode(data, bytes_read, desc, channels);
|
||||||
|
QOI_FREE(data);
|
||||||
|
return pixels;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif /* QOI_NO_STDIO */
|
||||||
|
#endif /* QOI_IMPLEMENTATION */
|
|
@ -33,6 +33,9 @@
|
||||||
#define DR_MP3_IMPLEMENTATION
|
#define DR_MP3_IMPLEMENTATION
|
||||||
#include "dr_mp3.h"
|
#include "dr_mp3.h"
|
||||||
|
|
||||||
|
#define QOA_IMPLEMENTATION
|
||||||
|
#include "qoa.h"
|
||||||
|
|
||||||
static struct {
|
static struct {
|
||||||
char *key;
|
char *key;
|
||||||
struct wav *value;
|
struct wav *value;
|
||||||
|
@ -141,17 +144,34 @@ struct wav *make_sound(const char *wav) {
|
||||||
mwav.data = drwav_open_file_and_read_pcm_frames_f32(wav, &mwav.ch, &mwav.samplerate, &mwav.frames, NULL);
|
mwav.data = drwav_open_file_and_read_pcm_frames_f32(wav, &mwav.ch, &mwav.samplerate, &mwav.frames, NULL);
|
||||||
} else if (!strcmp(ext, "flac")) {
|
} else if (!strcmp(ext, "flac")) {
|
||||||
mwav.data = drflac_open_file_and_read_pcm_frames_f32(wav, &mwav.ch, &mwav.samplerate, &mwav.frames, NULL);
|
mwav.data = drflac_open_file_and_read_pcm_frames_f32(wav, &mwav.ch, &mwav.samplerate, &mwav.frames, NULL);
|
||||||
YughWarn("Flac opened with %d ch, %d samplerate", mwav.ch, mwav.samplerate);
|
|
||||||
} else if (!strcmp(ext, "mp3")) {
|
} else if (!strcmp(ext, "mp3")) {
|
||||||
drmp3_config cnf;
|
drmp3_config cnf;
|
||||||
mwav.data = drmp3_open_file_and_read_pcm_frames_f32(wav, &cnf, &mwav.frames, NULL);
|
mwav.data = drmp3_open_file_and_read_pcm_frames_f32(wav, &cnf, &mwav.frames, NULL);
|
||||||
mwav.ch = cnf.channels;
|
mwav.ch = cnf.channels;
|
||||||
mwav.samplerate = cnf.sampleRate;
|
mwav.samplerate = cnf.sampleRate;
|
||||||
|
} else if (!strcmp(ext, "qoa")) {
|
||||||
|
unsigned char header[QOA_MIN_FILESIZE];
|
||||||
|
FILE *f = fopen(wav, "rb");
|
||||||
|
fread(header, QOA_MIN_FILESIZE, 1, f);
|
||||||
|
qoa_desc qoa;
|
||||||
|
unsigned int ff_pos = qoa_decode_header(header, QOA_MIN_FILESIZE, &qoa);
|
||||||
|
mwav.ch = qoa.channels;
|
||||||
|
mwav.samplerate = qoa.samplerate;
|
||||||
|
mwav.frames = qoa.samples;
|
||||||
|
|
||||||
|
short *qoa_data = qoa_read(wav, &qoa);
|
||||||
|
mwav.data = malloc(sizeof(soundbyte) * mwav.frames * mwav.ch);
|
||||||
|
src_short_to_float_array(qoa_data, mwav.data, mwav.frames*mwav.ch);
|
||||||
|
|
||||||
|
fclose(f);
|
||||||
|
free(qoa_data);
|
||||||
} else {
|
} else {
|
||||||
YughWarn("Cannot process file type '%s'.", ext);
|
YughWarn("Cannot process file type '%s'.", ext);
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
YughWarn("%s opened with %d ch, %d samplerate, %d frames", ext, mwav.ch, mwav.samplerate, mwav.frames);
|
||||||
|
|
||||||
if (mwav.samplerate != SAMPLERATE) {
|
if (mwav.samplerate != SAMPLERATE) {
|
||||||
YughWarn("Changing samplerate of %s from %d to %d.", wav, mwav.samplerate, SAMPLERATE);
|
YughWarn("Changing samplerate of %s from %d to %d.", wav, mwav.samplerate, SAMPLERATE);
|
||||||
mwav = change_samplerate(mwav, SAMPLERATE);
|
mwav = change_samplerate(mwav, SAMPLERATE);
|
||||||
|
|
|
@ -1,7 +1,7 @@
|
||||||
#ifndef DSP_H
|
#ifndef DSP_H
|
||||||
#define DSP_H
|
#define DSP_H
|
||||||
|
|
||||||
#define SAMPLERATE 48000
|
#define SAMPLERATE 44100
|
||||||
#define BUF_FRAMES 128 /* At 48k, 128 needed for 240fps consistency */
|
#define BUF_FRAMES 128 /* At 48k, 128 needed for 240fps consistency */
|
||||||
#define CHANNELS 2
|
#define CHANNELS 2
|
||||||
|
|
||||||
|
|
|
@ -11,6 +11,9 @@
|
||||||
#include "stb_image_resize.h"
|
#include "stb_image_resize.h"
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
|
||||||
|
#define QOI_IMPLEMENTATION
|
||||||
|
#include "qoi.h"
|
||||||
|
|
||||||
struct glrect ST_UNIT = {0.f, 1.f, 0.f, 1.f};
|
struct glrect ST_UNIT = {0.f, 1.f, 0.f, 1.f};
|
||||||
|
|
||||||
static struct {
|
static struct {
|
||||||
|
@ -72,6 +75,8 @@ struct Texture *texture_pullfromfile(const char *path) {
|
||||||
return texhash[index].value;
|
return texhash[index].value;
|
||||||
|
|
||||||
YughInfo("Loading texture %s.", path);
|
YughInfo("Loading texture %s.", path);
|
||||||
|
|
||||||
|
|
||||||
struct Texture *tex = calloc(1, sizeof(*tex));
|
struct Texture *tex = calloc(1, sizeof(*tex));
|
||||||
tex->opts.sprite = 1;
|
tex->opts.sprite = 1;
|
||||||
tex->opts.mips = 0;
|
tex->opts.mips = 0;
|
||||||
|
@ -80,7 +85,20 @@ struct Texture *texture_pullfromfile(const char *path) {
|
||||||
tex->opts.wrapy = 1;
|
tex->opts.wrapy = 1;
|
||||||
|
|
||||||
int n;
|
int n;
|
||||||
unsigned char *data = stbi_load(path, &tex->width, &tex->height, &n, 4);
|
|
||||||
|
unsigned char *data;
|
||||||
|
|
||||||
|
char *ext = strrchr(path, '.')+1;
|
||||||
|
|
||||||
|
if (!strcmp(ext, "qoi")) {
|
||||||
|
qoi_desc qoi;
|
||||||
|
data = qoi_read(path, &qoi, 4);
|
||||||
|
tex->width = qoi.width;
|
||||||
|
tex->height = qoi.height;
|
||||||
|
n = qoi.channels;
|
||||||
|
} else {
|
||||||
|
data = stbi_load(path, &tex->width, &tex->height, &n, 4);
|
||||||
|
}
|
||||||
|
|
||||||
if (data == NULL) {
|
if (data == NULL) {
|
||||||
YughError("STBI failed to load file %s with message: %s\nOpening default instead.", path, stbi_failure_reason());
|
YughError("STBI failed to load file %s with message: %s\nOpening default instead.", path, stbi_failure_reason());
|
||||||
|
|
|
@ -426,7 +426,7 @@ void
|
||||||
src_short_to_float_array (const short *in, float *out, int len)
|
src_short_to_float_array (const short *in, float *out, int len)
|
||||||
{
|
{
|
||||||
for (int i = 0 ; i < len ; i++)
|
for (int i = 0 ; i < len ; i++)
|
||||||
{ out [i] = (float) (in [i] / (1.0 * 0x8000)) ;
|
{ out [i] = (float) (in [i] / ((float)0x8000)) ;
|
||||||
} ;
|
} ;
|
||||||
|
|
||||||
return ;
|
return ;
|
||||||
|
|
|
@ -13,6 +13,9 @@
|
||||||
|
|
||||||
#include "stb_ds.h"
|
#include "stb_ds.h"
|
||||||
|
|
||||||
|
#include "sokol/sokol_app.h"
|
||||||
|
#include "stb_image_resize.h"
|
||||||
|
|
||||||
struct window mainwin;
|
struct window mainwin;
|
||||||
|
|
||||||
static struct window *windows = NULL;
|
static struct window *windows = NULL;
|
||||||
|
@ -70,8 +73,33 @@ void window_togglefullscreen(struct window *w) {
|
||||||
mainwin.fullscreen = sapp_is_fullscreen();
|
mainwin.fullscreen = sapp_is_fullscreen();
|
||||||
}
|
}
|
||||||
|
|
||||||
void window_seticon(struct window *w, struct Texture *icon) {
|
void window_seticon(struct window *w, struct Texture *tex)
|
||||||
|
{
|
||||||
|
struct isize {
|
||||||
|
int size;
|
||||||
|
unsigned char *data;
|
||||||
|
};
|
||||||
|
struct isize sizes[3];
|
||||||
|
sizes[0].size = 16;
|
||||||
|
sizes[1].size = 32;
|
||||||
|
sizes[2].size = 64;
|
||||||
|
|
||||||
|
for (int i = 0; i < 3; i++) {
|
||||||
|
sizes[i].data = malloc(4*sizes[i].size*sizes[i].size);
|
||||||
|
stbir_resize_uint8(tex->data, tex->width, tex->height, 0, sizes[i].data, sizes[i].size, sizes[i].size, 0, 4);
|
||||||
|
}
|
||||||
|
|
||||||
|
sapp_icon_desc idsc = {
|
||||||
|
.images = {
|
||||||
|
{ .width = sizes[0].size, .height = sizes[0].size, .pixels = { .ptr=sizes[0].data, .size=4*sizes[0].size*sizes[0].size } },
|
||||||
|
{ .width = sizes[1].size, .height = sizes[1].size, .pixels = { .ptr=sizes[1].data, .size=4*sizes[1].size*sizes[1].size } },
|
||||||
|
{ .width = sizes[2].size, .height = sizes[2].size, .pixels = { .ptr=sizes[2].data, .size=4*sizes[2].size*sizes[2].size } },
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
sapp_set_icon(&idsc);
|
||||||
|
for (int i = 0; i < 3; i++)
|
||||||
|
free(sizes[i].data);
|
||||||
}
|
}
|
||||||
|
|
||||||
void window_render(struct window *w) {
|
void window_render(struct window *w) {
|
||||||
|
|
|
@ -1,7 +1,6 @@
|
||||||
#include "yugine.h"
|
#include "yugine.h"
|
||||||
|
|
||||||
#include "camera.h"
|
#include "camera.h"
|
||||||
#include "engine.h"
|
|
||||||
#include "font.h"
|
#include "font.h"
|
||||||
#include "gameobject.h"
|
#include "gameobject.h"
|
||||||
#include "input.h"
|
#include "input.h"
|
||||||
|
@ -39,6 +38,23 @@
|
||||||
#include "sokol/sokol_app.h"
|
#include "sokol/sokol_app.h"
|
||||||
#include "sokol/sokol_audio.h"
|
#include "sokol/sokol_audio.h"
|
||||||
|
|
||||||
|
#define STB_DS_IMPLEMENTATION
|
||||||
|
#include <stb_ds.h>
|
||||||
|
|
||||||
|
#define STB_TRUETYPE_IMPLEMENTATION
|
||||||
|
#include <stb_truetype.h>
|
||||||
|
|
||||||
|
#define STB_IMAGE_IMPLEMENTATION
|
||||||
|
#define STBI_FAILURE_USERMSG
|
||||||
|
#include "stb_image.h"
|
||||||
|
|
||||||
|
#define STB_IMAGE_WRITE_IMPLEMENTATION
|
||||||
|
#include "stb_image_write.h"
|
||||||
|
|
||||||
|
#define PL_MPEG_IMPLEMENTATION
|
||||||
|
#include <pl_mpeg.h>
|
||||||
|
|
||||||
|
|
||||||
int physOn = 0;
|
int physOn = 0;
|
||||||
|
|
||||||
double renderlag = 0;
|
double renderlag = 0;
|
||||||
|
@ -117,15 +133,12 @@ const char *engine_info()
|
||||||
return str;
|
return str;
|
||||||
}
|
}
|
||||||
|
|
||||||
void sg_logging(const char *tag, uint32_t lvl, uint32_t id, const char *msg, uint32_t line, const char *file, void *data) {
|
|
||||||
mYughLog(0, 1, line, file, "tag: %s, msg: %s", tag, msg);
|
|
||||||
}
|
|
||||||
|
|
||||||
static int argc;
|
static int argc;
|
||||||
static char **args;
|
static char **args;
|
||||||
|
|
||||||
void c_init() {
|
void c_init() {
|
||||||
int logout = 0;
|
int logout = 0;
|
||||||
#if DBG
|
#if DBG
|
||||||
if (logout) {
|
if (logout) {
|
||||||
time_t now = time(NULL);
|
time_t now = time(NULL);
|
||||||
|
@ -150,8 +163,12 @@ int logout = 0;
|
||||||
signal(SIGBUS, seghandle);
|
signal(SIGBUS, seghandle);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
resources_init();
|
||||||
engine_init();
|
phys2d_init();
|
||||||
|
sound_init();
|
||||||
|
script_init();
|
||||||
|
input_init();
|
||||||
|
openglInit();
|
||||||
|
|
||||||
int argsize = 0;
|
int argsize = 0;
|
||||||
for (int i = 1; i < argc; i++) {
|
for (int i = 1; i < argc; i++) {
|
||||||
|
@ -168,23 +185,6 @@ int logout = 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
script_evalf("cmd_args('%s');", cmdstr);
|
script_evalf("cmd_args('%s');", cmdstr);
|
||||||
|
|
||||||
|
|
||||||
mainwin.width = sapp_width();
|
|
||||||
mainwin.height = sapp_height();
|
|
||||||
|
|
||||||
sg_setup(&(sg_desc){
|
|
||||||
.logger = {
|
|
||||||
.func = sg_logging,
|
|
||||||
.user_data = NULL,
|
|
||||||
},
|
|
||||||
|
|
||||||
.buffer_pool_size = 1024,
|
|
||||||
.context.sample_count = 1,
|
|
||||||
});
|
|
||||||
|
|
||||||
input_init();
|
|
||||||
openglInit();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
int frame_fps() {
|
int frame_fps() {
|
||||||
|
|
|
@ -16,6 +16,8 @@ const char *engine_info();
|
||||||
int frame_fps();
|
int frame_fps();
|
||||||
|
|
||||||
extern double appTime;
|
extern double appTime;
|
||||||
|
extern double renderMS;
|
||||||
|
extern double physMS;
|
||||||
|
extern double updateMS;
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
Loading…
Reference in a new issue