├── CMakeLists.txt ├── LICENSE ├── README.md ├── boilerplate.cpp ├── stb_image_write.h └── tinydream.hpp /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.7) 2 | project(PIXLAB_TINY_DREAM) 3 | set(CMAKE_BUILD_TYPE Release) 4 | set(CMAKE_CXX_STANDARD 17) 5 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -funsafe-math-optimizations -Ofast -flto=auto -funroll-all-loops -pipe -march=native -Wall -Wextra") 6 | 7 | find_package(ncnn REQUIRED) 8 | if (ncnn_FOUND) 9 | message("NCNN inference engine available") 10 | set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${ncnn_C_FLAGS}") 11 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${ncnn_CXX_FLAGS}") 12 | set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${ncnn_EXE_LINKER_FLAGS}") 13 | message(STATUS "ncnn_LIBS: ${ncnn_LIBS}") 14 | message(STATUS "ncnn_INCLUDE_DIRS: ${ncnn_INCLUDE_DIRS}") 15 | else () 16 | message(FATAL_ERROR "NCNN inference engine not found. Please install the library first!") 17 | endif () 18 | 19 | include_directories(${CMAKE_CURRENT_SOURCE_DIR}) 20 | include_directories(${CMAKE_CURRENT_SOURCE_DIR}/include) 21 | include_directories(${CMAKE_CURRENT_SOURCE_DIR}/ncnn/include/ncnn) 22 | link_directories(${CMAKE_CURRENT_SOURCE_DIR}/ncnn/lib) 23 | 24 | set(EXECUTABLE_OUTPUT_PATH ${PROJECT_SOURCE_DIR}/) 25 | add_executable(PIXLAB_TINY_DREAM "boilerplate.cpp" "tinydream.hpp") 26 | target_link_libraries(${PROJECT_NAME} ncnn pthread) 27 | set_target_properties(${PROJECT_NAME} PROPERTIES OUTPUT_NAME "tinydream") 28 | 29 | 30 | 31 | 32 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | /* 2 | * Tiny Dream - Header-Only, Embedded Stable Diffusion Inference Library. 3 | * 4 | * Copyright (C) 2023 PixLab| Symisc Systems. https://pixlab.io/tiny-dream 5 | * Version 1.7.5 6 | * 7 | * Symisc Systems employs a dual licensing model that offers customers 8 | * a choice of either our open source license (GNU Affero AGPLv3) 9 | * or a commercial license. 10 | * 11 | * For information on licensing, redistribution of the Tiny Dream, 12 | * and for a DISCLAIMER OF ALL WARRANTIES please visit: 13 | * https://pixlab.io/tiny-dream#license 14 | * or contact: 15 | * licensing@symisc.net 16 | * support@pixlab.io 17 | */ 18 | /* 19 | * This file is part of Tiny Dream - Open Source Release (GNU Affero AGPLv3) 20 | * 21 | * Tiny Dream is free software : you can redistribute it and/or modify 22 | * it under the terms of the GNU Affero General Public License as published by 23 | * the Free Software Foundation, either version 3 of the License, or 24 | * (at your option) any later version. 25 | * 26 | * Tiny Dream is distributed in the hope that it will be useful, 27 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 28 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.See the 29 | * GNU General Public License for more details. 30 | * 31 | * You should have received a copy of the GNU Affero General Public License 32 | * along with Tiny Dream. If not, see . 33 | */ 34 | 35 | GNU AFFERO GENERAL PUBLIC LICENSE 36 | Version 3, 19 November 2007 37 | 38 | Copyright (C) 2007 Free Software Foundation, Inc. 39 | Everyone is permitted to copy and distribute verbatim copies 40 | of this license document, but changing it is not allowed. 41 | 42 | Preamble 43 | 44 | The GNU Affero General Public License is a free, copyleft license for 45 | software and other kinds of works, specifically designed to ensure 46 | cooperation with the community in the case of network server software. 47 | 48 | The licenses for most software and other practical works are designed 49 | to take away your freedom to share and change the works. By contrast, 50 | our General Public Licenses are intended to guarantee your freedom to 51 | share and change all versions of a program--to make sure it remains free 52 | software for all its users. 53 | 54 | When we speak of free software, we are referring to freedom, not 55 | price. Our General Public Licenses are designed to make sure that you 56 | have the freedom to distribute copies of free software (and charge for 57 | them if you wish), that you receive source code or can get it if you 58 | want it, that you can change the software or use pieces of it in new 59 | free programs, and that you know you can do these things. 60 | 61 | Developers that use our General Public Licenses protect your rights 62 | with two steps: (1) assert copyright on the software, and (2) offer 63 | you this License which gives you legal permission to copy, distribute 64 | and/or modify the software. 65 | 66 | A secondary benefit of defending all users' freedom is that 67 | improvements made in alternate versions of the program, if they 68 | receive widespread use, become available for other developers to 69 | incorporate. Many developers of free software are heartened and 70 | encouraged by the resulting cooperation. However, in the case of 71 | software used on network servers, this result may fail to come about. 72 | The GNU General Public License permits making a modified version and 73 | letting the public access it on a server without ever releasing its 74 | source code to the public. 75 | 76 | The GNU Affero General Public License is designed specifically to 77 | ensure that, in such cases, the modified source code becomes available 78 | to the community. It requires the operator of a network server to 79 | provide the source code of the modified version running there to the 80 | users of that server. Therefore, public use of a modified version, on 81 | a publicly accessible server, gives the public access to the source 82 | code of the modified version. 83 | 84 | An older license, called the Affero General Public License and 85 | published by Affero, was designed to accomplish similar goals. This is 86 | a different license, not a version of the Affero GPL, but Affero has 87 | released a new version of the Affero GPL which permits relicensing under 88 | this license. 89 | 90 | The precise terms and conditions for copying, distribution and 91 | modification follow. 92 | 93 | TERMS AND CONDITIONS 94 | 95 | 0. Definitions. 96 | 97 | "This License" refers to version 3 of the GNU Affero General Public License. 98 | 99 | "Copyright" also means copyright-like laws that apply to other kinds of 100 | works, such as semiconductor masks. 101 | 102 | "The Program" refers to any copyrightable work licensed under this 103 | License. Each licensee is addressed as "you". "Licensees" and 104 | "recipients" may be individuals or organizations. 105 | 106 | To "modify" a work means to copy from or adapt all or part of the work 107 | in a fashion requiring copyright permission, other than the making of an 108 | exact copy. The resulting work is called a "modified version" of the 109 | earlier work or a work "based on" the earlier work. 110 | 111 | A "covered work" means either the unmodified Program or a work based 112 | on the Program. 113 | 114 | To "propagate" a work means to do anything with it that, without 115 | permission, would make you directly or secondarily liable for 116 | infringement under applicable copyright law, except executing it on a 117 | computer or modifying a private copy. Propagation includes copying, 118 | distribution (with or without modification), making available to the 119 | public, and in some countries other activities as well. 120 | 121 | To "convey" a work means any kind of propagation that enables other 122 | parties to make or receive copies. Mere interaction with a user through 123 | a computer network, with no transfer of a copy, is not conveying. 124 | 125 | An interactive user interface displays "Appropriate Legal Notices" 126 | to the extent that it includes a convenient and prominently visible 127 | feature that (1) displays an appropriate copyright notice, and (2) 128 | tells the user that there is no warranty for the work (except to the 129 | extent that warranties are provided), that licensees may convey the 130 | work under this License, and how to view a copy of this License. If 131 | the interface presents a list of user commands or options, such as a 132 | menu, a prominent item in the list meets this criterion. 133 | 134 | 1. Source Code. 135 | 136 | The "source code" for a work means the preferred form of the work 137 | for making modifications to it. "Object code" means any non-source 138 | form of a work. 139 | 140 | A "Standard Interface" means an interface that either is an official 141 | standard defined by a recognized standards body, or, in the case of 142 | interfaces specified for a particular programming language, one that 143 | is widely used among developers working in that language. 144 | 145 | The "System Libraries" of an executable work include anything, other 146 | than the work as a whole, that (a) is included in the normal form of 147 | packaging a Major Component, but which is not part of that Major 148 | Component, and (b) serves only to enable use of the work with that 149 | Major Component, or to implement a Standard Interface for which an 150 | implementation is available to the public in source code form. A 151 | "Major Component", in this context, means a major essential component 152 | (kernel, window system, and so on) of the specific operating system 153 | (if any) on which the executable work runs, or a compiler used to 154 | produce the work, or an object code interpreter used to run it. 155 | 156 | The "Corresponding Source" for a work in object code form means all 157 | the source code needed to generate, install, and (for an executable 158 | work) run the object code and to modify the work, including scripts to 159 | control those activities. However, it does not include the work's 160 | System Libraries, or general-purpose tools or generally available free 161 | programs which are used unmodified in performing those activities but 162 | which are not part of the work. For example, Corresponding Source 163 | includes interface definition files associated with source files for 164 | the work, and the source code for shared libraries and dynamically 165 | linked subprograms that the work is specifically designed to require, 166 | such as by intimate data communication or control flow between those 167 | subprograms and other parts of the work. 168 | 169 | The Corresponding Source need not include anything that users 170 | can regenerate automatically from other parts of the Corresponding 171 | Source. 172 | 173 | The Corresponding Source for a work in source code form is that 174 | same work. 175 | 176 | 2. Basic Permissions. 177 | 178 | All rights granted under this License are granted for the term of 179 | copyright on the Program, and are irrevocable provided the stated 180 | conditions are met. This License explicitly affirms your unlimited 181 | permission to run the unmodified Program. The output from running a 182 | covered work is covered by this License only if the output, given its 183 | content, constitutes a covered work. This License acknowledges your 184 | rights of fair use or other equivalent, as provided by copyright law. 185 | 186 | You may make, run and propagate covered works that you do not 187 | convey, without conditions so long as your license otherwise remains 188 | in force. You may convey covered works to others for the sole purpose 189 | of having them make modifications exclusively for you, or provide you 190 | with facilities for running those works, provided that you comply with 191 | the terms of this License in conveying all material for which you do 192 | not control copyright. Those thus making or running the covered works 193 | for you must do so exclusively on your behalf, under your direction 194 | and control, on terms that prohibit them from making any copies of 195 | your copyrighted material outside their relationship with you. 196 | 197 | Conveying under any other circumstances is permitted solely under 198 | the conditions stated below. Sublicensing is not allowed; section 10 199 | makes it unnecessary. 200 | 201 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 202 | 203 | No covered work shall be deemed part of an effective technological 204 | measure under any applicable law fulfilling obligations under article 205 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 206 | similar laws prohibiting or restricting circumvention of such 207 | measures. 208 | 209 | When you convey a covered work, you waive any legal power to forbid 210 | circumvention of technological measures to the extent such circumvention 211 | is effected by exercising rights under this License with respect to 212 | the covered work, and you disclaim any intention to limit operation or 213 | modification of the work as a means of enforcing, against the work's 214 | users, your or third parties' legal rights to forbid circumvention of 215 | technological measures. 216 | 217 | 4. Conveying Verbatim Copies. 218 | 219 | You may convey verbatim copies of the Program's source code as you 220 | receive it, in any medium, provided that you conspicuously and 221 | appropriately publish on each copy an appropriate copyright notice; 222 | keep intact all notices stating that this License and any 223 | non-permissive terms added in accord with section 7 apply to the code; 224 | keep intact all notices of the absence of any warranty; and give all 225 | recipients a copy of this License along with the Program. 226 | 227 | You may charge any price or no price for each copy that you convey, 228 | and you may offer support or warranty protection for a fee. 229 | 230 | 5. Conveying Modified Source Versions. 231 | 232 | You may convey a work based on the Program, or the modifications to 233 | produce it from the Program, in the form of source code under the 234 | terms of section 4, provided that you also meet all of these conditions: 235 | 236 | a) The work must carry prominent notices stating that you modified 237 | it, and giving a relevant date. 238 | 239 | b) The work must carry prominent notices stating that it is 240 | released under this License and any conditions added under section 241 | 7. This requirement modifies the requirement in section 4 to 242 | "keep intact all notices". 243 | 244 | c) You must license the entire work, as a whole, under this 245 | License to anyone who comes into possession of a copy. This 246 | License will therefore apply, along with any applicable section 7 247 | additional terms, to the whole of the work, and all its parts, 248 | regardless of how they are packaged. This License gives no 249 | permission to license the work in any other way, but it does not 250 | invalidate such permission if you have separately received it. 251 | 252 | d) If the work has interactive user interfaces, each must display 253 | Appropriate Legal Notices; however, if the Program has interactive 254 | interfaces that do not display Appropriate Legal Notices, your 255 | work need not make them do so. 256 | 257 | A compilation of a covered work with other separate and independent 258 | works, which are not by their nature extensions of the covered work, 259 | and which are not combined with it such as to form a larger program, 260 | in or on a volume of a storage or distribution medium, is called an 261 | "aggregate" if the compilation and its resulting copyright are not 262 | used to limit the access or legal rights of the compilation's users 263 | beyond what the individual works permit. Inclusion of a covered work 264 | in an aggregate does not cause this License to apply to the other 265 | parts of the aggregate. 266 | 267 | 6. Conveying Non-Source Forms. 268 | 269 | You may convey a covered work in object code form under the terms 270 | of sections 4 and 5, provided that you also convey the 271 | machine-readable Corresponding Source under the terms of this License, 272 | in one of these ways: 273 | 274 | a) Convey the object code in, or embodied in, a physical product 275 | (including a physical distribution medium), accompanied by the 276 | Corresponding Source fixed on a durable physical medium 277 | customarily used for software interchange. 278 | 279 | b) Convey the object code in, or embodied in, a physical product 280 | (including a physical distribution medium), accompanied by a 281 | written offer, valid for at least three years and valid for as 282 | long as you offer spare parts or customer support for that product 283 | model, to give anyone who possesses the object code either (1) a 284 | copy of the Corresponding Source for all the software in the 285 | product that is covered by this License, on a durable physical 286 | medium customarily used for software interchange, for a price no 287 | more than your reasonable cost of physically performing this 288 | conveying of source, or (2) access to copy the 289 | Corresponding Source from a network server at no charge. 290 | 291 | c) Convey individual copies of the object code with a copy of the 292 | written offer to provide the Corresponding Source. This 293 | alternative is allowed only occasionally and noncommercially, and 294 | only if you received the object code with such an offer, in accord 295 | with subsection 6b. 296 | 297 | d) Convey the object code by offering access from a designated 298 | place (gratis or for a charge), and offer equivalent access to the 299 | Corresponding Source in the same way through the same place at no 300 | further charge. You need not require recipients to copy the 301 | Corresponding Source along with the object code. If the place to 302 | copy the object code is a network server, the Corresponding Source 303 | may be on a different server (operated by you or a third party) 304 | that supports equivalent copying facilities, provided you maintain 305 | clear directions next to the object code saying where to find the 306 | Corresponding Source. Regardless of what server hosts the 307 | Corresponding Source, you remain obligated to ensure that it is 308 | available for as long as needed to satisfy these requirements. 309 | 310 | e) Convey the object code using peer-to-peer transmission, provided 311 | you inform other peers where the object code and Corresponding 312 | Source of the work are being offered to the general public at no 313 | charge under subsection 6d. 314 | 315 | A separable portion of the object code, whose source code is excluded 316 | from the Corresponding Source as a System Library, need not be 317 | included in conveying the object code work. 318 | 319 | A "User Product" is either (1) a "consumer product", which means any 320 | tangible personal property which is normally used for personal, family, 321 | or household purposes, or (2) anything designed or sold for incorporation 322 | into a dwelling. In determining whether a product is a consumer product, 323 | doubtful cases shall be resolved in favor of coverage. For a particular 324 | product received by a particular user, "normally used" refers to a 325 | typical or common use of that class of product, regardless of the status 326 | of the particular user or of the way in which the particular user 327 | actually uses, or expects or is expected to use, the product. A product 328 | is a consumer product regardless of whether the product has substantial 329 | commercial, industrial or non-consumer uses, unless such uses represent 330 | the only significant mode of use of the product. 331 | 332 | "Installation Information" for a User Product means any methods, 333 | procedures, authorization keys, or other information required to install 334 | and execute modified versions of a covered work in that User Product from 335 | a modified version of its Corresponding Source. The information must 336 | suffice to ensure that the continued functioning of the modified object 337 | code is in no case prevented or interfered with solely because 338 | modification has been made. 339 | 340 | If you convey an object code work under this section in, or with, or 341 | specifically for use in, a User Product, and the conveying occurs as 342 | part of a transaction in which the right of possession and use of the 343 | User Product is transferred to the recipient in perpetuity or for a 344 | fixed term (regardless of how the transaction is characterized), the 345 | Corresponding Source conveyed under this section must be accompanied 346 | by the Installation Information. But this requirement does not apply 347 | if neither you nor any third party retains the ability to install 348 | modified object code on the User Product (for example, the work has 349 | been installed in ROM). 350 | 351 | The requirement to provide Installation Information does not include a 352 | requirement to continue to provide support service, warranty, or updates 353 | for a work that has been modified or installed by the recipient, or for 354 | the User Product in which it has been modified or installed. Access to a 355 | network may be denied when the modification itself materially and 356 | adversely affects the operation of the network or violates the rules and 357 | protocols for communication across the network. 358 | 359 | Corresponding Source conveyed, and Installation Information provided, 360 | in accord with this section must be in a format that is publicly 361 | documented (and with an implementation available to the public in 362 | source code form), and must require no special password or key for 363 | unpacking, reading or copying. 364 | 365 | 7. Additional Terms. 366 | 367 | "Additional permissions" are terms that supplement the terms of this 368 | License by making exceptions from one or more of its conditions. 369 | Additional permissions that are applicable to the entire Program shall 370 | be treated as though they were included in this License, to the extent 371 | that they are valid under applicable law. If additional permissions 372 | apply only to part of the Program, that part may be used separately 373 | under those permissions, but the entire Program remains governed by 374 | this License without regard to the additional permissions. 375 | 376 | When you convey a copy of a covered work, you may at your option 377 | remove any additional permissions from that copy, or from any part of 378 | it. (Additional permissions may be written to require their own 379 | removal in certain cases when you modify the work.) You may place 380 | additional permissions on material, added by you to a covered work, 381 | for which you have or can give appropriate copyright permission. 382 | 383 | Notwithstanding any other provision of this License, for material you 384 | add to a covered work, you may (if authorized by the copyright holders of 385 | that material) supplement the terms of this License with terms: 386 | 387 | a) Disclaiming warranty or limiting liability differently from the 388 | terms of sections 15 and 16 of this License; or 389 | 390 | b) Requiring preservation of specified reasonable legal notices or 391 | author attributions in that material or in the Appropriate Legal 392 | Notices displayed by works containing it; or 393 | 394 | c) Prohibiting misrepresentation of the origin of that material, or 395 | requiring that modified versions of such material be marked in 396 | reasonable ways as different from the original version; or 397 | 398 | d) Limiting the use for publicity purposes of names of licensors or 399 | authors of the material; or 400 | 401 | e) Declining to grant rights under trademark law for use of some 402 | trade names, trademarks, or service marks; or 403 | 404 | f) Requiring indemnification of licensors and authors of that 405 | material by anyone who conveys the material (or modified versions of 406 | it) with contractual assumptions of liability to the recipient, for 407 | any liability that these contractual assumptions directly impose on 408 | those licensors and authors. 409 | 410 | All other non-permissive additional terms are considered "further 411 | restrictions" within the meaning of section 10. If the Program as you 412 | received it, or any part of it, contains a notice stating that it is 413 | governed by this License along with a term that is a further 414 | restriction, you may remove that term. If a license document contains 415 | a further restriction but permits relicensing or conveying under this 416 | License, you may add to a covered work material governed by the terms 417 | of that license document, provided that the further restriction does 418 | not survive such relicensing or conveying. 419 | 420 | If you add terms to a covered work in accord with this section, you 421 | must place, in the relevant source files, a statement of the 422 | additional terms that apply to those files, or a notice indicating 423 | where to find the applicable terms. 424 | 425 | Additional terms, permissive or non-permissive, may be stated in the 426 | form of a separately written license, or stated as exceptions; 427 | the above requirements apply either way. 428 | 429 | 8. Termination. 430 | 431 | You may not propagate or modify a covered work except as expressly 432 | provided under this License. Any attempt otherwise to propagate or 433 | modify it is void, and will automatically terminate your rights under 434 | this License (including any patent licenses granted under the third 435 | paragraph of section 11). 436 | 437 | However, if you cease all violation of this License, then your 438 | license from a particular copyright holder is reinstated (a) 439 | provisionally, unless and until the copyright holder explicitly and 440 | finally terminates your license, and (b) permanently, if the copyright 441 | holder fails to notify you of the violation by some reasonable means 442 | prior to 60 days after the cessation. 443 | 444 | Moreover, your license from a particular copyright holder is 445 | reinstated permanently if the copyright holder notifies you of the 446 | violation by some reasonable means, this is the first time you have 447 | received notice of violation of this License (for any work) from that 448 | copyright holder, and you cure the violation prior to 30 days after 449 | your receipt of the notice. 450 | 451 | Termination of your rights under this section does not terminate the 452 | licenses of parties who have received copies or rights from you under 453 | this License. If your rights have been terminated and not permanently 454 | reinstated, you do not qualify to receive new licenses for the same 455 | material under section 10. 456 | 457 | 9. Acceptance Not Required for Having Copies. 458 | 459 | You are not required to accept this License in order to receive or 460 | run a copy of the Program. Ancillary propagation of a covered work 461 | occurring solely as a consequence of using peer-to-peer transmission 462 | to receive a copy likewise does not require acceptance. However, 463 | nothing other than this License grants you permission to propagate or 464 | modify any covered work. These actions infringe copyright if you do 465 | not accept this License. Therefore, by modifying or propagating a 466 | covered work, you indicate your acceptance of this License to do so. 467 | 468 | 10. Automatic Licensing of Downstream Recipients. 469 | 470 | Each time you convey a covered work, the recipient automatically 471 | receives a license from the original licensors, to run, modify and 472 | propagate that work, subject to this License. You are not responsible 473 | for enforcing compliance by third parties with this License. 474 | 475 | An "entity transaction" is a transaction transferring control of an 476 | organization, or substantially all assets of one, or subdividing an 477 | organization, or merging organizations. If propagation of a covered 478 | work results from an entity transaction, each party to that 479 | transaction who receives a copy of the work also receives whatever 480 | licenses to the work the party's predecessor in interest had or could 481 | give under the previous paragraph, plus a right to possession of the 482 | Corresponding Source of the work from the predecessor in interest, if 483 | the predecessor has it or can get it with reasonable efforts. 484 | 485 | You may not impose any further restrictions on the exercise of the 486 | rights granted or affirmed under this License. For example, you may 487 | not impose a license fee, royalty, or other charge for exercise of 488 | rights granted under this License, and you may not initiate litigation 489 | (including a cross-claim or counterclaim in a lawsuit) alleging that 490 | any patent claim is infringed by making, using, selling, offering for 491 | sale, or importing the Program or any portion of it. 492 | 493 | 11. Patents. 494 | 495 | A "contributor" is a copyright holder who authorizes use under this 496 | License of the Program or a work on which the Program is based. The 497 | work thus licensed is called the contributor's "contributor version". 498 | 499 | A contributor's "essential patent claims" are all patent claims 500 | owned or controlled by the contributor, whether already acquired or 501 | hereafter acquired, that would be infringed by some manner, permitted 502 | by this License, of making, using, or selling its contributor version, 503 | but do not include claims that would be infringed only as a 504 | consequence of further modification of the contributor version. For 505 | purposes of this definition, "control" includes the right to grant 506 | patent sublicenses in a manner consistent with the requirements of 507 | this License. 508 | 509 | Each contributor grants you a non-exclusive, worldwide, royalty-free 510 | patent license under the contributor's essential patent claims, to 511 | make, use, sell, offer for sale, import and otherwise run, modify and 512 | propagate the contents of its contributor version. 513 | 514 | In the following three paragraphs, a "patent license" is any express 515 | agreement or commitment, however denominated, not to enforce a patent 516 | (such as an express permission to practice a patent or covenant not to 517 | sue for patent infringement). To "grant" such a patent license to a 518 | party means to make such an agreement or commitment not to enforce a 519 | patent against the party. 520 | 521 | If you convey a covered work, knowingly relying on a patent license, 522 | and the Corresponding Source of the work is not available for anyone 523 | to copy, free of charge and under the terms of this License, through a 524 | publicly available network server or other readily accessible means, 525 | then you must either (1) cause the Corresponding Source to be so 526 | available, or (2) arrange to deprive yourself of the benefit of the 527 | patent license for this particular work, or (3) arrange, in a manner 528 | consistent with the requirements of this License, to extend the patent 529 | license to downstream recipients. "Knowingly relying" means you have 530 | actual knowledge that, but for the patent license, your conveying the 531 | covered work in a country, or your recipient's use of the covered work 532 | in a country, would infringe one or more identifiable patents in that 533 | country that you have reason to believe are valid. 534 | 535 | If, pursuant to or in connection with a single transaction or 536 | arrangement, you convey, or propagate by procuring conveyance of, a 537 | covered work, and grant a patent license to some of the parties 538 | receiving the covered work authorizing them to use, propagate, modify 539 | or convey a specific copy of the covered work, then the patent license 540 | you grant is automatically extended to all recipients of the covered 541 | work and works based on it. 542 | 543 | A patent license is "discriminatory" if it does not include within 544 | the scope of its coverage, prohibits the exercise of, or is 545 | conditioned on the non-exercise of one or more of the rights that are 546 | specifically granted under this License. You may not convey a covered 547 | work if you are a party to an arrangement with a third party that is 548 | in the business of distributing software, under which you make payment 549 | to the third party based on the extent of your activity of conveying 550 | the work, and under which the third party grants, to any of the 551 | parties who would receive the covered work from you, a discriminatory 552 | patent license (a) in connection with copies of the covered work 553 | conveyed by you (or copies made from those copies), or (b) primarily 554 | for and in connection with specific products or compilations that 555 | contain the covered work, unless you entered into that arrangement, 556 | or that patent license was granted, prior to 28 March 2007. 557 | 558 | Nothing in this License shall be construed as excluding or limiting 559 | any implied license or other defenses to infringement that may 560 | otherwise be available to you under applicable patent law. 561 | 562 | 12. No Surrender of Others' Freedom. 563 | 564 | If conditions are imposed on you (whether by court order, agreement or 565 | otherwise) that contradict the conditions of this License, they do not 566 | excuse you from the conditions of this License. If you cannot convey a 567 | covered work so as to satisfy simultaneously your obligations under this 568 | License and any other pertinent obligations, then as a consequence you may 569 | not convey it at all. For example, if you agree to terms that obligate you 570 | to collect a royalty for further conveying from those to whom you convey 571 | the Program, the only way you could satisfy both those terms and this 572 | License would be to refrain entirely from conveying the Program. 573 | 574 | 13. Remote Network Interaction; Use with the GNU General Public License. 575 | 576 | Notwithstanding any other provision of this License, if you modify the 577 | Program, your modified version must prominently offer all users 578 | interacting with it remotely through a computer network (if your version 579 | supports such interaction) an opportunity to receive the Corresponding 580 | Source of your version by providing access to the Corresponding Source 581 | from a network server at no charge, through some standard or customary 582 | means of facilitating copying of software. This Corresponding Source 583 | shall include the Corresponding Source for any work covered by version 3 584 | of the GNU General Public License that is incorporated pursuant to the 585 | following paragraph. 586 | 587 | Notwithstanding any other provision of this License, you have 588 | permission to link or combine any covered work with a work licensed 589 | under version 3 of the GNU General Public License into a single 590 | combined work, and to convey the resulting work. The terms of this 591 | License will continue to apply to the part which is the covered work, 592 | but the work with which it is combined will remain governed by version 593 | 3 of the GNU General Public License. 594 | 595 | 14. Revised Versions of this License. 596 | 597 | The Free Software Foundation may publish revised and/or new versions of 598 | the GNU Affero General Public License from time to time. Such new versions 599 | will be similar in spirit to the present version, but may differ in detail to 600 | address new problems or concerns. 601 | 602 | Each version is given a distinguishing version number. If the 603 | Program specifies that a certain numbered version of the GNU Affero General 604 | Public License "or any later version" applies to it, you have the 605 | option of following the terms and conditions either of that numbered 606 | version or of any later version published by the Free Software 607 | Foundation. If the Program does not specify a version number of the 608 | GNU Affero General Public License, you may choose any version ever published 609 | by the Free Software Foundation. 610 | 611 | If the Program specifies that a proxy can decide which future 612 | versions of the GNU Affero General Public License can be used, that proxy's 613 | public statement of acceptance of a version permanently authorizes you 614 | to choose that version for the Program. 615 | 616 | Later license versions may give you additional or different 617 | permissions. However, no additional obligations are imposed on any 618 | author or copyright holder as a result of your choosing to follow a 619 | later version. 620 | 621 | 15. Disclaimer of Warranty. 622 | 623 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 624 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 625 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 626 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 627 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 628 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 629 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 630 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 631 | 632 | 16. Limitation of Liability. 633 | 634 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 635 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 636 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 637 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 638 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 639 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 640 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 641 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 642 | SUCH DAMAGES. 643 | 644 | 17. Interpretation of Sections 15 and 16. 645 | 646 | If the disclaimer of warranty and limitation of liability provided 647 | above cannot be given local legal effect according to their terms, 648 | reviewing courts shall apply local law that most closely approximates 649 | an absolute waiver of all civil liability in connection with the 650 | Program, unless a warranty or assumption of liability accompanies a 651 | copy of the Program in return for a fee. 652 | 653 | END OF TERMS AND CONDITIONS 654 | 655 | How to Apply These Terms to Your New Programs 656 | 657 | If you develop a new program, and you want it to be of the greatest 658 | possible use to the public, the best way to achieve this is to make it 659 | free software which everyone can redistribute and change under these terms. 660 | 661 | To do so, attach the following notices to the program. It is safest 662 | to attach them to the start of each source file to most effectively 663 | state the exclusion of warranty; and each file should have at least 664 | the "copyright" line and a pointer to where the full notice is found. 665 | 666 | 667 | Copyright (C) 668 | 669 | This program is free software: you can redistribute it and/or modify 670 | it under the terms of the GNU Affero General Public License as published 671 | by the Free Software Foundation, either version 3 of the License, or 672 | (at your option) any later version. 673 | 674 | This program is distributed in the hope that it will be useful, 675 | but WITHOUT ANY WARRANTY; without even the implied warranty of 676 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 677 | GNU Affero General Public License for more details. 678 | 679 | You should have received a copy of the GNU Affero General Public License 680 | along with this program. If not, see . 681 | 682 | Also add information on how to contact you by electronic and paper mail. 683 | 684 | If your software can interact with users remotely through a computer 685 | network, you should also make sure that it provides a way for users to 686 | get its source. For example, if your program is a web application, its 687 | interface could display a "Source" link that leads users to an archive 688 | of the code. There are many ways you could offer source, and different 689 | solutions will be better for different programs; see section 13 for the 690 | specific requirements. 691 | 692 | You should also get your employer (if you work as a programmer) or school, 693 | if any, to sign a "copyright disclaimer" for the program, if necessary. 694 | For more information on this, and how to apply and follow the GNU AGPL, see 695 | . 696 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 |

