├── .github └── ISSUE_TEMPLATE │ ├── bug_report.md │ └── feature_request.md ├── .gitignore ├── LICENSE ├── Makefile ├── README.md ├── colors.h ├── errors.h ├── image_to_ascii.c ├── image_to_ascii.h └── stb ├── stb_image.h ├── stb_image_resize.h └── stb_image_write.h /.github/ISSUE_TEMPLATE/bug_report.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Bug report 3 | about: Create a report to help us improve 4 | title: '' 5 | labels: bug 6 | assignees: brhaka 7 | 8 | --- 9 | 10 | **Describe the bug** 11 | A clear and concise description of what the bug is. 12 | 13 | **To Reproduce** 14 | Steps to reproduce the behavior: 15 | 1. Go to '...' 16 | 2. Input '....' 17 | 3. See error 18 | 19 | **Expected behavior** 20 | A clear and concise description of what you expected to happen. 21 | 22 | **Screenshots** 23 | If applicable, add screenshots to help explain your problem. 24 | 25 | **Desktop (please complete the following information):** 26 | - OS: [e.g. Ubuntu 20.04] 27 | - Version [e.g. 1.1] 28 | 29 | **Additional context** 30 | Add any other context about the problem here. 31 | -------------------------------------------------------------------------------- /.github/ISSUE_TEMPLATE/feature_request.md: -------------------------------------------------------------------------------- 1 | --- 2 | name: Feature request 3 | about: Suggest an idea for this project 4 | title: '' 5 | labels: enhancement 6 | assignees: brhaka 7 | 8 | --- 9 | 10 | **Is your feature request related to a problem? Please describe.** 11 | A clear and concise description of what the problem is. Ex. I'm always frustrated when [...] 12 | 13 | **Describe the solution you'd like** 14 | A clear and concise description of what you want to happen. 15 | 16 | **Describe alternatives you've considered** 17 | A clear and concise description of any alternative solutions or features you've considered. 18 | 19 | **Additional context** 20 | Add any other context or screenshots about the feature request here. 21 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.swp 2 | *.swo 3 | .vscode 4 | main 5 | a.out 6 | image_to_ascii 7 | ImageToASCII 8 | ImageToASCII.exe 9 | ImageToASCII_NoColors 10 | ImageToASCII_NoColors.exe 11 | path.brk 12 | ascii.brk 13 | *.jpg 14 | *.jpeg 15 | *.png 16 | *.tga 17 | *.bmp 18 | *.psd 19 | *.hdr 20 | *.pic 21 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | # ******************************** # 2 | # Author: Brhaka # 3 | # # 4 | # # 5 | # github.com/brhaka/ImageToASCII # 6 | # ******************************** # 7 | 8 | SRCS := ./image_to_ascii.c 9 | NAME := ImageToASCII 10 | USE_COLORS = 1 11 | 12 | all: LINUX MACOS WIN 13 | 14 | $(NAME): LINUX MACOS WIN 15 | 16 | LINUX: 17 | gcc $(SRCS) -static -lm -D USE_COLORS=$(USE_COLORS) -o $(NAME)-Linux 18 | 19 | MACOS: 20 | gcc $(SRCS) -lm -D USE_COLORS=$(USE_COLORS) -o $(NAME)-MacOS 21 | 22 | WIN: 23 | i686-w64-mingw32-g++ $(SRCS) --static -D USE_COLORS=$(USE_COLORS) -o $(NAME)-Windows_x86_x64 24 | 25 | clean: 26 | rm -f $(NAME)-Linux 27 | rm -f $(NAME)-MacOS 28 | rm -f $(NAME)-Windows_x86_x64.exe 29 | 30 | re: clean $(NAME) 31 | 32 | .PHONY: re clean WIN MACOS LINUX all 33 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # ImageToASCII 2 | 3 | [![License](https://img.shields.io/github/license/brhaka/ImageToASCII?style=for-the-badge)](https://github.com/brhaka/ImageToASCII/blob/master/LICENSE) 4 | [![Release](https://img.shields.io/github/v/release/brhaka/ImageToASCII?color=%234DC820&style=for-the-badge)](https://github.com/brhaka/ImageToASCII) 5 | [![Size](https://img.shields.io/github/languages/code-size/brhaka/ImageToASCII?style=for-the-badge)](https://github.com/brhaka/ImageToASCII) 6 | 7 | [![GitHub stars](https://img.shields.io/github/stars/brhaka/ImageToASCII.svg?style=social&label=Star)](https://github.com/brhaka/ImageToASCII) 8 | 9 | ## Usage 10 | 11 | `ImageToASCII` runs on the Command-Line. 12 | You must provide a path to the image you want to convert. You can do this by passing it as a Command-Line argument (`./ImageToASCII "./image.png"`). In the case where no argument is passed, ImageToASCII will prompt you to write the image path on the command-line. 13 | 14 | Another input that `ImageToASCII` requires is the `Image Resize Factor`. You can enter a value between `1` and `50`. The image will be resized according to the entered value. E.g.: With a resize factor of 10, a 3840x2160 (pixels) image becomes a 384x216 (characters) ASCII art. 15 | 16 | There are also other inputs ImageToASCII will ask you, such as wether you want to store the path to the image for later use and also wether you want to use the stored path (if previously stored). 17 | 18 | The ASCII art is saved to a file named `ascii.brk`. The extension is symbolic, but since NotePad has a limit of 1024 characters per line, to avoid confusion, it is not saved as a `.txt` file. You can open the `.brk` file with any text editor. Personally, I use [NotePad++](https://github.com/notepad-plus-plus/notepad-plus-plus). 19 | 20 | Since the program has no control over which font the ASCII art is being visualized, a whitespace is inserted after each character. E.g.: '@' becomes '@ ' 21 | 22 | *Please have in mind that the larger your ASCII art is, the more detailed it can be. It will be also heavier. E.g.: 1 character = 1 byte, so a 384x216 ASCII art weights 82.944 bytes PLUS whitespaces between columns. Total of 165.888 bytes.* 23 | 24 | ## Installation 25 | 26 | ImageToASCII is compiled to a single file, for easier use. There is a specific file for each OS version. If you wish to use ImageToASCII on **Linux**, download the `ImageToASCII-Linux` file. On **MacOS**, download the `ImageToASCII-MacOS` file and on **Windows**, download the `ImageToASCII-Windows_x86_x64.exe` file. You can start your download at the [Releases](https://github.com/brhaka/ImageToASCII/releases) section. It's also possible to [compile the source code](https://github.com/brhaka/ImageToASCII#compiling). 27 | 28 | To start the program, all you need to do is execute it via command-line. E.g: `./ImageToASCII-Linux "./image.png"` 29 | 30 | ### Branches 31 | 32 | The **[master](https://github.com/brhaka/ImageToASCII/tree/master)** branch contains the most recent stable release source code. The **[development](https://github.com/brhaka/ImageToASCII/tree/development)** branch contains the current development source code. It may be unstable. 33 | 34 | ### Compiling 35 | 36 | It's also possible to download the source code and compile it yourself. First, you must clone or fork this repository into an empty directory. Then, via command-line, you can run the following commands: 37 | 38 | `make LINUX` and `make MACOS` will compile the **Linux** and **MacOS** versions of the program. The output files are named `ImageToASCII-Linux` and `ImageToASCII-MacOS`, respectively. This command uses `gcc`. In order to execute it on Linux, it must be compiled on **Linux** and the same rule is applied to **MacOS**. 39 | 40 | `make WIN` will compile the **Windows** (x86 and x64) version of the program. The output file is named `ImageToASCII-Windows_x86_x64.exe`. This command uses **mingw**. 41 | 42 | The `make`, `make all`, `make re` and `make ImageToASCII` commands will compile the **Linux**, **MacOS** and **Windows** versions of the program. 43 | 44 | To compile a version that won't use ANSI colors on the output, add `USE_COLORS=0` to your `make *` command. E.g: `make WIN USE_COLORS=0` 45 | 46 | ## Features 47 | 48 | * Supports JPG, JPEG, PNG, TGA, BMP, PSD, HDR, PIC 49 | * Works with **any** image resolution 50 | * Clean and detailed ASCII arts 51 | * **Linux**, **MacOS** and **Windows** versions 52 | * Lightweight 53 | * Open Source 54 | 55 | ## Showcase 56 | 57 | ### High character count 58 | 59 | ![Beliaikin](https://user-images.githubusercontent.com/32342284/114232473-d7752700-9973-11eb-9889-dc30f1bb69d8.jpg) 60 | ![Antelope Close-Up](https://user-images.githubusercontent.com/32342284/114233077-b2cd7f00-9974-11eb-932e-b95f23102268.jpg) 61 | ![Leitisvatn](https://user-images.githubusercontent.com/32342284/114232421-c5938400-9973-11eb-8f8b-ac16a543ade0.jpg) 62 | ![Girl Holding Leaf](https://user-images.githubusercontent.com/32342284/114232397-b90f2b80-9973-11eb-9958-1dd4f8296875.jpg) 63 | 64 | ### Low character count 65 | 66 | ![Pear Low](https://user-images.githubusercontent.com/32342284/114232801-5d916d80-9974-11eb-88f5-a94218a8a622.jpg) 67 | ![Antelope Close-Up Low](https://user-images.githubusercontent.com/32342284/114232569-f673b900-9973-11eb-874c-675369ebe6ea.jpg) 68 | 69 | *Images by [pexels.com](https://www.pexels.com/collections/imagetoascii-vk9vgay/) and [Eirik Sørstrømmen](https://500px.com/photo/122484453/the-cliffs-of-leitisvatn-by-eirik-sorstrommen)* 70 | 71 | ## Contributing 72 | **Like what you see?** Please, feel free to fork this repository, and make any change you like. If you 73 | want to propose a nice feature, please create a separate branch on your fork, 74 | named after the feature you want to implement, then make a pull request from that 75 | branch. Thank you! 76 | -------------------------------------------------------------------------------- /colors.h: -------------------------------------------------------------------------------- 1 | /* ******************************** */ 2 | /* Author: Brhaka */ 3 | /* */ 4 | /* */ 5 | /* github.com/brhaka/ImageToASCII */ 6 | /* ******************************** */ 7 | 8 | #ifndef COLORS_H 9 | # define COLORS_H 10 | 11 | # ifndef USE_COLORS 12 | # define USE_COLORS 1 13 | # endif 14 | 15 | # if USE_COLORS == 1 16 | 17 | # define COLOR_RED "\x1B[31m" 18 | # define COLOR_GREEN "\x1B[32m" 19 | # define COLOR_YELLOW "\x1B[33m" 20 | # define COLOR_BLUE "\x1B[34m" 21 | # define COLOR_MAGENTA "\x1B[35m" 22 | # define COLOR_CYAN "\x1B[36m" 23 | # define COLOR_WHITE "\x1B[37m" 24 | # define COLOR_BLACK "\x1B[30m" 25 | # define COLOR_RESET "\x1B[0m" 26 | 27 | # else 28 | 29 | # define COLOR_RED "" 30 | # define COLOR_GREEN "" 31 | # define COLOR_YELLOW "" 32 | # define COLOR_BLUE "" 33 | # define COLOR_MAGENTA "" 34 | # define COLOR_CYAN "" 35 | # define COLOR_WHITE "" 36 | # define COLOR_BLACK "" 37 | # define COLOR_RESET "" 38 | 39 | # endif 40 | 41 | #endif 42 | -------------------------------------------------------------------------------- /errors.h: -------------------------------------------------------------------------------- 1 | /* ******************************** */ 2 | /* Author: Brhaka */ 3 | /* */ 4 | /* */ 5 | /* github.com/brhaka/ImageToASCII */ 6 | /* ******************************** */ 7 | 8 | #ifndef ERRORS_H 9 | # define ERRORS_H 10 | 11 | # define ERROR_UNDEFINED COLOR_RED "\nAn error occurred.\n" COLOR_RESET 12 | # define ERROR_INVALID_INPUT COLOR_RED "\nInvalid input\n" COLOR_RESET 13 | # define ERROR_INVALID_PATH COLOR_RED "\nInvalid path.\n" COLOR_RESET 14 | # define ERROR_OPEN_IMAGE COLOR_RED "\nCould not open specified image.\n" COLOR_RESET 15 | 16 | #endif 17 | -------------------------------------------------------------------------------- /image_to_ascii.c: -------------------------------------------------------------------------------- 1 | /* ******************************** */ 2 | /* Author: Brhaka */ 3 | /* */ 4 | /* */ 5 | /* github.com/brhaka/ImageToASCII */ 6 | /* ******************************** */ 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #include "image_to_ascii.h" 14 | #include "colors.h" 15 | #include "errors.h" 16 | 17 | #define STB_IMAGE_IMPLEMENTATION 18 | #include "stb/stb_image.h" 19 | #define STB_IMAGE_WRITE_IMPLEMENTATION 20 | #include "stb/stb_image_write.h" 21 | #define STB_IMAGE_RESIZE_IMPLEMENTATION 22 | #include "stb/stb_image_resize.h" 23 | 24 | t_image gray_image(t_image image) 25 | { 26 | t_image gray_image = image; 27 | 28 | size_t img_size = image.width * image.height * image.channels; 29 | gray_image.channels = image.channels == 4 ? 2 : 1; 30 | size_t gray_img_size = image.width * image.height * gray_image.channels; 31 | 32 | gray_image.img = (unsigned char *)malloc(gray_img_size); 33 | if (gray_image.img == NULL) 34 | { 35 | printf(ERROR_UNDEFINED); 36 | return (image); 37 | } 38 | 39 | for (unsigned char *p = image.img, *pg = gray_image.img; p != image.img + img_size; p += image.channels, pg += gray_image.channels) 40 | { 41 | *pg = (uint8_t)((*p + *(p + 1) + *(p + 2)) / 3.0); 42 | if (image.channels == 4) 43 | { 44 | *(pg + 1) = *(p + 3); 45 | } 46 | } 47 | stbi_image_free(image.img); 48 | 49 | return (gray_image); 50 | } 51 | 52 | t_image resize_image(t_image image, int resize_factor) 53 | { 54 | t_image new_image; 55 | 56 | resize_factor <= 0 ? resize_factor = 1 : 1; 57 | new_image.width = (image.width / resize_factor); 58 | new_image.height = (image.height / resize_factor); 59 | new_image.channels = image.channels; 60 | 61 | new_image.img = (unsigned char *)malloc((new_image.width * new_image.height * new_image.channels) * sizeof(unsigned char)); 62 | if (new_image.img == NULL) 63 | { 64 | printf(ERROR_UNDEFINED); 65 | return (image); 66 | } 67 | 68 | stbir_resize_uint8(image.img, image.width, image.height, 0, new_image.img, new_image.width, new_image.height, 0, image.channels); 69 | 70 | stbi_image_free(image.img); 71 | 72 | return (new_image); 73 | } 74 | 75 | void convert_to_ascii(t_image image) 76 | { 77 | FILE *fptr = NULL; 78 | int char_index; 79 | char map[11] = "@#%xo;:,. "; 80 | int percentage; 81 | 82 | fptr = fopen("ascii.brk", "w"); 83 | if (fptr != NULL) 84 | { 85 | for (int y = 0; y < image.height; y++) 86 | { 87 | for (int x = 0; x < image.width; x++) 88 | { 89 | char_index = (int)(*(image.img) / (255 / (sizeof(map) / sizeof(map[0])))); 90 | char_index > 9 ? char_index = 9 : 1; 91 | char_index < 0 ? char_index = 0 : 1; 92 | fprintf(fptr, "%c%c", map[char_index], map[char_index]); 93 | image.img++; 94 | } 95 | fprintf(fptr, "%c", '\n'); 96 | percentage = round((y + 1) / (image.height / 100.0)); 97 | percentage < 0 ? percentage = 0 : 1; 98 | percentage > 100 ? percentage = 100 : 1; 99 | printf("\r[ %d%% ]", percentage); 100 | fflush(stdout); 101 | } 102 | printf("\n"); 103 | fclose(fptr); 104 | } 105 | } 106 | 107 | void get_stored_image_path(char *image_path) 108 | { 109 | FILE *fptr = NULL; 110 | 111 | fptr = fopen("path.brk", "r"); 112 | if (fptr != NULL) 113 | { 114 | fscanf(fptr, "%s", image_path); 115 | fclose(fptr); 116 | } 117 | } 118 | 119 | void store_image_path(char *image_path) 120 | { 121 | FILE *fptr = NULL; 122 | 123 | fptr = fopen("path.brk", "w"); 124 | if (fptr != NULL) 125 | { 126 | for (int i = 0; image_path[i]; i++) 127 | { 128 | fprintf(fptr, "%c", image_path[i]); 129 | } 130 | fprintf(fptr, "%c", '\n'); 131 | fclose(fptr); 132 | } 133 | } 134 | 135 | char *handle_user_input(char *message, char *possible_inputs, int size, bool check_input) 136 | { 137 | char *input; 138 | bool valid_input; 139 | 140 | input = (char *)malloc(size * sizeof(char)); 141 | if (input == NULL) 142 | { 143 | printf(ERROR_UNDEFINED); 144 | return ""; 145 | } 146 | 147 | printf("%s", message); 148 | fgets(input, 512, stdin); 149 | if (input[0] == '\n') 150 | { 151 | printf(ERROR_INVALID_INPUT); 152 | free(input); 153 | return (handle_user_input(message, possible_inputs, size, check_input)); 154 | } 155 | strtok(input, "\n"); 156 | 157 | if (check_input == true) 158 | { 159 | valid_input = false; 160 | for (int i = 0; input[i] && i < size; i++) 161 | { 162 | for (int j = 0; possible_inputs[j]; j++) 163 | { 164 | if (input[i] == possible_inputs[j]) 165 | { 166 | valid_input = true; 167 | } 168 | } 169 | } 170 | } 171 | else 172 | { 173 | valid_input = true; 174 | } 175 | 176 | if (valid_input == true) 177 | { 178 | return (input); 179 | } 180 | else 181 | { 182 | printf(ERROR_INVALID_INPUT); 183 | free(input); 184 | return (handle_user_input(message, possible_inputs, size, check_input)); 185 | } 186 | } 187 | 188 | char *handle_int_user_input(char *message, int min, int max, int size) 189 | { 190 | char *input; 191 | int input_int; 192 | char possible_inputs[11] = "0123456789"; 193 | 194 | input = handle_user_input(message, possible_inputs, size, true); 195 | input_int = atoi(input); 196 | if (input_int > max) 197 | { 198 | printf(ERROR_INVALID_INPUT); 199 | return (handle_int_user_input(message, min, max, size)); 200 | } 201 | else if (input_int < min) 202 | { 203 | printf(ERROR_INVALID_INPUT); 204 | return (handle_int_user_input(message, min, max, size)); 205 | } 206 | else 207 | { 208 | return (input); 209 | } 210 | } 211 | 212 | int main(int argc, char *argv[]) 213 | { 214 | char *image_path; 215 | char *resize_factor; 216 | char *store_path; 217 | char *use_stored_path; 218 | bool use_strd_path_allctd; 219 | bool image_path_ready; 220 | t_image image; 221 | 222 | use_strd_path_allctd = false; 223 | image_path_ready = false; 224 | 225 | if (argc == 2) 226 | { 227 | image_path = (char *)malloc(261 * sizeof(char)); 228 | if (image_path == NULL) 229 | { 230 | printf(ERROR_UNDEFINED); 231 | return (0); 232 | } 233 | 234 | for (int i = 0; argv[1][i]; i++) 235 | { 236 | image_path[i] = argv[1][i]; 237 | image_path[i + 1] = '\0'; 238 | } 239 | 240 | image_path_ready = true; 241 | } 242 | else 243 | { 244 | image_path = (char *)malloc(261 * sizeof(char)); 245 | if (image_path == NULL) 246 | { 247 | printf(ERROR_UNDEFINED); 248 | return (0); 249 | } 250 | image_path[0] = '\0'; 251 | 252 | get_stored_image_path(image_path); 253 | 254 | if (image_path[0]) 255 | { 256 | image_path_ready = true; 257 | 258 | char possible_inputs[3] = "yn"; 259 | use_stored_path = handle_user_input(COLOR_CYAN "Use stored path?" COLOR_RESET " [y/n]: " COLOR_YELLOW, possible_inputs, 1, true); 260 | use_strd_path_allctd = true; 261 | } 262 | 263 | if ((use_strd_path_allctd == true && use_stored_path[0] == 'n') || image_path_ready == false) 264 | { 265 | use_strd_path_allctd == true ? printf("\n\n") : 1; 266 | free(image_path); 267 | image_path = handle_user_input(COLOR_CYAN "Enter image path: " COLOR_YELLOW, "", 512, false); 268 | image_path_ready = true; 269 | } 270 | } 271 | 272 | if (image_path_ready == true) 273 | { 274 | printf(COLOR_CYAN "\n\nLoading image...\n" COLOR_RESET); 275 | printf(COLOR_RESET "\r[ %d%% ]", 0); 276 | fflush(stdout); 277 | image.img = stbi_load(image_path, &image.width, &image.height, &image.channels, 0); 278 | if (image.img != NULL) 279 | { 280 | printf(COLOR_RESET "\r[ %d%% ]", 100); 281 | printf(COLOR_GREEN "\nImage loaded with success.\n\n\n" COLOR_RESET); 282 | if (use_strd_path_allctd == false || (use_strd_path_allctd == true && use_stored_path[0] != 'y')) 283 | { 284 | char possible_inputs[3] = "yn"; 285 | store_path = handle_user_input(COLOR_CYAN "Store path?" COLOR_RESET " [y/n]: " COLOR_YELLOW, possible_inputs, 1, true); 286 | store_path[0] == 'y' ? store_image_path(image_path) : (void)1; 287 | printf("\n\n"); 288 | free(store_path); 289 | } 290 | 291 | resize_factor = handle_int_user_input(COLOR_CYAN "Enter image resize factor:" COLOR_RESET " [1 - 50] " COLOR_YELLOW, 1, 50, 2); 292 | 293 | printf(COLOR_CYAN "\n\nPreparing image...\n" COLOR_RESET); 294 | printf(COLOR_RESET "\r[ %d%% ]", 0); 295 | fflush(stdout); 296 | image = resize_image(image, atoi(resize_factor)); 297 | printf(COLOR_RESET "\r[ %d%% ]", 50); 298 | fflush(stdout); 299 | free(resize_factor); 300 | image = gray_image(image); 301 | printf(COLOR_RESET "\r[ %d%% ]", 100); 302 | printf(COLOR_GREEN "\nImage ready.\n\n" COLOR_RESET); 303 | 304 | printf(COLOR_CYAN "Converting image to ASCII...\n" COLOR_RESET); 305 | convert_to_ascii(image); 306 | printf(COLOR_GREEN "Image successfully converted to ASCII.\n\n" COLOR_RESET); 307 | } 308 | else 309 | { 310 | printf(ERROR_OPEN_IMAGE); 311 | } 312 | 313 | stbi_image_free(image.img); 314 | } 315 | else 316 | { 317 | printf(ERROR_INVALID_PATH); 318 | } 319 | 320 | use_strd_path_allctd == true ? free(use_stored_path) : (void)1; 321 | image_path_ready == true ? free(image_path) : (void)1; 322 | 323 | return (0); 324 | } 325 | -------------------------------------------------------------------------------- /image_to_ascii.h: -------------------------------------------------------------------------------- 1 | /* ******************************** */ 2 | /* Author: Brhaka */ 3 | /* */ 4 | /* */ 5 | /* github.com/brhaka/ImageToASCII */ 6 | /* ******************************** */ 7 | 8 | #ifndef IMAGE_TO_ASCII_H 9 | # define IMAGE_TO_ASCII_H 10 | 11 | typedef struct s_image 12 | { 13 | unsigned char *img; 14 | int width; 15 | int height; 16 | int channels; 17 | } t_image; 18 | 19 | #endif 20 | -------------------------------------------------------------------------------- /stb/stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.15 - public domain - http://nothings.org/stb 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_write_png_compression_level = 8; 251 | static int stbi_write_tga_with_rle = 1; 252 | static int stbi_write_force_png_filter = -1; 253 | #else 254 | int stbi_write_png_compression_level = 8; 255 | int stbi_write_tga_with_rle = 1; 256 | int stbi_write_force_png_filter = -1; 257 | #endif 258 | 259 | static int stbi__flip_vertically_on_write = 0; 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 | unsigned char buffer[64]; 271 | int buf_used; 272 | } stbi__write_context; 273 | 274 | // initialize a callback-based context 275 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 276 | { 277 | s->func = c; 278 | s->context = context; 279 | } 280 | 281 | #ifndef STBI_WRITE_NO_STDIO 282 | 283 | static void stbi__stdio_write(void *context, void *data, int size) 284 | { 285 | fwrite(data,1,size,(FILE*) context); 286 | } 287 | 288 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 289 | #ifdef __cplusplus 290 | #define STBIW_EXTERN extern "C" 291 | #else 292 | #define STBIW_EXTERN extern 293 | #endif 294 | STBIW_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide); 295 | 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); 296 | 297 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input) 298 | { 299 | return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int) bufferlen, NULL, NULL); 300 | } 301 | #endif 302 | 303 | static FILE *stbiw__fopen(char const *filename, char const *mode) 304 | { 305 | FILE *f; 306 | #if defined(_MSC_VER) && defined(STBI_WINDOWS_UTF8) 307 | wchar_t wMode[64]; 308 | wchar_t wFilename[1024]; 309 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename))) 310 | return 0; 311 | 312 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode))) 313 | return 0; 314 | 315 | #if _MSC_VER >= 1400 316 | if (0 != _wfopen_s(&f, wFilename, wMode)) 317 | f = 0; 318 | #else 319 | f = _wfopen(wFilename, wMode); 320 | #endif 321 | 322 | #elif defined(_MSC_VER) && _MSC_VER >= 1400 323 | if (0 != fopen_s(&f, filename, mode)) 324 | f=0; 325 | #else 326 | f = fopen(filename, mode); 327 | #endif 328 | return f; 329 | } 330 | 331 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 332 | { 333 | FILE *f = stbiw__fopen(filename, "wb"); 334 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 335 | return f != NULL; 336 | } 337 | 338 | static void stbi__end_write_file(stbi__write_context *s) 339 | { 340 | fclose((FILE *)s->context); 341 | } 342 | 343 | #endif // !STBI_WRITE_NO_STDIO 344 | 345 | typedef unsigned int stbiw_uint32; 346 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 347 | 348 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 349 | { 350 | while (*fmt) { 351 | switch (*fmt++) { 352 | case ' ': break; 353 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 354 | s->func(s->context,&x,1); 355 | break; } 356 | case '2': { int x = va_arg(v,int); 357 | unsigned char b[2]; 358 | b[0] = STBIW_UCHAR(x); 359 | b[1] = STBIW_UCHAR(x>>8); 360 | s->func(s->context,b,2); 361 | break; } 362 | case '4': { stbiw_uint32 x = va_arg(v,int); 363 | unsigned char b[4]; 364 | b[0]=STBIW_UCHAR(x); 365 | b[1]=STBIW_UCHAR(x>>8); 366 | b[2]=STBIW_UCHAR(x>>16); 367 | b[3]=STBIW_UCHAR(x>>24); 368 | s->func(s->context,b,4); 369 | break; } 370 | default: 371 | STBIW_ASSERT(0); 372 | return; 373 | } 374 | } 375 | } 376 | 377 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 378 | { 379 | va_list v; 380 | va_start(v, fmt); 381 | stbiw__writefv(s, fmt, v); 382 | va_end(v); 383 | } 384 | 385 | static void stbiw__write_flush(stbi__write_context *s) 386 | { 387 | if (s->buf_used) { 388 | s->func(s->context, &s->buffer, s->buf_used); 389 | s->buf_used = 0; 390 | } 391 | } 392 | 393 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 394 | { 395 | s->func(s->context, &c, 1); 396 | } 397 | 398 | static void stbiw__write1(stbi__write_context *s, unsigned char a) 399 | { 400 | if (s->buf_used + 1 > sizeof(s->buffer)) 401 | stbiw__write_flush(s); 402 | s->buffer[s->buf_used++] = a; 403 | } 404 | 405 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 406 | { 407 | int n; 408 | if (s->buf_used + 3 > sizeof(s->buffer)) 409 | stbiw__write_flush(s); 410 | n = s->buf_used; 411 | s->buf_used = n+3; 412 | s->buffer[n+0] = a; 413 | s->buffer[n+1] = b; 414 | s->buffer[n+2] = c; 415 | } 416 | 417 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 418 | { 419 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 420 | int k; 421 | 422 | if (write_alpha < 0) 423 | stbiw__write1(s, d[comp - 1]); 424 | 425 | switch (comp) { 426 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 427 | case 1: 428 | if (expand_mono) 429 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 430 | else 431 | stbiw__write1(s, d[0]); // monochrome TGA 432 | break; 433 | case 4: 434 | if (!write_alpha) { 435 | // composite against pink background 436 | for (k = 0; k < 3; ++k) 437 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 438 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 439 | break; 440 | } 441 | /* FALLTHROUGH */ 442 | case 3: 443 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 444 | break; 445 | } 446 | if (write_alpha > 0) 447 | stbiw__write1(s, d[comp - 1]); 448 | } 449 | 450 | 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) 451 | { 452 | stbiw_uint32 zero = 0; 453 | int i,j, j_end; 454 | 455 | if (y <= 0) 456 | return; 457 | 458 | if (stbi__flip_vertically_on_write) 459 | vdir *= -1; 460 | 461 | if (vdir < 0) { 462 | j_end = -1; j = y-1; 463 | } else { 464 | j_end = y; j = 0; 465 | } 466 | 467 | for (; j != j_end; j += vdir) { 468 | for (i=0; i < x; ++i) { 469 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 470 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 471 | } 472 | stbiw__write_flush(s); 473 | s->func(s->context, &zero, scanline_pad); 474 | } 475 | } 476 | 477 | 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, ...) 478 | { 479 | if (y < 0 || x < 0) { 480 | return 0; 481 | } else { 482 | va_list v; 483 | va_start(v, fmt); 484 | stbiw__writefv(s, fmt, v); 485 | va_end(v); 486 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 487 | return 1; 488 | } 489 | } 490 | 491 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 492 | { 493 | int pad = (-x*3) & 3; 494 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 495 | "11 4 22 4" "4 44 22 444444", 496 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 497 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 498 | } 499 | 500 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 501 | { 502 | stbi__write_context s = { 0 }; 503 | stbi__start_write_callbacks(&s, func, context); 504 | return stbi_write_bmp_core(&s, x, y, comp, data); 505 | } 506 | 507 | #ifndef STBI_WRITE_NO_STDIO 508 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 509 | { 510 | stbi__write_context s = { 0 }; 511 | if (stbi__start_write_file(&s,filename)) { 512 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 513 | stbi__end_write_file(&s); 514 | return r; 515 | } else 516 | return 0; 517 | } 518 | #endif //!STBI_WRITE_NO_STDIO 519 | 520 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 521 | { 522 | int has_alpha = (comp == 2 || comp == 4); 523 | int colorbytes = has_alpha ? comp-1 : comp; 524 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 525 | 526 | if (y < 0 || x < 0) 527 | return 0; 528 | 529 | if (!stbi_write_tga_with_rle) { 530 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 531 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 532 | } else { 533 | int i,j,k; 534 | int jend, jdir; 535 | 536 | 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); 537 | 538 | if (stbi__flip_vertically_on_write) { 539 | j = 0; 540 | jend = y; 541 | jdir = 1; 542 | } else { 543 | j = y-1; 544 | jend = -1; 545 | jdir = -1; 546 | } 547 | for (; j != jend; j += jdir) { 548 | unsigned char *row = (unsigned char *) data + j * x * comp; 549 | int len; 550 | 551 | for (i = 0; i < x; i += len) { 552 | unsigned char *begin = row + i * comp; 553 | int diff = 1; 554 | len = 1; 555 | 556 | if (i < x - 1) { 557 | ++len; 558 | diff = memcmp(begin, row + (i + 1) * comp, comp); 559 | if (diff) { 560 | const unsigned char *prev = begin; 561 | for (k = i + 2; k < x && len < 128; ++k) { 562 | if (memcmp(prev, row + k * comp, comp)) { 563 | prev += comp; 564 | ++len; 565 | } else { 566 | --len; 567 | break; 568 | } 569 | } 570 | } else { 571 | for (k = i + 2; k < x && len < 128; ++k) { 572 | if (!memcmp(begin, row + k * comp, comp)) { 573 | ++len; 574 | } else { 575 | break; 576 | } 577 | } 578 | } 579 | } 580 | 581 | if (diff) { 582 | unsigned char header = STBIW_UCHAR(len - 1); 583 | stbiw__write1(s, header); 584 | for (k = 0; k < len; ++k) { 585 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 586 | } 587 | } else { 588 | unsigned char header = STBIW_UCHAR(len - 129); 589 | stbiw__write1(s, header); 590 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 591 | } 592 | } 593 | } 594 | stbiw__write_flush(s); 595 | } 596 | return 1; 597 | } 598 | 599 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 600 | { 601 | stbi__write_context s = { 0 }; 602 | stbi__start_write_callbacks(&s, func, context); 603 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 604 | } 605 | 606 | #ifndef STBI_WRITE_NO_STDIO 607 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 608 | { 609 | stbi__write_context s = { 0 }; 610 | if (stbi__start_write_file(&s,filename)) { 611 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 612 | stbi__end_write_file(&s); 613 | return r; 614 | } else 615 | return 0; 616 | } 617 | #endif 618 | 619 | // ************************************************************************************************* 620 | // Radiance RGBE HDR writer 621 | // by Baldur Karlsson 622 | 623 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 624 | 625 | static void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 626 | { 627 | int exponent; 628 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 629 | 630 | if (maxcomp < 1e-32f) { 631 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 632 | } else { 633 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 634 | 635 | rgbe[0] = (unsigned char)(linear[0] * normalize); 636 | rgbe[1] = (unsigned char)(linear[1] * normalize); 637 | rgbe[2] = (unsigned char)(linear[2] * normalize); 638 | rgbe[3] = (unsigned char)(exponent + 128); 639 | } 640 | } 641 | 642 | static void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 643 | { 644 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 645 | STBIW_ASSERT(length+128 <= 255); 646 | s->func(s->context, &lengthbyte, 1); 647 | s->func(s->context, &databyte, 1); 648 | } 649 | 650 | static void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 651 | { 652 | unsigned char lengthbyte = STBIW_UCHAR(length); 653 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 654 | s->func(s->context, &lengthbyte, 1); 655 | s->func(s->context, data, length); 656 | } 657 | 658 | static void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 659 | { 660 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 661 | unsigned char rgbe[4]; 662 | float linear[3]; 663 | int x; 664 | 665 | scanlineheader[2] = (width&0xff00)>>8; 666 | scanlineheader[3] = (width&0x00ff); 667 | 668 | /* skip RLE for images too small or large */ 669 | if (width < 8 || width >= 32768) { 670 | for (x=0; x < width; x++) { 671 | switch (ncomp) { 672 | case 4: /* fallthrough */ 673 | case 3: linear[2] = scanline[x*ncomp + 2]; 674 | linear[1] = scanline[x*ncomp + 1]; 675 | linear[0] = scanline[x*ncomp + 0]; 676 | break; 677 | default: 678 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 679 | break; 680 | } 681 | stbiw__linear_to_rgbe(rgbe, linear); 682 | s->func(s->context, rgbe, 4); 683 | } 684 | } else { 685 | int c,r; 686 | /* encode into scratch buffer */ 687 | for (x=0; x < width; x++) { 688 | switch(ncomp) { 689 | case 4: /* fallthrough */ 690 | case 3: linear[2] = scanline[x*ncomp + 2]; 691 | linear[1] = scanline[x*ncomp + 1]; 692 | linear[0] = scanline[x*ncomp + 0]; 693 | break; 694 | default: 695 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 696 | break; 697 | } 698 | stbiw__linear_to_rgbe(rgbe, linear); 699 | scratch[x + width*0] = rgbe[0]; 700 | scratch[x + width*1] = rgbe[1]; 701 | scratch[x + width*2] = rgbe[2]; 702 | scratch[x + width*3] = rgbe[3]; 703 | } 704 | 705 | s->func(s->context, scanlineheader, 4); 706 | 707 | /* RLE each component separately */ 708 | for (c=0; c < 4; c++) { 709 | unsigned char *comp = &scratch[width*c]; 710 | 711 | x = 0; 712 | while (x < width) { 713 | // find first run 714 | r = x; 715 | while (r+2 < width) { 716 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 717 | break; 718 | ++r; 719 | } 720 | if (r+2 >= width) 721 | r = width; 722 | // dump up to first run 723 | while (x < r) { 724 | int len = r-x; 725 | if (len > 128) len = 128; 726 | stbiw__write_dump_data(s, len, &comp[x]); 727 | x += len; 728 | } 729 | // if there's a run, output it 730 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 731 | // find next byte after run 732 | while (r < width && comp[r] == comp[x]) 733 | ++r; 734 | // output run up to r 735 | while (x < r) { 736 | int len = r-x; 737 | if (len > 127) len = 127; 738 | stbiw__write_run_data(s, len, comp[x]); 739 | x += len; 740 | } 741 | } 742 | } 743 | } 744 | } 745 | } 746 | 747 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 748 | { 749 | if (y <= 0 || x <= 0 || data == NULL) 750 | return 0; 751 | else { 752 | // Each component is stored separately. Allocate scratch space for full output scanline. 753 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 754 | int i, len; 755 | char buffer[128]; 756 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 757 | s->func(s->context, header, sizeof(header)-1); 758 | 759 | #ifdef __STDC_WANT_SECURE_LIB__ 760 | len = sprintf_s(buffer, sizeof(buffer), "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 761 | #else 762 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 763 | #endif 764 | s->func(s->context, buffer, len); 765 | 766 | for(i=0; i < y; i++) 767 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*x*(stbi__flip_vertically_on_write ? y-1-i : i)); 768 | STBIW_FREE(scratch); 769 | return 1; 770 | } 771 | } 772 | 773 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 774 | { 775 | stbi__write_context s = { 0 }; 776 | stbi__start_write_callbacks(&s, func, context); 777 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 778 | } 779 | 780 | #ifndef STBI_WRITE_NO_STDIO 781 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 782 | { 783 | stbi__write_context s = { 0 }; 784 | if (stbi__start_write_file(&s,filename)) { 785 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 786 | stbi__end_write_file(&s); 787 | return r; 788 | } else 789 | return 0; 790 | } 791 | #endif // STBI_WRITE_NO_STDIO 792 | 793 | 794 | ////////////////////////////////////////////////////////////////////////////// 795 | // 796 | // PNG writer 797 | // 798 | 799 | #ifndef STBIW_ZLIB_COMPRESS 800 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 801 | #define stbiw__sbraw(a) ((int *) (void *) (a) - 2) 802 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 803 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 804 | 805 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 806 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 807 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 808 | 809 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 810 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 811 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 812 | 813 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 814 | { 815 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 816 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 817 | STBIW_ASSERT(p); 818 | if (p) { 819 | if (!*arr) ((int *) p)[1] = 0; 820 | *arr = (void *) ((int *) p + 2); 821 | stbiw__sbm(*arr) = m; 822 | } 823 | return *arr; 824 | } 825 | 826 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 827 | { 828 | while (*bitcount >= 8) { 829 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 830 | *bitbuffer >>= 8; 831 | *bitcount -= 8; 832 | } 833 | return data; 834 | } 835 | 836 | static int stbiw__zlib_bitrev(int code, int codebits) 837 | { 838 | int res=0; 839 | while (codebits--) { 840 | res = (res << 1) | (code & 1); 841 | code >>= 1; 842 | } 843 | return res; 844 | } 845 | 846 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 847 | { 848 | int i; 849 | for (i=0; i < limit && i < 258; ++i) 850 | if (a[i] != b[i]) break; 851 | return i; 852 | } 853 | 854 | static unsigned int stbiw__zhash(unsigned char *data) 855 | { 856 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 857 | hash ^= hash << 3; 858 | hash += hash >> 5; 859 | hash ^= hash << 4; 860 | hash += hash >> 17; 861 | hash ^= hash << 25; 862 | hash += hash >> 6; 863 | return hash; 864 | } 865 | 866 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 867 | #define stbiw__zlib_add(code,codebits) \ 868 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 869 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 870 | // default huffman tables 871 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 872 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 873 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 874 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 875 | #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)) 876 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 877 | 878 | #define stbiw__ZHASH 16384 879 | 880 | #endif // STBIW_ZLIB_COMPRESS 881 | 882 | STBIWDEF unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 883 | { 884 | #ifdef STBIW_ZLIB_COMPRESS 885 | // user provided a zlib compress implementation, use that 886 | return STBIW_ZLIB_COMPRESS(data, data_len, out_len, quality); 887 | #else // use builtin 888 | 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 }; 889 | 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 }; 890 | 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 }; 891 | 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 }; 892 | unsigned int bitbuf=0; 893 | int i,j, bitcount=0; 894 | unsigned char *out = NULL; 895 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(unsigned char**)); 896 | if (hash_table == NULL) 897 | return NULL; 898 | if (quality < 5) quality = 5; 899 | 900 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 901 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 902 | stbiw__zlib_add(1,1); // BFINAL = 1 903 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 904 | 905 | for (i=0; i < stbiw__ZHASH; ++i) 906 | hash_table[i] = NULL; 907 | 908 | i=0; 909 | while (i < data_len-3) { 910 | // hash next 3 bytes of data to be compressed 911 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 912 | unsigned char *bestloc = 0; 913 | unsigned char **hlist = hash_table[h]; 914 | int n = stbiw__sbcount(hlist); 915 | for (j=0; j < n; ++j) { 916 | if (hlist[j]-data > i-32768) { // if entry lies within window 917 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 918 | if (d >= best) { best=d; bestloc=hlist[j]; } 919 | } 920 | } 921 | // when hash table entry is too long, delete half the entries 922 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 923 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 924 | stbiw__sbn(hash_table[h]) = quality; 925 | } 926 | stbiw__sbpush(hash_table[h],data+i); 927 | 928 | if (bestloc) { 929 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 930 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 931 | hlist = hash_table[h]; 932 | n = stbiw__sbcount(hlist); 933 | for (j=0; j < n; ++j) { 934 | if (hlist[j]-data > i-32767) { 935 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 936 | if (e > best) { // if next match is better, bail on current match 937 | bestloc = NULL; 938 | break; 939 | } 940 | } 941 | } 942 | } 943 | 944 | if (bestloc) { 945 | int d = (int) (data+i - bestloc); // distance back 946 | STBIW_ASSERT(d <= 32767 && best <= 258); 947 | for (j=0; best > lengthc[j+1]-1; ++j); 948 | stbiw__zlib_huff(j+257); 949 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 950 | for (j=0; d > distc[j+1]-1; ++j); 951 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 952 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 953 | i += best; 954 | } else { 955 | stbiw__zlib_huffb(data[i]); 956 | ++i; 957 | } 958 | } 959 | // write out final bytes 960 | for (;i < data_len; ++i) 961 | stbiw__zlib_huffb(data[i]); 962 | stbiw__zlib_huff(256); // end of block 963 | // pad with 0 bits to byte boundary 964 | while (bitcount) 965 | stbiw__zlib_add(0,1); 966 | 967 | for (i=0; i < stbiw__ZHASH; ++i) 968 | (void) stbiw__sbfree(hash_table[i]); 969 | STBIW_FREE(hash_table); 970 | 971 | { 972 | // compute adler32 on input 973 | unsigned int s1=1, s2=0; 974 | int blocklen = (int) (data_len % 5552); 975 | j=0; 976 | while (j < data_len) { 977 | for (i=0; i < blocklen; ++i) { s1 += data[j+i]; s2 += s1; } 978 | s1 %= 65521; s2 %= 65521; 979 | j += blocklen; 980 | blocklen = 5552; 981 | } 982 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 983 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 984 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 985 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 986 | } 987 | *out_len = stbiw__sbn(out); 988 | // make returned pointer freeable 989 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 990 | return (unsigned char *) stbiw__sbraw(out); 991 | #endif // STBIW_ZLIB_COMPRESS 992 | } 993 | 994 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 995 | { 996 | #ifdef STBIW_CRC32 997 | return STBIW_CRC32(buffer, len); 998 | #else 999 | static unsigned int crc_table[256] = 1000 | { 1001 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 1002 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 1003 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 1004 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 1005 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 1006 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 1007 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 1008 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 1009 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 1010 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 1011 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 1012 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 1013 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 1014 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 1015 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 1016 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 1017 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 1018 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 1019 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 1020 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 1021 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 1022 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 1023 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 1024 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 1025 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 1026 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 1027 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 1028 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 1029 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 1030 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 1031 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 1032 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 1033 | }; 1034 | 1035 | unsigned int crc = ~0u; 1036 | int i; 1037 | for (i=0; i < len; ++i) 1038 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 1039 | return ~crc; 1040 | #endif 1041 | } 1042 | 1043 | #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) 1044 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 1045 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 1046 | 1047 | static void stbiw__wpcrc(unsigned char **data, int len) 1048 | { 1049 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 1050 | stbiw__wp32(*data, crc); 1051 | } 1052 | 1053 | static unsigned char stbiw__paeth(int a, int b, int c) 1054 | { 1055 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 1056 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 1057 | if (pb <= pc) return STBIW_UCHAR(b); 1058 | return STBIW_UCHAR(c); 1059 | } 1060 | 1061 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 1062 | 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) 1063 | { 1064 | static int mapping[] = { 0,1,2,3,4 }; 1065 | static int firstmap[] = { 0,1,0,5,6 }; 1066 | int *mymap = (y != 0) ? mapping : firstmap; 1067 | int i; 1068 | int type = mymap[filter_type]; 1069 | unsigned char *z = pixels + stride_bytes * (stbi__flip_vertically_on_write ? height-1-y : y); 1070 | int signed_stride = stbi__flip_vertically_on_write ? -stride_bytes : stride_bytes; 1071 | 1072 | if (type==0) { 1073 | memcpy(line_buffer, z, width*n); 1074 | return; 1075 | } 1076 | 1077 | // first loop isn't optimized since it's just one pixel 1078 | for (i = 0; i < n; ++i) { 1079 | switch (type) { 1080 | case 1: line_buffer[i] = z[i]; break; 1081 | case 2: line_buffer[i] = z[i] - z[i-signed_stride]; break; 1082 | case 3: line_buffer[i] = z[i] - (z[i-signed_stride]>>1); break; 1083 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-signed_stride],0)); break; 1084 | case 5: line_buffer[i] = z[i]; break; 1085 | case 6: line_buffer[i] = z[i]; break; 1086 | } 1087 | } 1088 | switch (type) { 1089 | case 1: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-n]; break; 1090 | case 2: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-signed_stride]; break; 1091 | case 3: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - ((z[i-n] + z[i-signed_stride])>>1); break; 1092 | 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; 1093 | case 5: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - (z[i-n]>>1); break; 1094 | case 6: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 1095 | } 1096 | } 1097 | 1098 | STBIWDEF unsigned char *stbi_write_png_to_mem(const unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 1099 | { 1100 | int force_filter = stbi_write_force_png_filter; 1101 | int ctype[5] = { -1, 0, 4, 2, 6 }; 1102 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 1103 | unsigned char *out,*o, *filt, *zlib; 1104 | signed char *line_buffer; 1105 | int j,zlen; 1106 | 1107 | if (stride_bytes == 0) 1108 | stride_bytes = x * n; 1109 | 1110 | if (force_filter >= 5) { 1111 | force_filter = -1; 1112 | } 1113 | 1114 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 1115 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 1116 | for (j=0; j < y; ++j) { 1117 | int filter_type; 1118 | if (force_filter > -1) { 1119 | filter_type = force_filter; 1120 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, force_filter, line_buffer); 1121 | } else { // Estimate the best filter by running through all of them: 1122 | int best_filter = 0, best_filter_val = 0x7fffffff, est, i; 1123 | for (filter_type = 0; filter_type < 5; filter_type++) { 1124 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, filter_type, line_buffer); 1125 | 1126 | // Estimate the entropy of the line using this filter; the less, the better. 1127 | est = 0; 1128 | for (i = 0; i < x*n; ++i) { 1129 | est += abs((signed char) line_buffer[i]); 1130 | } 1131 | if (est < best_filter_val) { 1132 | best_filter_val = est; 1133 | best_filter = filter_type; 1134 | } 1135 | } 1136 | if (filter_type != best_filter) { // If the last iteration already got us the best filter, don't redo it 1137 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, best_filter, line_buffer); 1138 | filter_type = best_filter; 1139 | } 1140 | } 1141 | // when we get here, filter_type contains the filter type, and line_buffer contains the data 1142 | filt[j*(x*n+1)] = (unsigned char) filter_type; 1143 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 1144 | } 1145 | STBIW_FREE(line_buffer); 1146 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, stbi_write_png_compression_level); 1147 | STBIW_FREE(filt); 1148 | if (!zlib) return 0; 1149 | 1150 | // each tag requires 12 bytes of overhead 1151 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 1152 | if (!out) return 0; 1153 | *out_len = 8 + 12+13 + 12+zlen + 12; 1154 | 1155 | o=out; 1156 | STBIW_MEMMOVE(o,sig,8); o+= 8; 1157 | stbiw__wp32(o, 13); // header length 1158 | stbiw__wptag(o, "IHDR"); 1159 | stbiw__wp32(o, x); 1160 | stbiw__wp32(o, y); 1161 | *o++ = 8; 1162 | *o++ = STBIW_UCHAR(ctype[n]); 1163 | *o++ = 0; 1164 | *o++ = 0; 1165 | *o++ = 0; 1166 | stbiw__wpcrc(&o,13); 1167 | 1168 | stbiw__wp32(o, zlen); 1169 | stbiw__wptag(o, "IDAT"); 1170 | STBIW_MEMMOVE(o, zlib, zlen); 1171 | o += zlen; 1172 | STBIW_FREE(zlib); 1173 | stbiw__wpcrc(&o, zlen); 1174 | 1175 | stbiw__wp32(o,0); 1176 | stbiw__wptag(o, "IEND"); 1177 | stbiw__wpcrc(&o,0); 1178 | 1179 | STBIW_ASSERT(o == out + *out_len); 1180 | 1181 | return out; 1182 | } 1183 | 1184 | #ifndef STBI_WRITE_NO_STDIO 1185 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1186 | { 1187 | FILE *f; 1188 | int len; 1189 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1190 | if (png == NULL) return 0; 1191 | 1192 | f = stbiw__fopen(filename, "wb"); 1193 | if (!f) { STBIW_FREE(png); return 0; } 1194 | fwrite(png, 1, len, f); 1195 | fclose(f); 1196 | STBIW_FREE(png); 1197 | return 1; 1198 | } 1199 | #endif 1200 | 1201 | 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) 1202 | { 1203 | int len; 1204 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1205 | if (png == NULL) return 0; 1206 | func(context, png, len); 1207 | STBIW_FREE(png); 1208 | return 1; 1209 | } 1210 | 1211 | 1212 | /* *************************************************************************** 1213 | * 1214 | * JPEG writer 1215 | * 1216 | * This is based on Jon Olick's jo_jpeg.cpp: 1217 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1218 | */ 1219 | 1220 | 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, 1221 | 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 }; 1222 | 1223 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1224 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1225 | bitCnt += bs[1]; 1226 | bitBuf |= bs[0] << (24 - bitCnt); 1227 | while(bitCnt >= 8) { 1228 | unsigned char c = (bitBuf >> 16) & 255; 1229 | stbiw__putc(s, c); 1230 | if(c == 255) { 1231 | stbiw__putc(s, 0); 1232 | } 1233 | bitBuf <<= 8; 1234 | bitCnt -= 8; 1235 | } 1236 | *bitBufP = bitBuf; 1237 | *bitCntP = bitCnt; 1238 | } 1239 | 1240 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1241 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1242 | float z1, z2, z3, z4, z5, z11, z13; 1243 | 1244 | float tmp0 = d0 + d7; 1245 | float tmp7 = d0 - d7; 1246 | float tmp1 = d1 + d6; 1247 | float tmp6 = d1 - d6; 1248 | float tmp2 = d2 + d5; 1249 | float tmp5 = d2 - d5; 1250 | float tmp3 = d3 + d4; 1251 | float tmp4 = d3 - d4; 1252 | 1253 | // Even part 1254 | float tmp10 = tmp0 + tmp3; // phase 2 1255 | float tmp13 = tmp0 - tmp3; 1256 | float tmp11 = tmp1 + tmp2; 1257 | float tmp12 = tmp1 - tmp2; 1258 | 1259 | d0 = tmp10 + tmp11; // phase 3 1260 | d4 = tmp10 - tmp11; 1261 | 1262 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1263 | d2 = tmp13 + z1; // phase 5 1264 | d6 = tmp13 - z1; 1265 | 1266 | // Odd part 1267 | tmp10 = tmp4 + tmp5; // phase 2 1268 | tmp11 = tmp5 + tmp6; 1269 | tmp12 = tmp6 + tmp7; 1270 | 1271 | // The rotator is modified from fig 4-8 to avoid extra negations. 1272 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1273 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1274 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1275 | z3 = tmp11 * 0.707106781f; // c4 1276 | 1277 | z11 = tmp7 + z3; // phase 5 1278 | z13 = tmp7 - z3; 1279 | 1280 | *d5p = z13 + z2; // phase 6 1281 | *d3p = z13 - z2; 1282 | *d1p = z11 + z4; 1283 | *d7p = z11 - z4; 1284 | 1285 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1286 | } 1287 | 1288 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1289 | int tmp1 = val < 0 ? -val : val; 1290 | val = val < 0 ? val-1 : val; 1291 | bits[1] = 1; 1292 | while(tmp1 >>= 1) { 1293 | ++bits[1]; 1294 | } 1295 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1338 | } 1339 | // end0pos = first element in reverse order !=0 1340 | if(end0pos == 0) { 1341 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1342 | return DU[0]; 1343 | } 1344 | for(i = 1; i <= end0pos; ++i) { 1345 | int startpos = i; 1346 | int nrzeroes; 1347 | unsigned short bits[2]; 1348 | for (; DU[i]==0 && i<=end0pos; ++i) { 1349 | } 1350 | nrzeroes = i-startpos; 1351 | if ( nrzeroes >= 16 ) { 1352 | int lng = nrzeroes>>4; 1353 | int nrmarker; 1354 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1355 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1356 | nrzeroes &= 15; 1357 | } 1358 | stbiw__jpg_calcBits(DU[i], bits); 1359 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1360 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1361 | } 1362 | if(end0pos != 63) { 1363 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1364 | } 1365 | return DU[0]; 1366 | } 1367 | 1368 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1369 | // Constants that don't pollute global namespace 1370 | 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}; 1371 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1372 | 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}; 1373 | static const unsigned char std_ac_luminance_values[] = { 1374 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1375 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1376 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1377 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1378 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1379 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1380 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1381 | }; 1382 | 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}; 1383 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1384 | 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}; 1385 | static const unsigned char std_ac_chrominance_values[] = { 1386 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1387 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1388 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1389 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1390 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1391 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1392 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1393 | }; 1394 | // Huffman tables 1395 | 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}}; 1396 | 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}}; 1397 | static const unsigned short YAC_HT[256][2] = { 1398 | {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}, 1399 | {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}, 1400 | {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}, 1401 | {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}, 1402 | {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}, 1403 | {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}, 1404 | {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}, 1405 | {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}, 1406 | {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}, 1407 | {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}, 1408 | {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}, 1409 | {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}, 1410 | {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}, 1411 | {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}, 1412 | {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}, 1413 | {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} 1414 | }; 1415 | static const unsigned short UVAC_HT[256][2] = { 1416 | {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}, 1417 | {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}, 1418 | {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}, 1419 | {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}, 1420 | {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}, 1421 | {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}, 1422 | {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}, 1423 | {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}, 1424 | {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}, 1425 | {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}, 1426 | {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}, 1427 | {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}, 1428 | {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}, 1429 | {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}, 1430 | {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}, 1431 | {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} 1432 | }; 1433 | 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, 1434 | 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}; 1435 | 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, 1436 | 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}; 1437 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1438 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1439 | 1440 | int row, col, i, k, subsample; 1441 | float fdtbl_Y[64], fdtbl_UV[64]; 1442 | unsigned char YTable[64], UVTable[64]; 1443 | 1444 | if(!data || !width || !height || comp > 4 || comp < 1) { 1445 | return 0; 1446 | } 1447 | 1448 | quality = quality ? quality : 90; 1449 | subsample = quality <= 90 ? 1 : 0; 1450 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1451 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1452 | 1453 | for(i = 0; i < 64; ++i) { 1454 | int uvti, yti = (YQT[i]*quality+50)/100; 1455 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1456 | uvti = (UVQT[i]*quality+50)/100; 1457 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1458 | } 1459 | 1460 | for(row = 0, k = 0; row < 8; ++row) { 1461 | for(col = 0; col < 8; ++col, ++k) { 1462 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1463 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1464 | } 1465 | } 1466 | 1467 | // Write Headers 1468 | { 1469 | 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 }; 1470 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1471 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1472 | 3,1,(unsigned char)(subsample?0x22:0x11),0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1473 | s->func(s->context, (void*)head0, sizeof(head0)); 1474 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1475 | stbiw__putc(s, 1); 1476 | s->func(s->context, UVTable, sizeof(UVTable)); 1477 | s->func(s->context, (void*)head1, sizeof(head1)); 1478 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1479 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1480 | stbiw__putc(s, 0x10); // HTYACinfo 1481 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1482 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1483 | stbiw__putc(s, 1); // HTUDCinfo 1484 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1485 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1486 | stbiw__putc(s, 0x11); // HTUACinfo 1487 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1488 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1489 | s->func(s->context, (void*)head2, sizeof(head2)); 1490 | } 1491 | 1492 | // Encode 8x8 macroblocks 1493 | { 1494 | static const unsigned short fillBits[] = {0x7F, 7}; 1495 | int DCY=0, DCU=0, DCV=0; 1496 | int bitBuf=0, bitCnt=0; 1497 | // comp == 2 is grey+alpha (alpha is ignored) 1498 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1499 | const unsigned char *dataR = (const unsigned char *)data; 1500 | const unsigned char *dataG = dataR + ofsG; 1501 | const unsigned char *dataB = dataR + ofsB; 1502 | int x, y, pos; 1503 | if(subsample) { 1504 | for(y = 0; y < height; y += 16) { 1505 | for(x = 0; x < width; x += 16) { 1506 | float Y[256], U[256], V[256]; 1507 | for(row = y, pos = 0; row < y+16; ++row) { 1508 | // row >= height => use last input row 1509 | int clamped_row = (row < height) ? row : height - 1; 1510 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1511 | for(col = x; col < x+16; ++col, ++pos) { 1512 | // if col >= width => use pixel from last input column 1513 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1514 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1515 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1516 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1517 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1518 | } 1519 | } 1520 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+0, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1521 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+8, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1522 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+128, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1523 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+136, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1524 | 1525 | // subsample U,V 1526 | { 1527 | float subU[64], subV[64]; 1528 | int yy, xx; 1529 | for(yy = 0, pos = 0; yy < 8; ++yy) { 1530 | for(xx = 0; xx < 8; ++xx, ++pos) { 1531 | int j = yy*32+xx*2; 1532 | subU[pos] = (U[j+0] + U[j+1] + U[j+16] + U[j+17]) * 0.25f; 1533 | subV[pos] = (V[j+0] + V[j+1] + V[j+16] + V[j+17]) * 0.25f; 1534 | } 1535 | } 1536 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subU, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1537 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subV, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1538 | } 1539 | } 1540 | } 1541 | } else { 1542 | for(y = 0; y < height; y += 8) { 1543 | for(x = 0; x < width; x += 8) { 1544 | float Y[64], U[64], V[64]; 1545 | for(row = y, pos = 0; row < y+8; ++row) { 1546 | // row >= height => use last input row 1547 | int clamped_row = (row < height) ? row : height - 1; 1548 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1549 | for(col = x; col < x+8; ++col, ++pos) { 1550 | // if col >= width => use pixel from last input column 1551 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1552 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1553 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1554 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1555 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1556 | } 1557 | } 1558 | 1559 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y, 8, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1560 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, U, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1561 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, V, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1562 | } 1563 | } 1564 | } 1565 | 1566 | // Do the bit alignment of the EOI marker 1567 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1568 | } 1569 | 1570 | // EOI 1571 | stbiw__putc(s, 0xFF); 1572 | stbiw__putc(s, 0xD9); 1573 | 1574 | return 1; 1575 | } 1576 | 1577 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1578 | { 1579 | stbi__write_context s = { 0 }; 1580 | stbi__start_write_callbacks(&s, func, context); 1581 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1582 | } 1583 | 1584 | 1585 | #ifndef STBI_WRITE_NO_STDIO 1586 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1587 | { 1588 | stbi__write_context s = { 0 }; 1589 | if (stbi__start_write_file(&s,filename)) { 1590 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1591 | stbi__end_write_file(&s); 1592 | return r; 1593 | } else 1594 | return 0; 1595 | } 1596 | #endif 1597 | 1598 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1599 | 1600 | /* Revision history 1601 | 1.14 (2020-02-02) updated JPEG writer to downsample chroma channels 1602 | 1.13 1603 | 1.12 1604 | 1.11 (2019-08-11) 1605 | 1606 | 1.10 (2019-02-07) 1607 | support utf8 filenames in Windows; fix warnings and platform ifdefs 1608 | 1.09 (2018-02-11) 1609 | fix typo in zlib quality API, improve STB_I_W_STATIC in C++ 1610 | 1.08 (2018-01-29) 1611 | add stbi__flip_vertically_on_write, external zlib, zlib quality, choose PNG filter 1612 | 1.07 (2017-07-24) 1613 | doc fix 1614 | 1.06 (2017-07-23) 1615 | writing JPEG (using Jon Olick's code) 1616 | 1.05 ??? 1617 | 1.04 (2017-03-03) 1618 | monochrome BMP expansion 1619 | 1.03 ??? 1620 | 1.02 (2016-04-02) 1621 | avoid allocating large structures on the stack 1622 | 1.01 (2016-01-16) 1623 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1624 | avoid race-condition in crc initialization 1625 | minor compile issues 1626 | 1.00 (2015-09-14) 1627 | installable file IO function 1628 | 0.99 (2015-09-13) 1629 | warning fixes; TGA rle support 1630 | 0.98 (2015-04-08) 1631 | added STBIW_MALLOC, STBIW_ASSERT etc 1632 | 0.97 (2015-01-18) 1633 | fixed HDR asserts, rewrote HDR rle logic 1634 | 0.96 (2015-01-17) 1635 | add HDR output 1636 | fix monochrome BMP 1637 | 0.95 (2014-08-17) 1638 | add monochrome TGA output 1639 | 0.94 (2014-05-31) 1640 | rename private functions to avoid conflicts with stb_image.h 1641 | 0.93 (2014-05-27) 1642 | warning fixes 1643 | 0.92 (2010-08-01) 1644 | casts to unsigned char to fix warnings 1645 | 0.91 (2010-07-17) 1646 | first public release 1647 | 0.90 first internal release 1648 | */ 1649 | 1650 | /* 1651 | ------------------------------------------------------------------------------ 1652 | This software is available under 2 licenses -- choose whichever you prefer. 1653 | ------------------------------------------------------------------------------ 1654 | ALTERNATIVE A - MIT License 1655 | Copyright (c) 2017 Sean Barrett 1656 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1657 | this software and associated documentation files (the "Software"), to deal in 1658 | the Software without restriction, including without limitation the rights to 1659 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1660 | of the Software, and to permit persons to whom the Software is furnished to do 1661 | so, subject to the following conditions: 1662 | The above copyright notice and this permission notice shall be included in all 1663 | copies or substantial portions of the Software. 1664 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1665 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1666 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1667 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1668 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1669 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1670 | SOFTWARE. 1671 | ------------------------------------------------------------------------------ 1672 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1673 | This is free and unencumbered software released into the public domain. 1674 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1675 | software, either in source code form or as a compiled binary, for any purpose, 1676 | commercial or non-commercial, and by any means. 1677 | In jurisdictions that recognize copyright laws, the author or authors of this 1678 | software dedicate any and all copyright interest in the software to the public 1679 | domain. We make this dedication for the benefit of the public at large and to 1680 | the detriment of our heirs and successors. We intend this dedication to be an 1681 | overt act of relinquishment in perpetuity of all present and future rights to 1682 | this software under copyright law. 1683 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1684 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1685 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1686 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1687 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1688 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1689 | ------------------------------------------------------------------------------ 1690 | */ 1691 | --------------------------------------------------------------------------------