├── .gitignore ├── showcqt.wasm ├── showcqt-simd.wasm ├── .github └── FUNDING.yml ├── showcqt.mjs ├── package.json ├── Makefile ├── benchmark.html ├── test ├── single-benchmark.mjs └── benchmark.mjs ├── showcqt.h ├── Readme.md ├── showcqt-main.mjs ├── COPYING.LESSER ├── showcqt-ref.mjs ├── showcqt.c └── COPYING /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | -------------------------------------------------------------------------------- /showcqt.wasm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mfcc64/showcqt-js/HEAD/showcqt.wasm -------------------------------------------------------------------------------- /showcqt-simd.wasm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mfcc64/showcqt-js/HEAD/showcqt-simd.wasm -------------------------------------------------------------------------------- /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | github: mfcc64 2 | custom: [ "https://paypal.me/mfcc64", "https://saweria.co/mfcc64" ] 3 | -------------------------------------------------------------------------------- /showcqt.mjs: -------------------------------------------------------------------------------- 1 | // CDN entry point 2 | // version: 2.2.2 3 | export {default, ShowCQT} from "../showcqt@2.2.2/showcqt-main.mjs"; 4 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "showcqt", 3 | "version": "2.2.2", 4 | "description": "ShowCQT (Constant Q Transform) audio visualization", 5 | "main": "showcqt-main.mjs", 6 | "scripts": { 7 | "test": "node ./test/benchmark.mjs" 8 | }, 9 | "repository": { 10 | "type": "git", 11 | "url": "git+https://github.com/mfcc64/showcqt-js.git" 12 | }, 13 | "author": "Muhammad Faiz", 14 | "license": "LGPL-3.0-or-later", 15 | "bugs": { 16 | "url": "https://github.com/mfcc64/showcqt-js/issues" 17 | }, 18 | "homepage": "https://github.com/mfcc64/showcqt-js#readme" 19 | } 20 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | 2 | CC=clang-14 3 | CFLAGS=-O2 -fvisibility=hidden --target=wasm32 -fno-vectorize 4 | SIMDFLAGS=-DWASM_SIMD=1 5 | LD=wasm-ld-14 6 | LDFLAGS=--no-entry --export-dynamic --allow-undefined --gc-sections -O3 --lto-O3 7 | 8 | .PHONY: clean all 9 | all: showcqt.wasm showcqt-simd.wasm 10 | clean: 11 | rm -frv *.o *.wasm 12 | 13 | showcqt.o: showcqt.c showcqt.h 14 | $(CC) showcqt.c $(CFLAGS) -c -o showcqt.o 15 | 16 | showcqt-simd.o: showcqt.c showcqt.h 17 | $(CC) showcqt.c $(CFLAGS) $(SIMDFLAGS) -c -o showcqt-simd.o 18 | 19 | showcqt.wasm: showcqt.o 20 | $(LD) showcqt.o $(LDFLAGS) -o showcqt.wasm 21 | 22 | showcqt-simd.wasm: showcqt-simd.o 23 | $(LD) showcqt-simd.o $(LDFLAGS) -o showcqt-simd.wasm 24 | -------------------------------------------------------------------------------- /benchmark.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | ShowCQT Benchmark 6 | 7 | 8 | 9 |

Repositories

10 |

showcqt-js: an audio visualizer 12 | engine based on ffmpeg showcqt filter.
html5-showcqtbar: an example 14 | github page for showcqt-js.
youtube-musical-spectrum: 16 | a browser extension using showcqt-js.

18 |

showcqt-js benchmark:
19 |

20 |

21 |         
22 |         
23 |