TINY DREAM

An embedded, Header Only, Stable Diffusion Inference C++ Library
pixlab.io/tiny-dream

2 | 3 | ![td_screen_website](https://github.com/symisc/tiny-dream/assets/4615920/b4e9f6b3-4019-4d48-9e3e-879a071213a5) 4 | 5 |
Latest News 🔥
6 | 9 | 10 | [![API documentation](https://img.shields.io/badge/API%20documentation-Ready-green.svg)](https://pixlab.io/tiny-dream) 11 | [![dependency](https://img.shields.io/badge/dependency-none-ff96b4.svg)](https://pixlab.io/tiny-dream#downloads) 12 | [![license](https://img.shields.io/badge/License-dual--licensed-blue.svg)](https://pixlab.io/tiny-dream#license) 13 | 14 | * [Introduction](#tiny-dream) 15 | * [Features](#td-features) 16 | * [Getting Started](#td-start) 17 | * [Downloads](https://pixlab.io/tiny-dream#downloads) 18 | * [Project Roadmap](#roadmap) 19 | * [License](https://pixlab.io/tiny-dream#license) 20 | * [C++ API Reference Guide](https://pixlab.io/tiny-dream#cpp-api) 21 | * [Issues Tracker](https://github.com/symisc/tiny-dream/issues) 22 | * [Related Projects](#td-projects) 23 | 24 |

Introducing PixLab's Tiny Dream

25 |

Tiny Dream is a header only, dependency free, partially uncensored, Stable Diffusion implementation written in C++ with primary focus on CPU efficiency, and smaller memory footprint. Tiny Dream runs reasonably fast on the average consumer hardware, require only 1.7 ~ 5.5 GB of RAM to execute, does not enforce Nvidia GPUs presence, and is designed to be embedded on larger codebases (host programs) with an easy to use C++ API. The possibilities are literally endless, or at least extend to the boundaries of Stable Diffusion's latent manifold.

26 |

Features 🔥

27 | For the extensive list of features, please refer to the official documentation here. 28 |

29 | 39 |

Getting Started with Tiny-Dream 🔥

40 |

Integrating Tiny Dream on your existing code base is straightforward. Here is what to do without having to do a lot of tedious reading and configuration:

41 |

Download Tiny-Dream

42 |
    43 |
  • Download the latest public release of Tiny Dream, and extract the package on a directory of your choice.
  • 44 |
  • Refer to the downloads section to get a copy of the Tiny Dream source code as well as the Pre-Trained Models & Assets.
  • 45 |
46 |

Embedding Tiny-Dream

47 |
    48 |
  • The Tiny Dream source code comprise only two header files that is tinydream.hpp and stb_image_write.h.
  • 49 |
  • All you have to do is drop these two C/C++ header files on your source tree, and instantiate a new tinyDream object as shown on the pseudo C++ code below:
  • 50 |
51 | 52 | ``` 53 | #include "tinydream.hpp" 54 | /* 55 | * Main Entry Point. The only required argument is the Positive Prompt. 56 | * Passing a Negative Prompt (words separated by commas) is highly recommended though. 57 | * 58 | * We recommend that you experiment with different seed & step values 59 | * in order to achieve a desirable result. 60 | * 61 | * ./tinydream "positive prompt" ["negative prompt"] [seed] [step] 62 | */ 63 | int main(int argc, char *argv[]) 64 | { 65 | tinyDream td; // stack allocated tinyDream object 66 | 67 | // Display the library current inference engine, version number, and copyright notice 68 | std::cout << tinyDream::about() << std::endl; 69 | 70 | // At least a positive prompt must be supplied via command line 71 | if (argc < 2) { 72 | std::cout << "Missing Positive (and potentially Negative) Prompt: Describe something you'd like to see generated..." << std::endl; 73 | std::cout << "Example of Prompts:" << std::endl; 74 | // Example of built-in Positive/Negative Prompts 75 | auto prompts = tinyDream::promptExample(); 76 | std::cout << "\tPositive Prompt: " << prompts.first << std::endl; 77 | std::cout << "\tNegative Prompt: " << prompts.second << std::endl; 78 | return -1; 79 | } 80 | 81 | // Register a log handler callback responsible of 82 | // consuming log messages generated during inference. 83 | td.setLogCallback(logCallback, nullptr); 84 | 85 | // Optionally, set the assets path if the pre-trained models 86 | // are not extracted on the same directory as your executable 87 | // The Tiny-Dream assets can be downloaded from: https://pixlab.io/tiny-dream#downloads 88 | td.setAssetsPath("/path/to/tinydream/assets"); // Remove or comment this if your assets are located on the same directory as your executable 89 | 90 | // Optionally, set a prefix of your choice to each freshly generated image name 91 | td.setImageOutputPrefix("tinydream-"); 92 | 93 | // Optionally, set the directory where you want 94 | // the generated images to be stored 95 | td.setImageOutputPath("/home/photos/"); 96 | 97 | int seedMax = 90; 98 | if (argc > 3) { 99 | /* 100 | * Seed in Stable Diffusion is a number used to initialize the generation. 101 | * Controlling the seed can help you generate reproducible images, experiment 102 | * with other parameters, or prompt variations. 103 | */ 104 | seedMax = std::atoi(argv[3]); 105 | } 106 | int step = 30; 107 | if (argc > 4) { 108 | /* 109 | * adjusting the inference steps in Stable Diffusion: The more steps you use, 110 | * the better quality you'll achieve but you shouldn't set steps as high 111 | * as possible. Around 30 sampling steps (default value) are usually enough 112 | * to achieve high-quality images. 113 | */ 114 | step = std::atoi(argv[4]); 115 | } 116 | 117 | /* 118 | * User Supplied Prompts - Generate an image that matches the input criteria. 119 | * 120 | * Positive Prompt (required): Describe something you'd like to see generated (comma separated words). 121 | * Negative Prompt (optional): Describe something you don't like to see generated (comma separated words). 122 | */ 123 | std::string positivePrompt{ argv[1] }; 124 | std::string negativePrompt{ "" }; 125 | if (argc > 2) { 126 | negativePrompt = std::string{ argv[2] }; 127 | } 128 | 129 | /* 130 | * Finally, run Stable Diffusion in inference 131 | * 132 | * The supplied log consumer callback registered previously should shortly receive 133 | * all generated log messages (including errors if any) during inference. 134 | * 135 | * Refer to the official documentation at: https://pixlab.io/tiny-dream#tiny-dream-method 136 | * for the expected parameters the tinyDream::dream() method takes. 137 | */ 138 | for (int seed = 1; seed < seedMax; seed++) { 139 | std::string outputImagePath; 140 | 141 | td.dream( 142 | positivePrompt, 143 | negativePrompt, 144 | outputImagePath, 145 | true, /* Set to false if you want 512x512 pixels output instead of 2048x2048 output */ 146 | seed, 147 | step 148 | ); 149 | 150 | // You do not need to display the generated image path manually each time via std::cout 151 | // as the supplied log callback should have already done that. 152 | std::cout << "Output Image location: " << outputImagePath << std::endl; // uncomment this if too intrusive 153 | } 154 | return 0; 155 | } 156 | ``` 157 |

Learn the Fundamentals (C++ API)

158 | 174 |

Building Tiny-Dream

175 |
    176 |
  • Building Tiny-Dream from source require a modern C++17 compiler such as GCC 7 or later, Clang or Microsoft Visual Studio (MSVC).
  • 177 |
  • You also need to link to the default backend Tensor library in order to generate the executable.
  • 178 |
  • As of this release, NCNN is the default tensor library. On our Roadmap, we plan to ditch ncnn to a less bloated tensor library such as SOD or GGML with focus on CPU efficiency.
  • 179 |
  • Alternatively, you can rely on a build manager such as CMAKE to build the executable for you. The Tiny-Dream repository repository already contain the necessarily CMAKE template to build the executable from source.
  • 180 |
  • An example of generating a heavy optimized executable without relying on a external build manager is shown just below:
  • 181 |
182 | 183 | ``` 184 | git clone https://github.com/symisc/tiny-dream.git 185 | cd tiny-dream 186 | g++ -o tinydream boilerplate.cpp -funsafe-math-optimizations -Ofast -flto=auto -funroll-all-loops -pipe -march=native -std=c++17 -Wall -Wextra `pkg-config --cflags --libs ncnn` -lstdc++ -pthread -Wl -flto -fopt-info-vec-optimized 187 | ./tinydream "pyramid, desert, palm trees, river, (landscape), (high quality)" 188 | ``` 189 |

Get the Pre-Trained Models & Assets

190 |
    191 |
  • Once your executable built, you will need the Tiny Dream Pre-Trained Models & Assets path accessible to your executable.
  • 192 |
  • The Tiny Dream assets comprise all pre-trained models (over 2GB as of this release) required by the tinyDream::dream() method in order to run stable diffusion in inference.
  • 193 |
  • You can download the pre-trained models from the Download section on the PixLab website.
  • 194 |
  • Once downloaded, extract the assets ZIP archive in a directory of your choice (usually the directory where your executable is located), and set the full path via tinyDream::setAssetsPath() or from the Tiny Dream constructor.
  • 195 |
196 |

Continue with The C++ API Reference Guide

197 |

The Tiny Dream C++ Interface, provides detailed specifications for all of the various methods the Tiny Dream class exports. Once the reader understands the basic principles of operation for Tiny Dream, that document should serve as a reference guide.

198 |

TODOs & Roadmap 🔥

199 |

As we continue to develop and improve Tiny Dream, we have an exciting roadmap of future addons and enhancements planned. Refer to the Roadmap page at pixlab.io/tiny-dream or the PixLab Blog for the exhaustive list of todos & ongoing progress...

200 |
    201 |
  • Move the Tensor library to a non bloated one such as SOD or GGML with focus on CPU performance.
  • 202 |
  • Provide a Cross-Platform GUI to Tiny Dream implemented in Dear imGUI.
  • 203 |
  • Provide a Web-Assembly port to the library once the future Tensor library (SOD or GGML) ported to WASM.
  • 204 |
  • Output SVG, and easy to alter formats (potentially PSD) rather than static PNGs.
  • 205 |
  • Provide an Android, proof of concept, show-case APK.
  • 206 |
207 |

Official Docs & Resources

208 | 209 | 210 | 211 | 212 | 214 | 215 | 216 | 217 | 218 | 219 |
Pre-Trained Models & Assets DownloadsGetting Started Guide 213 | LicensingC++ API Reference GuideProject RoadmapFeatures
220 |

Related Projects 🔥

221 |

You may find useful the following production-ready projects developed & maintained by PixLab | Symisc Systems:

222 |
    223 |
  • SOD - An Embedded, Dependency-Free, Computer Vision C/C++ Library.
  • 224 |
  • FACEIO - Cross Browser, Passwordless Facial Authentication Framework.
  • 225 |
  • PixLab Annotate - Online Image Annotation, Labeling & Segmentation Tool.
  • 226 |
  • ASCII Art - Real-Time ASCII Art Rendering C Library.
  • 227 |
  • UnQLite - An Embedded, Transactional Key/Value Database Engine.
  • 228 |
229 | -------------------------------------------------------------------------------- /boilerplate.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * Tiny Dream Integration Boilerplate. 3 | * 4 | * Compile this file together with the Tiny Dream header (tinydream.hpp) to generate 5 | * the executable. Example of heavy optimized compilation under g++: 6 | * 7 | * g++ -o tinydream boileplate.cpp -funsafe-math-optimizations -Ofast -flto=auto -funroll-all-loops -pipe -march=native -std=c++17 -Wall -Wextra `pkg-config --cflags --libs ncnn` -lstdc++ -pthread -Wl -flto -fopt-info-vec-optimized 8 | * 9 | * To run the program simply type: 10 | * 11 | * ./tinydream "pyramid, desert, palm trees, river, (landscape), (high quality)" 12 | * 13 | * Under Microsoft Visual Studio (>= 2019), just drop `tinydream.hpp` on your source 14 | * tree and you're done. 15 | * 16 | * Do not forget to link to the current backend tensor library (TINY_DREAM_INFERENCE_ENGINE). 17 | * You will need to Pre-trained Models from https://pixlab.io/tiny-dream#downloads in order 18 | * to start generating images (Stable Diffusion Inference). 19 | * 20 | * If you have any trouble integrating Tiny-Dream on your project, please submit a support 21 | * ticket at: https://pixlab.io/tiny-dream 22 | */ 23 | /* 24 | * This simple program is a quick introduction on how to embed 25 | * and start experimenting with Tiny Dream (Stable Diffusion inference) 26 | * without having to do a lot of tedious reading and configuration. 27 | * 28 | * Make sure you have the latest release of Tiny-Dream 29 | * plus the Pre-Trained Models from: 30 | * 31 | * https://pixlab.io/tiny-dream#downloads 32 | * 33 | * The Tiny Dream C++ documentation is available to consult on: 34 | * https://pixlab.io/tiny-dream 35 | * https://github.com/symisc/tiny-dream 36 | */ 37 | #include "tinydream.hpp" 38 | #include 39 | /* 40 | * Register a log consumer callback first 41 | * 42 | * The main task of the supplied callback is to consume log messages 43 | * generated during Stable Diffusion inference. 44 | * Inference may take some time to execute depending on the available 45 | * resources so it make sense to log everything to the terminal or 46 | * text file for example. 47 | * 48 | * The supplied callback must have the following signature: 49 | * void(const char *zLogMsg,int msgLen void *pUserData) 50 | * 51 | * Refer to the setLogCallback() API documentation at: https://pixlab.io/tiny-dream#set-log-callback 52 | * for additional information. 53 | */ 54 | #if defined (_WIN32) || defined(_WIN64) || defined (_MSC_VER) 55 | #include 56 | #define TD_WIN 57 | #else 58 | /* Assume POSIX compatible */ 59 | #include 60 | #endif 61 | void logCallback(const char* zLogMsg, int msgLen, [[maybe_unused]] void* pCookie) 62 | { 63 | // All this log consumer callback does, is just redirecting 64 | // the generated log messages by the inference engine 65 | // to the default standard output (STDOUT) 66 | #ifdef TD_WIN 67 | WriteFile(GetStdHandle(STD_OUTPUT_HANDLE), static_cast(zLogMsg), static_cast(msgLen), 0, 0); 68 | #else 69 | write(STDOUT_FILENO, static_cast(zLogMsg), static_cast(msgLen)); 70 | #endif /* __WINT__ */ 71 | } 72 | /* 73 | * Main Entry Point. The only required argument is the Positive Prompt. 74 | * Passing a Negative Prompt (words separated by commas) is highly recommended though. 75 | * 76 | * We recommend that you experiment with different seed & step values 77 | * in order to achieve a desirable result. 78 | * 79 | * ./tinydream "positive prompt" ["negative prompt"] [seed] [step] 80 | */ 81 | int main(int argc, char *argv[]) 82 | { 83 | tinyDream td; // stack allocated tinyDream object 84 | 85 | // Display the library current inference engine, version number, and copyright notice 86 | std::cout << tinyDream::about() << std::endl; 87 | 88 | // At least a positive prompt must be supplied via command line 89 | if (argc < 2) { 90 | std::cout << "Missing Positive (and potentially Negative) Prompt: Describe something you'd like to see generated..." << std::endl; 91 | std::cout << "Example of Prompts:" << std::endl; 92 | // Example of built-in Positive/Negative Prompts 93 | auto prompts = tinyDream::promptExample(); 94 | std::cout << "\tPositive Prompt: " << prompts.first << std::endl; 95 | std::cout << "\tNegative Prompt: " << prompts.second << std::endl; 96 | return -1; 97 | } 98 | 99 | // Register a log handler callback responsible of 100 | // consuming log messages generated during inference. 101 | td.setLogCallback(logCallback, nullptr); 102 | 103 | // Optionally, set the assets path if the pre-trained models 104 | // are not extracted on the same directory as your executable 105 | // The Tiny-Dream assets can be downloaded from: https://pixlab.io/tiny-dream#downloads 106 | td.setAssetsPath("/path/to/tinydream/assets"); // Remove or comment this if your assets are located on the same directory as your executable 107 | 108 | // Optionally, set a prefix of your choice to each freshly generated image name 109 | // td.setImageOutputPrefix("tinydream-"); 110 | 111 | // Optionally, set the directory where you want 112 | // the generated images to be stored 113 | //td.setImageOutputPath("/home/photos/"); 114 | 115 | int seedMax = 90; 116 | if (argc > 3) { 117 | /* 118 | * Seed in Stable Diffusion is a number used to initialize the generation. 119 | * Controlling the seed can help you generate reproducible images, experiment 120 | * with other parameters, or prompt variations. 121 | */ 122 | seedMax = std::atoi(argv[3]); 123 | } 124 | int step = 30; 125 | if (argc > 4) { 126 | /* 127 | * adjusting the inference steps in Stable Diffusion: The more steps you use, 128 | * the better quality you'll achieve but you shouldn't set steps as high 129 | * as possible. Around 30 sampling steps (default value) are usually enough 130 | * to achieve high-quality images. 131 | */ 132 | step = std::atoi(argv[4]); 133 | } 134 | 135 | /* 136 | * User Supplied Prompts - Generate an image that matches the input criteria. 137 | * 138 | * Positive Prompt (required): Describe something you'd like to see generated (comma separated words). 139 | * Negative Prompt (optional): Describe something you don't like to see generated (comma separated words). 140 | */ 141 | std::string positivePrompt{ argv[1] }; 142 | std::string negativePrompt{ "" }; 143 | if (argc > 2) { 144 | negativePrompt = std::string{ argv[2] }; 145 | } 146 | 147 | /* 148 | * Finally, run Stable Diffusion in inference 149 | * 150 | * The supplied log consumer callback registered previously should shortly receive 151 | * all generated log messages (including errors if any) during inference. 152 | * 153 | * Refer to the official documentation at: https://pixlab.io/tiny-dream#tiny-dream-method 154 | * for the expected parameters the tinyDream::dream() method takes. 155 | */ 156 | for (int seed = 1; seed < seedMax; seed++) { 157 | std::string outputImagePath; 158 | 159 | td.dream( 160 | positivePrompt, 161 | negativePrompt, 162 | outputImagePath, 163 | true, /* Set to false if you want 512x512 pixels output instead of 2048x2048 output */ 164 | seed, 165 | step 166 | ); 167 | 168 | // You do not need to display the generated image path manually each time via std::cout 169 | // as the supplied log callback should have already done that. 170 | std::cout << "Output Image location: " << outputImagePath << std::endl; // uncomment this if too intrusive 171 | } 172 | return 0; 173 | } -------------------------------------------------------------------------------- /stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.16 - 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 | Andrew Kensler 144 | 145 | LICENSE 146 | 147 | See end of file for license information. 148 | 149 | */ 150 | 151 | #ifndef INCLUDE_STB_IMAGE_WRITE_H 152 | #define INCLUDE_STB_IMAGE_WRITE_H 153 | 154 | #include 155 | 156 | // if STB_IMAGE_WRITE_STATIC causes problems, try defining STBIWDEF to 'inline' or 'static inline' 157 | #ifndef STBIWDEF 158 | #ifdef STB_IMAGE_WRITE_STATIC 159 | #define STBIWDEF static 160 | #else 161 | #ifdef __cplusplus 162 | #define STBIWDEF extern "C" 163 | #else 164 | #define STBIWDEF extern 165 | #endif 166 | #endif 167 | #endif 168 | 169 | #ifndef STB_IMAGE_WRITE_STATIC // C++ forbids static forward declarations 170 | STBIWDEF int stbi_write_tga_with_rle; 171 | STBIWDEF int stbi_write_png_compression_level; 172 | STBIWDEF int stbi_write_force_png_filter; 173 | #endif 174 | 175 | #ifndef STBI_WRITE_NO_STDIO 176 | STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 177 | STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 178 | STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 179 | STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 180 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); 181 | 182 | #ifdef STBIW_WINDOWS_UTF8 183 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input); 184 | #endif 185 | #endif 186 | 187 | typedef void stbi_write_func(void *context, void *data, int size); 188 | 189 | 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); 190 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 191 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 192 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 193 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 194 | 195 | STBIWDEF void stbi_flip_vertically_on_write(int flip_boolean); 196 | 197 | #endif//INCLUDE_STB_IMAGE_WRITE_H 198 | 199 | #ifdef STB_IMAGE_WRITE_IMPLEMENTATION 200 | 201 | #ifdef _WIN32 202 | #ifndef _CRT_SECURE_NO_WARNINGS 203 | #define _CRT_SECURE_NO_WARNINGS 204 | #endif 205 | #ifndef _CRT_NONSTDC_NO_DEPRECATE 206 | #define _CRT_NONSTDC_NO_DEPRECATE 207 | #endif 208 | #endif 209 | 210 | #ifndef STBI_WRITE_NO_STDIO 211 | #include 212 | #endif // STBI_WRITE_NO_STDIO 213 | 214 | #include 215 | #include 216 | #include 217 | #include 218 | 219 | #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) 220 | // ok 221 | #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) 222 | // ok 223 | #else 224 | #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." 225 | #endif 226 | 227 | #ifndef STBIW_MALLOC 228 | #define STBIW_MALLOC(sz) malloc(sz) 229 | #define STBIW_REALLOC(p,newsz) realloc(p,newsz) 230 | #define STBIW_FREE(p) free(p) 231 | #endif 232 | 233 | #ifndef STBIW_REALLOC_SIZED 234 | #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) 235 | #endif 236 | 237 | 238 | #ifndef STBIW_MEMMOVE 239 | #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) 240 | #endif 241 | 242 | 243 | #ifndef STBIW_ASSERT 244 | #include 245 | #define STBIW_ASSERT(x) assert(x) 246 | #endif 247 | 248 | #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) 249 | 250 | #ifdef STB_IMAGE_WRITE_STATIC 251 | static int stbi_write_png_compression_level = 8; 252 | static int stbi_write_tga_with_rle = 1; 253 | static int stbi_write_force_png_filter = -1; 254 | #else 255 | int stbi_write_png_compression_level = 8; 256 | int stbi_write_tga_with_rle = 1; 257 | int stbi_write_force_png_filter = -1; 258 | #endif 259 | 260 | static int stbi__flip_vertically_on_write = 0; 261 | 262 | STBIWDEF void stbi_flip_vertically_on_write(int flag) 263 | { 264 | stbi__flip_vertically_on_write = flag; 265 | } 266 | 267 | typedef struct 268 | { 269 | stbi_write_func *func; 270 | void *context; 271 | unsigned char buffer[64]; 272 | int buf_used; 273 | } stbi__write_context; 274 | 275 | // initialize a callback-based context 276 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 277 | { 278 | s->func = c; 279 | s->context = context; 280 | } 281 | 282 | #ifndef STBI_WRITE_NO_STDIO 283 | 284 | static void stbi__stdio_write(void *context, void *data, int size) 285 | { 286 | fwrite(data,1,size,(FILE*) context); 287 | } 288 | 289 | #if defined(_WIN32) && defined(STBIW_WINDOWS_UTF8) 290 | #ifdef __cplusplus 291 | #define STBIW_EXTERN extern "C" 292 | #else 293 | #define STBIW_EXTERN extern 294 | #endif 295 | STBIW_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide); 296 | 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); 297 | 298 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input) 299 | { 300 | return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int) bufferlen, NULL, NULL); 301 | } 302 | #endif 303 | 304 | static FILE *stbiw__fopen(char const *filename, char const *mode) 305 | { 306 | FILE *f; 307 | #if defined(_WIN32) && defined(STBIW_WINDOWS_UTF8) 308 | wchar_t wMode[64]; 309 | wchar_t wFilename[1024]; 310 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename)/sizeof(*wFilename))) 311 | return 0; 312 | 313 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode)/sizeof(*wMode))) 314 | return 0; 315 | 316 | #if defined(_MSC_VER) && _MSC_VER >= 1400 317 | if (0 != _wfopen_s(&f, wFilename, wMode)) 318 | f = 0; 319 | #else 320 | f = _wfopen(wFilename, wMode); 321 | #endif 322 | 323 | #elif defined(_MSC_VER) && _MSC_VER >= 1400 324 | if (0 != fopen_s(&f, filename, mode)) 325 | f=0; 326 | #else 327 | f = fopen(filename, mode); 328 | #endif 329 | return f; 330 | } 331 | 332 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 333 | { 334 | FILE *f = stbiw__fopen(filename, "wb"); 335 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 336 | return f != NULL; 337 | } 338 | 339 | static void stbi__end_write_file(stbi__write_context *s) 340 | { 341 | fclose((FILE *)s->context); 342 | } 343 | 344 | #endif // !STBI_WRITE_NO_STDIO 345 | 346 | typedef unsigned int stbiw_uint32; 347 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 348 | 349 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 350 | { 351 | while (*fmt) { 352 | switch (*fmt++) { 353 | case ' ': break; 354 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 355 | s->func(s->context,&x,1); 356 | break; } 357 | case '2': { int x = va_arg(v,int); 358 | unsigned char b[2]; 359 | b[0] = STBIW_UCHAR(x); 360 | b[1] = STBIW_UCHAR(x>>8); 361 | s->func(s->context,b,2); 362 | break; } 363 | case '4': { stbiw_uint32 x = va_arg(v,int); 364 | unsigned char b[4]; 365 | b[0]=STBIW_UCHAR(x); 366 | b[1]=STBIW_UCHAR(x>>8); 367 | b[2]=STBIW_UCHAR(x>>16); 368 | b[3]=STBIW_UCHAR(x>>24); 369 | s->func(s->context,b,4); 370 | break; } 371 | default: 372 | STBIW_ASSERT(0); 373 | return; 374 | } 375 | } 376 | } 377 | 378 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 379 | { 380 | va_list v; 381 | va_start(v, fmt); 382 | stbiw__writefv(s, fmt, v); 383 | va_end(v); 384 | } 385 | 386 | static void stbiw__write_flush(stbi__write_context *s) 387 | { 388 | if (s->buf_used) { 389 | s->func(s->context, &s->buffer, s->buf_used); 390 | s->buf_used = 0; 391 | } 392 | } 393 | 394 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 395 | { 396 | s->func(s->context, &c, 1); 397 | } 398 | 399 | static void stbiw__write1(stbi__write_context *s, unsigned char a) 400 | { 401 | if ((size_t)s->buf_used + 1 > sizeof(s->buffer)) 402 | stbiw__write_flush(s); 403 | s->buffer[s->buf_used++] = a; 404 | } 405 | 406 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 407 | { 408 | int n; 409 | if ((size_t)s->buf_used + 3 > sizeof(s->buffer)) 410 | stbiw__write_flush(s); 411 | n = s->buf_used; 412 | s->buf_used = n+3; 413 | s->buffer[n+0] = a; 414 | s->buffer[n+1] = b; 415 | s->buffer[n+2] = c; 416 | } 417 | 418 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 419 | { 420 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 421 | int k; 422 | 423 | if (write_alpha < 0) 424 | stbiw__write1(s, d[comp - 1]); 425 | 426 | switch (comp) { 427 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 428 | case 1: 429 | if (expand_mono) 430 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 431 | else 432 | stbiw__write1(s, d[0]); // monochrome TGA 433 | break; 434 | case 4: 435 | if (!write_alpha) { 436 | // composite against pink background 437 | for (k = 0; k < 3; ++k) 438 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 439 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 440 | break; 441 | } 442 | /* FALLTHROUGH */ 443 | case 3: 444 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 445 | break; 446 | } 447 | if (write_alpha > 0) 448 | stbiw__write1(s, d[comp - 1]); 449 | } 450 | 451 | 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) 452 | { 453 | stbiw_uint32 zero = 0; 454 | int i,j, j_end; 455 | 456 | if (y <= 0) 457 | return; 458 | 459 | if (stbi__flip_vertically_on_write) 460 | vdir *= -1; 461 | 462 | if (vdir < 0) { 463 | j_end = -1; j = y-1; 464 | } else { 465 | j_end = y; j = 0; 466 | } 467 | 468 | for (; j != j_end; j += vdir) { 469 | for (i=0; i < x; ++i) { 470 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 471 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 472 | } 473 | stbiw__write_flush(s); 474 | s->func(s->context, &zero, scanline_pad); 475 | } 476 | } 477 | 478 | 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, ...) 479 | { 480 | if (y < 0 || x < 0) { 481 | return 0; 482 | } else { 483 | va_list v; 484 | va_start(v, fmt); 485 | stbiw__writefv(s, fmt, v); 486 | va_end(v); 487 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 488 | return 1; 489 | } 490 | } 491 | 492 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 493 | { 494 | if (comp != 4) { 495 | // write RGB bitmap 496 | int pad = (-x*3) & 3; 497 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 498 | "11 4 22 4" "4 44 22 444444", 499 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 500 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 501 | } else { 502 | // RGBA bitmaps need a v4 header 503 | // use BI_BITFIELDS mode with 32bpp and alpha mask 504 | // (straight BI_RGB with alpha mask doesn't work in most readers) 505 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *)data,1,0, 506 | "11 4 22 4" "4 44 22 444444 4444 4 444 444 444 444", 507 | 'B', 'M', 14+108+x*y*4, 0, 0, 14+108, // file header 508 | 108, x,y, 1,32, 3,0,0,0,0,0, 0xff0000,0xff00,0xff,0xff000000u, 0, 0,0,0, 0,0,0, 0,0,0, 0,0,0); // bitmap V4 header 509 | } 510 | } 511 | 512 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 513 | { 514 | stbi__write_context s = { 0 }; 515 | stbi__start_write_callbacks(&s, func, context); 516 | return stbi_write_bmp_core(&s, x, y, comp, data); 517 | } 518 | 519 | #ifndef STBI_WRITE_NO_STDIO 520 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 521 | { 522 | stbi__write_context s = { 0 }; 523 | if (stbi__start_write_file(&s,filename)) { 524 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 525 | stbi__end_write_file(&s); 526 | return r; 527 | } else 528 | return 0; 529 | } 530 | #endif //!STBI_WRITE_NO_STDIO 531 | 532 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 533 | { 534 | int has_alpha = (comp == 2 || comp == 4); 535 | int colorbytes = has_alpha ? comp-1 : comp; 536 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 537 | 538 | if (y < 0 || x < 0) 539 | return 0; 540 | 541 | if (!stbi_write_tga_with_rle) { 542 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 543 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 544 | } else { 545 | int i,j,k; 546 | int jend, jdir; 547 | 548 | 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); 549 | 550 | if (stbi__flip_vertically_on_write) { 551 | j = 0; 552 | jend = y; 553 | jdir = 1; 554 | } else { 555 | j = y-1; 556 | jend = -1; 557 | jdir = -1; 558 | } 559 | for (; j != jend; j += jdir) { 560 | unsigned char *row = (unsigned char *) data + j * x * comp; 561 | int len; 562 | 563 | for (i = 0; i < x; i += len) { 564 | unsigned char *begin = row + i * comp; 565 | int diff = 1; 566 | len = 1; 567 | 568 | if (i < x - 1) { 569 | ++len; 570 | diff = memcmp(begin, row + (i + 1) * comp, comp); 571 | if (diff) { 572 | const unsigned char *prev = begin; 573 | for (k = i + 2; k < x && len < 128; ++k) { 574 | if (memcmp(prev, row + k * comp, comp)) { 575 | prev += comp; 576 | ++len; 577 | } else { 578 | --len; 579 | break; 580 | } 581 | } 582 | } else { 583 | for (k = i + 2; k < x && len < 128; ++k) { 584 | if (!memcmp(begin, row + k * comp, comp)) { 585 | ++len; 586 | } else { 587 | break; 588 | } 589 | } 590 | } 591 | } 592 | 593 | if (diff) { 594 | unsigned char header = STBIW_UCHAR(len - 1); 595 | stbiw__write1(s, header); 596 | for (k = 0; k < len; ++k) { 597 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 598 | } 599 | } else { 600 | unsigned char header = STBIW_UCHAR(len - 129); 601 | stbiw__write1(s, header); 602 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 603 | } 604 | } 605 | } 606 | stbiw__write_flush(s); 607 | } 608 | return 1; 609 | } 610 | 611 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 612 | { 613 | stbi__write_context s = { 0 }; 614 | stbi__start_write_callbacks(&s, func, context); 615 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 616 | } 617 | 618 | #ifndef STBI_WRITE_NO_STDIO 619 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 620 | { 621 | stbi__write_context s = { 0 }; 622 | if (stbi__start_write_file(&s,filename)) { 623 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 624 | stbi__end_write_file(&s); 625 | return r; 626 | } else 627 | return 0; 628 | } 629 | #endif 630 | 631 | // ************************************************************************************************* 632 | // Radiance RGBE HDR writer 633 | // by Baldur Karlsson 634 | 635 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 636 | 637 | #ifndef STBI_WRITE_NO_STDIO 638 | 639 | static void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 640 | { 641 | int exponent; 642 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 643 | 644 | if (maxcomp < 1e-32f) { 645 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 646 | } else { 647 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 648 | 649 | rgbe[0] = (unsigned char)(linear[0] * normalize); 650 | rgbe[1] = (unsigned char)(linear[1] * normalize); 651 | rgbe[2] = (unsigned char)(linear[2] * normalize); 652 | rgbe[3] = (unsigned char)(exponent + 128); 653 | } 654 | } 655 | 656 | static void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 657 | { 658 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 659 | STBIW_ASSERT(length+128 <= 255); 660 | s->func(s->context, &lengthbyte, 1); 661 | s->func(s->context, &databyte, 1); 662 | } 663 | 664 | static void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 665 | { 666 | unsigned char lengthbyte = STBIW_UCHAR(length); 667 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 668 | s->func(s->context, &lengthbyte, 1); 669 | s->func(s->context, data, length); 670 | } 671 | 672 | static void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 673 | { 674 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 675 | unsigned char rgbe[4]; 676 | float linear[3]; 677 | int x; 678 | 679 | scanlineheader[2] = (width&0xff00)>>8; 680 | scanlineheader[3] = (width&0x00ff); 681 | 682 | /* skip RLE for images too small or large */ 683 | if (width < 8 || width >= 32768) { 684 | for (x=0; x < width; x++) { 685 | switch (ncomp) { 686 | case 4: /* fallthrough */ 687 | case 3: linear[2] = scanline[x*ncomp + 2]; 688 | linear[1] = scanline[x*ncomp + 1]; 689 | linear[0] = scanline[x*ncomp + 0]; 690 | break; 691 | default: 692 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 693 | break; 694 | } 695 | stbiw__linear_to_rgbe(rgbe, linear); 696 | s->func(s->context, rgbe, 4); 697 | } 698 | } else { 699 | int c,r; 700 | /* encode into scratch buffer */ 701 | for (x=0; x < width; x++) { 702 | switch(ncomp) { 703 | case 4: /* fallthrough */ 704 | case 3: linear[2] = scanline[x*ncomp + 2]; 705 | linear[1] = scanline[x*ncomp + 1]; 706 | linear[0] = scanline[x*ncomp + 0]; 707 | break; 708 | default: 709 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 710 | break; 711 | } 712 | stbiw__linear_to_rgbe(rgbe, linear); 713 | scratch[x + width*0] = rgbe[0]; 714 | scratch[x + width*1] = rgbe[1]; 715 | scratch[x + width*2] = rgbe[2]; 716 | scratch[x + width*3] = rgbe[3]; 717 | } 718 | 719 | s->func(s->context, scanlineheader, 4); 720 | 721 | /* RLE each component separately */ 722 | for (c=0; c < 4; c++) { 723 | unsigned char *comp = &scratch[width*c]; 724 | 725 | x = 0; 726 | while (x < width) { 727 | // find first run 728 | r = x; 729 | while (r+2 < width) { 730 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 731 | break; 732 | ++r; 733 | } 734 | if (r+2 >= width) 735 | r = width; 736 | // dump up to first run 737 | while (x < r) { 738 | int len = r-x; 739 | if (len > 128) len = 128; 740 | stbiw__write_dump_data(s, len, &comp[x]); 741 | x += len; 742 | } 743 | // if there's a run, output it 744 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 745 | // find next byte after run 746 | while (r < width && comp[r] == comp[x]) 747 | ++r; 748 | // output run up to r 749 | while (x < r) { 750 | int len = r-x; 751 | if (len > 127) len = 127; 752 | stbiw__write_run_data(s, len, comp[x]); 753 | x += len; 754 | } 755 | } 756 | } 757 | } 758 | } 759 | } 760 | 761 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 762 | { 763 | if (y <= 0 || x <= 0 || data == NULL) 764 | return 0; 765 | else { 766 | // Each component is stored separately. Allocate scratch space for full output scanline. 767 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 768 | int i, len; 769 | char buffer[128]; 770 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 771 | s->func(s->context, header, sizeof(header)-1); 772 | 773 | #ifdef __STDC_LIB_EXT1__ 774 | len = sprintf_s(buffer, sizeof(buffer), "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 775 | #else 776 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 777 | #endif 778 | s->func(s->context, buffer, len); 779 | 780 | for(i=0; i < y; i++) 781 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*x*(stbi__flip_vertically_on_write ? y-1-i : i)); 782 | STBIW_FREE(scratch); 783 | return 1; 784 | } 785 | } 786 | 787 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 788 | { 789 | stbi__write_context s = { 0 }; 790 | stbi__start_write_callbacks(&s, func, context); 791 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 792 | } 793 | 794 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 795 | { 796 | stbi__write_context s = { 0 }; 797 | if (stbi__start_write_file(&s,filename)) { 798 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 799 | stbi__end_write_file(&s); 800 | return r; 801 | } else 802 | return 0; 803 | } 804 | #endif // STBI_WRITE_NO_STDIO 805 | 806 | 807 | ////////////////////////////////////////////////////////////////////////////// 808 | // 809 | // PNG writer 810 | // 811 | 812 | #ifndef STBIW_ZLIB_COMPRESS 813 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 814 | #define stbiw__sbraw(a) ((int *) (void *) (a) - 2) 815 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 816 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 817 | 818 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 819 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 820 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 821 | 822 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 823 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 824 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 825 | 826 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 827 | { 828 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 829 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 830 | STBIW_ASSERT(p); 831 | if (p) { 832 | if (!*arr) ((int *) p)[1] = 0; 833 | *arr = (void *) ((int *) p + 2); 834 | stbiw__sbm(*arr) = m; 835 | } 836 | return *arr; 837 | } 838 | 839 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 840 | { 841 | while (*bitcount >= 8) { 842 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 843 | *bitbuffer >>= 8; 844 | *bitcount -= 8; 845 | } 846 | return data; 847 | } 848 | 849 | static int stbiw__zlib_bitrev(int code, int codebits) 850 | { 851 | int res=0; 852 | while (codebits--) { 853 | res = (res << 1) | (code & 1); 854 | code >>= 1; 855 | } 856 | return res; 857 | } 858 | 859 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 860 | { 861 | int i; 862 | for (i=0; i < limit && i < 258; ++i) 863 | if (a[i] != b[i]) break; 864 | return i; 865 | } 866 | 867 | static unsigned int stbiw__zhash(unsigned char *data) 868 | { 869 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 870 | hash ^= hash << 3; 871 | hash += hash >> 5; 872 | hash ^= hash << 4; 873 | hash += hash >> 17; 874 | hash ^= hash << 25; 875 | hash += hash >> 6; 876 | return hash; 877 | } 878 | 879 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 880 | #define stbiw__zlib_add(code,codebits) \ 881 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 882 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 883 | // default huffman tables 884 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 885 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 886 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 887 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 888 | #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)) 889 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 890 | 891 | #define stbiw__ZHASH 16384 892 | 893 | #endif // STBIW_ZLIB_COMPRESS 894 | 895 | STBIWDEF unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 896 | { 897 | #ifdef STBIW_ZLIB_COMPRESS 898 | // user provided a zlib compress implementation, use that 899 | return STBIW_ZLIB_COMPRESS(data, data_len, out_len, quality); 900 | #else // use builtin 901 | 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 }; 902 | 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 }; 903 | 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 }; 904 | 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 }; 905 | unsigned int bitbuf=0; 906 | int i,j, bitcount=0; 907 | unsigned char *out = NULL; 908 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(unsigned char**)); 909 | if (hash_table == NULL) 910 | return NULL; 911 | if (quality < 5) quality = 5; 912 | 913 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 914 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 915 | stbiw__zlib_add(1,1); // BFINAL = 1 916 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 917 | 918 | for (i=0; i < stbiw__ZHASH; ++i) 919 | hash_table[i] = NULL; 920 | 921 | i=0; 922 | while (i < data_len-3) { 923 | // hash next 3 bytes of data to be compressed 924 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 925 | unsigned char *bestloc = 0; 926 | unsigned char **hlist = hash_table[h]; 927 | int n = stbiw__sbcount(hlist); 928 | for (j=0; j < n; ++j) { 929 | if (hlist[j]-data > i-32768) { // if entry lies within window 930 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 931 | if (d >= best) { best=d; bestloc=hlist[j]; } 932 | } 933 | } 934 | // when hash table entry is too long, delete half the entries 935 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 936 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 937 | stbiw__sbn(hash_table[h]) = quality; 938 | } 939 | stbiw__sbpush(hash_table[h],data+i); 940 | 941 | if (bestloc) { 942 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 943 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 944 | hlist = hash_table[h]; 945 | n = stbiw__sbcount(hlist); 946 | for (j=0; j < n; ++j) { 947 | if (hlist[j]-data > i-32767) { 948 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 949 | if (e > best) { // if next match is better, bail on current match 950 | bestloc = NULL; 951 | break; 952 | } 953 | } 954 | } 955 | } 956 | 957 | if (bestloc) { 958 | int d = (int) (data+i - bestloc); // distance back 959 | STBIW_ASSERT(d <= 32767 && best <= 258); 960 | for (j=0; best > lengthc[j+1]-1; ++j); 961 | stbiw__zlib_huff(j+257); 962 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 963 | for (j=0; d > distc[j+1]-1; ++j); 964 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 965 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 966 | i += best; 967 | } else { 968 | stbiw__zlib_huffb(data[i]); 969 | ++i; 970 | } 971 | } 972 | // write out final bytes 973 | for (;i < data_len; ++i) 974 | stbiw__zlib_huffb(data[i]); 975 | stbiw__zlib_huff(256); // end of block 976 | // pad with 0 bits to byte boundary 977 | while (bitcount) 978 | stbiw__zlib_add(0,1); 979 | 980 | for (i=0; i < stbiw__ZHASH; ++i) 981 | (void) stbiw__sbfree(hash_table[i]); 982 | STBIW_FREE(hash_table); 983 | 984 | // store uncompressed instead if compression was worse 985 | if (stbiw__sbn(out) > data_len + 2 + ((data_len+32766)/32767)*5) { 986 | stbiw__sbn(out) = 2; // truncate to DEFLATE 32K window and FLEVEL = 1 987 | for (j = 0; j < data_len;) { 988 | int blocklen = data_len - j; 989 | if (blocklen > 32767) blocklen = 32767; 990 | stbiw__sbpush(out, data_len - j == blocklen); // BFINAL = ?, BTYPE = 0 -- no compression 991 | stbiw__sbpush(out, STBIW_UCHAR(blocklen)); // LEN 992 | stbiw__sbpush(out, STBIW_UCHAR(blocklen >> 8)); 993 | stbiw__sbpush(out, STBIW_UCHAR(~blocklen)); // NLEN 994 | stbiw__sbpush(out, STBIW_UCHAR(~blocklen >> 8)); 995 | memcpy(out+stbiw__sbn(out), data+j, blocklen); 996 | stbiw__sbn(out) += blocklen; 997 | j += blocklen; 998 | } 999 | } 1000 | 1001 | { 1002 | // compute adler32 on input 1003 | unsigned int s1=1, s2=0; 1004 | int blocklen = (int) (data_len % 5552); 1005 | j=0; 1006 | while (j < data_len) { 1007 | for (i=0; i < blocklen; ++i) { s1 += data[j+i]; s2 += s1; } 1008 | s1 %= 65521; s2 %= 65521; 1009 | j += blocklen; 1010 | blocklen = 5552; 1011 | } 1012 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 1013 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 1014 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 1015 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 1016 | } 1017 | *out_len = stbiw__sbn(out); 1018 | // make returned pointer freeable 1019 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 1020 | return (unsigned char *) stbiw__sbraw(out); 1021 | #endif // STBIW_ZLIB_COMPRESS 1022 | } 1023 | 1024 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 1025 | { 1026 | #ifdef STBIW_CRC32 1027 | return STBIW_CRC32(buffer, len); 1028 | #else 1029 | static unsigned int crc_table[256] = 1030 | { 1031 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 1032 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 1033 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 1034 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 1035 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 1036 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 1037 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 1038 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 1039 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 1040 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 1041 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 1042 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 1043 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 1044 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 1045 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 1046 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 1047 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 1048 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 1049 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 1050 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 1051 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 1052 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 1053 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 1054 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 1055 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 1056 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 1057 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 1058 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 1059 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 1060 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 1061 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 1062 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 1063 | }; 1064 | 1065 | unsigned int crc = ~0u; 1066 | int i; 1067 | for (i=0; i < len; ++i) 1068 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 1069 | return ~crc; 1070 | #endif 1071 | } 1072 | 1073 | #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) 1074 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 1075 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 1076 | 1077 | static void stbiw__wpcrc(unsigned char **data, int len) 1078 | { 1079 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 1080 | stbiw__wp32(*data, crc); 1081 | } 1082 | 1083 | static unsigned char stbiw__paeth(int a, int b, int c) 1084 | { 1085 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 1086 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 1087 | if (pb <= pc) return STBIW_UCHAR(b); 1088 | return STBIW_UCHAR(c); 1089 | } 1090 | 1091 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 1092 | 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) 1093 | { 1094 | static int mapping[] = { 0,1,2,3,4 }; 1095 | static int firstmap[] = { 0,1,0,5,6 }; 1096 | int *mymap = (y != 0) ? mapping : firstmap; 1097 | int i; 1098 | int type = mymap[filter_type]; 1099 | unsigned char *z = pixels + stride_bytes * (stbi__flip_vertically_on_write ? height-1-y : y); 1100 | int signed_stride = stbi__flip_vertically_on_write ? -stride_bytes : stride_bytes; 1101 | 1102 | if (type==0) { 1103 | memcpy(line_buffer, z, width*n); 1104 | return; 1105 | } 1106 | 1107 | // first loop isn't optimized since it's just one pixel 1108 | for (i = 0; i < n; ++i) { 1109 | switch (type) { 1110 | case 1: line_buffer[i] = z[i]; break; 1111 | case 2: line_buffer[i] = z[i] - z[i-signed_stride]; break; 1112 | case 3: line_buffer[i] = z[i] - (z[i-signed_stride]>>1); break; 1113 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-signed_stride],0)); break; 1114 | case 5: line_buffer[i] = z[i]; break; 1115 | case 6: line_buffer[i] = z[i]; break; 1116 | } 1117 | } 1118 | switch (type) { 1119 | case 1: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-n]; break; 1120 | case 2: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-signed_stride]; break; 1121 | case 3: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - ((z[i-n] + z[i-signed_stride])>>1); break; 1122 | 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; 1123 | case 5: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - (z[i-n]>>1); break; 1124 | case 6: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 1125 | } 1126 | } 1127 | 1128 | STBIWDEF unsigned char *stbi_write_png_to_mem(const unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 1129 | { 1130 | int force_filter = stbi_write_force_png_filter; 1131 | int ctype[5] = { -1, 0, 4, 2, 6 }; 1132 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 1133 | unsigned char *out,*o, *filt, *zlib; 1134 | signed char *line_buffer; 1135 | int j,zlen; 1136 | 1137 | if (stride_bytes == 0) 1138 | stride_bytes = x * n; 1139 | 1140 | if (force_filter >= 5) { 1141 | force_filter = -1; 1142 | } 1143 | 1144 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 1145 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 1146 | for (j=0; j < y; ++j) { 1147 | int filter_type; 1148 | if (force_filter > -1) { 1149 | filter_type = force_filter; 1150 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, force_filter, line_buffer); 1151 | } else { // Estimate the best filter by running through all of them: 1152 | int best_filter = 0, best_filter_val = 0x7fffffff, est, i; 1153 | for (filter_type = 0; filter_type < 5; filter_type++) { 1154 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, filter_type, line_buffer); 1155 | 1156 | // Estimate the entropy of the line using this filter; the less, the better. 1157 | est = 0; 1158 | for (i = 0; i < x*n; ++i) { 1159 | est += abs((signed char) line_buffer[i]); 1160 | } 1161 | if (est < best_filter_val) { 1162 | best_filter_val = est; 1163 | best_filter = filter_type; 1164 | } 1165 | } 1166 | if (filter_type != best_filter) { // If the last iteration already got us the best filter, don't redo it 1167 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, best_filter, line_buffer); 1168 | filter_type = best_filter; 1169 | } 1170 | } 1171 | // when we get here, filter_type contains the filter type, and line_buffer contains the data 1172 | filt[j*(x*n+1)] = (unsigned char) filter_type; 1173 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 1174 | } 1175 | STBIW_FREE(line_buffer); 1176 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, stbi_write_png_compression_level); 1177 | STBIW_FREE(filt); 1178 | if (!zlib) return 0; 1179 | 1180 | // each tag requires 12 bytes of overhead 1181 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 1182 | if (!out) return 0; 1183 | *out_len = 8 + 12+13 + 12+zlen + 12; 1184 | 1185 | o=out; 1186 | STBIW_MEMMOVE(o,sig,8); o+= 8; 1187 | stbiw__wp32(o, 13); // header length 1188 | stbiw__wptag(o, "IHDR"); 1189 | stbiw__wp32(o, x); 1190 | stbiw__wp32(o, y); 1191 | *o++ = 8; 1192 | *o++ = STBIW_UCHAR(ctype[n]); 1193 | *o++ = 0; 1194 | *o++ = 0; 1195 | *o++ = 0; 1196 | stbiw__wpcrc(&o,13); 1197 | 1198 | stbiw__wp32(o, zlen); 1199 | stbiw__wptag(o, "IDAT"); 1200 | STBIW_MEMMOVE(o, zlib, zlen); 1201 | o += zlen; 1202 | STBIW_FREE(zlib); 1203 | stbiw__wpcrc(&o, zlen); 1204 | 1205 | stbiw__wp32(o,0); 1206 | stbiw__wptag(o, "IEND"); 1207 | stbiw__wpcrc(&o,0); 1208 | 1209 | STBIW_ASSERT(o == out + *out_len); 1210 | 1211 | return out; 1212 | } 1213 | 1214 | #ifndef STBI_WRITE_NO_STDIO 1215 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1216 | { 1217 | FILE *f; 1218 | int len; 1219 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1220 | if (png == NULL) return 0; 1221 | 1222 | f = stbiw__fopen(filename, "wb"); 1223 | if (!f) { STBIW_FREE(png); return 0; } 1224 | fwrite(png, 1, len, f); 1225 | fclose(f); 1226 | STBIW_FREE(png); 1227 | return 1; 1228 | } 1229 | #endif 1230 | 1231 | 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) 1232 | { 1233 | int len; 1234 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1235 | if (png == NULL) return 0; 1236 | func(context, png, len); 1237 | STBIW_FREE(png); 1238 | return 1; 1239 | } 1240 | 1241 | 1242 | /* *************************************************************************** 1243 | * 1244 | * JPEG writer 1245 | * 1246 | * This is based on Jon Olick's jo_jpeg.cpp: 1247 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1248 | */ 1249 | 1250 | 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, 1251 | 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 }; 1252 | 1253 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1254 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1255 | bitCnt += bs[1]; 1256 | bitBuf |= bs[0] << (24 - bitCnt); 1257 | while(bitCnt >= 8) { 1258 | unsigned char c = (bitBuf >> 16) & 255; 1259 | stbiw__putc(s, c); 1260 | if(c == 255) { 1261 | stbiw__putc(s, 0); 1262 | } 1263 | bitBuf <<= 8; 1264 | bitCnt -= 8; 1265 | } 1266 | *bitBufP = bitBuf; 1267 | *bitCntP = bitCnt; 1268 | } 1269 | 1270 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1271 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1272 | float z1, z2, z3, z4, z5, z11, z13; 1273 | 1274 | float tmp0 = d0 + d7; 1275 | float tmp7 = d0 - d7; 1276 | float tmp1 = d1 + d6; 1277 | float tmp6 = d1 - d6; 1278 | float tmp2 = d2 + d5; 1279 | float tmp5 = d2 - d5; 1280 | float tmp3 = d3 + d4; 1281 | float tmp4 = d3 - d4; 1282 | 1283 | // Even part 1284 | float tmp10 = tmp0 + tmp3; // phase 2 1285 | float tmp13 = tmp0 - tmp3; 1286 | float tmp11 = tmp1 + tmp2; 1287 | float tmp12 = tmp1 - tmp2; 1288 | 1289 | d0 = tmp10 + tmp11; // phase 3 1290 | d4 = tmp10 - tmp11; 1291 | 1292 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1293 | d2 = tmp13 + z1; // phase 5 1294 | d6 = tmp13 - z1; 1295 | 1296 | // Odd part 1297 | tmp10 = tmp4 + tmp5; // phase 2 1298 | tmp11 = tmp5 + tmp6; 1299 | tmp12 = tmp6 + tmp7; 1300 | 1301 | // The rotator is modified from fig 4-8 to avoid extra negations. 1302 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1303 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1304 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1305 | z3 = tmp11 * 0.707106781f; // c4 1306 | 1307 | z11 = tmp7 + z3; // phase 5 1308 | z13 = tmp7 - z3; 1309 | 1310 | *d5p = z13 + z2; // phase 6 1311 | *d3p = z13 - z2; 1312 | *d1p = z11 + z4; 1313 | *d7p = z11 - z4; 1314 | 1315 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1316 | } 1317 | 1318 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1319 | int tmp1 = val < 0 ? -val : val; 1320 | val = val < 0 ? val-1 : val; 1321 | bits[1] = 1; 1322 | while(tmp1 >>= 1) { 1323 | ++bits[1]; 1324 | } 1325 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1368 | } 1369 | // end0pos = first element in reverse order !=0 1370 | if(end0pos == 0) { 1371 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1372 | return DU[0]; 1373 | } 1374 | for(i = 1; i <= end0pos; ++i) { 1375 | int startpos = i; 1376 | int nrzeroes; 1377 | unsigned short bits[2]; 1378 | for (; DU[i]==0 && i<=end0pos; ++i) { 1379 | } 1380 | nrzeroes = i-startpos; 1381 | if ( nrzeroes >= 16 ) { 1382 | int lng = nrzeroes>>4; 1383 | int nrmarker; 1384 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1385 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1386 | nrzeroes &= 15; 1387 | } 1388 | stbiw__jpg_calcBits(DU[i], bits); 1389 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1390 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1391 | } 1392 | if(end0pos != 63) { 1393 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1394 | } 1395 | return DU[0]; 1396 | } 1397 | 1398 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1399 | // Constants that don't pollute global namespace 1400 | 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}; 1401 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1402 | 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}; 1403 | static const unsigned char std_ac_luminance_values[] = { 1404 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1405 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1406 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1407 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1408 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1409 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1410 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1411 | }; 1412 | 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}; 1413 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1414 | 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}; 1415 | static const unsigned char std_ac_chrominance_values[] = { 1416 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1417 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1418 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1419 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1420 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1421 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1422 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1423 | }; 1424 | // Huffman tables 1425 | 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}}; 1426 | 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}}; 1427 | static const unsigned short YAC_HT[256][2] = { 1428 | {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}, 1429 | {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}, 1430 | {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}, 1431 | {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}, 1432 | {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}, 1433 | {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}, 1434 | {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}, 1435 | {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}, 1436 | {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}, 1437 | {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}, 1438 | {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}, 1439 | {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}, 1440 | {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}, 1441 | {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}, 1442 | {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}, 1443 | {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} 1444 | }; 1445 | static const unsigned short UVAC_HT[256][2] = { 1446 | {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}, 1447 | {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}, 1448 | {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}, 1449 | {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}, 1450 | {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}, 1451 | {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}, 1452 | {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}, 1453 | {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}, 1454 | {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}, 1455 | {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}, 1456 | {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}, 1457 | {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}, 1458 | {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}, 1459 | {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}, 1460 | {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}, 1461 | {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} 1462 | }; 1463 | 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, 1464 | 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}; 1465 | 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, 1466 | 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}; 1467 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1468 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1469 | 1470 | int row, col, i, k, subsample; 1471 | float fdtbl_Y[64], fdtbl_UV[64]; 1472 | unsigned char YTable[64], UVTable[64]; 1473 | 1474 | if(!data || !width || !height || comp > 4 || comp < 1) { 1475 | return 0; 1476 | } 1477 | 1478 | quality = quality ? quality : 90; 1479 | subsample = quality <= 90 ? 1 : 0; 1480 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1481 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1482 | 1483 | for(i = 0; i < 64; ++i) { 1484 | int uvti, yti = (YQT[i]*quality+50)/100; 1485 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1486 | uvti = (UVQT[i]*quality+50)/100; 1487 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1488 | } 1489 | 1490 | for(row = 0, k = 0; row < 8; ++row) { 1491 | for(col = 0; col < 8; ++col, ++k) { 1492 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1493 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1494 | } 1495 | } 1496 | 1497 | // Write Headers 1498 | { 1499 | 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 }; 1500 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1501 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1502 | 3,1,(unsigned char)(subsample?0x22:0x11),0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1503 | s->func(s->context, (void*)head0, sizeof(head0)); 1504 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1505 | stbiw__putc(s, 1); 1506 | s->func(s->context, UVTable, sizeof(UVTable)); 1507 | s->func(s->context, (void*)head1, sizeof(head1)); 1508 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1509 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1510 | stbiw__putc(s, 0x10); // HTYACinfo 1511 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1512 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1513 | stbiw__putc(s, 1); // HTUDCinfo 1514 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1515 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1516 | stbiw__putc(s, 0x11); // HTUACinfo 1517 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1518 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1519 | s->func(s->context, (void*)head2, sizeof(head2)); 1520 | } 1521 | 1522 | // Encode 8x8 macroblocks 1523 | { 1524 | static const unsigned short fillBits[] = {0x7F, 7}; 1525 | int DCY=0, DCU=0, DCV=0; 1526 | int bitBuf=0, bitCnt=0; 1527 | // comp == 2 is grey+alpha (alpha is ignored) 1528 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1529 | const unsigned char *dataR = (const unsigned char *)data; 1530 | const unsigned char *dataG = dataR + ofsG; 1531 | const unsigned char *dataB = dataR + ofsB; 1532 | int x, y, pos; 1533 | if(subsample) { 1534 | for(y = 0; y < height; y += 16) { 1535 | for(x = 0; x < width; x += 16) { 1536 | float Y[256], U[256], V[256]; 1537 | for(row = y, pos = 0; row < y+16; ++row) { 1538 | // row >= height => use last input row 1539 | int clamped_row = (row < height) ? row : height - 1; 1540 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1541 | for(col = x; col < x+16; ++col, ++pos) { 1542 | // if col >= width => use pixel from last input column 1543 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1544 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1545 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1546 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1547 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1548 | } 1549 | } 1550 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+0, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1551 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+8, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1552 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+128, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1553 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+136, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1554 | 1555 | // subsample U,V 1556 | { 1557 | float subU[64], subV[64]; 1558 | int yy, xx; 1559 | for(yy = 0, pos = 0; yy < 8; ++yy) { 1560 | for(xx = 0; xx < 8; ++xx, ++pos) { 1561 | int j = yy*32+xx*2; 1562 | subU[pos] = (U[j+0] + U[j+1] + U[j+16] + U[j+17]) * 0.25f; 1563 | subV[pos] = (V[j+0] + V[j+1] + V[j+16] + V[j+17]) * 0.25f; 1564 | } 1565 | } 1566 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subU, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1567 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subV, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1568 | } 1569 | } 1570 | } 1571 | } else { 1572 | for(y = 0; y < height; y += 8) { 1573 | for(x = 0; x < width; x += 8) { 1574 | float Y[64], U[64], V[64]; 1575 | for(row = y, pos = 0; row < y+8; ++row) { 1576 | // row >= height => use last input row 1577 | int clamped_row = (row < height) ? row : height - 1; 1578 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1579 | for(col = x; col < x+8; ++col, ++pos) { 1580 | // if col >= width => use pixel from last input column 1581 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1582 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1583 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1584 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1585 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1586 | } 1587 | } 1588 | 1589 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y, 8, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1590 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, U, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1591 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, V, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1592 | } 1593 | } 1594 | } 1595 | 1596 | // Do the bit alignment of the EOI marker 1597 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1598 | } 1599 | 1600 | // EOI 1601 | stbiw__putc(s, 0xFF); 1602 | stbiw__putc(s, 0xD9); 1603 | 1604 | return 1; 1605 | } 1606 | 1607 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1608 | { 1609 | stbi__write_context s = { 0 }; 1610 | stbi__start_write_callbacks(&s, func, context); 1611 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1612 | } 1613 | 1614 | 1615 | #ifndef STBI_WRITE_NO_STDIO 1616 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1617 | { 1618 | stbi__write_context s = { 0 }; 1619 | if (stbi__start_write_file(&s,filename)) { 1620 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1621 | stbi__end_write_file(&s); 1622 | return r; 1623 | } else 1624 | return 0; 1625 | } 1626 | #endif 1627 | 1628 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1629 | 1630 | /* Revision history 1631 | 1.16 (2021-07-11) 1632 | make Deflate code emit uncompressed blocks when it would otherwise expand 1633 | support writing BMPs with alpha channel 1634 | 1.15 (2020-07-13) unknown 1635 | 1.14 (2020-02-02) updated JPEG writer to downsample chroma channels 1636 | 1.13 1637 | 1.12 1638 | 1.11 (2019-08-11) 1639 | 1640 | 1.10 (2019-02-07) 1641 | support utf8 filenames in Windows; fix warnings and platform ifdefs 1642 | 1.09 (2018-02-11) 1643 | fix typo in zlib quality API, improve STB_I_W_STATIC in C++ 1644 | 1.08 (2018-01-29) 1645 | add stbi__flip_vertically_on_write, external zlib, zlib quality, choose PNG filter 1646 | 1.07 (2017-07-24) 1647 | doc fix 1648 | 1.06 (2017-07-23) 1649 | writing JPEG (using Jon Olick's code) 1650 | 1.05 ??? 1651 | 1.04 (2017-03-03) 1652 | monochrome BMP expansion 1653 | 1.03 ??? 1654 | 1.02 (2016-04-02) 1655 | avoid allocating large structures on the stack 1656 | 1.01 (2016-01-16) 1657 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1658 | avoid race-condition in crc initialization 1659 | minor compile issues 1660 | 1.00 (2015-09-14) 1661 | installable file IO function 1662 | 0.99 (2015-09-13) 1663 | warning fixes; TGA rle support 1664 | 0.98 (2015-04-08) 1665 | added STBIW_MALLOC, STBIW_ASSERT etc 1666 | 0.97 (2015-01-18) 1667 | fixed HDR asserts, rewrote HDR rle logic 1668 | 0.96 (2015-01-17) 1669 | add HDR output 1670 | fix monochrome BMP 1671 | 0.95 (2014-08-17) 1672 | add monochrome TGA output 1673 | 0.94 (2014-05-31) 1674 | rename private functions to avoid conflicts with stb_image.h 1675 | 0.93 (2014-05-27) 1676 | warning fixes 1677 | 0.92 (2010-08-01) 1678 | casts to unsigned char to fix warnings 1679 | 0.91 (2010-07-17) 1680 | first public release 1681 | 0.90 first internal release 1682 | */ 1683 | 1684 | /* 1685 | ------------------------------------------------------------------------------ 1686 | This software is available under 2 licenses -- choose whichever you prefer. 1687 | ------------------------------------------------------------------------------ 1688 | ALTERNATIVE A - MIT License 1689 | Copyright (c) 2017 Sean Barrett 1690 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1691 | this software and associated documentation files (the "Software"), to deal in 1692 | the Software without restriction, including without limitation the rights to 1693 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1694 | of the Software, and to permit persons to whom the Software is furnished to do 1695 | so, subject to the following conditions: 1696 | The above copyright notice and this permission notice shall be included in all 1697 | copies or substantial portions of the Software. 1698 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1699 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1700 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1701 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1702 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1703 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1704 | SOFTWARE. 1705 | ------------------------------------------------------------------------------ 1706 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1707 | This is free and unencumbered software released into the public domain. 1708 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1709 | software, either in source code form or as a compiled binary, for any purpose, 1710 | commercial or non-commercial, and by any means. 1711 | In jurisdictions that recognize copyright laws, the author or authors of this 1712 | software dedicate any and all copyright interest in the software to the public 1713 | domain. We make this dedication for the benefit of the public at large and to 1714 | the detriment of our heirs and successors. We intend this dedication to be an 1715 | overt act of relinquishment in perpetuity of all present and future rights to 1716 | this software under copyright law. 1717 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1718 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1719 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1720 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1721 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1722 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1723 | ------------------------------------------------------------------------------ 1724 | */ 1725 | -------------------------------------------------------------------------------- /tinydream.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | /* 3 | * Tiny Dream - Header-Only, Embedded Stable Diffusion Inference Library. 4 | * 5 | * Copyright (C) 2023 PixLab| Symisc Systems. https://pixlab.io/tiny-dream 6 | * Version 1.7.5 7 | * 8 | * Symisc Systems employs a dual licensing model that offers customers 9 | * a choice of either our open source license (GNU Affero AGPLv3) 10 | * or a commercial license. 11 | * 12 | * For information on licensing, redistribution of the Tiny Dream, 13 | * and for a DISCLAIMER OF ALL WARRANTIES please visit: 14 | * https://pixlab.io/tiny-dream#license 15 | * or contact: 16 | * licensing@symisc.net 17 | * support@pixlab.io 18 | */ 19 | /* 20 | * This file is part of Tiny Dream - Open Source Release (GNU Affero AGPLv3) 21 | * 22 | * Tiny Dream is free software : you can redistribute it and/or modify 23 | * it under the terms of the GNU Affero General Public License as published by 24 | * the Free Software Foundation, either version 3 of the License, or 25 | * (at your option) any later version. 26 | * 27 | * Tiny Dream is distributed in the hope that it will be useful, 28 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 29 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.See the 30 | * GNU General Public License for more details. 31 | * 32 | * You should have received a copy of the GNU Affero General Public License 33 | * along with Tiny Dream. If not, see . 34 | */ 35 | /* 36 | * The TINY_DREAM_VERSION_STR C preprocessor macro evaluates to a string literal 37 | * that is the Tiny Dream version in the format "X.Y.Z" where X is the major 38 | * version number and Y is the minor version number and Z is the release 39 | * number. 40 | */ 41 | #define TINY_DREAM_VERSION_STR "1.7.5" 42 | /* 43 | * The TINY_DREAM_VERSION_NUMBER C preprocessor macro resolves to an integer 44 | * with the value (X*1000000 + Y*1000 + Z) where X, Y, and Z are the same 45 | * numbers used in [TINY_DREAM_VERSION_STR]. 46 | */ 47 | #define TINY_DREAM_VERSION_NUMBER 1007005 48 | /* $SymiscID: tinydream.hpp v1.7.5 WIN10/VS2019 2023-08-07 05:34 stable $ */ 49 | #include 50 | #include 51 | #include 52 | #include 53 | #include 54 | #include 55 | #include 56 | #include 57 | #include 58 | #include 59 | #include 60 | #include 61 | #include 62 | #include 63 | /* 64 | * As of this release, the current backend tensor library is Tencent NCNN 65 | * with an urgent, on-going transition to a less bloated tensor library 66 | * such as SOD (https://sod.pixlab.io) or GGML (https://github.com/ggerganov/ggml). 67 | * 68 | * Refer to the Roadmap page at: https://pixlab.io/tiny-dream#roadmap for the ongoing 69 | * progress. 70 | */ 71 | #define TINY_DREAM_INFERENCE_ENGINE "ncnn" //sod or ggml in the planned transition 72 | #include 73 | #include 74 | #define STB_IMAGE_WRITE_IMPLEMENTATION 75 | #include "stb_image_write.h" 76 | class tinyDream { 77 | private: 78 | std::unordered_map idxTokens; 79 | std::string assetsPath{ "./assets/" }; 80 | std::string outputPath{ "./" }; 81 | std::string imgPrefix{ "tinydream_" }; 82 | std::function xLog{nullptr}; 83 | void* xLogUserData{ nullptr }; 84 | #if (defined(_MSC_VER) && _MSC_VER <= 1929) // not sure exactly what version supports this - 1929 doesn't 85 | inline void _log(const std::string& msg) const { 86 | #else 87 | inline constexpr void _log(const std::string & msg) const { 88 | #endif 89 | if (xLog) { 90 | xLog(msg.c_str(), static_cast(msg.size()), xLogUserData); 91 | } 92 | } 93 | inline std::string joinPaths(const char* zModel) { 94 | // Windows handle the '/' directory separator without issue. 95 | return assetsPath + zModel; 96 | } 97 | std::string randomString(int length = 12) 98 | { 99 | static const char chars[] = "_0123456789abcdefghijklmnopqrstuvwxyz"; 100 | thread_local static std::mt19937 rg{ std::random_device{}() }; 101 | thread_local static std::uniform_int_distribution pick(0, sizeof(chars) - 2); 102 | std::string out; 103 | out.reserve(length); 104 | while (length--) 105 | out += chars[pick(rg)]; 106 | return std::move(out); 107 | } 108 | inline ncnn::Mat rand64(int seed) 109 | { 110 | std::vector arr; 111 | { 112 | thread_local std::mt19937 gen{ static_cast(seed) }; 113 | thread_local std::normal_distribution d{ 0.0f, 1.0f }; 114 | arr.resize(64 * 64 * 4); 115 | std::for_each(arr.begin(), arr.end(), [&](float& x) 116 | { 117 | x = d(gen); 118 | }); 119 | } 120 | ncnn::Mat out(64, 64, 4, reinterpret_cast(arr.data())); 121 | return out.clone(); 122 | } 123 | inline std::vector split(std::string str) 124 | { 125 | std::vector out; 126 | std::string::size_type pos; 127 | str += " "; 128 | int size = str.size(); 129 | for (int i = 0; i < size; i++) 130 | { 131 | pos = std::min(str.find(" ", i), str.find(",", i)); 132 | if (pos < str.size()) 133 | { 134 | std::string s = str.substr(i, pos - i); 135 | std::string pat = std::string(1, str[pos]); 136 | if (s.length() > 0) 137 | out.push_back(s + ""); 138 | if (pat != " ") 139 | out.push_back(pat + ""); 140 | i = pos; 141 | } 142 | } 143 | return out; 144 | } 145 | inline ncnn::Mat CFGDenoiserCompVisDenoiser(ncnn::Net& net, float const* log_sigmas, ncnn::Mat& input, float sigma, ncnn::Mat cond, ncnn::Mat uncond); 146 | ncnn::Mat getTextEmbedding(ncnn::Net& net, std::string prompt); 147 | bool loadTokens(); 148 | std::pair promptEncoder(const std::string& positivePrompt, const std::string& negativePrompt); 149 | ncnn::Mat diffusionSolver(ncnn::Mat& c, ncnn::Mat& uc, int seed, int step); 150 | ncnn::Mat decoderSolver(ncnn::Mat& sample); 151 | inline ncnn::Mat upScale4xEsprGan(ncnn::Mat& input); 152 | std::vector> parsePromptAttention(std::string& texts); 153 | public: 154 | /* 155 | * Public Exposed Methods. 156 | * 157 | * Refer to the Tiny Dream Documentation at: https://pixlab.io/tiny-dream 158 | * for the official C++ API Reference Guide. 159 | */ 160 | tinyDream(const std::string& assetsPath = "./assets/") { 161 | if (this->assetsPath != assetsPath) { 162 | this->assetsPath = assetsPath; 163 | // Windows handle the '/' directory separator without issue. 164 | if (this->assetsPath.back() != '/') { 165 | this->assetsPath.push_back('/'); 166 | } 167 | } 168 | } 169 | ~tinyDream() = default; 170 | static const char * about() { 171 | return "Tiny Dream " TINY_DREAM_VERSION_STR ": Stable Diffusion Inference (" TINY_DREAM_INFERENCE_ENGINE ") in C++ - Copyright (C) PixLab | Symisc Systems(https://pixlab.io/ - https://symisc.net/). All rights reserved."; 172 | } 173 | static std::pair promptExample() { 174 | return std::make_pair("pyramid, desert, palm trees, river, sun, (landscape), (high quality)", "nsfw, nudity, gore, blood, genitals, mutilation, mutation, disfigured, deformed, mutated, war, destruction, hell, torture, apocalypse, sex, chocking, blurry, ugly, tiling, poorly drawn hands, poorly drawn feet, poorly drawn face, out of frame, extra limbs, extra legs, extra arms, cross-eye, body out of frame, bad art, bad anatomy, blurred, text, watermark, grainy"); 175 | } 176 | void setAssetsPath(const std::string& assetsPath) { 177 | this->assetsPath = assetsPath; 178 | // Windows handle the '/' directory separator without issue. 179 | if (this->assetsPath.back() != '/') { 180 | this->assetsPath.push_back('/'); 181 | } 182 | } 183 | void setImageOutputPath(const std::string& outputPath) { 184 | this->outputPath = outputPath; 185 | // Windows handle the '/' directory separator without issue. 186 | if (this->outputPath.back() != '/') { 187 | this->outputPath.push_back('/'); 188 | } 189 | } 190 | void setImageOutputPrefix(const std::string& outputImgPrefix = "tinydream_") { 191 | this->imgPrefix = outputImgPrefix; 192 | } 193 | void setLogCallback(std::function xLogFunc, void *pUserData) { 194 | xLog = xLogFunc; 195 | xLogUserData = pUserData; 196 | } 197 | bool dream(const std::string& positivePrompt, const std::string& negativePrompt, std::string& outputImgPath, bool upScale = true, int seed = 42, int step = 30); 198 | }; 199 | inline ncnn::Mat tinyDream::CFGDenoiserCompVisDenoiser(ncnn::Net& net, float const* log_sigmas, ncnn::Mat& input, float sigma, ncnn::Mat cond, ncnn::Mat uncond) 200 | { 201 | // Based on the excellent fork by fengwang: https://github.com/fengwang 202 | float c_out = -1.0 * sigma; 203 | float c_in = 1.0 / std::sqrt(sigma * sigma + 1); 204 | float log_sigma = std::log(sigma); 205 | std::vector dists(1000); 206 | for (int i = 0; i < 1000; i++){ 207 | if (log_sigma - log_sigmas[i] >= 0) 208 | dists[i] = 1; 209 | else 210 | dists[i] = 0; 211 | if (i == 0) continue; 212 | dists[i] += dists[i - 1]; 213 | } 214 | int low_idx = std::min(int(std::max_element(dists.begin(), dists.end()) - dists.begin()), 1000 - 2); 215 | int high_idx = low_idx + 1; 216 | float low = log_sigmas[low_idx]; 217 | float high = log_sigmas[high_idx]; 218 | float w = (low - log_sigma) / (low - high); 219 | w = std::max(0.f, std::min(1.f, w)); 220 | float t = (1 - w) * low_idx + w * high_idx; 221 | ncnn::Mat t_mat(1); 222 | t_mat[0] = t; 223 | ncnn::Mat c_in_mat(1); 224 | c_in_mat[0] = c_in; 225 | ncnn::Mat c_out_mat(1); 226 | c_out_mat[0] = c_out; 227 | ncnn::Mat denoised_cond; 228 | { 229 | ncnn::Extractor ex = net.create_extractor(); 230 | ex.set_light_mode(true); 231 | ex.input("in0", input); 232 | ex.input("in1", t_mat); 233 | ex.input("in2", cond); 234 | ex.input("c_in", c_in_mat); 235 | ex.input("c_out", c_out_mat); 236 | ex.extract("outout", denoised_cond); 237 | } 238 | ncnn::Mat denoised_uncond; 239 | { 240 | ncnn::Extractor ex = net.create_extractor(); 241 | ex.set_light_mode(true); 242 | ex.input("in0", input); 243 | ex.input("in1", t_mat); 244 | ex.input("in2", uncond); 245 | ex.input("c_in", c_in_mat); 246 | ex.input("c_out", c_out_mat); 247 | ex.extract("outout", denoised_uncond); 248 | } 249 | for (int c = 0; c < 4; c++) 250 | { 251 | float* u_ptr = denoised_uncond.channel(c); 252 | float* c_ptr = denoised_cond.channel(c); 253 | 254 | for (int hw = 0; hw < 64 * 64; hw++) 255 | { 256 | (*u_ptr) = (*u_ptr) + 7 * ((*c_ptr) - (*u_ptr)); 257 | u_ptr++; 258 | c_ptr++; 259 | } 260 | } 261 | return denoised_uncond; 262 | } 263 | inline ncnn::Mat tinyDream::upScale4xEsprGan(ncnn::Mat& input) 264 | { 265 | _log("[-Info-]: Starting Real-ESRGAN Image Resolution Upscaler...\n"); 266 | auto startingTime = ncnn::get_current_time(); 267 | ncnn::Net net; 268 | { 269 | net.opt.use_vulkan_compute = false; 270 | net.opt.use_winograd_convolution = false; 271 | net.opt.use_sgemm_convolution = false; 272 | net.opt.use_fp16_packed = false; 273 | net.opt.use_fp16_storage = false; 274 | net.opt.use_fp16_arithmetic = false; 275 | net.opt.use_packing_layout = true; 276 | net.load_param(joinPaths("RealESRGAN_x4plus_anime.param").c_str()); 277 | net.load_model(joinPaths("RealESRGAN_x4plus_anime.bin").c_str()); 278 | } 279 | ncnn::Extractor ex = net.create_extractor(); 280 | ex.set_light_mode(true); 281 | { 282 | constexpr float mean[] = { 0.0f, 0.0f, 0.0f }; 283 | constexpr float norm[] = { 1.0f / 255.0f, 1.0f / 255.0f, 1.0f / 255.0f }; 284 | input.substract_mean_normalize(mean, norm); 285 | } 286 | ex.input("data", input); 287 | ncnn::Mat highres; 288 | ex.extract("output", highres); 289 | { 290 | constexpr float mean[] = { 0.0f, 0.0f, 0.0f }; 291 | constexpr float norm[] = { 255.0f, 255.0f, 255.0f }; 292 | highres.substract_mean_normalize(mean, norm); 293 | } 294 | auto elapsed = ncnn::get_current_time() - startingTime; 295 | _log(std::string{ "Real-ESRGAN inference took " } + std::to_string(elapsed) + std::string{ " milliseconds to complete.\n" }); 296 | return highres; 297 | } 298 | ncnn::Mat tinyDream::decoderSolver(ncnn::Mat& sample) 299 | { 300 | ncnn::Net net; 301 | _log("[-Info-]: Starting Variational Auto-Encoder (VAE) model (AutoencoderKL FP16) to decode images from latent representations...\n"); 302 | auto startingTime = ncnn::get_current_time(); 303 | { 304 | net.opt.use_vulkan_compute = false; 305 | net.opt.use_winograd_convolution = false; 306 | net.opt.use_sgemm_convolution = false; 307 | net.opt.use_fp16_packed = true; 308 | net.opt.use_fp16_storage = true; 309 | net.opt.use_fp16_arithmetic = true; 310 | net.opt.use_packing_layout = true; 311 | net.load_param(joinPaths("AutoencoderKL-fp16.param").c_str()); 312 | net.load_model(joinPaths("AutoencoderKL-fp16.bin").c_str()); 313 | } 314 | ncnn::Mat xDdim; 315 | { 316 | constexpr float factor[4] = { 5.48998f, 5.48998f, 5.48998f, 5.48998f }; 317 | sample.substract_mean_normalize(0, factor); 318 | ncnn::Extractor ex = net.create_extractor(); 319 | ex.set_light_mode(true); 320 | ex.input("input.1", sample); 321 | ex.extract("815", xDdim); 322 | constexpr float _mean_[3] = { -1.0f, -1.0f, -1.0f }; 323 | constexpr float _norm_[3] = { 127.5f, 127.5f, 127.5f }; 324 | xDdim.substract_mean_normalize(_mean_, _norm_); 325 | } 326 | auto elapsed = ncnn::get_current_time() - startingTime; 327 | _log(std::string{ "Variational Auto-Encoder (VAE) took " } + std::to_string(elapsed) + std::string{ " milliseconds to complete.\n" }); 328 | return xDdim; 329 | } 330 | ncnn::Mat tinyDream::diffusionSolver(ncnn::Mat& c, ncnn::Mat& uc, int seed, int step) 331 | { 332 | ncnn::Net net; 333 | _log("[-Info-]: Starting UNet Model (UNetModel FP16) to denoise the encoded image latent...\n"); 334 | auto startingTime = ncnn::get_current_time(); 335 | { 336 | net.opt.use_vulkan_compute = false; 337 | net.opt.use_winograd_convolution = false; 338 | net.opt.use_sgemm_convolution = false; 339 | net.opt.use_fp16_packed = true; 340 | net.opt.use_fp16_storage = true; 341 | net.opt.use_fp16_arithmetic = true; 342 | net.opt.use_packing_layout = true; 343 | net.load_param(joinPaths("UNetModel-fp16.param").c_str()); 344 | net.load_model(joinPaths("UNetModel-fp16.bin").c_str()); 345 | } 346 | float const log_sigmas[1000] = { -3.534698963f, -3.186542273f, -2.982215166f, -2.836785793f, -2.723614454f, -2.63086009f, -2.552189827f, -2.483832836f, -2.423344612f, -2.369071007f, -2.319822073f, -2.274721861f, -2.233105659f, -2.1944592f, -2.15836978f, -2.124504805f, -2.092598915f, -2.062425613f, -2.033797979f, -2.006558657f, -1.980568767f, -1.955715537f, -1.931894541f, -1.90902102f, -1.887015939f, -1.865811229f, -1.845347762f, -1.825569034f, -1.806429505f, -1.787884474f, -1.769894958f, -1.752426744f, -1.735446692f, -1.718925714f, -1.702836871f, -1.687156916f, -1.671862602f, -1.656933904f, -1.642351151f, -1.628097653f, -1.614156127f, -1.60051167f, -1.587151766f, -1.574060798f, -1.561229229f, -1.548643827f, -1.536295056f, -1.524172544f, -1.512266994f, -1.500569701f, -1.489071608f, -1.477766395f, -1.466645837f, -1.455702543f, -1.444930911f, -1.43432498f, -1.423877597f, -1.413584232f, -1.403439164f, -1.393437862f, -1.383575559f, -1.373847008f, -1.364248514f, -1.35477531f, -1.345424652f, -1.336191654f, -1.327073216f, -1.318066359f, -1.309167266f, -1.300373077f, -1.291680217f, -1.283086777f, -1.2745893f, -1.266185522f, -1.257872462f, -1.249648571f, -1.24151063f, -1.233456612f, -1.225485086f, -1.217592716f, -1.209778547f, -1.202040195f, -1.194375992f, -1.186783791f, -1.179262877f, -1.171809912f, -1.164424658f, -1.157105207f, -1.14985013f, -1.142657518f, -1.135526419f, -1.128455162f, -1.121442795f, -1.114487886f, -1.107589245f, -1.100745678f, -1.093955874f, -1.087218761f, -1.080533504f, -1.073898554f, -1.067313433f, -1.060776949f, -1.05428803f, -1.04784584f, -1.041449785f, -1.035098076f, -1.028790832f, -1.022526741f, -1.01630497f, -1.010124922f, -1.003985763f, -0.9978865385f, -0.9918267727f, -0.9858058691f, -0.9798227549f, -0.9738773108f, -0.9679679871f, -0.9620951414f, -0.9562574625f, -0.9504545927f, -0.9446860552f, -0.9389512539f, -0.9332492948f, -0.9275799394f, -0.9219425917f, -0.9163367748f, -0.910761714f, -0.9052170515f, -0.8997026086f, -0.8942174911f, -0.8887614012f, -0.8833341002f, -0.8779345155f, -0.8725628257f, -0.8672183752f, -0.8619008064f, -0.8566094041f, -0.851344347f, -0.8461046219f, -0.8408905864f, -0.8357009888f, -0.8305362463f, -0.8253954053f, -0.8202784657f, -0.8151849508f, -0.8101147413f, -0.8050670028f, -0.800041914f, -0.7950390577f, -0.7900577784f, -0.7850983739f, -0.7801600099f, -0.7752425075f, -0.7703458071f, -0.7654693723f, -0.7606129646f, -0.7557764053f, -0.7509595752f, -0.7461619377f, -0.7413833141f, -0.7366235256f, -0.7318821549f, -0.7271592021f, -0.7224541306f, -0.7177669406f, -0.7130974531f, -0.7084451318f, -0.7038100958f, -0.6991918087f, -0.6945903301f, -0.6900054812f, -0.6854367256f, -0.6808840632f, -0.6763471961f, -0.6718261838f, -0.6673204899f, -0.6628302932f, -0.658354938f, -0.6538946629f, -0.64944911f, -0.6450180411f, -0.6406013966f, -0.6361990571f, -0.6318103671f, -0.6274358034f, -0.6230751276f, -0.618727684f, -0.6143938303f, -0.61007303f, -0.6057654023f, -0.6014707088f, -0.597188592f, -0.5929191113f, -0.5886622667f, -0.5844176412f, -0.5801851153f, -0.5759648085f, -0.5717563629f, -0.5675594807f, -0.5633742213f, -0.5592005849f, -0.5550382137f, -0.5508873463f, -0.546747148f, -0.5426182747f, -0.5385001898f, -0.5343927145f, -0.5302959085f, -0.5262096524f, -0.5221338272f, -0.5180680752f, -0.5140126348f, -0.5099670291f, -0.5059314966f, -0.5019059181f, -0.4978898764f, -0.4938833714f, -0.4898864031f, -0.4858988523f, -0.4819207191f, -0.477951467f, -0.4739915431f, -0.4700405598f, -0.4660984278f, -0.4621651769f, -0.4582404494f, -0.4543244243f, -0.4504169226f, -0.4465178251f, -0.4426270425f, -0.438744545f, -0.4348701835f, -0.4310038984f, -0.4271455407f, -0.4232949913f, -0.4194523394f, -0.415617466f, -0.4117901921f, -0.4079704583f, -0.4041582644f, -0.4003533721f, -0.3965558708f, -0.3927654326f, -0.3889823556f, -0.3852062523f, -0.3814373016f, -0.3776751757f, -0.3739199638f, -0.3701713085f, -0.3664295971f, -0.3626944721f, -0.3589659631f, -0.3552440405f, -0.3515283465f, -0.3478190601f, -0.3441161811f, -0.3404195011f, -0.3367289305f, -0.3330446184f, -0.3293660879f, -0.3256936371f, -0.3220270574f, -0.3183663487f, -0.3147114515f, -0.3110622168f, -0.3074187338f, -0.3037807941f, -0.3001481593f, -0.296521306f, -0.2928997874f, -0.2892835438f, -0.2856727242f, -0.2820670605f, -0.2784664929f, -0.2748712003f, -0.271281004f, -0.2676956952f, -0.2641154826f, -0.2605400383f, -0.2569694519f, -0.2534037232f, -0.2498426586f, -0.2462864369f, -0.24273476f, -0.2391877174f, -0.2356451303f, -0.2321071476f, -0.2285735607f, -0.2250443399f, -0.2215195149f, -0.2179989815f, -0.214482531f, -0.210970372f, -0.2074623704f, -0.2039585114f, -0.2004585862f, -0.1969628185f, -0.1934709698f, -0.1899829209f, -0.1864988059f, -0.1830185503f, -0.1795420945f, -0.1760693043f, -0.172600165f, -0.1691347659f, -0.1656728834f, -0.1622146815f, -0.1587598771f, -0.1553086042f, -0.1518607438f, -0.1484163553f, -0.1449751854f, -0.1415374279f, -0.138102904f, -0.1346716136f, -0.1312434822f, -0.1278186142f, -0.1243967116f, -0.1209778786f, -0.1175621748f, -0.1141493395f, -0.1107395291f, -0.1073326841f, -0.1039286032f, -0.100527443f, -0.09712906927f, -0.09373350441f, -0.09034062177f, -0.08695036173f, -0.08356288075f, -0.08017785847f, -0.0767955035f, -0.07341576368f, -0.07003845274f, -0.06666365266f, -0.06329131871f, -0.05992120504f, -0.05655376986f, -0.05318845809f, -0.04982547462f, -0.04646483436f, -0.04310630262f, -0.03975001723f, -0.03639599681f, -0.03304407373f, -0.02969419584f, -0.02634644695f, -0.02300059609f, -0.01965690777f, -0.0163150914f, -0.01297534816f, -0.009637393057f, -0.006301366724f, -0.002967105946f, 0.0003651905863f, 0.00369580253f, 0.007024710067f, 0.01035177521f, 0.0136772152f, 0.01700089127f, 0.02032313682f, 0.02364357933f, 0.02696254663f, 0.03028002009f, 0.03359586f, 0.03691027686f, 0.04022336379f, 0.04353487119f, 0.04684500396f, 0.05015373603f, 0.05346116424f, 0.05676726624f, 0.060072124f, 0.06337571889f, 0.06667824835f, 0.06997924298f, 0.073279351f, 0.07657821476f, 0.07987590879f, 0.08317264169f, 0.08646827191f, 0.08976276964f, 0.0930563435f, 0.09634894878f, 0.09964046627f, 0.1029312909f, 0.1062210724f, 0.109510012f, 0.1127980649f, 0.1160853282f, 0.1193717569f, 0.1226574481f, 0.1259424686f, 0.1292266697f, 0.1325102597f, 0.1357929856f, 0.1390753537f, 0.1423569024f, 0.1456380188f, 0.1489184797f, 0.1521983445f, 0.155477792f, 0.1587566882f, 0.1620351225f, 0.1653131396f, 0.1685907096f, 0.1718678325f, 0.1751447469f, 0.1784212291f, 0.1816974431f, 0.1849732697f, 0.1882487684f, 0.1915241033f, 0.1947992444f, 0.198074162f, 0.2013489157f, 0.2046233714f, 0.2078978866f, 0.211172238f, 0.214446485f, 0.2177205831f, 0.2209947109f, 0.2242688239f, 0.2275429815f, 0.230817154f, 0.2340912819f, 0.2373655587f, 0.2406399995f, 0.2439144254f, 0.247189045f, 0.2504638135f, 0.2537388504f, 0.2570140362f, 0.2602894902f, 0.2635650337f, 0.266841054f, 0.2701171935f, 0.27339378f, 0.2766706944f, 0.2799479663f, 0.2832255363f, 0.2865035534f, 0.2897821367f, 0.2930608988f, 0.2963403165f, 0.2996201515f, 0.3029005229f, 0.306181401f, 0.3094629347f, 0.3127449751f, 0.3160274923f, 0.3193107247f, 0.322594583f, 0.3258791566f, 0.329164356f, 0.3324502707f, 0.335736841f, 0.3390242159f, 0.3423123956f, 0.3456012905f, 0.3488909006f, 0.352181375f, 0.3554728627f, 0.3587650359f, 0.3620581031f, 0.365352124f, 0.3686470091f, 0.371942848f, 0.3752396405f, 0.3785375357f, 0.3818363845f, 0.3851362169f, 0.3884370327f, 0.3917389512f, 0.3950420022f, 0.3983460069f, 0.4016513228f, 0.4049576223f, 0.408265233f, 0.4115738571f, 0.4148837626f, 0.4181949198f, 0.4215073586f, 0.4248209298f, 0.4281358421f, 0.4314520359f, 0.434769541f, 0.4380882978f, 0.441408515f, 0.444730103f, 0.448053062f, 0.4513774216f, 0.4547032118f, 0.4580304027f, 0.461359024f, 0.4646892846f, 0.4680209458f, 0.4713541865f, 0.4746888876f, 0.4780252576f, 0.4813631475f, 0.4847026467f, 0.4880437851f, 0.4913864136f, 0.4947308302f, 0.4980769157f, 0.5014246702f, 0.5047741532f, 0.5081253052f, 0.5114781857f, 0.5148329139f, 0.5181894302f, 0.5215476751f, 0.5249077678f, 0.5282697678f, 0.5316335559f, 0.5349991322f, 0.5383667946f, 0.5417361856f, 0.5451076627f, 0.5484809279f, 0.5518562794f, 0.5552335382f, 0.5586128235f, 0.5619941354f, 0.5653774738f, 0.5687628388f, 0.5721503496f, 0.5755399466f, 0.5789316297f, 0.5823253393f, 0.585721314f, 0.5891193748f, 0.5925196409f, 0.5959220529f, 0.5993267298f, 0.6027336717f, 0.6061428785f, 0.6095542312f, 0.6129679084f, 0.6163839698f, 0.6198022962f, 0.6232229471f, 0.6266459823f, 0.6300714016f, 0.6334991455f, 0.6369293332f, 0.6403619647f, 0.6437969804f, 0.6472345591f, 0.6506744623f, 0.6541169882f, 0.6575619578f, 0.6610094905f, 0.6644595861f, 0.6679121852f, 0.6713674068f, 0.6748251915f, 0.6782855988f, 0.6817486286f, 0.6852144003f, 0.688682735f, 0.6921537519f, 0.6956274509f, 0.6991039515f, 0.7025832534f, 0.7060650587f, 0.7095498443f, 0.713037312f, 0.7165275812f, 0.7200207114f, 0.7235167027f, 0.7270154953f, 0.730517149f, 0.7340217829f, 0.7375292182f, 0.7410396338f, 0.7445529699f, 0.7480692267f, 0.7515884042f, 0.7551106215f, 0.7586359382f, 0.7621641755f, 0.7656953931f, 0.7692299485f, 0.7727673054f, 0.7763077617f, 0.779851377f, 0.7833981514f, 0.786947906f, 0.7905010581f, 0.7940571904f, 0.7976165414f, 0.8011791706f, 0.8047449589f, 0.8083140254f, 0.8118864298f, 0.8154619932f, 0.8190407753f, 0.8226229548f, 0.8262084126f, 0.8297972679f, 0.833389461f, 0.836984992f, 0.8405839205f, 0.8441862464f, 0.8477919698f, 0.8514010906f, 0.8550137877f, 0.8586298227f, 0.8622494936f, 0.8658725023f, 0.8694992065f, 0.8731292486f, 0.8767629862f, 0.8804001808f, 0.8840410113f, 0.8876854181f, 0.8913334608f, 0.894985199f, 0.8986404538f, 0.9022994041f, 0.9059621096f, 0.9096283317f, 0.9132984877f, 0.9169722795f, 0.9206498265f, 0.924331069f, 0.9280161858f, 0.9317050576f, 0.9353976846f, 0.9390941858f, 0.9427945018f, 0.9464985728f, 0.9502066374f, 0.9539185762f, 0.957634449f, 0.9613542557f, 0.9650779963f, 0.9688056707f, 0.9725371599f, 0.9762728214f, 0.9800124764f, 0.983756125f, 0.9875037074f, 0.9912554026f, 0.9950110912f, 0.9987710118f, 1.002534866f, 1.006302953f, 1.010075092f, 1.013851404f, 1.017631888f, 1.021416545f, 1.025205374f, 1.028998375f, 1.032795668f, 1.036597133f, 1.040402889f, 1.044212818f, 1.048027158f, 1.051845789f, 1.055668592f, 1.059495926f, 1.063327432f, 1.067163467f, 1.071003675f, 1.074848413f, 1.078697562f, 1.082551122f, 1.086408973f, 1.090271473f, 1.094138384f, 1.098009825f, 1.101885676f, 1.105766058f, 1.109651089f, 1.113540411f, 1.117434502f, 1.121333122f, 1.125236511f, 1.129144192f, 1.13305676f, 1.136973858f, 1.140895605f, 1.144822001f, 1.148753166f, 1.15268898f, 1.156629443f, 1.160574675f, 1.164524794f, 1.168479443f, 1.172439098f, 1.176403403f, 1.180372596f, 1.184346557f, 1.188325405f, 1.192309022f, 1.196297526f, 1.200290918f, 1.204289317f, 1.208292484f, 1.212300658f, 1.216313839f, 1.220331907f, 1.224354982f, 1.228383064f, 1.232415915f, 1.236454129f, 1.240497231f, 1.244545341f, 1.248598576f, 1.252656817f, 1.256720304f, 1.260788798f, 1.264862418f, 1.268941164f, 1.273025036f, 1.277114153f, 1.281208396f, 1.285307884f, 1.289412618f, 1.293522477f, 1.297637701f, 1.301758051f, 1.305883765f, 1.310014725f, 1.314151049f, 1.318292618f, 1.322439551f, 1.326591969f, 1.330749512f, 1.334912539f, 1.33908093f, 1.343254805f, 1.347433925f, 1.351618767f, 1.355808854f, 1.360004425f, 1.36420548f, 1.368412018f, 1.372624159f, 1.376841784f, 1.381064892f, 1.385293603f, 1.389527798f, 1.393767595f, 1.398013115f, 1.402264118f, 1.406520724f, 1.410783052f, 1.415050983f, 1.419324636f, 1.423603892f, 1.427888989f, 1.43217957f, 1.436476111f, 1.440778255f, 1.445086241f, 1.449399829f, 1.453719258f, 1.458044529f, 1.462375641f, 1.466712594f, 1.471055388f, 1.475403905f, 1.479758382f, 1.484118819f, 1.488484859f, 1.492857099f, 1.497235179f, 1.50161922f, 1.506009102f, 1.510405064f, 1.514806986f, 1.519214869f, 1.523628831f, 1.528048754f, 1.532474637f, 1.536906719f, 1.541344643f, 1.545788884f, 1.550239086f, 1.554695368f, 1.559157968f, 1.563626409f, 1.568101287f, 1.572582126f, 1.577069283f, 1.581562519f, 1.586061954f, 1.590567589f, 1.595079541f, 1.599597573f, 1.604121923f, 1.608652592f, 1.613189697f, 1.617732882f, 1.622282386f, 1.626838207f, 1.631400466f, 1.635969043f, 1.640543938f, 1.645125389f, 1.649713039f, 1.654307127f, 1.658907652f, 1.663514495f, 1.668127894f, 1.67274785f, 1.677374125f, 1.682006836f, 1.686646223f, 1.691291928f, 1.695944309f, 1.700603247f, 1.705268621f, 1.709940553f, 1.71461916f, 1.719304323f, 1.723996043f, 1.728694439f, 1.733399391f, 1.738111019f, 1.742829323f, 1.747554302f, 1.752285957f, 1.757024288f, 1.761769295f, 1.766520977f, 1.771279573f, 1.776044846f, 1.780816793f, 1.785595655f, 1.790381074f, 1.795173526f, 1.799972653f, 1.804778576f, 1.809591532f, 1.814411163f, 1.819237709f, 1.82407105f, 1.828911304f, 1.833758473f, 1.838612676f, 1.843473673f, 1.848341703f, 1.853216529f, 1.858098507f, 1.86298728f, 1.867883086f, 1.872785926f, 1.877695799f, 1.882612705f, 1.887536645f, 1.892467618f, 1.897405624f, 1.902350664f, 1.907302856f, 1.912262201f, 1.91722858f, 1.92220211f, 1.927182794f, 1.93217051f, 1.937165499f, 1.94216764f, 1.947176933f, 1.952193499f, 1.957217097f, 1.962248087f, 1.967286348f, 1.972331762f, 1.977384448f, 1.982444406f, 1.987511516f, 1.992586017f, 1.997667909f, 2.002757072f, 2.007853508f, 2.012957335f, 2.018068552f, 2.023186922f, 2.028312922f, 2.033446312f, 2.038586855f, 2.043735027f, 2.048890591f, 2.054053545f, 2.05922389f, 2.064401865f, 2.069587231f, 2.074779987f, 2.079980135f, 2.08518815f, 2.090403318f, 2.095626354f, 2.100856543f, 2.106094599f, 2.111340046f, 2.116593361f, 2.121853828f, 2.127122164f, 2.132398129f, 2.137681484f, 2.142972708f, 2.148271322f, 2.153577805f, 2.158891916f, 2.164213657f, 2.169543266f, 2.174880266f, 2.180225134f, 2.185577631f, 2.190937996f, 2.19630599f, 2.201681852f, 2.207065582f, 2.212456942f, 2.21785593f, 2.223263025f, 2.22867775f, 2.234100103f, 2.239530563f, 2.244968891f, 2.250414848f, 2.255868912f, 2.261330843f, 2.266800642f, 2.27227807f, 2.277763605f, 2.283257008f, 2.288758516f, 2.294267654f, 2.299785137f, 2.305310249f, 2.310843468f, 2.316384792f, 2.321933746f, 2.327491045f, 2.333056211f, 2.338629484f, 2.344210625f, 2.34980011f, 2.355397224f, 2.361002684f, 2.366616249f, 2.372237921f, 2.37786746f, 2.383505344f, 2.389151335f, 2.394805431f, 2.400467634f, 2.406137943f, 2.411816359f, 2.41750288f, 2.423197985f, 2.428900957f, 2.434612274f, 2.440331697f, 2.446059465f, 2.45179534f, 2.457539558f, 2.463291883f, 2.469052553f, 2.474821568f, 2.480598688f, 2.486384153f, 2.492177963f, 2.497980118f, 2.503790617f, 2.509609461f, 2.515436649f, 2.521272182f, 2.527115822f, 2.532968283f, 2.53882885f, 2.544697762f, 2.550575256f, 2.556461096f, 2.56235528f, 2.568258047f, 2.574169159f, 2.580088615f, 2.586016655f, 2.591953278f, 2.597898245f, 2.603851557f, 2.60981369f, 2.615784168f, 2.621763229f, 2.627750635f, 2.633746862f, 2.639751434f, 2.645764589f, 2.651786327f, 2.657816648f, 2.663855553f, 2.66990304f, 2.67595911f, 2.682024002f }; 347 | ncnn::Mat x_mat = rand64(seed % 1000); 348 | std::vector sigma(step); 349 | float delta = -999.0f / (step - 1); 350 | for (int i = 0; i < step; i++) 351 | { 352 | float t = 999.0 + i * delta; 353 | int low_idx = std::floor(t); 354 | int high_idx = std::ceil(t); 355 | float w = t - low_idx; 356 | sigma[i] = std::exp((1 - w) * log_sigmas[low_idx] + w * log_sigmas[high_idx]); 357 | } 358 | sigma.push_back(0.f); 359 | float _norm_[4] = { sigma[0], sigma[0], sigma[0], sigma[0] }; 360 | x_mat.substract_mean_normalize(0, _norm_); 361 | for (int i = 0; i < static_cast(sigma.size()) - 1; i++) { 362 | double t1 = ncnn::get_current_time(); 363 | ncnn::Mat denoised = CFGDenoiserCompVisDenoiser(net, log_sigmas, x_mat, sigma[i], c, uc); 364 | double t2 = ncnn::get_current_time(); 365 | _log("[-Info-]: Denoiser step: " + std::to_string(i) + " took " + std::to_string(t2 - t1) + " Milliseconds.\n"); 366 | float sigma_up = std::min(sigma[i + 1], std::sqrt(sigma[i + 1] * sigma[i + 1] * (sigma[i] * sigma[i] - sigma[i + 1] * sigma[i + 1]) / (sigma[i] * sigma[i]))); 367 | float sigma_down = std::sqrt(sigma[i + 1] * sigma[i + 1] - sigma_up * sigma_up); 368 | std::srand(std::time(NULL)); 369 | ncnn::Mat randn = rand64(rand() % 1000); 370 | for (int c = 0; c < 4; c++) 371 | { 372 | float* x_ptr = x_mat.channel(c); 373 | float* d_ptr = denoised.channel(c); 374 | float* r_ptr = randn.channel(c); 375 | for (int hw = 0; hw < 64 * 64; hw++) 376 | { 377 | *x_ptr = *x_ptr + ((*x_ptr - *d_ptr) / sigma[i]) * (sigma_down - sigma[i]) + *r_ptr * sigma_up; 378 | x_ptr++; 379 | d_ptr++; 380 | r_ptr++; 381 | } 382 | } 383 | } 384 | ncnn::Mat clone; 385 | clone.clone_from(x_mat); 386 | auto elapsed = ncnn::get_current_time() - startingTime; 387 | _log(std::string{ "Denoising via (UNetModel FP16) took " } + std::to_string(elapsed) + std::string{ " milliseconds to complete.\n" }); 388 | return clone; 389 | } 390 | /* 391 | * The parenthesis "()" is to increase the importance, while the square brackets "[]" is to reduce the importance 392 | */ 393 | std::vector> tinyDream::parsePromptAttention(std::string& texts) 394 | { 395 | std::vector> res; 396 | std::stack round_brackets; 397 | std::stack square_brackets; 398 | const float round_bracket_multiplier = 1.1; 399 | const float square_bracket_multiplier = 1 / 1.1; 400 | std::vector ms; 401 | for (char c : texts) { 402 | std::string s = std::string(1, c); 403 | if (s == "(" || s == "[" || s == ")" || s == "]") { 404 | ms.push_back(s); 405 | } 406 | else { 407 | if (ms.size() < 1) 408 | ms.push_back(""); 409 | std::string last = ms[ms.size() - 1]; 410 | if (last == "(" || last == "[" || last == ")" || last == "]") { 411 | ms.push_back(""); 412 | } 413 | ms[ms.size() - 1] += s; 414 | } 415 | } 416 | for (std::string text : ms) { 417 | if (text == "(") { 418 | round_brackets.push(res.size()); 419 | } 420 | else if (text == "[") { 421 | square_brackets.push(res.size()); 422 | } 423 | else if (text == ")" && round_brackets.size() > 0) 424 | { 425 | for (unsigned long p = round_brackets.top(); p < res.size(); p++) 426 | { 427 | res[p].second *= round_bracket_multiplier; 428 | } 429 | 430 | round_brackets.pop(); 431 | } 432 | else if (text == "]" && square_brackets.size() > 0) 433 | { 434 | for (unsigned long p = square_brackets.top(); p < res.size(); p++) 435 | { 436 | res[p].second *= square_bracket_multiplier; 437 | } 438 | 439 | square_brackets.pop(); 440 | } 441 | else { 442 | res.push_back(make_pair(text, 1.0)); 443 | } 444 | } 445 | while (!round_brackets.empty()) 446 | { 447 | for (unsigned long p = round_brackets.top(); p < res.size(); p++) 448 | { 449 | res[p].second *= round_bracket_multiplier; 450 | } 451 | 452 | round_brackets.pop(); 453 | } 454 | while (!square_brackets.empty()) 455 | { 456 | for (unsigned long p = square_brackets.top(); p < res.size(); p++) 457 | { 458 | res[p].second *= square_bracket_multiplier; 459 | } 460 | 461 | square_brackets.pop(); 462 | } 463 | unsigned long i = 0; 464 | while (i + 1 < res.size()) 465 | { 466 | if (res[i].second == res[i + 1].second){ 467 | res[i].first += res[i + 1].first; 468 | auto it = res.begin(); 469 | res.erase(it + i + 1); 470 | }else{ 471 | i += 1; 472 | } 473 | } 474 | return res; 475 | } 476 | ncnn::Mat tinyDream::getTextEmbedding(ncnn::Net& net, std::string prompt) 477 | { 478 | std::vector> parsed = parsePromptAttention(prompt); 479 | std::vector> tokenized; 480 | for (auto p : parsed){ 481 | std::vector tokens = split(p.first); 482 | std::vector ids; 483 | for (std::string token : tokens) 484 | ids.push_back(idxTokens[token]); 485 | tokenized.push_back(ids); 486 | } 487 | std::vector remade_tokens; 488 | std::vector multipliers; 489 | { 490 | int last_comma = -1; 491 | for (auto it_tokenized = 0; it_tokenized < tokenized.size(); it_tokenized++) 492 | { 493 | std::vector tokens = tokenized[it_tokenized]; 494 | float weight = parsed[it_tokenized].second; 495 | unsigned long i = 0; 496 | while (i < tokens.size()) 497 | { 498 | int token = tokens[i]; 499 | if (token == 267){ 500 | last_comma = remade_tokens.size(); 501 | }else if ((std::max(int(remade_tokens.size()), 1) % 75 == 0) && (last_comma != -1) && (remade_tokens.size() - last_comma <= 20)){ 502 | last_comma += 1; 503 | std::vector reloc_tokens(remade_tokens.begin() + last_comma, remade_tokens.end()); 504 | std::vector reloc_mults(multipliers.begin() + last_comma, multipliers.end()); 505 | std::vector _remade_tokens_(remade_tokens.begin(), remade_tokens.begin() + last_comma); 506 | remade_tokens = _remade_tokens_; 507 | int length = remade_tokens.size(); 508 | int rem = std::ceil(length / 75.0) * 75 - length; 509 | std::vector tmp_token(rem, 49407); 510 | remade_tokens.insert(remade_tokens.end(), tmp_token.begin(), tmp_token.end()); 511 | remade_tokens.insert(remade_tokens.end(), reloc_tokens.begin(), reloc_tokens.end()); 512 | std::vector _multipliers_(multipliers.begin(), multipliers.end() + last_comma); 513 | std::vector tmp_multipliers(rem, 1.0f); 514 | _multipliers_.insert(_multipliers_.end(), tmp_multipliers.begin(), tmp_multipliers.end()); 515 | _multipliers_.insert(_multipliers_.end(), reloc_mults.begin(), reloc_mults.end()); 516 | multipliers = _multipliers_; 517 | } 518 | remade_tokens.push_back(token); 519 | multipliers.push_back(weight); 520 | i += 1; 521 | } 522 | } 523 | int prompt_target_length = std::ceil(std::max(int(remade_tokens.size()), 1) / 75.0) * 75; 524 | int tokens_to_add = prompt_target_length - remade_tokens.size(); 525 | std::vector tmp_token(tokens_to_add, 49407); 526 | remade_tokens.insert(remade_tokens.end(), tmp_token.begin(), tmp_token.end()); 527 | std::vector tmp_multipliers(tokens_to_add, 1.0f); 528 | multipliers.insert(multipliers.end(), tmp_multipliers.begin(), tmp_multipliers.end()); 529 | } 530 | ncnn::Mat embVec(768, 0); 531 | { 532 | while (remade_tokens.size() > 0) 533 | { 534 | std::vector rem_tokens(remade_tokens.begin() + 75, remade_tokens.end()); 535 | std::vector rem_multipliers(multipliers.begin() + 75, multipliers.end()); 536 | std::vector current_tokens; 537 | std::vector current_multipliers; 538 | if (remade_tokens.size() > 0) 539 | { 540 | current_tokens.insert(current_tokens.end(), remade_tokens.begin(), remade_tokens.begin() + 75); 541 | current_multipliers.insert(current_multipliers.end(), multipliers.begin(), multipliers.begin() + 75); 542 | } 543 | else 544 | { 545 | std::vector tmp_token(75, 49407); 546 | current_tokens.insert(current_tokens.end(), tmp_token.begin(), tmp_token.end()); 547 | std::vector tmp_multipliers(75, 1.0f); 548 | current_multipliers.insert(current_multipliers.end(), tmp_multipliers.begin(), tmp_multipliers.end()); 549 | } 550 | { 551 | ncnn::Mat token_mat = ncnn::Mat(77); 552 | token_mat.fill(int(49406)); 553 | ncnn::Mat multiplier_mat = ncnn::Mat(77); 554 | multiplier_mat.fill(1.0f); 555 | int* token_ptr = token_mat; 556 | float* multiplier_ptr = multiplier_mat; 557 | 558 | for (int i = 0; i < 75; i++) 559 | { 560 | token_ptr[i + 1] = int(current_tokens[i]); 561 | multiplier_ptr[i + 1] = current_multipliers[i]; 562 | } 563 | 564 | ncnn::Extractor ex = net.create_extractor(); 565 | ex.set_light_mode(true); 566 | ex.input("token", token_mat); 567 | ex.input("multiplier", multiplier_mat); 568 | ex.input("cond", embVec); 569 | ncnn::Mat new_conds; 570 | ex.extract("conds", new_conds); 571 | embVec = new_conds; 572 | } 573 | remade_tokens = rem_tokens; 574 | multipliers = rem_multipliers; 575 | } 576 | } 577 | return embVec; 578 | } 579 | std::pair tinyDream::promptEncoder(const std::string& positivePrompt, const std::string& negativePrompt) 580 | { 581 | ncnn::Net net; 582 | _log("[-Info-]: Token Embedding - Using Frozen CLIP Text Encoder for encoding prompts...\n"); 583 | auto startingTime = ncnn::get_current_time(); 584 | net.opt.use_vulkan_compute = false; 585 | net.opt.use_winograd_convolution = false; 586 | net.opt.use_sgemm_convolution = false; 587 | net.opt.use_fp16_packed = true; 588 | net.opt.use_fp16_storage = true; 589 | net.opt.use_fp16_arithmetic = true; 590 | net.opt.use_packing_layout = true; 591 | net.load_param(joinPaths("FrozenCLIPEmbedder-fp16.param").c_str()); 592 | net.load_model(joinPaths("FrozenCLIPEmbedder-fp16.bin").c_str()); 593 | auto elapsed = ncnn::get_current_time() - startingTime; 594 | _log(std::string{ "Frozen CLIP Text Encoder took " } + std::to_string(elapsed) + std::string{ " milliseconds to complete.\n" }); 595 | return std::make_pair(getTextEmbedding(net, positivePrompt), getTextEmbedding(net, negativePrompt)); 596 | } 597 | bool tinyDream::loadTokens() 598 | { 599 | if (idxTokens.empty()) { 600 | _log("[-Info-]: Token Embedding - Building Tokens Table from Vocabulary\n"); 601 | std::string pathname = joinPaths("vocab.txt"); 602 | std::ifstream infile; 603 | infile.open(pathname.c_str()); 604 | if (!infile.is_open()) { 605 | _log(std::string{ "[-ERROR-]: IO error while opening: '" } + pathname + std::string{ "'. Make sure your Pre-Trained Assets & Models are located on a directory accessible to this executable. Download the Pre-Trained Assets & Models from https://pixlab.io/tiny-dream#downloads\n" }); 606 | return false; 607 | } 608 | std::string s; 609 | int idx = 0; 610 | while (getline(infile, s)) 611 | { 612 | idxTokens.insert(std::make_pair(s, idx)); 613 | idx++; 614 | } 615 | infile.close(); 616 | _log(std::string{ "[-Info-]: Token Embedding - Finished Building (" } + std::to_string(idxTokens.size()) + std::string{ ") Tokens Table\n" }); 617 | } 618 | else 619 | _log("[-Info-]: Token Embedding - Tokens Table Already Loaded. Skipping\n"); 620 | return true; 621 | } 622 | bool tinyDream::dream(const std::string& positivePrompt, const std::string& negativePrompt, std::string& outputImgPath, bool upScale, int seed, int step) 623 | { 624 | if (positivePrompt.empty()) { 625 | _log(std::string{ "[-ERROR-]: Missing Positive Prompt (Keywords): Describe something you'd like to see generated using words separated by commas. High priority or meta instructions must be surrounded by parenthesis.\n" }); 626 | return false; 627 | } 628 | if (negativePrompt.empty()) { 629 | // Not so fatal 630 | _log(std::string{ "[-Notice-]: Missing Negative Prompt (Keywords): Describe something you don't like to see generated. Example of such words are: blood, mutilation, gore, genitals, nudity, etc.\n" }); 631 | } 632 | if (xLog) { 633 | std::string logmsg{ "[-Info-]: Starting Stable Diffusion Inference with the following configuration:\n" }; 634 | logmsg += std::string{ "\n\tPositive Prompt: " } + positivePrompt; 635 | if (negativePrompt.size() > 0) 636 | logmsg += std::string{ "\n\tNegative Prompt: " } + negativePrompt; 637 | logmsg += std::string{ "\n\tInference Steps: " } + std::to_string(step); 638 | if (step > 35) { 639 | logmsg += std::string{ "\n\t\t[-Notice-]: Using more inference steps may produce a slightly different picture, but not necessarily better quality. In addition, the iterative nature of the process makes generation slow; the more steps you'll use, the more time it will take to generate an image!" }; 640 | } 641 | logmsg += std::string{ "\n\tCurrent Seed Generation: " } + std::to_string(seed) + std::string{ "\n" }; 642 | _log(logmsg); 643 | } 644 | auto startingTime = ncnn::get_current_time(); 645 | if (!loadTokens()) 646 | return false; // Check your log handler callback for any error messages 647 | auto vecEmb = promptEncoder(positivePrompt, negativePrompt); 648 | auto sample = diffusionSolver(vecEmb.first, vecEmb.second, seed, step); 649 | ncnn::Mat outMat = decoderSolver(sample); 650 | auto elapsed = ncnn::get_current_time() - startingTime; 651 | _log(std::string{ "[-Info-]: 512x512 inference output took " } + std::to_string(elapsed) + std::string{ " milliseconds to complete.\n" }); 652 | // Export Pixel Data 653 | int w = 512; 654 | int h = 512; 655 | if (upScale) { 656 | outMat = upScale4xEsprGan(outMat); 657 | w *= 4; 658 | h *= 4; 659 | _log(std::string{ "[-Info-]: Upscale of original 512x512 pixels to 2048x2048 high resolution pixels completed." }); 660 | } 661 | auto zBuf = std::make_unique(w * h * 3/*R G B*/); 662 | outMat.to_pixels(zBuf.get(), ncnn::Mat::PIXEL_RGB); 663 | outputImgPath = outputPath + imgPrefix + randomString() + std::string{ "_" } + std::to_string(step) + std::string{ "_" } + std::to_string(seed) + std::string{ ".png" }; 664 | stbi_write_png(outputImgPath.c_str(), w, h, 3 /*R G B*/, zBuf.get(), 3 * w); 665 | _log(std::string{ "[-Inference Completed-]: Output image: '" } + outputImgPath + std::string{ "' saved to disk." }); 666 | return true; 667 | } --------------------------------------------------------------------------------