├── .gitignore ├── Makefile ├── formatters ├── CSV.h ├── JSON_HASH.h ├── JSON_ARRAY.h └── RAYLIB.h ├── .github └── FUNDING.yml ├── LICENSE ├── README.md ├── external ├── isl_args.h ├── cute_files.h ├── stb_rect_pack.h └── stb_image_write.h └── main.c /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | *.dSYM 3 | imgpack 4 | *.swp 5 | *.swo 6 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | all: 2 | cc -std=c99 -Wall -Wextra -Wshadow -O3 main.c -o imgpack -lm 3 | 4 | pack: 5 | cc -E main.c > imgpack.c 6 | 7 | pack-zip: 8 | cc -E main.c > imgpack.c 9 | zip -9 imgpack.zip imgpack.c 10 | -------------------------------------------------------------------------------- /formatters/CSV.h: -------------------------------------------------------------------------------- 1 | static int imgpack_formatter_CSV(struct ImgPackContext *ctx, FILE *f) { 2 | fprintf(f, "id, name, path, x, y, width, height, src_width, src_height, image, format, scale\n"); 3 | for (int i = 0; i < ctx->size; i++) { 4 | struct stbrp_rect frame = get_frame_rect(ctx, i); 5 | fprintf(f, "%d, \"%s\", \"%s\", %d, %d, %d, %d, %d, %d, \"%s\", \"%s\", \"%.5g\"\n", i, 6 | ctx->images[i].name, ctx->images[i].path, frame.x, frame.y, frame.w, frame.h, ctx->images[i].source.w, 7 | ctx->images[i].source.h, ctx->outputImagePath, get_output_image_format(ctx), 8 | ((1.0*ctx->scaleNumerator)/ctx->scaleDenominator)); 9 | } 10 | return 0; 11 | } 12 | -------------------------------------------------------------------------------- /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | # These are supported funding model platforms 2 | 3 | github: # Replace with up to 4 GitHub Sponsors-enabled usernames e.g., [user1, user2] 4 | patreon: # Replace with a single Patreon username 5 | open_collective: # Replace with a single Open Collective username 6 | ko_fi: V7V0VP6A # Replace with a single Ko-fi username 7 | tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel 8 | community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry 9 | liberapay: # Replace with a single Liberapay username 10 | issuehunt: # Replace with a single IssueHunt username 11 | otechie: # Replace with a single Otechie username 12 | custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2'] 13 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | MIT License 2 | 3 | Copyright (c) 2019 Ilya Kolbin (iskolbin@gmail.com) 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 | -------------------------------------------------------------------------------- /formatters/JSON_HASH.h: -------------------------------------------------------------------------------- 1 | static int imgpack_formatter_JSON_HASH(struct ImgPackContext *ctx, FILE *f) { 2 | fprintf(f, "{\"frames\": {\n\n"); 3 | for (int i = 0; i < ctx->size; i++) { 4 | struct stbrp_rect frame = get_frame_rect(ctx, i); 5 | switch (ctx->naming) { 6 | case IMGPACK_FULL_PATH: fprintf(f, "\"%s\":\n{\n", ctx->images[i].path); break; 7 | case IMGPACK_NAME_NO_EXT: fprintf(f, "\"%s\":\n{\n", ctx->images[i].name); break; 8 | case IMGPACK_NAME_WITH_EXT: fprintf(f, "\"%s%s\":\n{\n", ctx->images[i].name, ctx->images[i].ext); break; 9 | } 10 | fprintf(f, "\t\"frame\": {\"x\":%d,\"y\":%d,\"w\":%d,\"h\":%d},\n", frame.x, frame.y, frame.w, frame.h); 11 | fprintf(f, "\t\"rotated\": %s,\n", is_image_rotated(ctx, i) ? "true" : "false"); 12 | fprintf(f, "\t\"trimmed\": %s,\n", is_image_trimmed(ctx, i) ? "true" : "false"); 13 | fprintf(f, "\t\"spriteSourceSize\": {\"x\":%d,\"y\":%d,\"w\":%d,\"h\":%d},\n", ctx->images[i].source.x, ctx->images[i].source.y, frame.w, frame.h); 14 | fprintf(f, "\t\"sourceRects\": {\"w\":%d,\"h\":%d},\n", ctx->images[i].source.w, ctx->images[i].source.h); 15 | fprintf(f, "\t\"pivot\": {\"x\":0.5,\"y\":0.5}\n"); 16 | fprintf(f, "}%s\n", i == ctx->size-1 ? "}," : ","); 17 | } 18 | fprintf(f, "\"meta\": {\n"); 19 | fprintf(f, "\t\"app\": \"https://github.com/iskolbin/imgpack\",\n"); 20 | fprintf(f, "\t\"version\": \"%s\",\n", ISLIP_VERSION); 21 | fprintf(f, "\t\"image\": \"%s\",\n", ctx->outputImagePath); 22 | fprintf(f, "\t\"format\": \"%s\",\n", get_output_image_format(ctx)); 23 | fprintf(f, "\t\"size\": {\"w\":%d,\"h\":%d},\n", ctx->width, ctx->height); 24 | fprintf(f, "\t\"scale\": \"%.5g\"\n", ((1.0*ctx->scaleNumerator)/ctx->scaleDenominator)); 25 | fprintf(f, "}\n}"); 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /formatters/JSON_ARRAY.h: -------------------------------------------------------------------------------- 1 | static int imgpack_formatter_JSON_ARRAY(struct ImgPackContext *ctx, FILE *f) { 2 | fprintf(f, "{\"frames\": [\n\n"); 3 | for (int i = 0; i < ctx->size; i++) { 4 | struct stbrp_rect frame = get_frame_rect(ctx, i); 5 | fprintf(f, "{\n"); 6 | switch (ctx->naming) { 7 | case IMGPACK_FULL_PATH: fprintf(f, "\t\"filename\": \"%s\",\n", ctx->images[i].path); break; 8 | case IMGPACK_NAME_NO_EXT: fprintf(f, "\t\"filename\": \"%s\",\n", ctx->images[i].name); break; 9 | case IMGPACK_NAME_WITH_EXT: fprintf(f, "\t\"filename\": \"%s%s\",\n", ctx->images[i].name, ctx->images[i].ext); break; 10 | } 11 | fprintf(f, "\t\"frame\": {\"x\":%d,\"y\":%d,\"w\":%d,\"h\":%d},\n", frame.x, frame.y, frame.w, frame.h); 12 | fprintf(f, "\t\"rotated\": %s,\n", is_image_rotated(ctx, i) ? "true" : "false"); 13 | fprintf(f, "\t\"trimmed\": %s,\n", is_image_trimmed(ctx, i) ? "true" : "false"); 14 | fprintf(f, "\t\"spriteSourceSize\": {\"x\":%d,\"y\":%d,\"w\":%d,\"h\":%d},\n", ctx->images[i].source.x, ctx->images[i].source.y, frame.w, frame.h); 15 | fprintf(f, "\t\"sourceRects\": {\"w\":%d,\"h\":%d},\n", ctx->images[i].source.w, ctx->images[i].source.h); 16 | fprintf(f, "\t\"pivot\": {\"x\":0.5,\"y\":0.5}\n"); 17 | fprintf(f, "}%s\n", i == ctx->size-1 ? "]," : ","); 18 | } 19 | fprintf(f, "\"meta\": {\n"); 20 | fprintf(f, "\t\"app\": \"https://github.com/iskolbin/imgpack\",\n"); 21 | fprintf(f, "\t\"version\": \"%s\",\n", ISLIP_VERSION); 22 | fprintf(f, "\t\"image\": \"%s\",\n", ctx->outputImagePath); 23 | fprintf(f, "\t\"format\": \"%s\",\n", get_output_image_format(ctx)); 24 | fprintf(f, "\t\"size\": {\"w\":%d,\"h\":%d},\n", ctx->width, ctx->height); 25 | fprintf(f, "\t\"scale\": \"%.5g\"\n", ((1.0*ctx->scaleNumerator)/ctx->scaleDenominator)); 26 | fprintf(f, "}\n}"); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | [![ko-fi](https://www.ko-fi.com/img/githubbutton_sm.svg)](https://ko-fi.com/V7V0VP6A) 2 | 3 | Imgpack 4 | ======= 5 | 6 | Simple texture atlas generator. Takes folder with images and outputs texture atlas + data file. Written in pure C without external dependencies. For packing uses `stb_rect_pack` which implements `Skyline` bin packing algorithm. For crossplatform filesystem manipulation uses `cute_files`. 7 | 8 | Quick start 9 | ----------- 10 | 11 | To build you will need `C99` compiler and optionally `Make`. All dependencies are packed in the repo, so just clone the repo and do: 12 | 13 | ``` 14 | make all 15 | ``` 16 | 17 | This will create `imgpack` command-line tool which can be used like: 18 | 19 | ``` 20 | ./imgpack 21 | ``` 22 | 23 | where options are: 24 | 25 | | Key | | Value | Description 26 | |--------------|----|---------|---------------------------------------------- 27 | | --data | -d | string | output file path, if ommited `stdout` is used 28 | | --image | -i | string | output image path (NEEDED) 29 | | --name | -n | string | name 30 | | --format | -f | string | output atlas data format 31 | | --trim | -t | int | alpha threshold for trimming image with transparent border, should be 0-255 32 | | --padding | -p | int | adds transparent padding 33 | | --exturde | -e | int | adds copied pixels on image borders, which helps with texture bleeding 34 | | --max-width | -w | int | maximum atlas width 35 | | --max-height | -h | int | maximum atlas height 36 | | --scale | -s | int/int | scaling ratio int form "A/B" or just "K" 37 | | --unique | -u | | remove identical images (after trimming) 38 | | --force-pot | -2 | | force power of two texture output 39 | | --sort | -s | | sorting by path name (ascending) 40 | | --verbose | -v | | print debug messages during the packing process 41 | | --help | -? | | prints this memo 42 | 43 | Output atlas formats 44 | -------------------- 45 | 46 | ### RAYLIB 47 | 48 | Outputs plain C enums and static arrays of `raylib` structs. Ids of the images is generated as uppercased folder name + basename of the images without extension. For instance if you have `images` folder with `images/testing.png` image you will get: 49 | ``` 50 | enum IMAGES_Ids { 51 | IMAGES_TESTING = 0, 52 | }; 53 | 54 | #define IMAGES_PATH "output/images.png" 55 | 56 | static const Vector2 IMAGES_Scale[2] = {1, 1}; 57 | 58 | static const Vector2 IMAGES_Frame[1][4] = { 59 | {2, 2, 42, 42}, // which part of the atlas to draw 60 | }; 61 | 62 | static const Vector2 IMAGES_Size[1][2] = { 63 | i {80, 80}, // source size of the image 64 | }; 65 | ... 66 | ``` 67 | 68 | ### JSON\_ARRAY 69 | 70 | Outputs JSON formatted like TexturePacker does 71 | 72 | ### JSON\_HASH 73 | 74 | Outputs JSON formatted like TexturePacker does 75 | 76 | ### CSV 77 | 78 | Todos 79 | ----- 80 | 81 | * Multipacking 82 | * Compressed output texture (DXT5?) 83 | * Memory allocation checks 84 | * Input error checking 85 | 86 | Donation 87 | -------- 88 | 89 | ImgPack is free and open source project and if you like the project consider a [donation](https://ko-fi.com/V7V0VP6A). 90 | -------------------------------------------------------------------------------- /external/isl_args.h: -------------------------------------------------------------------------------- 1 | #ifndef ISL_ARGS_H_ 2 | #define ISL_ARGS_H_ 3 | 4 | /* 5 | isl_args.h - v0.3.1 6 | public domain library for parsing command line arguments; 7 | supports integers using IA_STRTOL, floats using IA_STRTOD, strings and flags 8 | 9 | author: Ilya Kolbin (iskolbin@gmail.com) 10 | url: github.com:iskolbin/isl_args.h 11 | 12 | LICENSE 13 | 14 | See end of file for license information. 15 | */ 16 | 17 | #ifndef IA_NO_ERRNO 18 | #include 19 | #define IA_ERRNO errno 20 | #define IA_ERANGE ERANGE 21 | #else 22 | /* No check at all */ 23 | #define IA_ERRNO 0 24 | #define IA_ERANGE 1 25 | #endif 26 | 27 | #ifndef IA_NO_STDIO 28 | #include 29 | #define IA_PRINTF printf 30 | #else 31 | #ifndef IA_PRINTF 32 | #error "IA_PRINTF not defined" 33 | #endif 34 | #endif 35 | 36 | #ifndef IA_NO_STDLIB 37 | #include 38 | #define IA_STRTOL strtol 39 | #define IA_STRTOD strtod 40 | #else 41 | #ifndef IA_STRTOL 42 | #error "IA_STRTOL not defined" 43 | #endif 44 | #ifndef IA_STRTOD 45 | #error "IA_STRTOD not defined" 46 | #endif 47 | #endif 48 | 49 | #define IA_BEGIN(argc, argv, helplong, helpshort, helpmsg) {\ 50 | char **args_parse_v = (argv);\ 51 | int args_parse_unrecognized = 1;\ 52 | for ( int args_parse_i = 0; args_parse_i < argc; args_parse_i++ ) {\ 53 | if ( argc == 1 || !strcmp( args_parse_v[args_parse_i], helplong ) || !strcmp( args_parse_v[args_parse_i], helpshort )) {\ 54 | printf( helpmsg );\ 55 | return 0;\ 56 | } else if (args_parse_i == 0) continue; 57 | 58 | #define IA_INT(longname, shortname, var) \ 59 | if ( !strcmp( args_parse_v[args_parse_i], longname ) || !strcmp( args_parse_v[args_parse_i], shortname )) {\ 60 | args_parse_unrecognized = 0;\ 61 | var = IA_STRTOL( argv[++args_parse_i], NULL, 10 );\ 62 | if ( IA_ERRNO == IA_ERANGE ) {\ 63 | IA_PRINTF( "Bad value for parameter %s or %s\n", longname, shortname );\ 64 | return 1;\ 65 | }\ 66 | } 67 | 68 | #define IA_FLOAT(longname, shortname, var) \ 69 | if ( !strcmp( args_parse_v[args_parse_i], longname ) || !strcmp( args_parse_v[args_parse_i], shortname )) {\ 70 | args_parse_unrecognized = 0;\ 71 | var = IA_STRTOD( args_parse_v[++args_parse_i], NULL );\ 72 | if ( IA_ERRNO == IA_ERANGE ) {\ 73 | IA_PRINTF( "Bad value for parameter %s or %s\n", longname, shortname );\ 74 | return 1;\ 75 | }\ 76 | } 77 | 78 | #define IA_STR(longname, shortname, var) \ 79 | if ( !strcmp( args_parse_v[args_parse_i], longname ) || !strcmp( args_parse_v[args_parse_i], shortname )) {\ 80 | args_parse_unrecognized = 0;\ 81 | var = args_parse_v[++args_parse_i];\ 82 | } 83 | 84 | #define IA_FLAG(longname, shortname, var) \ 85 | if (( !strcmp( args_parse_v[args_parse_i], longname ) || !strcmp( args_parse_v[args_parse_i], shortname ))) {\ 86 | args_parse_unrecognized = 0;\ 87 | var = 1;\ 88 | }\ 89 | 90 | #define IA_END \ 91 | if ( args_parse_unrecognized ) {\ 92 | IA_PRINTF( "Unrecognized parameter %s\n", args_parse_v[args_parse_i] );\ 93 | return 2;\ 94 | }\ 95 | }} 96 | /* 97 | ------------------------------------------------------------------------------ 98 | This software is available under 2 licenses -- choose whichever you prefer. 99 | ------------------------------------------------------------------------------ 100 | ALTERNATIVE A - MIT License 101 | Copyright (c) 2018 Ilya Kolbin 102 | Permission is hereby granted, free of charge, to any person obtaining a copy of 103 | this software and associated documentation files (the "Software"), to deal in 104 | the Software without restriction, including without limitation the rights to 105 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 106 | of the Software, and to permit persons to whom the Software is furnished to do 107 | so, subject to the following conditions: 108 | The above copyright notice and this permission notice shall be included in all 109 | copies or substantial portions of the Software. 110 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 111 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 112 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 113 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 114 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 115 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 116 | SOFTWARE. 117 | ------------------------------------------------------------------------------ 118 | ALTERNATIVE B - Public Domain (www.unlicense.org) 119 | This is free and unencumbered software released into the public domain. 120 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 121 | software, either in source code form or as a compiled binary, for any purpose, 122 | commercial or non-commercial, and by any means. 123 | In jurisdictions that recognize copyright laws, the author or authors of this 124 | software dedicate any and all copyright interest in the software to the public 125 | domain. We make this dedication for the benefit of the public at large and to 126 | the detriment of our heirs and successors. We intend this dedication to be an 127 | overt act of relinquishment in perpetuity of all present and future rights to 128 | this software under copyright law. 129 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 130 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 131 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 132 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 133 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 134 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 135 | ------------------------------------------------------------------------------ 136 | */ 137 | #endif // ISL_ARGS_H_ 138 | -------------------------------------------------------------------------------- /formatters/RAYLIB.h: -------------------------------------------------------------------------------- 1 | static void imgpack_formatter_RAYLIB__generate_name(const char *image_path, char *out_buffer) { 2 | int j, point_pos, start_pos; 3 | for (point_pos = strlen(image_path)-1; point_pos > 0 && image_path[point_pos] != '.'; point_pos--) {} 4 | for (start_pos = point_pos-1; start_pos > 0 && (isalnum(image_path[start_pos-1]) || image_path[start_pos-1] == '_'); start_pos--) {} 5 | for (j = 0; j < point_pos-start_pos; j++) { 6 | char ch = image_path[start_pos+j]; 7 | if (ch >= 'a' && ch <= 'z') out_buffer[j] = ch - 32; 8 | else out_buffer[j] = ch; 9 | } 10 | out_buffer[j] = '\0'; 11 | } 12 | 13 | static int imgpack_formatter_RAYLIB(struct ImgPackContext *ctx, FILE *f) { 14 | char *name = ctx->name; 15 | fprintf(f, "#ifndef %s_H_\n", name); 16 | fprintf(f, "#define %s_H_\n", name); 17 | fprintf(f, "/* Generated by imgpack %s */\n", ISLIP_VERSION); 18 | fprintf(f, "#ifndef %s_STRCMP\n", name); 19 | fprintf(f, "int strcmp(const char *, const char *);\n"); 20 | fprintf(f, "#define %s_STRCMP strcmp\n", name); 21 | fprintf(f, "#endif\n"); 22 | fprintf(f, "enum %s_Id {\n", name); 23 | fprintf(f, " %s_NONE = 0,\n", name); 24 | for (int i = 0; i < ctx->size; i++) { 25 | char buffer[512]; 26 | imgpack_formatter_RAYLIB__generate_name(ctx->images[i].path, buffer); 27 | fprintf(f, " %s_%s = %d,\n", name, buffer, i+1); 28 | } 29 | fprintf(f, "};\n\n"); 30 | 31 | fprintf(f, "#define %s_PATH \"%s\"\n\n", name, ctx->outputImagePath); 32 | 33 | fprintf(f, "#ifndef %s_DEF\n", name); 34 | fprintf(f, "#define %s_DEF static\n", name); 35 | fprintf(f, "#endif\n\n"); 36 | 37 | fprintf(f, "#ifdef %s_NAMESPACED_ANCHOR\n", name); 38 | fprintf(f, "#define %s_CENTER 0\n", name); 39 | fprintf(f, "#define %s_LEFT 1\n", name); 40 | fprintf(f, "#define %s_RIGHT 2\n", name); 41 | fprintf(f, "#define %s_TOP 4\n", name); 42 | fprintf(f, "#define %s_BOTTOM 8\n", name); 43 | fprintf(f, "#else\n"); 44 | fprintf(f, "#ifndef CENTER\n#define CENTER 0\n#endif\n"); 45 | fprintf(f, "#ifndef LEFT\n#define LEFT 1\n#endif\n"); 46 | fprintf(f, "#ifndef RIGHT\n#define RIGHT 2\n#endif\n"); 47 | fprintf(f, "#ifndef TOP\n#define TOP 4\n#endif\n"); 48 | fprintf(f, "#ifndef BOTTOM\n#define BOTTOM 8\n#endif\n"); 49 | fprintf(f, "#endif\n"); 50 | 51 | fprintf(f, "%s_DEF void %s_Load(void);\n", name, name); 52 | fprintf(f, "%s_DEF void %s_Unload(void);\n", name, name); 53 | fprintf(f, "%s_DEF int %s_Draw(enum %s_Id id, float x, float y, Color color, int anchor, const Vector2 *point);\n", name, name, name); 54 | fprintf(f, "%s_DEF int %s_DrawEx(enum %s_Id id, float x, float y, float rotation, float scale, Color color, int anchor, const Vector2 *point);\n", name, name, name); 55 | fprintf(f, "%s_DEF Texture %s_GetTexture(void);\n", name, name); 56 | fprintf(f, "%s_DEF const Vector2 %s_GetScale(void);\n", name, name); 57 | fprintf(f, "%s_DEF const Rectangle %s_GetFrame(enum %s_Id id);\n", name, name, name); 58 | fprintf(f, "%s_DEF const Vector2 %s_GetOffset(enum %s_Id id);\n", name, name, name); 59 | fprintf(f, "%s_DEF const Vector2 %s_GetSourceSize(enum %s_Id id);\n", name, name, name); 60 | fprintf(f, "%s_DEF const Vector2 %s_GetOrigin(enum %s_Id id);\n", name, name, name); 61 | fprintf(f, "%s_DEF enum %s_Id %s_IdFromPath(const char *path);\n", name, name, name); 62 | fprintf(f, "%s_DEF enum %s_Id %s_IdFromStr(const char* str);\n", name, name, name); 63 | fprintf(f, "%s_DEF const char* %s_StrId(enum %s_Id id);\n", name, name, name); 64 | fprintf(f, "\n"); 65 | fprintf(f, "#endif\n\n"); 66 | 67 | fprintf(f, "#ifdef %s_IMPLEMENTATAION\n", name); 68 | fprintf(f, "#ifndef %s_IMPLEMENTATAION_ONCE\n", name); 69 | fprintf(f, "#define %s_IMPLEMENTATAION_ONCE\n", name); 70 | 71 | fprintf(f, "static const Vector2 %s_Scale = {%d, %d};\n\n", name, ctx->scaleNumerator, ctx->scaleDenominator); 72 | 73 | fprintf(f, "static const Rectangle %s_Frame[%d] = {\n {0, 0, 0, 0},\t /* (NONE) */\n", name, ctx->size+1); 74 | for (int i = 0; i < ctx->size; i++) { 75 | struct stbrp_rect frame = get_frame_rect(ctx, i); 76 | fprintf(f, " {%d, %d, %d, %d},\t/* %d (%s) */\n", frame.x, frame.y, frame.w, frame.h, i + 1, ctx->images[i].path); 77 | } 78 | fprintf(f, "};\n\n"); 79 | 80 | fprintf(f, "static const Vector2 %s_Offset[%d] = {\n {0, 0},\t /* (NONE) */\n", name, ctx->size+1); 81 | for (int i = 0; i < ctx->size; i++) { 82 | fprintf(f, " {%d, %d},\t/* %d (%s) */\n", ctx->images[i].source.x, ctx->images[i].source.y, i + 1, ctx->images[i].path); 83 | } 84 | fprintf(f, "};\n\n"); 85 | 86 | fprintf(f, "static const Vector2 %s_SourceSize[%d] = {\n {0, 0},\t /* (NONE) */\n", name, ctx->size+1); 87 | for (int i = 0; i < ctx->size; i++) { 88 | fprintf(f, " {%d, %d},\t/* %d (%s) */\n", ctx->images[i].source.w, ctx->images[i].source.h, i + 1, ctx->images[i].path); 89 | } 90 | fprintf(f, "};\n\n"); 91 | 92 | fprintf(f, "static const Vector2 %s_Origin[%d] = {\n {0, 0},\t /* (NONE) */\n", name, ctx->size+1); 93 | for (int i = 0; i < ctx->size; i++) { 94 | struct stbrp_rect source = ctx->images[i].source; 95 | fprintf(f, " {%d, %d},\t/* %d (%s) */\n", source.w/2 - source.x, source.h/2 - source.y, i + 1, ctx->images[i].path); 96 | } 97 | fprintf(f, "};\n\n"); 98 | 99 | fprintf(f, "static Texture %s_Texture = {0};\n\n", name); 100 | 101 | fprintf(f, "void %s_Load(void) {\n", name); 102 | fprintf(f, " %s_Texture = LoadTexture(%s_PATH);\n", name, name); 103 | fprintf(f, "}\n\n"); 104 | 105 | fprintf(f, "void %s_Unload(void) {\n", name); 106 | fprintf(f, " UnloadTexture(%s_Texture);\n", name); 107 | fprintf(f, " %s_Texture = (Texture) {0};\n", name); 108 | fprintf(f, "}\n\n"); 109 | 110 | fprintf(f, "enum %s_Id %s_IdFromPath(const char *path) {\n", name, name); 111 | for (int i = 0; i < ctx->size; i++) { 112 | char buffer[512]; 113 | imgpack_formatter_RAYLIB__generate_name(ctx->images[i].path, buffer); 114 | fprintf(f, " if (%s_STRCMP(path, \"%s\") == 0) return %s_%s;\n", name, ctx->images[i].path, name, buffer); 115 | } 116 | fprintf(f, " return %s_NONE;\n", name); 117 | fprintf(f, "}\n\n"); 118 | 119 | fprintf(f, "enum %s_Id %s_IdFromStr(const char *id_str) {\n", name, name); 120 | for (int i = 0; i < ctx->size; i++) { 121 | char buffer[512]; 122 | imgpack_formatter_RAYLIB__generate_name(ctx->images[i].path, buffer); 123 | fprintf(f, " if (%s_STRCMP(id_str, \"%s_%s\") == 0) return %s_%s;\n", name, name, buffer, name, buffer); 124 | } 125 | fprintf(f, " return %s_NONE;\n", name); 126 | fprintf(f, "}\n\n"); 127 | 128 | fprintf(f, "const char* %s_StrId(enum %s_Id id) {\n", name, name); 129 | fprintf(f, " switch(id) {\n"); 130 | fprintf(f, " case %s_NONE: return %s_NONE;\n", name, name); 131 | for (int i = 0; i < ctx->size; i++) { 132 | char buffer[512]; 133 | imgpack_formatter_RAYLIB__generate_name(ctx->images[i].path, buffer); 134 | fprintf(f, " case %s_%s: return \"%s_%s\";\n", name, buffer, name, buffer); 135 | } 136 | fprintf(f, " }\n"); 137 | fprintf(f, " return \"%s_NONE\";\n", name); 138 | fprintf(f, "}\n\n"); 139 | 140 | fprintf(f, "int %s_Draw(enum %s_Id id, float x, float y, Color color, int anchor, const Vector2 *point) {\n", name, name); 141 | fprintf(f, " if (id) {\n"); 142 | fprintf(f, " x += (anchor & 1 ? 0 : anchor & 2 ? -%s_SourceSize[id].x : -%s_Origin[id].x - %s_Offset[id].x);\n", name, name, name); 143 | fprintf(f, " y += (anchor & 4 ? 0 : anchor & 8 ? -%s_SourceSize[id].y : -%s_Origin[id].y - %s_Offset[id].y);\n", name, name, name); 144 | fprintf(f, " Rectangle destRec = {x + %s_Offset[id].x, y + %s_Offset[id].y, %s_Frame[id].width, %s_Frame[id].height};\n", name, name, name, name); 145 | fprintf(f, " DrawTexturePro(%s_Texture, %s_Frame[id], destRec, (Vector2){0,0}, 0, color);\n", name, name); 146 | fprintf(f, " if (point) {\n"); 147 | fprintf(f, " Rectangle collisionRec = {x, y, %s_SourceSize[id].x, %s_SourceSize[id].y};\n", name, name); 148 | fprintf(f, " return CheckCollisionPointRec(*point, collisionRec);\n"); 149 | fprintf(f, " }\n"); 150 | fprintf(f, " }\n"); 151 | fprintf(f, " return 0;\n"); 152 | fprintf(f, "}\n\n"); 153 | 154 | fprintf(f, "int %s_DrawEx(enum %s_Id id, float x, float y, float rotation, float scale, Color color, int anchor, const Vector2 *point) {\n", name, name); 155 | fprintf(f, " if (id) {\n"); 156 | fprintf(f, " Rectangle sourceRec = %s_Frame[id];\n", name); 157 | fprintf(f, " Vector2 origin = %s_Origin[id];\n", name); 158 | fprintf(f, " if (anchor & 1) origin.x = 0; else if (anchor & 2) origin.x = %s_SourceSize[id].x;\n", name); 159 | fprintf(f, " if (anchor & 4) origin.y = 0; else if (anchor & 8) origin.y = %s_SourceSize[id].y;\n", name); 160 | fprintf(f, " origin.x *= scale; origin.y *= scale;\n"); 161 | fprintf(f, " Rectangle destRec = {x, y, sourceRec.width * scale, sourceRec.height * scale};\n"); 162 | fprintf(f, " DrawTexturePro(%s_Texture, %s_Frame[id], destRec, origin, rotation, color);\n", name, name); 163 | fprintf(f, " if (point) {\n"); 164 | fprintf(f, " destRec.x -= origin.x;\n"); 165 | fprintf(f, " destRec.y -= origin.y;\n"); 166 | fprintf(f, " return CheckCollisionPointRec(*point, destRec);\n"); 167 | fprintf(f, " }\n"); 168 | fprintf(f, " }\n"); 169 | fprintf(f, " return 0;\n"); 170 | fprintf(f, "}\n\n"); 171 | 172 | fprintf(f, "Texture %s_GetTexture(void) {\n return %s_Texture;\n}\n\n", name, name); 173 | fprintf(f, "const Vector2 %s_GetScale(void) {\n return %s_Scale;\n}\n\n", name, name); 174 | fprintf(f, "const Rectangle %s_GetFrame(enum %s_Id id) {\n return %s_Frame[id];\n}\n\n", name, name, name); 175 | fprintf(f, "const Vector2 %s_GetOffset(enum %s_Id id) {\n return %s_Offset[id];\n}\n\n", name, name, name); 176 | fprintf(f, "const Vector2 %s_GetSourceSize(enum %s_Id id) {\n return %s_SourceSize[id];\n}\n\n", name, name, name); 177 | fprintf(f, "const Vector2 %s_GetOrigin(enum %s_Id id) {\n return %s_Origin[id];\n}\n\n", name, name, name); 178 | 179 | fprintf(f, "#endif\n"); 180 | fprintf(f, "#endif\n"); 181 | 182 | return 0; 183 | } 184 | -------------------------------------------------------------------------------- /external/cute_files.h: -------------------------------------------------------------------------------- 1 | /* 2 | ------------------------------------------------------------------------------ 3 | Licensing information can be found at the end of the file. 4 | ------------------------------------------------------------------------------ 5 | 6 | tinyfiles.h - v1.0 7 | 8 | To create implementation (the function definitions) 9 | #define CUTE_FILES_IMPLEMENTATION 10 | in *one* C/CPP file (translation unit) that includes this file 11 | 12 | Summary: 13 | Utility header for traversing directories to apply a function on each found file. 14 | Recursively finds sub-directories. Can also be used to iterate over files in a 15 | folder manually. All operations done in a cross-platform manner (thx posix!). 16 | 17 | This header does no dynamic memory allocation, and performs internally safe string 18 | copies as necessary. Strings for paths, file names and file extensions are all 19 | capped, and intended to use primarily the C run-time stack memory. Feel free to 20 | modify the defines in this file to adjust string size limitations. 21 | 22 | Read the header for specifics on each function. 23 | 24 | Here's an example to print all files in a folder: 25 | cf_dir_t dir; 26 | cf_dir_open(&dir, "a"); 27 | 28 | while (dir.has_next) 29 | { 30 | cf_file_t file; 31 | cf_read_file(&dir, &file); 32 | printf("%s\n", file.name); 33 | cf_dir_next(&dir); 34 | } 35 | 36 | cf_dir_close(&dir); 37 | */ 38 | 39 | #if !defined(CUTE_FILES_H) 40 | 41 | #define CUTE_FILES_WINDOWS 1 42 | #define CUTE_FILES_MAC 2 43 | #define CUTE_FILES_UNIX 3 44 | 45 | #if defined(_WIN32) 46 | #define CUTE_FILES_PLATFORM CUTE_FILES_WINDOWS 47 | #if !defined(_CRT_SECURE_NO_WARNINGS) 48 | #define _CRT_SECURE_NO_WARNINGS 49 | #endif 50 | #elif defined(__APPLE__) 51 | #define CUTE_FILES_PLATFORM CUTE_FILES_MAC 52 | #else 53 | #define CUTE_FILES_PLATFORM CUTE_FILES_UNIX 54 | #endif 55 | 56 | #include // strerror, strncpy 57 | 58 | // change to 0 to compile out any debug checks 59 | #define CUTE_FILES_DEBUG_CHECKS 1 60 | 61 | #if CUTE_FILES_DEBUG_CHECKS 62 | 63 | #include // printf 64 | #include // assert 65 | #include 66 | #define CUTE_FILES_ASSERT assert 67 | 68 | #else 69 | 70 | #define CUTE_FILES_ASSERT(...) 71 | 72 | #endif // CUTE_FILES_DEBUG_CHECKS 73 | 74 | #define CUTE_FILES_MAX_PATH 1024 75 | #define CUTE_FILES_MAX_FILENAME 256 76 | #define CUTE_FILES_MAX_EXT 32 77 | 78 | struct cf_file_t; 79 | struct cf_dir_t; 80 | struct cf_time_t; 81 | typedef struct cf_file_t cf_file_t; 82 | typedef struct cf_dir_t cf_dir_t; 83 | typedef struct cf_time_t cf_time_t; 84 | typedef void (cf_callback_t)(cf_file_t* file, void* udata); 85 | 86 | // Stores the file extension in cf_file_t::ext, and returns a pointer to 87 | // cf_file_t::ext 88 | const char* cf_get_ext(cf_file_t* file); 89 | 90 | // Applies a function (cb) to all files in a directory. Will recursively visit 91 | // all subdirectories. Useful for asset management, file searching, indexing, etc. 92 | void cf_traverse(const char* path, cf_callback_t* cb, void* udata); 93 | 94 | // Fills out a cf_file_t struct with file information. Does not actually open the 95 | // file contents, and instead performs more lightweight OS-specific calls. 96 | int cf_read_file(cf_dir_t* dir, cf_file_t* file); 97 | 98 | // Once a cf_dir_t is opened, this function can be used to grab another file 99 | // from the operating system. 100 | void cf_dir_next(cf_dir_t* dir); 101 | 102 | // Performs lightweight OS-specific call to close internal handle. 103 | void cf_dir_close(cf_dir_t* dir); 104 | 105 | // Performs lightweight OS-specific call to open a file handle on a directory. 106 | int cf_dir_open(cf_dir_t* dir, const char* path); 107 | 108 | // Compares file last write times. -1 if file at path_a was modified earlier than path_b. 109 | // 0 if they are equal. 1 if file at path_b was modified earlier than path_a. 110 | int cf_compare_file_times_by_path(const char* path_a, const char* path_b); 111 | 112 | // Retrieves time file was last modified, returns 0 upon failure 113 | int cf_get_file_time(const char* path, cf_time_t* time); 114 | 115 | // Compares file last write times. -1 if time_a was modified earlier than path_b. 116 | // 0 if they are equal. 1 if time_b was modified earlier than path_a. 117 | int cf_compare_file_times(cf_time_t* time_a, cf_time_t* time_b); 118 | 119 | // Returns 1 of file exists, otherwise returns 0. 120 | int cf_file_exists(const char* path); 121 | 122 | // Returns 1 if the file's extension matches the string in ext 123 | // Returns 0 otherwise 124 | int cf_match_ext(cf_file_t* file, const char* ext); 125 | 126 | // Prints detected errors to stdout 127 | void cf_do_unit_tests(); 128 | 129 | #if CUTE_FILES_PLATFORM == CUTE_FILES_WINDOWS 130 | 131 | #if !defined _CRT_SECURE_NO_WARNINGS 132 | #define _CRT_SECURE_NO_WARNINGS 133 | #endif 134 | #include 135 | 136 | struct cf_file_t 137 | { 138 | char path[CUTE_FILES_MAX_PATH]; 139 | char name[CUTE_FILES_MAX_FILENAME]; 140 | char ext[CUTE_FILES_MAX_EXT]; 141 | int is_dir; 142 | int is_reg; 143 | size_t size; 144 | }; 145 | 146 | struct cf_dir_t 147 | { 148 | char path[CUTE_FILES_MAX_PATH]; 149 | int has_next; 150 | HANDLE handle; 151 | WIN32_FIND_DATAA fdata; 152 | }; 153 | 154 | struct cf_time_t 155 | { 156 | FILETIME time; 157 | }; 158 | 159 | #elif CUTE_FILES_PLATFORM == CUTE_FILES_MAC || CUTE_FILES_PLATFORM == CUTE_FILES_UNIX 160 | 161 | #include 162 | #include 163 | #include 164 | #include 165 | 166 | struct cf_file_t 167 | { 168 | char path[CUTE_FILES_MAX_PATH]; 169 | char name[CUTE_FILES_MAX_FILENAME]; 170 | char ext[CUTE_FILES_MAX_EXT]; 171 | int is_dir; 172 | int is_reg; 173 | int size; 174 | struct stat info; 175 | }; 176 | 177 | struct cf_dir_t 178 | { 179 | char path[CUTE_FILES_MAX_PATH]; 180 | int has_next; 181 | DIR* dir; 182 | struct dirent* entry; 183 | }; 184 | 185 | struct cf_time_t 186 | { 187 | time_t time; 188 | }; 189 | 190 | #endif 191 | 192 | #define CUTE_FILES_H 193 | #endif 194 | 195 | #ifdef CUTE_FILES_IMPLEMENTATION 196 | #ifndef CUTE_FILES_IMPLEMENTATION_ONCE 197 | #define CUTE_FILES_IMPLEMENTATION_ONCE 198 | 199 | #define cf_safe_strcpy(dst, src, n, max) cf_safe_strcpy_internal(dst, src, n, max, __FILE__, __LINE__) 200 | static int cf_safe_strcpy_internal(char* dst, const char* src, int n, int max, const char* file, int line) 201 | { 202 | int c; 203 | const char* original = src; 204 | 205 | do 206 | { 207 | if (n >= max) 208 | { 209 | if (!CUTE_FILES_DEBUG_CHECKS) break; 210 | printf("ERROR: String \"%s\" too long to copy on line %d in file %s (max length of %d).\n" 211 | , original 212 | , line 213 | , file 214 | , max); 215 | CUTE_FILES_ASSERT(0); 216 | } 217 | 218 | c = *src++; 219 | dst[n] = c; 220 | ++n; 221 | } while (c); 222 | 223 | return n; 224 | } 225 | 226 | const char* cf_get_ext(cf_file_t* file) 227 | { 228 | char* name = file->name; 229 | char* period = NULL; 230 | while (*name++) if (*name == '.') period = name; 231 | if (period) cf_safe_strcpy(file->ext, period, 0, CUTE_FILES_MAX_EXT); 232 | else file->ext[0] = 0; 233 | return file->ext; 234 | } 235 | 236 | void cf_traverse(const char* path, cf_callback_t* cb, void* udata) 237 | { 238 | cf_dir_t dir; 239 | cf_dir_open(&dir, path); 240 | 241 | while (dir.has_next) 242 | { 243 | cf_file_t file; 244 | cf_read_file(&dir, &file); 245 | 246 | if (file.is_dir && file.name[0] != '.') 247 | { 248 | char path2[CUTE_FILES_MAX_PATH]; 249 | int n = cf_safe_strcpy(path2, path, 0, CUTE_FILES_MAX_PATH); 250 | n = cf_safe_strcpy(path2, "/", n - 1, CUTE_FILES_MAX_PATH); 251 | cf_safe_strcpy(path2, file.name, n -1, CUTE_FILES_MAX_PATH); 252 | cf_traverse(path2, cb, udata); 253 | } 254 | 255 | if (file.is_reg) cb(&file, udata); 256 | cf_dir_next(&dir); 257 | } 258 | 259 | cf_dir_close(&dir); 260 | } 261 | 262 | int cf_match_ext(cf_file_t* file, const char* ext) 263 | { 264 | return !strcmp(file->ext, ext); 265 | } 266 | 267 | #if CUTE_FILES_PLATFORM == CUTE_FILES_WINDOWS 268 | 269 | int cf_read_file(cf_dir_t* dir, cf_file_t* file) 270 | { 271 | CUTE_FILES_ASSERT(dir->handle != INVALID_HANDLE_VALUE); 272 | 273 | int n = 0; 274 | char* fpath = file->path; 275 | char* dpath = dir->path; 276 | 277 | n = cf_safe_strcpy(fpath, dpath, 0, CUTE_FILES_MAX_PATH); 278 | n = cf_safe_strcpy(fpath, "/", n - 1, CUTE_FILES_MAX_PATH); 279 | 280 | char* dname = dir->fdata.cFileName; 281 | char* fname = file->name; 282 | 283 | cf_safe_strcpy(fname, dname, 0, CUTE_FILES_MAX_FILENAME); 284 | cf_safe_strcpy(fpath, fname, n - 1, CUTE_FILES_MAX_PATH); 285 | 286 | size_t max_dword = MAXDWORD; 287 | file->size = ((size_t)dir->fdata.nFileSizeHigh * (max_dword + 1)) + (size_t)dir->fdata.nFileSizeLow; 288 | cf_get_ext(file); 289 | 290 | file->is_dir = !!(dir->fdata.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY); 291 | file->is_reg = !!(dir->fdata.dwFileAttributes & FILE_ATTRIBUTE_NORMAL) || 292 | !(dir->fdata.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY); 293 | 294 | return 1; 295 | } 296 | 297 | void cf_dir_next(cf_dir_t* dir) 298 | { 299 | CUTE_FILES_ASSERT(dir->has_next); 300 | 301 | if (!FindNextFileA(dir->handle, &dir->fdata)) 302 | { 303 | dir->has_next = 0; 304 | DWORD err = GetLastError(); 305 | CUTE_FILES_ASSERT(err == ERROR_SUCCESS || err == ERROR_NO_MORE_FILES); 306 | } 307 | } 308 | 309 | void cf_dir_close(cf_dir_t* dir) 310 | { 311 | dir->path[0] = 0; 312 | dir->has_next = 0; 313 | if (dir->handle != INVALID_HANDLE_VALUE) FindClose(dir->handle); 314 | } 315 | 316 | int cf_dir_open(cf_dir_t* dir, const char* path) 317 | { 318 | int n = cf_safe_strcpy(dir->path, path, 0, CUTE_FILES_MAX_PATH); 319 | n = cf_safe_strcpy(dir->path, "\\*", n - 1, CUTE_FILES_MAX_PATH); 320 | dir->handle = FindFirstFileA(dir->path, &dir->fdata); 321 | dir->path[n - 3] = 0; 322 | 323 | if (dir->handle == INVALID_HANDLE_VALUE) 324 | { 325 | printf("ERROR: Failed to open directory (%s): %s.\n", path, strerror(errno)); 326 | cf_dir_close(dir); 327 | CUTE_FILES_ASSERT(0); 328 | return 0; 329 | } 330 | 331 | dir->has_next = 1; 332 | 333 | return 1; 334 | } 335 | 336 | int cf_compare_file_times_by_path(const char* path_a, const char* path_b) 337 | { 338 | FILETIME time_a = { 0 }; 339 | FILETIME time_b = { 0 }; 340 | WIN32_FILE_ATTRIBUTE_DATA data; 341 | 342 | if (GetFileAttributesExA(path_a, GetFileExInfoStandard, &data)) time_a = data.ftLastWriteTime; 343 | if (GetFileAttributesExA(path_b, GetFileExInfoStandard, &data)) time_b = data.ftLastWriteTime; 344 | return CompareFileTime(&time_a, &time_b); 345 | } 346 | 347 | int cf_get_file_time(const char* path, cf_time_t* time) 348 | { 349 | FILETIME initialized_to_zero = { 0 }; 350 | time->time = initialized_to_zero; 351 | WIN32_FILE_ATTRIBUTE_DATA data; 352 | if (GetFileAttributesExA(path, GetFileExInfoStandard, &data)) 353 | { 354 | time->time = data.ftLastWriteTime; 355 | return 1; 356 | } 357 | return 0; 358 | } 359 | 360 | int cf_compare_file_times(cf_time_t* time_a, cf_time_t* time_b) 361 | { 362 | return CompareFileTime(&time_a->time, &time_b->time); 363 | } 364 | 365 | int cf_file_exists(const char* path) 366 | { 367 | WIN32_FILE_ATTRIBUTE_DATA unused; 368 | return GetFileAttributesExA(path, GetFileExInfoStandard, &unused); 369 | } 370 | 371 | #elif CUTE_FILES_PLATFORM == CUTE_FILES_MAC || CUTE_FILES_PLATFORM == CUTE_FILES_UNIX 372 | 373 | int cf_read_file(cf_dir_t* dir, cf_file_t* file) 374 | { 375 | CUTE_FILES_ASSERT(dir->entry); 376 | 377 | int n = 0; 378 | char* fpath = file->path; 379 | char* dpath = dir->path; 380 | 381 | n = cf_safe_strcpy(fpath, dpath, 0, CUTE_FILES_MAX_PATH); 382 | n = cf_safe_strcpy(fpath, "/", n - 1, CUTE_FILES_MAX_PATH); 383 | 384 | char* dname = dir->entry->d_name; 385 | char* fname = file->name; 386 | 387 | cf_safe_strcpy(fname, dname, 0, CUTE_FILES_MAX_FILENAME); 388 | cf_safe_strcpy(fpath, fname, n - 1, CUTE_FILES_MAX_PATH); 389 | 390 | if (stat(file->path, &file->info)) 391 | return 0; 392 | 393 | file->size = file->info.st_size; 394 | cf_get_ext(file); 395 | 396 | file->is_dir = S_ISDIR(file->info.st_mode); 397 | file->is_reg = S_ISREG(file->info.st_mode); 398 | 399 | return 1; 400 | } 401 | 402 | void cf_dir_next(cf_dir_t* dir) 403 | { 404 | CUTE_FILES_ASSERT(dir->has_next); 405 | dir->entry = readdir(dir->dir); 406 | dir->has_next = dir->entry ? 1 : 0; 407 | } 408 | 409 | void cf_dir_close(cf_dir_t* dir) 410 | { 411 | dir->path[0] = 0; 412 | if (dir->dir) closedir(dir->dir); 413 | dir->dir = 0; 414 | dir->has_next = 0; 415 | dir->entry = 0; 416 | } 417 | 418 | int cf_dir_open(cf_dir_t* dir, const char* path) 419 | { 420 | cf_safe_strcpy(dir->path, path, 0, CUTE_FILES_MAX_PATH); 421 | dir->dir = opendir(path); 422 | 423 | if (!dir->dir) 424 | { 425 | printf("ERROR: Failed to open directory (%s): %s.\n", path, strerror(errno)); 426 | cf_dir_close(dir); 427 | CUTE_FILES_ASSERT(0); 428 | return 0; 429 | } 430 | 431 | dir->has_next = 1; 432 | dir->entry = readdir(dir->dir); 433 | if (!dir->dir) dir->has_next = 0; 434 | 435 | return 1; 436 | } 437 | 438 | // Warning : untested code! (let me know if it breaks) 439 | int cf_compare_file_times_by_path(const char* path_a, const char* path_b) 440 | { 441 | time_t time_a; 442 | time_t time_b; 443 | struct stat info; 444 | if (stat(path_a, &info)) return 0; 445 | time_a = info.st_mtime; 446 | if (stat(path_b, &info)) return 0; 447 | time_b = info.st_mtime; 448 | return (int)difftime(time_a, time_b); 449 | } 450 | 451 | // Warning : untested code! (let me know if it breaks) 452 | int cf_get_file_time(const char* path, cf_time_t* time) 453 | { 454 | struct stat info; 455 | if (stat(path, &info)) return 0; 456 | time->time = info.st_mtime; 457 | return 1; 458 | } 459 | 460 | // Warning : untested code! (let me know if it breaks) 461 | int cf_compare_file_times(cf_time_t* time_a, cf_time_t* time_b) 462 | { 463 | return (int)difftime(time_a->time, time_b->time); 464 | } 465 | 466 | // Warning : untested code! (let me know if it breaks) 467 | int cf_file_exists(const char* path) 468 | { 469 | return access(path, F_OK) != -1; 470 | } 471 | 472 | #endif // CUTE_FILES_PLATFORM 473 | 474 | #endif // CUTE_FILES_IMPLEMENTATION_ONCE 475 | #endif // CUTE_FILES_IMPLEMENTATION 476 | 477 | /* 478 | ------------------------------------------------------------------------------ 479 | This software is available under 2 licenses - you may choose the one you like. 480 | ------------------------------------------------------------------------------ 481 | ALTERNATIVE A - zlib license 482 | Copyright (c) 2017 Randy Gaul http://www.randygaul.net 483 | This software is provided 'as-is', without any express or implied warranty. 484 | In no event will the authors be held liable for any damages arising from 485 | the use of this software. 486 | Permission is granted to anyone to use this software for any purpose, 487 | including commercial applications, and to alter it and redistribute it 488 | freely, subject to the following restrictions: 489 | 1. The origin of this software must not be misrepresented; you must not 490 | claim that you wrote the original software. If you use this software 491 | in a product, an acknowledgment in the product documentation would be 492 | appreciated but is not required. 493 | 2. Altered source versions must be plainly marked as such, and must not 494 | be misrepresented as being the original software. 495 | 3. This notice may not be removed or altered from any source distribution. 496 | ------------------------------------------------------------------------------ 497 | ALTERNATIVE B - Public Domain (www.unlicense.org) 498 | This is free and unencumbered software released into the public domain. 499 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 500 | software, either in source code form or as a compiled binary, for any purpose, 501 | commercial or non-commercial, and by any means. 502 | In jurisdictions that recognize copyright laws, the author or authors of this 503 | software dedicate any and all copyright interest in the software to the public 504 | domain. We make this dedication for the benefit of the public at large and to 505 | the detriment of our heirs and successors. We intend this dedication to be an 506 | overt act of relinquishment in perpetuity of all present and future rights to 507 | this software under copyright law. 508 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 509 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 510 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 511 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 512 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 513 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 514 | ------------------------------------------------------------------------------ 515 | */ 516 | -------------------------------------------------------------------------------- /external/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 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | #define ISLIP_VERSION "0.10.1" 2 | 3 | /* 4 | * ImgPack -- simple texture packer 5 | * 6 | * Author: Ilya Kolbin 7 | * Source: github.com:iskolbin/imgpack 8 | * License: MIT, see bottom of this file 9 | * 10 | */ 11 | 12 | #include 13 | #include 14 | 15 | #ifndef ISLIP_NOSTDLIB 16 | #include 17 | #endif 18 | 19 | #ifndef NULL 20 | #define NULL 0 21 | #endif 22 | 23 | #ifndef ISLIP_MALLOC 24 | #define ISLIP_MALLOC malloc 25 | #endif 26 | 27 | #ifndef ISLIP_REALLOC 28 | #define ISLIP_REALLOC realloc 29 | #endif 30 | 31 | #ifndef ISLIP_FREE 32 | #define ISLIP_FREE free 33 | #endif 34 | 35 | #include "external/isl_args.h" 36 | 37 | #define STB_IMAGE_IMPLEMENTATION 38 | #include "external/stb_image.h" 39 | 40 | #define STB_IMAGE_WRITE_IMPLEMENTATION 41 | #include "external/stb_image_write.h" 42 | 43 | #define STB_IMAGE_RESIZE_IMPLEMENTATION 44 | #include "external/stb_image_resize.h" 45 | 46 | #define STB_RECT_PACK_IMPLEMENTATION 47 | #include "external/stb_rect_pack.h" 48 | 49 | #define CUTE_FILES_IMPLEMENTATION 50 | #include "external/cute_files.h" 51 | 52 | enum ImgPackColorFormat { 53 | IMGPACK_RGBA8888, 54 | }; 55 | 56 | enum ImgPackNaming { 57 | IMGPACK_NAME_WITH_EXT, 58 | IMGPACK_NAME_NO_EXT, 59 | IMGPACK_FULL_PATH, 60 | }; 61 | 62 | struct ImgPackImage { 63 | int id; 64 | char *name; 65 | char *path; 66 | char *ext; 67 | uint64_t hash; 68 | stbrp_rect source; 69 | stbi_uc *data; 70 | int copyOf; 71 | }; 72 | 73 | struct ImgPackContext { 74 | enum ImgPackColorFormat colorFormat; 75 | enum ImgPackNaming naming; 76 | int (*formatter)(struct ImgPackContext *ctx, FILE *output_file); 77 | int forcePOT; 78 | int forceSquared; 79 | int allowMultipack; 80 | int trimThreshold; 81 | double sideGrowCoefficient; 82 | int maxWidth; 83 | int maxHeight; 84 | int padding; 85 | int extrude; 86 | int unique; 87 | int verbose; 88 | 89 | struct ImgPackImage *images; 90 | struct stbrp_rect *packingRects; 91 | int size; 92 | int allocated; 93 | 94 | int width; 95 | int height; 96 | int scaleNumerator; 97 | int scaleDenominator; 98 | 99 | char *outputImagePath; 100 | char *outputDataPath; 101 | char *name; 102 | 103 | int argc; 104 | char **argv; 105 | char *colorFormatString; 106 | }; 107 | 108 | static int is_image_rotated(struct ImgPackContext *ctx, int id) { 109 | if (id >= 0 && id < ctx->size) { 110 | return 0; 111 | } else { 112 | return -1; 113 | } 114 | } 115 | 116 | static int is_image_trimmed(struct ImgPackContext *ctx, int id) { 117 | if (id >= 0 && id < ctx->size) { 118 | int d = ctx->padding + ctx->extrude; 119 | int rid = ctx->images[id].id; 120 | return ctx->images[id].source.x != 0 || 121 | ctx->images[id].source.y != 0 || 122 | ctx->images[id].source.w != ctx->packingRects[rid].w-2*d || 123 | ctx->images[id].source.h != ctx->packingRects[rid].h-2*d; 124 | } else { 125 | return -1; 126 | } 127 | } 128 | 129 | static const char *get_output_image_format(struct ImgPackContext *ctx) { 130 | return ctx->colorFormatString; 131 | } 132 | 133 | static struct stbrp_rect get_frame_rect(struct ImgPackContext *ctx, int id) { 134 | struct stbrp_rect frame = {0}; 135 | if (id >= 0 && id < ctx->size) { 136 | int d = ctx->padding + ctx->extrude; 137 | int rid = ctx->images[id].id; 138 | if (ctx->images[id].copyOf >= 0) { 139 | rid = ctx->images[id].copyOf; 140 | } 141 | frame.x = ctx->packingRects[rid].x + d; 142 | frame.y = ctx->packingRects[rid].y + d; 143 | frame.w = ctx->packingRects[rid].w - 2*d; 144 | frame.h = ctx->packingRects[rid].h - 2*d; 145 | } 146 | return frame; 147 | } 148 | 149 | #include "formatters/CSV.h" 150 | #include "formatters/JSON_ARRAY.h" 151 | #include "formatters/JSON_HASH.h" 152 | #include "formatters/RAYLIB.h" 153 | 154 | static int parse_data_format(struct ImgPackContext *ctx, const char *s) { 155 | if (!strcmp(s, "CSV")) ctx->formatter = imgpack_formatter_CSV; 156 | else if (!strcmp(s, "JSON_ARRAY")) ctx->formatter = imgpack_formatter_JSON_ARRAY; 157 | else if (!strcmp(s, "JSON_HASH")) ctx->formatter = imgpack_formatter_JSON_HASH; 158 | else if (!strcmp(s, "RAYLIB")) ctx->formatter = imgpack_formatter_RAYLIB; 159 | else return 1; 160 | return 0; 161 | } 162 | 163 | static int parse_naming(struct ImgPackContext *ctx, const char *s) { 164 | if (!strcmp(s, "FULL_PATH")) ctx->naming = IMGPACK_FULL_PATH; 165 | else if (!strcmp(s, "NAME_NO_EXT")) ctx->naming = IMGPACK_NAME_NO_EXT; 166 | else if (!strcmp(s, "NAME_WITH_EXT")) ctx->naming = IMGPACK_NAME_WITH_EXT; 167 | else return 1; 168 | return 0; 169 | } 170 | 171 | static int parse_data_color(struct ImgPackContext *ctx, const char *s) { 172 | if (!strcmp(s, "RGBA8888")) ctx->colorFormat = IMGPACK_RGBA8888; 173 | else return 1; 174 | ctx->colorFormatString = (char *)s; 175 | return 0; 176 | } 177 | 178 | static void allocate_images_data(struct ImgPackContext *ctx) { 179 | int next_size = ctx->allocated * 2; 180 | if (next_size == 0) next_size = 16; 181 | ctx->packingRects = ISLIP_REALLOC(ctx->packingRects, next_size * sizeof(*ctx->packingRects)); 182 | ctx->images = ISLIP_REALLOC(ctx->images, next_size * sizeof(*ctx->images)); 183 | ctx->allocated = next_size; 184 | } 185 | 186 | static void add_image_data(struct ImgPackContext *ctx, stbi_uc *data, const char *img_path, 187 | const char *img_name, const char *img_ext, int width, int height) { 188 | int id = ctx->size; 189 | while (id >= ctx->allocated) { 190 | allocate_images_data(ctx); 191 | } 192 | ctx->size++; 193 | 194 | if (ctx->scaleNumerator != 1 || ctx->scaleDenominator != 1) { 195 | int resized_width = ctx->scaleNumerator * width / ctx->scaleDenominator; 196 | int resized_height = ctx->scaleNumerator * height / ctx->scaleDenominator; 197 | stbi_uc *resized_data = ISLIP_MALLOC(sizeof(*resized_data) * resized_width * resized_height * 4); 198 | stbir_resize_uint8(data, width, height, 0, resized_data, resized_width, resized_height, 0, 4); 199 | if (ctx->verbose) printf("// Resize \"%s\" (%d, %d) => (%d, %d)\n", img_path, width, height, resized_width, resized_height); 200 | stbi_image_free(data); 201 | data = resized_data; 202 | width = resized_width; 203 | height = resized_height; 204 | } 205 | 206 | int minY = 0, minX = 0, maxY = height-1, maxX = width-1; 207 | if (ctx->trimThreshold >= 0) { 208 | for (int y = 0; y < height; y++) for (int x = 0; x < width; x++) if (data[4*(y*width+x)+3] > ctx->trimThreshold) { 209 | minY = y; 210 | y = height; 211 | break; 212 | } 213 | for (int y = height-1; y >= 0; y--) for (int x = 0; x < width; x++) if (data[4*(y*width+x)+3] > ctx->trimThreshold) { 214 | maxY = y; 215 | y = -1; 216 | break; 217 | } 218 | for (int x = 0; x < width; x++) for (int y = 0; y < height; y++) if (data[4*(y*width+x)+3] > ctx->trimThreshold) { 219 | minX = x; 220 | x = width; 221 | break; 222 | } 223 | for (int x = width-1; x >= 0; x--) for (int y = 0; y < height; y++) if (data[4*(y*width+x)+3] > ctx->trimThreshold) { 224 | maxX = x; 225 | x = -1; 226 | break; 227 | } 228 | } 229 | 230 | // FNV hash function C99 adapation 231 | // for more info visit http://www.isthe.com/chongo/tech/comp/fnv/ 232 | uint64_t hash = 0xcbf29ce484222325ULL; 233 | for (int y = minY; y < maxY; y++) { 234 | for (int x = minX; x < maxX; x++) { 235 | hash = (hash ^ data[4*(y*width+x)]) * 0x100000001b3ULL; 236 | hash = (hash ^ data[4*(y*width+x)+1]) * 0x100000001b3ULL; 237 | hash = (hash ^ data[4*(y*width+x)+2]) * 0x100000001b3ULL; 238 | hash = (hash ^ data[4*(y*width+x)+3]) * 0x100000001b3ULL; 239 | } 240 | } 241 | if (ctx->verbose) printf("// Hash of \"%s\" is %" PRIx64 "\n", img_path, hash); 242 | 243 | char *path = ISLIP_MALLOC(strlen(img_path)+1); 244 | strcpy(path, img_path); 245 | int name_len = strlen(img_name) - strlen(img_ext); 246 | char *name = ISLIP_MALLOC(name_len + 1); 247 | name[name_len] = '\0'; 248 | for (int i = 0; i < name_len; i++) { 249 | name[i] = img_name[i]; 250 | } 251 | char *ext = ISLIP_MALLOC(strlen(img_ext)+1); 252 | strcpy(ext, img_ext); 253 | ctx->images[id] = (struct ImgPackImage) { 254 | .id = id, 255 | .path = path, 256 | .hash = hash, 257 | .name = name, 258 | .ext = ext, 259 | .source = (stbrp_rect) {.x = minX, .y = minY, .w = width, .h = height}, 260 | .data = data, 261 | .copyOf = -1, 262 | }; 263 | 264 | ctx->packingRects[id] = (stbrp_rect) { 265 | .id = id, 266 | .w = maxX - minX + 1 + 2*(ctx->padding + ctx->extrude), 267 | .h = maxY - minY + 1 + 2*(ctx->padding + ctx->extrude), 268 | }; 269 | 270 | if (ctx->unique) { 271 | // TODO probably should use hashtable (stb_ds?) to avoid O(n^2) 272 | for (int i = id-1; i >= 0; i--) { 273 | if (ctx->images[i].copyOf < 0) { 274 | if (ctx->images[i].hash == hash) { 275 | // Is this enough? Well in most cases yes 276 | if (ctx->images[i].source.x == ctx->images[id].source.x && 277 | ctx->images[i].source.y == ctx->images[id].source.y && 278 | ctx->images[i].source.w == ctx->images[id].source.w && 279 | ctx->images[i].source.h == ctx->images[id].source.h && 280 | ctx->packingRects[i].w == ctx->packingRects[id].w && 281 | ctx->packingRects[i].h == ctx->packingRects[id].h) { 282 | ctx->images[id].copyOf = i; 283 | ctx->packingRects[id].w = 0; 284 | ctx->packingRects[id].h = 0; 285 | break; 286 | } 287 | } 288 | } 289 | } 290 | } 291 | if (ctx->verbose) printf("// Added \"%s\" %dx%d(trimmed to %dx%d)\n", path, width, height, maxX - minX + 1, maxY - minY + 1); 292 | } 293 | 294 | static int get_images_data(struct ImgPackContext *ctx, const char *path) { 295 | int count = 0; 296 | cf_dir_t dir; 297 | if (cf_dir_open(&dir, path)) { 298 | if (ctx->verbose) printf("// Reading images data from \"%s\" directory\n", path); 299 | while(dir.has_next) { 300 | cf_file_t file; 301 | cf_read_file(&dir, &file); 302 | if (file.is_dir && file.name[0] != '.') { 303 | if (ctx->verbose) printf("// Traverse %s\n", file.name); 304 | count += get_images_data(ctx, file.path); 305 | } else if (file.is_reg) { 306 | if (ctx->verbose) printf("// Reading %s\n", file.name); 307 | int width, height, channels; 308 | stbi_uc *data = stbi_load(file.path, &width, &height, &channels, 4); 309 | if (data) { 310 | add_image_data(ctx, data, file.path, file.name, file.ext, width, height); 311 | count++; 312 | } 313 | } 314 | cf_dir_next(&dir); 315 | } 316 | cf_dir_close(&dir); 317 | if (ctx->verbose) printf("// From %s added %d images\n", path, count); 318 | } 319 | return count; 320 | } 321 | 322 | static unsigned long upper_power_of_two(unsigned long v) { 323 | v--; 324 | v |= v >> 1; 325 | v |= v >> 2; 326 | v |= v >> 4; 327 | v |= v >> 8; 328 | v |= v >> 16; 329 | v++; 330 | return v; 331 | } 332 | 333 | static int pack_images(struct ImgPackContext *ctx) { 334 | int occupied_area = 0; 335 | int side_add = ctx->padding + ctx->extrude; 336 | for (int i = 0; i < ctx->size; i++) { 337 | occupied_area += ((side_add+ctx->packingRects[i].w)*(side_add+ctx->packingRects[i].h)); 338 | } 339 | if (ctx->verbose) printf("// Occupied area is %d\n", occupied_area); 340 | if (occupied_area <= 0) return 1; 341 | int assumed_side_size = (int)sqrt((double)occupied_area); 342 | ctx->width = assumed_side_size; 343 | ctx->height = assumed_side_size; 344 | stbrp_node *nodes = ISLIP_MALLOC(sizeof(*nodes) * ctx->size); 345 | if (!nodes) return 1; 346 | stbrp_context rp_ctx = {0}; 347 | do { 348 | if (ctx->forcePOT) { 349 | int pot_side_size = upper_power_of_two(assumed_side_size); 350 | if (pot_side_size >= (ctx->sideGrowCoefficient*assumed_side_size)) { 351 | assumed_side_size = pot_side_size; 352 | } else { 353 | assumed_side_size = upper_power_of_two(pot_side_size+1); 354 | } 355 | } else { 356 | assumed_side_size = ctx->sideGrowCoefficient*assumed_side_size; 357 | } 358 | 359 | // TODO Wrong logic, we need non-square textures implementation 360 | if ((ctx->maxWidth > 0 && assumed_side_size >= ctx->maxWidth) || 361 | (ctx->maxHeight > 0 && assumed_side_size >= ctx->maxHeight)) { 362 | printf("Exceeded max size constraints %d x %d\n", ctx->maxWidth, ctx->maxHeight); 363 | return 1; 364 | } 365 | 366 | if (ctx->maxWidth > 0) { 367 | if (ctx->width < ctx->maxWidth) { 368 | ctx->width = ctx->maxWidth > assumed_side_size ? assumed_side_size : ctx->maxWidth; 369 | } 370 | } else { 371 | ctx->width = assumed_side_size; 372 | } 373 | if (ctx->maxHeight > 0) { 374 | if (ctx->height < ctx->maxHeight) { 375 | ctx->height = ctx->maxHeight > assumed_side_size ? assumed_side_size : ctx->maxHeight; 376 | } 377 | } else { 378 | ctx->height = assumed_side_size; 379 | } 380 | 381 | if (ctx->verbose) printf("// Trying to pack %d images into %dx%d\n", ctx->size, assumed_side_size, assumed_side_size); 382 | stbrp_init_target(&rp_ctx, assumed_side_size, assumed_side_size, nodes, ctx->size); 383 | } while (!stbrp_pack_rects(&rp_ctx, ctx->packingRects, ctx->size)); 384 | ISLIP_FREE(nodes); 385 | return 0; 386 | } 387 | 388 | static int write_atlas_data(struct ImgPackContext *ctx) { 389 | FILE *output_file = stdout; 390 | if (ctx->outputDataPath) { 391 | output_file = fopen(ctx->outputDataPath, "w+"); 392 | } 393 | int status = 1; 394 | if (output_file) { 395 | if (ctx->verbose) printf("// Writing description data to \"%s\"\n", ctx->outputDataPath ? ctx->outputDataPath : "stdout"); 396 | status = ctx->formatter(ctx, output_file); 397 | if (ctx->verbose) printf("// Written\n"); 398 | if (output_file != stdout) fclose(output_file); 399 | } else { 400 | printf("// Cannot open for writing \"%s\"", ctx->outputDataPath); 401 | } 402 | return status; 403 | } 404 | 405 | static int write_atlas_image(struct ImgPackContext *ctx) { 406 | unsigned char *output_data = ISLIP_MALLOC(4 * ctx->width * ctx->height); 407 | if (ctx->verbose) printf("// Drawing atlas image to \"%s\"\n", ctx->outputImagePath); 408 | for (int i = 0; i < ctx->size; i++) { 409 | int rid = ctx->images[i].id; 410 | struct stbrp_rect rect = ctx->packingRects[rid]; 411 | if (rect.w == 0 || rect.h == 0) continue; 412 | int x0 = ctx->images[i].source.x, y0 = ctx->images[i].source.y; 413 | int d = ctx->padding + ctx->extrude; 414 | int w = ctx->images[i].source.w, h = ctx->images[i].source.h; 415 | stbi_uc *image_data = ctx->images[i].data; 416 | if (ctx->verbose) printf("// Drawing %s\n", ctx->images[i].path); 417 | for (int y = 0; y < rect.h-2*d; y++) { 418 | for (int x = 0; x < rect.w-2*d; x++) { 419 | int output_offset = 4*(x+rect.x+d + (y+rect.y+d)*ctx->width); 420 | for (int j = 0; j < 4; j++) { 421 | output_data[output_offset+j] = image_data[4*(x+x0+(y+y0)*w)+j]; 422 | } 423 | } 424 | } 425 | 426 | if (ctx->extrude > 0) { 427 | if (y0 == 0) { 428 | for (int y = ctx->padding; y < d; y++) { 429 | for (int x = 0; x < rect.w-2*d; x++) { 430 | int output_offset = 4*(x+rect.x+d + (y+rect.y)*ctx->width); 431 | for (int j = 0; j < 4; j++) { 432 | output_data[output_offset+j] = image_data[4*(x+x0 + (y0)*w) + j]; 433 | } 434 | } 435 | } 436 | } 437 | if (x0 == 0) { 438 | for (int y = 0; y < rect.h-2*d; y++) { 439 | for (int x = ctx->padding; x < d; x++) { 440 | int output_offset = 4*(x+rect.x + (y+rect.y+d)*ctx->width); 441 | for (int j = 0; j < 4; j++) { 442 | output_data[output_offset+j] = image_data[4*(x0 + (y0+y)*w) + j]; 443 | } 444 | } 445 | } 446 | } 447 | if (y0 + rect.h - 2*d == h) { 448 | for (int y = d+h; y < d+h+ctx->extrude; y++) { 449 | for (int x = 0; x < rect.w-2*d; x++) { 450 | int output_offset = 4*(x+rect.x+d + (y+rect.y-y0)*ctx->width); 451 | for (int j = 0; j < 4; j++) { 452 | output_data[output_offset+j] = image_data[4*(x0+x + (y0+rect.h-2*d-1)*w) + j]; 453 | } 454 | } 455 | } 456 | } 457 | if (x0 + rect.w - 2*d == w) { 458 | for (int y = 0; y < rect.h-2*d; y++) { 459 | for (int x = d+w; x < d+w+ctx->extrude; x++) { 460 | int output_offset = 4*(x+rect.x-x0 + (y+rect.y+d)*ctx->width); 461 | for (int j = 0; j < 4; j++) { 462 | output_data[output_offset+j] = image_data[4*(x0+rect.w-2*d-1 + (y0+y)*w) + j]; 463 | } 464 | } 465 | } 466 | } 467 | if (y0 == 0 && x0 == 0) { 468 | for (int y = ctx->padding; y < d; y++) { 469 | for (int x = ctx->padding; x < d; x++) { 470 | int output_offset = 4*(x+rect.x + (y+rect.y)*ctx->width); 471 | for (int j = 0; j < 4; j++) { 472 | output_data[output_offset+j] = image_data[4*(x0 + (y0)*w) + j]; 473 | } 474 | } 475 | } 476 | } 477 | if (y0 == 0 && x0 + rect.w - 2*d == w) { 478 | for (int y = ctx->padding; y < d; y++) { 479 | for (int x = d+w; x < d+w+ctx->extrude; x++) { 480 | int output_offset = 4*(x+rect.x-x0 + (y+rect.y)*ctx->width); 481 | for (int j = 0; j < 4; j++) { 482 | output_data[output_offset+j] = image_data[4*(x0+rect.w-2*d-1 + (y0)*w) + j]; 483 | } 484 | } 485 | } 486 | } 487 | if (y0 + rect.h - 2*d == h && x0 == 0) { 488 | for (int y = d+h; y < d+h+ctx->extrude; y++) { 489 | for (int x = ctx->padding; x < d; x++) { 490 | int output_offset = 4*(x+rect.x + (y+rect.y-y0)*ctx->width); 491 | for (int j = 0; j < 4; j++) { 492 | output_data[output_offset+j] = image_data[4*(x0 + (y0+rect.h-2*d-1)*w) + j]; 493 | } 494 | } 495 | } 496 | } 497 | if (y0 + rect.h - 2*d == h && x0 + rect.w - 2*d == w) { 498 | for (int y = d+h; y < d+h+ctx->extrude; y++) { 499 | for (int x = d+w; x < d+w+ctx->extrude; x++) { 500 | int output_offset = 4*(x+rect.x + (y+rect.y-y0)*ctx->width); 501 | for (int j = 0; j < 4; j++) { 502 | output_data[output_offset+j] = image_data[4*(x0+rect.w-2*d-1 + (y0+rect.h-2*d-1)*w) + j]; 503 | } 504 | } 505 | } 506 | } 507 | } 508 | } 509 | stbi_write_png(ctx->outputImagePath, ctx->width, ctx->height, 4, output_data, ctx->width*4); 510 | ISLIP_FREE(output_data); 511 | return 0; 512 | } 513 | 514 | static void clear_context(struct ImgPackContext *ctx) { 515 | for (int i = 0; i < ctx->size; i++) { 516 | ISLIP_FREE(ctx->images[i].path); 517 | stbi_image_free(ctx->images[i].data); 518 | } 519 | ISLIP_FREE(ctx->packingRects); 520 | ISLIP_FREE(ctx->images); 521 | ctx->packingRects = NULL; 522 | ctx->images = NULL; 523 | ctx->size = 0; 524 | ctx->allocated = 0; 525 | } 526 | 527 | static int parse_scale(struct ImgPackContext *ctx, const char *scale) { 528 | char numerator[128]; 529 | char denominator[128] = "1"; 530 | int i = 0, j = 0; 531 | int num = 1, den = 1; 532 | for (j = 0; j < 127 && scale[i] != '/' && scale[i] != '\0'; i++, j++) { 533 | numerator[j] = scale[i]; 534 | } 535 | numerator[j+1] = '\0'; 536 | if (scale[i] == '\0') { 537 | num = strtol(numerator, NULL, 10); 538 | } else if (scale[i] == '/') { 539 | i++; 540 | for (j = 0; j < 127 && scale[i] != '\0'; i++, j++) { 541 | denominator[j] = scale[i]; 542 | } 543 | denominator[j] = '\0'; 544 | } 545 | num = strtol(numerator, NULL, 10); 546 | den = strtol(denominator, NULL, 10); 547 | if (num > 0 && den > 0) { 548 | int gcd = 1; 549 | for(int k = 1; k <= num && k <= den; k++) { 550 | if (num % k == 0 && den % k == 0) { 551 | gcd = k; 552 | } 553 | } 554 | ctx->scaleNumerator = num / gcd; 555 | ctx->scaleDenominator = den / gcd; 556 | return 0; 557 | } else { 558 | return 1; 559 | } 560 | } 561 | 562 | static int compare_images(const void *a, const void *b) { 563 | return strcmp(((struct ImgPackImage *)a)->path, ((struct ImgPackImage *)b)->path); 564 | } 565 | 566 | static void sort_images(struct ImgPackContext *ctx) { 567 | qsort(ctx->images, ctx->size, sizeof(struct ImgPackImage), compare_images); 568 | } 569 | 570 | int main(int argc, char *argv[]) { 571 | struct ImgPackContext ctx = { 572 | .scaleNumerator = 1, 573 | .scaleDenominator = 1, 574 | .sideGrowCoefficient = 1.2, 575 | .trimThreshold = -1, 576 | .argc = argc, 577 | .argv = argv, 578 | }; 579 | char *imagesPath = argv[argc-1]; 580 | char *format_data = "C"; 581 | char *format_color = "RGBA8888"; 582 | char *scale = "1"; 583 | char *naming = "NAME_WITH_EXT"; 584 | int sorting = 0; 585 | IA_BEGIN(argc, argv, "--help", "-?", "ImgPack texture packer v0.8\n" 586 | "Copyright 2019 Ilya Kolbin \n\n" 587 | "Usage : imgpack \n\n" 588 | "| Key | | Value | Description\n" 589 | "|--------------|----|---------|----------------------------------------------\n" 590 | "| --data | -d | string | output file path, if ommited `stdout` is used\n" 591 | "| --image | -i | string | output image path (NEEDED)\n" 592 | "| --name | -n | string | name\n" 593 | "| --format | -f | string | output atlas data format (CSV, JSON_HASH, JSON_ARRAY, RAYLIB)\n" 594 | "| --naming | -N | string | frames naming for JSON_HASH/ARRAY: FULL_PATH, NAME_NO_EXT, NAME_WITH_EXT(default)\n" 595 | "| --trim | -t | int | alpha threshold for trimming image with transparent border, should be 0-255\n" 596 | "| --padding | -p | int | adds transparent padding\n" 597 | "| --exturde | -e | int | adds copied pixels on image borders, which helps with texture bleeding\n" 598 | "| --max-width | -w | int | maximum atlas width\n" 599 | "| --max-height | -h | int | maximum atlas height\n" 600 | "| --scale | -x | int/int | scaling ratio int form \"A/B\" or just \"K\"\n" 601 | "| --color | -c | string | format (only RGBA8888 currently supported)\n" 602 | "| --unique | -u | | remove identical images (after trimming)\n" 603 | "| --force-pot | -2 | | force power of two texture output\n" 604 | "| --sort | -s | | sorting by path name (ascending)\n" 605 | //"| --multipack | -m | | allow multipacking\n" 606 | "| --verbose | -v | | print debug messages during the packing process\n" 607 | "| --help | -? | | prints this memo\n\n") 608 | IA_STR("--data", "-d", ctx.outputDataPath) 609 | IA_STR("--image", "-i", ctx.outputImagePath) 610 | IA_STR("--name", "-n", ctx.name) 611 | IA_STR("--format", "-f", format_data) 612 | IA_STR("--naming", "-N", naming) 613 | IA_INT("--trim", "-t", ctx.trimThreshold) 614 | IA_INT("--padding", "-p", ctx.padding) 615 | IA_INT("--extrude", "-e", ctx.extrude) 616 | IA_INT("--max-width", "-w", ctx.maxWidth) 617 | IA_INT("--max-height", "-h", ctx.maxHeight) 618 | IA_STR("--scale", "-x", scale) 619 | IA_STR("--color", "-c", format_data) 620 | IA_FLAG("--unique", "-u", ctx.unique) 621 | IA_FLAG("--force-pot", "-2", ctx.forcePOT) 622 | IA_FLAG("--sort", "-s", sorting) 623 | //IA_FLAG("--multipack", "-m", ctx.allowMultipack) 624 | IA_FLAG("--verbose", "-v", ctx.verbose) 625 | IA_FLAG("--force-squared", "-sq", ctx.forceSquared) 626 | IA_END 627 | 628 | if (!ctx.outputImagePath) { 629 | printf("Specify output image path using --image/-i "); 630 | return 1; 631 | } 632 | 633 | if (!parse_data_format(&ctx, format_data)) { 634 | if (ctx.verbose) printf("// Using data format %s\n", format_data); 635 | } else { 636 | printf("Bad data format \"%s\"\n", format_data); 637 | return 1; 638 | } 639 | 640 | if (!parse_data_color(&ctx, format_color)) { 641 | if (ctx.verbose) printf("// Using color format %s\n", format_color); 642 | } else { 643 | printf("Bad color format \"%s\"\n", format_color); 644 | return 1; 645 | } 646 | 647 | if (!parse_naming(&ctx, naming)) { 648 | if (ctx.verbose) printf("// Using naming %s\n", naming); 649 | } else { 650 | printf("Bad naming \"%s\"\n", naming); 651 | return 1; 652 | } 653 | 654 | if (!parse_scale(&ctx, scale)) { 655 | if (ctx.verbose) printf("// Set scaling to %d/%d\n", ctx.scaleNumerator, ctx.scaleDenominator); 656 | } else { 657 | printf("Bad scale \"%s\"\n", scale); 658 | return 1; 659 | } 660 | 661 | if (ctx.maxWidth > 0 || ctx.maxHeight > 0) { 662 | if (ctx.verbose) printf("// Size constraints: %d x %d\n", ctx.maxWidth, ctx.maxHeight); 663 | } 664 | 665 | get_images_data(&ctx, imagesPath); 666 | 667 | if (!pack_images(&ctx)) { 668 | if (ctx.verbose) printf("// Images have been packed\n"); 669 | } else { 670 | printf("Cannot pack images\n"); 671 | return 1; 672 | } 673 | 674 | if (sorting) { 675 | if (ctx.verbose) printf("// Sorting images\n"); 676 | sort_images(&ctx); 677 | } 678 | 679 | if (write_atlas_data(&ctx)) return 1; 680 | if (write_atlas_image(&ctx)) return 1; 681 | clear_context(&ctx); 682 | return 0; 683 | } 684 | 685 | /* 686 | Copyright (c) 2019 Ilya Kolbin (iskolbin@gmail.com) 687 | 688 | Permission is hereby granted, free of charge, to any person obtaining a copy 689 | of this software and associated documentation files (the "Software"), to deal 690 | in the Software without restriction, including without limitation the rights 691 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 692 | copies of the Software, and to permit persons to whom the Software is 693 | furnished to do so, subject to the following conditions: 694 | 695 | The above copyright notice and this permission notice shall be included in all 696 | copies or substantial portions of the Software. 697 | 698 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 699 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 700 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 701 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 702 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 703 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 704 | SOFTWARE. 705 | */ 706 | -------------------------------------------------------------------------------- /external/stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.13 - 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 or a callback. 16 | 17 | The PNG output is not optimal; it is 20-50% larger than the file 18 | written by a decent optimizing implementation; though providing a custom 19 | zlib compress function (see STBIW_ZLIB_COMPRESS) can mitigate that. 20 | This library is designed for source code compactness and simplicity, 21 | not optimal image file size 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 | You can #define STBIW_ZLIB_COMPRESS to use a custom zlib-style compress function 30 | for PNG compression (instead of the builtin one), it must have the following signature: 31 | unsigned char * my_compress(unsigned char *data, int data_len, int *out_len, int quality); 32 | The returned data will be freed with STBIW_FREE() (free() by default), 33 | so it must be heap allocated with STBIW_MALLOC() (malloc() by default), 34 | 35 | UNICODE: 36 | 37 | If compiling for Windows and you wish to use Unicode filenames, compile 38 | with 39 | #define STBIW_WINDOWS_UTF8 40 | and pass utf8-encoded filenames. Call stbiw_convert_wchar_to_utf8 to convert 41 | Windows wchar_t filenames to utf8. 42 | 43 | USAGE: 44 | 45 | There are five functions, one for each image file format: 46 | 47 | int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 48 | int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 49 | int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 50 | int stbi_write_jpg(char const *filename, int w, int h, int comp, const void *data, int quality); 51 | int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 52 | 53 | void stbi_flip_vertically_on_write(int flag); // flag is non-zero to flip data vertically 54 | 55 | There are also five equivalent functions that use an arbitrary write function. You are 56 | expected to open/close your file-equivalent before and after calling these: 57 | 58 | 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); 59 | int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 60 | int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 61 | int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 62 | int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 63 | 64 | where the callback is: 65 | void stbi_write_func(void *context, void *data, int size); 66 | 67 | You can configure it with these global variables: 68 | int stbi_write_tga_with_rle; // defaults to true; set to 0 to disable RLE 69 | int stbi_write_png_compression_level; // defaults to 8; set to higher for more compression 70 | int stbi_write_force_png_filter; // defaults to -1; set to 0..5 to force a filter mode 71 | 72 | 73 | You can define STBI_WRITE_NO_STDIO to disable the file variant of these 74 | functions, so the library will not use stdio.h at all. However, this will 75 | also disable HDR writing, because it requires stdio for formatted output. 76 | 77 | Each function returns 0 on failure and non-0 on success. 78 | 79 | The functions create an image file defined by the parameters. The image 80 | is a rectangle of pixels stored from left-to-right, top-to-bottom. 81 | Each pixel contains 'comp' channels of data stored interleaved with 8-bits 82 | per channel, in the following order: 1=Y, 2=YA, 3=RGB, 4=RGBA. (Y is 83 | monochrome color.) The rectangle is 'w' pixels wide and 'h' pixels tall. 84 | The *data pointer points to the first byte of the top-left-most pixel. 85 | For PNG, "stride_in_bytes" is the distance in bytes from the first byte of 86 | a row of pixels to the first byte of the next row of pixels. 87 | 88 | PNG creates output files with the same number of components as the input. 89 | The BMP format expands Y to RGB in the file format and does not 90 | output alpha. 91 | 92 | PNG supports writing rectangles of data even when the bytes storing rows of 93 | data are not consecutive in memory (e.g. sub-rectangles of a larger image), 94 | by supplying the stride between the beginning of adjacent rows. The other 95 | formats do not. (Thus you cannot write a native-format BMP through the BMP 96 | writer, both because it is in BGR order and because it may have padding 97 | at the end of the line.) 98 | 99 | PNG allows you to set the deflate compression level by setting the global 100 | variable 'stbi_write_png_compression_level' (it defaults to 8). 101 | 102 | HDR expects linear float data. Since the format is always 32-bit rgb(e) 103 | data, alpha (if provided) is discarded, and for monochrome data it is 104 | replicated across all three channels. 105 | 106 | TGA supports RLE or non-RLE compressed data. To use non-RLE-compressed 107 | data, set the global variable 'stbi_write_tga_with_rle' to 0. 108 | 109 | JPEG does ignore alpha channels in input data; quality is between 1 and 100. 110 | Higher quality looks better but results in a bigger image. 111 | JPEG baseline (no JPEG progressive). 112 | 113 | CREDITS: 114 | 115 | 116 | Sean Barrett - PNG/BMP/TGA 117 | Baldur Karlsson - HDR 118 | Jean-Sebastien Guay - TGA monochrome 119 | Tim Kelsey - misc enhancements 120 | Alan Hickman - TGA RLE 121 | Emmanuel Julien - initial file IO callback implementation 122 | Jon Olick - original jo_jpeg.cpp code 123 | Daniel Gibson - integrate JPEG, allow external zlib 124 | Aarni Koskela - allow choosing PNG filter 125 | 126 | bugfixes: 127 | github:Chribba 128 | Guillaume Chereau 129 | github:jry2 130 | github:romigrou 131 | Sergio Gonzalez 132 | Jonas Karlsson 133 | Filip Wasil 134 | Thatcher Ulrich 135 | github:poppolopoppo 136 | Patrick Boettcher 137 | github:xeekworx 138 | Cap Petschulat 139 | Simon Rodriguez 140 | Ivan Tikhonov 141 | github:ignotion 142 | Adam Schackart 143 | 144 | LICENSE 145 | 146 | See end of file for license information. 147 | 148 | */ 149 | 150 | #ifndef INCLUDE_STB_IMAGE_WRITE_H 151 | #define INCLUDE_STB_IMAGE_WRITE_H 152 | 153 | #include 154 | 155 | // if STB_IMAGE_WRITE_STATIC causes problems, try defining STBIWDEF to 'inline' or 'static inline' 156 | #ifndef STBIWDEF 157 | #ifdef STB_IMAGE_WRITE_STATIC 158 | #define STBIWDEF static 159 | #else 160 | #ifdef __cplusplus 161 | #define STBIWDEF extern "C" 162 | #else 163 | #define STBIWDEF extern 164 | #endif 165 | #endif 166 | #endif 167 | 168 | #ifndef STB_IMAGE_WRITE_STATIC // C++ forbids static forward declarations 169 | extern int stbi_write_tga_with_rle; 170 | extern int stbi_write_png_compression_level; 171 | extern int stbi_write_force_png_filter; 172 | #endif 173 | 174 | #ifndef STBI_WRITE_NO_STDIO 175 | STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 176 | STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 177 | STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 178 | STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 179 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); 180 | 181 | #ifdef STBI_WINDOWS_UTF8 182 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input); 183 | #endif 184 | #endif 185 | 186 | typedef void stbi_write_func(void *context, void *data, int size); 187 | 188 | 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); 189 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 190 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 191 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 192 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 193 | 194 | STBIWDEF void stbi_flip_vertically_on_write(int flip_boolean); 195 | 196 | #endif//INCLUDE_STB_IMAGE_WRITE_H 197 | 198 | #ifdef STB_IMAGE_WRITE_IMPLEMENTATION 199 | 200 | #ifdef _WIN32 201 | #ifndef _CRT_SECURE_NO_WARNINGS 202 | #define _CRT_SECURE_NO_WARNINGS 203 | #endif 204 | #ifndef _CRT_NONSTDC_NO_DEPRECATE 205 | #define _CRT_NONSTDC_NO_DEPRECATE 206 | #endif 207 | #endif 208 | 209 | #ifndef STBI_WRITE_NO_STDIO 210 | #include 211 | #endif // STBI_WRITE_NO_STDIO 212 | 213 | #include 214 | #include 215 | #include 216 | #include 217 | 218 | #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) 219 | // ok 220 | #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) 221 | // ok 222 | #else 223 | #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." 224 | #endif 225 | 226 | #ifndef STBIW_MALLOC 227 | #define STBIW_MALLOC(sz) malloc(sz) 228 | #define STBIW_REALLOC(p,newsz) realloc(p,newsz) 229 | #define STBIW_FREE(p) free(p) 230 | #endif 231 | 232 | #ifndef STBIW_REALLOC_SIZED 233 | #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) 234 | #endif 235 | 236 | 237 | #ifndef STBIW_MEMMOVE 238 | #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) 239 | #endif 240 | 241 | 242 | #ifndef STBIW_ASSERT 243 | #include 244 | #define STBIW_ASSERT(x) assert(x) 245 | #endif 246 | 247 | #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) 248 | 249 | #ifdef STB_IMAGE_WRITE_STATIC 250 | static int stbi__flip_vertically_on_write=0; 251 | static int stbi_write_png_compression_level = 8; 252 | static int stbi_write_tga_with_rle = 1; 253 | static int stbi_write_force_png_filter = -1; 254 | #else 255 | int stbi_write_png_compression_level = 8; 256 | int stbi__flip_vertically_on_write=0; 257 | int stbi_write_tga_with_rle = 1; 258 | int stbi_write_force_png_filter = -1; 259 | #endif 260 | 261 | STBIWDEF void stbi_flip_vertically_on_write(int flag) 262 | { 263 | stbi__flip_vertically_on_write = flag; 264 | } 265 | 266 | typedef struct 267 | { 268 | stbi_write_func *func; 269 | void *context; 270 | } stbi__write_context; 271 | 272 | // initialize a callback-based context 273 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 274 | { 275 | s->func = c; 276 | s->context = context; 277 | } 278 | 279 | #ifndef STBI_WRITE_NO_STDIO 280 | 281 | static void stbi__stdio_write(void *context, void *data, int size) 282 | { 283 | fwrite(data,1,size,(FILE*) context); 284 | } 285 | 286 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 287 | #ifdef __cplusplus 288 | #define STBIW_EXTERN extern "C" 289 | #else 290 | #define STBIW_EXTERN extern 291 | #endif 292 | STBIW_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide); 293 | STBIW_EXTERN __declspec(dllimport) int __stdcall WideCharToMultiByte(unsigned int cp, unsigned long flags, const wchar_t *widestr, int cchwide, char *str, int cbmb, const char *defchar, int *used_default); 294 | 295 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input) 296 | { 297 | return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int) bufferlen, NULL, NULL); 298 | } 299 | #endif 300 | 301 | static FILE *stbiw__fopen(char const *filename, char const *mode) 302 | { 303 | FILE *f; 304 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 305 | wchar_t wMode[64]; 306 | wchar_t wFilename[1024]; 307 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename))) 308 | return 0; 309 | 310 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode))) 311 | return 0; 312 | 313 | #if _MSC_VER >= 1400 314 | if (0 != _wfopen_s(&f, wFilename, wMode)) 315 | f = 0; 316 | #else 317 | f = _wfopen(wFilename, wMode); 318 | #endif 319 | 320 | #elif defined(_MSC_VER) && _MSC_VER >= 1400 321 | if (0 != fopen_s(&f, filename, mode)) 322 | f=0; 323 | #else 324 | f = fopen(filename, mode); 325 | #endif 326 | return f; 327 | } 328 | 329 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 330 | { 331 | FILE *f = stbiw__fopen(filename, "wb"); 332 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 333 | return f != NULL; 334 | } 335 | 336 | static void stbi__end_write_file(stbi__write_context *s) 337 | { 338 | fclose((FILE *)s->context); 339 | } 340 | 341 | #endif // !STBI_WRITE_NO_STDIO 342 | 343 | typedef unsigned int stbiw_uint32; 344 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 345 | 346 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 347 | { 348 | while (*fmt) { 349 | switch (*fmt++) { 350 | case ' ': break; 351 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 352 | s->func(s->context,&x,1); 353 | break; } 354 | case '2': { int x = va_arg(v,int); 355 | unsigned char b[2]; 356 | b[0] = STBIW_UCHAR(x); 357 | b[1] = STBIW_UCHAR(x>>8); 358 | s->func(s->context,b,2); 359 | break; } 360 | case '4': { stbiw_uint32 x = va_arg(v,int); 361 | unsigned char b[4]; 362 | b[0]=STBIW_UCHAR(x); 363 | b[1]=STBIW_UCHAR(x>>8); 364 | b[2]=STBIW_UCHAR(x>>16); 365 | b[3]=STBIW_UCHAR(x>>24); 366 | s->func(s->context,b,4); 367 | break; } 368 | default: 369 | STBIW_ASSERT(0); 370 | return; 371 | } 372 | } 373 | } 374 | 375 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 376 | { 377 | va_list v; 378 | va_start(v, fmt); 379 | stbiw__writefv(s, fmt, v); 380 | va_end(v); 381 | } 382 | 383 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 384 | { 385 | s->func(s->context, &c, 1); 386 | } 387 | 388 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 389 | { 390 | unsigned char arr[3]; 391 | arr[0] = a; arr[1] = b; arr[2] = c; 392 | s->func(s->context, arr, 3); 393 | } 394 | 395 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 396 | { 397 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 398 | int k; 399 | 400 | if (write_alpha < 0) 401 | s->func(s->context, &d[comp - 1], 1); 402 | 403 | switch (comp) { 404 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 405 | case 1: 406 | if (expand_mono) 407 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 408 | else 409 | s->func(s->context, d, 1); // monochrome TGA 410 | break; 411 | case 4: 412 | if (!write_alpha) { 413 | // composite against pink background 414 | for (k = 0; k < 3; ++k) 415 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 416 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 417 | break; 418 | } 419 | /* FALLTHROUGH */ 420 | case 3: 421 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 422 | break; 423 | } 424 | if (write_alpha > 0) 425 | s->func(s->context, &d[comp - 1], 1); 426 | } 427 | 428 | 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) 429 | { 430 | stbiw_uint32 zero = 0; 431 | int i,j, j_end; 432 | 433 | if (y <= 0) 434 | return; 435 | 436 | if (stbi__flip_vertically_on_write) 437 | vdir *= -1; 438 | 439 | if (vdir < 0) { 440 | j_end = -1; j = y-1; 441 | } else { 442 | j_end = y; j = 0; 443 | } 444 | 445 | for (; j != j_end; j += vdir) { 446 | for (i=0; i < x; ++i) { 447 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 448 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 449 | } 450 | s->func(s->context, &zero, scanline_pad); 451 | } 452 | } 453 | 454 | 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, ...) 455 | { 456 | if (y < 0 || x < 0) { 457 | return 0; 458 | } else { 459 | va_list v; 460 | va_start(v, fmt); 461 | stbiw__writefv(s, fmt, v); 462 | va_end(v); 463 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 464 | return 1; 465 | } 466 | } 467 | 468 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 469 | { 470 | int pad = (-x*3) & 3; 471 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 472 | "11 4 22 4" "4 44 22 444444", 473 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 474 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 475 | } 476 | 477 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 478 | { 479 | stbi__write_context s; 480 | stbi__start_write_callbacks(&s, func, context); 481 | return stbi_write_bmp_core(&s, x, y, comp, data); 482 | } 483 | 484 | #ifndef STBI_WRITE_NO_STDIO 485 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 486 | { 487 | stbi__write_context s; 488 | if (stbi__start_write_file(&s,filename)) { 489 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 490 | stbi__end_write_file(&s); 491 | return r; 492 | } else 493 | return 0; 494 | } 495 | #endif //!STBI_WRITE_NO_STDIO 496 | 497 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 498 | { 499 | int has_alpha = (comp == 2 || comp == 4); 500 | int colorbytes = has_alpha ? comp-1 : comp; 501 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 502 | 503 | if (y < 0 || x < 0) 504 | return 0; 505 | 506 | if (!stbi_write_tga_with_rle) { 507 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 508 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 509 | } else { 510 | int i,j,k; 511 | int jend, jdir; 512 | 513 | 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); 514 | 515 | if (stbi__flip_vertically_on_write) { 516 | j = 0; 517 | jend = y; 518 | jdir = 1; 519 | } else { 520 | j = y-1; 521 | jend = -1; 522 | jdir = -1; 523 | } 524 | for (; j != jend; j += jdir) { 525 | unsigned char *row = (unsigned char *) data + j * x * comp; 526 | int len; 527 | 528 | for (i = 0; i < x; i += len) { 529 | unsigned char *begin = row + i * comp; 530 | int diff = 1; 531 | len = 1; 532 | 533 | if (i < x - 1) { 534 | ++len; 535 | diff = memcmp(begin, row + (i + 1) * comp, comp); 536 | if (diff) { 537 | const unsigned char *prev = begin; 538 | for (k = i + 2; k < x && len < 128; ++k) { 539 | if (memcmp(prev, row + k * comp, comp)) { 540 | prev += comp; 541 | ++len; 542 | } else { 543 | --len; 544 | break; 545 | } 546 | } 547 | } else { 548 | for (k = i + 2; k < x && len < 128; ++k) { 549 | if (!memcmp(begin, row + k * comp, comp)) { 550 | ++len; 551 | } else { 552 | break; 553 | } 554 | } 555 | } 556 | } 557 | 558 | if (diff) { 559 | unsigned char header = STBIW_UCHAR(len - 1); 560 | s->func(s->context, &header, 1); 561 | for (k = 0; k < len; ++k) { 562 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 563 | } 564 | } else { 565 | unsigned char header = STBIW_UCHAR(len - 129); 566 | s->func(s->context, &header, 1); 567 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 568 | } 569 | } 570 | } 571 | } 572 | return 1; 573 | } 574 | 575 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 576 | { 577 | stbi__write_context s; 578 | stbi__start_write_callbacks(&s, func, context); 579 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 580 | } 581 | 582 | #ifndef STBI_WRITE_NO_STDIO 583 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 584 | { 585 | stbi__write_context s; 586 | if (stbi__start_write_file(&s,filename)) { 587 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 588 | stbi__end_write_file(&s); 589 | return r; 590 | } else 591 | return 0; 592 | } 593 | #endif 594 | 595 | // ************************************************************************************************* 596 | // Radiance RGBE HDR writer 597 | // by Baldur Karlsson 598 | 599 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 600 | 601 | static void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 602 | { 603 | int exponent; 604 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 605 | 606 | if (maxcomp < 1e-32f) { 607 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 608 | } else { 609 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 610 | 611 | rgbe[0] = (unsigned char)(linear[0] * normalize); 612 | rgbe[1] = (unsigned char)(linear[1] * normalize); 613 | rgbe[2] = (unsigned char)(linear[2] * normalize); 614 | rgbe[3] = (unsigned char)(exponent + 128); 615 | } 616 | } 617 | 618 | static void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 619 | { 620 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 621 | STBIW_ASSERT(length+128 <= 255); 622 | s->func(s->context, &lengthbyte, 1); 623 | s->func(s->context, &databyte, 1); 624 | } 625 | 626 | static void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 627 | { 628 | unsigned char lengthbyte = STBIW_UCHAR(length); 629 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 630 | s->func(s->context, &lengthbyte, 1); 631 | s->func(s->context, data, length); 632 | } 633 | 634 | static void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 635 | { 636 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 637 | unsigned char rgbe[4]; 638 | float linear[3]; 639 | int x; 640 | 641 | scanlineheader[2] = (width&0xff00)>>8; 642 | scanlineheader[3] = (width&0x00ff); 643 | 644 | /* skip RLE for images too small or large */ 645 | if (width < 8 || width >= 32768) { 646 | for (x=0; x < width; x++) { 647 | switch (ncomp) { 648 | case 4: /* fallthrough */ 649 | case 3: linear[2] = scanline[x*ncomp + 2]; 650 | linear[1] = scanline[x*ncomp + 1]; 651 | linear[0] = scanline[x*ncomp + 0]; 652 | break; 653 | default: 654 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 655 | break; 656 | } 657 | stbiw__linear_to_rgbe(rgbe, linear); 658 | s->func(s->context, rgbe, 4); 659 | } 660 | } else { 661 | int c,r; 662 | /* encode into scratch buffer */ 663 | for (x=0; x < width; x++) { 664 | switch(ncomp) { 665 | case 4: /* fallthrough */ 666 | case 3: linear[2] = scanline[x*ncomp + 2]; 667 | linear[1] = scanline[x*ncomp + 1]; 668 | linear[0] = scanline[x*ncomp + 0]; 669 | break; 670 | default: 671 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 672 | break; 673 | } 674 | stbiw__linear_to_rgbe(rgbe, linear); 675 | scratch[x + width*0] = rgbe[0]; 676 | scratch[x + width*1] = rgbe[1]; 677 | scratch[x + width*2] = rgbe[2]; 678 | scratch[x + width*3] = rgbe[3]; 679 | } 680 | 681 | s->func(s->context, scanlineheader, 4); 682 | 683 | /* RLE each component separately */ 684 | for (c=0; c < 4; c++) { 685 | unsigned char *comp = &scratch[width*c]; 686 | 687 | x = 0; 688 | while (x < width) { 689 | // find first run 690 | r = x; 691 | while (r+2 < width) { 692 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 693 | break; 694 | ++r; 695 | } 696 | if (r+2 >= width) 697 | r = width; 698 | // dump up to first run 699 | while (x < r) { 700 | int len = r-x; 701 | if (len > 128) len = 128; 702 | stbiw__write_dump_data(s, len, &comp[x]); 703 | x += len; 704 | } 705 | // if there's a run, output it 706 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 707 | // find next byte after run 708 | while (r < width && comp[r] == comp[x]) 709 | ++r; 710 | // output run up to r 711 | while (x < r) { 712 | int len = r-x; 713 | if (len > 127) len = 127; 714 | stbiw__write_run_data(s, len, comp[x]); 715 | x += len; 716 | } 717 | } 718 | } 719 | } 720 | } 721 | } 722 | 723 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 724 | { 725 | if (y <= 0 || x <= 0 || data == NULL) 726 | return 0; 727 | else { 728 | // Each component is stored separately. Allocate scratch space for full output scanline. 729 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 730 | int i, len; 731 | char buffer[128]; 732 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 733 | s->func(s->context, header, sizeof(header)-1); 734 | 735 | #ifdef __STDC_WANT_SECURE_LIB__ 736 | len = sprintf_s(buffer, sizeof(buffer), "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 737 | #else 738 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 739 | #endif 740 | s->func(s->context, buffer, len); 741 | 742 | for(i=0; i < y; i++) 743 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*x*(stbi__flip_vertically_on_write ? y-1-i : i)); 744 | STBIW_FREE(scratch); 745 | return 1; 746 | } 747 | } 748 | 749 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 750 | { 751 | stbi__write_context s; 752 | stbi__start_write_callbacks(&s, func, context); 753 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 754 | } 755 | 756 | #ifndef STBI_WRITE_NO_STDIO 757 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 758 | { 759 | stbi__write_context s; 760 | if (stbi__start_write_file(&s,filename)) { 761 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 762 | stbi__end_write_file(&s); 763 | return r; 764 | } else 765 | return 0; 766 | } 767 | #endif // STBI_WRITE_NO_STDIO 768 | 769 | 770 | ////////////////////////////////////////////////////////////////////////////// 771 | // 772 | // PNG writer 773 | // 774 | 775 | #ifndef STBIW_ZLIB_COMPRESS 776 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 777 | #define stbiw__sbraw(a) ((int *) (a) - 2) 778 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 779 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 780 | 781 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 782 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 783 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 784 | 785 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 786 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 787 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 788 | 789 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 790 | { 791 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 792 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 793 | STBIW_ASSERT(p); 794 | if (p) { 795 | if (!*arr) ((int *) p)[1] = 0; 796 | *arr = (void *) ((int *) p + 2); 797 | stbiw__sbm(*arr) = m; 798 | } 799 | return *arr; 800 | } 801 | 802 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 803 | { 804 | while (*bitcount >= 8) { 805 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 806 | *bitbuffer >>= 8; 807 | *bitcount -= 8; 808 | } 809 | return data; 810 | } 811 | 812 | static int stbiw__zlib_bitrev(int code, int codebits) 813 | { 814 | int res=0; 815 | while (codebits--) { 816 | res = (res << 1) | (code & 1); 817 | code >>= 1; 818 | } 819 | return res; 820 | } 821 | 822 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 823 | { 824 | int i; 825 | for (i=0; i < limit && i < 258; ++i) 826 | if (a[i] != b[i]) break; 827 | return i; 828 | } 829 | 830 | static unsigned int stbiw__zhash(unsigned char *data) 831 | { 832 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 833 | hash ^= hash << 3; 834 | hash += hash >> 5; 835 | hash ^= hash << 4; 836 | hash += hash >> 17; 837 | hash ^= hash << 25; 838 | hash += hash >> 6; 839 | return hash; 840 | } 841 | 842 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 843 | #define stbiw__zlib_add(code,codebits) \ 844 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 845 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 846 | // default huffman tables 847 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 848 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 849 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 850 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 851 | #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)) 852 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 853 | 854 | #define stbiw__ZHASH 16384 855 | 856 | #endif // STBIW_ZLIB_COMPRESS 857 | 858 | STBIWDEF unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 859 | { 860 | #ifdef STBIW_ZLIB_COMPRESS 861 | // user provided a zlib compress implementation, use that 862 | return STBIW_ZLIB_COMPRESS(data, data_len, out_len, quality); 863 | #else // use builtin 864 | 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 }; 865 | 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 }; 866 | 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 }; 867 | 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 }; 868 | unsigned int bitbuf=0; 869 | int i,j, bitcount=0; 870 | unsigned char *out = NULL; 871 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(char**)); 872 | if (hash_table == NULL) 873 | return NULL; 874 | if (quality < 5) quality = 5; 875 | 876 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 877 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 878 | stbiw__zlib_add(1,1); // BFINAL = 1 879 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 880 | 881 | for (i=0; i < stbiw__ZHASH; ++i) 882 | hash_table[i] = NULL; 883 | 884 | i=0; 885 | while (i < data_len-3) { 886 | // hash next 3 bytes of data to be compressed 887 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 888 | unsigned char *bestloc = 0; 889 | unsigned char **hlist = hash_table[h]; 890 | int n = stbiw__sbcount(hlist); 891 | for (j=0; j < n; ++j) { 892 | if (hlist[j]-data > i-32768) { // if entry lies within window 893 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 894 | if (d >= best) { best=d; bestloc=hlist[j]; } 895 | } 896 | } 897 | // when hash table entry is too long, delete half the entries 898 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 899 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 900 | stbiw__sbn(hash_table[h]) = quality; 901 | } 902 | stbiw__sbpush(hash_table[h],data+i); 903 | 904 | if (bestloc) { 905 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 906 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 907 | hlist = hash_table[h]; 908 | n = stbiw__sbcount(hlist); 909 | for (j=0; j < n; ++j) { 910 | if (hlist[j]-data > i-32767) { 911 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 912 | if (e > best) { // if next match is better, bail on current match 913 | bestloc = NULL; 914 | break; 915 | } 916 | } 917 | } 918 | } 919 | 920 | if (bestloc) { 921 | int d = (int) (data+i - bestloc); // distance back 922 | STBIW_ASSERT(d <= 32767 && best <= 258); 923 | for (j=0; best > lengthc[j+1]-1; ++j); 924 | stbiw__zlib_huff(j+257); 925 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 926 | for (j=0; d > distc[j+1]-1; ++j); 927 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 928 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 929 | i += best; 930 | } else { 931 | stbiw__zlib_huffb(data[i]); 932 | ++i; 933 | } 934 | } 935 | // write out final bytes 936 | for (;i < data_len; ++i) 937 | stbiw__zlib_huffb(data[i]); 938 | stbiw__zlib_huff(256); // end of block 939 | // pad with 0 bits to byte boundary 940 | while (bitcount) 941 | stbiw__zlib_add(0,1); 942 | 943 | for (i=0; i < stbiw__ZHASH; ++i) 944 | (void) stbiw__sbfree(hash_table[i]); 945 | STBIW_FREE(hash_table); 946 | 947 | { 948 | // compute adler32 on input 949 | unsigned int s1=1, s2=0; 950 | int blocklen = (int) (data_len % 5552); 951 | j=0; 952 | while (j < data_len) { 953 | for (i=0; i < blocklen; ++i) { s1 += data[j+i]; s2 += s1; } 954 | s1 %= 65521; s2 %= 65521; 955 | j += blocklen; 956 | blocklen = 5552; 957 | } 958 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 959 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 960 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 961 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 962 | } 963 | *out_len = stbiw__sbn(out); 964 | // make returned pointer freeable 965 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 966 | return (unsigned char *) stbiw__sbraw(out); 967 | #endif // STBIW_ZLIB_COMPRESS 968 | } 969 | 970 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 971 | { 972 | #ifdef STBIW_CRC32 973 | return STBIW_CRC32(buffer, len); 974 | #else 975 | static unsigned int crc_table[256] = 976 | { 977 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 978 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 979 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 980 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 981 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 982 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 983 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 984 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 985 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 986 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 987 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 988 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 989 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 990 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 991 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 992 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 993 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 994 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 995 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 996 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 997 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 998 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 999 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 1000 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 1001 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 1002 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 1003 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 1004 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 1005 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 1006 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 1007 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 1008 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 1009 | }; 1010 | 1011 | unsigned int crc = ~0u; 1012 | int i; 1013 | for (i=0; i < len; ++i) 1014 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 1015 | return ~crc; 1016 | #endif 1017 | } 1018 | 1019 | #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) 1020 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 1021 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 1022 | 1023 | static void stbiw__wpcrc(unsigned char **data, int len) 1024 | { 1025 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 1026 | stbiw__wp32(*data, crc); 1027 | } 1028 | 1029 | static unsigned char stbiw__paeth(int a, int b, int c) 1030 | { 1031 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 1032 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 1033 | if (pb <= pc) return STBIW_UCHAR(b); 1034 | return STBIW_UCHAR(c); 1035 | } 1036 | 1037 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 1038 | static void stbiw__encode_png_line(unsigned char *pixels, int stride_bytes, int width, int height, int y, int n, int filter_type, signed char *line_buffer) 1039 | { 1040 | static int mapping[] = { 0,1,2,3,4 }; 1041 | static int firstmap[] = { 0,1,0,5,6 }; 1042 | int *mymap = (y != 0) ? mapping : firstmap; 1043 | int i; 1044 | int type = mymap[filter_type]; 1045 | unsigned char *z = pixels + stride_bytes * (stbi__flip_vertically_on_write ? height-1-y : y); 1046 | int signed_stride = stbi__flip_vertically_on_write ? -stride_bytes : stride_bytes; 1047 | 1048 | if (type==0) { 1049 | memcpy(line_buffer, z, width*n); 1050 | return; 1051 | } 1052 | 1053 | // first loop isn't optimized since it's just one pixel 1054 | for (i = 0; i < n; ++i) { 1055 | switch (type) { 1056 | case 1: line_buffer[i] = z[i]; break; 1057 | case 2: line_buffer[i] = z[i] - z[i-signed_stride]; break; 1058 | case 3: line_buffer[i] = z[i] - (z[i-signed_stride]>>1); break; 1059 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-signed_stride],0)); break; 1060 | case 5: line_buffer[i] = z[i]; break; 1061 | case 6: line_buffer[i] = z[i]; break; 1062 | } 1063 | } 1064 | switch (type) { 1065 | case 1: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-n]; break; 1066 | case 2: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-signed_stride]; break; 1067 | case 3: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - ((z[i-n] + z[i-signed_stride])>>1); break; 1068 | case 4: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], z[i-signed_stride], z[i-signed_stride-n]); break; 1069 | case 5: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - (z[i-n]>>1); break; 1070 | case 6: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 1071 | } 1072 | } 1073 | 1074 | STBIWDEF unsigned char *stbi_write_png_to_mem(const unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 1075 | { 1076 | int force_filter = stbi_write_force_png_filter; 1077 | int ctype[5] = { -1, 0, 4, 2, 6 }; 1078 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 1079 | unsigned char *out,*o, *filt, *zlib; 1080 | signed char *line_buffer; 1081 | int j,zlen; 1082 | 1083 | if (stride_bytes == 0) 1084 | stride_bytes = x * n; 1085 | 1086 | if (force_filter >= 5) { 1087 | force_filter = -1; 1088 | } 1089 | 1090 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 1091 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 1092 | for (j=0; j < y; ++j) { 1093 | int filter_type; 1094 | if (force_filter > -1) { 1095 | filter_type = force_filter; 1096 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, force_filter, line_buffer); 1097 | } else { // Estimate the best filter by running through all of them: 1098 | int best_filter = 0, best_filter_val = 0x7fffffff, est, i; 1099 | for (filter_type = 0; filter_type < 5; filter_type++) { 1100 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, filter_type, line_buffer); 1101 | 1102 | // Estimate the entropy of the line using this filter; the less, the better. 1103 | est = 0; 1104 | for (i = 0; i < x*n; ++i) { 1105 | est += abs((signed char) line_buffer[i]); 1106 | } 1107 | if (est < best_filter_val) { 1108 | best_filter_val = est; 1109 | best_filter = filter_type; 1110 | } 1111 | } 1112 | if (filter_type != best_filter) { // If the last iteration already got us the best filter, don't redo it 1113 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, best_filter, line_buffer); 1114 | filter_type = best_filter; 1115 | } 1116 | } 1117 | // when we get here, filter_type contains the filter type, and line_buffer contains the data 1118 | filt[j*(x*n+1)] = (unsigned char) filter_type; 1119 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 1120 | } 1121 | STBIW_FREE(line_buffer); 1122 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, stbi_write_png_compression_level); 1123 | STBIW_FREE(filt); 1124 | if (!zlib) return 0; 1125 | 1126 | // each tag requires 12 bytes of overhead 1127 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 1128 | if (!out) return 0; 1129 | *out_len = 8 + 12+13 + 12+zlen + 12; 1130 | 1131 | o=out; 1132 | STBIW_MEMMOVE(o,sig,8); o+= 8; 1133 | stbiw__wp32(o, 13); // header length 1134 | stbiw__wptag(o, "IHDR"); 1135 | stbiw__wp32(o, x); 1136 | stbiw__wp32(o, y); 1137 | *o++ = 8; 1138 | *o++ = STBIW_UCHAR(ctype[n]); 1139 | *o++ = 0; 1140 | *o++ = 0; 1141 | *o++ = 0; 1142 | stbiw__wpcrc(&o,13); 1143 | 1144 | stbiw__wp32(o, zlen); 1145 | stbiw__wptag(o, "IDAT"); 1146 | STBIW_MEMMOVE(o, zlib, zlen); 1147 | o += zlen; 1148 | STBIW_FREE(zlib); 1149 | stbiw__wpcrc(&o, zlen); 1150 | 1151 | stbiw__wp32(o,0); 1152 | stbiw__wptag(o, "IEND"); 1153 | stbiw__wpcrc(&o,0); 1154 | 1155 | STBIW_ASSERT(o == out + *out_len); 1156 | 1157 | return out; 1158 | } 1159 | 1160 | #ifndef STBI_WRITE_NO_STDIO 1161 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1162 | { 1163 | FILE *f; 1164 | int len; 1165 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1166 | if (png == NULL) return 0; 1167 | 1168 | f = stbiw__fopen(filename, "wb"); 1169 | if (!f) { STBIW_FREE(png); return 0; } 1170 | fwrite(png, 1, len, f); 1171 | fclose(f); 1172 | STBIW_FREE(png); 1173 | return 1; 1174 | } 1175 | #endif 1176 | 1177 | 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) 1178 | { 1179 | int len; 1180 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1181 | if (png == NULL) return 0; 1182 | func(context, png, len); 1183 | STBIW_FREE(png); 1184 | return 1; 1185 | } 1186 | 1187 | 1188 | /* *************************************************************************** 1189 | * 1190 | * JPEG writer 1191 | * 1192 | * This is based on Jon Olick's jo_jpeg.cpp: 1193 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1194 | */ 1195 | 1196 | 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, 1197 | 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 }; 1198 | 1199 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1200 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1201 | bitCnt += bs[1]; 1202 | bitBuf |= bs[0] << (24 - bitCnt); 1203 | while(bitCnt >= 8) { 1204 | unsigned char c = (bitBuf >> 16) & 255; 1205 | stbiw__putc(s, c); 1206 | if(c == 255) { 1207 | stbiw__putc(s, 0); 1208 | } 1209 | bitBuf <<= 8; 1210 | bitCnt -= 8; 1211 | } 1212 | *bitBufP = bitBuf; 1213 | *bitCntP = bitCnt; 1214 | } 1215 | 1216 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1217 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1218 | float z1, z2, z3, z4, z5, z11, z13; 1219 | 1220 | float tmp0 = d0 + d7; 1221 | float tmp7 = d0 - d7; 1222 | float tmp1 = d1 + d6; 1223 | float tmp6 = d1 - d6; 1224 | float tmp2 = d2 + d5; 1225 | float tmp5 = d2 - d5; 1226 | float tmp3 = d3 + d4; 1227 | float tmp4 = d3 - d4; 1228 | 1229 | // Even part 1230 | float tmp10 = tmp0 + tmp3; // phase 2 1231 | float tmp13 = tmp0 - tmp3; 1232 | float tmp11 = tmp1 + tmp2; 1233 | float tmp12 = tmp1 - tmp2; 1234 | 1235 | d0 = tmp10 + tmp11; // phase 3 1236 | d4 = tmp10 - tmp11; 1237 | 1238 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1239 | d2 = tmp13 + z1; // phase 5 1240 | d6 = tmp13 - z1; 1241 | 1242 | // Odd part 1243 | tmp10 = tmp4 + tmp5; // phase 2 1244 | tmp11 = tmp5 + tmp6; 1245 | tmp12 = tmp6 + tmp7; 1246 | 1247 | // The rotator is modified from fig 4-8 to avoid extra negations. 1248 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1249 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1250 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1251 | z3 = tmp11 * 0.707106781f; // c4 1252 | 1253 | z11 = tmp7 + z3; // phase 5 1254 | z13 = tmp7 - z3; 1255 | 1256 | *d5p = z13 + z2; // phase 6 1257 | *d3p = z13 - z2; 1258 | *d1p = z11 + z4; 1259 | *d7p = z11 - z4; 1260 | 1261 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1262 | } 1263 | 1264 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1265 | int tmp1 = val < 0 ? -val : val; 1266 | val = val < 0 ? val-1 : val; 1267 | bits[1] = 1; 1268 | while(tmp1 >>= 1) { 1269 | ++bits[1]; 1270 | } 1271 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1309 | } 1310 | // end0pos = first element in reverse order !=0 1311 | if(end0pos == 0) { 1312 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1313 | return DU[0]; 1314 | } 1315 | for(i = 1; i <= end0pos; ++i) { 1316 | int startpos = i; 1317 | int nrzeroes; 1318 | unsigned short bits[2]; 1319 | for (; DU[i]==0 && i<=end0pos; ++i) { 1320 | } 1321 | nrzeroes = i-startpos; 1322 | if ( nrzeroes >= 16 ) { 1323 | int lng = nrzeroes>>4; 1324 | int nrmarker; 1325 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1326 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1327 | nrzeroes &= 15; 1328 | } 1329 | stbiw__jpg_calcBits(DU[i], bits); 1330 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1331 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1332 | } 1333 | if(end0pos != 63) { 1334 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1335 | } 1336 | return DU[0]; 1337 | } 1338 | 1339 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1340 | // Constants that don't pollute global namespace 1341 | 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}; 1342 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1343 | 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}; 1344 | static const unsigned char std_ac_luminance_values[] = { 1345 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1346 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1347 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1348 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1349 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1350 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1351 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1352 | }; 1353 | 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}; 1354 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1355 | 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}; 1356 | static const unsigned char std_ac_chrominance_values[] = { 1357 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1358 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1359 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1360 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1361 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1362 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1363 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1364 | }; 1365 | // Huffman tables 1366 | 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}}; 1367 | 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}}; 1368 | static const unsigned short YAC_HT[256][2] = { 1369 | {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}, 1370 | {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}, 1371 | {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}, 1372 | {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}, 1373 | {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}, 1374 | {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}, 1375 | {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}, 1376 | {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}, 1377 | {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}, 1378 | {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}, 1379 | {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}, 1380 | {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}, 1381 | {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}, 1382 | {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}, 1383 | {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}, 1384 | {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} 1385 | }; 1386 | static const unsigned short UVAC_HT[256][2] = { 1387 | {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}, 1388 | {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}, 1389 | {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}, 1390 | {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}, 1391 | {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}, 1392 | {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}, 1393 | {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}, 1394 | {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}, 1395 | {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}, 1396 | {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}, 1397 | {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}, 1398 | {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}, 1399 | {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}, 1400 | {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}, 1401 | {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}, 1402 | {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} 1403 | }; 1404 | 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, 1405 | 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}; 1406 | 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, 1407 | 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}; 1408 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1409 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1410 | 1411 | int row, col, i, k; 1412 | float fdtbl_Y[64], fdtbl_UV[64]; 1413 | unsigned char YTable[64], UVTable[64]; 1414 | 1415 | if(!data || !width || !height || comp > 4 || comp < 1) { 1416 | return 0; 1417 | } 1418 | 1419 | quality = quality ? quality : 90; 1420 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1421 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1422 | 1423 | for(i = 0; i < 64; ++i) { 1424 | int uvti, yti = (YQT[i]*quality+50)/100; 1425 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1426 | uvti = (UVQT[i]*quality+50)/100; 1427 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1428 | } 1429 | 1430 | for(row = 0, k = 0; row < 8; ++row) { 1431 | for(col = 0; col < 8; ++col, ++k) { 1432 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1433 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1434 | } 1435 | } 1436 | 1437 | // Write Headers 1438 | { 1439 | 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 }; 1440 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1441 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1442 | 3,1,0x11,0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1443 | s->func(s->context, (void*)head0, sizeof(head0)); 1444 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1445 | stbiw__putc(s, 1); 1446 | s->func(s->context, UVTable, sizeof(UVTable)); 1447 | s->func(s->context, (void*)head1, sizeof(head1)); 1448 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1449 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1450 | stbiw__putc(s, 0x10); // HTYACinfo 1451 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1452 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1453 | stbiw__putc(s, 1); // HTUDCinfo 1454 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1455 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1456 | stbiw__putc(s, 0x11); // HTUACinfo 1457 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1458 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1459 | s->func(s->context, (void*)head2, sizeof(head2)); 1460 | } 1461 | 1462 | // Encode 8x8 macroblocks 1463 | { 1464 | static const unsigned short fillBits[] = {0x7F, 7}; 1465 | const unsigned char *imageData = (const unsigned char *)data; 1466 | int DCY=0, DCU=0, DCV=0; 1467 | int bitBuf=0, bitCnt=0; 1468 | // comp == 2 is grey+alpha (alpha is ignored) 1469 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1470 | int x, y, pos; 1471 | for(y = 0; y < height; y += 8) { 1472 | for(x = 0; x < width; x += 8) { 1473 | float YDU[64], UDU[64], VDU[64]; 1474 | for(row = y, pos = 0; row < y+8; ++row) { 1475 | // row >= height => use last input row 1476 | int clamped_row = (row < height) ? row : height - 1; 1477 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1478 | for(col = x; col < x+8; ++col, ++pos) { 1479 | float r, g, b; 1480 | // if col >= width => use pixel from last input column 1481 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1482 | 1483 | r = imageData[p+0]; 1484 | g = imageData[p+ofsG]; 1485 | b = imageData[p+ofsB]; 1486 | YDU[pos]=+0.29900f*r+0.58700f*g+0.11400f*b-128; 1487 | UDU[pos]=-0.16874f*r-0.33126f*g+0.50000f*b; 1488 | VDU[pos]=+0.50000f*r-0.41869f*g-0.08131f*b; 1489 | } 1490 | } 1491 | 1492 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, YDU, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1493 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, UDU, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1494 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, VDU, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1495 | } 1496 | } 1497 | 1498 | // Do the bit alignment of the EOI marker 1499 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1500 | } 1501 | 1502 | // EOI 1503 | stbiw__putc(s, 0xFF); 1504 | stbiw__putc(s, 0xD9); 1505 | 1506 | return 1; 1507 | } 1508 | 1509 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1510 | { 1511 | stbi__write_context s; 1512 | stbi__start_write_callbacks(&s, func, context); 1513 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1514 | } 1515 | 1516 | 1517 | #ifndef STBI_WRITE_NO_STDIO 1518 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1519 | { 1520 | stbi__write_context s; 1521 | if (stbi__start_write_file(&s,filename)) { 1522 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1523 | stbi__end_write_file(&s); 1524 | return r; 1525 | } else 1526 | return 0; 1527 | } 1528 | #endif 1529 | 1530 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1531 | 1532 | /* Revision history 1533 | 1.10 (2019-02-07) 1534 | support utf8 filenames in Windows; fix warnings and platform ifdefs 1535 | 1.09 (2018-02-11) 1536 | fix typo in zlib quality API, improve STB_I_W_STATIC in C++ 1537 | 1.08 (2018-01-29) 1538 | add stbi__flip_vertically_on_write, external zlib, zlib quality, choose PNG filter 1539 | 1.07 (2017-07-24) 1540 | doc fix 1541 | 1.06 (2017-07-23) 1542 | writing JPEG (using Jon Olick's code) 1543 | 1.05 ??? 1544 | 1.04 (2017-03-03) 1545 | monochrome BMP expansion 1546 | 1.03 ??? 1547 | 1.02 (2016-04-02) 1548 | avoid allocating large structures on the stack 1549 | 1.01 (2016-01-16) 1550 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1551 | avoid race-condition in crc initialization 1552 | minor compile issues 1553 | 1.00 (2015-09-14) 1554 | installable file IO function 1555 | 0.99 (2015-09-13) 1556 | warning fixes; TGA rle support 1557 | 0.98 (2015-04-08) 1558 | added STBIW_MALLOC, STBIW_ASSERT etc 1559 | 0.97 (2015-01-18) 1560 | fixed HDR asserts, rewrote HDR rle logic 1561 | 0.96 (2015-01-17) 1562 | add HDR output 1563 | fix monochrome BMP 1564 | 0.95 (2014-08-17) 1565 | add monochrome TGA output 1566 | 0.94 (2014-05-31) 1567 | rename private functions to avoid conflicts with stb_image.h 1568 | 0.93 (2014-05-27) 1569 | warning fixes 1570 | 0.92 (2010-08-01) 1571 | casts to unsigned char to fix warnings 1572 | 0.91 (2010-07-17) 1573 | first public release 1574 | 0.90 first internal release 1575 | */ 1576 | 1577 | /* 1578 | ------------------------------------------------------------------------------ 1579 | This software is available under 2 licenses -- choose whichever you prefer. 1580 | ------------------------------------------------------------------------------ 1581 | ALTERNATIVE A - MIT License 1582 | Copyright (c) 2017 Sean Barrett 1583 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1584 | this software and associated documentation files (the "Software"), to deal in 1585 | the Software without restriction, including without limitation the rights to 1586 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1587 | of the Software, and to permit persons to whom the Software is furnished to do 1588 | so, subject to the following conditions: 1589 | The above copyright notice and this permission notice shall be included in all 1590 | copies or substantial portions of the Software. 1591 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1592 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1593 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1594 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1595 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1596 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1597 | SOFTWARE. 1598 | ------------------------------------------------------------------------------ 1599 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1600 | This is free and unencumbered software released into the public domain. 1601 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1602 | software, either in source code form or as a compiled binary, for any purpose, 1603 | commercial or non-commercial, and by any means. 1604 | In jurisdictions that recognize copyright laws, the author or authors of this 1605 | software dedicate any and all copyright interest in the software to the public 1606 | domain. We make this dedication for the benefit of the public at large and to 1607 | the detriment of our heirs and successors. We intend this dedication to be an 1608 | overt act of relinquishment in perpetuity of all present and future rights to 1609 | this software under copyright law. 1610 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1611 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1612 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1613 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1614 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1615 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1616 | ------------------------------------------------------------------------------ 1617 | */ 1618 | --------------------------------------------------------------------------------