24 | 25 | 26 | -------------------------------------------------------------------------------- /test/single-benchmark.mjs: -------------------------------------------------------------------------------- 1 | 2 | import ShowCQT from "../showcqt-main.mjs"; 3 | import ShowCQTRef from "../showcqt-ref.mjs"; 4 | import {argv} from "node:process"; 5 | 6 | var name = argv[2]; 7 | var width = Number(argv[3]); 8 | var height = Number(argv[4]); 9 | var rate = Number(argv[5]); 10 | var multi = Number(argv[6]); 11 | 12 | await benchmark(name, width, height, rate, multi); 13 | 14 | async function benchmark(name, width, height, rate, multi) { 15 | var cqt = await (name == "reference" ? ShowCQTRef : ShowCQT).instantiate({simd: name == "simd"}); 16 | cqt.init(rate, width, height - 1, 20, 30, multi); 17 | 18 | for (let x = 0; x < cqt.fft_size; x++) { 19 | const t = Math.round(x / rate * 1e6); 20 | cqt.inputs[0][x] = 0.1 * ((t % 100000) / 100000 - (t % 28765) / 28765 + (t % 4341) / 4341 - (t % 256) / 256); 21 | cqt.inputs[1][x] = 0.1 * ((t % 125000) / 125000 - (t % 18256) / 18256 + (t % 8888) / 8888 - (t % 128) / 128); 22 | } 23 | 24 | var t0 = performance.now(); 25 | for (let k = 0; k < 1000; k++) 26 | cqt.calc(); 27 | var t1 = performance.now(); 28 | for (let k = 0; k < 1000; k++) { 29 | for (let y = 0; y < height; y++) 30 | cqt.render_line_alpha(y, 255); 31 | } 32 | var t2 = performance.now(); 33 | 34 | console.log( 35 | name.padEnd(9), 36 | String(width).padStart(4), 37 | String(height).padStart(4), 38 | String(rate).padStart(5), 39 | String(multi), 40 | String(cqt.fft_size).padStart(5), 41 | (t1 - t0).toFixed(2).padStart(8), 42 | (t2 - t1).toFixed(2).padStart(8) 43 | ); 44 | } 45 | -------------------------------------------------------------------------------- /showcqt.h: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (c) 2020 Muhammad Faiz 3 | * 4 | * This library is free software; you can redistribute it and/or 5 | * modify it under the terms of the GNU Lesser General Public 6 | * License as published by the Free Software Foundation; either 7 | * version 3 of the License, or (at your option) any later version. 8 | * 9 | * This library is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * Lesser General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU Lesser General Public 15 | * License along with this library; if not, write to the Free Software 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17 | */ 18 | 19 | /* Audio visualization based on showcqt mpv/ffmpeg audio visualization */ 20 | /* See https://github.com/FFmpeg/FFmpeg/blob/master/libavfilter/avf_showcqt.c */ 21 | 22 | #ifndef SHOWCQT_H_INCLUDED 23 | #define SHOWCQT_H_INCLUDED 1 24 | 25 | #include 26 | 27 | #define WASM_EXPORT extern __attribute__((__visibility__("default"))) 28 | #define WASM_IMPORT extern __attribute__((__nothrow__)) 29 | #define DECLARE_ALIGNED(n) __attribute__((__aligned__(n))) 30 | #define ALWAYS_INLINE __inline__ __attribute__((__always_inline__, __nodebug__)) 31 | 32 | /* minimalist math.h definition */ 33 | #define M_PI 3.14159265358979323846 34 | #define M_LN2 0.693147180559945309417 35 | 36 | WASM_IMPORT double sin(double); 37 | WASM_IMPORT double cos(double); 38 | WASM_IMPORT double log(double); 39 | WASM_IMPORT double exp(double); 40 | WASM_IMPORT double ceil(double); 41 | WASM_IMPORT double floor(double); 42 | WASM_IMPORT float sqrtf(float); 43 | WASM_IMPORT void *memory_expand(int); 44 | 45 | #ifndef WASM_SIMD 46 | #define WASM_SIMD 0 47 | #endif 48 | 49 | #if WASM_SIMD 50 | #define WASM_SIMD_FUNCTION __attribute__((__target__("simd128"))) 51 | #else 52 | #define WASM_SIMD_FUNCTION 53 | #endif 54 | 55 | #define MAX_FFT_SIZE 32768 56 | #define MAX_WIDTH 7680 57 | #define MAX_HEIGHT 4320 58 | #define MIN_VOL 1.0f 59 | #define MAX_VOL 100.0f 60 | 61 | typedef struct Complex { 62 | float re, im; 63 | } Complex; 64 | 65 | typedef struct ColorF { 66 | float r, g, b, h; 67 | } ColorF; 68 | 69 | #if WASM_SIMD 70 | typedef float float32x4 __attribute__((__vector_size__(16), __aligned__(16))); 71 | typedef float float32x4u __attribute__((__vector_size__(16), __aligned__(4))); 72 | typedef int32_t int32x4 __attribute__((__vector_size__(16), __aligned__(16))); 73 | typedef uint32_t uint32x4 __attribute__((__vector_size__(16), __aligned__(16))); 74 | typedef uint8_t uint8x16 __attribute__((__vector_size__(16), __aligned__(16))); 75 | 76 | typedef struct Complex4 { 77 | float32x4 re, im; 78 | } Complex4; 79 | 80 | typedef struct ColorF4 { 81 | float32x4 r, g, b, h; 82 | } ColorF4; 83 | #endif 84 | 85 | typedef struct KernelIndex { 86 | int len; 87 | int start; 88 | } KernelIndex; 89 | 90 | typedef struct ShowCQT { 91 | /* args */ 92 | float input[2][MAX_FFT_SIZE+64]; 93 | unsigned output[MAX_WIDTH]; 94 | 95 | /* tables */ 96 | Complex exp_tbl[MAX_FFT_SIZE]; 97 | int16_t perm_tbl[MAX_FFT_SIZE/4]; 98 | float attack_tbl[MAX_FFT_SIZE/8]; 99 | uint8_t padding[1024]; 100 | 101 | /* buffers */ 102 | Complex fft_buf[MAX_FFT_SIZE+128]; 103 | ColorF color_buf[MAX_WIDTH*2]; 104 | float rcp_h_buf[MAX_WIDTH]; 105 | 106 | /* kernel */ 107 | KernelIndex kernel_index[MAX_WIDTH*2]; 108 | float *kernel; 109 | 110 | /* props */ 111 | int width; 112 | int height; 113 | int aligned_width; 114 | int fft_size; 115 | int t_size; 116 | int attack_size; 117 | float sono_v; 118 | float bar_v; 119 | int prerender; 120 | } ShowCQT; 121 | 122 | #endif 123 | -------------------------------------------------------------------------------- /Readme.md: -------------------------------------------------------------------------------- 1 | # ShowCQT 2 | ShowCQT (Constant Q Transfrom) is a javascript audio visualization engine based on 3 | [ffmpeg showcqt filter](https://ffmpeg.org/ffmpeg-filters.html#showcqt). 4 | 5 | ## Projects 6 | - [Youtube Musical Spectrum](https://github.com/mfcc64/youtube-musical-spectrum) - a browser extension that uses showcqt-js. 7 | - [html5-showcqtbar](https://github.com/mfcc64/html5-showcqtbar) - an example github page that uses showcqt-js. 8 | 9 | ## Usage 10 | ### npm 11 | ``` 12 | npm i showcqt 13 | ``` 14 | ```js 15 | // only ES module is available 16 | // use default import 17 | import ShowCQT from "showcqt"; 18 | 19 | // use named import 20 | import { ShowCQT } from "showcqt"; 21 | 22 | // use dynamic import 23 | const { ShowCQT } = await import("showcqt"); 24 | ``` 25 | 26 | ### CDN 27 | ```js 28 | // use a specific version 29 | import ShowCQT from "https://cdn.jsdelivr.net/npm/showcqt@2.2.1/showcqt.mjs"; 30 | 31 | // use a specific major version 32 | import ShowCQT from "https://cdn.jsdelivr.net/npm/showcqt@2/showcqt.mjs"; 33 | 34 | // also on unpkg 35 | import ShowCQT from "https://unpkg.com/showcqt@2/showcqt.mjs"; 36 | ``` 37 | 38 | ### Example code 39 | ```js 40 | // The output frequency range is fixed between E0 - 50 cents and E10 - 50 cents. 41 | // Instantiate transform context. The context is uninitialized. 42 | var cqt = await ShowCQT.instantiate(); 43 | 44 | // Initialize transform context. May be called multiple times (reinitialization). 45 | // Constraints: 46 | // 0 < rate <= 96000 (actually slightly above 96000) 47 | // 0 < width <= 7680 48 | // 0 < height <= 4320 49 | // 1.0 <= bar_v (bar height) <= 100.0 50 | // 1.0 <= sono_v (brightness) <= 100.0 51 | // If supersampling is true, the actual transform will be twice the width. 52 | var rate = audio_ctx.sampleRate; 53 | var width = canvas.width; 54 | var height = canvas.height - 1; 55 | var bar_v = 15; 56 | var sono_v = 25; 57 | var supersampling = true; 58 | cqt.init(rate, width, height, bar_v, sono_v, supersampling); 59 | 60 | // Change height at runtime. 61 | height = 256; 62 | cqt.set_height(height - 1); 63 | 64 | // Change volume (bar height and brigthness) at runtime. 65 | bar_v = 10; 66 | sono_v = 20; 67 | cqt.set_volume(bar_v, sono_v); 68 | 69 | // Set analyser fft size. 70 | analyser_left.fftSize = cqt.fft_size; 71 | analyser_right.fftSize = cqt.fft_size; 72 | 73 | function draw() { 74 | // Set input time domain data. 75 | analyser_left.getFloatTimeDomainData(cqt.inputs[0]); 76 | analyser_right.getFloatTimeDomainData(cqt.inputs[1]); 77 | cqt.calc(); 78 | 79 | // Edit temporary color buffer. The array is Float32Array consisting of interleaved red, green, blue, and height channel. 80 | // The buffer is only valid after cqt.calc() and before cqt.render_line_*(). 81 | // The color range is from 0.0 to 1.0 but it hasn't been clamped to the range. It may contain values greater than 1.0. 82 | // The initial equations of the colors and the height: 83 | // red = sqrt(sono_v * amplitude_left); 84 | // green = sqrt(sono_v * sqrt(average(sqr(amplitude_left), sqr(amplitude_right)))); 85 | // blue = sqrt(sono_v * amplitude_right); 86 | // height = bar_v * sqrt(average(sqr(amplitude_left), sqr(amplitude_right))); 87 | // You may edit the temporary color buffer if you want to change color scheme for example. 88 | for (let x = 0; x < cqt.width * 4; x += 4) { 89 | let r = cqt.color[x + 0]; 90 | let g = cqt.color[x + 1]; 91 | let b = cqt.color[x + 2]; 92 | let h = cqt.color[x + 3]; 93 | cqt.color[x + 0] = g; 94 | cqt.color[x + 1] = b; 95 | cqt.color[x + 2] = r; 96 | cqt.color[x + 3] = Math.sqrt(h); 97 | } 98 | 99 | for (let y = 0; y < height; y++) { 100 | // Render line, result is in cqt.output. 101 | // equal to cqt.render_line_opaque(y) 102 | cqt.render_line_alpha(y, 255); 103 | canvas_buffer.data.set(cqt.output, 4*width*y); 104 | } 105 | requestAnimationFrame(draw); 106 | } 107 | requestAnimationFrame(draw); 108 | ``` 109 | -------------------------------------------------------------------------------- /showcqt-main.mjs: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (c) 2020 Muhammad Faiz 3 | * 4 | * This library is free software; you can redistribute it and/or 5 | * modify it under the terms of the GNU Lesser General Public 6 | * License as published by the Free Software Foundation; either 7 | * version 3 of the License, or (at your option) any later version. 8 | * 9 | * This library is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * Lesser General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU Lesser General Public 15 | * License along with this library; if not, write to the Free Software 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17 | */ 18 | 19 | /* https://github.com/mfcc64/showcqt-js */ 20 | /* Audio visualization based on showcqt mpv/ffmpeg audio visualization */ 21 | /* See https://github.com/FFmpeg/FFmpeg/blob/master/libavfilter/avf_showcqt.c */ 22 | /* The output frequency range is fixed between E0 - 50 cents and E10 - 50 cents. */ 23 | 24 | const IMPORT = m => import(m); 25 | async function compile(url) { 26 | try { return WebAssembly.compileStreaming(await fetch(String(url))); } 27 | catch { return WebAssembly.compile((await IMPORT("node:fs")).readFileSync(url)); } 28 | } 29 | 30 | let wasm_module_promise = null; 31 | let wasm_simd_module_promise = compile(new URL("showcqt-simd.wasm", import.meta.url)); 32 | 33 | let invalid_func = function() { 34 | throw new Error("ShowCQT is not initialized"); 35 | }; 36 | 37 | let cqt_uninit = function(cqt) { 38 | cqt.fft_size = 0; 39 | cqt.width = 0; 40 | cqt.inputs = null; 41 | cqt.output = null; 42 | cqt.color = null; 43 | cqt.calc = invalid_func; 44 | cqt.render_line_alpha = invalid_func; 45 | cqt.render_line_opaque = invalid_func; 46 | cqt.set_height = invalid_func; 47 | cqt.set_volume = invalid_func; 48 | cqt.detect_silence = invalid_func; 49 | }; 50 | 51 | var ShowCQT = { 52 | instantiate: async function(opt) { 53 | var instance = null; 54 | var simd = true; 55 | if (opt && opt.simd !== undefined) 56 | simd = opt.simd; 57 | 58 | var env = { 59 | cos: Math.cos, 60 | sin: Math.sin, 61 | log: Math.log, 62 | exp: Math.exp, 63 | memory_expand 64 | }; 65 | 66 | if (simd) { 67 | try { 68 | instance = await WebAssembly.instantiate(await wasm_simd_module_promise, {env}); 69 | } catch(e) { 70 | console.warn(`Failed to instantiate SIMD code. ${e.name}: ${e.message}. Fallback to legacy code.`); 71 | } 72 | } 73 | if (!instance) { 74 | if (!wasm_module_promise) 75 | wasm_module_promise = compile(new URL("showcqt.wasm", import.meta.url)); 76 | instance = await WebAssembly.instantiate(await wasm_module_promise, {env}); 77 | } 78 | var exports = instance.exports; 79 | var memory = exports.memory; 80 | var start_ptr = memory.buffer.byteLength; 81 | var curr_ptr = start_ptr; 82 | var avail_size = 0; 83 | 84 | function memory_expand(size) { 85 | if (size < 0) { 86 | avail_size += curr_ptr - start_ptr; 87 | curr_ptr = start_ptr; 88 | return 0; 89 | } 90 | 91 | while (avail_size < size) 92 | memory.grow(1), avail_size += 65536; 93 | 94 | var ret_ptr = curr_ptr; 95 | curr_ptr += size; 96 | avail_size -= size; 97 | return ret_ptr; 98 | } 99 | 100 | var retval = { 101 | init: function(rate, width, height, bar_v, sono_v, supersampling) { 102 | cqt_uninit(this); 103 | this.fft_size = exports.init(rate, width, height, bar_v, sono_v, supersampling); 104 | if (!this.fft_size) 105 | throw new Error("ShowCQT init: cannot initialize ShowCQT"); 106 | this.width = width; 107 | this.inputs = [ 108 | new Float32Array(memory.buffer, exports.get_input_array(0), this.fft_size), 109 | new Float32Array(memory.buffer, exports.get_input_array(1), this.fft_size) 110 | ]; 111 | this.color = new Float32Array(memory.buffer, exports.get_color_array(), this.width * 4); 112 | this.output = new Uint8ClampedArray(memory.buffer, exports.get_output_array(), this.width * 4); 113 | this.calc = exports.calc; 114 | this.render_line_alpha = exports.render_line_alpha; 115 | this.render_line_opaque = exports.render_line_opaque; 116 | this.set_height = exports.set_height; 117 | this.set_volume = exports.set_volume; 118 | this.detect_silence = exports.detect_silence; 119 | } 120 | }; 121 | cqt_uninit(retval); 122 | return retval; 123 | } 124 | }; 125 | 126 | ShowCQT.version = "2.2.2"; 127 | export { ShowCQT }; 128 | export default ShowCQT; 129 | -------------------------------------------------------------------------------- /test/benchmark.mjs: -------------------------------------------------------------------------------- 1 | 2 | var sleep = ms => new Promise(resolve => setTimeout(resolve, ms)); 3 | var pad_string = (arg, len) => String(arg).padStart(len, " "); 4 | var separator = "----------------------------------------------------------------------------------------------------------------------------------------------"; 5 | 6 | var [{ShowCQT}, {ShowCQTRef}] = await Promise.all([ 7 | import("../showcqt.mjs").catch(e => (console.warn("failed to load ./showcqt.mjs"), import("../showcqt-main.mjs"))), 8 | import("../showcqt-ref.mjs") 9 | ]); 10 | 11 | var cqt = await Promise.all([ 12 | ShowCQTRef.instantiate(), 13 | ShowCQT.instantiate({simd: false}), 14 | ShowCQT.instantiate() 15 | ]); 16 | 17 | var result, bottom; 18 | try { 19 | result = document.getElementById("result"); 20 | bottom = document.getElementById("bottom"); 21 | } catch (e) { } 22 | 23 | function print_log(str) { 24 | console.log(str); 25 | result?.insertAdjacentText("beforeend", str + "\n"); 26 | bottom?.scrollIntoView(); 27 | } 28 | 29 | var label = [ 30 | "reference", 31 | "standard", 32 | "simd" 33 | ]; 34 | var grand_calc_time = [ 0, 0, 0 ]; 35 | var grand_render_time = [ 0, 0, 0 ]; 36 | var grand_total_time = [ 0, 0, 0 ]; 37 | var grand_stddev = [ 0, 0, 0 ]; 38 | var grand_maxdiff = [ 0, 0, 0 ]; 39 | var grand_count = [ 0, 0, 0 ]; 40 | 41 | let drand_state = 0; 42 | let drand = function() { 43 | drand_state = (drand_state * 8121 + 28411) % 134456; 44 | return drand_state / 134456 - 0.5; 45 | }; 46 | 47 | for (let width of [1920, 1600, 1366, 1280, 960, 683, 333]) { 48 | for (let height = Math.ceil(width/4); height < width; height *= 2) { 49 | for (let rate of [96000, 88200, 48000, 44100, 24000, 22050, 11025, 8000]) { 50 | for (let multi = 0; multi <= 1; multi++) { 51 | for (let n = 0; cqt[n]; n++) 52 | cqt[n].init(rate, width, height - 1, 20, 30, multi); 53 | 54 | for (let x = 0; x < cqt[0].fft_size; x++) { 55 | cqt[0].inputs[0][x] = 0.3 * Math.sin(0.001 * x * x) + 56 | 0.2 * Math.cos(0.0001 * x * x * x) + 0.2 * drand(); 57 | cqt[0].inputs[1][x] = 0.2 * Math.cos(0.001 * x * x) + 58 | 0.3 * Math.sin(0.0001 * x * x * x) + 0.2 * drand(); 59 | } 60 | 61 | for (let n = 1; cqt[n]; n++) { 62 | for (let x = 0; x < cqt[0].fft_size; x++) { 63 | cqt[n].inputs[0][x] = cqt[0].inputs[0][x]; 64 | cqt[n].inputs[1][x] = cqt[0].inputs[1][x]; 65 | } 66 | } 67 | cqt[0].calc(); 68 | 69 | for (let n = 0; cqt[n]; n++) { 70 | let calc_time = 0; 71 | let render_time = 0; 72 | let total_time = 0; 73 | let stddev = 0; 74 | let maxdiff = 0; 75 | 76 | for (let m = 0, t0 = performance.now(), delta = 0; 77 | delta <= 50; 78 | m++, delta = performance.now() - t0, calc_time = delta / m) 79 | cqt[n].calc(); 80 | 81 | for (let m = 0, t0 = performance.now(), delta = 0; 82 | delta <= 50; 83 | m++, delta = performance.now() - t0, render_time = delta / m) 84 | for (let y = 0; y < height; y++) 85 | cqt[n].render_line_alpha(y, y % 256); 86 | 87 | total_time = calc_time + render_time; 88 | await sleep(1); 89 | 90 | for (let y = 0; y < height && n; y++) { 91 | cqt[n].render_line_alpha(y, y % 256); 92 | cqt[0].render_line_alpha(y, y % 256); 93 | for (let x = 0; x < 4 * width; x++) { 94 | let diff = Math.abs(cqt[n].output[x] - cqt[0].output[x]); 95 | maxdiff = Math.max(maxdiff, diff); 96 | stddev += diff * diff; 97 | } 98 | } 99 | stddev = Math.sqrt(stddev / (width * height * 4)); 100 | let str = "name = " + pad_string(label[n], 10) + 101 | ", w = " + pad_string(width, 4) + 102 | ", h = " + pad_string(height, 4) + 103 | ", r = " + pad_string(rate, 5) + 104 | ", m = " + multi + 105 | ", calc = " + pad_string(Math.round(calc_time * 1000), 7) + " us" + 106 | ", render = " + pad_string(Math.round(render_time * 1000), 7) + " us" + 107 | ", total = " + pad_string(Math.round(total_time * 1000), 7) + " us" + 108 | ", maxdiff = " + pad_string(maxdiff, 3) + 109 | ", stddev = " + stddev; 110 | print_log(str); 111 | grand_calc_time[n] += calc_time; 112 | grand_render_time[n] += render_time; 113 | grand_total_time[n] += total_time; 114 | grand_stddev[n] += stddev; 115 | grand_maxdiff[n] = Math.max(grand_maxdiff[n], maxdiff); 116 | grand_count[n]++; 117 | await sleep(10); 118 | } 119 | print_log(separator); 120 | } 121 | } 122 | print_log(separator); 123 | } 124 | } 125 | 126 | var max_maxdiff = 0; 127 | for (let n = 0; cqt[n]; n++) { 128 | let str = "name = " + pad_string(label[n], 10) + 129 | ", w = " + pad_string("avg", 4) + 130 | ", h = " + pad_string("avg", 4) + 131 | ", r = " + pad_string("avg", 5) + 132 | ", m = " + "-" + 133 | ", calc = " + pad_string(Math.round(grand_calc_time[n] / grand_count[n] * 1000), 7) + " us" + 134 | ", render = " + pad_string(Math.round(grand_render_time[n] / grand_count[n] * 1000), 7) + " us" + 135 | ", total = " + pad_string(Math.round(grand_total_time[n] / grand_count[n] * 1000), 7) + " us" + 136 | ", maxdiff = " + pad_string(grand_maxdiff[n], 3) + 137 | ", stddev = " + grand_stddev[n] / grand_count[n]; 138 | print_log(str); 139 | max_maxdiff = Math.max(grand_maxdiff[n], max_maxdiff); 140 | } 141 | 142 | if (max_maxdiff > 1) 143 | throw new Error("maxdiff > 1"); 144 | -------------------------------------------------------------------------------- /COPYING.LESSER: -------------------------------------------------------------------------------- 1 | GNU LESSER GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | 9 | This version of the GNU Lesser General Public License incorporates 10 | the terms and conditions of version 3 of the GNU General Public 11 | License, supplemented by the additional permissions listed below. 12 | 13 | 0. Additional Definitions. 14 | 15 | As used herein, "this License" refers to version 3 of the GNU Lesser 16 | General Public License, and the "GNU GPL" refers to version 3 of the GNU 17 | General Public License. 18 | 19 | "The Library" refers to a covered work governed by this License, 20 | other than an Application or a Combined Work as defined below. 21 | 22 | An "Application" is any work that makes use of an interface provided 23 | by the Library, but which is not otherwise based on the Library. 24 | Defining a subclass of a class defined by the Library is deemed a mode 25 | of using an interface provided by the Library. 26 | 27 | A "Combined Work" is a work produced by combining or linking an 28 | Application with the Library. The particular version of the Library 29 | with which the Combined Work was made is also called the "Linked 30 | Version". 31 | 32 | The "Minimal Corresponding Source" for a Combined Work means the 33 | Corresponding Source for the Combined Work, excluding any source code 34 | for portions of the Combined Work that, considered in isolation, are 35 | based on the Application, and not on the Linked Version. 36 | 37 | The "Corresponding Application Code" for a Combined Work means the 38 | object code and/or source code for the Application, including any data 39 | and utility programs needed for reproducing the Combined Work from the 40 | Application, but excluding the System Libraries of the Combined Work. 41 | 42 | 1. Exception to Section 3 of the GNU GPL. 43 | 44 | You may convey a covered work under sections 3 and 4 of this License 45 | without being bound by section 3 of the GNU GPL. 46 | 47 | 2. Conveying Modified Versions. 48 | 49 | If you modify a copy of the Library, and, in your modifications, a 50 | facility refers to a function or data to be supplied by an Application 51 | that uses the facility (other than as an argument passed when the 52 | facility is invoked), then you may convey a copy of the modified 53 | version: 54 | 55 | a) under this License, provided that you make a good faith effort to 56 | ensure that, in the event an Application does not supply the 57 | function or data, the facility still operates, and performs 58 | whatever part of its purpose remains meaningful, or 59 | 60 | b) under the GNU GPL, with none of the additional permissions of 61 | this License applicable to that copy. 62 | 63 | 3. Object Code Incorporating Material from Library Header Files. 64 | 65 | The object code form of an Application may incorporate material from 66 | a header file that is part of the Library. You may convey such object 67 | code under terms of your choice, provided that, if the incorporated 68 | material is not limited to numerical parameters, data structure 69 | layouts and accessors, or small macros, inline functions and templates 70 | (ten or fewer lines in length), you do both of the following: 71 | 72 | a) Give prominent notice with each copy of the object code that the 73 | Library is used in it and that the Library and its use are 74 | covered by this License. 75 | 76 | b) Accompany the object code with a copy of the GNU GPL and this license 77 | document. 78 | 79 | 4. Combined Works. 80 | 81 | You may convey a Combined Work under terms of your choice that, 82 | taken together, effectively do not restrict modification of the 83 | portions of the Library contained in the Combined Work and reverse 84 | engineering for debugging such modifications, if you also do each of 85 | the following: 86 | 87 | a) Give prominent notice with each copy of the Combined Work that 88 | the Library is used in it and that the Library and its use are 89 | covered by this License. 90 | 91 | b) Accompany the Combined Work with a copy of the GNU GPL and this license 92 | document. 93 | 94 | c) For a Combined Work that displays copyright notices during 95 | execution, include the copyright notice for the Library among 96 | these notices, as well as a reference directing the user to the 97 | copies of the GNU GPL and this license document. 98 | 99 | d) Do one of the following: 100 | 101 | 0) Convey the Minimal Corresponding Source under the terms of this 102 | License, and the Corresponding Application Code in a form 103 | suitable for, and under terms that permit, the user to 104 | recombine or relink the Application with a modified version of 105 | the Linked Version to produce a modified Combined Work, in the 106 | manner specified by section 6 of the GNU GPL for conveying 107 | Corresponding Source. 108 | 109 | 1) Use a suitable shared library mechanism for linking with the 110 | Library. A suitable mechanism is one that (a) uses at run time 111 | a copy of the Library already present on the user's computer 112 | system, and (b) will operate properly with a modified version 113 | of the Library that is interface-compatible with the Linked 114 | Version. 115 | 116 | e) Provide Installation Information, but only if you would otherwise 117 | be required to provide such information under section 6 of the 118 | GNU GPL, and only to the extent that such information is 119 | necessary to install and execute a modified version of the 120 | Combined Work produced by recombining or relinking the 121 | Application with a modified version of the Linked Version. (If 122 | you use option 4d0, the Installation Information must accompany 123 | the Minimal Corresponding Source and Corresponding Application 124 | Code. If you use option 4d1, you must provide the Installation 125 | Information in the manner specified by section 6 of the GNU GPL 126 | for conveying Corresponding Source.) 127 | 128 | 5. Combined Libraries. 129 | 130 | You may place library facilities that are a work based on the 131 | Library side by side in a single library together with other library 132 | facilities that are not Applications and are not covered by this 133 | License, and convey such a combined library under terms of your 134 | choice, if you do both of the following: 135 | 136 | a) Accompany the combined library with a copy of the same work based 137 | on the Library, uncombined with any other library facilities, 138 | conveyed under the terms of this License. 139 | 140 | b) Give prominent notice with the combined library that part of it 141 | is a work based on the Library, and explaining where to find the 142 | accompanying uncombined form of the same work. 143 | 144 | 6. Revised Versions of the GNU Lesser General Public License. 145 | 146 | The Free Software Foundation may publish revised and/or new versions 147 | of the GNU Lesser General Public License from time to time. Such new 148 | versions will be similar in spirit to the present version, but may 149 | differ in detail to address new problems or concerns. 150 | 151 | Each version is given a distinguishing version number. If the 152 | Library as you received it specifies that a certain numbered version 153 | of the GNU Lesser General Public License "or any later version" 154 | applies to it, you have the option of following the terms and 155 | conditions either of that published version or of any later version 156 | published by the Free Software Foundation. If the Library as you 157 | received it does not specify a version number of the GNU Lesser 158 | General Public License, you may choose any version of the GNU Lesser 159 | General Public License ever published by the Free Software Foundation. 160 | 161 | If the Library as you received it specifies that a proxy can decide 162 | whether future versions of the GNU Lesser General Public License shall 163 | apply, that proxy's public statement of acceptance of any version is 164 | permanent authorization for you to choose that version for the 165 | Library. 166 | -------------------------------------------------------------------------------- /showcqt-ref.mjs: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (c) 2020 Muhammad Faiz 3 | * 4 | * This library is free software; you can redistribute it and/or 5 | * modify it under the terms of the GNU Lesser General Public 6 | * License as published by the Free Software Foundation; either 7 | * version 3 of the License, or (at your option) any later version. 8 | * 9 | * This library is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * Lesser General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU Lesser General Public 15 | * License along with this library; if not, write to the Free Software 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17 | */ 18 | 19 | /* Audio visualization based on showcqt mpv/ffmpeg audio visualization */ 20 | /* See https://github.com/FFmpeg/FFmpeg/blob/master/libavfilter/avf_showcqt.c */ 21 | /* The output frequency range is fixed between E0 - 50 cents and E10 - 50 cents. */ 22 | 23 | /* 24 | * Reference for numeric testing. 25 | */ 26 | { 27 | //wasm_embedded_base64 28 | const wasm_embedded_base64 = "" + 29 | "AGFzbQEAAAABKghgAXwBfGABfwF/YAABf2AGf39/fX1/AX9gAABgAX8AYAJ/fwBgAn19AAIpBANl" + 30 | "bnYDbG9nAAADZW52A2NvcwAAA2VudgNzaW4AAANlbnYDZXhwAAADFRQBAgIDBAUFBQUGBQcFBQUF" + 31 | "BQUFBQQFAXABAQEFAwEAdgYJAX8BQbC41AMLB5IBCgZtZW1vcnkCAA9nZXRfaW5wdXRfYXJyYXkA" + 32 | "BBBnZXRfb3V0cHV0X2FycmF5AAUPZ2V0X2NvbG9yX2FycmF5AAYEaW5pdAAHBGNhbGMACBFyZW5k" + 33 | "ZXJfbGluZV9hbHBoYQANEnJlbmRlcl9saW5lX29wYXF1ZQAOCnNldF92b2x1bWUADwpzZXRfaGVp" + 34 | "Z2h0ABAKmWcUEQAgAEEAR0ERdEGAiICAAGoLCABBgIiQgAALCABBgIi4gAAL5A0EAX8CfAN/CXxB" + 35 | "ACEGAkAgAUF/akH/O0sNACACQX9qQd8hSw0AQQAhBkEAIAE2Aoi40IMAQQAgAjYChLjQgwBBACAB" + 36 | "NgKAuNCDAEEAQwAAyEIgA0MAAIA/IANDAACAP14bIANDAADIQl4bOAKcuNCDAEEAQwAAyEIgBEMA" + 37 | "AIA/IARDAACAP14bIARDAADIQl4bOAKYuNCDACAAQcBBakHgzgVLDQACQAJAIAC3IgdEH4XrUbge" + 38 | "1T+iEICAgIAARO85+v5CLuY/o5siCJlEAAAAAAAA4EFjRQ0AIAiqIQEMAQtBgICAgHghAQsgAUF2" + 39 | "akEKSw0AQQAhBkEAQQEgAXQiCTYCjLjQgwAgCUGAgAJKDQBBIiABayEAQQEgAUF+aiIBdCEKQX8g" + 40 | "AXRB//8DcyELQQAhBkGA8CUhAQNAIAFBgIiAgABqIAFBgJBaakGq1arVenEgBkEBdkHVqtWqAXFy" + 41 | "IgJBAnRBzJmz5nxxIAJBAnZBs+bMmQJxciICQQR0QfDhw4d/cSACQQR2QY+evPAAcXIiAkEIdEGA" + 42 | "/oN4cSACQQh2Qf+B+AdxckEQdyAAdiALcTsBACABQQJqIQEgBkEBaiIGIApIDQALAkAgCUEDSA0A" + 43 | "QQIhAANAAkAgAEUNACAAQQF2IQZEGC1EVPshGUAgALciDKMhDSAAQQN0QYT4kYAAaiEBQQAhAkQA" + 44 | "AAAAAAAAACEIA0AgAUF8aiANIAiiIg4QgYCAgAC2OAIAIAEgDhCCgICAALaMOAIAIAFBCGohASAI" + 45 | "RAAAAAAAAPA/oCEIIAJBAWoiAiAGSQ0AC0TSITN/fNkiQCAMoyENIAAgBmpBA3RBhPiRgABqIQFB" + 46 | "ACECRAAAAAAAAAAAIQgDQCABQXxqIA0gCKIiDhCBgICAALY4AgAgASAOEIKAgIAAtow4AgAgAUEI" + 47 | "aiEBIAhEAAAAAAAA8D+gIQggAkEBaiICIAZJDQALCyAAQQF0IgAgCUgNAAsgCUEEbSEGIAlBBEgN" + 48 | "AEQYLURU+yEZQCAJt6MhDSAJQQN0QYT4kYAAaiEBRAAAAAAAAAAAIQgDQCABQXxqIA0gCKIiDhCB" + 49 | "gICAALY4AgAgASAOEIKAgIAAtow4AgAgAUEIaiEBIAhEAAAAAAAA8D+gIQggBkF/aiIGDQALCwJA" + 50 | "AkAgB0RMN4lBYOWgP6IiD5siCJlEAAAAAAAA4EFjRQ0AIAiqIQYMAQtBgICAgHghBgtBACAGNgKU" + 51 | "uNCDAAJAIAZBAUgNAEQAAAAAAAAAACEOQYD4poAAIQEDQCAORBgtRFT7IQlAoiAPoyIIIAigEIGA" + 52 | "gIAAIQ0gCBCBgICAACEMIAEgCEQAAAAAAAAIQKIQgYCAgABE3uhjPiDQiT+iIAxEueAM/n4x3z+i" + 53 | "RCqnPSXnxNY/oCANRKuxhLUxdsI/oqCgtjgCACABQQRqIQEgDkQAAAAAAADwP6AhDiAGQX9qIgYN" + 54 | "AAsLQQBBACgCgLjQgwBBAkEBIAUbbCILNgKQuNCDAAJAIAtBAUgNACAHRAAAAAAAAOA/oiEQRAAA" + 55 | "AAAAAPA/IAu3oyERQQAhCkQAAAAAAADwP0EAKAKMuNCDALciEqMhEyASRAAAAAAAACBAoiEUQQAh" + 56 | "BgNAAkACQCARIAq3RAAAAAAAAOA/oERqyLi+07kbQKKiRBtu1ZvR+AdAoBCDgICAACIIIBBmQQFz" + 57 | "DQAgCkEDdEGA+MiAAGpCADcDAAwBCwJAAkAgCCASoiAHoyIMIBRErkfhehSuX0AgCEQfhetRuB7V" + 58 | "P6IiCESPwvUoXI/qP6NEpaWlpaWloUCgo0SuR+F6FK5fQCAIRMP1KFyPwsU/o0SLgRLeaOp8QKCj" + 59 | "oCAHoqMiDUQAAAAAAADgP6IiCKGbIg6ZRAAAAAAAAOBBY0UNACAOqiEBDAELQYCAgIB4IQELAkAC" + 60 | "QCAMIAignCIImUQAAAAAAADgQWNFDQAgCKohAAwBC0GAgICAeCEACwJAIAAgAWtBAWoiAiAGaiIJ" + 61 | "QZj43wBMDQBBAA8LIApBA3QiBUGE+MiAAGogATYCACAFQYD4yIAAaiACNgIAAkAgACABSA0ARAAA" + 62 | "AAAAAPA/IA2jIQ8gBkECdEGAuNCAAGohBgNAIA8gAbcgDKFEGC1EVPshGUCioiIIIAigEIGAgIAA" + 63 | "IQ4gCBCBgICAACENIAYgE0F/QQEgAUEBcRu3oiAIRAAAAAAAAAhAohCBgICAAETe6GM+INCJP6Ig" + 64 | "DUS54Az+fjHfP6JEKqc9JefE1j+gIA5Eq7GEtTF2wj+ioKCitjgCACAGQQRqIQYgASAASCECIAFB" + 65 | "AWohASACDQALCyAJIQYLIApBAWoiCiALRw0ACwtBACgCjLjQgwAhBgsgBgvMFQIOfxN9QQAoAoy4" + 66 | "0IMAIgBBAnUhASAAQQF1IQJBACgClLjQgwAiAyEEAkAgA0EBSA0AIAJBA3QgA0ECdCIFayEGIAJB" + 67 | "AnQgBWshByACIAFqIANrQQJ0IQhBgPilgAAhCUGAiICAACEFQQAhCgNAIAUgB2oiCygCACEMIAku" + 68 | "AQBBBXQiBEGEgKiAAGogC0GAgAhqKAIANgIAIARBgICogABqIAw2AgAgBEEIciILQYCAqIAAaiAF" + 69 | "QYDwJmoiDCoCACAFIAZqIg0qAgCUOAIAIAtBhICogABqIAwqAgAgDUGAgAhqKgIAlDgCACAFIAhq" + 70 | "IgsoAgAhDCAEQRByIg1BhICogABqIAtBgIAIaigCADYCACANQYCAqIAAaiAMNgIAIARBGHJBgICo" + 71 | "gABqQgA3AwAgBUEEaiEFIAlBAmohCSAKQQFqIgpBACgClLjQgwAiBEgNAAsLAkAgBCABTg0AIAEg" + 72 | "BGshCyAEQQF0QYD4pYAAaiEKIAQgAmoiBSADa0ECdEGAiICAAGohBCAFIAFqIANrQQJ0QYCIgIAA" + 73 | "aiEJA0AgBCgCACEMIAouAQBBBXQiBUGEgKiAAGogBEGAgAhqKAIANgIAIAVBgICogABqIAw2AgAg" + 74 | "BUEIckGAgKiAAGpCADcDACAJKAIAIQwgBUEQciINQYSAqIAAaiAJQYCACGooAgA2AgAgDUGAgKiA" + 75 | "AGogDDYCACAFQRhyQYCAqIAAakIANwMAIApBAmohCiAJQQRqIQkgBEEEaiEEIAtBf2oiCw0AC0EA" + 76 | "KAKMuNCDACEACwJAAkACQAJAAkACQCAAQf8/Sg0AIABBgAhGDQEgAEGAEEYNAiAAQYAgRw0FQYCA" + 77 | "qIAAEImAgIAADAULIABBgMAARg0CIABBgIABRg0DIABBgIACRw0EQYCAqIAAEIqAgIAAQYCArIAA" + 78 | "EIqAgIAAQYCAsIAAEIqAgIAAQYCAtIAAEIqAgIAAQQAhBUEAKgKEgLSAACEOQQBBACoChICogAAi" + 79 | "D0EAKgKEgKyAACIQkyIRQQAqAoCAsIAAIhJBACoCgIC0gAAiE5MiFJI4AoSAtIAAQQBBACoCgICo" + 80 | "gAAiFUEAKgKAgKyAACIWkyIXQQAqAoSAsIAAIhggDpMiGZM4AoCAtIAAQQAgDyAQkiIPIBggDpIi" + 81 | "DpM4AoSAsIAAQQAgFSAWkiIQIBIgE5IiEpM4AoCAsIAAQQAgESAUkzgChICsgABBACAXIBmSOAKA" + 82 | "gKyAAEEAIA8gDpI4AoSAqIAAQQAgECASkjgCgICogAADQCAFQYyAtIAAaiIEIAVBjICogABqIgkq" + 83 | "AgAiDiAFQYiArIAAaiIKKgIAIg8gBUGM+JmAAGoqAgAiEJQgBUGI+JmAAGoqAgAiESAFQYyArIAA" + 84 | "aiILKgIAIhKUkiITkyIUIAVBiPihgABqKgIAIhUgBUGIgLCAAGoiDCoCACIWlCAFQYz4oYAAaioC" + 85 | "ACIXIAVBjICwgABqIg0qAgAiGJSTIhkgBUGI+J2AAGoqAgAiGiAFQYiAtIAAaiIGKgIAIhuUIAVB" + 86 | "jPidgABqKgIAIhwgBCoCACIdlJMiHpMiH5I4AgAgBiAFQYiAqIAAaiIEKgIAIiAgESAPlCAQIBKU" + 87 | "kyIPkyIQIBYgF5QgFSAYlJIiESAbIByUIBogHZSSIhKTIhWTOAIAIA0gDiATkiIOIBEgEpIiEZM4" + 88 | "AgAgDCAgIA+SIg8gGSAekiISkzgCACALIBQgH5M4AgAgCiAQIBWSOAIAIAkgDiARkjgCACAEIA8g" + 89 | "EpI4AgAgBUEIaiIFQfj/A0cNAAwFCwtBgICogAAQi4CAgAAMAwtBgICogAAQjICAgAAMAgtBgICo" + 90 | "gAAQioCAgAAMAQtBgICogAAQiYCAgABBgICqgAAQiYCAgABBgICsgAAQiYCAgABBgICugAAQiYCA" + 91 | "gABBACEFQQAqAoSAroAAIQ5BAEEAKgKEgKiAACIPQQAqAoSAqoAAIhCTIhFBACoCgICsgAAiEkEA" + 92 | "KgKAgK6AACITkyIUkjgChICugABBAEEAKgKAgKiAACIVQQAqAoCAqoAAIhaTIhdBACoChICsgAAi" + 93 | "GCAOkyIZkzgCgICugABBACAPIBCSIg8gGCAOkiIOkzgChICsgABBACAVIBaSIhAgEiATkiISkzgC" + 94 | "gICsgABBACARIBSTOAKEgKqAAEEAIBcgGZI4AoCAqoAAQQAgDyAOkjgChICogABBACAQIBKSOAKA" + 95 | "gKiAAANAIAVBjICugABqIgQgBUGMgKiAAGoiCSoCACIOIAVBiICqgABqIgoqAgAiDyAFQYz4lYAA" + 96 | "aioCACIQlCAFQYj4lYAAaioCACIRIAVBjICqgABqIgsqAgAiEpSSIhOTIhQgBUGI+JmAAGoqAgAi" + 97 | "FSAFQYiArIAAaiIMKgIAIhaUIAVBjPiZgABqKgIAIhcgBUGMgKyAAGoiDSoCACIYlJMiGSAFQYj4" + 98 | "l4AAaioCACIaIAVBiICugABqIgYqAgAiG5QgBUGM+JeAAGoqAgAiHCAEKgIAIh2UkyIekyIfkjgC" + 99 | "ACAGIAVBiICogABqIgQqAgAiICARIA+UIBAgEpSTIg+TIhAgFiAXlCAVIBiUkiIRIBsgHJQgGiAd" + 100 | "lJIiEpMiFZM4AgAgDSAOIBOSIg4gESASkiIRkzgCACAMICAgD5IiDyAZIB6SIhKTOAIAIAsgFCAf" + 101 | "kzgCACAKIBAgFZI4AgAgCSAOIBGSOAIAIAQgDyASkjgCACAFQQhqIgVB+P8BRw0ACwsCQEEAKAKQ" + 102 | "uNCDACIGQQFIDQBBACELQQAhDQNAAkACQCALQQN0IgVBgPjIgABqKAIAIgxFDQACQAJAIAxBAU4N" + 103 | "AEMAAAAAIQ9DAAAAACEQQwAAAAAhEUMAAAAAIRIMAQtBACgCjLjQgwBBA3QgBUGE+MiAAGooAgBB" + 104 | "A3QiBWshBCANQQJ0IQlDAAAAACESIAwhCkMAAAAAIRFDAAAAACEQQwAAAAAhDwNAIA8gCUGAuNCA" + 105 | "AGoqAgAiDiAEQYSAqIAAaioCAJSSIQ8gECAOIARBgICogABqKgIAlJIhECARIA4gBUGEgKiAAGoq" + 106 | "AgCUkiERIBIgDiAFQYCAqIAAaioCAJSSIRIgCUEEaiEJIARBeGohBCAFQQhqIQUgCkF/aiIKDQAL" + 107 | "CyALQQR0IgVBiIi4gABqIA8gEZIiDiAOlCAQIBKTIg4gDpSSIhORQQAqApi40IMAIg6UkTgCACAF" + 108 | "QYCIuIAAaiAOIBEgD5MiDyAPlCAQIBKSIg8gD5SSIg+RlJE4AgAgBUGMiLiAAGogDyATkkMAAAA/" + 109 | "lJEiD0EAKgKcuNCDAJQ4AgAgBUGEiLiAAGogDyAOlJE4AgAgDCANaiENDAELIAtBBHQiBUGIiLiA" + 110 | "AGpCADcDACAFQYCIuIAAakIANwMAQQAoApC40IMAIQYLIAtBAWoiCyAGSA0ACwsCQCAGQQAoAoC4" + 111 | "0IMAIglGDQAgCUEBSA0AQYCIuIAAIQVBjIi4gAAhBANAIARBdGogBSoCACAFQRBqKgIAkkMAAAA/" + 112 | "lDgCACAEQXhqIAVBBGoqAgAgBUEUaioCAJJDAAAAP5Q4AgAgBEF8aiAFQQhqKgIAIAVBGGoqAgCS" + 113 | "QwAAAD+UOAIAIAQgBUEMaioCACAFQRxqKgIAkkMAAAA/lDgCACAEQRBqIQQgBUEgaiEFIAlBf2oi" + 114 | "CQ0ACwtBAEEBNgKguNCDAAv5BAgBfwJ9AX8KfQZ/AX0BfwZ9IAAQi4CAgAAgAEGAwABqEIuAgIAA" + 115 | "IABBgIABahCLgICAACAAQYDAAWoQi4CAgAAgAEGEwAFqIgEqAgAhAiABIAAqAgQiAyAAQYTAAGoi" + 116 | "BCoCACIFkyIGIAAqAoCAASIHIAAqAoDAASIIkyIJkjgCACAAIAAqAgAiCiAAKgKAQCILkyIMIABB" + 117 | "hIABaiIBKgIAIg0gApMiDpM4AoDAASABIAMgBZIiAyANIAKSIgKTOAIAIAAgCiALkiIFIAcgCJIi" + 118 | "B5M4AoCAASAEIAYgCZM4AgAgACAMIA6SOAKAQCAAIAMgApI4AgQgACAFIAeSOAIAQQAhAQNAIAAg" + 119 | "AWoiBEGMwAFqIg8gBEEMaiIQKgIAIgIgBEGIwABqIhEqAgAiAyABQYz4koAAaioCACIFlCABQYj4" + 120 | "koAAaioCACIGIARBjMAAaiISKgIAIgeUkiIIkyIJIAFBiPiTgABqKgIAIgogBEGIgAFqIhMqAgAi" + 121 | "C5QgAUGM+JOAAGoqAgAiDCAEQYyAAWoiFCoCACINlJMiDiABQYi4k4AAaioCACIVIARBiMABaiIW" + 122 | "KgIAIheUIAFBjLiTgABqKgIAIhggDyoCACIZlJMiGpMiG5I4AgAgFiAEQQhqIgQqAgAiHCAGIAOU" + 123 | "IAUgB5STIgOTIgUgCyAMlCAKIA2UkiIGIBcgGJQgFSAZlJIiB5MiCpM4AgAgFCACIAiSIgIgBiAH" + 124 | "kiIGkzgCACATIBwgA5IiAyAOIBqSIgeTOAIAIBIgCSAbkzgCACARIAUgCpI4AgAgECACIAaSOAIA" + 125 | "IAQgAyAHkjgCACABQQhqIgFB+D9HDQALC/wECAF/An0Bfwp9Bn8BfQF/Bn0gABCMgICAACAAQYCA" + 126 | "AWoQjICAgAAgAEGAgAJqEIyAgIAAIABBgIADahCMgICAACAAQYSAA2oiASoCACECIAEgACoCBCID" + 127 | "IABBhIABaiIEKgIAIgWTIgYgACoCgIACIgcgACoCgIADIgiTIgmSOAIAIAAgACoCACIKIAAqAoCA" + 128 | "ASILkyIMIABBhIACaiIBKgIAIg0gApMiDpM4AoCAAyABIAMgBZIiAyANIAKSIgKTOAIAIAAgCiAL" + 129 | "kiIFIAcgCJIiB5M4AoCAAiAEIAYgCZM4AgAgACAMIA6SOAKAgAEgACADIAKSOAIEIAAgBSAHkjgC" + 130 | "AEEAIQEDQCAAIAFqIgRBjIADaiIPIARBDGoiECoCACICIARBiIABaiIRKgIAIgMgAUGM+JOAAGoq" + 131 | "AgAiBZQgAUGI+JOAAGoqAgAiBiAEQYyAAWoiEioCACIHlJIiCJMiCSABQYj4lYAAaioCACIKIARB" + 132 | "iIACaiITKgIAIguUIAFBjPiVgABqKgIAIgwgBEGMgAJqIhQqAgAiDZSTIg4gAUGI+JSAAGoqAgAi" + 133 | "FSAEQYiAA2oiFioCACIXlCABQYz4lIAAaioCACIYIA8qAgAiGZSTIhqTIhuSOAIAIBYgBEEIaiIE" + 134 | "KgIAIhwgBiADlCAFIAeUkyIDkyIFIAsgDJQgCiANlJIiBiAXIBiUIBUgGZSSIgeTIgqTOAIAIBQg" + 135 | "AiAIkiICIAYgB5IiBpM4AgAgEyAcIAOSIgMgDiAakiIHkzgCACASIAkgG5M4AgAgESAFIAqSOAIA" + 136 | "IBAgAiAGkjgCACAEIAMgB5I4AgAgAUEIaiIBQfj/AEcNAAsL6QQIAX8CfQF/Cn0GfwF9AX8GfSAA" + 137 | "EJGAgIAAIABBgBBqEJGAgIAAIABBgCBqEJGAgIAAIABBgDBqEJGAgIAAIABBhDBqIgEqAgAhAiAB" + 138 | "IAAqAgQiAyAAQYQQaiIEKgIAIgWTIgYgACoCgCAiByAAKgKAMCIIkyIJkjgCACAAIAAqAgAiCiAA" + 139 | "KgKAECILkyIMIABBhCBqIgEqAgAiDSACkyIOkzgCgDAgASADIAWSIgMgDSACkiICkzgCACAAIAog" + 140 | "C5IiBSAHIAiSIgeTOAKAICAEIAYgCZM4AgAgACAMIA6SOAKAECAAIAMgApI4AgQgACAFIAeSOAIA" + 141 | "QQAhAQNAIAAgAWoiBEGMMGoiDyAEQQxqIhAqAgAiAiAEQYgQaiIRKgIAIgMgAUGMmJKAAGoqAgAi" + 142 | "BZQgAUGImJKAAGoqAgAiBiAEQYwQaiISKgIAIgeUkiIIkyIJIAFBiLiSgABqKgIAIgogBEGIIGoi" + 143 | "EyoCACILlCABQYy4koAAaioCACIMIARBjCBqIhQqAgAiDZSTIg4gAUGIqJKAAGoqAgAiFSAEQYgw" + 144 | "aiIWKgIAIheUIAFBjKiSgABqKgIAIhggDyoCACIZlJMiGpMiG5I4AgAgFiAEQQhqIgQqAgAiHCAG" + 145 | "IAOUIAUgB5STIgOTIgUgCyAMlCAKIA2UkiIGIBcgGJQgFSAZlJIiB5MiCpM4AgAgFCACIAiSIgIg" + 146 | "BiAHkiIGkzgCACATIBwgA5IiAyAOIBqSIgeTOAIAIBIgCSAbkzgCACARIAUgCpI4AgAgECACIAaS" + 147 | "OAIAIAQgAyAHkjgCACABQQhqIgFB+A9HDQALC/EECAF/An0Bfwp9Bn8BfQF/Bn0gABCSgICAACAA" + 148 | "QYAgahCSgICAACAAQYDAAGoQkoCAgAAgAEGA4ABqEJKAgIAAIABBhOAAaiIBKgIAIQIgASAAKgIE" + 149 | "IgMgAEGEIGoiBCoCACIFkyIGIAAqAoBAIgcgACoCgGAiCJMiCZI4AgAgACAAKgIAIgogACoCgCAi" + 150 | "C5MiDCAAQYTAAGoiASoCACINIAKTIg6TOAKAYCABIAMgBZIiAyANIAKSIgKTOAIAIAAgCiALkiIF" + 151 | "IAcgCJIiB5M4AoBAIAQgBiAJkzgCACAAIAwgDpI4AoAgIAAgAyACkjgCBCAAIAUgB5I4AgBBACEB" + 152 | "A0AgACABaiIEQYzgAGoiDyAEQQxqIhAqAgAiAiAEQYggaiIRKgIAIgMgAUGMuJKAAGoqAgAiBZQg" + 153 | "AUGIuJKAAGoqAgAiBiAEQYwgaiISKgIAIgeUkiIIkyIJIAFBiPiSgABqKgIAIgogBEGIwABqIhMq" + 154 | "AgAiC5QgAUGM+JKAAGoqAgAiDCAEQYzAAGoiFCoCACINlJMiDiABQYjYkoAAaioCACIVIARBiOAA" + 155 | "aiIWKgIAIheUIAFBjNiSgABqKgIAIhggDyoCACIZlJMiGpMiG5I4AgAgFiAEQQhqIgQqAgAiHCAG" + 156 | "IAOUIAUgB5STIgOTIgUgCyAMlCAKIA2UkiIGIBcgGJQgFSAZlJIiB5MiCpM4AgAgFCACIAiSIgIg" + 157 | "BiAHkiIGkzgCACATIBwgA5IiAyAOIBqSIgeTOAIAIBIgCSAbkzgCACARIAUgCpI4AgAgECACIAaS" + 158 | "OAIAIAQgAyAHkjgCACABQQhqIgFB+B9HDQALC5wIBQJ/AX0BfwJ9An8CQEEAKAKguNCDAEUNAAJA" + 159 | "QQAoAoC40IMAIgJBAUgNAEGMiLiAACEDA0BDAAAAACEEAkAgA0F0aiIFKgIAIgZDAAAAAGBBAXMN" + 160 | "AEMAAIA/IQQgBkMAAIA/X0EBcw0AIAYhBAsgBSAEQwCAf0OUOAIAQwAAAAAhBEMAAAAAIQYCQCAD" + 161 | "QXhqIgUqAgAiB0MAAAAAYEEBcw0AQwAAgD8hBiAHQwAAgD9fQQFzDQAgByEGCyAFIAZDAIB/Q5Q4" + 162 | "AgACQCADQXxqIgUqAgAiBkMAAAAAYEEBcw0AQwAAgD8hBCAGQwAAgD9fQQFzDQAgBiEECyAFIARD" + 163 | "AIB/Q5Q4AgAgAyADKgIAIgRDAAAAACAEQwAAAABgGzgCACADQRBqIQMgAkF/aiICDQALCwJAQQAo" + 164 | "Aoi40IMAIgVBAUgNAEGAiMeAACEDQYyIuIAAIQIDQCADQwAAgD8gAioCAEMXt9E4kpU4AgAgAkEQ" + 165 | "aiECIANBBGohAyAFQX9qIgUNAAsLQQBBADYCoLjQgwALAkACQCAAQQBIDQBBACgChLjQgwAiAyAA" + 166 | "TA0AQQAoAoC40IMAQQFIDQEgAyAAa7IgA7KVIQRBACECQQAhA0EAIQgDQEEAIQVBACEAQQAhCQJA" + 167 | "IAJBjIi4gABqKgIAIgYgBF8NAAJAAkAgBiAEkyADQYCIx4AAaioCAJQiBiACQYiIuIAAaioCAJQi" + 168 | "B0MAAIBPXSAHQwAAAABgcUUNACAHqSEJDAELQQAhCQsCQAJAIAYgAkGEiLiAAGoqAgCUIgdDAACA" + 169 | "T10gB0MAAAAAYHFFDQAgB6khAAwBC0EAIQALAkAgBiACQYCIuIAAaioCAJQiBkMAAIBPXSAGQwAA" + 170 | "AABgcUUNACAGqSEFDAELQQAhBQsgA0GDiJCAAGogAToAACADQYKIkIAAaiAJOgAAIANBgYiQgABq" + 171 | "IAA6AAAgA0GAiJCAAGogBToAACACQRBqIQIgA0EEaiEDIAhBAWoiCEEAKAKAuNCDAEgNAAwCCwtB" + 172 | "ACgCgLjQgwBBAUgNAEEAIQNBACECQQAhBQNAIAJBgIi4gABqKgIAIQQgAkGEiLiAAGoqAgAhBiAC" + 173 | "QYiIuIAAaioCACEHIANBg4iQgABqIAE6AAAgA0GCiJCAAGohAAJAAkAgB0MAAIBPXSAHQwAAAABg" + 174 | "cUUNACAHqSEJDAELQQAhCQsgACAJOgAAIANBgYiQgABqIQACQAJAIAZDAACAT10gBkMAAAAAYHFF" + 175 | "DQAgBqkhCQwBC0EAIQkLIAAgCToAACADQYCIkIAAaiEAAkACQCAEQwAAgE9dIARDAAAAAGBxRQ0A" + 176 | "IASpIQkMAQtBACEJCyAAIAk6AAAgA0EEaiEDIAJBEGohAiAFQQFqIgVBACgCgLjQgwBIDQALCwsN" + 177 | "ACAAQf8BEI2AgIAAC1AAQQBDAADIQiABQwAAgD8gAUMAAIA/XhsgAUMAAMhCXhs4Api40IMAQQBD" + 178 | "AADIQiAAQwAAgD8gAEMAAIA/XhsgAEMAAMhCXhs4Apy40IMACyEAQQAgAEEBIABBAUobIgBB4CEg" + 179 | "AEHgIUgbNgKEuNCDAAvpBAgBfwJ9AX8KfQZ/AX0BfwZ9IAAQk4CAgAAgAEGABGoQk4CAgAAgAEGA" + 180 | "CGoQk4CAgAAgAEGADGoQk4CAgAAgAEGEDGoiASoCACECIAEgACoCBCIDIABBhARqIgQqAgAiBZMi" + 181 | "BiAAKgKACCIHIAAqAoAMIgiTIgmSOAIAIAAgACoCACIKIAAqAoAEIguTIgwgAEGECGoiASoCACIN" + 182 | "IAKTIg6TOAKADCABIAMgBZIiAyANIAKSIgKTOAIAIAAgCiALkiIFIAcgCJIiB5M4AoAIIAQgBiAJ" + 183 | "kzgCACAAIAwgDpI4AoAEIAAgAyACkjgCBCAAIAUgB5I4AgBBACEBA0AgACABaiIEQYwMaiIPIARB" + 184 | "DGoiECoCACICIARBiARqIhEqAgAiAyABQYyAkoAAaioCACIFlCABQYiAkoAAaioCACIGIARBjARq" + 185 | "IhIqAgAiB5SSIgiTIgkgAUGIiJKAAGoqAgAiCiAEQYgIaiITKgIAIguUIAFBjIiSgABqKgIAIgwg" + 186 | "BEGMCGoiFCoCACINlJMiDiABQYiEkoAAaioCACIVIARBiAxqIhYqAgAiF5QgAUGMhJKAAGoqAgAi" + 187 | "GCAPKgIAIhmUkyIakyIbkjgCACAWIARBCGoiBCoCACIcIAYgA5QgBSAHlJMiA5MiBSALIAyUIAog" + 188 | "DZSSIgYgFyAYlCAVIBmUkiIHkyIKkzgCACAUIAIgCJIiAiAGIAeSIgaTOAIAIBMgHCADkiIDIA4g" + 189 | "GpIiB5M4AgAgEiAJIBuTOAIAIBEgBSAKkjgCACAQIAIgBpI4AgAgBCADIAeSOAIAIAFBCGoiAUH4" + 190 | "A0cNAAsL6QQIAX8CfQF/Cn0GfwF9AX8GfSAAEJWAgIAAIABBgAhqEJWAgIAAIABBgBBqEJWAgIAA" + 191 | "IABBgBhqEJWAgIAAIABBhBhqIgEqAgAhAiABIAAqAgQiAyAAQYQIaiIEKgIAIgWTIgYgACoCgBAi" + 192 | "ByAAKgKAGCIIkyIJkjgCACAAIAAqAgAiCiAAKgKACCILkyIMIABBhBBqIgEqAgAiDSACkyIOkzgC" + 193 | "gBggASADIAWSIgMgDSACkiICkzgCACAAIAogC5IiBSAHIAiSIgeTOAKAECAEIAYgCZM4AgAgACAM" + 194 | "IA6SOAKACCAAIAMgApI4AgQgACAFIAeSOAIAQQAhAQNAIAAgAWoiBEGMGGoiDyAEQQxqIhAqAgAi" + 195 | "AiAEQYgIaiIRKgIAIgMgAUGMiJKAAGoqAgAiBZQgAUGIiJKAAGoqAgAiBiAEQYwIaiISKgIAIgeU" + 196 | "kiIIkyIJIAFBiJiSgABqKgIAIgogBEGIEGoiEyoCACILlCABQYyYkoAAaioCACIMIARBjBBqIhQq" + 197 | "AgAiDZSTIg4gAUGIkJKAAGoqAgAiFSAEQYgYaiIWKgIAIheUIAFBjJCSgABqKgIAIhggDyoCACIZ" + 198 | "lJMiGpMiG5I4AgAgFiAEQQhqIgQqAgAiHCAGIAOUIAUgB5STIgOTIgUgCyAMlCAKIA2UkiIGIBcg" + 199 | "GJQgFSAZlJIiB5MiCpM4AgAgFCACIAiSIgIgBiAHkiIGkzgCACATIBwgA5IiAyAOIBqSIgeTOAIA" + 200 | "IBIgCSAbkzgCACARIAUgCpI4AgAgECACIAaSOAIAIAQgAyAHkjgCACABQQhqIgFB+AdHDQALC+kE" + 201 | "CAF/An0Bfwp9Bn8BfQF/Bn0gABCUgICAACAAQYABahCUgICAACAAQYACahCUgICAACAAQYADahCU" + 202 | "gICAACAAQYQDaiIBKgIAIQIgASAAKgIEIgMgAEGEAWoiBCoCACIFkyIGIAAqAoACIgcgACoCgAMi" + 203 | "CJMiCZI4AgAgACAAKgIAIgogACoCgAEiC5MiDCAAQYQCaiIBKgIAIg0gApMiDpM4AoADIAEgAyAF" + 204 | "kiIDIA0gApIiApM4AgAgACAKIAuSIgUgByAIkiIHkzgCgAIgBCAGIAmTOAIAIAAgDCAOkjgCgAEg" + 205 | "ACADIAKSOAIEIAAgBSAHkjgCAEEAIQEDQCAAIAFqIgRBjANqIg8gBEEMaiIQKgIAIgIgBEGIAWoi" + 206 | "ESoCACIDIAFBjPqRgABqKgIAIgWUIAFBiPqRgABqKgIAIgYgBEGMAWoiEioCACIHlJIiCJMiCSAB" + 207 | "QYj8kYAAaioCACIKIARBiAJqIhMqAgAiC5QgAUGM/JGAAGoqAgAiDCAEQYwCaiIUKgIAIg2UkyIO" + 208 | "IAFBiPuRgABqKgIAIhUgBEGIA2oiFioCACIXlCABQYz7kYAAaioCACIYIA8qAgAiGZSTIhqTIhuS" + 209 | "OAIAIBYgBEEIaiIEKgIAIhwgBiADlCAFIAeUkyIDkyIFIAsgDJQgCiANlJIiBiAXIBiUIBUgGZSS" + 210 | "IgeTIgqTOAIAIBQgAiAIkiICIAYgB5IiBpM4AgAgEyAcIAOSIgMgDiAakiIHkzgCACASIAkgG5M4" + 211 | "AgAgESAFIAqSOAIAIBAgAiAGkjgCACAEIAMgB5I4AgAgAUEIaiIBQfgARw0ACwvhCQ4GfQF/AX0B" + 212 | "fwR9AX8BfQF/An0BfwN9AX8DfQN/IAAgACoCACIBIAAqAggiApIiAyAAKgIQIgQgACoCGCIFkiIG" + 213 | "kzgCECAAIAMgBpIiAzgCACAAQRxqIgcqAgAhBiAHIAAqAgQiCCAAQQxqIgkqAgAiCpMiCyAEIAWT" + 214 | "IgSSOAIAIAAgASACkyIBIABBFGoiByoCACICIAaTIgWTOAIYIAcgCCAKkiIIIAIgBpIiBpM4AgAg" + 215 | "CSALIASTOAIAIAAgASAFkjgCCCAAIAggBpIiBjgCBCAAIAAqAiAiBSAAKgIoIgiSIgogACoCMCIL" + 216 | "IAAqAjgiDJIiDZIiATgCICAAQTRqIgkqAgAhAiAAQTxqIg4qAgAhBCAOIABBJGoiByoCACIPIABB" + 217 | "LGoiECoCACIRkyISIAsgDJMiC5I4AgAgACAFIAiTIgUgAiAEkyIIkzgCOCAJIA8gEZIiDCACIASS" + 218 | "IgKTOAIAIAAgCiANkzgCMCAQIBIgC5M4AgAgACAFIAiSOAIoIAcgDCACkiICOAIAIABB3ABqIgkq" + 219 | "AgAhBCAAQdQAaiIOKgIAIQUgACoCSCEIIAAqAkAhCiAJIABBxABqIhAqAgAiCyAAQcwAaiITKgIA" + 220 | "IgyTIg0gACoCUCIPIAAqAlgiEZMiEpI4AgAgACAKIAiTIhQgBSAEkyIVkzgCWCAOIAsgDJIiCyAF" + 221 | "IASSIgyTOAIAIAAgCiAIkiIWIA8gEZIiD5M4AlAgEyANIBKTOAIAIAAgFCAVkjgCSCAAQfwAaiIJ" + 222 | "KgIAIQQgAEH0AGoiDioCACEFIAAqAmghCCAAKgJgIQogCSAAQeQAaiITKgIAIg0gAEHsAGoiFyoC" + 223 | "ACIRkyISIAAqAnAiFCAAKgJ4IhWTIhiSOAIAIAAgCiAIkyIZIAUgBJMiGpM4AnggDiANIBGSIg0g" + 224 | "BSAEkiIEkzgCACAAIAogCJIiBSAUIBWSIgiTOAJwIBcgEiAYkzgCACAAIBkgGpI4AmggEyAGIAKT" + 225 | "IgogFiAPkiIPIAUgCJIiBZMiCJI4AgAgACADIAGTIhEgCyAMkiILIA0gBJIiBJMiDJM4AmAgECAG" + 226 | "IAKSIgYgCyAEkiICkzgCACAAIAMgAZIiAyAPIAWSIgGTOAJAIAcgCiAIkzgCACAAIBEgDJI4AiAg" + 227 | "ACAGIAKSOAIEIAAgAyABkjgCAEEAIQcDQCAAIAdqIglB7ABqIg4gCUEMaiIQKgIAIgMgCUEoaiIT" + 228 | "KgIAIgYgB0HM+JGAAGoqAgAiAZQgB0HI+JGAAGoqAgAiAiAJQSxqIhcqAgAiBJSSIgWTIgggB0GI" + 229 | "+ZGAAGoqAgAiCiAJQcgAaiIbKgIAIguUIAdBjPmRgABqKgIAIgwgCUHMAGoiHCoCACINlJMiDyAH" + 230 | "Qej4kYAAaioCACIRIAlB6ABqIh0qAgAiEpQgB0Hs+JGAAGoqAgAiFCAOKgIAIhWUkyIWkyIYkjgC" + 231 | "ACAdIAlBCGoiCSoCACIZIAIgBpQgASAElJMiBpMiASALIAyUIAogDZSSIgIgEiAUlCARIBWUkiIE" + 232 | "kyIKkzgCACAcIAMgBZIiAyACIASSIgKTOAIAIBsgGSAGkiIGIA8gFpIiBJM4AgAgFyAIIBiTOAIA" + 233 | "IBMgASAKkjgCACAQIAMgApI4AgAgCSAGIASSOAIAIAdBCGoiB0EYRw0ACwvpBAgBfwJ9AX8KfQZ/" + 234 | "AX0BfwZ9IAAQloCAgAAgAEGAAmoQloCAgAAgAEGABGoQloCAgAAgAEGABmoQloCAgAAgAEGEBmoi" + 235 | "ASoCACECIAEgACoCBCIDIABBhAJqIgQqAgAiBZMiBiAAKgKABCIHIAAqAoAGIgiTIgmSOAIAIAAg" + 236 | "ACoCACIKIAAqAoACIguTIgwgAEGEBGoiASoCACINIAKTIg6TOAKABiABIAMgBZIiAyANIAKSIgKT" + 237 | "OAIAIAAgCiALkiIFIAcgCJIiB5M4AoAEIAQgBiAJkzgCACAAIAwgDpI4AoACIAAgAyACkjgCBCAA" + 238 | "IAUgB5I4AgBBACEBA0AgACABaiIEQYwGaiIPIARBDGoiECoCACICIARBiAJqIhEqAgAiAyABQYz8" + 239 | "kYAAaioCACIFlCABQYj8kYAAaioCACIGIARBjAJqIhIqAgAiB5SSIgiTIgkgAUGIgJKAAGoqAgAi" + 240 | "CiAEQYgEaiITKgIAIguUIAFBjICSgABqKgIAIgwgBEGMBGoiFCoCACINlJMiDiABQYj+kYAAaioC" + 241 | "ACIVIARBiAZqIhYqAgAiF5QgAUGM/pGAAGoqAgAiGCAPKgIAIhmUkyIakyIbkjgCACAWIARBCGoi" + 242 | "BCoCACIcIAYgA5QgBSAHlJMiA5MiBSALIAyUIAogDZSSIgYgFyAYlCAVIBmUkiIHkyIKkzgCACAU" + 243 | "IAIgCJIiAiAGIAeSIgaTOAIAIBMgHCADkiIDIA4gGpIiB5M4AgAgEiAJIBuTOAIAIBEgBSAKkjgC" + 244 | "ACAQIAIgBpI4AgAgBCADIAeSOAIAIAFBCGoiAUH4AUcNAAsL5gQIAX8CfQF/Cn0GfwF9AX8GfSAA" + 245 | "EJeAgIAAIABBwABqEJeAgIAAIABBgAFqEJeAgIAAIABBwAFqEJeAgIAAIABBxAFqIgEqAgAhAiAB" + 246 | "IAAqAgQiAyAAQcQAaiIEKgIAIgWTIgYgACoCgAEiByAAKgLAASIIkyIJkjgCACAAIAAqAgAiCiAA" + 247 | "KgJAIguTIgwgAEGEAWoiASoCACINIAKTIg6TOALAASABIAMgBZIiAyANIAKSIgKTOAIAIAAgCiAL" + 248 | "kiIFIAcgCJIiB5M4AoABIAQgBiAJkzgCACAAIAwgDpI4AkAgACADIAKSOAIEIAAgBSAHkjgCAEEA" + 249 | "IQEDQCAAIAFqIgRBzAFqIg8gBEEMaiIQKgIAIgIgBEHIAGoiESoCACIDIAFBjPmRgABqKgIAIgWU" + 250 | "IAFBiPmRgABqKgIAIgYgBEHMAGoiEioCACIHlJIiCJMiCSABQYj6kYAAaioCACIKIARBiAFqIhMq" + 251 | "AgAiC5QgAUGM+pGAAGoqAgAiDCAEQYwBaiIUKgIAIg2UkyIOIAFByPmRgABqKgIAIhUgBEHIAWoi" + 252 | "FioCACIXlCABQcz5kYAAaioCACIYIA8qAgAiGZSTIhqTIhuSOAIAIBYgBEEIaiIEKgIAIhwgBiAD" + 253 | "lCAFIAeUkyIDkyIFIAsgDJQgCiANlJIiBiAXIBiUIBUgGZSSIgeTIgqTOAIAIBQgAiAIkiICIAYg" + 254 | "B5IiBpM4AgAgEyAcIAOSIgMgDiAakiIHkzgCACASIAkgG5M4AgAgESAFIAqSOAIAIBAgAiAGkjgC" + 255 | "ACAEIAMgB5I4AgAgAUEIaiIBQThHDQALC9EECwN9AX8NfQF/AX0BfwF9AX8BfQF/A30gACAAKgIA" + 256 | "IgEgACoCCCICkyIDOAIIIABBDGoiBCAAKgIEIgUgBCoCACIGkyIHOAIAIAAgASACkiIBIAAqAhAi" + 257 | "AiAAKgIYIgiSIgmSIgogACoCICILIAAqAigiDJIiDSAAKgIwIg4gACoCOCIPkiIQkiIRkjgCACAA" + 258 | "IAogEZM4AiAgAEEUaiISIAUgBpIiBSASKgIAIgYgAEEcaiISKgIAIgqSIhGTIhMgDSAQkyINkzgC" + 259 | "ACAAQSRqIhQgBSARkiIFIBQqAgAiECAAQSxqIhQqAgAiEZIiFSAAQTRqIhYqAgAiFyAAQTxqIhgq" + 260 | "AgAiGZIiGpIiG5M4AgAgACABIAmTIgEgFSAakyIJkzgCMCAWIBMgDZI4AgAgACABIAmSOAIQIAAg" + 261 | "BSAbkjgCBCAYIAcgAiAIkyIBQQAqAqz4kYAAIgKUQQAqAqj4kYAAIgUgBiAKkyIGlJIiCJMiCUEA" + 262 | "KgLI+JGAACIKIAsgDJMiC5RBACoCzPiRgAAiDCAQIBGTIg2UkyIQQQAqArj4kYAAIhEgDiAPkyIO" + 263 | "lEEAKgK8+JGAACIPIBcgGZMiE5STIhWTIheSOAIAIAAgAyAFIAGUIAIgBpSTIgGTIgIgCyAMlCAK" + 264 | "IA2UkiIFIA4gD5QgESATlJIiBpMiCpM4AjggFCAHIAiSIgcgBSAGkiIFkzgCACAAIAMgAZIiAyAQ" + 265 | "IBWSIgGTOAIoIBIgCSAXkzgCACAAIAIgCpI4AhggBCAHIAWSOAIAIAAgAyABkjgCCAsAtQIEbmFt" + 266 | "ZQGtAhgAA2xvZwEDY29zAgNzaW4DA2V4cAQPZ2V0X2lucHV0X2FycmF5BRBnZXRfb3V0cHV0X2Fy" + 267 | "cmF5Bg9nZXRfY29sb3JfYXJyYXkHBGluaXQIBGNhbGMJDWZmdF9jYWxjXzQwOTYKDWZmdF9jYWxj" + 268 | "XzgxOTILDWZmdF9jYWxjXzEwMjQMDWZmdF9jYWxjXzIwNDgNEXJlbmRlcl9saW5lX2FscGhhDhJy" + 269 | "ZW5kZXJfbGluZV9vcGFxdWUPCnNldF92b2x1bWUQCnNldF9oZWlnaHQRDGZmdF9jYWxjXzI1NhIM" + 270 | "ZmZ0X2NhbGNfNTEyEwtmZnRfY2FsY182NBQLZmZ0X2NhbGNfMTYVDGZmdF9jYWxjXzEyOBYLZmZ0" + 271 | "X2NhbGNfMzIXCmZmdF9jYWxjXzgAPQlwcm9kdWNlcnMBDHByb2Nlc3NlZC1ieQEFY2xhbmcdMTAu" + 272 | "MC4wIChGZWRvcmEgMTAuMC4wLTEuZmMzMik="; 273 | 274 | let decode64 = function(b64) { 275 | var str = atob(b64); 276 | var buf = new Uint8Array(str.length); 277 | for (var k = 0; k < str.length; k++) 278 | buf[k] = str.charCodeAt(k); 279 | return buf; 280 | } 281 | 282 | let wasm_module_promise = WebAssembly.compile(decode64(wasm_embedded_base64)); 283 | let wasm_imports = { 284 | env: { 285 | cos: Math.cos, 286 | sin: Math.sin, 287 | log: Math.log, 288 | exp: Math.exp 289 | } 290 | }; 291 | 292 | let invalid_func = function() { 293 | throw new Error("ShowCQT is not initialized"); 294 | } 295 | 296 | let cqt_uninit = function(cqt) { 297 | cqt.fft_size = 0; 298 | cqt.width = 0; 299 | cqt.inputs = null; 300 | cqt.output = null; 301 | cqt.color = null; 302 | cqt.calc = invalid_func; 303 | cqt.render_line_alpha = invalid_func; 304 | cqt.render_line_opaque = invalid_func; 305 | cqt.set_height = invalid_func; 306 | cqt.set_volume = invalid_func; 307 | } 308 | 309 | var ShowCQTRef = { 310 | instantiate: async function() { 311 | var instance = await WebAssembly.instantiate(await wasm_module_promise, wasm_imports); 312 | var exports = instance.exports; 313 | var buffer = exports.memory.buffer; 314 | 315 | var retval = { 316 | init: function(rate, width, height, bar_v, sono_v, supersampling) { 317 | cqt_uninit(this); 318 | this.fft_size = exports.init(rate, width, height, bar_v, sono_v, supersampling); 319 | if (!this.fft_size) 320 | throw new Error("ShowCQT init: cannot initialize ShowCQT"); 321 | this.width = width; 322 | this.inputs = [ 323 | new Float32Array(buffer, exports.get_input_array(0), this.fft_size), 324 | new Float32Array(buffer, exports.get_input_array(1), this.fft_size) 325 | ]; 326 | this.color = new Float32Array(buffer, exports.get_color_array(), this.width * 4); 327 | this.output = new Uint8ClampedArray(buffer, exports.get_output_array(), this.width * 4); 328 | this.calc = exports.calc; 329 | this.render_line_alpha = exports.render_line_alpha; 330 | this.render_line_opaque = exports.render_line_opaque; 331 | this.set_height = exports.set_height; 332 | this.set_volume = exports.set_volume; 333 | } 334 | }; 335 | cqt_uninit(retval); 336 | return retval; 337 | } 338 | }; 339 | } 340 | 341 | export default ShowCQTRef; 342 | export {ShowCQTRef}; 343 | -------------------------------------------------------------------------------- /showcqt.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright (c) 2020 Muhammad Faiz 3 | * 4 | * This library is free software; you can redistribute it and/or 5 | * modify it under the terms of the GNU Lesser General Public 6 | * License as published by the Free Software Foundation; either 7 | * version 3 of the License, or (at your option) any later version. 8 | * 9 | * This library is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * Lesser General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU Lesser General Public 15 | * License along with this library; if not, write to the Free Software 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17 | */ 18 | 19 | /* Audio visualization based on showcqt mpv/ffmpeg audio visualization */ 20 | /* See https://github.com/FFmpeg/FFmpeg/blob/master/libavfilter/avf_showcqt.c */ 21 | 22 | #include 23 | #include "showcqt.h" 24 | 25 | static DECLARE_ALIGNED(1024) ShowCQT cqt; 26 | 27 | WASM_EXPORT float *get_input_array(int index) 28 | { 29 | return cqt.input[!!index]; 30 | } 31 | 32 | WASM_EXPORT unsigned *get_output_array(void) 33 | { 34 | return cqt.output; 35 | } 36 | 37 | WASM_EXPORT ColorF *get_color_array(void) 38 | { 39 | return cqt.color_buf; 40 | } 41 | 42 | static unsigned revbin(unsigned x, int bits) 43 | { 44 | unsigned m = 0x55555555; 45 | x = ((x & m) << 1) | ((x & ~m) >> 1); 46 | m = 0x33333333; 47 | x = ((x & m) << 2) | ((x & ~m) >> 2); 48 | m = 0x0F0F0F0F; 49 | x = ((x & m) << 4) | ((x & ~m) >> 4); 50 | m = 0x00FF00FF; 51 | x = ((x & m) << 8) | ((x & ~m) >> 8); 52 | m = 0x0000FFFF; 53 | x = ((x & m) << 16) | ((x & ~m) >> 16); 54 | return (x >> (32 - bits)) & ((1 << bits) - 1); 55 | } 56 | 57 | static void gen_perm_tbl(int bits) 58 | { 59 | int n = 1 << bits; 60 | for (int x = 0; x < n; x++) 61 | cqt.perm_tbl[x] = revbin(x, bits); 62 | } 63 | 64 | #define C_ADD(a, b) (Complex){ (a).re + (b).re, (a).im + (b).im } 65 | #define C_SUB(a, b) (Complex){ (a).re - (b).re, (a).im - (b).im } 66 | #define C_MUL(a, b) (Complex){ (a).re * (b).re - (a).im * (b).im, (a).re * (b).im + (a).im * (b).re } 67 | #define C_AIM(a, b) (Complex){ (a).re - (b).im, (a).im + (b).re } 68 | #define C_SIM(a, b) (Complex){ (a).re + (b).im, (a).im - (b).re } 69 | 70 | #if WASM_SIMD 71 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_add(Complex4 a, Complex4 b) 72 | { 73 | return (Complex4){ a.re + b.re, a.im + b.im }; 74 | } 75 | 76 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_sub(Complex4 a, Complex4 b) 77 | { 78 | return (Complex4){ a.re - b.re, a.im - b.im }; 79 | } 80 | 81 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_mul(Complex4 a, Complex4 b) 82 | { 83 | return (Complex4){ a.re * b.re - a.im * b.im, a.re * b.im + a.im * b.re }; 84 | } 85 | 86 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_aim(Complex4 a, Complex4 b) 87 | { 88 | return (Complex4){ a.re - b.im, a.im + b.re }; 89 | } 90 | 91 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_sim(Complex4 a, Complex4 b) 92 | { 93 | return (Complex4){ a.re + b.im, a.im - b.re }; 94 | } 95 | 96 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_load_c(const Complex *v, int sh) 97 | { 98 | float32x4 a = *(const float32x4 *)(v); 99 | float32x4 b = *(const float32x4 *)(v+2); 100 | return sh ? (Complex4){ __builtin_shufflevector(a, b, 0, 2, 4, 6), __builtin_shufflevector(a, b, 1, 3, 5, 7) } 101 | : (Complex4){ a, b }; 102 | } 103 | 104 | static ALWAYS_INLINE WASM_SIMD_FUNCTION void c4_store_c(Complex *v, Complex4 c, int sh) 105 | { 106 | *(float32x4 *)(v) = sh ? __builtin_shufflevector(c.re, c.im, 0, 4, 1, 5) : c.re; 107 | *(float32x4 *)(v+2) = sh ? __builtin_shufflevector(c.re, c.im, 2, 6, 3, 7) : c.im; 108 | } 109 | 110 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_load_uc(const Complex *v) 111 | { 112 | float32x4 a = *(const float32x4u *)(v); 113 | float32x4 b = *(const float32x4u *)(v+2); 114 | return (Complex4){ __builtin_shufflevector(a, b, 0, 2, 4, 6), __builtin_shufflevector(a, b, 1, 3, 5, 7) }; 115 | } 116 | 117 | static ALWAYS_INLINE WASM_SIMD_FUNCTION Complex4 c4_load_uc_reverse(const Complex *v) 118 | { 119 | float32x4 a = *(const float32x4u *)(v); 120 | float32x4 b = *(const float32x4u *)(v+2); 121 | return (Complex4){ __builtin_shufflevector(b, a, 2, 0, 6, 4), __builtin_shufflevector(b, a, 3, 1, 7, 5) }; 122 | } 123 | #endif 124 | 125 | static WASM_SIMD_FUNCTION void gen_exp_tbl(int n) 126 | { 127 | for (int k = 16; k <= n; k *= 4) { 128 | int q = k/4; 129 | double mul; 130 | for (int j = 1; j < 4; j++) 131 | for (int x = 0; x < q; x++) 132 | mul = 2 * j * M_PI / k, cqt.exp_tbl[j*q+x] = (Complex){ cos(mul*x), -sin(mul*x) }; 133 | 134 | if (k * 2 == n) 135 | for (int x = 0; x < k; x++) 136 | mul = M_PI / k, cqt.exp_tbl[k+x] = (Complex){ cos(mul*x), -sin(mul*x) }; 137 | } 138 | 139 | #if WASM_SIMD 140 | for (int x = 4; x < n; x += 4) { 141 | Complex4 v = c4_load_c(cqt.exp_tbl+x, 1); 142 | c4_store_c(cqt.exp_tbl+x, v, 0); 143 | } 144 | #endif 145 | } 146 | 147 | static ALWAYS_INLINE void fft_butterfly(Complex *restrict v, unsigned n, unsigned q) 148 | { 149 | const Complex *restrict e2 = cqt.exp_tbl + 2*q; 150 | const Complex *restrict e3 = cqt.exp_tbl + 3*q; 151 | const Complex *restrict e1 = cqt.exp_tbl + 1*q; 152 | Complex v0, v1, v2, v3; 153 | Complex a02, a13, s02, s13; 154 | 155 | v0 = v[0]; 156 | v2 = v[q]; /* bit reversed */ 157 | v1 = v[2*q]; 158 | v3 = v[3*q]; 159 | a02 = C_ADD(v0, v2); 160 | s02 = C_SUB(v0, v2); 161 | a13 = C_ADD(v1, v3); 162 | s13 = C_SUB(v1, v3); 163 | v[0] = C_ADD(a02, a13); 164 | v[q] = C_SIM(s02, s13); 165 | v[2*q] = C_SUB(a02, a13); 166 | v[3*q] = C_AIM(s02, s13); 167 | 168 | for (int x = 1; x < q; x++) { 169 | v0 = v[x]; 170 | v2 = C_MUL(e2[x], v[q+x]); /* bit reversed */ 171 | v1 = C_MUL(e1[x], v[2*q+x]); 172 | v3 = C_MUL(e3[x], v[3*q+x]); 173 | a02 = C_ADD(v0, v2); 174 | s02 = C_SUB(v0, v2); 175 | a13 = C_ADD(v1, v3); 176 | s13 = C_SUB(v1, v3); 177 | v[x] = C_ADD(a02, a13); 178 | v[q+x] = C_SIM(s02, s13); 179 | v[2*q+x] = C_SUB(a02, a13); 180 | v[3*q+x] = C_AIM(s02, s13); 181 | } 182 | } 183 | 184 | static ALWAYS_INLINE void fft_butterfly2(Complex *restrict v, unsigned n, unsigned h) 185 | { 186 | const Complex *restrict e = cqt.exp_tbl + h; 187 | Complex v0 = v[0], v1 = v[h]; 188 | 189 | v[0] = C_ADD(v0, v1); 190 | v[h] = C_SUB(v0, v1); 191 | 192 | for (int x = 1; x < h; x++) { 193 | v0 = v[x]; 194 | v1 = C_MUL(e[x], v[h+x]); 195 | v[x] = C_ADD(v0, v1); 196 | v[h+x] = C_SUB(v0, v1); 197 | } 198 | } 199 | 200 | #define FFT_CALC_FUNC(n, q) \ 201 | static void fft_calc_ ## n(Complex *restrict v) \ 202 | { \ 203 | fft_calc_ ## q(v); \ 204 | fft_calc_ ## q(q+v); \ 205 | fft_calc_ ## q(2*q+v); \ 206 | fft_calc_ ## q(3*q+v); \ 207 | fft_butterfly(v, n, q); \ 208 | } 209 | 210 | #define FFT_CALC2_FUNC(n, h) \ 211 | static void fft_calc_ ## n(Complex *restrict v) \ 212 | { \ 213 | fft_calc_ ## h(v); \ 214 | fft_calc_ ## h(v+h); \ 215 | fft_butterfly2(v, n, h); \ 216 | } 217 | 218 | #if !WASM_SIMD 219 | static void fft_calc_1024(Complex *restrict v) 220 | { 221 | for (int k = 0; k < 1024; k += 4) 222 | fft_butterfly(v+k, 4, 1); 223 | for (int k = 0; k < 1024; k += 16) 224 | fft_butterfly(v+k, 16, 4); 225 | for (int k = 0; k < 1024; k += 64) 226 | fft_butterfly(v+k, 64, 16); 227 | for (int k = 0; k < 1024; k += 256) 228 | fft_butterfly(v+k, 256, 64); 229 | fft_butterfly(v, 1024, 256); 230 | } 231 | 232 | FFT_CALC_FUNC(4096, 1024) 233 | FFT_CALC_FUNC(16384, 4096) 234 | 235 | FFT_CALC2_FUNC(8192, 4096) 236 | FFT_CALC2_FUNC(32768, 16384) 237 | #else 238 | 239 | static ALWAYS_INLINE WASM_SIMD_FUNCTION void fft_butterfly_simd(Complex *restrict v, unsigned n, unsigned q, int sh) 240 | { 241 | const Complex *restrict e2 = cqt.exp_tbl + 2*q; 242 | const Complex *restrict e3 = cqt.exp_tbl + 3*q; 243 | const Complex *restrict e1 = cqt.exp_tbl + 1*q; 244 | Complex4 v0, v1, v2, v3; 245 | Complex4 a02, a13, s02, s13; 246 | 247 | for (int x = 0; x < q; x += 4) { 248 | v0 = c4_load_c(v+x, 0); 249 | v2 = c4_mul(c4_load_c(e2+x, 0), c4_load_c(v+q+x, 0)); /* bit reversed */ 250 | v1 = c4_mul(c4_load_c(e1+x, 0), c4_load_c(v+2*q+x, 0)); 251 | v3 = c4_mul(c4_load_c(e3+x, 0), c4_load_c(v+3*q+x, 0)); 252 | a02 = c4_add(v0, v2); 253 | s02 = c4_sub(v0, v2); 254 | a13 = c4_add(v1, v3); 255 | s13 = c4_sub(v1, v3); 256 | c4_store_c(v+x, c4_add(a02, a13), sh); 257 | c4_store_c(v+q+x, c4_sim(s02, s13), sh); 258 | c4_store_c(v+2*q+x, c4_sub(a02, a13), sh); 259 | c4_store_c(v+3*q+x, c4_aim(s02, s13), sh); 260 | } 261 | } 262 | 263 | static ALWAYS_INLINE WASM_SIMD_FUNCTION void fft_butterfly2_simd(Complex *restrict v, unsigned n, unsigned h) 264 | { 265 | const Complex *restrict e = cqt.exp_tbl + h; 266 | Complex4 v0, v1; 267 | 268 | for (int x = 0; x < h; x += 4) { 269 | v0 = c4_load_c(v+x, 0); 270 | v1 = c4_mul(c4_load_c(e+x, 0), c4_load_c(v+h+x, 0)); 271 | c4_store_c(v+x, c4_add(v0, v1), 1); 272 | c4_store_c(v+h+x, c4_sub(v0, v1), 1); 273 | } 274 | } 275 | 276 | static ALWAYS_INLINE WASM_SIMD_FUNCTION void fft_calc_16_0(Complex *restrict v) 277 | { 278 | const Complex *restrict e2 = cqt.exp_tbl + 2*4; 279 | const Complex *restrict e3 = cqt.exp_tbl + 3*4; 280 | const Complex *restrict e1 = cqt.exp_tbl + 1*4; 281 | Complex4 v0, v1, v2, v3; 282 | Complex4 a02, a13, s02, s13; 283 | 284 | /* butterfly 4 */ { 285 | float32x4 *vf = (float32x4 *) v; 286 | float32x4 r0145 = __builtin_shufflevector(vf[0], vf[2], 0, 2, 4, 6); 287 | float32x4 i0145 = __builtin_shufflevector(vf[0], vf[2], 1, 3, 5, 7); 288 | float32x4 r2367 = __builtin_shufflevector(vf[1], vf[3], 0, 2, 4, 6); 289 | float32x4 i2367 = __builtin_shufflevector(vf[1], vf[3], 1, 3, 5, 7); 290 | float32x4 r89cd = __builtin_shufflevector(vf[4], vf[6], 0, 2, 4, 6); 291 | float32x4 i89cd = __builtin_shufflevector(vf[4], vf[6], 1, 3, 5, 7); 292 | float32x4 rabef = __builtin_shufflevector(vf[5], vf[7], 0, 2, 4, 6); 293 | float32x4 iabef = __builtin_shufflevector(vf[5], vf[7], 1, 3, 5, 7); 294 | 295 | v0 = (Complex4){__builtin_shufflevector(r0145, r89cd, 0, 2, 4, 6), __builtin_shufflevector(i0145, i89cd, 0, 2, 4, 6)}; 296 | v2 = (Complex4){__builtin_shufflevector(r0145, r89cd, 1, 3, 5, 7), __builtin_shufflevector(i0145, i89cd, 1, 3, 5, 7)}; 297 | v1 = (Complex4){__builtin_shufflevector(r2367, rabef, 0, 2, 4, 6), __builtin_shufflevector(i2367, iabef, 0, 2, 4, 6)}; 298 | v3 = (Complex4){__builtin_shufflevector(r2367, rabef, 1, 3, 5, 7), __builtin_shufflevector(i2367, iabef, 1, 3, 5, 7)}; 299 | 300 | a02 = c4_add(v0, v2); 301 | s02 = c4_sub(v0, v2); 302 | a13 = c4_add(v1, v3); 303 | s13 = c4_sub(v1, v3); 304 | 305 | v0 = c4_add(a02, a13); // 0,4,8,c 306 | v1 = c4_sim(s02, s13); // 1,5,9,d 307 | v2 = c4_sub(a02, a13); // 2,6,a,e 308 | v3 = c4_aim(s02, s13); // 3,7,b,f 309 | 310 | float32x4 r0819 = __builtin_shufflevector(v0.re, v1.re, 0, 2, 4, 6); 311 | float32x4 r4c5d = __builtin_shufflevector(v0.re, v1.re, 1, 3, 5, 7); 312 | float32x4 i0819 = __builtin_shufflevector(v0.im, v1.im, 0, 2, 4, 6); 313 | float32x4 i4c5d = __builtin_shufflevector(v0.im, v1.im, 1, 3, 5, 7); 314 | float32x4 r2a3b = __builtin_shufflevector(v2.re, v3.re, 0, 2, 4, 6); 315 | float32x4 r6e7f = __builtin_shufflevector(v2.re, v3.re, 1, 3, 5, 7); 316 | float32x4 i2a3b = __builtin_shufflevector(v2.im, v3.im, 0, 2, 4, 6); 317 | float32x4 i6e7f = __builtin_shufflevector(v2.im, v3.im, 1, 3, 5, 7); 318 | 319 | v0.re = __builtin_shufflevector(r0819, r2a3b, 0, 2, 4, 6); 320 | v1.re = __builtin_shufflevector(r0819, r2a3b, 1, 3, 5, 7); 321 | v2.re = __builtin_shufflevector(r4c5d, r6e7f, 0, 2, 4, 6); 322 | v3.re = __builtin_shufflevector(r4c5d, r6e7f, 1, 3, 5, 7); 323 | v0.im = __builtin_shufflevector(i0819, i2a3b, 0, 2, 4, 6); 324 | v1.im = __builtin_shufflevector(i0819, i2a3b, 1, 3, 5, 7); 325 | v2.im = __builtin_shufflevector(i4c5d, i6e7f, 0, 2, 4, 6); 326 | v3.im = __builtin_shufflevector(i4c5d, i6e7f, 1, 3, 5, 7); 327 | } 328 | 329 | v2 = c4_mul(c4_load_c(e2, 0), v2); /* bit reversed */ 330 | v1 = c4_mul(c4_load_c(e1, 0), v1); 331 | v3 = c4_mul(c4_load_c(e3, 0), v3); 332 | a02 = c4_add(v0, v2); 333 | s02 = c4_sub(v0, v2); 334 | a13 = c4_add(v1, v3); 335 | s13 = c4_sub(v1, v3); 336 | c4_store_c(v, c4_add(a02, a13), 0); 337 | c4_store_c(v+4, c4_sim(s02, s13), 0); 338 | c4_store_c(v+2*4, c4_sub(a02, a13), 0); 339 | c4_store_c(v+3*4, c4_aim(s02, s13), 0); 340 | } 341 | 342 | #define FFT_CALC_FUNC_SIMD(n, q, sh) \ 343 | static WASM_SIMD_FUNCTION void fft_calc_ ## n ## _ ## sh(Complex *restrict v) \ 344 | { \ 345 | fft_calc_ ## q ## _0(v); \ 346 | fft_calc_ ## q ## _0(q+v); \ 347 | fft_calc_ ## q ## _0(2*q+v); \ 348 | fft_calc_ ## q ## _0(3*q+v); \ 349 | fft_butterfly_simd(v, n, q, sh); \ 350 | } 351 | 352 | #define FFT_CALC2_FUNC_SIMD(n, h) \ 353 | static WASM_SIMD_FUNCTION void fft_calc_ ## n(Complex *restrict v) \ 354 | { \ 355 | fft_calc_ ## h ## _0(v); \ 356 | fft_calc_ ## h ## _0(v+h); \ 357 | fft_butterfly2_simd(v, n, h); \ 358 | } 359 | 360 | static WASM_SIMD_FUNCTION void fft_calc_1024_0(Complex *restrict v) 361 | { 362 | for (int k = 0; k < 1024; k += 16) 363 | fft_calc_16_0(v+k); 364 | for (int k = 0; k < 1024; k += 64) 365 | fft_butterfly_simd(v+k, 64, 16, 0); 366 | for (int k = 0; k < 1024; k += 256) 367 | fft_butterfly_simd(v+k, 256, 64, 0); 368 | fft_butterfly_simd(v, 1024, 256, 0); 369 | } 370 | 371 | FFT_CALC_FUNC_SIMD(4096, 1024, 0) 372 | FFT_CALC_FUNC_SIMD(16384, 4096, 0) 373 | 374 | FFT_CALC_FUNC_SIMD(4096, 1024, 1) 375 | FFT_CALC_FUNC_SIMD(16384, 4096, 1) 376 | 377 | FFT_CALC2_FUNC_SIMD(8192, 4096) 378 | FFT_CALC2_FUNC_SIMD(32768, 16384) 379 | 380 | #define fft_calc_4096 fft_calc_4096_1 381 | #define fft_calc_16384 fft_calc_16384_1 382 | #endif 383 | 384 | static void fft_calc(Complex *restrict v, int n) 385 | { 386 | switch (n) { 387 | case 4096: fft_calc_4096(v); break; 388 | case 8192: fft_calc_8192(v); break; 389 | case 16384: fft_calc_16384(v); break; 390 | case 32768: fft_calc_32768(v); break; 391 | } 392 | } 393 | 394 | WASM_EXPORT int init(int rate, int width, int height, float bar_v, float sono_v, int super) 395 | { 396 | memory_expand(-1); 397 | if (height <= 0 || height > MAX_HEIGHT || width <= 0 || width > MAX_WIDTH) 398 | return 0; 399 | 400 | cqt.width = width; 401 | cqt.height = height; 402 | cqt.aligned_width = WASM_SIMD ? 4 * ceil(width * 0.25) : width; 403 | 404 | cqt.bar_v = (bar_v > MAX_VOL) ? MAX_VOL : (bar_v > MIN_VOL) ? bar_v : MIN_VOL; 405 | cqt.sono_v = (sono_v > MAX_VOL) ? MAX_VOL : (sono_v > MIN_VOL) ? sono_v : MIN_VOL; 406 | 407 | if (rate < 8000 || rate > 100000) 408 | return 0; 409 | 410 | int bits = ceil(log(rate * 0.33)/ M_LN2); 411 | if (bits > 20 || bits < 12) 412 | return 0; 413 | cqt.fft_size = 1 << bits; 414 | if (cqt.fft_size > MAX_FFT_SIZE) 415 | return 0; 416 | 417 | gen_perm_tbl(bits - 2); 418 | gen_exp_tbl(cqt.fft_size); 419 | 420 | cqt.attack_size = ceil(rate * 0.033); 421 | for (int x = 0; x < cqt.attack_size; x++) { 422 | double y = M_PI * x / (rate * 0.033); 423 | cqt.attack_tbl[x] = 0.355768 + 0.487396 * cos(y) + 0.144232 * cos(2*y) + 0.012604 * cos(3*y); 424 | } 425 | 426 | cqt.kernel = memory_expand(0); 427 | cqt.t_size = cqt.width * (1 + !!super); 428 | double log_base = log(20.01523126408007475); 429 | double log_end = log(20495.59681441799654); 430 | for (int f = 0, idx = 0; f < cqt.t_size; f++) { 431 | double freq = exp(log_base + (f + 0.5) * (log_end - log_base) * (1.0/cqt.t_size)); 432 | 433 | if (freq >= 0.5 * rate) { 434 | cqt.kernel_index[f].len = 0; 435 | cqt.kernel_index[f].start = 0; 436 | continue; 437 | } 438 | 439 | double tlen = 384*0.33 / (384/0.17 + 0.33*freq/(1-0.17)) + 384*0.33 / (0.33*freq/0.17 + 384/(1-0.17)); 440 | double flen = 8.0 * cqt.fft_size / (tlen * rate); 441 | double center = freq * cqt.fft_size / rate; 442 | int start = ceil(center - 0.5*flen); 443 | int end = floor(center + 0.5*flen); 444 | int len = end - start + 1; 445 | len = WASM_SIMD ? 4 * ceil(len * 0.25) : len; 446 | memory_expand(len * sizeof(float)); 447 | 448 | cqt.kernel_index[f].len = len; 449 | cqt.kernel_index[f].start = start; 450 | 451 | for (int x = start; x < start + len; x++) { 452 | if (x > end) { 453 | cqt.kernel[idx+x-start] = 0; 454 | continue; 455 | } 456 | int sign = (x & 1) ? (-1) : 1; 457 | double y = 2.0 * M_PI * (x - center) * (1.0 / flen); 458 | double w = 0.355768 + 0.487396 * cos(y) + 0.144232 * cos(2*y) + 0.012604 * cos(3*y); 459 | w *= sign * (1.0/cqt.fft_size); 460 | cqt.kernel[idx+x-start] = w; 461 | } 462 | 463 | idx += len; 464 | } 465 | return cqt.fft_size; 466 | } 467 | 468 | #if !WASM_SIMD 469 | static Complex cqt_calc(const float *kernel, int start, int len) 470 | { 471 | Complex a = { 0, 0 }, b = { 0, 0 }; 472 | 473 | for (int m = 0, i = start, j = cqt.fft_size - start; m < len; m++, i++, j--) { 474 | float u = kernel[m]; 475 | a.re += u * cqt.fft_buf[i].re; 476 | a.im += u * cqt.fft_buf[i].im; 477 | b.re += u * cqt.fft_buf[j].re; 478 | b.im += u * cqt.fft_buf[j].im; 479 | } 480 | 481 | Complex v0 = { a.re + b.re, a.im - b.im }; 482 | Complex v1 = { b.im + a.im, b.re - a.re }; 483 | float r0 = v0.re*v0.re + v0.im*v0.im; 484 | float r1 = v1.re*v1.re + v1.im*v1.im; 485 | return (Complex){ r0, r1 }; 486 | } 487 | #else 488 | static WASM_SIMD_FUNCTION Complex cqt_calc(const float *kernel, int start, int len) 489 | { 490 | Complex4 a = { { 0, 0, 0, 0 }, { 0, 0, 0, 0 } }; 491 | Complex4 b = a; 492 | 493 | for (int m = 0, i = start, j = cqt.fft_size - start - 3; m < len; m += 4, i += 4, j -= 4) { 494 | float32x4 u = *(const float32x4 *)(kernel + m); 495 | Complex4 vi = c4_load_uc(cqt.fft_buf + i); 496 | Complex4 vj = c4_load_uc_reverse(cqt.fft_buf + j); 497 | a.re += u * vi.re; 498 | a.im += u * vi.im; 499 | b.re += u * vj.re; 500 | b.im += u * vj.im; 501 | } 502 | 503 | Complex4 v0 = { a.re + b.re, a.im - b.im }; 504 | Complex4 v1 = { b.im + a.im, b.re - a.re }; 505 | float32x4 v0a = __builtin_shufflevector(v0.re, v0.im, 0, 2, 4, 6); 506 | float32x4 v0b = __builtin_shufflevector(v0.re, v0.im, 1, 3, 5, 7); 507 | float32x4 v0c = v0a + v0b; 508 | float32x4 v1a = __builtin_shufflevector(v1.re, v1.im, 0, 2, 4, 6); 509 | float32x4 v1b = __builtin_shufflevector(v1.re, v1.im, 1, 3, 5, 7); 510 | float32x4 v1c = v1a + v1b; 511 | float32x4 v2a = __builtin_shufflevector(v0c, v1c, 0, 2, 4, 6); 512 | float32x4 v2b = __builtin_shufflevector(v0c, v1c, 1, 3, 5, 7); 513 | float32x4 v2c = v2a + v2b; 514 | v2c *= v2c; 515 | float32x4 v3a = __builtin_shufflevector(v2c, v2c, 0, 2, 4, 6); 516 | float32x4 v3b = __builtin_shufflevector(v2c, v2c, 1, 3, 4, 6); 517 | float32x4 v3c = v3a + v3b; 518 | return (Complex){ v3c[0], v3c[1] }; 519 | } 520 | #endif 521 | 522 | WASM_EXPORT WASM_SIMD_FUNCTION void calc(void) 523 | { 524 | int fft_size_h = cqt.fft_size >> 1; 525 | int fft_size_q = cqt.fft_size >> 2; 526 | int shift = fft_size_h - cqt.attack_size; 527 | 528 | for (int x = 0; x < cqt.attack_size; x++) { 529 | int i = 4 * cqt.perm_tbl[x]; 530 | cqt.fft_buf[i] = (Complex){ cqt.input[0][shift+x], cqt.input[1][shift+x] }; 531 | cqt.fft_buf[i+1].re = cqt.attack_tbl[x] * cqt.input[0][fft_size_h+shift+x]; 532 | cqt.fft_buf[i+1].im = cqt.attack_tbl[x] * cqt.input[1][fft_size_h+shift+x]; 533 | cqt.fft_buf[i+2] = (Complex){ cqt.input[0][fft_size_q+shift+x], cqt.input[1][fft_size_q+shift+x] }; 534 | cqt.fft_buf[i+3] = (Complex){0,0}; 535 | } 536 | 537 | for (int x = cqt.attack_size; x < fft_size_q; x++) { 538 | int i = 4 * cqt.perm_tbl[x]; 539 | cqt.fft_buf[i] = (Complex){ cqt.input[0][shift+x], cqt.input[1][shift+x] }; 540 | cqt.fft_buf[i+1] = (Complex){0,0}; 541 | cqt.fft_buf[i+2] = (Complex){ cqt.input[0][fft_size_q+shift+x], cqt.input[1][fft_size_q+shift+x] }; 542 | cqt.fft_buf[i+3] = (Complex){0,0}; 543 | } 544 | 545 | fft_calc(cqt.fft_buf, cqt.fft_size); 546 | 547 | const float *kernel = cqt.kernel; 548 | for (int x = 0; x < cqt.t_size; x++) { 549 | int len = cqt.kernel_index[x].len; 550 | int start = cqt.kernel_index[x].start; 551 | if (!len) { 552 | cqt.color_buf[x] = (ColorF){0,0,0,0}; 553 | continue; 554 | } 555 | 556 | Complex r = cqt_calc(kernel, start, len); 557 | 558 | cqt.color_buf[x].r = sqrtf(cqt.sono_v * sqrtf(r.re)); 559 | cqt.color_buf[x].g = sqrtf(cqt.sono_v * sqrtf(0.5f * (r.re + r.im))); 560 | cqt.color_buf[x].b = sqrtf(cqt.sono_v * sqrtf(r.im)); 561 | cqt.color_buf[x].h = cqt.bar_v * sqrtf(0.5f * (r.re + r.im)); 562 | 563 | kernel += len; 564 | } 565 | 566 | if (cqt.t_size != cqt.width) { 567 | for (int x = 0; x < cqt.width; x++) { 568 | cqt.color_buf[x].r = 0.5f * (cqt.color_buf[2*x].r + cqt.color_buf[2*x+1].r); 569 | cqt.color_buf[x].g = 0.5f * (cqt.color_buf[2*x].g + cqt.color_buf[2*x+1].g); 570 | cqt.color_buf[x].b = 0.5f * (cqt.color_buf[2*x].b + cqt.color_buf[2*x+1].b); 571 | cqt.color_buf[x].h = 0.5f * (cqt.color_buf[2*x].h + cqt.color_buf[2*x+1].h); 572 | } 573 | } 574 | 575 | cqt.prerender = 1; 576 | } 577 | 578 | static void prerender(void) 579 | { 580 | for (int x = 0; x < cqt.width; x++) { 581 | ColorF *c = cqt.color_buf; 582 | c[x].r = 255.5f * (c[x].r >= 0.0f ? (c[x].r <= 1.0f ? c[x].r : 1.0f) : 0.0f); 583 | c[x].g = 255.5f * (c[x].g >= 0.0f ? (c[x].g <= 1.0f ? c[x].g : 1.0f) : 0.0f); 584 | c[x].b = 255.5f * (c[x].b >= 0.0f ? (c[x].b <= 1.0f ? c[x].b : 1.0f) : 0.0f); 585 | c[x].h = c[x].h >= 0.0f ? c[x].h : 0.0f; 586 | } 587 | 588 | #if WASM_SIMD 589 | for (int x = cqt.width; x < cqt.aligned_width; x++) { 590 | cqt.color_buf[x] = (ColorF){ 0, 0, 0, 0 }; 591 | } 592 | #endif 593 | 594 | for (int x = 0; x < cqt.aligned_width; x++) 595 | cqt.rcp_h_buf[x] = 1.0f / (cqt.color_buf[x].h + 0.0001f); 596 | 597 | #if WASM_SIMD 598 | for (int x = 0; x < cqt.aligned_width; x += 4) { 599 | ColorF4 color; 600 | color.r = (float32x4){ cqt.color_buf[x].r, cqt.color_buf[x+1].r, cqt.color_buf[x+2].r, cqt.color_buf[x+3].r }; 601 | color.g = (float32x4){ cqt.color_buf[x].g, cqt.color_buf[x+1].g, cqt.color_buf[x+2].g, cqt.color_buf[x+3].g }; 602 | color.b = (float32x4){ cqt.color_buf[x].b, cqt.color_buf[x+1].b, cqt.color_buf[x+2].b, cqt.color_buf[x+3].b }; 603 | color.h = (float32x4){ cqt.color_buf[x].h, cqt.color_buf[x+1].h, cqt.color_buf[x+2].h, cqt.color_buf[x+3].h }; 604 | *(ColorF4 *)(cqt.color_buf + x) = color; 605 | } 606 | #endif 607 | 608 | cqt.prerender = 0; 609 | } 610 | 611 | #if !WASM_SIMD 612 | WASM_EXPORT void render_line_alpha(int y, uint8_t alpha) 613 | { 614 | if (cqt.prerender) 615 | prerender(); 616 | 617 | unsigned a = ((unsigned) alpha) << 24; 618 | 619 | if (y >= 0 && y < cqt.height) { 620 | float ht = (cqt.height - y) / (float) cqt.height; 621 | for (int x = 0; x < cqt.width; x++) { 622 | if (cqt.color_buf[x].h <= ht) { 623 | cqt.output[x] = a; 624 | } else { 625 | float mul = (cqt.color_buf[x].h - ht) * cqt.rcp_h_buf[x]; 626 | int r = mul * cqt.color_buf[x].r; 627 | int g = mul * cqt.color_buf[x].g; 628 | int b = mul * cqt.color_buf[x].b; 629 | g = g << 8; 630 | b = b << 16; 631 | cqt.output[x] = (r | g) | (b | a); 632 | } 633 | } 634 | } else { 635 | for (int x = 0; x < cqt.width; x++) { 636 | int r = cqt.color_buf[x].r; 637 | int g = cqt.color_buf[x].g; 638 | int b = cqt.color_buf[x].b; 639 | g = g << 8; 640 | b = b << 16; 641 | cqt.output[x] = (r | g) | (b | a); 642 | } 643 | } 644 | } 645 | #else 646 | WASM_EXPORT WASM_SIMD_FUNCTION void render_line_alpha(int y, uint8_t alpha) 647 | { 648 | if (cqt.prerender) 649 | prerender(); 650 | 651 | uint32x4 a = { alpha, alpha, alpha, alpha }; 652 | a = a << 24; 653 | 654 | if (y >= 0 && y < cqt.height) { 655 | float htf = (cqt.height - y) / (float) cqt.height; 656 | float32x4 ht = { htf, htf, htf, htf }; 657 | for (int x = 0; x < cqt.aligned_width; x += 4) { 658 | ColorF4 color = *(ColorF4 *)(cqt.color_buf + x); 659 | int32x4 mask = color.h > ht; 660 | if (__builtin_wasm_any_true_v128(mask)) { 661 | float32x4 mul = (color.h - ht) * *(float32x4 *)(cqt.rcp_h_buf + x); 662 | mul = (float32x4)((int32x4)mul & mask); 663 | int32x4 r = __builtin_convertvector(mul * color.r, int32x4); 664 | int32x4 g = __builtin_convertvector(mul * color.g, int32x4); 665 | int32x4 b = __builtin_convertvector(mul * color.b, int32x4); 666 | g = g << 8; 667 | b = b << 16; 668 | *(int32x4 *)(cqt.output + x) = (r | g) | (b | a); 669 | } else { 670 | *(int32x4 *)(cqt.output + x) = a; 671 | } 672 | } 673 | } else { 674 | for (int x = 0; x < cqt.aligned_width; x += 4) { 675 | ColorF4 color = *(ColorF4 *)(cqt.color_buf + x); 676 | int32x4 r = __builtin_convertvector(color.r, int32x4); 677 | int32x4 g = __builtin_convertvector(color.g, int32x4); 678 | int32x4 b = __builtin_convertvector(color.b, int32x4); 679 | g = g << 8; 680 | b = b << 16; 681 | *(int32x4 *)(cqt.output + x) = (r | g) | (b | a); 682 | } 683 | } 684 | } 685 | #endif 686 | 687 | WASM_EXPORT void render_line_opaque(int y) 688 | { 689 | render_line_alpha(y, 255); 690 | } 691 | 692 | WASM_EXPORT void set_volume(float bar_v, float sono_v) 693 | { 694 | cqt.bar_v = (bar_v > MAX_VOL) ? MAX_VOL : (bar_v > MIN_VOL) ? bar_v : MIN_VOL; 695 | cqt.sono_v = (sono_v > MAX_VOL) ? MAX_VOL : (sono_v > MIN_VOL) ? sono_v : MIN_VOL; 696 | } 697 | 698 | WASM_EXPORT void set_height(int height) 699 | { 700 | cqt.height = (height > MAX_HEIGHT) ? MAX_HEIGHT : (height > 1) ? height : 1; 701 | } 702 | 703 | #if WASM_SIMD 704 | WASM_EXPORT WASM_SIMD_FUNCTION int detect_silence(float threshold) 705 | { 706 | float32x4 threshold4 = { threshold, threshold, threshold, threshold }; 707 | float32x4 *v0 = (float32x4 *) cqt.input[0]; 708 | float32x4 *v1 = (float32x4 *) cqt.input[1]; 709 | int len = cqt.fft_size >> 2; 710 | for (int x = 0; x < len; x++) 711 | if (__builtin_wasm_any_true_v128(v0[x] * v0[x] + v1[x] * v1[x] > threshold4)) 712 | return 0; 713 | return 1; 714 | } 715 | #else 716 | WASM_EXPORT int detect_silence(float threshold) 717 | { 718 | for (int x = 0; x < cqt.fft_size; x++) 719 | if (cqt.input[0][x] * cqt.input[0][x] + cqt.input[1][x] * cqt.input[1][x] > threshold) 720 | return 0; 721 | return 1; 722 | } 723 | #endif 724 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------