├── consola.ttf ├── src ├── stb_image.c ├── stb_rect_pack.c ├── stb_image_write.c ├── stb_truetype.c ├── build.bat ├── Makefile ├── stb_rect_pack.h └── stb_image_write.h ├── README.md ├── LICENSE ├── stbrp └── stb_rect_pack.odin ├── stbi ├── stb_image_write.odin └── stb_image.odin └── stbtt └── stb_truetype.odin /consola.ttf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/vassvik/odin-stb/HEAD/consola.ttf -------------------------------------------------------------------------------- /src/stb_image.c: -------------------------------------------------------------------------------- 1 | #define STB_IMAGE_IMPLEMENTATION 2 | #include "stb_image.h" -------------------------------------------------------------------------------- /src/stb_rect_pack.c: -------------------------------------------------------------------------------- 1 | #define STB_RECT_PACK_IMPLEMENTATION 2 | #include "stb_rect_pack.h" -------------------------------------------------------------------------------- /src/stb_image_write.c: -------------------------------------------------------------------------------- 1 | #define STB_IMAGE_WRITE_IMPLEMENTATION 2 | #include "stb_image_write.h" -------------------------------------------------------------------------------- /src/stb_truetype.c: -------------------------------------------------------------------------------- 1 | #define STB_RECT_PACK_IMPLEMENTATION 2 | #include "stb_rect_pack.h" 3 | 4 | #define STB_TRUETYPE_IMPLEMENTATION 5 | #include "stb_truetype.h" -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # odin-stb 2 | 3 | Bindings to some libraries from the popular `stb` single-header libraries 4 | 5 | 6 | To use the bindings you need to first compile static libraries. First, go to the `src` directory, then in Windows call `build.bat`, and in Linux just call `make`. Make sure to create the `lib` directory before running the build scripts. 7 | 8 | An example of using `stb_truetype` is shown in the `test_truetype.odin` file. 9 | -------------------------------------------------------------------------------- /src/build.bat: -------------------------------------------------------------------------------- 1 | if not exist "..\lib" mkdir ..\lib 2 | 3 | cl -nologo -MT -TC -O2 -c stb_image.c stb_image_write.c stb_truetype.c stb_rect_pack.c 4 | lib -nologo stb_image.obj -out:..\lib\stb_image.lib 5 | lib -nologo stb_image_write.obj -out:..\lib\stb_image_write.lib 6 | lib -nologo stb_truetype.obj -out:..\lib\stb_truetype.lib 7 | lib -nologo stb_rect_pack.obj -out:..\lib\stb_rect_pack.lib 8 | 9 | del stb_image.obj stb_image_write.obj stb_truetype.obj stb_rect_pack.obj 10 | -------------------------------------------------------------------------------- /src/Makefile: -------------------------------------------------------------------------------- 1 | all: 2 | mkdir -p ../lib 3 | gcc -c -O2 -march=native -Os -fPIC stb_image.c stb_image_write.c stb_truetype.c stb_rect_pack.c 4 | ar rcs ../lib/stb_image.a stb_image.o 5 | ar rcs ../lib/stb_image_write.a stb_image_write.o 6 | ar rcs ../lib/stb_truetype.a stb_truetype.o 7 | ar rcs ../lib/stb_rect_pack.a stb_rect_pack.o 8 | #gcc -fPIC -shared -Wl,-soname=stb_image.so -o ../lib/stb_image.so stb_image.o 9 | #gcc -fPIC -shared -Wl,-soname=stb_image_write.so -o ../lib/stb_image_write.so stb_image_write.o 10 | #gcc -fPIC -shared -Wl,-soname=stb_truetype.so -o ../lib/stb_truetype.so stb_image_truetype.o 11 | #gcc -fPIC -shared -Wl,-soname=stb_rect_pack.so -o ../lib/stb_rect_pack.so stb_rect_packl.o 12 | rm *.o 13 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | MIT License 2 | 3 | Copyright (c) 2018 vassvik 4 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy 6 | of this software and associated documentation files (the "Software"), to deal 7 | in the Software without restriction, including without limitation the rights 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 | copies of the Software, and to permit persons to whom the Software is 10 | furnished to do so, subject to the following conditions: 11 | 12 | The above copyright notice and this permission notice shall be included in all 13 | copies or substantial portions of the Software. 14 | 15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 21 | SOFTWARE. 22 | -------------------------------------------------------------------------------- /stbrp/stb_rect_pack.odin: -------------------------------------------------------------------------------- 1 | package stbrp 2 | 3 | import "core:os" 4 | 5 | when os.OS == "windows" do foreign import stb_rect_pack "../lib/stb_rect_pack.lib" 6 | when os.OS == "linux" do foreign import stb_rect_pack "../lib/stb_rect_pack.a" 7 | 8 | STBRP_HEURISTIC :: enum i32 9 | { 10 | STBRP_HEURISTIC_Skyline_default=0, 11 | STBRP_HEURISTIC_Skyline_BL_sortHeight = STBRP_HEURISTIC_Skyline_default, 12 | STBRP_HEURISTIC_Skyline_BF_sortHeight 13 | }; 14 | 15 | Coord :: u16; 16 | 17 | Rect :: struct { 18 | // reserved for your use: 19 | id : i32, 20 | w, h : Coord, 21 | x, y : Coord, 22 | was_packed : i32, 23 | } 24 | 25 | Node :: struct { 26 | x,y : Coord, 27 | next : ^Node, 28 | }; 29 | 30 | Context :: struct { 31 | width : i32, 32 | height : i32, 33 | align : i32, 34 | init_mode : i32, 35 | heuristic : i32, 36 | num_nodes : i32, 37 | active_head : ^Node, 38 | free_head : ^Node, 39 | extra : [2]Node, 40 | }; 41 | 42 | 43 | @(default_calling_convention="c", link_prefix="stbrp_") 44 | foreign stb_rect_pack { 45 | init_target :: proc(contex: ^Context, width: i32, height: i32, nodes: ^Node, num_nodes: i32) ---; 46 | pack_rects :: proc(contex: ^Context, rects: ^Rect, num_rects: i32) -> i32 ---; 47 | setup_allow_out_of_mem :: proc(contex: ^Context, allow_out_of_mem: i32) ---; 48 | setup_heuristic :: proc(contex: ^Context, heuristic: i32) ---; 49 | } -------------------------------------------------------------------------------- /stbi/stb_image_write.odin: -------------------------------------------------------------------------------- 1 | package stbi 2 | 3 | import "core:os" 4 | import "core:strings" 5 | 6 | when os.OS == .Windows do foreign import stbiw "../lib/stb_image_write.lib" 7 | when os.OS == .Linux do foreign import stbiw "../lib/stb_image_write.a" 8 | 9 | // bind 10 | @(default_calling_convention="c") 11 | foreign stbiw { 12 | stbi_write_png :: proc(filename: cstring, w, h, comp: i32, data: rawptr, stride_in_bytes: i32) -> i32 ---; 13 | stbi_write_bmp :: proc(filename: cstring, w, h, comp: i32, data: rawptr) -> i32 ---; 14 | stbi_write_tga :: proc(filename: cstring, w, h, comp: i32, data: rawptr) -> i32 ---; 15 | stbi_write_hdr :: proc(filename: cstring, w, h, comp: i32, data: ^f32) -> i32 ---; 16 | stbi_write_jpg :: proc(filename: cstring, w, h, comp: i32, data: rawptr, quality: i32 /*0 to 100*/) -> i32 ---; 17 | } 18 | 19 | // wrap 20 | write_png :: #force_inline proc(filename: string, w, h, comp: int, data: []u8, stride_in_bytes: int) -> int { 21 | return cast(int)stbi_write_png(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0], i32(stride_in_bytes)); 22 | } 23 | 24 | write_bmp :: #force_inline proc(filename: string, w, h, comp: int, data: []u8) -> int { 25 | return cast(int)stbi_write_bmp(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0]); 26 | } 27 | 28 | write_tga :: #force_inline proc(filename: string, w, h, comp: int, data: []u8) -> int { 29 | return cast(int)stbi_write_tga(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0]); 30 | } 31 | 32 | write_hdr :: #force_inline proc(filename: string, w, h, comp: int, data: []f32) -> int { 33 | return cast(int)stbi_write_hdr(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0]); 34 | } 35 | 36 | write_jpg :: #force_inline proc(filename: string, w, h, comp: int, data: []u8, quality: int) -> int { 37 | return cast(int)stbi_write_jpg(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0], i32(quality)); 38 | } 39 | 40 | write_png_flip :: proc(filename: string, w, h: int, $comp: int, data: []u8, stride_in_bytes: int) -> int { 41 | #assert(comp >= 0 && comp <= 4); 42 | for j in 0..h/2-1 { 43 | for i in 0..w-1 { 44 | k1 := comp*(j*w + i); 45 | k2 := comp*((h - 1 - j)*w + i); 46 | data[k1 + 0], data[k2 + 0] = data[k2 + 0], data[k1 + 0]; 47 | when comp > 1 do data[k1 + 1], data[k2 + 1] = data[k2 + 1], data[k1 + 1]; 48 | when comp > 2 do data[k1 + 2], data[k2 + 2] = data[k2 + 2], data[k1 + 2]; 49 | when comp > 3 do data[k1 + 3], data[k2 + 3] = data[k2 + 3], data[k1 + 3]; 50 | } 51 | } 52 | return cast(int)stbi_write_png(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0], i32(stride_in_bytes)); 53 | } 54 | 55 | write_tga_flip :: proc(filename: string, w, h: int, $comp: int, data: []u8) -> int { 56 | #assert(comp >= 0 && comp <= 4); 57 | for j in 0..h/2-1 { 58 | for i in 0..w-1 { 59 | k1 := comp*(j*w + i); 60 | k2 := comp*((h - 1 - j)*w + i); 61 | data[k1 + 0], data[k2 + 0] = data[k2 + 0], data[k1 + 0]; 62 | when comp > 1 do data[k1 + 1], data[k2 + 1] = data[k2 + 1], data[k1 + 1]; 63 | when comp > 2 do data[k1 + 2], data[k2 + 2] = data[k2 + 2], data[k1 + 2]; 64 | when comp > 3 do data[k1 + 3], data[k2 + 3] = data[k2 + 3], data[k1 + 3]; 65 | } 66 | } 67 | return cast(int)stbi_write_tga(strings.unsafe_string_to_cstring(filename), i32(w), i32(h), i32(comp), &data[0]); 68 | } -------------------------------------------------------------------------------- /stbi/stb_image.odin: -------------------------------------------------------------------------------- 1 | /* 2 | Taken from https://gist.github.com/gingerBill/17ed98d3312a56d3e515f35e093a1b8f, with some minor modifications 3 | */ 4 | 5 | package stbi 6 | 7 | import "core:os" 8 | 9 | when os.OS == .Windows do foreign import stbi "../lib/stb_image.lib" 10 | when os.OS == .Linux do foreign import stbi "../lib/stb_image.a" 11 | 12 | // 13 | // load image by filename, open file, or memory buffer 14 | // 15 | Io_Callbacks :: struct { 16 | read: proc "c" (user: rawptr, data: ^u8, size: i32) -> i32, // fill 'data' with 'size' u8s. return number of u8s actually read 17 | skip: proc "c" (user: rawptr, n: i32), // skip the next 'n' u8s, or 'unget' the last -n u8s if negative 18 | eof: proc "c" (user: rawptr) -> i32, // returns nonzero if we are at end of file/data 19 | } 20 | 21 | @(default_calling_convention="c", link_prefix="stbi_") 22 | foreign stbi { 23 | //////////////////////////////////// 24 | // 25 | // 8-bits-per-channel interface 26 | // 27 | load :: proc(filename: cstring, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^u8 ---; 28 | load_from_memory :: proc(buffer: ^u8, len: i32, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^u8 ---; 29 | load_from_callbacks :: proc(clbk: ^Io_Callbacks, user: rawptr, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^u8 ---; 30 | 31 | //////////////////////////////////// 32 | // 33 | // 16-bits-per-channel interface 34 | // 35 | load_16 :: proc(filename: ^u8, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^u16 ---; 36 | 37 | //////////////////////////////////// 38 | // 39 | // float-per-channel interface 40 | // 41 | loadf :: proc(filename: cstring, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^f32 ---; 42 | loadf_from_memory :: proc(buffer: ^u8, len: i32, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^f32 ---; 43 | loadf_from_callbacks :: proc(clbk: ^Io_Callbacks, user: rawptr, x, y, channels_in_file: ^i32, desired_channels: i32) -> ^f32 ---; 44 | 45 | 46 | hdr_to_ldr_gamma :: proc(gamma: f32) ---; 47 | hdr_to_ldr_scale :: proc(scale: f32) ---; 48 | 49 | is_hdr_from_callbacks :: proc(clbk: ^Io_Callbacks, user: rawptr) -> i32 ---; 50 | is_hdr_from_memory :: proc(buffer: ^u8, len: i32) -> i32 ---; 51 | 52 | is_hdr :: proc(filename: cstring) -> i32 ---; 53 | 54 | // get a VERY brief reason for failure 55 | // NOT THREADSAFE 56 | failure_reason :: proc() -> ^u8 ---; 57 | 58 | // free the loaded image -- this is just free() 59 | image_free :: proc(retval_from_load: rawptr) ---; 60 | 61 | // get image dimensions & components without fully decoding 62 | info :: proc(filename: cstring, x, y, comp: ^i32) -> i32 ---; 63 | info_from_memory :: proc(buffer: ^u8, len: i32, x, y, comp: ^i32) -> i32 ---; 64 | info_from_callbacks :: proc(clbk: ^Io_Callbacks, user: rawptr, x, y, comp: ^i32) -> i32 ---; 65 | 66 | // for image formats that explicitly notate that they have premultiplied alpha, 67 | // we just return the colors as stored in the file. set this flag to force 68 | // unpremultiplication. results are undefined if the unpremultiply overflow. 69 | set_unpremultiply_on_load :: proc (flag_true_if_should_unpremultiply: i32) ---; 70 | 71 | 72 | // indicate whether we should process iphone images back to canonical format, 73 | // or just pass them through "as-is" 74 | convert_iphone_png_to_rgb :: proc(flag_true_if_should_convert: i32) ---; 75 | 76 | // flip the image vertically, so the first pixel in the output array is the bottom left 77 | set_flip_vertically_on_load :: proc(flag_true_if_should_flip: i32) ---; 78 | 79 | // ZLIB client - used by PNG, available for other purposes 80 | zlib_decode_malloc :: proc(buffer: ^u8, len: i32, outlen: ^i32) -> ^u8 ---; 81 | zlib_decode_malloc_guesssize :: proc(buffer: ^u8, len, initial_size: i32, outlen: ^i32) -> ^u8 ---; 82 | zlib_decode_malloc_guesssize_headerflag :: proc(buffer: ^u8, len, initial_size: i32, outlen: ^i32, parse_header: i32) -> ^u8 ---; 83 | 84 | zlib_decode_buffer :: proc(out_buffer: ^u8, olen: i32, in_buffer: ^u8, ilen: i32) -> i32 ---; 85 | zlib_decode_noheader_malloc :: proc(buffer: ^u8, len: i32, outlen: ^i32) -> ^u8 ---; 86 | zlib_decode_noheader_buffer :: proc(obuffer: ^u8, olen: i32, ibuffer: ^u8, ilen: i32) -> i32 ---; 87 | } 88 | 89 | 90 | main :: proc() { 91 | 92 | } -------------------------------------------------------------------------------- /stbtt/stb_truetype.odin: -------------------------------------------------------------------------------- 1 | package stbtt 2 | 3 | import "core:os" 4 | 5 | when os.OS == .Windows do foreign import stbtt "../lib/stb_truetype.lib" 6 | when os.OS == .Linux do foreign import stbtt "../lib/stb_truetype.a" 7 | 8 | import "core:mem"; 9 | 10 | /////////////////////////////////////////////////////////////////////////////// 11 | /////////////////////////////////////////////////////////////////////////////// 12 | //// 13 | //// INTERFACE 14 | //// 15 | //// 16 | 17 | 18 | // private structure 19 | stbtt__buf :: struct { 20 | data: ^u8, 21 | cursor, size: i32, 22 | } 23 | 24 | ////////////////////////////////////////////////////////////////////////////// 25 | // 26 | // TEXTURE BAKING API 27 | // 28 | // If you use this API, you only have to call two functions ever. 29 | // 30 | 31 | stbtt_bakedchar :: struct { 32 | x0,y0,x1,y1: u16, // coordinates of bbox in bitmap 33 | xoff,yoff,xadvance: f32, 34 | } 35 | 36 | stbtt_aligned_quad :: struct { 37 | x0, y0, s0, t0: f32, // top-left 38 | x1, y1, s1, t1: f32, // bottom-right 39 | } 40 | 41 | Baked_Char :: stbtt_bakedchar; 42 | Aligned_Quad :: stbtt_aligned_quad; 43 | 44 | 45 | // bindings 46 | @(default_calling_convention="c") 47 | foreign stbtt { 48 | stbtt_BakeFontBitmap :: proc(data: ^u8, offset: i32, pixel_height: f32, pixels: ^u8, pw, ph, first_char, num_chars: i32, chardata: ^stbtt_bakedchar) -> i32 ---; 49 | stbtt_GetBakedQuad :: proc(chardata: ^stbtt_bakedchar, pw, ph, char_index: i32, xpos, ypos: ^f32, q: ^stbtt_aligned_quad, opengl_fillrule: i32) ---; 50 | } 51 | 52 | // wrappers 53 | bake_font_bitmap :: proc(data: []u8, offset: int, pixel_height: f32, pixels: []u8, pw, ph, first_char, num_chars: int) -> ([]Baked_Char, int) { 54 | chardata := make([]Baked_Char, num_chars); 55 | ret := stbtt_BakeFontBitmap(&data[0], i32(offset), pixel_height, &pixels[0], i32(pw), i32(ph), i32(first_char), i32(num_chars), cast(^stbtt_bakedchar)&chardata[0]); 56 | return chardata, int(ret); 57 | } 58 | 59 | get_baked_quad :: proc(chardata: []Baked_Char, pw, ph, char_index: int, opengl_fillrule: bool) -> (xpos, ypos: f32, q: Aligned_Quad) { 60 | stbtt_GetBakedQuad(cast(^stbtt_bakedchar)&chardata[0], i32(pw), i32(ph), i32(char_index), &xpos, &ypos, &q, i32(opengl_fillrule)); 61 | return xpos, ypos, Aligned_Quad(q); 62 | } 63 | 64 | 65 | ////////////////////////////////////////////////////////////////////////////// 66 | // 67 | // NEW TEXTURE BAKING API 68 | // 69 | // This provides options for packing multiple fonts into one atlas, not 70 | // perfectly but better than nothing. 71 | 72 | stbtt_packedchar :: struct { 73 | x0, y0, x1, y1: u16, 74 | xoff, yoff, xadvance: f32, 75 | xoff2, yoff2: f32, 76 | } 77 | 78 | stbtt_pack_range :: struct { 79 | font_size: f32, 80 | first_unicode_codepoint_in_range: i32, 81 | array_of_unicode_codepoints: ^i32, 82 | num_chars: i32, 83 | chardata_for_range: ^stbtt_packedchar, 84 | _, _: u8, // used internally to store oversample info 85 | } 86 | 87 | stbtt_pack_context :: struct { 88 | user_allocator_context, pack_info: rawptr, 89 | width, height, stride_in_bytes, padding, skip_missing: i32, 90 | h_oversample, v_oversample: u32, 91 | pixels: ^u8, 92 | nodes: rawptr, 93 | }; 94 | 95 | Packed_Char :: stbtt_packedchar; 96 | Pack_Range :: stbtt_pack_range; 97 | Pack_Context :: stbtt_pack_context; 98 | 99 | STBTT_POINT_SIZE :: #force_inline proc(x: $T) -> T { return -x; } // @NOTE: this was a macro 100 | 101 | // bindings 102 | @(default_calling_convention="c") 103 | foreign stbtt { 104 | stbtt_PackBegin :: proc(spc: ^stbtt_pack_context, pixels: ^u8, width, height, stride_in_bytes, padding: i32, alloc_context: rawptr) -> i32 ---; 105 | stbtt_PackEnd :: proc(spc: ^stbtt_pack_context) ---; 106 | stbtt_PackFontRange :: proc(spc: ^stbtt_pack_context, fontdata: ^u8, font_index: i32, font_size: f32, first_unicode_char_in_range, num_chars_in_range: i32, chardata_for_range: ^stbtt_packedchar) -> i32 ---; 107 | stbtt_PackFontRanges :: proc(spc: ^stbtt_pack_context, fontdata: ^u8, font_index: i32, ranges: ^stbtt_pack_range, num_ranges: i32) -> i32 ---; 108 | stbtt_PackSetOversampling :: proc(spc: ^stbtt_pack_context, h_oversample, v_oversample: u32) ---; 109 | stbtt_PackSetSkipMissingCodepoints :: proc(spc: ^stbtt_pack_context, skip: i32) ---; 110 | stbtt_GetPackedQuad :: proc(chardata: ^stbtt_packedchar, pw, ph, char_index: i32, xpos, ypos: ^f32, q: ^stbtt_aligned_quad, align_to_integer: i32) ---; 111 | stbtt_PackFontRangesGatherRects :: proc(spc: ^stbtt_pack_context, info: ^stbtt_fontinfo, ranges: ^stbtt_pack_range, num_ranges: i32, rects: ^stbrp_rect) -> i32 ---; // NOTE: These are not wrapped 112 | stbtt_PackFontRangesPackRects :: proc(spc: ^stbtt_pack_context, rects: ^stbrp_rect, num_rects: i32) ---; // NOTE: These are not wrapped 113 | stbtt_PackFontRangesRenderIntoRects :: proc(spc: ^stbtt_pack_context, info: ^stbtt_fontinfo, ranges: ^stbtt_pack_range, num_ranges: i32, rects: ^stbrp_rect) -> i32 ---; // NOTE: These are not wrapped 114 | } 115 | 116 | // wrappers 117 | pack_begin :: proc(pixels: []u8, width, height, stride_in_bytes, padding: int) -> (Pack_Context, bool) { 118 | spc: Pack_Context; 119 | ret := stbtt_PackBegin(&spc, &pixels[0], i32(width), i32(height), i32(stride_in_bytes), i32(padding), nil); 120 | return cast(Pack_Context)spc, ret == 1; 121 | } 122 | 123 | pack_end :: proc(spc: ^Pack_Context) { 124 | stbtt_PackEnd(spc); 125 | } 126 | 127 | pack_font_range :: proc(spc: ^Pack_Context, fontdata: []u8, font_index: int, font_size: f32, first_unicode_char_in_range: i32, chardata_for_range: []stbtt_packedchar) -> int { 128 | ret := stbtt_PackFontRange(spc, &fontdata[0], i32(font_index), f32(font_size), i32(first_unicode_char_in_range), i32(len(chardata_for_range)), &chardata_for_range[0]); 129 | return cast(int)ret; 130 | } 131 | 132 | pack_font_ranges :: proc(spc: ^Pack_Context, fontdata: []u8, font_index: int, ranges: []Pack_Range) -> int { 133 | ret := stbtt_PackFontRanges(spc, &fontdata[0], i32(font_index), &ranges[0], i32(len(ranges))); 134 | return cast(int)ret; 135 | } 136 | 137 | pack_set_oversampling :: proc(spc: ^Pack_Context, h_oversample, v_oversample: int) { 138 | stbtt_PackSetOversampling(spc, u32(h_oversample), u32(v_oversample)); 139 | } 140 | 141 | stbtt_pack_set_skip_missing_codepoints :: proc(spc: ^stbtt_pack_context, skip: bool) { 142 | stbtt_PackSetSkipMissingCodepoints(spc, i32(skip)); 143 | } 144 | 145 | get_packed_quad :: proc(chardata: []Packed_Char, pw, ph, char_index: int, align_to_integer: bool) -> (f32, f32, Aligned_Quad) { 146 | xpos, ypos: f32; 147 | q: Aligned_Quad; 148 | stbtt_GetPackedQuad(&chardata[0], i32(pw), i32(ph), i32(char_index), &xpos, &ypos, &q, i32(align_to_integer)); 149 | return xpos, ypos, q; 150 | } 151 | 152 | 153 | 154 | ////////////////////////////////////////////////////////////////////////////// 155 | // 156 | // FONT LOADING 157 | // 158 | // 159 | 160 | stbtt_fontinfo :: struct { 161 | userdata: rawptr, 162 | data: ^u8, 163 | fontstart: i32, 164 | 165 | numGlyphs: i32, 166 | 167 | loca,head,glyf,hhea,hmtx,kern,gpos,svg: i32, 168 | index_map: i32, 169 | indexToLocFormat: i32, 170 | 171 | cff: stbtt__buf, 172 | charstrings: stbtt__buf, 173 | gsubrs: stbtt__buf, 174 | subrs: stbtt__buf, 175 | fontdicts: stbtt__buf, 176 | fdselect: stbtt__buf, 177 | } 178 | 179 | Font_Info :: stbtt_fontinfo; 180 | 181 | stbtt_kerningentry :: struct { 182 | glyph1: i32, // use stbtt_FindGlyphIndex 183 | glyph2: i32, 184 | advance: i32, 185 | } 186 | 187 | Kerning_Entry :: stbtt_kerningentry; 188 | 189 | @(default_calling_convention="c") 190 | foreign stbtt { 191 | stbtt_GetNumberOfFonts :: proc(data: ^u8) -> i32 ---; 192 | stbtt_GetFontOffsetForIndex :: proc(data: ^u8, index: i32) -> i32 ---; 193 | stbtt_InitFont :: proc(info: ^stbtt_fontinfo, data: ^u8, offset: i32) -> i32 ---; 194 | } 195 | 196 | get_number_of_fonts :: proc(data: []u8) -> int { 197 | ret := stbtt_GetNumberOfFonts(&data[0]); 198 | return cast(int)ret; 199 | } 200 | 201 | get_font_offset_for_index :: proc(data: []u8, index: int) -> int { 202 | ret := stbtt_GetFontOffsetForIndex(&data[0], i32(index)); 203 | return cast(int)ret; 204 | } 205 | 206 | init_font :: proc(info: ^Font_Info, data: []u8, offset: int) -> bool { 207 | ret := stbtt_InitFont(info, &data[0], i32(offset)); 208 | return bool(ret != 0); 209 | } 210 | 211 | 212 | // wrappers 213 | 214 | ////////////////////////////////////////////////////////////////////////////// 215 | // 216 | // CHARACTER TO GLYPH-INDEX CONVERSIOn 217 | 218 | @(default_calling_convention="c") 219 | foreign stbtt { 220 | stbtt_FindGlyphIndex :: proc(info: ^stbtt_fontinfo, unicode_codepoint: i32) -> i32 ---; 221 | } 222 | 223 | find_glyph_index :: proc(info: ^stbtt_fontinfo, unicode_codepoint: int) -> int { 224 | ret := stbtt_FindGlyphIndex(info, i32(unicode_codepoint)); 225 | return cast(int)ret; 226 | } 227 | 228 | ////////////////////////////////////////////////////////////////////////////// 229 | // 230 | // CHARACTER PROPERTIES 231 | // 232 | 233 | @(default_calling_convention="c") 234 | foreign stbtt { 235 | stbtt_ScaleForPixelHeight :: proc(info: ^stbtt_fontinfo, pixels: f32) -> f32 ---; 236 | stbtt_ScaleForMappingEmToPixels :: proc(info: ^stbtt_fontinfo, pixels: f32) -> f32 ---; 237 | stbtt_GetFontVMetrics :: proc(info: ^stbtt_fontinfo, ascent, descent, lineGap: ^i32) ---; 238 | stbtt_GetFontVMetricsOS2 :: proc(info: ^stbtt_fontinfo, typoAscent, typoDescent, typoLineGap: ^i32) -> i32 ---; 239 | stbtt_GetFontBoundingBox :: proc(info: ^stbtt_fontinfo, x0, y0, x1, y1: ^i32) ---; 240 | stbtt_GetCodepointHMetrics :: proc(info: ^stbtt_fontinfo, codepoint: i32, advanceWidth, leftSideBearing: ^i32) ---; 241 | stbtt_GetCodepointKernAdvance :: proc(info: ^stbtt_fontinfo, ch1, ch2: i32) -> i32 ---; 242 | stbtt_GetCodepointBox :: proc(info: ^stbtt_fontinfo, codepoint: i32, x0, y0, x1, y1: ^i32) -> i32 ---; 243 | stbtt_GetGlyphHMetrics :: proc(info: ^stbtt_fontinfo, glyph_index: i32, advanceWidth, leftSideBearing: ^i32) ---; 244 | stbtt_GetGlyphKernAdvance :: proc(info: ^stbtt_fontinfo, glyph1, glyph2: i32) -> i32 ---; 245 | stbtt_GetGlyphBox :: proc(info: ^stbtt_fontinfo, glyph_index: i32, x0, y0, x1, y1: ^i32) -> i32 ---; 246 | stbtt_GetKerningTableLength :: proc(info: ^stbtt_fontinfo) -> i32 ---; 247 | stbtt_GetKerningTable :: proc(info: ^stbtt_fontinfo, table: ^stbtt_kerningentry, table_length: i32) -> i32 ---; 248 | } 249 | 250 | scale_for_pixel_height :: proc(info: ^stbtt_fontinfo, pixels: f32) -> f32 { 251 | return stbtt_ScaleForPixelHeight(info, pixels); 252 | } 253 | 254 | scale_for_mapping_em_to_pixels :: proc(info: ^stbtt_fontinfo, pixels: f32) -> f32 { 255 | return stbtt_ScaleForMappingEmToPixels(info, pixels); 256 | } 257 | 258 | get_font_v_metrics :: proc(info: ^stbtt_fontinfo) -> (int, int, int) { 259 | ascent, descent, line_gap: i32; 260 | stbtt_GetFontVMetrics(info, &ascent, &descent, &line_gap); 261 | return int(ascent), int(descent), int(line_gap); 262 | } 263 | 264 | get_font_v_metrics_os2 :: proc(info: ^stbtt_fontinfo) -> (int, int, int, bool) { 265 | ascent, descent, line_gap: i32; 266 | ret := stbtt_GetFontVMetricsOS2(info, &ascent, &descent, &line_gap); 267 | return int(ascent), int(descent), int(line_gap), bool(ret); 268 | } 269 | 270 | get_font_bounding_box :: proc(info: ^stbtt_fontinfo) -> (int, int, int, int) { 271 | x0, y0, x1, y1: i32; 272 | stbtt_GetFontBoundingBox(info, &x0, &y0, &x1, &y1); 273 | return int(x0), int(y0), int(x1), int(y1); 274 | } 275 | 276 | get_codepoint_h_metrics :: proc(info: ^stbtt_fontinfo, codepoint: int) -> (int, int) { 277 | advanceWidth, leftSideBearing: i32; 278 | stbtt_GetCodepointHMetrics(info, i32(codepoint), &advanceWidth, &leftSideBearing); 279 | return int(advanceWidth), int(leftSideBearing); 280 | } 281 | 282 | get_codepoint_kern_advance :: proc(info: ^stbtt_fontinfo, ch1, ch2: int) -> int { 283 | ret := stbtt_GetCodepointKernAdvance(info, i32(ch1), i32(ch2)); 284 | return cast(int)ret; 285 | } 286 | 287 | get_codepoint_box :: proc(info: ^stbtt_fontinfo, codepoint: int) -> (int, int, int, int, bool) { 288 | x0, y0, x1, y1: i32; 289 | ret := stbtt_GetCodepointBox(info, i32(codepoint), &x0, &y0, &x1, &y1); 290 | return int(x0), int(y0), int(x1), int(y1), bool(ret); 291 | } 292 | 293 | get_glyph_h_metrics :: proc(info: ^stbtt_fontinfo, glyph_index: int) -> (int, int) { 294 | advanceWidth, leftSideBearing: i32; 295 | stbtt_GetGlyphHMetrics(info, i32(glyph_index), &advanceWidth, &leftSideBearing); 296 | return int(advanceWidth), int(leftSideBearing); 297 | } 298 | 299 | get_glyph_kern_advance :: proc(info: ^stbtt_fontinfo, glyph1, glyph2: int) -> int { 300 | ret := stbtt_GetGlyphKernAdvance(info, i32(glyph1), i32(glyph2)); 301 | return cast(int)ret; 302 | } 303 | 304 | get_glyph_box :: proc(info: ^stbtt_fontinfo, glyph_index: int) -> (int, int, int, int, bool) { 305 | x0, y0, x1, y1: i32; 306 | ret := stbtt_GetGlyphBox(info, i32(glyph_index), &x0, &y0, &x1, &y1); 307 | return int(x0), int(y0), int(x1), int(y1), bool(ret); 308 | } 309 | 310 | stbtt_get_kerning_table_length :: proc(info: ^stbtt_fontinfo) -> int { 311 | return int(stbtt_GetKerningTableLength(info)); 312 | } 313 | 314 | stbtt_get_kerning_table :: proc(info: ^stbtt_fontinfo, table: ^stbtt_kerningentry, table_length: int) -> int { 315 | return int(stbtt_GetKerningTable(info, table, i32(table_length))); 316 | } 317 | 318 | 319 | ////////////////////////////////////////////////////////////////////////////// 320 | // 321 | // Signed Distance Function (or Field) rendering 322 | // 323 | 324 | @(default_calling_convention="c") 325 | foreign stbtt { 326 | stbtt_FreeSDF :: proc(bitmap: ^u8, userdata: rawptr) ---; 327 | stbtt_GetGlyphSDF :: proc(info: ^stbtt_fontinfo, scale: f32, glyph, padding: i32, onedge_value: u8, pixel_dist_scale: f32, width, height, xoff, yoff: ^i32) -> ^u8 ---; 328 | stbtt_GetCodepointSDF :: proc(info: ^stbtt_fontinfo, scale: f32, codepoint, padding: i32, onedge_value: u8, pixel_dist_scale: f32, width, height, xoff, yoff: ^i32) -> ^u8 ---; 329 | } 330 | 331 | free_SDF :: proc(bitmap: []u8, userdata: rawptr) { 332 | stbtt_FreeSDF(&bitmap[0], userdata); 333 | } 334 | 335 | 336 | get_glyph_SDF :: proc(info: ^stbtt_fontinfo, scale: f32, glyph, padding: int, onedge_value: u8, pixel_dist_scale: f32) -> ([]u8, int, int, int, int) { 337 | width, height, xoff, yoff: i32; 338 | data := stbtt_GetGlyphSDF(info, scale, i32(glyph), i32(padding), onedge_value, pixel_dist_scale, &width, &height, &xoff, &yoff); 339 | return mem.slice_ptr(data, (int(width)+2*padding)*(int(height)+2*padding)), int(width), int(height), int(xoff), int(yoff); 340 | 341 | } 342 | 343 | get_codepoint_SDF :: proc(info: ^stbtt_fontinfo, scale: f32, codepoint: rune, padding: int, onedge_value: u8, pixel_dist_scale: f32) -> ([]u8, int, int, int, int) { 344 | width, height, xoff, yoff: i32; 345 | data := stbtt_GetCodepointSDF(info, scale, i32(codepoint), i32(padding), onedge_value, pixel_dist_scale, &width, &height, &xoff, &yoff); 346 | return mem.slice_ptr(data, (int(width)+2*padding)*(int(height)+2*padding)), int(width), int(height), int(xoff), int(yoff); 347 | } 348 | 349 | 350 | 351 | ////////////////////////////////////////////////////////////////////////////// 352 | // 353 | // RECT PACK 354 | // 355 | 356 | stbrp_coord :: u16; // @WARNING: this assumes `STBRP_LARGE_RECTS` is undefined in the compiled library file 357 | 358 | stbrp_rect :: struct { 359 | id: i32, 360 | w, h: stbrp_coord, 361 | x, y: stbrp_coord, 362 | was_packed: i32, 363 | } 364 | -------------------------------------------------------------------------------- /src/stb_rect_pack.h: -------------------------------------------------------------------------------- 1 | // stb_rect_pack.h - v1.00 - public domain - rectangle packing 2 | // Sean Barrett 2014 3 | // 4 | // Useful for e.g. packing rectangular textures into an atlas. 5 | // Does not do rotation. 6 | // 7 | // Not necessarily the awesomest packing method, but better than 8 | // the totally naive one in stb_truetype (which is primarily what 9 | // this is meant to replace). 10 | // 11 | // Has only had a few tests run, may have issues. 12 | // 13 | // More docs to come. 14 | // 15 | // No memory allocations; uses qsort() and assert() from stdlib. 16 | // Can override those by defining STBRP_SORT and STBRP_ASSERT. 17 | // 18 | // This library currently uses the Skyline Bottom-Left algorithm. 19 | // 20 | // Please note: better rectangle packers are welcome! Please 21 | // implement them to the same API, but with a different init 22 | // function. 23 | // 24 | // Credits 25 | // 26 | // Library 27 | // Sean Barrett 28 | // Minor features 29 | // Martins Mozeiko 30 | // github:IntellectualKitty 31 | // 32 | // Bugfixes / warning fixes 33 | // Jeremy Jaussaud 34 | // Fabian Giesen 35 | // 36 | // Version history: 37 | // 38 | // 1.00 (2019-02-25) avoid small space waste; gracefully fail too-wide rectangles 39 | // 0.99 (2019-02-07) warning fixes 40 | // 0.11 (2017-03-03) return packing success/fail result 41 | // 0.10 (2016-10-25) remove cast-away-const to avoid warnings 42 | // 0.09 (2016-08-27) fix compiler warnings 43 | // 0.08 (2015-09-13) really fix bug with empty rects (w=0 or h=0) 44 | // 0.07 (2015-09-13) fix bug with empty rects (w=0 or h=0) 45 | // 0.06 (2015-04-15) added STBRP_SORT to allow replacing qsort 46 | // 0.05: added STBRP_ASSERT to allow replacing assert 47 | // 0.04: fixed minor bug in STBRP_LARGE_RECTS support 48 | // 0.01: initial release 49 | // 50 | // LICENSE 51 | // 52 | // See end of file for license information. 53 | 54 | ////////////////////////////////////////////////////////////////////////////// 55 | // 56 | // INCLUDE SECTION 57 | // 58 | 59 | #ifndef STB_INCLUDE_STB_RECT_PACK_H 60 | #define STB_INCLUDE_STB_RECT_PACK_H 61 | 62 | #define STB_RECT_PACK_VERSION 1 63 | 64 | #ifdef STBRP_STATIC 65 | #define STBRP_DEF static 66 | #else 67 | #define STBRP_DEF extern 68 | #endif 69 | 70 | #ifdef __cplusplus 71 | extern "C" { 72 | #endif 73 | 74 | typedef struct stbrp_context stbrp_context; 75 | typedef struct stbrp_node stbrp_node; 76 | typedef struct stbrp_rect stbrp_rect; 77 | 78 | #ifdef STBRP_LARGE_RECTS 79 | typedef int stbrp_coord; 80 | #else 81 | typedef unsigned short stbrp_coord; 82 | #endif 83 | 84 | STBRP_DEF int stbrp_pack_rects (stbrp_context *context, stbrp_rect *rects, int num_rects); 85 | // Assign packed locations to rectangles. The rectangles are of type 86 | // 'stbrp_rect' defined below, stored in the array 'rects', and there 87 | // are 'num_rects' many of them. 88 | // 89 | // Rectangles which are successfully packed have the 'was_packed' flag 90 | // set to a non-zero value and 'x' and 'y' store the minimum location 91 | // on each axis (i.e. bottom-left in cartesian coordinates, top-left 92 | // if you imagine y increasing downwards). Rectangles which do not fit 93 | // have the 'was_packed' flag set to 0. 94 | // 95 | // You should not try to access the 'rects' array from another thread 96 | // while this function is running, as the function temporarily reorders 97 | // the array while it executes. 98 | // 99 | // To pack into another rectangle, you need to call stbrp_init_target 100 | // again. To continue packing into the same rectangle, you can call 101 | // this function again. Calling this multiple times with multiple rect 102 | // arrays will probably produce worse packing results than calling it 103 | // a single time with the full rectangle array, but the option is 104 | // available. 105 | // 106 | // The function returns 1 if all of the rectangles were successfully 107 | // packed and 0 otherwise. 108 | 109 | struct stbrp_rect 110 | { 111 | // reserved for your use: 112 | int id; 113 | 114 | // input: 115 | stbrp_coord w, h; 116 | 117 | // output: 118 | stbrp_coord x, y; 119 | int was_packed; // non-zero if valid packing 120 | 121 | }; // 16 bytes, nominally 122 | 123 | 124 | STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes); 125 | // Initialize a rectangle packer to: 126 | // pack a rectangle that is 'width' by 'height' in dimensions 127 | // using temporary storage provided by the array 'nodes', which is 'num_nodes' long 128 | // 129 | // You must call this function every time you start packing into a new target. 130 | // 131 | // There is no "shutdown" function. The 'nodes' memory must stay valid for 132 | // the following stbrp_pack_rects() call (or calls), but can be freed after 133 | // the call (or calls) finish. 134 | // 135 | // Note: to guarantee best results, either: 136 | // 1. make sure 'num_nodes' >= 'width' 137 | // or 2. call stbrp_allow_out_of_mem() defined below with 'allow_out_of_mem = 1' 138 | // 139 | // If you don't do either of the above things, widths will be quantized to multiples 140 | // of small integers to guarantee the algorithm doesn't run out of temporary storage. 141 | // 142 | // If you do #2, then the non-quantized algorithm will be used, but the algorithm 143 | // may run out of temporary storage and be unable to pack some rectangles. 144 | 145 | STBRP_DEF void stbrp_setup_allow_out_of_mem (stbrp_context *context, int allow_out_of_mem); 146 | // Optionally call this function after init but before doing any packing to 147 | // change the handling of the out-of-temp-memory scenario, described above. 148 | // If you call init again, this will be reset to the default (false). 149 | 150 | 151 | STBRP_DEF void stbrp_setup_heuristic (stbrp_context *context, int heuristic); 152 | // Optionally select which packing heuristic the library should use. Different 153 | // heuristics will produce better/worse results for different data sets. 154 | // If you call init again, this will be reset to the default. 155 | 156 | enum 157 | { 158 | STBRP_HEURISTIC_Skyline_default=0, 159 | STBRP_HEURISTIC_Skyline_BL_sortHeight = STBRP_HEURISTIC_Skyline_default, 160 | STBRP_HEURISTIC_Skyline_BF_sortHeight 161 | }; 162 | 163 | 164 | ////////////////////////////////////////////////////////////////////////////// 165 | // 166 | // the details of the following structures don't matter to you, but they must 167 | // be visible so you can handle the memory allocations for them 168 | 169 | struct stbrp_node 170 | { 171 | stbrp_coord x,y; 172 | stbrp_node *next; 173 | }; 174 | 175 | struct stbrp_context 176 | { 177 | int width; 178 | int height; 179 | int align; 180 | int init_mode; 181 | int heuristic; 182 | int num_nodes; 183 | stbrp_node *active_head; 184 | stbrp_node *free_head; 185 | stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2' 186 | }; 187 | 188 | #ifdef __cplusplus 189 | } 190 | #endif 191 | 192 | #endif 193 | 194 | ////////////////////////////////////////////////////////////////////////////// 195 | // 196 | // IMPLEMENTATION SECTION 197 | // 198 | 199 | #ifdef STB_RECT_PACK_IMPLEMENTATION 200 | #ifndef STBRP_SORT 201 | #include 202 | #define STBRP_SORT qsort 203 | #endif 204 | 205 | #ifndef STBRP_ASSERT 206 | #include 207 | #define STBRP_ASSERT assert 208 | #endif 209 | 210 | #ifdef _MSC_VER 211 | #define STBRP__NOTUSED(v) (void)(v) 212 | #else 213 | #define STBRP__NOTUSED(v) (void)sizeof(v) 214 | #endif 215 | 216 | enum 217 | { 218 | STBRP__INIT_skyline = 1 219 | }; 220 | 221 | STBRP_DEF void stbrp_setup_heuristic(stbrp_context *context, int heuristic) 222 | { 223 | switch (context->init_mode) { 224 | case STBRP__INIT_skyline: 225 | STBRP_ASSERT(heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight || heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight); 226 | context->heuristic = heuristic; 227 | break; 228 | default: 229 | STBRP_ASSERT(0); 230 | } 231 | } 232 | 233 | STBRP_DEF void stbrp_setup_allow_out_of_mem(stbrp_context *context, int allow_out_of_mem) 234 | { 235 | if (allow_out_of_mem) 236 | // if it's ok to run out of memory, then don't bother aligning them; 237 | // this gives better packing, but may fail due to OOM (even though 238 | // the rectangles easily fit). @TODO a smarter approach would be to only 239 | // quantize once we've hit OOM, then we could get rid of this parameter. 240 | context->align = 1; 241 | else { 242 | // if it's not ok to run out of memory, then quantize the widths 243 | // so that num_nodes is always enough nodes. 244 | // 245 | // I.e. num_nodes * align >= width 246 | // align >= width / num_nodes 247 | // align = ceil(width/num_nodes) 248 | 249 | context->align = (context->width + context->num_nodes-1) / context->num_nodes; 250 | } 251 | } 252 | 253 | STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) 254 | { 255 | int i; 256 | #ifndef STBRP_LARGE_RECTS 257 | STBRP_ASSERT(width <= 0xffff && height <= 0xffff); 258 | #endif 259 | 260 | for (i=0; i < num_nodes-1; ++i) 261 | nodes[i].next = &nodes[i+1]; 262 | nodes[i].next = NULL; 263 | context->init_mode = STBRP__INIT_skyline; 264 | context->heuristic = STBRP_HEURISTIC_Skyline_default; 265 | context->free_head = &nodes[0]; 266 | context->active_head = &context->extra[0]; 267 | context->width = width; 268 | context->height = height; 269 | context->num_nodes = num_nodes; 270 | stbrp_setup_allow_out_of_mem(context, 0); 271 | 272 | // node 0 is the full width, node 1 is the sentinel (lets us not store width explicitly) 273 | context->extra[0].x = 0; 274 | context->extra[0].y = 0; 275 | context->extra[0].next = &context->extra[1]; 276 | context->extra[1].x = (stbrp_coord) width; 277 | #ifdef STBRP_LARGE_RECTS 278 | context->extra[1].y = (1<<30); 279 | #else 280 | context->extra[1].y = 65535; 281 | #endif 282 | context->extra[1].next = NULL; 283 | } 284 | 285 | // find minimum y position if it starts at x1 286 | static int stbrp__skyline_find_min_y(stbrp_context *c, stbrp_node *first, int x0, int width, int *pwaste) 287 | { 288 | stbrp_node *node = first; 289 | int x1 = x0 + width; 290 | int min_y, visited_width, waste_area; 291 | 292 | STBRP__NOTUSED(c); 293 | 294 | STBRP_ASSERT(first->x <= x0); 295 | 296 | #if 0 297 | // skip in case we're past the node 298 | while (node->next->x <= x0) 299 | ++node; 300 | #else 301 | STBRP_ASSERT(node->next->x > x0); // we ended up handling this in the caller for efficiency 302 | #endif 303 | 304 | STBRP_ASSERT(node->x <= x0); 305 | 306 | min_y = 0; 307 | waste_area = 0; 308 | visited_width = 0; 309 | while (node->x < x1) { 310 | if (node->y > min_y) { 311 | // raise min_y higher. 312 | // we've accounted for all waste up to min_y, 313 | // but we'll now add more waste for everything we've visted 314 | waste_area += visited_width * (node->y - min_y); 315 | min_y = node->y; 316 | // the first time through, visited_width might be reduced 317 | if (node->x < x0) 318 | visited_width += node->next->x - x0; 319 | else 320 | visited_width += node->next->x - node->x; 321 | } else { 322 | // add waste area 323 | int under_width = node->next->x - node->x; 324 | if (under_width + visited_width > width) 325 | under_width = width - visited_width; 326 | waste_area += under_width * (min_y - node->y); 327 | visited_width += under_width; 328 | } 329 | node = node->next; 330 | } 331 | 332 | *pwaste = waste_area; 333 | return min_y; 334 | } 335 | 336 | typedef struct 337 | { 338 | int x,y; 339 | stbrp_node **prev_link; 340 | } stbrp__findresult; 341 | 342 | static stbrp__findresult stbrp__skyline_find_best_pos(stbrp_context *c, int width, int height) 343 | { 344 | int best_waste = (1<<30), best_x, best_y = (1 << 30); 345 | stbrp__findresult fr; 346 | stbrp_node **prev, *node, *tail, **best = NULL; 347 | 348 | // align to multiple of c->align 349 | width = (width + c->align - 1); 350 | width -= width % c->align; 351 | STBRP_ASSERT(width % c->align == 0); 352 | 353 | // if it can't possibly fit, bail immediately 354 | if (width > c->width || height > c->height) { 355 | fr.prev_link = NULL; 356 | fr.x = fr.y = 0; 357 | return fr; 358 | } 359 | 360 | node = c->active_head; 361 | prev = &c->active_head; 362 | while (node->x + width <= c->width) { 363 | int y,waste; 364 | y = stbrp__skyline_find_min_y(c, node, node->x, width, &waste); 365 | if (c->heuristic == STBRP_HEURISTIC_Skyline_BL_sortHeight) { // actually just want to test BL 366 | // bottom left 367 | if (y < best_y) { 368 | best_y = y; 369 | best = prev; 370 | } 371 | } else { 372 | // best-fit 373 | if (y + height <= c->height) { 374 | // can only use it if it first vertically 375 | if (y < best_y || (y == best_y && waste < best_waste)) { 376 | best_y = y; 377 | best_waste = waste; 378 | best = prev; 379 | } 380 | } 381 | } 382 | prev = &node->next; 383 | node = node->next; 384 | } 385 | 386 | best_x = (best == NULL) ? 0 : (*best)->x; 387 | 388 | // if doing best-fit (BF), we also have to try aligning right edge to each node position 389 | // 390 | // e.g, if fitting 391 | // 392 | // ____________________ 393 | // |____________________| 394 | // 395 | // into 396 | // 397 | // | | 398 | // | ____________| 399 | // |____________| 400 | // 401 | // then right-aligned reduces waste, but bottom-left BL is always chooses left-aligned 402 | // 403 | // This makes BF take about 2x the time 404 | 405 | if (c->heuristic == STBRP_HEURISTIC_Skyline_BF_sortHeight) { 406 | tail = c->active_head; 407 | node = c->active_head; 408 | prev = &c->active_head; 409 | // find first node that's admissible 410 | while (tail->x < width) 411 | tail = tail->next; 412 | while (tail) { 413 | int xpos = tail->x - width; 414 | int y,waste; 415 | STBRP_ASSERT(xpos >= 0); 416 | // find the left position that matches this 417 | while (node->next->x <= xpos) { 418 | prev = &node->next; 419 | node = node->next; 420 | } 421 | STBRP_ASSERT(node->next->x > xpos && node->x <= xpos); 422 | y = stbrp__skyline_find_min_y(c, node, xpos, width, &waste); 423 | if (y + height <= c->height) { 424 | if (y <= best_y) { 425 | if (y < best_y || waste < best_waste || (waste==best_waste && xpos < best_x)) { 426 | best_x = xpos; 427 | STBRP_ASSERT(y <= best_y); 428 | best_y = y; 429 | best_waste = waste; 430 | best = prev; 431 | } 432 | } 433 | } 434 | tail = tail->next; 435 | } 436 | } 437 | 438 | fr.prev_link = best; 439 | fr.x = best_x; 440 | fr.y = best_y; 441 | return fr; 442 | } 443 | 444 | static stbrp__findresult stbrp__skyline_pack_rectangle(stbrp_context *context, int width, int height) 445 | { 446 | // find best position according to heuristic 447 | stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height); 448 | stbrp_node *node, *cur; 449 | 450 | // bail if: 451 | // 1. it failed 452 | // 2. the best node doesn't fit (we don't always check this) 453 | // 3. we're out of memory 454 | if (res.prev_link == NULL || res.y + height > context->height || context->free_head == NULL) { 455 | res.prev_link = NULL; 456 | return res; 457 | } 458 | 459 | // on success, create new node 460 | node = context->free_head; 461 | node->x = (stbrp_coord) res.x; 462 | node->y = (stbrp_coord) (res.y + height); 463 | 464 | context->free_head = node->next; 465 | 466 | // insert the new node into the right starting point, and 467 | // let 'cur' point to the remaining nodes needing to be 468 | // stiched back in 469 | 470 | cur = *res.prev_link; 471 | if (cur->x < res.x) { 472 | // preserve the existing one, so start testing with the next one 473 | stbrp_node *next = cur->next; 474 | cur->next = node; 475 | cur = next; 476 | } else { 477 | *res.prev_link = node; 478 | } 479 | 480 | // from here, traverse cur and free the nodes, until we get to one 481 | // that shouldn't be freed 482 | while (cur->next && cur->next->x <= res.x + width) { 483 | stbrp_node *next = cur->next; 484 | // move the current node to the free list 485 | cur->next = context->free_head; 486 | context->free_head = cur; 487 | cur = next; 488 | } 489 | 490 | // stitch the list back in 491 | node->next = cur; 492 | 493 | if (cur->x < res.x + width) 494 | cur->x = (stbrp_coord) (res.x + width); 495 | 496 | #ifdef _DEBUG 497 | cur = context->active_head; 498 | while (cur->x < context->width) { 499 | STBRP_ASSERT(cur->x < cur->next->x); 500 | cur = cur->next; 501 | } 502 | STBRP_ASSERT(cur->next == NULL); 503 | 504 | { 505 | int count=0; 506 | cur = context->active_head; 507 | while (cur) { 508 | cur = cur->next; 509 | ++count; 510 | } 511 | cur = context->free_head; 512 | while (cur) { 513 | cur = cur->next; 514 | ++count; 515 | } 516 | STBRP_ASSERT(count == context->num_nodes+2); 517 | } 518 | #endif 519 | 520 | return res; 521 | } 522 | 523 | static int rect_height_compare(const void *a, const void *b) 524 | { 525 | const stbrp_rect *p = (const stbrp_rect *) a; 526 | const stbrp_rect *q = (const stbrp_rect *) b; 527 | if (p->h > q->h) 528 | return -1; 529 | if (p->h < q->h) 530 | return 1; 531 | return (p->w > q->w) ? -1 : (p->w < q->w); 532 | } 533 | 534 | static int rect_original_order(const void *a, const void *b) 535 | { 536 | const stbrp_rect *p = (const stbrp_rect *) a; 537 | const stbrp_rect *q = (const stbrp_rect *) b; 538 | return (p->was_packed < q->was_packed) ? -1 : (p->was_packed > q->was_packed); 539 | } 540 | 541 | #ifdef STBRP_LARGE_RECTS 542 | #define STBRP__MAXVAL 0xffffffff 543 | #else 544 | #define STBRP__MAXVAL 0xffff 545 | #endif 546 | 547 | STBRP_DEF int stbrp_pack_rects(stbrp_context *context, stbrp_rect *rects, int num_rects) 548 | { 549 | int i, all_rects_packed = 1; 550 | 551 | // we use the 'was_packed' field internally to allow sorting/unsorting 552 | for (i=0; i < num_rects; ++i) { 553 | rects[i].was_packed = i; 554 | } 555 | 556 | // sort according to heuristic 557 | STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_height_compare); 558 | 559 | for (i=0; i < num_rects; ++i) { 560 | if (rects[i].w == 0 || rects[i].h == 0) { 561 | rects[i].x = rects[i].y = 0; // empty rect needs no space 562 | } else { 563 | stbrp__findresult fr = stbrp__skyline_pack_rectangle(context, rects[i].w, rects[i].h); 564 | if (fr.prev_link) { 565 | rects[i].x = (stbrp_coord) fr.x; 566 | rects[i].y = (stbrp_coord) fr.y; 567 | } else { 568 | rects[i].x = rects[i].y = STBRP__MAXVAL; 569 | } 570 | } 571 | } 572 | 573 | // unsort 574 | STBRP_SORT(rects, num_rects, sizeof(rects[0]), rect_original_order); 575 | 576 | // set was_packed flags and all_rects_packed status 577 | for (i=0; i < num_rects; ++i) { 578 | rects[i].was_packed = !(rects[i].x == STBRP__MAXVAL && rects[i].y == STBRP__MAXVAL); 579 | if (!rects[i].was_packed) 580 | all_rects_packed = 0; 581 | } 582 | 583 | // return the all_rects_packed status 584 | return all_rects_packed; 585 | } 586 | #endif 587 | 588 | /* 589 | ------------------------------------------------------------------------------ 590 | This software is available under 2 licenses -- choose whichever you prefer. 591 | ------------------------------------------------------------------------------ 592 | ALTERNATIVE A - MIT License 593 | Copyright (c) 2017 Sean Barrett 594 | Permission is hereby granted, free of charge, to any person obtaining a copy of 595 | this software and associated documentation files (the "Software"), to deal in 596 | the Software without restriction, including without limitation the rights to 597 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 598 | of the Software, and to permit persons to whom the Software is furnished to do 599 | so, subject to the following conditions: 600 | The above copyright notice and this permission notice shall be included in all 601 | copies or substantial portions of the Software. 602 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 603 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 604 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 605 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 606 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 607 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 608 | SOFTWARE. 609 | ------------------------------------------------------------------------------ 610 | ALTERNATIVE B - Public Domain (www.unlicense.org) 611 | This is free and unencumbered software released into the public domain. 612 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 613 | software, either in source code form or as a compiled binary, for any purpose, 614 | commercial or non-commercial, and by any means. 615 | In jurisdictions that recognize copyright laws, the author or authors of this 616 | software dedicate any and all copyright interest in the software to the public 617 | domain. We make this dedication for the benefit of the public at large and to 618 | the detriment of our heirs and successors. We intend this dedication to be an 619 | overt act of relinquishment in perpetuity of all present and future rights to 620 | this software under copyright law. 621 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 622 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 623 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 624 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 625 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 626 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 627 | ------------------------------------------------------------------------------ 628 | */ 629 | -------------------------------------------------------------------------------- /src/stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.07 - public domain - http://nothings.org/stb/stb_image_write.h 2 | writes out PNG/BMP/TGA/JPEG/HDR images to C stdio - Sean Barrett 2010-2015 3 | no warranty implied; use at your own risk 4 | 5 | Before #including, 6 | 7 | #define STB_IMAGE_WRITE_IMPLEMENTATION 8 | 9 | in the file that you want to have the implementation. 10 | 11 | Will probably not work correctly with strict-aliasing optimizations. 12 | 13 | ABOUT: 14 | 15 | This header file is a library for writing images to C stdio. It could be 16 | adapted to write to memory or a general streaming interface; let me know. 17 | 18 | The PNG output is not optimal; it is 20-50% larger than the file 19 | written by a decent optimizing implementation. This library is designed 20 | for source code compactness and simplicity, not optimal image file size 21 | or run-time performance. 22 | 23 | BUILDING: 24 | 25 | You can #define STBIW_ASSERT(x) before the #include to avoid using assert.h. 26 | You can #define STBIW_MALLOC(), STBIW_REALLOC(), and STBIW_FREE() to replace 27 | malloc,realloc,free. 28 | You can define STBIW_MEMMOVE() to replace memmove() 29 | 30 | USAGE: 31 | 32 | There are four functions, one for each image file format: 33 | 34 | int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 35 | int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 36 | int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 37 | int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 38 | int stbi_write_jpg(char const *filename, int w, int h, int comp, const float *data); 39 | 40 | There are also four equivalent functions that use an arbitrary write function. You are 41 | expected to open/close your file-equivalent before and after calling these: 42 | 43 | int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 44 | int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 45 | int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 46 | int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 47 | int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 48 | 49 | where the callback is: 50 | void stbi_write_func(void *context, void *data, int size); 51 | 52 | You can define STBI_WRITE_NO_STDIO to disable the file variant of these 53 | functions, so the library will not use stdio.h at all. However, this will 54 | also disable HDR writing, because it requires stdio for formatted output. 55 | 56 | Each function returns 0 on failure and non-0 on success. 57 | 58 | The functions create an image file defined by the parameters. The image 59 | is a rectangle of pixels stored from left-to-right, top-to-bottom. 60 | Each pixel contains 'comp' channels of data stored interleaved with 8-bits 61 | per channel, in the following order: 1=Y, 2=YA, 3=RGB, 4=RGBA. (Y is 62 | monochrome color.) The rectangle is 'w' pixels wide and 'h' pixels tall. 63 | The *data pointer points to the first byte of the top-left-most pixel. 64 | For PNG, "stride_in_bytes" is the distance in bytes from the first byte of 65 | a row of pixels to the first byte of the next row of pixels. 66 | 67 | PNG creates output files with the same number of components as the input. 68 | The BMP format expands Y to RGB in the file format and does not 69 | output alpha. 70 | 71 | PNG supports writing rectangles of data even when the bytes storing rows of 72 | data are not consecutive in memory (e.g. sub-rectangles of a larger image), 73 | by supplying the stride between the beginning of adjacent rows. The other 74 | formats do not. (Thus you cannot write a native-format BMP through the BMP 75 | writer, both because it is in BGR order and because it may have padding 76 | at the end of the line.) 77 | 78 | HDR expects linear float data. Since the format is always 32-bit rgb(e) 79 | data, alpha (if provided) is discarded, and for monochrome data it is 80 | replicated across all three channels. 81 | 82 | TGA supports RLE or non-RLE compressed data. To use non-RLE-compressed 83 | data, set the global variable 'stbi_write_tga_with_rle' to 0. 84 | 85 | JPEG does ignore alpha channels in input data; quality is between 1 and 100. 86 | Higher quality looks better but results in a bigger image. 87 | JPEG baseline (no JPEG progressive). 88 | 89 | CREDITS: 90 | 91 | PNG/BMP/TGA 92 | Sean Barrett 93 | HDR 94 | Baldur Karlsson 95 | TGA monochrome: 96 | Jean-Sebastien Guay 97 | misc enhancements: 98 | Tim Kelsey 99 | TGA RLE 100 | Alan Hickman 101 | initial file IO callback implementation 102 | Emmanuel Julien 103 | JPEG 104 | Jon Olick (original jo_jpeg.cpp code) 105 | Daniel Gibson 106 | bugfixes: 107 | github:Chribba 108 | Guillaume Chereau 109 | github:jry2 110 | github:romigrou 111 | Sergio Gonzalez 112 | Jonas Karlsson 113 | Filip Wasil 114 | Thatcher Ulrich 115 | github:poppolopoppo 116 | Patrick Boettcher 117 | 118 | LICENSE 119 | 120 | See end of file for license information. 121 | 122 | */ 123 | 124 | #ifndef INCLUDE_STB_IMAGE_WRITE_H 125 | #define INCLUDE_STB_IMAGE_WRITE_H 126 | 127 | #ifdef __cplusplus 128 | extern "C" { 129 | #endif 130 | 131 | #ifdef STB_IMAGE_WRITE_STATIC 132 | #define STBIWDEF static 133 | #else 134 | #define STBIWDEF extern 135 | extern int stbi_write_tga_with_rle; 136 | #endif 137 | 138 | #ifndef STBI_WRITE_NO_STDIO 139 | STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 140 | STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 141 | STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 142 | STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 143 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); 144 | #endif 145 | 146 | typedef void stbi_write_func(void *context, void *data, int size); 147 | 148 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 149 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 150 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 151 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 152 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 153 | 154 | #ifdef __cplusplus 155 | } 156 | #endif 157 | 158 | #endif//INCLUDE_STB_IMAGE_WRITE_H 159 | 160 | #ifdef STB_IMAGE_WRITE_IMPLEMENTATION 161 | 162 | #ifdef _WIN32 163 | #ifndef _CRT_SECURE_NO_WARNINGS 164 | #define _CRT_SECURE_NO_WARNINGS 165 | #endif 166 | #ifndef _CRT_NONSTDC_NO_DEPRECATE 167 | #define _CRT_NONSTDC_NO_DEPRECATE 168 | #endif 169 | #endif 170 | 171 | #ifndef STBI_WRITE_NO_STDIO 172 | #include 173 | #endif // STBI_WRITE_NO_STDIO 174 | 175 | #include 176 | #include 177 | #include 178 | #include 179 | 180 | #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) 181 | // ok 182 | #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) 183 | // ok 184 | #else 185 | #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." 186 | #endif 187 | 188 | #ifndef STBIW_MALLOC 189 | #define STBIW_MALLOC(sz) malloc(sz) 190 | #define STBIW_REALLOC(p,newsz) realloc(p,newsz) 191 | #define STBIW_FREE(p) free(p) 192 | #endif 193 | 194 | #ifndef STBIW_REALLOC_SIZED 195 | #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) 196 | #endif 197 | 198 | 199 | #ifndef STBIW_MEMMOVE 200 | #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) 201 | #endif 202 | 203 | 204 | #ifndef STBIW_ASSERT 205 | #include 206 | #define STBIW_ASSERT(x) assert(x) 207 | #endif 208 | 209 | #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) 210 | 211 | typedef struct 212 | { 213 | stbi_write_func *func; 214 | void *context; 215 | } stbi__write_context; 216 | 217 | // initialize a callback-based context 218 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 219 | { 220 | s->func = c; 221 | s->context = context; 222 | } 223 | 224 | #ifndef STBI_WRITE_NO_STDIO 225 | 226 | static void stbi__stdio_write(void *context, void *data, int size) 227 | { 228 | fwrite(data,1,size,(FILE*) context); 229 | } 230 | 231 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 232 | { 233 | FILE *f = fopen(filename, "wb"); 234 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 235 | return f != NULL; 236 | } 237 | 238 | static void stbi__end_write_file(stbi__write_context *s) 239 | { 240 | fclose((FILE *)s->context); 241 | } 242 | 243 | #endif // !STBI_WRITE_NO_STDIO 244 | 245 | typedef unsigned int stbiw_uint32; 246 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 247 | 248 | #ifdef STB_IMAGE_WRITE_STATIC 249 | static int stbi_write_tga_with_rle = 1; 250 | #else 251 | int stbi_write_tga_with_rle = 1; 252 | #endif 253 | 254 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 255 | { 256 | while (*fmt) { 257 | switch (*fmt++) { 258 | case ' ': break; 259 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 260 | s->func(s->context,&x,1); 261 | break; } 262 | case '2': { int x = va_arg(v,int); 263 | unsigned char b[2]; 264 | b[0] = STBIW_UCHAR(x); 265 | b[1] = STBIW_UCHAR(x>>8); 266 | s->func(s->context,b,2); 267 | break; } 268 | case '4': { stbiw_uint32 x = va_arg(v,int); 269 | unsigned char b[4]; 270 | b[0]=STBIW_UCHAR(x); 271 | b[1]=STBIW_UCHAR(x>>8); 272 | b[2]=STBIW_UCHAR(x>>16); 273 | b[3]=STBIW_UCHAR(x>>24); 274 | s->func(s->context,b,4); 275 | break; } 276 | default: 277 | STBIW_ASSERT(0); 278 | return; 279 | } 280 | } 281 | } 282 | 283 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 284 | { 285 | va_list v; 286 | va_start(v, fmt); 287 | stbiw__writefv(s, fmt, v); 288 | va_end(v); 289 | } 290 | 291 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 292 | { 293 | s->func(s->context, &c, 1); 294 | } 295 | 296 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 297 | { 298 | unsigned char arr[3]; 299 | arr[0] = a, arr[1] = b, arr[2] = c; 300 | s->func(s->context, arr, 3); 301 | } 302 | 303 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 304 | { 305 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 306 | int k; 307 | 308 | if (write_alpha < 0) 309 | s->func(s->context, &d[comp - 1], 1); 310 | 311 | switch (comp) { 312 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 313 | case 1: 314 | if (expand_mono) 315 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 316 | else 317 | s->func(s->context, d, 1); // monochrome TGA 318 | break; 319 | case 4: 320 | if (!write_alpha) { 321 | // composite against pink background 322 | for (k = 0; k < 3; ++k) 323 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 324 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 325 | break; 326 | } 327 | /* FALLTHROUGH */ 328 | case 3: 329 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 330 | break; 331 | } 332 | if (write_alpha > 0) 333 | s->func(s->context, &d[comp - 1], 1); 334 | } 335 | 336 | static void stbiw__write_pixels(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, void *data, int write_alpha, int scanline_pad, int expand_mono) 337 | { 338 | stbiw_uint32 zero = 0; 339 | int i,j, j_end; 340 | 341 | if (y <= 0) 342 | return; 343 | 344 | if (vdir < 0) 345 | j_end = -1, j = y-1; 346 | else 347 | j_end = y, j = 0; 348 | 349 | for (; j != j_end; j += vdir) { 350 | for (i=0; i < x; ++i) { 351 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 352 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 353 | } 354 | s->func(s->context, &zero, scanline_pad); 355 | } 356 | } 357 | 358 | static int stbiw__outfile(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, int expand_mono, void *data, int alpha, int pad, const char *fmt, ...) 359 | { 360 | if (y < 0 || x < 0) { 361 | return 0; 362 | } else { 363 | va_list v; 364 | va_start(v, fmt); 365 | stbiw__writefv(s, fmt, v); 366 | va_end(v); 367 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 368 | return 1; 369 | } 370 | } 371 | 372 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 373 | { 374 | int pad = (-x*3) & 3; 375 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 376 | "11 4 22 4" "4 44 22 444444", 377 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 378 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 379 | } 380 | 381 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 382 | { 383 | stbi__write_context s; 384 | stbi__start_write_callbacks(&s, func, context); 385 | return stbi_write_bmp_core(&s, x, y, comp, data); 386 | } 387 | 388 | #ifndef STBI_WRITE_NO_STDIO 389 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 390 | { 391 | stbi__write_context s; 392 | if (stbi__start_write_file(&s,filename)) { 393 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 394 | stbi__end_write_file(&s); 395 | return r; 396 | } else 397 | return 0; 398 | } 399 | #endif //!STBI_WRITE_NO_STDIO 400 | 401 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 402 | { 403 | int has_alpha = (comp == 2 || comp == 4); 404 | int colorbytes = has_alpha ? comp-1 : comp; 405 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 406 | 407 | if (y < 0 || x < 0) 408 | return 0; 409 | 410 | if (!stbi_write_tga_with_rle) { 411 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 412 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 413 | } else { 414 | int i,j,k; 415 | 416 | stbiw__writef(s, "111 221 2222 11", 0,0,format+8, 0,0,0, 0,0,x,y, (colorbytes + has_alpha) * 8, has_alpha * 8); 417 | 418 | for (j = y - 1; j >= 0; --j) { 419 | unsigned char *row = (unsigned char *) data + j * x * comp; 420 | int len; 421 | 422 | for (i = 0; i < x; i += len) { 423 | unsigned char *begin = row + i * comp; 424 | int diff = 1; 425 | len = 1; 426 | 427 | if (i < x - 1) { 428 | ++len; 429 | diff = memcmp(begin, row + (i + 1) * comp, comp); 430 | if (diff) { 431 | const unsigned char *prev = begin; 432 | for (k = i + 2; k < x && len < 128; ++k) { 433 | if (memcmp(prev, row + k * comp, comp)) { 434 | prev += comp; 435 | ++len; 436 | } else { 437 | --len; 438 | break; 439 | } 440 | } 441 | } else { 442 | for (k = i + 2; k < x && len < 128; ++k) { 443 | if (!memcmp(begin, row + k * comp, comp)) { 444 | ++len; 445 | } else { 446 | break; 447 | } 448 | } 449 | } 450 | } 451 | 452 | if (diff) { 453 | unsigned char header = STBIW_UCHAR(len - 1); 454 | s->func(s->context, &header, 1); 455 | for (k = 0; k < len; ++k) { 456 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 457 | } 458 | } else { 459 | unsigned char header = STBIW_UCHAR(len - 129); 460 | s->func(s->context, &header, 1); 461 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 462 | } 463 | } 464 | } 465 | } 466 | return 1; 467 | } 468 | 469 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 470 | { 471 | stbi__write_context s; 472 | stbi__start_write_callbacks(&s, func, context); 473 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 474 | } 475 | 476 | #ifndef STBI_WRITE_NO_STDIO 477 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 478 | { 479 | stbi__write_context s; 480 | if (stbi__start_write_file(&s,filename)) { 481 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 482 | stbi__end_write_file(&s); 483 | return r; 484 | } else 485 | return 0; 486 | } 487 | #endif 488 | 489 | // ************************************************************************************************* 490 | // Radiance RGBE HDR writer 491 | // by Baldur Karlsson 492 | 493 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 494 | 495 | void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 496 | { 497 | int exponent; 498 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 499 | 500 | if (maxcomp < 1e-32f) { 501 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 502 | } else { 503 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 504 | 505 | rgbe[0] = (unsigned char)(linear[0] * normalize); 506 | rgbe[1] = (unsigned char)(linear[1] * normalize); 507 | rgbe[2] = (unsigned char)(linear[2] * normalize); 508 | rgbe[3] = (unsigned char)(exponent + 128); 509 | } 510 | } 511 | 512 | void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 513 | { 514 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 515 | STBIW_ASSERT(length+128 <= 255); 516 | s->func(s->context, &lengthbyte, 1); 517 | s->func(s->context, &databyte, 1); 518 | } 519 | 520 | void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 521 | { 522 | unsigned char lengthbyte = STBIW_UCHAR(length); 523 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 524 | s->func(s->context, &lengthbyte, 1); 525 | s->func(s->context, data, length); 526 | } 527 | 528 | void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 529 | { 530 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 531 | unsigned char rgbe[4]; 532 | float linear[3]; 533 | int x; 534 | 535 | scanlineheader[2] = (width&0xff00)>>8; 536 | scanlineheader[3] = (width&0x00ff); 537 | 538 | /* skip RLE for images too small or large */ 539 | if (width < 8 || width >= 32768) { 540 | for (x=0; x < width; x++) { 541 | switch (ncomp) { 542 | case 4: /* fallthrough */ 543 | case 3: linear[2] = scanline[x*ncomp + 2]; 544 | linear[1] = scanline[x*ncomp + 1]; 545 | linear[0] = scanline[x*ncomp + 0]; 546 | break; 547 | default: 548 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 549 | break; 550 | } 551 | stbiw__linear_to_rgbe(rgbe, linear); 552 | s->func(s->context, rgbe, 4); 553 | } 554 | } else { 555 | int c,r; 556 | /* encode into scratch buffer */ 557 | for (x=0; x < width; x++) { 558 | switch(ncomp) { 559 | case 4: /* fallthrough */ 560 | case 3: linear[2] = scanline[x*ncomp + 2]; 561 | linear[1] = scanline[x*ncomp + 1]; 562 | linear[0] = scanline[x*ncomp + 0]; 563 | break; 564 | default: 565 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 566 | break; 567 | } 568 | stbiw__linear_to_rgbe(rgbe, linear); 569 | scratch[x + width*0] = rgbe[0]; 570 | scratch[x + width*1] = rgbe[1]; 571 | scratch[x + width*2] = rgbe[2]; 572 | scratch[x + width*3] = rgbe[3]; 573 | } 574 | 575 | s->func(s->context, scanlineheader, 4); 576 | 577 | /* RLE each component separately */ 578 | for (c=0; c < 4; c++) { 579 | unsigned char *comp = &scratch[width*c]; 580 | 581 | x = 0; 582 | while (x < width) { 583 | // find first run 584 | r = x; 585 | while (r+2 < width) { 586 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 587 | break; 588 | ++r; 589 | } 590 | if (r+2 >= width) 591 | r = width; 592 | // dump up to first run 593 | while (x < r) { 594 | int len = r-x; 595 | if (len > 128) len = 128; 596 | stbiw__write_dump_data(s, len, &comp[x]); 597 | x += len; 598 | } 599 | // if there's a run, output it 600 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 601 | // find next byte after run 602 | while (r < width && comp[r] == comp[x]) 603 | ++r; 604 | // output run up to r 605 | while (x < r) { 606 | int len = r-x; 607 | if (len > 127) len = 127; 608 | stbiw__write_run_data(s, len, comp[x]); 609 | x += len; 610 | } 611 | } 612 | } 613 | } 614 | } 615 | } 616 | 617 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 618 | { 619 | if (y <= 0 || x <= 0 || data == NULL) 620 | return 0; 621 | else { 622 | // Each component is stored separately. Allocate scratch space for full output scanline. 623 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 624 | int i, len; 625 | char buffer[128]; 626 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 627 | s->func(s->context, header, sizeof(header)-1); 628 | 629 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 630 | s->func(s->context, buffer, len); 631 | 632 | for(i=0; i < y; i++) 633 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*i*x); 634 | STBIW_FREE(scratch); 635 | return 1; 636 | } 637 | } 638 | 639 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 640 | { 641 | stbi__write_context s; 642 | stbi__start_write_callbacks(&s, func, context); 643 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 644 | } 645 | 646 | #ifndef STBI_WRITE_NO_STDIO 647 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 648 | { 649 | stbi__write_context s; 650 | if (stbi__start_write_file(&s,filename)) { 651 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 652 | stbi__end_write_file(&s); 653 | return r; 654 | } else 655 | return 0; 656 | } 657 | #endif // STBI_WRITE_NO_STDIO 658 | 659 | 660 | ////////////////////////////////////////////////////////////////////////////// 661 | // 662 | // PNG writer 663 | // 664 | 665 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 666 | #define stbiw__sbraw(a) ((int *) (a) - 2) 667 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 668 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 669 | 670 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 671 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 672 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 673 | 674 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 675 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 676 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 677 | 678 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 679 | { 680 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 681 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 682 | STBIW_ASSERT(p); 683 | if (p) { 684 | if (!*arr) ((int *) p)[1] = 0; 685 | *arr = (void *) ((int *) p + 2); 686 | stbiw__sbm(*arr) = m; 687 | } 688 | return *arr; 689 | } 690 | 691 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 692 | { 693 | while (*bitcount >= 8) { 694 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 695 | *bitbuffer >>= 8; 696 | *bitcount -= 8; 697 | } 698 | return data; 699 | } 700 | 701 | static int stbiw__zlib_bitrev(int code, int codebits) 702 | { 703 | int res=0; 704 | while (codebits--) { 705 | res = (res << 1) | (code & 1); 706 | code >>= 1; 707 | } 708 | return res; 709 | } 710 | 711 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 712 | { 713 | int i; 714 | for (i=0; i < limit && i < 258; ++i) 715 | if (a[i] != b[i]) break; 716 | return i; 717 | } 718 | 719 | static unsigned int stbiw__zhash(unsigned char *data) 720 | { 721 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 722 | hash ^= hash << 3; 723 | hash += hash >> 5; 724 | hash ^= hash << 4; 725 | hash += hash >> 17; 726 | hash ^= hash << 25; 727 | hash += hash >> 6; 728 | return hash; 729 | } 730 | 731 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 732 | #define stbiw__zlib_add(code,codebits) \ 733 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 734 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 735 | // default huffman tables 736 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 737 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 738 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 739 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 740 | #define stbiw__zlib_huff(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : (n) <= 255 ? stbiw__zlib_huff2(n) : (n) <= 279 ? stbiw__zlib_huff3(n) : stbiw__zlib_huff4(n)) 741 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 742 | 743 | #define stbiw__ZHASH 16384 744 | 745 | unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 746 | { 747 | static unsigned short lengthc[] = { 3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258, 259 }; 748 | static unsigned char lengtheb[]= { 0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0 }; 749 | static unsigned short distc[] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577, 32768 }; 750 | static unsigned char disteb[] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13 }; 751 | unsigned int bitbuf=0; 752 | int i,j, bitcount=0; 753 | unsigned char *out = NULL; 754 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(char**)); 755 | if (quality < 5) quality = 5; 756 | 757 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 758 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 759 | stbiw__zlib_add(1,1); // BFINAL = 1 760 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 761 | 762 | for (i=0; i < stbiw__ZHASH; ++i) 763 | hash_table[i] = NULL; 764 | 765 | i=0; 766 | while (i < data_len-3) { 767 | // hash next 3 bytes of data to be compressed 768 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 769 | unsigned char *bestloc = 0; 770 | unsigned char **hlist = hash_table[h]; 771 | int n = stbiw__sbcount(hlist); 772 | for (j=0; j < n; ++j) { 773 | if (hlist[j]-data > i-32768) { // if entry lies within window 774 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 775 | if (d >= best) best=d,bestloc=hlist[j]; 776 | } 777 | } 778 | // when hash table entry is too long, delete half the entries 779 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 780 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 781 | stbiw__sbn(hash_table[h]) = quality; 782 | } 783 | stbiw__sbpush(hash_table[h],data+i); 784 | 785 | if (bestloc) { 786 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 787 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 788 | hlist = hash_table[h]; 789 | n = stbiw__sbcount(hlist); 790 | for (j=0; j < n; ++j) { 791 | if (hlist[j]-data > i-32767) { 792 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 793 | if (e > best) { // if next match is better, bail on current match 794 | bestloc = NULL; 795 | break; 796 | } 797 | } 798 | } 799 | } 800 | 801 | if (bestloc) { 802 | int d = (int) (data+i - bestloc); // distance back 803 | STBIW_ASSERT(d <= 32767 && best <= 258); 804 | for (j=0; best > lengthc[j+1]-1; ++j); 805 | stbiw__zlib_huff(j+257); 806 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 807 | for (j=0; d > distc[j+1]-1; ++j); 808 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 809 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 810 | i += best; 811 | } else { 812 | stbiw__zlib_huffb(data[i]); 813 | ++i; 814 | } 815 | } 816 | // write out final bytes 817 | for (;i < data_len; ++i) 818 | stbiw__zlib_huffb(data[i]); 819 | stbiw__zlib_huff(256); // end of block 820 | // pad with 0 bits to byte boundary 821 | while (bitcount) 822 | stbiw__zlib_add(0,1); 823 | 824 | for (i=0; i < stbiw__ZHASH; ++i) 825 | (void) stbiw__sbfree(hash_table[i]); 826 | STBIW_FREE(hash_table); 827 | 828 | { 829 | // compute adler32 on input 830 | unsigned int s1=1, s2=0; 831 | int blocklen = (int) (data_len % 5552); 832 | j=0; 833 | while (j < data_len) { 834 | for (i=0; i < blocklen; ++i) s1 += data[j+i], s2 += s1; 835 | s1 %= 65521, s2 %= 65521; 836 | j += blocklen; 837 | blocklen = 5552; 838 | } 839 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 840 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 841 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 842 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 843 | } 844 | *out_len = stbiw__sbn(out); 845 | // make returned pointer freeable 846 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 847 | return (unsigned char *) stbiw__sbraw(out); 848 | } 849 | 850 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 851 | { 852 | static unsigned int crc_table[256] = 853 | { 854 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 855 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 856 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 857 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 858 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 859 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 860 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 861 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 862 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 863 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 864 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 865 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 866 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 867 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 868 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 869 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 870 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 871 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 872 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 873 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 874 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 875 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 876 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 877 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 878 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 879 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 880 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 881 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 882 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 883 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 884 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 885 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 886 | }; 887 | 888 | unsigned int crc = ~0u; 889 | int i; 890 | for (i=0; i < len; ++i) 891 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 892 | return ~crc; 893 | } 894 | 895 | #define stbiw__wpng4(o,a,b,c,d) ((o)[0]=STBIW_UCHAR(a),(o)[1]=STBIW_UCHAR(b),(o)[2]=STBIW_UCHAR(c),(o)[3]=STBIW_UCHAR(d),(o)+=4) 896 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 897 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 898 | 899 | static void stbiw__wpcrc(unsigned char **data, int len) 900 | { 901 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 902 | stbiw__wp32(*data, crc); 903 | } 904 | 905 | static unsigned char stbiw__paeth(int a, int b, int c) 906 | { 907 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 908 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 909 | if (pb <= pc) return STBIW_UCHAR(b); 910 | return STBIW_UCHAR(c); 911 | } 912 | 913 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 914 | unsigned char *stbi_write_png_to_mem(unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 915 | { 916 | int ctype[5] = { -1, 0, 4, 2, 6 }; 917 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 918 | unsigned char *out,*o, *filt, *zlib; 919 | signed char *line_buffer; 920 | int i,j,k,p,zlen; 921 | 922 | if (stride_bytes == 0) 923 | stride_bytes = x * n; 924 | 925 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 926 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 927 | for (j=0; j < y; ++j) { 928 | static int mapping[] = { 0,1,2,3,4 }; 929 | static int firstmap[] = { 0,1,0,5,6 }; 930 | int *mymap = (j != 0) ? mapping : firstmap; 931 | int best = 0, bestval = 0x7fffffff; 932 | for (p=0; p < 2; ++p) { 933 | for (k= p?best:0; k < 5; ++k) { // @TODO: clarity: rewrite this to go 0..5, and 'continue' the unwanted ones during 2nd pass 934 | int type = mymap[k],est=0; 935 | unsigned char *z = pixels + stride_bytes*j; 936 | for (i=0; i < n; ++i) 937 | switch (type) { 938 | case 0: line_buffer[i] = z[i]; break; 939 | case 1: line_buffer[i] = z[i]; break; 940 | case 2: line_buffer[i] = z[i] - z[i-stride_bytes]; break; 941 | case 3: line_buffer[i] = z[i] - (z[i-stride_bytes]>>1); break; 942 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-stride_bytes],0)); break; 943 | case 5: line_buffer[i] = z[i]; break; 944 | case 6: line_buffer[i] = z[i]; break; 945 | } 946 | for (i=n; i < x*n; ++i) { 947 | switch (type) { 948 | case 0: line_buffer[i] = z[i]; break; 949 | case 1: line_buffer[i] = z[i] - z[i-n]; break; 950 | case 2: line_buffer[i] = z[i] - z[i-stride_bytes]; break; 951 | case 3: line_buffer[i] = z[i] - ((z[i-n] + z[i-stride_bytes])>>1); break; 952 | case 4: line_buffer[i] = z[i] - stbiw__paeth(z[i-n], z[i-stride_bytes], z[i-stride_bytes-n]); break; 953 | case 5: line_buffer[i] = z[i] - (z[i-n]>>1); break; 954 | case 6: line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 955 | } 956 | } 957 | if (p) break; 958 | for (i=0; i < x*n; ++i) 959 | est += abs((signed char) line_buffer[i]); 960 | if (est < bestval) { bestval = est; best = k; } 961 | } 962 | } 963 | // when we get here, best contains the filter type, and line_buffer contains the data 964 | filt[j*(x*n+1)] = (unsigned char) best; 965 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 966 | } 967 | STBIW_FREE(line_buffer); 968 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, 8); // increase 8 to get smaller but use more memory 969 | STBIW_FREE(filt); 970 | if (!zlib) return 0; 971 | 972 | // each tag requires 12 bytes of overhead 973 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 974 | if (!out) return 0; 975 | *out_len = 8 + 12+13 + 12+zlen + 12; 976 | 977 | o=out; 978 | STBIW_MEMMOVE(o,sig,8); o+= 8; 979 | stbiw__wp32(o, 13); // header length 980 | stbiw__wptag(o, "IHDR"); 981 | stbiw__wp32(o, x); 982 | stbiw__wp32(o, y); 983 | *o++ = 8; 984 | *o++ = STBIW_UCHAR(ctype[n]); 985 | *o++ = 0; 986 | *o++ = 0; 987 | *o++ = 0; 988 | stbiw__wpcrc(&o,13); 989 | 990 | stbiw__wp32(o, zlen); 991 | stbiw__wptag(o, "IDAT"); 992 | STBIW_MEMMOVE(o, zlib, zlen); 993 | o += zlen; 994 | STBIW_FREE(zlib); 995 | stbiw__wpcrc(&o, zlen); 996 | 997 | stbiw__wp32(o,0); 998 | stbiw__wptag(o, "IEND"); 999 | stbiw__wpcrc(&o,0); 1000 | 1001 | STBIW_ASSERT(o == out + *out_len); 1002 | 1003 | return out; 1004 | } 1005 | 1006 | #ifndef STBI_WRITE_NO_STDIO 1007 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1008 | { 1009 | FILE *f; 1010 | int len; 1011 | unsigned char *png = stbi_write_png_to_mem((unsigned char *) data, stride_bytes, x, y, comp, &len); 1012 | if (png == NULL) return 0; 1013 | f = fopen(filename, "wb"); 1014 | if (!f) { STBIW_FREE(png); return 0; } 1015 | fwrite(png, 1, len, f); 1016 | fclose(f); 1017 | STBIW_FREE(png); 1018 | return 1; 1019 | } 1020 | #endif 1021 | 1022 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int stride_bytes) 1023 | { 1024 | int len; 1025 | unsigned char *png = stbi_write_png_to_mem((unsigned char *) data, stride_bytes, x, y, comp, &len); 1026 | if (png == NULL) return 0; 1027 | func(context, png, len); 1028 | STBIW_FREE(png); 1029 | return 1; 1030 | } 1031 | 1032 | 1033 | /* *************************************************************************** 1034 | * 1035 | * JPEG writer 1036 | * 1037 | * This is based on Jon Olick's jo_jpeg.cpp: 1038 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1039 | */ 1040 | 1041 | static const unsigned char stbiw__jpg_ZigZag[] = { 0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18, 1042 | 24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63 }; 1043 | 1044 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1045 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1046 | bitCnt += bs[1]; 1047 | bitBuf |= bs[0] << (24 - bitCnt); 1048 | while(bitCnt >= 8) { 1049 | unsigned char c = (bitBuf >> 16) & 255; 1050 | stbiw__putc(s, c); 1051 | if(c == 255) { 1052 | stbiw__putc(s, 0); 1053 | } 1054 | bitBuf <<= 8; 1055 | bitCnt -= 8; 1056 | } 1057 | *bitBufP = bitBuf; 1058 | *bitCntP = bitCnt; 1059 | } 1060 | 1061 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1062 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1063 | float z1, z2, z3, z4, z5, z11, z13; 1064 | 1065 | float tmp0 = d0 + d7; 1066 | float tmp7 = d0 - d7; 1067 | float tmp1 = d1 + d6; 1068 | float tmp6 = d1 - d6; 1069 | float tmp2 = d2 + d5; 1070 | float tmp5 = d2 - d5; 1071 | float tmp3 = d3 + d4; 1072 | float tmp4 = d3 - d4; 1073 | 1074 | // Even part 1075 | float tmp10 = tmp0 + tmp3; // phase 2 1076 | float tmp13 = tmp0 - tmp3; 1077 | float tmp11 = tmp1 + tmp2; 1078 | float tmp12 = tmp1 - tmp2; 1079 | 1080 | d0 = tmp10 + tmp11; // phase 3 1081 | d4 = tmp10 - tmp11; 1082 | 1083 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1084 | d2 = tmp13 + z1; // phase 5 1085 | d6 = tmp13 - z1; 1086 | 1087 | // Odd part 1088 | tmp10 = tmp4 + tmp5; // phase 2 1089 | tmp11 = tmp5 + tmp6; 1090 | tmp12 = tmp6 + tmp7; 1091 | 1092 | // The rotator is modified from fig 4-8 to avoid extra negations. 1093 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1094 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1095 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1096 | z3 = tmp11 * 0.707106781f; // c4 1097 | 1098 | z11 = tmp7 + z3; // phase 5 1099 | z13 = tmp7 - z3; 1100 | 1101 | *d5p = z13 + z2; // phase 6 1102 | *d3p = z13 - z2; 1103 | *d1p = z11 + z4; 1104 | *d7p = z11 - z4; 1105 | 1106 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1107 | } 1108 | 1109 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1110 | int tmp1 = val < 0 ? -val : val; 1111 | val = val < 0 ? val-1 : val; 1112 | bits[1] = 1; 1113 | while(tmp1 >>= 1) { 1114 | ++bits[1]; 1115 | } 1116 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1154 | } 1155 | // end0pos = first element in reverse order !=0 1156 | if(end0pos == 0) { 1157 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1158 | return DU[0]; 1159 | } 1160 | for(i = 1; i <= end0pos; ++i) { 1161 | int startpos = i; 1162 | int nrzeroes; 1163 | unsigned short bits[2]; 1164 | for (; DU[i]==0 && i<=end0pos; ++i) { 1165 | } 1166 | nrzeroes = i-startpos; 1167 | if ( nrzeroes >= 16 ) { 1168 | int lng = nrzeroes>>4; 1169 | int nrmarker; 1170 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1171 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1172 | nrzeroes &= 15; 1173 | } 1174 | stbiw__jpg_calcBits(DU[i], bits); 1175 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1176 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1177 | } 1178 | if(end0pos != 63) { 1179 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1180 | } 1181 | return DU[0]; 1182 | } 1183 | 1184 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1185 | // Constants that don't pollute global namespace 1186 | static const unsigned char std_dc_luminance_nrcodes[] = {0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0}; 1187 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1188 | static const unsigned char std_ac_luminance_nrcodes[] = {0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d}; 1189 | static const unsigned char std_ac_luminance_values[] = { 1190 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1191 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1192 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1193 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1194 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1195 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1196 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1197 | }; 1198 | static const unsigned char std_dc_chrominance_nrcodes[] = {0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0}; 1199 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1200 | static const unsigned char std_ac_chrominance_nrcodes[] = {0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77}; 1201 | static const unsigned char std_ac_chrominance_values[] = { 1202 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1203 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1204 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1205 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1206 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1207 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1208 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1209 | }; 1210 | // Huffman tables 1211 | static const unsigned short YDC_HT[256][2] = { {0,2},{2,3},{3,3},{4,3},{5,3},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9}}; 1212 | static const unsigned short UVDC_HT[256][2] = { {0,2},{1,2},{2,2},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9},{1022,10},{2046,11}}; 1213 | static const unsigned short YAC_HT[256][2] = { 1214 | {10,4},{0,2},{1,2},{4,3},{11,4},{26,5},{120,7},{248,8},{1014,10},{65410,16},{65411,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1215 | {12,4},{27,5},{121,7},{502,9},{2038,11},{65412,16},{65413,16},{65414,16},{65415,16},{65416,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1216 | {28,5},{249,8},{1015,10},{4084,12},{65417,16},{65418,16},{65419,16},{65420,16},{65421,16},{65422,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1217 | {58,6},{503,9},{4085,12},{65423,16},{65424,16},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1218 | {59,6},{1016,10},{65430,16},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1219 | {122,7},{2039,11},{65438,16},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1220 | {123,7},{4086,12},{65446,16},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1221 | {250,8},{4087,12},{65454,16},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1222 | {504,9},{32704,15},{65462,16},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1223 | {505,9},{65470,16},{65471,16},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1224 | {506,9},{65479,16},{65480,16},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1225 | {1017,10},{65488,16},{65489,16},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1226 | {1018,10},{65497,16},{65498,16},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1227 | {2040,11},{65506,16},{65507,16},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1228 | {65515,16},{65516,16},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1229 | {2041,11},{65525,16},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1230 | }; 1231 | static const unsigned short UVAC_HT[256][2] = { 1232 | {0,2},{1,2},{4,3},{10,4},{24,5},{25,5},{56,6},{120,7},{500,9},{1014,10},{4084,12},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1233 | {11,4},{57,6},{246,8},{501,9},{2038,11},{4085,12},{65416,16},{65417,16},{65418,16},{65419,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1234 | {26,5},{247,8},{1015,10},{4086,12},{32706,15},{65420,16},{65421,16},{65422,16},{65423,16},{65424,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1235 | {27,5},{248,8},{1016,10},{4087,12},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{65430,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1236 | {58,6},{502,9},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{65438,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1237 | {59,6},{1017,10},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{65446,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1238 | {121,7},{2039,11},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{65454,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1239 | {122,7},{2040,11},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{65462,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1240 | {249,8},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{65470,16},{65471,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1241 | {503,9},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{65479,16},{65480,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1242 | {504,9},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{65488,16},{65489,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1243 | {505,9},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{65497,16},{65498,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1244 | {506,9},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{65506,16},{65507,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1245 | {2041,11},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{65515,16},{65516,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1246 | {16352,14},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{65525,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1247 | {1018,10},{32707,15},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1248 | }; 1249 | static const int YQT[] = {16,11,10,16,24,40,51,61,12,12,14,19,26,58,60,55,14,13,16,24,40,57,69,56,14,17,22,29,51,87,80,62,18,22, 1250 | 37,56,68,109,103,77,24,35,55,64,81,104,113,92,49,64,78,87,103,121,120,101,72,92,95,98,112,100,103,99}; 1251 | static const int UVQT[] = {17,18,24,47,99,99,99,99,18,21,26,66,99,99,99,99,24,26,56,99,99,99,99,99,47,66,99,99,99,99,99,99, 1252 | 99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99}; 1253 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1254 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1255 | 1256 | int row, col, i, k; 1257 | float fdtbl_Y[64], fdtbl_UV[64]; 1258 | unsigned char YTable[64], UVTable[64]; 1259 | 1260 | if(!data || !width || !height || comp > 4 || comp < 1) { 1261 | return 0; 1262 | } 1263 | 1264 | quality = quality ? quality : 90; 1265 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1266 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1267 | 1268 | for(i = 0; i < 64; ++i) { 1269 | int uvti, yti = (YQT[i]*quality+50)/100; 1270 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1271 | uvti = (UVQT[i]*quality+50)/100; 1272 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1273 | } 1274 | 1275 | for(row = 0, k = 0; row < 8; ++row) { 1276 | for(col = 0; col < 8; ++col, ++k) { 1277 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1278 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1279 | } 1280 | } 1281 | 1282 | // Write Headers 1283 | { 1284 | static const unsigned char head0[] = { 0xFF,0xD8,0xFF,0xE0,0,0x10,'J','F','I','F',0,1,1,0,0,1,0,1,0,0,0xFF,0xDB,0,0x84,0 }; 1285 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1286 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1287 | 3,1,0x11,0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1288 | s->func(s->context, (void*)head0, sizeof(head0)); 1289 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1290 | stbiw__putc(s, 1); 1291 | s->func(s->context, UVTable, sizeof(UVTable)); 1292 | s->func(s->context, (void*)head1, sizeof(head1)); 1293 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1294 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1295 | stbiw__putc(s, 0x10); // HTYACinfo 1296 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1297 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1298 | stbiw__putc(s, 1); // HTUDCinfo 1299 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1300 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1301 | stbiw__putc(s, 0x11); // HTUACinfo 1302 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1303 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1304 | s->func(s->context, (void*)head2, sizeof(head2)); 1305 | } 1306 | 1307 | // Encode 8x8 macroblocks 1308 | { 1309 | static const unsigned short fillBits[] = {0x7F, 7}; 1310 | const unsigned char *imageData = (const unsigned char *)data; 1311 | int DCY=0, DCU=0, DCV=0; 1312 | int bitBuf=0, bitCnt=0; 1313 | // comp == 2 is grey+alpha (alpha is ignored) 1314 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1315 | int x, y, pos; 1316 | for(y = 0; y < height; y += 8) { 1317 | for(x = 0; x < width; x += 8) { 1318 | float YDU[64], UDU[64], VDU[64]; 1319 | for(row = y, pos = 0; row < y+8; ++row) { 1320 | for(col = x; col < x+8; ++col, ++pos) { 1321 | int p = row*width*comp + col*comp; 1322 | float r, g, b; 1323 | if(row >= height) { 1324 | p -= width*comp*(row+1 - height); 1325 | } 1326 | if(col >= width) { 1327 | p -= comp*(col+1 - width); 1328 | } 1329 | 1330 | r = imageData[p+0]; 1331 | g = imageData[p+ofsG]; 1332 | b = imageData[p+ofsB]; 1333 | YDU[pos]=+0.29900f*r+0.58700f*g+0.11400f*b-128; 1334 | UDU[pos]=-0.16874f*r-0.33126f*g+0.50000f*b; 1335 | VDU[pos]=+0.50000f*r-0.41869f*g-0.08131f*b; 1336 | } 1337 | } 1338 | 1339 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, YDU, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1340 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, UDU, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1341 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, VDU, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1342 | } 1343 | } 1344 | 1345 | // Do the bit alignment of the EOI marker 1346 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1347 | } 1348 | 1349 | // EOI 1350 | stbiw__putc(s, 0xFF); 1351 | stbiw__putc(s, 0xD9); 1352 | 1353 | return 1; 1354 | } 1355 | 1356 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1357 | { 1358 | stbi__write_context s; 1359 | stbi__start_write_callbacks(&s, func, context); 1360 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1361 | } 1362 | 1363 | 1364 | #ifndef STBI_WRITE_NO_STDIO 1365 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1366 | { 1367 | stbi__write_context s; 1368 | if (stbi__start_write_file(&s,filename)) { 1369 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1370 | stbi__end_write_file(&s); 1371 | return r; 1372 | } else 1373 | return 0; 1374 | } 1375 | #endif 1376 | 1377 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1378 | 1379 | /* Revision history 1380 | 1.07 (2017-07-24) 1381 | doc fix 1382 | 1.06 (2017-07-23) 1383 | writing JPEG (using Jon Olick's code) 1384 | 1.05 ??? 1385 | 1.04 (2017-03-03) 1386 | monochrome BMP expansion 1387 | 1.03 ??? 1388 | 1.02 (2016-04-02) 1389 | avoid allocating large structures on the stack 1390 | 1.01 (2016-01-16) 1391 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1392 | avoid race-condition in crc initialization 1393 | minor compile issues 1394 | 1.00 (2015-09-14) 1395 | installable file IO function 1396 | 0.99 (2015-09-13) 1397 | warning fixes; TGA rle support 1398 | 0.98 (2015-04-08) 1399 | added STBIW_MALLOC, STBIW_ASSERT etc 1400 | 0.97 (2015-01-18) 1401 | fixed HDR asserts, rewrote HDR rle logic 1402 | 0.96 (2015-01-17) 1403 | add HDR output 1404 | fix monochrome BMP 1405 | 0.95 (2014-08-17) 1406 | add monochrome TGA output 1407 | 0.94 (2014-05-31) 1408 | rename private functions to avoid conflicts with stb_image.h 1409 | 0.93 (2014-05-27) 1410 | warning fixes 1411 | 0.92 (2010-08-01) 1412 | casts to unsigned char to fix warnings 1413 | 0.91 (2010-07-17) 1414 | first public release 1415 | 0.90 first internal release 1416 | */ 1417 | 1418 | /* 1419 | ------------------------------------------------------------------------------ 1420 | This software is available under 2 licenses -- choose whichever you prefer. 1421 | ------------------------------------------------------------------------------ 1422 | ALTERNATIVE A - MIT License 1423 | Copyright (c) 2017 Sean Barrett 1424 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1425 | this software and associated documentation files (the "Software"), to deal in 1426 | the Software without restriction, including without limitation the rights to 1427 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1428 | of the Software, and to permit persons to whom the Software is furnished to do 1429 | so, subject to the following conditions: 1430 | The above copyright notice and this permission notice shall be included in all 1431 | copies or substantial portions of the Software. 1432 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1433 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1434 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1435 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1436 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1437 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1438 | SOFTWARE. 1439 | ------------------------------------------------------------------------------ 1440 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1441 | This is free and unencumbered software released into the public domain. 1442 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1443 | software, either in source code form or as a compiled binary, for any purpose, 1444 | commercial or non-commercial, and by any means. 1445 | In jurisdictions that recognize copyright laws, the author or authors of this 1446 | software dedicate any and all copyright interest in the software to the public 1447 | domain. We make this dedication for the benefit of the public at large and to 1448 | the detriment of our heirs and successors. We intend this dedication to be an 1449 | overt act of relinquishment in perpetuity of all present and future rights to 1450 | this software under copyright law. 1451 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1452 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1453 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1454 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1455 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1456 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1457 | ------------------------------------------------------------------------------ 1458 | */ 1459 | --------------------------------------------------------------------------------