├── .gitignore ├── .vscode ├── c_cpp_properties.json └── settings.json ├── COPYING ├── Makefile.am ├── README ├── autogen.sh ├── configure.ac ├── include └── bcfnt.hpp ├── m4 ├── ax_check_compile_flag.m4 ├── ax_cxx_compile_stdcxx.m4 └── ax_cxx_compile_stdcxx_11.m4 └── source ├── bcfnt.cpp └── main.cpp /.gitignore: -------------------------------------------------------------------------------- 1 | mkbcfnt 2 | aclocal.m4 3 | AUTHORS 4 | autom4te.cache/ 5 | ChangeLog 6 | compile 7 | config.log 8 | config.status 9 | configure 10 | depcomp 11 | doc/ 12 | Doxyfile 13 | INSTALL 14 | install-sh 15 | Makefile 16 | Makefile.in 17 | missing 18 | NEWS 19 | README 20 | source/.deps/ 21 | source/.dirstamp 22 | source/*.o 23 | stamp-h1 24 | *.png 25 | *.jpg 26 | *.bin -------------------------------------------------------------------------------- /.vscode/c_cpp_properties.json: -------------------------------------------------------------------------------- 1 | { 2 | "configurations": [ 3 | { 4 | "name": "3DS", 5 | "includePath": [ 6 | "${workspaceFolder}/**", 7 | "C:/Users/chris/AppData/Local/Packages/CanonicalGroupLimited.UbuntuonWindows_79rhkp1fndgsc/LocalState/rootfs/usr/include/**", 8 | "C:/Users/chris/AppData/Local/Packages/CanonicalGroupLimited.UbuntuonWindows_79rhkp1fndgsc/LocalState/rootfs/usr/include/ImageMagick-6/", 9 | "C:/Users/chris/AppData/Local/Packages/CanonicalGroupLimited.UbuntuonWindows_79rhkp1fndgsc/LocalState/rootfs/usr/include/ImageMagick-6/magick" 10 | ], 11 | "browse": { 12 | "path": [ 13 | "${workspaceFolder}/include", 14 | "C:/Users/chris/AppData/Local/Packages/CanonicalGroupLimited.UbuntuonWindows_79rhkp1fndgsc/LocalState/rootfs/usr/include" 15 | ], 16 | "limitSymbolsToIncludedHeaders": false, 17 | "databaseFilename": "" 18 | }, 19 | "defines": [ 20 | "_DEBUG", 21 | "UNICODE", 22 | "_UNICODE", 23 | "VERSION_MAJOR=6", 24 | "VERSION_MINOR=0", 25 | "VERSION_MICRO=0", 26 | "GIT_REV", 27 | "UNIQUE_ID=0xEC100", 28 | "UNIX_HOST", 29 | "PICOC_DEBUG", 30 | "_3DS", 31 | "_GNU_SOURCE=1", 32 | "ARM11" 33 | ], 34 | "intelliSenseMode": "clang-x64", 35 | "cppStandard": "c++17", 36 | "cStandard": "c11" 37 | } 38 | ], 39 | "version": 4 40 | } -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "files.associations": { 3 | "cstdio": "cpp" 4 | } 5 | } -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile.am: -------------------------------------------------------------------------------- 1 | # Makefile.am -- Process this file with automake to produce Makefile.in 2 | 3 | AUTOMAKE_OPTIONS = subdir-objects 4 | 5 | bin_PROGRAMS = mkbcfnt 6 | 7 | mkbcfnt_SOURCES = source/main.cpp \ 8 | source/bcfnt.cpp 9 | 10 | mkbcfnt_LDADD = $(FreeType_LIBS) $(ImageMagick_LIBS) 11 | AM_CPPFLAGS = -I$(srcdir)/include -D_GNU_SOURCE $(FreeType_CFLAGS) $(ImageMagick_CFLAGS) 12 | EXTRA_DIST = autogen.sh 13 | -------------------------------------------------------------------------------- /README: -------------------------------------------------------------------------------- 1 | DEPRECATED AND NON-WORKING; USE https://github.com/devkitPro/tex3ds/tree/feature/mkbcfnt 2 | -------------------------------------------------------------------------------- /autogen.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | touch AUTHORS ChangeLog NEWS README 4 | aclocal 5 | autoconf 6 | automake --add-missing -c 7 | -------------------------------------------------------------------------------- /configure.ac: -------------------------------------------------------------------------------- 1 | # -*- Autoconf -*- 2 | # Process this file with autoconf to produce a configure script. 3 | 4 | AC_PREREQ([2.69]) 5 | AC_INIT([mkbcfnt], [0.0.1], [https://github.com/piepie62/mkbcfnt/issues]) 6 | AC_CONFIG_MACRO_DIR([m4]) 7 | AC_CONFIG_SRCDIR([source/main.cpp]) 8 | 9 | AM_INIT_AUTOMAKE 10 | 11 | # Checks for programs. 12 | AC_PROG_CXX 13 | 14 | AC_LANG_PUSH([C++]) 15 | AX_CHECK_COMPILE_FLAG([-Wall], [CPPFLAGS+=" -Wall"]) 16 | AX_CHECK_COMPILE_FLAG([-pthread], [CPPFLAGS+=" -pthread" LDFLAGS+=" -pthread"]) 17 | AX_CHECK_COMPILE_FLAG([-flto], [CPPFLAGS+=" -flto" LDFLAGS+=" -flto"]) 18 | AX_CHECK_COMPILE_FLAG([-pipe], [CPPFLAGS+=" -pipe"]) 19 | AX_CHECK_COMPILE_FLAG([-fno-exceptions], [CPPFLAGS+=" -fno-exceptions" LDFLAGS+=" -fno-exceptions"]) 20 | AX_CXX_COMPILE_STDCXX_11(noext, mandatory) 21 | AC_LANG_POP() 22 | 23 | AC_CHECK_PROGS([DOT], [dot]) 24 | AM_CONDITIONAL([HAVE_DOT], [test -n "$DOT"]) 25 | AM_COND_IF([HAVE_DOT], AC_SUBST(HAVE_DOT, ["YES"], AC_SUBST(HAVE_DOT, ["NO"]))) 26 | 27 | AC_DEFUN([PKG_CHECK_MODULES_STATIC], 28 | [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl 29 | _save_PKG_CONFIG=$PKG_CONFIG 30 | PKG_CONFIG="$PKG_CONFIG --static" 31 | PKG_CHECK_MODULES([$1], [$2], [$3], [$4], [$5]) 32 | PKG_CONFIG=$_save_PKG_CONFIG[]dnl 33 | ]) 34 | 35 | # Checks for libraries. 36 | PKG_CHECK_MODULES_STATIC(FreeType, [freetype2]) 37 | PKG_CHECK_MODULES_STATIC(ImageMagick, [Magick++ >= 6.0.0]) 38 | 39 | # Checks for header files. 40 | AC_CHECK_HEADERS([unistd.h]) 41 | 42 | # Checks for library functions. 43 | AC_CHECK_FUNCS([strcasecmp]) 44 | 45 | AC_CONFIG_FILES([Makefile]) 46 | AC_OUTPUT 47 | -------------------------------------------------------------------------------- /include/bcfnt.hpp: -------------------------------------------------------------------------------- 1 | #pragma once 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include FT_FREETYPE_H 7 | 8 | /// Character width information structure. 9 | typedef struct 10 | { 11 | int8_t left; ///< Horizontal offset to draw the glyph with. 12 | uint8_t glyphWidth; ///< Width of the glyph. 13 | uint8_t charWidth; ///< Width of the character, that is, horizontal distance to advance. 14 | } charWidthInfo_s; 15 | 16 | /// Font texture sheet information. 17 | typedef struct 18 | { 19 | uint8_t cellWidth; ///< Width of a glyph cell. 20 | uint8_t cellHeight; ///< Height of a glyph cell. 21 | uint8_t baselinePos; ///< Vertical position of the baseline. 22 | uint8_t maxCharWidth; ///< Maximum character width. 23 | 24 | uint32_t sheetSize; ///< Size in bytes of a texture sheet. 25 | uint16_t nSheets; ///< Number of texture sheets. 26 | uint16_t sheetFmt; ///< GPU texture format (GPU_TEXCOLOR). 27 | 28 | uint16_t nRows; ///< Number of glyphs per row per sheet. 29 | uint16_t nLines; ///< Number of glyph rows per sheet. 30 | 31 | uint16_t sheetWidth; ///< Texture sheet width. 32 | uint16_t sheetHeight; ///< Texture sheet height. 33 | uint32_t sheetData; ///< Pointer to texture sheet data. 34 | } TGLP_s; 35 | 36 | /// Font character width information block type. 37 | typedef struct tag_CWDH_s CWDH_s; 38 | 39 | /// Font character width information block structure. 40 | struct tag_CWDH_s 41 | { 42 | uint16_t startIndex; ///< First Unicode codepoint the block applies to. 43 | uint16_t endIndex; ///< Last Unicode codepoint the block applies to. 44 | uint32_t next; ///< Pointer to the next block. 45 | 46 | charWidthInfo_s widths[0]; ///< Table of character width information structures. 47 | }; 48 | 49 | /// Font character map methods. 50 | enum 51 | { 52 | CMAP_TYPE_DIRECT = 0, ///< Identity mapping. 53 | CMAP_TYPE_TABLE = 1, ///< Mapping using a table. 54 | CMAP_TYPE_SCAN = 2, ///< Mapping using a list of mapped characters. 55 | }; 56 | 57 | /// Font character map type. 58 | typedef struct tag_CMAP_s CMAP_s; 59 | 60 | /// Font character map structure. 61 | struct tag_CMAP_s 62 | { 63 | uint16_t codeBegin; ///< First Unicode codepoint the block applies to. 64 | uint16_t codeEnd; ///< Last Unicode codepoint the block applies to. 65 | uint16_t mappingMethod; ///< Mapping method. 66 | uint16_t reserved; 67 | uint32_t next; ///< Pointer to the next map. 68 | 69 | union 70 | { 71 | uint16_t indexOffset; ///< For CMAP_TYPE_DIRECT: index of the first glyph. 72 | uint16_t indexTable[0]; ///< For CMAP_TYPE_TABLE: table of glyph indices. 73 | /// For CMAP_TYPE_SCAN: Mapping data. 74 | struct 75 | { 76 | uint16_t nScanEntries; ///< Number of pairs. 77 | /// Mapping pairs. 78 | struct 79 | { 80 | uint16_t code; ///< Unicode codepoint. 81 | uint16_t glyphIndex; ///< Mapped glyph index. 82 | } scanEntries[0]; 83 | }; 84 | }; 85 | }; 86 | 87 | /// Font information structure. 88 | typedef struct 89 | { 90 | uint32_t signature; ///< Signature (FINF). 91 | uint32_t sectionSize; ///< Section size. 92 | 93 | uint8_t fontType; ///< Font type 94 | uint8_t lineFeed; ///< Line feed vertical distance. 95 | uint16_t alterCharIndex; ///< Glyph index of the replacement character. 96 | charWidthInfo_s defaultWidth; ///< Default character width information. 97 | uint8_t encoding; ///< Font encoding (?) 98 | 99 | uint32_t tglp; ///< Pointer to texture sheet information. 100 | uint32_t cwdh; ///< Pointer to the first character width information block. 101 | uint32_t cmap; ///< Pointer to the first character map. 102 | 103 | uint8_t height; ///< Font height. 104 | uint8_t width; ///< Font width. 105 | uint8_t ascent; ///< Font ascent. 106 | uint8_t padding; 107 | } FINF_s; 108 | 109 | /// Font structure. 110 | typedef struct 111 | { 112 | uint32_t signature; ///< Signature (CFNU). 113 | uint16_t endianness; ///< Endianness constant (0xFEFF). 114 | uint16_t headerSize; ///< Header size. 115 | uint32_t version; ///< Format version. 116 | uint32_t fileSize; ///< File size. 117 | uint32_t nBlocks; ///< Number of blocks. 118 | 119 | FINF_s finf; ///< Font information. 120 | } CFNT_s; 121 | 122 | class BCFNT 123 | { 124 | private: 125 | CFNT_s cfnt; 126 | TGLP_s* tglp = nullptr; 127 | uint8_t* sheetData = nullptr; 128 | std::vector> cwdhs; 129 | std::vector> cmaps; 130 | public: 131 | BCFNT(FT_Face font); 132 | ~BCFNT(); 133 | // Literally just a pointer copy, so don't delete/free it afterward! 134 | void addCMAP(CMAP_s* cmap, uint32_t size); 135 | // Literally just a pointer copy, so don't delete/free it afterward! 136 | void addCWDH(CWDH_s* cwdh, uint32_t size); 137 | // Actually copies data in, so you're good to delete/free 138 | void addSheet(uint8_t* sheet); 139 | // Free this after you're done with it: pointer and size 140 | std::pair toStruct(); 141 | }; -------------------------------------------------------------------------------- /m4/ax_check_compile_flag.m4: -------------------------------------------------------------------------------- 1 | # =========================================================================== 2 | # https://www.gnu.org/software/autoconf-archive/ax_check_compile_flag.html 3 | # =========================================================================== 4 | # 5 | # SYNOPSIS 6 | # 7 | # AX_CHECK_COMPILE_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT]) 8 | # 9 | # DESCRIPTION 10 | # 11 | # Check whether the given FLAG works with the current language's compiler 12 | # or gives an error. (Warnings, however, are ignored) 13 | # 14 | # ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on 15 | # success/failure. 16 | # 17 | # If EXTRA-FLAGS is defined, it is added to the current language's default 18 | # flags (e.g. CFLAGS) when the check is done. The check is thus made with 19 | # the flags: "CFLAGS EXTRA-FLAGS FLAG". This can for example be used to 20 | # force the compiler to issue an error when a bad flag is given. 21 | # 22 | # INPUT gives an alternative input source to AC_COMPILE_IFELSE. 23 | # 24 | # NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this 25 | # macro in sync with AX_CHECK_{PREPROC,LINK}_FLAG. 26 | # 27 | # LICENSE 28 | # 29 | # Copyright (c) 2008 Guido U. Draheim 30 | # Copyright (c) 2011 Maarten Bosmans 31 | # 32 | # This program is free software: you can redistribute it and/or modify it 33 | # under the terms of the GNU General Public License as published by the 34 | # Free Software Foundation, either version 3 of the License, or (at your 35 | # option) any later version. 36 | # 37 | # This program is distributed in the hope that it will be useful, but 38 | # WITHOUT ANY WARRANTY; without even the implied warranty of 39 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General 40 | # Public License for more details. 41 | # 42 | # You should have received a copy of the GNU General Public License along 43 | # with this program. If not, see . 44 | # 45 | # As a special exception, the respective Autoconf Macro's copyright owner 46 | # gives unlimited permission to copy, distribute and modify the configure 47 | # scripts that are the output of Autoconf when processing the Macro. You 48 | # need not follow the terms of the GNU General Public License when using 49 | # or distributing such scripts, even though portions of the text of the 50 | # Macro appear in them. The GNU General Public License (GPL) does govern 51 | # all other use of the material that constitutes the Autoconf Macro. 52 | # 53 | # This special exception to the GPL applies to versions of the Autoconf 54 | # Macro released by the Autoconf Archive. When you make and distribute a 55 | # modified version of the Autoconf Macro, you may extend this special 56 | # exception to the GPL to apply to your modified version as well. 57 | 58 | #serial 5 59 | 60 | AC_DEFUN([AX_CHECK_COMPILE_FLAG], 61 | [AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF 62 | AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl 63 | AC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [ 64 | ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS 65 | _AC_LANG_PREFIX[]FLAGS="$[]_AC_LANG_PREFIX[]FLAGS $4 $1" 66 | AC_COMPILE_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])], 67 | [AS_VAR_SET(CACHEVAR,[yes])], 68 | [AS_VAR_SET(CACHEVAR,[no])]) 69 | _AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags]) 70 | AS_VAR_IF(CACHEVAR,yes, 71 | [m4_default([$2], :)], 72 | [m4_default([$3], :)]) 73 | AS_VAR_POPDEF([CACHEVAR])dnl 74 | ])dnl AX_CHECK_COMPILE_FLAGS 75 | -------------------------------------------------------------------------------- /m4/ax_cxx_compile_stdcxx.m4: -------------------------------------------------------------------------------- 1 | # =========================================================================== 2 | # https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html 3 | # =========================================================================== 4 | # 5 | # SYNOPSIS 6 | # 7 | # AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional]) 8 | # 9 | # DESCRIPTION 10 | # 11 | # Check for baseline language coverage in the compiler for the specified 12 | # version of the C++ standard. If necessary, add switches to CXX and 13 | # CXXCPP to enable support. VERSION may be '11' (for the C++11 standard) 14 | # or '14' (for the C++14 standard). 15 | # 16 | # The second argument, if specified, indicates whether you insist on an 17 | # extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g. 18 | # -std=c++11). If neither is specified, you get whatever works, with 19 | # preference for an extended mode. 20 | # 21 | # The third argument, if specified 'mandatory' or if left unspecified, 22 | # indicates that baseline support for the specified C++ standard is 23 | # required and that the macro should error out if no mode with that 24 | # support is found. If specified 'optional', then configuration proceeds 25 | # regardless, after defining HAVE_CXX${VERSION} if and only if a 26 | # supporting mode is found. 27 | # 28 | # LICENSE 29 | # 30 | # Copyright (c) 2008 Benjamin Kosnik 31 | # Copyright (c) 2012 Zack Weinberg 32 | # Copyright (c) 2013 Roy Stogner 33 | # Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov 34 | # Copyright (c) 2015 Paul Norman 35 | # Copyright (c) 2015 Moritz Klammler 36 | # Copyright (c) 2016 Krzesimir Nowak 37 | # 38 | # Copying and distribution of this file, with or without modification, are 39 | # permitted in any medium without royalty provided the copyright notice 40 | # and this notice are preserved. This file is offered as-is, without any 41 | # warranty. 42 | 43 | #serial 7 44 | 45 | dnl This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro 46 | dnl (serial version number 13). 47 | 48 | AX_REQUIRE_DEFINED([AC_MSG_WARN]) 49 | AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl 50 | m4_if([$1], [11], [ax_cxx_compile_alternatives="11 0x"], 51 | [$1], [14], [ax_cxx_compile_alternatives="14 1y"], 52 | [$1], [17], [ax_cxx_compile_alternatives="17 1z"], 53 | [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl 54 | m4_if([$2], [], [], 55 | [$2], [ext], [], 56 | [$2], [noext], [], 57 | [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl 58 | m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true], 59 | [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true], 60 | [$3], [optional], [ax_cxx_compile_cxx$1_required=false], 61 | [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])]) 62 | AC_LANG_PUSH([C++])dnl 63 | ac_success=no 64 | AC_CACHE_CHECK(whether $CXX supports C++$1 features by default, 65 | ax_cv_cxx_compile_cxx$1, 66 | [AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 67 | [ax_cv_cxx_compile_cxx$1=yes], 68 | [ax_cv_cxx_compile_cxx$1=no])]) 69 | if test x$ax_cv_cxx_compile_cxx$1 = xyes; then 70 | ac_success=yes 71 | fi 72 | 73 | m4_if([$2], [noext], [], [dnl 74 | if test x$ac_success = xno; then 75 | for alternative in ${ax_cxx_compile_alternatives}; do 76 | switch="-std=gnu++${alternative}" 77 | cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch]) 78 | AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch, 79 | $cachevar, 80 | [ac_save_CXX="$CXX" 81 | CXX="$CXX $switch" 82 | AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 83 | [eval $cachevar=yes], 84 | [eval $cachevar=no]) 85 | CXX="$ac_save_CXX"]) 86 | if eval test x\$$cachevar = xyes; then 87 | CXX="$CXX $switch" 88 | if test -n "$CXXCPP" ; then 89 | CXXCPP="$CXXCPP $switch" 90 | fi 91 | ac_success=yes 92 | break 93 | fi 94 | done 95 | fi]) 96 | 97 | m4_if([$2], [ext], [], [dnl 98 | if test x$ac_success = xno; then 99 | dnl HP's aCC needs +std=c++11 according to: 100 | dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf 101 | dnl Cray's crayCC needs "-h std=c++11" 102 | for alternative in ${ax_cxx_compile_alternatives}; do 103 | for switch in -std=c++${alternative} +std=c++${alternative} "-h std=c++${alternative}"; do 104 | cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch]) 105 | AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch, 106 | $cachevar, 107 | [ac_save_CXX="$CXX" 108 | CXX="$CXX $switch" 109 | AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 110 | [eval $cachevar=yes], 111 | [eval $cachevar=no]) 112 | CXX="$ac_save_CXX"]) 113 | if eval test x\$$cachevar = xyes; then 114 | CXX="$CXX $switch" 115 | if test -n "$CXXCPP" ; then 116 | CXXCPP="$CXXCPP $switch" 117 | fi 118 | ac_success=yes 119 | break 120 | fi 121 | done 122 | if test x$ac_success = xyes; then 123 | break 124 | fi 125 | done 126 | fi]) 127 | AC_LANG_POP([C++]) 128 | if test x$ax_cxx_compile_cxx$1_required = xtrue; then 129 | if test x$ac_success = xno; then 130 | AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.]) 131 | fi 132 | fi 133 | if test x$ac_success = xno; then 134 | HAVE_CXX$1=0 135 | AC_MSG_NOTICE([No compiler with C++$1 support was found]) 136 | else 137 | HAVE_CXX$1=1 138 | AC_DEFINE(HAVE_CXX$1,1, 139 | [define if the compiler supports basic C++$1 syntax]) 140 | fi 141 | AC_SUBST(HAVE_CXX$1) 142 | m4_if([$1], [17], [AC_MSG_WARN([C++17 is not yet standardized, so the checks may change in incompatible ways anytime])]) 143 | ]) 144 | 145 | 146 | dnl Test body for checking C++11 support 147 | 148 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11], 149 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 150 | ) 151 | 152 | 153 | dnl Test body for checking C++14 support 154 | 155 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14], 156 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 157 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_14 158 | ) 159 | 160 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_17], 161 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 162 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_14 163 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_17 164 | ) 165 | 166 | dnl Tests for new features in C++11 167 | 168 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[ 169 | 170 | // If the compiler admits that it is not ready for C++11, why torture it? 171 | // Hopefully, this will speed up the test. 172 | 173 | #ifndef __cplusplus 174 | 175 | #error "This is not a C++ compiler" 176 | 177 | #elif __cplusplus < 201103L 178 | 179 | #error "This is not a C++11 compiler" 180 | 181 | #else 182 | 183 | namespace cxx11 184 | { 185 | 186 | namespace test_static_assert 187 | { 188 | 189 | template 190 | struct check 191 | { 192 | static_assert(sizeof(int) <= sizeof(T), "not big enough"); 193 | }; 194 | 195 | } 196 | 197 | namespace test_final_override 198 | { 199 | 200 | struct Base 201 | { 202 | virtual void f() {} 203 | }; 204 | 205 | struct Derived : public Base 206 | { 207 | virtual void f() override {} 208 | }; 209 | 210 | } 211 | 212 | namespace test_double_right_angle_brackets 213 | { 214 | 215 | template < typename T > 216 | struct check {}; 217 | 218 | typedef check single_type; 219 | typedef check> double_type; 220 | typedef check>> triple_type; 221 | typedef check>>> quadruple_type; 222 | 223 | } 224 | 225 | namespace test_decltype 226 | { 227 | 228 | int 229 | f() 230 | { 231 | int a = 1; 232 | decltype(a) b = 2; 233 | return a + b; 234 | } 235 | 236 | } 237 | 238 | namespace test_type_deduction 239 | { 240 | 241 | template < typename T1, typename T2 > 242 | struct is_same 243 | { 244 | static const bool value = false; 245 | }; 246 | 247 | template < typename T > 248 | struct is_same 249 | { 250 | static const bool value = true; 251 | }; 252 | 253 | template < typename T1, typename T2 > 254 | auto 255 | add(T1 a1, T2 a2) -> decltype(a1 + a2) 256 | { 257 | return a1 + a2; 258 | } 259 | 260 | int 261 | test(const int c, volatile int v) 262 | { 263 | static_assert(is_same::value == true, ""); 264 | static_assert(is_same::value == false, ""); 265 | static_assert(is_same::value == false, ""); 266 | auto ac = c; 267 | auto av = v; 268 | auto sumi = ac + av + 'x'; 269 | auto sumf = ac + av + 1.0; 270 | static_assert(is_same::value == true, ""); 271 | static_assert(is_same::value == true, ""); 272 | static_assert(is_same::value == true, ""); 273 | static_assert(is_same::value == false, ""); 274 | static_assert(is_same::value == true, ""); 275 | return (sumf > 0.0) ? sumi : add(c, v); 276 | } 277 | 278 | } 279 | 280 | namespace test_noexcept 281 | { 282 | 283 | int f() { return 0; } 284 | int g() noexcept { return 0; } 285 | 286 | static_assert(noexcept(f()) == false, ""); 287 | static_assert(noexcept(g()) == true, ""); 288 | 289 | } 290 | 291 | namespace test_constexpr 292 | { 293 | 294 | template < typename CharT > 295 | unsigned long constexpr 296 | strlen_c_r(const CharT *const s, const unsigned long acc) noexcept 297 | { 298 | return *s ? strlen_c_r(s + 1, acc + 1) : acc; 299 | } 300 | 301 | template < typename CharT > 302 | unsigned long constexpr 303 | strlen_c(const CharT *const s) noexcept 304 | { 305 | return strlen_c_r(s, 0UL); 306 | } 307 | 308 | static_assert(strlen_c("") == 0UL, ""); 309 | static_assert(strlen_c("1") == 1UL, ""); 310 | static_assert(strlen_c("example") == 7UL, ""); 311 | static_assert(strlen_c("another\0example") == 7UL, ""); 312 | 313 | } 314 | 315 | namespace test_rvalue_references 316 | { 317 | 318 | template < int N > 319 | struct answer 320 | { 321 | static constexpr int value = N; 322 | }; 323 | 324 | answer<1> f(int&) { return answer<1>(); } 325 | answer<2> f(const int&) { return answer<2>(); } 326 | answer<3> f(int&&) { return answer<3>(); } 327 | 328 | void 329 | test() 330 | { 331 | int i = 0; 332 | const int c = 0; 333 | static_assert(decltype(f(i))::value == 1, ""); 334 | static_assert(decltype(f(c))::value == 2, ""); 335 | static_assert(decltype(f(0))::value == 3, ""); 336 | } 337 | 338 | } 339 | 340 | namespace test_uniform_initialization 341 | { 342 | 343 | struct test 344 | { 345 | static const int zero {}; 346 | static const int one {1}; 347 | }; 348 | 349 | static_assert(test::zero == 0, ""); 350 | static_assert(test::one == 1, ""); 351 | 352 | } 353 | 354 | namespace test_lambdas 355 | { 356 | 357 | void 358 | test1() 359 | { 360 | auto lambda1 = [](){}; 361 | auto lambda2 = lambda1; 362 | lambda1(); 363 | lambda2(); 364 | } 365 | 366 | int 367 | test2() 368 | { 369 | auto a = [](int i, int j){ return i + j; }(1, 2); 370 | auto b = []() -> int { return '0'; }(); 371 | auto c = [=](){ return a + b; }(); 372 | auto d = [&](){ return c; }(); 373 | auto e = [a, &b](int x) mutable { 374 | const auto identity = [](int y){ return y; }; 375 | for (auto i = 0; i < a; ++i) 376 | a += b--; 377 | return x + identity(a + b); 378 | }(0); 379 | return a + b + c + d + e; 380 | } 381 | 382 | int 383 | test3() 384 | { 385 | const auto nullary = [](){ return 0; }; 386 | const auto unary = [](int x){ return x; }; 387 | using nullary_t = decltype(nullary); 388 | using unary_t = decltype(unary); 389 | const auto higher1st = [](nullary_t f){ return f(); }; 390 | const auto higher2nd = [unary](nullary_t f1){ 391 | return [unary, f1](unary_t f2){ return f2(unary(f1())); }; 392 | }; 393 | return higher1st(nullary) + higher2nd(nullary)(unary); 394 | } 395 | 396 | } 397 | 398 | namespace test_variadic_templates 399 | { 400 | 401 | template 402 | struct sum; 403 | 404 | template 405 | struct sum 406 | { 407 | static constexpr auto value = N0 + sum::value; 408 | }; 409 | 410 | template <> 411 | struct sum<> 412 | { 413 | static constexpr auto value = 0; 414 | }; 415 | 416 | static_assert(sum<>::value == 0, ""); 417 | static_assert(sum<1>::value == 1, ""); 418 | static_assert(sum<23>::value == 23, ""); 419 | static_assert(sum<1, 2>::value == 3, ""); 420 | static_assert(sum<5, 5, 11>::value == 21, ""); 421 | static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, ""); 422 | 423 | } 424 | 425 | // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae 426 | // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function 427 | // because of this. 428 | namespace test_template_alias_sfinae 429 | { 430 | 431 | struct foo {}; 432 | 433 | template 434 | using member = typename T::member_type; 435 | 436 | template 437 | void func(...) {} 438 | 439 | template 440 | void func(member*) {} 441 | 442 | void test(); 443 | 444 | void test() { func(0); } 445 | 446 | } 447 | 448 | } // namespace cxx11 449 | 450 | #endif // __cplusplus >= 201103L 451 | 452 | ]]) 453 | 454 | 455 | dnl Tests for new features in C++14 456 | 457 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[ 458 | 459 | // If the compiler admits that it is not ready for C++14, why torture it? 460 | // Hopefully, this will speed up the test. 461 | 462 | #ifndef __cplusplus 463 | 464 | #error "This is not a C++ compiler" 465 | 466 | #elif __cplusplus < 201402L 467 | 468 | #error "This is not a C++14 compiler" 469 | 470 | #else 471 | 472 | namespace cxx14 473 | { 474 | 475 | namespace test_polymorphic_lambdas 476 | { 477 | 478 | int 479 | test() 480 | { 481 | const auto lambda = [](auto&&... args){ 482 | const auto istiny = [](auto x){ 483 | return (sizeof(x) == 1UL) ? 1 : 0; 484 | }; 485 | const int aretiny[] = { istiny(args)... }; 486 | return aretiny[0]; 487 | }; 488 | return lambda(1, 1L, 1.0f, '1'); 489 | } 490 | 491 | } 492 | 493 | namespace test_binary_literals 494 | { 495 | 496 | constexpr auto ivii = 0b0000000000101010; 497 | static_assert(ivii == 42, "wrong value"); 498 | 499 | } 500 | 501 | namespace test_generalized_constexpr 502 | { 503 | 504 | template < typename CharT > 505 | constexpr unsigned long 506 | strlen_c(const CharT *const s) noexcept 507 | { 508 | auto length = 0UL; 509 | for (auto p = s; *p; ++p) 510 | ++length; 511 | return length; 512 | } 513 | 514 | static_assert(strlen_c("") == 0UL, ""); 515 | static_assert(strlen_c("x") == 1UL, ""); 516 | static_assert(strlen_c("test") == 4UL, ""); 517 | static_assert(strlen_c("another\0test") == 7UL, ""); 518 | 519 | } 520 | 521 | namespace test_lambda_init_capture 522 | { 523 | 524 | int 525 | test() 526 | { 527 | auto x = 0; 528 | const auto lambda1 = [a = x](int b){ return a + b; }; 529 | const auto lambda2 = [a = lambda1(x)](){ return a; }; 530 | return lambda2(); 531 | } 532 | 533 | } 534 | 535 | namespace test_digit_separators 536 | { 537 | 538 | constexpr auto ten_million = 100'000'000; 539 | static_assert(ten_million == 100000000, ""); 540 | 541 | } 542 | 543 | namespace test_return_type_deduction 544 | { 545 | 546 | auto f(int& x) { return x; } 547 | decltype(auto) g(int& x) { return x; } 548 | 549 | template < typename T1, typename T2 > 550 | struct is_same 551 | { 552 | static constexpr auto value = false; 553 | }; 554 | 555 | template < typename T > 556 | struct is_same 557 | { 558 | static constexpr auto value = true; 559 | }; 560 | 561 | int 562 | test() 563 | { 564 | auto x = 0; 565 | static_assert(is_same::value, ""); 566 | static_assert(is_same::value, ""); 567 | return x; 568 | } 569 | 570 | } 571 | 572 | } // namespace cxx14 573 | 574 | #endif // __cplusplus >= 201402L 575 | 576 | ]]) 577 | 578 | 579 | dnl Tests for new features in C++17 580 | 581 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_17], [[ 582 | 583 | // If the compiler admits that it is not ready for C++17, why torture it? 584 | // Hopefully, this will speed up the test. 585 | 586 | #ifndef __cplusplus 587 | 588 | #error "This is not a C++ compiler" 589 | 590 | #elif __cplusplus <= 201402L 591 | 592 | #error "This is not a C++17 compiler" 593 | 594 | #else 595 | 596 | #if defined(__clang__) 597 | #define REALLY_CLANG 598 | #else 599 | #if defined(__GNUC__) 600 | #define REALLY_GCC 601 | #endif 602 | #endif 603 | 604 | #include 605 | #include 606 | #include 607 | 608 | namespace cxx17 609 | { 610 | 611 | #if !defined(REALLY_CLANG) 612 | namespace test_constexpr_lambdas 613 | { 614 | 615 | // TODO: test it with clang++ from git 616 | 617 | constexpr int foo = [](){return 42;}(); 618 | 619 | } 620 | #endif // !defined(REALLY_CLANG) 621 | 622 | namespace test::nested_namespace::definitions 623 | { 624 | 625 | } 626 | 627 | namespace test_fold_expression 628 | { 629 | 630 | template 631 | int multiply(Args... args) 632 | { 633 | return (args * ... * 1); 634 | } 635 | 636 | template 637 | bool all(Args... args) 638 | { 639 | return (args && ...); 640 | } 641 | 642 | } 643 | 644 | namespace test_extended_static_assert 645 | { 646 | 647 | static_assert (true); 648 | 649 | } 650 | 651 | namespace test_auto_brace_init_list 652 | { 653 | 654 | auto foo = {5}; 655 | auto bar {5}; 656 | 657 | static_assert(std::is_same, decltype(foo)>::value); 658 | static_assert(std::is_same::value); 659 | } 660 | 661 | namespace test_typename_in_template_template_parameter 662 | { 663 | 664 | template typename X> struct D; 665 | 666 | } 667 | 668 | namespace test_fallthrough_nodiscard_maybe_unused_attributes 669 | { 670 | 671 | int f1() 672 | { 673 | return 42; 674 | } 675 | 676 | [[nodiscard]] int f2() 677 | { 678 | [[maybe_unused]] auto unused = f1(); 679 | 680 | switch (f1()) 681 | { 682 | case 17: 683 | f1(); 684 | [[fallthrough]]; 685 | case 42: 686 | f1(); 687 | } 688 | return f1(); 689 | } 690 | 691 | } 692 | 693 | namespace test_extended_aggregate_initialization 694 | { 695 | 696 | struct base1 697 | { 698 | int b1, b2 = 42; 699 | }; 700 | 701 | struct base2 702 | { 703 | base2() { 704 | b3 = 42; 705 | } 706 | int b3; 707 | }; 708 | 709 | struct derived : base1, base2 710 | { 711 | int d; 712 | }; 713 | 714 | derived d1 {{1, 2}, {}, 4}; // full initialization 715 | derived d2 {{}, {}, 4}; // value-initialized bases 716 | 717 | } 718 | 719 | namespace test_general_range_based_for_loop 720 | { 721 | 722 | struct iter 723 | { 724 | int i; 725 | 726 | int& operator* () 727 | { 728 | return i; 729 | } 730 | 731 | const int& operator* () const 732 | { 733 | return i; 734 | } 735 | 736 | iter& operator++() 737 | { 738 | ++i; 739 | return *this; 740 | } 741 | }; 742 | 743 | struct sentinel 744 | { 745 | int i; 746 | }; 747 | 748 | bool operator== (const iter& i, const sentinel& s) 749 | { 750 | return i.i == s.i; 751 | } 752 | 753 | bool operator!= (const iter& i, const sentinel& s) 754 | { 755 | return !(i == s); 756 | } 757 | 758 | struct range 759 | { 760 | iter begin() const 761 | { 762 | return {0}; 763 | } 764 | 765 | sentinel end() const 766 | { 767 | return {5}; 768 | } 769 | }; 770 | 771 | void f() 772 | { 773 | range r {}; 774 | 775 | for (auto i : r) 776 | { 777 | [[maybe_unused]] auto v = i; 778 | } 779 | } 780 | 781 | } 782 | 783 | namespace test_lambda_capture_asterisk_this_by_value 784 | { 785 | 786 | struct t 787 | { 788 | int i; 789 | int foo() 790 | { 791 | return [*this]() 792 | { 793 | return i; 794 | }(); 795 | } 796 | }; 797 | 798 | } 799 | 800 | namespace test_enum_class_construction 801 | { 802 | 803 | enum class byte : unsigned char 804 | {}; 805 | 806 | byte foo {42}; 807 | 808 | } 809 | 810 | namespace test_constexpr_if 811 | { 812 | 813 | template 814 | int f () 815 | { 816 | if constexpr(cond) 817 | { 818 | return 13; 819 | } 820 | else 821 | { 822 | return 42; 823 | } 824 | } 825 | 826 | } 827 | 828 | namespace test_selection_statement_with_initializer 829 | { 830 | 831 | int f() 832 | { 833 | return 13; 834 | } 835 | 836 | int f2() 837 | { 838 | if (auto i = f(); i > 0) 839 | { 840 | return 3; 841 | } 842 | 843 | switch (auto i = f(); i + 4) 844 | { 845 | case 17: 846 | return 2; 847 | 848 | default: 849 | return 1; 850 | } 851 | } 852 | 853 | } 854 | 855 | #if !defined(REALLY_CLANG) 856 | namespace test_template_argument_deduction_for_class_templates 857 | { 858 | 859 | // TODO: test it with clang++ from git 860 | 861 | template 862 | struct pair 863 | { 864 | pair (T1 p1, T2 p2) 865 | : m1 {p1}, 866 | m2 {p2} 867 | {} 868 | 869 | T1 m1; 870 | T2 m2; 871 | }; 872 | 873 | void f() 874 | { 875 | [[maybe_unused]] auto p = pair{13, 42u}; 876 | } 877 | 878 | } 879 | #endif // !defined(REALLY_CLANG) 880 | 881 | namespace test_non_type_auto_template_parameters 882 | { 883 | 884 | template 885 | struct B 886 | {}; 887 | 888 | B<5> b1; 889 | B<'a'> b2; 890 | 891 | } 892 | 893 | #if !defined(REALLY_CLANG) 894 | namespace test_structured_bindings 895 | { 896 | 897 | // TODO: test it with clang++ from git 898 | 899 | int arr[2] = { 1, 2 }; 900 | std::pair pr = { 1, 2 }; 901 | 902 | auto f1() -> int(&)[2] 903 | { 904 | return arr; 905 | } 906 | 907 | auto f2() -> std::pair& 908 | { 909 | return pr; 910 | } 911 | 912 | struct S 913 | { 914 | int x1 : 2; 915 | volatile double y1; 916 | }; 917 | 918 | S f3() 919 | { 920 | return {}; 921 | } 922 | 923 | auto [ x1, y1 ] = f1(); 924 | auto& [ xr1, yr1 ] = f1(); 925 | auto [ x2, y2 ] = f2(); 926 | auto& [ xr2, yr2 ] = f2(); 927 | const auto [ x3, y3 ] = f3(); 928 | 929 | } 930 | #endif // !defined(REALLY_CLANG) 931 | 932 | #if !defined(REALLY_CLANG) 933 | namespace test_exception_spec_type_system 934 | { 935 | 936 | // TODO: test it with clang++ from git 937 | 938 | struct Good {}; 939 | struct Bad {}; 940 | 941 | void g1() noexcept; 942 | void g2(); 943 | 944 | template 945 | Bad 946 | f(T*, T*); 947 | 948 | template 949 | Good 950 | f(T1*, T2*); 951 | 952 | static_assert (std::is_same_v); 953 | 954 | } 955 | #endif // !defined(REALLY_CLANG) 956 | 957 | namespace test_inline_variables 958 | { 959 | 960 | template void f(T) 961 | {} 962 | 963 | template inline T g(T) 964 | { 965 | return T{}; 966 | } 967 | 968 | template<> inline void f<>(int) 969 | {} 970 | 971 | template<> int g<>(int) 972 | { 973 | return 5; 974 | } 975 | 976 | } 977 | 978 | } // namespace cxx17 979 | 980 | #endif // __cplusplus <= 201402L 981 | 982 | ]]) 983 | -------------------------------------------------------------------------------- /m4/ax_cxx_compile_stdcxx_11.m4: -------------------------------------------------------------------------------- 1 | # ============================================================================= 2 | # https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx_11.html 3 | # ============================================================================= 4 | # 5 | # SYNOPSIS 6 | # 7 | # AX_CXX_COMPILE_STDCXX_11([ext|noext], [mandatory|optional]) 8 | # 9 | # DESCRIPTION 10 | # 11 | # Check for baseline language coverage in the compiler for the C++11 12 | # standard; if necessary, add switches to CXX and CXXCPP to enable 13 | # support. 14 | # 15 | # This macro is a convenience alias for calling the AX_CXX_COMPILE_STDCXX 16 | # macro with the version set to C++11. The two optional arguments are 17 | # forwarded literally as the second and third argument respectively. 18 | # Please see the documentation for the AX_CXX_COMPILE_STDCXX macro for 19 | # more information. If you want to use this macro, you also need to 20 | # download the ax_cxx_compile_stdcxx.m4 file. 21 | # 22 | # LICENSE 23 | # 24 | # Copyright (c) 2008 Benjamin Kosnik 25 | # Copyright (c) 2012 Zack Weinberg 26 | # Copyright (c) 2013 Roy Stogner 27 | # Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov 28 | # Copyright (c) 2015 Paul Norman 29 | # Copyright (c) 2015 Moritz Klammler 30 | # 31 | # Copying and distribution of this file, with or without modification, are 32 | # permitted in any medium without royalty provided the copyright notice 33 | # and this notice are preserved. This file is offered as-is, without any 34 | # warranty. 35 | 36 | #serial 18 37 | 38 | AX_REQUIRE_DEFINED([AX_CXX_COMPILE_STDCXX]) 39 | AC_DEFUN([AX_CXX_COMPILE_STDCXX_11], [AX_CXX_COMPILE_STDCXX([11], [$1], [$2])]) 40 | -------------------------------------------------------------------------------- /source/bcfnt.cpp: -------------------------------------------------------------------------------- 1 | #include "bcfnt.hpp" 2 | #include 3 | 4 | static constexpr int PIXEL_SIZE = 1; 5 | 6 | BCFNT::BCFNT(FT_Face font) 7 | { 8 | FT_Load_Glyph(font, 0, FT_LOAD_RENDER); 9 | FT_Render_Glyph(font->glyph, FT_RENDER_MODE_NORMAL); 10 | cfnt.finf.lineFeed = font->size->metrics.height / 64; 11 | cfnt.finf.defaultWidth.left = font->glyph->metrics.horiBearingX / 64; 12 | cfnt.finf.defaultWidth.glyphWidth = font->glyph->metrics.width / 64; 13 | cfnt.finf.defaultWidth.charWidth = font->glyph->metrics.horiAdvance / 64; 14 | cfnt.finf.height = (font->bbox.yMax - font->bbox.yMin) / 64; 15 | cfnt.finf.width = (font->bbox.xMax - font->bbox.xMin) / 64; 16 | cfnt.finf.ascent = font->size->metrics.ascender / 64; 17 | cfnt.finf.padding = 0; 18 | 19 | tglp = new TGLP_s; 20 | tglp->cellHeight = (font->bbox.yMax - font->bbox.yMin) / 64; 21 | tglp->cellWidth = (font->bbox.xMax - font->bbox.xMin) / 64; 22 | tglp->baselinePos = -font->size->metrics.ascender / 64; 23 | tglp->maxCharWidth = font->size->metrics.max_advance / 64; 24 | 25 | tglp->nRows = 10; 26 | tglp->nLines = 17; 27 | 28 | tglp->sheetWidth = 128; 29 | tglp->sheetHeight = 512; 30 | tglp->sheetSize = tglp->sheetWidth * tglp->sheetHeight * PIXEL_SIZE; // 4-bit, so virtually multiplied by 2 31 | tglp->sheetFmt = 0x8; //0x0 is RGBA8, but 0xB is 4-bit alpha, which I probably want to work towards. This is going to be a nuisance 32 | tglp->nSheets = 0; 33 | tglp->sheetData = 0; 34 | } 35 | 36 | BCFNT::~BCFNT() 37 | { 38 | delete[] tglp; 39 | free(sheetData); 40 | for (auto cwdh : cwdhs) 41 | { 42 | free(cwdh.first); 43 | } 44 | for (auto cmap : cmaps) 45 | { 46 | free(cmap.first); 47 | } 48 | } 49 | 50 | void BCFNT::addCMAP(CMAP_s* cmap, uint32_t size) 51 | { 52 | cmaps.push_back({cmap, size}); 53 | } 54 | 55 | void BCFNT::addCWDH(CWDH_s* cwdh, uint32_t size) 56 | { 57 | cwdhs.push_back({cwdh, size}); 58 | } 59 | 60 | void BCFNT::addSheet(uint8_t* sheet) 61 | { 62 | if (!sheetData) 63 | { 64 | sheetData = (uint8_t*)malloc(tglp->sheetSize); 65 | } 66 | else 67 | { 68 | sheetData = (uint8_t*) realloc(sheetData, (tglp->nSheets + 1) * tglp->sheetSize); 69 | } 70 | std::copy(sheet, sheet + tglp->sheetSize * tglp->nSheets, sheetData + tglp->sheetSize * tglp->nSheets); 71 | tglp->nSheets++; 72 | } 73 | 74 | std::pair BCFNT::toStruct() 75 | { 76 | size_t size = sizeof(CFNT_s); 77 | for (auto cmap : cmaps) 78 | { 79 | size += cmap.second + 8; // Add CMAP header 80 | } 81 | for (auto cwdh : cwdhs) 82 | { 83 | size += cwdh.second + 8; // Add CWDH header 84 | } 85 | size += sizeof(TGLP_s) + 8; // Add TGLP header 86 | 87 | CFNT_s* font = (CFNT_s*)malloc(size); 88 | std::copy(&cfnt, &cfnt + 1, font); 89 | uint8_t* fontRaw = (uint8_t*) font; // For readability 90 | size_t writtenBytes = 0; 91 | font->signature = 0x544E4643; 92 | font->endianness = 0xFEFF; 93 | font->headerSize = 0x14; 94 | font->version = 0x03000000; 95 | font->fileSize = size; 96 | font->nBlocks = cmaps.size() + cwdhs.size() + 2; // CMAPs, CWDHs, FINF, and TGLP 97 | writtenBytes += 0x14; 98 | 99 | font->finf.signature = 0x464E4946; 100 | font->finf.sectionSize = sizeof(FINF_s); 101 | font->finf.fontType = 1; // ????? 102 | //font->finf.lineFeed Done in constructor 103 | //font->defaultWidth Done in constructor 104 | font->finf.encoding = 1; // ????? 105 | //TGLP, CWDH, and CMAP handled soon 106 | //Height, width, and ascent done in constructor 107 | writtenBytes += sizeof(FINF_s); 108 | 109 | //TGLP data handled in constructor, but endianization needed 110 | uint32_t totalSheetSize = tglp->sheetSize * tglp->nSheets; 111 | fontRaw[writtenBytes++] = 'T'; // TGLP header 112 | fontRaw[writtenBytes++] = 'G'; 113 | fontRaw[writtenBytes++] = 'L'; 114 | fontRaw[writtenBytes++] = 'P'; 115 | *(uint32_t*)(fontRaw + writtenBytes) = sizeof(TGLP_s) + totalSheetSize + 8; // TGLP size 116 | writtenBytes += 4; 117 | font->finf.tglp = writtenBytes; // Set FINF TGLP pointer 118 | std::copy((uint8_t*)tglp, (uint8_t*)(tglp) + sizeof(TGLP_s), fontRaw + writtenBytes); 119 | writtenBytes += sizeof(TGLP_s); 120 | std::copy(sheetData, sheetData + totalSheetSize, fontRaw + writtenBytes); 121 | ((TGLP_s*)(fontRaw + font->finf.tglp))->sheetData = writtenBytes; // Set TGLP sheetData pointer 122 | writtenBytes += totalSheetSize; 123 | 124 | for (size_t i = 0; i < cwdhs.size(); i++) 125 | { 126 | fontRaw[writtenBytes++] = 'C'; 127 | fontRaw[writtenBytes++] = 'W'; 128 | fontRaw[writtenBytes++] = 'D'; 129 | fontRaw[writtenBytes++] = 'H'; 130 | *(uint32_t*)(fontRaw + writtenBytes) = cwdhs[i].second + 8; 131 | writtenBytes += 4; 132 | if (i == 0) 133 | { 134 | font->finf.cwdh = writtenBytes; 135 | } 136 | std::copy((uint8_t*)cwdhs[i].first, (uint8_t*)(cwdhs[i].first) + cwdhs[i].second, fontRaw + writtenBytes); 137 | writtenBytes += cwdhs[i].second; 138 | } 139 | 140 | for (size_t i = 0; i < cmaps.size(); i++) 141 | { 142 | fontRaw[writtenBytes++] = 'C'; 143 | fontRaw[writtenBytes++] = 'M'; 144 | fontRaw[writtenBytes++] = 'A'; 145 | fontRaw[writtenBytes++] = 'P'; 146 | *(uint32_t*)(fontRaw + writtenBytes) = cmaps[i].second + 8; 147 | writtenBytes += 4; 148 | if (i == 0) 149 | { 150 | font->finf.cmap = writtenBytes; 151 | } 152 | std::copy((uint8_t*)cmaps[i].first, (uint8_t*)(cmaps[i].first) + cmaps[i].second, fontRaw + writtenBytes); 153 | writtenBytes += cmaps[i].second; 154 | } 155 | 156 | if (writtenBytes != size) 157 | { 158 | printf("What have you done"); 159 | } 160 | return {font, size}; 161 | } -------------------------------------------------------------------------------- /source/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include FT_FREETYPE_H 3 | #include 4 | #include "bcfnt.hpp" 5 | #include 6 | #include 7 | #include 8 | 9 | FT_Library library; 10 | 11 | void printHelp(char* prog) 12 | { 13 | std::printf("Usage: %s [OPTIONS...] \n", prog); 14 | 15 | std::printf( 16 | " Options:\n" 17 | " Input file\n\n"); 18 | } 19 | 20 | CMAP_s* makeCMAP(std::vector> pairs) 21 | { 22 | CMAP_s* ret = new CMAP_s; 23 | ret->codeBegin = pairs.front().first; 24 | ret->codeBegin = pairs.back().first; 25 | ret->indexOffset = pairs.front().second; 26 | ret->next = 0; 27 | return ret; 28 | } 29 | 30 | CWDH_s* makeCWDH(FT_Face font, std::vector> pairs) 31 | { 32 | CWDH_s* ret = (CWDH_s*) malloc(sizeof(CWDH_s) + 3 * pairs.size()); 33 | ret->startIndex = pairs.front().second; 34 | ret->endIndex = pairs.back().second; 35 | ret->next = 0; 36 | for (size_t i = 0; i < pairs.size(); i++) 37 | { 38 | charWidthInfo_s* info = (charWidthInfo_s*)((char*)(ret) + sizeof(CWDH_s) + 3 * i); 39 | FT_Load_Glyph(font, pairs[i].second, FT_LOAD_RENDER); 40 | info->left = font->glyph->metrics.horiBearingX / 64; // Because they're 26.6 fractional pixel format 41 | info->glyphWidth = font->glyph->metrics.width / 64; 42 | info->charWidth = font->glyph->metrics.horiAdvance / 64; 43 | } 44 | return ret; 45 | } 46 | 47 | // Does both CMAP and CWDH data. Returns the number of indices 48 | int parseEasyData(BCFNT& outFont, FT_Face font) 49 | { 50 | bool continuous = false; 51 | uint16_t lastValidCodepoint = 0xFFFD; 52 | std::vector> indices; 53 | indices.push_back({0xFFFD, 0}); // The missing glyph 54 | int processedChars = 1; 55 | for (uint16_t i = 0; i < 0xFFFF; i++) 56 | { 57 | int index = FT_Get_Char_Index(font, i); 58 | if (index != 0) 59 | { 60 | processedChars++; 61 | if (lastValidCodepoint == i - 1) 62 | { 63 | indices.push_back({i, index}); 64 | } 65 | else 66 | { 67 | outFont.addCMAP(makeCMAP(indices), sizeof(CMAP_s)); 68 | outFont.addCWDH(makeCWDH(font, indices), sizeof(CWDH_s) + 3 * indices.size()); 69 | indices.clear(); 70 | indices.push_back({i, index}); 71 | } 72 | lastValidCodepoint = i; 73 | } 74 | } 75 | outFont.addCMAP(makeCMAP(indices), sizeof(CMAP_s)); 76 | outFont.addCWDH(makeCWDH(font, indices), sizeof(CWDH_s) + 3 * indices.size()); 77 | return processedChars; 78 | } 79 | 80 | inline void swapPixel(Magick::PixelPacket& p1, Magick::PixelPacket& p2) 81 | { 82 | Magick::Color tmp = p1; 83 | p1 = p2; 84 | p2 = tmp; 85 | } 86 | 87 | void swizzle(Magick::PixelPacket* p, bool reverse) 88 | { 89 | // swizzle foursome table 90 | static const unsigned char table[][4] = 91 | { 92 | { 2, 8, 16, 4, }, 93 | { 3, 9, 17, 5, }, 94 | { 6, 10, 24, 20, }, 95 | { 7, 11, 25, 21, }, 96 | { 14, 26, 28, 22, }, 97 | { 15, 27, 29, 23, }, 98 | { 34, 40, 48, 36, }, 99 | { 35, 41, 49, 37, }, 100 | { 38, 42, 56, 52, }, 101 | { 39, 43, 57, 53, }, 102 | { 46, 58, 60, 54, }, 103 | { 47, 59, 61, 55, }, 104 | }; 105 | 106 | if(!reverse) 107 | { 108 | // swizzle each foursome 109 | for(const auto &entry: table) 110 | { 111 | Magick::Color tmp = p[entry[0]]; 112 | p[entry[0]] = p[entry[1]]; 113 | p[entry[1]] = p[entry[2]]; 114 | p[entry[2]] = p[entry[3]]; 115 | p[entry[3]] = tmp; 116 | } 117 | } 118 | else 119 | { 120 | // unswizzle each foursome 121 | for(const auto &entry: table) 122 | { 123 | Magick::Color tmp = p[entry[3]]; 124 | p[entry[3]] = p[entry[2]]; 125 | p[entry[2]] = p[entry[1]]; 126 | p[entry[1]] = p[entry[0]]; 127 | p[entry[0]] = tmp; 128 | } 129 | } 130 | 131 | // (un)swizzle each pair 132 | swapPixel(p[12], p[18]); 133 | swapPixel(p[13], p[19]); 134 | swapPixel(p[44], p[50]); 135 | swapPixel(p[45], p[51]); 136 | } 137 | 138 | /** @brief Swizzle an image (Morton order) 139 | * @param[in] img Image to swizzle 140 | * @param[in] reverse Whether to unswizzle 141 | */ 142 | void swizzle(Magick::Image &img, bool reverse) 143 | { 144 | Magick::Pixels cache(img); 145 | size_t height = img.rows(); 146 | size_t width = img.columns(); 147 | 148 | // (un)swizzle each tile 149 | for(size_t j = 0; j < height; j += 8) 150 | { 151 | for(size_t i = 0; i < width; i += 8) 152 | { 153 | Magick::PixelPacket* p = cache.get(i, j, 8, 8); 154 | swizzle(p, reverse); 155 | cache.sync(); 156 | } 157 | } 158 | } 159 | 160 | void parseImageData(BCFNT& outFont, FT_Face font, const int indices) 161 | { 162 | const int baseline = -font->size->metrics.ascender / 64; 163 | for (int page = 0; page < indices + 170; page += 170) 164 | { 165 | Magick::Image image(Magick::Geometry(256, 512), Magick::Color("#00000000")); 166 | Magick::Pixels cache(image); 167 | for (int glyph = 0; glyph < 170; glyph++) // 10 x 17 * 24 x 30 = 240 x 510 which is a good size 168 | { 169 | if (page + glyph < indices) 170 | { 171 | // if (FT_Load_Glyph(font, page + glyph, FT_LOAD_RENDER)) 172 | // { 173 | // printf("Cleanup on line 152"); 174 | // } 175 | int x = (glyph % 10) * 24; 176 | int y = (glyph / 10) * 30; 177 | Magick::PixelPacket* glyphData = cache.get(x, y, 24, 30); 178 | for (int gy = 0; gy < font->glyph->bitmap.rows; gy++) 179 | { 180 | for (int gx = 0; gx < font->glyph->bitmap.width; gx++) 181 | { 182 | FT_Render_Glyph(font->glyph, FT_RENDER_MODE_NORMAL); 183 | int px = gx + font->glyph->bitmap_left; 184 | int py = gy + (baseline - font->glyph->bitmap_top); 185 | uint8_t pixelVal = font->glyph->bitmap.buffer[gy * font->glyph->bitmap.width + gx]; 186 | glyphData[py * 24 + px].red = 0; 187 | glyphData[py * 24 + px].blue = 0; 188 | glyphData[py * 24 + px].green = 0; 189 | glyphData[py * 24 + px].opacity = pixelVal; 190 | } 191 | } 192 | cache.sync(); 193 | } 194 | else 195 | { 196 | break; 197 | } 198 | } 199 | swizzle(image, false); 200 | uint8_t* data = (uint8_t*)malloc(128*512); // A4 201 | Magick::PixelPacket* pixelData = cache.get(0, 0, 256, 512); 202 | for (int pixel = 0; pixel < 256*512; pixel += 2) 203 | { 204 | data[pixel / 2] = (pixelData[pixel].opacity / 16) | ((pixelData[pixel + 1].opacity / 16) << 4); 205 | } 206 | outFont.addSheet(data); 207 | free(data); 208 | } 209 | } 210 | 211 | int main(int argc, char* argv[]) 212 | { 213 | Magick::InitializeMagick(*argv); 214 | int error; 215 | if (argc < 2) 216 | { 217 | printHelp(argv[0]); 218 | return 1; 219 | } 220 | if (error = FT_Init_FreeType(&library)) 221 | { 222 | std::printf("Bad things have occured: %d\n", error); 223 | return error; 224 | } 225 | FT_Face font; 226 | error = FT_New_Face(library, argv[1], 0, &font); 227 | if (error == FT_Err_Unknown_File_Format) 228 | { 229 | std::printf("`%s` is not a recognized font format\n", argv[1]); 230 | return error; 231 | } 232 | else if (error) 233 | { 234 | std::printf("Reading the font file failed! Error code: %d\n", error); 235 | return error; 236 | } 237 | error = FT_Select_Charmap(font, FT_ENCODING_UNICODE); 238 | if (error) 239 | { 240 | std::printf("`%s` does not have a Unicode character map\n", argv[1]); 241 | return error; 242 | } 243 | // Sets glyph sizes 244 | FT_Set_Pixel_Sizes(font, 24, 30); 245 | 246 | BCFNT outFont(font); 247 | int indices = parseEasyData(outFont, font); 248 | parseImageData(outFont, font, indices); // Currently crashes 249 | 250 | auto fontData = outFont.toStruct(); 251 | FILE* out = fopen("out.bcfnt", "wb"); 252 | fwrite(fontData.first, 1, fontData.second, out); 253 | fclose(out); 254 | 255 | FT_Done_FreeType(library); 256 | return 0; 257 | } --------------------------------------------------------------------------------