From abc15df6b9fae3374d24c7cf5c3ab94c605b2a6d Mon Sep 17 00:00:00 2001 From: Martin Baute Date: Sun, 13 Mar 2016 21:31:40 +0100 Subject: [PATCH] dos2unix --- COPYING.CC0 | 240 +- Readme.rst | 464 +- UNICODE DATA LICENSE.txt | 92 +- functions/_dlmalloc/dlmalloc.c | 12546 ++++++++-------- functions/_dlmalloc/dlmalloc.h | 170 +- functions/locale/UnicodeData.py | 388 +- functions/locale/freelocale.c | 58 +- functions/stdio/_PDCLIB_fillbuffer.c | 92 +- functions/stdio/_PDCLIB_flushbuffer.c | 238 +- functions/stdio/_PDCLIB_ftell64.c | 124 +- functions/stdio/_PDCLIB_fvopen.c | 210 +- functions/stdio/_PDCLIB_seek.c | 82 +- functions/stdio/flockfile.c | 66 +- functions/stdio/ftrylockfile.c | 80 +- functions/stdio/funlockfile.c | 76 +- functions/string/strdup.c | 98 +- functions/string/strndup.c | 126 +- functions/string/strnlen.c | 72 +- functions/uchar/c16rtomb.c | 208 +- functions/uchar/mbrtoc16.c | 190 +- functions/wchar/mbsinit.c | 106 +- functions/wchar/wcscat.c | 90 +- functions/wchar/wcschr.c | 64 +- functions/wchar/wcscmp.c | 78 +- functions/wchar/wcscpy.c | 66 +- functions/wchar/wcscspn.c | 96 +- functions/wchar/wcslen.c | 58 +- functions/wchar/wcsncat.c | 120 +- functions/wchar/wcsncmp.c | 104 +- functions/wchar/wcsncpy.c | 86 +- functions/wchar/wcspbrk.c | 94 +- functions/wchar/wcsrchr.c | 66 +- functions/wchar/wcsspn.c | 94 +- functions/wchar/wcsstr.c | 98 +- functions/wchar/wcstok.c | 226 +- functions/wchar/wmemchr.c | 78 +- functions/wchar/wmemcmp.c | 78 +- functions/wchar/wmemcpy.c | 78 +- functions/wchar/wmemmove.c | 98 +- functions/wctype/iswalnum.c | 60 +- functions/wctype/iswalpha.c | 60 +- functions/wctype/iswblank.c | 58 +- functions/wctype/iswcntrl.c | 60 +- functions/wctype/iswctype.c | 270 +- functions/wctype/iswdigit.c | 104 +- functions/wctype/iswgraph.c | 62 +- functions/wctype/iswlower.c | 62 +- functions/wctype/iswprint.c | 52 +- functions/wctype/iswpunct.c | 62 +- functions/wctype/iswspace.c | 56 +- functions/wctype/iswupper.c | 62 +- functions/wctype/iswxdigit.c | 104 +- functions/wctype/towctrans.c | 84 +- functions/wctype/towlower.c | 82 +- functions/wctype/towupper.c | 82 +- functions/wctype/wctrans.c | 76 +- functions/wctype/wctype.c | 220 +- html/style.css | 286 +- includes/float.h | 202 +- includes/stdnoreturn.h | 24 +- internals/_PDCLIB_float.h | 186 +- internals/_PDCLIB_io.h | 592 +- man3/abort.3 | 102 +- man3/assert.3 | 84 +- man3/assert.h.3 | 76 +- man3/atexit.3 | 198 +- man3/errno.3 | 130 +- man3/errno.h.3 | 226 +- man3/exit.3 | 236 +- man3/flockfile.3 | 110 +- man3/mbsinit.3 | 114 +- man3/pdclib.3 | 190 +- man3/posix_locale.3 | 292 +- man3/setlocale.3 | 164 +- man3/strdup.3 | 116 +- man3/string.h.3 | 226 +- man3/wchar.h.3 | 506 +- opt/c_locale/README.txt | 2 +- opt/c_locale/_PDCLIB_clocale.h | 30 +- opt/c_locale/_PDCLIB_initclocale.c | 56 +- opt/mincoll/wcscoll.c | 72 +- opt/mincoll/wcsxfrm.c | 56 +- opt/nothread/_PDCLIB_threadconfig.h | 48 +- opt/nothread/call_once.c | 80 +- opt/nothread/cnd_init.c | 38 +- opt/nothread/cnd_signal.c | 36 +- opt/nothread/cnd_wait.c | 36 +- opt/nothread/mtx_destroy.c | 32 +- opt/nothread/mtx_init.c | 38 +- opt/nothread/mtx_lock.c | 38 +- opt/nothread/mtx_timedlock.c | 36 +- opt/nothread/mtx_trylock.c | 38 +- opt/nothread/mtx_unlock.c | 40 +- opt/nothread/thrd_yield.c | 36 +- opt/nothread/tss_create.c | 42 +- opt/nothread/tss_delete.c | 38 +- opt/nothread/tss_get.c | 60 +- opt/nothread/tss_set.c | 40 +- opt/notime/time.c | 38 +- opt/notime/timespec_get.c | 36 +- platform/example/Config.jam | 36 +- platform/example/Jamfile | 2 +- .../functions/_PDCLIB/_PDCLIB_fileops.c | 112 +- .../example/functions/_PDCLIB/_PDCLIB_open.c | 74 +- .../example/functions/_PDCLIB/freepages.c | 56 +- .../functions/_PDCLIB/_PDCLIB_freepages.c | 66 +- platform/posix/Config.jam | 36 +- platform/win32/Config.jam | 68 +- platform/win32/Jamfile | 10 +- platform/win32/crt0.c | 282 +- .../win32/functions/_PDCLIB/_PDCLIB_fileops.c | 174 +- .../functions/_PDCLIB/_PDCLIB_freepages.c | 60 +- .../_PDCLIB/_PDCLIB_runTlsCallbacks.c | 66 +- .../functions/_PDCLIB/_PDCLIB_w32errno.c | 114 +- platform/win32/functions/_PDCLIB/_tls_used.c | 108 +- platform/win32/functions/threads/call_once.c | 158 +- .../win32/functions/threads/mtx_destroy.c | 36 +- platform/win32/functions/threads/mtx_init.c | 56 +- platform/win32/functions/threads/mtx_lock.c | 66 +- .../win32/functions/threads/mtx_timedlock.c | 114 +- .../win32/functions/threads/mtx_trylock.c | 64 +- platform/win32/functions/threads/mtx_unlock.c | 60 +- platform/win32/functions/threads/tss_create.c | 144 +- platform/win32/functions/threads/tss_delete.c | 76 +- platform/win32/functions/threads/tss_get.c | 64 +- platform/win32/functions/threads/tss_set.c | 42 +- .../win32/internals/_PDCLIB_threadconfig.h | 72 +- 127 files changed, 13128 insertions(+), 13128 deletions(-) diff --git a/COPYING.CC0 b/COPYING.CC0 index a471520..1625c17 100644 --- a/COPYING.CC0 +++ b/COPYING.CC0 @@ -1,121 +1,121 @@ -Creative Commons Legal Code - -CC0 1.0 Universal - - CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE - LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN - ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS - INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES - REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS - PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM - THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED - HEREUNDER. - -Statement of Purpose - -The laws of most jurisdictions throughout the world automatically confer -exclusive Copyright and Related Rights (defined below) upon the creator -and subsequent owner(s) (each and all, an "owner") of an original work of -authorship and/or a database (each, a "Work"). - -Certain owners wish to permanently relinquish those rights to a Work for -the purpose of contributing to a commons of creative, cultural and -scientific works ("Commons") that the public can reliably and without fear -of later claims of infringement build upon, modify, incorporate in other -works, reuse and redistribute as freely as possible in any form whatsoever -and for any purposes, including without limitation commercial purposes. -These owners may contribute to the Commons to promote the ideal of a free -culture and the further production of creative, cultural and scientific -works, or to gain reputation or greater distribution for their Work in -part through the use and efforts of others. - -For these and/or other purposes and motivations, and without any -expectation of additional consideration or compensation, the person -associating CC0 with a Work (the "Affirmer"), to the extent that he or she -is an owner of Copyright and Related Rights in the Work, voluntarily -elects to apply CC0 to the Work and publicly distribute the Work under its -terms, with knowledge of his or her Copyright and Related Rights in the -Work and the meaning and intended legal effect of CC0 on those rights. - -1. Copyright and Related Rights. A Work made available under CC0 may be -protected by copyright and related or neighboring rights ("Copyright and -Related Rights"). Copyright and Related Rights include, but are not -limited to, the following: - - i. the right to reproduce, adapt, distribute, perform, display, - communicate, and translate a Work; - ii. moral rights retained by the original author(s) and/or performer(s); -iii. publicity and privacy rights pertaining to a person's image or - likeness depicted in a Work; - iv. rights protecting against unfair competition in regards to a Work, - subject to the limitations in paragraph 4(a), below; - v. rights protecting the extraction, dissemination, use and reuse of data - in a Work; - vi. database rights (such as those arising under Directive 96/9/EC of the - European Parliament and of the Council of 11 March 1996 on the legal - protection of databases, and under any national implementation - thereof, including any amended or successor version of such - directive); and -vii. other similar, equivalent or corresponding rights throughout the - world based on applicable law or treaty, and any national - implementations thereof. - -2. Waiver. To the greatest extent permitted by, but not in contravention -of, applicable law, Affirmer hereby overtly, fully, permanently, -irrevocably and unconditionally waives, abandons, and surrenders all of -Affirmer's Copyright and Related Rights and associated claims and causes -of action, whether now known or unknown (including existing as well as -future claims and causes of action), in the Work (i) in all territories -worldwide, (ii) for the maximum duration provided by applicable law or -treaty (including future time extensions), (iii) in any current or future -medium and for any number of copies, and (iv) for any purpose whatsoever, -including without limitation commercial, advertising or promotional -purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each -member of the public at large and to the detriment of Affirmer's heirs and -successors, fully intending that such Waiver shall not be subject to -revocation, rescission, cancellation, termination, or any other legal or -equitable action to disrupt the quiet enjoyment of the Work by the public -as contemplated by Affirmer's express Statement of Purpose. - -3. Public License Fallback. Should any part of the Waiver for any reason -be judged legally invalid or ineffective under applicable law, then the -Waiver shall be preserved to the maximum extent permitted taking into -account Affirmer's express Statement of Purpose. In addition, to the -extent the Waiver is so judged Affirmer hereby grants to each affected -person a royalty-free, non transferable, non sublicensable, non exclusive, -irrevocable and unconditional license to exercise Affirmer's Copyright and -Related Rights in the Work (i) in all territories worldwide, (ii) for the -maximum duration provided by applicable law or treaty (including future -time extensions), (iii) in any current or future medium and for any number -of copies, and (iv) for any purpose whatsoever, including without -limitation commercial, advertising or promotional purposes (the -"License"). The License shall be deemed effective as of the date CC0 was -applied by Affirmer to the Work. Should any part of the License for any -reason be judged legally invalid or ineffective under applicable law, such -partial invalidity or ineffectiveness shall not invalidate the remainder -of the License, and in such case Affirmer hereby affirms that he or she -will not (i) exercise any of his or her remaining Copyright and Related -Rights in the Work or (ii) assert any associated claims and causes of -action with respect to the Work, in either case contrary to Affirmer's -express Statement of Purpose. - -4. Limitations and Disclaimers. - - a. No trademark or patent rights held by Affirmer are waived, abandoned, - surrendered, licensed or otherwise affected by this document. - b. Affirmer offers the Work as-is and makes no representations or - warranties of any kind concerning the Work, express, implied, - statutory or otherwise, including without limitation warranties of - title, merchantability, fitness for a particular purpose, non - infringement, or the absence of latent or other defects, accuracy, or - the present or absence of errors, whether or not discoverable, all to - the greatest extent permissible under applicable law. - c. Affirmer disclaims responsibility for clearing rights of other persons - that may apply to the Work or any use thereof, including without - limitation any person's Copyright and Related Rights in the Work. - Further, Affirmer disclaims responsibility for obtaining any necessary - consents, permissions or other rights required for any use of the - Work. - d. Affirmer understands and acknowledges that Creative Commons is not a - party to this document and has no duty or obligation with respect to +Creative Commons Legal Code + +CC0 1.0 Universal + + CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE + LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN + ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS + INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES + REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS + PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM + THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED + HEREUNDER. + +Statement of Purpose + +The laws of most jurisdictions throughout the world automatically confer +exclusive Copyright and Related Rights (defined below) upon the creator +and subsequent owner(s) (each and all, an "owner") of an original work of +authorship and/or a database (each, a "Work"). + +Certain owners wish to permanently relinquish those rights to a Work for +the purpose of contributing to a commons of creative, cultural and +scientific works ("Commons") that the public can reliably and without fear +of later claims of infringement build upon, modify, incorporate in other +works, reuse and redistribute as freely as possible in any form whatsoever +and for any purposes, including without limitation commercial purposes. +These owners may contribute to the Commons to promote the ideal of a free +culture and the further production of creative, cultural and scientific +works, or to gain reputation or greater distribution for their Work in +part through the use and efforts of others. + +For these and/or other purposes and motivations, and without any +expectation of additional consideration or compensation, the person +associating CC0 with a Work (the "Affirmer"), to the extent that he or she +is an owner of Copyright and Related Rights in the Work, voluntarily +elects to apply CC0 to the Work and publicly distribute the Work under its +terms, with knowledge of his or her Copyright and Related Rights in the +Work and the meaning and intended legal effect of CC0 on those rights. + +1. Copyright and Related Rights. A Work made available under CC0 may be +protected by copyright and related or neighboring rights ("Copyright and +Related Rights"). Copyright and Related Rights include, but are not +limited to, the following: + + i. the right to reproduce, adapt, distribute, perform, display, + communicate, and translate a Work; + ii. moral rights retained by the original author(s) and/or performer(s); +iii. publicity and privacy rights pertaining to a person's image or + likeness depicted in a Work; + iv. rights protecting against unfair competition in regards to a Work, + subject to the limitations in paragraph 4(a), below; + v. rights protecting the extraction, dissemination, use and reuse of data + in a Work; + vi. database rights (such as those arising under Directive 96/9/EC of the + European Parliament and of the Council of 11 March 1996 on the legal + protection of databases, and under any national implementation + thereof, including any amended or successor version of such + directive); and +vii. other similar, equivalent or corresponding rights throughout the + world based on applicable law or treaty, and any national + implementations thereof. + +2. Waiver. To the greatest extent permitted by, but not in contravention +of, applicable law, Affirmer hereby overtly, fully, permanently, +irrevocably and unconditionally waives, abandons, and surrenders all of +Affirmer's Copyright and Related Rights and associated claims and causes +of action, whether now known or unknown (including existing as well as +future claims and causes of action), in the Work (i) in all territories +worldwide, (ii) for the maximum duration provided by applicable law or +treaty (including future time extensions), (iii) in any current or future +medium and for any number of copies, and (iv) for any purpose whatsoever, +including without limitation commercial, advertising or promotional +purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each +member of the public at large and to the detriment of Affirmer's heirs and +successors, fully intending that such Waiver shall not be subject to +revocation, rescission, cancellation, termination, or any other legal or +equitable action to disrupt the quiet enjoyment of the Work by the public +as contemplated by Affirmer's express Statement of Purpose. + +3. Public License Fallback. Should any part of the Waiver for any reason +be judged legally invalid or ineffective under applicable law, then the +Waiver shall be preserved to the maximum extent permitted taking into +account Affirmer's express Statement of Purpose. In addition, to the +extent the Waiver is so judged Affirmer hereby grants to each affected +person a royalty-free, non transferable, non sublicensable, non exclusive, +irrevocable and unconditional license to exercise Affirmer's Copyright and +Related Rights in the Work (i) in all territories worldwide, (ii) for the +maximum duration provided by applicable law or treaty (including future +time extensions), (iii) in any current or future medium and for any number +of copies, and (iv) for any purpose whatsoever, including without +limitation commercial, advertising or promotional purposes (the +"License"). The License shall be deemed effective as of the date CC0 was +applied by Affirmer to the Work. Should any part of the License for any +reason be judged legally invalid or ineffective under applicable law, such +partial invalidity or ineffectiveness shall not invalidate the remainder +of the License, and in such case Affirmer hereby affirms that he or she +will not (i) exercise any of his or her remaining Copyright and Related +Rights in the Work or (ii) assert any associated claims and causes of +action with respect to the Work, in either case contrary to Affirmer's +express Statement of Purpose. + +4. Limitations and Disclaimers. + + a. No trademark or patent rights held by Affirmer are waived, abandoned, + surrendered, licensed or otherwise affected by this document. + b. Affirmer offers the Work as-is and makes no representations or + warranties of any kind concerning the Work, express, implied, + statutory or otherwise, including without limitation warranties of + title, merchantability, fitness for a particular purpose, non + infringement, or the absence of latent or other defects, accuracy, or + the present or absence of errors, whether or not discoverable, all to + the greatest extent permissible under applicable law. + c. Affirmer disclaims responsibility for clearing rights of other persons + that may apply to the Work or any use thereof, including without + limitation any person's Copyright and Related Rights in the Work. + Further, Affirmer disclaims responsibility for obtaining any necessary + consents, permissions or other rights required for any use of the + Work. + d. Affirmer understands and acknowledges that Creative Commons is not a + party to this document and has no duty or obligation with respect to this CC0 or use of the Work. \ No newline at end of file diff --git a/Readme.rst b/Readme.rst index fce23ea..f3c27a5 100644 --- a/Readme.rst +++ b/Readme.rst @@ -1,233 +1,233 @@ -============================================================== -PDCLib - the `Public Domain C Library `_ -============================================================== - -What is it -========== - -This is a C Standard Library - what's defined in ISO/IEC 9899 "Information -technology — Programming languages — C" or extensions to the above defined in -ISO/IEC 14882 "Information technology — Programming languages — C++". A few -extensions may optionally be provided. - -License -======= - -Written in - * 2003-2012 by Martin "Solar" Baute, - * 2012- by Owen Shepherd - -To the extent possible under law, the author(s) have dedicated all copyright -and related and neighboring rights to this software to the public domain -worldwide. This software is distributed without any warranty. - -You should have received a copy of the CC0 Public Domain Dedication along with -this software. If not, see . - -Exceptions ----------- - -Unicode Character Data -~~~~~~~~~~~~~~~~~~~~~~ -PDCLib necessarily includes Unicode character data derived from that provided by -Unicode, Inc in its' implementation of the localization and wide character -support (in particular for use by the ctype.h and wctype.h functions.) - -Unicode, Inc licenses that data under a license agreement which can be found at -, or in the file -UNICODE_DATA_LICENSE.txt. found in the same directory as this file. - -Test Suite -~~~~~~~~~~ -Portions of the test suite are under different licenses. Where this is the case, -it is clearly noted in the relevant location. - -The license of this code has no bearing upon the licensing of the built library -(as it does not comprise part of it). - -At the time this was written, this exception only applies to portions of the -printf test suite, which are released under the terms of the 2-clause BSD -license (see testing/printf_testcases.h for full details) - -Terms for extensions -==================== -Extensions are permitted only if they pass the following tests: - -Pre-existing wide usage - On most systems, the system C library must maintain its application binary - interface for long periods of time (potentially eternity). Existing wide - usage demonstrates utility - -In keeping with the spirit of the standard - The extension should respect the design, intentions and conventions of the C - standard, and feel like a natural extension to the offered capability. - -Not system dependent - The extension should not add any additional dependencies on the underlying - system - -Non-duplicative - Extensions should not duplicate functionality already provided by the - standard - -Disabled by default - PDCLib will always default to a "strictly conforming" mode exposing only - functionality offered by the version of the standard specified by the - __STDC_VERSION__, __STDC__ or __cplusplus macro; extensions will only be - exposed when requested. - -Additionally, extra consideration will be given to extensions which are -difficult or impossible to implement without access to internal structures of -the C library. - -Conrete Examples: - -strndup - **Included.** strndup is easily defined in terms of existing standard - functions, follows the standard's naming conventions, is in wide usage, and - does not duplicate features already provided. - -posix_memalign - **Rejected.** Has existing wide usage, is not system dependent (can be - implemented, albeit inefficiently, on top of malloc), but naming is not - consistent with the naming used by the standard (posix_ prefix) and - duplicates functionality provided by the C11 standard - -open, close, read, write, ... - **Rejected.** Widely used, but duplicates functionality provided by the - standard (FILE objects set to be unbuffered), and not able to implement full - semantics (e.g. in relation to POSIX fork and other functionality from the - same defining standard) in a platform-neutral way - -strl* - **Rejected.** Used somewhat widely, in keeping with the standard, not system - dependent, but duplicative of functionality provided by (optional) Annex K - of the C standard. - -flockfile, funlockfile, getc_unlocked, putc_unlocked, fwrite_unlocked, ... - **Accepted.** Provide functionality not provided by the standard (and - useful in light of the C11 addition of threading). Can be trivially - implemented in terms of the mutex functions and the bodies of - the existing I/O functions, and impossible to implement externally - -Internals -========= - -As a namespace convention, everything (files, typedefs, functions, -macros) not defined in ISO/IEC 9899 is prefixed with _PDCLIB. -The standard defines any identifiers starting with '_' and a capital -letter as reserved for the implementation, and since the chances of -your compiler using an identifier in the _PDCLIB range are slim, -any strictly conforming application should work with this library. - -PDCLib consists of several parts: - -1) standard headers; -2) implementation files for standard functions; -3) internal header files keeping complex stuff out of the standard - headers; -4) the central, platform-specific file _PDCLIB_config.h; -5) platform-specific implementation files; - -The standard headers (in ./includes/) only contain what they are -defined to contain. Where additional logic or macro magic is -necessary, that is deferred to the internal files. This has been done -so that the headers are actually educational as to what they provide -(as opposed to how the library does it). - -There is a seperate implementation file (in ./function/{header}/) for -every function defined by the standard, named {function}.c. Not only -does this avoid linking in huge amounts of unused code when you use -but a single function, it also allows the optimization overlay to work -(see below). - -(The directory ./functions/_PDCLIB/ contains internal and helper -functions that are not part of the standard.) - -Then there are internal header files (in ./internal/), which contain -all the "black magic" and "code fu" that was kept out of the standard -headers. You should not have to touch them if you want to adapt PDCLib -to a new platform. Note that, if you *do* have to touch them, I would -consider it a serious design flaw, and would be happy to fix it in the -next PDCLib release. Any adaption work should be covered by the steps -detailed below. - -For adapting PDCLib to a new platform (the trinity of CPU, operating -system, and compiler), make a copy of ./platform/example/ named -./platform/{your_platform}/, and modify the files of your copy to suit -the constraints of your platform. When you are done, copy the contents -of your platform directory over the source directory structure -of PDCLib (or link them into the appropriate places). That should be -all that is actually required to make PDCLib work for your platform. - -Future directions -================= -Obviously, full C89, C99 and C11 conformance; and full support for the -applicable portions of C++98, C++03 and C++11 (the version which acomplishes -this will be christened "1.0"). - -Support for "optimization overlays." These would allow efficient -implementations of certain functions on individual platforms, for example -memcpy, strcpy and memset. This requires further work to only compile in one -version of a given function. - -Post 1.0, support for C11 Annexe K "Bounds checking interfaces" - -Development Status -================== - -``v0.1 - 2004-12-12`` - Freestanding-only C99 implementation without any overlay, and missing - the INTN_C() / UINTN_C() macros. still has the enquire.c - values hardcoded into it; not sure whether to include enquire.c in the - package, to leave to the overlay, or devise some parameterized - macro magic as for / . Not thoroughly tested, but - I had to make the 0.1 release sometime so why not now. - -``v0.2 - 2005-01-12`` - Adds implementations for (excluding strerror()), INTN_C() / - UINTN_C() macros, and some improvements in the internal headers. - Test drivers still missing, but added warnings about that. - -``v0.3 - 2005-11-21`` - Adds test drivers, fixes some bugs in . - -``v0.4 - 2005-02-06`` - Implementations for parts of . Still missing are the floating - point conversions, and the wide-/multibyte-character functions. - -``v0.4.1 - 2006-11-16`` - With v0.5 () taking longer than expected, v0.4.1 was set up as - a backport of bugfixes in the current development code. - - - #1 realloc( NULL, size ) fails - - #2 stdlib.h - insufficient documentation - - #4 Misspelled name in credits - - #5 malloc() splits off too-small nodes - - #6 qsort() stack overflow - - #7 malloc() bug in list handling - - #8 strncmp() does not terminate at '\0' - - #9 stdint.h dysfunctional - - #10 NULL redefinition warnings - -``v0.5 - 2010-12-22`` - Implementations for , , most parts of , - and strerror() from . - Still no locale / wide-char support. Enabled all GCC compiler warnings I - could find, and fixed everything that threw a warning. (You see this, - maintainers of Open Source software? No warnings whatsoever. Stop telling - me it cannot be done.) Fixed all known bugs in the v0.4 release. - -Near Future -=========== -Current development directions are: - -Implement portions of the C11 standard that have a direct impact on the way -that PDCLib itself is built. For example, in order to support multithreading, -PDCLib needs a threading abstraction; therefore, C11's thread library is being -implemented to provide the backing for this (as there is no purpose in -implementing two abstractions) - -Modularize the library somewhat. This can already be seen with components under -"opt/". This structure is preliminary; it will likely change as the process +============================================================== +PDCLib - the `Public Domain C Library `_ +============================================================== + +What is it +========== + +This is a C Standard Library - what's defined in ISO/IEC 9899 "Information +technology — Programming languages — C" or extensions to the above defined in +ISO/IEC 14882 "Information technology — Programming languages — C++". A few +extensions may optionally be provided. + +License +======= + +Written in + * 2003-2012 by Martin "Solar" Baute, + * 2012- by Owen Shepherd + +To the extent possible under law, the author(s) have dedicated all copyright +and related and neighboring rights to this software to the public domain +worldwide. This software is distributed without any warranty. + +You should have received a copy of the CC0 Public Domain Dedication along with +this software. If not, see . + +Exceptions +---------- + +Unicode Character Data +~~~~~~~~~~~~~~~~~~~~~~ +PDCLib necessarily includes Unicode character data derived from that provided by +Unicode, Inc in its' implementation of the localization and wide character +support (in particular for use by the ctype.h and wctype.h functions.) + +Unicode, Inc licenses that data under a license agreement which can be found at +, or in the file +UNICODE_DATA_LICENSE.txt. found in the same directory as this file. + +Test Suite +~~~~~~~~~~ +Portions of the test suite are under different licenses. Where this is the case, +it is clearly noted in the relevant location. + +The license of this code has no bearing upon the licensing of the built library +(as it does not comprise part of it). + +At the time this was written, this exception only applies to portions of the +printf test suite, which are released under the terms of the 2-clause BSD +license (see testing/printf_testcases.h for full details) + +Terms for extensions +==================== +Extensions are permitted only if they pass the following tests: + +Pre-existing wide usage + On most systems, the system C library must maintain its application binary + interface for long periods of time (potentially eternity). Existing wide + usage demonstrates utility + +In keeping with the spirit of the standard + The extension should respect the design, intentions and conventions of the C + standard, and feel like a natural extension to the offered capability. + +Not system dependent + The extension should not add any additional dependencies on the underlying + system + +Non-duplicative + Extensions should not duplicate functionality already provided by the + standard + +Disabled by default + PDCLib will always default to a "strictly conforming" mode exposing only + functionality offered by the version of the standard specified by the + __STDC_VERSION__, __STDC__ or __cplusplus macro; extensions will only be + exposed when requested. + +Additionally, extra consideration will be given to extensions which are +difficult or impossible to implement without access to internal structures of +the C library. + +Conrete Examples: + +strndup + **Included.** strndup is easily defined in terms of existing standard + functions, follows the standard's naming conventions, is in wide usage, and + does not duplicate features already provided. + +posix_memalign + **Rejected.** Has existing wide usage, is not system dependent (can be + implemented, albeit inefficiently, on top of malloc), but naming is not + consistent with the naming used by the standard (posix_ prefix) and + duplicates functionality provided by the C11 standard + +open, close, read, write, ... + **Rejected.** Widely used, but duplicates functionality provided by the + standard (FILE objects set to be unbuffered), and not able to implement full + semantics (e.g. in relation to POSIX fork and other functionality from the + same defining standard) in a platform-neutral way + +strl* + **Rejected.** Used somewhat widely, in keeping with the standard, not system + dependent, but duplicative of functionality provided by (optional) Annex K + of the C standard. + +flockfile, funlockfile, getc_unlocked, putc_unlocked, fwrite_unlocked, ... + **Accepted.** Provide functionality not provided by the standard (and + useful in light of the C11 addition of threading). Can be trivially + implemented in terms of the mutex functions and the bodies of + the existing I/O functions, and impossible to implement externally + +Internals +========= + +As a namespace convention, everything (files, typedefs, functions, +macros) not defined in ISO/IEC 9899 is prefixed with _PDCLIB. +The standard defines any identifiers starting with '_' and a capital +letter as reserved for the implementation, and since the chances of +your compiler using an identifier in the _PDCLIB range are slim, +any strictly conforming application should work with this library. + +PDCLib consists of several parts: + +1) standard headers; +2) implementation files for standard functions; +3) internal header files keeping complex stuff out of the standard + headers; +4) the central, platform-specific file _PDCLIB_config.h; +5) platform-specific implementation files; + +The standard headers (in ./includes/) only contain what they are +defined to contain. Where additional logic or macro magic is +necessary, that is deferred to the internal files. This has been done +so that the headers are actually educational as to what they provide +(as opposed to how the library does it). + +There is a seperate implementation file (in ./function/{header}/) for +every function defined by the standard, named {function}.c. Not only +does this avoid linking in huge amounts of unused code when you use +but a single function, it also allows the optimization overlay to work +(see below). + +(The directory ./functions/_PDCLIB/ contains internal and helper +functions that are not part of the standard.) + +Then there are internal header files (in ./internal/), which contain +all the "black magic" and "code fu" that was kept out of the standard +headers. You should not have to touch them if you want to adapt PDCLib +to a new platform. Note that, if you *do* have to touch them, I would +consider it a serious design flaw, and would be happy to fix it in the +next PDCLib release. Any adaption work should be covered by the steps +detailed below. + +For adapting PDCLib to a new platform (the trinity of CPU, operating +system, and compiler), make a copy of ./platform/example/ named +./platform/{your_platform}/, and modify the files of your copy to suit +the constraints of your platform. When you are done, copy the contents +of your platform directory over the source directory structure +of PDCLib (or link them into the appropriate places). That should be +all that is actually required to make PDCLib work for your platform. + +Future directions +================= +Obviously, full C89, C99 and C11 conformance; and full support for the +applicable portions of C++98, C++03 and C++11 (the version which acomplishes +this will be christened "1.0"). + +Support for "optimization overlays." These would allow efficient +implementations of certain functions on individual platforms, for example +memcpy, strcpy and memset. This requires further work to only compile in one +version of a given function. + +Post 1.0, support for C11 Annexe K "Bounds checking interfaces" + +Development Status +================== + +``v0.1 - 2004-12-12`` + Freestanding-only C99 implementation without any overlay, and missing + the INTN_C() / UINTN_C() macros. still has the enquire.c + values hardcoded into it; not sure whether to include enquire.c in the + package, to leave to the overlay, or devise some parameterized + macro magic as for / . Not thoroughly tested, but + I had to make the 0.1 release sometime so why not now. + +``v0.2 - 2005-01-12`` + Adds implementations for (excluding strerror()), INTN_C() / + UINTN_C() macros, and some improvements in the internal headers. + Test drivers still missing, but added warnings about that. + +``v0.3 - 2005-11-21`` + Adds test drivers, fixes some bugs in . + +``v0.4 - 2005-02-06`` + Implementations for parts of . Still missing are the floating + point conversions, and the wide-/multibyte-character functions. + +``v0.4.1 - 2006-11-16`` + With v0.5 () taking longer than expected, v0.4.1 was set up as + a backport of bugfixes in the current development code. + + - #1 realloc( NULL, size ) fails + - #2 stdlib.h - insufficient documentation + - #4 Misspelled name in credits + - #5 malloc() splits off too-small nodes + - #6 qsort() stack overflow + - #7 malloc() bug in list handling + - #8 strncmp() does not terminate at '\0' + - #9 stdint.h dysfunctional + - #10 NULL redefinition warnings + +``v0.5 - 2010-12-22`` + Implementations for , , most parts of , + and strerror() from . + Still no locale / wide-char support. Enabled all GCC compiler warnings I + could find, and fixed everything that threw a warning. (You see this, + maintainers of Open Source software? No warnings whatsoever. Stop telling + me it cannot be done.) Fixed all known bugs in the v0.4 release. + +Near Future +=========== +Current development directions are: + +Implement portions of the C11 standard that have a direct impact on the way +that PDCLib itself is built. For example, in order to support multithreading, +PDCLib needs a threading abstraction; therefore, C11's thread library is being +implemented to provide the backing for this (as there is no purpose in +implementing two abstractions) + +Modularize the library somewhat. This can already be seen with components under +"opt/". This structure is preliminary; it will likely change as the process continues. \ No newline at end of file diff --git a/UNICODE DATA LICENSE.txt b/UNICODE DATA LICENSE.txt index 9f693b6..c33d814 100644 --- a/UNICODE DATA LICENSE.txt +++ b/UNICODE DATA LICENSE.txt @@ -1,46 +1,46 @@ -Unicode Data Files include all data files under the directories -http://www.unicode.org/Public/, http://www.unicode.org/reports/, and -http://www.unicode.org/cldr/data/. Unicode Data Files do not include PDF online -code charts under the directory http://www.unicode.org/Public/. Software -includes any source code published in the Unicode Standard or under the -directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and -http://www.unicode.org/cldr/data/. - -NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, -INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S DATA FILES ("DATA FILES"), -AND/OR SOFTWARE ("SOFTWARE"), YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND -BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO -NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWAR. - -COPYRIGHT AND PERMISSION NOTICE - -Copyright © 1991-2013 Unicode, Inc. All rights reserved. Distributed under the -Terms of Use in http://www.unicode.org/copyright.html. - -Permission is hereby granted, free of charge, to any person obtaining a copy of -the Unicode data files and any associated documentation (the "Data Files") or -Unicode software and any associated documentation (the "Software") to deal in -the Data Files or Software without restriction, including without limitation the -rights to use, copy, modify, merge, publish, distribute, and/or sell copies of -the Data Files or Software, and to permit persons to whom the Data Files or -Software are furnished to do so, provided that (a) the above copyright notice(s) -and this permission notice appear with all copies of the Data Files or Software, -(b) both the above copyright notice(s) and this permission notice appear in -associated documentation, and (c) there is clear notice in each modified Data -File or in the Software as well as in the documentation associated with the Data -File(s) or Software that the data or software has been modified. - -THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD -PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS -NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL -DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, -WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING -OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR -SOFTWARE. - -Except as contained in this notice, the name of a copyright holder shall not be -used in advertising or otherwise to promote the sale, use or other dealings in -these Data Files or Software without prior written authorization of the -copyright holder. +Unicode Data Files include all data files under the directories +http://www.unicode.org/Public/, http://www.unicode.org/reports/, and +http://www.unicode.org/cldr/data/. Unicode Data Files do not include PDF online +code charts under the directory http://www.unicode.org/Public/. Software +includes any source code published in the Unicode Standard or under the +directories http://www.unicode.org/Public/, http://www.unicode.org/reports/, and +http://www.unicode.org/cldr/data/. + +NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING, +INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S DATA FILES ("DATA FILES"), +AND/OR SOFTWARE ("SOFTWARE"), YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND +BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO +NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWAR. + +COPYRIGHT AND PERMISSION NOTICE + +Copyright © 1991-2013 Unicode, Inc. All rights reserved. Distributed under the +Terms of Use in http://www.unicode.org/copyright.html. + +Permission is hereby granted, free of charge, to any person obtaining a copy of +the Unicode data files and any associated documentation (the "Data Files") or +Unicode software and any associated documentation (the "Software") to deal in +the Data Files or Software without restriction, including without limitation the +rights to use, copy, modify, merge, publish, distribute, and/or sell copies of +the Data Files or Software, and to permit persons to whom the Data Files or +Software are furnished to do so, provided that (a) the above copyright notice(s) +and this permission notice appear with all copies of the Data Files or Software, +(b) both the above copyright notice(s) and this permission notice appear in +associated documentation, and (c) there is clear notice in each modified Data +File or in the Software as well as in the documentation associated with the Data +File(s) or Software that the data or software has been modified. + +THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, +EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD +PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS +NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL +DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, +WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING +OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR +SOFTWARE. + +Except as contained in this notice, the name of a copyright holder shall not be +used in advertising or otherwise to promote the sale, use or other dealings in +these Data Files or Software without prior written authorization of the +copyright holder. diff --git a/functions/_dlmalloc/dlmalloc.c b/functions/_dlmalloc/dlmalloc.c index 33e393b..4c26642 100644 --- a/functions/_dlmalloc/dlmalloc.c +++ b/functions/_dlmalloc/dlmalloc.c @@ -1,6273 +1,6273 @@ -/* - This is a version (aka dlmalloc) of malloc/free/realloc written by - Doug Lea and released to the public domain, as explained at - http://creativecommons.org/publicdomain/zero/1.0/ Send questions, - comments, complaints, performance data, etc to dl@cs.oswego.edu - -* Version 2.8.5 Sun May 22 10:26:02 2011 Doug Lea (dl at gee) - - Note: There may be an updated version of this malloc obtainable at - ftp://gee.cs.oswego.edu/pub/misc/malloc.c - Check before installing! - -* Quickstart - - This library is all in one file to simplify the most common usage: - ftp it, compile it (-O3), and link it into another program. All of - the compile-time options default to reasonable values for use on - most platforms. You might later want to step through various - compile-time and dynamic tuning options. - - For convenience, an include file for code using this malloc is at: - ftp://gee.cs.oswego.edu/pub/misc/malloc-2.8.5.h - You don't really need this .h file unless you call functions not - defined in your system include files. The .h file contains only the - excerpts from this file needed for using this malloc on ANSI C/C++ - systems, so long as you haven't changed compile-time options about - naming and tuning parameters. If you do, then you can create your - own malloc.h that does include all settings by cutting at the point - indicated below. Note that you may already by default be using a C - library containing a malloc that is based on some version of this - malloc (for example in linux). You might still want to use the one - in this file to customize settings or to avoid overheads associated - with library versions. - -* Vital statistics: - - Supported pointer/size_t representation: 4 or 8 bytes - size_t MUST be an unsigned type of the same width as - pointers. (If you are using an ancient system that declares - size_t as a signed type, or need it to be a different width - than pointers, you can use a previous release of this malloc - (e.g. 2.7.2) supporting these.) - - Alignment: 8 bytes (default) - This suffices for nearly all current machines and C compilers. - However, you can define MALLOC_ALIGNMENT to be wider than this - if necessary (up to 128bytes), at the expense of using more space. - - Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes) - 8 or 16 bytes (if 8byte sizes) - Each malloced chunk has a hidden word of overhead holding size - and status information, and additional cross-check word - if FOOTERS is defined. - - Minimum allocated size: 4-byte ptrs: 16 bytes (including overhead) - 8-byte ptrs: 32 bytes (including overhead) - - Even a request for zero bytes (i.e., malloc(0)) returns a - pointer to something of the minimum allocatable size. - The maximum overhead wastage (i.e., number of extra bytes - allocated than were requested in malloc) is less than or equal - to the minimum size, except for requests >= mmap_threshold that - are serviced via mmap(), where the worst case wastage is about - 32 bytes plus the remainder from a system page (the minimal - mmap unit); typically 4096 or 8192 bytes. - - Security: static-safe; optionally more or less - The "security" of malloc refers to the ability of malicious - code to accentuate the effects of errors (for example, freeing - space that is not currently malloc'ed or overwriting past the - ends of chunks) in code that calls malloc. This malloc - guarantees not to modify any memory locations below the base of - heap, i.e., static variables, even in the presence of usage - errors. The routines additionally detect most improper frees - and reallocs. All this holds as long as the static bookkeeping - for malloc itself is not corrupted by some other means. This - is only one aspect of security -- these checks do not, and - cannot, detect all possible programming errors. - - If FOOTERS is defined nonzero, then each allocated chunk - carries an additional check word to verify that it was malloced - from its space. These check words are the same within each - execution of a program using malloc, but differ across - executions, so externally crafted fake chunks cannot be - freed. This improves security by rejecting frees/reallocs that - could corrupt heap memory, in addition to the checks preventing - writes to statics that are always on. This may further improve - security at the expense of time and space overhead. (Note that - FOOTERS may also be worth using with MSPACES.) - - By default detected errors cause the program to abort (calling - "abort()"). You can override this to instead proceed past - errors by defining PROCEED_ON_ERROR. In this case, a bad free - has no effect, and a malloc that encounters a bad address - caused by user overwrites will ignore the bad address by - dropping pointers and indices to all known memory. This may - be appropriate for programs that should continue if at all - possible in the face of programming errors, although they may - run out of memory because dropped memory is never reclaimed. - - If you don't like either of these options, you can define - CORRUPTION_ERROR_ACTION and USAGE_ERROR_ACTION to do anything - else. And if if you are sure that your program using malloc has - no errors or vulnerabilities, you can define INSECURE to 1, - which might (or might not) provide a small performance improvement. - - It is also possible to limit the maximum total allocatable - space, using malloc_set_footprint_limit. This is not - designed as a security feature in itself (calls to set limits - are not screened or privileged), but may be useful as one - aspect of a secure implementation. - - Thread-safety: NOT thread-safe unless USE_LOCKS defined non-zero - When USE_LOCKS is defined, each public call to malloc, free, - etc is surrounded with a lock. By default, this uses a plain - pthread mutex, win32 critical section, or a spin-lock if if - available for the platform and not disabled by setting - USE_SPIN_LOCKS=0. However, if USE_RECURSIVE_LOCKS is defined, - recursive versions are used instead (which are not required for - base functionality but may be needed in layered extensions). - Using a global lock is not especially fast, and can be a major - bottleneck. It is designed only to provide minimal protection - in concurrent environments, and to provide a basis for - extensions. If you are using malloc in a concurrent program, - consider instead using nedmalloc - (http://www.nedprod.com/programs/portable/nedmalloc/) or - ptmalloc (See http://www.malloc.de), which are derived from - versions of this malloc. - - System requirements: Any combination of MORECORE and/or MMAP/MUNMAP - This malloc can use unix sbrk or any emulation (invoked using - the CALL_MORECORE macro) and/or mmap/munmap or any emulation - (invoked using CALL_MMAP/CALL_MUNMAP) to get and release system - memory. On most unix systems, it tends to work best if both - MORECORE and MMAP are enabled. On Win32, it uses emulations - based on VirtualAlloc. It also uses common C library functions - like memset. - - Compliance: I believe it is compliant with the Single Unix Specification - (See http://www.unix.org). Also SVID/XPG, ANSI C, and probably - others as well. - -* Overview of algorithms - - This is not the fastest, most space-conserving, most portable, or - most tunable malloc ever written. However it is among the fastest - while also being among the most space-conserving, portable and - tunable. Consistent balance across these factors results in a good - general-purpose allocator for malloc-intensive programs. - - In most ways, this malloc is a best-fit allocator. Generally, it - chooses the best-fitting existing chunk for a request, with ties - broken in approximately least-recently-used order. (This strategy - normally maintains low fragmentation.) However, for requests less - than 256bytes, it deviates from best-fit when there is not an - exactly fitting available chunk by preferring to use space adjacent - to that used for the previous small request, as well as by breaking - ties in approximately most-recently-used order. (These enhance - locality of series of small allocations.) And for very large requests - (>= 256Kb by default), it relies on system memory mapping - facilities, if supported. (This helps avoid carrying around and - possibly fragmenting memory used only for large chunks.) - - All operations (except malloc_stats and mallinfo) have execution - times that are bounded by a constant factor of the number of bits in - a size_t, not counting any clearing in calloc or copying in realloc, - or actions surrounding MORECORE and MMAP that have times - proportional to the number of non-contiguous regions returned by - system allocation routines, which is often just 1. In real-time - applications, you can optionally suppress segment traversals using - NO_SEGMENT_TRAVERSAL, which assures bounded execution even when - system allocators return non-contiguous spaces, at the typical - expense of carrying around more memory and increased fragmentation. - - The implementation is not very modular and seriously overuses - macros. Perhaps someday all C compilers will do as good a job - inlining modular code as can now be done by brute-force expansion, - but now, enough of them seem not to. - - Some compilers issue a lot of warnings about code that is - dead/unreachable only on some platforms, and also about intentional - uses of negation on unsigned types. All known cases of each can be - ignored. - - For a longer but out of date high-level description, see - http://gee.cs.oswego.edu/dl/html/malloc.html - -* MSPACES - If MSPACES is defined, then in addition to malloc, free, etc., - this file also defines mspace_malloc, mspace_free, etc. These - are versions of malloc routines that take an "mspace" argument - obtained using create_mspace, to control all internal bookkeeping. - If ONLY_MSPACES is defined, only these versions are compiled. - So if you would like to use this allocator for only some allocations, - and your system malloc for others, you can compile with - ONLY_MSPACES and then do something like... - static mspace mymspace = create_mspace(0,0); // for example - #define mymalloc(bytes) mspace_malloc(mymspace, bytes) - - (Note: If you only need one instance of an mspace, you can instead - use "USE_DL_PREFIX" to relabel the global malloc.) - - You can similarly create thread-local allocators by storing - mspaces as thread-locals. For example: - static __thread mspace tlms = 0; - void* tlmalloc(size_t bytes) { - if (tlms == 0) tlms = create_mspace(0, 0); - return mspace_malloc(tlms, bytes); - } - void tlfree(void* mem) { mspace_free(tlms, mem); } - - Unless FOOTERS is defined, each mspace is completely independent. - You cannot allocate from one and free to another (although - conformance is only weakly checked, so usage errors are not always - caught). If FOOTERS is defined, then each chunk carries around a tag - indicating its originating mspace, and frees are directed to their - originating spaces. Normally, this requires use of locks. - - ------------------------- Compile-time options --------------------------- - -Be careful in setting #define values for numerical constants of type -size_t. On some systems, literal values are not automatically extended -to size_t precision unless they are explicitly casted. You can also -use the symbolic values MAX_SIZE_T, SIZE_T_ONE, etc below. - -WIN32 default: defined if _WIN32 defined - Defining WIN32 sets up defaults for MS environment and compilers. - Otherwise defaults are for unix. Beware that there seem to be some - cases where this malloc might not be a pure drop-in replacement for - Win32 malloc: Random-looking failures from Win32 GDI API's (eg; - SetDIBits()) may be due to bugs in some video driver implementations - when pixel buffers are malloc()ed, and the region spans more than - one VirtualAlloc()ed region. Because dlmalloc uses a small (64Kb) - default granularity, pixel buffers may straddle virtual allocation - regions more often than when using the Microsoft allocator. You can - avoid this by using VirtualAlloc() and VirtualFree() for all pixel - buffers rather than using malloc(). If this is not possible, - recompile this malloc with a larger DEFAULT_GRANULARITY. Note: - in cases where MSC and gcc (cygwin) are known to differ on WIN32, - conditions use _MSC_VER to distinguish them. - -DLMALLOC_EXPORT default: extern - Defines how public APIs are declared. If you want to export via a - Windows DLL, you might define this as - #define DLMALLOC_EXPORT extern __declspace(dllexport) - If you want a POSIX ELF shared object, you might use - #define DLMALLOC_EXPORT extern __attribute__((visibility("default"))) - -MALLOC_ALIGNMENT default: (size_t)8 - Controls the minimum alignment for malloc'ed chunks. It must be a - power of two and at least 8, even on machines for which smaller - alignments would suffice. It may be defined as larger than this - though. Note however that code and data structures are optimized for - the case of 8-byte alignment. - -MSPACES default: 0 (false) - If true, compile in support for independent allocation spaces. - This is only supported if HAVE_MMAP is true. - -ONLY_MSPACES default: 0 (false) - If true, only compile in mspace versions, not regular versions. - -USE_LOCKS default: 0 (false) - Causes each call to each public routine to be surrounded with - pthread or WIN32 mutex lock/unlock. (If set true, this can be - overridden on a per-mspace basis for mspace versions.) If set to a - non-zero value other than 1, locks are used, but their - implementation is left out, so lock functions must be supplied manually, - as described below. - -USE_SPIN_LOCKS default: 1 iff USE_LOCKS and spin locks available - If true, uses custom spin locks for locking. This is currently - supported only gcc >= 4.1, older gccs on x86 platforms, and recent - MS compilers. Otherwise, posix locks or win32 critical sections are - used. - -USE_RECURSIVE_LOCKS default: not defined - If defined nonzero, uses recursive (aka reentrant) locks, otherwise - uses plain mutexes. This is not required for malloc proper, but may - be needed for layered allocators such as nedmalloc. - -FOOTERS default: 0 - If true, provide extra checking and dispatching by placing - information in the footers of allocated chunks. This adds - space and time overhead. - -INSECURE default: 0 - If true, omit checks for usage errors and heap space overwrites. - -USE_DL_PREFIX default: NOT defined - Causes compiler to prefix all public routines with the string 'dl'. - This can be useful when you only want to use this malloc in one part - of a program, using your regular system malloc elsewhere. - -MALLOC_INSPECT_ALL default: NOT defined - If defined, compiles malloc_inspect_all and mspace_inspect_all, that - perform traversal of all heap space. Unless access to these - functions is otherwise restricted, you probably do not want to - include them in secure implementations. - -ABORT default: defined as abort() - Defines how to abort on failed checks. On most systems, a failed - check cannot die with an "assert" or even print an informative - message, because the underlying print routines in turn call malloc, - which will fail again. Generally, the best policy is to simply call - abort(). It's not very useful to do more than this because many - errors due to overwriting will show up as address faults (null, odd - addresses etc) rather than malloc-triggered checks, so will also - abort. Also, most compilers know that abort() does not return, so - can better optimize code conditionally calling it. - -PROCEED_ON_ERROR default: defined as 0 (false) - Controls whether detected bad addresses cause them to bypassed - rather than aborting. If set, detected bad arguments to free and - realloc are ignored. And all bookkeeping information is zeroed out - upon a detected overwrite of freed heap space, thus losing the - ability to ever return it from malloc again, but enabling the - application to proceed. If PROCEED_ON_ERROR is defined, the - static variable malloc_corruption_error_count is compiled in - and can be examined to see if errors have occurred. This option - generates slower code than the default abort policy. - -DEBUG default: NOT defined - The DEBUG setting is mainly intended for people trying to modify - this code or diagnose problems when porting to new platforms. - However, it may also be able to better isolate user errors than just - using runtime checks. The assertions in the check routines spell - out in more detail the assumptions and invariants underlying the - algorithms. The checking is fairly extensive, and will slow down - execution noticeably. Calling malloc_stats or mallinfo with DEBUG - set will attempt to check every non-mmapped allocated and free chunk - in the course of computing the summaries. - -ABORT_ON_ASSERT_FAILURE default: defined as 1 (true) - Debugging assertion failures can be nearly impossible if your - version of the assert macro causes malloc to be called, which will - lead to a cascade of further failures, blowing the runtime stack. - ABORT_ON_ASSERT_FAILURE cause assertions failures to call abort(), - which will usually make debugging easier. - -MALLOC_FAILURE_ACTION default: sets errno to ENOMEM, or no-op on win32 - The action to take before "return 0" when malloc fails to be able to - return memory because there is none available. - -HAVE_MORECORE default: 1 (true) unless win32 or ONLY_MSPACES - True if this system supports sbrk or an emulation of it. - -MORECORE default: sbrk - The name of the sbrk-style system routine to call to obtain more - memory. See below for guidance on writing custom MORECORE - functions. The type of the argument to sbrk/MORECORE varies across - systems. It cannot be size_t, because it supports negative - arguments, so it is normally the signed type of the same width as - size_t (sometimes declared as "intptr_t"). It doesn't much matter - though. Internally, we only call it with arguments less than half - the max value of a size_t, which should work across all reasonable - possibilities, although sometimes generating compiler warnings. - -MORECORE_CONTIGUOUS default: 1 (true) if HAVE_MORECORE - If true, take advantage of fact that consecutive calls to MORECORE - with positive arguments always return contiguous increasing - addresses. This is true of unix sbrk. It does not hurt too much to - set it true anyway, since malloc copes with non-contiguities. - Setting it false when definitely non-contiguous saves time - and possibly wasted space it would take to discover this though. - -MORECORE_CANNOT_TRIM default: NOT defined - True if MORECORE cannot release space back to the system when given - negative arguments. This is generally necessary only if you are - using a hand-crafted MORECORE function that cannot handle negative - arguments. - -NO_SEGMENT_TRAVERSAL default: 0 - If non-zero, suppresses traversals of memory segments - returned by either MORECORE or CALL_MMAP. This disables - merging of segments that are contiguous, and selectively - releasing them to the OS if unused, but bounds execution times. - -HAVE_MMAP default: 1 (true) - True if this system supports mmap or an emulation of it. If so, and - HAVE_MORECORE is not true, MMAP is used for all system - allocation. If set and HAVE_MORECORE is true as well, MMAP is - primarily used to directly allocate very large blocks. It is also - used as a backup strategy in cases where MORECORE fails to provide - space from system. Note: A single call to MUNMAP is assumed to be - able to unmap memory that may have be allocated using multiple calls - to MMAP, so long as they are adjacent. - -HAVE_MREMAP default: 1 on linux, else 0 - If true realloc() uses mremap() to re-allocate large blocks and - extend or shrink allocation spaces. - -MMAP_CLEARS default: 1 except on WINCE. - True if mmap clears memory so calloc doesn't need to. This is true - for standard unix mmap using /dev/zero and on WIN32 except for WINCE. - -USE_BUILTIN_FFS default: 0 (i.e., not used) - Causes malloc to use the builtin ffs() function to compute indices. - Some compilers may recognize and intrinsify ffs to be faster than the - supplied C version. Also, the case of x86 using gcc is special-cased - to an asm instruction, so is already as fast as it can be, and so - this setting has no effect. Similarly for Win32 under recent MS compilers. - (On most x86s, the asm version is only slightly faster than the C version.) - -malloc_getpagesize default: derive from system includes, or 4096. - The system page size. To the extent possible, this malloc manages - memory from the system in page-size units. This may be (and - usually is) a function rather than a constant. This is ignored - if WIN32, where page size is determined using getSystemInfo during - initialization. - -USE_DEV_RANDOM default: 0 (i.e., not used) - Causes malloc to use /dev/random to initialize secure magic seed for - stamping footers. Otherwise, the current time is used. - -NO_MALLINFO default: 0 - If defined, don't compile "mallinfo". This can be a simple way - of dealing with mismatches between system declarations and - those in this file. - -MALLINFO_FIELD_TYPE default: size_t - The type of the fields in the mallinfo struct. This was originally - defined as "int" in SVID etc, but is more usefully defined as - size_t. The value is used only if HAVE_USR_INCLUDE_MALLOC_H is not set - -NO_MALLOC_STATS default: 0 - If defined, don't compile "malloc_stats". This avoids calls to - fprintf and bringing in stdio dependencies you might not want. - -REALLOC_ZERO_BYTES_FREES default: not defined - This should be set if a call to realloc with zero bytes should - be the same as a call to free. Some people think it should. Otherwise, - since this malloc returns a unique pointer for malloc(0), so does - realloc(p, 0). - -LACKS_UNISTD_H, LACKS_FCNTL_H, LACKS_SYS_PARAM_H, LACKS_SYS_MMAN_H -LACKS_STRINGS_H, LACKS_STRING_H, LACKS_SYS_TYPES_H, LACKS_ERRNO_H -LACKS_STDLIB_H LACKS_SCHED_H LACKS_TIME_H default: NOT defined unless on WIN32 - Define these if your system does not have these header files. - You might need to manually insert some of the declarations they provide. - -DEFAULT_GRANULARITY default: page size if MORECORE_CONTIGUOUS, - system_info.dwAllocationGranularity in WIN32, - otherwise 64K. - Also settable using mallopt(M_GRANULARITY, x) - The unit for allocating and deallocating memory from the system. On - most systems with contiguous MORECORE, there is no reason to - make this more than a page. However, systems with MMAP tend to - either require or encourage larger granularities. You can increase - this value to prevent system allocation functions to be called so - often, especially if they are slow. The value must be at least one - page and must be a power of two. Setting to 0 causes initialization - to either page size or win32 region size. (Note: In previous - versions of malloc, the equivalent of this option was called - "TOP_PAD") - -DEFAULT_TRIM_THRESHOLD default: 2MB - Also settable using mallopt(M_TRIM_THRESHOLD, x) - The maximum amount of unused top-most memory to keep before - releasing via malloc_trim in free(). Automatic trimming is mainly - useful in long-lived programs using contiguous MORECORE. Because - trimming via sbrk can be slow on some systems, and can sometimes be - wasteful (in cases where programs immediately afterward allocate - more large chunks) the value should be high enough so that your - overall system performance would improve by releasing this much - memory. As a rough guide, you might set to a value close to the - average size of a process (program) running on your system. - Releasing this much memory would allow such a process to run in - memory. Generally, it is worth tuning trim thresholds when a - program undergoes phases where several large chunks are allocated - and released in ways that can reuse each other's storage, perhaps - mixed with phases where there are no such chunks at all. The trim - value must be greater than page size to have any useful effect. To - disable trimming completely, you can set to MAX_SIZE_T. Note that the trick - some people use of mallocing a huge space and then freeing it at - program startup, in an attempt to reserve system memory, doesn't - have the intended effect under automatic trimming, since that memory - will immediately be returned to the system. - -DEFAULT_MMAP_THRESHOLD default: 256K - Also settable using mallopt(M_MMAP_THRESHOLD, x) - The request size threshold for using MMAP to directly service a - request. Requests of at least this size that cannot be allocated - using already-existing space will be serviced via mmap. (If enough - normal freed space already exists it is used instead.) Using mmap - segregates relatively large chunks of memory so that they can be - individually obtained and released from the host system. A request - serviced through mmap is never reused by any other request (at least - not directly; the system may just so happen to remap successive - requests to the same locations). Segregating space in this way has - the benefits that: Mmapped space can always be individually released - back to the system, which helps keep the system level memory demands - of a long-lived program low. Also, mapped memory doesn't become - `locked' between other chunks, as can happen with normally allocated - chunks, which means that even trimming via malloc_trim would not - release them. However, it has the disadvantage that the space - cannot be reclaimed, consolidated, and then used to service later - requests, as happens with normal chunks. The advantages of mmap - nearly always outweigh disadvantages for "large" chunks, but the - value of "large" may vary across systems. The default is an - empirically derived value that works well in most systems. You can - disable mmap by setting to MAX_SIZE_T. - -MAX_RELEASE_CHECK_RATE default: 4095 unless not HAVE_MMAP - The number of consolidated frees between checks to release - unused segments when freeing. When using non-contiguous segments, - especially with multiple mspaces, checking only for topmost space - doesn't always suffice to trigger trimming. To compensate for this, - free() will, with a period of MAX_RELEASE_CHECK_RATE (or the - current number of segments, if greater) try to release unused - segments to the OS when freeing chunks that result in - consolidation. The best value for this parameter is a compromise - between slowing down frees with relatively costly checks that - rarely trigger versus holding on to unused memory. To effectively - disable, set to MAX_SIZE_T. This may lead to a very slight speed - improvement at the expense of carrying around more memory. -*/ - -#ifndef REGTEST -#include "dlmalloc.h" - -/* Version identifier to allow people to support multiple versions */ -#ifndef DLMALLOC_VERSION -#define DLMALLOC_VERSION 20805 -#endif /* DLMALLOC_VERSION */ - -#ifndef DLMALLOC_EXPORT -#define DLMALLOC_EXPORT extern -#endif - -#ifndef WIN32 -#ifdef _WIN32 -#define WIN32 1 -#endif /* _WIN32 */ -#ifdef _WIN32_WCE -#define LACKS_FCNTL_H -#define WIN32 1 -#endif /* _WIN32_WCE */ -#endif /* WIN32 */ -#ifdef WIN32 -#define WIN32_LEAN_AND_MEAN -#include -#include -#define HAVE_MMAP 1 -#define HAVE_MORECORE 0 -#define LACKS_UNISTD_H -#define LACKS_SYS_PARAM_H -#define LACKS_SYS_MMAN_H -#define LACKS_STRING_H -#define LACKS_STRINGS_H -#define LACKS_SYS_TYPES_H -#define LACKS_ERRNO_H -#define LACKS_SCHED_H -#ifndef MALLOC_FAILURE_ACTION -#define MALLOC_FAILURE_ACTION -#endif /* MALLOC_FAILURE_ACTION */ -#ifndef MMAP_CLEARS -#ifdef _WIN32_WCE /* WINCE reportedly does not clear */ -#define MMAP_CLEARS 0 -#else -#define MMAP_CLEARS 1 -#endif /* _WIN32_WCE */ -#endif /*MMAP_CLEARS */ -#endif /* WIN32 */ - -#if defined(DARWIN) || defined(_DARWIN) -/* Mac OSX docs advise not to use sbrk; it seems better to use mmap */ -#ifndef HAVE_MORECORE -#define HAVE_MORECORE 0 -#define HAVE_MMAP 1 -/* OSX allocators provide 16 byte alignment */ -#ifndef MALLOC_ALIGNMENT -#define MALLOC_ALIGNMENT ((size_t)16U) -#endif -#endif /* HAVE_MORECORE */ -#endif /* DARWIN */ - -#ifndef LACKS_SYS_TYPES_H -#include /* For size_t */ -#endif /* LACKS_SYS_TYPES_H */ - -/* The maximum possible size_t value has all bits set */ -#define MAX_SIZE_T (~(size_t)0) - -#ifndef USE_LOCKS /* ensure true if spin or recursive locks set */ -#define USE_LOCKS ((defined(USE_SPIN_LOCKS) && USE_SPIN_LOCKS != 0) || \ - (defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0)) -#endif /* USE_LOCKS */ - -#if USE_LOCKS /* Spin locks for gcc >= 4.1, older gcc on x86, MSC >= 1310 */ -#if ((defined(__GNUC__) && \ - ((__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 1)) || \ - defined(__i386__) || defined(__x86_64__))) || \ - (defined(_MSC_VER) && _MSC_VER>=1310)) -#ifndef USE_SPIN_LOCKS -#define USE_SPIN_LOCKS 1 -#endif /* USE_SPIN_LOCKS */ -#elif USE_SPIN_LOCKS -#error "USE_SPIN_LOCKS defined without implementation" -#endif /* ... locks available... */ -#elif !defined(USE_SPIN_LOCKS) -#define USE_SPIN_LOCKS 0 -#endif /* USE_LOCKS */ - -#ifndef ONLY_MSPACES -#define ONLY_MSPACES 0 -#endif /* ONLY_MSPACES */ -#ifndef MSPACES -#if ONLY_MSPACES -#define MSPACES 1 -#else /* ONLY_MSPACES */ -#define MSPACES 0 -#endif /* ONLY_MSPACES */ -#endif /* MSPACES */ -#ifndef MALLOC_ALIGNMENT -#define MALLOC_ALIGNMENT ((size_t)8U) -#endif /* MALLOC_ALIGNMENT */ -#ifndef FOOTERS -#define FOOTERS 0 -#endif /* FOOTERS */ -#ifndef ABORT -#define ABORT abort() -#endif /* ABORT */ -#ifndef ABORT_ON_ASSERT_FAILURE -#define ABORT_ON_ASSERT_FAILURE 1 -#endif /* ABORT_ON_ASSERT_FAILURE */ -#ifndef PROCEED_ON_ERROR -#define PROCEED_ON_ERROR 0 -#endif /* PROCEED_ON_ERROR */ - -#ifndef INSECURE -#define INSECURE 0 -#endif /* INSECURE */ -#ifndef MALLOC_INSPECT_ALL -#define MALLOC_INSPECT_ALL 0 -#endif /* MALLOC_INSPECT_ALL */ -#ifndef HAVE_MMAP -#define HAVE_MMAP 1 -#endif /* HAVE_MMAP */ -#ifndef MMAP_CLEARS -#define MMAP_CLEARS 1 -#endif /* MMAP_CLEARS */ -#ifndef HAVE_MREMAP -#ifdef linux -#define HAVE_MREMAP 1 -#define _GNU_SOURCE /* Turns on mremap() definition */ -#else /* linux */ -#define HAVE_MREMAP 0 -#endif /* linux */ -#endif /* HAVE_MREMAP */ -#ifndef MALLOC_FAILURE_ACTION -#define MALLOC_FAILURE_ACTION errno = ENOMEM; -#endif /* MALLOC_FAILURE_ACTION */ -#ifndef HAVE_MORECORE -#if ONLY_MSPACES -#define HAVE_MORECORE 0 -#else /* ONLY_MSPACES */ -#define HAVE_MORECORE 1 -#endif /* ONLY_MSPACES */ -#endif /* HAVE_MORECORE */ -#if !HAVE_MORECORE -#define MORECORE_CONTIGUOUS 0 -#else /* !HAVE_MORECORE */ -#define MORECORE_DEFAULT sbrk -#ifndef MORECORE_CONTIGUOUS -#define MORECORE_CONTIGUOUS 1 -#endif /* MORECORE_CONTIGUOUS */ -#endif /* HAVE_MORECORE */ -#ifndef DEFAULT_GRANULARITY -#if (MORECORE_CONTIGUOUS || defined(WIN32)) -#define DEFAULT_GRANULARITY (0) /* 0 means to compute in init_mparams */ -#else /* MORECORE_CONTIGUOUS */ -#define DEFAULT_GRANULARITY ((size_t)64U * (size_t)1024U) -#endif /* MORECORE_CONTIGUOUS */ -#endif /* DEFAULT_GRANULARITY */ -#ifndef DEFAULT_TRIM_THRESHOLD -#ifndef MORECORE_CANNOT_TRIM -#define DEFAULT_TRIM_THRESHOLD ((size_t)2U * (size_t)1024U * (size_t)1024U) -#else /* MORECORE_CANNOT_TRIM */ -#define DEFAULT_TRIM_THRESHOLD MAX_SIZE_T -#endif /* MORECORE_CANNOT_TRIM */ -#endif /* DEFAULT_TRIM_THRESHOLD */ -#ifndef DEFAULT_MMAP_THRESHOLD -#if HAVE_MMAP -#define DEFAULT_MMAP_THRESHOLD ((size_t)256U * (size_t)1024U) -#else /* HAVE_MMAP */ -#define DEFAULT_MMAP_THRESHOLD MAX_SIZE_T -#endif /* HAVE_MMAP */ -#endif /* DEFAULT_MMAP_THRESHOLD */ -#ifndef MAX_RELEASE_CHECK_RATE -#if HAVE_MMAP -#define MAX_RELEASE_CHECK_RATE 4095 -#else -#define MAX_RELEASE_CHECK_RATE MAX_SIZE_T -#endif /* HAVE_MMAP */ -#endif /* MAX_RELEASE_CHECK_RATE */ -#ifndef USE_BUILTIN_FFS -#define USE_BUILTIN_FFS 0 -#endif /* USE_BUILTIN_FFS */ -#ifndef USE_DEV_RANDOM -#define USE_DEV_RANDOM 0 -#endif /* USE_DEV_RANDOM */ -#ifndef NO_MALLINFO -#define NO_MALLINFO 0 -#endif /* NO_MALLINFO */ -#ifndef MALLINFO_FIELD_TYPE -#define MALLINFO_FIELD_TYPE size_t -#endif /* MALLINFO_FIELD_TYPE */ -#ifndef NO_MALLOC_STATS -#define NO_MALLOC_STATS 0 -#endif /* NO_MALLOC_STATS */ -#ifndef NO_SEGMENT_TRAVERSAL -#define NO_SEGMENT_TRAVERSAL 0 -#endif /* NO_SEGMENT_TRAVERSAL */ - -/* - mallopt tuning options. SVID/XPG defines four standard parameter - numbers for mallopt, normally defined in malloc.h. None of these - are used in this malloc, so setting them has no effect. But this - malloc does support the following options. -*/ - -#define M_TRIM_THRESHOLD (-1) -#define M_GRANULARITY (-2) -#define M_MMAP_THRESHOLD (-3) - -/* ------------------------ Mallinfo declarations ------------------------ */ - -#if !NO_MALLINFO -/* - This version of malloc supports the standard SVID/XPG mallinfo - routine that returns a struct containing usage properties and - statistics. It should work on any system that has a - /usr/include/malloc.h defining struct mallinfo. The main - declaration needed is the mallinfo struct that is returned (by-copy) - by mallinfo(). The malloinfo struct contains a bunch of fields that - are not even meaningful in this version of malloc. These fields are - are instead filled by mallinfo() with other numbers that might be of - interest. - - HAVE_USR_INCLUDE_MALLOC_H should be set if you have a - /usr/include/malloc.h file that includes a declaration of struct - mallinfo. If so, it is included; else a compliant version is - declared below. These must be precisely the same for mallinfo() to - work. The original SVID version of this struct, defined on most - systems with mallinfo, declares all fields as ints. But some others - define as unsigned long. If your system defines the fields using a - type of different width than listed here, you MUST #include your - system version and #define HAVE_USR_INCLUDE_MALLOC_H. -*/ - -/* #define HAVE_USR_INCLUDE_MALLOC_H */ - -#ifdef HAVE_USR_INCLUDE_MALLOC_H -#include "/usr/include/malloc.h" -#else /* HAVE_USR_INCLUDE_MALLOC_H */ -#ifndef STRUCT_MALLINFO_DECLARED -/* HP-UX (and others?) redefines mallinfo unless _STRUCT_MALLINFO is defined */ -#define _STRUCT_MALLINFO -#define STRUCT_MALLINFO_DECLARED 1 -struct mallinfo { - MALLINFO_FIELD_TYPE arena; /* non-mmapped space allocated from system */ - MALLINFO_FIELD_TYPE ordblks; /* number of free chunks */ - MALLINFO_FIELD_TYPE smblks; /* always 0 */ - MALLINFO_FIELD_TYPE hblks; /* always 0 */ - MALLINFO_FIELD_TYPE hblkhd; /* space in mmapped regions */ - MALLINFO_FIELD_TYPE usmblks; /* maximum total allocated space */ - MALLINFO_FIELD_TYPE fsmblks; /* always 0 */ - MALLINFO_FIELD_TYPE uordblks; /* total allocated space */ - MALLINFO_FIELD_TYPE fordblks; /* total free space */ - MALLINFO_FIELD_TYPE keepcost; /* releasable (via malloc_trim) space */ -}; -#endif /* STRUCT_MALLINFO_DECLARED */ -#endif /* HAVE_USR_INCLUDE_MALLOC_H */ -#endif /* NO_MALLINFO */ - -/* - Try to persuade compilers to inline. The most critical functions for - inlining are defined as macros, so these aren't used for them. -*/ - -#ifndef FORCEINLINE - #if defined(__GNUC__) -#define FORCEINLINE __inline __attribute__ ((always_inline)) - #elif defined(_MSC_VER) - #define FORCEINLINE __forceinline - #endif -#endif -#ifndef NOINLINE - #if defined(__GNUC__) - #define NOINLINE __attribute__ ((noinline)) - #elif defined(_MSC_VER) - #define NOINLINE __declspec(noinline) - #else - #define NOINLINE - #endif -#endif - -#ifdef __cplusplus -extern "C" { -#ifndef FORCEINLINE - #define FORCEINLINE inline -#endif -#endif /* __cplusplus */ -#ifndef FORCEINLINE - #define FORCEINLINE -#endif - -#if !ONLY_MSPACES - -/* ------------------- Declarations of public routines ------------------- */ - -#ifndef USE_DL_PREFIX -#define dlcalloc calloc -#define dlfree free -#define dlmalloc malloc -#define dlmemalign aligned_alloc -#define dlposix_memalign posix_memalign -#define dlrealloc realloc -#define dlrealloc_in_place realloc_in_place -#define dlvalloc valloc -#define dlpvalloc pvalloc -#define dlmallinfo mallinfo -#define dlmallopt mallopt -#define dlmalloc_trim malloc_trim -#define dlmalloc_stats malloc_stats -#define dlmalloc_usable_size malloc_usable_size -#define dlmalloc_footprint malloc_footprint -#define dlmalloc_max_footprint malloc_max_footprint -#define dlmalloc_footprint_limit malloc_footprint_limit -#define dlmalloc_set_footprint_limit malloc_set_footprint_limit -#define dlmalloc_inspect_all malloc_inspect_all -#define dlindependent_calloc independent_calloc -#define dlindependent_comalloc independent_comalloc -#define dlbulk_free bulk_free -#endif /* USE_DL_PREFIX */ - -#if 0 // Redeclaration warnings as PDCLib already declares these in - -/* - malloc(size_t n) - Returns a pointer to a newly allocated chunk of at least n bytes, or - null if no space is available, in which case errno is set to ENOMEM - on ANSI C systems. - - If n is zero, malloc returns a minimum-sized chunk. (The minimum - size is 16 bytes on most 32bit systems, and 32 bytes on 64bit - systems.) Note that size_t is an unsigned type, so calls with - arguments that would be negative if signed are interpreted as - requests for huge amounts of space, which will often fail. The - maximum supported value of n differs across systems, but is in all - cases less than the maximum representable value of a size_t. -*/ -DLMALLOC_EXPORT void* dlmalloc(size_t); - -/* - free(void* p) - Releases the chunk of memory pointed to by p, that had been previously - allocated using malloc or a related routine such as realloc. - It has no effect if p is null. If p was not malloced or already - freed, free(p) will by default cause the current program to abort. -*/ -DLMALLOC_EXPORT void dlfree(void*); - -/* - calloc(size_t n_elements, size_t element_size); - Returns a pointer to n_elements * element_size bytes, with all locations - set to zero. -*/ -DLMALLOC_EXPORT void* dlcalloc(size_t, size_t); - -/* - realloc(void* p, size_t n) - Returns a pointer to a chunk of size n that contains the same data - as does chunk p up to the minimum of (n, p's size) bytes, or null - if no space is available. - - The returned pointer may or may not be the same as p. The algorithm - prefers extending p in most cases when possible, otherwise it - employs the equivalent of a malloc-copy-free sequence. - - If p is null, realloc is equivalent to malloc. - - If space is not available, realloc returns null, errno is set (if on - ANSI) and p is NOT freed. - - if n is for fewer bytes than already held by p, the newly unused - space is lopped off and freed if possible. realloc with a size - argument of zero (re)allocates a minimum-sized chunk. - - The old unix realloc convention of allowing the last-free'd chunk - to be used as an argument to realloc is not supported. -*/ -DLMALLOC_EXPORT void* dlrealloc(void*, size_t); - -#endif - -/* - realloc_in_place(void* p, size_t n) - Resizes the space allocated for p to size n, only if this can be - done without moving p (i.e., only if there is adjacent space - available if n is greater than p's current allocated size, or n is - less than or equal to p's size). This may be used instead of plain - realloc if an alternative allocation strategy is needed upon failure - to expand space; for example, reallocation of a buffer that must be - memory-aligned or cleared. You can use realloc_in_place to trigger - these alternatives only when needed. - - Returns p if successful; otherwise null. -*/ -DLMALLOC_EXPORT void* dlrealloc_in_place(void*, size_t); - -#if 0 // Redeclaration warnings as PDCLib already declares these in - -/* - memalign(size_t alignment, size_t n); - Returns a pointer to a newly allocated chunk of n bytes, aligned - in accord with the alignment argument. - - The alignment argument should be a power of two. If the argument is - not a power of two, the nearest greater power is used. - 8-byte alignment is guaranteed by normal malloc calls, so don't - bother calling memalign with an argument of 8 or less. - - Overreliance on memalign is a sure way to fragment space. -*/ -DLMALLOC_EXPORT void* dlmemalign(size_t, size_t); - -#endif - -/* - int posix_memalign(void** pp, size_t alignment, size_t n); - Allocates a chunk of n bytes, aligned in accord with the alignment - argument. Differs from memalign only in that it (1) assigns the - allocated memory to *pp rather than returning it, (2) fails and - returns EINVAL if the alignment is not a power of two (3) fails and - returns ENOMEM if memory cannot be allocated. -*/ -DLMALLOC_EXPORT int dlposix_memalign(void**, size_t, size_t); - -/* - valloc(size_t n); - Equivalent to memalign(pagesize, n), where pagesize is the page - size of the system. If the pagesize is unknown, 4096 is used. -*/ -DLMALLOC_EXPORT void* dlvalloc(size_t); - -/* - mallopt(int parameter_number, int parameter_value) - Sets tunable parameters The format is to provide a - (parameter-number, parameter-value) pair. mallopt then sets the - corresponding parameter to the argument value if it can (i.e., so - long as the value is meaningful), and returns 1 if successful else - 0. To workaround the fact that mallopt is specified to use int, - not size_t parameters, the value -1 is specially treated as the - maximum unsigned size_t value. - - SVID/XPG/ANSI defines four standard param numbers for mallopt, - normally defined in malloc.h. None of these are use in this malloc, - so setting them has no effect. But this malloc also supports other - options in mallopt. See below for details. Briefly, supported - parameters are as follows (listed defaults are for "typical" - configurations). - - Symbol param # default allowed param values - M_TRIM_THRESHOLD -1 2*1024*1024 any (-1 disables) - M_GRANULARITY -2 page size any power of 2 >= page size - M_MMAP_THRESHOLD -3 256*1024 any (or 0 if no MMAP support) -*/ -DLMALLOC_EXPORT int dlmallopt(int, int); - -/* - malloc_footprint(); - Returns the number of bytes obtained from the system. The total - number of bytes allocated by malloc, realloc etc., is less than this - value. Unlike mallinfo, this function returns only a precomputed - result, so can be called frequently to monitor memory consumption. - Even if locks are otherwise defined, this function does not use them, - so results might not be up to date. -*/ -DLMALLOC_EXPORT size_t dlmalloc_footprint(void); - -/* - malloc_max_footprint(); - Returns the maximum number of bytes obtained from the system. This - value will be greater than current footprint if deallocated space - has been reclaimed by the system. The peak number of bytes allocated - by malloc, realloc etc., is less than this value. Unlike mallinfo, - this function returns only a precomputed result, so can be called - frequently to monitor memory consumption. Even if locks are - otherwise defined, this function does not use them, so results might - not be up to date. -*/ -DLMALLOC_EXPORT size_t dlmalloc_max_footprint(void); - -/* - malloc_footprint_limit(); - Returns the number of bytes that the heap is allowed to obtain from - the system, returning the last value returned by - malloc_set_footprint_limit, or the maximum size_t value if - never set. The returned value reflects a permission. There is no - guarantee that this number of bytes can actually be obtained from - the system. -*/ -DLMALLOC_EXPORT size_t dlmalloc_footprint_limit(void); - -/* - malloc_set_footprint_limit(); - Sets the maximum number of bytes to obtain from the system, causing - failure returns from malloc and related functions upon attempts to - exceed this value. The argument value may be subject to page - rounding to an enforceable limit; this actual value is returned. - Using an argument of the maximum possible size_t effectively - disables checks. If the argument is less than or equal to the - current malloc_footprint, then all future allocations that require - additional system memory will fail. However, invocation cannot - retroactively deallocate existing used memory. -*/ -DLMALLOC_EXPORT size_t dlmalloc_set_footprint_limit(size_t bytes); - -#if MALLOC_INSPECT_ALL -/* - malloc_inspect_all(void(*handler)(void *start, - void *end, - size_t used_bytes, - void* callback_arg), - void* arg); - Traverses the heap and calls the given handler for each managed - region, skipping all bytes that are (or may be) used for bookkeeping - purposes. Traversal does not include include chunks that have been - directly memory mapped. Each reported region begins at the start - address, and continues up to but not including the end address. The - first used_bytes of the region contain allocated data. If - used_bytes is zero, the region is unallocated. The handler is - invoked with the given callback argument. If locks are defined, they - are held during the entire traversal. It is a bad idea to invoke - other malloc functions from within the handler. - - For example, to count the number of in-use chunks with size greater - than 1000, you could write: - static int count = 0; - void count_chunks(void* start, void* end, size_t used, void* arg) { - if (used >= 1000) ++count; - } - then: - malloc_inspect_all(count_chunks, NULL); - - malloc_inspect_all is compiled only if MALLOC_INSPECT_ALL is defined. -*/ -DLMALLOC_EXPORT void dlmalloc_inspect_all(void(*handler)(void*, void *, size_t, void*), - void* arg); - -#endif /* MALLOC_INSPECT_ALL */ - -#if !NO_MALLINFO -/* - mallinfo() - Returns (by copy) a struct containing various summary statistics: - - arena: current total non-mmapped bytes allocated from system - ordblks: the number of free chunks - smblks: always zero. - hblks: current number of mmapped regions - hblkhd: total bytes held in mmapped regions - usmblks: the maximum total allocated space. This will be greater - than current total if trimming has occurred. - fsmblks: always zero - uordblks: current total allocated space (normal or mmapped) - fordblks: total free space - keepcost: the maximum number of bytes that could ideally be released - back to system via malloc_trim. ("ideally" means that - it ignores page restrictions etc.) - - Because these fields are ints, but internal bookkeeping may - be kept as longs, the reported values may wrap around zero and - thus be inaccurate. -*/ -DLMALLOC_EXPORT struct mallinfo dlmallinfo(void); -#endif /* NO_MALLINFO */ - -/* - independent_calloc(size_t n_elements, size_t element_size, void* chunks[]); - - independent_calloc is similar to calloc, but instead of returning a - single cleared space, it returns an array of pointers to n_elements - independent elements that can hold contents of size elem_size, each - of which starts out cleared, and can be independently freed, - realloc'ed etc. The elements are guaranteed to be adjacently - allocated (this is not guaranteed to occur with multiple callocs or - mallocs), which may also improve cache locality in some - applications. - - The "chunks" argument is optional (i.e., may be null, which is - probably the most typical usage). If it is null, the returned array - is itself dynamically allocated and should also be freed when it is - no longer needed. Otherwise, the chunks array must be of at least - n_elements in length. It is filled in with the pointers to the - chunks. - - In either case, independent_calloc returns this pointer array, or - null if the allocation failed. If n_elements is zero and "chunks" - is null, it returns a chunk representing an array with zero elements - (which should be freed if not wanted). - - Each element must be freed when it is no longer needed. This can be - done all at once using bulk_free. - - independent_calloc simplifies and speeds up implementations of many - kinds of pools. It may also be useful when constructing large data - structures that initially have a fixed number of fixed-sized nodes, - but the number is not known at compile time, and some of the nodes - may later need to be freed. For example: - - struct Node { int item; struct Node* next; }; - - struct Node* build_list() { - struct Node** pool; - int n = read_number_of_nodes_needed(); - if (n <= 0) return 0; - pool = (struct Node**)(independent_calloc(n, sizeof(struct Node), 0); - if (pool == 0) die(); - // organize into a linked list... - struct Node* first = pool[0]; - for (i = 0; i < n-1; ++i) - pool[i]->next = pool[i+1]; - free(pool); // Can now free the array (or not, if it is needed later) - return first; - } -*/ -DLMALLOC_EXPORT void** dlindependent_calloc(size_t, size_t, void**); - -/* - independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); - - independent_comalloc allocates, all at once, a set of n_elements - chunks with sizes indicated in the "sizes" array. It returns - an array of pointers to these elements, each of which can be - independently freed, realloc'ed etc. The elements are guaranteed to - be adjacently allocated (this is not guaranteed to occur with - multiple callocs or mallocs), which may also improve cache locality - in some applications. - - The "chunks" argument is optional (i.e., may be null). If it is null - the returned array is itself dynamically allocated and should also - be freed when it is no longer needed. Otherwise, the chunks array - must be of at least n_elements in length. It is filled in with the - pointers to the chunks. - - In either case, independent_comalloc returns this pointer array, or - null if the allocation failed. If n_elements is zero and chunks is - null, it returns a chunk representing an array with zero elements - (which should be freed if not wanted). - - Each element must be freed when it is no longer needed. This can be - done all at once using bulk_free. - - independent_comallac differs from independent_calloc in that each - element may have a different size, and also that it does not - automatically clear elements. - - independent_comalloc can be used to speed up allocation in cases - where several structs or objects must always be allocated at the - same time. For example: - - struct Head { ... } - struct Foot { ... } - - void send_message(char* msg) { - int msglen = strlen(msg); - size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) }; - void* chunks[3]; - if (independent_comalloc(3, sizes, chunks) == 0) - die(); - struct Head* head = (struct Head*)(chunks[0]); - char* body = (char*)(chunks[1]); - struct Foot* foot = (struct Foot*)(chunks[2]); - // ... - } - - In general though, independent_comalloc is worth using only for - larger values of n_elements. For small values, you probably won't - detect enough difference from series of malloc calls to bother. - - Overuse of independent_comalloc can increase overall memory usage, - since it cannot reuse existing noncontiguous small chunks that - might be available for some of the elements. -*/ -DLMALLOC_EXPORT void** dlindependent_comalloc(size_t, size_t*, void**); - -/* - bulk_free(void* array[], size_t n_elements) - Frees and clears (sets to null) each non-null pointer in the given - array. This is likely to be faster than freeing them one-by-one. - If footers are used, pointers that have been allocated in different - mspaces are not freed or cleared, and the count of all such pointers - is returned. For large arrays of pointers with poor locality, it - may be worthwhile to sort this array before calling bulk_free. -*/ -DLMALLOC_EXPORT size_t dlbulk_free(void**, size_t n_elements); - -/* - pvalloc(size_t n); - Equivalent to valloc(minimum-page-that-holds(n)), that is, - round up n to nearest pagesize. - */ -DLMALLOC_EXPORT void* dlpvalloc(size_t); - -/* - malloc_trim(size_t pad); - - If possible, gives memory back to the system (via negative arguments - to sbrk) if there is unused memory at the `high' end of the malloc - pool or in unused MMAP segments. You can call this after freeing - large blocks of memory to potentially reduce the system-level memory - requirements of a program. However, it cannot guarantee to reduce - memory. Under some allocation patterns, some large free blocks of - memory will be locked between two used chunks, so they cannot be - given back to the system. - - The `pad' argument to malloc_trim represents the amount of free - trailing space to leave untrimmed. If this argument is zero, only - the minimum amount of memory to maintain internal data structures - will be left. Non-zero arguments can be supplied to maintain enough - trailing space to service future expected allocations without having - to re-obtain memory from the system. - - Malloc_trim returns 1 if it actually released any memory, else 0. -*/ -DLMALLOC_EXPORT int dlmalloc_trim(size_t); - -/* - malloc_stats(); - Prints on stderr the amount of space obtained from the system (both - via sbrk and mmap), the maximum amount (which may be more than - current if malloc_trim and/or munmap got called), and the current - number of bytes allocated via malloc (or realloc, etc) but not yet - freed. Note that this is the number of bytes allocated, not the - number requested. It will be larger than the number requested - because of alignment and bookkeeping overhead. Because it includes - alignment wastage as being in use, this figure may be greater than - zero even when no user-level chunks are allocated. - - The reported current and maximum system memory can be inaccurate if - a program makes other calls to system memory allocation functions - (normally sbrk) outside of malloc. - - malloc_stats prints only the most commonly interesting statistics. - More information can be obtained by calling mallinfo. -*/ -DLMALLOC_EXPORT void dlmalloc_stats(void); - -#endif /* ONLY_MSPACES */ - -/* - malloc_usable_size(void* p); - - Returns the number of bytes you can actually use in - an allocated chunk, which may be more than you requested (although - often not) due to alignment and minimum size constraints. - You can use this many bytes without worrying about - overwriting other allocated objects. This is not a particularly great - programming practice. malloc_usable_size can be more useful in - debugging and assertions, for example: - - p = malloc(n); - assert(malloc_usable_size(p) >= 256); -*/ -size_t dlmalloc_usable_size(void*); - -#if MSPACES - -/* - mspace is an opaque type representing an independent - region of space that supports mspace_malloc, etc. -*/ -typedef void* mspace; - -/* - create_mspace creates and returns a new independent space with the - given initial capacity, or, if 0, the default granularity size. It - returns null if there is no system memory available to create the - space. If argument locked is non-zero, the space uses a separate - lock to control access. The capacity of the space will grow - dynamically as needed to service mspace_malloc requests. You can - control the sizes of incremental increases of this space by - compiling with a different DEFAULT_GRANULARITY or dynamically - setting with mallopt(M_GRANULARITY, value). -*/ -DLMALLOC_EXPORT mspace create_mspace(size_t capacity, int locked); - -/* - destroy_mspace destroys the given space, and attempts to return all - of its memory back to the system, returning the total number of - bytes freed. After destruction, the results of access to all memory - used by the space become undefined. -*/ -DLMALLOC_EXPORT size_t destroy_mspace(mspace msp); - -/* - create_mspace_with_base uses the memory supplied as the initial base - of a new mspace. Part (less than 128*sizeof(size_t) bytes) of this - space is used for bookkeeping, so the capacity must be at least this - large. (Otherwise 0 is returned.) When this initial space is - exhausted, additional memory will be obtained from the system. - Destroying this space will deallocate all additionally allocated - space (if possible) but not the initial base. -*/ -DLMALLOC_EXPORT mspace create_mspace_with_base(void* base, size_t capacity, int locked); - -/* - mspace_track_large_chunks controls whether requests for large chunks - are allocated in their own untracked mmapped regions, separate from - others in this mspace. By default large chunks are not tracked, - which reduces fragmentation. However, such chunks are not - necessarily released to the system upon destroy_mspace. Enabling - tracking by setting to true may increase fragmentation, but avoids - leakage when relying on destroy_mspace to release all memory - allocated using this space. The function returns the previous - setting. -*/ -DLMALLOC_EXPORT int mspace_track_large_chunks(mspace msp, int enable); - - -/* - mspace_malloc behaves as malloc, but operates within - the given space. -*/ -DLMALLOC_EXPORT void* mspace_malloc(mspace msp, size_t bytes); - -/* - mspace_free behaves as free, but operates within - the given space. - - If compiled with FOOTERS==1, mspace_free is not actually needed. - free may be called instead of mspace_free because freed chunks from - any space are handled by their originating spaces. -*/ -DLMALLOC_EXPORT void mspace_free(mspace msp, void* mem); - -/* - mspace_realloc behaves as realloc, but operates within - the given space. - - If compiled with FOOTERS==1, mspace_realloc is not actually - needed. realloc may be called instead of mspace_realloc because - realloced chunks from any space are handled by their originating - spaces. -*/ -DLMALLOC_EXPORT void* mspace_realloc(mspace msp, void* mem, size_t newsize); - -/* - mspace_calloc behaves as calloc, but operates within - the given space. -*/ -DLMALLOC_EXPORT void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size); - -/* - mspace_memalign behaves as memalign, but operates within - the given space. -*/ -DLMALLOC_EXPORT void* mspace_memalign(mspace msp, size_t alignment, size_t bytes); - -/* - mspace_independent_calloc behaves as independent_calloc, but - operates within the given space. -*/ -DLMALLOC_EXPORT void** mspace_independent_calloc(mspace msp, size_t n_elements, - size_t elem_size, void* chunks[]); - -/* - mspace_independent_comalloc behaves as independent_comalloc, but - operates within the given space. -*/ -DLMALLOC_EXPORT void** mspace_independent_comalloc(mspace msp, size_t n_elements, - size_t sizes[], void* chunks[]); - -/* - mspace_footprint() returns the number of bytes obtained from the - system for this space. -*/ -DLMALLOC_EXPORT size_t mspace_footprint(mspace msp); - -/* - mspace_max_footprint() returns the peak number of bytes obtained from the - system for this space. -*/ -DLMALLOC_EXPORT size_t mspace_max_footprint(mspace msp); - - -#if !NO_MALLINFO -/* - mspace_mallinfo behaves as mallinfo, but reports properties of - the given space. -*/ -DLMALLOC_EXPORT struct mallinfo mspace_mallinfo(mspace msp); -#endif /* NO_MALLINFO */ - -/* - malloc_usable_size(void* p) behaves the same as malloc_usable_size; -*/ -DLMALLOC_EXPORT size_t mspace_usable_size(void* mem); - -/* - mspace_malloc_stats behaves as malloc_stats, but reports - properties of the given space. -*/ -DLMALLOC_EXPORT void mspace_malloc_stats(mspace msp); - -/* - mspace_trim behaves as malloc_trim, but - operates within the given space. -*/ -DLMALLOC_EXPORT int mspace_trim(mspace msp, size_t pad); - -/* - An alias for mallopt. -*/ -DLMALLOC_EXPORT int mspace_mallopt(int, int); - -#endif /* MSPACES */ - -#ifdef __cplusplus -} /* end of extern "C" */ -#endif /* __cplusplus */ - -/* - ======================================================================== - To make a fully customizable malloc.h header file, cut everything - above this line, put into file malloc.h, edit to suit, and #include it - on the next line, as well as in programs that use this malloc. - ======================================================================== -*/ - -/* #include "malloc.h" */ - -/*------------------------------ internal #includes ---------------------- */ - -#ifdef _MSC_VER -#pragma warning( disable : 4146 ) /* no "unsigned" warnings */ -#endif /* _MSC_VER */ -#if !NO_MALLOC_STATS -#include /* for printing in malloc_stats */ -#endif /* NO_MALLOC_STATS */ -#ifndef LACKS_ERRNO_H -#include /* for MALLOC_FAILURE_ACTION */ -#endif /* LACKS_ERRNO_H */ -#ifdef DEBUG -#if ABORT_ON_ASSERT_FAILURE -#undef assert -#define assert(x) if(!(x)) ABORT -#else /* ABORT_ON_ASSERT_FAILURE */ -#include -#endif /* ABORT_ON_ASSERT_FAILURE */ -#else /* DEBUG */ -#ifndef assert -#define assert(x) -#endif -#define DEBUG 0 -#endif /* DEBUG */ -#if !defined(WIN32) && !defined(LACKS_TIME_H) -#include /* for magic initialization */ -#endif /* WIN32 */ -#ifndef LACKS_STDLIB_H -#include /* for abort() */ -#endif /* LACKS_STDLIB_H */ -#ifndef LACKS_STRING_H -#include /* for memset etc */ -#endif /* LACKS_STRING_H */ -#if USE_BUILTIN_FFS -#ifndef LACKS_STRINGS_H -#include /* for ffs */ -#endif /* LACKS_STRINGS_H */ -#endif /* USE_BUILTIN_FFS */ -#if HAVE_MMAP -#ifndef LACKS_SYS_MMAN_H -/* On some versions of linux, mremap decl in mman.h needs __USE_GNU set */ -#if (defined(linux) && !defined(__USE_GNU)) -#define __USE_GNU 1 -#include /* for mmap */ -#undef __USE_GNU -#else -#include /* for mmap */ -#endif /* linux */ -#endif /* LACKS_SYS_MMAN_H */ -#ifndef LACKS_FCNTL_H -#include -#endif /* LACKS_FCNTL_H */ -#endif /* HAVE_MMAP */ -#ifndef LACKS_UNISTD_H -#include /* for sbrk, sysconf */ -#else /* LACKS_UNISTD_H */ -#if !defined(__FreeBSD__) && !defined(__OpenBSD__) && !defined(__NetBSD__) -/*extern void* sbrk(ptrdiff_t);*/ -#endif /* FreeBSD etc */ -#endif /* LACKS_UNISTD_H */ - -/* Declarations for locking */ -#if USE_LOCKS -#ifndef WIN32 -#if defined (__SVR4) && defined (__sun) /* solaris */ -#include -#elif !defined(LACKS_SCHED_H) -#include -#endif /* solaris or LACKS_SCHED_H */ -#if (defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0) || !USE_SPIN_LOCKS -/*#include */ -#endif /* USE_RECURSIVE_LOCKS ... */ -#elif defined(_MSC_VER) -#ifndef _M_AMD64 -/* These are already defined on AMD64 builds */ -#ifdef __cplusplus -extern "C" { -#endif /* __cplusplus */ -LONG __cdecl _InterlockedCompareExchange(LONG volatile *Dest, LONG Exchange, LONG Comp); -LONG __cdecl _InterlockedExchange(LONG volatile *Target, LONG Value); -#ifdef __cplusplus -} -#endif /* __cplusplus */ -#endif /* _M_AMD64 */ -#pragma intrinsic (_InterlockedCompareExchange) -#pragma intrinsic (_InterlockedExchange) -#define interlockedcompareexchange _InterlockedCompareExchange -#define interlockedexchange _InterlockedExchange -#elif defined(WIN32) && defined(__GNUC__) -#define interlockedcompareexchange(a, b, c) __sync_val_compare_and_swap(a, c, b) -#define interlockedexchange __sync_lock_test_and_set -#endif /* Win32 */ -#endif /* USE_LOCKS */ - -/* Declarations for bit scanning on win32 */ -#if defined(_MSC_VER) && _MSC_VER>=1300 -#ifndef BitScanForward /* Try to avoid pulling in WinNT.h */ -#ifdef __cplusplus -extern "C" { -#endif /* __cplusplus */ -unsigned char _BitScanForward(unsigned long *index, unsigned long mask); -unsigned char _BitScanReverse(unsigned long *index, unsigned long mask); -#ifdef __cplusplus -} -#endif /* __cplusplus */ - -#define BitScanForward _BitScanForward -#define BitScanReverse _BitScanReverse -#pragma intrinsic(_BitScanForward) -#pragma intrinsic(_BitScanReverse) -#endif /* BitScanForward */ -#endif /* defined(_MSC_VER) && _MSC_VER>=1300 */ - -#ifndef WIN32 -#ifndef malloc_getpagesize -# ifdef _SC_PAGESIZE /* some SVR4 systems omit an underscore */ -# ifndef _SC_PAGE_SIZE -# define _SC_PAGE_SIZE _SC_PAGESIZE -# endif -# endif -# ifdef _SC_PAGE_SIZE -# define malloc_getpagesize sysconf(_SC_PAGE_SIZE) -# else -# if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE) - extern size_t getpagesize(); -# define malloc_getpagesize getpagesize() -# else -# ifdef WIN32 /* use supplied emulation of getpagesize */ -# define malloc_getpagesize getpagesize() -# else -# ifndef LACKS_SYS_PARAM_H -# include -# endif -# ifdef EXEC_PAGESIZE -# define malloc_getpagesize EXEC_PAGESIZE -# else -# ifdef NBPG -# ifndef CLSIZE -# define malloc_getpagesize NBPG -# else -# define malloc_getpagesize (NBPG * CLSIZE) -# endif -# else -# ifdef NBPC -# define malloc_getpagesize NBPC -# else -# ifdef PAGESIZE -# define malloc_getpagesize PAGESIZE -# else /* just guess */ -# define malloc_getpagesize ((size_t)4096U) -# endif -# endif -# endif -# endif -# endif -# endif -# endif -#endif -#endif - -/* ------------------- size_t and alignment properties -------------------- */ - -/* The byte and bit size of a size_t */ -#define SIZE_T_SIZE (sizeof(size_t)) -#define SIZE_T_BITSIZE (sizeof(size_t) << 3) - -/* Some constants coerced to size_t */ -/* Annoying but necessary to avoid errors on some platforms */ -#define SIZE_T_ZERO ((size_t)0) -#define SIZE_T_ONE ((size_t)1) -#define SIZE_T_TWO ((size_t)2) -#define SIZE_T_FOUR ((size_t)4) -#define TWO_SIZE_T_SIZES (SIZE_T_SIZE<<1) -#define FOUR_SIZE_T_SIZES (SIZE_T_SIZE<<2) -#define SIX_SIZE_T_SIZES (FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES) -#define HALF_MAX_SIZE_T (MAX_SIZE_T / 2U) - -/* The bit mask value corresponding to MALLOC_ALIGNMENT */ -#define CHUNK_ALIGN_MASK (MALLOC_ALIGNMENT - SIZE_T_ONE) - -/* True if address a has acceptable alignment */ -#define is_aligned(A) (((size_t)((A)) & (CHUNK_ALIGN_MASK)) == 0) - -/* the number of bytes to offset an address to align it */ -#define align_offset(A)\ - ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\ - ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK)) - -/* -------------------------- MMAP preliminaries ------------------------- */ - -/* - If HAVE_MORECORE or HAVE_MMAP are false, we just define calls and - checks to fail so compiler optimizer can delete code rather than - using so many "#if"s. -*/ - - -/* MORECORE and MMAP must return MFAIL on failure */ -#define MFAIL ((void*)(MAX_SIZE_T)) -#define CMFAIL ((char*)(MFAIL)) /* defined for convenience */ - -#if HAVE_MMAP - -#ifdef MMAP_DEFAULT -#elif !defined(WIN32) -#define MUNMAP_DEFAULT(a, s) munmap((a), (s)) -#define MMAP_PROT (PROT_READ|PROT_WRITE) -#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON) -#define MAP_ANONYMOUS MAP_ANON -#endif /* MAP_ANON */ -#ifdef MAP_ANONYMOUS -#define MMAP_FLAGS (MAP_PRIVATE|MAP_ANONYMOUS) -#define MMAP_DEFAULT(s) mmap(0, (s), MMAP_PROT, MMAP_FLAGS, -1, 0) -#else /* MAP_ANONYMOUS */ -/* - Nearly all versions of mmap support MAP_ANONYMOUS, so the following - is unlikely to be needed, but is supplied just in case. -*/ -#define MMAP_FLAGS (MAP_PRIVATE) -#define MMAP_DEFAULT(s) ((dev_zero_fd < 0) ? \ - (dev_zero_fd = open("/dev/zero", O_RDWR), \ - mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) : \ - mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) -#endif /* MAP_ANONYMOUS */ - -#define DIRECT_MMAP_DEFAULT(s) MMAP_DEFAULT(s) - -#else /* WIN32 */ - -/* Win32 MMAP via VirtualAlloc */ -static FORCEINLINE void* win32mmap(size_t size) { - void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE); - return (ptr != 0)? ptr: MFAIL; -} - -/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */ -static FORCEINLINE void* win32direct_mmap(size_t size) { - void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, - PAGE_READWRITE); - return (ptr != 0)? ptr: MFAIL; -} - -/* This function supports releasing coalesed segments */ -static FORCEINLINE int win32munmap(void* ptr, size_t size) { - MEMORY_BASIC_INFORMATION minfo; - char* cptr = (char*)ptr; - while (size) { - if (VirtualQuery(cptr, &minfo, sizeof(minfo)) == 0) - return -1; - if (minfo.BaseAddress != cptr || minfo.AllocationBase != cptr || - minfo.State != MEM_COMMIT || minfo.RegionSize > size) - return -1; - if (VirtualFree(cptr, 0, MEM_RELEASE) == 0) - return -1; - cptr += minfo.RegionSize; - size -= minfo.RegionSize; - } - return 0; -} - -#define MMAP_DEFAULT(s) win32mmap(s) -#define MUNMAP_DEFAULT(a, s) win32munmap((a), (s)) -#define DIRECT_MMAP_DEFAULT(s) win32direct_mmap(s) -#endif /* WIN32 */ -#endif /* HAVE_MMAP */ - -#if HAVE_MREMAP && !defined(MREMAP_DEFAULT) -#ifndef WIN32 -#define MREMAP_DEFAULT(addr, osz, nsz, mv) mremap((addr), (osz), (nsz), (mv)) -#endif /* WIN32 */ -#endif /* HAVE_MREMAP */ - -/** - * Define CALL_MORECORE - */ -#if HAVE_MORECORE - #ifdef MORECORE - #define CALL_MORECORE(S) MORECORE(S) - #else /* MORECORE */ - #define CALL_MORECORE(S) MORECORE_DEFAULT(S) - #endif /* MORECORE */ -#else /* HAVE_MORECORE */ - #define CALL_MORECORE(S) MFAIL -#endif /* HAVE_MORECORE */ - -/** - * Define CALL_MMAP/CALL_MUNMAP/CALL_DIRECT_MMAP - */ -#if HAVE_MMAP - #define USE_MMAP_BIT (SIZE_T_ONE) - - #ifdef MMAP - #define CALL_MMAP(s) MMAP(s) - #else /* MMAP */ - #define CALL_MMAP(s) MMAP_DEFAULT(s) - #endif /* MMAP */ - #ifdef MUNMAP - #define CALL_MUNMAP(a, s) MUNMAP((a), (s)) - #else /* MUNMAP */ - #define CALL_MUNMAP(a, s) MUNMAP_DEFAULT((a), (s)) - #endif /* MUNMAP */ - #ifdef DIRECT_MMAP - #define CALL_DIRECT_MMAP(s) DIRECT_MMAP(s) - #else /* DIRECT_MMAP */ - #define CALL_DIRECT_MMAP(s) DIRECT_MMAP_DEFAULT(s) - #endif /* DIRECT_MMAP */ -#else /* HAVE_MMAP */ - #define USE_MMAP_BIT (SIZE_T_ZERO) - - #define MMAP(s) MFAIL - #define MUNMAP(a, s) (-1) - #define DIRECT_MMAP(s) MFAIL - #define CALL_DIRECT_MMAP(s) DIRECT_MMAP(s) - #define CALL_MMAP(s) MMAP(s) - #define CALL_MUNMAP(a, s) MUNMAP((a), (s)) -#endif /* HAVE_MMAP */ - -/** - * Define CALL_MREMAP - */ -#if HAVE_MMAP && HAVE_MREMAP - #ifdef MREMAP - #define CALL_MREMAP(addr, osz, nsz, mv) MREMAP((addr), (osz), (nsz), (mv)) - #else /* MREMAP */ - #define CALL_MREMAP(addr, osz, nsz, mv) MREMAP_DEFAULT((addr), (osz), (nsz), (mv)) - #endif /* MREMAP */ -#else /* HAVE_MMAP && HAVE_MREMAP */ - #define CALL_MREMAP(addr, osz, nsz, mv) MFAIL -#endif /* HAVE_MMAP && HAVE_MREMAP */ - -/* mstate bit set if continguous morecore disabled or failed */ -#define USE_NONCONTIGUOUS_BIT (4U) - -/* segment bit set in create_mspace_with_base */ -#define EXTERN_BIT (8U) - - -/* --------------------------- Lock preliminaries ------------------------ */ - -/* - When locks are defined, there is one global lock, plus - one per-mspace lock. - - The global lock_ensures that mparams.magic and other unique - mparams values are initialized only once. It also protects - sequences of calls to MORECORE. In many cases sys_alloc requires - two calls, that should not be interleaved with calls by other - threads. This does not protect against direct calls to MORECORE - by other threads not using this lock, so there is still code to - cope the best we can on interference. - - Per-mspace locks surround calls to malloc, free, etc. - By default, locks are simple non-reentrant mutexes. - - Because lock-protected regions generally have bounded times, it is - OK to use the supplied simple spinlocks. Spinlocks are likely to - improve performance for lightly contended applications, but worsen - performance under heavy contention. - - If USE_LOCKS is > 1, the definitions of lock routines here are - bypassed, in which case you will need to define the type MLOCK_T, - and at least INITIAL_LOCK, DESTROY_LOCK, ACQUIRE_LOCK, RELEASE_LOCK - and TRY_LOCK. You must also declare a - static MLOCK_T malloc_global_mutex = { initialization values };. - -*/ - -#if !USE_LOCKS -#define USE_LOCK_BIT (0U) -#define INITIAL_LOCK(l) (0) -#define DESTROY_LOCK(l) (0) -#define ACQUIRE_MALLOC_GLOBAL_LOCK() -#define RELEASE_MALLOC_GLOBAL_LOCK() - -#else -#if USE_LOCKS > 1 -/* ----------------------- User-defined locks ------------------------ */ -/* Define your own lock implementation here */ -/* #define INITIAL_LOCK(lk) ... */ -/* #define DESTROY_LOCK(lk) ... */ -/* #define ACQUIRE_LOCK(lk) ... */ -/* #define RELEASE_LOCK(lk) ... */ -/* #define TRY_LOCK(lk) ... */ -/* static MLOCK_T malloc_global_mutex = ... */ - -#elif USE_SPIN_LOCKS - -/* First, define CAS_LOCK and CLEAR_LOCK on ints */ -/* Note CAS_LOCK defined to return 0 on success */ - -#if defined(__GNUC__)&& (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 1)) -#define CAS_LOCK(sl) __sync_lock_test_and_set(sl, 1) -#define CLEAR_LOCK(sl) __sync_lock_release(sl) - -#elif (defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__))) -/* Custom spin locks for older gcc on x86 */ -static FORCEINLINE int x86_cas_lock(int *sl) { - int ret; - int val = 1; - int cmp = 0; - __asm__ __volatile__ ("lock; cmpxchgl %1, %2" - : "=a" (ret) - : "r" (val), "m" (*(sl)), "0"(cmp) - : "memory", "cc"); - return ret; -} - -static FORCEINLINE void x86_clear_lock(int* sl) { - assert(*sl != 0); - int prev = 0; - int ret; - __asm__ __volatile__ ("lock; xchgl %0, %1" - : "=r" (ret) - : "m" (*(sl)), "0"(prev) - : "memory"); -} - -#define CAS_LOCK(sl) x86_cas_lock(sl) -#define CLEAR_LOCK(sl) x86_clear_lock(sl) - -#else /* Win32 MSC */ -#define CAS_LOCK(sl) interlockedexchange(sl, 1) -#define CLEAR_LOCK(sl) interlockedexchange (sl, 0) - -#endif /* ... gcc spins locks ... */ - -/* How to yield for a spin lock */ -#define SPINS_PER_YIELD 63 -#if defined(_MSC_VER) -#define SLEEP_EX_DURATION 50 /* delay for yield/sleep */ -#define SPIN_LOCK_YIELD SleepEx(SLEEP_EX_DURATION, FALSE) -#elif defined (__SVR4) && defined (__sun) /* solaris */ -#define SPIN_LOCK_YIELD thr_yield(); -#elif !defined(LACKS_SCHED_H) -#define SPIN_LOCK_YIELD sched_yield(); -#else -#define SPIN_LOCK_YIELD -#endif /* ... yield ... */ - -#if !defined(USE_RECURSIVE_LOCKS) || USE_RECURSIVE_LOCKS == 0 -/* Plain spin locks use single word (embedded in malloc_states) */ -static int spin_acquire_lock(int *sl) { - int spins = 0; - while (*(volatile int *)sl != 0 || CAS_LOCK(sl)) { - if ((++spins & SPINS_PER_YIELD) == 0) { - SPIN_LOCK_YIELD; - } - } - return 0; -} - -#define MLOCK_T int -#define TRY_LOCK(sl) !CAS_LOCK(sl) -#define RELEASE_LOCK(sl) CLEAR_LOCK(sl) -#define ACQUIRE_LOCK(sl) (CAS_LOCK(sl)? spin_acquire_lock(sl) : 0) -#define INITIAL_LOCK(sl) (*sl = 0) -#define DESTROY_LOCK(sl) (0) -static MLOCK_T malloc_global_mutex = 0; - -#else /* USE_RECURSIVE_LOCKS */ -/* types for lock owners */ -#ifdef WIN32 -#define THREAD_ID_T DWORD -#define CURRENT_THREAD GetCurrentThreadId() -#define EQ_OWNER(X,Y) ((X) == (Y)) -#else -/* - Note: the following assume that pthread_t is a type that can be - initialized to (casted) zero. If this is not the case, you will need to - somehow redefine these or not use spin locks. -*/ -#define THREAD_ID_T pthread_t -#define CURRENT_THREAD pthread_self() -#define EQ_OWNER(X,Y) pthread_equal(X, Y) -#endif - -struct malloc_recursive_lock { - int sl; - unsigned int c; - THREAD_ID_T threadid; -}; - -#define MLOCK_T struct malloc_recursive_lock -static MLOCK_T malloc_global_mutex = { 0, 0, (THREAD_ID_T)0}; - -static FORCEINLINE void recursive_release_lock(MLOCK_T *lk) { - assert(lk->sl != 0); - if (--lk->c == 0) { - CLEAR_LOCK(&lk->sl); - } -} - -static FORCEINLINE int recursive_acquire_lock(MLOCK_T *lk) { - THREAD_ID_T mythreadid = CURRENT_THREAD; - int spins = 0; - for (;;) { - if (*((volatile int *)(&lk->sl)) == 0) { - if (!CAS_LOCK(&lk->sl)) { - lk->threadid = mythreadid; - lk->c = 1; - return 0; - } - } - else if (EQ_OWNER(lk->threadid, mythreadid)) { - ++lk->c; - return 0; - } - if ((++spins & SPINS_PER_YIELD) == 0) { - SPIN_LOCK_YIELD; - } - } -} - -static FORCEINLINE int recursive_try_lock(MLOCK_T *lk) { - THREAD_ID_T mythreadid = CURRENT_THREAD; - if (*((volatile int *)(&lk->sl)) == 0) { - if (!CAS_LOCK(&lk->sl)) { - lk->threadid = mythreadid; - lk->c = 1; - return 1; - } - } - else if (EQ_OWNER(lk->threadid, mythreadid)) { - ++lk->c; - return 1; - } - return 0; -} - -#define RELEASE_LOCK(lk) recursive_release_lock(lk) -#define TRY_LOCK(lk) recursive_try_lock(lk) -#define ACQUIRE_LOCK(lk) recursive_acquire_lock(lk) -#define INITIAL_LOCK(lk) ((lk)->threadid = (THREAD_ID_T)0, (lk)->sl = 0, (lk)->c = 0) -#define DESTROY_LOCK(lk) (0) -#endif /* USE_RECURSIVE_LOCKS */ - -#elif defined(WIN32) /* Win32 critical sections */ -#define MLOCK_T CRITICAL_SECTION -#define ACQUIRE_LOCK(lk) (EnterCriticalSection(lk), 0) -#define RELEASE_LOCK(lk) LeaveCriticalSection(lk) -#define TRY_LOCK(lk) TryEnterCriticalSection(lk) -#define INITIAL_LOCK(lk) (!InitializeCriticalSectionAndSpinCount((lk), 0x80000000|4000)) -#define DESTROY_LOCK(lk) (DeleteCriticalSection(lk), 0) -#define NEED_GLOBAL_LOCK_INIT - -static MLOCK_T malloc_global_mutex; -static volatile long malloc_global_mutex_status; - -/* Use spin loop to initialize global lock */ -static void init_malloc_global_mutex() { - for (;;) { - long stat = malloc_global_mutex_status; - if (stat > 0) - return; - /* transition to < 0 while initializing, then to > 0) */ - if (stat == 0 && - interlockedcompareexchange(&malloc_global_mutex_status, -1, 0) == 0) { - InitializeCriticalSection(&malloc_global_mutex); - interlockedexchange(&malloc_global_mutex_status,1); - return; - } - SleepEx(0, FALSE); - } -} - -#else /* pthreads-based locks */ -#define MLOCK_T pthread_mutex_t -#define ACQUIRE_LOCK(lk) pthread_mutex_lock(lk) -#define RELEASE_LOCK(lk) pthread_mutex_unlock(lk) -#define TRY_LOCK(lk) (!pthread_mutex_trylock(lk)) -#define INITIAL_LOCK(lk) pthread_init_lock(lk) -#define DESTROY_LOCK(lk) pthread_mutex_destroy(lk) - -#if defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0 && defined(linux) && !defined(PTHREAD_MUTEX_RECURSIVE) -/* Cope with old-style linux recursive lock initialization by adding */ -/* skipped internal declaration from pthread.h */ -extern int pthread_mutexattr_setkind_np __P ((pthread_mutexattr_t *__attr, - int __kind)); -#define PTHREAD_MUTEX_RECURSIVE PTHREAD_MUTEX_RECURSIVE_NP -#define pthread_mutexattr_settype(x,y) pthread_mutexattr_setkind_np(x,y) -#endif /* USE_RECURSIVE_LOCKS ... */ - -static MLOCK_T malloc_global_mutex = PTHREAD_MUTEX_INITIALIZER; - -static int pthread_init_lock (MLOCK_T *lk) { - pthread_mutexattr_t attr; - if (pthread_mutexattr_init(&attr)) return 1; -#if defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0 - if (pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE)) return 1; -#endif - if (pthread_mutex_init(lk, &attr)) return 1; - if (pthread_mutexattr_destroy(&attr)) return 1; - return 0; -} - -#endif /* ... lock types ... */ - -/* Common code for all lock types */ -#define USE_LOCK_BIT (2U) - -#ifndef ACQUIRE_MALLOC_GLOBAL_LOCK -#define ACQUIRE_MALLOC_GLOBAL_LOCK() ACQUIRE_LOCK(&malloc_global_mutex); -#endif - -#ifndef RELEASE_MALLOC_GLOBAL_LOCK -#define RELEASE_MALLOC_GLOBAL_LOCK() RELEASE_LOCK(&malloc_global_mutex); -#endif - -#endif /* USE_LOCKS */ - -/* ----------------------- Chunk representations ------------------------ */ - -/* - (The following includes lightly edited explanations by Colin Plumb.) - - The malloc_chunk declaration below is misleading (but accurate and - necessary). It declares a "view" into memory allowing access to - necessary fields at known offsets from a given base. - - Chunks of memory are maintained using a `boundary tag' method as - originally described by Knuth. (See the paper by Paul Wilson - ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a survey of such - techniques.) Sizes of free chunks are stored both in the front of - each chunk and at the end. This makes consolidating fragmented - chunks into bigger chunks fast. The head fields also hold bits - representing whether chunks are free or in use. - - Here are some pictures to make it clearer. They are "exploded" to - show that the state of a chunk can be thought of as extending from - the high 31 bits of the head field of its header through the - prev_foot and PINUSE_BIT bit of the following chunk header. - - A chunk that's in use looks like: - - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Size of previous chunk (if P = 0) | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| - | Size of this chunk 1| +-+ - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | | - +- -+ - | | - +- -+ - | : - +- size - sizeof(size_t) available payload bytes -+ - : | - chunk-> +- -+ - | | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |1| - | Size of next chunk (may or may not be in use) | +-+ - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - - And if it's free, it looks like this: - - chunk-> +- -+ - | User payload (must be in use, or we would have merged!) | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| - | Size of this chunk 0| +-+ - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Next pointer | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Prev pointer | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | : - +- size - sizeof(struct chunk) unused bytes -+ - : | - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Size of this chunk | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |0| - | Size of next chunk (must be in use, or we would have merged)| +-+ - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | : - +- User payload -+ - : | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - |0| - +-+ - Note that since we always merge adjacent free chunks, the chunks - adjacent to a free chunk must be in use. - - Given a pointer to a chunk (which can be derived trivially from the - payload pointer) we can, in O(1) time, find out whether the adjacent - chunks are free, and if so, unlink them from the lists that they - are on and merge them with the current chunk. - - Chunks always begin on even word boundaries, so the mem portion - (which is returned to the user) is also on an even word boundary, and - thus at least double-word aligned. - - The P (PINUSE_BIT) bit, stored in the unused low-order bit of the - chunk size (which is always a multiple of two words), is an in-use - bit for the *previous* chunk. If that bit is *clear*, then the - word before the current chunk size contains the previous chunk - size, and can be used to find the front of the previous chunk. - The very first chunk allocated always has this bit set, preventing - access to non-existent (or non-owned) memory. If pinuse is set for - any given chunk, then you CANNOT determine the size of the - previous chunk, and might even get a memory addressing fault when - trying to do so. - - The C (CINUSE_BIT) bit, stored in the unused second-lowest bit of - the chunk size redundantly records whether the current chunk is - inuse (unless the chunk is mmapped). This redundancy enables usage - checks within free and realloc, and reduces indirection when freeing - and consolidating chunks. - - Each freshly allocated chunk must have both cinuse and pinuse set. - That is, each allocated chunk borders either a previously allocated - and still in-use chunk, or the base of its memory arena. This is - ensured by making all allocations from the `lowest' part of any - found chunk. Further, no free chunk physically borders another one, - so each free chunk is known to be preceded and followed by either - inuse chunks or the ends of memory. - - Note that the `foot' of the current chunk is actually represented - as the prev_foot of the NEXT chunk. This makes it easier to - deal with alignments etc but can be very confusing when trying - to extend or adapt this code. - - The exceptions to all this are - - 1. The special chunk `top' is the top-most available chunk (i.e., - the one bordering the end of available memory). It is treated - specially. Top is never included in any bin, is used only if - no other chunk is available, and is released back to the - system if it is very large (see M_TRIM_THRESHOLD). In effect, - the top chunk is treated as larger (and thus less well - fitting) than any other available chunk. The top chunk - doesn't update its trailing size field since there is no next - contiguous chunk that would have to index off it. However, - space is still allocated for it (TOP_FOOT_SIZE) to enable - separation or merging when space is extended. - - 3. Chunks allocated via mmap, have both cinuse and pinuse bits - cleared in their head fields. Because they are allocated - one-by-one, each must carry its own prev_foot field, which is - also used to hold the offset this chunk has within its mmapped - region, which is needed to preserve alignment. Each mmapped - chunk is trailed by the first two fields of a fake next-chunk - for sake of usage checks. - -*/ - -struct malloc_chunk { - size_t prev_foot; /* Size of previous chunk (if free). */ - size_t head; /* Size and inuse bits. */ - struct malloc_chunk* fd; /* double links -- used only if free. */ - struct malloc_chunk* bk; -}; - -typedef struct malloc_chunk mchunk; -typedef struct malloc_chunk* mchunkptr; -typedef struct malloc_chunk* sbinptr; /* The type of bins of chunks */ -typedef unsigned int bindex_t; /* Described below */ -typedef unsigned int binmap_t; /* Described below */ -typedef unsigned int flag_t; /* The type of various bit flag sets */ - -/* ------------------- Chunks sizes and alignments ----------------------- */ - -#define MCHUNK_SIZE (sizeof(mchunk)) - -#if FOOTERS -#define CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) -#else /* FOOTERS */ -#define CHUNK_OVERHEAD (SIZE_T_SIZE) -#endif /* FOOTERS */ - -/* MMapped chunks need a second word of overhead ... */ -#define MMAP_CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) -/* ... and additional padding for fake next-chunk at foot */ -#define MMAP_FOOT_PAD (FOUR_SIZE_T_SIZES) - -/* The smallest size we can malloc is an aligned minimal chunk */ -#define MIN_CHUNK_SIZE\ - ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) - -/* conversion from malloc headers to user pointers, and back */ -#define chunk2mem(p) ((void*)((char*)(p) + TWO_SIZE_T_SIZES)) -#define mem2chunk(mem) ((mchunkptr)((char*)(mem) - TWO_SIZE_T_SIZES)) -/* chunk associated with aligned address A */ -#define align_as_chunk(A) (mchunkptr)((A) + align_offset(chunk2mem(A))) - -/* Bounds on request (not chunk) sizes. */ -#define MAX_REQUEST ((-MIN_CHUNK_SIZE) << 2) -#define MIN_REQUEST (MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE) - -/* pad request bytes into a usable size */ -#define pad_request(req) \ - (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) - -/* pad request, checking for minimum (but not maximum) */ -#define request2size(req) \ - (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req)) - - -/* ------------------ Operations on head and foot fields ----------------- */ - -/* - The head field of a chunk is or'ed with PINUSE_BIT when previous - adjacent chunk in use, and or'ed with CINUSE_BIT if this chunk is in - use, unless mmapped, in which case both bits are cleared. - - FLAG4_BIT is not used by this malloc, but might be useful in extensions. -*/ - -#define PINUSE_BIT (SIZE_T_ONE) -#define CINUSE_BIT (SIZE_T_TWO) -#define FLAG4_BIT (SIZE_T_FOUR) -#define INUSE_BITS (PINUSE_BIT|CINUSE_BIT) -#define FLAG_BITS (PINUSE_BIT|CINUSE_BIT|FLAG4_BIT) - -/* Head value for fenceposts */ -#define FENCEPOST_HEAD (INUSE_BITS|SIZE_T_SIZE) - -/* extraction of fields from head words */ -#define cinuse(p) ((p)->head & CINUSE_BIT) -#define pinuse(p) ((p)->head & PINUSE_BIT) -#define flag4inuse(p) ((p)->head & FLAG4_BIT) -#define is_inuse(p) (((p)->head & INUSE_BITS) != PINUSE_BIT) -#define is_mmapped(p) (((p)->head & INUSE_BITS) == 0) - -#define chunksize(p) ((p)->head & ~(FLAG_BITS)) - -#define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT) -#define set_flag4(p) ((p)->head |= FLAG4_BIT) -#define clear_flag4(p) ((p)->head &= ~FLAG4_BIT) - -/* Treat space at ptr +/- offset as a chunk */ -#define chunk_plus_offset(p, s) ((mchunkptr)(((char*)(p)) + (s))) -#define chunk_minus_offset(p, s) ((mchunkptr)(((char*)(p)) - (s))) - -/* Ptr to next or previous physical malloc_chunk. */ -#define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS))) -#define prev_chunk(p) ((mchunkptr)( ((char*)(p)) - ((p)->prev_foot) )) - -/* extract next chunk's pinuse bit */ -#define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT) - -/* Get/set size at footer */ -#define get_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot) -#define set_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot = (s)) - -/* Set size, pinuse bit, and foot */ -#define set_size_and_pinuse_of_free_chunk(p, s)\ - ((p)->head = (s|PINUSE_BIT), set_foot(p, s)) - -/* Set size, pinuse bit, foot, and clear next pinuse */ -#define set_free_with_pinuse(p, s, n)\ - (clear_pinuse(n), set_size_and_pinuse_of_free_chunk(p, s)) - -/* Get the internal overhead associated with chunk p */ -#define overhead_for(p)\ - (is_mmapped(p)? MMAP_CHUNK_OVERHEAD : CHUNK_OVERHEAD) - -/* Return true if malloced space is not necessarily cleared */ -#if MMAP_CLEARS -#define calloc_must_clear(p) (!is_mmapped(p)) -#else /* MMAP_CLEARS */ -#define calloc_must_clear(p) (1) -#endif /* MMAP_CLEARS */ - -/* ---------------------- Overlaid data structures ----------------------- */ - -/* - When chunks are not in use, they are treated as nodes of either - lists or trees. - - "Small" chunks are stored in circular doubly-linked lists, and look - like this: - - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Size of previous chunk | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - `head:' | Size of chunk, in bytes |P| - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Forward pointer to next chunk in list | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Back pointer to previous chunk in list | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Unused space (may be 0 bytes long) . - . . - . | -nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - `foot:' | Size of chunk, in bytes | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - - Larger chunks are kept in a form of bitwise digital trees (aka - tries) keyed on chunksizes. Because malloc_tree_chunks are only for - free chunks greater than 256 bytes, their size doesn't impose any - constraints on user chunk sizes. Each node looks like: - - chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Size of previous chunk | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - `head:' | Size of chunk, in bytes |P| - mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Forward pointer to next chunk of same size | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Back pointer to previous chunk of same size | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Pointer to left child (child[0]) | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Pointer to right child (child[1]) | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Pointer to parent | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | bin index of this chunk | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - | Unused space . - . | -nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - `foot:' | Size of chunk, in bytes | - +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ - - Each tree holding treenodes is a tree of unique chunk sizes. Chunks - of the same size are arranged in a circularly-linked list, with only - the oldest chunk (the next to be used, in our FIFO ordering) - actually in the tree. (Tree members are distinguished by a non-null - parent pointer.) If a chunk with the same size an an existing node - is inserted, it is linked off the existing node using pointers that - work in the same way as fd/bk pointers of small chunks. - - Each tree contains a power of 2 sized range of chunk sizes (the - smallest is 0x100 <= x < 0x180), which is is divided in half at each - tree level, with the chunks in the smaller half of the range (0x100 - <= x < 0x140 for the top nose) in the left subtree and the larger - half (0x140 <= x < 0x180) in the right subtree. This is, of course, - done by inspecting individual bits. - - Using these rules, each node's left subtree contains all smaller - sizes than its right subtree. However, the node at the root of each - subtree has no particular ordering relationship to either. (The - dividing line between the subtree sizes is based on trie relation.) - If we remove the last chunk of a given size from the interior of the - tree, we need to replace it with a leaf node. The tree ordering - rules permit a node to be replaced by any leaf below it. - - The smallest chunk in a tree (a common operation in a best-fit - allocator) can be found by walking a path to the leftmost leaf in - the tree. Unlike a usual binary tree, where we follow left child - pointers until we reach a null, here we follow the right child - pointer any time the left one is null, until we reach a leaf with - both child pointers null. The smallest chunk in the tree will be - somewhere along that path. - - The worst case number of steps to add, find, or remove a node is - bounded by the number of bits differentiating chunks within - bins. Under current bin calculations, this ranges from 6 up to 21 - (for 32 bit sizes) or up to 53 (for 64 bit sizes). The typical case - is of course much better. -*/ - -struct malloc_tree_chunk { - /* The first four fields must be compatible with malloc_chunk */ - size_t prev_foot; - size_t head; - struct malloc_tree_chunk* fd; - struct malloc_tree_chunk* bk; - - struct malloc_tree_chunk* child[2]; - struct malloc_tree_chunk* parent; - bindex_t index; -}; - -typedef struct malloc_tree_chunk tchunk; -typedef struct malloc_tree_chunk* tchunkptr; -typedef struct malloc_tree_chunk* tbinptr; /* The type of bins of trees */ - -/* A little helper macro for trees */ -#define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1]) - -/* ----------------------------- Segments -------------------------------- */ - -/* - Each malloc space may include non-contiguous segments, held in a - list headed by an embedded malloc_segment record representing the - top-most space. Segments also include flags holding properties of - the space. Large chunks that are directly allocated by mmap are not - included in this list. They are instead independently created and - destroyed without otherwise keeping track of them. - - Segment management mainly comes into play for spaces allocated by - MMAP. Any call to MMAP might or might not return memory that is - adjacent to an existing segment. MORECORE normally contiguously - extends the current space, so this space is almost always adjacent, - which is simpler and faster to deal with. (This is why MORECORE is - used preferentially to MMAP when both are available -- see - sys_alloc.) When allocating using MMAP, we don't use any of the - hinting mechanisms (inconsistently) supported in various - implementations of unix mmap, or distinguish reserving from - committing memory. Instead, we just ask for space, and exploit - contiguity when we get it. It is probably possible to do - better than this on some systems, but no general scheme seems - to be significantly better. - - Management entails a simpler variant of the consolidation scheme - used for chunks to reduce fragmentation -- new adjacent memory is - normally prepended or appended to an existing segment. However, - there are limitations compared to chunk consolidation that mostly - reflect the fact that segment processing is relatively infrequent - (occurring only when getting memory from system) and that we - don't expect to have huge numbers of segments: - - * Segments are not indexed, so traversal requires linear scans. (It - would be possible to index these, but is not worth the extra - overhead and complexity for most programs on most platforms.) - * New segments are only appended to old ones when holding top-most - memory; if they cannot be prepended to others, they are held in - different segments. - - Except for the top-most segment of an mstate, each segment record - is kept at the tail of its segment. Segments are added by pushing - segment records onto the list headed by &mstate.seg for the - containing mstate. - - Segment flags control allocation/merge/deallocation policies: - * If EXTERN_BIT set, then we did not allocate this segment, - and so should not try to deallocate or merge with others. - (This currently holds only for the initial segment passed - into create_mspace_with_base.) - * If USE_MMAP_BIT set, the segment may be merged with - other surrounding mmapped segments and trimmed/de-allocated - using munmap. - * If neither bit is set, then the segment was obtained using - MORECORE so can be merged with surrounding MORECORE'd segments - and deallocated/trimmed using MORECORE with negative arguments. -*/ - -struct malloc_segment { - char* base; /* base address */ - size_t size; /* allocated size */ - struct malloc_segment* next; /* ptr to next segment */ - flag_t sflags; /* mmap and extern flag */ -}; - -#define is_mmapped_segment(S) ((S)->sflags & USE_MMAP_BIT) -#define is_extern_segment(S) ((S)->sflags & EXTERN_BIT) - -typedef struct malloc_segment msegment; -typedef struct malloc_segment* msegmentptr; - -/* ---------------------------- malloc_state ----------------------------- */ - -/* - A malloc_state holds all of the bookkeeping for a space. - The main fields are: - - Top - The topmost chunk of the currently active segment. Its size is - cached in topsize. The actual size of topmost space is - topsize+TOP_FOOT_SIZE, which includes space reserved for adding - fenceposts and segment records if necessary when getting more - space from the system. The size at which to autotrim top is - cached from mparams in trim_check, except that it is disabled if - an autotrim fails. - - Designated victim (dv) - This is the preferred chunk for servicing small requests that - don't have exact fits. It is normally the chunk split off most - recently to service another small request. Its size is cached in - dvsize. The link fields of this chunk are not maintained since it - is not kept in a bin. - - SmallBins - An array of bin headers for free chunks. These bins hold chunks - with sizes less than MIN_LARGE_SIZE bytes. Each bin contains - chunks of all the same size, spaced 8 bytes apart. To simplify - use in double-linked lists, each bin header acts as a malloc_chunk - pointing to the real first node, if it exists (else pointing to - itself). This avoids special-casing for headers. But to avoid - waste, we allocate only the fd/bk pointers of bins, and then use - repositioning tricks to treat these as the fields of a chunk. - - TreeBins - Treebins are pointers to the roots of trees holding a range of - sizes. There are 2 equally spaced treebins for each power of two - from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything - larger. - - Bin maps - There is one bit map for small bins ("smallmap") and one for - treebins ("treemap). Each bin sets its bit when non-empty, and - clears the bit when empty. Bit operations are then used to avoid - bin-by-bin searching -- nearly all "search" is done without ever - looking at bins that won't be selected. The bit maps - conservatively use 32 bits per map word, even if on 64bit system. - For a good description of some of the bit-based techniques used - here, see Henry S. Warren Jr's book "Hacker's Delight" (and - supplement at http://hackersdelight.org/). Many of these are - intended to reduce the branchiness of paths through malloc etc, as - well as to reduce the number of memory locations read or written. - - Segments - A list of segments headed by an embedded malloc_segment record - representing the initial space. - - Address check support - The least_addr field is the least address ever obtained from - MORECORE or MMAP. Attempted frees and reallocs of any address less - than this are trapped (unless INSECURE is defined). - - Magic tag - A cross-check field that should always hold same value as mparams.magic. - - Max allowed footprint - The maximum allowed bytes to allocate from system (zero means no limit) - - Flags - Bits recording whether to use MMAP, locks, or contiguous MORECORE - - Statistics - Each space keeps track of current and maximum system memory - obtained via MORECORE or MMAP. - - Trim support - Fields holding the amount of unused topmost memory that should trigger - trimming, and a counter to force periodic scanning to release unused - non-topmost segments. - - Locking - If USE_LOCKS is defined, the "mutex" lock is acquired and released - around every public call using this mspace. - - Extension support - A void* pointer and a size_t field that can be used to help implement - extensions to this malloc. -*/ - -/* Bin types, widths and sizes */ -#define NSMALLBINS (32U) -#define NTREEBINS (32U) -#define SMALLBIN_SHIFT (3U) -#define SMALLBIN_WIDTH (SIZE_T_ONE << SMALLBIN_SHIFT) -#define TREEBIN_SHIFT (8U) -#define MIN_LARGE_SIZE (SIZE_T_ONE << TREEBIN_SHIFT) -#define MAX_SMALL_SIZE (MIN_LARGE_SIZE - SIZE_T_ONE) -#define MAX_SMALL_REQUEST (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD) - -struct malloc_state { - binmap_t smallmap; - binmap_t treemap; - size_t dvsize; - size_t topsize; - char* least_addr; - mchunkptr dv; - mchunkptr top; - size_t trim_check; - size_t release_checks; - size_t magic; - mchunkptr smallbins[(NSMALLBINS+1)*2]; - tbinptr treebins[NTREEBINS]; - size_t footprint; - size_t max_footprint; - size_t footprint_limit; /* zero means no limit */ - flag_t mflags; -#if USE_LOCKS - MLOCK_T mutex; /* locate lock among fields that rarely change */ -#endif /* USE_LOCKS */ - msegment seg; - void* extp; /* Unused but available for extensions */ - size_t exts; -}; - -typedef struct malloc_state* mstate; - -/* ------------- Global malloc_state and malloc_params ------------------- */ - -/* - malloc_params holds global properties, including those that can be - dynamically set using mallopt. There is a single instance, mparams, - initialized in init_mparams. Note that the non-zeroness of "magic" - also serves as an initialization flag. -*/ - -struct malloc_params { - size_t magic; - size_t page_size; - size_t granularity; - size_t mmap_threshold; - size_t trim_threshold; - flag_t default_mflags; -}; - -static struct malloc_params mparams; - -/* Ensure mparams initialized */ -#define ensure_initialization() (void)(mparams.magic != 0 || init_mparams()) - -#if !ONLY_MSPACES - -/* The global malloc_state used for all non-"mspace" calls */ -static struct malloc_state _gm_; -#define gm (&_gm_) -#define is_global(M) ((M) == &_gm_) - -#endif /* !ONLY_MSPACES */ - -#define is_initialized(M) ((M)->top != 0) - -/* -------------------------- system alloc setup ------------------------- */ - -/* Operations on mflags */ - -#define use_lock(M) ((M)->mflags & USE_LOCK_BIT) -#define enable_lock(M) ((M)->mflags |= USE_LOCK_BIT) -#if USE_LOCKS -#define disable_lock(M) ((M)->mflags &= ~USE_LOCK_BIT) -#else -#define disable_lock(M) -#endif - -#define use_mmap(M) ((M)->mflags & USE_MMAP_BIT) -#define enable_mmap(M) ((M)->mflags |= USE_MMAP_BIT) -#if HAVE_MMAP -#define disable_mmap(M) ((M)->mflags &= ~USE_MMAP_BIT) -#else -#define disable_mmap(M) -#endif - -#define use_noncontiguous(M) ((M)->mflags & USE_NONCONTIGUOUS_BIT) -#define disable_contiguous(M) ((M)->mflags |= USE_NONCONTIGUOUS_BIT) - -#define set_lock(M,L)\ - ((M)->mflags = (L)?\ - ((M)->mflags | USE_LOCK_BIT) :\ - ((M)->mflags & ~USE_LOCK_BIT)) - -/* page-align a size */ -#define page_align(S)\ - (((S) + (mparams.page_size - SIZE_T_ONE)) & ~(mparams.page_size - SIZE_T_ONE)) - -/* granularity-align a size */ -#define granularity_align(S)\ - (((S) + (mparams.granularity - SIZE_T_ONE))\ - & ~(mparams.granularity - SIZE_T_ONE)) - - -/* For mmap, use granularity alignment on windows, else page-align */ -#ifdef WIN32 -#define mmap_align(S) granularity_align(S) -#else -#define mmap_align(S) page_align(S) -#endif - -/* For sys_alloc, enough padding to ensure can malloc request on success */ -#define SYS_ALLOC_PADDING (TOP_FOOT_SIZE + MALLOC_ALIGNMENT) - -#define is_page_aligned(S)\ - (((size_t)(S) & (mparams.page_size - SIZE_T_ONE)) == 0) -#define is_granularity_aligned(S)\ - (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0) - -/* True if segment S holds address A */ -#define segment_holds(S, A)\ - ((char*)(A) >= S->base && (char*)(A) < S->base + S->size) - -/* Return segment holding given address */ -static msegmentptr segment_holding(mstate m, char* addr) { - msegmentptr sp = &m->seg; - for (;;) { - if (addr >= sp->base && addr < sp->base + sp->size) - return sp; - if ((sp = sp->next) == 0) - return 0; - } -} - -/* Return true if segment contains a segment link */ -static int has_segment_link(mstate m, msegmentptr ss) { - msegmentptr sp = &m->seg; - for (;;) { - if ((char*)sp >= ss->base && (char*)sp < ss->base + ss->size) - return 1; - if ((sp = sp->next) == 0) - return 0; - } -} - -#ifndef MORECORE_CANNOT_TRIM -#define should_trim(M,s) ((s) > (M)->trim_check) -#else /* MORECORE_CANNOT_TRIM */ -#define should_trim(M,s) (0) -#endif /* MORECORE_CANNOT_TRIM */ - -/* - TOP_FOOT_SIZE is padding at the end of a segment, including space - that may be needed to place segment records and fenceposts when new - noncontiguous segments are added. -*/ -#define TOP_FOOT_SIZE\ - (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE) - - -/* ------------------------------- Hooks -------------------------------- */ - -/* - PREACTION should be defined to return 0 on success, and nonzero on - failure. If you are not using locking, you can redefine these to do - anything you like. -*/ - -#if USE_LOCKS -#define PREACTION(M) ((use_lock(M))? ACQUIRE_LOCK(&(M)->mutex) : 0) -#define POSTACTION(M) { if (use_lock(M)) RELEASE_LOCK(&(M)->mutex); } -#else /* USE_LOCKS */ - -#ifndef PREACTION -#define PREACTION(M) (0) -#endif /* PREACTION */ - -#ifndef POSTACTION -#define POSTACTION(M) -#endif /* POSTACTION */ - -#endif /* USE_LOCKS */ - -/* - CORRUPTION_ERROR_ACTION is triggered upon detected bad addresses. - USAGE_ERROR_ACTION is triggered on detected bad frees and - reallocs. The argument p is an address that might have triggered the - fault. It is ignored by the two predefined actions, but might be - useful in custom actions that try to help diagnose errors. -*/ - -#if PROCEED_ON_ERROR - -/* A count of the number of corruption errors causing resets */ -int malloc_corruption_error_count; - -/* default corruption action */ -static void reset_on_error(mstate m); - -#define CORRUPTION_ERROR_ACTION(m) reset_on_error(m) -#define USAGE_ERROR_ACTION(m, p) - -#else /* PROCEED_ON_ERROR */ - -#ifndef CORRUPTION_ERROR_ACTION -#define CORRUPTION_ERROR_ACTION(m) ABORT -#endif /* CORRUPTION_ERROR_ACTION */ - -#ifndef USAGE_ERROR_ACTION -#define USAGE_ERROR_ACTION(m,p) ABORT -#endif /* USAGE_ERROR_ACTION */ - -#endif /* PROCEED_ON_ERROR */ - - -/* -------------------------- Debugging setup ---------------------------- */ - -#if ! DEBUG - -#define check_free_chunk(M,P) -#define check_inuse_chunk(M,P) -#define check_malloced_chunk(M,P,N) -#define check_mmapped_chunk(M,P) -#define check_malloc_state(M) -#define check_top_chunk(M,P) - -#else /* DEBUG */ -#define check_free_chunk(M,P) do_check_free_chunk(M,P) -#define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) -#define check_top_chunk(M,P) do_check_top_chunk(M,P) -#define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) -#define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) -#define check_malloc_state(M) do_check_malloc_state(M) - -static void do_check_any_chunk(mstate m, mchunkptr p); -static void do_check_top_chunk(mstate m, mchunkptr p); -static void do_check_mmapped_chunk(mstate m, mchunkptr p); -static void do_check_inuse_chunk(mstate m, mchunkptr p); -static void do_check_free_chunk(mstate m, mchunkptr p); -static void do_check_malloced_chunk(mstate m, void* mem, size_t s); -static void do_check_tree(mstate m, tchunkptr t); -static void do_check_treebin(mstate m, bindex_t i); -static void do_check_smallbin(mstate m, bindex_t i); -static void do_check_malloc_state(mstate m); -static int bin_find(mstate m, mchunkptr x); -static size_t traverse_and_check(mstate m); -#endif /* DEBUG */ - -/* ---------------------------- Indexing Bins ---------------------------- */ - -#define is_small(s) (((s) >> SMALLBIN_SHIFT) < NSMALLBINS) -#define small_index(s) (bindex_t)((s) >> SMALLBIN_SHIFT) -#define small_index2size(i) ((i) << SMALLBIN_SHIFT) -#define MIN_SMALL_INDEX (small_index(MIN_CHUNK_SIZE)) - -/* addressing by index. See above about smallbin repositioning */ -#define smallbin_at(M, i) ((sbinptr)((char*)&((M)->smallbins[(i)<<1]))) -#define treebin_at(M,i) (&((M)->treebins[i])) - -/* assign tree index for size S to variable I. Use x86 asm if possible */ -#if defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) -#define compute_tree_index(S, I)\ -{\ - unsigned int X = S >> TREEBIN_SHIFT;\ - if (X == 0)\ - I = 0;\ - else if (X > 0xFFFF)\ - I = NTREEBINS-1;\ - else {\ - unsigned int K = (unsigned) sizeof(X)*__CHAR_BIT__ - 1 - (unsigned) __builtin_clz(X); \ - I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ - }\ -} - -#elif defined (__INTEL_COMPILER) -#define compute_tree_index(S, I)\ -{\ - size_t X = S >> TREEBIN_SHIFT;\ - if (X == 0)\ - I = 0;\ - else if (X > 0xFFFF)\ - I = NTREEBINS-1;\ - else {\ - unsigned int K = _bit_scan_reverse (X); \ - I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ - }\ -} - -#elif defined(_MSC_VER) && _MSC_VER>=1300 -#define compute_tree_index(S, I)\ -{\ - size_t X = S >> TREEBIN_SHIFT;\ - if (X == 0)\ - I = 0;\ - else if (X > 0xFFFF)\ - I = NTREEBINS-1;\ - else {\ - unsigned int K;\ - _BitScanReverse((DWORD *) &K, (DWORD) X);\ - I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ - }\ -} - -#else /* GNUC */ -#define compute_tree_index(S, I)\ -{\ - size_t X = S >> TREEBIN_SHIFT;\ - if (X == 0)\ - I = 0;\ - else if (X > 0xFFFF)\ - I = NTREEBINS-1;\ - else {\ - unsigned int Y = (unsigned int)X;\ - unsigned int N = ((Y - 0x100) >> 16) & 8;\ - unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\ - N += K;\ - N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\ - K = 14 - N + ((Y <<= K) >> 15);\ - I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\ - }\ -} -#endif /* GNUC */ - -/* Bit representing maximum resolved size in a treebin at i */ -#define bit_for_tree_index(i) \ - (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2) - -/* Shift placing maximum resolved bit in a treebin at i as sign bit */ -#define leftshift_for_tree_index(i) \ - ((i == NTREEBINS-1)? 0 : \ - ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2))) - -/* The size of the smallest chunk held in bin with index i */ -#define minsize_for_tree_index(i) \ - ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \ - (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1))) - - -/* ------------------------ Operations on bin maps ----------------------- */ - -/* bit corresponding to given index */ -#define idx2bit(i) ((binmap_t)(1) << (i)) - -/* Mark/Clear bits with given index */ -#define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i)) -#define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i)) -#define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i)) - -#define mark_treemap(M,i) ((M)->treemap |= idx2bit(i)) -#define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i)) -#define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i)) - -/* isolate the least set bit of a bitmap */ -#define least_bit(x) ((x) & -(x)) - -/* mask with all bits to left of least bit of x on */ -#define left_bits(x) ((x<<1) | -(x<<1)) - -/* mask with all bits to left of or equal to least bit of x on */ -#define same_or_left_bits(x) ((x) | -(x)) - -/* index corresponding to given bit. Use x86 asm if possible */ - -#if defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) -#define compute_bit2idx(X, I)\ -{\ - unsigned int J;\ - J = __builtin_ctz(X); \ - I = (bindex_t)J;\ -} - -#elif defined (__INTEL_COMPILER) -#define compute_bit2idx(X, I)\ -{\ - unsigned int J;\ - J = _bit_scan_forward (X); \ - I = (bindex_t)J;\ -} - -#elif defined(_MSC_VER) && _MSC_VER>=1300 -#define compute_bit2idx(X, I)\ -{\ - unsigned int J;\ - _BitScanForward((DWORD *) &J, X);\ - I = (bindex_t)J;\ -} - -#elif USE_BUILTIN_FFS -#define compute_bit2idx(X, I) I = ffs(X)-1 - -#else -#define compute_bit2idx(X, I)\ -{\ - unsigned int Y = X - 1;\ - unsigned int K = Y >> (16-4) & 16;\ - unsigned int N = K; Y >>= K;\ - N += K = Y >> (8-3) & 8; Y >>= K;\ - N += K = Y >> (4-2) & 4; Y >>= K;\ - N += K = Y >> (2-1) & 2; Y >>= K;\ - N += K = Y >> (1-0) & 1; Y >>= K;\ - I = (bindex_t)(N + Y);\ -} -#endif /* GNUC */ - - -/* ----------------------- Runtime Check Support ------------------------- */ - -/* - For security, the main invariant is that malloc/free/etc never - writes to a static address other than malloc_state, unless static - malloc_state itself has been corrupted, which cannot occur via - malloc (because of these checks). In essence this means that we - believe all pointers, sizes, maps etc held in malloc_state, but - check all of those linked or offsetted from other embedded data - structures. These checks are interspersed with main code in a way - that tends to minimize their run-time cost. - - When FOOTERS is defined, in addition to range checking, we also - verify footer fields of inuse chunks, which can be used guarantee - that the mstate controlling malloc/free is intact. This is a - streamlined version of the approach described by William Robertson - et al in "Run-time Detection of Heap-based Overflows" LISA'03 - http://www.usenix.org/events/lisa03/tech/robertson.html The footer - of an inuse chunk holds the xor of its mstate and a random seed, - that is checked upon calls to free() and realloc(). This is - (probabalistically) unguessable from outside the program, but can be - computed by any code successfully malloc'ing any chunk, so does not - itself provide protection against code that has already broken - security through some other means. Unlike Robertson et al, we - always dynamically check addresses of all offset chunks (previous, - next, etc). This turns out to be cheaper than relying on hashes. -*/ - -#if !INSECURE -/* Check if address a is at least as high as any from MORECORE or MMAP */ -#define ok_address(M, a) ((char*)(a) >= (M)->least_addr) -/* Check if address of next chunk n is higher than base chunk p */ -#define ok_next(p, n) ((char*)(p) < (char*)(n)) -/* Check if p has inuse status */ -#define ok_inuse(p) is_inuse(p) -/* Check if p has its pinuse bit on */ -#define ok_pinuse(p) pinuse(p) - -#else /* !INSECURE */ -#define ok_address(M, a) (1) -#define ok_next(b, n) (1) -#define ok_inuse(p) (1) -#define ok_pinuse(p) (1) -#endif /* !INSECURE */ - -#if (FOOTERS && !INSECURE) -/* Check if (alleged) mstate m has expected magic field */ -#define ok_magic(M) ((M)->magic == mparams.magic) -#else /* (FOOTERS && !INSECURE) */ -#define ok_magic(M) (1) -#endif /* (FOOTERS && !INSECURE) */ - -/* In gcc, use __builtin_expect to minimize impact of checks */ -#if !INSECURE -#if defined(__GNUC__) && __GNUC__ >= 3 -#define RTCHECK(e) __builtin_expect(e, 1) -#else /* GNUC */ -#define RTCHECK(e) (e) -#endif /* GNUC */ -#else /* !INSECURE */ -#define RTCHECK(e) (1) -#endif /* !INSECURE */ - -/* macros to set up inuse chunks with or without footers */ - -#if !FOOTERS - -#define mark_inuse_foot(M,p,s) - -/* Macros for setting head/foot of non-mmapped chunks */ - -/* Set cinuse bit and pinuse bit of next chunk */ -#define set_inuse(M,p,s)\ - ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ - ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) - -/* Set cinuse and pinuse of this chunk and pinuse of next chunk */ -#define set_inuse_and_pinuse(M,p,s)\ - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ - ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) - -/* Set size, cinuse and pinuse bit of this chunk */ -#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT)) - -#else /* FOOTERS */ - -/* Set foot of inuse chunk to be xor of mstate and seed */ -#define mark_inuse_foot(M,p,s)\ - (((mchunkptr)((char*)(p) + (s)))->prev_foot = ((size_t)(M) ^ mparams.magic)) - -#define get_mstate_for(p)\ - ((mstate)(((mchunkptr)((char*)(p) +\ - (chunksize(p))))->prev_foot ^ mparams.magic)) - -#define set_inuse(M,p,s)\ - ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ - (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \ - mark_inuse_foot(M,p,s)) - -#define set_inuse_and_pinuse(M,p,s)\ - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ - (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\ - mark_inuse_foot(M,p,s)) - -#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ - ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ - mark_inuse_foot(M, p, s)) - -#endif /* !FOOTERS */ - -/* ---------------------------- setting mparams -------------------------- */ - -/* Initialize mparams */ -static int init_mparams(void) { -#ifdef NEED_GLOBAL_LOCK_INIT - call_once(&malloc_global_mutex_init_once, init_malloc_global_mutex); -#endif - - ACQUIRE_MALLOC_GLOBAL_LOCK(); - if (mparams.magic == 0) { - size_t magic; - size_t psize; - size_t gsize; - -#ifndef WIN32 - psize = malloc_getpagesize; - gsize = ((DEFAULT_GRANULARITY != 0)? DEFAULT_GRANULARITY : psize); -#else /* WIN32 */ - { - SYSTEM_INFO system_info; - GetSystemInfo(&system_info); - psize = system_info.dwPageSize; - gsize = ((DEFAULT_GRANULARITY != 0)? - DEFAULT_GRANULARITY : system_info.dwAllocationGranularity); - } -#endif /* WIN32 */ - - /* Sanity-check configuration: - size_t must be unsigned and as wide as pointer type. - ints must be at least 4 bytes. - alignment must be at least 8. - Alignment, min chunk size, and page size must all be powers of 2. - */ - if ((sizeof(size_t) != sizeof(char*)) || - (MAX_SIZE_T < MIN_CHUNK_SIZE) || - (sizeof(int) < 4) || - (MALLOC_ALIGNMENT < (size_t)8U) || - ((MALLOC_ALIGNMENT & (MALLOC_ALIGNMENT-SIZE_T_ONE)) != 0) || - ((MCHUNK_SIZE & (MCHUNK_SIZE-SIZE_T_ONE)) != 0) || - ((gsize & (gsize-SIZE_T_ONE)) != 0) || - ((psize & (psize-SIZE_T_ONE)) != 0)) - ABORT; - - mparams.granularity = gsize; - mparams.page_size = psize; - mparams.mmap_threshold = DEFAULT_MMAP_THRESHOLD; - mparams.trim_threshold = DEFAULT_TRIM_THRESHOLD; -#if MORECORE_CONTIGUOUS - mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT; -#else /* MORECORE_CONTIGUOUS */ - mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT|USE_NONCONTIGUOUS_BIT; -#endif /* MORECORE_CONTIGUOUS */ - -#if !ONLY_MSPACES - /* Set up lock for main malloc area */ - gm->mflags = mparams.default_mflags; - (void)INITIAL_LOCK(&gm->mutex); -#endif - - { -#if USE_DEV_RANDOM - int fd; - unsigned char buf[sizeof(size_t)]; - /* Try to use /dev/urandom, else fall back on using time */ - if ((fd = open("/dev/urandom", O_RDONLY)) >= 0 && - read(fd, buf, sizeof(buf)) == sizeof(buf)) { - magic = *((size_t *) buf); - close(fd); - } - else -#endif /* USE_DEV_RANDOM */ -#ifdef WIN32 - magic = (size_t)(GetTickCount() ^ (size_t)0x55555555U); -#elif defined(LACKS_TIME_H) - magic = (size_t)&magic ^ (size_t)0x55555555U; -#else - magic = (size_t)(time(0) ^ (size_t)0x55555555U); -#endif - magic |= (size_t)8U; /* ensure nonzero */ - magic &= ~(size_t)7U; /* improve chances of fault for bad values */ - /* Until memory modes commonly available, use volatile-write */ - (*(volatile size_t *)(&(mparams.magic))) = magic; - } - } - - RELEASE_MALLOC_GLOBAL_LOCK(); - return 1; -} - -/* support for mallopt */ -static int change_mparam(int param_number, int value) { - size_t val; - ensure_initialization(); - val = (value == -1)? MAX_SIZE_T : (size_t)value; - switch(param_number) { - case M_TRIM_THRESHOLD: - mparams.trim_threshold = val; - return 1; - case M_GRANULARITY: - if (val >= mparams.page_size && ((val & (val-1)) == 0)) { - mparams.granularity = val; - return 1; - } - else - return 0; - case M_MMAP_THRESHOLD: - mparams.mmap_threshold = val; - return 1; - default: - return 0; - } -} - -#if DEBUG -/* ------------------------- Debugging Support --------------------------- */ - -/* Check properties of any chunk, whether free, inuse, mmapped etc */ -static void do_check_any_chunk(mstate m, mchunkptr p) { - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); - assert(ok_address(m, p)); -} - -/* Check properties of top chunk */ -static void do_check_top_chunk(mstate m, mchunkptr p) { - msegmentptr sp = segment_holding(m, (char*)p); - size_t sz = p->head & ~INUSE_BITS; /* third-lowest bit can be set! */ - assert(sp != 0); - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); - assert(ok_address(m, p)); - assert(sz == m->topsize); - assert(sz > 0); - assert(sz == ((sp->base + sp->size) - (char*)p) - TOP_FOOT_SIZE); - assert(pinuse(p)); - assert(!pinuse(chunk_plus_offset(p, sz))); -} - -/* Check properties of (inuse) mmapped chunks */ -static void do_check_mmapped_chunk(mstate m, mchunkptr p) { - size_t sz = chunksize(p); - size_t len = (sz + (p->prev_foot) + MMAP_FOOT_PAD); - assert(is_mmapped(p)); - assert(use_mmap(m)); - assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); - assert(ok_address(m, p)); - assert(!is_small(sz)); - assert((len & (mparams.page_size-SIZE_T_ONE)) == 0); - assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD); - assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0); -} - -/* Check properties of inuse chunks */ -static void do_check_inuse_chunk(mstate m, mchunkptr p) { - do_check_any_chunk(m, p); - assert(is_inuse(p)); - assert(next_pinuse(p)); - /* If not pinuse and not mmapped, previous chunk has OK offset */ - assert(is_mmapped(p) || pinuse(p) || next_chunk(prev_chunk(p)) == p); - if (is_mmapped(p)) - do_check_mmapped_chunk(m, p); -} - -/* Check properties of free chunks */ -static void do_check_free_chunk(mstate m, mchunkptr p) { - size_t sz = chunksize(p); - mchunkptr next = chunk_plus_offset(p, sz); - do_check_any_chunk(m, p); - assert(!is_inuse(p)); - assert(!next_pinuse(p)); - assert (!is_mmapped(p)); - if (p != m->dv && p != m->top) { - if (sz >= MIN_CHUNK_SIZE) { - assert((sz & CHUNK_ALIGN_MASK) == 0); - assert(is_aligned(chunk2mem(p))); - assert(next->prev_foot == sz); - assert(pinuse(p)); - assert (next == m->top || is_inuse(next)); - assert(p->fd->bk == p); - assert(p->bk->fd == p); - } - else /* markers are always of size SIZE_T_SIZE */ - assert(sz == SIZE_T_SIZE); - } -} - -/* Check properties of malloced chunks at the point they are malloced */ -static void do_check_malloced_chunk(mstate m, void* mem, size_t s) { - if (mem != 0) { - mchunkptr p = mem2chunk(mem); - size_t sz = p->head & ~INUSE_BITS; - do_check_inuse_chunk(m, p); - assert((sz & CHUNK_ALIGN_MASK) == 0); - assert(sz >= MIN_CHUNK_SIZE); - assert(sz >= s); - /* unless mmapped, size is less than MIN_CHUNK_SIZE more than request */ - assert(is_mmapped(p) || sz < (s + MIN_CHUNK_SIZE)); - } -} - -/* Check a tree and its subtrees. */ -static void do_check_tree(mstate m, tchunkptr t) { - tchunkptr head = 0; - tchunkptr u = t; - bindex_t tindex = t->index; - size_t tsize = chunksize(t); - bindex_t idx; - compute_tree_index(tsize, idx); - assert(tindex == idx); - assert(tsize >= MIN_LARGE_SIZE); - assert(tsize >= minsize_for_tree_index(idx)); - assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); - - do { /* traverse through chain of same-sized nodes */ - do_check_any_chunk(m, ((mchunkptr)u)); - assert(u->index == tindex); - assert(chunksize(u) == tsize); - assert(!is_inuse(u)); - assert(!next_pinuse(u)); - assert(u->fd->bk == u); - assert(u->bk->fd == u); - if (u->parent == 0) { - assert(u->child[0] == 0); - assert(u->child[1] == 0); - } - else { - assert(head == 0); /* only one node on chain has parent */ - head = u; - assert(u->parent != u); - assert (u->parent->child[0] == u || - u->parent->child[1] == u || - *((tbinptr*)(u->parent)) == u); - if (u->child[0] != 0) { - assert(u->child[0]->parent == u); - assert(u->child[0] != u); - do_check_tree(m, u->child[0]); - } - if (u->child[1] != 0) { - assert(u->child[1]->parent == u); - assert(u->child[1] != u); - do_check_tree(m, u->child[1]); - } - if (u->child[0] != 0 && u->child[1] != 0) { - assert(chunksize(u->child[0]) < chunksize(u->child[1])); - } - } - u = u->fd; - } while (u != t); - assert(head != 0); -} - -/* Check all the chunks in a treebin. */ -static void do_check_treebin(mstate m, bindex_t i) { - tbinptr* tb = treebin_at(m, i); - tchunkptr t = *tb; - int empty = (m->treemap & (1U << i)) == 0; - if (t == 0) - assert(empty); - if (!empty) - do_check_tree(m, t); -} - -/* Check all the chunks in a smallbin. */ -static void do_check_smallbin(mstate m, bindex_t i) { - sbinptr b = smallbin_at(m, i); - mchunkptr p = b->bk; - unsigned int empty = (m->smallmap & (1U << i)) == 0; - if (p == b) - assert(empty); - if (!empty) { - for (; p != b; p = p->bk) { - size_t size = chunksize(p); - mchunkptr q; - /* each chunk claims to be free */ - do_check_free_chunk(m, p); - /* chunk belongs in bin */ - assert(small_index(size) == i); - assert(p->bk == b || chunksize(p->bk) == chunksize(p)); - /* chunk is followed by an inuse chunk */ - q = next_chunk(p); - if (q->head != FENCEPOST_HEAD) - do_check_inuse_chunk(m, q); - } - } -} - -/* Find x in a bin. Used in other check functions. */ -static int bin_find(mstate m, mchunkptr x) { - size_t size = chunksize(x); - if (is_small(size)) { - bindex_t sidx = small_index(size); - sbinptr b = smallbin_at(m, sidx); - if (smallmap_is_marked(m, sidx)) { - mchunkptr p = b; - do { - if (p == x) - return 1; - } while ((p = p->fd) != b); - } - } - else { - bindex_t tidx; - compute_tree_index(size, tidx); - if (treemap_is_marked(m, tidx)) { - tchunkptr t = *treebin_at(m, tidx); - size_t sizebits = size << leftshift_for_tree_index(tidx); - while (t != 0 && chunksize(t) != size) { - t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; - sizebits <<= 1; - } - if (t != 0) { - tchunkptr u = t; - do { - if (u == (tchunkptr)x) - return 1; - } while ((u = u->fd) != t); - } - } - } - return 0; -} - -/* Traverse each chunk and check it; return total */ -static size_t traverse_and_check(mstate m) { - size_t sum = 0; - if (is_initialized(m)) { - msegmentptr s = &m->seg; - sum += m->topsize + TOP_FOOT_SIZE; - while (s != 0) { - mchunkptr q = align_as_chunk(s->base); - mchunkptr lastq = 0; - assert(pinuse(q)); - while (segment_holds(s, q) && - q != m->top && q->head != FENCEPOST_HEAD) { - sum += chunksize(q); - if (is_inuse(q)) { - assert(!bin_find(m, q)); - do_check_inuse_chunk(m, q); - } - else { - assert(q == m->dv || bin_find(m, q)); - assert(lastq == 0 || is_inuse(lastq)); /* Not 2 consecutive free */ - do_check_free_chunk(m, q); - } - lastq = q; - q = next_chunk(q); - } - s = s->next; - } - } - return sum; -} - - -/* Check all properties of malloc_state. */ -static void do_check_malloc_state(mstate m) { - bindex_t i; - size_t total; - /* check bins */ - for (i = 0; i < NSMALLBINS; ++i) - do_check_smallbin(m, i); - for (i = 0; i < NTREEBINS; ++i) - do_check_treebin(m, i); - - if (m->dvsize != 0) { /* check dv chunk */ - do_check_any_chunk(m, m->dv); - assert(m->dvsize == chunksize(m->dv)); - assert(m->dvsize >= MIN_CHUNK_SIZE); - assert(bin_find(m, m->dv) == 0); - } - - if (m->top != 0) { /* check top chunk */ - do_check_top_chunk(m, m->top); - /*assert(m->topsize == chunksize(m->top)); redundant */ - assert(m->topsize > 0); - assert(bin_find(m, m->top) == 0); - } - - total = traverse_and_check(m); - assert(total <= m->footprint); - assert(m->footprint <= m->max_footprint); -} -#endif /* DEBUG */ - -/* ----------------------------- statistics ------------------------------ */ - -#if !NO_MALLINFO -static struct mallinfo internal_mallinfo(mstate m) { - struct mallinfo nm = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; - ensure_initialization(); - if (!PREACTION(m)) { - check_malloc_state(m); - if (is_initialized(m)) { - size_t nfree = SIZE_T_ONE; /* top always free */ - size_t mfree = m->topsize + TOP_FOOT_SIZE; - size_t sum = mfree; - msegmentptr s = &m->seg; - while (s != 0) { - mchunkptr q = align_as_chunk(s->base); - while (segment_holds(s, q) && - q != m->top && q->head != FENCEPOST_HEAD) { - size_t sz = chunksize(q); - sum += sz; - if (!is_inuse(q)) { - mfree += sz; - ++nfree; - } - q = next_chunk(q); - } - s = s->next; - } - - nm.arena = sum; - nm.ordblks = nfree; - nm.hblkhd = m->footprint - sum; - nm.usmblks = m->max_footprint; - nm.uordblks = m->footprint - mfree; - nm.fordblks = mfree; - nm.keepcost = m->topsize; - } - - POSTACTION(m); - } - return nm; -} -#endif /* !NO_MALLINFO */ - -#if !NO_MALLOC_STATS -static void internal_malloc_stats(mstate m) { - ensure_initialization(); - if (!PREACTION(m)) { - size_t maxfp = 0; - size_t fp = 0; - size_t used = 0; - check_malloc_state(m); - if (is_initialized(m)) { - msegmentptr s = &m->seg; - maxfp = m->max_footprint; - fp = m->footprint; - used = fp - (m->topsize + TOP_FOOT_SIZE); - - while (s != 0) { - mchunkptr q = align_as_chunk(s->base); - while (segment_holds(s, q) && - q != m->top && q->head != FENCEPOST_HEAD) { - if (!is_inuse(q)) - used -= chunksize(q); - q = next_chunk(q); - } - s = s->next; - } - } - POSTACTION(m); /* drop lock */ - fprintf(stderr, "max system bytes = %10lu\n", (unsigned long)(maxfp)); - fprintf(stderr, "system bytes = %10lu\n", (unsigned long)(fp)); - fprintf(stderr, "in use bytes = %10lu\n", (unsigned long)(used)); - } -} -#endif /* NO_MALLOC_STATS */ - -/* ----------------------- Operations on smallbins ----------------------- */ - -/* - Various forms of linking and unlinking are defined as macros. Even - the ones for trees, which are very long but have very short typical - paths. This is ugly but reduces reliance on inlining support of - compilers. -*/ - -/* Link a free chunk into a smallbin */ -#define insert_small_chunk(M, P, S) {\ - bindex_t I = small_index(S);\ - mchunkptr B = smallbin_at(M, I);\ - mchunkptr F = B;\ - assert(S >= MIN_CHUNK_SIZE);\ - if (!smallmap_is_marked(M, I))\ - mark_smallmap(M, I);\ - else if (RTCHECK(ok_address(M, B->fd)))\ - F = B->fd;\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - B->fd = P;\ - F->bk = P;\ - P->fd = F;\ - P->bk = B;\ -} - -/* Unlink a chunk from a smallbin */ -#define unlink_small_chunk(M, P, S) {\ - mchunkptr F = P->fd;\ - mchunkptr B = P->bk;\ - bindex_t I = small_index(S);\ - assert(P != B);\ - assert(P != F);\ - assert(chunksize(P) == small_index2size(I));\ - if (RTCHECK(F == smallbin_at(M,I) || (ok_address(M, F) && F->bk == P))) { \ - if (B == F) {\ - clear_smallmap(M, I);\ - }\ - else if (RTCHECK(B == smallbin_at(M,I) ||\ - (ok_address(M, B) && B->fd == P))) {\ - F->bk = B;\ - B->fd = F;\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ -} - -/* Unlink the first chunk from a smallbin */ -#define unlink_first_small_chunk(M, B, P, I) {\ - mchunkptr F = P->fd;\ - assert(P != B);\ - assert(P != F);\ - assert(chunksize(P) == small_index2size(I));\ - if (B == F) {\ - clear_smallmap(M, I);\ - }\ - else if (RTCHECK(ok_address(M, F) && F->bk == P)) {\ - F->bk = B;\ - B->fd = F;\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ -} - -/* Replace dv node, binning the old one */ -/* Used only when dvsize known to be small */ -#define replace_dv(M, P, S) {\ - size_t DVS = M->dvsize;\ - assert(is_small(DVS));\ - if (DVS != 0) {\ - mchunkptr DV = M->dv;\ - insert_small_chunk(M, DV, DVS);\ - }\ - M->dvsize = S;\ - M->dv = P;\ -} - -/* ------------------------- Operations on trees ------------------------- */ - -/* Insert chunk into tree */ -#define insert_large_chunk(M, X, S) {\ - tbinptr* H;\ - bindex_t I;\ - compute_tree_index(S, I);\ - H = treebin_at(M, I);\ - X->index = I;\ - X->child[0] = X->child[1] = 0;\ - if (!treemap_is_marked(M, I)) {\ - mark_treemap(M, I);\ - *H = X;\ - X->parent = (tchunkptr)H;\ - X->fd = X->bk = X;\ - }\ - else {\ - tchunkptr T = *H;\ - size_t K = S << leftshift_for_tree_index(I);\ - for (;;) {\ - if (chunksize(T) != S) {\ - tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\ - K <<= 1;\ - if (*C != 0)\ - T = *C;\ - else if (RTCHECK(ok_address(M, C))) {\ - *C = X;\ - X->parent = T;\ - X->fd = X->bk = X;\ - break;\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - break;\ - }\ - }\ - else {\ - tchunkptr F = T->fd;\ - if (RTCHECK(ok_address(M, T) && ok_address(M, F))) {\ - T->fd = F->bk = X;\ - X->fd = F;\ - X->bk = T;\ - X->parent = 0;\ - break;\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - break;\ - }\ - }\ - }\ - }\ -} - -/* - Unlink steps: - - 1. If x is a chained node, unlink it from its same-sized fd/bk links - and choose its bk node as its replacement. - 2. If x was the last node of its size, but not a leaf node, it must - be replaced with a leaf node (not merely one with an open left or - right), to make sure that lefts and rights of descendents - correspond properly to bit masks. We use the rightmost descendent - of x. We could use any other leaf, but this is easy to locate and - tends to counteract removal of leftmosts elsewhere, and so keeps - paths shorter than minimally guaranteed. This doesn't loop much - because on average a node in a tree is near the bottom. - 3. If x is the base of a chain (i.e., has parent links) relink - x's parent and children to x's replacement (or null if none). -*/ - -#define unlink_large_chunk(M, X) {\ - tchunkptr XP = X->parent;\ - tchunkptr R;\ - if (X->bk != X) {\ - tchunkptr F = X->fd;\ - R = X->bk;\ - if (RTCHECK(ok_address(M, F) && F->bk == X && R->fd == X)) {\ - F->bk = R;\ - R->fd = F;\ - }\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - }\ - else {\ - tchunkptr* RP;\ - if (((R = *(RP = &(X->child[1]))) != 0) ||\ - ((R = *(RP = &(X->child[0]))) != 0)) {\ - tchunkptr* CP;\ - while ((*(CP = &(R->child[1])) != 0) ||\ - (*(CP = &(R->child[0])) != 0)) {\ - R = *(RP = CP);\ - }\ - if (RTCHECK(ok_address(M, RP)))\ - *RP = 0;\ - else {\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - }\ - }\ - if (XP != 0) {\ - tbinptr* H = treebin_at(M, X->index);\ - if (X == *H) {\ - if ((*H = R) == 0) \ - clear_treemap(M, X->index);\ - }\ - else if (RTCHECK(ok_address(M, XP))) {\ - if (XP->child[0] == X) \ - XP->child[0] = R;\ - else \ - XP->child[1] = R;\ - }\ - else\ - CORRUPTION_ERROR_ACTION(M);\ - if (R != 0) {\ - if (RTCHECK(ok_address(M, R))) {\ - tchunkptr C0, C1;\ - R->parent = XP;\ - if ((C0 = X->child[0]) != 0) {\ - if (RTCHECK(ok_address(M, C0))) {\ - R->child[0] = C0;\ - C0->parent = R;\ - }\ - else\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - if ((C1 = X->child[1]) != 0) {\ - if (RTCHECK(ok_address(M, C1))) {\ - R->child[1] = C1;\ - C1->parent = R;\ - }\ - else\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - }\ - else\ - CORRUPTION_ERROR_ACTION(M);\ - }\ - }\ -} - -/* Relays to large vs small bin operations */ - -#define insert_chunk(M, P, S)\ - if (is_small(S)) insert_small_chunk(M, P, S)\ - else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } - -#define unlink_chunk(M, P, S)\ - if (is_small(S)) unlink_small_chunk(M, P, S)\ - else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); } - - -/* Relays to internal calls to malloc/free from realloc, memalign etc */ - -#if ONLY_MSPACES -#define internal_malloc(m, b) mspace_malloc(m, b) -#define internal_free(m, mem) mspace_free(m,mem); -#else /* ONLY_MSPACES */ -#if MSPACES -#define internal_malloc(m, b)\ - ((m == gm)? dlmalloc(b) : mspace_malloc(m, b)) -#define internal_free(m, mem)\ - if (m == gm) dlfree(mem); else mspace_free(m,mem); -#else /* MSPACES */ -#define internal_malloc(m, b) dlmalloc(b) -#define internal_free(m, mem) dlfree(mem) -#endif /* MSPACES */ -#endif /* ONLY_MSPACES */ - -/* ----------------------- Direct-mmapping chunks ----------------------- */ - -/* - Directly mmapped chunks are set up with an offset to the start of - the mmapped region stored in the prev_foot field of the chunk. This - allows reconstruction of the required argument to MUNMAP when freed, - and also allows adjustment of the returned chunk to meet alignment - requirements (especially in memalign). -*/ - -/* Malloc using mmap */ -static void* mmap_alloc(mstate m, size_t nb) { - size_t mmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK); - if (m->footprint_limit != 0) { - size_t fp = m->footprint + mmsize; - if (fp <= m->footprint || fp > m->footprint_limit) - return 0; - } - if (mmsize > nb) { /* Check for wrap around 0 */ - char* mm = (char*)(CALL_DIRECT_MMAP(mmsize)); - if (mm != CMFAIL) { - size_t offset = align_offset(chunk2mem(mm)); - size_t psize = mmsize - offset - MMAP_FOOT_PAD; - mchunkptr p = (mchunkptr)(mm + offset); - p->prev_foot = offset; - p->head = psize; - mark_inuse_foot(m, p, psize); - chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD; - chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0; - - if (m->least_addr == 0 || mm < m->least_addr) - m->least_addr = mm; - if ((m->footprint += mmsize) > m->max_footprint) - m->max_footprint = m->footprint; - assert(is_aligned(chunk2mem(p))); - check_mmapped_chunk(m, p); - return chunk2mem(p); - } - } - return 0; -} - -/* Realloc using mmap */ -static mchunkptr mmap_resize(mstate m, mchunkptr oldp, size_t nb, int flags) { - size_t oldsize = chunksize(oldp); - (void) flags; - if (is_small(nb)) /* Can't shrink mmap regions below small size */ - return 0; - /* Keep old chunk if big enough but not too big */ - if (oldsize >= nb + SIZE_T_SIZE && - (oldsize - nb) <= (mparams.granularity << 1)) - return oldp; - else { - size_t offset = oldp->prev_foot; - size_t oldmmsize = oldsize + offset + MMAP_FOOT_PAD; - size_t newmmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK); - char* cp = (char*)CALL_MREMAP((char*)oldp - offset, - oldmmsize, newmmsize, flags); - if (cp != CMFAIL) { - mchunkptr newp = (mchunkptr)(cp + offset); - size_t psize = newmmsize - offset - MMAP_FOOT_PAD; - newp->head = psize; - mark_inuse_foot(m, newp, psize); - chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD; - chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0; - - if (cp < m->least_addr) - m->least_addr = cp; - if ((m->footprint += newmmsize - oldmmsize) > m->max_footprint) - m->max_footprint = m->footprint; - check_mmapped_chunk(m, newp); - return newp; - } - } - return 0; -} - - -/* -------------------------- mspace management -------------------------- */ - -/* Initialize top chunk and its size */ -static void init_top(mstate m, mchunkptr p, size_t psize) { - /* Ensure alignment */ - size_t offset = align_offset(chunk2mem(p)); - p = (mchunkptr)((char*)p + offset); - psize -= offset; - - m->top = p; - m->topsize = psize; - p->head = psize | PINUSE_BIT; - /* set size of fake trailing chunk holding overhead space only once */ - chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE; - m->trim_check = mparams.trim_threshold; /* reset on each update */ -} - -/* Initialize bins for a new mstate that is otherwise zeroed out */ -static void init_bins(mstate m) { - /* Establish circular links for smallbins */ - bindex_t i; - for (i = 0; i < NSMALLBINS; ++i) { - sbinptr bin = smallbin_at(m,i); - bin->fd = bin->bk = bin; - } -} - -#if PROCEED_ON_ERROR - -/* default corruption action */ -static void reset_on_error(mstate m) { - int i; - ++malloc_corruption_error_count; - /* Reinitialize fields to forget about all memory */ - m->smallmap = m->treemap = 0; - m->dvsize = m->topsize = 0; - m->seg.base = 0; - m->seg.size = 0; - m->seg.next = 0; - m->top = m->dv = 0; - for (i = 0; i < NTREEBINS; ++i) - *treebin_at(m, i) = 0; - init_bins(m); -} -#endif /* PROCEED_ON_ERROR */ - -/* Allocate chunk and prepend remainder with chunk in successor base. */ -static void* prepend_alloc(mstate m, char* newbase, char* oldbase, - size_t nb) { - mchunkptr p = align_as_chunk(newbase); - mchunkptr oldfirst = align_as_chunk(oldbase); - size_t psize = (char*)oldfirst - (char*)p; - mchunkptr q = chunk_plus_offset(p, nb); - size_t qsize = psize - nb; - set_size_and_pinuse_of_inuse_chunk(m, p, nb); - - assert((char*)oldfirst > (char*)q); - assert(pinuse(oldfirst)); - assert(qsize >= MIN_CHUNK_SIZE); - - /* consolidate remainder with first chunk of old base */ - if (oldfirst == m->top) { - size_t tsize = m->topsize += qsize; - m->top = q; - q->head = tsize | PINUSE_BIT; - check_top_chunk(m, q); - } - else if (oldfirst == m->dv) { - size_t dsize = m->dvsize += qsize; - m->dv = q; - set_size_and_pinuse_of_free_chunk(q, dsize); - } - else { - if (!is_inuse(oldfirst)) { - size_t nsize = chunksize(oldfirst); - unlink_chunk(m, oldfirst, nsize); - oldfirst = chunk_plus_offset(oldfirst, nsize); - qsize += nsize; - } - set_free_with_pinuse(q, qsize, oldfirst); - insert_chunk(m, q, qsize); - check_free_chunk(m, q); - } - - check_malloced_chunk(m, chunk2mem(p), nb); - return chunk2mem(p); -} - -/* Add a segment to hold a new noncontiguous region */ -static void add_segment(mstate m, char* tbase, size_t tsize, flag_t mmapped) { - /* Determine locations and sizes of segment, fenceposts, old top */ - char* old_top = (char*)m->top; - msegmentptr oldsp = segment_holding(m, old_top); - char* old_end = oldsp->base + oldsp->size; - size_t ssize = pad_request(sizeof(struct malloc_segment)); - char* rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK); - size_t offset = align_offset(chunk2mem(rawsp)); - char* asp = rawsp + offset; - char* csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp; - mchunkptr sp = (mchunkptr)csp; - msegmentptr ss = (msegmentptr)(chunk2mem(sp)); - mchunkptr tnext = chunk_plus_offset(sp, ssize); - mchunkptr p = tnext; - int nfences = 0; - - /* reset top to new space */ - init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); - - /* Set up segment record */ - assert(is_aligned(ss)); - set_size_and_pinuse_of_inuse_chunk(m, sp, ssize); - *ss = m->seg; /* Push current record */ - m->seg.base = tbase; - m->seg.size = tsize; - m->seg.sflags = mmapped; - m->seg.next = ss; - - /* Insert trailing fenceposts */ - for (;;) { - mchunkptr nextp = chunk_plus_offset(p, SIZE_T_SIZE); - p->head = FENCEPOST_HEAD; - ++nfences; - if ((char*)(&(nextp->head)) < old_end) - p = nextp; - else - break; - } - assert(nfences >= 2); - - /* Insert the rest of old top into a bin as an ordinary free chunk */ - if (csp != old_top) { - mchunkptr q = (mchunkptr)old_top; - size_t psize = csp - old_top; - mchunkptr tn = chunk_plus_offset(q, psize); - set_free_with_pinuse(q, psize, tn); - insert_chunk(m, q, psize); - } - - check_top_chunk(m, m->top); -} - -/* -------------------------- System allocation -------------------------- */ - -/* Get memory from system using MORECORE or MMAP */ -static void* sys_alloc(mstate m, size_t nb) { - char* tbase = CMFAIL; - size_t tsize = 0; - flag_t mmap_flag = 0; - size_t asize; /* allocation size */ - - ensure_initialization(); - - /* Directly map large chunks, but only if already initialized */ - if (use_mmap(m) && nb >= mparams.mmap_threshold && m->topsize != 0) { - void* mem = mmap_alloc(m, nb); - if (mem != 0) - return mem; - } - - asize = granularity_align(nb + SYS_ALLOC_PADDING); - if (asize <= nb) - return 0; /* wraparound */ - if (m->footprint_limit != 0) { - size_t fp = m->footprint + asize; - if (fp <= m->footprint || fp > m->footprint_limit) - return 0; - } - - /* - Try getting memory in any of three ways (in most-preferred to - least-preferred order): - 1. A call to MORECORE that can normally contiguously extend memory. - (disabled if not MORECORE_CONTIGUOUS or not HAVE_MORECORE or - or main space is mmapped or a previous contiguous call failed) - 2. A call to MMAP new space (disabled if not HAVE_MMAP). - Note that under the default settings, if MORECORE is unable to - fulfill a request, and HAVE_MMAP is true, then mmap is - used as a noncontiguous system allocator. This is a useful backup - strategy for systems with holes in address spaces -- in this case - sbrk cannot contiguously expand the heap, but mmap may be able to - find space. - 3. A call to MORECORE that cannot usually contiguously extend memory. - (disabled if not HAVE_MORECORE) - - In all cases, we need to request enough bytes from system to ensure - we can malloc nb bytes upon success, so pad with enough space for - top_foot, plus alignment-pad to make sure we don't lose bytes if - not on boundary, and round this up to a granularity unit. - */ - - if (MORECORE_CONTIGUOUS && !use_noncontiguous(m)) { - char* br = CMFAIL; - msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top); - ACQUIRE_MALLOC_GLOBAL_LOCK(); - - if (ss == 0) { /* First time through or recovery */ - char* base = (char*)CALL_MORECORE(0); - if (base != CMFAIL) { - size_t fp; - /* Adjust to end on a page boundary */ - if (!is_page_aligned(base)) - asize += (page_align((size_t)base) - (size_t)base); - fp = m->footprint + asize; /* recheck limits */ - if (asize > nb && asize < HALF_MAX_SIZE_T && - (m->footprint_limit == 0 || - (fp > m->footprint && fp <= m->footprint_limit)) && - (br = (char*)(CALL_MORECORE(asize))) == base) { - tbase = base; - tsize = asize; - } - } - } - else { - /* Subtract out existing available top space from MORECORE request. */ - asize = granularity_align(nb - m->topsize + SYS_ALLOC_PADDING); - /* Use mem here only if it did continuously extend old space */ - if (asize < HALF_MAX_SIZE_T && - (br = (char*)(CALL_MORECORE(asize))) == ss->base+ss->size) { - tbase = br; - tsize = asize; - } - } - - if (tbase == CMFAIL) { /* Cope with partial failure */ - if (br != CMFAIL) { /* Try to use/extend the space we did get */ - if (asize < HALF_MAX_SIZE_T && - asize < nb + SYS_ALLOC_PADDING) { - size_t esize = granularity_align(nb + SYS_ALLOC_PADDING - asize); - if (esize < HALF_MAX_SIZE_T) { - char* end = (char*)CALL_MORECORE(esize); - if (end != CMFAIL) - asize += esize; - else { /* Can't use; try to release */ - (void) CALL_MORECORE(-asize); - br = CMFAIL; - } - } - } - } - if (br != CMFAIL) { /* Use the space we did get */ - tbase = br; - tsize = asize; - } - else - disable_contiguous(m); /* Don't try contiguous path in the future */ - } - - RELEASE_MALLOC_GLOBAL_LOCK(); - } - - if (HAVE_MMAP && tbase == CMFAIL) { /* Try MMAP */ - char* mp = (char*)(CALL_MMAP(asize)); - if (mp != CMFAIL) { - tbase = mp; - tsize = asize; - mmap_flag = USE_MMAP_BIT; - } - } - - if (HAVE_MORECORE && tbase == CMFAIL) { /* Try noncontiguous MORECORE */ - if (asize < HALF_MAX_SIZE_T) { - char* br = CMFAIL; - char* end = CMFAIL; - ACQUIRE_MALLOC_GLOBAL_LOCK(); - br = (char*)(CALL_MORECORE(asize)); - end = (char*)(CALL_MORECORE(0)); - RELEASE_MALLOC_GLOBAL_LOCK(); - if (br != CMFAIL && end != CMFAIL && br < end) { - size_t ssize = end - br; - if (ssize > nb + TOP_FOOT_SIZE) { - tbase = br; - tsize = ssize; - } - } - } - } - - if (tbase != CMFAIL) { - - if ((m->footprint += tsize) > m->max_footprint) - m->max_footprint = m->footprint; - - if (!is_initialized(m)) { /* first-time initialization */ - if (m->least_addr == 0 || tbase < m->least_addr) - m->least_addr = tbase; - m->seg.base = tbase; - m->seg.size = tsize; - m->seg.sflags = mmap_flag; - m->magic = mparams.magic; - m->release_checks = MAX_RELEASE_CHECK_RATE; - init_bins(m); -#if !ONLY_MSPACES - if (is_global(m)) - init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); - else -#endif - { - /* Offset top by embedded malloc_state */ - mchunkptr mn = next_chunk(mem2chunk(m)); - init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) -TOP_FOOT_SIZE); - } - } - - else { - /* Try to merge with an existing segment */ - msegmentptr sp = &m->seg; - /* Only consider most recent segment if traversal suppressed */ - while (sp != 0 && tbase != sp->base + sp->size) - sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next; - if (sp != 0 && - !is_extern_segment(sp) && - (sp->sflags & USE_MMAP_BIT) == mmap_flag && - segment_holds(sp, m->top)) { /* append */ - sp->size += tsize; - init_top(m, m->top, m->topsize + tsize); - } - else { - if (tbase < m->least_addr) - m->least_addr = tbase; - sp = &m->seg; - while (sp != 0 && sp->base != tbase + tsize) - sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next; - if (sp != 0 && - !is_extern_segment(sp) && - (sp->sflags & USE_MMAP_BIT) == mmap_flag) { - char* oldbase = sp->base; - sp->base = tbase; - sp->size += tsize; - return prepend_alloc(m, tbase, oldbase, nb); - } - else - add_segment(m, tbase, tsize, mmap_flag); - } - } - - if (nb < m->topsize) { /* Allocate from new or extended top space */ - size_t rsize = m->topsize -= nb; - mchunkptr p = m->top; - mchunkptr r = m->top = chunk_plus_offset(p, nb); - r->head = rsize | PINUSE_BIT; - set_size_and_pinuse_of_inuse_chunk(m, p, nb); - check_top_chunk(m, m->top); - check_malloced_chunk(m, chunk2mem(p), nb); - return chunk2mem(p); - } - } - - MALLOC_FAILURE_ACTION; - return 0; -} - -/* ----------------------- system deallocation -------------------------- */ - -/* Unmap and unlink any mmapped segments that don't contain used chunks */ -static size_t release_unused_segments(mstate m) { - size_t released = 0; - int nsegs = 0; - msegmentptr pred = &m->seg; - msegmentptr sp = pred->next; - while (sp != 0) { - char* base = sp->base; - size_t size = sp->size; - msegmentptr next = sp->next; - ++nsegs; - if (is_mmapped_segment(sp) && !is_extern_segment(sp)) { - mchunkptr p = align_as_chunk(base); - size_t psize = chunksize(p); - /* Can unmap if first chunk holds entire segment and not pinned */ - if (!is_inuse(p) && (char*)p + psize >= base + size - TOP_FOOT_SIZE) { - tchunkptr tp = (tchunkptr)p; - assert(segment_holds(sp, (char*)sp)); - if (p == m->dv) { - m->dv = 0; - m->dvsize = 0; - } - else { - unlink_large_chunk(m, tp); - } - if (CALL_MUNMAP(base, size) == 0) { - released += size; - m->footprint -= size; - /* unlink obsoleted record */ - sp = pred; - sp->next = next; - } - else { /* back out if cannot unmap */ - insert_large_chunk(m, tp, psize); - } - } - } - if (NO_SEGMENT_TRAVERSAL) /* scan only first segment */ - break; - pred = sp; - sp = next; - } - /* Reset check counter */ - m->release_checks = ((nsegs > MAX_RELEASE_CHECK_RATE)? - nsegs : MAX_RELEASE_CHECK_RATE); - return released; -} - -static int sys_trim(mstate m, size_t pad) { - size_t released = 0; - ensure_initialization(); - if (pad < MAX_REQUEST && is_initialized(m)) { - pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */ - - if (m->topsize > pad) { - /* Shrink top space in granularity-size units, keeping at least one */ - size_t unit = mparams.granularity; - size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit - - SIZE_T_ONE) * unit; - msegmentptr sp = segment_holding(m, (char*)m->top); - - if (!is_extern_segment(sp)) { - if (is_mmapped_segment(sp)) { - if (HAVE_MMAP && - sp->size >= extra && - !has_segment_link(m, sp)) { /* can't shrink if pinned */ - size_t newsize = sp->size - extra; - /* Prefer mremap, fall back to munmap */ - if ((CALL_MREMAP(sp->base, sp->size, newsize, 0) != MFAIL) || - (CALL_MUNMAP(sp->base + newsize, extra) == 0)) { - released = extra; - } - } - } - else if (HAVE_MORECORE) { - if (extra >= HALF_MAX_SIZE_T) /* Avoid wrapping negative */ - extra = (HALF_MAX_SIZE_T) + SIZE_T_ONE - unit; - ACQUIRE_MALLOC_GLOBAL_LOCK(); - { - /* Make sure end of memory is where we last set it. */ - char* old_br = (char*)(CALL_MORECORE(0)); - if (old_br == sp->base + sp->size) { - char* rel_br = (char*)(CALL_MORECORE(-extra)); - char* new_br = (char*)(CALL_MORECORE(0)); - if (rel_br != CMFAIL && new_br < old_br) - released = old_br - new_br; - } - } - RELEASE_MALLOC_GLOBAL_LOCK(); - } - } - - if (released != 0) { - sp->size -= released; - m->footprint -= released; - init_top(m, m->top, m->topsize - released); - check_top_chunk(m, m->top); - } - } - - /* Unmap any unused mmapped segments */ - if (HAVE_MMAP) - released += release_unused_segments(m); - - /* On failure, disable autotrim to avoid repeated failed future calls */ - if (released == 0 && m->topsize > m->trim_check) - m->trim_check = MAX_SIZE_T; - } - - return (released != 0)? 1 : 0; -} - -/* Consolidate and bin a chunk. Differs from exported versions - of free mainly in that the chunk need not be marked as inuse. -*/ -static void dispose_chunk(mstate m, mchunkptr p, size_t psize) { - mchunkptr next = chunk_plus_offset(p, psize); - if (!pinuse(p)) { - mchunkptr prev; - size_t prevsize = p->prev_foot; - if (is_mmapped(p)) { - psize += prevsize + MMAP_FOOT_PAD; - if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) - m->footprint -= psize; - return; - } - prev = chunk_minus_offset(p, prevsize); - psize += prevsize; - p = prev; - if (RTCHECK(ok_address(m, prev))) { /* consolidate backward */ - if (p != m->dv) { - unlink_chunk(m, p, prevsize); - } - else if ((next->head & INUSE_BITS) == INUSE_BITS) { - m->dvsize = psize; - set_free_with_pinuse(p, psize, next); - return; - } - } - else { - CORRUPTION_ERROR_ACTION(m); - return; - } - } - if (RTCHECK(ok_address(m, next))) { - if (!cinuse(next)) { /* consolidate forward */ - if (next == m->top) { - size_t tsize = m->topsize += psize; - m->top = p; - p->head = tsize | PINUSE_BIT; - if (p == m->dv) { - m->dv = 0; - m->dvsize = 0; - } - return; - } - else if (next == m->dv) { - size_t dsize = m->dvsize += psize; - m->dv = p; - set_size_and_pinuse_of_free_chunk(p, dsize); - return; - } - else { - size_t nsize = chunksize(next); - psize += nsize; - unlink_chunk(m, next, nsize); - set_size_and_pinuse_of_free_chunk(p, psize); - if (p == m->dv) { - m->dvsize = psize; - return; - } - } - } - else { - set_free_with_pinuse(p, psize, next); - } - insert_chunk(m, p, psize); - } - else { - CORRUPTION_ERROR_ACTION(m); - } -} - -/* ---------------------------- malloc --------------------------- */ - -/* allocate a large request from the best fitting chunk in a treebin */ -static void* tmalloc_large(mstate m, size_t nb) { - tchunkptr v = 0; - size_t rsize = -nb; /* Unsigned negation */ - tchunkptr t; - bindex_t idx; - compute_tree_index(nb, idx); - if ((t = *treebin_at(m, idx)) != 0) { - /* Traverse tree for this bin looking for node with size == nb */ - size_t sizebits = nb << leftshift_for_tree_index(idx); - tchunkptr rst = 0; /* The deepest untaken right subtree */ - for (;;) { - tchunkptr rt; - size_t trem = chunksize(t) - nb; - if (trem < rsize) { - v = t; - if ((rsize = trem) == 0) - break; - } - rt = t->child[1]; - t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; - if (rt != 0 && rt != t) - rst = rt; - if (t == 0) { - t = rst; /* set t to least subtree holding sizes > nb */ - break; - } - sizebits <<= 1; - } - } - if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */ - binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; - if (leftbits != 0) { - bindex_t i; - binmap_t leastbit = least_bit(leftbits); - compute_bit2idx(leastbit, i); - t = *treebin_at(m, i); - } - } - - while (t != 0) { /* find smallest of tree or subtree */ - size_t trem = chunksize(t) - nb; - if (trem < rsize) { - rsize = trem; - v = t; - } - t = leftmost_child(t); - } - - /* If dv is a better fit, return 0 so malloc will use it */ - if (v != 0 && rsize < (size_t)(m->dvsize - nb)) { - if (RTCHECK(ok_address(m, v))) { /* split */ - mchunkptr r = chunk_plus_offset(v, nb); - assert(chunksize(v) == rsize + nb); - if (RTCHECK(ok_next(v, r))) { - unlink_large_chunk(m, v); - if (rsize < MIN_CHUNK_SIZE) - set_inuse_and_pinuse(m, v, (rsize + nb)); - else { - set_size_and_pinuse_of_inuse_chunk(m, v, nb); - set_size_and_pinuse_of_free_chunk(r, rsize); - insert_chunk(m, r, rsize); - } - return chunk2mem(v); - } - } - CORRUPTION_ERROR_ACTION(m); - } - return 0; -} - -/* allocate a small request from the best fitting chunk in a treebin */ -static void* tmalloc_small(mstate m, size_t nb) { - tchunkptr t, v; - size_t rsize; - bindex_t i; - binmap_t leastbit = least_bit(m->treemap); - compute_bit2idx(leastbit, i); - v = t = *treebin_at(m, i); - rsize = chunksize(t) - nb; - - while ((t = leftmost_child(t)) != 0) { - size_t trem = chunksize(t) - nb; - if (trem < rsize) { - rsize = trem; - v = t; - } - } - - if (RTCHECK(ok_address(m, v))) { - mchunkptr r = chunk_plus_offset(v, nb); - assert(chunksize(v) == rsize + nb); - if (RTCHECK(ok_next(v, r))) { - unlink_large_chunk(m, v); - if (rsize < MIN_CHUNK_SIZE) - set_inuse_and_pinuse(m, v, (rsize + nb)); - else { - set_size_and_pinuse_of_inuse_chunk(m, v, nb); - set_size_and_pinuse_of_free_chunk(r, rsize); - replace_dv(m, r, rsize); - } - return chunk2mem(v); - } - } - - CORRUPTION_ERROR_ACTION(m); - return 0; -} - -#if !ONLY_MSPACES - -void* dlmalloc(size_t bytes) { - /* - Basic algorithm: - If a small request (< 256 bytes minus per-chunk overhead): - 1. If one exists, use a remainderless chunk in associated smallbin. - (Remainderless means that there are too few excess bytes to - represent as a chunk.) - 2. If it is big enough, use the dv chunk, which is normally the - chunk adjacent to the one used for the most recent small request. - 3. If one exists, split the smallest available chunk in a bin, - saving remainder in dv. - 4. If it is big enough, use the top chunk. - 5. If available, get memory from system and use it - Otherwise, for a large request: - 1. Find the smallest available binned chunk that fits, and use it - if it is better fitting than dv chunk, splitting if necessary. - 2. If better fitting than any binned chunk, use the dv chunk. - 3. If it is big enough, use the top chunk. - 4. If request size >= mmap threshold, try to directly mmap this chunk. - 5. If available, get memory from system and use it - - The ugly goto's here ensure that postaction occurs along all paths. - */ - -#if USE_LOCKS - ensure_initialization(); /* initialize in sys_alloc if not using locks */ -#endif - - if (!PREACTION(gm)) { - void* mem; - size_t nb; - if (bytes <= MAX_SMALL_REQUEST) { - bindex_t idx; - binmap_t smallbits; - nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); - idx = small_index(nb); - smallbits = gm->smallmap >> idx; - - if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ - mchunkptr b, p; - idx += ~smallbits & 1; /* Uses next bin if idx empty */ - b = smallbin_at(gm, idx); - p = b->fd; - assert(chunksize(p) == small_index2size(idx)); - unlink_first_small_chunk(gm, b, p, idx); - set_inuse_and_pinuse(gm, p, small_index2size(idx)); - mem = chunk2mem(p); - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - - else if (nb > gm->dvsize) { - if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ - mchunkptr b, p, r; - size_t rsize; - bindex_t i; - binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); - binmap_t leastbit = least_bit(leftbits); - compute_bit2idx(leastbit, i); - b = smallbin_at(gm, i); - p = b->fd; - assert(chunksize(p) == small_index2size(i)); - unlink_first_small_chunk(gm, b, p, i); - rsize = small_index2size(i) - nb; - /* Fit here cannot be remainderless if 4byte sizes */ - if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) - set_inuse_and_pinuse(gm, p, small_index2size(i)); - else { - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); - r = chunk_plus_offset(p, nb); - set_size_and_pinuse_of_free_chunk(r, rsize); - replace_dv(gm, r, rsize); - } - mem = chunk2mem(p); - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - - else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - } - } - else if (bytes >= MAX_REQUEST) - nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ - else { - nb = pad_request(bytes); - if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - } - - if (nb <= gm->dvsize) { - size_t rsize = gm->dvsize - nb; - mchunkptr p = gm->dv; - if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ - mchunkptr r = gm->dv = chunk_plus_offset(p, nb); - gm->dvsize = rsize; - set_size_and_pinuse_of_free_chunk(r, rsize); - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); - } - else { /* exhaust dv */ - size_t dvs = gm->dvsize; - gm->dvsize = 0; - gm->dv = 0; - set_inuse_and_pinuse(gm, p, dvs); - } - mem = chunk2mem(p); - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - - else if (nb < gm->topsize) { /* Split top */ - size_t rsize = gm->topsize -= nb; - mchunkptr p = gm->top; - mchunkptr r = gm->top = chunk_plus_offset(p, nb); - r->head = rsize | PINUSE_BIT; - set_size_and_pinuse_of_inuse_chunk(gm, p, nb); - mem = chunk2mem(p); - check_top_chunk(gm, gm->top); - check_malloced_chunk(gm, mem, nb); - goto postaction; - } - - mem = sys_alloc(gm, nb); - - postaction: - POSTACTION(gm); - return mem; - } - - return 0; -} - -/* ---------------------------- free --------------------------- */ - -void dlfree(void* mem) { - /* - Consolidate freed chunks with preceeding or succeeding bordering - free chunks, if they exist, and then place in a bin. Intermixed - with special cases for top, dv, mmapped chunks, and usage errors. - */ - - if (mem != 0) { - mchunkptr p = mem2chunk(mem); -#if FOOTERS - mstate fm = get_mstate_for(p); - if (!ok_magic(fm)) { - USAGE_ERROR_ACTION(fm, p); - return; - } -#else /* FOOTERS */ -#define fm gm -#endif /* FOOTERS */ - if (!PREACTION(fm)) { - check_inuse_chunk(fm, p); - if (RTCHECK(ok_address(fm, p) && ok_inuse(p))) { - size_t psize = chunksize(p); - mchunkptr next = chunk_plus_offset(p, psize); - if (!pinuse(p)) { - size_t prevsize = p->prev_foot; - if (is_mmapped(p)) { - psize += prevsize + MMAP_FOOT_PAD; - if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) - fm->footprint -= psize; - goto postaction; - } - else { - mchunkptr prev = chunk_minus_offset(p, prevsize); - psize += prevsize; - p = prev; - if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ - if (p != fm->dv) { - unlink_chunk(fm, p, prevsize); - } - else if ((next->head & INUSE_BITS) == INUSE_BITS) { - fm->dvsize = psize; - set_free_with_pinuse(p, psize, next); - goto postaction; - } - } - else - goto erroraction; - } - } - - if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { - if (!cinuse(next)) { /* consolidate forward */ - if (next == fm->top) { - size_t tsize = fm->topsize += psize; - fm->top = p; - p->head = tsize | PINUSE_BIT; - if (p == fm->dv) { - fm->dv = 0; - fm->dvsize = 0; - } - if (should_trim(fm, tsize)) - sys_trim(fm, 0); - goto postaction; - } - else if (next == fm->dv) { - size_t dsize = fm->dvsize += psize; - fm->dv = p; - set_size_and_pinuse_of_free_chunk(p, dsize); - goto postaction; - } - else { - size_t nsize = chunksize(next); - psize += nsize; - unlink_chunk(fm, next, nsize); - set_size_and_pinuse_of_free_chunk(p, psize); - if (p == fm->dv) { - fm->dvsize = psize; - goto postaction; - } - } - } - else - set_free_with_pinuse(p, psize, next); - - if (is_small(psize)) { - insert_small_chunk(fm, p, psize); - check_free_chunk(fm, p); - } - else { - tchunkptr tp = (tchunkptr)p; - insert_large_chunk(fm, tp, psize); - check_free_chunk(fm, p); - if (--fm->release_checks == 0) - release_unused_segments(fm); - } - goto postaction; - } - } - erroraction: - USAGE_ERROR_ACTION(fm, p); - postaction: - POSTACTION(fm); - } - } -#if !FOOTERS -#undef fm -#endif /* FOOTERS */ -} - -void* dlcalloc(size_t n_elements, size_t elem_size) { - void* mem; - size_t req = 0; - if (n_elements != 0) { - req = n_elements * elem_size; - if (((n_elements | elem_size) & ~(size_t)0xffff) && - (req / n_elements != elem_size)) - req = MAX_SIZE_T; /* force downstream failure on overflow */ - } - mem = dlmalloc(req); - if (mem != 0 && calloc_must_clear(mem2chunk(mem))) - memset(mem, 0, req); - return mem; -} - -#endif /* !ONLY_MSPACES */ - -/* ------------ Internal support for realloc, memalign, etc -------------- */ - -/* Try to realloc; only in-place unless can_move true */ -static mchunkptr try_realloc_chunk(mstate m, mchunkptr p, size_t nb, - int can_move) { - mchunkptr newp = 0; - size_t oldsize = chunksize(p); - mchunkptr next = chunk_plus_offset(p, oldsize); - if (RTCHECK(ok_address(m, p) && ok_inuse(p) && - ok_next(p, next) && ok_pinuse(next))) { - if (is_mmapped(p)) { - newp = mmap_resize(m, p, nb, can_move); - } - else if (oldsize >= nb) { /* already big enough */ - size_t rsize = oldsize - nb; - if (rsize >= MIN_CHUNK_SIZE) { /* split off remainder */ - mchunkptr r = chunk_plus_offset(p, nb); - set_inuse(m, p, nb); - set_inuse(m, r, rsize); - dispose_chunk(m, r, rsize); - } - newp = p; - } - else if (next == m->top) { /* extend into top */ - if (oldsize + m->topsize > nb) { - size_t newsize = oldsize + m->topsize; - size_t newtopsize = newsize - nb; - mchunkptr newtop = chunk_plus_offset(p, nb); - set_inuse(m, p, nb); - newtop->head = newtopsize |PINUSE_BIT; - m->top = newtop; - m->topsize = newtopsize; - newp = p; - } - } - else if (next == m->dv) { /* extend into dv */ - size_t dvs = m->dvsize; - if (oldsize + dvs >= nb) { - size_t dsize = oldsize + dvs - nb; - if (dsize >= MIN_CHUNK_SIZE) { - mchunkptr r = chunk_plus_offset(p, nb); - mchunkptr n = chunk_plus_offset(r, dsize); - set_inuse(m, p, nb); - set_size_and_pinuse_of_free_chunk(r, dsize); - clear_pinuse(n); - m->dvsize = dsize; - m->dv = r; - } - else { /* exhaust dv */ - size_t newsize = oldsize + dvs; - set_inuse(m, p, newsize); - m->dvsize = 0; - m->dv = 0; - } - newp = p; - } - } - else if (!cinuse(next)) { /* extend into next free chunk */ - size_t nextsize = chunksize(next); - if (oldsize + nextsize >= nb) { - size_t rsize = oldsize + nextsize - nb; - unlink_chunk(m, next, nextsize); - if (rsize < MIN_CHUNK_SIZE) { - size_t newsize = oldsize + nextsize; - set_inuse(m, p, newsize); - } - else { - mchunkptr r = chunk_plus_offset(p, nb); - set_inuse(m, p, nb); - set_inuse(m, r, rsize); - dispose_chunk(m, r, rsize); - } - newp = p; - } - } - } - else { - USAGE_ERROR_ACTION(m, oldmem); - } - return newp; -} - -static void* internal_memalign(mstate m, size_t alignment, size_t bytes) { - void* mem = 0; - if (alignment < MIN_CHUNK_SIZE) /* must be at least a minimum chunk size */ - alignment = MIN_CHUNK_SIZE; - if ((alignment & (alignment-SIZE_T_ONE)) != 0) {/* Ensure a power of 2 */ - size_t a = MALLOC_ALIGNMENT << 1; - while (a < alignment) a <<= 1; - alignment = a; - } - if (bytes >= MAX_REQUEST - alignment) { - if (m != 0) { /* Test isn't needed but avoids compiler warning */ - MALLOC_FAILURE_ACTION; - } - } - else { - size_t nb = request2size(bytes); - size_t req = nb + alignment + MIN_CHUNK_SIZE - CHUNK_OVERHEAD; - mem = internal_malloc(m, req); - if (mem != 0) { - mchunkptr p = mem2chunk(mem); - if (PREACTION(m)) - return 0; - if ((((size_t)(mem)) & (alignment - 1)) != 0) { /* misaligned */ - /* - Find an aligned spot inside chunk. Since we need to give - back leading space in a chunk of at least MIN_CHUNK_SIZE, if - the first calculation places us at a spot with less than - MIN_CHUNK_SIZE leader, we can move to the next aligned spot. - We've allocated enough total room so that this is always - possible. - */ - char* br = (char*)mem2chunk((size_t)(((size_t)((char*)mem + alignment - - SIZE_T_ONE)) & - -alignment)); - char* pos = ((size_t)(br - (char*)(p)) >= MIN_CHUNK_SIZE)? - br : br+alignment; - mchunkptr newp = (mchunkptr)pos; - size_t leadsize = pos - (char*)(p); - size_t newsize = chunksize(p) - leadsize; - - if (is_mmapped(p)) { /* For mmapped chunks, just adjust offset */ - newp->prev_foot = p->prev_foot + leadsize; - newp->head = newsize; - } - else { /* Otherwise, give back leader, use the rest */ - set_inuse(m, newp, newsize); - set_inuse(m, p, leadsize); - dispose_chunk(m, p, leadsize); - } - p = newp; - } - - /* Give back spare room at the end */ - if (!is_mmapped(p)) { - size_t size = chunksize(p); - if (size > nb + MIN_CHUNK_SIZE) { - size_t remainder_size = size - nb; - mchunkptr remainder = chunk_plus_offset(p, nb); - set_inuse(m, p, nb); - set_inuse(m, remainder, remainder_size); - dispose_chunk(m, remainder, remainder_size); - } - } - - mem = chunk2mem(p); - assert (chunksize(p) >= nb); - assert(((size_t)mem & (alignment - 1)) == 0); - check_inuse_chunk(m, p); - POSTACTION(m); - } - } - return mem; -} - -/* - Common support for independent_X routines, handling - all of the combinations that can result. - The opts arg has: - bit 0 set if all elements are same size (using sizes[0]) - bit 1 set if elements should be zeroed -*/ -static void** ialloc(mstate m, - size_t n_elements, - size_t* sizes, - int opts, - void* chunks[]) { - - size_t element_size; /* chunksize of each element, if all same */ - size_t contents_size; /* total size of elements */ - size_t array_size; /* request size of pointer array */ - void* mem; /* malloced aggregate space */ - mchunkptr p; /* corresponding chunk */ - size_t remainder_size; /* remaining bytes while splitting */ - void** marray; /* either "chunks" or malloced ptr array */ - mchunkptr array_chunk; /* chunk for malloced ptr array */ - flag_t was_enabled; /* to disable mmap */ - size_t size; - size_t i; - - ensure_initialization(); - /* compute array length, if needed */ - if (chunks != 0) { - if (n_elements == 0) - return chunks; /* nothing to do */ - marray = chunks; - array_size = 0; - } - else { - /* if empty req, must still return chunk representing empty array */ - if (n_elements == 0) - return (void**)internal_malloc(m, 0); - marray = 0; - array_size = request2size(n_elements * (sizeof(void*))); - } - - /* compute total element size */ - if (opts & 0x1) { /* all-same-size */ - element_size = request2size(*sizes); - contents_size = n_elements * element_size; - } - else { /* add up all the sizes */ - element_size = 0; - contents_size = 0; - for (i = 0; i != n_elements; ++i) - contents_size += request2size(sizes[i]); - } - - size = contents_size + array_size; - - /* - Allocate the aggregate chunk. First disable direct-mmapping so - malloc won't use it, since we would not be able to later - free/realloc space internal to a segregated mmap region. - */ - was_enabled = use_mmap(m); - disable_mmap(m); - mem = internal_malloc(m, size - CHUNK_OVERHEAD); - if (was_enabled) - enable_mmap(m); - if (mem == 0) - return 0; - - if (PREACTION(m)) return 0; - p = mem2chunk(mem); - remainder_size = chunksize(p); - - assert(!is_mmapped(p)); - - if (opts & 0x2) { /* optionally clear the elements */ - memset((size_t*)mem, 0, remainder_size - SIZE_T_SIZE - array_size); - } - - /* If not provided, allocate the pointer array as final part of chunk */ - if (marray == 0) { - size_t array_chunk_size; - array_chunk = chunk_plus_offset(p, contents_size); - array_chunk_size = remainder_size - contents_size; - marray = (void**) (chunk2mem(array_chunk)); - set_size_and_pinuse_of_inuse_chunk(m, array_chunk, array_chunk_size); - remainder_size = contents_size; - } - - /* split out elements */ - for (i = 0; ; ++i) { - marray[i] = chunk2mem(p); - if (i != n_elements-1) { - if (element_size != 0) - size = element_size; - else - size = request2size(sizes[i]); - remainder_size -= size; - set_size_and_pinuse_of_inuse_chunk(m, p, size); - p = chunk_plus_offset(p, size); - } - else { /* the final element absorbs any overallocation slop */ - set_size_and_pinuse_of_inuse_chunk(m, p, remainder_size); - break; - } - } - -#if DEBUG - if (marray != chunks) { - /* final element must have exactly exhausted chunk */ - if (element_size != 0) { - assert(remainder_size == element_size); - } - else { - assert(remainder_size == request2size(sizes[i])); - } - check_inuse_chunk(m, mem2chunk(marray)); - } - for (i = 0; i != n_elements; ++i) - check_inuse_chunk(m, mem2chunk(marray[i])); - -#endif /* DEBUG */ - - POSTACTION(m); - return marray; -} - -/* Try to free all pointers in the given array. - Note: this could be made faster, by delaying consolidation, - at the price of disabling some user integrity checks, We - still optimize some consolidations by combining adjacent - chunks before freeing, which will occur often if allocated - with ialloc or the array is sorted. -*/ -static size_t internal_bulk_free(mstate m, void* array[], size_t nelem) { - size_t unfreed = 0; - if (!PREACTION(m)) { - void** a; - void** fence = &(array[nelem]); - for (a = array; a != fence; ++a) { - void* mem = *a; - if (mem != 0) { - mchunkptr p = mem2chunk(mem); - size_t psize = chunksize(p); -#if FOOTERS - if (get_mstate_for(p) != m) { - ++unfreed; - continue; - } -#endif - check_inuse_chunk(m, p); - *a = 0; - if (RTCHECK(ok_address(m, p) && ok_inuse(p))) { - void ** b = a + 1; /* try to merge with next chunk */ - mchunkptr next = next_chunk(p); - if (b != fence && *b == chunk2mem(next)) { - size_t newsize = chunksize(next) + psize; - set_inuse(m, p, newsize); - *b = chunk2mem(p); - } - else - dispose_chunk(m, p, psize); - } - else { - CORRUPTION_ERROR_ACTION(m); - break; - } - } - } - if (should_trim(m, m->topsize)) - sys_trim(m, 0); - POSTACTION(m); - } - return unfreed; -} - -/* Traversal */ -#if MALLOC_INSPECT_ALL -static void internal_inspect_all(mstate m, - void(*handler)(void *start, - void *end, - size_t used_bytes, - void* callback_arg), - void* arg) { - if (is_initialized(m)) { - mchunkptr top = m->top; - msegmentptr s; - for (s = &m->seg; s != 0; s = s->next) { - mchunkptr q = align_as_chunk(s->base); - while (segment_holds(s, q) && q->head != FENCEPOST_HEAD) { - mchunkptr next = next_chunk(q); - size_t sz = chunksize(q); - size_t used; - void* start; - if (is_inuse(q)) { - used = sz - CHUNK_OVERHEAD; /* must not be mmapped */ - start = chunk2mem(q); - } - else { - used = 0; - if (is_small(sz)) { /* offset by possible bookkeeping */ - start = (void*)((char*)q + sizeof(malloc_chunk)); - } - else { - start = (void*)((char*)q + sizeof(malloc_tree_chunk)); - } - } - if (start < (void*)next) /* skip if all space is bookkeeping */ - handler(start, next, used, arg); - if (q == top) - break; - q = next; - } - } - } -} -#endif /* MALLOC_INSPECT_ALL */ - -/* ------------------ Exported realloc, memalign, etc -------------------- */ - -#if !ONLY_MSPACES - -void* dlrealloc(void* oldmem, size_t bytes) { - void* mem = 0; - if (oldmem == 0) { - mem = dlmalloc(bytes); - } - else if (bytes >= MAX_REQUEST) { - MALLOC_FAILURE_ACTION; - } -#ifdef REALLOC_ZERO_BYTES_FREES - else if (bytes == 0) { - dlfree(oldmem); - } -#endif /* REALLOC_ZERO_BYTES_FREES */ - else { - size_t nb = request2size(bytes); - mchunkptr oldp = mem2chunk(oldmem); -#if ! FOOTERS - mstate m = gm; -#else /* FOOTERS */ - mstate m = get_mstate_for(oldp); - if (!ok_magic(m)) { - USAGE_ERROR_ACTION(m, oldmem); - return 0; - } -#endif /* FOOTERS */ - if (!PREACTION(m)) { - mchunkptr newp = try_realloc_chunk(m, oldp, nb, 1); - POSTACTION(m); - if (newp != 0) { - check_inuse_chunk(m, newp); - mem = chunk2mem(newp); - } - else { - mem = internal_malloc(m, bytes); - if (mem != 0) { - size_t oc = chunksize(oldp) - overhead_for(oldp); - memcpy(mem, oldmem, (oc < bytes)? oc : bytes); - internal_free(m, oldmem); - } - } - } - } - return mem; -} - -void* dlrealloc_in_place(void* oldmem, size_t bytes) { - void* mem = 0; - if (oldmem != 0) { - if (bytes >= MAX_REQUEST) { - MALLOC_FAILURE_ACTION; - } - else { - size_t nb = request2size(bytes); - mchunkptr oldp = mem2chunk(oldmem); -#if ! FOOTERS - mstate m = gm; -#else /* FOOTERS */ - mstate m = get_mstate_for(oldp); - if (!ok_magic(m)) { - USAGE_ERROR_ACTION(m, oldmem); - return 0; - } -#endif /* FOOTERS */ - if (!PREACTION(m)) { - mchunkptr newp = try_realloc_chunk(m, oldp, nb, 0); - POSTACTION(m); - if (newp == oldp) { - check_inuse_chunk(m, newp); - mem = oldmem; - } - } - } - } - return mem; -} - -void* dlmemalign(size_t alignment, size_t bytes) { - if (alignment <= MALLOC_ALIGNMENT) { - return dlmalloc(bytes); - } - return internal_memalign(gm, alignment, bytes); -} - -int dlposix_memalign(void** pp, size_t alignment, size_t bytes) { - void* mem = 0; - if (alignment == MALLOC_ALIGNMENT) - mem = dlmalloc(bytes); - else { - size_t d = alignment / sizeof(void*); - size_t r = alignment % sizeof(void*); - if (r != 0 || d == 0 || (d & (d-SIZE_T_ONE)) != 0) - return EINVAL; - else if (bytes >= MAX_REQUEST - alignment) { - if (alignment < MIN_CHUNK_SIZE) - alignment = MIN_CHUNK_SIZE; - mem = internal_memalign(gm, alignment, bytes); - } - } - if (mem == 0) - return ENOMEM; - else { - *pp = mem; - return 0; - } -} - -void* dlvalloc(size_t bytes) { - size_t pagesz; - ensure_initialization(); - pagesz = mparams.page_size; - return dlmemalign(pagesz, bytes); -} - -void* dlpvalloc(size_t bytes) { - size_t pagesz; - ensure_initialization(); - pagesz = mparams.page_size; - return dlmemalign(pagesz, (bytes + pagesz - SIZE_T_ONE) & ~(pagesz - SIZE_T_ONE)); -} - -void** dlindependent_calloc(size_t n_elements, size_t elem_size, - void* chunks[]) { - size_t sz = elem_size; /* serves as 1-element array */ - return ialloc(gm, n_elements, &sz, 3, chunks); -} - -void** dlindependent_comalloc(size_t n_elements, size_t sizes[], - void* chunks[]) { - return ialloc(gm, n_elements, sizes, 0, chunks); -} - -size_t dlbulk_free(void* array[], size_t nelem) { - return internal_bulk_free(gm, array, nelem); -} - -#if MALLOC_INSPECT_ALL -void dlmalloc_inspect_all(void(*handler)(void *start, - void *end, - size_t used_bytes, - void* callback_arg), - void* arg) { - ensure_initialization(); - if (!PREACTION(gm)) { - internal_inspect_all(gm, handler, arg); - POSTACTION(gm); - } -} -#endif /* MALLOC_INSPECT_ALL */ - -int dlmalloc_trim(size_t pad) { - int result = 0; - ensure_initialization(); - if (!PREACTION(gm)) { - result = sys_trim(gm, pad); - POSTACTION(gm); - } - return result; -} - -size_t dlmalloc_footprint(void) { - return gm->footprint; -} - -size_t dlmalloc_max_footprint(void) { - return gm->max_footprint; -} - -size_t dlmalloc_footprint_limit(void) { - size_t maf = gm->footprint_limit; - return maf == 0 ? MAX_SIZE_T : maf; -} - -size_t dlmalloc_set_footprint_limit(size_t bytes) { - size_t result; /* invert sense of 0 */ - if (bytes == 0) - result = granularity_align(1); /* Use minimal size */ - if (bytes == MAX_SIZE_T) - result = 0; /* disable */ - else - result = granularity_align(bytes); - return gm->footprint_limit = result; -} - -#if !NO_MALLINFO -struct mallinfo dlmallinfo(void) { - return internal_mallinfo(gm); -} -#endif /* NO_MALLINFO */ - -#if !NO_MALLOC_STATS -void dlmalloc_stats() { - internal_malloc_stats(gm); -} -#endif /* NO_MALLOC_STATS */ - -int dlmallopt(int param_number, int value) { - return change_mparam(param_number, value); -} - -size_t dlmalloc_usable_size(void* mem) { - if (mem != 0) { - mchunkptr p = mem2chunk(mem); - if (is_inuse(p)) - return chunksize(p) - overhead_for(p); - } - return 0; -} - -#endif /* !ONLY_MSPACES */ - -/* ----------------------------- user mspaces ---------------------------- */ - -#if MSPACES - -static mstate init_user_mstate(char* tbase, size_t tsize) { - size_t msize = pad_request(sizeof(struct malloc_state)); - mchunkptr mn; - mchunkptr msp = align_as_chunk(tbase); - mstate m = (mstate)(chunk2mem(msp)); - memset(m, 0, msize); - (void)INITIAL_LOCK(&m->mutex); - msp->head = (msize|INUSE_BITS); - m->seg.base = m->least_addr = tbase; - m->seg.size = m->footprint = m->max_footprint = tsize; - m->magic = mparams.magic; - m->release_checks = MAX_RELEASE_CHECK_RATE; - m->mflags = mparams.default_mflags; - m->extp = 0; - m->exts = 0; - disable_contiguous(m); - init_bins(m); - mn = next_chunk(mem2chunk(m)); - init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) - TOP_FOOT_SIZE); - check_top_chunk(m, m->top); - return m; -} - -mspace create_mspace(size_t capacity, int locked) { - mstate m = 0; - size_t msize; - ensure_initialization(); - msize = pad_request(sizeof(struct malloc_state)); - if (capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { - size_t rs = ((capacity == 0)? mparams.granularity : - (capacity + TOP_FOOT_SIZE + msize)); - size_t tsize = granularity_align(rs); - char* tbase = (char*)(CALL_MMAP(tsize)); - if (tbase != CMFAIL) { - m = init_user_mstate(tbase, tsize); - m->seg.sflags = USE_MMAP_BIT; - set_lock(m, locked); - } - } - return (mspace)m; -} - -mspace create_mspace_with_base(void* base, size_t capacity, int locked) { - mstate m = 0; - size_t msize; - ensure_initialization(); - msize = pad_request(sizeof(struct malloc_state)); - if (capacity > msize + TOP_FOOT_SIZE && - capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { - m = init_user_mstate((char*)base, capacity); - m->seg.sflags = EXTERN_BIT; - set_lock(m, locked); - } - return (mspace)m; -} - -int mspace_track_large_chunks(mspace msp, int enable) { - int ret = 0; - mstate ms = (mstate)msp; - if (!PREACTION(ms)) { - if (!use_mmap(ms)) - ret = 1; - if (!enable) - enable_mmap(ms); - else - disable_mmap(ms); - POSTACTION(ms); - } - return ret; -} - -size_t destroy_mspace(mspace msp) { - size_t freed = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - msegmentptr sp = &ms->seg; - (void)DESTROY_LOCK(&ms->mutex); /* destroy before unmapped */ - while (sp != 0) { - char* base = sp->base; - size_t size = sp->size; - flag_t flag = sp->sflags; - sp = sp->next; - if ((flag & USE_MMAP_BIT) && !(flag & EXTERN_BIT) && - CALL_MUNMAP(base, size) == 0) - freed += size; - } - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return freed; -} - -/* - mspace versions of routines are near-clones of the global - versions. This is not so nice but better than the alternatives. -*/ - -void* mspace_malloc(mspace msp, size_t bytes) { - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - return 0; - } - if (!PREACTION(ms)) { - void* mem; - size_t nb; - if (bytes <= MAX_SMALL_REQUEST) { - bindex_t idx; - binmap_t smallbits; - nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); - idx = small_index(nb); - smallbits = ms->smallmap >> idx; - - if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ - mchunkptr b, p; - idx += ~smallbits & 1; /* Uses next bin if idx empty */ - b = smallbin_at(ms, idx); - p = b->fd; - assert(chunksize(p) == small_index2size(idx)); - unlink_first_small_chunk(ms, b, p, idx); - set_inuse_and_pinuse(ms, p, small_index2size(idx)); - mem = chunk2mem(p); - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - - else if (nb > ms->dvsize) { - if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ - mchunkptr b, p, r; - size_t rsize; - bindex_t i; - binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); - binmap_t leastbit = least_bit(leftbits); - compute_bit2idx(leastbit, i); - b = smallbin_at(ms, i); - p = b->fd; - assert(chunksize(p) == small_index2size(i)); - unlink_first_small_chunk(ms, b, p, i); - rsize = small_index2size(i) - nb; - /* Fit here cannot be remainderless if 4byte sizes */ - if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) - set_inuse_and_pinuse(ms, p, small_index2size(i)); - else { - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); - r = chunk_plus_offset(p, nb); - set_size_and_pinuse_of_free_chunk(r, rsize); - replace_dv(ms, r, rsize); - } - mem = chunk2mem(p); - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - - else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - } - } - else if (bytes >= MAX_REQUEST) - nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ - else { - nb = pad_request(bytes); - if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) { - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - } - - if (nb <= ms->dvsize) { - size_t rsize = ms->dvsize - nb; - mchunkptr p = ms->dv; - if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ - mchunkptr r = ms->dv = chunk_plus_offset(p, nb); - ms->dvsize = rsize; - set_size_and_pinuse_of_free_chunk(r, rsize); - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); - } - else { /* exhaust dv */ - size_t dvs = ms->dvsize; - ms->dvsize = 0; - ms->dv = 0; - set_inuse_and_pinuse(ms, p, dvs); - } - mem = chunk2mem(p); - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - - else if (nb < ms->topsize) { /* Split top */ - size_t rsize = ms->topsize -= nb; - mchunkptr p = ms->top; - mchunkptr r = ms->top = chunk_plus_offset(p, nb); - r->head = rsize | PINUSE_BIT; - set_size_and_pinuse_of_inuse_chunk(ms, p, nb); - mem = chunk2mem(p); - check_top_chunk(ms, ms->top); - check_malloced_chunk(ms, mem, nb); - goto postaction; - } - - mem = sys_alloc(ms, nb); - - postaction: - POSTACTION(ms); - return mem; - } - - return 0; -} - -void mspace_free(mspace msp, void* mem) { - if (mem != 0) { - mchunkptr p = mem2chunk(mem); -#if FOOTERS - mstate fm = get_mstate_for(p); - msp = msp; /* placate people compiling -Wunused */ -#else /* FOOTERS */ - mstate fm = (mstate)msp; -#endif /* FOOTERS */ - if (!ok_magic(fm)) { - USAGE_ERROR_ACTION(fm, p); - return; - } - if (!PREACTION(fm)) { - check_inuse_chunk(fm, p); - if (RTCHECK(ok_address(fm, p) && ok_inuse(p))) { - size_t psize = chunksize(p); - mchunkptr next = chunk_plus_offset(p, psize); - if (!pinuse(p)) { - size_t prevsize = p->prev_foot; - if (is_mmapped(p)) { - psize += prevsize + MMAP_FOOT_PAD; - if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) - fm->footprint -= psize; - goto postaction; - } - else { - mchunkptr prev = chunk_minus_offset(p, prevsize); - psize += prevsize; - p = prev; - if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ - if (p != fm->dv) { - unlink_chunk(fm, p, prevsize); - } - else if ((next->head & INUSE_BITS) == INUSE_BITS) { - fm->dvsize = psize; - set_free_with_pinuse(p, psize, next); - goto postaction; - } - } - else - goto erroraction; - } - } - - if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { - if (!cinuse(next)) { /* consolidate forward */ - if (next == fm->top) { - size_t tsize = fm->topsize += psize; - fm->top = p; - p->head = tsize | PINUSE_BIT; - if (p == fm->dv) { - fm->dv = 0; - fm->dvsize = 0; - } - if (should_trim(fm, tsize)) - sys_trim(fm, 0); - goto postaction; - } - else if (next == fm->dv) { - size_t dsize = fm->dvsize += psize; - fm->dv = p; - set_size_and_pinuse_of_free_chunk(p, dsize); - goto postaction; - } - else { - size_t nsize = chunksize(next); - psize += nsize; - unlink_chunk(fm, next, nsize); - set_size_and_pinuse_of_free_chunk(p, psize); - if (p == fm->dv) { - fm->dvsize = psize; - goto postaction; - } - } - } - else - set_free_with_pinuse(p, psize, next); - - if (is_small(psize)) { - insert_small_chunk(fm, p, psize); - check_free_chunk(fm, p); - } - else { - tchunkptr tp = (tchunkptr)p; - insert_large_chunk(fm, tp, psize); - check_free_chunk(fm, p); - if (--fm->release_checks == 0) - release_unused_segments(fm); - } - goto postaction; - } - } - erroraction: - USAGE_ERROR_ACTION(fm, p); - postaction: - POSTACTION(fm); - } - } -} - -void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size) { - void* mem; - size_t req = 0; - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - return 0; - } - if (n_elements != 0) { - req = n_elements * elem_size; - if (((n_elements | elem_size) & ~(size_t)0xffff) && - (req / n_elements != elem_size)) - req = MAX_SIZE_T; /* force downstream failure on overflow */ - } - mem = internal_malloc(ms, req); - if (mem != 0 && calloc_must_clear(mem2chunk(mem))) - memset(mem, 0, req); - return mem; -} - -void* mspace_realloc(mspace msp, void* oldmem, size_t bytes) { - void* mem = 0; - if (oldmem == 0) { - mem = mspace_malloc(msp, bytes); - } - else if (bytes >= MAX_REQUEST) { - MALLOC_FAILURE_ACTION; - } -#ifdef REALLOC_ZERO_BYTES_FREES - else if (bytes == 0) { - mspace_free(msp, oldmem); - } -#endif /* REALLOC_ZERO_BYTES_FREES */ - else { - size_t nb = request2size(bytes); - mchunkptr oldp = mem2chunk(oldmem); -#if ! FOOTERS - mstate m = (mstate)msp; -#else /* FOOTERS */ - mstate m = get_mstate_for(oldp); - if (!ok_magic(m)) { - USAGE_ERROR_ACTION(m, oldmem); - return 0; - } -#endif /* FOOTERS */ - if (!PREACTION(m)) { - mchunkptr newp = try_realloc_chunk(m, oldp, nb, 1); - POSTACTION(m); - if (newp != 0) { - check_inuse_chunk(m, newp); - mem = chunk2mem(newp); - } - else { - mem = mspace_malloc(m, bytes); - if (mem != 0) { - size_t oc = chunksize(oldp) - overhead_for(oldp); - memcpy(mem, oldmem, (oc < bytes)? oc : bytes); - mspace_free(m, oldmem); - } - } - } - } - return mem; -} - -void* mspace_realloc_in_place(mspace msp, void* oldmem, size_t bytes) { - void* mem = 0; - if (oldmem != 0) { - if (bytes >= MAX_REQUEST) { - MALLOC_FAILURE_ACTION; - } - else { - size_t nb = request2size(bytes); - mchunkptr oldp = mem2chunk(oldmem); -#if ! FOOTERS - mstate m = (mstate)msp; -#else /* FOOTERS */ - mstate m = get_mstate_for(oldp); - msp = msp; /* placate people compiling -Wunused */ - if (!ok_magic(m)) { - USAGE_ERROR_ACTION(m, oldmem); - return 0; - } -#endif /* FOOTERS */ - if (!PREACTION(m)) { - mchunkptr newp = try_realloc_chunk(m, oldp, nb, 0); - POSTACTION(m); - if (newp == oldp) { - check_inuse_chunk(m, newp); - mem = oldmem; - } - } - } - } - return mem; -} - -void* mspace_memalign(mspace msp, size_t alignment, size_t bytes) { - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - return 0; - } - if (alignment <= MALLOC_ALIGNMENT) - return mspace_malloc(msp, bytes); - return internal_memalign(ms, alignment, bytes); -} - -void** mspace_independent_calloc(mspace msp, size_t n_elements, - size_t elem_size, void* chunks[]) { - size_t sz = elem_size; /* serves as 1-element array */ - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - return 0; - } - return ialloc(ms, n_elements, &sz, 3, chunks); -} - -void** mspace_independent_comalloc(mspace msp, size_t n_elements, - size_t sizes[], void* chunks[]) { - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - return 0; - } - return ialloc(ms, n_elements, sizes, 0, chunks); -} - -size_t mspace_bulk_free(mspace msp, void* array[], size_t nelem) { - return internal_bulk_free((mstate)msp, array, nelem); -} - -#if MALLOC_INSPECT_ALL -void mspace_inspect_all(mspace msp, - void(*handler)(void *start, - void *end, - size_t used_bytes, - void* callback_arg), - void* arg) { - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - if (!PREACTION(ms)) { - internal_inspect_all(ms, handler, arg); - POSTACTION(ms); - } - } - else { - USAGE_ERROR_ACTION(ms,ms); - } -} -#endif /* MALLOC_INSPECT_ALL */ - -int mspace_trim(mspace msp, size_t pad) { - int result = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - if (!PREACTION(ms)) { - result = sys_trim(ms, pad); - POSTACTION(ms); - } - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return result; -} - -#if !NO_MALLOC_STATS -void mspace_malloc_stats(mspace msp) { - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - internal_malloc_stats(ms); - } - else { - USAGE_ERROR_ACTION(ms,ms); - } -} -#endif /* NO_MALLOC_STATS */ - -size_t mspace_footprint(mspace msp) { - size_t result = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - result = ms->footprint; - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return result; -} - -size_t mspace_max_footprint(mspace msp) { - size_t result = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - result = ms->max_footprint; - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return result; -} - -size_t mspace_footprint_limit(mspace msp) { - size_t result = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - size_t maf = ms->footprint_limit; - result = (maf == 0) ? MAX_SIZE_T : maf; - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return result; -} - -size_t mspace_set_footprint_limit(mspace msp, size_t bytes) { - size_t result = 0; - mstate ms = (mstate)msp; - if (ok_magic(ms)) { - if (bytes == 0) - result = granularity_align(1); /* Use minimal size */ - if (bytes == MAX_SIZE_T) - result = 0; /* disable */ - else - result = granularity_align(bytes); - ms->footprint_limit = result; - } - else { - USAGE_ERROR_ACTION(ms,ms); - } - return result; -} - -#if !NO_MALLINFO -struct mallinfo mspace_mallinfo(mspace msp) { - mstate ms = (mstate)msp; - if (!ok_magic(ms)) { - USAGE_ERROR_ACTION(ms,ms); - } - return internal_mallinfo(ms); -} -#endif /* NO_MALLINFO */ - -size_t mspace_usable_size(void* mem) { - if (mem != 0) { - mchunkptr p = mem2chunk(mem); - if (is_inuse(p)) - return chunksize(p) - overhead_for(p); - } - return 0; -} - -int mspace_mallopt(int param_number, int value) { - return change_mparam(param_number, value); -} - -#endif /* MSPACES */ - - -/* -------------------- Alternative MORECORE functions ------------------- */ - -/* - Guidelines for creating a custom version of MORECORE: - - * For best performance, MORECORE should allocate in multiples of pagesize. - * MORECORE may allocate more memory than requested. (Or even less, - but this will usually result in a malloc failure.) - * MORECORE must not allocate memory when given argument zero, but - instead return one past the end address of memory from previous - nonzero call. - * For best performance, consecutive calls to MORECORE with positive - arguments should return increasing addresses, indicating that - space has been contiguously extended. - * Even though consecutive calls to MORECORE need not return contiguous - addresses, it must be OK for malloc'ed chunks to span multiple - regions in those cases where they do happen to be contiguous. - * MORECORE need not handle negative arguments -- it may instead - just return MFAIL when given negative arguments. - Negative arguments are always multiples of pagesize. MORECORE - must not misinterpret negative args as large positive unsigned - args. You can suppress all such calls from even occurring by defining - MORECORE_CANNOT_TRIM, - - As an example alternative MORECORE, here is a custom allocator - kindly contributed for pre-OSX macOS. It uses virtually but not - necessarily physically contiguous non-paged memory (locked in, - present and won't get swapped out). You can use it by uncommenting - this section, adding some #includes, and setting up the appropriate - defines above: - - #define MORECORE osMoreCore - - There is also a shutdown routine that should somehow be called for - cleanup upon program exit. - - #define MAX_POOL_ENTRIES 100 - #define MINIMUM_MORECORE_SIZE (64 * 1024U) - static int next_os_pool; - void *our_os_pools[MAX_POOL_ENTRIES]; - - void *osMoreCore(int size) - { - void *ptr = 0; - static void *sbrk_top = 0; - - if (size > 0) - { - if (size < MINIMUM_MORECORE_SIZE) - size = MINIMUM_MORECORE_SIZE; - if (CurrentExecutionLevel() == kTaskLevel) - ptr = PoolAllocateResident(size + RM_PAGE_SIZE, 0); - if (ptr == 0) - { - return (void *) MFAIL; - } - // save ptrs so they can be freed during cleanup - our_os_pools[next_os_pool] = ptr; - next_os_pool++; - ptr = (void *) ((((size_t) ptr) + RM_PAGE_MASK) & ~RM_PAGE_MASK); - sbrk_top = (char *) ptr + size; - return ptr; - } - else if (size < 0) - { - // we don't currently support shrink behavior - return (void *) MFAIL; - } - else - { - return sbrk_top; - } - } - - // cleanup any allocated memory pools - // called as last thing before shutting down driver - - void osCleanupMem(void) - { - void **ptr; - - for (ptr = our_os_pools; ptr < &our_os_pools[MAX_POOL_ENTRIES]; ptr++) - if (*ptr) - { - PoolDeallocate(*ptr); - *ptr = 0; - } - } - -*/ - - -/* ----------------------------------------------------------------------- -History: - v2.8.5 Sun May 22 10:26:02 2011 Doug Lea (dl at gee) - * Always perform unlink checks unless INSECURE - * Add posix_memalign. - * Improve realloc to expand in more cases; expose realloc_in_place. - Thanks to Peter Buhr for the suggestion. - * Add footprint_limit, inspect_all, bulk_free. Thanks - to Barry Hayes and others for the suggestions. - * Internal refactorings to avoid calls while holding locks - * Use non-reentrant locks by default. Thanks to Roland McGrath - for the suggestion. - * Small fixes to mspace_destroy, reset_on_error. - * Various configuration extensions/changes. Thanks - to all who contributed these. - - V2.8.4a Thu Apr 28 14:39:43 2011 (dl at gee.cs.oswego.edu) - * Update Creative Commons URL - - V2.8.4 Wed May 27 09:56:23 2009 Doug Lea (dl at gee) - * Use zeros instead of prev foot for is_mmapped - * Add mspace_track_large_chunks; thanks to Jean Brouwers - * Fix set_inuse in internal_realloc; thanks to Jean Brouwers - * Fix insufficient sys_alloc padding when using 16byte alignment - * Fix bad error check in mspace_footprint - * Adaptations for ptmalloc; thanks to Wolfram Gloger. - * Reentrant spin locks; thanks to Earl Chew and others - * Win32 improvements; thanks to Niall Douglas and Earl Chew - * Add NO_SEGMENT_TRAVERSAL and MAX_RELEASE_CHECK_RATE options - * Extension hook in malloc_state - * Various small adjustments to reduce warnings on some compilers - * Various configuration extensions/changes for more platforms. Thanks - to all who contributed these. - - V2.8.3 Thu Sep 22 11:16:32 2005 Doug Lea (dl at gee) - * Add max_footprint functions - * Ensure all appropriate literals are size_t - * Fix conditional compilation problem for some #define settings - * Avoid concatenating segments with the one provided - in create_mspace_with_base - * Rename some variables to avoid compiler shadowing warnings - * Use explicit lock initialization. - * Better handling of sbrk interference. - * Simplify and fix segment insertion, trimming and mspace_destroy - * Reinstate REALLOC_ZERO_BYTES_FREES option from 2.7.x - * Thanks especially to Dennis Flanagan for help on these. - - V2.8.2 Sun Jun 12 16:01:10 2005 Doug Lea (dl at gee) - * Fix memalign brace error. - - V2.8.1 Wed Jun 8 16:11:46 2005 Doug Lea (dl at gee) - * Fix improper #endif nesting in C++ - * Add explicit casts needed for C++ - - V2.8.0 Mon May 30 14:09:02 2005 Doug Lea (dl at gee) - * Use trees for large bins - * Support mspaces - * Use segments to unify sbrk-based and mmap-based system allocation, - removing need for emulation on most platforms without sbrk. - * Default safety checks - * Optional footer checks. Thanks to William Robertson for the idea. - * Internal code refactoring - * Incorporate suggestions and platform-specific changes. - Thanks to Dennis Flanagan, Colin Plumb, Niall Douglas, - Aaron Bachmann, Emery Berger, and others. - * Speed up non-fastbin processing enough to remove fastbins. - * Remove useless cfree() to avoid conflicts with other apps. - * Remove internal memcpy, memset. Compilers handle builtins better. - * Remove some options that no one ever used and rename others. - - V2.7.2 Sat Aug 17 09:07:30 2002 Doug Lea (dl at gee) - * Fix malloc_state bitmap array misdeclaration - - V2.7.1 Thu Jul 25 10:58:03 2002 Doug Lea (dl at gee) - * Allow tuning of FIRST_SORTED_BIN_SIZE - * Use PTR_UINT as type for all ptr->int casts. Thanks to John Belmonte. - * Better detection and support for non-contiguousness of MORECORE. - Thanks to Andreas Mueller, Conal Walsh, and Wolfram Gloger - * Bypass most of malloc if no frees. Thanks To Emery Berger. - * Fix freeing of old top non-contiguous chunk im sysmalloc. - * Raised default trim and map thresholds to 256K. - * Fix mmap-related #defines. Thanks to Lubos Lunak. - * Fix copy macros; added LACKS_FCNTL_H. Thanks to Neal Walfield. - * Branch-free bin calculation - * Default trim and mmap thresholds now 256K. - - V2.7.0 Sun Mar 11 14:14:06 2001 Doug Lea (dl at gee) - * Introduce independent_comalloc and independent_calloc. - Thanks to Michael Pachos for motivation and help. - * Make optional .h file available - * Allow > 2GB requests on 32bit systems. - * new WIN32 sbrk, mmap, munmap, lock code from . - Thanks also to Andreas Mueller , - and Anonymous. - * Allow override of MALLOC_ALIGNMENT (Thanks to Ruud Waij for - helping test this.) - * memalign: check alignment arg - * realloc: don't try to shift chunks backwards, since this - leads to more fragmentation in some programs and doesn't - seem to help in any others. - * Collect all cases in malloc requiring system memory into sysmalloc - * Use mmap as backup to sbrk - * Place all internal state in malloc_state - * Introduce fastbins (although similar to 2.5.1) - * Many minor tunings and cosmetic improvements - * Introduce USE_PUBLIC_MALLOC_WRAPPERS, USE_MALLOC_LOCK - * Introduce MALLOC_FAILURE_ACTION, MORECORE_CONTIGUOUS - Thanks to Tony E. Bennett and others. - * Include errno.h to support default failure action. - - V2.6.6 Sun Dec 5 07:42:19 1999 Doug Lea (dl at gee) - * return null for negative arguments - * Added Several WIN32 cleanups from Martin C. Fong - * Add 'LACKS_SYS_PARAM_H' for those systems without 'sys/param.h' - (e.g. WIN32 platforms) - * Cleanup header file inclusion for WIN32 platforms - * Cleanup code to avoid Microsoft Visual C++ compiler complaints - * Add 'USE_DL_PREFIX' to quickly allow co-existence with existing - memory allocation routines - * Set 'malloc_getpagesize' for WIN32 platforms (needs more work) - * Use 'assert' rather than 'ASSERT' in WIN32 code to conform to - usage of 'assert' in non-WIN32 code - * Improve WIN32 'sbrk()' emulation's 'findRegion()' routine to - avoid infinite loop - * Always call 'fREe()' rather than 'free()' - - V2.6.5 Wed Jun 17 15:57:31 1998 Doug Lea (dl at gee) - * Fixed ordering problem with boundary-stamping - - V2.6.3 Sun May 19 08:17:58 1996 Doug Lea (dl at gee) - * Added pvalloc, as recommended by H.J. Liu - * Added 64bit pointer support mainly from Wolfram Gloger - * Added anonymously donated WIN32 sbrk emulation - * Malloc, calloc, getpagesize: add optimizations from Raymond Nijssen - * malloc_extend_top: fix mask error that caused wastage after - foreign sbrks - * Add linux mremap support code from HJ Liu - - V2.6.2 Tue Dec 5 06:52:55 1995 Doug Lea (dl at gee) - * Integrated most documentation with the code. - * Add support for mmap, with help from - Wolfram Gloger (Gloger@lrz.uni-muenchen.de). - * Use last_remainder in more cases. - * Pack bins using idea from colin@nyx10.cs.du.edu - * Use ordered bins instead of best-fit threshhold - * Eliminate block-local decls to simplify tracing and debugging. - * Support another case of realloc via move into top - * Fix error occuring when initial sbrk_base not word-aligned. - * Rely on page size for units instead of SBRK_UNIT to - avoid surprises about sbrk alignment conventions. - * Add mallinfo, mallopt. Thanks to Raymond Nijssen - (raymond@es.ele.tue.nl) for the suggestion. - * Add `pad' argument to malloc_trim and top_pad mallopt parameter. - * More precautions for cases where other routines call sbrk, - courtesy of Wolfram Gloger (Gloger@lrz.uni-muenchen.de). - * Added macros etc., allowing use in linux libc from - H.J. Lu (hjl@gnu.ai.mit.edu) - * Inverted this history list - - V2.6.1 Sat Dec 2 14:10:57 1995 Doug Lea (dl at gee) - * Re-tuned and fixed to behave more nicely with V2.6.0 changes. - * Removed all preallocation code since under current scheme - the work required to undo bad preallocations exceeds - the work saved in good cases for most test programs. - * No longer use return list or unconsolidated bins since - no scheme using them consistently outperforms those that don't - given above changes. - * Use best fit for very large chunks to prevent some worst-cases. - * Added some support for debugging - - V2.6.0 Sat Nov 4 07:05:23 1995 Doug Lea (dl at gee) - * Removed footers when chunks are in use. Thanks to - Paul Wilson (wilson@cs.texas.edu) for the suggestion. - - V2.5.4 Wed Nov 1 07:54:51 1995 Doug Lea (dl at gee) - * Added malloc_trim, with help from Wolfram Gloger - (wmglo@Dent.MED.Uni-Muenchen.DE). - - V2.5.3 Tue Apr 26 10:16:01 1994 Doug Lea (dl at g) - - V2.5.2 Tue Apr 5 16:20:40 1994 Doug Lea (dl at g) - * realloc: try to expand in both directions - * malloc: swap order of clean-bin strategy; - * realloc: only conditionally expand backwards - * Try not to scavenge used bins - * Use bin counts as a guide to preallocation - * Occasionally bin return list chunks in first scan - * Add a few optimizations from colin@nyx10.cs.du.edu - - V2.5.1 Sat Aug 14 15:40:43 1993 Doug Lea (dl at g) - * faster bin computation & slightly different binning - * merged all consolidations to one part of malloc proper - (eliminating old malloc_find_space & malloc_clean_bin) - * Scan 2 returns chunks (not just 1) - * Propagate failure in realloc if malloc returns 0 - * Add stuff to allow compilation on non-ANSI compilers - from kpv@research.att.com - - V2.5 Sat Aug 7 07:41:59 1993 Doug Lea (dl at g.oswego.edu) - * removed potential for odd address access in prev_chunk - * removed dependency on getpagesize.h - * misc cosmetics and a bit more internal documentation - * anticosmetics: mangled names in macros to evade debugger strangeness - * tested on sparc, hp-700, dec-mips, rs6000 - with gcc & native cc (hp, dec only) allowing - Detlefs & Zorn comparison study (in SIGPLAN Notices.) - - Trial version Fri Aug 28 13:14:29 1992 Doug Lea (dl at g.oswego.edu) - * Based loosely on libg++-1.2X malloc. (It retains some of the overall - structure of old version, but most details differ.) - -*/ -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* TODO: TEST ME */ -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* + This is a version (aka dlmalloc) of malloc/free/realloc written by + Doug Lea and released to the public domain, as explained at + http://creativecommons.org/publicdomain/zero/1.0/ Send questions, + comments, complaints, performance data, etc to dl@cs.oswego.edu + +* Version 2.8.5 Sun May 22 10:26:02 2011 Doug Lea (dl at gee) + + Note: There may be an updated version of this malloc obtainable at + ftp://gee.cs.oswego.edu/pub/misc/malloc.c + Check before installing! + +* Quickstart + + This library is all in one file to simplify the most common usage: + ftp it, compile it (-O3), and link it into another program. All of + the compile-time options default to reasonable values for use on + most platforms. You might later want to step through various + compile-time and dynamic tuning options. + + For convenience, an include file for code using this malloc is at: + ftp://gee.cs.oswego.edu/pub/misc/malloc-2.8.5.h + You don't really need this .h file unless you call functions not + defined in your system include files. The .h file contains only the + excerpts from this file needed for using this malloc on ANSI C/C++ + systems, so long as you haven't changed compile-time options about + naming and tuning parameters. If you do, then you can create your + own malloc.h that does include all settings by cutting at the point + indicated below. Note that you may already by default be using a C + library containing a malloc that is based on some version of this + malloc (for example in linux). You might still want to use the one + in this file to customize settings or to avoid overheads associated + with library versions. + +* Vital statistics: + + Supported pointer/size_t representation: 4 or 8 bytes + size_t MUST be an unsigned type of the same width as + pointers. (If you are using an ancient system that declares + size_t as a signed type, or need it to be a different width + than pointers, you can use a previous release of this malloc + (e.g. 2.7.2) supporting these.) + + Alignment: 8 bytes (default) + This suffices for nearly all current machines and C compilers. + However, you can define MALLOC_ALIGNMENT to be wider than this + if necessary (up to 128bytes), at the expense of using more space. + + Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes) + 8 or 16 bytes (if 8byte sizes) + Each malloced chunk has a hidden word of overhead holding size + and status information, and additional cross-check word + if FOOTERS is defined. + + Minimum allocated size: 4-byte ptrs: 16 bytes (including overhead) + 8-byte ptrs: 32 bytes (including overhead) + + Even a request for zero bytes (i.e., malloc(0)) returns a + pointer to something of the minimum allocatable size. + The maximum overhead wastage (i.e., number of extra bytes + allocated than were requested in malloc) is less than or equal + to the minimum size, except for requests >= mmap_threshold that + are serviced via mmap(), where the worst case wastage is about + 32 bytes plus the remainder from a system page (the minimal + mmap unit); typically 4096 or 8192 bytes. + + Security: static-safe; optionally more or less + The "security" of malloc refers to the ability of malicious + code to accentuate the effects of errors (for example, freeing + space that is not currently malloc'ed or overwriting past the + ends of chunks) in code that calls malloc. This malloc + guarantees not to modify any memory locations below the base of + heap, i.e., static variables, even in the presence of usage + errors. The routines additionally detect most improper frees + and reallocs. All this holds as long as the static bookkeeping + for malloc itself is not corrupted by some other means. This + is only one aspect of security -- these checks do not, and + cannot, detect all possible programming errors. + + If FOOTERS is defined nonzero, then each allocated chunk + carries an additional check word to verify that it was malloced + from its space. These check words are the same within each + execution of a program using malloc, but differ across + executions, so externally crafted fake chunks cannot be + freed. This improves security by rejecting frees/reallocs that + could corrupt heap memory, in addition to the checks preventing + writes to statics that are always on. This may further improve + security at the expense of time and space overhead. (Note that + FOOTERS may also be worth using with MSPACES.) + + By default detected errors cause the program to abort (calling + "abort()"). You can override this to instead proceed past + errors by defining PROCEED_ON_ERROR. In this case, a bad free + has no effect, and a malloc that encounters a bad address + caused by user overwrites will ignore the bad address by + dropping pointers and indices to all known memory. This may + be appropriate for programs that should continue if at all + possible in the face of programming errors, although they may + run out of memory because dropped memory is never reclaimed. + + If you don't like either of these options, you can define + CORRUPTION_ERROR_ACTION and USAGE_ERROR_ACTION to do anything + else. And if if you are sure that your program using malloc has + no errors or vulnerabilities, you can define INSECURE to 1, + which might (or might not) provide a small performance improvement. + + It is also possible to limit the maximum total allocatable + space, using malloc_set_footprint_limit. This is not + designed as a security feature in itself (calls to set limits + are not screened or privileged), but may be useful as one + aspect of a secure implementation. + + Thread-safety: NOT thread-safe unless USE_LOCKS defined non-zero + When USE_LOCKS is defined, each public call to malloc, free, + etc is surrounded with a lock. By default, this uses a plain + pthread mutex, win32 critical section, or a spin-lock if if + available for the platform and not disabled by setting + USE_SPIN_LOCKS=0. However, if USE_RECURSIVE_LOCKS is defined, + recursive versions are used instead (which are not required for + base functionality but may be needed in layered extensions). + Using a global lock is not especially fast, and can be a major + bottleneck. It is designed only to provide minimal protection + in concurrent environments, and to provide a basis for + extensions. If you are using malloc in a concurrent program, + consider instead using nedmalloc + (http://www.nedprod.com/programs/portable/nedmalloc/) or + ptmalloc (See http://www.malloc.de), which are derived from + versions of this malloc. + + System requirements: Any combination of MORECORE and/or MMAP/MUNMAP + This malloc can use unix sbrk or any emulation (invoked using + the CALL_MORECORE macro) and/or mmap/munmap or any emulation + (invoked using CALL_MMAP/CALL_MUNMAP) to get and release system + memory. On most unix systems, it tends to work best if both + MORECORE and MMAP are enabled. On Win32, it uses emulations + based on VirtualAlloc. It also uses common C library functions + like memset. + + Compliance: I believe it is compliant with the Single Unix Specification + (See http://www.unix.org). Also SVID/XPG, ANSI C, and probably + others as well. + +* Overview of algorithms + + This is not the fastest, most space-conserving, most portable, or + most tunable malloc ever written. However it is among the fastest + while also being among the most space-conserving, portable and + tunable. Consistent balance across these factors results in a good + general-purpose allocator for malloc-intensive programs. + + In most ways, this malloc is a best-fit allocator. Generally, it + chooses the best-fitting existing chunk for a request, with ties + broken in approximately least-recently-used order. (This strategy + normally maintains low fragmentation.) However, for requests less + than 256bytes, it deviates from best-fit when there is not an + exactly fitting available chunk by preferring to use space adjacent + to that used for the previous small request, as well as by breaking + ties in approximately most-recently-used order. (These enhance + locality of series of small allocations.) And for very large requests + (>= 256Kb by default), it relies on system memory mapping + facilities, if supported. (This helps avoid carrying around and + possibly fragmenting memory used only for large chunks.) + + All operations (except malloc_stats and mallinfo) have execution + times that are bounded by a constant factor of the number of bits in + a size_t, not counting any clearing in calloc or copying in realloc, + or actions surrounding MORECORE and MMAP that have times + proportional to the number of non-contiguous regions returned by + system allocation routines, which is often just 1. In real-time + applications, you can optionally suppress segment traversals using + NO_SEGMENT_TRAVERSAL, which assures bounded execution even when + system allocators return non-contiguous spaces, at the typical + expense of carrying around more memory and increased fragmentation. + + The implementation is not very modular and seriously overuses + macros. Perhaps someday all C compilers will do as good a job + inlining modular code as can now be done by brute-force expansion, + but now, enough of them seem not to. + + Some compilers issue a lot of warnings about code that is + dead/unreachable only on some platforms, and also about intentional + uses of negation on unsigned types. All known cases of each can be + ignored. + + For a longer but out of date high-level description, see + http://gee.cs.oswego.edu/dl/html/malloc.html + +* MSPACES + If MSPACES is defined, then in addition to malloc, free, etc., + this file also defines mspace_malloc, mspace_free, etc. These + are versions of malloc routines that take an "mspace" argument + obtained using create_mspace, to control all internal bookkeeping. + If ONLY_MSPACES is defined, only these versions are compiled. + So if you would like to use this allocator for only some allocations, + and your system malloc for others, you can compile with + ONLY_MSPACES and then do something like... + static mspace mymspace = create_mspace(0,0); // for example + #define mymalloc(bytes) mspace_malloc(mymspace, bytes) + + (Note: If you only need one instance of an mspace, you can instead + use "USE_DL_PREFIX" to relabel the global malloc.) + + You can similarly create thread-local allocators by storing + mspaces as thread-locals. For example: + static __thread mspace tlms = 0; + void* tlmalloc(size_t bytes) { + if (tlms == 0) tlms = create_mspace(0, 0); + return mspace_malloc(tlms, bytes); + } + void tlfree(void* mem) { mspace_free(tlms, mem); } + + Unless FOOTERS is defined, each mspace is completely independent. + You cannot allocate from one and free to another (although + conformance is only weakly checked, so usage errors are not always + caught). If FOOTERS is defined, then each chunk carries around a tag + indicating its originating mspace, and frees are directed to their + originating spaces. Normally, this requires use of locks. + + ------------------------- Compile-time options --------------------------- + +Be careful in setting #define values for numerical constants of type +size_t. On some systems, literal values are not automatically extended +to size_t precision unless they are explicitly casted. You can also +use the symbolic values MAX_SIZE_T, SIZE_T_ONE, etc below. + +WIN32 default: defined if _WIN32 defined + Defining WIN32 sets up defaults for MS environment and compilers. + Otherwise defaults are for unix. Beware that there seem to be some + cases where this malloc might not be a pure drop-in replacement for + Win32 malloc: Random-looking failures from Win32 GDI API's (eg; + SetDIBits()) may be due to bugs in some video driver implementations + when pixel buffers are malloc()ed, and the region spans more than + one VirtualAlloc()ed region. Because dlmalloc uses a small (64Kb) + default granularity, pixel buffers may straddle virtual allocation + regions more often than when using the Microsoft allocator. You can + avoid this by using VirtualAlloc() and VirtualFree() for all pixel + buffers rather than using malloc(). If this is not possible, + recompile this malloc with a larger DEFAULT_GRANULARITY. Note: + in cases where MSC and gcc (cygwin) are known to differ on WIN32, + conditions use _MSC_VER to distinguish them. + +DLMALLOC_EXPORT default: extern + Defines how public APIs are declared. If you want to export via a + Windows DLL, you might define this as + #define DLMALLOC_EXPORT extern __declspace(dllexport) + If you want a POSIX ELF shared object, you might use + #define DLMALLOC_EXPORT extern __attribute__((visibility("default"))) + +MALLOC_ALIGNMENT default: (size_t)8 + Controls the minimum alignment for malloc'ed chunks. It must be a + power of two and at least 8, even on machines for which smaller + alignments would suffice. It may be defined as larger than this + though. Note however that code and data structures are optimized for + the case of 8-byte alignment. + +MSPACES default: 0 (false) + If true, compile in support for independent allocation spaces. + This is only supported if HAVE_MMAP is true. + +ONLY_MSPACES default: 0 (false) + If true, only compile in mspace versions, not regular versions. + +USE_LOCKS default: 0 (false) + Causes each call to each public routine to be surrounded with + pthread or WIN32 mutex lock/unlock. (If set true, this can be + overridden on a per-mspace basis for mspace versions.) If set to a + non-zero value other than 1, locks are used, but their + implementation is left out, so lock functions must be supplied manually, + as described below. + +USE_SPIN_LOCKS default: 1 iff USE_LOCKS and spin locks available + If true, uses custom spin locks for locking. This is currently + supported only gcc >= 4.1, older gccs on x86 platforms, and recent + MS compilers. Otherwise, posix locks or win32 critical sections are + used. + +USE_RECURSIVE_LOCKS default: not defined + If defined nonzero, uses recursive (aka reentrant) locks, otherwise + uses plain mutexes. This is not required for malloc proper, but may + be needed for layered allocators such as nedmalloc. + +FOOTERS default: 0 + If true, provide extra checking and dispatching by placing + information in the footers of allocated chunks. This adds + space and time overhead. + +INSECURE default: 0 + If true, omit checks for usage errors and heap space overwrites. + +USE_DL_PREFIX default: NOT defined + Causes compiler to prefix all public routines with the string 'dl'. + This can be useful when you only want to use this malloc in one part + of a program, using your regular system malloc elsewhere. + +MALLOC_INSPECT_ALL default: NOT defined + If defined, compiles malloc_inspect_all and mspace_inspect_all, that + perform traversal of all heap space. Unless access to these + functions is otherwise restricted, you probably do not want to + include them in secure implementations. + +ABORT default: defined as abort() + Defines how to abort on failed checks. On most systems, a failed + check cannot die with an "assert" or even print an informative + message, because the underlying print routines in turn call malloc, + which will fail again. Generally, the best policy is to simply call + abort(). It's not very useful to do more than this because many + errors due to overwriting will show up as address faults (null, odd + addresses etc) rather than malloc-triggered checks, so will also + abort. Also, most compilers know that abort() does not return, so + can better optimize code conditionally calling it. + +PROCEED_ON_ERROR default: defined as 0 (false) + Controls whether detected bad addresses cause them to bypassed + rather than aborting. If set, detected bad arguments to free and + realloc are ignored. And all bookkeeping information is zeroed out + upon a detected overwrite of freed heap space, thus losing the + ability to ever return it from malloc again, but enabling the + application to proceed. If PROCEED_ON_ERROR is defined, the + static variable malloc_corruption_error_count is compiled in + and can be examined to see if errors have occurred. This option + generates slower code than the default abort policy. + +DEBUG default: NOT defined + The DEBUG setting is mainly intended for people trying to modify + this code or diagnose problems when porting to new platforms. + However, it may also be able to better isolate user errors than just + using runtime checks. The assertions in the check routines spell + out in more detail the assumptions and invariants underlying the + algorithms. The checking is fairly extensive, and will slow down + execution noticeably. Calling malloc_stats or mallinfo with DEBUG + set will attempt to check every non-mmapped allocated and free chunk + in the course of computing the summaries. + +ABORT_ON_ASSERT_FAILURE default: defined as 1 (true) + Debugging assertion failures can be nearly impossible if your + version of the assert macro causes malloc to be called, which will + lead to a cascade of further failures, blowing the runtime stack. + ABORT_ON_ASSERT_FAILURE cause assertions failures to call abort(), + which will usually make debugging easier. + +MALLOC_FAILURE_ACTION default: sets errno to ENOMEM, or no-op on win32 + The action to take before "return 0" when malloc fails to be able to + return memory because there is none available. + +HAVE_MORECORE default: 1 (true) unless win32 or ONLY_MSPACES + True if this system supports sbrk or an emulation of it. + +MORECORE default: sbrk + The name of the sbrk-style system routine to call to obtain more + memory. See below for guidance on writing custom MORECORE + functions. The type of the argument to sbrk/MORECORE varies across + systems. It cannot be size_t, because it supports negative + arguments, so it is normally the signed type of the same width as + size_t (sometimes declared as "intptr_t"). It doesn't much matter + though. Internally, we only call it with arguments less than half + the max value of a size_t, which should work across all reasonable + possibilities, although sometimes generating compiler warnings. + +MORECORE_CONTIGUOUS default: 1 (true) if HAVE_MORECORE + If true, take advantage of fact that consecutive calls to MORECORE + with positive arguments always return contiguous increasing + addresses. This is true of unix sbrk. It does not hurt too much to + set it true anyway, since malloc copes with non-contiguities. + Setting it false when definitely non-contiguous saves time + and possibly wasted space it would take to discover this though. + +MORECORE_CANNOT_TRIM default: NOT defined + True if MORECORE cannot release space back to the system when given + negative arguments. This is generally necessary only if you are + using a hand-crafted MORECORE function that cannot handle negative + arguments. + +NO_SEGMENT_TRAVERSAL default: 0 + If non-zero, suppresses traversals of memory segments + returned by either MORECORE or CALL_MMAP. This disables + merging of segments that are contiguous, and selectively + releasing them to the OS if unused, but bounds execution times. + +HAVE_MMAP default: 1 (true) + True if this system supports mmap or an emulation of it. If so, and + HAVE_MORECORE is not true, MMAP is used for all system + allocation. If set and HAVE_MORECORE is true as well, MMAP is + primarily used to directly allocate very large blocks. It is also + used as a backup strategy in cases where MORECORE fails to provide + space from system. Note: A single call to MUNMAP is assumed to be + able to unmap memory that may have be allocated using multiple calls + to MMAP, so long as they are adjacent. + +HAVE_MREMAP default: 1 on linux, else 0 + If true realloc() uses mremap() to re-allocate large blocks and + extend or shrink allocation spaces. + +MMAP_CLEARS default: 1 except on WINCE. + True if mmap clears memory so calloc doesn't need to. This is true + for standard unix mmap using /dev/zero and on WIN32 except for WINCE. + +USE_BUILTIN_FFS default: 0 (i.e., not used) + Causes malloc to use the builtin ffs() function to compute indices. + Some compilers may recognize and intrinsify ffs to be faster than the + supplied C version. Also, the case of x86 using gcc is special-cased + to an asm instruction, so is already as fast as it can be, and so + this setting has no effect. Similarly for Win32 under recent MS compilers. + (On most x86s, the asm version is only slightly faster than the C version.) + +malloc_getpagesize default: derive from system includes, or 4096. + The system page size. To the extent possible, this malloc manages + memory from the system in page-size units. This may be (and + usually is) a function rather than a constant. This is ignored + if WIN32, where page size is determined using getSystemInfo during + initialization. + +USE_DEV_RANDOM default: 0 (i.e., not used) + Causes malloc to use /dev/random to initialize secure magic seed for + stamping footers. Otherwise, the current time is used. + +NO_MALLINFO default: 0 + If defined, don't compile "mallinfo". This can be a simple way + of dealing with mismatches between system declarations and + those in this file. + +MALLINFO_FIELD_TYPE default: size_t + The type of the fields in the mallinfo struct. This was originally + defined as "int" in SVID etc, but is more usefully defined as + size_t. The value is used only if HAVE_USR_INCLUDE_MALLOC_H is not set + +NO_MALLOC_STATS default: 0 + If defined, don't compile "malloc_stats". This avoids calls to + fprintf and bringing in stdio dependencies you might not want. + +REALLOC_ZERO_BYTES_FREES default: not defined + This should be set if a call to realloc with zero bytes should + be the same as a call to free. Some people think it should. Otherwise, + since this malloc returns a unique pointer for malloc(0), so does + realloc(p, 0). + +LACKS_UNISTD_H, LACKS_FCNTL_H, LACKS_SYS_PARAM_H, LACKS_SYS_MMAN_H +LACKS_STRINGS_H, LACKS_STRING_H, LACKS_SYS_TYPES_H, LACKS_ERRNO_H +LACKS_STDLIB_H LACKS_SCHED_H LACKS_TIME_H default: NOT defined unless on WIN32 + Define these if your system does not have these header files. + You might need to manually insert some of the declarations they provide. + +DEFAULT_GRANULARITY default: page size if MORECORE_CONTIGUOUS, + system_info.dwAllocationGranularity in WIN32, + otherwise 64K. + Also settable using mallopt(M_GRANULARITY, x) + The unit for allocating and deallocating memory from the system. On + most systems with contiguous MORECORE, there is no reason to + make this more than a page. However, systems with MMAP tend to + either require or encourage larger granularities. You can increase + this value to prevent system allocation functions to be called so + often, especially if they are slow. The value must be at least one + page and must be a power of two. Setting to 0 causes initialization + to either page size or win32 region size. (Note: In previous + versions of malloc, the equivalent of this option was called + "TOP_PAD") + +DEFAULT_TRIM_THRESHOLD default: 2MB + Also settable using mallopt(M_TRIM_THRESHOLD, x) + The maximum amount of unused top-most memory to keep before + releasing via malloc_trim in free(). Automatic trimming is mainly + useful in long-lived programs using contiguous MORECORE. Because + trimming via sbrk can be slow on some systems, and can sometimes be + wasteful (in cases where programs immediately afterward allocate + more large chunks) the value should be high enough so that your + overall system performance would improve by releasing this much + memory. As a rough guide, you might set to a value close to the + average size of a process (program) running on your system. + Releasing this much memory would allow such a process to run in + memory. Generally, it is worth tuning trim thresholds when a + program undergoes phases where several large chunks are allocated + and released in ways that can reuse each other's storage, perhaps + mixed with phases where there are no such chunks at all. The trim + value must be greater than page size to have any useful effect. To + disable trimming completely, you can set to MAX_SIZE_T. Note that the trick + some people use of mallocing a huge space and then freeing it at + program startup, in an attempt to reserve system memory, doesn't + have the intended effect under automatic trimming, since that memory + will immediately be returned to the system. + +DEFAULT_MMAP_THRESHOLD default: 256K + Also settable using mallopt(M_MMAP_THRESHOLD, x) + The request size threshold for using MMAP to directly service a + request. Requests of at least this size that cannot be allocated + using already-existing space will be serviced via mmap. (If enough + normal freed space already exists it is used instead.) Using mmap + segregates relatively large chunks of memory so that they can be + individually obtained and released from the host system. A request + serviced through mmap is never reused by any other request (at least + not directly; the system may just so happen to remap successive + requests to the same locations). Segregating space in this way has + the benefits that: Mmapped space can always be individually released + back to the system, which helps keep the system level memory demands + of a long-lived program low. Also, mapped memory doesn't become + `locked' between other chunks, as can happen with normally allocated + chunks, which means that even trimming via malloc_trim would not + release them. However, it has the disadvantage that the space + cannot be reclaimed, consolidated, and then used to service later + requests, as happens with normal chunks. The advantages of mmap + nearly always outweigh disadvantages for "large" chunks, but the + value of "large" may vary across systems. The default is an + empirically derived value that works well in most systems. You can + disable mmap by setting to MAX_SIZE_T. + +MAX_RELEASE_CHECK_RATE default: 4095 unless not HAVE_MMAP + The number of consolidated frees between checks to release + unused segments when freeing. When using non-contiguous segments, + especially with multiple mspaces, checking only for topmost space + doesn't always suffice to trigger trimming. To compensate for this, + free() will, with a period of MAX_RELEASE_CHECK_RATE (or the + current number of segments, if greater) try to release unused + segments to the OS when freeing chunks that result in + consolidation. The best value for this parameter is a compromise + between slowing down frees with relatively costly checks that + rarely trigger versus holding on to unused memory. To effectively + disable, set to MAX_SIZE_T. This may lead to a very slight speed + improvement at the expense of carrying around more memory. +*/ + +#ifndef REGTEST +#include "dlmalloc.h" + +/* Version identifier to allow people to support multiple versions */ +#ifndef DLMALLOC_VERSION +#define DLMALLOC_VERSION 20805 +#endif /* DLMALLOC_VERSION */ + +#ifndef DLMALLOC_EXPORT +#define DLMALLOC_EXPORT extern +#endif + +#ifndef WIN32 +#ifdef _WIN32 +#define WIN32 1 +#endif /* _WIN32 */ +#ifdef _WIN32_WCE +#define LACKS_FCNTL_H +#define WIN32 1 +#endif /* _WIN32_WCE */ +#endif /* WIN32 */ +#ifdef WIN32 +#define WIN32_LEAN_AND_MEAN +#include +#include +#define HAVE_MMAP 1 +#define HAVE_MORECORE 0 +#define LACKS_UNISTD_H +#define LACKS_SYS_PARAM_H +#define LACKS_SYS_MMAN_H +#define LACKS_STRING_H +#define LACKS_STRINGS_H +#define LACKS_SYS_TYPES_H +#define LACKS_ERRNO_H +#define LACKS_SCHED_H +#ifndef MALLOC_FAILURE_ACTION +#define MALLOC_FAILURE_ACTION +#endif /* MALLOC_FAILURE_ACTION */ +#ifndef MMAP_CLEARS +#ifdef _WIN32_WCE /* WINCE reportedly does not clear */ +#define MMAP_CLEARS 0 +#else +#define MMAP_CLEARS 1 +#endif /* _WIN32_WCE */ +#endif /*MMAP_CLEARS */ +#endif /* WIN32 */ + +#if defined(DARWIN) || defined(_DARWIN) +/* Mac OSX docs advise not to use sbrk; it seems better to use mmap */ +#ifndef HAVE_MORECORE +#define HAVE_MORECORE 0 +#define HAVE_MMAP 1 +/* OSX allocators provide 16 byte alignment */ +#ifndef MALLOC_ALIGNMENT +#define MALLOC_ALIGNMENT ((size_t)16U) +#endif +#endif /* HAVE_MORECORE */ +#endif /* DARWIN */ + +#ifndef LACKS_SYS_TYPES_H +#include /* For size_t */ +#endif /* LACKS_SYS_TYPES_H */ + +/* The maximum possible size_t value has all bits set */ +#define MAX_SIZE_T (~(size_t)0) + +#ifndef USE_LOCKS /* ensure true if spin or recursive locks set */ +#define USE_LOCKS ((defined(USE_SPIN_LOCKS) && USE_SPIN_LOCKS != 0) || \ + (defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0)) +#endif /* USE_LOCKS */ + +#if USE_LOCKS /* Spin locks for gcc >= 4.1, older gcc on x86, MSC >= 1310 */ +#if ((defined(__GNUC__) && \ + ((__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 1)) || \ + defined(__i386__) || defined(__x86_64__))) || \ + (defined(_MSC_VER) && _MSC_VER>=1310)) +#ifndef USE_SPIN_LOCKS +#define USE_SPIN_LOCKS 1 +#endif /* USE_SPIN_LOCKS */ +#elif USE_SPIN_LOCKS +#error "USE_SPIN_LOCKS defined without implementation" +#endif /* ... locks available... */ +#elif !defined(USE_SPIN_LOCKS) +#define USE_SPIN_LOCKS 0 +#endif /* USE_LOCKS */ + +#ifndef ONLY_MSPACES +#define ONLY_MSPACES 0 +#endif /* ONLY_MSPACES */ +#ifndef MSPACES +#if ONLY_MSPACES +#define MSPACES 1 +#else /* ONLY_MSPACES */ +#define MSPACES 0 +#endif /* ONLY_MSPACES */ +#endif /* MSPACES */ +#ifndef MALLOC_ALIGNMENT +#define MALLOC_ALIGNMENT ((size_t)8U) +#endif /* MALLOC_ALIGNMENT */ +#ifndef FOOTERS +#define FOOTERS 0 +#endif /* FOOTERS */ +#ifndef ABORT +#define ABORT abort() +#endif /* ABORT */ +#ifndef ABORT_ON_ASSERT_FAILURE +#define ABORT_ON_ASSERT_FAILURE 1 +#endif /* ABORT_ON_ASSERT_FAILURE */ +#ifndef PROCEED_ON_ERROR +#define PROCEED_ON_ERROR 0 +#endif /* PROCEED_ON_ERROR */ + +#ifndef INSECURE +#define INSECURE 0 +#endif /* INSECURE */ +#ifndef MALLOC_INSPECT_ALL +#define MALLOC_INSPECT_ALL 0 +#endif /* MALLOC_INSPECT_ALL */ +#ifndef HAVE_MMAP +#define HAVE_MMAP 1 +#endif /* HAVE_MMAP */ +#ifndef MMAP_CLEARS +#define MMAP_CLEARS 1 +#endif /* MMAP_CLEARS */ +#ifndef HAVE_MREMAP +#ifdef linux +#define HAVE_MREMAP 1 +#define _GNU_SOURCE /* Turns on mremap() definition */ +#else /* linux */ +#define HAVE_MREMAP 0 +#endif /* linux */ +#endif /* HAVE_MREMAP */ +#ifndef MALLOC_FAILURE_ACTION +#define MALLOC_FAILURE_ACTION errno = ENOMEM; +#endif /* MALLOC_FAILURE_ACTION */ +#ifndef HAVE_MORECORE +#if ONLY_MSPACES +#define HAVE_MORECORE 0 +#else /* ONLY_MSPACES */ +#define HAVE_MORECORE 1 +#endif /* ONLY_MSPACES */ +#endif /* HAVE_MORECORE */ +#if !HAVE_MORECORE +#define MORECORE_CONTIGUOUS 0 +#else /* !HAVE_MORECORE */ +#define MORECORE_DEFAULT sbrk +#ifndef MORECORE_CONTIGUOUS +#define MORECORE_CONTIGUOUS 1 +#endif /* MORECORE_CONTIGUOUS */ +#endif /* HAVE_MORECORE */ +#ifndef DEFAULT_GRANULARITY +#if (MORECORE_CONTIGUOUS || defined(WIN32)) +#define DEFAULT_GRANULARITY (0) /* 0 means to compute in init_mparams */ +#else /* MORECORE_CONTIGUOUS */ +#define DEFAULT_GRANULARITY ((size_t)64U * (size_t)1024U) +#endif /* MORECORE_CONTIGUOUS */ +#endif /* DEFAULT_GRANULARITY */ +#ifndef DEFAULT_TRIM_THRESHOLD +#ifndef MORECORE_CANNOT_TRIM +#define DEFAULT_TRIM_THRESHOLD ((size_t)2U * (size_t)1024U * (size_t)1024U) +#else /* MORECORE_CANNOT_TRIM */ +#define DEFAULT_TRIM_THRESHOLD MAX_SIZE_T +#endif /* MORECORE_CANNOT_TRIM */ +#endif /* DEFAULT_TRIM_THRESHOLD */ +#ifndef DEFAULT_MMAP_THRESHOLD +#if HAVE_MMAP +#define DEFAULT_MMAP_THRESHOLD ((size_t)256U * (size_t)1024U) +#else /* HAVE_MMAP */ +#define DEFAULT_MMAP_THRESHOLD MAX_SIZE_T +#endif /* HAVE_MMAP */ +#endif /* DEFAULT_MMAP_THRESHOLD */ +#ifndef MAX_RELEASE_CHECK_RATE +#if HAVE_MMAP +#define MAX_RELEASE_CHECK_RATE 4095 +#else +#define MAX_RELEASE_CHECK_RATE MAX_SIZE_T +#endif /* HAVE_MMAP */ +#endif /* MAX_RELEASE_CHECK_RATE */ +#ifndef USE_BUILTIN_FFS +#define USE_BUILTIN_FFS 0 +#endif /* USE_BUILTIN_FFS */ +#ifndef USE_DEV_RANDOM +#define USE_DEV_RANDOM 0 +#endif /* USE_DEV_RANDOM */ +#ifndef NO_MALLINFO +#define NO_MALLINFO 0 +#endif /* NO_MALLINFO */ +#ifndef MALLINFO_FIELD_TYPE +#define MALLINFO_FIELD_TYPE size_t +#endif /* MALLINFO_FIELD_TYPE */ +#ifndef NO_MALLOC_STATS +#define NO_MALLOC_STATS 0 +#endif /* NO_MALLOC_STATS */ +#ifndef NO_SEGMENT_TRAVERSAL +#define NO_SEGMENT_TRAVERSAL 0 +#endif /* NO_SEGMENT_TRAVERSAL */ + +/* + mallopt tuning options. SVID/XPG defines four standard parameter + numbers for mallopt, normally defined in malloc.h. None of these + are used in this malloc, so setting them has no effect. But this + malloc does support the following options. +*/ + +#define M_TRIM_THRESHOLD (-1) +#define M_GRANULARITY (-2) +#define M_MMAP_THRESHOLD (-3) + +/* ------------------------ Mallinfo declarations ------------------------ */ + +#if !NO_MALLINFO +/* + This version of malloc supports the standard SVID/XPG mallinfo + routine that returns a struct containing usage properties and + statistics. It should work on any system that has a + /usr/include/malloc.h defining struct mallinfo. The main + declaration needed is the mallinfo struct that is returned (by-copy) + by mallinfo(). The malloinfo struct contains a bunch of fields that + are not even meaningful in this version of malloc. These fields are + are instead filled by mallinfo() with other numbers that might be of + interest. + + HAVE_USR_INCLUDE_MALLOC_H should be set if you have a + /usr/include/malloc.h file that includes a declaration of struct + mallinfo. If so, it is included; else a compliant version is + declared below. These must be precisely the same for mallinfo() to + work. The original SVID version of this struct, defined on most + systems with mallinfo, declares all fields as ints. But some others + define as unsigned long. If your system defines the fields using a + type of different width than listed here, you MUST #include your + system version and #define HAVE_USR_INCLUDE_MALLOC_H. +*/ + +/* #define HAVE_USR_INCLUDE_MALLOC_H */ + +#ifdef HAVE_USR_INCLUDE_MALLOC_H +#include "/usr/include/malloc.h" +#else /* HAVE_USR_INCLUDE_MALLOC_H */ +#ifndef STRUCT_MALLINFO_DECLARED +/* HP-UX (and others?) redefines mallinfo unless _STRUCT_MALLINFO is defined */ +#define _STRUCT_MALLINFO +#define STRUCT_MALLINFO_DECLARED 1 +struct mallinfo { + MALLINFO_FIELD_TYPE arena; /* non-mmapped space allocated from system */ + MALLINFO_FIELD_TYPE ordblks; /* number of free chunks */ + MALLINFO_FIELD_TYPE smblks; /* always 0 */ + MALLINFO_FIELD_TYPE hblks; /* always 0 */ + MALLINFO_FIELD_TYPE hblkhd; /* space in mmapped regions */ + MALLINFO_FIELD_TYPE usmblks; /* maximum total allocated space */ + MALLINFO_FIELD_TYPE fsmblks; /* always 0 */ + MALLINFO_FIELD_TYPE uordblks; /* total allocated space */ + MALLINFO_FIELD_TYPE fordblks; /* total free space */ + MALLINFO_FIELD_TYPE keepcost; /* releasable (via malloc_trim) space */ +}; +#endif /* STRUCT_MALLINFO_DECLARED */ +#endif /* HAVE_USR_INCLUDE_MALLOC_H */ +#endif /* NO_MALLINFO */ + +/* + Try to persuade compilers to inline. The most critical functions for + inlining are defined as macros, so these aren't used for them. +*/ + +#ifndef FORCEINLINE + #if defined(__GNUC__) +#define FORCEINLINE __inline __attribute__ ((always_inline)) + #elif defined(_MSC_VER) + #define FORCEINLINE __forceinline + #endif +#endif +#ifndef NOINLINE + #if defined(__GNUC__) + #define NOINLINE __attribute__ ((noinline)) + #elif defined(_MSC_VER) + #define NOINLINE __declspec(noinline) + #else + #define NOINLINE + #endif +#endif + +#ifdef __cplusplus +extern "C" { +#ifndef FORCEINLINE + #define FORCEINLINE inline +#endif +#endif /* __cplusplus */ +#ifndef FORCEINLINE + #define FORCEINLINE +#endif + +#if !ONLY_MSPACES + +/* ------------------- Declarations of public routines ------------------- */ + +#ifndef USE_DL_PREFIX +#define dlcalloc calloc +#define dlfree free +#define dlmalloc malloc +#define dlmemalign aligned_alloc +#define dlposix_memalign posix_memalign +#define dlrealloc realloc +#define dlrealloc_in_place realloc_in_place +#define dlvalloc valloc +#define dlpvalloc pvalloc +#define dlmallinfo mallinfo +#define dlmallopt mallopt +#define dlmalloc_trim malloc_trim +#define dlmalloc_stats malloc_stats +#define dlmalloc_usable_size malloc_usable_size +#define dlmalloc_footprint malloc_footprint +#define dlmalloc_max_footprint malloc_max_footprint +#define dlmalloc_footprint_limit malloc_footprint_limit +#define dlmalloc_set_footprint_limit malloc_set_footprint_limit +#define dlmalloc_inspect_all malloc_inspect_all +#define dlindependent_calloc independent_calloc +#define dlindependent_comalloc independent_comalloc +#define dlbulk_free bulk_free +#endif /* USE_DL_PREFIX */ + +#if 0 // Redeclaration warnings as PDCLib already declares these in + +/* + malloc(size_t n) + Returns a pointer to a newly allocated chunk of at least n bytes, or + null if no space is available, in which case errno is set to ENOMEM + on ANSI C systems. + + If n is zero, malloc returns a minimum-sized chunk. (The minimum + size is 16 bytes on most 32bit systems, and 32 bytes on 64bit + systems.) Note that size_t is an unsigned type, so calls with + arguments that would be negative if signed are interpreted as + requests for huge amounts of space, which will often fail. The + maximum supported value of n differs across systems, but is in all + cases less than the maximum representable value of a size_t. +*/ +DLMALLOC_EXPORT void* dlmalloc(size_t); + +/* + free(void* p) + Releases the chunk of memory pointed to by p, that had been previously + allocated using malloc or a related routine such as realloc. + It has no effect if p is null. If p was not malloced or already + freed, free(p) will by default cause the current program to abort. +*/ +DLMALLOC_EXPORT void dlfree(void*); + +/* + calloc(size_t n_elements, size_t element_size); + Returns a pointer to n_elements * element_size bytes, with all locations + set to zero. +*/ +DLMALLOC_EXPORT void* dlcalloc(size_t, size_t); + +/* + realloc(void* p, size_t n) + Returns a pointer to a chunk of size n that contains the same data + as does chunk p up to the minimum of (n, p's size) bytes, or null + if no space is available. + + The returned pointer may or may not be the same as p. The algorithm + prefers extending p in most cases when possible, otherwise it + employs the equivalent of a malloc-copy-free sequence. + + If p is null, realloc is equivalent to malloc. + + If space is not available, realloc returns null, errno is set (if on + ANSI) and p is NOT freed. + + if n is for fewer bytes than already held by p, the newly unused + space is lopped off and freed if possible. realloc with a size + argument of zero (re)allocates a minimum-sized chunk. + + The old unix realloc convention of allowing the last-free'd chunk + to be used as an argument to realloc is not supported. +*/ +DLMALLOC_EXPORT void* dlrealloc(void*, size_t); + +#endif + +/* + realloc_in_place(void* p, size_t n) + Resizes the space allocated for p to size n, only if this can be + done without moving p (i.e., only if there is adjacent space + available if n is greater than p's current allocated size, or n is + less than or equal to p's size). This may be used instead of plain + realloc if an alternative allocation strategy is needed upon failure + to expand space; for example, reallocation of a buffer that must be + memory-aligned or cleared. You can use realloc_in_place to trigger + these alternatives only when needed. + + Returns p if successful; otherwise null. +*/ +DLMALLOC_EXPORT void* dlrealloc_in_place(void*, size_t); + +#if 0 // Redeclaration warnings as PDCLib already declares these in + +/* + memalign(size_t alignment, size_t n); + Returns a pointer to a newly allocated chunk of n bytes, aligned + in accord with the alignment argument. + + The alignment argument should be a power of two. If the argument is + not a power of two, the nearest greater power is used. + 8-byte alignment is guaranteed by normal malloc calls, so don't + bother calling memalign with an argument of 8 or less. + + Overreliance on memalign is a sure way to fragment space. +*/ +DLMALLOC_EXPORT void* dlmemalign(size_t, size_t); + +#endif + +/* + int posix_memalign(void** pp, size_t alignment, size_t n); + Allocates a chunk of n bytes, aligned in accord with the alignment + argument. Differs from memalign only in that it (1) assigns the + allocated memory to *pp rather than returning it, (2) fails and + returns EINVAL if the alignment is not a power of two (3) fails and + returns ENOMEM if memory cannot be allocated. +*/ +DLMALLOC_EXPORT int dlposix_memalign(void**, size_t, size_t); + +/* + valloc(size_t n); + Equivalent to memalign(pagesize, n), where pagesize is the page + size of the system. If the pagesize is unknown, 4096 is used. +*/ +DLMALLOC_EXPORT void* dlvalloc(size_t); + +/* + mallopt(int parameter_number, int parameter_value) + Sets tunable parameters The format is to provide a + (parameter-number, parameter-value) pair. mallopt then sets the + corresponding parameter to the argument value if it can (i.e., so + long as the value is meaningful), and returns 1 if successful else + 0. To workaround the fact that mallopt is specified to use int, + not size_t parameters, the value -1 is specially treated as the + maximum unsigned size_t value. + + SVID/XPG/ANSI defines four standard param numbers for mallopt, + normally defined in malloc.h. None of these are use in this malloc, + so setting them has no effect. But this malloc also supports other + options in mallopt. See below for details. Briefly, supported + parameters are as follows (listed defaults are for "typical" + configurations). + + Symbol param # default allowed param values + M_TRIM_THRESHOLD -1 2*1024*1024 any (-1 disables) + M_GRANULARITY -2 page size any power of 2 >= page size + M_MMAP_THRESHOLD -3 256*1024 any (or 0 if no MMAP support) +*/ +DLMALLOC_EXPORT int dlmallopt(int, int); + +/* + malloc_footprint(); + Returns the number of bytes obtained from the system. The total + number of bytes allocated by malloc, realloc etc., is less than this + value. Unlike mallinfo, this function returns only a precomputed + result, so can be called frequently to monitor memory consumption. + Even if locks are otherwise defined, this function does not use them, + so results might not be up to date. +*/ +DLMALLOC_EXPORT size_t dlmalloc_footprint(void); + +/* + malloc_max_footprint(); + Returns the maximum number of bytes obtained from the system. This + value will be greater than current footprint if deallocated space + has been reclaimed by the system. The peak number of bytes allocated + by malloc, realloc etc., is less than this value. Unlike mallinfo, + this function returns only a precomputed result, so can be called + frequently to monitor memory consumption. Even if locks are + otherwise defined, this function does not use them, so results might + not be up to date. +*/ +DLMALLOC_EXPORT size_t dlmalloc_max_footprint(void); + +/* + malloc_footprint_limit(); + Returns the number of bytes that the heap is allowed to obtain from + the system, returning the last value returned by + malloc_set_footprint_limit, or the maximum size_t value if + never set. The returned value reflects a permission. There is no + guarantee that this number of bytes can actually be obtained from + the system. +*/ +DLMALLOC_EXPORT size_t dlmalloc_footprint_limit(void); + +/* + malloc_set_footprint_limit(); + Sets the maximum number of bytes to obtain from the system, causing + failure returns from malloc and related functions upon attempts to + exceed this value. The argument value may be subject to page + rounding to an enforceable limit; this actual value is returned. + Using an argument of the maximum possible size_t effectively + disables checks. If the argument is less than or equal to the + current malloc_footprint, then all future allocations that require + additional system memory will fail. However, invocation cannot + retroactively deallocate existing used memory. +*/ +DLMALLOC_EXPORT size_t dlmalloc_set_footprint_limit(size_t bytes); + +#if MALLOC_INSPECT_ALL +/* + malloc_inspect_all(void(*handler)(void *start, + void *end, + size_t used_bytes, + void* callback_arg), + void* arg); + Traverses the heap and calls the given handler for each managed + region, skipping all bytes that are (or may be) used for bookkeeping + purposes. Traversal does not include include chunks that have been + directly memory mapped. Each reported region begins at the start + address, and continues up to but not including the end address. The + first used_bytes of the region contain allocated data. If + used_bytes is zero, the region is unallocated. The handler is + invoked with the given callback argument. If locks are defined, they + are held during the entire traversal. It is a bad idea to invoke + other malloc functions from within the handler. + + For example, to count the number of in-use chunks with size greater + than 1000, you could write: + static int count = 0; + void count_chunks(void* start, void* end, size_t used, void* arg) { + if (used >= 1000) ++count; + } + then: + malloc_inspect_all(count_chunks, NULL); + + malloc_inspect_all is compiled only if MALLOC_INSPECT_ALL is defined. +*/ +DLMALLOC_EXPORT void dlmalloc_inspect_all(void(*handler)(void*, void *, size_t, void*), + void* arg); + +#endif /* MALLOC_INSPECT_ALL */ + +#if !NO_MALLINFO +/* + mallinfo() + Returns (by copy) a struct containing various summary statistics: + + arena: current total non-mmapped bytes allocated from system + ordblks: the number of free chunks + smblks: always zero. + hblks: current number of mmapped regions + hblkhd: total bytes held in mmapped regions + usmblks: the maximum total allocated space. This will be greater + than current total if trimming has occurred. + fsmblks: always zero + uordblks: current total allocated space (normal or mmapped) + fordblks: total free space + keepcost: the maximum number of bytes that could ideally be released + back to system via malloc_trim. ("ideally" means that + it ignores page restrictions etc.) + + Because these fields are ints, but internal bookkeeping may + be kept as longs, the reported values may wrap around zero and + thus be inaccurate. +*/ +DLMALLOC_EXPORT struct mallinfo dlmallinfo(void); +#endif /* NO_MALLINFO */ + +/* + independent_calloc(size_t n_elements, size_t element_size, void* chunks[]); + + independent_calloc is similar to calloc, but instead of returning a + single cleared space, it returns an array of pointers to n_elements + independent elements that can hold contents of size elem_size, each + of which starts out cleared, and can be independently freed, + realloc'ed etc. The elements are guaranteed to be adjacently + allocated (this is not guaranteed to occur with multiple callocs or + mallocs), which may also improve cache locality in some + applications. + + The "chunks" argument is optional (i.e., may be null, which is + probably the most typical usage). If it is null, the returned array + is itself dynamically allocated and should also be freed when it is + no longer needed. Otherwise, the chunks array must be of at least + n_elements in length. It is filled in with the pointers to the + chunks. + + In either case, independent_calloc returns this pointer array, or + null if the allocation failed. If n_elements is zero and "chunks" + is null, it returns a chunk representing an array with zero elements + (which should be freed if not wanted). + + Each element must be freed when it is no longer needed. This can be + done all at once using bulk_free. + + independent_calloc simplifies and speeds up implementations of many + kinds of pools. It may also be useful when constructing large data + structures that initially have a fixed number of fixed-sized nodes, + but the number is not known at compile time, and some of the nodes + may later need to be freed. For example: + + struct Node { int item; struct Node* next; }; + + struct Node* build_list() { + struct Node** pool; + int n = read_number_of_nodes_needed(); + if (n <= 0) return 0; + pool = (struct Node**)(independent_calloc(n, sizeof(struct Node), 0); + if (pool == 0) die(); + // organize into a linked list... + struct Node* first = pool[0]; + for (i = 0; i < n-1; ++i) + pool[i]->next = pool[i+1]; + free(pool); // Can now free the array (or not, if it is needed later) + return first; + } +*/ +DLMALLOC_EXPORT void** dlindependent_calloc(size_t, size_t, void**); + +/* + independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); + + independent_comalloc allocates, all at once, a set of n_elements + chunks with sizes indicated in the "sizes" array. It returns + an array of pointers to these elements, each of which can be + independently freed, realloc'ed etc. The elements are guaranteed to + be adjacently allocated (this is not guaranteed to occur with + multiple callocs or mallocs), which may also improve cache locality + in some applications. + + The "chunks" argument is optional (i.e., may be null). If it is null + the returned array is itself dynamically allocated and should also + be freed when it is no longer needed. Otherwise, the chunks array + must be of at least n_elements in length. It is filled in with the + pointers to the chunks. + + In either case, independent_comalloc returns this pointer array, or + null if the allocation failed. If n_elements is zero and chunks is + null, it returns a chunk representing an array with zero elements + (which should be freed if not wanted). + + Each element must be freed when it is no longer needed. This can be + done all at once using bulk_free. + + independent_comallac differs from independent_calloc in that each + element may have a different size, and also that it does not + automatically clear elements. + + independent_comalloc can be used to speed up allocation in cases + where several structs or objects must always be allocated at the + same time. For example: + + struct Head { ... } + struct Foot { ... } + + void send_message(char* msg) { + int msglen = strlen(msg); + size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) }; + void* chunks[3]; + if (independent_comalloc(3, sizes, chunks) == 0) + die(); + struct Head* head = (struct Head*)(chunks[0]); + char* body = (char*)(chunks[1]); + struct Foot* foot = (struct Foot*)(chunks[2]); + // ... + } + + In general though, independent_comalloc is worth using only for + larger values of n_elements. For small values, you probably won't + detect enough difference from series of malloc calls to bother. + + Overuse of independent_comalloc can increase overall memory usage, + since it cannot reuse existing noncontiguous small chunks that + might be available for some of the elements. +*/ +DLMALLOC_EXPORT void** dlindependent_comalloc(size_t, size_t*, void**); + +/* + bulk_free(void* array[], size_t n_elements) + Frees and clears (sets to null) each non-null pointer in the given + array. This is likely to be faster than freeing them one-by-one. + If footers are used, pointers that have been allocated in different + mspaces are not freed or cleared, and the count of all such pointers + is returned. For large arrays of pointers with poor locality, it + may be worthwhile to sort this array before calling bulk_free. +*/ +DLMALLOC_EXPORT size_t dlbulk_free(void**, size_t n_elements); + +/* + pvalloc(size_t n); + Equivalent to valloc(minimum-page-that-holds(n)), that is, + round up n to nearest pagesize. + */ +DLMALLOC_EXPORT void* dlpvalloc(size_t); + +/* + malloc_trim(size_t pad); + + If possible, gives memory back to the system (via negative arguments + to sbrk) if there is unused memory at the `high' end of the malloc + pool or in unused MMAP segments. You can call this after freeing + large blocks of memory to potentially reduce the system-level memory + requirements of a program. However, it cannot guarantee to reduce + memory. Under some allocation patterns, some large free blocks of + memory will be locked between two used chunks, so they cannot be + given back to the system. + + The `pad' argument to malloc_trim represents the amount of free + trailing space to leave untrimmed. If this argument is zero, only + the minimum amount of memory to maintain internal data structures + will be left. Non-zero arguments can be supplied to maintain enough + trailing space to service future expected allocations without having + to re-obtain memory from the system. + + Malloc_trim returns 1 if it actually released any memory, else 0. +*/ +DLMALLOC_EXPORT int dlmalloc_trim(size_t); + +/* + malloc_stats(); + Prints on stderr the amount of space obtained from the system (both + via sbrk and mmap), the maximum amount (which may be more than + current if malloc_trim and/or munmap got called), and the current + number of bytes allocated via malloc (or realloc, etc) but not yet + freed. Note that this is the number of bytes allocated, not the + number requested. It will be larger than the number requested + because of alignment and bookkeeping overhead. Because it includes + alignment wastage as being in use, this figure may be greater than + zero even when no user-level chunks are allocated. + + The reported current and maximum system memory can be inaccurate if + a program makes other calls to system memory allocation functions + (normally sbrk) outside of malloc. + + malloc_stats prints only the most commonly interesting statistics. + More information can be obtained by calling mallinfo. +*/ +DLMALLOC_EXPORT void dlmalloc_stats(void); + +#endif /* ONLY_MSPACES */ + +/* + malloc_usable_size(void* p); + + Returns the number of bytes you can actually use in + an allocated chunk, which may be more than you requested (although + often not) due to alignment and minimum size constraints. + You can use this many bytes without worrying about + overwriting other allocated objects. This is not a particularly great + programming practice. malloc_usable_size can be more useful in + debugging and assertions, for example: + + p = malloc(n); + assert(malloc_usable_size(p) >= 256); +*/ +size_t dlmalloc_usable_size(void*); + +#if MSPACES + +/* + mspace is an opaque type representing an independent + region of space that supports mspace_malloc, etc. +*/ +typedef void* mspace; + +/* + create_mspace creates and returns a new independent space with the + given initial capacity, or, if 0, the default granularity size. It + returns null if there is no system memory available to create the + space. If argument locked is non-zero, the space uses a separate + lock to control access. The capacity of the space will grow + dynamically as needed to service mspace_malloc requests. You can + control the sizes of incremental increases of this space by + compiling with a different DEFAULT_GRANULARITY or dynamically + setting with mallopt(M_GRANULARITY, value). +*/ +DLMALLOC_EXPORT mspace create_mspace(size_t capacity, int locked); + +/* + destroy_mspace destroys the given space, and attempts to return all + of its memory back to the system, returning the total number of + bytes freed. After destruction, the results of access to all memory + used by the space become undefined. +*/ +DLMALLOC_EXPORT size_t destroy_mspace(mspace msp); + +/* + create_mspace_with_base uses the memory supplied as the initial base + of a new mspace. Part (less than 128*sizeof(size_t) bytes) of this + space is used for bookkeeping, so the capacity must be at least this + large. (Otherwise 0 is returned.) When this initial space is + exhausted, additional memory will be obtained from the system. + Destroying this space will deallocate all additionally allocated + space (if possible) but not the initial base. +*/ +DLMALLOC_EXPORT mspace create_mspace_with_base(void* base, size_t capacity, int locked); + +/* + mspace_track_large_chunks controls whether requests for large chunks + are allocated in their own untracked mmapped regions, separate from + others in this mspace. By default large chunks are not tracked, + which reduces fragmentation. However, such chunks are not + necessarily released to the system upon destroy_mspace. Enabling + tracking by setting to true may increase fragmentation, but avoids + leakage when relying on destroy_mspace to release all memory + allocated using this space. The function returns the previous + setting. +*/ +DLMALLOC_EXPORT int mspace_track_large_chunks(mspace msp, int enable); + + +/* + mspace_malloc behaves as malloc, but operates within + the given space. +*/ +DLMALLOC_EXPORT void* mspace_malloc(mspace msp, size_t bytes); + +/* + mspace_free behaves as free, but operates within + the given space. + + If compiled with FOOTERS==1, mspace_free is not actually needed. + free may be called instead of mspace_free because freed chunks from + any space are handled by their originating spaces. +*/ +DLMALLOC_EXPORT void mspace_free(mspace msp, void* mem); + +/* + mspace_realloc behaves as realloc, but operates within + the given space. + + If compiled with FOOTERS==1, mspace_realloc is not actually + needed. realloc may be called instead of mspace_realloc because + realloced chunks from any space are handled by their originating + spaces. +*/ +DLMALLOC_EXPORT void* mspace_realloc(mspace msp, void* mem, size_t newsize); + +/* + mspace_calloc behaves as calloc, but operates within + the given space. +*/ +DLMALLOC_EXPORT void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size); + +/* + mspace_memalign behaves as memalign, but operates within + the given space. +*/ +DLMALLOC_EXPORT void* mspace_memalign(mspace msp, size_t alignment, size_t bytes); + +/* + mspace_independent_calloc behaves as independent_calloc, but + operates within the given space. +*/ +DLMALLOC_EXPORT void** mspace_independent_calloc(mspace msp, size_t n_elements, + size_t elem_size, void* chunks[]); + +/* + mspace_independent_comalloc behaves as independent_comalloc, but + operates within the given space. +*/ +DLMALLOC_EXPORT void** mspace_independent_comalloc(mspace msp, size_t n_elements, + size_t sizes[], void* chunks[]); + +/* + mspace_footprint() returns the number of bytes obtained from the + system for this space. +*/ +DLMALLOC_EXPORT size_t mspace_footprint(mspace msp); + +/* + mspace_max_footprint() returns the peak number of bytes obtained from the + system for this space. +*/ +DLMALLOC_EXPORT size_t mspace_max_footprint(mspace msp); + + +#if !NO_MALLINFO +/* + mspace_mallinfo behaves as mallinfo, but reports properties of + the given space. +*/ +DLMALLOC_EXPORT struct mallinfo mspace_mallinfo(mspace msp); +#endif /* NO_MALLINFO */ + +/* + malloc_usable_size(void* p) behaves the same as malloc_usable_size; +*/ +DLMALLOC_EXPORT size_t mspace_usable_size(void* mem); + +/* + mspace_malloc_stats behaves as malloc_stats, but reports + properties of the given space. +*/ +DLMALLOC_EXPORT void mspace_malloc_stats(mspace msp); + +/* + mspace_trim behaves as malloc_trim, but + operates within the given space. +*/ +DLMALLOC_EXPORT int mspace_trim(mspace msp, size_t pad); + +/* + An alias for mallopt. +*/ +DLMALLOC_EXPORT int mspace_mallopt(int, int); + +#endif /* MSPACES */ + +#ifdef __cplusplus +} /* end of extern "C" */ +#endif /* __cplusplus */ + +/* + ======================================================================== + To make a fully customizable malloc.h header file, cut everything + above this line, put into file malloc.h, edit to suit, and #include it + on the next line, as well as in programs that use this malloc. + ======================================================================== +*/ + +/* #include "malloc.h" */ + +/*------------------------------ internal #includes ---------------------- */ + +#ifdef _MSC_VER +#pragma warning( disable : 4146 ) /* no "unsigned" warnings */ +#endif /* _MSC_VER */ +#if !NO_MALLOC_STATS +#include /* for printing in malloc_stats */ +#endif /* NO_MALLOC_STATS */ +#ifndef LACKS_ERRNO_H +#include /* for MALLOC_FAILURE_ACTION */ +#endif /* LACKS_ERRNO_H */ +#ifdef DEBUG +#if ABORT_ON_ASSERT_FAILURE +#undef assert +#define assert(x) if(!(x)) ABORT +#else /* ABORT_ON_ASSERT_FAILURE */ +#include +#endif /* ABORT_ON_ASSERT_FAILURE */ +#else /* DEBUG */ +#ifndef assert +#define assert(x) +#endif +#define DEBUG 0 +#endif /* DEBUG */ +#if !defined(WIN32) && !defined(LACKS_TIME_H) +#include /* for magic initialization */ +#endif /* WIN32 */ +#ifndef LACKS_STDLIB_H +#include /* for abort() */ +#endif /* LACKS_STDLIB_H */ +#ifndef LACKS_STRING_H +#include /* for memset etc */ +#endif /* LACKS_STRING_H */ +#if USE_BUILTIN_FFS +#ifndef LACKS_STRINGS_H +#include /* for ffs */ +#endif /* LACKS_STRINGS_H */ +#endif /* USE_BUILTIN_FFS */ +#if HAVE_MMAP +#ifndef LACKS_SYS_MMAN_H +/* On some versions of linux, mremap decl in mman.h needs __USE_GNU set */ +#if (defined(linux) && !defined(__USE_GNU)) +#define __USE_GNU 1 +#include /* for mmap */ +#undef __USE_GNU +#else +#include /* for mmap */ +#endif /* linux */ +#endif /* LACKS_SYS_MMAN_H */ +#ifndef LACKS_FCNTL_H +#include +#endif /* LACKS_FCNTL_H */ +#endif /* HAVE_MMAP */ +#ifndef LACKS_UNISTD_H +#include /* for sbrk, sysconf */ +#else /* LACKS_UNISTD_H */ +#if !defined(__FreeBSD__) && !defined(__OpenBSD__) && !defined(__NetBSD__) +/*extern void* sbrk(ptrdiff_t);*/ +#endif /* FreeBSD etc */ +#endif /* LACKS_UNISTD_H */ + +/* Declarations for locking */ +#if USE_LOCKS +#ifndef WIN32 +#if defined (__SVR4) && defined (__sun) /* solaris */ +#include +#elif !defined(LACKS_SCHED_H) +#include +#endif /* solaris or LACKS_SCHED_H */ +#if (defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0) || !USE_SPIN_LOCKS +/*#include */ +#endif /* USE_RECURSIVE_LOCKS ... */ +#elif defined(_MSC_VER) +#ifndef _M_AMD64 +/* These are already defined on AMD64 builds */ +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ +LONG __cdecl _InterlockedCompareExchange(LONG volatile *Dest, LONG Exchange, LONG Comp); +LONG __cdecl _InterlockedExchange(LONG volatile *Target, LONG Value); +#ifdef __cplusplus +} +#endif /* __cplusplus */ +#endif /* _M_AMD64 */ +#pragma intrinsic (_InterlockedCompareExchange) +#pragma intrinsic (_InterlockedExchange) +#define interlockedcompareexchange _InterlockedCompareExchange +#define interlockedexchange _InterlockedExchange +#elif defined(WIN32) && defined(__GNUC__) +#define interlockedcompareexchange(a, b, c) __sync_val_compare_and_swap(a, c, b) +#define interlockedexchange __sync_lock_test_and_set +#endif /* Win32 */ +#endif /* USE_LOCKS */ + +/* Declarations for bit scanning on win32 */ +#if defined(_MSC_VER) && _MSC_VER>=1300 +#ifndef BitScanForward /* Try to avoid pulling in WinNT.h */ +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ +unsigned char _BitScanForward(unsigned long *index, unsigned long mask); +unsigned char _BitScanReverse(unsigned long *index, unsigned long mask); +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#define BitScanForward _BitScanForward +#define BitScanReverse _BitScanReverse +#pragma intrinsic(_BitScanForward) +#pragma intrinsic(_BitScanReverse) +#endif /* BitScanForward */ +#endif /* defined(_MSC_VER) && _MSC_VER>=1300 */ + +#ifndef WIN32 +#ifndef malloc_getpagesize +# ifdef _SC_PAGESIZE /* some SVR4 systems omit an underscore */ +# ifndef _SC_PAGE_SIZE +# define _SC_PAGE_SIZE _SC_PAGESIZE +# endif +# endif +# ifdef _SC_PAGE_SIZE +# define malloc_getpagesize sysconf(_SC_PAGE_SIZE) +# else +# if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE) + extern size_t getpagesize(); +# define malloc_getpagesize getpagesize() +# else +# ifdef WIN32 /* use supplied emulation of getpagesize */ +# define malloc_getpagesize getpagesize() +# else +# ifndef LACKS_SYS_PARAM_H +# include +# endif +# ifdef EXEC_PAGESIZE +# define malloc_getpagesize EXEC_PAGESIZE +# else +# ifdef NBPG +# ifndef CLSIZE +# define malloc_getpagesize NBPG +# else +# define malloc_getpagesize (NBPG * CLSIZE) +# endif +# else +# ifdef NBPC +# define malloc_getpagesize NBPC +# else +# ifdef PAGESIZE +# define malloc_getpagesize PAGESIZE +# else /* just guess */ +# define malloc_getpagesize ((size_t)4096U) +# endif +# endif +# endif +# endif +# endif +# endif +# endif +#endif +#endif + +/* ------------------- size_t and alignment properties -------------------- */ + +/* The byte and bit size of a size_t */ +#define SIZE_T_SIZE (sizeof(size_t)) +#define SIZE_T_BITSIZE (sizeof(size_t) << 3) + +/* Some constants coerced to size_t */ +/* Annoying but necessary to avoid errors on some platforms */ +#define SIZE_T_ZERO ((size_t)0) +#define SIZE_T_ONE ((size_t)1) +#define SIZE_T_TWO ((size_t)2) +#define SIZE_T_FOUR ((size_t)4) +#define TWO_SIZE_T_SIZES (SIZE_T_SIZE<<1) +#define FOUR_SIZE_T_SIZES (SIZE_T_SIZE<<2) +#define SIX_SIZE_T_SIZES (FOUR_SIZE_T_SIZES+TWO_SIZE_T_SIZES) +#define HALF_MAX_SIZE_T (MAX_SIZE_T / 2U) + +/* The bit mask value corresponding to MALLOC_ALIGNMENT */ +#define CHUNK_ALIGN_MASK (MALLOC_ALIGNMENT - SIZE_T_ONE) + +/* True if address a has acceptable alignment */ +#define is_aligned(A) (((size_t)((A)) & (CHUNK_ALIGN_MASK)) == 0) + +/* the number of bytes to offset an address to align it */ +#define align_offset(A)\ + ((((size_t)(A) & CHUNK_ALIGN_MASK) == 0)? 0 :\ + ((MALLOC_ALIGNMENT - ((size_t)(A) & CHUNK_ALIGN_MASK)) & CHUNK_ALIGN_MASK)) + +/* -------------------------- MMAP preliminaries ------------------------- */ + +/* + If HAVE_MORECORE or HAVE_MMAP are false, we just define calls and + checks to fail so compiler optimizer can delete code rather than + using so many "#if"s. +*/ + + +/* MORECORE and MMAP must return MFAIL on failure */ +#define MFAIL ((void*)(MAX_SIZE_T)) +#define CMFAIL ((char*)(MFAIL)) /* defined for convenience */ + +#if HAVE_MMAP + +#ifdef MMAP_DEFAULT +#elif !defined(WIN32) +#define MUNMAP_DEFAULT(a, s) munmap((a), (s)) +#define MMAP_PROT (PROT_READ|PROT_WRITE) +#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON) +#define MAP_ANONYMOUS MAP_ANON +#endif /* MAP_ANON */ +#ifdef MAP_ANONYMOUS +#define MMAP_FLAGS (MAP_PRIVATE|MAP_ANONYMOUS) +#define MMAP_DEFAULT(s) mmap(0, (s), MMAP_PROT, MMAP_FLAGS, -1, 0) +#else /* MAP_ANONYMOUS */ +/* + Nearly all versions of mmap support MAP_ANONYMOUS, so the following + is unlikely to be needed, but is supplied just in case. +*/ +#define MMAP_FLAGS (MAP_PRIVATE) +#define MMAP_DEFAULT(s) ((dev_zero_fd < 0) ? \ + (dev_zero_fd = open("/dev/zero", O_RDWR), \ + mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) : \ + mmap(0, (s), MMAP_PROT, MMAP_FLAGS, dev_zero_fd, 0)) +#endif /* MAP_ANONYMOUS */ + +#define DIRECT_MMAP_DEFAULT(s) MMAP_DEFAULT(s) + +#else /* WIN32 */ + +/* Win32 MMAP via VirtualAlloc */ +static FORCEINLINE void* win32mmap(size_t size) { + void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT, PAGE_READWRITE); + return (ptr != 0)? ptr: MFAIL; +} + +/* For direct MMAP, use MEM_TOP_DOWN to minimize interference */ +static FORCEINLINE void* win32direct_mmap(size_t size) { + void* ptr = VirtualAlloc(0, size, MEM_RESERVE|MEM_COMMIT|MEM_TOP_DOWN, + PAGE_READWRITE); + return (ptr != 0)? ptr: MFAIL; +} + +/* This function supports releasing coalesed segments */ +static FORCEINLINE int win32munmap(void* ptr, size_t size) { + MEMORY_BASIC_INFORMATION minfo; + char* cptr = (char*)ptr; + while (size) { + if (VirtualQuery(cptr, &minfo, sizeof(minfo)) == 0) + return -1; + if (minfo.BaseAddress != cptr || minfo.AllocationBase != cptr || + minfo.State != MEM_COMMIT || minfo.RegionSize > size) + return -1; + if (VirtualFree(cptr, 0, MEM_RELEASE) == 0) + return -1; + cptr += minfo.RegionSize; + size -= minfo.RegionSize; + } + return 0; +} + +#define MMAP_DEFAULT(s) win32mmap(s) +#define MUNMAP_DEFAULT(a, s) win32munmap((a), (s)) +#define DIRECT_MMAP_DEFAULT(s) win32direct_mmap(s) +#endif /* WIN32 */ +#endif /* HAVE_MMAP */ + +#if HAVE_MREMAP && !defined(MREMAP_DEFAULT) +#ifndef WIN32 +#define MREMAP_DEFAULT(addr, osz, nsz, mv) mremap((addr), (osz), (nsz), (mv)) +#endif /* WIN32 */ +#endif /* HAVE_MREMAP */ + +/** + * Define CALL_MORECORE + */ +#if HAVE_MORECORE + #ifdef MORECORE + #define CALL_MORECORE(S) MORECORE(S) + #else /* MORECORE */ + #define CALL_MORECORE(S) MORECORE_DEFAULT(S) + #endif /* MORECORE */ +#else /* HAVE_MORECORE */ + #define CALL_MORECORE(S) MFAIL +#endif /* HAVE_MORECORE */ + +/** + * Define CALL_MMAP/CALL_MUNMAP/CALL_DIRECT_MMAP + */ +#if HAVE_MMAP + #define USE_MMAP_BIT (SIZE_T_ONE) + + #ifdef MMAP + #define CALL_MMAP(s) MMAP(s) + #else /* MMAP */ + #define CALL_MMAP(s) MMAP_DEFAULT(s) + #endif /* MMAP */ + #ifdef MUNMAP + #define CALL_MUNMAP(a, s) MUNMAP((a), (s)) + #else /* MUNMAP */ + #define CALL_MUNMAP(a, s) MUNMAP_DEFAULT((a), (s)) + #endif /* MUNMAP */ + #ifdef DIRECT_MMAP + #define CALL_DIRECT_MMAP(s) DIRECT_MMAP(s) + #else /* DIRECT_MMAP */ + #define CALL_DIRECT_MMAP(s) DIRECT_MMAP_DEFAULT(s) + #endif /* DIRECT_MMAP */ +#else /* HAVE_MMAP */ + #define USE_MMAP_BIT (SIZE_T_ZERO) + + #define MMAP(s) MFAIL + #define MUNMAP(a, s) (-1) + #define DIRECT_MMAP(s) MFAIL + #define CALL_DIRECT_MMAP(s) DIRECT_MMAP(s) + #define CALL_MMAP(s) MMAP(s) + #define CALL_MUNMAP(a, s) MUNMAP((a), (s)) +#endif /* HAVE_MMAP */ + +/** + * Define CALL_MREMAP + */ +#if HAVE_MMAP && HAVE_MREMAP + #ifdef MREMAP + #define CALL_MREMAP(addr, osz, nsz, mv) MREMAP((addr), (osz), (nsz), (mv)) + #else /* MREMAP */ + #define CALL_MREMAP(addr, osz, nsz, mv) MREMAP_DEFAULT((addr), (osz), (nsz), (mv)) + #endif /* MREMAP */ +#else /* HAVE_MMAP && HAVE_MREMAP */ + #define CALL_MREMAP(addr, osz, nsz, mv) MFAIL +#endif /* HAVE_MMAP && HAVE_MREMAP */ + +/* mstate bit set if continguous morecore disabled or failed */ +#define USE_NONCONTIGUOUS_BIT (4U) + +/* segment bit set in create_mspace_with_base */ +#define EXTERN_BIT (8U) + + +/* --------------------------- Lock preliminaries ------------------------ */ + +/* + When locks are defined, there is one global lock, plus + one per-mspace lock. + + The global lock_ensures that mparams.magic and other unique + mparams values are initialized only once. It also protects + sequences of calls to MORECORE. In many cases sys_alloc requires + two calls, that should not be interleaved with calls by other + threads. This does not protect against direct calls to MORECORE + by other threads not using this lock, so there is still code to + cope the best we can on interference. + + Per-mspace locks surround calls to malloc, free, etc. + By default, locks are simple non-reentrant mutexes. + + Because lock-protected regions generally have bounded times, it is + OK to use the supplied simple spinlocks. Spinlocks are likely to + improve performance for lightly contended applications, but worsen + performance under heavy contention. + + If USE_LOCKS is > 1, the definitions of lock routines here are + bypassed, in which case you will need to define the type MLOCK_T, + and at least INITIAL_LOCK, DESTROY_LOCK, ACQUIRE_LOCK, RELEASE_LOCK + and TRY_LOCK. You must also declare a + static MLOCK_T malloc_global_mutex = { initialization values };. + +*/ + +#if !USE_LOCKS +#define USE_LOCK_BIT (0U) +#define INITIAL_LOCK(l) (0) +#define DESTROY_LOCK(l) (0) +#define ACQUIRE_MALLOC_GLOBAL_LOCK() +#define RELEASE_MALLOC_GLOBAL_LOCK() + +#else +#if USE_LOCKS > 1 +/* ----------------------- User-defined locks ------------------------ */ +/* Define your own lock implementation here */ +/* #define INITIAL_LOCK(lk) ... */ +/* #define DESTROY_LOCK(lk) ... */ +/* #define ACQUIRE_LOCK(lk) ... */ +/* #define RELEASE_LOCK(lk) ... */ +/* #define TRY_LOCK(lk) ... */ +/* static MLOCK_T malloc_global_mutex = ... */ + +#elif USE_SPIN_LOCKS + +/* First, define CAS_LOCK and CLEAR_LOCK on ints */ +/* Note CAS_LOCK defined to return 0 on success */ + +#if defined(__GNUC__)&& (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 1)) +#define CAS_LOCK(sl) __sync_lock_test_and_set(sl, 1) +#define CLEAR_LOCK(sl) __sync_lock_release(sl) + +#elif (defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__))) +/* Custom spin locks for older gcc on x86 */ +static FORCEINLINE int x86_cas_lock(int *sl) { + int ret; + int val = 1; + int cmp = 0; + __asm__ __volatile__ ("lock; cmpxchgl %1, %2" + : "=a" (ret) + : "r" (val), "m" (*(sl)), "0"(cmp) + : "memory", "cc"); + return ret; +} + +static FORCEINLINE void x86_clear_lock(int* sl) { + assert(*sl != 0); + int prev = 0; + int ret; + __asm__ __volatile__ ("lock; xchgl %0, %1" + : "=r" (ret) + : "m" (*(sl)), "0"(prev) + : "memory"); +} + +#define CAS_LOCK(sl) x86_cas_lock(sl) +#define CLEAR_LOCK(sl) x86_clear_lock(sl) + +#else /* Win32 MSC */ +#define CAS_LOCK(sl) interlockedexchange(sl, 1) +#define CLEAR_LOCK(sl) interlockedexchange (sl, 0) + +#endif /* ... gcc spins locks ... */ + +/* How to yield for a spin lock */ +#define SPINS_PER_YIELD 63 +#if defined(_MSC_VER) +#define SLEEP_EX_DURATION 50 /* delay for yield/sleep */ +#define SPIN_LOCK_YIELD SleepEx(SLEEP_EX_DURATION, FALSE) +#elif defined (__SVR4) && defined (__sun) /* solaris */ +#define SPIN_LOCK_YIELD thr_yield(); +#elif !defined(LACKS_SCHED_H) +#define SPIN_LOCK_YIELD sched_yield(); +#else +#define SPIN_LOCK_YIELD +#endif /* ... yield ... */ + +#if !defined(USE_RECURSIVE_LOCKS) || USE_RECURSIVE_LOCKS == 0 +/* Plain spin locks use single word (embedded in malloc_states) */ +static int spin_acquire_lock(int *sl) { + int spins = 0; + while (*(volatile int *)sl != 0 || CAS_LOCK(sl)) { + if ((++spins & SPINS_PER_YIELD) == 0) { + SPIN_LOCK_YIELD; + } + } + return 0; +} + +#define MLOCK_T int +#define TRY_LOCK(sl) !CAS_LOCK(sl) +#define RELEASE_LOCK(sl) CLEAR_LOCK(sl) +#define ACQUIRE_LOCK(sl) (CAS_LOCK(sl)? spin_acquire_lock(sl) : 0) +#define INITIAL_LOCK(sl) (*sl = 0) +#define DESTROY_LOCK(sl) (0) +static MLOCK_T malloc_global_mutex = 0; + +#else /* USE_RECURSIVE_LOCKS */ +/* types for lock owners */ +#ifdef WIN32 +#define THREAD_ID_T DWORD +#define CURRENT_THREAD GetCurrentThreadId() +#define EQ_OWNER(X,Y) ((X) == (Y)) +#else +/* + Note: the following assume that pthread_t is a type that can be + initialized to (casted) zero. If this is not the case, you will need to + somehow redefine these or not use spin locks. +*/ +#define THREAD_ID_T pthread_t +#define CURRENT_THREAD pthread_self() +#define EQ_OWNER(X,Y) pthread_equal(X, Y) +#endif + +struct malloc_recursive_lock { + int sl; + unsigned int c; + THREAD_ID_T threadid; +}; + +#define MLOCK_T struct malloc_recursive_lock +static MLOCK_T malloc_global_mutex = { 0, 0, (THREAD_ID_T)0}; + +static FORCEINLINE void recursive_release_lock(MLOCK_T *lk) { + assert(lk->sl != 0); + if (--lk->c == 0) { + CLEAR_LOCK(&lk->sl); + } +} + +static FORCEINLINE int recursive_acquire_lock(MLOCK_T *lk) { + THREAD_ID_T mythreadid = CURRENT_THREAD; + int spins = 0; + for (;;) { + if (*((volatile int *)(&lk->sl)) == 0) { + if (!CAS_LOCK(&lk->sl)) { + lk->threadid = mythreadid; + lk->c = 1; + return 0; + } + } + else if (EQ_OWNER(lk->threadid, mythreadid)) { + ++lk->c; + return 0; + } + if ((++spins & SPINS_PER_YIELD) == 0) { + SPIN_LOCK_YIELD; + } + } +} + +static FORCEINLINE int recursive_try_lock(MLOCK_T *lk) { + THREAD_ID_T mythreadid = CURRENT_THREAD; + if (*((volatile int *)(&lk->sl)) == 0) { + if (!CAS_LOCK(&lk->sl)) { + lk->threadid = mythreadid; + lk->c = 1; + return 1; + } + } + else if (EQ_OWNER(lk->threadid, mythreadid)) { + ++lk->c; + return 1; + } + return 0; +} + +#define RELEASE_LOCK(lk) recursive_release_lock(lk) +#define TRY_LOCK(lk) recursive_try_lock(lk) +#define ACQUIRE_LOCK(lk) recursive_acquire_lock(lk) +#define INITIAL_LOCK(lk) ((lk)->threadid = (THREAD_ID_T)0, (lk)->sl = 0, (lk)->c = 0) +#define DESTROY_LOCK(lk) (0) +#endif /* USE_RECURSIVE_LOCKS */ + +#elif defined(WIN32) /* Win32 critical sections */ +#define MLOCK_T CRITICAL_SECTION +#define ACQUIRE_LOCK(lk) (EnterCriticalSection(lk), 0) +#define RELEASE_LOCK(lk) LeaveCriticalSection(lk) +#define TRY_LOCK(lk) TryEnterCriticalSection(lk) +#define INITIAL_LOCK(lk) (!InitializeCriticalSectionAndSpinCount((lk), 0x80000000|4000)) +#define DESTROY_LOCK(lk) (DeleteCriticalSection(lk), 0) +#define NEED_GLOBAL_LOCK_INIT + +static MLOCK_T malloc_global_mutex; +static volatile long malloc_global_mutex_status; + +/* Use spin loop to initialize global lock */ +static void init_malloc_global_mutex() { + for (;;) { + long stat = malloc_global_mutex_status; + if (stat > 0) + return; + /* transition to < 0 while initializing, then to > 0) */ + if (stat == 0 && + interlockedcompareexchange(&malloc_global_mutex_status, -1, 0) == 0) { + InitializeCriticalSection(&malloc_global_mutex); + interlockedexchange(&malloc_global_mutex_status,1); + return; + } + SleepEx(0, FALSE); + } +} + +#else /* pthreads-based locks */ +#define MLOCK_T pthread_mutex_t +#define ACQUIRE_LOCK(lk) pthread_mutex_lock(lk) +#define RELEASE_LOCK(lk) pthread_mutex_unlock(lk) +#define TRY_LOCK(lk) (!pthread_mutex_trylock(lk)) +#define INITIAL_LOCK(lk) pthread_init_lock(lk) +#define DESTROY_LOCK(lk) pthread_mutex_destroy(lk) + +#if defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0 && defined(linux) && !defined(PTHREAD_MUTEX_RECURSIVE) +/* Cope with old-style linux recursive lock initialization by adding */ +/* skipped internal declaration from pthread.h */ +extern int pthread_mutexattr_setkind_np __P ((pthread_mutexattr_t *__attr, + int __kind)); +#define PTHREAD_MUTEX_RECURSIVE PTHREAD_MUTEX_RECURSIVE_NP +#define pthread_mutexattr_settype(x,y) pthread_mutexattr_setkind_np(x,y) +#endif /* USE_RECURSIVE_LOCKS ... */ + +static MLOCK_T malloc_global_mutex = PTHREAD_MUTEX_INITIALIZER; + +static int pthread_init_lock (MLOCK_T *lk) { + pthread_mutexattr_t attr; + if (pthread_mutexattr_init(&attr)) return 1; +#if defined(USE_RECURSIVE_LOCKS) && USE_RECURSIVE_LOCKS != 0 + if (pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE)) return 1; +#endif + if (pthread_mutex_init(lk, &attr)) return 1; + if (pthread_mutexattr_destroy(&attr)) return 1; + return 0; +} + +#endif /* ... lock types ... */ + +/* Common code for all lock types */ +#define USE_LOCK_BIT (2U) + +#ifndef ACQUIRE_MALLOC_GLOBAL_LOCK +#define ACQUIRE_MALLOC_GLOBAL_LOCK() ACQUIRE_LOCK(&malloc_global_mutex); +#endif + +#ifndef RELEASE_MALLOC_GLOBAL_LOCK +#define RELEASE_MALLOC_GLOBAL_LOCK() RELEASE_LOCK(&malloc_global_mutex); +#endif + +#endif /* USE_LOCKS */ + +/* ----------------------- Chunk representations ------------------------ */ + +/* + (The following includes lightly edited explanations by Colin Plumb.) + + The malloc_chunk declaration below is misleading (but accurate and + necessary). It declares a "view" into memory allowing access to + necessary fields at known offsets from a given base. + + Chunks of memory are maintained using a `boundary tag' method as + originally described by Knuth. (See the paper by Paul Wilson + ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a survey of such + techniques.) Sizes of free chunks are stored both in the front of + each chunk and at the end. This makes consolidating fragmented + chunks into bigger chunks fast. The head fields also hold bits + representing whether chunks are free or in use. + + Here are some pictures to make it clearer. They are "exploded" to + show that the state of a chunk can be thought of as extending from + the high 31 bits of the head field of its header through the + prev_foot and PINUSE_BIT bit of the following chunk header. + + A chunk that's in use looks like: + + chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Size of previous chunk (if P = 0) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| + | Size of this chunk 1| +-+ + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | | + +- -+ + | | + +- -+ + | : + +- size - sizeof(size_t) available payload bytes -+ + : | + chunk-> +- -+ + | | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |1| + | Size of next chunk (may or may not be in use) | +-+ + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + + And if it's free, it looks like this: + + chunk-> +- -+ + | User payload (must be in use, or we would have merged!) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |P| + | Size of this chunk 0| +-+ + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Next pointer | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Prev pointer | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | : + +- size - sizeof(struct chunk) unused bytes -+ + : | + chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Size of this chunk | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |0| + | Size of next chunk (must be in use, or we would have merged)| +-+ + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | : + +- User payload -+ + : | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + |0| + +-+ + Note that since we always merge adjacent free chunks, the chunks + adjacent to a free chunk must be in use. + + Given a pointer to a chunk (which can be derived trivially from the + payload pointer) we can, in O(1) time, find out whether the adjacent + chunks are free, and if so, unlink them from the lists that they + are on and merge them with the current chunk. + + Chunks always begin on even word boundaries, so the mem portion + (which is returned to the user) is also on an even word boundary, and + thus at least double-word aligned. + + The P (PINUSE_BIT) bit, stored in the unused low-order bit of the + chunk size (which is always a multiple of two words), is an in-use + bit for the *previous* chunk. If that bit is *clear*, then the + word before the current chunk size contains the previous chunk + size, and can be used to find the front of the previous chunk. + The very first chunk allocated always has this bit set, preventing + access to non-existent (or non-owned) memory. If pinuse is set for + any given chunk, then you CANNOT determine the size of the + previous chunk, and might even get a memory addressing fault when + trying to do so. + + The C (CINUSE_BIT) bit, stored in the unused second-lowest bit of + the chunk size redundantly records whether the current chunk is + inuse (unless the chunk is mmapped). This redundancy enables usage + checks within free and realloc, and reduces indirection when freeing + and consolidating chunks. + + Each freshly allocated chunk must have both cinuse and pinuse set. + That is, each allocated chunk borders either a previously allocated + and still in-use chunk, or the base of its memory arena. This is + ensured by making all allocations from the `lowest' part of any + found chunk. Further, no free chunk physically borders another one, + so each free chunk is known to be preceded and followed by either + inuse chunks or the ends of memory. + + Note that the `foot' of the current chunk is actually represented + as the prev_foot of the NEXT chunk. This makes it easier to + deal with alignments etc but can be very confusing when trying + to extend or adapt this code. + + The exceptions to all this are + + 1. The special chunk `top' is the top-most available chunk (i.e., + the one bordering the end of available memory). It is treated + specially. Top is never included in any bin, is used only if + no other chunk is available, and is released back to the + system if it is very large (see M_TRIM_THRESHOLD). In effect, + the top chunk is treated as larger (and thus less well + fitting) than any other available chunk. The top chunk + doesn't update its trailing size field since there is no next + contiguous chunk that would have to index off it. However, + space is still allocated for it (TOP_FOOT_SIZE) to enable + separation or merging when space is extended. + + 3. Chunks allocated via mmap, have both cinuse and pinuse bits + cleared in their head fields. Because they are allocated + one-by-one, each must carry its own prev_foot field, which is + also used to hold the offset this chunk has within its mmapped + region, which is needed to preserve alignment. Each mmapped + chunk is trailed by the first two fields of a fake next-chunk + for sake of usage checks. + +*/ + +struct malloc_chunk { + size_t prev_foot; /* Size of previous chunk (if free). */ + size_t head; /* Size and inuse bits. */ + struct malloc_chunk* fd; /* double links -- used only if free. */ + struct malloc_chunk* bk; +}; + +typedef struct malloc_chunk mchunk; +typedef struct malloc_chunk* mchunkptr; +typedef struct malloc_chunk* sbinptr; /* The type of bins of chunks */ +typedef unsigned int bindex_t; /* Described below */ +typedef unsigned int binmap_t; /* Described below */ +typedef unsigned int flag_t; /* The type of various bit flag sets */ + +/* ------------------- Chunks sizes and alignments ----------------------- */ + +#define MCHUNK_SIZE (sizeof(mchunk)) + +#if FOOTERS +#define CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) +#else /* FOOTERS */ +#define CHUNK_OVERHEAD (SIZE_T_SIZE) +#endif /* FOOTERS */ + +/* MMapped chunks need a second word of overhead ... */ +#define MMAP_CHUNK_OVERHEAD (TWO_SIZE_T_SIZES) +/* ... and additional padding for fake next-chunk at foot */ +#define MMAP_FOOT_PAD (FOUR_SIZE_T_SIZES) + +/* The smallest size we can malloc is an aligned minimal chunk */ +#define MIN_CHUNK_SIZE\ + ((MCHUNK_SIZE + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) + +/* conversion from malloc headers to user pointers, and back */ +#define chunk2mem(p) ((void*)((char*)(p) + TWO_SIZE_T_SIZES)) +#define mem2chunk(mem) ((mchunkptr)((char*)(mem) - TWO_SIZE_T_SIZES)) +/* chunk associated with aligned address A */ +#define align_as_chunk(A) (mchunkptr)((A) + align_offset(chunk2mem(A))) + +/* Bounds on request (not chunk) sizes. */ +#define MAX_REQUEST ((-MIN_CHUNK_SIZE) << 2) +#define MIN_REQUEST (MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE) + +/* pad request bytes into a usable size */ +#define pad_request(req) \ + (((req) + CHUNK_OVERHEAD + CHUNK_ALIGN_MASK) & ~CHUNK_ALIGN_MASK) + +/* pad request, checking for minimum (but not maximum) */ +#define request2size(req) \ + (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req)) + + +/* ------------------ Operations on head and foot fields ----------------- */ + +/* + The head field of a chunk is or'ed with PINUSE_BIT when previous + adjacent chunk in use, and or'ed with CINUSE_BIT if this chunk is in + use, unless mmapped, in which case both bits are cleared. + + FLAG4_BIT is not used by this malloc, but might be useful in extensions. +*/ + +#define PINUSE_BIT (SIZE_T_ONE) +#define CINUSE_BIT (SIZE_T_TWO) +#define FLAG4_BIT (SIZE_T_FOUR) +#define INUSE_BITS (PINUSE_BIT|CINUSE_BIT) +#define FLAG_BITS (PINUSE_BIT|CINUSE_BIT|FLAG4_BIT) + +/* Head value for fenceposts */ +#define FENCEPOST_HEAD (INUSE_BITS|SIZE_T_SIZE) + +/* extraction of fields from head words */ +#define cinuse(p) ((p)->head & CINUSE_BIT) +#define pinuse(p) ((p)->head & PINUSE_BIT) +#define flag4inuse(p) ((p)->head & FLAG4_BIT) +#define is_inuse(p) (((p)->head & INUSE_BITS) != PINUSE_BIT) +#define is_mmapped(p) (((p)->head & INUSE_BITS) == 0) + +#define chunksize(p) ((p)->head & ~(FLAG_BITS)) + +#define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT) +#define set_flag4(p) ((p)->head |= FLAG4_BIT) +#define clear_flag4(p) ((p)->head &= ~FLAG4_BIT) + +/* Treat space at ptr +/- offset as a chunk */ +#define chunk_plus_offset(p, s) ((mchunkptr)(((char*)(p)) + (s))) +#define chunk_minus_offset(p, s) ((mchunkptr)(((char*)(p)) - (s))) + +/* Ptr to next or previous physical malloc_chunk. */ +#define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS))) +#define prev_chunk(p) ((mchunkptr)( ((char*)(p)) - ((p)->prev_foot) )) + +/* extract next chunk's pinuse bit */ +#define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT) + +/* Get/set size at footer */ +#define get_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot) +#define set_foot(p, s) (((mchunkptr)((char*)(p) + (s)))->prev_foot = (s)) + +/* Set size, pinuse bit, and foot */ +#define set_size_and_pinuse_of_free_chunk(p, s)\ + ((p)->head = (s|PINUSE_BIT), set_foot(p, s)) + +/* Set size, pinuse bit, foot, and clear next pinuse */ +#define set_free_with_pinuse(p, s, n)\ + (clear_pinuse(n), set_size_and_pinuse_of_free_chunk(p, s)) + +/* Get the internal overhead associated with chunk p */ +#define overhead_for(p)\ + (is_mmapped(p)? MMAP_CHUNK_OVERHEAD : CHUNK_OVERHEAD) + +/* Return true if malloced space is not necessarily cleared */ +#if MMAP_CLEARS +#define calloc_must_clear(p) (!is_mmapped(p)) +#else /* MMAP_CLEARS */ +#define calloc_must_clear(p) (1) +#endif /* MMAP_CLEARS */ + +/* ---------------------- Overlaid data structures ----------------------- */ + +/* + When chunks are not in use, they are treated as nodes of either + lists or trees. + + "Small" chunks are stored in circular doubly-linked lists, and look + like this: + + chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Size of previous chunk | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + `head:' | Size of chunk, in bytes |P| + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Forward pointer to next chunk in list | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Back pointer to previous chunk in list | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Unused space (may be 0 bytes long) . + . . + . | +nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + `foot:' | Size of chunk, in bytes | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + + Larger chunks are kept in a form of bitwise digital trees (aka + tries) keyed on chunksizes. Because malloc_tree_chunks are only for + free chunks greater than 256 bytes, their size doesn't impose any + constraints on user chunk sizes. Each node looks like: + + chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Size of previous chunk | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + `head:' | Size of chunk, in bytes |P| + mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Forward pointer to next chunk of same size | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Back pointer to previous chunk of same size | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Pointer to left child (child[0]) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Pointer to right child (child[1]) | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Pointer to parent | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | bin index of this chunk | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + | Unused space . + . | +nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + `foot:' | Size of chunk, in bytes | + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + + Each tree holding treenodes is a tree of unique chunk sizes. Chunks + of the same size are arranged in a circularly-linked list, with only + the oldest chunk (the next to be used, in our FIFO ordering) + actually in the tree. (Tree members are distinguished by a non-null + parent pointer.) If a chunk with the same size an an existing node + is inserted, it is linked off the existing node using pointers that + work in the same way as fd/bk pointers of small chunks. + + Each tree contains a power of 2 sized range of chunk sizes (the + smallest is 0x100 <= x < 0x180), which is is divided in half at each + tree level, with the chunks in the smaller half of the range (0x100 + <= x < 0x140 for the top nose) in the left subtree and the larger + half (0x140 <= x < 0x180) in the right subtree. This is, of course, + done by inspecting individual bits. + + Using these rules, each node's left subtree contains all smaller + sizes than its right subtree. However, the node at the root of each + subtree has no particular ordering relationship to either. (The + dividing line between the subtree sizes is based on trie relation.) + If we remove the last chunk of a given size from the interior of the + tree, we need to replace it with a leaf node. The tree ordering + rules permit a node to be replaced by any leaf below it. + + The smallest chunk in a tree (a common operation in a best-fit + allocator) can be found by walking a path to the leftmost leaf in + the tree. Unlike a usual binary tree, where we follow left child + pointers until we reach a null, here we follow the right child + pointer any time the left one is null, until we reach a leaf with + both child pointers null. The smallest chunk in the tree will be + somewhere along that path. + + The worst case number of steps to add, find, or remove a node is + bounded by the number of bits differentiating chunks within + bins. Under current bin calculations, this ranges from 6 up to 21 + (for 32 bit sizes) or up to 53 (for 64 bit sizes). The typical case + is of course much better. +*/ + +struct malloc_tree_chunk { + /* The first four fields must be compatible with malloc_chunk */ + size_t prev_foot; + size_t head; + struct malloc_tree_chunk* fd; + struct malloc_tree_chunk* bk; + + struct malloc_tree_chunk* child[2]; + struct malloc_tree_chunk* parent; + bindex_t index; +}; + +typedef struct malloc_tree_chunk tchunk; +typedef struct malloc_tree_chunk* tchunkptr; +typedef struct malloc_tree_chunk* tbinptr; /* The type of bins of trees */ + +/* A little helper macro for trees */ +#define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1]) + +/* ----------------------------- Segments -------------------------------- */ + +/* + Each malloc space may include non-contiguous segments, held in a + list headed by an embedded malloc_segment record representing the + top-most space. Segments also include flags holding properties of + the space. Large chunks that are directly allocated by mmap are not + included in this list. They are instead independently created and + destroyed without otherwise keeping track of them. + + Segment management mainly comes into play for spaces allocated by + MMAP. Any call to MMAP might or might not return memory that is + adjacent to an existing segment. MORECORE normally contiguously + extends the current space, so this space is almost always adjacent, + which is simpler and faster to deal with. (This is why MORECORE is + used preferentially to MMAP when both are available -- see + sys_alloc.) When allocating using MMAP, we don't use any of the + hinting mechanisms (inconsistently) supported in various + implementations of unix mmap, or distinguish reserving from + committing memory. Instead, we just ask for space, and exploit + contiguity when we get it. It is probably possible to do + better than this on some systems, but no general scheme seems + to be significantly better. + + Management entails a simpler variant of the consolidation scheme + used for chunks to reduce fragmentation -- new adjacent memory is + normally prepended or appended to an existing segment. However, + there are limitations compared to chunk consolidation that mostly + reflect the fact that segment processing is relatively infrequent + (occurring only when getting memory from system) and that we + don't expect to have huge numbers of segments: + + * Segments are not indexed, so traversal requires linear scans. (It + would be possible to index these, but is not worth the extra + overhead and complexity for most programs on most platforms.) + * New segments are only appended to old ones when holding top-most + memory; if they cannot be prepended to others, they are held in + different segments. + + Except for the top-most segment of an mstate, each segment record + is kept at the tail of its segment. Segments are added by pushing + segment records onto the list headed by &mstate.seg for the + containing mstate. + + Segment flags control allocation/merge/deallocation policies: + * If EXTERN_BIT set, then we did not allocate this segment, + and so should not try to deallocate or merge with others. + (This currently holds only for the initial segment passed + into create_mspace_with_base.) + * If USE_MMAP_BIT set, the segment may be merged with + other surrounding mmapped segments and trimmed/de-allocated + using munmap. + * If neither bit is set, then the segment was obtained using + MORECORE so can be merged with surrounding MORECORE'd segments + and deallocated/trimmed using MORECORE with negative arguments. +*/ + +struct malloc_segment { + char* base; /* base address */ + size_t size; /* allocated size */ + struct malloc_segment* next; /* ptr to next segment */ + flag_t sflags; /* mmap and extern flag */ +}; + +#define is_mmapped_segment(S) ((S)->sflags & USE_MMAP_BIT) +#define is_extern_segment(S) ((S)->sflags & EXTERN_BIT) + +typedef struct malloc_segment msegment; +typedef struct malloc_segment* msegmentptr; + +/* ---------------------------- malloc_state ----------------------------- */ + +/* + A malloc_state holds all of the bookkeeping for a space. + The main fields are: + + Top + The topmost chunk of the currently active segment. Its size is + cached in topsize. The actual size of topmost space is + topsize+TOP_FOOT_SIZE, which includes space reserved for adding + fenceposts and segment records if necessary when getting more + space from the system. The size at which to autotrim top is + cached from mparams in trim_check, except that it is disabled if + an autotrim fails. + + Designated victim (dv) + This is the preferred chunk for servicing small requests that + don't have exact fits. It is normally the chunk split off most + recently to service another small request. Its size is cached in + dvsize. The link fields of this chunk are not maintained since it + is not kept in a bin. + + SmallBins + An array of bin headers for free chunks. These bins hold chunks + with sizes less than MIN_LARGE_SIZE bytes. Each bin contains + chunks of all the same size, spaced 8 bytes apart. To simplify + use in double-linked lists, each bin header acts as a malloc_chunk + pointing to the real first node, if it exists (else pointing to + itself). This avoids special-casing for headers. But to avoid + waste, we allocate only the fd/bk pointers of bins, and then use + repositioning tricks to treat these as the fields of a chunk. + + TreeBins + Treebins are pointers to the roots of trees holding a range of + sizes. There are 2 equally spaced treebins for each power of two + from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything + larger. + + Bin maps + There is one bit map for small bins ("smallmap") and one for + treebins ("treemap). Each bin sets its bit when non-empty, and + clears the bit when empty. Bit operations are then used to avoid + bin-by-bin searching -- nearly all "search" is done without ever + looking at bins that won't be selected. The bit maps + conservatively use 32 bits per map word, even if on 64bit system. + For a good description of some of the bit-based techniques used + here, see Henry S. Warren Jr's book "Hacker's Delight" (and + supplement at http://hackersdelight.org/). Many of these are + intended to reduce the branchiness of paths through malloc etc, as + well as to reduce the number of memory locations read or written. + + Segments + A list of segments headed by an embedded malloc_segment record + representing the initial space. + + Address check support + The least_addr field is the least address ever obtained from + MORECORE or MMAP. Attempted frees and reallocs of any address less + than this are trapped (unless INSECURE is defined). + + Magic tag + A cross-check field that should always hold same value as mparams.magic. + + Max allowed footprint + The maximum allowed bytes to allocate from system (zero means no limit) + + Flags + Bits recording whether to use MMAP, locks, or contiguous MORECORE + + Statistics + Each space keeps track of current and maximum system memory + obtained via MORECORE or MMAP. + + Trim support + Fields holding the amount of unused topmost memory that should trigger + trimming, and a counter to force periodic scanning to release unused + non-topmost segments. + + Locking + If USE_LOCKS is defined, the "mutex" lock is acquired and released + around every public call using this mspace. + + Extension support + A void* pointer and a size_t field that can be used to help implement + extensions to this malloc. +*/ + +/* Bin types, widths and sizes */ +#define NSMALLBINS (32U) +#define NTREEBINS (32U) +#define SMALLBIN_SHIFT (3U) +#define SMALLBIN_WIDTH (SIZE_T_ONE << SMALLBIN_SHIFT) +#define TREEBIN_SHIFT (8U) +#define MIN_LARGE_SIZE (SIZE_T_ONE << TREEBIN_SHIFT) +#define MAX_SMALL_SIZE (MIN_LARGE_SIZE - SIZE_T_ONE) +#define MAX_SMALL_REQUEST (MAX_SMALL_SIZE - CHUNK_ALIGN_MASK - CHUNK_OVERHEAD) + +struct malloc_state { + binmap_t smallmap; + binmap_t treemap; + size_t dvsize; + size_t topsize; + char* least_addr; + mchunkptr dv; + mchunkptr top; + size_t trim_check; + size_t release_checks; + size_t magic; + mchunkptr smallbins[(NSMALLBINS+1)*2]; + tbinptr treebins[NTREEBINS]; + size_t footprint; + size_t max_footprint; + size_t footprint_limit; /* zero means no limit */ + flag_t mflags; +#if USE_LOCKS + MLOCK_T mutex; /* locate lock among fields that rarely change */ +#endif /* USE_LOCKS */ + msegment seg; + void* extp; /* Unused but available for extensions */ + size_t exts; +}; + +typedef struct malloc_state* mstate; + +/* ------------- Global malloc_state and malloc_params ------------------- */ + +/* + malloc_params holds global properties, including those that can be + dynamically set using mallopt. There is a single instance, mparams, + initialized in init_mparams. Note that the non-zeroness of "magic" + also serves as an initialization flag. +*/ + +struct malloc_params { + size_t magic; + size_t page_size; + size_t granularity; + size_t mmap_threshold; + size_t trim_threshold; + flag_t default_mflags; +}; + +static struct malloc_params mparams; + +/* Ensure mparams initialized */ +#define ensure_initialization() (void)(mparams.magic != 0 || init_mparams()) + +#if !ONLY_MSPACES + +/* The global malloc_state used for all non-"mspace" calls */ +static struct malloc_state _gm_; +#define gm (&_gm_) +#define is_global(M) ((M) == &_gm_) + +#endif /* !ONLY_MSPACES */ + +#define is_initialized(M) ((M)->top != 0) + +/* -------------------------- system alloc setup ------------------------- */ + +/* Operations on mflags */ + +#define use_lock(M) ((M)->mflags & USE_LOCK_BIT) +#define enable_lock(M) ((M)->mflags |= USE_LOCK_BIT) +#if USE_LOCKS +#define disable_lock(M) ((M)->mflags &= ~USE_LOCK_BIT) +#else +#define disable_lock(M) +#endif + +#define use_mmap(M) ((M)->mflags & USE_MMAP_BIT) +#define enable_mmap(M) ((M)->mflags |= USE_MMAP_BIT) +#if HAVE_MMAP +#define disable_mmap(M) ((M)->mflags &= ~USE_MMAP_BIT) +#else +#define disable_mmap(M) +#endif + +#define use_noncontiguous(M) ((M)->mflags & USE_NONCONTIGUOUS_BIT) +#define disable_contiguous(M) ((M)->mflags |= USE_NONCONTIGUOUS_BIT) + +#define set_lock(M,L)\ + ((M)->mflags = (L)?\ + ((M)->mflags | USE_LOCK_BIT) :\ + ((M)->mflags & ~USE_LOCK_BIT)) + +/* page-align a size */ +#define page_align(S)\ + (((S) + (mparams.page_size - SIZE_T_ONE)) & ~(mparams.page_size - SIZE_T_ONE)) + +/* granularity-align a size */ +#define granularity_align(S)\ + (((S) + (mparams.granularity - SIZE_T_ONE))\ + & ~(mparams.granularity - SIZE_T_ONE)) + + +/* For mmap, use granularity alignment on windows, else page-align */ +#ifdef WIN32 +#define mmap_align(S) granularity_align(S) +#else +#define mmap_align(S) page_align(S) +#endif + +/* For sys_alloc, enough padding to ensure can malloc request on success */ +#define SYS_ALLOC_PADDING (TOP_FOOT_SIZE + MALLOC_ALIGNMENT) + +#define is_page_aligned(S)\ + (((size_t)(S) & (mparams.page_size - SIZE_T_ONE)) == 0) +#define is_granularity_aligned(S)\ + (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0) + +/* True if segment S holds address A */ +#define segment_holds(S, A)\ + ((char*)(A) >= S->base && (char*)(A) < S->base + S->size) + +/* Return segment holding given address */ +static msegmentptr segment_holding(mstate m, char* addr) { + msegmentptr sp = &m->seg; + for (;;) { + if (addr >= sp->base && addr < sp->base + sp->size) + return sp; + if ((sp = sp->next) == 0) + return 0; + } +} + +/* Return true if segment contains a segment link */ +static int has_segment_link(mstate m, msegmentptr ss) { + msegmentptr sp = &m->seg; + for (;;) { + if ((char*)sp >= ss->base && (char*)sp < ss->base + ss->size) + return 1; + if ((sp = sp->next) == 0) + return 0; + } +} + +#ifndef MORECORE_CANNOT_TRIM +#define should_trim(M,s) ((s) > (M)->trim_check) +#else /* MORECORE_CANNOT_TRIM */ +#define should_trim(M,s) (0) +#endif /* MORECORE_CANNOT_TRIM */ + +/* + TOP_FOOT_SIZE is padding at the end of a segment, including space + that may be needed to place segment records and fenceposts when new + noncontiguous segments are added. +*/ +#define TOP_FOOT_SIZE\ + (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE) + + +/* ------------------------------- Hooks -------------------------------- */ + +/* + PREACTION should be defined to return 0 on success, and nonzero on + failure. If you are not using locking, you can redefine these to do + anything you like. +*/ + +#if USE_LOCKS +#define PREACTION(M) ((use_lock(M))? ACQUIRE_LOCK(&(M)->mutex) : 0) +#define POSTACTION(M) { if (use_lock(M)) RELEASE_LOCK(&(M)->mutex); } +#else /* USE_LOCKS */ + +#ifndef PREACTION +#define PREACTION(M) (0) +#endif /* PREACTION */ + +#ifndef POSTACTION +#define POSTACTION(M) +#endif /* POSTACTION */ + +#endif /* USE_LOCKS */ + +/* + CORRUPTION_ERROR_ACTION is triggered upon detected bad addresses. + USAGE_ERROR_ACTION is triggered on detected bad frees and + reallocs. The argument p is an address that might have triggered the + fault. It is ignored by the two predefined actions, but might be + useful in custom actions that try to help diagnose errors. +*/ + +#if PROCEED_ON_ERROR + +/* A count of the number of corruption errors causing resets */ +int malloc_corruption_error_count; + +/* default corruption action */ +static void reset_on_error(mstate m); + +#define CORRUPTION_ERROR_ACTION(m) reset_on_error(m) +#define USAGE_ERROR_ACTION(m, p) + +#else /* PROCEED_ON_ERROR */ + +#ifndef CORRUPTION_ERROR_ACTION +#define CORRUPTION_ERROR_ACTION(m) ABORT +#endif /* CORRUPTION_ERROR_ACTION */ + +#ifndef USAGE_ERROR_ACTION +#define USAGE_ERROR_ACTION(m,p) ABORT +#endif /* USAGE_ERROR_ACTION */ + +#endif /* PROCEED_ON_ERROR */ + + +/* -------------------------- Debugging setup ---------------------------- */ + +#if ! DEBUG + +#define check_free_chunk(M,P) +#define check_inuse_chunk(M,P) +#define check_malloced_chunk(M,P,N) +#define check_mmapped_chunk(M,P) +#define check_malloc_state(M) +#define check_top_chunk(M,P) + +#else /* DEBUG */ +#define check_free_chunk(M,P) do_check_free_chunk(M,P) +#define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) +#define check_top_chunk(M,P) do_check_top_chunk(M,P) +#define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) +#define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) +#define check_malloc_state(M) do_check_malloc_state(M) + +static void do_check_any_chunk(mstate m, mchunkptr p); +static void do_check_top_chunk(mstate m, mchunkptr p); +static void do_check_mmapped_chunk(mstate m, mchunkptr p); +static void do_check_inuse_chunk(mstate m, mchunkptr p); +static void do_check_free_chunk(mstate m, mchunkptr p); +static void do_check_malloced_chunk(mstate m, void* mem, size_t s); +static void do_check_tree(mstate m, tchunkptr t); +static void do_check_treebin(mstate m, bindex_t i); +static void do_check_smallbin(mstate m, bindex_t i); +static void do_check_malloc_state(mstate m); +static int bin_find(mstate m, mchunkptr x); +static size_t traverse_and_check(mstate m); +#endif /* DEBUG */ + +/* ---------------------------- Indexing Bins ---------------------------- */ + +#define is_small(s) (((s) >> SMALLBIN_SHIFT) < NSMALLBINS) +#define small_index(s) (bindex_t)((s) >> SMALLBIN_SHIFT) +#define small_index2size(i) ((i) << SMALLBIN_SHIFT) +#define MIN_SMALL_INDEX (small_index(MIN_CHUNK_SIZE)) + +/* addressing by index. See above about smallbin repositioning */ +#define smallbin_at(M, i) ((sbinptr)((char*)&((M)->smallbins[(i)<<1]))) +#define treebin_at(M,i) (&((M)->treebins[i])) + +/* assign tree index for size S to variable I. Use x86 asm if possible */ +#if defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) +#define compute_tree_index(S, I)\ +{\ + unsigned int X = S >> TREEBIN_SHIFT;\ + if (X == 0)\ + I = 0;\ + else if (X > 0xFFFF)\ + I = NTREEBINS-1;\ + else {\ + unsigned int K = (unsigned) sizeof(X)*__CHAR_BIT__ - 1 - (unsigned) __builtin_clz(X); \ + I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ + }\ +} + +#elif defined (__INTEL_COMPILER) +#define compute_tree_index(S, I)\ +{\ + size_t X = S >> TREEBIN_SHIFT;\ + if (X == 0)\ + I = 0;\ + else if (X > 0xFFFF)\ + I = NTREEBINS-1;\ + else {\ + unsigned int K = _bit_scan_reverse (X); \ + I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ + }\ +} + +#elif defined(_MSC_VER) && _MSC_VER>=1300 +#define compute_tree_index(S, I)\ +{\ + size_t X = S >> TREEBIN_SHIFT;\ + if (X == 0)\ + I = 0;\ + else if (X > 0xFFFF)\ + I = NTREEBINS-1;\ + else {\ + unsigned int K;\ + _BitScanReverse((DWORD *) &K, (DWORD) X);\ + I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ + }\ +} + +#else /* GNUC */ +#define compute_tree_index(S, I)\ +{\ + size_t X = S >> TREEBIN_SHIFT;\ + if (X == 0)\ + I = 0;\ + else if (X > 0xFFFF)\ + I = NTREEBINS-1;\ + else {\ + unsigned int Y = (unsigned int)X;\ + unsigned int N = ((Y - 0x100) >> 16) & 8;\ + unsigned int K = (((Y <<= N) - 0x1000) >> 16) & 4;\ + N += K;\ + N += K = (((Y <<= K) - 0x4000) >> 16) & 2;\ + K = 14 - N + ((Y <<= K) >> 15);\ + I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\ + }\ +} +#endif /* GNUC */ + +/* Bit representing maximum resolved size in a treebin at i */ +#define bit_for_tree_index(i) \ + (i == NTREEBINS-1)? (SIZE_T_BITSIZE-1) : (((i) >> 1) + TREEBIN_SHIFT - 2) + +/* Shift placing maximum resolved bit in a treebin at i as sign bit */ +#define leftshift_for_tree_index(i) \ + ((i == NTREEBINS-1)? 0 : \ + ((SIZE_T_BITSIZE-SIZE_T_ONE) - (((i) >> 1) + TREEBIN_SHIFT - 2))) + +/* The size of the smallest chunk held in bin with index i */ +#define minsize_for_tree_index(i) \ + ((SIZE_T_ONE << (((i) >> 1) + TREEBIN_SHIFT)) | \ + (((size_t)((i) & SIZE_T_ONE)) << (((i) >> 1) + TREEBIN_SHIFT - 1))) + + +/* ------------------------ Operations on bin maps ----------------------- */ + +/* bit corresponding to given index */ +#define idx2bit(i) ((binmap_t)(1) << (i)) + +/* Mark/Clear bits with given index */ +#define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i)) +#define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i)) +#define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i)) + +#define mark_treemap(M,i) ((M)->treemap |= idx2bit(i)) +#define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i)) +#define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i)) + +/* isolate the least set bit of a bitmap */ +#define least_bit(x) ((x) & -(x)) + +/* mask with all bits to left of least bit of x on */ +#define left_bits(x) ((x<<1) | -(x<<1)) + +/* mask with all bits to left of or equal to least bit of x on */ +#define same_or_left_bits(x) ((x) | -(x)) + +/* index corresponding to given bit. Use x86 asm if possible */ + +#if defined(__GNUC__) && (defined(__i386__) || defined(__x86_64__)) +#define compute_bit2idx(X, I)\ +{\ + unsigned int J;\ + J = __builtin_ctz(X); \ + I = (bindex_t)J;\ +} + +#elif defined (__INTEL_COMPILER) +#define compute_bit2idx(X, I)\ +{\ + unsigned int J;\ + J = _bit_scan_forward (X); \ + I = (bindex_t)J;\ +} + +#elif defined(_MSC_VER) && _MSC_VER>=1300 +#define compute_bit2idx(X, I)\ +{\ + unsigned int J;\ + _BitScanForward((DWORD *) &J, X);\ + I = (bindex_t)J;\ +} + +#elif USE_BUILTIN_FFS +#define compute_bit2idx(X, I) I = ffs(X)-1 + +#else +#define compute_bit2idx(X, I)\ +{\ + unsigned int Y = X - 1;\ + unsigned int K = Y >> (16-4) & 16;\ + unsigned int N = K; Y >>= K;\ + N += K = Y >> (8-3) & 8; Y >>= K;\ + N += K = Y >> (4-2) & 4; Y >>= K;\ + N += K = Y >> (2-1) & 2; Y >>= K;\ + N += K = Y >> (1-0) & 1; Y >>= K;\ + I = (bindex_t)(N + Y);\ +} +#endif /* GNUC */ + + +/* ----------------------- Runtime Check Support ------------------------- */ + +/* + For security, the main invariant is that malloc/free/etc never + writes to a static address other than malloc_state, unless static + malloc_state itself has been corrupted, which cannot occur via + malloc (because of these checks). In essence this means that we + believe all pointers, sizes, maps etc held in malloc_state, but + check all of those linked or offsetted from other embedded data + structures. These checks are interspersed with main code in a way + that tends to minimize their run-time cost. + + When FOOTERS is defined, in addition to range checking, we also + verify footer fields of inuse chunks, which can be used guarantee + that the mstate controlling malloc/free is intact. This is a + streamlined version of the approach described by William Robertson + et al in "Run-time Detection of Heap-based Overflows" LISA'03 + http://www.usenix.org/events/lisa03/tech/robertson.html The footer + of an inuse chunk holds the xor of its mstate and a random seed, + that is checked upon calls to free() and realloc(). This is + (probabalistically) unguessable from outside the program, but can be + computed by any code successfully malloc'ing any chunk, so does not + itself provide protection against code that has already broken + security through some other means. Unlike Robertson et al, we + always dynamically check addresses of all offset chunks (previous, + next, etc). This turns out to be cheaper than relying on hashes. +*/ + +#if !INSECURE +/* Check if address a is at least as high as any from MORECORE or MMAP */ +#define ok_address(M, a) ((char*)(a) >= (M)->least_addr) +/* Check if address of next chunk n is higher than base chunk p */ +#define ok_next(p, n) ((char*)(p) < (char*)(n)) +/* Check if p has inuse status */ +#define ok_inuse(p) is_inuse(p) +/* Check if p has its pinuse bit on */ +#define ok_pinuse(p) pinuse(p) + +#else /* !INSECURE */ +#define ok_address(M, a) (1) +#define ok_next(b, n) (1) +#define ok_inuse(p) (1) +#define ok_pinuse(p) (1) +#endif /* !INSECURE */ + +#if (FOOTERS && !INSECURE) +/* Check if (alleged) mstate m has expected magic field */ +#define ok_magic(M) ((M)->magic == mparams.magic) +#else /* (FOOTERS && !INSECURE) */ +#define ok_magic(M) (1) +#endif /* (FOOTERS && !INSECURE) */ + +/* In gcc, use __builtin_expect to minimize impact of checks */ +#if !INSECURE +#if defined(__GNUC__) && __GNUC__ >= 3 +#define RTCHECK(e) __builtin_expect(e, 1) +#else /* GNUC */ +#define RTCHECK(e) (e) +#endif /* GNUC */ +#else /* !INSECURE */ +#define RTCHECK(e) (1) +#endif /* !INSECURE */ + +/* macros to set up inuse chunks with or without footers */ + +#if !FOOTERS + +#define mark_inuse_foot(M,p,s) + +/* Macros for setting head/foot of non-mmapped chunks */ + +/* Set cinuse bit and pinuse bit of next chunk */ +#define set_inuse(M,p,s)\ + ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ + ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) + +/* Set cinuse and pinuse of this chunk and pinuse of next chunk */ +#define set_inuse_and_pinuse(M,p,s)\ + ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ + ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT) + +/* Set size, cinuse and pinuse bit of this chunk */ +#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ + ((p)->head = (s|PINUSE_BIT|CINUSE_BIT)) + +#else /* FOOTERS */ + +/* Set foot of inuse chunk to be xor of mstate and seed */ +#define mark_inuse_foot(M,p,s)\ + (((mchunkptr)((char*)(p) + (s)))->prev_foot = ((size_t)(M) ^ mparams.magic)) + +#define get_mstate_for(p)\ + ((mstate)(((mchunkptr)((char*)(p) +\ + (chunksize(p))))->prev_foot ^ mparams.magic)) + +#define set_inuse(M,p,s)\ + ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\ + (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \ + mark_inuse_foot(M,p,s)) + +#define set_inuse_and_pinuse(M,p,s)\ + ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ + (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\ + mark_inuse_foot(M,p,s)) + +#define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ + ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\ + mark_inuse_foot(M, p, s)) + +#endif /* !FOOTERS */ + +/* ---------------------------- setting mparams -------------------------- */ + +/* Initialize mparams */ +static int init_mparams(void) { +#ifdef NEED_GLOBAL_LOCK_INIT + call_once(&malloc_global_mutex_init_once, init_malloc_global_mutex); +#endif + + ACQUIRE_MALLOC_GLOBAL_LOCK(); + if (mparams.magic == 0) { + size_t magic; + size_t psize; + size_t gsize; + +#ifndef WIN32 + psize = malloc_getpagesize; + gsize = ((DEFAULT_GRANULARITY != 0)? DEFAULT_GRANULARITY : psize); +#else /* WIN32 */ + { + SYSTEM_INFO system_info; + GetSystemInfo(&system_info); + psize = system_info.dwPageSize; + gsize = ((DEFAULT_GRANULARITY != 0)? + DEFAULT_GRANULARITY : system_info.dwAllocationGranularity); + } +#endif /* WIN32 */ + + /* Sanity-check configuration: + size_t must be unsigned and as wide as pointer type. + ints must be at least 4 bytes. + alignment must be at least 8. + Alignment, min chunk size, and page size must all be powers of 2. + */ + if ((sizeof(size_t) != sizeof(char*)) || + (MAX_SIZE_T < MIN_CHUNK_SIZE) || + (sizeof(int) < 4) || + (MALLOC_ALIGNMENT < (size_t)8U) || + ((MALLOC_ALIGNMENT & (MALLOC_ALIGNMENT-SIZE_T_ONE)) != 0) || + ((MCHUNK_SIZE & (MCHUNK_SIZE-SIZE_T_ONE)) != 0) || + ((gsize & (gsize-SIZE_T_ONE)) != 0) || + ((psize & (psize-SIZE_T_ONE)) != 0)) + ABORT; + + mparams.granularity = gsize; + mparams.page_size = psize; + mparams.mmap_threshold = DEFAULT_MMAP_THRESHOLD; + mparams.trim_threshold = DEFAULT_TRIM_THRESHOLD; +#if MORECORE_CONTIGUOUS + mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT; +#else /* MORECORE_CONTIGUOUS */ + mparams.default_mflags = USE_LOCK_BIT|USE_MMAP_BIT|USE_NONCONTIGUOUS_BIT; +#endif /* MORECORE_CONTIGUOUS */ + +#if !ONLY_MSPACES + /* Set up lock for main malloc area */ + gm->mflags = mparams.default_mflags; + (void)INITIAL_LOCK(&gm->mutex); +#endif + + { +#if USE_DEV_RANDOM + int fd; + unsigned char buf[sizeof(size_t)]; + /* Try to use /dev/urandom, else fall back on using time */ + if ((fd = open("/dev/urandom", O_RDONLY)) >= 0 && + read(fd, buf, sizeof(buf)) == sizeof(buf)) { + magic = *((size_t *) buf); + close(fd); + } + else +#endif /* USE_DEV_RANDOM */ +#ifdef WIN32 + magic = (size_t)(GetTickCount() ^ (size_t)0x55555555U); +#elif defined(LACKS_TIME_H) + magic = (size_t)&magic ^ (size_t)0x55555555U; +#else + magic = (size_t)(time(0) ^ (size_t)0x55555555U); +#endif + magic |= (size_t)8U; /* ensure nonzero */ + magic &= ~(size_t)7U; /* improve chances of fault for bad values */ + /* Until memory modes commonly available, use volatile-write */ + (*(volatile size_t *)(&(mparams.magic))) = magic; + } + } + + RELEASE_MALLOC_GLOBAL_LOCK(); + return 1; +} + +/* support for mallopt */ +static int change_mparam(int param_number, int value) { + size_t val; + ensure_initialization(); + val = (value == -1)? MAX_SIZE_T : (size_t)value; + switch(param_number) { + case M_TRIM_THRESHOLD: + mparams.trim_threshold = val; + return 1; + case M_GRANULARITY: + if (val >= mparams.page_size && ((val & (val-1)) == 0)) { + mparams.granularity = val; + return 1; + } + else + return 0; + case M_MMAP_THRESHOLD: + mparams.mmap_threshold = val; + return 1; + default: + return 0; + } +} + +#if DEBUG +/* ------------------------- Debugging Support --------------------------- */ + +/* Check properties of any chunk, whether free, inuse, mmapped etc */ +static void do_check_any_chunk(mstate m, mchunkptr p) { + assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); + assert(ok_address(m, p)); +} + +/* Check properties of top chunk */ +static void do_check_top_chunk(mstate m, mchunkptr p) { + msegmentptr sp = segment_holding(m, (char*)p); + size_t sz = p->head & ~INUSE_BITS; /* third-lowest bit can be set! */ + assert(sp != 0); + assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); + assert(ok_address(m, p)); + assert(sz == m->topsize); + assert(sz > 0); + assert(sz == ((sp->base + sp->size) - (char*)p) - TOP_FOOT_SIZE); + assert(pinuse(p)); + assert(!pinuse(chunk_plus_offset(p, sz))); +} + +/* Check properties of (inuse) mmapped chunks */ +static void do_check_mmapped_chunk(mstate m, mchunkptr p) { + size_t sz = chunksize(p); + size_t len = (sz + (p->prev_foot) + MMAP_FOOT_PAD); + assert(is_mmapped(p)); + assert(use_mmap(m)); + assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD)); + assert(ok_address(m, p)); + assert(!is_small(sz)); + assert((len & (mparams.page_size-SIZE_T_ONE)) == 0); + assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD); + assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0); +} + +/* Check properties of inuse chunks */ +static void do_check_inuse_chunk(mstate m, mchunkptr p) { + do_check_any_chunk(m, p); + assert(is_inuse(p)); + assert(next_pinuse(p)); + /* If not pinuse and not mmapped, previous chunk has OK offset */ + assert(is_mmapped(p) || pinuse(p) || next_chunk(prev_chunk(p)) == p); + if (is_mmapped(p)) + do_check_mmapped_chunk(m, p); +} + +/* Check properties of free chunks */ +static void do_check_free_chunk(mstate m, mchunkptr p) { + size_t sz = chunksize(p); + mchunkptr next = chunk_plus_offset(p, sz); + do_check_any_chunk(m, p); + assert(!is_inuse(p)); + assert(!next_pinuse(p)); + assert (!is_mmapped(p)); + if (p != m->dv && p != m->top) { + if (sz >= MIN_CHUNK_SIZE) { + assert((sz & CHUNK_ALIGN_MASK) == 0); + assert(is_aligned(chunk2mem(p))); + assert(next->prev_foot == sz); + assert(pinuse(p)); + assert (next == m->top || is_inuse(next)); + assert(p->fd->bk == p); + assert(p->bk->fd == p); + } + else /* markers are always of size SIZE_T_SIZE */ + assert(sz == SIZE_T_SIZE); + } +} + +/* Check properties of malloced chunks at the point they are malloced */ +static void do_check_malloced_chunk(mstate m, void* mem, size_t s) { + if (mem != 0) { + mchunkptr p = mem2chunk(mem); + size_t sz = p->head & ~INUSE_BITS; + do_check_inuse_chunk(m, p); + assert((sz & CHUNK_ALIGN_MASK) == 0); + assert(sz >= MIN_CHUNK_SIZE); + assert(sz >= s); + /* unless mmapped, size is less than MIN_CHUNK_SIZE more than request */ + assert(is_mmapped(p) || sz < (s + MIN_CHUNK_SIZE)); + } +} + +/* Check a tree and its subtrees. */ +static void do_check_tree(mstate m, tchunkptr t) { + tchunkptr head = 0; + tchunkptr u = t; + bindex_t tindex = t->index; + size_t tsize = chunksize(t); + bindex_t idx; + compute_tree_index(tsize, idx); + assert(tindex == idx); + assert(tsize >= MIN_LARGE_SIZE); + assert(tsize >= minsize_for_tree_index(idx)); + assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1)))); + + do { /* traverse through chain of same-sized nodes */ + do_check_any_chunk(m, ((mchunkptr)u)); + assert(u->index == tindex); + assert(chunksize(u) == tsize); + assert(!is_inuse(u)); + assert(!next_pinuse(u)); + assert(u->fd->bk == u); + assert(u->bk->fd == u); + if (u->parent == 0) { + assert(u->child[0] == 0); + assert(u->child[1] == 0); + } + else { + assert(head == 0); /* only one node on chain has parent */ + head = u; + assert(u->parent != u); + assert (u->parent->child[0] == u || + u->parent->child[1] == u || + *((tbinptr*)(u->parent)) == u); + if (u->child[0] != 0) { + assert(u->child[0]->parent == u); + assert(u->child[0] != u); + do_check_tree(m, u->child[0]); + } + if (u->child[1] != 0) { + assert(u->child[1]->parent == u); + assert(u->child[1] != u); + do_check_tree(m, u->child[1]); + } + if (u->child[0] != 0 && u->child[1] != 0) { + assert(chunksize(u->child[0]) < chunksize(u->child[1])); + } + } + u = u->fd; + } while (u != t); + assert(head != 0); +} + +/* Check all the chunks in a treebin. */ +static void do_check_treebin(mstate m, bindex_t i) { + tbinptr* tb = treebin_at(m, i); + tchunkptr t = *tb; + int empty = (m->treemap & (1U << i)) == 0; + if (t == 0) + assert(empty); + if (!empty) + do_check_tree(m, t); +} + +/* Check all the chunks in a smallbin. */ +static void do_check_smallbin(mstate m, bindex_t i) { + sbinptr b = smallbin_at(m, i); + mchunkptr p = b->bk; + unsigned int empty = (m->smallmap & (1U << i)) == 0; + if (p == b) + assert(empty); + if (!empty) { + for (; p != b; p = p->bk) { + size_t size = chunksize(p); + mchunkptr q; + /* each chunk claims to be free */ + do_check_free_chunk(m, p); + /* chunk belongs in bin */ + assert(small_index(size) == i); + assert(p->bk == b || chunksize(p->bk) == chunksize(p)); + /* chunk is followed by an inuse chunk */ + q = next_chunk(p); + if (q->head != FENCEPOST_HEAD) + do_check_inuse_chunk(m, q); + } + } +} + +/* Find x in a bin. Used in other check functions. */ +static int bin_find(mstate m, mchunkptr x) { + size_t size = chunksize(x); + if (is_small(size)) { + bindex_t sidx = small_index(size); + sbinptr b = smallbin_at(m, sidx); + if (smallmap_is_marked(m, sidx)) { + mchunkptr p = b; + do { + if (p == x) + return 1; + } while ((p = p->fd) != b); + } + } + else { + bindex_t tidx; + compute_tree_index(size, tidx); + if (treemap_is_marked(m, tidx)) { + tchunkptr t = *treebin_at(m, tidx); + size_t sizebits = size << leftshift_for_tree_index(tidx); + while (t != 0 && chunksize(t) != size) { + t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; + sizebits <<= 1; + } + if (t != 0) { + tchunkptr u = t; + do { + if (u == (tchunkptr)x) + return 1; + } while ((u = u->fd) != t); + } + } + } + return 0; +} + +/* Traverse each chunk and check it; return total */ +static size_t traverse_and_check(mstate m) { + size_t sum = 0; + if (is_initialized(m)) { + msegmentptr s = &m->seg; + sum += m->topsize + TOP_FOOT_SIZE; + while (s != 0) { + mchunkptr q = align_as_chunk(s->base); + mchunkptr lastq = 0; + assert(pinuse(q)); + while (segment_holds(s, q) && + q != m->top && q->head != FENCEPOST_HEAD) { + sum += chunksize(q); + if (is_inuse(q)) { + assert(!bin_find(m, q)); + do_check_inuse_chunk(m, q); + } + else { + assert(q == m->dv || bin_find(m, q)); + assert(lastq == 0 || is_inuse(lastq)); /* Not 2 consecutive free */ + do_check_free_chunk(m, q); + } + lastq = q; + q = next_chunk(q); + } + s = s->next; + } + } + return sum; +} + + +/* Check all properties of malloc_state. */ +static void do_check_malloc_state(mstate m) { + bindex_t i; + size_t total; + /* check bins */ + for (i = 0; i < NSMALLBINS; ++i) + do_check_smallbin(m, i); + for (i = 0; i < NTREEBINS; ++i) + do_check_treebin(m, i); + + if (m->dvsize != 0) { /* check dv chunk */ + do_check_any_chunk(m, m->dv); + assert(m->dvsize == chunksize(m->dv)); + assert(m->dvsize >= MIN_CHUNK_SIZE); + assert(bin_find(m, m->dv) == 0); + } + + if (m->top != 0) { /* check top chunk */ + do_check_top_chunk(m, m->top); + /*assert(m->topsize == chunksize(m->top)); redundant */ + assert(m->topsize > 0); + assert(bin_find(m, m->top) == 0); + } + + total = traverse_and_check(m); + assert(total <= m->footprint); + assert(m->footprint <= m->max_footprint); +} +#endif /* DEBUG */ + +/* ----------------------------- statistics ------------------------------ */ + +#if !NO_MALLINFO +static struct mallinfo internal_mallinfo(mstate m) { + struct mallinfo nm = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; + ensure_initialization(); + if (!PREACTION(m)) { + check_malloc_state(m); + if (is_initialized(m)) { + size_t nfree = SIZE_T_ONE; /* top always free */ + size_t mfree = m->topsize + TOP_FOOT_SIZE; + size_t sum = mfree; + msegmentptr s = &m->seg; + while (s != 0) { + mchunkptr q = align_as_chunk(s->base); + while (segment_holds(s, q) && + q != m->top && q->head != FENCEPOST_HEAD) { + size_t sz = chunksize(q); + sum += sz; + if (!is_inuse(q)) { + mfree += sz; + ++nfree; + } + q = next_chunk(q); + } + s = s->next; + } + + nm.arena = sum; + nm.ordblks = nfree; + nm.hblkhd = m->footprint - sum; + nm.usmblks = m->max_footprint; + nm.uordblks = m->footprint - mfree; + nm.fordblks = mfree; + nm.keepcost = m->topsize; + } + + POSTACTION(m); + } + return nm; +} +#endif /* !NO_MALLINFO */ + +#if !NO_MALLOC_STATS +static void internal_malloc_stats(mstate m) { + ensure_initialization(); + if (!PREACTION(m)) { + size_t maxfp = 0; + size_t fp = 0; + size_t used = 0; + check_malloc_state(m); + if (is_initialized(m)) { + msegmentptr s = &m->seg; + maxfp = m->max_footprint; + fp = m->footprint; + used = fp - (m->topsize + TOP_FOOT_SIZE); + + while (s != 0) { + mchunkptr q = align_as_chunk(s->base); + while (segment_holds(s, q) && + q != m->top && q->head != FENCEPOST_HEAD) { + if (!is_inuse(q)) + used -= chunksize(q); + q = next_chunk(q); + } + s = s->next; + } + } + POSTACTION(m); /* drop lock */ + fprintf(stderr, "max system bytes = %10lu\n", (unsigned long)(maxfp)); + fprintf(stderr, "system bytes = %10lu\n", (unsigned long)(fp)); + fprintf(stderr, "in use bytes = %10lu\n", (unsigned long)(used)); + } +} +#endif /* NO_MALLOC_STATS */ + +/* ----------------------- Operations on smallbins ----------------------- */ + +/* + Various forms of linking and unlinking are defined as macros. Even + the ones for trees, which are very long but have very short typical + paths. This is ugly but reduces reliance on inlining support of + compilers. +*/ + +/* Link a free chunk into a smallbin */ +#define insert_small_chunk(M, P, S) {\ + bindex_t I = small_index(S);\ + mchunkptr B = smallbin_at(M, I);\ + mchunkptr F = B;\ + assert(S >= MIN_CHUNK_SIZE);\ + if (!smallmap_is_marked(M, I))\ + mark_smallmap(M, I);\ + else if (RTCHECK(ok_address(M, B->fd)))\ + F = B->fd;\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + B->fd = P;\ + F->bk = P;\ + P->fd = F;\ + P->bk = B;\ +} + +/* Unlink a chunk from a smallbin */ +#define unlink_small_chunk(M, P, S) {\ + mchunkptr F = P->fd;\ + mchunkptr B = P->bk;\ + bindex_t I = small_index(S);\ + assert(P != B);\ + assert(P != F);\ + assert(chunksize(P) == small_index2size(I));\ + if (RTCHECK(F == smallbin_at(M,I) || (ok_address(M, F) && F->bk == P))) { \ + if (B == F) {\ + clear_smallmap(M, I);\ + }\ + else if (RTCHECK(B == smallbin_at(M,I) ||\ + (ok_address(M, B) && B->fd == P))) {\ + F->bk = B;\ + B->fd = F;\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ +} + +/* Unlink the first chunk from a smallbin */ +#define unlink_first_small_chunk(M, B, P, I) {\ + mchunkptr F = P->fd;\ + assert(P != B);\ + assert(P != F);\ + assert(chunksize(P) == small_index2size(I));\ + if (B == F) {\ + clear_smallmap(M, I);\ + }\ + else if (RTCHECK(ok_address(M, F) && F->bk == P)) {\ + F->bk = B;\ + B->fd = F;\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ +} + +/* Replace dv node, binning the old one */ +/* Used only when dvsize known to be small */ +#define replace_dv(M, P, S) {\ + size_t DVS = M->dvsize;\ + assert(is_small(DVS));\ + if (DVS != 0) {\ + mchunkptr DV = M->dv;\ + insert_small_chunk(M, DV, DVS);\ + }\ + M->dvsize = S;\ + M->dv = P;\ +} + +/* ------------------------- Operations on trees ------------------------- */ + +/* Insert chunk into tree */ +#define insert_large_chunk(M, X, S) {\ + tbinptr* H;\ + bindex_t I;\ + compute_tree_index(S, I);\ + H = treebin_at(M, I);\ + X->index = I;\ + X->child[0] = X->child[1] = 0;\ + if (!treemap_is_marked(M, I)) {\ + mark_treemap(M, I);\ + *H = X;\ + X->parent = (tchunkptr)H;\ + X->fd = X->bk = X;\ + }\ + else {\ + tchunkptr T = *H;\ + size_t K = S << leftshift_for_tree_index(I);\ + for (;;) {\ + if (chunksize(T) != S) {\ + tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\ + K <<= 1;\ + if (*C != 0)\ + T = *C;\ + else if (RTCHECK(ok_address(M, C))) {\ + *C = X;\ + X->parent = T;\ + X->fd = X->bk = X;\ + break;\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + break;\ + }\ + }\ + else {\ + tchunkptr F = T->fd;\ + if (RTCHECK(ok_address(M, T) && ok_address(M, F))) {\ + T->fd = F->bk = X;\ + X->fd = F;\ + X->bk = T;\ + X->parent = 0;\ + break;\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + break;\ + }\ + }\ + }\ + }\ +} + +/* + Unlink steps: + + 1. If x is a chained node, unlink it from its same-sized fd/bk links + and choose its bk node as its replacement. + 2. If x was the last node of its size, but not a leaf node, it must + be replaced with a leaf node (not merely one with an open left or + right), to make sure that lefts and rights of descendents + correspond properly to bit masks. We use the rightmost descendent + of x. We could use any other leaf, but this is easy to locate and + tends to counteract removal of leftmosts elsewhere, and so keeps + paths shorter than minimally guaranteed. This doesn't loop much + because on average a node in a tree is near the bottom. + 3. If x is the base of a chain (i.e., has parent links) relink + x's parent and children to x's replacement (or null if none). +*/ + +#define unlink_large_chunk(M, X) {\ + tchunkptr XP = X->parent;\ + tchunkptr R;\ + if (X->bk != X) {\ + tchunkptr F = X->fd;\ + R = X->bk;\ + if (RTCHECK(ok_address(M, F) && F->bk == X && R->fd == X)) {\ + F->bk = R;\ + R->fd = F;\ + }\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + }\ + else {\ + tchunkptr* RP;\ + if (((R = *(RP = &(X->child[1]))) != 0) ||\ + ((R = *(RP = &(X->child[0]))) != 0)) {\ + tchunkptr* CP;\ + while ((*(CP = &(R->child[1])) != 0) ||\ + (*(CP = &(R->child[0])) != 0)) {\ + R = *(RP = CP);\ + }\ + if (RTCHECK(ok_address(M, RP)))\ + *RP = 0;\ + else {\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + }\ + }\ + if (XP != 0) {\ + tbinptr* H = treebin_at(M, X->index);\ + if (X == *H) {\ + if ((*H = R) == 0) \ + clear_treemap(M, X->index);\ + }\ + else if (RTCHECK(ok_address(M, XP))) {\ + if (XP->child[0] == X) \ + XP->child[0] = R;\ + else \ + XP->child[1] = R;\ + }\ + else\ + CORRUPTION_ERROR_ACTION(M);\ + if (R != 0) {\ + if (RTCHECK(ok_address(M, R))) {\ + tchunkptr C0, C1;\ + R->parent = XP;\ + if ((C0 = X->child[0]) != 0) {\ + if (RTCHECK(ok_address(M, C0))) {\ + R->child[0] = C0;\ + C0->parent = R;\ + }\ + else\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + if ((C1 = X->child[1]) != 0) {\ + if (RTCHECK(ok_address(M, C1))) {\ + R->child[1] = C1;\ + C1->parent = R;\ + }\ + else\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + }\ + else\ + CORRUPTION_ERROR_ACTION(M);\ + }\ + }\ +} + +/* Relays to large vs small bin operations */ + +#define insert_chunk(M, P, S)\ + if (is_small(S)) insert_small_chunk(M, P, S)\ + else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } + +#define unlink_chunk(M, P, S)\ + if (is_small(S)) unlink_small_chunk(M, P, S)\ + else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); } + + +/* Relays to internal calls to malloc/free from realloc, memalign etc */ + +#if ONLY_MSPACES +#define internal_malloc(m, b) mspace_malloc(m, b) +#define internal_free(m, mem) mspace_free(m,mem); +#else /* ONLY_MSPACES */ +#if MSPACES +#define internal_malloc(m, b)\ + ((m == gm)? dlmalloc(b) : mspace_malloc(m, b)) +#define internal_free(m, mem)\ + if (m == gm) dlfree(mem); else mspace_free(m,mem); +#else /* MSPACES */ +#define internal_malloc(m, b) dlmalloc(b) +#define internal_free(m, mem) dlfree(mem) +#endif /* MSPACES */ +#endif /* ONLY_MSPACES */ + +/* ----------------------- Direct-mmapping chunks ----------------------- */ + +/* + Directly mmapped chunks are set up with an offset to the start of + the mmapped region stored in the prev_foot field of the chunk. This + allows reconstruction of the required argument to MUNMAP when freed, + and also allows adjustment of the returned chunk to meet alignment + requirements (especially in memalign). +*/ + +/* Malloc using mmap */ +static void* mmap_alloc(mstate m, size_t nb) { + size_t mmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK); + if (m->footprint_limit != 0) { + size_t fp = m->footprint + mmsize; + if (fp <= m->footprint || fp > m->footprint_limit) + return 0; + } + if (mmsize > nb) { /* Check for wrap around 0 */ + char* mm = (char*)(CALL_DIRECT_MMAP(mmsize)); + if (mm != CMFAIL) { + size_t offset = align_offset(chunk2mem(mm)); + size_t psize = mmsize - offset - MMAP_FOOT_PAD; + mchunkptr p = (mchunkptr)(mm + offset); + p->prev_foot = offset; + p->head = psize; + mark_inuse_foot(m, p, psize); + chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD; + chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0; + + if (m->least_addr == 0 || mm < m->least_addr) + m->least_addr = mm; + if ((m->footprint += mmsize) > m->max_footprint) + m->max_footprint = m->footprint; + assert(is_aligned(chunk2mem(p))); + check_mmapped_chunk(m, p); + return chunk2mem(p); + } + } + return 0; +} + +/* Realloc using mmap */ +static mchunkptr mmap_resize(mstate m, mchunkptr oldp, size_t nb, int flags) { + size_t oldsize = chunksize(oldp); + (void) flags; + if (is_small(nb)) /* Can't shrink mmap regions below small size */ + return 0; + /* Keep old chunk if big enough but not too big */ + if (oldsize >= nb + SIZE_T_SIZE && + (oldsize - nb) <= (mparams.granularity << 1)) + return oldp; + else { + size_t offset = oldp->prev_foot; + size_t oldmmsize = oldsize + offset + MMAP_FOOT_PAD; + size_t newmmsize = mmap_align(nb + SIX_SIZE_T_SIZES + CHUNK_ALIGN_MASK); + char* cp = (char*)CALL_MREMAP((char*)oldp - offset, + oldmmsize, newmmsize, flags); + if (cp != CMFAIL) { + mchunkptr newp = (mchunkptr)(cp + offset); + size_t psize = newmmsize - offset - MMAP_FOOT_PAD; + newp->head = psize; + mark_inuse_foot(m, newp, psize); + chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD; + chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0; + + if (cp < m->least_addr) + m->least_addr = cp; + if ((m->footprint += newmmsize - oldmmsize) > m->max_footprint) + m->max_footprint = m->footprint; + check_mmapped_chunk(m, newp); + return newp; + } + } + return 0; +} + + +/* -------------------------- mspace management -------------------------- */ + +/* Initialize top chunk and its size */ +static void init_top(mstate m, mchunkptr p, size_t psize) { + /* Ensure alignment */ + size_t offset = align_offset(chunk2mem(p)); + p = (mchunkptr)((char*)p + offset); + psize -= offset; + + m->top = p; + m->topsize = psize; + p->head = psize | PINUSE_BIT; + /* set size of fake trailing chunk holding overhead space only once */ + chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE; + m->trim_check = mparams.trim_threshold; /* reset on each update */ +} + +/* Initialize bins for a new mstate that is otherwise zeroed out */ +static void init_bins(mstate m) { + /* Establish circular links for smallbins */ + bindex_t i; + for (i = 0; i < NSMALLBINS; ++i) { + sbinptr bin = smallbin_at(m,i); + bin->fd = bin->bk = bin; + } +} + +#if PROCEED_ON_ERROR + +/* default corruption action */ +static void reset_on_error(mstate m) { + int i; + ++malloc_corruption_error_count; + /* Reinitialize fields to forget about all memory */ + m->smallmap = m->treemap = 0; + m->dvsize = m->topsize = 0; + m->seg.base = 0; + m->seg.size = 0; + m->seg.next = 0; + m->top = m->dv = 0; + for (i = 0; i < NTREEBINS; ++i) + *treebin_at(m, i) = 0; + init_bins(m); +} +#endif /* PROCEED_ON_ERROR */ + +/* Allocate chunk and prepend remainder with chunk in successor base. */ +static void* prepend_alloc(mstate m, char* newbase, char* oldbase, + size_t nb) { + mchunkptr p = align_as_chunk(newbase); + mchunkptr oldfirst = align_as_chunk(oldbase); + size_t psize = (char*)oldfirst - (char*)p; + mchunkptr q = chunk_plus_offset(p, nb); + size_t qsize = psize - nb; + set_size_and_pinuse_of_inuse_chunk(m, p, nb); + + assert((char*)oldfirst > (char*)q); + assert(pinuse(oldfirst)); + assert(qsize >= MIN_CHUNK_SIZE); + + /* consolidate remainder with first chunk of old base */ + if (oldfirst == m->top) { + size_t tsize = m->topsize += qsize; + m->top = q; + q->head = tsize | PINUSE_BIT; + check_top_chunk(m, q); + } + else if (oldfirst == m->dv) { + size_t dsize = m->dvsize += qsize; + m->dv = q; + set_size_and_pinuse_of_free_chunk(q, dsize); + } + else { + if (!is_inuse(oldfirst)) { + size_t nsize = chunksize(oldfirst); + unlink_chunk(m, oldfirst, nsize); + oldfirst = chunk_plus_offset(oldfirst, nsize); + qsize += nsize; + } + set_free_with_pinuse(q, qsize, oldfirst); + insert_chunk(m, q, qsize); + check_free_chunk(m, q); + } + + check_malloced_chunk(m, chunk2mem(p), nb); + return chunk2mem(p); +} + +/* Add a segment to hold a new noncontiguous region */ +static void add_segment(mstate m, char* tbase, size_t tsize, flag_t mmapped) { + /* Determine locations and sizes of segment, fenceposts, old top */ + char* old_top = (char*)m->top; + msegmentptr oldsp = segment_holding(m, old_top); + char* old_end = oldsp->base + oldsp->size; + size_t ssize = pad_request(sizeof(struct malloc_segment)); + char* rawsp = old_end - (ssize + FOUR_SIZE_T_SIZES + CHUNK_ALIGN_MASK); + size_t offset = align_offset(chunk2mem(rawsp)); + char* asp = rawsp + offset; + char* csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp; + mchunkptr sp = (mchunkptr)csp; + msegmentptr ss = (msegmentptr)(chunk2mem(sp)); + mchunkptr tnext = chunk_plus_offset(sp, ssize); + mchunkptr p = tnext; + int nfences = 0; + + /* reset top to new space */ + init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); + + /* Set up segment record */ + assert(is_aligned(ss)); + set_size_and_pinuse_of_inuse_chunk(m, sp, ssize); + *ss = m->seg; /* Push current record */ + m->seg.base = tbase; + m->seg.size = tsize; + m->seg.sflags = mmapped; + m->seg.next = ss; + + /* Insert trailing fenceposts */ + for (;;) { + mchunkptr nextp = chunk_plus_offset(p, SIZE_T_SIZE); + p->head = FENCEPOST_HEAD; + ++nfences; + if ((char*)(&(nextp->head)) < old_end) + p = nextp; + else + break; + } + assert(nfences >= 2); + + /* Insert the rest of old top into a bin as an ordinary free chunk */ + if (csp != old_top) { + mchunkptr q = (mchunkptr)old_top; + size_t psize = csp - old_top; + mchunkptr tn = chunk_plus_offset(q, psize); + set_free_with_pinuse(q, psize, tn); + insert_chunk(m, q, psize); + } + + check_top_chunk(m, m->top); +} + +/* -------------------------- System allocation -------------------------- */ + +/* Get memory from system using MORECORE or MMAP */ +static void* sys_alloc(mstate m, size_t nb) { + char* tbase = CMFAIL; + size_t tsize = 0; + flag_t mmap_flag = 0; + size_t asize; /* allocation size */ + + ensure_initialization(); + + /* Directly map large chunks, but only if already initialized */ + if (use_mmap(m) && nb >= mparams.mmap_threshold && m->topsize != 0) { + void* mem = mmap_alloc(m, nb); + if (mem != 0) + return mem; + } + + asize = granularity_align(nb + SYS_ALLOC_PADDING); + if (asize <= nb) + return 0; /* wraparound */ + if (m->footprint_limit != 0) { + size_t fp = m->footprint + asize; + if (fp <= m->footprint || fp > m->footprint_limit) + return 0; + } + + /* + Try getting memory in any of three ways (in most-preferred to + least-preferred order): + 1. A call to MORECORE that can normally contiguously extend memory. + (disabled if not MORECORE_CONTIGUOUS or not HAVE_MORECORE or + or main space is mmapped or a previous contiguous call failed) + 2. A call to MMAP new space (disabled if not HAVE_MMAP). + Note that under the default settings, if MORECORE is unable to + fulfill a request, and HAVE_MMAP is true, then mmap is + used as a noncontiguous system allocator. This is a useful backup + strategy for systems with holes in address spaces -- in this case + sbrk cannot contiguously expand the heap, but mmap may be able to + find space. + 3. A call to MORECORE that cannot usually contiguously extend memory. + (disabled if not HAVE_MORECORE) + + In all cases, we need to request enough bytes from system to ensure + we can malloc nb bytes upon success, so pad with enough space for + top_foot, plus alignment-pad to make sure we don't lose bytes if + not on boundary, and round this up to a granularity unit. + */ + + if (MORECORE_CONTIGUOUS && !use_noncontiguous(m)) { + char* br = CMFAIL; + msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top); + ACQUIRE_MALLOC_GLOBAL_LOCK(); + + if (ss == 0) { /* First time through or recovery */ + char* base = (char*)CALL_MORECORE(0); + if (base != CMFAIL) { + size_t fp; + /* Adjust to end on a page boundary */ + if (!is_page_aligned(base)) + asize += (page_align((size_t)base) - (size_t)base); + fp = m->footprint + asize; /* recheck limits */ + if (asize > nb && asize < HALF_MAX_SIZE_T && + (m->footprint_limit == 0 || + (fp > m->footprint && fp <= m->footprint_limit)) && + (br = (char*)(CALL_MORECORE(asize))) == base) { + tbase = base; + tsize = asize; + } + } + } + else { + /* Subtract out existing available top space from MORECORE request. */ + asize = granularity_align(nb - m->topsize + SYS_ALLOC_PADDING); + /* Use mem here only if it did continuously extend old space */ + if (asize < HALF_MAX_SIZE_T && + (br = (char*)(CALL_MORECORE(asize))) == ss->base+ss->size) { + tbase = br; + tsize = asize; + } + } + + if (tbase == CMFAIL) { /* Cope with partial failure */ + if (br != CMFAIL) { /* Try to use/extend the space we did get */ + if (asize < HALF_MAX_SIZE_T && + asize < nb + SYS_ALLOC_PADDING) { + size_t esize = granularity_align(nb + SYS_ALLOC_PADDING - asize); + if (esize < HALF_MAX_SIZE_T) { + char* end = (char*)CALL_MORECORE(esize); + if (end != CMFAIL) + asize += esize; + else { /* Can't use; try to release */ + (void) CALL_MORECORE(-asize); + br = CMFAIL; + } + } + } + } + if (br != CMFAIL) { /* Use the space we did get */ + tbase = br; + tsize = asize; + } + else + disable_contiguous(m); /* Don't try contiguous path in the future */ + } + + RELEASE_MALLOC_GLOBAL_LOCK(); + } + + if (HAVE_MMAP && tbase == CMFAIL) { /* Try MMAP */ + char* mp = (char*)(CALL_MMAP(asize)); + if (mp != CMFAIL) { + tbase = mp; + tsize = asize; + mmap_flag = USE_MMAP_BIT; + } + } + + if (HAVE_MORECORE && tbase == CMFAIL) { /* Try noncontiguous MORECORE */ + if (asize < HALF_MAX_SIZE_T) { + char* br = CMFAIL; + char* end = CMFAIL; + ACQUIRE_MALLOC_GLOBAL_LOCK(); + br = (char*)(CALL_MORECORE(asize)); + end = (char*)(CALL_MORECORE(0)); + RELEASE_MALLOC_GLOBAL_LOCK(); + if (br != CMFAIL && end != CMFAIL && br < end) { + size_t ssize = end - br; + if (ssize > nb + TOP_FOOT_SIZE) { + tbase = br; + tsize = ssize; + } + } + } + } + + if (tbase != CMFAIL) { + + if ((m->footprint += tsize) > m->max_footprint) + m->max_footprint = m->footprint; + + if (!is_initialized(m)) { /* first-time initialization */ + if (m->least_addr == 0 || tbase < m->least_addr) + m->least_addr = tbase; + m->seg.base = tbase; + m->seg.size = tsize; + m->seg.sflags = mmap_flag; + m->magic = mparams.magic; + m->release_checks = MAX_RELEASE_CHECK_RATE; + init_bins(m); +#if !ONLY_MSPACES + if (is_global(m)) + init_top(m, (mchunkptr)tbase, tsize - TOP_FOOT_SIZE); + else +#endif + { + /* Offset top by embedded malloc_state */ + mchunkptr mn = next_chunk(mem2chunk(m)); + init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) -TOP_FOOT_SIZE); + } + } + + else { + /* Try to merge with an existing segment */ + msegmentptr sp = &m->seg; + /* Only consider most recent segment if traversal suppressed */ + while (sp != 0 && tbase != sp->base + sp->size) + sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next; + if (sp != 0 && + !is_extern_segment(sp) && + (sp->sflags & USE_MMAP_BIT) == mmap_flag && + segment_holds(sp, m->top)) { /* append */ + sp->size += tsize; + init_top(m, m->top, m->topsize + tsize); + } + else { + if (tbase < m->least_addr) + m->least_addr = tbase; + sp = &m->seg; + while (sp != 0 && sp->base != tbase + tsize) + sp = (NO_SEGMENT_TRAVERSAL) ? 0 : sp->next; + if (sp != 0 && + !is_extern_segment(sp) && + (sp->sflags & USE_MMAP_BIT) == mmap_flag) { + char* oldbase = sp->base; + sp->base = tbase; + sp->size += tsize; + return prepend_alloc(m, tbase, oldbase, nb); + } + else + add_segment(m, tbase, tsize, mmap_flag); + } + } + + if (nb < m->topsize) { /* Allocate from new or extended top space */ + size_t rsize = m->topsize -= nb; + mchunkptr p = m->top; + mchunkptr r = m->top = chunk_plus_offset(p, nb); + r->head = rsize | PINUSE_BIT; + set_size_and_pinuse_of_inuse_chunk(m, p, nb); + check_top_chunk(m, m->top); + check_malloced_chunk(m, chunk2mem(p), nb); + return chunk2mem(p); + } + } + + MALLOC_FAILURE_ACTION; + return 0; +} + +/* ----------------------- system deallocation -------------------------- */ + +/* Unmap and unlink any mmapped segments that don't contain used chunks */ +static size_t release_unused_segments(mstate m) { + size_t released = 0; + int nsegs = 0; + msegmentptr pred = &m->seg; + msegmentptr sp = pred->next; + while (sp != 0) { + char* base = sp->base; + size_t size = sp->size; + msegmentptr next = sp->next; + ++nsegs; + if (is_mmapped_segment(sp) && !is_extern_segment(sp)) { + mchunkptr p = align_as_chunk(base); + size_t psize = chunksize(p); + /* Can unmap if first chunk holds entire segment and not pinned */ + if (!is_inuse(p) && (char*)p + psize >= base + size - TOP_FOOT_SIZE) { + tchunkptr tp = (tchunkptr)p; + assert(segment_holds(sp, (char*)sp)); + if (p == m->dv) { + m->dv = 0; + m->dvsize = 0; + } + else { + unlink_large_chunk(m, tp); + } + if (CALL_MUNMAP(base, size) == 0) { + released += size; + m->footprint -= size; + /* unlink obsoleted record */ + sp = pred; + sp->next = next; + } + else { /* back out if cannot unmap */ + insert_large_chunk(m, tp, psize); + } + } + } + if (NO_SEGMENT_TRAVERSAL) /* scan only first segment */ + break; + pred = sp; + sp = next; + } + /* Reset check counter */ + m->release_checks = ((nsegs > MAX_RELEASE_CHECK_RATE)? + nsegs : MAX_RELEASE_CHECK_RATE); + return released; +} + +static int sys_trim(mstate m, size_t pad) { + size_t released = 0; + ensure_initialization(); + if (pad < MAX_REQUEST && is_initialized(m)) { + pad += TOP_FOOT_SIZE; /* ensure enough room for segment overhead */ + + if (m->topsize > pad) { + /* Shrink top space in granularity-size units, keeping at least one */ + size_t unit = mparams.granularity; + size_t extra = ((m->topsize - pad + (unit - SIZE_T_ONE)) / unit - + SIZE_T_ONE) * unit; + msegmentptr sp = segment_holding(m, (char*)m->top); + + if (!is_extern_segment(sp)) { + if (is_mmapped_segment(sp)) { + if (HAVE_MMAP && + sp->size >= extra && + !has_segment_link(m, sp)) { /* can't shrink if pinned */ + size_t newsize = sp->size - extra; + /* Prefer mremap, fall back to munmap */ + if ((CALL_MREMAP(sp->base, sp->size, newsize, 0) != MFAIL) || + (CALL_MUNMAP(sp->base + newsize, extra) == 0)) { + released = extra; + } + } + } + else if (HAVE_MORECORE) { + if (extra >= HALF_MAX_SIZE_T) /* Avoid wrapping negative */ + extra = (HALF_MAX_SIZE_T) + SIZE_T_ONE - unit; + ACQUIRE_MALLOC_GLOBAL_LOCK(); + { + /* Make sure end of memory is where we last set it. */ + char* old_br = (char*)(CALL_MORECORE(0)); + if (old_br == sp->base + sp->size) { + char* rel_br = (char*)(CALL_MORECORE(-extra)); + char* new_br = (char*)(CALL_MORECORE(0)); + if (rel_br != CMFAIL && new_br < old_br) + released = old_br - new_br; + } + } + RELEASE_MALLOC_GLOBAL_LOCK(); + } + } + + if (released != 0) { + sp->size -= released; + m->footprint -= released; + init_top(m, m->top, m->topsize - released); + check_top_chunk(m, m->top); + } + } + + /* Unmap any unused mmapped segments */ + if (HAVE_MMAP) + released += release_unused_segments(m); + + /* On failure, disable autotrim to avoid repeated failed future calls */ + if (released == 0 && m->topsize > m->trim_check) + m->trim_check = MAX_SIZE_T; + } + + return (released != 0)? 1 : 0; +} + +/* Consolidate and bin a chunk. Differs from exported versions + of free mainly in that the chunk need not be marked as inuse. +*/ +static void dispose_chunk(mstate m, mchunkptr p, size_t psize) { + mchunkptr next = chunk_plus_offset(p, psize); + if (!pinuse(p)) { + mchunkptr prev; + size_t prevsize = p->prev_foot; + if (is_mmapped(p)) { + psize += prevsize + MMAP_FOOT_PAD; + if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) + m->footprint -= psize; + return; + } + prev = chunk_minus_offset(p, prevsize); + psize += prevsize; + p = prev; + if (RTCHECK(ok_address(m, prev))) { /* consolidate backward */ + if (p != m->dv) { + unlink_chunk(m, p, prevsize); + } + else if ((next->head & INUSE_BITS) == INUSE_BITS) { + m->dvsize = psize; + set_free_with_pinuse(p, psize, next); + return; + } + } + else { + CORRUPTION_ERROR_ACTION(m); + return; + } + } + if (RTCHECK(ok_address(m, next))) { + if (!cinuse(next)) { /* consolidate forward */ + if (next == m->top) { + size_t tsize = m->topsize += psize; + m->top = p; + p->head = tsize | PINUSE_BIT; + if (p == m->dv) { + m->dv = 0; + m->dvsize = 0; + } + return; + } + else if (next == m->dv) { + size_t dsize = m->dvsize += psize; + m->dv = p; + set_size_and_pinuse_of_free_chunk(p, dsize); + return; + } + else { + size_t nsize = chunksize(next); + psize += nsize; + unlink_chunk(m, next, nsize); + set_size_and_pinuse_of_free_chunk(p, psize); + if (p == m->dv) { + m->dvsize = psize; + return; + } + } + } + else { + set_free_with_pinuse(p, psize, next); + } + insert_chunk(m, p, psize); + } + else { + CORRUPTION_ERROR_ACTION(m); + } +} + +/* ---------------------------- malloc --------------------------- */ + +/* allocate a large request from the best fitting chunk in a treebin */ +static void* tmalloc_large(mstate m, size_t nb) { + tchunkptr v = 0; + size_t rsize = -nb; /* Unsigned negation */ + tchunkptr t; + bindex_t idx; + compute_tree_index(nb, idx); + if ((t = *treebin_at(m, idx)) != 0) { + /* Traverse tree for this bin looking for node with size == nb */ + size_t sizebits = nb << leftshift_for_tree_index(idx); + tchunkptr rst = 0; /* The deepest untaken right subtree */ + for (;;) { + tchunkptr rt; + size_t trem = chunksize(t) - nb; + if (trem < rsize) { + v = t; + if ((rsize = trem) == 0) + break; + } + rt = t->child[1]; + t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; + if (rt != 0 && rt != t) + rst = rt; + if (t == 0) { + t = rst; /* set t to least subtree holding sizes > nb */ + break; + } + sizebits <<= 1; + } + } + if (t == 0 && v == 0) { /* set t to root of next non-empty treebin */ + binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; + if (leftbits != 0) { + bindex_t i; + binmap_t leastbit = least_bit(leftbits); + compute_bit2idx(leastbit, i); + t = *treebin_at(m, i); + } + } + + while (t != 0) { /* find smallest of tree or subtree */ + size_t trem = chunksize(t) - nb; + if (trem < rsize) { + rsize = trem; + v = t; + } + t = leftmost_child(t); + } + + /* If dv is a better fit, return 0 so malloc will use it */ + if (v != 0 && rsize < (size_t)(m->dvsize - nb)) { + if (RTCHECK(ok_address(m, v))) { /* split */ + mchunkptr r = chunk_plus_offset(v, nb); + assert(chunksize(v) == rsize + nb); + if (RTCHECK(ok_next(v, r))) { + unlink_large_chunk(m, v); + if (rsize < MIN_CHUNK_SIZE) + set_inuse_and_pinuse(m, v, (rsize + nb)); + else { + set_size_and_pinuse_of_inuse_chunk(m, v, nb); + set_size_and_pinuse_of_free_chunk(r, rsize); + insert_chunk(m, r, rsize); + } + return chunk2mem(v); + } + } + CORRUPTION_ERROR_ACTION(m); + } + return 0; +} + +/* allocate a small request from the best fitting chunk in a treebin */ +static void* tmalloc_small(mstate m, size_t nb) { + tchunkptr t, v; + size_t rsize; + bindex_t i; + binmap_t leastbit = least_bit(m->treemap); + compute_bit2idx(leastbit, i); + v = t = *treebin_at(m, i); + rsize = chunksize(t) - nb; + + while ((t = leftmost_child(t)) != 0) { + size_t trem = chunksize(t) - nb; + if (trem < rsize) { + rsize = trem; + v = t; + } + } + + if (RTCHECK(ok_address(m, v))) { + mchunkptr r = chunk_plus_offset(v, nb); + assert(chunksize(v) == rsize + nb); + if (RTCHECK(ok_next(v, r))) { + unlink_large_chunk(m, v); + if (rsize < MIN_CHUNK_SIZE) + set_inuse_and_pinuse(m, v, (rsize + nb)); + else { + set_size_and_pinuse_of_inuse_chunk(m, v, nb); + set_size_and_pinuse_of_free_chunk(r, rsize); + replace_dv(m, r, rsize); + } + return chunk2mem(v); + } + } + + CORRUPTION_ERROR_ACTION(m); + return 0; +} + +#if !ONLY_MSPACES + +void* dlmalloc(size_t bytes) { + /* + Basic algorithm: + If a small request (< 256 bytes minus per-chunk overhead): + 1. If one exists, use a remainderless chunk in associated smallbin. + (Remainderless means that there are too few excess bytes to + represent as a chunk.) + 2. If it is big enough, use the dv chunk, which is normally the + chunk adjacent to the one used for the most recent small request. + 3. If one exists, split the smallest available chunk in a bin, + saving remainder in dv. + 4. If it is big enough, use the top chunk. + 5. If available, get memory from system and use it + Otherwise, for a large request: + 1. Find the smallest available binned chunk that fits, and use it + if it is better fitting than dv chunk, splitting if necessary. + 2. If better fitting than any binned chunk, use the dv chunk. + 3. If it is big enough, use the top chunk. + 4. If request size >= mmap threshold, try to directly mmap this chunk. + 5. If available, get memory from system and use it + + The ugly goto's here ensure that postaction occurs along all paths. + */ + +#if USE_LOCKS + ensure_initialization(); /* initialize in sys_alloc if not using locks */ +#endif + + if (!PREACTION(gm)) { + void* mem; + size_t nb; + if (bytes <= MAX_SMALL_REQUEST) { + bindex_t idx; + binmap_t smallbits; + nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); + idx = small_index(nb); + smallbits = gm->smallmap >> idx; + + if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ + mchunkptr b, p; + idx += ~smallbits & 1; /* Uses next bin if idx empty */ + b = smallbin_at(gm, idx); + p = b->fd; + assert(chunksize(p) == small_index2size(idx)); + unlink_first_small_chunk(gm, b, p, idx); + set_inuse_and_pinuse(gm, p, small_index2size(idx)); + mem = chunk2mem(p); + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + + else if (nb > gm->dvsize) { + if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ + mchunkptr b, p, r; + size_t rsize; + bindex_t i; + binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); + binmap_t leastbit = least_bit(leftbits); + compute_bit2idx(leastbit, i); + b = smallbin_at(gm, i); + p = b->fd; + assert(chunksize(p) == small_index2size(i)); + unlink_first_small_chunk(gm, b, p, i); + rsize = small_index2size(i) - nb; + /* Fit here cannot be remainderless if 4byte sizes */ + if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) + set_inuse_and_pinuse(gm, p, small_index2size(i)); + else { + set_size_and_pinuse_of_inuse_chunk(gm, p, nb); + r = chunk_plus_offset(p, nb); + set_size_and_pinuse_of_free_chunk(r, rsize); + replace_dv(gm, r, rsize); + } + mem = chunk2mem(p); + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + + else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + } + } + else if (bytes >= MAX_REQUEST) + nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ + else { + nb = pad_request(bytes); + if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + } + + if (nb <= gm->dvsize) { + size_t rsize = gm->dvsize - nb; + mchunkptr p = gm->dv; + if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ + mchunkptr r = gm->dv = chunk_plus_offset(p, nb); + gm->dvsize = rsize; + set_size_and_pinuse_of_free_chunk(r, rsize); + set_size_and_pinuse_of_inuse_chunk(gm, p, nb); + } + else { /* exhaust dv */ + size_t dvs = gm->dvsize; + gm->dvsize = 0; + gm->dv = 0; + set_inuse_and_pinuse(gm, p, dvs); + } + mem = chunk2mem(p); + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + + else if (nb < gm->topsize) { /* Split top */ + size_t rsize = gm->topsize -= nb; + mchunkptr p = gm->top; + mchunkptr r = gm->top = chunk_plus_offset(p, nb); + r->head = rsize | PINUSE_BIT; + set_size_and_pinuse_of_inuse_chunk(gm, p, nb); + mem = chunk2mem(p); + check_top_chunk(gm, gm->top); + check_malloced_chunk(gm, mem, nb); + goto postaction; + } + + mem = sys_alloc(gm, nb); + + postaction: + POSTACTION(gm); + return mem; + } + + return 0; +} + +/* ---------------------------- free --------------------------- */ + +void dlfree(void* mem) { + /* + Consolidate freed chunks with preceeding or succeeding bordering + free chunks, if they exist, and then place in a bin. Intermixed + with special cases for top, dv, mmapped chunks, and usage errors. + */ + + if (mem != 0) { + mchunkptr p = mem2chunk(mem); +#if FOOTERS + mstate fm = get_mstate_for(p); + if (!ok_magic(fm)) { + USAGE_ERROR_ACTION(fm, p); + return; + } +#else /* FOOTERS */ +#define fm gm +#endif /* FOOTERS */ + if (!PREACTION(fm)) { + check_inuse_chunk(fm, p); + if (RTCHECK(ok_address(fm, p) && ok_inuse(p))) { + size_t psize = chunksize(p); + mchunkptr next = chunk_plus_offset(p, psize); + if (!pinuse(p)) { + size_t prevsize = p->prev_foot; + if (is_mmapped(p)) { + psize += prevsize + MMAP_FOOT_PAD; + if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) + fm->footprint -= psize; + goto postaction; + } + else { + mchunkptr prev = chunk_minus_offset(p, prevsize); + psize += prevsize; + p = prev; + if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ + if (p != fm->dv) { + unlink_chunk(fm, p, prevsize); + } + else if ((next->head & INUSE_BITS) == INUSE_BITS) { + fm->dvsize = psize; + set_free_with_pinuse(p, psize, next); + goto postaction; + } + } + else + goto erroraction; + } + } + + if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { + if (!cinuse(next)) { /* consolidate forward */ + if (next == fm->top) { + size_t tsize = fm->topsize += psize; + fm->top = p; + p->head = tsize | PINUSE_BIT; + if (p == fm->dv) { + fm->dv = 0; + fm->dvsize = 0; + } + if (should_trim(fm, tsize)) + sys_trim(fm, 0); + goto postaction; + } + else if (next == fm->dv) { + size_t dsize = fm->dvsize += psize; + fm->dv = p; + set_size_and_pinuse_of_free_chunk(p, dsize); + goto postaction; + } + else { + size_t nsize = chunksize(next); + psize += nsize; + unlink_chunk(fm, next, nsize); + set_size_and_pinuse_of_free_chunk(p, psize); + if (p == fm->dv) { + fm->dvsize = psize; + goto postaction; + } + } + } + else + set_free_with_pinuse(p, psize, next); + + if (is_small(psize)) { + insert_small_chunk(fm, p, psize); + check_free_chunk(fm, p); + } + else { + tchunkptr tp = (tchunkptr)p; + insert_large_chunk(fm, tp, psize); + check_free_chunk(fm, p); + if (--fm->release_checks == 0) + release_unused_segments(fm); + } + goto postaction; + } + } + erroraction: + USAGE_ERROR_ACTION(fm, p); + postaction: + POSTACTION(fm); + } + } +#if !FOOTERS +#undef fm +#endif /* FOOTERS */ +} + +void* dlcalloc(size_t n_elements, size_t elem_size) { + void* mem; + size_t req = 0; + if (n_elements != 0) { + req = n_elements * elem_size; + if (((n_elements | elem_size) & ~(size_t)0xffff) && + (req / n_elements != elem_size)) + req = MAX_SIZE_T; /* force downstream failure on overflow */ + } + mem = dlmalloc(req); + if (mem != 0 && calloc_must_clear(mem2chunk(mem))) + memset(mem, 0, req); + return mem; +} + +#endif /* !ONLY_MSPACES */ + +/* ------------ Internal support for realloc, memalign, etc -------------- */ + +/* Try to realloc; only in-place unless can_move true */ +static mchunkptr try_realloc_chunk(mstate m, mchunkptr p, size_t nb, + int can_move) { + mchunkptr newp = 0; + size_t oldsize = chunksize(p); + mchunkptr next = chunk_plus_offset(p, oldsize); + if (RTCHECK(ok_address(m, p) && ok_inuse(p) && + ok_next(p, next) && ok_pinuse(next))) { + if (is_mmapped(p)) { + newp = mmap_resize(m, p, nb, can_move); + } + else if (oldsize >= nb) { /* already big enough */ + size_t rsize = oldsize - nb; + if (rsize >= MIN_CHUNK_SIZE) { /* split off remainder */ + mchunkptr r = chunk_plus_offset(p, nb); + set_inuse(m, p, nb); + set_inuse(m, r, rsize); + dispose_chunk(m, r, rsize); + } + newp = p; + } + else if (next == m->top) { /* extend into top */ + if (oldsize + m->topsize > nb) { + size_t newsize = oldsize + m->topsize; + size_t newtopsize = newsize - nb; + mchunkptr newtop = chunk_plus_offset(p, nb); + set_inuse(m, p, nb); + newtop->head = newtopsize |PINUSE_BIT; + m->top = newtop; + m->topsize = newtopsize; + newp = p; + } + } + else if (next == m->dv) { /* extend into dv */ + size_t dvs = m->dvsize; + if (oldsize + dvs >= nb) { + size_t dsize = oldsize + dvs - nb; + if (dsize >= MIN_CHUNK_SIZE) { + mchunkptr r = chunk_plus_offset(p, nb); + mchunkptr n = chunk_plus_offset(r, dsize); + set_inuse(m, p, nb); + set_size_and_pinuse_of_free_chunk(r, dsize); + clear_pinuse(n); + m->dvsize = dsize; + m->dv = r; + } + else { /* exhaust dv */ + size_t newsize = oldsize + dvs; + set_inuse(m, p, newsize); + m->dvsize = 0; + m->dv = 0; + } + newp = p; + } + } + else if (!cinuse(next)) { /* extend into next free chunk */ + size_t nextsize = chunksize(next); + if (oldsize + nextsize >= nb) { + size_t rsize = oldsize + nextsize - nb; + unlink_chunk(m, next, nextsize); + if (rsize < MIN_CHUNK_SIZE) { + size_t newsize = oldsize + nextsize; + set_inuse(m, p, newsize); + } + else { + mchunkptr r = chunk_plus_offset(p, nb); + set_inuse(m, p, nb); + set_inuse(m, r, rsize); + dispose_chunk(m, r, rsize); + } + newp = p; + } + } + } + else { + USAGE_ERROR_ACTION(m, oldmem); + } + return newp; +} + +static void* internal_memalign(mstate m, size_t alignment, size_t bytes) { + void* mem = 0; + if (alignment < MIN_CHUNK_SIZE) /* must be at least a minimum chunk size */ + alignment = MIN_CHUNK_SIZE; + if ((alignment & (alignment-SIZE_T_ONE)) != 0) {/* Ensure a power of 2 */ + size_t a = MALLOC_ALIGNMENT << 1; + while (a < alignment) a <<= 1; + alignment = a; + } + if (bytes >= MAX_REQUEST - alignment) { + if (m != 0) { /* Test isn't needed but avoids compiler warning */ + MALLOC_FAILURE_ACTION; + } + } + else { + size_t nb = request2size(bytes); + size_t req = nb + alignment + MIN_CHUNK_SIZE - CHUNK_OVERHEAD; + mem = internal_malloc(m, req); + if (mem != 0) { + mchunkptr p = mem2chunk(mem); + if (PREACTION(m)) + return 0; + if ((((size_t)(mem)) & (alignment - 1)) != 0) { /* misaligned */ + /* + Find an aligned spot inside chunk. Since we need to give + back leading space in a chunk of at least MIN_CHUNK_SIZE, if + the first calculation places us at a spot with less than + MIN_CHUNK_SIZE leader, we can move to the next aligned spot. + We've allocated enough total room so that this is always + possible. + */ + char* br = (char*)mem2chunk((size_t)(((size_t)((char*)mem + alignment - + SIZE_T_ONE)) & + -alignment)); + char* pos = ((size_t)(br - (char*)(p)) >= MIN_CHUNK_SIZE)? + br : br+alignment; + mchunkptr newp = (mchunkptr)pos; + size_t leadsize = pos - (char*)(p); + size_t newsize = chunksize(p) - leadsize; + + if (is_mmapped(p)) { /* For mmapped chunks, just adjust offset */ + newp->prev_foot = p->prev_foot + leadsize; + newp->head = newsize; + } + else { /* Otherwise, give back leader, use the rest */ + set_inuse(m, newp, newsize); + set_inuse(m, p, leadsize); + dispose_chunk(m, p, leadsize); + } + p = newp; + } + + /* Give back spare room at the end */ + if (!is_mmapped(p)) { + size_t size = chunksize(p); + if (size > nb + MIN_CHUNK_SIZE) { + size_t remainder_size = size - nb; + mchunkptr remainder = chunk_plus_offset(p, nb); + set_inuse(m, p, nb); + set_inuse(m, remainder, remainder_size); + dispose_chunk(m, remainder, remainder_size); + } + } + + mem = chunk2mem(p); + assert (chunksize(p) >= nb); + assert(((size_t)mem & (alignment - 1)) == 0); + check_inuse_chunk(m, p); + POSTACTION(m); + } + } + return mem; +} + +/* + Common support for independent_X routines, handling + all of the combinations that can result. + The opts arg has: + bit 0 set if all elements are same size (using sizes[0]) + bit 1 set if elements should be zeroed +*/ +static void** ialloc(mstate m, + size_t n_elements, + size_t* sizes, + int opts, + void* chunks[]) { + + size_t element_size; /* chunksize of each element, if all same */ + size_t contents_size; /* total size of elements */ + size_t array_size; /* request size of pointer array */ + void* mem; /* malloced aggregate space */ + mchunkptr p; /* corresponding chunk */ + size_t remainder_size; /* remaining bytes while splitting */ + void** marray; /* either "chunks" or malloced ptr array */ + mchunkptr array_chunk; /* chunk for malloced ptr array */ + flag_t was_enabled; /* to disable mmap */ + size_t size; + size_t i; + + ensure_initialization(); + /* compute array length, if needed */ + if (chunks != 0) { + if (n_elements == 0) + return chunks; /* nothing to do */ + marray = chunks; + array_size = 0; + } + else { + /* if empty req, must still return chunk representing empty array */ + if (n_elements == 0) + return (void**)internal_malloc(m, 0); + marray = 0; + array_size = request2size(n_elements * (sizeof(void*))); + } + + /* compute total element size */ + if (opts & 0x1) { /* all-same-size */ + element_size = request2size(*sizes); + contents_size = n_elements * element_size; + } + else { /* add up all the sizes */ + element_size = 0; + contents_size = 0; + for (i = 0; i != n_elements; ++i) + contents_size += request2size(sizes[i]); + } + + size = contents_size + array_size; + + /* + Allocate the aggregate chunk. First disable direct-mmapping so + malloc won't use it, since we would not be able to later + free/realloc space internal to a segregated mmap region. + */ + was_enabled = use_mmap(m); + disable_mmap(m); + mem = internal_malloc(m, size - CHUNK_OVERHEAD); + if (was_enabled) + enable_mmap(m); + if (mem == 0) + return 0; + + if (PREACTION(m)) return 0; + p = mem2chunk(mem); + remainder_size = chunksize(p); + + assert(!is_mmapped(p)); + + if (opts & 0x2) { /* optionally clear the elements */ + memset((size_t*)mem, 0, remainder_size - SIZE_T_SIZE - array_size); + } + + /* If not provided, allocate the pointer array as final part of chunk */ + if (marray == 0) { + size_t array_chunk_size; + array_chunk = chunk_plus_offset(p, contents_size); + array_chunk_size = remainder_size - contents_size; + marray = (void**) (chunk2mem(array_chunk)); + set_size_and_pinuse_of_inuse_chunk(m, array_chunk, array_chunk_size); + remainder_size = contents_size; + } + + /* split out elements */ + for (i = 0; ; ++i) { + marray[i] = chunk2mem(p); + if (i != n_elements-1) { + if (element_size != 0) + size = element_size; + else + size = request2size(sizes[i]); + remainder_size -= size; + set_size_and_pinuse_of_inuse_chunk(m, p, size); + p = chunk_plus_offset(p, size); + } + else { /* the final element absorbs any overallocation slop */ + set_size_and_pinuse_of_inuse_chunk(m, p, remainder_size); + break; + } + } + +#if DEBUG + if (marray != chunks) { + /* final element must have exactly exhausted chunk */ + if (element_size != 0) { + assert(remainder_size == element_size); + } + else { + assert(remainder_size == request2size(sizes[i])); + } + check_inuse_chunk(m, mem2chunk(marray)); + } + for (i = 0; i != n_elements; ++i) + check_inuse_chunk(m, mem2chunk(marray[i])); + +#endif /* DEBUG */ + + POSTACTION(m); + return marray; +} + +/* Try to free all pointers in the given array. + Note: this could be made faster, by delaying consolidation, + at the price of disabling some user integrity checks, We + still optimize some consolidations by combining adjacent + chunks before freeing, which will occur often if allocated + with ialloc or the array is sorted. +*/ +static size_t internal_bulk_free(mstate m, void* array[], size_t nelem) { + size_t unfreed = 0; + if (!PREACTION(m)) { + void** a; + void** fence = &(array[nelem]); + for (a = array; a != fence; ++a) { + void* mem = *a; + if (mem != 0) { + mchunkptr p = mem2chunk(mem); + size_t psize = chunksize(p); +#if FOOTERS + if (get_mstate_for(p) != m) { + ++unfreed; + continue; + } +#endif + check_inuse_chunk(m, p); + *a = 0; + if (RTCHECK(ok_address(m, p) && ok_inuse(p))) { + void ** b = a + 1; /* try to merge with next chunk */ + mchunkptr next = next_chunk(p); + if (b != fence && *b == chunk2mem(next)) { + size_t newsize = chunksize(next) + psize; + set_inuse(m, p, newsize); + *b = chunk2mem(p); + } + else + dispose_chunk(m, p, psize); + } + else { + CORRUPTION_ERROR_ACTION(m); + break; + } + } + } + if (should_trim(m, m->topsize)) + sys_trim(m, 0); + POSTACTION(m); + } + return unfreed; +} + +/* Traversal */ +#if MALLOC_INSPECT_ALL +static void internal_inspect_all(mstate m, + void(*handler)(void *start, + void *end, + size_t used_bytes, + void* callback_arg), + void* arg) { + if (is_initialized(m)) { + mchunkptr top = m->top; + msegmentptr s; + for (s = &m->seg; s != 0; s = s->next) { + mchunkptr q = align_as_chunk(s->base); + while (segment_holds(s, q) && q->head != FENCEPOST_HEAD) { + mchunkptr next = next_chunk(q); + size_t sz = chunksize(q); + size_t used; + void* start; + if (is_inuse(q)) { + used = sz - CHUNK_OVERHEAD; /* must not be mmapped */ + start = chunk2mem(q); + } + else { + used = 0; + if (is_small(sz)) { /* offset by possible bookkeeping */ + start = (void*)((char*)q + sizeof(malloc_chunk)); + } + else { + start = (void*)((char*)q + sizeof(malloc_tree_chunk)); + } + } + if (start < (void*)next) /* skip if all space is bookkeeping */ + handler(start, next, used, arg); + if (q == top) + break; + q = next; + } + } + } +} +#endif /* MALLOC_INSPECT_ALL */ + +/* ------------------ Exported realloc, memalign, etc -------------------- */ + +#if !ONLY_MSPACES + +void* dlrealloc(void* oldmem, size_t bytes) { + void* mem = 0; + if (oldmem == 0) { + mem = dlmalloc(bytes); + } + else if (bytes >= MAX_REQUEST) { + MALLOC_FAILURE_ACTION; + } +#ifdef REALLOC_ZERO_BYTES_FREES + else if (bytes == 0) { + dlfree(oldmem); + } +#endif /* REALLOC_ZERO_BYTES_FREES */ + else { + size_t nb = request2size(bytes); + mchunkptr oldp = mem2chunk(oldmem); +#if ! FOOTERS + mstate m = gm; +#else /* FOOTERS */ + mstate m = get_mstate_for(oldp); + if (!ok_magic(m)) { + USAGE_ERROR_ACTION(m, oldmem); + return 0; + } +#endif /* FOOTERS */ + if (!PREACTION(m)) { + mchunkptr newp = try_realloc_chunk(m, oldp, nb, 1); + POSTACTION(m); + if (newp != 0) { + check_inuse_chunk(m, newp); + mem = chunk2mem(newp); + } + else { + mem = internal_malloc(m, bytes); + if (mem != 0) { + size_t oc = chunksize(oldp) - overhead_for(oldp); + memcpy(mem, oldmem, (oc < bytes)? oc : bytes); + internal_free(m, oldmem); + } + } + } + } + return mem; +} + +void* dlrealloc_in_place(void* oldmem, size_t bytes) { + void* mem = 0; + if (oldmem != 0) { + if (bytes >= MAX_REQUEST) { + MALLOC_FAILURE_ACTION; + } + else { + size_t nb = request2size(bytes); + mchunkptr oldp = mem2chunk(oldmem); +#if ! FOOTERS + mstate m = gm; +#else /* FOOTERS */ + mstate m = get_mstate_for(oldp); + if (!ok_magic(m)) { + USAGE_ERROR_ACTION(m, oldmem); + return 0; + } +#endif /* FOOTERS */ + if (!PREACTION(m)) { + mchunkptr newp = try_realloc_chunk(m, oldp, nb, 0); + POSTACTION(m); + if (newp == oldp) { + check_inuse_chunk(m, newp); + mem = oldmem; + } + } + } + } + return mem; +} + +void* dlmemalign(size_t alignment, size_t bytes) { + if (alignment <= MALLOC_ALIGNMENT) { + return dlmalloc(bytes); + } + return internal_memalign(gm, alignment, bytes); +} + +int dlposix_memalign(void** pp, size_t alignment, size_t bytes) { + void* mem = 0; + if (alignment == MALLOC_ALIGNMENT) + mem = dlmalloc(bytes); + else { + size_t d = alignment / sizeof(void*); + size_t r = alignment % sizeof(void*); + if (r != 0 || d == 0 || (d & (d-SIZE_T_ONE)) != 0) + return EINVAL; + else if (bytes >= MAX_REQUEST - alignment) { + if (alignment < MIN_CHUNK_SIZE) + alignment = MIN_CHUNK_SIZE; + mem = internal_memalign(gm, alignment, bytes); + } + } + if (mem == 0) + return ENOMEM; + else { + *pp = mem; + return 0; + } +} + +void* dlvalloc(size_t bytes) { + size_t pagesz; + ensure_initialization(); + pagesz = mparams.page_size; + return dlmemalign(pagesz, bytes); +} + +void* dlpvalloc(size_t bytes) { + size_t pagesz; + ensure_initialization(); + pagesz = mparams.page_size; + return dlmemalign(pagesz, (bytes + pagesz - SIZE_T_ONE) & ~(pagesz - SIZE_T_ONE)); +} + +void** dlindependent_calloc(size_t n_elements, size_t elem_size, + void* chunks[]) { + size_t sz = elem_size; /* serves as 1-element array */ + return ialloc(gm, n_elements, &sz, 3, chunks); +} + +void** dlindependent_comalloc(size_t n_elements, size_t sizes[], + void* chunks[]) { + return ialloc(gm, n_elements, sizes, 0, chunks); +} + +size_t dlbulk_free(void* array[], size_t nelem) { + return internal_bulk_free(gm, array, nelem); +} + +#if MALLOC_INSPECT_ALL +void dlmalloc_inspect_all(void(*handler)(void *start, + void *end, + size_t used_bytes, + void* callback_arg), + void* arg) { + ensure_initialization(); + if (!PREACTION(gm)) { + internal_inspect_all(gm, handler, arg); + POSTACTION(gm); + } +} +#endif /* MALLOC_INSPECT_ALL */ + +int dlmalloc_trim(size_t pad) { + int result = 0; + ensure_initialization(); + if (!PREACTION(gm)) { + result = sys_trim(gm, pad); + POSTACTION(gm); + } + return result; +} + +size_t dlmalloc_footprint(void) { + return gm->footprint; +} + +size_t dlmalloc_max_footprint(void) { + return gm->max_footprint; +} + +size_t dlmalloc_footprint_limit(void) { + size_t maf = gm->footprint_limit; + return maf == 0 ? MAX_SIZE_T : maf; +} + +size_t dlmalloc_set_footprint_limit(size_t bytes) { + size_t result; /* invert sense of 0 */ + if (bytes == 0) + result = granularity_align(1); /* Use minimal size */ + if (bytes == MAX_SIZE_T) + result = 0; /* disable */ + else + result = granularity_align(bytes); + return gm->footprint_limit = result; +} + +#if !NO_MALLINFO +struct mallinfo dlmallinfo(void) { + return internal_mallinfo(gm); +} +#endif /* NO_MALLINFO */ + +#if !NO_MALLOC_STATS +void dlmalloc_stats() { + internal_malloc_stats(gm); +} +#endif /* NO_MALLOC_STATS */ + +int dlmallopt(int param_number, int value) { + return change_mparam(param_number, value); +} + +size_t dlmalloc_usable_size(void* mem) { + if (mem != 0) { + mchunkptr p = mem2chunk(mem); + if (is_inuse(p)) + return chunksize(p) - overhead_for(p); + } + return 0; +} + +#endif /* !ONLY_MSPACES */ + +/* ----------------------------- user mspaces ---------------------------- */ + +#if MSPACES + +static mstate init_user_mstate(char* tbase, size_t tsize) { + size_t msize = pad_request(sizeof(struct malloc_state)); + mchunkptr mn; + mchunkptr msp = align_as_chunk(tbase); + mstate m = (mstate)(chunk2mem(msp)); + memset(m, 0, msize); + (void)INITIAL_LOCK(&m->mutex); + msp->head = (msize|INUSE_BITS); + m->seg.base = m->least_addr = tbase; + m->seg.size = m->footprint = m->max_footprint = tsize; + m->magic = mparams.magic; + m->release_checks = MAX_RELEASE_CHECK_RATE; + m->mflags = mparams.default_mflags; + m->extp = 0; + m->exts = 0; + disable_contiguous(m); + init_bins(m); + mn = next_chunk(mem2chunk(m)); + init_top(m, mn, (size_t)((tbase + tsize) - (char*)mn) - TOP_FOOT_SIZE); + check_top_chunk(m, m->top); + return m; +} + +mspace create_mspace(size_t capacity, int locked) { + mstate m = 0; + size_t msize; + ensure_initialization(); + msize = pad_request(sizeof(struct malloc_state)); + if (capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { + size_t rs = ((capacity == 0)? mparams.granularity : + (capacity + TOP_FOOT_SIZE + msize)); + size_t tsize = granularity_align(rs); + char* tbase = (char*)(CALL_MMAP(tsize)); + if (tbase != CMFAIL) { + m = init_user_mstate(tbase, tsize); + m->seg.sflags = USE_MMAP_BIT; + set_lock(m, locked); + } + } + return (mspace)m; +} + +mspace create_mspace_with_base(void* base, size_t capacity, int locked) { + mstate m = 0; + size_t msize; + ensure_initialization(); + msize = pad_request(sizeof(struct malloc_state)); + if (capacity > msize + TOP_FOOT_SIZE && + capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { + m = init_user_mstate((char*)base, capacity); + m->seg.sflags = EXTERN_BIT; + set_lock(m, locked); + } + return (mspace)m; +} + +int mspace_track_large_chunks(mspace msp, int enable) { + int ret = 0; + mstate ms = (mstate)msp; + if (!PREACTION(ms)) { + if (!use_mmap(ms)) + ret = 1; + if (!enable) + enable_mmap(ms); + else + disable_mmap(ms); + POSTACTION(ms); + } + return ret; +} + +size_t destroy_mspace(mspace msp) { + size_t freed = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + msegmentptr sp = &ms->seg; + (void)DESTROY_LOCK(&ms->mutex); /* destroy before unmapped */ + while (sp != 0) { + char* base = sp->base; + size_t size = sp->size; + flag_t flag = sp->sflags; + sp = sp->next; + if ((flag & USE_MMAP_BIT) && !(flag & EXTERN_BIT) && + CALL_MUNMAP(base, size) == 0) + freed += size; + } + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return freed; +} + +/* + mspace versions of routines are near-clones of the global + versions. This is not so nice but better than the alternatives. +*/ + +void* mspace_malloc(mspace msp, size_t bytes) { + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + return 0; + } + if (!PREACTION(ms)) { + void* mem; + size_t nb; + if (bytes <= MAX_SMALL_REQUEST) { + bindex_t idx; + binmap_t smallbits; + nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes); + idx = small_index(nb); + smallbits = ms->smallmap >> idx; + + if ((smallbits & 0x3U) != 0) { /* Remainderless fit to a smallbin. */ + mchunkptr b, p; + idx += ~smallbits & 1; /* Uses next bin if idx empty */ + b = smallbin_at(ms, idx); + p = b->fd; + assert(chunksize(p) == small_index2size(idx)); + unlink_first_small_chunk(ms, b, p, idx); + set_inuse_and_pinuse(ms, p, small_index2size(idx)); + mem = chunk2mem(p); + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + + else if (nb > ms->dvsize) { + if (smallbits != 0) { /* Use chunk in next nonempty smallbin */ + mchunkptr b, p, r; + size_t rsize; + bindex_t i; + binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); + binmap_t leastbit = least_bit(leftbits); + compute_bit2idx(leastbit, i); + b = smallbin_at(ms, i); + p = b->fd; + assert(chunksize(p) == small_index2size(i)); + unlink_first_small_chunk(ms, b, p, i); + rsize = small_index2size(i) - nb; + /* Fit here cannot be remainderless if 4byte sizes */ + if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE) + set_inuse_and_pinuse(ms, p, small_index2size(i)); + else { + set_size_and_pinuse_of_inuse_chunk(ms, p, nb); + r = chunk_plus_offset(p, nb); + set_size_and_pinuse_of_free_chunk(r, rsize); + replace_dv(ms, r, rsize); + } + mem = chunk2mem(p); + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + + else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + } + } + else if (bytes >= MAX_REQUEST) + nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */ + else { + nb = pad_request(bytes); + if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) { + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + } + + if (nb <= ms->dvsize) { + size_t rsize = ms->dvsize - nb; + mchunkptr p = ms->dv; + if (rsize >= MIN_CHUNK_SIZE) { /* split dv */ + mchunkptr r = ms->dv = chunk_plus_offset(p, nb); + ms->dvsize = rsize; + set_size_and_pinuse_of_free_chunk(r, rsize); + set_size_and_pinuse_of_inuse_chunk(ms, p, nb); + } + else { /* exhaust dv */ + size_t dvs = ms->dvsize; + ms->dvsize = 0; + ms->dv = 0; + set_inuse_and_pinuse(ms, p, dvs); + } + mem = chunk2mem(p); + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + + else if (nb < ms->topsize) { /* Split top */ + size_t rsize = ms->topsize -= nb; + mchunkptr p = ms->top; + mchunkptr r = ms->top = chunk_plus_offset(p, nb); + r->head = rsize | PINUSE_BIT; + set_size_and_pinuse_of_inuse_chunk(ms, p, nb); + mem = chunk2mem(p); + check_top_chunk(ms, ms->top); + check_malloced_chunk(ms, mem, nb); + goto postaction; + } + + mem = sys_alloc(ms, nb); + + postaction: + POSTACTION(ms); + return mem; + } + + return 0; +} + +void mspace_free(mspace msp, void* mem) { + if (mem != 0) { + mchunkptr p = mem2chunk(mem); +#if FOOTERS + mstate fm = get_mstate_for(p); + msp = msp; /* placate people compiling -Wunused */ +#else /* FOOTERS */ + mstate fm = (mstate)msp; +#endif /* FOOTERS */ + if (!ok_magic(fm)) { + USAGE_ERROR_ACTION(fm, p); + return; + } + if (!PREACTION(fm)) { + check_inuse_chunk(fm, p); + if (RTCHECK(ok_address(fm, p) && ok_inuse(p))) { + size_t psize = chunksize(p); + mchunkptr next = chunk_plus_offset(p, psize); + if (!pinuse(p)) { + size_t prevsize = p->prev_foot; + if (is_mmapped(p)) { + psize += prevsize + MMAP_FOOT_PAD; + if (CALL_MUNMAP((char*)p - prevsize, psize) == 0) + fm->footprint -= psize; + goto postaction; + } + else { + mchunkptr prev = chunk_minus_offset(p, prevsize); + psize += prevsize; + p = prev; + if (RTCHECK(ok_address(fm, prev))) { /* consolidate backward */ + if (p != fm->dv) { + unlink_chunk(fm, p, prevsize); + } + else if ((next->head & INUSE_BITS) == INUSE_BITS) { + fm->dvsize = psize; + set_free_with_pinuse(p, psize, next); + goto postaction; + } + } + else + goto erroraction; + } + } + + if (RTCHECK(ok_next(p, next) && ok_pinuse(next))) { + if (!cinuse(next)) { /* consolidate forward */ + if (next == fm->top) { + size_t tsize = fm->topsize += psize; + fm->top = p; + p->head = tsize | PINUSE_BIT; + if (p == fm->dv) { + fm->dv = 0; + fm->dvsize = 0; + } + if (should_trim(fm, tsize)) + sys_trim(fm, 0); + goto postaction; + } + else if (next == fm->dv) { + size_t dsize = fm->dvsize += psize; + fm->dv = p; + set_size_and_pinuse_of_free_chunk(p, dsize); + goto postaction; + } + else { + size_t nsize = chunksize(next); + psize += nsize; + unlink_chunk(fm, next, nsize); + set_size_and_pinuse_of_free_chunk(p, psize); + if (p == fm->dv) { + fm->dvsize = psize; + goto postaction; + } + } + } + else + set_free_with_pinuse(p, psize, next); + + if (is_small(psize)) { + insert_small_chunk(fm, p, psize); + check_free_chunk(fm, p); + } + else { + tchunkptr tp = (tchunkptr)p; + insert_large_chunk(fm, tp, psize); + check_free_chunk(fm, p); + if (--fm->release_checks == 0) + release_unused_segments(fm); + } + goto postaction; + } + } + erroraction: + USAGE_ERROR_ACTION(fm, p); + postaction: + POSTACTION(fm); + } + } +} + +void* mspace_calloc(mspace msp, size_t n_elements, size_t elem_size) { + void* mem; + size_t req = 0; + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + return 0; + } + if (n_elements != 0) { + req = n_elements * elem_size; + if (((n_elements | elem_size) & ~(size_t)0xffff) && + (req / n_elements != elem_size)) + req = MAX_SIZE_T; /* force downstream failure on overflow */ + } + mem = internal_malloc(ms, req); + if (mem != 0 && calloc_must_clear(mem2chunk(mem))) + memset(mem, 0, req); + return mem; +} + +void* mspace_realloc(mspace msp, void* oldmem, size_t bytes) { + void* mem = 0; + if (oldmem == 0) { + mem = mspace_malloc(msp, bytes); + } + else if (bytes >= MAX_REQUEST) { + MALLOC_FAILURE_ACTION; + } +#ifdef REALLOC_ZERO_BYTES_FREES + else if (bytes == 0) { + mspace_free(msp, oldmem); + } +#endif /* REALLOC_ZERO_BYTES_FREES */ + else { + size_t nb = request2size(bytes); + mchunkptr oldp = mem2chunk(oldmem); +#if ! FOOTERS + mstate m = (mstate)msp; +#else /* FOOTERS */ + mstate m = get_mstate_for(oldp); + if (!ok_magic(m)) { + USAGE_ERROR_ACTION(m, oldmem); + return 0; + } +#endif /* FOOTERS */ + if (!PREACTION(m)) { + mchunkptr newp = try_realloc_chunk(m, oldp, nb, 1); + POSTACTION(m); + if (newp != 0) { + check_inuse_chunk(m, newp); + mem = chunk2mem(newp); + } + else { + mem = mspace_malloc(m, bytes); + if (mem != 0) { + size_t oc = chunksize(oldp) - overhead_for(oldp); + memcpy(mem, oldmem, (oc < bytes)? oc : bytes); + mspace_free(m, oldmem); + } + } + } + } + return mem; +} + +void* mspace_realloc_in_place(mspace msp, void* oldmem, size_t bytes) { + void* mem = 0; + if (oldmem != 0) { + if (bytes >= MAX_REQUEST) { + MALLOC_FAILURE_ACTION; + } + else { + size_t nb = request2size(bytes); + mchunkptr oldp = mem2chunk(oldmem); +#if ! FOOTERS + mstate m = (mstate)msp; +#else /* FOOTERS */ + mstate m = get_mstate_for(oldp); + msp = msp; /* placate people compiling -Wunused */ + if (!ok_magic(m)) { + USAGE_ERROR_ACTION(m, oldmem); + return 0; + } +#endif /* FOOTERS */ + if (!PREACTION(m)) { + mchunkptr newp = try_realloc_chunk(m, oldp, nb, 0); + POSTACTION(m); + if (newp == oldp) { + check_inuse_chunk(m, newp); + mem = oldmem; + } + } + } + } + return mem; +} + +void* mspace_memalign(mspace msp, size_t alignment, size_t bytes) { + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + return 0; + } + if (alignment <= MALLOC_ALIGNMENT) + return mspace_malloc(msp, bytes); + return internal_memalign(ms, alignment, bytes); +} + +void** mspace_independent_calloc(mspace msp, size_t n_elements, + size_t elem_size, void* chunks[]) { + size_t sz = elem_size; /* serves as 1-element array */ + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + return 0; + } + return ialloc(ms, n_elements, &sz, 3, chunks); +} + +void** mspace_independent_comalloc(mspace msp, size_t n_elements, + size_t sizes[], void* chunks[]) { + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + return 0; + } + return ialloc(ms, n_elements, sizes, 0, chunks); +} + +size_t mspace_bulk_free(mspace msp, void* array[], size_t nelem) { + return internal_bulk_free((mstate)msp, array, nelem); +} + +#if MALLOC_INSPECT_ALL +void mspace_inspect_all(mspace msp, + void(*handler)(void *start, + void *end, + size_t used_bytes, + void* callback_arg), + void* arg) { + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + if (!PREACTION(ms)) { + internal_inspect_all(ms, handler, arg); + POSTACTION(ms); + } + } + else { + USAGE_ERROR_ACTION(ms,ms); + } +} +#endif /* MALLOC_INSPECT_ALL */ + +int mspace_trim(mspace msp, size_t pad) { + int result = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + if (!PREACTION(ms)) { + result = sys_trim(ms, pad); + POSTACTION(ms); + } + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return result; +} + +#if !NO_MALLOC_STATS +void mspace_malloc_stats(mspace msp) { + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + internal_malloc_stats(ms); + } + else { + USAGE_ERROR_ACTION(ms,ms); + } +} +#endif /* NO_MALLOC_STATS */ + +size_t mspace_footprint(mspace msp) { + size_t result = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + result = ms->footprint; + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return result; +} + +size_t mspace_max_footprint(mspace msp) { + size_t result = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + result = ms->max_footprint; + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return result; +} + +size_t mspace_footprint_limit(mspace msp) { + size_t result = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + size_t maf = ms->footprint_limit; + result = (maf == 0) ? MAX_SIZE_T : maf; + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return result; +} + +size_t mspace_set_footprint_limit(mspace msp, size_t bytes) { + size_t result = 0; + mstate ms = (mstate)msp; + if (ok_magic(ms)) { + if (bytes == 0) + result = granularity_align(1); /* Use minimal size */ + if (bytes == MAX_SIZE_T) + result = 0; /* disable */ + else + result = granularity_align(bytes); + ms->footprint_limit = result; + } + else { + USAGE_ERROR_ACTION(ms,ms); + } + return result; +} + +#if !NO_MALLINFO +struct mallinfo mspace_mallinfo(mspace msp) { + mstate ms = (mstate)msp; + if (!ok_magic(ms)) { + USAGE_ERROR_ACTION(ms,ms); + } + return internal_mallinfo(ms); +} +#endif /* NO_MALLINFO */ + +size_t mspace_usable_size(void* mem) { + if (mem != 0) { + mchunkptr p = mem2chunk(mem); + if (is_inuse(p)) + return chunksize(p) - overhead_for(p); + } + return 0; +} + +int mspace_mallopt(int param_number, int value) { + return change_mparam(param_number, value); +} + +#endif /* MSPACES */ + + +/* -------------------- Alternative MORECORE functions ------------------- */ + +/* + Guidelines for creating a custom version of MORECORE: + + * For best performance, MORECORE should allocate in multiples of pagesize. + * MORECORE may allocate more memory than requested. (Or even less, + but this will usually result in a malloc failure.) + * MORECORE must not allocate memory when given argument zero, but + instead return one past the end address of memory from previous + nonzero call. + * For best performance, consecutive calls to MORECORE with positive + arguments should return increasing addresses, indicating that + space has been contiguously extended. + * Even though consecutive calls to MORECORE need not return contiguous + addresses, it must be OK for malloc'ed chunks to span multiple + regions in those cases where they do happen to be contiguous. + * MORECORE need not handle negative arguments -- it may instead + just return MFAIL when given negative arguments. + Negative arguments are always multiples of pagesize. MORECORE + must not misinterpret negative args as large positive unsigned + args. You can suppress all such calls from even occurring by defining + MORECORE_CANNOT_TRIM, + + As an example alternative MORECORE, here is a custom allocator + kindly contributed for pre-OSX macOS. It uses virtually but not + necessarily physically contiguous non-paged memory (locked in, + present and won't get swapped out). You can use it by uncommenting + this section, adding some #includes, and setting up the appropriate + defines above: + + #define MORECORE osMoreCore + + There is also a shutdown routine that should somehow be called for + cleanup upon program exit. + + #define MAX_POOL_ENTRIES 100 + #define MINIMUM_MORECORE_SIZE (64 * 1024U) + static int next_os_pool; + void *our_os_pools[MAX_POOL_ENTRIES]; + + void *osMoreCore(int size) + { + void *ptr = 0; + static void *sbrk_top = 0; + + if (size > 0) + { + if (size < MINIMUM_MORECORE_SIZE) + size = MINIMUM_MORECORE_SIZE; + if (CurrentExecutionLevel() == kTaskLevel) + ptr = PoolAllocateResident(size + RM_PAGE_SIZE, 0); + if (ptr == 0) + { + return (void *) MFAIL; + } + // save ptrs so they can be freed during cleanup + our_os_pools[next_os_pool] = ptr; + next_os_pool++; + ptr = (void *) ((((size_t) ptr) + RM_PAGE_MASK) & ~RM_PAGE_MASK); + sbrk_top = (char *) ptr + size; + return ptr; + } + else if (size < 0) + { + // we don't currently support shrink behavior + return (void *) MFAIL; + } + else + { + return sbrk_top; + } + } + + // cleanup any allocated memory pools + // called as last thing before shutting down driver + + void osCleanupMem(void) + { + void **ptr; + + for (ptr = our_os_pools; ptr < &our_os_pools[MAX_POOL_ENTRIES]; ptr++) + if (*ptr) + { + PoolDeallocate(*ptr); + *ptr = 0; + } + } + +*/ + + +/* ----------------------------------------------------------------------- +History: + v2.8.5 Sun May 22 10:26:02 2011 Doug Lea (dl at gee) + * Always perform unlink checks unless INSECURE + * Add posix_memalign. + * Improve realloc to expand in more cases; expose realloc_in_place. + Thanks to Peter Buhr for the suggestion. + * Add footprint_limit, inspect_all, bulk_free. Thanks + to Barry Hayes and others for the suggestions. + * Internal refactorings to avoid calls while holding locks + * Use non-reentrant locks by default. Thanks to Roland McGrath + for the suggestion. + * Small fixes to mspace_destroy, reset_on_error. + * Various configuration extensions/changes. Thanks + to all who contributed these. + + V2.8.4a Thu Apr 28 14:39:43 2011 (dl at gee.cs.oswego.edu) + * Update Creative Commons URL + + V2.8.4 Wed May 27 09:56:23 2009 Doug Lea (dl at gee) + * Use zeros instead of prev foot for is_mmapped + * Add mspace_track_large_chunks; thanks to Jean Brouwers + * Fix set_inuse in internal_realloc; thanks to Jean Brouwers + * Fix insufficient sys_alloc padding when using 16byte alignment + * Fix bad error check in mspace_footprint + * Adaptations for ptmalloc; thanks to Wolfram Gloger. + * Reentrant spin locks; thanks to Earl Chew and others + * Win32 improvements; thanks to Niall Douglas and Earl Chew + * Add NO_SEGMENT_TRAVERSAL and MAX_RELEASE_CHECK_RATE options + * Extension hook in malloc_state + * Various small adjustments to reduce warnings on some compilers + * Various configuration extensions/changes for more platforms. Thanks + to all who contributed these. + + V2.8.3 Thu Sep 22 11:16:32 2005 Doug Lea (dl at gee) + * Add max_footprint functions + * Ensure all appropriate literals are size_t + * Fix conditional compilation problem for some #define settings + * Avoid concatenating segments with the one provided + in create_mspace_with_base + * Rename some variables to avoid compiler shadowing warnings + * Use explicit lock initialization. + * Better handling of sbrk interference. + * Simplify and fix segment insertion, trimming and mspace_destroy + * Reinstate REALLOC_ZERO_BYTES_FREES option from 2.7.x + * Thanks especially to Dennis Flanagan for help on these. + + V2.8.2 Sun Jun 12 16:01:10 2005 Doug Lea (dl at gee) + * Fix memalign brace error. + + V2.8.1 Wed Jun 8 16:11:46 2005 Doug Lea (dl at gee) + * Fix improper #endif nesting in C++ + * Add explicit casts needed for C++ + + V2.8.0 Mon May 30 14:09:02 2005 Doug Lea (dl at gee) + * Use trees for large bins + * Support mspaces + * Use segments to unify sbrk-based and mmap-based system allocation, + removing need for emulation on most platforms without sbrk. + * Default safety checks + * Optional footer checks. Thanks to William Robertson for the idea. + * Internal code refactoring + * Incorporate suggestions and platform-specific changes. + Thanks to Dennis Flanagan, Colin Plumb, Niall Douglas, + Aaron Bachmann, Emery Berger, and others. + * Speed up non-fastbin processing enough to remove fastbins. + * Remove useless cfree() to avoid conflicts with other apps. + * Remove internal memcpy, memset. Compilers handle builtins better. + * Remove some options that no one ever used and rename others. + + V2.7.2 Sat Aug 17 09:07:30 2002 Doug Lea (dl at gee) + * Fix malloc_state bitmap array misdeclaration + + V2.7.1 Thu Jul 25 10:58:03 2002 Doug Lea (dl at gee) + * Allow tuning of FIRST_SORTED_BIN_SIZE + * Use PTR_UINT as type for all ptr->int casts. Thanks to John Belmonte. + * Better detection and support for non-contiguousness of MORECORE. + Thanks to Andreas Mueller, Conal Walsh, and Wolfram Gloger + * Bypass most of malloc if no frees. Thanks To Emery Berger. + * Fix freeing of old top non-contiguous chunk im sysmalloc. + * Raised default trim and map thresholds to 256K. + * Fix mmap-related #defines. Thanks to Lubos Lunak. + * Fix copy macros; added LACKS_FCNTL_H. Thanks to Neal Walfield. + * Branch-free bin calculation + * Default trim and mmap thresholds now 256K. + + V2.7.0 Sun Mar 11 14:14:06 2001 Doug Lea (dl at gee) + * Introduce independent_comalloc and independent_calloc. + Thanks to Michael Pachos for motivation and help. + * Make optional .h file available + * Allow > 2GB requests on 32bit systems. + * new WIN32 sbrk, mmap, munmap, lock code from . + Thanks also to Andreas Mueller , + and Anonymous. + * Allow override of MALLOC_ALIGNMENT (Thanks to Ruud Waij for + helping test this.) + * memalign: check alignment arg + * realloc: don't try to shift chunks backwards, since this + leads to more fragmentation in some programs and doesn't + seem to help in any others. + * Collect all cases in malloc requiring system memory into sysmalloc + * Use mmap as backup to sbrk + * Place all internal state in malloc_state + * Introduce fastbins (although similar to 2.5.1) + * Many minor tunings and cosmetic improvements + * Introduce USE_PUBLIC_MALLOC_WRAPPERS, USE_MALLOC_LOCK + * Introduce MALLOC_FAILURE_ACTION, MORECORE_CONTIGUOUS + Thanks to Tony E. Bennett and others. + * Include errno.h to support default failure action. + + V2.6.6 Sun Dec 5 07:42:19 1999 Doug Lea (dl at gee) + * return null for negative arguments + * Added Several WIN32 cleanups from Martin C. Fong + * Add 'LACKS_SYS_PARAM_H' for those systems without 'sys/param.h' + (e.g. WIN32 platforms) + * Cleanup header file inclusion for WIN32 platforms + * Cleanup code to avoid Microsoft Visual C++ compiler complaints + * Add 'USE_DL_PREFIX' to quickly allow co-existence with existing + memory allocation routines + * Set 'malloc_getpagesize' for WIN32 platforms (needs more work) + * Use 'assert' rather than 'ASSERT' in WIN32 code to conform to + usage of 'assert' in non-WIN32 code + * Improve WIN32 'sbrk()' emulation's 'findRegion()' routine to + avoid infinite loop + * Always call 'fREe()' rather than 'free()' + + V2.6.5 Wed Jun 17 15:57:31 1998 Doug Lea (dl at gee) + * Fixed ordering problem with boundary-stamping + + V2.6.3 Sun May 19 08:17:58 1996 Doug Lea (dl at gee) + * Added pvalloc, as recommended by H.J. Liu + * Added 64bit pointer support mainly from Wolfram Gloger + * Added anonymously donated WIN32 sbrk emulation + * Malloc, calloc, getpagesize: add optimizations from Raymond Nijssen + * malloc_extend_top: fix mask error that caused wastage after + foreign sbrks + * Add linux mremap support code from HJ Liu + + V2.6.2 Tue Dec 5 06:52:55 1995 Doug Lea (dl at gee) + * Integrated most documentation with the code. + * Add support for mmap, with help from + Wolfram Gloger (Gloger@lrz.uni-muenchen.de). + * Use last_remainder in more cases. + * Pack bins using idea from colin@nyx10.cs.du.edu + * Use ordered bins instead of best-fit threshhold + * Eliminate block-local decls to simplify tracing and debugging. + * Support another case of realloc via move into top + * Fix error occuring when initial sbrk_base not word-aligned. + * Rely on page size for units instead of SBRK_UNIT to + avoid surprises about sbrk alignment conventions. + * Add mallinfo, mallopt. Thanks to Raymond Nijssen + (raymond@es.ele.tue.nl) for the suggestion. + * Add `pad' argument to malloc_trim and top_pad mallopt parameter. + * More precautions for cases where other routines call sbrk, + courtesy of Wolfram Gloger (Gloger@lrz.uni-muenchen.de). + * Added macros etc., allowing use in linux libc from + H.J. Lu (hjl@gnu.ai.mit.edu) + * Inverted this history list + + V2.6.1 Sat Dec 2 14:10:57 1995 Doug Lea (dl at gee) + * Re-tuned and fixed to behave more nicely with V2.6.0 changes. + * Removed all preallocation code since under current scheme + the work required to undo bad preallocations exceeds + the work saved in good cases for most test programs. + * No longer use return list or unconsolidated bins since + no scheme using them consistently outperforms those that don't + given above changes. + * Use best fit for very large chunks to prevent some worst-cases. + * Added some support for debugging + + V2.6.0 Sat Nov 4 07:05:23 1995 Doug Lea (dl at gee) + * Removed footers when chunks are in use. Thanks to + Paul Wilson (wilson@cs.texas.edu) for the suggestion. + + V2.5.4 Wed Nov 1 07:54:51 1995 Doug Lea (dl at gee) + * Added malloc_trim, with help from Wolfram Gloger + (wmglo@Dent.MED.Uni-Muenchen.DE). + + V2.5.3 Tue Apr 26 10:16:01 1994 Doug Lea (dl at g) + + V2.5.2 Tue Apr 5 16:20:40 1994 Doug Lea (dl at g) + * realloc: try to expand in both directions + * malloc: swap order of clean-bin strategy; + * realloc: only conditionally expand backwards + * Try not to scavenge used bins + * Use bin counts as a guide to preallocation + * Occasionally bin return list chunks in first scan + * Add a few optimizations from colin@nyx10.cs.du.edu + + V2.5.1 Sat Aug 14 15:40:43 1993 Doug Lea (dl at g) + * faster bin computation & slightly different binning + * merged all consolidations to one part of malloc proper + (eliminating old malloc_find_space & malloc_clean_bin) + * Scan 2 returns chunks (not just 1) + * Propagate failure in realloc if malloc returns 0 + * Add stuff to allow compilation on non-ANSI compilers + from kpv@research.att.com + + V2.5 Sat Aug 7 07:41:59 1993 Doug Lea (dl at g.oswego.edu) + * removed potential for odd address access in prev_chunk + * removed dependency on getpagesize.h + * misc cosmetics and a bit more internal documentation + * anticosmetics: mangled names in macros to evade debugger strangeness + * tested on sparc, hp-700, dec-mips, rs6000 + with gcc & native cc (hp, dec only) allowing + Detlefs & Zorn comparison study (in SIGPLAN Notices.) + + Trial version Fri Aug 28 13:14:29 1992 Doug Lea (dl at g.oswego.edu) + * Based loosely on libg++-1.2X malloc. (It retains some of the overall + structure of old version, but most details differ.) + +*/ +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* TODO: TEST ME */ +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/_dlmalloc/dlmalloc.h b/functions/_dlmalloc/dlmalloc.h index b79a83e..bf53a68 100644 --- a/functions/_dlmalloc/dlmalloc.h +++ b/functions/_dlmalloc/dlmalloc.h @@ -1,85 +1,85 @@ -#include "_PDCLIB_aux.h" -#include "_PDCLIB_config.h" -#include "_PDCLIB_glue.h" -#include - -typedef mtx_t MLOCK_T; -#define INITIAL_LOCK(lk) mtx_init(lk, mtx_plain) -#define DESTROY_LOCK(lk) mtx_destroy(lk) -#define ACQUIRE_LOCK(lk) mtx_lock(lk) -#define RELEASE_LOCK(lk) mtx_unlock(lk) -#define TRY_LOCK(lk) mtx_trylock(lk) -#define NEED_GLOBAL_LOCK_INIT -static mtx_t malloc_global_mutex; -static once_flag malloc_global_mutex_init_once; - -static void init_malloc_global_mutex(void) -{ - mtx_init(&malloc_global_mutex, mtx_plain); -} - -static inline void *MMAP( size_t nbytes ) -{ - void *p = _PDCLIB_allocpages( nbytes / _PDCLIB_MALLOC_PAGESIZE ); - return p ? p : (void*) (~(size_t)0); -} - -#define MMAP(s) MMAP(s) -#define DIRECT_MMAP(s) MMAP(s) -#define MUNMAP(a, s) ((_PDCLIB_freepages((a), (s)/_PDCLIB_MALLOC_PAGESIZE)), 0) -#define MREMAP(a, osz, nsz, mv) _PDCLIB_reallocpages((a), (osz)/_PDCLIB_MALLOC_PAGESIZE, (nsz)/_PDCLIB_MALLOC_PAGESIZE, (mv)) - -#undef WIN32 -#undef _WIN32 -#define DLMALLOC_EXPORT _PDCLIB_API -#define MALLOC_ALIGNMENT _PDCLIB_MALLOC_ALIGN -#define MSPACES 0 -#define USE_LOCKS 2 -#define USE_SPIN_LOCKS 0 -#define USE_RECURSIVE_LOCKS 0 -#define FOOTERS 0 -#undef USE_DL_PREFIX -#define MALLOC_INSPECT_ALL 0 -#define ABORT abort() -#define PROCEED_ON_ERROR 0 -#define DEBUG 0 -#define ABORT_ON_ASSERT_FAILURE 0 -#define MALLOC_FAILURE_ACTION errno = ENOMEM -#define HAVE_MORECORE 0 -#define MORECORE __unnamed__ -#define MORECORE_CONTIGUOUS 0 -#define MORECORE_CANNOT_TRIM 0 -#define NO_SEGMENT_TRAVERSAL 0 -#define HAVE_MMAP 1 -#if defined(_PDCLIB_HAVE_REALLOCPAGES) - #define HAVE_MREMAP 1 -#else - #define HAVE_MREMAP 0 -#endif -#if defined(_PDCLIB_ALLOCPAGES_CLEARS) - #define MMAP_CLEARS 1 -#else - #define MMAP_CLEARS 0 -#endif -#define USE_BUILTIN_FFS 0 -#define malloc_getpagesize _PDCLIB_MALLOC_PAGESIZE -#define USE_DEV_RANDOM 0 -#define NO_MALLINFO 1 -#define MALLINFO_FIELD_TYPE size_t -#define NO_MALLOC_STATS 1 -#define DEFAULT_GRANULARITY _PDCLIB_MALLOC_GRANULARITY -#define DEFAULT_TRIM_THRESHOLD _PDCLIB_MALLOC_TRIM_THRESHOLD -#define DEFAULT_MMAP_THREHOLD _PDCLIB_MALLOC_MMAP_THRESHOLD -#define MAX_RELEASE_CHECK_RATE _PDCLIB_MALLOC_RELEASE_CHECK_RATE - -/* C standard says this is so */ -#define REALLOC_ZERO_BYTES_FREES 1 -#define LACKS_UNISTD_H -#define LACKS_FCNTL_H -#define LACKS_SYS_PARAM_H -#define LACKS_SYS_MMAN_H -#define LACKS_STRINGS_H -#define LACKS_SYS_TYPES_H -#define LACKS_SCHED_H -#include -#include +#include "_PDCLIB_aux.h" +#include "_PDCLIB_config.h" +#include "_PDCLIB_glue.h" +#include + +typedef mtx_t MLOCK_T; +#define INITIAL_LOCK(lk) mtx_init(lk, mtx_plain) +#define DESTROY_LOCK(lk) mtx_destroy(lk) +#define ACQUIRE_LOCK(lk) mtx_lock(lk) +#define RELEASE_LOCK(lk) mtx_unlock(lk) +#define TRY_LOCK(lk) mtx_trylock(lk) +#define NEED_GLOBAL_LOCK_INIT +static mtx_t malloc_global_mutex; +static once_flag malloc_global_mutex_init_once; + +static void init_malloc_global_mutex(void) +{ + mtx_init(&malloc_global_mutex, mtx_plain); +} + +static inline void *MMAP( size_t nbytes ) +{ + void *p = _PDCLIB_allocpages( nbytes / _PDCLIB_MALLOC_PAGESIZE ); + return p ? p : (void*) (~(size_t)0); +} + +#define MMAP(s) MMAP(s) +#define DIRECT_MMAP(s) MMAP(s) +#define MUNMAP(a, s) ((_PDCLIB_freepages((a), (s)/_PDCLIB_MALLOC_PAGESIZE)), 0) +#define MREMAP(a, osz, nsz, mv) _PDCLIB_reallocpages((a), (osz)/_PDCLIB_MALLOC_PAGESIZE, (nsz)/_PDCLIB_MALLOC_PAGESIZE, (mv)) + +#undef WIN32 +#undef _WIN32 +#define DLMALLOC_EXPORT _PDCLIB_API +#define MALLOC_ALIGNMENT _PDCLIB_MALLOC_ALIGN +#define MSPACES 0 +#define USE_LOCKS 2 +#define USE_SPIN_LOCKS 0 +#define USE_RECURSIVE_LOCKS 0 +#define FOOTERS 0 +#undef USE_DL_PREFIX +#define MALLOC_INSPECT_ALL 0 +#define ABORT abort() +#define PROCEED_ON_ERROR 0 +#define DEBUG 0 +#define ABORT_ON_ASSERT_FAILURE 0 +#define MALLOC_FAILURE_ACTION errno = ENOMEM +#define HAVE_MORECORE 0 +#define MORECORE __unnamed__ +#define MORECORE_CONTIGUOUS 0 +#define MORECORE_CANNOT_TRIM 0 +#define NO_SEGMENT_TRAVERSAL 0 +#define HAVE_MMAP 1 +#if defined(_PDCLIB_HAVE_REALLOCPAGES) + #define HAVE_MREMAP 1 +#else + #define HAVE_MREMAP 0 +#endif +#if defined(_PDCLIB_ALLOCPAGES_CLEARS) + #define MMAP_CLEARS 1 +#else + #define MMAP_CLEARS 0 +#endif +#define USE_BUILTIN_FFS 0 +#define malloc_getpagesize _PDCLIB_MALLOC_PAGESIZE +#define USE_DEV_RANDOM 0 +#define NO_MALLINFO 1 +#define MALLINFO_FIELD_TYPE size_t +#define NO_MALLOC_STATS 1 +#define DEFAULT_GRANULARITY _PDCLIB_MALLOC_GRANULARITY +#define DEFAULT_TRIM_THRESHOLD _PDCLIB_MALLOC_TRIM_THRESHOLD +#define DEFAULT_MMAP_THREHOLD _PDCLIB_MALLOC_MMAP_THRESHOLD +#define MAX_RELEASE_CHECK_RATE _PDCLIB_MALLOC_RELEASE_CHECK_RATE + +/* C standard says this is so */ +#define REALLOC_ZERO_BYTES_FREES 1 +#define LACKS_UNISTD_H +#define LACKS_FCNTL_H +#define LACKS_SYS_PARAM_H +#define LACKS_SYS_MMAN_H +#define LACKS_STRINGS_H +#define LACKS_SYS_TYPES_H +#define LACKS_SCHED_H +#include +#include diff --git a/functions/locale/UnicodeData.py b/functions/locale/UnicodeData.py index bb55787..e0f87e5 100644 --- a/functions/locale/UnicodeData.py +++ b/functions/locale/UnicodeData.py @@ -1,194 +1,194 @@ -#!/usr/bin/python -# -*- coding: ascii -*- -# Unicode Data Converter -# -# This file is part of the Public Domain C Library (PDCLib). -# Permission is granted to use, modify, and / or redistribute at will. -""" -Converts the character information provdied by Unicode in the UnicodeData.txt -file from the Unicode character database into a table for use by PDCLib. - -Usage: Download the UnicodeData.txt file to the same directory as this script -and then run it. Both Python 2 and 3 are supported. - -Download the data from - ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt - -We do some simple "run" compression, because characters in the Unicode Data file -tend to come in groups with the same properties. -""" -import os - -# MUST BE KEPT SYNCHRONIZED WITH _PDCLIB_locale.h -BIT_ALPHA = 1 -BIT_BLANK = 2 -BIT_CNTRL = 4 -BIT_GRAPH = 8 -BIT_PUNCT = 16 -BIT_SPACE = 32 -BIT_LOWER = 64 -BIT_UPPER = 128 -BIT_DIGIT = 256 -BIT_XDIGT = 512 - -# Category to bitfield mapping -categories = { - 'Lu': BIT_ALPHA | BIT_GRAPH | BIT_UPPER, # Uppercase - 'Ll': BIT_ALPHA | BIT_GRAPH | BIT_LOWER, # Lowercase - 'Lt': BIT_ALPHA | BIT_GRAPH | BIT_UPPER, # Title case. Upper? - 'Lm': BIT_ALPHA | BIT_GRAPH, # Modifier. Case? - 'Lo': BIT_ALPHA | BIT_GRAPH, # "Other" letter (e.g. Ideograph) - 'Nd': BIT_DIGIT | BIT_GRAPH, # Decimal digit - 'Nl': BIT_GRAPH, # Letter-like numeric character - 'No': BIT_GRAPH, # Other numeric - 'Pc': BIT_PUNCT | BIT_GRAPH, # Connecting punctuation - 'Pd': BIT_PUNCT | BIT_GRAPH, # Dash punctuation - 'Ps': BIT_PUNCT | BIT_GRAPH, # Opening punctuation - 'Pe': BIT_PUNCT | BIT_GRAPH, # Closing punctuation - 'Pi': BIT_PUNCT | BIT_GRAPH, # Opening quote - 'Pf': BIT_PUNCT | BIT_GRAPH, # Closing quote - 'Po': BIT_PUNCT | BIT_GRAPH, # Other punctuation - 'Sm': BIT_GRAPH, # Mathematical symbol - 'Sc': BIT_GRAPH, # Currency symbol - 'Sk': BIT_GRAPH, # Non-letterlike modifier symbol - 'So': BIT_GRAPH, # Other symbol - 'Zs': BIT_SPACE, # Non-zero-width space character - 'Zl': BIT_SPACE, # Line separator - 'Zp': BIT_SPACE, # Paragraph separator - 'Cc': BIT_CNTRL, # C0/C1 control codes -} - -# Characters with special properties -special = { - # Blank characters - 0x0020: BIT_SPACE | BIT_BLANK, # space - 0x0009: BIT_SPACE | BIT_BLANK, # tab - - # Digits - 0x0030: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0031: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0032: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0033: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0034: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0035: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0036: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0037: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0038: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - 0x0039: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, - - # A-F (hex uppercase) - 0x0041: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - 0x0042: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - 0x0043: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - 0x0044: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - 0x0045: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - 0x0046: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, - - - # a-f (hex lowercase) - 0x0061: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, - 0x0062: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, - 0x0063: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, - 0x0064: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, - 0x0065: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, - 0x0066: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, -} - -class Group: - def __init__(self, start, flags, upper_delta, lower_delta): - self.start = start - self.flags = flags - self.upper_delta = upper_delta - self.lower_delta = lower_delta - self.chars = [] - - def add_char(self, num, label): - self.chars.append((num, label)) - - def write_to_file(self, f): - for char in self.chars: - f.write("// %x %s\n" % char) - f.write(" { 0x%X, \t0x%X, \t0x%X, \t%d, \t%d },\n" % - (self.start, len(self.chars), self.flags, self.lower_delta, self.upper_delta)) - - def next(self): - return self.start + len(self.chars) - -groups = [] - -def add_char(num, upper, lower, bits, label): - upper_delta = upper - num - lower_delta = lower - num - - if len(groups) != 0: - cur = groups[-1] - if num == cur.next() and cur.flags == bits and \ - cur.upper_delta == upper_delta and \ - cur.lower_delta == lower_delta: - cur.add_char(num, label) - return - - g = Group(num, bits, upper_delta, lower_delta) - g.add_char(num, label) - groups.append(g) - -in_file = open('UnicodeData.txt', 'r') -out_file = open('_PDCLIB_unicodedata.c', 'w') -try: - for line in in_file: - (num_hex, name, category, combining_class, bidi_class, decomposition, - numeric_type, numeric_digit, numeric_value, mirrored, u1name, iso_com, - upper_case_hex, lower_case_hex, title_case_hex) = line.split(";") - - num = int(num_hex, 16) - upper_case = int(upper_case_hex, 16) if len(upper_case_hex) else num - lower_case = int(lower_case_hex, 16) if len(lower_case_hex) else num - bits = special.get(num, categories.get(category, 0)) - - if upper_case == 0 and lower_case == 0 and bits == 0: - continue - - add_char(num, upper_case, lower_case, bits, name) - - out_file.write(""" -/* Unicode Character Information ** AUTOMATICALLY GENERATED FILE ** - * - * This file is part of the PDCLib public domain C Library, but is automatically - * generated from the Unicode character data information file found at - * ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt - * - * As a result, the licensing that applies to that file also applies to this - * file. The licensing which applies to the Unicode character data can be found - * in Exhibit 1 of the Unicode Terms of Use, found at - * http://www.unicode.org/copyright.html#Exhibit1 - */ - #ifndef REGTEST - #include <_PDCLIB_locale.h> - -const _PDCLIB_wcinfo_t _PDCLIB_wcinfo[] = { -// { value, \tlength, \tflags,\tlower,\tupper\t}, // name - """) - for g in groups: - g.write_to_file(out_file) - out_file.write('};\n\n') - out_file.write(""" -const size_t _PDCLIB_wcinfo_size = sizeof(_PDCLIB_wcinfo) / sizeof(_PDCLIB_wcinfo[0]); -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" -int main( void ) -{ - return TEST_RESULTS; -} -#endif - -""") -except: - in_file.close() - out_file.close() - os.remove('_PDCLIB_unicodedata.c') - raise -else: - in_file.close() - out_file.close() +#!/usr/bin/python +# -*- coding: ascii -*- +# Unicode Data Converter +# +# This file is part of the Public Domain C Library (PDCLib). +# Permission is granted to use, modify, and / or redistribute at will. +""" +Converts the character information provdied by Unicode in the UnicodeData.txt +file from the Unicode character database into a table for use by PDCLib. + +Usage: Download the UnicodeData.txt file to the same directory as this script +and then run it. Both Python 2 and 3 are supported. + +Download the data from + ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt + +We do some simple "run" compression, because characters in the Unicode Data file +tend to come in groups with the same properties. +""" +import os + +# MUST BE KEPT SYNCHRONIZED WITH _PDCLIB_locale.h +BIT_ALPHA = 1 +BIT_BLANK = 2 +BIT_CNTRL = 4 +BIT_GRAPH = 8 +BIT_PUNCT = 16 +BIT_SPACE = 32 +BIT_LOWER = 64 +BIT_UPPER = 128 +BIT_DIGIT = 256 +BIT_XDIGT = 512 + +# Category to bitfield mapping +categories = { + 'Lu': BIT_ALPHA | BIT_GRAPH | BIT_UPPER, # Uppercase + 'Ll': BIT_ALPHA | BIT_GRAPH | BIT_LOWER, # Lowercase + 'Lt': BIT_ALPHA | BIT_GRAPH | BIT_UPPER, # Title case. Upper? + 'Lm': BIT_ALPHA | BIT_GRAPH, # Modifier. Case? + 'Lo': BIT_ALPHA | BIT_GRAPH, # "Other" letter (e.g. Ideograph) + 'Nd': BIT_DIGIT | BIT_GRAPH, # Decimal digit + 'Nl': BIT_GRAPH, # Letter-like numeric character + 'No': BIT_GRAPH, # Other numeric + 'Pc': BIT_PUNCT | BIT_GRAPH, # Connecting punctuation + 'Pd': BIT_PUNCT | BIT_GRAPH, # Dash punctuation + 'Ps': BIT_PUNCT | BIT_GRAPH, # Opening punctuation + 'Pe': BIT_PUNCT | BIT_GRAPH, # Closing punctuation + 'Pi': BIT_PUNCT | BIT_GRAPH, # Opening quote + 'Pf': BIT_PUNCT | BIT_GRAPH, # Closing quote + 'Po': BIT_PUNCT | BIT_GRAPH, # Other punctuation + 'Sm': BIT_GRAPH, # Mathematical symbol + 'Sc': BIT_GRAPH, # Currency symbol + 'Sk': BIT_GRAPH, # Non-letterlike modifier symbol + 'So': BIT_GRAPH, # Other symbol + 'Zs': BIT_SPACE, # Non-zero-width space character + 'Zl': BIT_SPACE, # Line separator + 'Zp': BIT_SPACE, # Paragraph separator + 'Cc': BIT_CNTRL, # C0/C1 control codes +} + +# Characters with special properties +special = { + # Blank characters + 0x0020: BIT_SPACE | BIT_BLANK, # space + 0x0009: BIT_SPACE | BIT_BLANK, # tab + + # Digits + 0x0030: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0031: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0032: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0033: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0034: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0035: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0036: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0037: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0038: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + 0x0039: BIT_XDIGT | BIT_DIGIT | BIT_GRAPH, + + # A-F (hex uppercase) + 0x0041: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + 0x0042: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + 0x0043: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + 0x0044: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + 0x0045: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + 0x0046: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_UPPER, + + + # a-f (hex lowercase) + 0x0061: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, + 0x0062: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, + 0x0063: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, + 0x0064: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, + 0x0065: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, + 0x0066: BIT_XDIGT | BIT_ALPHA | BIT_GRAPH | BIT_LOWER, +} + +class Group: + def __init__(self, start, flags, upper_delta, lower_delta): + self.start = start + self.flags = flags + self.upper_delta = upper_delta + self.lower_delta = lower_delta + self.chars = [] + + def add_char(self, num, label): + self.chars.append((num, label)) + + def write_to_file(self, f): + for char in self.chars: + f.write("// %x %s\n" % char) + f.write(" { 0x%X, \t0x%X, \t0x%X, \t%d, \t%d },\n" % + (self.start, len(self.chars), self.flags, self.lower_delta, self.upper_delta)) + + def next(self): + return self.start + len(self.chars) + +groups = [] + +def add_char(num, upper, lower, bits, label): + upper_delta = upper - num + lower_delta = lower - num + + if len(groups) != 0: + cur = groups[-1] + if num == cur.next() and cur.flags == bits and \ + cur.upper_delta == upper_delta and \ + cur.lower_delta == lower_delta: + cur.add_char(num, label) + return + + g = Group(num, bits, upper_delta, lower_delta) + g.add_char(num, label) + groups.append(g) + +in_file = open('UnicodeData.txt', 'r') +out_file = open('_PDCLIB_unicodedata.c', 'w') +try: + for line in in_file: + (num_hex, name, category, combining_class, bidi_class, decomposition, + numeric_type, numeric_digit, numeric_value, mirrored, u1name, iso_com, + upper_case_hex, lower_case_hex, title_case_hex) = line.split(";") + + num = int(num_hex, 16) + upper_case = int(upper_case_hex, 16) if len(upper_case_hex) else num + lower_case = int(lower_case_hex, 16) if len(lower_case_hex) else num + bits = special.get(num, categories.get(category, 0)) + + if upper_case == 0 and lower_case == 0 and bits == 0: + continue + + add_char(num, upper_case, lower_case, bits, name) + + out_file.write(""" +/* Unicode Character Information ** AUTOMATICALLY GENERATED FILE ** + * + * This file is part of the PDCLib public domain C Library, but is automatically + * generated from the Unicode character data information file found at + * ftp://ftp.unicode.org/Public/UNIDATA/UnicodeData.txt + * + * As a result, the licensing that applies to that file also applies to this + * file. The licensing which applies to the Unicode character data can be found + * in Exhibit 1 of the Unicode Terms of Use, found at + * http://www.unicode.org/copyright.html#Exhibit1 + */ + #ifndef REGTEST + #include <_PDCLIB_locale.h> + +const _PDCLIB_wcinfo_t _PDCLIB_wcinfo[] = { +// { value, \tlength, \tflags,\tlower,\tupper\t}, // name + """) + for g in groups: + g.write_to_file(out_file) + out_file.write('};\n\n') + out_file.write(""" +const size_t _PDCLIB_wcinfo_size = sizeof(_PDCLIB_wcinfo) / sizeof(_PDCLIB_wcinfo[0]); +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" +int main( void ) +{ + return TEST_RESULTS; +} +#endif + +""") +except: + in_file.close() + out_file.close() + os.remove('_PDCLIB_unicodedata.c') + raise +else: + in_file.close() + out_file.close() diff --git a/functions/locale/freelocale.c b/functions/locale/freelocale.c index 7d5073b..6ab34e9 100644 --- a/functions/locale/freelocale.c +++ b/functions/locale/freelocale.c @@ -1,29 +1,29 @@ -/* freelocale( locale_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" -#include - -void freelocale( locale_t newloc ) -{ - if( newloc != NULL ) { - assert( ! "Not implemented" ); - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( NO_TESTDRIVER ); - return TEST_RESULTS; -} -#endif +/* freelocale( locale_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" +#include + +void freelocale( locale_t newloc ) +{ + if( newloc != NULL ) { + assert( ! "Not implemented" ); + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( NO_TESTDRIVER ); + return TEST_RESULTS; +} +#endif diff --git a/functions/stdio/_PDCLIB_fillbuffer.c b/functions/stdio/_PDCLIB_fillbuffer.c index 146edf0..7cfbe93 100644 --- a/functions/stdio/_PDCLIB_fillbuffer.c +++ b/functions/stdio/_PDCLIB_fillbuffer.c @@ -1,46 +1,46 @@ -/* _PDCLIB_fillbuffer( FILE * stream ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST -#include "_PDCLIB_glue.h" -#include "_PDCLIB_io.h" - -int _PDCLIB_fillbuffer( FILE * stream ) -{ - size_t bytesRead; - bool ok = stream->ops->read( stream->handle, stream->buffer, stream->bufsize, - &bytesRead); - - if( ok ) { - if( bytesRead == 0 ) { - stream->status |= _PDCLIB_EOFFLAG; - return EOF; - } - stream->pos.offset += bytesRead; - stream->bufend = bytesRead; - stream->bufidx = 0; - return 0; - } else { - stream->status |= _PDCLIB_ERRORFLAG; - return EOF; - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - /* Testing covered by ftell.c */ - return TEST_RESULTS; -} - -#endif - +/* _PDCLIB_fillbuffer( FILE * stream ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST +#include "_PDCLIB_glue.h" +#include "_PDCLIB_io.h" + +int _PDCLIB_fillbuffer( FILE * stream ) +{ + size_t bytesRead; + bool ok = stream->ops->read( stream->handle, stream->buffer, stream->bufsize, + &bytesRead); + + if( ok ) { + if( bytesRead == 0 ) { + stream->status |= _PDCLIB_EOFFLAG; + return EOF; + } + stream->pos.offset += bytesRead; + stream->bufend = bytesRead; + stream->bufidx = 0; + return 0; + } else { + stream->status |= _PDCLIB_ERRORFLAG; + return EOF; + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + /* Testing covered by ftell.c */ + return TEST_RESULTS; +} + +#endif + diff --git a/functions/stdio/_PDCLIB_flushbuffer.c b/functions/stdio/_PDCLIB_flushbuffer.c index 30f132f..e7cf47c 100644 --- a/functions/stdio/_PDCLIB_flushbuffer.c +++ b/functions/stdio/_PDCLIB_flushbuffer.c @@ -1,119 +1,119 @@ -/* _PDCLIB_flushbuffer( struct _PDCLIB_file_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_glue.h" -#include "_PDCLIB_io.h" - - -static int flushsubbuffer( FILE * stream, size_t length ) -{ - size_t justWrote; - size_t written = 0; - int rv = 0; - -#if 0 - // Very useful for debugging buffering issues - char l = '<', r = '>'; - stream->ops->write( stream->handle, &l, 1, &justWrote ); -#endif - - while( written != length ) - { - size_t toWrite = length - written; - - bool res = stream->ops->write( stream->handle, stream->buffer + written, - toWrite, &justWrote); - written += justWrote; - stream->pos.offset += justWrote; - - if (!res) - { - stream->status |= _PDCLIB_ERRORFLAG; - rv = EOF; - break; - } - } - -#if 0 - stream->ops->write( stream->handle, &r, 1, &justWrote ); -#endif - - stream->bufidx -= written; -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - stream->bufnlexp -= written; -#endif - memmove( stream->buffer, stream->buffer + written, stream->bufidx ); - - return rv; -} - -int _PDCLIB_flushbuffer( FILE * stream ) -{ -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - // if a text stream, and this platform needs EOL translation, well... - if ( ! ( stream->status & _PDCLIB_FBIN ) ) - { - // Special case: buffer is full and we start with a \n - if ( stream->bufnlexp == 0 - && stream->bufidx == stream->bufend - && stream->buffer[0] == '\n' ) - { - char cr = '\r'; - size_t written = 0; - bool res = stream->ops->write( stream->handle, &cr, 1, &written ); - - if (!res) { - stream->status |= _PDCLIB_ERRORFLAG; - return EOF; - } - - } - - for ( ; stream->bufnlexp < stream->bufidx; stream->bufnlexp++ ) - { - if (stream->buffer[stream->bufnlexp] == '\n' ) { - if ( stream->bufidx == stream->bufend ) { - // buffer is full. Need to print out everything up till now - if( flushsubbuffer( stream, stream->bufnlexp - 1 ) ) - { - return EOF; - } - } - - // we have spare space in buffer. Shift everything 1char and - // insert \r - memmove( &stream->buffer[stream->bufnlexp + 1], - &stream->buffer[stream->bufnlexp], - stream->bufidx - stream->bufnlexp ); - stream->buffer[stream->bufnlexp] = '\r'; - - stream->bufnlexp++; - stream->bufidx++; - } - } - } -#endif - return flushsubbuffer( stream, stream->bufidx ); -} - -#endif - - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - /* Testing covered by ftell.c */ - return TEST_RESULTS; -} - -#endif - +/* _PDCLIB_flushbuffer( struct _PDCLIB_file_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_glue.h" +#include "_PDCLIB_io.h" + + +static int flushsubbuffer( FILE * stream, size_t length ) +{ + size_t justWrote; + size_t written = 0; + int rv = 0; + +#if 0 + // Very useful for debugging buffering issues + char l = '<', r = '>'; + stream->ops->write( stream->handle, &l, 1, &justWrote ); +#endif + + while( written != length ) + { + size_t toWrite = length - written; + + bool res = stream->ops->write( stream->handle, stream->buffer + written, + toWrite, &justWrote); + written += justWrote; + stream->pos.offset += justWrote; + + if (!res) + { + stream->status |= _PDCLIB_ERRORFLAG; + rv = EOF; + break; + } + } + +#if 0 + stream->ops->write( stream->handle, &r, 1, &justWrote ); +#endif + + stream->bufidx -= written; +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + stream->bufnlexp -= written; +#endif + memmove( stream->buffer, stream->buffer + written, stream->bufidx ); + + return rv; +} + +int _PDCLIB_flushbuffer( FILE * stream ) +{ +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + // if a text stream, and this platform needs EOL translation, well... + if ( ! ( stream->status & _PDCLIB_FBIN ) ) + { + // Special case: buffer is full and we start with a \n + if ( stream->bufnlexp == 0 + && stream->bufidx == stream->bufend + && stream->buffer[0] == '\n' ) + { + char cr = '\r'; + size_t written = 0; + bool res = stream->ops->write( stream->handle, &cr, 1, &written ); + + if (!res) { + stream->status |= _PDCLIB_ERRORFLAG; + return EOF; + } + + } + + for ( ; stream->bufnlexp < stream->bufidx; stream->bufnlexp++ ) + { + if (stream->buffer[stream->bufnlexp] == '\n' ) { + if ( stream->bufidx == stream->bufend ) { + // buffer is full. Need to print out everything up till now + if( flushsubbuffer( stream, stream->bufnlexp - 1 ) ) + { + return EOF; + } + } + + // we have spare space in buffer. Shift everything 1char and + // insert \r + memmove( &stream->buffer[stream->bufnlexp + 1], + &stream->buffer[stream->bufnlexp], + stream->bufidx - stream->bufnlexp ); + stream->buffer[stream->bufnlexp] = '\r'; + + stream->bufnlexp++; + stream->bufidx++; + } + } + } +#endif + return flushsubbuffer( stream, stream->bufidx ); +} + +#endif + + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + /* Testing covered by ftell.c */ + return TEST_RESULTS; +} + +#endif + diff --git a/functions/stdio/_PDCLIB_ftell64.c b/functions/stdio/_PDCLIB_ftell64.c index 77ab872..ea93fc6 100644 --- a/functions/stdio/_PDCLIB_ftell64.c +++ b/functions/stdio/_PDCLIB_ftell64.c @@ -1,62 +1,62 @@ -/* _PDCLIB_ftell64( FILE * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_io.h" - -uint_fast64_t _PDCLIB_ftell64_unlocked( FILE * stream ) -{ - /* ftell() must take into account: - - the actual *physical* offset of the file, i.e. the offset as recognized - by the operating system (and stored in stream->pos.offset); and - - any buffers held by PDCLib, which - - in case of unwritten buffers, count in *addition* to the offset; or - - in case of unprocessed pre-read buffers, count in *substraction* to - the offset. (Remember to count ungetidx into this number.) - Conveniently, the calculation ( ( bufend - bufidx ) + ungetidx ) results - in just the right number in both cases: - - in case of unwritten buffers, ( ( 0 - unwritten ) + 0 ) - i.e. unwritten bytes as negative number - - in case of unprocessed pre-read, ( ( preread - processed ) + unget ) - i.e. unprocessed bytes as positive number. - That is how the somewhat obscure return-value calculation works. - */ - - /* ungetc on a stream at offset==0 will cause an overflow to UINT64_MAX. - * C99/C11 says that the return value of ftell in this case is - * "indeterminate" - */ - - return ( stream->pos.offset - ( ( (int)stream->bufend - (int)stream->bufidx ) + (int)stream->ungetidx ) ); -} - -uint_fast64_t _PDCLIB_ftell64( FILE * stream ) -{ - _PDCLIB_flockfile( stream ); - uint_fast64_t pos = _PDCLIB_ftell64_unlocked( stream ); - _PDCLIB_funlockfile( stream ); - return pos; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#include - -int main( void ) -{ - /* Tested by ftell */ - return TEST_RESULTS; -} - -#endif - +/* _PDCLIB_ftell64( FILE * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_io.h" + +uint_fast64_t _PDCLIB_ftell64_unlocked( FILE * stream ) +{ + /* ftell() must take into account: + - the actual *physical* offset of the file, i.e. the offset as recognized + by the operating system (and stored in stream->pos.offset); and + - any buffers held by PDCLib, which + - in case of unwritten buffers, count in *addition* to the offset; or + - in case of unprocessed pre-read buffers, count in *substraction* to + the offset. (Remember to count ungetidx into this number.) + Conveniently, the calculation ( ( bufend - bufidx ) + ungetidx ) results + in just the right number in both cases: + - in case of unwritten buffers, ( ( 0 - unwritten ) + 0 ) + i.e. unwritten bytes as negative number + - in case of unprocessed pre-read, ( ( preread - processed ) + unget ) + i.e. unprocessed bytes as positive number. + That is how the somewhat obscure return-value calculation works. + */ + + /* ungetc on a stream at offset==0 will cause an overflow to UINT64_MAX. + * C99/C11 says that the return value of ftell in this case is + * "indeterminate" + */ + + return ( stream->pos.offset - ( ( (int)stream->bufend - (int)stream->bufidx ) + (int)stream->ungetidx ) ); +} + +uint_fast64_t _PDCLIB_ftell64( FILE * stream ) +{ + _PDCLIB_flockfile( stream ); + uint_fast64_t pos = _PDCLIB_ftell64_unlocked( stream ); + _PDCLIB_funlockfile( stream ); + return pos; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#include + +int main( void ) +{ + /* Tested by ftell */ + return TEST_RESULTS; +} + +#endif + diff --git a/functions/stdio/_PDCLIB_fvopen.c b/functions/stdio/_PDCLIB_fvopen.c index 307d0c9..292ba39 100644 --- a/functions/stdio/_PDCLIB_fvopen.c +++ b/functions/stdio/_PDCLIB_fvopen.c @@ -1,105 +1,105 @@ -/* _PDCLIB_fvopen( _PDCLIB_fd_t, _PDCLIB_fileops_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_glue.h" -#include "_PDCLIB_io.h" -#include -#include - -extern FILE * _PDCLIB_filelist; - -FILE * _PDCLIB_fvopen( - _PDCLIB_fd_t fd, - const _PDCLIB_fileops_t *_PDCLIB_restrict ops, - int mode, - const char *_PDCLIB_restrict filename -) -{ - size_t filename_len; - FILE * rc; - if ( mode == NULL ) - { - /* Mode invalid */ - return NULL; - } - /* To reduce the number of malloc calls, all data fields are concatenated: - * the FILE structure itself, - * ungetc buffer, - * filename buffer, - * data buffer. - Data buffer comes last because it might change in size ( setvbuf() ). - */ - filename_len = filename ? strlen( filename ) + 1 : 1; - if ( ( rc = calloc( 1, sizeof( FILE ) + _PDCLIB_UNGETCBUFSIZE + filename_len + BUFSIZ ) ) == NULL ) - { - /* no memory */ - return NULL; - } - - if(mtx_init(&rc->lock, mtx_recursive) != thrd_success) { - free(rc); - return NULL; - } - - rc->status = mode; - rc->ops = ops; - rc->handle = fd; - /* Setting pointers into the memory block allocated above */ - rc->ungetbuf = (unsigned char *)rc + sizeof( FILE ); - rc->filename = (char *)rc->ungetbuf + _PDCLIB_UNGETCBUFSIZE; - rc->buffer = rc->filename + filename_len; - /* Copying filename to FILE structure */ - if(filename) strcpy( rc->filename, filename ); - /* Initializing the rest of the structure */ - rc->bufsize = BUFSIZ; - rc->bufidx = 0; -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - rc->bufnlexp = 0; -#endif - rc->ungetidx = 0; - /* Setting buffer to _IOLBF because "when opened, a stream is fully - buffered if and only if it can be determined not to refer to an - interactive device." - */ - rc->status |= _IOLBF; - /* TODO: Setting mbstate */ - /* Adding to list of open files */ - rc->next = _PDCLIB_filelist; - _PDCLIB_filelist = rc; - return rc; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - /* Some of the tests are not executed for regression tests, as the libc on - my system is at once less forgiving (segfaults on mode NULL) and more - forgiving (accepts undefined modes). - */ - FILE * fh; - remove( testfile ); - TESTCASE_NOREG( fopen( NULL, NULL ) == NULL ); - TESTCASE( fopen( NULL, "w" ) == NULL ); - TESTCASE_NOREG( fopen( "", NULL ) == NULL ); - TESTCASE( fopen( "", "w" ) == NULL ); - TESTCASE( fopen( "foo", "" ) == NULL ); - TESTCASE_NOREG( fopen( testfile, "wq" ) == NULL ); /* Undefined mode */ - TESTCASE_NOREG( fopen( testfile, "wr" ) == NULL ); /* Undefined mode */ - TESTCASE( ( fh = fopen( testfile, "w" ) ) != NULL ); - TESTCASE( fclose( fh ) == 0 ); - TESTCASE( remove( testfile ) == 0 ); - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_fvopen( _PDCLIB_fd_t, _PDCLIB_fileops_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_glue.h" +#include "_PDCLIB_io.h" +#include +#include + +extern FILE * _PDCLIB_filelist; + +FILE * _PDCLIB_fvopen( + _PDCLIB_fd_t fd, + const _PDCLIB_fileops_t *_PDCLIB_restrict ops, + int mode, + const char *_PDCLIB_restrict filename +) +{ + size_t filename_len; + FILE * rc; + if ( mode == NULL ) + { + /* Mode invalid */ + return NULL; + } + /* To reduce the number of malloc calls, all data fields are concatenated: + * the FILE structure itself, + * ungetc buffer, + * filename buffer, + * data buffer. + Data buffer comes last because it might change in size ( setvbuf() ). + */ + filename_len = filename ? strlen( filename ) + 1 : 1; + if ( ( rc = calloc( 1, sizeof( FILE ) + _PDCLIB_UNGETCBUFSIZE + filename_len + BUFSIZ ) ) == NULL ) + { + /* no memory */ + return NULL; + } + + if(mtx_init(&rc->lock, mtx_recursive) != thrd_success) { + free(rc); + return NULL; + } + + rc->status = mode; + rc->ops = ops; + rc->handle = fd; + /* Setting pointers into the memory block allocated above */ + rc->ungetbuf = (unsigned char *)rc + sizeof( FILE ); + rc->filename = (char *)rc->ungetbuf + _PDCLIB_UNGETCBUFSIZE; + rc->buffer = rc->filename + filename_len; + /* Copying filename to FILE structure */ + if(filename) strcpy( rc->filename, filename ); + /* Initializing the rest of the structure */ + rc->bufsize = BUFSIZ; + rc->bufidx = 0; +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + rc->bufnlexp = 0; +#endif + rc->ungetidx = 0; + /* Setting buffer to _IOLBF because "when opened, a stream is fully + buffered if and only if it can be determined not to refer to an + interactive device." + */ + rc->status |= _IOLBF; + /* TODO: Setting mbstate */ + /* Adding to list of open files */ + rc->next = _PDCLIB_filelist; + _PDCLIB_filelist = rc; + return rc; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + /* Some of the tests are not executed for regression tests, as the libc on + my system is at once less forgiving (segfaults on mode NULL) and more + forgiving (accepts undefined modes). + */ + FILE * fh; + remove( testfile ); + TESTCASE_NOREG( fopen( NULL, NULL ) == NULL ); + TESTCASE( fopen( NULL, "w" ) == NULL ); + TESTCASE_NOREG( fopen( "", NULL ) == NULL ); + TESTCASE( fopen( "", "w" ) == NULL ); + TESTCASE( fopen( "foo", "" ) == NULL ); + TESTCASE_NOREG( fopen( testfile, "wq" ) == NULL ); /* Undefined mode */ + TESTCASE_NOREG( fopen( testfile, "wr" ) == NULL ); /* Undefined mode */ + TESTCASE( ( fh = fopen( testfile, "w" ) ) != NULL ); + TESTCASE( fclose( fh ) == 0 ); + TESTCASE( remove( testfile ) == 0 ); + return TEST_RESULTS; +} + +#endif diff --git a/functions/stdio/_PDCLIB_seek.c b/functions/stdio/_PDCLIB_seek.c index f8dac30..5d88a15 100644 --- a/functions/stdio/_PDCLIB_seek.c +++ b/functions/stdio/_PDCLIB_seek.c @@ -1,41 +1,41 @@ -/* int64_t _PDCLIB_seek( FILE *, int64_t, int ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include -#include -#ifndef REGTEST -#include "_PDCLIB_io.h" - -int_fast64_t _PDCLIB_seek( FILE * stream, - int_fast64_t offset, - int whence ) -{ - int_fast64_t newPos; - if(!stream->ops->seek(stream->handle, offset, whence, &newPos)) { - return EOF; - } - - stream->ungetidx = 0; - stream->bufidx = 0; - stream->bufend = 0; - stream->pos.offset = newPos; - return newPos; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - /* Testing covered by ftell.c */ - return TEST_RESULTS; -} - -#endif - +/* int64_t _PDCLIB_seek( FILE *, int64_t, int ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include +#include +#ifndef REGTEST +#include "_PDCLIB_io.h" + +int_fast64_t _PDCLIB_seek( FILE * stream, + int_fast64_t offset, + int whence ) +{ + int_fast64_t newPos; + if(!stream->ops->seek(stream->handle, offset, whence, &newPos)) { + return EOF; + } + + stream->ungetidx = 0; + stream->bufidx = 0; + stream->bufend = 0; + stream->pos.offset = newPos; + return newPos; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + /* Testing covered by ftell.c */ + return TEST_RESULTS; +} + +#endif + diff --git a/functions/stdio/flockfile.c b/functions/stdio/flockfile.c index c37699b..559f46a 100644 --- a/functions/stdio/flockfile.c +++ b/functions/stdio/flockfile.c @@ -1,33 +1,33 @@ -/* flockfile(FILE * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_io.h" -#include -#include - -void _PDCLIB_flockfile( FILE * file ) -{ - if( mtx_lock( &file->lock ) != thrd_success ) { - abort(); - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // Not tested here - tested by other stdio test drivers - return TEST_RESULTS; -} - -#endif +/* flockfile(FILE * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_io.h" +#include +#include + +void _PDCLIB_flockfile( FILE * file ) +{ + if( mtx_lock( &file->lock ) != thrd_success ) { + abort(); + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // Not tested here - tested by other stdio test drivers + return TEST_RESULTS; +} + +#endif diff --git a/functions/stdio/ftrylockfile.c b/functions/stdio/ftrylockfile.c index f377ec0..efb6719 100644 --- a/functions/stdio/ftrylockfile.c +++ b/functions/stdio/ftrylockfile.c @@ -1,40 +1,40 @@ -/* ftrylockfile( FILE * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_io.h" -#include -#include - -int _PDCLIB_ftrylockfile( FILE * file ) -{ - int res = mtx_trylock( &file->lock ); - switch(res) { - case thrd_success: - return 0; - case thrd_busy: - return 1; - - default: - abort(); - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // Not tested here - tested by other stdio test drivers - return TEST_RESULTS; -} - -#endif +/* ftrylockfile( FILE * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_io.h" +#include +#include + +int _PDCLIB_ftrylockfile( FILE * file ) +{ + int res = mtx_trylock( &file->lock ); + switch(res) { + case thrd_success: + return 0; + case thrd_busy: + return 1; + + default: + abort(); + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // Not tested here - tested by other stdio test drivers + return TEST_RESULTS; +} + +#endif diff --git a/functions/stdio/funlockfile.c b/functions/stdio/funlockfile.c index 4e9ed04..98a375c 100644 --- a/functions/stdio/funlockfile.c +++ b/functions/stdio/funlockfile.c @@ -1,38 +1,38 @@ -/* funlockfile( FILE * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_io.h" -#include -#include - -void _PDCLIB_funlockfile( FILE * file ) -{ - int res = mtx_unlock( &file->lock ); - switch(res) { - case thrd_success: - return; - - default: - abort(); - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // Not tested here - tested by other stdio test drivers - return TEST_RESULTS; -} - -#endif +/* funlockfile( FILE * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_io.h" +#include +#include + +void _PDCLIB_funlockfile( FILE * file ) +{ + int res = mtx_unlock( &file->lock ); + switch(res) { + case thrd_success: + return; + + default: + abort(); + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // Not tested here - tested by other stdio test drivers + return TEST_RESULTS; +} + +#endif diff --git a/functions/string/strdup.c b/functions/string/strdup.c index bbd1e93..78dd01d 100644 --- a/functions/string/strdup.c +++ b/functions/string/strdup.c @@ -1,49 +1,49 @@ -/* [XSI] char * strdup( const char * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifdef REGTEST -#define _POSIX_C_SOURCE 200809L -#endif - -#include -#include - -#ifndef REGTEST - -char *strdup(const char *s) -{ - char* ns = NULL; - if(s) { - size_t len = strlen(s) + 1; - ns = malloc(len); - if(ns) - strncpy(ns, s, len); - } - return ns; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - const char *teststr = "Hello, world"; - const char *teststr2 = "An alternative test string with non-7-bit characters \xFE\x8C\n"; - char *testres, *testres2; - - TESTCASE((testres = strdup(teststr)) != NULL); - TESTCASE((testres2 = strdup(teststr2)) != NULL); - TESTCASE(strcmp(testres, teststr) == 0); - TESTCASE(strcmp(testres2, teststr2) == 0); - free(testres); - free(testres2); - - return TEST_RESULTS; -} - -#endif +/* [XSI] char * strdup( const char * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifdef REGTEST +#define _POSIX_C_SOURCE 200809L +#endif + +#include +#include + +#ifndef REGTEST + +char *strdup(const char *s) +{ + char* ns = NULL; + if(s) { + size_t len = strlen(s) + 1; + ns = malloc(len); + if(ns) + strncpy(ns, s, len); + } + return ns; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + const char *teststr = "Hello, world"; + const char *teststr2 = "An alternative test string with non-7-bit characters \xFE\x8C\n"; + char *testres, *testres2; + + TESTCASE((testres = strdup(teststr)) != NULL); + TESTCASE((testres2 = strdup(teststr2)) != NULL); + TESTCASE(strcmp(testres, teststr) == 0); + TESTCASE(strcmp(testres2, teststr2) == 0); + free(testres); + free(testres2); + + return TEST_RESULTS; +} + +#endif diff --git a/functions/string/strndup.c b/functions/string/strndup.c index 446fb5d..b7baca2 100644 --- a/functions/string/strndup.c +++ b/functions/string/strndup.c @@ -1,63 +1,63 @@ -/* [XSI] char * strndup( const char *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifdef REGTEST -#define _POSIX_C_SOURCE 200809L -#endif - -#include -#include - -#ifndef REGTEST - -char *strndup( const char * s, size_t len ) -{ - char* ns = NULL; - if(s) { - ns = malloc(len + 1); - if(ns) { - ns[len] = 0; - // strncpy to be pedantic about modification in multithreaded - // applications - return strncpy(ns, s, len); - } - } - return ns; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ -#ifndef REGTEST - /* Missing on Windows. Maybe use conditionals? */ - const char *teststr = "Hello, world"; - const char *teststr2 = "\xFE\x8C\n"; - char *testres, *testres2; - - TESTCASE((testres = strndup(teststr, 5)) != NULL); - TESTCASE((testres2 = strndup(teststr2, 1)) != NULL); - TESTCASE(strcmp(testres, teststr) != 0); - TESTCASE(strncmp(testres, teststr, 5) == 0); - TESTCASE(strcmp(testres2, teststr2) != 0); - TESTCASE(strncmp(testres2, teststr2, 1) == 0); - free(testres); - free(testres2); - TESTCASE((testres = strndup(teststr, 20)) != NULL); - TESTCASE((testres2 = strndup(teststr2, 5)) != NULL); - TESTCASE(strcmp(testres, teststr) == 0); - TESTCASE(strcmp(testres2, teststr2) == 0); - free(testres); - free(testres2); -#endif - - return TEST_RESULTS; -} - -#endif +/* [XSI] char * strndup( const char *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifdef REGTEST +#define _POSIX_C_SOURCE 200809L +#endif + +#include +#include + +#ifndef REGTEST + +char *strndup( const char * s, size_t len ) +{ + char* ns = NULL; + if(s) { + ns = malloc(len + 1); + if(ns) { + ns[len] = 0; + // strncpy to be pedantic about modification in multithreaded + // applications + return strncpy(ns, s, len); + } + } + return ns; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ +#ifndef REGTEST + /* Missing on Windows. Maybe use conditionals? */ + const char *teststr = "Hello, world"; + const char *teststr2 = "\xFE\x8C\n"; + char *testres, *testres2; + + TESTCASE((testres = strndup(teststr, 5)) != NULL); + TESTCASE((testres2 = strndup(teststr2, 1)) != NULL); + TESTCASE(strcmp(testres, teststr) != 0); + TESTCASE(strncmp(testres, teststr, 5) == 0); + TESTCASE(strcmp(testres2, teststr2) != 0); + TESTCASE(strncmp(testres2, teststr2, 1) == 0); + free(testres); + free(testres2); + TESTCASE((testres = strndup(teststr, 20)) != NULL); + TESTCASE((testres2 = strndup(teststr2, 5)) != NULL); + TESTCASE(strcmp(testres, teststr) == 0); + TESTCASE(strcmp(testres2, teststr2) == 0); + free(testres); + free(testres2); +#endif + + return TEST_RESULTS; +} + +#endif diff --git a/functions/string/strnlen.c b/functions/string/strnlen.c index a4b5a9e..915fa76 100644 --- a/functions/string/strnlen.c +++ b/functions/string/strnlen.c @@ -1,36 +1,36 @@ -/* strnlen( const char *, size_t len ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST - -size_t strnlen( const char * s, size_t maxlen ) -{ - for( size_t len = 0; len != maxlen; len++ ) - { - if(s[len] == '\0') - return len; - } - return maxlen; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ -#ifndef REGTEST - TESTCASE( strnlen( abcde, 5 ) == 5 ); - TESTCASE( strnlen( abcde, 3 ) == 3 ) - TESTCASE( strnlen( "", SIZE_MAX ) == 0 ); -#endif - return TEST_RESULTS; -} -#endif +/* strnlen( const char *, size_t len ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST + +size_t strnlen( const char * s, size_t maxlen ) +{ + for( size_t len = 0; len != maxlen; len++ ) + { + if(s[len] == '\0') + return len; + } + return maxlen; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ +#ifndef REGTEST + TESTCASE( strnlen( abcde, 5 ) == 5 ); + TESTCASE( strnlen( abcde, 3 ) == 3 ) + TESTCASE( strnlen( "", SIZE_MAX ) == 0 ); +#endif + return TEST_RESULTS; +} +#endif diff --git a/functions/uchar/c16rtomb.c b/functions/uchar/c16rtomb.c index bce172b..5070e28 100644 --- a/functions/uchar/c16rtomb.c +++ b/functions/uchar/c16rtomb.c @@ -1,104 +1,104 @@ -/* c16rtomb( char *, char16_t, mbstate_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef REGTEST -#include -#include -#include -#include -#include -#include "_PDCLIB_encoding.h" -#include "_PDCLIB_locale.h" - -size_t c16rtomb_l( - char *restrict s, - char16_t c16, - mbstate_t *restrict ps, - locale_t restrict l -) -{ - const char16_t *restrict psrc = &c16; - char buf[s ? 0 : MB_CUR_MAX]; - s = s ? s : buf; - - if(!l->_Codec->__c16stombs) { - // Codec doesn't support direct conversion - translate via UCS-4 - if(ps->_Surrogate == 0) { - // No pending surrogate - if((c16 & 0xF800) == 0xD800) { - // Surrogate range - if((c16 & 0x0400) == 0) { - // 0xD800 -> 0xDBFF leading surrogate - ps->_Surrogate = c16; - - // Need more data - // Return 0 - we haven't output anything yet - - /* STD: ISO/IEC 9899:2011 is very implcifit about this being - * the correct return value. N1040, from which the - * function was adopted, is explicit about 0 being a - * valid return. - */ - return (size_t) 0; - } else { - // 0xDC00 -> 0xDFFF trailing surrogate - errno = EILSEQ; - return (size_t) -1; - } - } else { - // BMP range - UTF16 == UCS-4, pass through to c32rtomb_l - return c32rtomb_l(s, c16, ps, l); - } - } else { - // We have a stored surrogate - if((c16 & 0xFC00) == 0xDC00) { - // Trailing surrogate - char32_t c32 = (ps->_Surrogate & 0x3FF) << 10 | (c16 & 0x3FF); - ps->_Surrogate = 0; - return c32rtomb_l(s, c32, ps, l); - } else { - // Not a trailing surrogate - encoding error - errno = EILSEQ; - return (size_t) -1; - } - - } - } else { - // Codec supports direct conversion - size_t srcsz = 1; - size_t dstsz = MB_CUR_MAX; - size_t dstrem = dstsz; - - if(l->_Codec->__c16stombs(&s, &dstrem, &psrc, &srcsz, ps)) { - // Successful conversion - return dstsz - dstrem; - } else { - errno = EILSEQ; - return (size_t) -1; - } - } -} - -size_t c16rtomb( - char *restrict s, - char16_t c16, - mbstate_t *restrict ps -) -{ - return c16rtomb_l(s, c16, ps, _PDCLIB_threadlocale()); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( NO_TESTDRIVER ); - return TEST_RESULTS; -} -#endif +/* c16rtomb( char *, char16_t, mbstate_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef REGTEST +#include +#include +#include +#include +#include +#include "_PDCLIB_encoding.h" +#include "_PDCLIB_locale.h" + +size_t c16rtomb_l( + char *restrict s, + char16_t c16, + mbstate_t *restrict ps, + locale_t restrict l +) +{ + const char16_t *restrict psrc = &c16; + char buf[s ? 0 : MB_CUR_MAX]; + s = s ? s : buf; + + if(!l->_Codec->__c16stombs) { + // Codec doesn't support direct conversion - translate via UCS-4 + if(ps->_Surrogate == 0) { + // No pending surrogate + if((c16 & 0xF800) == 0xD800) { + // Surrogate range + if((c16 & 0x0400) == 0) { + // 0xD800 -> 0xDBFF leading surrogate + ps->_Surrogate = c16; + + // Need more data + // Return 0 - we haven't output anything yet + + /* STD: ISO/IEC 9899:2011 is very implcifit about this being + * the correct return value. N1040, from which the + * function was adopted, is explicit about 0 being a + * valid return. + */ + return (size_t) 0; + } else { + // 0xDC00 -> 0xDFFF trailing surrogate + errno = EILSEQ; + return (size_t) -1; + } + } else { + // BMP range - UTF16 == UCS-4, pass through to c32rtomb_l + return c32rtomb_l(s, c16, ps, l); + } + } else { + // We have a stored surrogate + if((c16 & 0xFC00) == 0xDC00) { + // Trailing surrogate + char32_t c32 = (ps->_Surrogate & 0x3FF) << 10 | (c16 & 0x3FF); + ps->_Surrogate = 0; + return c32rtomb_l(s, c32, ps, l); + } else { + // Not a trailing surrogate - encoding error + errno = EILSEQ; + return (size_t) -1; + } + + } + } else { + // Codec supports direct conversion + size_t srcsz = 1; + size_t dstsz = MB_CUR_MAX; + size_t dstrem = dstsz; + + if(l->_Codec->__c16stombs(&s, &dstrem, &psrc, &srcsz, ps)) { + // Successful conversion + return dstsz - dstrem; + } else { + errno = EILSEQ; + return (size_t) -1; + } + } +} + +size_t c16rtomb( + char *restrict s, + char16_t c16, + mbstate_t *restrict ps +) +{ + return c16rtomb_l(s, c16, ps, _PDCLIB_threadlocale()); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( NO_TESTDRIVER ); + return TEST_RESULTS; +} +#endif diff --git a/functions/uchar/mbrtoc16.c b/functions/uchar/mbrtoc16.c index 93c35fd..c44c165 100644 --- a/functions/uchar/mbrtoc16.c +++ b/functions/uchar/mbrtoc16.c @@ -1,95 +1,95 @@ -/* size_t mbrtoc16( char16_t *, const char *, size_t, mbstate_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef REGTEST -#include -#include -#include -#include -#include "_PDCLIB_encoding.h" -#include "_PDCLIB_locale.h" - -size_t mbrtoc16_l( - char16_t *restrict pc16, - const char *restrict s, - size_t n, - mbstate_t *restrict ps, - locale_t restrict l -) -{ - size_t dstlen = 1; - size_t nr = n; - - if(!l->_Codec->__mbstoc16s) { - // No UTF-16 support in codec. Must synthesize on top of UCS-4 support. - - if(ps->_Surrogate) { - // If a pending surrogate is stored in the state - *pc16 = ps->_Surrogate; - ps->_Surrogate = 0; - return (size_t) -3; - } - - char32_t c32; - size_t res = mbrtoc32_l(&c32, s, n, ps, l); - if(res != (size_t) -1) { - // Conversion was successful. Check for surrogates - if(c32 <= 0xFFFF) { - // BMP char - *pc16 = c32; - } else { - // Supplementary char - *pc16 = 0xD800 | (c32 >> 10); - ps->_Surrogate = 0xDC00 | (c32 & 0x3FF); - } - } - return res; - } else if(l->_Codec->__mbstoc16s(&pc16, &dstlen, &s, &nr, ps)) { - // Successful conversion - if(dstlen == 0) { - // A character was output - if(nr == n) { - // The output character resulted entirely from stored state - return (size_t) -3; - } else if(pc16[-1] == 0) { - // Was null character - return 0; - } else { - // Count of processed characters - return n - nr; - } - } else { - assert(nr == 0 && "Must have processed whole input"); - return (size_t) -2; - } - } else { - // Failed conversion - errno = EILSEQ; - return (size_t) -1; - } -} - -size_t mbrtoc16( - char16_t *restrict pc16, - const char *restrict s, - size_t n, - mbstate_t *restrict ps -) -{ - return mbrtoc16_l(pc16, s, n, ps, _PDCLIB_threadlocale()); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( NO_TESTDRIVER ); - return TEST_RESULTS; -} -#endif +/* size_t mbrtoc16( char16_t *, const char *, size_t, mbstate_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef REGTEST +#include +#include +#include +#include +#include "_PDCLIB_encoding.h" +#include "_PDCLIB_locale.h" + +size_t mbrtoc16_l( + char16_t *restrict pc16, + const char *restrict s, + size_t n, + mbstate_t *restrict ps, + locale_t restrict l +) +{ + size_t dstlen = 1; + size_t nr = n; + + if(!l->_Codec->__mbstoc16s) { + // No UTF-16 support in codec. Must synthesize on top of UCS-4 support. + + if(ps->_Surrogate) { + // If a pending surrogate is stored in the state + *pc16 = ps->_Surrogate; + ps->_Surrogate = 0; + return (size_t) -3; + } + + char32_t c32; + size_t res = mbrtoc32_l(&c32, s, n, ps, l); + if(res != (size_t) -1) { + // Conversion was successful. Check for surrogates + if(c32 <= 0xFFFF) { + // BMP char + *pc16 = c32; + } else { + // Supplementary char + *pc16 = 0xD800 | (c32 >> 10); + ps->_Surrogate = 0xDC00 | (c32 & 0x3FF); + } + } + return res; + } else if(l->_Codec->__mbstoc16s(&pc16, &dstlen, &s, &nr, ps)) { + // Successful conversion + if(dstlen == 0) { + // A character was output + if(nr == n) { + // The output character resulted entirely from stored state + return (size_t) -3; + } else if(pc16[-1] == 0) { + // Was null character + return 0; + } else { + // Count of processed characters + return n - nr; + } + } else { + assert(nr == 0 && "Must have processed whole input"); + return (size_t) -2; + } + } else { + // Failed conversion + errno = EILSEQ; + return (size_t) -1; + } +} + +size_t mbrtoc16( + char16_t *restrict pc16, + const char *restrict s, + size_t n, + mbstate_t *restrict ps +) +{ + return mbrtoc16_l(pc16, s, n, ps, _PDCLIB_threadlocale()); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( NO_TESTDRIVER ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/mbsinit.c b/functions/wchar/mbsinit.c index f78ae4c..0e6d7d3 100644 --- a/functions/wchar/mbsinit.c +++ b/functions/wchar/mbsinit.c @@ -1,53 +1,53 @@ -/* mbsinit( mbstate_t * ps ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_encoding.h" -#include "_PDCLIB_locale.h" - -static int _PDCLIB_mbsinit_l( const mbstate_t *ps, locale_t l ) -{ - if( ps ) { - return ps->_Surrogate == 0 - && ps->_PendState == 0 - && l->_Codec->__mbsinit(ps); - } else return 1; -} - -int mbsinit( const mbstate_t * ps ) -{ - return _PDCLIB_mbsinit_l(ps, _PDCLIB_threadlocale()); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - mbstate_t mbs; - memset(&mbs, 0, sizeof mbs); - - TESTCASE(mbsinit(NULL) != 0); - TESTCASE(mbsinit(&mbs) != 0); - -#ifndef REGTEST - // Surrogate pending - mbs._Surrogate = 0xFEED; - TESTCASE(mbsinit(&mbs) == 0); - - mbs._Surrogate = 0; - mbs._PendState = 1; - TESTCASE(mbsinit(&mbs) == 0); -#endif - return TEST_RESULTS; -} -#endif - - - +/* mbsinit( mbstate_t * ps ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_encoding.h" +#include "_PDCLIB_locale.h" + +static int _PDCLIB_mbsinit_l( const mbstate_t *ps, locale_t l ) +{ + if( ps ) { + return ps->_Surrogate == 0 + && ps->_PendState == 0 + && l->_Codec->__mbsinit(ps); + } else return 1; +} + +int mbsinit( const mbstate_t * ps ) +{ + return _PDCLIB_mbsinit_l(ps, _PDCLIB_threadlocale()); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + mbstate_t mbs; + memset(&mbs, 0, sizeof mbs); + + TESTCASE(mbsinit(NULL) != 0); + TESTCASE(mbsinit(&mbs) != 0); + +#ifndef REGTEST + // Surrogate pending + mbs._Surrogate = 0xFEED; + TESTCASE(mbsinit(&mbs) == 0); + + mbs._Surrogate = 0; + mbs._PendState = 1; + TESTCASE(mbsinit(&mbs) == 0); +#endif + return TEST_RESULTS; +} +#endif + + + diff --git a/functions/wchar/wcscat.c b/functions/wchar/wcscat.c index 22a04c5..c467af0 100644 --- a/functions/wchar/wcscat.c +++ b/functions/wchar/wcscat.c @@ -1,45 +1,45 @@ -/* wcscat( wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wcscat( wchar_t * _PDCLIB_restrict s1, - const wchar_t * _PDCLIB_restrict s2 ) -{ - wchar_t * rc = s1; - if ( *s1 ) - { - while ( *++s1 ); - } - while ( (*s1++ = *s2++) ); - return rc; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t s[] = L"xx\0xxxxxx"; - TESTCASE( wcscat( s, wabcde ) == s ); - TESTCASE( s[2] == L'a' ); - TESTCASE( s[6] == L'e' ); - TESTCASE( s[7] == L'\0' ); - TESTCASE( s[8] == L'x' ); - s[0] = L'\0'; - TESTCASE( wcscat( s, wabcdx ) == s ); - TESTCASE( s[4] == L'x' ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( wcscat( s, L"\0" ) == s ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( s[6] == L'e' ); - return TEST_RESULTS; -} -#endif +/* wcscat( wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wcscat( wchar_t * _PDCLIB_restrict s1, + const wchar_t * _PDCLIB_restrict s2 ) +{ + wchar_t * rc = s1; + if ( *s1 ) + { + while ( *++s1 ); + } + while ( (*s1++ = *s2++) ); + return rc; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t s[] = L"xx\0xxxxxx"; + TESTCASE( wcscat( s, wabcde ) == s ); + TESTCASE( s[2] == L'a' ); + TESTCASE( s[6] == L'e' ); + TESTCASE( s[7] == L'\0' ); + TESTCASE( s[8] == L'x' ); + s[0] = L'\0'; + TESTCASE( wcscat( s, wabcdx ) == s ); + TESTCASE( s[4] == L'x' ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( wcscat( s, L"\0" ) == s ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( s[6] == L'e' ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcschr.c b/functions/wchar/wcschr.c index 0dffcaa..5629aa6 100644 --- a/functions/wchar/wcschr.c +++ b/functions/wchar/wcschr.c @@ -1,32 +1,32 @@ -/* wcschr( const wchar_t *, wchar_t ); - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST - -wchar_t *wcschr(const wchar_t * haystack, wchar_t needle) -{ - while(*haystack) { - if(*haystack == needle) return (wchar_t*) haystack; - haystack++; - } - return NULL; -} - - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* wcschr( const wchar_t *, wchar_t ); + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST + +wchar_t *wcschr(const wchar_t * haystack, wchar_t needle) +{ + while(*haystack) { + if(*haystack == needle) return (wchar_t*) haystack; + haystack++; + } + return NULL; +} + + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wcscmp.c b/functions/wchar/wcscmp.c index 8a3d227..b338b5d 100644 --- a/functions/wchar/wcscmp.c +++ b/functions/wchar/wcscmp.c @@ -1,39 +1,39 @@ -/* wcscmp( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -int wcscmp( const wchar_t * s1, const wchar_t * s2 ) -{ - while ( ( *s1 ) && ( *s1 == *s2 ) ) - { - ++s1; - ++s2; - } - return ( *(wchar_t *)s1 - *(wchar_t *)s2 ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t cmpabcde[] = L"abcde"; - wchar_t cmpabcd_[] = L"abcd\xfc"; - wchar_t empty[] = L""; - TESTCASE( wcscmp( wabcde, cmpabcde ) == 0 ); - TESTCASE( wcscmp( wabcde, wabcdx ) < 0 ); - TESTCASE( wcscmp( wabcdx, wabcde ) > 0 ); - TESTCASE( wcscmp( empty, wabcde ) < 0 ); - TESTCASE( wcscmp( wabcde, empty ) > 0 ); - TESTCASE( wcscmp( wabcde, cmpabcd_ ) < 0 ); - return TEST_RESULTS; -} -#endif +/* wcscmp( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +int wcscmp( const wchar_t * s1, const wchar_t * s2 ) +{ + while ( ( *s1 ) && ( *s1 == *s2 ) ) + { + ++s1; + ++s2; + } + return ( *(wchar_t *)s1 - *(wchar_t *)s2 ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t cmpabcde[] = L"abcde"; + wchar_t cmpabcd_[] = L"abcd\xfc"; + wchar_t empty[] = L""; + TESTCASE( wcscmp( wabcde, cmpabcde ) == 0 ); + TESTCASE( wcscmp( wabcde, wabcdx ) < 0 ); + TESTCASE( wcscmp( wabcdx, wabcde ) > 0 ); + TESTCASE( wcscmp( empty, wabcde ) < 0 ); + TESTCASE( wcscmp( wabcde, empty ) > 0 ); + TESTCASE( wcscmp( wabcde, cmpabcd_ ) < 0 ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcscpy.c b/functions/wchar/wcscpy.c index f52041f..62a5266 100644 --- a/functions/wchar/wcscpy.c +++ b/functions/wchar/wcscpy.c @@ -1,33 +1,33 @@ -/* wchar_t * wcscpy( wchar_t *, const wchar_t * ); - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t *wcscpy( wchar_t * _PDCLIB_restrict dest, - const wchar_t * _PDCLIB_restrict src) -{ - wchar_t * rv = dest; - while(*src) { - *(dest++) = *(src++); - } - - return rv; -} - - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* wchar_t * wcscpy( wchar_t *, const wchar_t * ); + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t *wcscpy( wchar_t * _PDCLIB_restrict dest, + const wchar_t * _PDCLIB_restrict src) +{ + wchar_t * rv = dest; + while(*src) { + *(dest++) = *(src++); + } + + return rv; +} + + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wcscspn.c b/functions/wchar/wcscspn.c index 853b06a..248c200 100644 --- a/functions/wchar/wcscspn.c +++ b/functions/wchar/wcscspn.c @@ -1,48 +1,48 @@ -/* wcscspn( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -size_t wcscspn( const wchar_t * s1, const wchar_t * s2 ) -{ - size_t len = 0; - const wchar_t * p; - while ( s1[len] ) - { - p = s2; - while ( *p ) - { - if ( s1[len] == *p++ ) - { - return len; - } - } - ++len; - } - return len; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( wcscspn( wabcde, L"x" ) == 5 ); - TESTCASE( wcscspn( wabcde, L"xyz" ) == 5 ); - TESTCASE( wcscspn( wabcde, L"zyx" ) == 5 ); - TESTCASE( wcscspn( wabcdx, L"x" ) == 4 ); - TESTCASE( wcscspn( wabcdx, L"xyz" ) == 4 ); - TESTCASE( wcscspn( wabcdx, L"zyx" ) == 4 ); - TESTCASE( wcscspn( wabcde, L"a" ) == 0 ); - TESTCASE( wcscspn( wabcde, L"abc" ) == 0 ); - TESTCASE( wcscspn( wabcde, L"cba" ) == 0 ); - return TEST_RESULTS; -} -#endif +/* wcscspn( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +size_t wcscspn( const wchar_t * s1, const wchar_t * s2 ) +{ + size_t len = 0; + const wchar_t * p; + while ( s1[len] ) + { + p = s2; + while ( *p ) + { + if ( s1[len] == *p++ ) + { + return len; + } + } + ++len; + } + return len; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( wcscspn( wabcde, L"x" ) == 5 ); + TESTCASE( wcscspn( wabcde, L"xyz" ) == 5 ); + TESTCASE( wcscspn( wabcde, L"zyx" ) == 5 ); + TESTCASE( wcscspn( wabcdx, L"x" ) == 4 ); + TESTCASE( wcscspn( wabcdx, L"xyz" ) == 4 ); + TESTCASE( wcscspn( wabcdx, L"zyx" ) == 4 ); + TESTCASE( wcscspn( wabcde, L"a" ) == 0 ); + TESTCASE( wcscspn( wabcde, L"abc" ) == 0 ); + TESTCASE( wcscspn( wabcde, L"cba" ) == 0 ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcslen.c b/functions/wchar/wcslen.c index 1ae9fe4..00e3ca5 100644 --- a/functions/wchar/wcslen.c +++ b/functions/wchar/wcslen.c @@ -1,29 +1,29 @@ -/* wcslen( const wchar_t * ); - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -size_t wcslen( const wchar_t * str ) -{ - size_t n = 0; - while(*(str++)) n++; - return n; -} - - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* wcslen( const wchar_t * ); + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +size_t wcslen( const wchar_t * str ) +{ + size_t n = 0; + while(*(str++)) n++; + return n; +} + + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wcsncat.c b/functions/wchar/wcsncat.c index b240009..633e54d 100644 --- a/functions/wchar/wcsncat.c +++ b/functions/wchar/wcsncat.c @@ -1,60 +1,60 @@ -/* wcsncat( wchar_t *, const wchar_t *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wcsncat( wchar_t * _PDCLIB_restrict s1, - const wchar_t * _PDCLIB_restrict s2, - size_t n ) -{ - wchar_t * rc = s1; - while ( *s1 ) - { - ++s1; - } - while ( n && ( *s1++ = *s2++ ) ) - { - --n; - } - if ( n == 0 ) - { - *s1 = '\0'; - } - return rc; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t s[] = L"xx\0xxxxxx"; - TESTCASE( wcsncat( s, wabcde, 10 ) == s ); - TESTCASE( s[2] == L'a' ); - TESTCASE( s[6] == L'e' ); - TESTCASE( s[7] == L'\0' ); - TESTCASE( s[8] == L'x' ); - s[0] = L'\0'; - TESTCASE( wcsncat( s, wabcdx, 10 ) == s ); - TESTCASE( s[4] == L'x' ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( wcsncat( s, L"\0", 10 ) == s ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( s[6] == L'e' ); - TESTCASE( wcsncat( s, wabcde, 0 ) == s ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( s[6] == L'e' ); - TESTCASE( wcsncat( s, wabcde, 3 ) == s ); - TESTCASE( s[5] == L'a' ); - TESTCASE( s[7] == L'c' ); - TESTCASE( s[8] == L'\0' ); - return TEST_RESULTS; -} -#endif +/* wcsncat( wchar_t *, const wchar_t *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wcsncat( wchar_t * _PDCLIB_restrict s1, + const wchar_t * _PDCLIB_restrict s2, + size_t n ) +{ + wchar_t * rc = s1; + while ( *s1 ) + { + ++s1; + } + while ( n && ( *s1++ = *s2++ ) ) + { + --n; + } + if ( n == 0 ) + { + *s1 = '\0'; + } + return rc; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t s[] = L"xx\0xxxxxx"; + TESTCASE( wcsncat( s, wabcde, 10 ) == s ); + TESTCASE( s[2] == L'a' ); + TESTCASE( s[6] == L'e' ); + TESTCASE( s[7] == L'\0' ); + TESTCASE( s[8] == L'x' ); + s[0] = L'\0'; + TESTCASE( wcsncat( s, wabcdx, 10 ) == s ); + TESTCASE( s[4] == L'x' ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( wcsncat( s, L"\0", 10 ) == s ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( s[6] == L'e' ); + TESTCASE( wcsncat( s, wabcde, 0 ) == s ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( s[6] == L'e' ); + TESTCASE( wcsncat( s, wabcde, 3 ) == s ); + TESTCASE( s[5] == L'a' ); + TESTCASE( s[7] == L'c' ); + TESTCASE( s[8] == L'\0' ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcsncmp.c b/functions/wchar/wcsncmp.c index 7197c06..d857d7c 100644 --- a/functions/wchar/wcsncmp.c +++ b/functions/wchar/wcsncmp.c @@ -1,52 +1,52 @@ -/* wcsncmp( const wchar_t *, const wchar_t *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -int wcsncmp( const wchar_t * s1, const wchar_t * s2, size_t n ) -{ - while ( *s1 && n && ( *s1 == *s2 ) ) - { - ++s1; - ++s2; - --n; - } - if ( n == 0 ) - { - return 0; - } - else - { - return ( *(wchar_t *)s1 - *(wchar_t *)s2 ); - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t cmpabcde[] = L"abcde\0f"; - wchar_t cmpabcd_[] = L"abcde\xfc"; - wchar_t empty[] = L""; - wchar_t x[] = L"x"; - TESTCASE( wcsncmp( wabcde, cmpabcde, 5 ) == 0 ); - TESTCASE( wcsncmp( wabcde, cmpabcde, 10 ) == 0 ); - TESTCASE( wcsncmp( wabcde, wabcdx, 5 ) < 0 ); - TESTCASE( wcsncmp( wabcdx, wabcde, 5 ) > 0 ); - TESTCASE( wcsncmp( empty, wabcde, 5 ) < 0 ); - TESTCASE( wcsncmp( wabcde, empty, 5 ) > 0 ); - TESTCASE( wcsncmp( wabcde, wabcdx, 4 ) == 0 ); - TESTCASE( wcsncmp( wabcde, x, 0 ) == 0 ); - TESTCASE( wcsncmp( wabcde, x, 1 ) < 0 ); - TESTCASE( wcsncmp( wabcde, cmpabcd_, 10 ) < 0 ); - return TEST_RESULTS; -} -#endif +/* wcsncmp( const wchar_t *, const wchar_t *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +int wcsncmp( const wchar_t * s1, const wchar_t * s2, size_t n ) +{ + while ( *s1 && n && ( *s1 == *s2 ) ) + { + ++s1; + ++s2; + --n; + } + if ( n == 0 ) + { + return 0; + } + else + { + return ( *(wchar_t *)s1 - *(wchar_t *)s2 ); + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t cmpabcde[] = L"abcde\0f"; + wchar_t cmpabcd_[] = L"abcde\xfc"; + wchar_t empty[] = L""; + wchar_t x[] = L"x"; + TESTCASE( wcsncmp( wabcde, cmpabcde, 5 ) == 0 ); + TESTCASE( wcsncmp( wabcde, cmpabcde, 10 ) == 0 ); + TESTCASE( wcsncmp( wabcde, wabcdx, 5 ) < 0 ); + TESTCASE( wcsncmp( wabcdx, wabcde, 5 ) > 0 ); + TESTCASE( wcsncmp( empty, wabcde, 5 ) < 0 ); + TESTCASE( wcsncmp( wabcde, empty, 5 ) > 0 ); + TESTCASE( wcsncmp( wabcde, wabcdx, 4 ) == 0 ); + TESTCASE( wcsncmp( wabcde, x, 0 ) == 0 ); + TESTCASE( wcsncmp( wabcde, x, 1 ) < 0 ); + TESTCASE( wcsncmp( wabcde, cmpabcd_, 10 ) < 0 ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcsncpy.c b/functions/wchar/wcsncpy.c index 5709464..2734fdd 100644 --- a/functions/wchar/wcsncpy.c +++ b/functions/wchar/wcsncpy.c @@ -1,43 +1,43 @@ -/* wchar_t * wcsncpy( wchar_t *, const wchar_t * , size_t ); - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t *wcsncpy( wchar_t * _PDCLIB_restrict s1, - const wchar_t * _PDCLIB_restrict s2, - size_t n ) -{ - wchar_t * rc = s1; - while ( ( n > 0 ) && ( *s1++ = *s2++ ) ) - { - /* Cannot do "n--" in the conditional as size_t is unsigned and we have - to check it again for >0 in the next loop below, so we must not risk - underflow. - */ - --n; - } - /* Checking against 1 as we missed the last --n in the loop above. */ - while ( n-- > 1 ) - { - *s1++ = '\0'; - } - return rc; -} - - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* wchar_t * wcsncpy( wchar_t *, const wchar_t * , size_t ); + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t *wcsncpy( wchar_t * _PDCLIB_restrict s1, + const wchar_t * _PDCLIB_restrict s2, + size_t n ) +{ + wchar_t * rc = s1; + while ( ( n > 0 ) && ( *s1++ = *s2++ ) ) + { + /* Cannot do "n--" in the conditional as size_t is unsigned and we have + to check it again for >0 in the next loop below, so we must not risk + underflow. + */ + --n; + } + /* Checking against 1 as we missed the last --n in the loop above. */ + while ( n-- > 1 ) + { + *s1++ = '\0'; + } + return rc; +} + + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wcspbrk.c b/functions/wchar/wcspbrk.c index c9434f8..6503a85 100644 --- a/functions/wchar/wcspbrk.c +++ b/functions/wchar/wcspbrk.c @@ -1,47 +1,47 @@ -/* wcspbrk( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wcspbrk( const wchar_t * s1, const wchar_t * s2 ) -{ - const wchar_t * p1 = s1; - const wchar_t * p2; - while ( *p1 ) - { - p2 = s2; - while ( *p2 ) - { - if ( *p1 == *p2++ ) - { - return (wchar_t *) p1; - } - } - ++p1; - } - return NULL; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( wcspbrk( wabcde, L"x" ) == NULL ); - TESTCASE( wcspbrk( wabcde, L"xyz" ) == NULL ); - TESTCASE( wcspbrk( wabcdx, L"x" ) == &wabcdx[4] ); - TESTCASE( wcspbrk( wabcdx, L"xyz" ) == &wabcdx[4] ); - TESTCASE( wcspbrk( wabcdx, L"zyx" ) == &wabcdx[4] ); - TESTCASE( wcspbrk( wabcde, L"a" ) == &wabcde[0] ); - TESTCASE( wcspbrk( wabcde, L"abc" ) == &wabcde[0] ); - TESTCASE( wcspbrk( wabcde, L"cba" ) == &wabcde[0] ); - return TEST_RESULTS; -} -#endif +/* wcspbrk( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wcspbrk( const wchar_t * s1, const wchar_t * s2 ) +{ + const wchar_t * p1 = s1; + const wchar_t * p2; + while ( *p1 ) + { + p2 = s2; + while ( *p2 ) + { + if ( *p1 == *p2++ ) + { + return (wchar_t *) p1; + } + } + ++p1; + } + return NULL; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( wcspbrk( wabcde, L"x" ) == NULL ); + TESTCASE( wcspbrk( wabcde, L"xyz" ) == NULL ); + TESTCASE( wcspbrk( wabcdx, L"x" ) == &wabcdx[4] ); + TESTCASE( wcspbrk( wabcdx, L"xyz" ) == &wabcdx[4] ); + TESTCASE( wcspbrk( wabcdx, L"zyx" ) == &wabcdx[4] ); + TESTCASE( wcspbrk( wabcde, L"a" ) == &wabcde[0] ); + TESTCASE( wcspbrk( wabcde, L"abc" ) == &wabcde[0] ); + TESTCASE( wcspbrk( wabcde, L"cba" ) == &wabcde[0] ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcsrchr.c b/functions/wchar/wcsrchr.c index 76e22a3..5f2a66d 100644 --- a/functions/wchar/wcsrchr.c +++ b/functions/wchar/wcsrchr.c @@ -1,33 +1,33 @@ -/* wcsrchr( const wchar_t *, wchar_t ); - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#include - -#ifndef REGTEST - -wchar_t *wcsrchr(const wchar_t * haystack, wchar_t needle) -{ - wchar_t *found = NULL; - while(*haystack) { - if(*haystack == needle) found = (wchar_t*) haystack; - haystack++; - } - return found; -} - - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* wcsrchr( const wchar_t *, wchar_t ); + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#include + +#ifndef REGTEST + +wchar_t *wcsrchr(const wchar_t * haystack, wchar_t needle) +{ + wchar_t *found = NULL; + while(*haystack) { + if(*haystack == needle) found = (wchar_t*) haystack; + haystack++; + } + return found; +} + + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wcsspn.c b/functions/wchar/wcsspn.c index 2f7860f..dbdf522 100644 --- a/functions/wchar/wcsspn.c +++ b/functions/wchar/wcsspn.c @@ -1,47 +1,47 @@ -/* wcsspn( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -size_t wcsspn( const wchar_t * s1, const wchar_t * s2 ) -{ - size_t len = 0; - const wchar_t * p; - while ( s1[ len ] ) - { - p = s2; - while ( *p ) - { - if ( s1[len] == *p ) - { - break; - } - ++p; - } - if ( ! *p ) - { - return len; - } - ++len; - } - return len; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( wcsspn( wabcde, L"abc" ) == 3 ); - TESTCASE( wcsspn( wabcde, L"b" ) == 0 ); - TESTCASE( wcsspn( wabcde, wabcde ) == 5 ); - return TEST_RESULTS; -} -#endif +/* wcsspn( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +size_t wcsspn( const wchar_t * s1, const wchar_t * s2 ) +{ + size_t len = 0; + const wchar_t * p; + while ( s1[ len ] ) + { + p = s2; + while ( *p ) + { + if ( s1[len] == *p ) + { + break; + } + ++p; + } + if ( ! *p ) + { + return len; + } + ++len; + } + return len; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( wcsspn( wabcde, L"abc" ) == 3 ); + TESTCASE( wcsspn( wabcde, L"b" ) == 0 ); + TESTCASE( wcsspn( wabcde, wabcde ) == 5 ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcsstr.c b/functions/wchar/wcsstr.c index 84f7c49..1427a8a 100644 --- a/functions/wchar/wcsstr.c +++ b/functions/wchar/wcsstr.c @@ -1,49 +1,49 @@ -/* wcsstr( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wcsstr( const wchar_t * s1, const wchar_t * s2 ) -{ - const wchar_t * p1 = s1; - const wchar_t * p2; - while ( *s1 ) - { - p2 = s2; - while ( *p2 && ( *p1 == *p2 ) ) - { - ++p1; - ++p2; - } - if ( ! *p2 ) - { - return (wchar_t *) s1; - } - ++s1; - p1 = s1; - } - return NULL; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t s[] = L"abcabcabcdabcde"; - TESTCASE( wcsstr( s, L"x" ) == NULL ); - TESTCASE( wcsstr( s, L"xyz" ) == NULL ); - TESTCASE( wcsstr( s, L"a" ) == &s[0] ); - TESTCASE( wcsstr( s, L"abc" ) == &s[0] ); - TESTCASE( wcsstr( s, L"abcd" ) == &s[6] ); - TESTCASE( wcsstr( s, L"abcde" ) == &s[10] ); - return TEST_RESULTS; -} -#endif +/* wcsstr( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wcsstr( const wchar_t * s1, const wchar_t * s2 ) +{ + const wchar_t * p1 = s1; + const wchar_t * p2; + while ( *s1 ) + { + p2 = s2; + while ( *p2 && ( *p1 == *p2 ) ) + { + ++p1; + ++p2; + } + if ( ! *p2 ) + { + return (wchar_t *) s1; + } + ++s1; + p1 = s1; + } + return NULL; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t s[] = L"abcabcabcdabcde"; + TESTCASE( wcsstr( s, L"x" ) == NULL ); + TESTCASE( wcsstr( s, L"xyz" ) == NULL ); + TESTCASE( wcsstr( s, L"a" ) == &s[0] ); + TESTCASE( wcsstr( s, L"abc" ) == &s[0] ); + TESTCASE( wcsstr( s, L"abcd" ) == &s[6] ); + TESTCASE( wcsstr( s, L"abcde" ) == &s[10] ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wcstok.c b/functions/wchar/wcstok.c index 1341519..b8bcf14 100644 --- a/functions/wchar/wcstok.c +++ b/functions/wchar/wcstok.c @@ -1,113 +1,113 @@ -/* wcstok( wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wcstok( wchar_t * _PDCLIB_restrict s1, - const wchar_t * _PDCLIB_restrict s2, - wchar_t ** _PDCLIB_restrict ptr ) -{ - const wchar_t * p = s2; - - if ( s1 != NULL ) - { - /* new string */ - *ptr = s1; - } - else - { - /* old string continued */ - if ( *ptr == NULL ) - { - /* No old string, no new string, nothing to do */ - return NULL; - } - s1 = *ptr; - } - - /* skipping leading s2 characters */ - while ( *p && *s1 ) - { - if ( *s1 == *p ) - { - /* found seperator; skip and start over */ - ++s1; - p = s2; - continue; - } - ++p; - } - - if ( ! *s1 ) - { - /* no more to parse */ - return ( *ptr = NULL ); - } - - /* skipping non-s2 characters */ - *ptr = s1; - while ( **ptr ) - { - p = s2; - while ( *p ) - { - if ( **ptr == *p++ ) - { - /* found seperator; overwrite with '\0', position *ptr, return */ - *(*ptr)++ = L'\0'; - return s1; - } - } - ++(*ptr); - } - - /* parsed to end of string */ - *ptr = NULL; - return s1; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // MinGW at least has a very nonconforming (different signature!) variety - // of wcstok -#ifndef REGTEST - wchar_t s[] = L"_a_bc__d_"; - wchar_t* state = NULL; - wchar_t* tokres; - - TESTCASE( ( tokres = wcstok( s, L"_", &state ) ) == &s[1] ); - TESTCASE( s[1] == L'a' ); - TESTCASE( s[2] == L'\0' ); - TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[3] ); - TESTCASE( s[3] == L'b' ); - TESTCASE( s[4] == L'c' ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[7] ); - TESTCASE( s[6] == L'_' ); - TESTCASE( s[7] == L'd' ); - TESTCASE( s[8] == L'\0' ); - TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == NULL ); - wcscpy( s, L"ab_cd" ); - TESTCASE( ( tokres = wcstok( s, L"_", &state ) ) == &s[0] ); - TESTCASE( s[0] == L'a' ); - TESTCASE( s[1] == L'b' ); - TESTCASE( s[2] == L'\0' ); - TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[3] ); - TESTCASE( s[3] == L'c' ); - TESTCASE( s[4] == L'd' ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == NULL ); -#endif - return TEST_RESULTS; -} -#endif +/* wcstok( wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wcstok( wchar_t * _PDCLIB_restrict s1, + const wchar_t * _PDCLIB_restrict s2, + wchar_t ** _PDCLIB_restrict ptr ) +{ + const wchar_t * p = s2; + + if ( s1 != NULL ) + { + /* new string */ + *ptr = s1; + } + else + { + /* old string continued */ + if ( *ptr == NULL ) + { + /* No old string, no new string, nothing to do */ + return NULL; + } + s1 = *ptr; + } + + /* skipping leading s2 characters */ + while ( *p && *s1 ) + { + if ( *s1 == *p ) + { + /* found seperator; skip and start over */ + ++s1; + p = s2; + continue; + } + ++p; + } + + if ( ! *s1 ) + { + /* no more to parse */ + return ( *ptr = NULL ); + } + + /* skipping non-s2 characters */ + *ptr = s1; + while ( **ptr ) + { + p = s2; + while ( *p ) + { + if ( **ptr == *p++ ) + { + /* found seperator; overwrite with '\0', position *ptr, return */ + *(*ptr)++ = L'\0'; + return s1; + } + } + ++(*ptr); + } + + /* parsed to end of string */ + *ptr = NULL; + return s1; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // MinGW at least has a very nonconforming (different signature!) variety + // of wcstok +#ifndef REGTEST + wchar_t s[] = L"_a_bc__d_"; + wchar_t* state = NULL; + wchar_t* tokres; + + TESTCASE( ( tokres = wcstok( s, L"_", &state ) ) == &s[1] ); + TESTCASE( s[1] == L'a' ); + TESTCASE( s[2] == L'\0' ); + TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[3] ); + TESTCASE( s[3] == L'b' ); + TESTCASE( s[4] == L'c' ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[7] ); + TESTCASE( s[6] == L'_' ); + TESTCASE( s[7] == L'd' ); + TESTCASE( s[8] == L'\0' ); + TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == NULL ); + wcscpy( s, L"ab_cd" ); + TESTCASE( ( tokres = wcstok( s, L"_", &state ) ) == &s[0] ); + TESTCASE( s[0] == L'a' ); + TESTCASE( s[1] == L'b' ); + TESTCASE( s[2] == L'\0' ); + TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == &s[3] ); + TESTCASE( s[3] == L'c' ); + TESTCASE( s[4] == L'd' ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( ( tokres = wcstok( NULL, L"_", &state ) ) == NULL ); +#endif + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wmemchr.c b/functions/wchar/wmemchr.c index e05b68e..75b010d 100644 --- a/functions/wchar/wmemchr.c +++ b/functions/wchar/wmemchr.c @@ -1,39 +1,39 @@ -/* wmemchr( const void *, int, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wmemchr( const wchar_t * p, wchar_t c, size_t n ) -{ - while ( n-- ) - { - if ( *p == c ) - { - return (wchar_t*) p; - } - ++p; - } - return NULL; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( wmemchr( wabcde, L'c', 5 ) == &wabcde[2] ); - TESTCASE( wmemchr( wabcde, L'a', 1 ) == &wabcde[0] ); - TESTCASE( wmemchr( wabcde, L'a', 0 ) == NULL ); - TESTCASE( wmemchr( wabcde, L'\0', 5 ) == NULL ); - TESTCASE( wmemchr( wabcde, L'\0', 6 ) == &wabcde[5] ); - return TEST_RESULTS; -} - -#endif +/* wmemchr( const void *, int, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wmemchr( const wchar_t * p, wchar_t c, size_t n ) +{ + while ( n-- ) + { + if ( *p == c ) + { + return (wchar_t*) p; + } + ++p; + } + return NULL; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( wmemchr( wabcde, L'c', 5 ) == &wabcde[2] ); + TESTCASE( wmemchr( wabcde, L'a', 1 ) == &wabcde[0] ); + TESTCASE( wmemchr( wabcde, L'a', 0 ) == NULL ); + TESTCASE( wmemchr( wabcde, L'\0', 5 ) == NULL ); + TESTCASE( wmemchr( wabcde, L'\0', 6 ) == &wabcde[5] ); + return TEST_RESULTS; +} + +#endif diff --git a/functions/wchar/wmemcmp.c b/functions/wchar/wmemcmp.c index 1540116..de5d49a 100644 --- a/functions/wchar/wmemcmp.c +++ b/functions/wchar/wmemcmp.c @@ -1,39 +1,39 @@ -/* wmemcmp( const wchar_t *, const wchar_t *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -int wmemcmp( const wchar_t * p1, const wchar_t * p2, size_t n ) -{ - while ( n-- ) - { - if ( *p1 != *p2 ) - { - return *p1 - *p2; - } - ++p1; - ++p2; - } - return 0; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t const xxxxx[] = L"xxxxx"; - TESTCASE( wmemcmp( wabcde, wabcdx, 5 ) < 0 ); - TESTCASE( wmemcmp( wabcde, wabcdx, 4 ) == 0 ); - TESTCASE( wmemcmp( wabcde, xxxxx, 0 ) == 0 ); - TESTCASE( wmemcmp( xxxxx, wabcde, 1 ) > 0 ); - return 0; -} -#endif +/* wmemcmp( const wchar_t *, const wchar_t *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +int wmemcmp( const wchar_t * p1, const wchar_t * p2, size_t n ) +{ + while ( n-- ) + { + if ( *p1 != *p2 ) + { + return *p1 - *p2; + } + ++p1; + ++p2; + } + return 0; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t const xxxxx[] = L"xxxxx"; + TESTCASE( wmemcmp( wabcde, wabcdx, 5 ) < 0 ); + TESTCASE( wmemcmp( wabcde, wabcdx, 4 ) == 0 ); + TESTCASE( wmemcmp( wabcde, xxxxx, 0 ) == 0 ); + TESTCASE( wmemcmp( xxxxx, wabcde, 1 ) > 0 ); + return 0; +} +#endif diff --git a/functions/wchar/wmemcpy.c b/functions/wchar/wmemcpy.c index b0b9c20..2f3bdac 100644 --- a/functions/wchar/wmemcpy.c +++ b/functions/wchar/wmemcpy.c @@ -1,39 +1,39 @@ -/* wmemcpy( wchar_t *, const wchar_t *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wmemcpy( wchar_t * _PDCLIB_restrict dest, - const wchar_t * _PDCLIB_restrict src, - size_t n ) -{ - wchar_t* rv = dest; - while ( n-- ) - { - *dest++ = *src++; - } - return rv; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t s[] = L"xxxxxxxxxxx"; - TESTCASE( wmemcpy( s, wabcde, 6 ) == s ); - TESTCASE( s[4] == L'e' ); - TESTCASE( s[5] == L'\0' ); - TESTCASE( wmemcpy( s + 5, wabcde, 5 ) == s + 5 ); - TESTCASE( s[9] == L'e' ); - TESTCASE( s[10] == L'x' ); - return TEST_RESULTS; -} -#endif +/* wmemcpy( wchar_t *, const wchar_t *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wmemcpy( wchar_t * _PDCLIB_restrict dest, + const wchar_t * _PDCLIB_restrict src, + size_t n ) +{ + wchar_t* rv = dest; + while ( n-- ) + { + *dest++ = *src++; + } + return rv; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t s[] = L"xxxxxxxxxxx"; + TESTCASE( wmemcpy( s, wabcde, 6 ) == s ); + TESTCASE( s[4] == L'e' ); + TESTCASE( s[5] == L'\0' ); + TESTCASE( wmemcpy( s + 5, wabcde, 5 ) == s + 5 ); + TESTCASE( s[9] == L'e' ); + TESTCASE( s[10] == L'x' ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wchar/wmemmove.c b/functions/wchar/wmemmove.c index fe6a53e..a5288f4 100644 --- a/functions/wchar/wmemmove.c +++ b/functions/wchar/wmemmove.c @@ -1,49 +1,49 @@ -/* wmemmove( wchar_t *, const wchar_t *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -wchar_t * wmemmove( wchar_t * dest, const wchar_t * src, size_t n ) -{ - wchar_t* rv = dest; - if ( dest <= src ) - { - while ( n-- ) - { - *dest++ = *src++; - } - } - else - { - src += n; - dest += n; - while ( n-- ) - { - *--dest = *--src; - } - } - return rv; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - wchar_t s[] = L"xxxxabcde"; - TESTCASE( wmemmove( s, s + 4, 5 ) == s ); - TESTCASE( s[0] == L'a' ); - TESTCASE( s[4] == L'e' ); - TESTCASE( s[5] == L'b' ); - TESTCASE( wmemmove( s + 4, s, 5 ) == s + 4 ); - TESTCASE( s[4] == L'a' ); - return TEST_RESULTS; -} -#endif +/* wmemmove( wchar_t *, const wchar_t *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +wchar_t * wmemmove( wchar_t * dest, const wchar_t * src, size_t n ) +{ + wchar_t* rv = dest; + if ( dest <= src ) + { + while ( n-- ) + { + *dest++ = *src++; + } + } + else + { + src += n; + dest += n; + while ( n-- ) + { + *--dest = *--src; + } + } + return rv; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + wchar_t s[] = L"xxxxabcde"; + TESTCASE( wmemmove( s, s + 4, 5 ) == s ); + TESTCASE( s[0] == L'a' ); + TESTCASE( s[4] == L'e' ); + TESTCASE( s[5] == L'b' ); + TESTCASE( wmemmove( s + 4, s, 5 ) == s + 4 ); + TESTCASE( s[4] == L'a' ); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswalnum.c b/functions/wctype/iswalnum.c index 5f12a80..df5dbb2 100644 --- a/functions/wctype/iswalnum.c +++ b/functions/wctype/iswalnum.c @@ -1,30 +1,30 @@ -/* iswalnum( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswalnum( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswalnum(L'a')); - TESTCASE(iswalnum(L'z')); - TESTCASE(iswalnum(L'E')); - TESTCASE(iswalnum(L'3')); - TESTCASE(!iswalnum(L';')); - return TEST_RESULTS; -} -#endif +/* iswalnum( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswalnum( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswalnum(L'a')); + TESTCASE(iswalnum(L'z')); + TESTCASE(iswalnum(L'E')); + TESTCASE(iswalnum(L'3')); + TESTCASE(!iswalnum(L';')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswalpha.c b/functions/wctype/iswalpha.c index 5c17378..9cf5cfa 100644 --- a/functions/wctype/iswalpha.c +++ b/functions/wctype/iswalpha.c @@ -1,30 +1,30 @@ -/* iswalpha( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswalpha( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_ALPHA ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswalpha(L'a')); - TESTCASE(iswalpha(L'z')); - TESTCASE(iswalpha(L'E')); - TESTCASE(!iswalpha(L'3')); - TESTCASE(!iswalpha(L';')); - return TEST_RESULTS; -} -#endif +/* iswalpha( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswalpha( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_ALPHA ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswalpha(L'a')); + TESTCASE(iswalpha(L'z')); + TESTCASE(iswalpha(L'E')); + TESTCASE(!iswalpha(L'3')); + TESTCASE(!iswalpha(L';')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswblank.c b/functions/wctype/iswblank.c index 0823700..a73b9f6 100644 --- a/functions/wctype/iswblank.c +++ b/functions/wctype/iswblank.c @@ -1,29 +1,29 @@ -/* iswblank( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswblank( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_BLANK ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswblank(L' ')); - TESTCASE(iswblank(L'\t')); - TESTCASE(!iswblank(L'\n')); - TESTCASE(!iswblank(L'a')); - return TEST_RESULTS; -} -#endif +/* iswblank( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswblank( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_BLANK ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswblank(L' ')); + TESTCASE(iswblank(L'\t')); + TESTCASE(!iswblank(L'\n')); + TESTCASE(!iswblank(L'a')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswcntrl.c b/functions/wctype/iswcntrl.c index e3cd1cd..1c81c54 100644 --- a/functions/wctype/iswcntrl.c +++ b/functions/wctype/iswcntrl.c @@ -1,30 +1,30 @@ -/* iswcntrl( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswcntrl( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_CNTRL ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswcntrl(L'\0')); - TESTCASE(iswcntrl(L'\n')); - TESTCASE(iswcntrl(L'\v')); - TESTCASE(!iswcntrl(L'\t')); - TESTCASE(!iswcntrl(L'a')); - return TEST_RESULTS; -} -#endif +/* iswcntrl( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswcntrl( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_CNTRL ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswcntrl(L'\0')); + TESTCASE(iswcntrl(L'\n')); + TESTCASE(iswcntrl(L'\v')); + TESTCASE(!iswcntrl(L'\t')); + TESTCASE(!iswcntrl(L'a')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswctype.c b/functions/wctype/iswctype.c index ab626ea..cac4115 100644 --- a/functions/wctype/iswctype.c +++ b/functions/wctype/iswctype.c @@ -1,135 +1,135 @@ -/* iswctype( wint_t, wctype_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int _PDCLIB_iswctype_l( wint_t wc, wctype_t desc, locale_t l ) -{ - wc = _PDCLIB_unpackwint( wc ); - - _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, wc ); - - if(!info) return 0; - - return info->flags & desc; -} - -int iswctype( wint_t wc, wctype_t desc ) -{ - return _PDCLIB_iswctype_l( wc, desc, _PDCLIB_threadlocale() ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE( iswctype(L'a', wctype("alpha"))); - TESTCASE( iswctype(L'z', wctype("alpha"))); - TESTCASE( iswctype(L'E', wctype("alpha"))); - TESTCASE(!iswctype(L'3', wctype("alpha"))); - TESTCASE(!iswctype(L';', wctype("alpha"))); - - TESTCASE( iswctype(L'a', wctype("alnum"))); - TESTCASE( iswctype(L'3', wctype("alnum"))); - TESTCASE(!iswctype(L';', wctype("alnum"))); - - TESTCASE( iswctype(L' ', wctype("blank"))); - TESTCASE( iswctype(L'\t', wctype("blank"))); - TESTCASE(!iswctype(L'\n', wctype("blank"))); - TESTCASE(!iswctype(L';', wctype("blank"))); - - TESTCASE( iswctype(L'\0', wctype("cntrl"))); - TESTCASE( iswctype(L'\n', wctype("cntrl"))); - TESTCASE( iswctype(L'\v', wctype("cntrl"))); - TESTCASE(!iswctype(L'\t', wctype("cntrl"))); - TESTCASE(!iswctype(L'a', wctype("cntrl"))); - - TESTCASE( iswctype(L'0', wctype("digit"))); - TESTCASE( iswctype(L'1', wctype("digit"))); - TESTCASE( iswctype(L'2', wctype("digit"))); - TESTCASE( iswctype(L'3', wctype("digit"))); - TESTCASE( iswctype(L'4', wctype("digit"))); - TESTCASE( iswctype(L'5', wctype("digit"))); - TESTCASE( iswctype(L'6', wctype("digit"))); - TESTCASE( iswctype(L'7', wctype("digit"))); - TESTCASE( iswctype(L'8', wctype("digit"))); - TESTCASE( iswctype(L'9', wctype("digit"))); - TESTCASE(!iswctype(L'X', wctype("digit"))); - TESTCASE(!iswctype(L'?', wctype("digit"))); - - TESTCASE( iswctype(L'a', wctype("graph"))); - TESTCASE( iswctype(L'z', wctype("graph"))); - TESTCASE( iswctype(L'E', wctype("graph"))); - TESTCASE( iswctype(L'E', wctype("graph"))); - TESTCASE(!iswctype(L' ', wctype("graph"))); - TESTCASE(!iswctype(L'\t', wctype("graph"))); - TESTCASE(!iswctype(L'\n', wctype("graph"))); - - TESTCASE( iswctype(L'a', wctype("lower"))); - TESTCASE( iswctype(L'e', wctype("lower"))); - TESTCASE( iswctype(L'z', wctype("lower"))); - TESTCASE(!iswctype(L'A', wctype("lower"))); - TESTCASE(!iswctype(L'E', wctype("lower"))); - TESTCASE(!iswctype(L'Z', wctype("lower"))); - - TESTCASE(!iswctype(L'a', wctype("upper"))); - TESTCASE(!iswctype(L'e', wctype("upper"))); - TESTCASE(!iswctype(L'z', wctype("upper"))); - TESTCASE( iswctype(L'A', wctype("upper"))); - TESTCASE( iswctype(L'E', wctype("upper"))); - TESTCASE( iswctype(L'Z', wctype("upper"))); - - TESTCASE( iswctype(L'Z', wctype("print"))); - TESTCASE( iswctype(L'a', wctype("print"))); - TESTCASE( iswctype(L';', wctype("print"))); - TESTCASE( iswctype(L'\t', wctype("print"))); - TESTCASE(!iswctype(L'\0', wctype("print"))); - - TESTCASE( iswctype(L';', wctype("punct"))); - TESTCASE( iswctype(L'.', wctype("punct"))); - TESTCASE( iswctype(L'?', wctype("punct"))); - TESTCASE(!iswctype(L' ', wctype("punct"))); - TESTCASE(!iswctype(L'Z', wctype("punct"))); - - TESTCASE( iswctype(L' ', wctype("space"))); - TESTCASE( iswctype(L'\t', wctype("space"))); - - TESTCASE( iswctype(L'0', wctype("xdigit"))); - TESTCASE( iswctype(L'1', wctype("xdigit"))); - TESTCASE( iswctype(L'2', wctype("xdigit"))); - TESTCASE( iswctype(L'3', wctype("xdigit"))); - TESTCASE( iswctype(L'4', wctype("xdigit"))); - TESTCASE( iswctype(L'5', wctype("xdigit"))); - TESTCASE( iswctype(L'6', wctype("xdigit"))); - TESTCASE( iswctype(L'7', wctype("xdigit"))); - TESTCASE( iswctype(L'8', wctype("xdigit"))); - TESTCASE( iswctype(L'9', wctype("xdigit"))); - TESTCASE( iswctype(L'a', wctype("xdigit"))); - TESTCASE( iswctype(L'b', wctype("xdigit"))); - TESTCASE( iswctype(L'c', wctype("xdigit"))); - TESTCASE( iswctype(L'd', wctype("xdigit"))); - TESTCASE( iswctype(L'e', wctype("xdigit"))); - TESTCASE( iswctype(L'f', wctype("xdigit"))); - TESTCASE( iswctype(L'A', wctype("xdigit"))); - TESTCASE( iswctype(L'B', wctype("xdigit"))); - TESTCASE( iswctype(L'C', wctype("xdigit"))); - TESTCASE( iswctype(L'D', wctype("xdigit"))); - TESTCASE( iswctype(L'E', wctype("xdigit"))); - TESTCASE( iswctype(L'F', wctype("xdigit"))); - TESTCASE(!iswctype(L'g', wctype("xdigit"))); - TESTCASE(!iswctype(L'G', wctype("xdigit"))); - TESTCASE(!iswctype(L'x', wctype("xdigit"))); - TESTCASE(!iswctype(L'X', wctype("xdigit"))); - TESTCASE(!iswctype(L' ', wctype("xdigit"))); - - return TEST_RESULTS; -} -#endif +/* iswctype( wint_t, wctype_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int _PDCLIB_iswctype_l( wint_t wc, wctype_t desc, locale_t l ) +{ + wc = _PDCLIB_unpackwint( wc ); + + _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, wc ); + + if(!info) return 0; + + return info->flags & desc; +} + +int iswctype( wint_t wc, wctype_t desc ) +{ + return _PDCLIB_iswctype_l( wc, desc, _PDCLIB_threadlocale() ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE( iswctype(L'a', wctype("alpha"))); + TESTCASE( iswctype(L'z', wctype("alpha"))); + TESTCASE( iswctype(L'E', wctype("alpha"))); + TESTCASE(!iswctype(L'3', wctype("alpha"))); + TESTCASE(!iswctype(L';', wctype("alpha"))); + + TESTCASE( iswctype(L'a', wctype("alnum"))); + TESTCASE( iswctype(L'3', wctype("alnum"))); + TESTCASE(!iswctype(L';', wctype("alnum"))); + + TESTCASE( iswctype(L' ', wctype("blank"))); + TESTCASE( iswctype(L'\t', wctype("blank"))); + TESTCASE(!iswctype(L'\n', wctype("blank"))); + TESTCASE(!iswctype(L';', wctype("blank"))); + + TESTCASE( iswctype(L'\0', wctype("cntrl"))); + TESTCASE( iswctype(L'\n', wctype("cntrl"))); + TESTCASE( iswctype(L'\v', wctype("cntrl"))); + TESTCASE(!iswctype(L'\t', wctype("cntrl"))); + TESTCASE(!iswctype(L'a', wctype("cntrl"))); + + TESTCASE( iswctype(L'0', wctype("digit"))); + TESTCASE( iswctype(L'1', wctype("digit"))); + TESTCASE( iswctype(L'2', wctype("digit"))); + TESTCASE( iswctype(L'3', wctype("digit"))); + TESTCASE( iswctype(L'4', wctype("digit"))); + TESTCASE( iswctype(L'5', wctype("digit"))); + TESTCASE( iswctype(L'6', wctype("digit"))); + TESTCASE( iswctype(L'7', wctype("digit"))); + TESTCASE( iswctype(L'8', wctype("digit"))); + TESTCASE( iswctype(L'9', wctype("digit"))); + TESTCASE(!iswctype(L'X', wctype("digit"))); + TESTCASE(!iswctype(L'?', wctype("digit"))); + + TESTCASE( iswctype(L'a', wctype("graph"))); + TESTCASE( iswctype(L'z', wctype("graph"))); + TESTCASE( iswctype(L'E', wctype("graph"))); + TESTCASE( iswctype(L'E', wctype("graph"))); + TESTCASE(!iswctype(L' ', wctype("graph"))); + TESTCASE(!iswctype(L'\t', wctype("graph"))); + TESTCASE(!iswctype(L'\n', wctype("graph"))); + + TESTCASE( iswctype(L'a', wctype("lower"))); + TESTCASE( iswctype(L'e', wctype("lower"))); + TESTCASE( iswctype(L'z', wctype("lower"))); + TESTCASE(!iswctype(L'A', wctype("lower"))); + TESTCASE(!iswctype(L'E', wctype("lower"))); + TESTCASE(!iswctype(L'Z', wctype("lower"))); + + TESTCASE(!iswctype(L'a', wctype("upper"))); + TESTCASE(!iswctype(L'e', wctype("upper"))); + TESTCASE(!iswctype(L'z', wctype("upper"))); + TESTCASE( iswctype(L'A', wctype("upper"))); + TESTCASE( iswctype(L'E', wctype("upper"))); + TESTCASE( iswctype(L'Z', wctype("upper"))); + + TESTCASE( iswctype(L'Z', wctype("print"))); + TESTCASE( iswctype(L'a', wctype("print"))); + TESTCASE( iswctype(L';', wctype("print"))); + TESTCASE( iswctype(L'\t', wctype("print"))); + TESTCASE(!iswctype(L'\0', wctype("print"))); + + TESTCASE( iswctype(L';', wctype("punct"))); + TESTCASE( iswctype(L'.', wctype("punct"))); + TESTCASE( iswctype(L'?', wctype("punct"))); + TESTCASE(!iswctype(L' ', wctype("punct"))); + TESTCASE(!iswctype(L'Z', wctype("punct"))); + + TESTCASE( iswctype(L' ', wctype("space"))); + TESTCASE( iswctype(L'\t', wctype("space"))); + + TESTCASE( iswctype(L'0', wctype("xdigit"))); + TESTCASE( iswctype(L'1', wctype("xdigit"))); + TESTCASE( iswctype(L'2', wctype("xdigit"))); + TESTCASE( iswctype(L'3', wctype("xdigit"))); + TESTCASE( iswctype(L'4', wctype("xdigit"))); + TESTCASE( iswctype(L'5', wctype("xdigit"))); + TESTCASE( iswctype(L'6', wctype("xdigit"))); + TESTCASE( iswctype(L'7', wctype("xdigit"))); + TESTCASE( iswctype(L'8', wctype("xdigit"))); + TESTCASE( iswctype(L'9', wctype("xdigit"))); + TESTCASE( iswctype(L'a', wctype("xdigit"))); + TESTCASE( iswctype(L'b', wctype("xdigit"))); + TESTCASE( iswctype(L'c', wctype("xdigit"))); + TESTCASE( iswctype(L'd', wctype("xdigit"))); + TESTCASE( iswctype(L'e', wctype("xdigit"))); + TESTCASE( iswctype(L'f', wctype("xdigit"))); + TESTCASE( iswctype(L'A', wctype("xdigit"))); + TESTCASE( iswctype(L'B', wctype("xdigit"))); + TESTCASE( iswctype(L'C', wctype("xdigit"))); + TESTCASE( iswctype(L'D', wctype("xdigit"))); + TESTCASE( iswctype(L'E', wctype("xdigit"))); + TESTCASE( iswctype(L'F', wctype("xdigit"))); + TESTCASE(!iswctype(L'g', wctype("xdigit"))); + TESTCASE(!iswctype(L'G', wctype("xdigit"))); + TESTCASE(!iswctype(L'x', wctype("xdigit"))); + TESTCASE(!iswctype(L'X', wctype("xdigit"))); + TESTCASE(!iswctype(L' ', wctype("xdigit"))); + + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswdigit.c b/functions/wctype/iswdigit.c index 127fe59..31300cc 100644 --- a/functions/wctype/iswdigit.c +++ b/functions/wctype/iswdigit.c @@ -1,52 +1,52 @@ -/* iswdigit( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswdigit( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_DIGIT ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswdigit(L'0')); - TESTCASE(iswdigit(L'1')); - TESTCASE(iswdigit(L'2')); - TESTCASE(iswdigit(L'3')); - TESTCASE(iswdigit(L'4')); - TESTCASE(iswdigit(L'5')); - TESTCASE(iswdigit(L'6')); - TESTCASE(iswdigit(L'7')); - TESTCASE(iswdigit(L'8')); - TESTCASE(iswdigit(L'9')); - TESTCASE(!iswdigit(L'a')); - TESTCASE(!iswdigit(L'b')); - TESTCASE(!iswdigit(L'c')); - TESTCASE(!iswdigit(L'd')); - TESTCASE(!iswdigit(L'e')); - TESTCASE(!iswdigit(L'f')); - TESTCASE(!iswdigit(L'A')); - TESTCASE(!iswdigit(L'B')); - TESTCASE(!iswdigit(L'C')); - TESTCASE(!iswdigit(L'D')); - TESTCASE(!iswdigit(L'E')); - TESTCASE(!iswdigit(L'F')); - TESTCASE(!iswdigit(L'g')); - TESTCASE(!iswdigit(L'G')); - TESTCASE(!iswdigit(L'x')); - TESTCASE(!iswdigit(L'X')); - TESTCASE(!iswdigit(L' ')); - return TEST_RESULTS; -} -#endif +/* iswdigit( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswdigit( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_DIGIT ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswdigit(L'0')); + TESTCASE(iswdigit(L'1')); + TESTCASE(iswdigit(L'2')); + TESTCASE(iswdigit(L'3')); + TESTCASE(iswdigit(L'4')); + TESTCASE(iswdigit(L'5')); + TESTCASE(iswdigit(L'6')); + TESTCASE(iswdigit(L'7')); + TESTCASE(iswdigit(L'8')); + TESTCASE(iswdigit(L'9')); + TESTCASE(!iswdigit(L'a')); + TESTCASE(!iswdigit(L'b')); + TESTCASE(!iswdigit(L'c')); + TESTCASE(!iswdigit(L'd')); + TESTCASE(!iswdigit(L'e')); + TESTCASE(!iswdigit(L'f')); + TESTCASE(!iswdigit(L'A')); + TESTCASE(!iswdigit(L'B')); + TESTCASE(!iswdigit(L'C')); + TESTCASE(!iswdigit(L'D')); + TESTCASE(!iswdigit(L'E')); + TESTCASE(!iswdigit(L'F')); + TESTCASE(!iswdigit(L'g')); + TESTCASE(!iswdigit(L'G')); + TESTCASE(!iswdigit(L'x')); + TESTCASE(!iswdigit(L'X')); + TESTCASE(!iswdigit(L' ')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswgraph.c b/functions/wctype/iswgraph.c index 8da4de6..954844a 100644 --- a/functions/wctype/iswgraph.c +++ b/functions/wctype/iswgraph.c @@ -1,31 +1,31 @@ -/* iswgraph( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswgraph( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_GRAPH ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswgraph(L'a')); - TESTCASE(iswgraph(L'z')); - TESTCASE(iswgraph(L'E')); - TESTCASE(!iswgraph(L' ')); - TESTCASE(!iswgraph(L'\t')); - TESTCASE(!iswgraph(L'\n')); - return TEST_RESULTS; -} -#endif +/* iswgraph( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswgraph( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_GRAPH ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswgraph(L'a')); + TESTCASE(iswgraph(L'z')); + TESTCASE(iswgraph(L'E')); + TESTCASE(!iswgraph(L' ')); + TESTCASE(!iswgraph(L'\t')); + TESTCASE(!iswgraph(L'\n')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswlower.c b/functions/wctype/iswlower.c index 7639d4d..628ae64 100644 --- a/functions/wctype/iswlower.c +++ b/functions/wctype/iswlower.c @@ -1,31 +1,31 @@ -/* iswalnum( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswlower( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_LOWER ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswlower(L'a')); - TESTCASE(iswlower(L'e')); - TESTCASE(iswlower(L'z')); - TESTCASE(!iswlower(L'A')); - TESTCASE(!iswlower(L'E')); - TESTCASE(!iswlower(L'Z')); - return TEST_RESULTS; -} -#endif +/* iswalnum( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswlower( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_LOWER ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswlower(L'a')); + TESTCASE(iswlower(L'e')); + TESTCASE(iswlower(L'z')); + TESTCASE(!iswlower(L'A')); + TESTCASE(!iswlower(L'E')); + TESTCASE(!iswlower(L'Z')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswprint.c b/functions/wctype/iswprint.c index 52d4398..395eb63 100644 --- a/functions/wctype/iswprint.c +++ b/functions/wctype/iswprint.c @@ -1,26 +1,26 @@ -/* iswprint( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswprint( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - - return TEST_RESULTS; -} -#endif +/* iswprint( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswprint( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswpunct.c b/functions/wctype/iswpunct.c index b3fe83b..c59672c 100644 --- a/functions/wctype/iswpunct.c +++ b/functions/wctype/iswpunct.c @@ -1,31 +1,31 @@ -/* iswpunct( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswpunct( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_PUNCT ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswpunct(L';')); - TESTCASE(iswpunct(L'?')); - TESTCASE(iswpunct(L'.')); - TESTCASE(!iswpunct(L' ')); - TESTCASE(!iswpunct(L'Z')); - - return TEST_RESULTS; -} -#endif +/* iswpunct( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswpunct( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_PUNCT ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswpunct(L';')); + TESTCASE(iswpunct(L'?')); + TESTCASE(iswpunct(L'.')); + TESTCASE(!iswpunct(L' ')); + TESTCASE(!iswpunct(L'Z')); + + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswspace.c b/functions/wctype/iswspace.c index 85e30f3..501a301 100644 --- a/functions/wctype/iswspace.c +++ b/functions/wctype/iswspace.c @@ -1,28 +1,28 @@ -/* iswspace( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswspace( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_SPACE ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswspace(L' ')); - TESTCASE(iswspace(L'\t')); - TESTCASE(!iswspace(L'a')); - return TEST_RESULTS; -} -#endif +/* iswspace( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswspace( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_SPACE ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswspace(L' ')); + TESTCASE(iswspace(L'\t')); + TESTCASE(!iswspace(L'a')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswupper.c b/functions/wctype/iswupper.c index eed40c7..4806a28 100644 --- a/functions/wctype/iswupper.c +++ b/functions/wctype/iswupper.c @@ -1,31 +1,31 @@ -/* iswupper( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswupper( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_UPPER ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(!iswupper(L'a')); - TESTCASE(!iswupper(L'e')); - TESTCASE(!iswupper(L'z')); - TESTCASE(iswupper(L'A')); - TESTCASE(iswupper(L'E')); - TESTCASE(iswupper(L'Z')); - return TEST_RESULTS; -} -#endif +/* iswupper( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswupper( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_UPPER ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(!iswupper(L'a')); + TESTCASE(!iswupper(L'e')); + TESTCASE(!iswupper(L'z')); + TESTCASE(iswupper(L'A')); + TESTCASE(iswupper(L'E')); + TESTCASE(iswupper(L'Z')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/iswxdigit.c b/functions/wctype/iswxdigit.c index b73440e..3f51ae8 100644 --- a/functions/wctype/iswxdigit.c +++ b/functions/wctype/iswxdigit.c @@ -1,52 +1,52 @@ -/* iswxdigit( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -int iswxdigit( wint_t wc ) -{ - return iswctype( wc, _PDCLIB_CTYPE_XDIGT ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(iswxdigit(L'0')); - TESTCASE(iswxdigit(L'1')); - TESTCASE(iswxdigit(L'2')); - TESTCASE(iswxdigit(L'3')); - TESTCASE(iswxdigit(L'4')); - TESTCASE(iswxdigit(L'5')); - TESTCASE(iswxdigit(L'6')); - TESTCASE(iswxdigit(L'7')); - TESTCASE(iswxdigit(L'8')); - TESTCASE(iswxdigit(L'9')); - TESTCASE(iswxdigit(L'a')); - TESTCASE(iswxdigit(L'b')); - TESTCASE(iswxdigit(L'c')); - TESTCASE(iswxdigit(L'd')); - TESTCASE(iswxdigit(L'e')); - TESTCASE(iswxdigit(L'f')); - TESTCASE(iswxdigit(L'A')); - TESTCASE(iswxdigit(L'B')); - TESTCASE(iswxdigit(L'C')); - TESTCASE(iswxdigit(L'D')); - TESTCASE(iswxdigit(L'E')); - TESTCASE(iswxdigit(L'F')); - TESTCASE(!iswxdigit(L'g')); - TESTCASE(!iswxdigit(L'G')); - TESTCASE(!iswxdigit(L'x')); - TESTCASE(!iswxdigit(L'X')); - TESTCASE(!iswxdigit(L' ')); - return TEST_RESULTS; -} -#endif +/* iswxdigit( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +int iswxdigit( wint_t wc ) +{ + return iswctype( wc, _PDCLIB_CTYPE_XDIGT ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(iswxdigit(L'0')); + TESTCASE(iswxdigit(L'1')); + TESTCASE(iswxdigit(L'2')); + TESTCASE(iswxdigit(L'3')); + TESTCASE(iswxdigit(L'4')); + TESTCASE(iswxdigit(L'5')); + TESTCASE(iswxdigit(L'6')); + TESTCASE(iswxdigit(L'7')); + TESTCASE(iswxdigit(L'8')); + TESTCASE(iswxdigit(L'9')); + TESTCASE(iswxdigit(L'a')); + TESTCASE(iswxdigit(L'b')); + TESTCASE(iswxdigit(L'c')); + TESTCASE(iswxdigit(L'd')); + TESTCASE(iswxdigit(L'e')); + TESTCASE(iswxdigit(L'f')); + TESTCASE(iswxdigit(L'A')); + TESTCASE(iswxdigit(L'B')); + TESTCASE(iswxdigit(L'C')); + TESTCASE(iswxdigit(L'D')); + TESTCASE(iswxdigit(L'E')); + TESTCASE(iswxdigit(L'F')); + TESTCASE(!iswxdigit(L'g')); + TESTCASE(!iswxdigit(L'G')); + TESTCASE(!iswxdigit(L'x')); + TESTCASE(!iswxdigit(L'X')); + TESTCASE(!iswxdigit(L' ')); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/towctrans.c b/functions/wctype/towctrans.c index 5c1c0a2..1ecb2ff 100644 --- a/functions/wctype/towctrans.c +++ b/functions/wctype/towctrans.c @@ -1,42 +1,42 @@ -/* towctrans( wint_t, wctrans_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include -#include "_PDCLIB_locale.h" - -wint_t _PDCLIB_towctrans_l( wint_t wc, wctrans_t trans, locale_t l ) -{ - switch( trans ) { - case 0: return wc; - case _PDCLIB_WCTRANS_TOLOWER: return _PDCLIB_towlower_l( wc, l ); - case _PDCLIB_WCTRANS_TOUPPER: return _PDCLIB_towupper_l( wc, l ); - default: abort(); - } -} - -wint_t towctrans( wint_t wc, wctrans_t trans ) -{ - return _PDCLIB_towctrans_l( wc, trans, _PDCLIB_threadlocale() ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(towctrans(L'a', wctrans("toupper")) == L'A'); - TESTCASE(towctrans(L'B', wctrans("toupper")) == L'B'); - TESTCASE(towctrans(L'a', wctrans("tolower")) == L'a'); - TESTCASE(towctrans(L'B', wctrans("tolower")) == L'b'); - TESTCASE(towctrans(L'B', wctrans("invalid")) == L'B'); - TESTCASE(towctrans(L'B', 0) == L'B'); - return TEST_RESULTS; -} -#endif +/* towctrans( wint_t, wctrans_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include +#include "_PDCLIB_locale.h" + +wint_t _PDCLIB_towctrans_l( wint_t wc, wctrans_t trans, locale_t l ) +{ + switch( trans ) { + case 0: return wc; + case _PDCLIB_WCTRANS_TOLOWER: return _PDCLIB_towlower_l( wc, l ); + case _PDCLIB_WCTRANS_TOUPPER: return _PDCLIB_towupper_l( wc, l ); + default: abort(); + } +} + +wint_t towctrans( wint_t wc, wctrans_t trans ) +{ + return _PDCLIB_towctrans_l( wc, trans, _PDCLIB_threadlocale() ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(towctrans(L'a', wctrans("toupper")) == L'A'); + TESTCASE(towctrans(L'B', wctrans("toupper")) == L'B'); + TESTCASE(towctrans(L'a', wctrans("tolower")) == L'a'); + TESTCASE(towctrans(L'B', wctrans("tolower")) == L'b'); + TESTCASE(towctrans(L'B', wctrans("invalid")) == L'B'); + TESTCASE(towctrans(L'B', 0) == L'B'); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/towlower.c b/functions/wctype/towlower.c index 666bf6b..b81e757 100644 --- a/functions/wctype/towlower.c +++ b/functions/wctype/towlower.c @@ -1,41 +1,41 @@ -/* towlower( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -wint_t _PDCLIB_towlower_l( wint_t wc, locale_t l ) -{ - wint_t uwc = _PDCLIB_unpackwint( wc ); - _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, uwc ); - if( info ) - { - uwc += info->lower_delta; - } - return uwc; -} - -wint_t towlower( wint_t wc ) -{ - return _PDCLIB_towlower_l( wc, _PDCLIB_threadlocale() ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(towlower(0) == 0); - TESTCASE(towlower(L'a') == L'a'); - TESTCASE(towlower(L'B') == L'b'); - TESTCASE(towlower(L'0') == L'0'); - - return TEST_RESULTS; -} -#endif +/* towlower( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +wint_t _PDCLIB_towlower_l( wint_t wc, locale_t l ) +{ + wint_t uwc = _PDCLIB_unpackwint( wc ); + _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, uwc ); + if( info ) + { + uwc += info->lower_delta; + } + return uwc; +} + +wint_t towlower( wint_t wc ) +{ + return _PDCLIB_towlower_l( wc, _PDCLIB_threadlocale() ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(towlower(0) == 0); + TESTCASE(towlower(L'a') == L'a'); + TESTCASE(towlower(L'B') == L'b'); + TESTCASE(towlower(L'0') == L'0'); + + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/towupper.c b/functions/wctype/towupper.c index e04ebc0..368ca2c 100644 --- a/functions/wctype/towupper.c +++ b/functions/wctype/towupper.c @@ -1,41 +1,41 @@ -/* towupper( wint_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include "_PDCLIB_locale.h" - -wint_t _PDCLIB_towupper_l( wint_t wc, locale_t l ) -{ - wint_t uwc = _PDCLIB_unpackwint( wc ); - _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, uwc ); - if( info ) - { - uwc += info->upper_delta; - } - return uwc; -} - -wint_t towupper( wint_t wc ) -{ - return _PDCLIB_towupper_l( wc, _PDCLIB_threadlocale() ); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(towupper(0) == 0); - TESTCASE(towupper(L'a') == L'A'); - TESTCASE(towupper(L'B') == L'B'); - TESTCASE(towupper(L'0') == L'0'); - - return TEST_RESULTS; -} -#endif +/* towupper( wint_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include "_PDCLIB_locale.h" + +wint_t _PDCLIB_towupper_l( wint_t wc, locale_t l ) +{ + wint_t uwc = _PDCLIB_unpackwint( wc ); + _PDCLIB_wcinfo_t *info = _PDCLIB_wcgetinfo( l, uwc ); + if( info ) + { + uwc += info->upper_delta; + } + return uwc; +} + +wint_t towupper( wint_t wc ) +{ + return _PDCLIB_towupper_l( wc, _PDCLIB_threadlocale() ); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(towupper(0) == 0); + TESTCASE(towupper(L'a') == L'A'); + TESTCASE(towupper(L'B') == L'B'); + TESTCASE(towupper(L'0') == L'0'); + + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/wctrans.c b/functions/wctype/wctrans.c index efc18bf..c15bde0 100644 --- a/functions/wctype/wctrans.c +++ b/functions/wctype/wctrans.c @@ -1,38 +1,38 @@ -/* wctrans( const char * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include -#include "_PDCLIB_locale.h" - -wctrans_t wctrans( const char * property ) -{ - if(!property) { - return 0; - } else if(strcmp(property, "tolower") == 0) { - return _PDCLIB_WCTRANS_TOLOWER; - } else if(strcmp(property, "toupper") == 0) { - return _PDCLIB_WCTRANS_TOUPPER; - } else { - return 0; - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(wctrans("") == 0); - TESTCASE(wctrans("invalid") == 0); - TESTCASE(wctrans("toupper") != 0); - TESTCASE(wctrans("tolower") != 0); - return TEST_RESULTS; -} -#endif +/* wctrans( const char * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include +#include "_PDCLIB_locale.h" + +wctrans_t wctrans( const char * property ) +{ + if(!property) { + return 0; + } else if(strcmp(property, "tolower") == 0) { + return _PDCLIB_WCTRANS_TOLOWER; + } else if(strcmp(property, "toupper") == 0) { + return _PDCLIB_WCTRANS_TOUPPER; + } else { + return 0; + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(wctrans("") == 0); + TESTCASE(wctrans("invalid") == 0); + TESTCASE(wctrans("toupper") != 0); + TESTCASE(wctrans("tolower") != 0); + return TEST_RESULTS; +} +#endif diff --git a/functions/wctype/wctype.c b/functions/wctype/wctype.c index c07fc0f..3e8aa1f 100644 --- a/functions/wctype/wctype.c +++ b/functions/wctype/wctype.c @@ -1,110 +1,110 @@ -/* wctype( const char * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include -#ifndef REGTEST -#include -#include "_PDCLIB_locale.h" - -wctype_t wctype( const char * property ) -{ - if(property) switch(property[0]) - { - case 'a': - if(strcmp(property, "alpha") == 0) { - return _PDCLIB_CTYPE_ALPHA; - } else if(strcmp(property, "alnum") == 0) { - return _PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT; - } else return 0; - - case 'b': - if(strcmp(property, "blank") == 0) { - return _PDCLIB_CTYPE_BLANK; - } else return 0; - - case 'c': - if(strcmp(property, "cntrl") == 0) { - return _PDCLIB_CTYPE_CNTRL; - } else return 0; - - case 'd': - if(strcmp(property, "digit") == 0) { - return _PDCLIB_CTYPE_DIGIT; - } else return 0; - - case 'g': - if(strcmp(property, "graph") == 0) { - return _PDCLIB_CTYPE_GRAPH; - } else return 0; - - case 'l': - if(strcmp(property, "lower") == 0) { - return _PDCLIB_CTYPE_LOWER; - } else return 0; - - case 'p': - if(strcmp(property, "print") == 0) { - return _PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE; - } else if(strcmp(property, "punct") == 0) { - return _PDCLIB_CTYPE_PUNCT; - } else return 0; - - case 's': - if(strcmp(property, "space") == 0) { - return _PDCLIB_CTYPE_SPACE; - } else return 0; - - case 'u': - if(strcmp(property, "upper") == 0) { - return _PDCLIB_CTYPE_UPPER; - } else return 0; - - case 'x': - if(strcmp(property, "xdigit") == 0) { - return _PDCLIB_CTYPE_XDIGT; - } else return 0; - } - return 0; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - TESTCASE(wctype("") == 0); - TESTCASE_NOREG(wctype(NULL) == 0); // mingw libc crashes on this - - TESTCASE(wctype("alpha") != 0); - TESTCASE(wctype("alnum") != 0); - TESTCASE(wctype("blank") != 0); - TESTCASE(wctype("cntrl") != 0); - TESTCASE(wctype("digit") != 0); - TESTCASE(wctype("graph") != 0); - TESTCASE(wctype("lower") != 0); - TESTCASE(wctype("print") != 0); - TESTCASE(wctype("punct") != 0); - TESTCASE(wctype("space") != 0); - TESTCASE(wctype("upper") != 0); - TESTCASE(wctype("xdigit") != 0); - - TESTCASE_NOREG(wctype("alpha") == _PDCLIB_CTYPE_ALPHA); - TESTCASE_NOREG(wctype("alnum") == (_PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT)); - TESTCASE_NOREG(wctype("blank") == _PDCLIB_CTYPE_BLANK); - TESTCASE_NOREG(wctype("cntrl") == _PDCLIB_CTYPE_CNTRL); - TESTCASE_NOREG(wctype("digit") == _PDCLIB_CTYPE_DIGIT); - TESTCASE_NOREG(wctype("graph") == _PDCLIB_CTYPE_GRAPH); - TESTCASE_NOREG(wctype("lower") == _PDCLIB_CTYPE_LOWER); - TESTCASE_NOREG(wctype("print") == (_PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE)); - TESTCASE_NOREG(wctype("punct") == _PDCLIB_CTYPE_PUNCT); - TESTCASE_NOREG(wctype("space") == _PDCLIB_CTYPE_SPACE); - TESTCASE_NOREG(wctype("upper") == _PDCLIB_CTYPE_UPPER); - TESTCASE_NOREG(wctype("xdigit") == _PDCLIB_CTYPE_XDIGT); - return TEST_RESULTS; -} -#endif +/* wctype( const char * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include +#ifndef REGTEST +#include +#include "_PDCLIB_locale.h" + +wctype_t wctype( const char * property ) +{ + if(property) switch(property[0]) + { + case 'a': + if(strcmp(property, "alpha") == 0) { + return _PDCLIB_CTYPE_ALPHA; + } else if(strcmp(property, "alnum") == 0) { + return _PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT; + } else return 0; + + case 'b': + if(strcmp(property, "blank") == 0) { + return _PDCLIB_CTYPE_BLANK; + } else return 0; + + case 'c': + if(strcmp(property, "cntrl") == 0) { + return _PDCLIB_CTYPE_CNTRL; + } else return 0; + + case 'd': + if(strcmp(property, "digit") == 0) { + return _PDCLIB_CTYPE_DIGIT; + } else return 0; + + case 'g': + if(strcmp(property, "graph") == 0) { + return _PDCLIB_CTYPE_GRAPH; + } else return 0; + + case 'l': + if(strcmp(property, "lower") == 0) { + return _PDCLIB_CTYPE_LOWER; + } else return 0; + + case 'p': + if(strcmp(property, "print") == 0) { + return _PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE; + } else if(strcmp(property, "punct") == 0) { + return _PDCLIB_CTYPE_PUNCT; + } else return 0; + + case 's': + if(strcmp(property, "space") == 0) { + return _PDCLIB_CTYPE_SPACE; + } else return 0; + + case 'u': + if(strcmp(property, "upper") == 0) { + return _PDCLIB_CTYPE_UPPER; + } else return 0; + + case 'x': + if(strcmp(property, "xdigit") == 0) { + return _PDCLIB_CTYPE_XDIGT; + } else return 0; + } + return 0; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + TESTCASE(wctype("") == 0); + TESTCASE_NOREG(wctype(NULL) == 0); // mingw libc crashes on this + + TESTCASE(wctype("alpha") != 0); + TESTCASE(wctype("alnum") != 0); + TESTCASE(wctype("blank") != 0); + TESTCASE(wctype("cntrl") != 0); + TESTCASE(wctype("digit") != 0); + TESTCASE(wctype("graph") != 0); + TESTCASE(wctype("lower") != 0); + TESTCASE(wctype("print") != 0); + TESTCASE(wctype("punct") != 0); + TESTCASE(wctype("space") != 0); + TESTCASE(wctype("upper") != 0); + TESTCASE(wctype("xdigit") != 0); + + TESTCASE_NOREG(wctype("alpha") == _PDCLIB_CTYPE_ALPHA); + TESTCASE_NOREG(wctype("alnum") == (_PDCLIB_CTYPE_ALPHA | _PDCLIB_CTYPE_DIGIT)); + TESTCASE_NOREG(wctype("blank") == _PDCLIB_CTYPE_BLANK); + TESTCASE_NOREG(wctype("cntrl") == _PDCLIB_CTYPE_CNTRL); + TESTCASE_NOREG(wctype("digit") == _PDCLIB_CTYPE_DIGIT); + TESTCASE_NOREG(wctype("graph") == _PDCLIB_CTYPE_GRAPH); + TESTCASE_NOREG(wctype("lower") == _PDCLIB_CTYPE_LOWER); + TESTCASE_NOREG(wctype("print") == (_PDCLIB_CTYPE_GRAPH | _PDCLIB_CTYPE_SPACE)); + TESTCASE_NOREG(wctype("punct") == _PDCLIB_CTYPE_PUNCT); + TESTCASE_NOREG(wctype("space") == _PDCLIB_CTYPE_SPACE); + TESTCASE_NOREG(wctype("upper") == _PDCLIB_CTYPE_UPPER); + TESTCASE_NOREG(wctype("xdigit") == _PDCLIB_CTYPE_XDIGT); + return TEST_RESULTS; +} +#endif diff --git a/html/style.css b/html/style.css index 20d7d73..d349538 100644 --- a/html/style.css +++ b/html/style.css @@ -1,144 +1,144 @@ -/* - * This is an example style-sheet provided for mandoc(1) and the -Thtml - * or -Txhtml output mode. - * - * It mimics the appearance of the traditional cvsweb output. - * - * See mdoc(7) and man(7) for macro explanations. - */ - -/* modified for pdclib: no max width; our wrapper handles that */; - -html { margin-left: 1em; } -body { font-size: smaller; font-family: Helvetica,Arial,sans-serif; } -h1 { margin-bottom: 1ex; font-size: 110%; margin-left: -4ex; } /* Section header (Sh, SH). */ -h2 { margin-bottom: 1ex; font-size: 105%; margin-left: -2ex; } /* Sub-section header (Ss, SS). */ -table { width: 100%; margin-top: 0ex; margin-bottom: 0ex; } /* All tables. */ -td { vertical-align: top; } /* All table cells. */ -p { } /* Paragraph: Pp, Lp. */ -blockquote { margin-left: 5ex; margin-top: 0ex; margin-bottom: 0ex; } /* D1. */ -div.section { margin-bottom: 2ex; margin-left: 5ex; } /* Sections (Sh, SH). */ -div.subsection { } /* Sub-sections (Ss, SS). */ -table.synopsis { } /* SYNOPSIS section table. */ - -/* Preamble structure. */ - -table.foot { font-size: smaller; margin-top: 1em; border-top: 1px dotted #dddddd; } /* Document footer. */ -td.foot-date { width: 50%; } /* Document footer: date. */ -td.foot-os { width: 50%; text-align: right; } /* Document footer: OS/source. */ -table.head { font-size: smaller; margin-bottom: 1em; border-bottom: 1px dotted #dddddd; } /* Document header. */ -td.head-ltitle { width: 10%; } /* Document header: left-title. */ -td.head-vol { width: 80%; text-align: center; } /* Document header: volume. */ -td.head-rtitle { width: 10%; text-align: right; } /* Document header: right-title. */ - -/* General font modes. */ - -i { } /* Italic: BI, IB, I, (implicit). */ -.emph { font-style: italic; font-weight: normal; } /* Emphasis: Em, Bl -emphasis. */ -b { } /* Bold: SB, BI, IB, BR, RB, B, (implicit). */ -.symb { font-style: normal; font-weight: bold; } /* Symbolic: Sy, Ms, Bf -symbolic. */ -small { } /* Small: SB, SM. */ -.lit { font-style: normal; font-weight: normal; font-family: monospace; } /* Literal: Dl, Li, Ql, Bf -literal, Bl -literal, Bl -unfilled. */ - -/* Block modes. */ - -.display { } /* Top of all Bd, D1, Dl. */ -.list { } /* Top of all Bl. */ - -/* Context-specific modes. */ - -i.addr { font-weight: normal; } /* Address (Ad). */ -i.arg { font-weight: normal; } /* Command argument (Ar). */ -span.author { } /* Author name (An). */ -b.cmd { font-style: normal; } /* Command (Cm). */ -b.config { font-style: normal; } /* Config statement (Cd). */ -span.define { } /* Defines (Dv). */ -span.desc { } /* Nd. After em-dash. */ -b.diag { font-style: normal; } /* Diagnostic (Bl -diag). */ -span.env { } /* Environment variables (Ev). */ -span.errno { } /* Error string (Er). */ -i.farg { font-weight: normal; } /* Function argument (Fa, Fn). */ -i.file { font-weight: normal; } /* File (Pa). */ -b.flag { font-style: normal; } /* Flag (Fl, Cm). */ -b.fname { font-style: normal; } /* Function name (Fa, Fn, Rv). */ -i.ftype { font-weight: normal; } /* Function types (Ft, Fn). */ -b.includes { font-style: normal; } /* Header includes (In). */ -span.lib { } /* Library (Lb). */ -i.link-sec { font-weight: normal; } /* Section links (Sx). */ -b.macro { font-style: normal; } /* Macro-ish thing (Fd). */ -b.name { font-style: normal; } /* Name of utility (Nm). */ -span.opt { } /* Options (Op, Oo/Oc). */ -span.ref { } /* Citations (Rs). */ -span.ref-auth { } /* Reference author (%A). */ -i.ref-book { font-weight: normal; } /* Reference book (%B). */ -span.ref-city { } /* Reference city (%C). */ -span.ref-date { } /* Reference date (%D). */ -i.ref-issue { font-weight: normal; } /* Reference issuer/publisher (%I). */ -i.ref-jrnl { font-weight: normal; } /* Reference journal (%J). */ -span.ref-num { } /* Reference number (%N). */ -span.ref-opt { } /* Reference optionals (%O). */ -span.ref-page { } /* Reference page (%P). */ -span.ref-corp { } /* Reference corporate/foreign author (%Q). */ -span.ref-rep { } /* Reference report (%R). */ -span.ref-title { text-decoration: underline; } /* Reference title (%T). */ -span.ref-vol { } /* Reference volume (%V). */ -span.type { font-style: italic; font-weight: normal; } /* Variable types (Vt). */ -span.unix { } /* Unices (Ux, Ox, Nx, Fx, Bx, Bsx, Dx). */ -b.utility { font-style: normal; } /* Name of utility (Ex). */ -b.var { font-style: normal; } /* Variables (Rv). */ - -a.link-ext { } /* Off-site link (Lk). */ -a.link-includes { } /* Include-file link (In). */ -a.link-mail { } /* Mailto links (Mt). */ -a.link-man { } /* Manual links (Xr). */ -a.link-ref { } /* Reference section links (%Q). */ -a.link-sec { } /* Section links (Sx). */ - -/* Formatting for lists. See mdoc(7). */ - -dl.list-diag { } -dt.list-diag { } -dd.list-diag { } - -dl.list-hang { } -dt.list-hang { } -dd.list-hang { } - -dl.list-inset { } -dt.list-inset { } -dd.list-inset { } - -dl.list-ohang { } -dt.list-ohang { } -dd.list-ohang { margin-left: 0ex; } - -dl.list-tag { } -dt.list-tag { } -dd.list-tag { } - -table.list-col { } -tr.list-col { } -td.list-col { } - -ul.list-bul { list-style-type: disc; padding-left: 1em; } -li.list-bul { } - -ul.list-dash { list-style-type: none; padding-left: 0em; } -li.list-dash:before { content: "\2014 "; } - -ul.list-hyph { list-style-type: none; padding-left: 0em; } -li.list-hyph:before { content: "\2013 "; } - -ul.list-item { list-style-type: none; padding-left: 0em; } -li.list-item { } - -ol.list-enum { padding-left: 2em; } -li.list-enum { } - -/* Equation modes. See eqn(7). */ - -span.eqn { } - -/* Table modes. See tbl(7). */ - +/* + * This is an example style-sheet provided for mandoc(1) and the -Thtml + * or -Txhtml output mode. + * + * It mimics the appearance of the traditional cvsweb output. + * + * See mdoc(7) and man(7) for macro explanations. + */ + +/* modified for pdclib: no max width; our wrapper handles that */; + +html { margin-left: 1em; } +body { font-size: smaller; font-family: Helvetica,Arial,sans-serif; } +h1 { margin-bottom: 1ex; font-size: 110%; margin-left: -4ex; } /* Section header (Sh, SH). */ +h2 { margin-bottom: 1ex; font-size: 105%; margin-left: -2ex; } /* Sub-section header (Ss, SS). */ +table { width: 100%; margin-top: 0ex; margin-bottom: 0ex; } /* All tables. */ +td { vertical-align: top; } /* All table cells. */ +p { } /* Paragraph: Pp, Lp. */ +blockquote { margin-left: 5ex; margin-top: 0ex; margin-bottom: 0ex; } /* D1. */ +div.section { margin-bottom: 2ex; margin-left: 5ex; } /* Sections (Sh, SH). */ +div.subsection { } /* Sub-sections (Ss, SS). */ +table.synopsis { } /* SYNOPSIS section table. */ + +/* Preamble structure. */ + +table.foot { font-size: smaller; margin-top: 1em; border-top: 1px dotted #dddddd; } /* Document footer. */ +td.foot-date { width: 50%; } /* Document footer: date. */ +td.foot-os { width: 50%; text-align: right; } /* Document footer: OS/source. */ +table.head { font-size: smaller; margin-bottom: 1em; border-bottom: 1px dotted #dddddd; } /* Document header. */ +td.head-ltitle { width: 10%; } /* Document header: left-title. */ +td.head-vol { width: 80%; text-align: center; } /* Document header: volume. */ +td.head-rtitle { width: 10%; text-align: right; } /* Document header: right-title. */ + +/* General font modes. */ + +i { } /* Italic: BI, IB, I, (implicit). */ +.emph { font-style: italic; font-weight: normal; } /* Emphasis: Em, Bl -emphasis. */ +b { } /* Bold: SB, BI, IB, BR, RB, B, (implicit). */ +.symb { font-style: normal; font-weight: bold; } /* Symbolic: Sy, Ms, Bf -symbolic. */ +small { } /* Small: SB, SM. */ +.lit { font-style: normal; font-weight: normal; font-family: monospace; } /* Literal: Dl, Li, Ql, Bf -literal, Bl -literal, Bl -unfilled. */ + +/* Block modes. */ + +.display { } /* Top of all Bd, D1, Dl. */ +.list { } /* Top of all Bl. */ + +/* Context-specific modes. */ + +i.addr { font-weight: normal; } /* Address (Ad). */ +i.arg { font-weight: normal; } /* Command argument (Ar). */ +span.author { } /* Author name (An). */ +b.cmd { font-style: normal; } /* Command (Cm). */ +b.config { font-style: normal; } /* Config statement (Cd). */ +span.define { } /* Defines (Dv). */ +span.desc { } /* Nd. After em-dash. */ +b.diag { font-style: normal; } /* Diagnostic (Bl -diag). */ +span.env { } /* Environment variables (Ev). */ +span.errno { } /* Error string (Er). */ +i.farg { font-weight: normal; } /* Function argument (Fa, Fn). */ +i.file { font-weight: normal; } /* File (Pa). */ +b.flag { font-style: normal; } /* Flag (Fl, Cm). */ +b.fname { font-style: normal; } /* Function name (Fa, Fn, Rv). */ +i.ftype { font-weight: normal; } /* Function types (Ft, Fn). */ +b.includes { font-style: normal; } /* Header includes (In). */ +span.lib { } /* Library (Lb). */ +i.link-sec { font-weight: normal; } /* Section links (Sx). */ +b.macro { font-style: normal; } /* Macro-ish thing (Fd). */ +b.name { font-style: normal; } /* Name of utility (Nm). */ +span.opt { } /* Options (Op, Oo/Oc). */ +span.ref { } /* Citations (Rs). */ +span.ref-auth { } /* Reference author (%A). */ +i.ref-book { font-weight: normal; } /* Reference book (%B). */ +span.ref-city { } /* Reference city (%C). */ +span.ref-date { } /* Reference date (%D). */ +i.ref-issue { font-weight: normal; } /* Reference issuer/publisher (%I). */ +i.ref-jrnl { font-weight: normal; } /* Reference journal (%J). */ +span.ref-num { } /* Reference number (%N). */ +span.ref-opt { } /* Reference optionals (%O). */ +span.ref-page { } /* Reference page (%P). */ +span.ref-corp { } /* Reference corporate/foreign author (%Q). */ +span.ref-rep { } /* Reference report (%R). */ +span.ref-title { text-decoration: underline; } /* Reference title (%T). */ +span.ref-vol { } /* Reference volume (%V). */ +span.type { font-style: italic; font-weight: normal; } /* Variable types (Vt). */ +span.unix { } /* Unices (Ux, Ox, Nx, Fx, Bx, Bsx, Dx). */ +b.utility { font-style: normal; } /* Name of utility (Ex). */ +b.var { font-style: normal; } /* Variables (Rv). */ + +a.link-ext { } /* Off-site link (Lk). */ +a.link-includes { } /* Include-file link (In). */ +a.link-mail { } /* Mailto links (Mt). */ +a.link-man { } /* Manual links (Xr). */ +a.link-ref { } /* Reference section links (%Q). */ +a.link-sec { } /* Section links (Sx). */ + +/* Formatting for lists. See mdoc(7). */ + +dl.list-diag { } +dt.list-diag { } +dd.list-diag { } + +dl.list-hang { } +dt.list-hang { } +dd.list-hang { } + +dl.list-inset { } +dt.list-inset { } +dd.list-inset { } + +dl.list-ohang { } +dt.list-ohang { } +dd.list-ohang { margin-left: 0ex; } + +dl.list-tag { } +dt.list-tag { } +dd.list-tag { } + +table.list-col { } +tr.list-col { } +td.list-col { } + +ul.list-bul { list-style-type: disc; padding-left: 1em; } +li.list-bul { } + +ul.list-dash { list-style-type: none; padding-left: 0em; } +li.list-dash:before { content: "\2014 "; } + +ul.list-hyph { list-style-type: none; padding-left: 0em; } +li.list-hyph:before { content: "\2013 "; } + +ul.list-item { list-style-type: none; padding-left: 0em; } +li.list-item { } + +ol.list-enum { padding-left: 2em; } +li.list-enum { } + +/* Equation modes. See eqn(7). */ + +span.eqn { } + +/* Table modes. See tbl(7). */ + table.tbl { } \ No newline at end of file diff --git a/includes/float.h b/includes/float.h index 59dbf54..1d6f89d 100644 --- a/includes/float.h +++ b/includes/float.h @@ -1,101 +1,101 @@ -/* Characteristics of floating types - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef _PDCLIB_FLOAT_H -#define _PDCLIB_FLOAT_H _PDCLIB_FLOAT_H -#include "_PDCLIB_float.h" - -#define FLT_ROUNDS _PDCLIB_FLT_ROUNDS -#define FLT_EVAL_METHOD _PDCLIB_FLT_EVAL_METHOD -#define DECIMAL_DIG _PDCLIB_DECIMAL_DIG - -/* Radix of exponent representation */ -#define FLT_RADIX _PDCLIB_FLT_RADIX - -/* Number of base-FLT_RADIX digits in the significand of a float */ -#define FLT_MANT_DIG _PDCLIB_FLT_MANT_DIG - -/* Number of decimal digits of precision in a float */ -#define FLT_DIG _PDCLIB_FLT_DIG - -/* Difference between 1.0 and the minimum float greater than 1.0 */ -#define FLT_EPSILON _PDCLIB_FLT_EPSILON - -/* Minimum int x such that FLT_RADIX**(x-1) is a normalised float */ -#define FLT_MIN_EXP _PDCLIB_FLT_MIN_EXP - -/* Minimum normalised float */ -#define FLT_MIN _PDCLIB_FLT_MIN - -/* Minimum int x such that 10**x is a normalised float */ -#define FLT_MIN_10_EXP _PDCLIB_FLT_MIN_10_EXP - -/* Maximum int x such that FLT_RADIX**(x-1) is a representable float */ -#define FLT_MAX_EXP _PDCLIB_FLT_MAX_EXP - -/* Maximum float */ -#define FLT_MAX _PDCLIB_FLT_MAX - -/* Maximum int x such that 10**x is a representable float */ -#define FLT_MAX_10_EXP _PDCLIB_FLT_MAX_10_EXP - - -/* Number of base-FLT_RADIX digits in the significand of a double */ -#define DBL_MANT_DIG _PDCLIB_DBL_MANT_DIG - -/* Number of decimal digits of precision in a double */ -#define DBL_DIG _PDCLIB_DBL_DIG - -/* Difference between 1.0 and the minimum double greater than 1.0 */ -#define DBL_EPSILON _PDCLIB_DBL_EPSILON - -/* Minimum int x such that FLT_RADIX**(x-1) is a normalised double */ -#define DBL_MIN_EXP _PDCLIB_DBL_MIN_EXP - -/* Minimum normalised double */ -#define DBL_MIN _PDCLIB_DBL_MIN - -/* Minimum int x such that 10**x is a normalised double */ -#define DBL_MIN_10_EXP _PDCLIB_DBL_MIN_10_EXP - -/* Maximum int x such that FLT_RADIX**(x-1) is a representable double */ -#define DBL_MAX_EXP _PDCLIB_DBL_MAX_EXP - -/* Maximum double */ -#define DBL_MAX _PDCLIB_DBL_MAX - -/* Maximum int x such that 10**x is a representable double */ -#define DBL_MAX_10_EXP _PDCLIB_DBL_MAX_10_EXP - - -/* Number of base-FLT_RADIX digits in the significand of a long double */ -#define LDBL_MANT_DIG _PDCLIB_LDBL_MANT_DIG - -/* Number of decimal digits of precision in a long double */ -#define LDBL_DIG _PDCLIB_LDBL_DIG - -/* Difference between 1.0 and the minimum long double greater than 1.0 */ -#define LDBL_EPSILON _PDCLIB_LDBL_EPSILON - -/* Minimum int x such that FLT_RADIX**(x-1) is a normalised long double */ -#define LDBL_MIN_EXP _PDCLIB_LDBL_MIN_EXP - -/* Minimum normalised long double */ -#define LDBL_MIN _PDCLIB_LDBL_MIN - -/* Minimum int x such that 10**x is a normalised long double */ -#define LDBL_MIN_10_EXP _PDCLIB_LDBL_MIN_10_EXP - -/* Maximum int x such that FLT_RADIX**(x-1) is a representable long double */ -#define LDBL_MAX_EXP _PDCLIB_LDBL_MAX_EXP - -/* Maximum long double */ -#define LDBL_MAX _PDCLIB_LDBL_MAX - -/* Maximum int x such that 10**x is a representable long double */ -#define LDBL_MAX_10_EXP _PDCLIB_LDBL_MAX_10_EXP - -#endif +/* Characteristics of floating types + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef _PDCLIB_FLOAT_H +#define _PDCLIB_FLOAT_H _PDCLIB_FLOAT_H +#include "_PDCLIB_float.h" + +#define FLT_ROUNDS _PDCLIB_FLT_ROUNDS +#define FLT_EVAL_METHOD _PDCLIB_FLT_EVAL_METHOD +#define DECIMAL_DIG _PDCLIB_DECIMAL_DIG + +/* Radix of exponent representation */ +#define FLT_RADIX _PDCLIB_FLT_RADIX + +/* Number of base-FLT_RADIX digits in the significand of a float */ +#define FLT_MANT_DIG _PDCLIB_FLT_MANT_DIG + +/* Number of decimal digits of precision in a float */ +#define FLT_DIG _PDCLIB_FLT_DIG + +/* Difference between 1.0 and the minimum float greater than 1.0 */ +#define FLT_EPSILON _PDCLIB_FLT_EPSILON + +/* Minimum int x such that FLT_RADIX**(x-1) is a normalised float */ +#define FLT_MIN_EXP _PDCLIB_FLT_MIN_EXP + +/* Minimum normalised float */ +#define FLT_MIN _PDCLIB_FLT_MIN + +/* Minimum int x such that 10**x is a normalised float */ +#define FLT_MIN_10_EXP _PDCLIB_FLT_MIN_10_EXP + +/* Maximum int x such that FLT_RADIX**(x-1) is a representable float */ +#define FLT_MAX_EXP _PDCLIB_FLT_MAX_EXP + +/* Maximum float */ +#define FLT_MAX _PDCLIB_FLT_MAX + +/* Maximum int x such that 10**x is a representable float */ +#define FLT_MAX_10_EXP _PDCLIB_FLT_MAX_10_EXP + + +/* Number of base-FLT_RADIX digits in the significand of a double */ +#define DBL_MANT_DIG _PDCLIB_DBL_MANT_DIG + +/* Number of decimal digits of precision in a double */ +#define DBL_DIG _PDCLIB_DBL_DIG + +/* Difference between 1.0 and the minimum double greater than 1.0 */ +#define DBL_EPSILON _PDCLIB_DBL_EPSILON + +/* Minimum int x such that FLT_RADIX**(x-1) is a normalised double */ +#define DBL_MIN_EXP _PDCLIB_DBL_MIN_EXP + +/* Minimum normalised double */ +#define DBL_MIN _PDCLIB_DBL_MIN + +/* Minimum int x such that 10**x is a normalised double */ +#define DBL_MIN_10_EXP _PDCLIB_DBL_MIN_10_EXP + +/* Maximum int x such that FLT_RADIX**(x-1) is a representable double */ +#define DBL_MAX_EXP _PDCLIB_DBL_MAX_EXP + +/* Maximum double */ +#define DBL_MAX _PDCLIB_DBL_MAX + +/* Maximum int x such that 10**x is a representable double */ +#define DBL_MAX_10_EXP _PDCLIB_DBL_MAX_10_EXP + + +/* Number of base-FLT_RADIX digits in the significand of a long double */ +#define LDBL_MANT_DIG _PDCLIB_LDBL_MANT_DIG + +/* Number of decimal digits of precision in a long double */ +#define LDBL_DIG _PDCLIB_LDBL_DIG + +/* Difference between 1.0 and the minimum long double greater than 1.0 */ +#define LDBL_EPSILON _PDCLIB_LDBL_EPSILON + +/* Minimum int x such that FLT_RADIX**(x-1) is a normalised long double */ +#define LDBL_MIN_EXP _PDCLIB_LDBL_MIN_EXP + +/* Minimum normalised long double */ +#define LDBL_MIN _PDCLIB_LDBL_MIN + +/* Minimum int x such that 10**x is a normalised long double */ +#define LDBL_MIN_10_EXP _PDCLIB_LDBL_MIN_10_EXP + +/* Maximum int x such that FLT_RADIX**(x-1) is a representable long double */ +#define LDBL_MAX_EXP _PDCLIB_LDBL_MAX_EXP + +/* Maximum long double */ +#define LDBL_MAX _PDCLIB_LDBL_MAX + +/* Maximum int x such that 10**x is a representable long double */ +#define LDBL_MAX_10_EXP _PDCLIB_LDBL_MAX_10_EXP + +#endif diff --git a/includes/stdnoreturn.h b/includes/stdnoreturn.h index c425308..8c18143 100644 --- a/includes/stdnoreturn.h +++ b/includes/stdnoreturn.h @@ -1,12 +1,12 @@ -/* _Noreturn - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef _PDCLIB_STDNORETURN_H -#define _PDCLIB_STDNORETURN_H _PDCLIB_STDNORETURN_H - -#define noreturn _Noreturn - -#endif +/* _Noreturn + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef _PDCLIB_STDNORETURN_H +#define _PDCLIB_STDNORETURN_H _PDCLIB_STDNORETURN_H + +#define noreturn _Noreturn + +#endif diff --git a/internals/_PDCLIB_float.h b/internals/_PDCLIB_float.h index b2944e7..87a98bf 100644 --- a/internals/_PDCLIB_float.h +++ b/internals/_PDCLIB_float.h @@ -1,93 +1,93 @@ -/* PDCLib internal floating point logic <_PDCLIB_float.h> - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef __PDCLIB_PDCLIB_FLOAT_H -#define __PDCLIB_PDCLIB_FLOAT_H __PDCLIB_PDCLIB_FLOAT_H - -/* IEEE 754 single precision */ -#define _PDCLIB_FP_SINGLE_MIN 1.17549435082228750797e-38 -#define _PDCLIB_FP_SINGLE_EPSILON 1.19209289550781250000e-7 -#define _PDCLIB_FP_SINGLE_HAS_DENORM 1 -#define _PDCLIB_FP_SINGLE_MIN_EXP -125 -#define _PDCLIB_FP_SINGLE_MANT_DIG 24 -#define _PDCLIB_FP_SINGLE_RADIX 2 -#define _PDCLIB_FP_SINGLE_HAS_QUIET_NAN 1 -#define _PDCLIB_FP_SINGLE_MAX_10_EXP 38 -#define _PDCLIB_FP_SINGLE_HAS_INFINITY 1 -#define _PDCLIB_FP_SINGLE_DIG 6 -#define _PDCLIB_FP_SINGLE_MAX_EXP 128 -#define _PDCLIB_FP_SINGLE_DENORM_MIN 1.40129846432481707092e-45 -#define _PDCLIB_FP_SINGLE_MAX 3.40282346638528859812e+38 -#define _PDCLIB_FP_SINGLE_MIN_10_EXP -37 - -/* IEEE 754 double precision */ -#define _PDCLIB_FP_DOUBLE_MIN_EXP -1021 -#define _PDCLIB_FP_DOUBLE_DENORM_MIN 4.94065645841246544177e-324 -#define _PDCLIB_FP_DOUBLE_MIN_10_EXP -307 -#define _PDCLIB_FP_DOUBLE_DIG 15 -#define _PDCLIB_FP_DOUBLE_MAX 1.79769313486231570815e+308 -#define _PDCLIB_FP_DOUBLE_HAS_INFINITY 1 -#define _PDCLIB_FP_DOUBLE_MAX_EXP 1024 -#define _PDCLIB_FP_DOUBLE_MIN 2.22507385850720138309e-308 -#define _PDCLIB_FP_DOUBLE_HAS_DENORM 1 -#define _PDCLIB_FP_DOUBLE_HAS_QUIET_NAN 1 -#define _PDCLIB_FP_DOUBLE_MANT_DIG 53 -#define _PDCLIB_FP_DOUBLE_EPSILON 2.22044604925031308085e-16 -#define _PDCLIB_FP_DOUBLE_MAX_10_EXP 308 - -/* IEEE 754 80-bit extended precision */ -#define _PDCLIB_FP_EXTENDED_MAX 1.18973149535723176502e+4932 -#define _PDCLIB_FP_EXTENDED_MAX_EXP 16384 -#define _PDCLIB_FP_EXTENDED_HAS_INFINITY 1 -#define _PDCLIB_FP_EXTENDED_MIN 3.36210314311209350626e-4932 -#define _PDCLIB_FP_EXTENDED_HAS_QUIET_NAN 1 -#define _PDCLIB_FP_EXTENDED_HAS_DENORM 1 -#define _PDCLIB_FP_EXTENDED_EPSILON 1.08420217248550443401e-19 -#define _PDCLIB_FP_EXTENDED_MANT_DIG 64 -#define _PDCLIB_FP_EXTENDED_MIN_EXP (-16381) -#define _PDCLIB_FP_EXTENDED_MAX_10_EXP 4932 -#define _PDCLIB_FP_EXTENDED_DENORM_MIN 3.64519953188247460253e-4951 -#define _PDCLIB_FP_EXTENDED_MIN_10_EXP (-4931) -#define _PDCLIB_FP_EXTENDED_DIG 18 - -/* TODO: IEEE754 quadruple precision (_PDCLIB_FP_QUADRUPLE_*) and - "double-double" math - */ - -#define _PDCLIB_FLT_RADIX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _RADIX ), f ) -#define _PDCLIB_FLT_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MANT_DIG ) -#define _PDCLIB_FLT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _DIG ) -#define _PDCLIB_FLT_EPSILON _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _EPSILON ), f ) -#define _PDCLIB_FLT_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN_EXP ) -#define _PDCLIB_FLT_MIN _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN ), f ) -#define _PDCLIB_FLT_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN_10_EXP ) -#define _PDCLIB_FLT_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX_EXP ) -#define _PDCLIB_FLT_MAX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX ), f ) -#define _PDCLIB_FLT_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX_10_EXP ) - -#define _PDCLIB_DBL_RADIX _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _RADIX ) -#define _PDCLIB_DBL_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MANT_DIG ) -#define _PDCLIB_DBL_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _DIG ) -#define _PDCLIB_DBL_EPSILON _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _EPSILON ) -#define _PDCLIB_DBL_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN_EXP ) -#define _PDCLIB_DBL_MIN _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN ) -#define _PDCLIB_DBL_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN_10_EXP ) -#define _PDCLIB_DBL_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX_EXP ) -#define _PDCLIB_DBL_MAX _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX ) -#define _PDCLIB_DBL_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX_10_EXP ) - -#define _PDCLIB_LDBL_RADIX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _RADIX ), l ) -#define _PDCLIB_LDBL_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MANT_DIG ) -#define _PDCLIB_LDBL_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _DIG ) -#define _PDCLIB_LDBL_EPSILON _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _EPSILON ), l ) -#define _PDCLIB_LDBL_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN_EXP ) -#define _PDCLIB_LDBL_MIN _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN ), l ) -#define _PDCLIB_LDBL_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN_10_EXP ) -#define _PDCLIB_LDBL_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX_EXP ) -#define _PDCLIB_LDBL_MAX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX ), l ) -#define _PDCLIB_LDBL_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX_10_EXP ) - -#endif +/* PDCLib internal floating point logic <_PDCLIB_float.h> + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef __PDCLIB_PDCLIB_FLOAT_H +#define __PDCLIB_PDCLIB_FLOAT_H __PDCLIB_PDCLIB_FLOAT_H + +/* IEEE 754 single precision */ +#define _PDCLIB_FP_SINGLE_MIN 1.17549435082228750797e-38 +#define _PDCLIB_FP_SINGLE_EPSILON 1.19209289550781250000e-7 +#define _PDCLIB_FP_SINGLE_HAS_DENORM 1 +#define _PDCLIB_FP_SINGLE_MIN_EXP -125 +#define _PDCLIB_FP_SINGLE_MANT_DIG 24 +#define _PDCLIB_FP_SINGLE_RADIX 2 +#define _PDCLIB_FP_SINGLE_HAS_QUIET_NAN 1 +#define _PDCLIB_FP_SINGLE_MAX_10_EXP 38 +#define _PDCLIB_FP_SINGLE_HAS_INFINITY 1 +#define _PDCLIB_FP_SINGLE_DIG 6 +#define _PDCLIB_FP_SINGLE_MAX_EXP 128 +#define _PDCLIB_FP_SINGLE_DENORM_MIN 1.40129846432481707092e-45 +#define _PDCLIB_FP_SINGLE_MAX 3.40282346638528859812e+38 +#define _PDCLIB_FP_SINGLE_MIN_10_EXP -37 + +/* IEEE 754 double precision */ +#define _PDCLIB_FP_DOUBLE_MIN_EXP -1021 +#define _PDCLIB_FP_DOUBLE_DENORM_MIN 4.94065645841246544177e-324 +#define _PDCLIB_FP_DOUBLE_MIN_10_EXP -307 +#define _PDCLIB_FP_DOUBLE_DIG 15 +#define _PDCLIB_FP_DOUBLE_MAX 1.79769313486231570815e+308 +#define _PDCLIB_FP_DOUBLE_HAS_INFINITY 1 +#define _PDCLIB_FP_DOUBLE_MAX_EXP 1024 +#define _PDCLIB_FP_DOUBLE_MIN 2.22507385850720138309e-308 +#define _PDCLIB_FP_DOUBLE_HAS_DENORM 1 +#define _PDCLIB_FP_DOUBLE_HAS_QUIET_NAN 1 +#define _PDCLIB_FP_DOUBLE_MANT_DIG 53 +#define _PDCLIB_FP_DOUBLE_EPSILON 2.22044604925031308085e-16 +#define _PDCLIB_FP_DOUBLE_MAX_10_EXP 308 + +/* IEEE 754 80-bit extended precision */ +#define _PDCLIB_FP_EXTENDED_MAX 1.18973149535723176502e+4932 +#define _PDCLIB_FP_EXTENDED_MAX_EXP 16384 +#define _PDCLIB_FP_EXTENDED_HAS_INFINITY 1 +#define _PDCLIB_FP_EXTENDED_MIN 3.36210314311209350626e-4932 +#define _PDCLIB_FP_EXTENDED_HAS_QUIET_NAN 1 +#define _PDCLIB_FP_EXTENDED_HAS_DENORM 1 +#define _PDCLIB_FP_EXTENDED_EPSILON 1.08420217248550443401e-19 +#define _PDCLIB_FP_EXTENDED_MANT_DIG 64 +#define _PDCLIB_FP_EXTENDED_MIN_EXP (-16381) +#define _PDCLIB_FP_EXTENDED_MAX_10_EXP 4932 +#define _PDCLIB_FP_EXTENDED_DENORM_MIN 3.64519953188247460253e-4951 +#define _PDCLIB_FP_EXTENDED_MIN_10_EXP (-4931) +#define _PDCLIB_FP_EXTENDED_DIG 18 + +/* TODO: IEEE754 quadruple precision (_PDCLIB_FP_QUADRUPLE_*) and + "double-double" math + */ + +#define _PDCLIB_FLT_RADIX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _RADIX ), f ) +#define _PDCLIB_FLT_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MANT_DIG ) +#define _PDCLIB_FLT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _DIG ) +#define _PDCLIB_FLT_EPSILON _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _EPSILON ), f ) +#define _PDCLIB_FLT_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN_EXP ) +#define _PDCLIB_FLT_MIN _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN ), f ) +#define _PDCLIB_FLT_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MIN_10_EXP ) +#define _PDCLIB_FLT_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX_EXP ) +#define _PDCLIB_FLT_MAX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX ), f ) +#define _PDCLIB_FLT_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_FLOAT_TYPE, _MAX_10_EXP ) + +#define _PDCLIB_DBL_RADIX _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _RADIX ) +#define _PDCLIB_DBL_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MANT_DIG ) +#define _PDCLIB_DBL_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _DIG ) +#define _PDCLIB_DBL_EPSILON _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _EPSILON ) +#define _PDCLIB_DBL_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN_EXP ) +#define _PDCLIB_DBL_MIN _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN ) +#define _PDCLIB_DBL_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MIN_10_EXP ) +#define _PDCLIB_DBL_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX_EXP ) +#define _PDCLIB_DBL_MAX _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX ) +#define _PDCLIB_DBL_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_DOUBLE_TYPE, _MAX_10_EXP ) + +#define _PDCLIB_LDBL_RADIX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _RADIX ), l ) +#define _PDCLIB_LDBL_MANT_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MANT_DIG ) +#define _PDCLIB_LDBL_DIG _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _DIG ) +#define _PDCLIB_LDBL_EPSILON _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _EPSILON ), l ) +#define _PDCLIB_LDBL_MIN_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN_EXP ) +#define _PDCLIB_LDBL_MIN _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN ), l ) +#define _PDCLIB_LDBL_MIN_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MIN_10_EXP ) +#define _PDCLIB_LDBL_MAX_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX_EXP ) +#define _PDCLIB_LDBL_MAX _PDCLIB_concat( _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX ), l ) +#define _PDCLIB_LDBL_MAX_10_EXP _PDCLIB_concat3( _PDCLIB_FP_, _PDCLIB_LDOUBLE_TYPE, _MAX_10_EXP ) + +#endif diff --git a/internals/_PDCLIB_io.h b/internals/_PDCLIB_io.h index 27c33e7..11f351f 100644 --- a/internals/_PDCLIB_io.h +++ b/internals/_PDCLIB_io.h @@ -1,296 +1,296 @@ -/* PDCLib I/O support <_PDCLIB_io.h> - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef __PDCLIB_IO_H -#define __PDCLIB_IO_H __PDCLIB_IO_H - -#include "_PDCLIB_int.h" -#include "_PDCLIB_threadconfig.h" - -/* Flags for representing mode (see fopen()). Note these must fit the same - status field as the _IO?BF flags in and the internal flags below. -*/ -#define _PDCLIB_FREAD 8u -#define _PDCLIB_FWRITE 16u -#define _PDCLIB_FAPPEND 32u -#define _PDCLIB_FRW 64u -#define _PDCLIB_FBIN 128u - -/* Internal flags, made to fit the same status field as the flags above. */ -/* -------------------------------------------------------------------------- */ -/* free() the buffer memory on closing (false for user-supplied buffer) */ -#define _PDCLIB_FREEBUFFER 512u -/* stream has encountered error / EOF */ -#define _PDCLIB_ERRORFLAG 1024u -#define _PDCLIB_EOFFLAG 2048u -/* stream is wide-oriented */ -#define _PDCLIB_WIDESTREAM 4096u -/* stream is byte-oriented */ -#define _PDCLIB_BYTESTREAM 8192u -/* file associated with stream should be remove()d on closing (tmpfile()) */ -#define _PDCLIB_DELONCLOSE 16384u -/* stream handle should not be free()d on close (stdin, stdout, stderr) */ -#define _PDCLIB_STATIC 32768u - -union _PDCLIB_fd -{ -#if defined(_PDCLIB_OSFD_T) - _PDCLIB_OSFD_T osfd; -#endif - void * pointer; - _PDCLIB_uintptr_t uval; - _PDCLIB_intptr_t sval; -}; - -/******************************************************************************/ -/* Internal functions */ -/******************************************************************************/ - -/* The worker for all printf() type of functions. The pointer spec should point - to the introducing '%' of a conversion specifier. The status structure is to - be that of the current printf() function, of which the members n, s, stream - and arg will be preserved; i will be updated; and all others will be trashed - by the function. - Returns the number of characters parsed as a conversion specifier (0 if none - parsed); returns -1 if the underlying I/O callback returns failure. -*/ -int _PDCLIB_print( const char * spec, struct _PDCLIB_status_t * status ); - -/* The worker for all scanf() type of functions. The pointer spec should point - to the introducing '%' of a conversion specifier. The status structure is to - be that of the current scanf() function, of which the member stream will be - preserved; n, i, and s will be updated; and all others will be trashed by - the function. - Returns a pointer to the first character not parsed as conversion specifier, - or NULL in case of error. - FIXME: Should distinguish between matching and input error -*/ -const char * _PDCLIB_scan( const char * spec, struct _PDCLIB_status_t * status ); - -/* Parsing any fopen() style filemode string into a number of flags. */ -unsigned int _PDCLIB_filemode( const char * mode ); - -/* Sanity checking and preparing of read buffer, should be called first thing - by any stdio read-data function. - Returns 0 on success, EOF on error. - On error, EOF / error flags and errno are set appropriately. -*/ -int _PDCLIB_prepread( _PDCLIB_file_t * stream ); - -/* Sanity checking, should be called first thing by any stdio write-data - function. - Returns 0 on success, EOF on error. - On error, error flags and errno are set appropriately. -*/ -int _PDCLIB_prepwrite( _PDCLIB_file_t * stream ); - -/* Closing all streams on program exit */ -void _PDCLIB_closeall( void ); - -/* Writes a stream's buffer. - Returns 0 on success, EOF on write error. - Sets stream error flags and errno appropriately on error. -*/ -int _PDCLIB_flushbuffer( _PDCLIB_file_t * stream ); - -/* Fills a stream's buffer. - Returns 0 on success, EOF on read error / EOF. - Sets stream EOF / error flags and errno appropriately on error. -*/ -int _PDCLIB_fillbuffer( _PDCLIB_file_t * stream ); - -/* Repositions within a file. Returns new offset on success, - -1 / errno on error. -*/ -_PDCLIB_int_fast64_t _PDCLIB_seek( _PDCLIB_file_t * stream, - _PDCLIB_int_fast64_t offset, int whence ); - -/* File backend I/O operations - * - * PDCLib will call through to these methods as needed to implement the stdio - * functions. - */ -struct _PDCLIB_fileops -{ - /*! Read length bytes from the file into buf; returning the number of bytes - * actually read in *numBytesRead. - * - * Returns true if bytes were read successfully; on end of file, returns - * true with *numBytesRead == 0. - * - * On error, returns false and sets errno appropriately. *numBytesRead is - * ignored in this situation. - */ - _PDCLIB_bool (*read)( _PDCLIB_fd_t self, - void * buf, - _PDCLIB_size_t length, - _PDCLIB_size_t * numBytesRead ); - - /*! Write length bytes to the file from buf; returning the number of bytes - * actually written in *numBytesWritten - * - * Returns true if bytes were written successfully. On error, returns false - * and setss errno appropriately (as with read, *numBytesWritten is - * ignored) - */ - _PDCLIB_bool (*write)( _PDCLIB_fd_t self, const void * buf, - _PDCLIB_size_t length, _PDCLIB_size_t * numBytesWritten ); - - /* Seek to the file offset specified by offset, from location whence, which - * may be one of the standard constants SEEK_SET/SEEK_CUR/SEEK_END - */ - _PDCLIB_bool (*seek)( _PDCLIB_fd_t self, _PDCLIB_int_fast64_t offset, - int whence, _PDCLIB_int_fast64_t *newPos ); - - void (*close)( _PDCLIB_fd_t self ); - - /*! Behaves as read does, except for wide characters. Both length and - * *numCharsRead represent counts of characters, not bytes. - * - * This function is optional; if missing, PDCLib will buffer the character - * data as bytes and perform translation directly into the user's buffers. - * It is useful if your backend can directly take wide characters (for - * example, the Windows console) - */ - _PDCLIB_bool (*wread)( _PDCLIB_fd_t self, _PDCLIB_wchar_t * buf, - _PDCLIB_size_t length, _PDCLIB_size_t * numCharsRead ); - - /* Behaves as write does, except for wide characters. As with wread, both - * length and *numCharsWritten are character counts. - * - * This function is also optional; if missing, PDCLib will buffer the - * character data as bytes and do translation directly from the user's - * buffers. You only need to implement this if your backend can directly - * take wide characters (for example, the Windows console) - */ - _PDCLIB_bool (*wwrite)( _PDCLIB_fd_t self, const _PDCLIB_wchar_t * buf, - _PDCLIB_size_t length, _PDCLIB_size_t * numCharsWritten ); -}; - -/* struct _PDCLIB_file structure */ -struct _PDCLIB_file -{ - const _PDCLIB_fileops_t * ops; - _PDCLIB_fd_t handle; /* OS file handle */ - _PDCLIB_MTX_T lock; /* file lock */ - char * buffer; /* Pointer to buffer memory */ - _PDCLIB_size_t bufsize; /* Size of buffer */ - _PDCLIB_size_t bufidx; /* Index of current position in buffer */ - _PDCLIB_size_t bufend; /* Index of last pre-read character in buffer */ -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - _PDCLIB_size_t bufnlexp; /* Current position of buffer newline expansion */ -#endif - _PDCLIB_size_t ungetidx; /* Number of ungetc()'ed characters */ - unsigned char * ungetbuf; /* ungetc() buffer */ - unsigned int status; /* Status flags; see above */ - /* multibyte parsing status to be added later */ - _PDCLIB_fpos_t pos; /* Offset and multibyte parsing state */ - char * filename; /* Name the current stream has been opened with */ - _PDCLIB_file_t * next; /* Pointer to next struct (internal) */ -}; - -static inline _PDCLIB_size_t _PDCLIB_getchars( char * out, _PDCLIB_size_t n, - int stopchar, - _PDCLIB_file_t * stream ) -{ - _PDCLIB_size_t i = 0; - int c; - while ( stream->ungetidx > 0 && i != n ) - { - c = (unsigned char) - ( out[ i++ ] = stream->ungetbuf[ --(stream->ungetidx) ] ); - if( c == stopchar ) - return i; - } - - while ( i != n ) - { - while ( stream->bufidx != stream->bufend && i != n) - { - c = (unsigned char) stream->buffer[ stream->bufidx++ ]; -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - if ( !( stream->status & _PDCLIB_FBIN ) && c == '\r' ) - { - if ( stream->bufidx == stream->bufend ) - break; - - if ( stream->buffer[ stream->bufidx ] == '\n' ) - { - c = '\n'; - stream->bufidx++; - } - } -#endif - out[ i++ ] = c; - - if( c == stopchar ) - return i; - } - - if ( i != n ) - { - if( _PDCLIB_fillbuffer( stream ) == -1 ) - { - break; - } - } - } - -#ifdef _PDCLIB_NEED_EOL_TRANSLATION - if ( i != n && stream->bufidx != stream->bufend ) - { - // we must have EOF'd immediately after a \r - out[ i++ ] = stream->buffer[ stream->bufidx++ ]; - } -#endif - - return i; -} - -/* Unlocked functions - internal names - * - * We can't use the functions using their "normal" names internally because that - * would cause namespace leakage. Therefore, we use them by prefixed internal - * names - */ -void _PDCLIB_flockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; -int _PDCLIB_ftrylockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; -void _PDCLIB_funlockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; - -int _PDCLIB_getc_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_getchar_unlocked(void) _PDCLIB_nothrow; -int _PDCLIB_putc_unlocked(int c, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_putchar_unlocked(int c) _PDCLIB_nothrow; -void _PDCLIB_clearerr_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_feof_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_ferror_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_fflush_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_fgetc_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_fputc_unlocked(int c, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -_PDCLIB_size_t _PDCLIB_fread_unlocked(void *ptr, _PDCLIB_size_t size, _PDCLIB_size_t n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -_PDCLIB_size_t _PDCLIB_fwrite_unlocked(const void *ptr, _PDCLIB_size_t size, _PDCLIB_size_t n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -char *_PDCLIB_fgets_unlocked(char *s, int n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_fputs_unlocked(const char *s, struct _PDCLIB_file *stream) _PDCLIB_nothrow; -int _PDCLIB_fgetpos_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, _PDCLIB_fpos_t * _PDCLIB_restrict pos ) _PDCLIB_nothrow; -int _PDCLIB_fsetpos_unlocked( struct _PDCLIB_file * stream, const _PDCLIB_fpos_t * pos ) _PDCLIB_nothrow; -long int _PDCLIB_ftell_unlocked( struct _PDCLIB_file * stream ) _PDCLIB_nothrow; -int _PDCLIB_fseek_unlocked( struct _PDCLIB_file * stream, long int offset, int whence ) _PDCLIB_nothrow; -void _PDCLIB_rewind_unlocked( struct _PDCLIB_file * stream ) _PDCLIB_nothrow; - -int _PDCLIB_puts_unlocked( const char * s ) _PDCLIB_nothrow; -int _PDCLIB_ungetc_unlocked( int c, struct _PDCLIB_file * stream ) _PDCLIB_nothrow; - - -int _PDCLIB_printf_unlocked( const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; -int _PDCLIB_vprintf_unlocked( const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; -int _PDCLIB_fprintf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; -int _PDCLIB_vfprintf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; -int _PDCLIB_scanf_unlocked( const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; -int _PDCLIB_vscanf_unlocked( const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; -int _PDCLIB_fscanf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; -int _PDCLIB_vfscanf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; - -#endif +/* PDCLib I/O support <_PDCLIB_io.h> + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef __PDCLIB_IO_H +#define __PDCLIB_IO_H __PDCLIB_IO_H + +#include "_PDCLIB_int.h" +#include "_PDCLIB_threadconfig.h" + +/* Flags for representing mode (see fopen()). Note these must fit the same + status field as the _IO?BF flags in and the internal flags below. +*/ +#define _PDCLIB_FREAD 8u +#define _PDCLIB_FWRITE 16u +#define _PDCLIB_FAPPEND 32u +#define _PDCLIB_FRW 64u +#define _PDCLIB_FBIN 128u + +/* Internal flags, made to fit the same status field as the flags above. */ +/* -------------------------------------------------------------------------- */ +/* free() the buffer memory on closing (false for user-supplied buffer) */ +#define _PDCLIB_FREEBUFFER 512u +/* stream has encountered error / EOF */ +#define _PDCLIB_ERRORFLAG 1024u +#define _PDCLIB_EOFFLAG 2048u +/* stream is wide-oriented */ +#define _PDCLIB_WIDESTREAM 4096u +/* stream is byte-oriented */ +#define _PDCLIB_BYTESTREAM 8192u +/* file associated with stream should be remove()d on closing (tmpfile()) */ +#define _PDCLIB_DELONCLOSE 16384u +/* stream handle should not be free()d on close (stdin, stdout, stderr) */ +#define _PDCLIB_STATIC 32768u + +union _PDCLIB_fd +{ +#if defined(_PDCLIB_OSFD_T) + _PDCLIB_OSFD_T osfd; +#endif + void * pointer; + _PDCLIB_uintptr_t uval; + _PDCLIB_intptr_t sval; +}; + +/******************************************************************************/ +/* Internal functions */ +/******************************************************************************/ + +/* The worker for all printf() type of functions. The pointer spec should point + to the introducing '%' of a conversion specifier. The status structure is to + be that of the current printf() function, of which the members n, s, stream + and arg will be preserved; i will be updated; and all others will be trashed + by the function. + Returns the number of characters parsed as a conversion specifier (0 if none + parsed); returns -1 if the underlying I/O callback returns failure. +*/ +int _PDCLIB_print( const char * spec, struct _PDCLIB_status_t * status ); + +/* The worker for all scanf() type of functions. The pointer spec should point + to the introducing '%' of a conversion specifier. The status structure is to + be that of the current scanf() function, of which the member stream will be + preserved; n, i, and s will be updated; and all others will be trashed by + the function. + Returns a pointer to the first character not parsed as conversion specifier, + or NULL in case of error. + FIXME: Should distinguish between matching and input error +*/ +const char * _PDCLIB_scan( const char * spec, struct _PDCLIB_status_t * status ); + +/* Parsing any fopen() style filemode string into a number of flags. */ +unsigned int _PDCLIB_filemode( const char * mode ); + +/* Sanity checking and preparing of read buffer, should be called first thing + by any stdio read-data function. + Returns 0 on success, EOF on error. + On error, EOF / error flags and errno are set appropriately. +*/ +int _PDCLIB_prepread( _PDCLIB_file_t * stream ); + +/* Sanity checking, should be called first thing by any stdio write-data + function. + Returns 0 on success, EOF on error. + On error, error flags and errno are set appropriately. +*/ +int _PDCLIB_prepwrite( _PDCLIB_file_t * stream ); + +/* Closing all streams on program exit */ +void _PDCLIB_closeall( void ); + +/* Writes a stream's buffer. + Returns 0 on success, EOF on write error. + Sets stream error flags and errno appropriately on error. +*/ +int _PDCLIB_flushbuffer( _PDCLIB_file_t * stream ); + +/* Fills a stream's buffer. + Returns 0 on success, EOF on read error / EOF. + Sets stream EOF / error flags and errno appropriately on error. +*/ +int _PDCLIB_fillbuffer( _PDCLIB_file_t * stream ); + +/* Repositions within a file. Returns new offset on success, + -1 / errno on error. +*/ +_PDCLIB_int_fast64_t _PDCLIB_seek( _PDCLIB_file_t * stream, + _PDCLIB_int_fast64_t offset, int whence ); + +/* File backend I/O operations + * + * PDCLib will call through to these methods as needed to implement the stdio + * functions. + */ +struct _PDCLIB_fileops +{ + /*! Read length bytes from the file into buf; returning the number of bytes + * actually read in *numBytesRead. + * + * Returns true if bytes were read successfully; on end of file, returns + * true with *numBytesRead == 0. + * + * On error, returns false and sets errno appropriately. *numBytesRead is + * ignored in this situation. + */ + _PDCLIB_bool (*read)( _PDCLIB_fd_t self, + void * buf, + _PDCLIB_size_t length, + _PDCLIB_size_t * numBytesRead ); + + /*! Write length bytes to the file from buf; returning the number of bytes + * actually written in *numBytesWritten + * + * Returns true if bytes were written successfully. On error, returns false + * and setss errno appropriately (as with read, *numBytesWritten is + * ignored) + */ + _PDCLIB_bool (*write)( _PDCLIB_fd_t self, const void * buf, + _PDCLIB_size_t length, _PDCLIB_size_t * numBytesWritten ); + + /* Seek to the file offset specified by offset, from location whence, which + * may be one of the standard constants SEEK_SET/SEEK_CUR/SEEK_END + */ + _PDCLIB_bool (*seek)( _PDCLIB_fd_t self, _PDCLIB_int_fast64_t offset, + int whence, _PDCLIB_int_fast64_t *newPos ); + + void (*close)( _PDCLIB_fd_t self ); + + /*! Behaves as read does, except for wide characters. Both length and + * *numCharsRead represent counts of characters, not bytes. + * + * This function is optional; if missing, PDCLib will buffer the character + * data as bytes and perform translation directly into the user's buffers. + * It is useful if your backend can directly take wide characters (for + * example, the Windows console) + */ + _PDCLIB_bool (*wread)( _PDCLIB_fd_t self, _PDCLIB_wchar_t * buf, + _PDCLIB_size_t length, _PDCLIB_size_t * numCharsRead ); + + /* Behaves as write does, except for wide characters. As with wread, both + * length and *numCharsWritten are character counts. + * + * This function is also optional; if missing, PDCLib will buffer the + * character data as bytes and do translation directly from the user's + * buffers. You only need to implement this if your backend can directly + * take wide characters (for example, the Windows console) + */ + _PDCLIB_bool (*wwrite)( _PDCLIB_fd_t self, const _PDCLIB_wchar_t * buf, + _PDCLIB_size_t length, _PDCLIB_size_t * numCharsWritten ); +}; + +/* struct _PDCLIB_file structure */ +struct _PDCLIB_file +{ + const _PDCLIB_fileops_t * ops; + _PDCLIB_fd_t handle; /* OS file handle */ + _PDCLIB_MTX_T lock; /* file lock */ + char * buffer; /* Pointer to buffer memory */ + _PDCLIB_size_t bufsize; /* Size of buffer */ + _PDCLIB_size_t bufidx; /* Index of current position in buffer */ + _PDCLIB_size_t bufend; /* Index of last pre-read character in buffer */ +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + _PDCLIB_size_t bufnlexp; /* Current position of buffer newline expansion */ +#endif + _PDCLIB_size_t ungetidx; /* Number of ungetc()'ed characters */ + unsigned char * ungetbuf; /* ungetc() buffer */ + unsigned int status; /* Status flags; see above */ + /* multibyte parsing status to be added later */ + _PDCLIB_fpos_t pos; /* Offset and multibyte parsing state */ + char * filename; /* Name the current stream has been opened with */ + _PDCLIB_file_t * next; /* Pointer to next struct (internal) */ +}; + +static inline _PDCLIB_size_t _PDCLIB_getchars( char * out, _PDCLIB_size_t n, + int stopchar, + _PDCLIB_file_t * stream ) +{ + _PDCLIB_size_t i = 0; + int c; + while ( stream->ungetidx > 0 && i != n ) + { + c = (unsigned char) + ( out[ i++ ] = stream->ungetbuf[ --(stream->ungetidx) ] ); + if( c == stopchar ) + return i; + } + + while ( i != n ) + { + while ( stream->bufidx != stream->bufend && i != n) + { + c = (unsigned char) stream->buffer[ stream->bufidx++ ]; +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + if ( !( stream->status & _PDCLIB_FBIN ) && c == '\r' ) + { + if ( stream->bufidx == stream->bufend ) + break; + + if ( stream->buffer[ stream->bufidx ] == '\n' ) + { + c = '\n'; + stream->bufidx++; + } + } +#endif + out[ i++ ] = c; + + if( c == stopchar ) + return i; + } + + if ( i != n ) + { + if( _PDCLIB_fillbuffer( stream ) == -1 ) + { + break; + } + } + } + +#ifdef _PDCLIB_NEED_EOL_TRANSLATION + if ( i != n && stream->bufidx != stream->bufend ) + { + // we must have EOF'd immediately after a \r + out[ i++ ] = stream->buffer[ stream->bufidx++ ]; + } +#endif + + return i; +} + +/* Unlocked functions - internal names + * + * We can't use the functions using their "normal" names internally because that + * would cause namespace leakage. Therefore, we use them by prefixed internal + * names + */ +void _PDCLIB_flockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; +int _PDCLIB_ftrylockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; +void _PDCLIB_funlockfile(struct _PDCLIB_file *file) _PDCLIB_nothrow; + +int _PDCLIB_getc_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_getchar_unlocked(void) _PDCLIB_nothrow; +int _PDCLIB_putc_unlocked(int c, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_putchar_unlocked(int c) _PDCLIB_nothrow; +void _PDCLIB_clearerr_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_feof_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_ferror_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_fflush_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_fgetc_unlocked(struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_fputc_unlocked(int c, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +_PDCLIB_size_t _PDCLIB_fread_unlocked(void *ptr, _PDCLIB_size_t size, _PDCLIB_size_t n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +_PDCLIB_size_t _PDCLIB_fwrite_unlocked(const void *ptr, _PDCLIB_size_t size, _PDCLIB_size_t n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +char *_PDCLIB_fgets_unlocked(char *s, int n, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_fputs_unlocked(const char *s, struct _PDCLIB_file *stream) _PDCLIB_nothrow; +int _PDCLIB_fgetpos_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, _PDCLIB_fpos_t * _PDCLIB_restrict pos ) _PDCLIB_nothrow; +int _PDCLIB_fsetpos_unlocked( struct _PDCLIB_file * stream, const _PDCLIB_fpos_t * pos ) _PDCLIB_nothrow; +long int _PDCLIB_ftell_unlocked( struct _PDCLIB_file * stream ) _PDCLIB_nothrow; +int _PDCLIB_fseek_unlocked( struct _PDCLIB_file * stream, long int offset, int whence ) _PDCLIB_nothrow; +void _PDCLIB_rewind_unlocked( struct _PDCLIB_file * stream ) _PDCLIB_nothrow; + +int _PDCLIB_puts_unlocked( const char * s ) _PDCLIB_nothrow; +int _PDCLIB_ungetc_unlocked( int c, struct _PDCLIB_file * stream ) _PDCLIB_nothrow; + + +int _PDCLIB_printf_unlocked( const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; +int _PDCLIB_vprintf_unlocked( const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; +int _PDCLIB_fprintf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; +int _PDCLIB_vfprintf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; +int _PDCLIB_scanf_unlocked( const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; +int _PDCLIB_vscanf_unlocked( const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; +int _PDCLIB_fscanf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, ... ) _PDCLIB_nothrow; +int _PDCLIB_vfscanf_unlocked( struct _PDCLIB_file * _PDCLIB_restrict stream, const char * _PDCLIB_restrict format, _PDCLIB_va_list arg ) _PDCLIB_nothrow; + +#endif diff --git a/man3/abort.3 b/man3/abort.3 index 8fcdc21..502318b 100644 --- a/man3/abort.3 +++ b/man3/abort.3 @@ -1,52 +1,52 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt abort 3 -.Os -.\" -.Sh NAME -.Nm abort -.Nd abnormal process termination -.\" -.Sh SYNOPSIS -.In stdlib.h -.Fn "noreturn void abort" "void" -.\" -.Sh DESCRIPTION -.Fn abort -causes abnormal process termination to occur. -.\" -.Pp -First, -.Dv SIGABRT -will be raised, as if by -.Fn raise SIGABRT . -If the signal is not being caught, or the handler which catches the signal -returns, -.Fn abort -will then proceed to cause the process to terminate with a failure exit status. -It is implementation defined whether any open -.Vt FILE -streams are flushed before the process exits. -.\" -.Sh IMPLEMENTATION NOTES -PDCLib implements termination (in the case that the -.Dv SIGABRT -handler returns) by calling -.Fn _Exit EXIT_FAILURE . -Therefore, stream flushing rules for -.Nm -follow those defined for -.Fn _Exit . -.\" -.Sh SEE ALSO -.Xr exit 3 -.Xr quick_exit 3 -.Xr _Exit 3 -.Xr raise 3 -.\" -.Sh STANDARDS -.Fn abort -is first defined in +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt abort 3 +.Os +.\" +.Sh NAME +.Nm abort +.Nd abnormal process termination +.\" +.Sh SYNOPSIS +.In stdlib.h +.Fn "noreturn void abort" "void" +.\" +.Sh DESCRIPTION +.Fn abort +causes abnormal process termination to occur. +.\" +.Pp +First, +.Dv SIGABRT +will be raised, as if by +.Fn raise SIGABRT . +If the signal is not being caught, or the handler which catches the signal +returns, +.Fn abort +will then proceed to cause the process to terminate with a failure exit status. +It is implementation defined whether any open +.Vt FILE +streams are flushed before the process exits. +.\" +.Sh IMPLEMENTATION NOTES +PDCLib implements termination (in the case that the +.Dv SIGABRT +handler returns) by calling +.Fn _Exit EXIT_FAILURE . +Therefore, stream flushing rules for +.Nm +follow those defined for +.Fn _Exit . +.\" +.Sh SEE ALSO +.Xr exit 3 +.Xr quick_exit 3 +.Xr _Exit 3 +.Xr raise 3 +.\" +.Sh STANDARDS +.Fn abort +is first defined in .St -isoC-90 . \ No newline at end of file diff --git a/man3/assert.3 b/man3/assert.3 index 09f9307..937a68b 100644 --- a/man3/assert.3 +++ b/man3/assert.3 @@ -1,43 +1,43 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt assert 3 -.Os -.\" -.Sh NAME -.Nm assert -.Nd validate assertion -.\" -.Sh SYNOPSIS -.In assert.h -.Fn "void assert" "" -.\" -.Sh DESCRIPTION -If -.Dv NDEBUG -was defined when -.In assert.h -was last included, the macro -.Nm -results in no code being generated. Otherwise, if the expression evaluates to -false, an error message is printed to -.Va stderr -and execution is terminated by invoking -.Fn abort . -.Sh IMPLEMENTATION NOTES -The enclosing function of the call to -.Nm -will only be printed in the error message when compiling for C99, or a later -revision of the C standard. -.\" -.Sh SEE ALSO -.Xr _Exit 3 -.Xr quick_exit 3 -.Xr exit 3 -.Xr abort 3 -.\" -.Sh STANDARDS -Conforming to -.St -isoC-90 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt assert 3 +.Os +.\" +.Sh NAME +.Nm assert +.Nd validate assertion +.\" +.Sh SYNOPSIS +.In assert.h +.Fn "void assert" "" +.\" +.Sh DESCRIPTION +If +.Dv NDEBUG +was defined when +.In assert.h +was last included, the macro +.Nm +results in no code being generated. Otherwise, if the expression evaluates to +false, an error message is printed to +.Va stderr +and execution is terminated by invoking +.Fn abort . +.Sh IMPLEMENTATION NOTES +The enclosing function of the call to +.Nm +will only be printed in the error message when compiling for C99, or a later +revision of the C standard. +.\" +.Sh SEE ALSO +.Xr _Exit 3 +.Xr quick_exit 3 +.Xr exit 3 +.Xr abort 3 +.\" +.Sh STANDARDS +Conforming to +.St -isoC-90 , .St -isoC-99 . \ No newline at end of file diff --git a/man3/assert.h.3 b/man3/assert.h.3 index 1a532fa..58f1923 100644 --- a/man3/assert.h.3 +++ b/man3/assert.h.3 @@ -1,39 +1,39 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt ASSERT.H 3 -.Os -.\" -.Sh NAME -.Nm assert.h -.Nd verify program assertion -.\" -.Sh SYNOPSIS -.In assert.h -.\" -.Sh DESCRIPTION -The header -.In assert.h -shall define one macro: -.Dv assert() . -.Pp -If -.Dv NDEBUG -was undefined at the most recent inclusion of this header, then it shall be -defined as a macro which will evaluate the scalar expression and, if it is -false, abort the program with a descriptive error message as defined in -.Xr assert 3 . -.\" -.Pp -If -.Dv NDEBUG -was defined at the most recent inclusion of this header, then it shall be -defined as a macro which evaluates as a void expression and -.Sy does not -evaluate its parameter. -.\" -.Sh STANDARDS -Conforming to -.St -isoC-90 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt ASSERT.H 3 +.Os +.\" +.Sh NAME +.Nm assert.h +.Nd verify program assertion +.\" +.Sh SYNOPSIS +.In assert.h +.\" +.Sh DESCRIPTION +The header +.In assert.h +shall define one macro: +.Dv assert() . +.Pp +If +.Dv NDEBUG +was undefined at the most recent inclusion of this header, then it shall be +defined as a macro which will evaluate the scalar expression and, if it is +false, abort the program with a descriptive error message as defined in +.Xr assert 3 . +.\" +.Pp +If +.Dv NDEBUG +was defined at the most recent inclusion of this header, then it shall be +defined as a macro which evaluates as a void expression and +.Sy does not +evaluate its parameter. +.\" +.Sh STANDARDS +Conforming to +.St -isoC-90 , .St -isoC-99 . \ No newline at end of file diff --git a/man3/atexit.3 b/man3/atexit.3 index 09fe18d..7d1ea31 100644 --- a/man3/atexit.3 +++ b/man3/atexit.3 @@ -1,100 +1,100 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt atexit 3 -.Os -.\" -.Sh NAME -.Nm atexit -.Nd registration of functions to be invoked before process termination -.\" -.Sh SYNOPSIS -.In stdlib.h -.Fn "int atexit" "void (*handler)(void)" -.Fn "int at_quick_exit" "void (*handler)(void)" -(C11, C++11) -.\" -.Sh DESCRIPTION -These functions register a function to be called when the corresponding process -exit function is invoked. For -.Fn atexit -the function will be invoked when the process is terminated by calling -.Fn exit ; -for -.Fn at_quick_exit -the function will be invoked when the process is terminated by calling -.Fn quick_exit . -.\" -.Pp -These functions are used in order to permit a program to perform actions before -a process is terminated; for example, releasing an interprocess semaphore. -Special care should be taken when writing -.Fn at_quick_exit -handlers; the purpose of -.Fn quick_exit -is to support the abandonning of a process when normal process termination might -not be possible; at_quick_exit handlers should therefore be used sparingly and -only when their use is essential. -.\" -.Pp -The standard guarantees that -.Fn atexit -and -.Fn at_quick_exit -may each be called at least 32 times successfully. -.\" -.Pp -.Fn atexit -and -.Fn at_quick_exit -handlers are called in reverse order of the order they were registered in. For -precise details of their ordering, see -.Xr exit 3 . -.\" -.Pp -The result of exiting from a handler registered with -.Fn atexit -or -.Fn at_quick_exit -by use of -.Fn longjmp -is undefined. If any function or destructor invoked by -.Fn exit -or -.Fn quick_exit -should throw, -.Fn std::terminate -is invoked. -.\" -.Pp -Undefined behaviour results if an -.Fn atexit -or -.Fn at_quick_exit -handler calls -.Fn exit -or -.Fn quick_exit . -.\" -.Sh RETURN VALUES -Returns 0 to indicate success; nonzero returns indicate failure. -.\" -.Sh ERRORS -No errors are defined -.\" -.Sh SEE ALSO -.Xr abort 3 -.Xr exit 3 -.Xr quick_exit 3 -.Xr _Exit 3 -.\" -.Sh STANDARDS -.Fn atexit -is first defined in -.St -isoC-90 ; -.Fn at_quick_exit -was introduced in -.St -isoC-2011 -and +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt atexit 3 +.Os +.\" +.Sh NAME +.Nm atexit +.Nd registration of functions to be invoked before process termination +.\" +.Sh SYNOPSIS +.In stdlib.h +.Fn "int atexit" "void (*handler)(void)" +.Fn "int at_quick_exit" "void (*handler)(void)" +(C11, C++11) +.\" +.Sh DESCRIPTION +These functions register a function to be called when the corresponding process +exit function is invoked. For +.Fn atexit +the function will be invoked when the process is terminated by calling +.Fn exit ; +for +.Fn at_quick_exit +the function will be invoked when the process is terminated by calling +.Fn quick_exit . +.\" +.Pp +These functions are used in order to permit a program to perform actions before +a process is terminated; for example, releasing an interprocess semaphore. +Special care should be taken when writing +.Fn at_quick_exit +handlers; the purpose of +.Fn quick_exit +is to support the abandonning of a process when normal process termination might +not be possible; at_quick_exit handlers should therefore be used sparingly and +only when their use is essential. +.\" +.Pp +The standard guarantees that +.Fn atexit +and +.Fn at_quick_exit +may each be called at least 32 times successfully. +.\" +.Pp +.Fn atexit +and +.Fn at_quick_exit +handlers are called in reverse order of the order they were registered in. For +precise details of their ordering, see +.Xr exit 3 . +.\" +.Pp +The result of exiting from a handler registered with +.Fn atexit +or +.Fn at_quick_exit +by use of +.Fn longjmp +is undefined. If any function or destructor invoked by +.Fn exit +or +.Fn quick_exit +should throw, +.Fn std::terminate +is invoked. +.\" +.Pp +Undefined behaviour results if an +.Fn atexit +or +.Fn at_quick_exit +handler calls +.Fn exit +or +.Fn quick_exit . +.\" +.Sh RETURN VALUES +Returns 0 to indicate success; nonzero returns indicate failure. +.\" +.Sh ERRORS +No errors are defined +.\" +.Sh SEE ALSO +.Xr abort 3 +.Xr exit 3 +.Xr quick_exit 3 +.Xr _Exit 3 +.\" +.Sh STANDARDS +.Fn atexit +is first defined in +.St -isoC-90 ; +.Fn at_quick_exit +was introduced in +.St -isoC-2011 +and ISO/IEC 14882:2011 "C++ 2011" . \ No newline at end of file diff --git a/man3/errno.3 b/man3/errno.3 index 80cb02d..5beb464 100644 --- a/man3/errno.3 +++ b/man3/errno.3 @@ -1,66 +1,66 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt ERRNO 3 -.Os -.\" -.Sh NAME -.Nm errno -.Nd library error result -.\" -.Sh SYNOPSIS -.In errno.h -.Pp -.Sy #define errno -.\" -.Sh DESCRIPTION -The header -.In errno.h -defines the name -.Va errno -to refer to an object of thread local storage duration. It is undefined whether -or not -.Va errno -refers to a preprocessor symbol or not. -.\" -.Pp -At program startup, the runtime shall initialize -.Va errno -to contain the value zero (the initial value in other threads is undefined). It -is guaranteed that no function provided by the C standard library shall set the -value of -.Va errno -to zero; therefore, for functions which do not have a unique return value for -indicating error, it is possible to determine whether an error occured by -setting -.Va errno -to zero before the call, then after the call seeing if an error value has been -stored into -.Va errno. -.Pp -.Bf Sy -Note that it is valid for any function which is not described as explicitly -setting -.Va errno -to set it to a non-zero value. Checking for a non-zero value is only valid with -functions which are defined to modify -.Va errno . -.Ef -.\" -.Pp -In some historical versions of the POSIX standard, the prescribed method of -using errno was to define -.Va extern int errno . -This is no longer supported by the POSIX or C standards, and will not work on -the majority of implementations, including this one. -.\" -.Sh SEE ALSO -.Xr errno.h 3 -.Xr abort 3 -.Xr assert 3 -\" -.Sh STANDARDS -Conforming to -.St -isoC-90 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt ERRNO 3 +.Os +.\" +.Sh NAME +.Nm errno +.Nd library error result +.\" +.Sh SYNOPSIS +.In errno.h +.Pp +.Sy #define errno +.\" +.Sh DESCRIPTION +The header +.In errno.h +defines the name +.Va errno +to refer to an object of thread local storage duration. It is undefined whether +or not +.Va errno +refers to a preprocessor symbol or not. +.\" +.Pp +At program startup, the runtime shall initialize +.Va errno +to contain the value zero (the initial value in other threads is undefined). It +is guaranteed that no function provided by the C standard library shall set the +value of +.Va errno +to zero; therefore, for functions which do not have a unique return value for +indicating error, it is possible to determine whether an error occured by +setting +.Va errno +to zero before the call, then after the call seeing if an error value has been +stored into +.Va errno. +.Pp +.Bf Sy +Note that it is valid for any function which is not described as explicitly +setting +.Va errno +to set it to a non-zero value. Checking for a non-zero value is only valid with +functions which are defined to modify +.Va errno . +.Ef +.\" +.Pp +In some historical versions of the POSIX standard, the prescribed method of +using errno was to define +.Va extern int errno . +This is no longer supported by the POSIX or C standards, and will not work on +the majority of implementations, including this one. +.\" +.Sh SEE ALSO +.Xr errno.h 3 +.Xr abort 3 +.Xr assert 3 +\" +.Sh STANDARDS +Conforming to +.St -isoC-90 , .St -isoC-99 . \ No newline at end of file diff --git a/man3/errno.h.3 b/man3/errno.h.3 index a754d80..b9bd12a 100644 --- a/man3/errno.h.3 +++ b/man3/errno.h.3 @@ -1,114 +1,114 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt ERRNO.H 3 -.Os -.\" -.Sh NAME -.Nm errno.h -.Nd error results -.\" -.Sh SYNOPSIS -.In errno.h -.\" -.Sh DESCRIPTION -The header defines the value -.Dv errno -to be an lvalue of thread-local storage duration. -.\" -.Pp -From the ISO C standard, the following error code constants are defined: -.Bl -tag -compact -.It ERANGE -indicating a value is out of range -.It EDOM -indicating that a value is outside the domain of the current function -.It EILSEQ -indicating an invalid character sequence -.El -.\" -.Pp -From the ISO C++ 2011 standard, the following error code constants are defined: -.Bl -tag -compact -.It E2BIG -.It ECONNRESET -.It EISCONN -.It ENOENT -.It ENOTRECOVERABLE -.It EROFS -.It EACCES -.It EDEADLK -.It EISDIR -.It ENOEXEC -.It ENOTSOCK -.It ESPIPE -.It EADDRINUSE -.It EDESTADDRREQ -.It ELOOP -.It ENOLCK -.It ENOTSUP -.It ESRCH -.It EADDRNOTAVAIL -.It EMFILE -.It ENOLINK -.It ENOTTY -.It ETIME -.It EAFNOSUPPORT -.It EEXIST -.It EMLINK -.It ENOMEM -.It ENXIO -.It ETIMEDOUT -.It EAGAIN -.It EFAULT -.It EMSGSIZE -.It ENOMSG -.It EOPNOTSUPP -.It ETXTBSY -.It EALREADY -.It EFBIG -.It ENAMETOOLONG -.It ENOPROTOOPT -.It EOVERFLOW -.It EWOULDBLOCK -(which may have the same value as -.Ev EAGAIN ) -.It EBADF -.It EHOSTUNREACH -.It ENETDOWN -.It ENOSPC -.It EOWNERDEAD -.It EXDEV -.It EBADMSG -.It EIDRM -.It ENETRESET -.It ENOSR -.It EPERM -.It EBUSY -.It ENETUNREACH -.It ENOSTR -.It EPIPE -.It ECANCELED -.It EINPROGRESS -.It ENFILE -.It ENOSYS -.It EPROTO -.It ECHILD -.It EINTR -.It ENOBUFS -.It ENOTCONN -.It EPROTONOSUPPORT -.It ECONNABORTED -.It EINVAL -.It ENODATA -.It ENOTDIR -.It EPROTOTYPE -.El -.Sh SEE ALSO -.Xr errno 3 -.Sh STANDARDS -Conforming to -.St -isoC-90 , -.St -isoC-99 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt ERRNO.H 3 +.Os +.\" +.Sh NAME +.Nm errno.h +.Nd error results +.\" +.Sh SYNOPSIS +.In errno.h +.\" +.Sh DESCRIPTION +The header defines the value +.Dv errno +to be an lvalue of thread-local storage duration. +.\" +.Pp +From the ISO C standard, the following error code constants are defined: +.Bl -tag -compact +.It ERANGE +indicating a value is out of range +.It EDOM +indicating that a value is outside the domain of the current function +.It EILSEQ +indicating an invalid character sequence +.El +.\" +.Pp +From the ISO C++ 2011 standard, the following error code constants are defined: +.Bl -tag -compact +.It E2BIG +.It ECONNRESET +.It EISCONN +.It ENOENT +.It ENOTRECOVERABLE +.It EROFS +.It EACCES +.It EDEADLK +.It EISDIR +.It ENOEXEC +.It ENOTSOCK +.It ESPIPE +.It EADDRINUSE +.It EDESTADDRREQ +.It ELOOP +.It ENOLCK +.It ENOTSUP +.It ESRCH +.It EADDRNOTAVAIL +.It EMFILE +.It ENOLINK +.It ENOTTY +.It ETIME +.It EAFNOSUPPORT +.It EEXIST +.It EMLINK +.It ENOMEM +.It ENXIO +.It ETIMEDOUT +.It EAGAIN +.It EFAULT +.It EMSGSIZE +.It ENOMSG +.It EOPNOTSUPP +.It ETXTBSY +.It EALREADY +.It EFBIG +.It ENAMETOOLONG +.It ENOPROTOOPT +.It EOVERFLOW +.It EWOULDBLOCK +(which may have the same value as +.Ev EAGAIN ) +.It EBADF +.It EHOSTUNREACH +.It ENETDOWN +.It ENOSPC +.It EOWNERDEAD +.It EXDEV +.It EBADMSG +.It EIDRM +.It ENETRESET +.It ENOSR +.It EPERM +.It EBUSY +.It ENETUNREACH +.It ENOSTR +.It EPIPE +.It ECANCELED +.It EINPROGRESS +.It ENFILE +.It ENOSYS +.It EPROTO +.It ECHILD +.It EINTR +.It ENOBUFS +.It ENOTCONN +.It EPROTONOSUPPORT +.It ECONNABORTED +.It EINVAL +.It ENODATA +.It ENOTDIR +.It EPROTOTYPE +.El +.Sh SEE ALSO +.Xr errno 3 +.Sh STANDARDS +Conforming to +.St -isoC-90 , +.St -isoC-99 , ISO/IEC 14882:2011 "ISO C++ 11" \ No newline at end of file diff --git a/man3/exit.3 b/man3/exit.3 index 4d9860e..18f53e8 100644 --- a/man3/exit.3 +++ b/man3/exit.3 @@ -1,119 +1,119 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt exit 3 -.Os -.\" -.Sh NAME -.Nm exit -.Nd terminates the process -.\" -.Sh SYNOPSIS -.In stdlib.h -.Fn "noreturn void exit" "int status" -.Fn "noreturn void quick_exit" "int status" -.Fn "noreturn void _Exit" "int exitcode" -.\" -.Sh DESCRIPTION -Calling any of these three functions terminates the current process, returning -the exit code passed as a parameter. The interpretation of the exit code is -undefined, except that 0 or -.Dv EXIT_SUCCESS -shall indicate successful completion and -.Dv EXIT_FAILURE -shall indicate a non-successful completion. -.\" -.Pp -.Fn exit -first destroys all objects with C++ thread local storage duration (the C -standard leaves whether or not thread local objects are destroyed or not -undefined). Next, the destructors of all C++ objects of static storage duration -are invoked along with all functions passed to -.Fn atexit -in reverse order of registration (the time of registration for C++ objects of -static storage duration is taken to be the time at which the constructor -completes). It then flushes all open -.Vt FILE -streams with unwritten data and closes them. Finally, files created by -.Fn tmpfile -are removed, before handing control back to the host environment. Note in -particular that functions registered with -.Fn at_quick_exit -are -.Sy not -called. -.\" -.Pp -.Fn quick_exit -invokes any functions registered with -.Fn at_quick_exit -in reverse order of registration, then returns control to the host -environment by calling -.Fn _Exit . -No signal handlers are called, nor are any functions registered with -.Fn atexit . -.\" -.Pp -.Fn _Exit -returns control to the controlling environment without invoking any functions -registered by -.Fn atexit , -.Fn at_quick_exit , -any signal handlers, or the destructors of any thread local objects or C++ -objects of static storage duration. Whether or not any open -.Vt FILE -streams with unwritten data are flushed or not is undefined. -.\" -.Pp -The result of aborting a call to -.Fn exit -or -.Fn quick_exit -by use of -.Fn longjmp -is undefined. If any function or destructor invoked by -.Fn exit -or -.Fn quick_exit -should throw, -.Fn std::terminate -is invoked. -.\" -.Pp -Undefined behaviour results if, while a call to -.Fn exit -or -.Fn quick_exit -is in progress, a call to -.Fn exit -or -.Fn quick_exit -is made. -.\" -.Sh IMPLEMENTATION NOTES -PDCLib implements the process of flushing streams in -.Fn _Exit , -and therefore -.Fn exit -calls it after all -.Fn atexit -handlers have been invoked. -.\" -.Sh SEE ALSO -.Xr abort 3 -.Xr atexit 3 -.Xr at_quick_exit 3 -.\" -.Sh STANDARDS -.Fn exit -is first defined in -.St -isoC-90 ; -.Fn _Exit -was introduced in -.St -isoC-99 . -.Fn quick_exit -was introduced in -.St -isoC-11 -and +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt exit 3 +.Os +.\" +.Sh NAME +.Nm exit +.Nd terminates the process +.\" +.Sh SYNOPSIS +.In stdlib.h +.Fn "noreturn void exit" "int status" +.Fn "noreturn void quick_exit" "int status" +.Fn "noreturn void _Exit" "int exitcode" +.\" +.Sh DESCRIPTION +Calling any of these three functions terminates the current process, returning +the exit code passed as a parameter. The interpretation of the exit code is +undefined, except that 0 or +.Dv EXIT_SUCCESS +shall indicate successful completion and +.Dv EXIT_FAILURE +shall indicate a non-successful completion. +.\" +.Pp +.Fn exit +first destroys all objects with C++ thread local storage duration (the C +standard leaves whether or not thread local objects are destroyed or not +undefined). Next, the destructors of all C++ objects of static storage duration +are invoked along with all functions passed to +.Fn atexit +in reverse order of registration (the time of registration for C++ objects of +static storage duration is taken to be the time at which the constructor +completes). It then flushes all open +.Vt FILE +streams with unwritten data and closes them. Finally, files created by +.Fn tmpfile +are removed, before handing control back to the host environment. Note in +particular that functions registered with +.Fn at_quick_exit +are +.Sy not +called. +.\" +.Pp +.Fn quick_exit +invokes any functions registered with +.Fn at_quick_exit +in reverse order of registration, then returns control to the host +environment by calling +.Fn _Exit . +No signal handlers are called, nor are any functions registered with +.Fn atexit . +.\" +.Pp +.Fn _Exit +returns control to the controlling environment without invoking any functions +registered by +.Fn atexit , +.Fn at_quick_exit , +any signal handlers, or the destructors of any thread local objects or C++ +objects of static storage duration. Whether or not any open +.Vt FILE +streams with unwritten data are flushed or not is undefined. +.\" +.Pp +The result of aborting a call to +.Fn exit +or +.Fn quick_exit +by use of +.Fn longjmp +is undefined. If any function or destructor invoked by +.Fn exit +or +.Fn quick_exit +should throw, +.Fn std::terminate +is invoked. +.\" +.Pp +Undefined behaviour results if, while a call to +.Fn exit +or +.Fn quick_exit +is in progress, a call to +.Fn exit +or +.Fn quick_exit +is made. +.\" +.Sh IMPLEMENTATION NOTES +PDCLib implements the process of flushing streams in +.Fn _Exit , +and therefore +.Fn exit +calls it after all +.Fn atexit +handlers have been invoked. +.\" +.Sh SEE ALSO +.Xr abort 3 +.Xr atexit 3 +.Xr at_quick_exit 3 +.\" +.Sh STANDARDS +.Fn exit +is first defined in +.St -isoC-90 ; +.Fn _Exit +was introduced in +.St -isoC-99 . +.Fn quick_exit +was introduced in +.St -isoC-11 +and ISO/IEC 14882:2011 "C++ 2011" . \ No newline at end of file diff --git a/man3/flockfile.3 b/man3/flockfile.3 index 8473fa9..bfc9adc 100644 --- a/man3/flockfile.3 +++ b/man3/flockfile.3 @@ -1,56 +1,56 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt flockfile 3 -.Os -.\" -.Sh NAME -.Nm flockfile, ftrylockfile, funlockfile -.Nd stdio file locking -.\" -.Sh SYNOPSIS -.Sy #define _POSIX_C_SOURCE >= 200112L || _XOPEN_SOURCE >= 600 || _SVID_SOURCE || _BSD_SOURCE -.\" -.In stdio.h -.Fn "void flockfile" "FILE *file" -.Fn "int ftrylockfile" "FILE *file" -.Fn "void funlockfile" "FILE *file" -.\" -.Sh DESCRIPTION -.Fn flockfile -locks the passed FILE stream for access by the calling thread, potentially -blocking. -.Fn ftrylockfile -attempts to lock the file for the calling thread, but will return failure if -another thread has already locked the file. -.Fn funlockfile -releases the lock on the stream, allowing another thread in the process to -access it. -.\" -.Pp -The same stream may be locked multiple times by the calling thread; the number -of calls to -.Fn flockfile -and -.Fn ftrylockfile -on a file must be equal to the number of calls to -.Fn funlockfile . -.\" -.Pp -No other thread may do I/O through the locked file while it is locked. -.\" -.Sh IMPLEMENTATION NOTES -PDCLib implements the file locking on top of the Mutex primitives added by C11 -.\" -.Sh SEE ALSO -.Xr fopen 3 -.Xr fclose 3 -.Xr unlocked_stdio 3 -.Xr mtx_t 3 -.\" -.Sh STANDARDS -The locked I/O routines were initially introduced in -.St -svid4 , -and incorporated into POSIX in +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt flockfile 3 +.Os +.\" +.Sh NAME +.Nm flockfile, ftrylockfile, funlockfile +.Nd stdio file locking +.\" +.Sh SYNOPSIS +.Sy #define _POSIX_C_SOURCE >= 200112L || _XOPEN_SOURCE >= 600 || _SVID_SOURCE || _BSD_SOURCE +.\" +.In stdio.h +.Fn "void flockfile" "FILE *file" +.Fn "int ftrylockfile" "FILE *file" +.Fn "void funlockfile" "FILE *file" +.\" +.Sh DESCRIPTION +.Fn flockfile +locks the passed FILE stream for access by the calling thread, potentially +blocking. +.Fn ftrylockfile +attempts to lock the file for the calling thread, but will return failure if +another thread has already locked the file. +.Fn funlockfile +releases the lock on the stream, allowing another thread in the process to +access it. +.\" +.Pp +The same stream may be locked multiple times by the calling thread; the number +of calls to +.Fn flockfile +and +.Fn ftrylockfile +on a file must be equal to the number of calls to +.Fn funlockfile . +.\" +.Pp +No other thread may do I/O through the locked file while it is locked. +.\" +.Sh IMPLEMENTATION NOTES +PDCLib implements the file locking on top of the Mutex primitives added by C11 +.\" +.Sh SEE ALSO +.Xr fopen 3 +.Xr fclose 3 +.Xr unlocked_stdio 3 +.Xr mtx_t 3 +.\" +.Sh STANDARDS +The locked I/O routines were initially introduced in +.St -svid4 , +and incorporated into POSIX in .St -p1003.1-2001 . \ No newline at end of file diff --git a/man3/mbsinit.3 b/man3/mbsinit.3 index 7e84ae1..8c8e544 100644 --- a/man3/mbsinit.3 +++ b/man3/mbsinit.3 @@ -1,58 +1,58 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt MBSINIT 3 -.Os -.\" -.Sh NAME -.Nm mbsinit -.Nd determines multibyte conversion state -.\" -.Sh SYNOPSIS -.In wchar.h -.Fn "int mbsinit" "const mbstate_t *ps" -.In xlocale.h -.Fn "int mbsinit_l" "const mbstate_t *ps" "locale_t loc" -.\" -.Sh DESCRIPTION -.Fn mbsinit -and -.Fn mbsinit_l -shall return a nonzero value if the multibyte converison state pointed to by -.Va ps -corresponds to an initial conversion state. The interpretation of -.Va *ps -is locale dependent; the only guarantee is that an -.Vt mbstate_t -object initialized to zero shall correspond to an initial conversion state. If -.Va ps -is -.Dv NULL , -then a nonzero value shall be returned. -.\" -.Pp -The locale used for -.Fn mbsinit -shall be the currently active locale; either the current thread locale as set by -.Xr uselocale 3 -if one has been specified, or otherwise the global locale controlled by -.Xr setlocale 3 . -The locale used by -.Fn mbsinit_l -is that specified by -.Va loc . -.\" -.Sh SEE ALSO -.Xr mbrtowc 3 -.Xr wcrtomb 3 -.Xr setlocale 3 -.Xr uselocale 3 -.\" -.Sh STANDARDS -.Fn mbsinit -is first defined in -.St -isoC-amd1 ; -.Fn mbsinit_l -is a nonstandard extension originating in Darwin. See +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt MBSINIT 3 +.Os +.\" +.Sh NAME +.Nm mbsinit +.Nd determines multibyte conversion state +.\" +.Sh SYNOPSIS +.In wchar.h +.Fn "int mbsinit" "const mbstate_t *ps" +.In xlocale.h +.Fn "int mbsinit_l" "const mbstate_t *ps" "locale_t loc" +.\" +.Sh DESCRIPTION +.Fn mbsinit +and +.Fn mbsinit_l +shall return a nonzero value if the multibyte converison state pointed to by +.Va ps +corresponds to an initial conversion state. The interpretation of +.Va *ps +is locale dependent; the only guarantee is that an +.Vt mbstate_t +object initialized to zero shall correspond to an initial conversion state. If +.Va ps +is +.Dv NULL , +then a nonzero value shall be returned. +.\" +.Pp +The locale used for +.Fn mbsinit +shall be the currently active locale; either the current thread locale as set by +.Xr uselocale 3 +if one has been specified, or otherwise the global locale controlled by +.Xr setlocale 3 . +The locale used by +.Fn mbsinit_l +is that specified by +.Va loc . +.\" +.Sh SEE ALSO +.Xr mbrtowc 3 +.Xr wcrtomb 3 +.Xr setlocale 3 +.Xr uselocale 3 +.\" +.Sh STANDARDS +.Fn mbsinit +is first defined in +.St -isoC-amd1 ; +.Fn mbsinit_l +is a nonstandard extension originating in Darwin. See .Xr xlocale.h 3 \ No newline at end of file diff --git a/man3/pdclib.3 b/man3/pdclib.3 index 8773c26..dd8e8c1 100644 --- a/man3/pdclib.3 +++ b/man3/pdclib.3 @@ -1,96 +1,96 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt PDCLIB 3 -.Os -.\" -.Sh NAME -.Nm PDCLib -.Nd Public domain, portable C library -.\" -.Sh LIBRARY -.Lb pdclib -.Sh SYNOPSIS -.In assert.h -.In ctype.h -.In errno.h -.In inttypes.h -.In iso646.h -.In limits.h -.In locale.h -.In signal.h -.In stdarg.h -.In stdbool.h -.In stddef.h -.In stdint.h -.In stdio.h -.In stdlib.h -.In stdnoreturn.h -.In string.h -.In threads.h -.In time.h -.In wchar.h -.\" -.Sh DESCRIPTION -The -.Nm -library is a portable, public domain C library. It aims at full conformance with -ISO C89, C95, C99 and C11 when used in combination with a conformant compiler. -In addition, it aims at conformance with the portion of ISO C++97 and C++2011 -which is derived from said standards. -.Pp -.Nm -aims for strict conformance with the selected C/C++ standard. Therefore, unlike -most C libraries, it does not by default expose any extensions. Some extensions -(from POSIX or the Single Unix Specification) can be selected by defining the -appropriate feature selection macro, such as -.Dv _POSIX_C_SOURCE -or -.Dv _XOPEN_SOURCE -to the appropriate value. For example, in the following definition: -.Bd -offset indent -.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L -.br -.Sy #include -.In string.h -.br -.Fn "char * strdup" "const char *" -.Ed -.\" -it is documented that defining either -.Dv _XOPEN_SOURCE -or -.Dv _POSIX_C_SOURCE -to have a value greater than -.Li 200809L -before the first inclusion of -.In string.h -will expose a definition of the function -.Fn strdup -.\" -.Sh SEE ALSO -.Xr cc 1 , -.Xr c++ 7 -.Sh STANDARDS -When compiled with a C compiler, conformant with -.St -isoC-90 , -.St -isoC-amd1 , -.St -isoC-tcor1 , -.St -isoC-tcor2 , -.St -isoC-99 or -.St -isoC-2011 -as dependent upon the version of C the compiler declares conformance with. -.Pp -When compiled with a C++ compiler, conformant with ISO/IEC 14882:1997 or ISO/IEC -14882:2011 "The C++ Programming Language" as dependent upon the version of C++ -the compiler declares conformance with. -.Sh AUTHORS -The -.Nm -library is maintained by by -.An Owen Shepherd , -.Mt pdclib@owenshepherd.net . -Based upon work by -.An Martin "Solar" Baute , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt PDCLIB 3 +.Os +.\" +.Sh NAME +.Nm PDCLib +.Nd Public domain, portable C library +.\" +.Sh LIBRARY +.Lb pdclib +.Sh SYNOPSIS +.In assert.h +.In ctype.h +.In errno.h +.In inttypes.h +.In iso646.h +.In limits.h +.In locale.h +.In signal.h +.In stdarg.h +.In stdbool.h +.In stddef.h +.In stdint.h +.In stdio.h +.In stdlib.h +.In stdnoreturn.h +.In string.h +.In threads.h +.In time.h +.In wchar.h +.\" +.Sh DESCRIPTION +The +.Nm +library is a portable, public domain C library. It aims at full conformance with +ISO C89, C95, C99 and C11 when used in combination with a conformant compiler. +In addition, it aims at conformance with the portion of ISO C++97 and C++2011 +which is derived from said standards. +.Pp +.Nm +aims for strict conformance with the selected C/C++ standard. Therefore, unlike +most C libraries, it does not by default expose any extensions. Some extensions +(from POSIX or the Single Unix Specification) can be selected by defining the +appropriate feature selection macro, such as +.Dv _POSIX_C_SOURCE +or +.Dv _XOPEN_SOURCE +to the appropriate value. For example, in the following definition: +.Bd -offset indent +.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L +.br +.Sy #include +.In string.h +.br +.Fn "char * strdup" "const char *" +.Ed +.\" +it is documented that defining either +.Dv _XOPEN_SOURCE +or +.Dv _POSIX_C_SOURCE +to have a value greater than +.Li 200809L +before the first inclusion of +.In string.h +will expose a definition of the function +.Fn strdup +.\" +.Sh SEE ALSO +.Xr cc 1 , +.Xr c++ 7 +.Sh STANDARDS +When compiled with a C compiler, conformant with +.St -isoC-90 , +.St -isoC-amd1 , +.St -isoC-tcor1 , +.St -isoC-tcor2 , +.St -isoC-99 or +.St -isoC-2011 +as dependent upon the version of C the compiler declares conformance with. +.Pp +When compiled with a C++ compiler, conformant with ISO/IEC 14882:1997 or ISO/IEC +14882:2011 "The C++ Programming Language" as dependent upon the version of C++ +the compiler declares conformance with. +.Sh AUTHORS +The +.Nm +library is maintained by by +.An Owen Shepherd , +.Mt pdclib@owenshepherd.net . +Based upon work by +.An Martin "Solar" Baute , .Mt solar@rootdirectory.de . \ No newline at end of file diff --git a/man3/posix_locale.3 b/man3/posix_locale.3 index 78e77e6..a474e2f 100644 --- a/man3/posix_locale.3 +++ b/man3/posix_locale.3 @@ -1,147 +1,147 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt posix_locale 3 -.Os -.\" -.Sh NAME -.Nm posix_locale -.Nd POSIX extended locale functions -.\" -.Sh SYNOPSIS -.Sy #define _POSIX_C_SOURCE >= 200112L -.In locale.h -.Vt typedef locale_t; -.br -#define -.Va LC_GLOBAL_LOCALE -; -.Fn "locale_t uselocale" "locale_t newlocale" -.Fn "locale_t duplocale" "locale_t loc" -.Fn "locale_t newlocale" "int category_mask" "const char *locale" "locale_t base" -.Fn "void freelocale" "locale_t loc" -.\" -.Sh DESCRIPTION -The ISO C standard defines the -.Xr setlocale 3 -function, which can be used for modifying the application global locale. In -multithreaded programs, it can sometimes be useful to allow a thread to, either -temporarily or permanently, assume a different locale from the rest of the -application. POSIX defines extended locale functions which permit this. -.\" -.Pp -The function -.Fn uselocale -is used to change the locale of the current thread. If -.Fa newlocale -is the symbolic constant -.Dv LC_GLOBAL_LOCALE , -then the thread locale will be set to the application global locale. If -.Fa newlocale -is -.Dv NULL , -then the locale will not be changed. Otherwise, -.Fa newlocale -should be a value returned from either of the -.Fn newlocale -or -.Fn duplocale -functions. The return value will be the previous thread locale; or -.Dv LC_GLOBAL_LOCALE -if the thread has no current locale. -.Pp -.\" -The function -.Fn duplocale -is used to make an exact copy of an existing locale. The passed locale object -must have been returned from a call to either -.Fn duplocale -or -.Fn newlocale . -.Pp -.\" -The function -.Fn newlocale -is used to modify an existing locale or create a new locale. The returned locale -will have the properties defined by -.Fa category_mask -set to the values from -.Fa locale -as per -.Xr setlocale 3 , -with the remainder being taken from either -.Fa base -(which must be a locale object previously returned by -.Fn duplocale -or -.Fn newlocale ) -if it is specified, or otherwise from the "C" locale. -.Pp -It is undefined if -.Fn newlocale -modifies -.Fa base -or frees it and creates a new locale. -.Pp -.\" -The -.Fn freelocale -function is used to free a locale previously created via -.Fn duplocale -or -.Fn newlocale . -.\" -.\" -.Sh ERRORS -For uselocale, -.Er EINVAL -may be returned if -.Fa locale -is not a valid locale. -.Pp -.\" -For -.Fn duplocale , -.Bl -tag -width 8 -.It Er EINVAL -may be returned if -.Fa locale -is not a valid locale -.It Er ENOMEM -shall be returned if the system had insufficient memory to satisfy the request. -.El -.Pp -.\" -For -.Fn newlocale , -.Bl -tag -width 8 -.It Er EINVAL -shall be returned if -.Fa category_mask -contains a bit which does not correspond to a valid category, and may be -returned if -.Fa locale -is not a valid locale object. -.It Er ENOMEM -shall be returned if the system did not have enough memory to allocate a new -locale object or read the locale data -.It Er ENOENT -shall be returned if the locale specified does not contain data for all the -specified categories -.El -.Pp -.\" -.Fn freelocale -has no errors -.\" -.Sh IMPLEMENTATION NOTES -None -.\" -.Sh SEE ALSO -.Xr lconv 3 -.Xr setlocale 3 -.\" -.Sh STANDARDS -Conforming to +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt posix_locale 3 +.Os +.\" +.Sh NAME +.Nm posix_locale +.Nd POSIX extended locale functions +.\" +.Sh SYNOPSIS +.Sy #define _POSIX_C_SOURCE >= 200112L +.In locale.h +.Vt typedef locale_t; +.br +#define +.Va LC_GLOBAL_LOCALE +; +.Fn "locale_t uselocale" "locale_t newlocale" +.Fn "locale_t duplocale" "locale_t loc" +.Fn "locale_t newlocale" "int category_mask" "const char *locale" "locale_t base" +.Fn "void freelocale" "locale_t loc" +.\" +.Sh DESCRIPTION +The ISO C standard defines the +.Xr setlocale 3 +function, which can be used for modifying the application global locale. In +multithreaded programs, it can sometimes be useful to allow a thread to, either +temporarily or permanently, assume a different locale from the rest of the +application. POSIX defines extended locale functions which permit this. +.\" +.Pp +The function +.Fn uselocale +is used to change the locale of the current thread. If +.Fa newlocale +is the symbolic constant +.Dv LC_GLOBAL_LOCALE , +then the thread locale will be set to the application global locale. If +.Fa newlocale +is +.Dv NULL , +then the locale will not be changed. Otherwise, +.Fa newlocale +should be a value returned from either of the +.Fn newlocale +or +.Fn duplocale +functions. The return value will be the previous thread locale; or +.Dv LC_GLOBAL_LOCALE +if the thread has no current locale. +.Pp +.\" +The function +.Fn duplocale +is used to make an exact copy of an existing locale. The passed locale object +must have been returned from a call to either +.Fn duplocale +or +.Fn newlocale . +.Pp +.\" +The function +.Fn newlocale +is used to modify an existing locale or create a new locale. The returned locale +will have the properties defined by +.Fa category_mask +set to the values from +.Fa locale +as per +.Xr setlocale 3 , +with the remainder being taken from either +.Fa base +(which must be a locale object previously returned by +.Fn duplocale +or +.Fn newlocale ) +if it is specified, or otherwise from the "C" locale. +.Pp +It is undefined if +.Fn newlocale +modifies +.Fa base +or frees it and creates a new locale. +.Pp +.\" +The +.Fn freelocale +function is used to free a locale previously created via +.Fn duplocale +or +.Fn newlocale . +.\" +.\" +.Sh ERRORS +For uselocale, +.Er EINVAL +may be returned if +.Fa locale +is not a valid locale. +.Pp +.\" +For +.Fn duplocale , +.Bl -tag -width 8 +.It Er EINVAL +may be returned if +.Fa locale +is not a valid locale +.It Er ENOMEM +shall be returned if the system had insufficient memory to satisfy the request. +.El +.Pp +.\" +For +.Fn newlocale , +.Bl -tag -width 8 +.It Er EINVAL +shall be returned if +.Fa category_mask +contains a bit which does not correspond to a valid category, and may be +returned if +.Fa locale +is not a valid locale object. +.It Er ENOMEM +shall be returned if the system did not have enough memory to allocate a new +locale object or read the locale data +.It Er ENOENT +shall be returned if the locale specified does not contain data for all the +specified categories +.El +.Pp +.\" +.Fn freelocale +has no errors +.\" +.Sh IMPLEMENTATION NOTES +None +.\" +.Sh SEE ALSO +.Xr lconv 3 +.Xr setlocale 3 +.\" +.Sh STANDARDS +Conforming to .St -p1003.1-2008 . \ No newline at end of file diff --git a/man3/setlocale.3 b/man3/setlocale.3 index 42eb915..44225a6 100644 --- a/man3/setlocale.3 +++ b/man3/setlocale.3 @@ -1,83 +1,83 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt setlocale 3 -.Os -.\" -.Sh NAME -.Nm setlocale -.Nd Set the application global locale -.\" -.Sh SYNOPSIS -.In locale.h -.Fn "char *setlocale" "int category" "const char * locale" -.\" -.Sh DESCRIPTION -The ISO C standards define an application global locale, which all -locale-dependent functions implicitly use. -.Fn setlocale -may be used to change this locale. -.Pp -The locale is defined to be comprised of several categories; the category -parameter specifies which category of the global locale to change, and takes one -of the following values: -.Bl -tag -.It Dv LC_ALL -Modifies all categories -.It Dv LC_COLLATE -Changes the string collation order; affects -.Fn strcoll -and -.Fn strxfrm . -.It Dv LC_CTYPE -Affects the behaviour of the character handling functions defined in -.In ctype.h , -excluding -.Fn isdigit -and -.Fn isxdigit . -.It Dv LC_MONETARY -Controls the currency-related information returned by -.Fn localeconv . -.It Dv LC_NUMERIC -Controls the decimal point character used by the number formatting functions, -plus the nonmonetary information returned by -.Fn localeconv . -.It Dv LC_TIME -Controls the formatting used by the -.Fn strftime -and -.Fn wcsftime -functions. -.El -.Pp -.St -p1003.1-2008 -defines the -.Fn uselocale -function which controls the locale of the present thread. If the thread locale -has been modified using the -.Fn uselocale -function, and has not been reset to the global locale by invoking -.Fn uselocale -with -.Dv LC_GLOBAL_LOCALE -as its parameter, then the -.Fn setlocale -function will not affect the result of functions invoked on the current thread. -.\" -.Sh IMPLEMENTATION NOTES -None -.\" -.Sh SEE ALSO -.Xr lconv 3 -.Xr uselocale 3 -.Xr duplocale 3 -.Xr freelocale 3 -.\" -.Sh STANDARDS -Conforming to -.St -isoC-amd1 , -.St -isoC-99 , -.St -isoC-2011 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt setlocale 3 +.Os +.\" +.Sh NAME +.Nm setlocale +.Nd Set the application global locale +.\" +.Sh SYNOPSIS +.In locale.h +.Fn "char *setlocale" "int category" "const char * locale" +.\" +.Sh DESCRIPTION +The ISO C standards define an application global locale, which all +locale-dependent functions implicitly use. +.Fn setlocale +may be used to change this locale. +.Pp +The locale is defined to be comprised of several categories; the category +parameter specifies which category of the global locale to change, and takes one +of the following values: +.Bl -tag +.It Dv LC_ALL +Modifies all categories +.It Dv LC_COLLATE +Changes the string collation order; affects +.Fn strcoll +and +.Fn strxfrm . +.It Dv LC_CTYPE +Affects the behaviour of the character handling functions defined in +.In ctype.h , +excluding +.Fn isdigit +and +.Fn isxdigit . +.It Dv LC_MONETARY +Controls the currency-related information returned by +.Fn localeconv . +.It Dv LC_NUMERIC +Controls the decimal point character used by the number formatting functions, +plus the nonmonetary information returned by +.Fn localeconv . +.It Dv LC_TIME +Controls the formatting used by the +.Fn strftime +and +.Fn wcsftime +functions. +.El +.Pp +.St -p1003.1-2008 +defines the +.Fn uselocale +function which controls the locale of the present thread. If the thread locale +has been modified using the +.Fn uselocale +function, and has not been reset to the global locale by invoking +.Fn uselocale +with +.Dv LC_GLOBAL_LOCALE +as its parameter, then the +.Fn setlocale +function will not affect the result of functions invoked on the current thread. +.\" +.Sh IMPLEMENTATION NOTES +None +.\" +.Sh SEE ALSO +.Xr lconv 3 +.Xr uselocale 3 +.Xr duplocale 3 +.Xr freelocale 3 +.\" +.Sh STANDARDS +Conforming to +.St -isoC-amd1 , +.St -isoC-99 , +.St -isoC-2011 , .St -p1003.1-2008 . \ No newline at end of file diff --git a/man3/strdup.3 b/man3/strdup.3 index 2803611..61acee5 100644 --- a/man3/strdup.3 +++ b/man3/strdup.3 @@ -1,59 +1,59 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use, modify, and / or redistribute at will. -.\" -.Dd -.Dt strdup 3 -.Os -.\" -.Sh NAME -.Nm strdup -.Nd string duplication -.\" -.Sh SYNOPSIS -.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L -.In string.h -.Fn "char *strdup" "const char *str" -.Pp -.Sy #define _POSIX_C_SOURCE >= 200809L -.In string.h -.Fn "char *strndup" "const char *str" "size_t len" -.\" -.Sh DESCRIPTION -.Fn strdup -allocates a new buffer of sufficient size as to be able to hold the entirety of -.Va str , -including the terminating character, and copies the contents of -.Va str -into it. -.\" -.Pp -.Fn strndup -allocates a buffer large enough to contain -.Va len -characters, plus a trailing null character, or sufficient to contain the -entirety of -.Va str -including the trailing null character, whichever is smaller. The first -.Va len -characters of -.Va str -are then copied into it, and a null character appended. -.\" -.Pp -The buffers returned by these functions must be released by a call to -.Fn free . -.\" -.Sh SEE ALSO -.Xr free 3 -.Xr malloc 3 -.Xr strcpy 3 -.Xr strncpy 3 -.\" -.Sh STANDARDS -.Fn strdup -first specified in -.St -xpg3 . -Moved into POSIX, and -.Fn strndup -added, with +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use, modify, and / or redistribute at will. +.\" +.Dd +.Dt strdup 3 +.Os +.\" +.Sh NAME +.Nm strdup +.Nd string duplication +.\" +.Sh SYNOPSIS +.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L +.In string.h +.Fn "char *strdup" "const char *str" +.Pp +.Sy #define _POSIX_C_SOURCE >= 200809L +.In string.h +.Fn "char *strndup" "const char *str" "size_t len" +.\" +.Sh DESCRIPTION +.Fn strdup +allocates a new buffer of sufficient size as to be able to hold the entirety of +.Va str , +including the terminating character, and copies the contents of +.Va str +into it. +.\" +.Pp +.Fn strndup +allocates a buffer large enough to contain +.Va len +characters, plus a trailing null character, or sufficient to contain the +entirety of +.Va str +including the trailing null character, whichever is smaller. The first +.Va len +characters of +.Va str +are then copied into it, and a null character appended. +.\" +.Pp +The buffers returned by these functions must be released by a call to +.Fn free . +.\" +.Sh SEE ALSO +.Xr free 3 +.Xr malloc 3 +.Xr strcpy 3 +.Xr strncpy 3 +.\" +.Sh STANDARDS +.Fn strdup +first specified in +.St -xpg3 . +Moved into POSIX, and +.Fn strndup +added, with .St -p1003.1-2008 . \ No newline at end of file diff --git a/man3/string.h.3 b/man3/string.h.3 index eb786ce..49d3232 100644 --- a/man3/string.h.3 +++ b/man3/string.h.3 @@ -1,114 +1,114 @@ -.\" This file is part of the Public Domain C Library (PDCLib). -.\" Permission is granted to use" "modify" "and / or redistribute at will. -.\" -.Dd -.Dt STRING.H 3 -.Os -.\" -.Sh NAME -.Nm string.h -.Nd byte string manipulation -.\" -.Sh SYNOPSIS -.In string.h -.\" -.Sh DESCRIPTION -The -.In string.h -header provides byte string manipulation operations. -.\" -.Pp -The type -.Vt size_t , -and the preprocessor constant -.Dv NULL -shall be defined. -.\" -.Pp -The following shall be defined as functions: -.br -.Fn "void *memcpy" "void *restrict dest" "const void *restrict src" "size_t byteCount" -.br -.Fn "void *memmove" "void *dest" "void *src" "size_t byteCount" -.br -.Fn "char *strcpy" "char *restrict dest" "const char *restrict src" -.br -.Fn "char *strncpy" "char *restrict dest" "const char *src" "size_t byteCount" -.br -.Fn "char *strcat" "char *restrict s1" "const char *restrict s2" -.br -.Fn "char *strncat" "char *restrict s1" "const char *restrict s2" "size_t n" -.br -.Fn "int memcmp" "const void *s1" "const void *s2" "size_t n" -.br -.Fn "int strcmp" "const char *s1" "const char *s2" -.br -.Fn "int strcoll" "const char *s1" "const char *s2" -.br -.Fn "int strncmp" "const char *s1" "const char *s2" "size_t n" -.br -.Fn "size_t strxfrm" "char *restrict s1" "const char *restrict s2" "size_t n" -.br -.Fn "void *memchr" "const void *s" "int c" "size_t n" -.br -.Fn "char *strchr" "const char *s" "int c" -.br -.Fn "size_t strcspn" "const char *s1" "const char *s2" -.br -.Fn "char *strpbrk" "const char *s1" "const char *s2" -.br -.Fn "char *strrchr" "const char *s" "int c" -.br -.Fn "size_t strspn" "const char *s1" "const char *s2" -.br -.Fn "char *strstr" "const char *s1" "const char *s2" -.br -.Fn "char *strtok" "char *restrict s1" "const char *restrict s2" -.br -.Fn "void *memset" "void *s" "int c" "size_t n" -.br -.Fn "char *strerror" "int errnum" -.br -.Fn "size_t strlen" "const char *s" -.\" -.Pp -.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L -.br -.Fn "char *strdup" "const char*src" -.\" -.Pp -.Sy #define _POSIX_C_SOURCE >= 200809L -.br -.Fn "char *strndup" "const char*src" "size_t n" -.\" -.Sh SEE ALSO -.Xr wchar.h 3 -.Xr stdlib.h 3 -.Xr memcpy 3 -.Xr memmove 3 -.Xr strcpy 3 -.Xr strncpy 3 -.Xr strcat 3 -.Xr strncat 3 -.Xr memcmp 3 -.Xr strcmp 3 -.Xr strcoll 3 -.Xr strncmp 3 -.Xr strxfrm 3 -.Xr memchr 3 -.Xr strchr 3 -.Xr strcspn 3 -.Xr strpbrk 3 -.Xr strrchr 3 -.Xr strspn 3 -.Xr strstr 3 -.Xr strtok 3 -.Xr memset 3 -.Xr strerror 3 -.Xr strlen 3 -.Xr strdup 3 -.Xr strndup 3 -.Sh STANDARDS -Conforming to -.St -isoC-90 , +.\" This file is part of the Public Domain C Library (PDCLib). +.\" Permission is granted to use" "modify" "and / or redistribute at will. +.\" +.Dd +.Dt STRING.H 3 +.Os +.\" +.Sh NAME +.Nm string.h +.Nd byte string manipulation +.\" +.Sh SYNOPSIS +.In string.h +.\" +.Sh DESCRIPTION +The +.In string.h +header provides byte string manipulation operations. +.\" +.Pp +The type +.Vt size_t , +and the preprocessor constant +.Dv NULL +shall be defined. +.\" +.Pp +The following shall be defined as functions: +.br +.Fn "void *memcpy" "void *restrict dest" "const void *restrict src" "size_t byteCount" +.br +.Fn "void *memmove" "void *dest" "void *src" "size_t byteCount" +.br +.Fn "char *strcpy" "char *restrict dest" "const char *restrict src" +.br +.Fn "char *strncpy" "char *restrict dest" "const char *src" "size_t byteCount" +.br +.Fn "char *strcat" "char *restrict s1" "const char *restrict s2" +.br +.Fn "char *strncat" "char *restrict s1" "const char *restrict s2" "size_t n" +.br +.Fn "int memcmp" "const void *s1" "const void *s2" "size_t n" +.br +.Fn "int strcmp" "const char *s1" "const char *s2" +.br +.Fn "int strcoll" "const char *s1" "const char *s2" +.br +.Fn "int strncmp" "const char *s1" "const char *s2" "size_t n" +.br +.Fn "size_t strxfrm" "char *restrict s1" "const char *restrict s2" "size_t n" +.br +.Fn "void *memchr" "const void *s" "int c" "size_t n" +.br +.Fn "char *strchr" "const char *s" "int c" +.br +.Fn "size_t strcspn" "const char *s1" "const char *s2" +.br +.Fn "char *strpbrk" "const char *s1" "const char *s2" +.br +.Fn "char *strrchr" "const char *s" "int c" +.br +.Fn "size_t strspn" "const char *s1" "const char *s2" +.br +.Fn "char *strstr" "const char *s1" "const char *s2" +.br +.Fn "char *strtok" "char *restrict s1" "const char *restrict s2" +.br +.Fn "void *memset" "void *s" "int c" "size_t n" +.br +.Fn "char *strerror" "int errnum" +.br +.Fn "size_t strlen" "const char *s" +.\" +.Pp +.Sy #define _XOPEN_SOURCE || _POSIX_C_SOURCE >= 200809L +.br +.Fn "char *strdup" "const char*src" +.\" +.Pp +.Sy #define _POSIX_C_SOURCE >= 200809L +.br +.Fn "char *strndup" "const char*src" "size_t n" +.\" +.Sh SEE ALSO +.Xr wchar.h 3 +.Xr stdlib.h 3 +.Xr memcpy 3 +.Xr memmove 3 +.Xr strcpy 3 +.Xr strncpy 3 +.Xr strcat 3 +.Xr strncat 3 +.Xr memcmp 3 +.Xr strcmp 3 +.Xr strcoll 3 +.Xr strncmp 3 +.Xr strxfrm 3 +.Xr memchr 3 +.Xr strchr 3 +.Xr strcspn 3 +.Xr strpbrk 3 +.Xr strrchr 3 +.Xr strspn 3 +.Xr strstr 3 +.Xr strtok 3 +.Xr memset 3 +.Xr strerror 3 +.Xr strlen 3 +.Xr strdup 3 +.Xr strndup 3 +.Sh STANDARDS +Conforming to +.St -isoC-90 , .St -isoC-99 . \ No newline at end of file diff --git a/man3/wchar.h.3 b/man3/wchar.h.3 index 73f2d78..de7e1b9 100644 --- a/man3/wchar.h.3 +++ b/man3/wchar.h.3 @@ -1,254 +1,254 @@ -.\" This file is part of the Public Domain C Library " "PDCLib). -.\" Permission is granted to use" "modify" "and / or redistribute at will. -.\" -.Dd -.Dt WCHAR.H 3 -.Os -.\" -.Sh NAME -.Nm wchar.h -.Nd wide character & wide character string manipulation -.\" -.Sh SYNOPSIS -.In wchar.h -.\" -.Sh DESCRIPTION -The -.In wchar.h -header provides functions for manipulating wide character strings" "for -converting between wide characters and multibyte character sets" "for -manipulating wide character strings" "and for wide character oriented input and -output. -.\" -.Ss Types & Definitions -The type -.Vt size_t -and macro -.Dv NULL -shall be defined as in -.In stddef.h . -.Pp -The type -.Vt wchar_t -shall be defined as an integral type capable of representing any wide character -in the implementation defined encoding. The type -.Vt wint_t -shall be defined as an integral type capable of representing any wide character -in the implementation defined encoding" "plus the distinct value given by -.Dv WEOF , -which evaluates to a constant expression of type -.Vt wint_t -which does not correspond to any character in the implementation defined -character set. The macros -.Dv WCHAR_MIN -and -.Dv WCHAR_MAX -shall be defined as in -.In stdint.h . -.Pp -The type -.Vt mbstate_t -shall be a complete non-array object type used for the storage of the state of -a multibyte to wide character conversion. -.Pp -The type -.Vt struct tm -shall be defined as an incomplete type" "a full definition of wich can be found -in -.In time.h . -.\" -.Ss Wide Character String Handling Functions -.Fn "wchar_t *wcscpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" -.br -.Fn "wchar_t *wcsncpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" -.br -.Fn "wchar_t *wmemcpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" -.br -.Fn "wchar_t *wmemmove" "wchar_t *s1" "const wchar_t *s2" "size_t n" -.br -.Fn "wchar_t *wcscat" "wchar_t *restrict s1" "const wchar_t *restrict s2" -.br -.Fn "wchar_t *wcsncat" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" -.br -.Fn "int wcscmp" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "int wcscoll" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "int wcsncmp" "const wchar_t *s1" "const wchar_t *s2" "size_t n" -.br -.Fn "size_t wcsxfrm" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" -.br -.Fn "int wmemcmp" "const wchar_t *s1" "const wchar_t *s2" "size_t n" -.br -.Fn "wchar_t *wcschr" "const wchar_t *s" "wchar_t c" -.br -.Fn "size_t wcscspn" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "wchar_t *wcspbrk" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "wchar_t *wcsrchr" "const wchar_t *s" "wchar_t c" -.br -.Fn "size_t wcsspn" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "wchar_t *wcsstr" "const wchar_t *s1" "const wchar_t *s2" -.br -.Fn "wchar_t *wcstok" "wchar_t *restrict s1" "const wchar_t *restrict s2" "wchar_t **restrict ptr" -.br -.Fn "wchar_t *wmemchr" "const wchar_t *s" "wchar_t c" "size_t n" -.br -.Fn "size_t wcslen" "const wchar_t *s" -.br -.Fn "wchar_t *wmemset" "wchar_t *s" "wchar_t c" "size_t n" -.\" -.Ss Wide Character String Formatting -.Fn "int swprintf" "wchar_t *restrict s" "size_t n" "const wchar_t *restrict format" "..." -.br -.Fn "int swscanf" "const wchar_t *restrict s" "const wchar_t *restrict format" "..." -.br -.Fn "int vswprintf" "wchar_t *restrict s" "size_t n" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "int vswscanf" "const wchar_t *restrict s" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "size_t wcsftime" "wchar_t *restrict s" "size_t maxsize" "const wchar_t *restrict format" "const struct tm *restrict timeptr" -.\" -.Ss Wide Character Input and Output -.Fn "int fwprintf" "FILE *restrict stream" "const wchar_t *restrict format" "..." -.br -.Fn "int fwscanf" "FILE *restrict stream" "const wchar_t *restrict format" "..." -.br -.Fn "int vfwprintf" "FILE *restrict stream" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "int vfwscanf" "FILE *restrict stream" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "int vwprintf" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "int vwscanf" "const wchar_t *restrict format" "va_list arg" -.br -.Fn "int wprintf" "const wchar_t *restrict format" "..." -.br -.Fn "int wscanf" "const wchar_t *restrict format" "..." -.br -.Fn "wint_t fgetwc" "FILE *stream" -.br -.Fn "wchar_t *fgetws" "wchar_t *restrict s" "int n" "FILE *restrict stream" -.br -.Fn "wint_t fputwc" "wchar_t c" "FILE *stream" -.br -.Fn "int fputws" "const wchar_t *restrict s" "FILE *restrict stream" -.br -.Fn "int fwide" "FILE *stream" "int mode" -.br -.Fn "wint_t getwc" "FILE *stream" -.br -.Fn "wint_t getwchar" "void" -.br -.Fn "wint_t putwc" "wchar_t c" "FILE *stream" -.br -.Fn "wint_t putwchar" "wchar_t c" -.br -.Fn "wint_t ungetwc" "wint_t c" "FILE *stream" -.\" -.Ss Wide Character String Parsing -.Fn "double wcstod" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" -.br -.Fn "float wcstof" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" -.br -.Fn "long double wcstold" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" -.br -.Fn "long int wcstol" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" -.br -.Fn "long long int wcstoll" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" -.br -.Fn "unsigned long int wcstoul" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" -.br -.Fn "unsigned long long int wcstoull" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" -.\" -.Ss Character Set Conversion -.Fn "wint_t btowc" "int c" -.br -.Fn "int wctob" "wint_t c" -.br -.Fn "int mbsinit" "const mbstate_t *ps" -.br -.Fn "size_t mbrlen" "const char *restrict s" "size_t n" "mbstate_t *restrict ps" -.br -.Fn "size_t mbrtowc" "wchar_t *restrict pwc" "const char *restrict s" "size_t n" "mbstate_t *restrict ps" -.br -.Fn "size_t wcrtomb" "char *restrict s" "wchar_t wc" "mbstate_t *restrict ps" -.br -.Fn "size_t mbsrtowcs" "wchar_t *restrict dst" "const char **restrict src" "size_t len" "mbstate_t *restrict ps" -.br -.Fn "size_t wcsrtombs" "char *restrict dst" "const wchar_t **restrict src" "size_t len" "mbstate_t *restrict ps" -.\" -.Sh SEE ALSO -.Xr string.h 3 -.Xr uchar.h 3 -.Xr wcscpy 3 -.Xr wcsncpy 3 -.Xr wmemcpy 3 -.Xr wmemmove 3 -.Xr wcscat 3 -.Xr wcsncat 3 -.Xr wcscmp 3 -.Xr wcscoll 3 -.Xr wcsncmp 3 -.Xr wcsxfrm 3 -.Xr wmemcmp 3 -.Xr wcschr 3 -.Xr wcscspn 3 -.Xr wcspbrk 3 -.Xr wcsrchr 3 -.Xr wcsspn 3 -.Xr wcsstr 3 -.Xr wcstok 3 -.Xr wmemchr 3 -.Xr wcslen 3 -.Xr wmemset 3 -.\" -.Xr swprintf 3 -.Xr swscanf 3 -.Xr vswprintf 3 -.Xr vswscanf 3 -.Xr wcsftime 3 -.\" -.Xr fwprintf 3 -.Xr fwscanf 3 -.Xr vfwprintf 3 -.Xr vfwscanf 3 -.Xr vwprintf 3 -.Xr vwscanf 3 -.Xr wprintf 3 -.Xr wscanf 3 -.Xr fgetwc 3 -.Xr fgetws 3 -.Xr fputwc 3 -.Xr fputws 3 -.Xr fwide 3 -.Xr getwc 3 -.Xr getwchar 3 -.Xr putwc 3 -.Xr putwchar 3 -.Xr ungetwc 3 -.\" -.Xr wcstod 3 -.Xr wcstof 3 -.Xr wcstold 3 -.Xr wcstol 3 -.Xr wcstoll 3 -.Xr wcstoul 3 -.Xr wcstoull 3 -.\" -.Xr btowc 3 -.Xr wctomb 3 -.Xr mbsinit 3 -.Xr mbrlen 3 -.Xr mbrtowc 3 -.Xr wcrtomb 3 -.Xr mbsrtowcs 3 -.Xr wcsrtombs 3 -.\" -.Sh STANDARDS -Conforming to -.St -isoC-amd1 , -.St -isoC-99 and +.\" This file is part of the Public Domain C Library " "PDCLib). +.\" Permission is granted to use" "modify" "and / or redistribute at will. +.\" +.Dd +.Dt WCHAR.H 3 +.Os +.\" +.Sh NAME +.Nm wchar.h +.Nd wide character & wide character string manipulation +.\" +.Sh SYNOPSIS +.In wchar.h +.\" +.Sh DESCRIPTION +The +.In wchar.h +header provides functions for manipulating wide character strings" "for +converting between wide characters and multibyte character sets" "for +manipulating wide character strings" "and for wide character oriented input and +output. +.\" +.Ss Types & Definitions +The type +.Vt size_t +and macro +.Dv NULL +shall be defined as in +.In stddef.h . +.Pp +The type +.Vt wchar_t +shall be defined as an integral type capable of representing any wide character +in the implementation defined encoding. The type +.Vt wint_t +shall be defined as an integral type capable of representing any wide character +in the implementation defined encoding" "plus the distinct value given by +.Dv WEOF , +which evaluates to a constant expression of type +.Vt wint_t +which does not correspond to any character in the implementation defined +character set. The macros +.Dv WCHAR_MIN +and +.Dv WCHAR_MAX +shall be defined as in +.In stdint.h . +.Pp +The type +.Vt mbstate_t +shall be a complete non-array object type used for the storage of the state of +a multibyte to wide character conversion. +.Pp +The type +.Vt struct tm +shall be defined as an incomplete type" "a full definition of wich can be found +in +.In time.h . +.\" +.Ss Wide Character String Handling Functions +.Fn "wchar_t *wcscpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" +.br +.Fn "wchar_t *wcsncpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" +.br +.Fn "wchar_t *wmemcpy" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" +.br +.Fn "wchar_t *wmemmove" "wchar_t *s1" "const wchar_t *s2" "size_t n" +.br +.Fn "wchar_t *wcscat" "wchar_t *restrict s1" "const wchar_t *restrict s2" +.br +.Fn "wchar_t *wcsncat" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" +.br +.Fn "int wcscmp" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "int wcscoll" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "int wcsncmp" "const wchar_t *s1" "const wchar_t *s2" "size_t n" +.br +.Fn "size_t wcsxfrm" "wchar_t *restrict s1" "const wchar_t *restrict s2" "size_t n" +.br +.Fn "int wmemcmp" "const wchar_t *s1" "const wchar_t *s2" "size_t n" +.br +.Fn "wchar_t *wcschr" "const wchar_t *s" "wchar_t c" +.br +.Fn "size_t wcscspn" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "wchar_t *wcspbrk" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "wchar_t *wcsrchr" "const wchar_t *s" "wchar_t c" +.br +.Fn "size_t wcsspn" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "wchar_t *wcsstr" "const wchar_t *s1" "const wchar_t *s2" +.br +.Fn "wchar_t *wcstok" "wchar_t *restrict s1" "const wchar_t *restrict s2" "wchar_t **restrict ptr" +.br +.Fn "wchar_t *wmemchr" "const wchar_t *s" "wchar_t c" "size_t n" +.br +.Fn "size_t wcslen" "const wchar_t *s" +.br +.Fn "wchar_t *wmemset" "wchar_t *s" "wchar_t c" "size_t n" +.\" +.Ss Wide Character String Formatting +.Fn "int swprintf" "wchar_t *restrict s" "size_t n" "const wchar_t *restrict format" "..." +.br +.Fn "int swscanf" "const wchar_t *restrict s" "const wchar_t *restrict format" "..." +.br +.Fn "int vswprintf" "wchar_t *restrict s" "size_t n" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "int vswscanf" "const wchar_t *restrict s" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "size_t wcsftime" "wchar_t *restrict s" "size_t maxsize" "const wchar_t *restrict format" "const struct tm *restrict timeptr" +.\" +.Ss Wide Character Input and Output +.Fn "int fwprintf" "FILE *restrict stream" "const wchar_t *restrict format" "..." +.br +.Fn "int fwscanf" "FILE *restrict stream" "const wchar_t *restrict format" "..." +.br +.Fn "int vfwprintf" "FILE *restrict stream" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "int vfwscanf" "FILE *restrict stream" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "int vwprintf" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "int vwscanf" "const wchar_t *restrict format" "va_list arg" +.br +.Fn "int wprintf" "const wchar_t *restrict format" "..." +.br +.Fn "int wscanf" "const wchar_t *restrict format" "..." +.br +.Fn "wint_t fgetwc" "FILE *stream" +.br +.Fn "wchar_t *fgetws" "wchar_t *restrict s" "int n" "FILE *restrict stream" +.br +.Fn "wint_t fputwc" "wchar_t c" "FILE *stream" +.br +.Fn "int fputws" "const wchar_t *restrict s" "FILE *restrict stream" +.br +.Fn "int fwide" "FILE *stream" "int mode" +.br +.Fn "wint_t getwc" "FILE *stream" +.br +.Fn "wint_t getwchar" "void" +.br +.Fn "wint_t putwc" "wchar_t c" "FILE *stream" +.br +.Fn "wint_t putwchar" "wchar_t c" +.br +.Fn "wint_t ungetwc" "wint_t c" "FILE *stream" +.\" +.Ss Wide Character String Parsing +.Fn "double wcstod" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" +.br +.Fn "float wcstof" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" +.br +.Fn "long double wcstold" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" +.br +.Fn "long int wcstol" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" +.br +.Fn "long long int wcstoll" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" +.br +.Fn "unsigned long int wcstoul" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" +.br +.Fn "unsigned long long int wcstoull" "const wchar_t *restrict nptr" "wchar_t **restrict endptr" "int base" +.\" +.Ss Character Set Conversion +.Fn "wint_t btowc" "int c" +.br +.Fn "int wctob" "wint_t c" +.br +.Fn "int mbsinit" "const mbstate_t *ps" +.br +.Fn "size_t mbrlen" "const char *restrict s" "size_t n" "mbstate_t *restrict ps" +.br +.Fn "size_t mbrtowc" "wchar_t *restrict pwc" "const char *restrict s" "size_t n" "mbstate_t *restrict ps" +.br +.Fn "size_t wcrtomb" "char *restrict s" "wchar_t wc" "mbstate_t *restrict ps" +.br +.Fn "size_t mbsrtowcs" "wchar_t *restrict dst" "const char **restrict src" "size_t len" "mbstate_t *restrict ps" +.br +.Fn "size_t wcsrtombs" "char *restrict dst" "const wchar_t **restrict src" "size_t len" "mbstate_t *restrict ps" +.\" +.Sh SEE ALSO +.Xr string.h 3 +.Xr uchar.h 3 +.Xr wcscpy 3 +.Xr wcsncpy 3 +.Xr wmemcpy 3 +.Xr wmemmove 3 +.Xr wcscat 3 +.Xr wcsncat 3 +.Xr wcscmp 3 +.Xr wcscoll 3 +.Xr wcsncmp 3 +.Xr wcsxfrm 3 +.Xr wmemcmp 3 +.Xr wcschr 3 +.Xr wcscspn 3 +.Xr wcspbrk 3 +.Xr wcsrchr 3 +.Xr wcsspn 3 +.Xr wcsstr 3 +.Xr wcstok 3 +.Xr wmemchr 3 +.Xr wcslen 3 +.Xr wmemset 3 +.\" +.Xr swprintf 3 +.Xr swscanf 3 +.Xr vswprintf 3 +.Xr vswscanf 3 +.Xr wcsftime 3 +.\" +.Xr fwprintf 3 +.Xr fwscanf 3 +.Xr vfwprintf 3 +.Xr vfwscanf 3 +.Xr vwprintf 3 +.Xr vwscanf 3 +.Xr wprintf 3 +.Xr wscanf 3 +.Xr fgetwc 3 +.Xr fgetws 3 +.Xr fputwc 3 +.Xr fputws 3 +.Xr fwide 3 +.Xr getwc 3 +.Xr getwchar 3 +.Xr putwc 3 +.Xr putwchar 3 +.Xr ungetwc 3 +.\" +.Xr wcstod 3 +.Xr wcstof 3 +.Xr wcstold 3 +.Xr wcstol 3 +.Xr wcstoll 3 +.Xr wcstoul 3 +.Xr wcstoull 3 +.\" +.Xr btowc 3 +.Xr wctomb 3 +.Xr mbsinit 3 +.Xr mbrlen 3 +.Xr mbrtowc 3 +.Xr wcrtomb 3 +.Xr mbsrtowcs 3 +.Xr wcsrtombs 3 +.\" +.Sh STANDARDS +Conforming to +.St -isoC-amd1 , +.St -isoC-99 and .St -isoC-2011 . \ No newline at end of file diff --git a/opt/c_locale/README.txt b/opt/c_locale/README.txt index 1fced17..d9b5dbf 100644 --- a/opt/c_locale/README.txt +++ b/opt/c_locale/README.txt @@ -1,2 +1,2 @@ -Basic C Locale Support +Basic C Locale Support - i.e. support for the basic (PDCLib-packaged) C locale only \ No newline at end of file diff --git a/opt/c_locale/_PDCLIB_clocale.h b/opt/c_locale/_PDCLIB_clocale.h index 4d13ee5..09ccc4d 100644 --- a/opt/c_locale/_PDCLIB_clocale.h +++ b/opt/c_locale/_PDCLIB_clocale.h @@ -1,19 +1,19 @@ -/* "C" Locale Support - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef _PDCLIB_CLOCALE_H -#define _PDCLIB_CLOCALE_H _PDCLIB_CLOCALE_H -#include +/* "C" Locale Support + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef _PDCLIB_CLOCALE_H +#define _PDCLIB_CLOCALE_H _PDCLIB_CLOCALE_H +#include #ifdef __cplusplus extern "C" { -#endif - -void _PDCLIB_initclocale( locale_t l ); - +#endif + +void _PDCLIB_initclocale( locale_t l ); + #ifdef __cplusplus } -#endif -#endif // _PDCLIB_CLOCALE_H +#endif +#endif // _PDCLIB_CLOCALE_H diff --git a/opt/c_locale/_PDCLIB_initclocale.c b/opt/c_locale/_PDCLIB_initclocale.c index 4b214e4..d7cf350 100644 --- a/opt/c_locale/_PDCLIB_initclocale.c +++ b/opt/c_locale/_PDCLIB_initclocale.c @@ -1,29 +1,29 @@ -/* _PDCLIB_initclocale( locale_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef REGTEST -#include "_PDCLIB_clocale.h" -#include "_PDCLIB_locale.h" - -void _PDCLIB_initclocale( locale_t l ) -{ - // TODO: There will be more added here... - - l->_WCType = _PDCLIB_wcinfo; - l->_WCTypeSize = _PDCLIB_wcinfo_size; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main() -{ - return TEST_RESULTS; -} - +/* _PDCLIB_initclocale( locale_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef REGTEST +#include "_PDCLIB_clocale.h" +#include "_PDCLIB_locale.h" + +void _PDCLIB_initclocale( locale_t l ) +{ + // TODO: There will be more added here... + + l->_WCType = _PDCLIB_wcinfo; + l->_WCTypeSize = _PDCLIB_wcinfo_size; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main() +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/opt/mincoll/wcscoll.c b/opt/mincoll/wcscoll.c index 2e79081..9c7c2a6 100644 --- a/opt/mincoll/wcscoll.c +++ b/opt/mincoll/wcscoll.c @@ -1,36 +1,36 @@ -/* wcscoll( const wchar_t *, const wchar_t * ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -/* I did much searching as to how various people implement this. - * - * OpenBSD, NetBSD and Musl libc for Linux implement this as a call to wcscmp - * and have various "todo" notices on this function, and on the other hand - * glibc implements it as a 500 line function. FreeBSD has an implementation - * which kind of uses their single byte character strcoll data for the first - * 256 characters, but looks incredibly fragile and likely to break. - * - * TL;DR: Nobody uses this, and this will probably work perfectly fine for you. - */ - -int wcscoll( const wchar_t * s1, const wchar_t * s2 ) -{ - return wcscmp(s1, s2); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} -#endif +/* wcscoll( const wchar_t *, const wchar_t * ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +/* I did much searching as to how various people implement this. + * + * OpenBSD, NetBSD and Musl libc for Linux implement this as a call to wcscmp + * and have various "todo" notices on this function, and on the other hand + * glibc implements it as a 500 line function. FreeBSD has an implementation + * which kind of uses their single byte character strcoll data for the first + * 256 characters, but looks incredibly fragile and likely to break. + * + * TL;DR: Nobody uses this, and this will probably work perfectly fine for you. + */ + +int wcscoll( const wchar_t * s1, const wchar_t * s2 ) +{ + return wcscmp(s1, s2); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} +#endif diff --git a/opt/mincoll/wcsxfrm.c b/opt/mincoll/wcsxfrm.c index 4bb6adc..6d1bd37 100644 --- a/opt/mincoll/wcsxfrm.c +++ b/opt/mincoll/wcsxfrm.c @@ -1,28 +1,28 @@ -/* wcsxfrm( char *, const char *, size_t ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#include - -#ifndef REGTEST - -/* See notes on wcscoll. */ -size_t wcsxfrm( wchar_t * _PDCLIB_restrict s1, const wchar_t * _PDCLIB_restrict s2, size_t n ) -{ - wcsncpy(s1, s2, n); - return wcslen(s2); -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} -#endif - +/* wcsxfrm( char *, const char *, size_t ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#include + +#ifndef REGTEST + +/* See notes on wcscoll. */ +size_t wcsxfrm( wchar_t * _PDCLIB_restrict s1, const wchar_t * _PDCLIB_restrict s2, size_t n ) +{ + wcsncpy(s1, s2, n); + return wcslen(s2); +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} +#endif + diff --git a/opt/nothread/_PDCLIB_threadconfig.h b/opt/nothread/_PDCLIB_threadconfig.h index cf0a625..fcc3d39 100644 --- a/opt/nothread/_PDCLIB_threadconfig.h +++ b/opt/nothread/_PDCLIB_threadconfig.h @@ -1,28 +1,28 @@ -#ifndef _PDCLIB_THREADCONFIG_H -#define _PDCLIB_THREADCONFIG_H -#include "_PDCLIB_aux.h" -#include "_PDCLIB_config.h" - +#ifndef _PDCLIB_THREADCONFIG_H +#define _PDCLIB_THREADCONFIG_H +#include "_PDCLIB_aux.h" +#include "_PDCLIB_config.h" + #ifdef __cplusplus extern "C" { -#endif -#define _PDCLIB_ONCE_FLAG_INIT 0 -#define _PDCLIB_ONCE_FLAG_IS_DONE(_f) (*(_f) == 1) -typedef char _PDCLIB_once_flag; - -void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)); - -#define _PDCLIB_THRD_HAVE_MISC -#define _PDCLIB_CND_T char -#define _PDCLIB_MTX_T char -#define _PDCLIB_TSS_T struct _PDCLIB_tss - -struct _PDCLIB_tss { - struct _PDCLIB_tss *self; - void *value; -}; - +#endif +#define _PDCLIB_ONCE_FLAG_INIT 0 +#define _PDCLIB_ONCE_FLAG_IS_DONE(_f) (*(_f) == 1) +typedef char _PDCLIB_once_flag; + +void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)); + +#define _PDCLIB_THRD_HAVE_MISC +#define _PDCLIB_CND_T char +#define _PDCLIB_MTX_T char +#define _PDCLIB_TSS_T struct _PDCLIB_tss + +struct _PDCLIB_tss { + struct _PDCLIB_tss *self; + void *value; +}; + #ifdef __cplusplus } -#endif -#endif +#endif +#endif diff --git a/opt/nothread/call_once.c b/opt/nothread/call_once.c index 3bdca04..6673d61 100644 --- a/opt/nothread/call_once.c +++ b/opt/nothread/call_once.c @@ -1,40 +1,40 @@ -#ifndef REGTEST -#include - -void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)) -{ - if(!_PDCLIB_ONCE_FLAG_IS_DONE(flag)) { - func(); - *flag = 1; - } -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#ifndef REGTEST -static int count = 0; -static once_flag once = ONCE_FLAG_INIT; - -static void do_once(void) -{ - count++; -} -#endif - -int main( void ) -{ -#ifndef REGTEST - TESTCASE(count == 0); - call_once(&once, do_once); - TESTCASE(count == 1); - call_once(&once, do_once); - TESTCASE(count == 1); - do_once(); - TESTCASE(count == 2); -#endif - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)) +{ + if(!_PDCLIB_ONCE_FLAG_IS_DONE(flag)) { + func(); + *flag = 1; + } +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#ifndef REGTEST +static int count = 0; +static once_flag once = ONCE_FLAG_INIT; + +static void do_once(void) +{ + count++; +} +#endif + +int main( void ) +{ +#ifndef REGTEST + TESTCASE(count == 0); + call_once(&once, do_once); + TESTCASE(count == 1); + call_once(&once, do_once); + TESTCASE(count == 1); + do_once(); + TESTCASE(count == 2); +#endif + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/cnd_init.c b/opt/nothread/cnd_init.c index 13f1732..4e05427 100644 --- a/opt/nothread/cnd_init.c +++ b/opt/nothread/cnd_init.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include - -int cnd_init(cnd_t *cond) -{ - /* does nothing */ - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int cnd_init(cnd_t *cond) +{ + /* does nothing */ + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/cnd_signal.c b/opt/nothread/cnd_signal.c index 2492d82..275ba16 100644 --- a/opt/nothread/cnd_signal.c +++ b/opt/nothread/cnd_signal.c @@ -1,18 +1,18 @@ -#ifndef REGTEST -#include - -int cnd_signal(cnd_t *cond) -{ - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int cnd_signal(cnd_t *cond) +{ + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/cnd_wait.c b/opt/nothread/cnd_wait.c index 86b70ab..444e1d4 100644 --- a/opt/nothread/cnd_wait.c +++ b/opt/nothread/cnd_wait.c @@ -1,18 +1,18 @@ -#ifndef REGTEST -#include - -int cnd_wait(cnd_t *cond, mtx_t *mtx) -{ - return thrd_error; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int cnd_wait(cnd_t *cond, mtx_t *mtx) +{ + return thrd_error; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_destroy.c b/opt/nothread/mtx_destroy.c index 344e0ee..587b525 100644 --- a/opt/nothread/mtx_destroy.c +++ b/opt/nothread/mtx_destroy.c @@ -1,16 +1,16 @@ -#ifndef REGTEST -#include - -void mtx_destroy(mtx_t *mtx) -{} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +void mtx_destroy(mtx_t *mtx) +{} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_init.c b/opt/nothread/mtx_init.c index 6d48970..e1bf08e 100644 --- a/opt/nothread/mtx_init.c +++ b/opt/nothread/mtx_init.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include - -int mtx_init(mtx_t *mtx, int type) -{ - *mtx = 0; - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int mtx_init(mtx_t *mtx, int type) +{ + *mtx = 0; + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_lock.c b/opt/nothread/mtx_lock.c index cebc07d..2c5a26d 100644 --- a/opt/nothread/mtx_lock.c +++ b/opt/nothread/mtx_lock.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include - -int mtx_lock(mtx_t *mtx) -{ - (*mtx)++; - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int mtx_lock(mtx_t *mtx) +{ + (*mtx)++; + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_timedlock.c b/opt/nothread/mtx_timedlock.c index 047dce6..c9d8f20 100644 --- a/opt/nothread/mtx_timedlock.c +++ b/opt/nothread/mtx_timedlock.c @@ -1,18 +1,18 @@ -#ifndef REGTEST -#include - -int mtx_timedlock(mtx_t *restrict mtx, const struct timespec *restrict ts) -{ - return mtx_lock(mtx); -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int mtx_timedlock(mtx_t *restrict mtx, const struct timespec *restrict ts) +{ + return mtx_lock(mtx); +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_trylock.c b/opt/nothread/mtx_trylock.c index 3224e47..cd0c701 100644 --- a/opt/nothread/mtx_trylock.c +++ b/opt/nothread/mtx_trylock.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include - -int mtx_trylock(mtx_t *mtx) -{ - (*mtx)++; - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int mtx_trylock(mtx_t *mtx) +{ + (*mtx)++; + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/mtx_unlock.c b/opt/nothread/mtx_unlock.c index a12c0a0..42f696a 100644 --- a/opt/nothread/mtx_unlock.c +++ b/opt/nothread/mtx_unlock.c @@ -1,20 +1,20 @@ -#ifndef REGTEST -#include - -int mtx_unlock(mtx_t *mtx) -{ - if(--(*mtx) >= 0) - return thrd_success; - return thrd_error; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int mtx_unlock(mtx_t *mtx) +{ + if(--(*mtx) >= 0) + return thrd_success; + return thrd_error; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/thrd_yield.c b/opt/nothread/thrd_yield.c index 0cb99ac..55ce0a2 100644 --- a/opt/nothread/thrd_yield.c +++ b/opt/nothread/thrd_yield.c @@ -1,18 +1,18 @@ -#ifndef REGTEST -#include - -void thrd_yield(void) -{ - /* does nothing */ -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +void thrd_yield(void) +{ + /* does nothing */ +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/tss_create.c b/opt/nothread/tss_create.c index 640ab30..a778c7b 100644 --- a/opt/nothread/tss_create.c +++ b/opt/nothread/tss_create.c @@ -1,21 +1,21 @@ -#ifndef REGTEST -#include - -int tss_create(tss_t *key, tss_dtor_t dtor) -{ - key->self = key; - key->value = NULL; - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int tss_create(tss_t *key, tss_dtor_t dtor) +{ + key->self = key; + key->value = NULL; + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/tss_delete.c b/opt/nothread/tss_delete.c index 53c6e16..bad8d0b 100644 --- a/opt/nothread/tss_delete.c +++ b/opt/nothread/tss_delete.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include - -void tss_delete(tss_t key) -{ - key.self->self = NULL; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +void tss_delete(tss_t key) +{ + key.self->self = NULL; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/tss_get.c b/opt/nothread/tss_get.c index 531368f..483088a 100644 --- a/opt/nothread/tss_get.c +++ b/opt/nothread/tss_get.c @@ -1,30 +1,30 @@ -#ifndef REGTEST -#include - -void *tss_get(tss_t key) -{ - return key.value; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#ifndef REGTEST -static tss_t key; -static char v; -#endif - -int main( void ) -{ -#ifndef REGTEST - TESTCASE(tss_create(&key, NULL) == thrd_success); - TESTCASE(tss_get(key) == NULL); - TESTCASE(tss_set(key, &v) == thrd_success); - TESTCASE(tss_get(key) == &v); - tss_delete(key); -#endif - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +void *tss_get(tss_t key) +{ + return key.value; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#ifndef REGTEST +static tss_t key; +static char v; +#endif + +int main( void ) +{ +#ifndef REGTEST + TESTCASE(tss_create(&key, NULL) == thrd_success); + TESTCASE(tss_get(key) == NULL); + TESTCASE(tss_set(key, &v) == thrd_success); + TESTCASE(tss_get(key) == &v); + tss_delete(key); +#endif + return TEST_RESULTS; +} + +#endif diff --git a/opt/nothread/tss_set.c b/opt/nothread/tss_set.c index 1e8a5eb..e66ea33 100644 --- a/opt/nothread/tss_set.c +++ b/opt/nothread/tss_set.c @@ -1,20 +1,20 @@ -#ifndef REGTEST -#include - -int tss_set(tss_t key, void *val) -{ - key.self->value = val; - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include + +int tss_set(tss_t key, void *val) +{ + key.self->value = val; + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/notime/time.c b/opt/notime/time.c index 32058fe..6bbf4c7 100644 --- a/opt/notime/time.c +++ b/opt/notime/time.c @@ -1,19 +1,19 @@ -#include - -#ifndef REGTEST -time_t time(time_t* t) -{ - if(t) *t = -1; - return -1; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#include + +#ifndef REGTEST +time_t time(time_t* t) +{ + if(t) *t = -1; + return -1; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/opt/notime/timespec_get.c b/opt/notime/timespec_get.c index 3f844f1..04acf61 100644 --- a/opt/notime/timespec_get.c +++ b/opt/notime/timespec_get.c @@ -1,18 +1,18 @@ -#include -#ifndef REGTEST - -int timespec_get( struct timespec *ts, int base ) -{ - return 0; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +#include +#ifndef REGTEST + +int timespec_get( struct timespec *ts, int base ) +{ + return 0; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/platform/example/Config.jam b/platform/example/Config.jam index f17c12f..9b4d072 100644 --- a/platform/example/Config.jam +++ b/platform/example/Config.jam @@ -1,18 +1,18 @@ -rule PDCLibTargetConfig { } -rule PDCLibTargetHeaders { - SubDirHdrs $(PDCLIB_TOP) platform example includes ; - SubDirHdrs $(PDCLIB_TOP) platform example internals ; -} - -if $(PDCLIB_TOOLCHAIN) = "gcc" { - PDCLIB_TEST_LINKFLAGS += -nostdlib ; - PDCLIB_TEST_LINKLIBS += -lgcc ; -} - -PDCLIB_OPTIONS = - nothread - notime - tss_errno - basecodecs - c_locale - ; +rule PDCLibTargetConfig { } +rule PDCLibTargetHeaders { + SubDirHdrs $(PDCLIB_TOP) platform example includes ; + SubDirHdrs $(PDCLIB_TOP) platform example internals ; +} + +if $(PDCLIB_TOOLCHAIN) = "gcc" { + PDCLIB_TEST_LINKFLAGS += -nostdlib ; + PDCLIB_TEST_LINKLIBS += -lgcc ; +} + +PDCLIB_OPTIONS = + nothread + notime + tss_errno + basecodecs + c_locale + ; diff --git a/platform/example/Jamfile b/platform/example/Jamfile index 444f44a..cbbdb38 100644 --- a/platform/example/Jamfile +++ b/platform/example/Jamfile @@ -1,2 +1,2 @@ -SubDir PDCLIB_TOP platform example ; +SubDir PDCLIB_TOP platform example ; PDCLibConfig ; \ No newline at end of file diff --git a/platform/example/functions/_PDCLIB/_PDCLIB_fileops.c b/platform/example/functions/_PDCLIB/_PDCLIB_fileops.c index 1316cd6..bfe3d85 100644 --- a/platform/example/functions/_PDCLIB/_PDCLIB_fileops.c +++ b/platform/example/functions/_PDCLIB/_PDCLIB_fileops.c @@ -1,56 +1,56 @@ -/* _PDCLIB_fileops - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef REGTEST -#include -#include -#include "_PDCLIB_glue.h" -#include - -static bool readf( _PDCLIB_fd_t self, void * buf, size_t length, - size_t * numBytesRead ) -{ - errno = ENOTSUP; - return false; -} - -static bool writef( _PDCLIB_fd_t self, const void * buf, size_t length, - size_t * numBytesWritten ) -{ - errno = ENOTSUP; - return false; -} -static bool seekf( _PDCLIB_fd_t self, int_fast64_t offset, int whence, - int_fast64_t* newPos ) -{ - errno = ENOTSUP; - return false; -} - -static void closef( _PDCLIB_fd_t self ) -{ - errno = ENOTSUP; -} - -const _PDCLIB_fileops_t _PDCLIB_fileops = { - .read = readf, - .write = writef, - .seek = seekf, - .close = closef, -}; - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // Tested by stdio test cases - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_fileops + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef REGTEST +#include +#include +#include "_PDCLIB_glue.h" +#include + +static bool readf( _PDCLIB_fd_t self, void * buf, size_t length, + size_t * numBytesRead ) +{ + errno = ENOTSUP; + return false; +} + +static bool writef( _PDCLIB_fd_t self, const void * buf, size_t length, + size_t * numBytesWritten ) +{ + errno = ENOTSUP; + return false; +} +static bool seekf( _PDCLIB_fd_t self, int_fast64_t offset, int whence, + int_fast64_t* newPos ) +{ + errno = ENOTSUP; + return false; +} + +static void closef( _PDCLIB_fd_t self ) +{ + errno = ENOTSUP; +} + +const _PDCLIB_fileops_t _PDCLIB_fileops = { + .read = readf, + .write = writef, + .seek = seekf, + .close = closef, +}; + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // Tested by stdio test cases + return TEST_RESULTS; +} + +#endif diff --git a/platform/example/functions/_PDCLIB/_PDCLIB_open.c b/platform/example/functions/_PDCLIB/_PDCLIB_open.c index 686ea4b..117d149 100644 --- a/platform/example/functions/_PDCLIB/_PDCLIB_open.c +++ b/platform/example/functions/_PDCLIB/_PDCLIB_open.c @@ -1,37 +1,37 @@ -/* _PDCLIB_open( char const * const, int ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -/* This is a stub implementation of open. -*/ - -#include -#include - -#ifndef REGTEST -#include "_PDCLIB_glue.h" - -bool _PDCLIB_open( _PDCLIB_fd_t * pFd, const _PDCLIB_fileops_t ** pOps, - char const * const filename, unsigned int mode ) -{ - errno = ENOTSUP; - return false; -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#include -#include - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif - +/* _PDCLIB_open( char const * const, int ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +/* This is a stub implementation of open. +*/ + +#include +#include + +#ifndef REGTEST +#include "_PDCLIB_glue.h" + +bool _PDCLIB_open( _PDCLIB_fd_t * pFd, const _PDCLIB_fileops_t ** pOps, + char const * const filename, unsigned int mode ) +{ + errno = ENOTSUP; + return false; +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#include +#include + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif + diff --git a/platform/example/functions/_PDCLIB/freepages.c b/platform/example/functions/_PDCLIB/freepages.c index ef1893e..6254976 100644 --- a/platform/example/functions/_PDCLIB/freepages.c +++ b/platform/example/functions/_PDCLIB/freepages.c @@ -1,28 +1,28 @@ -/* _PDCLIB_allocpages( int const ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -/* This is a stub implementation of _PDCLIB_allocpages -*/ - -#include -#include -#include "_PDCLIB_glue.h" -#include - -void _PDCLIB_freepages( void * p, size_t n ) -{ - return; -} - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_allocpages( int const ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +/* This is a stub implementation of _PDCLIB_allocpages +*/ + +#include +#include +#include "_PDCLIB_glue.h" +#include + +void _PDCLIB_freepages( void * p, size_t n ) +{ + return; +} + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/platform/gandr/functions/_PDCLIB/_PDCLIB_freepages.c b/platform/gandr/functions/_PDCLIB/_PDCLIB_freepages.c index d33f486..82eb816 100644 --- a/platform/gandr/functions/_PDCLIB/_PDCLIB_freepages.c +++ b/platform/gandr/functions/_PDCLIB/_PDCLIB_freepages.c @@ -1,33 +1,33 @@ -/* _PDCLIB_allocpages( int const ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -/* This is a stub implementation of _PDCLIB_allocpages -*/ - -#include -#include -#include "_PDCLIB_glue.h" -#include -#include - -void _PDCLIB_freepages( void * p, size_t n ) -{ - int rv = 0; - if((rv = gd_free_pages( p, n ))) { - perror("_PDCLIB_freepages"); - abort(); - } -} - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_allocpages( int const ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +/* This is a stub implementation of _PDCLIB_allocpages +*/ + +#include +#include +#include "_PDCLIB_glue.h" +#include +#include + +void _PDCLIB_freepages( void * p, size_t n ) +{ + int rv = 0; + if((rv = gd_free_pages( p, n ))) { + perror("_PDCLIB_freepages"); + abort(); + } +} + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/platform/posix/Config.jam b/platform/posix/Config.jam index 449a66b..db43ae3 100644 --- a/platform/posix/Config.jam +++ b/platform/posix/Config.jam @@ -1,18 +1,18 @@ -rule PDCLibTargetConfig { } -rule PDCLibTargetHeaders { - SubDirHdrs $(PDCLIB_TOP) platform posix includes ; - SubDirHdrs $(PDCLIB_TOP) platform posix internals ; -} - -if $(OS) = "MACOSX" { - # Need to link libSystem -} else { - #PDCLIB_TEST_LINKFLAGS += -nostdlib ; - PDCLIB_TEST_LINKLIBS += -lgcc -lpthread ; -} - -PDCLIB_OPTIONS = - pthreads - notime - basecodecs - c_locale ; +rule PDCLibTargetConfig { } +rule PDCLibTargetHeaders { + SubDirHdrs $(PDCLIB_TOP) platform posix includes ; + SubDirHdrs $(PDCLIB_TOP) platform posix internals ; +} + +if $(OS) = "MACOSX" { + # Need to link libSystem +} else { + #PDCLIB_TEST_LINKFLAGS += -nostdlib ; + PDCLIB_TEST_LINKLIBS += -lgcc -lpthread ; +} + +PDCLIB_OPTIONS = + pthreads + notime + basecodecs + c_locale ; diff --git a/platform/win32/Config.jam b/platform/win32/Config.jam index 1c59de6..ac45789 100644 --- a/platform/win32/Config.jam +++ b/platform/win32/Config.jam @@ -1,34 +1,34 @@ -rule PDCLibTargetConfig { } -rule PDCLibTargetHeaders { - SubDirHdrs $(PDCLIB_TOP) platform win32 includes ; - SubDirHdrs $(PDCLIB_TOP) platform win32 internals ; - - if $(PDCLIB_TOOLCHAIN) = "WATCOM" { - SubDirHdrs $(WATCOM) h ; - } -} - -if $(PDCLIB_TOOLCHAIN) = "gcc" { - PDCLIB_TEST_LINKFLAGS += -nostdlib ; - PDCLIB_TEST_LINKLIBS += -lgcc -lkernel32 -lshell32 ; -} else if $(PDCLIB_TOOLCHAIN) = "WATCOM" { - PDCLIB_TEST_LINKFLAGS = "-\"option start=_mainCRTStartup\"" ; - PDCLIB_TEST_LINKLIBS = - $(WATCOM)\\lib386\\nt\\kernel32.lib - $(WATCOM)\\lib386\\nt\\shell32.lib - $(WATCOM)\\lib386\\nt\\clib3r.lib ; - PDCLIB_REGTEST_CCHDRS = [ FIncludes $(WATCOM)\\h ] ; -} else { - ECHO Win32 doesn't support toolchain $(PDCLIB_TOOLCHAIN) ; - EXIT ; -} - -PDCLIB_OPTIONS = - notime - mincoll - tss_errno - basecodecs - c_locale - ; - -CRT0 = [ FDirName platform win32 crt0$(SUFOBJ) ] ; +rule PDCLibTargetConfig { } +rule PDCLibTargetHeaders { + SubDirHdrs $(PDCLIB_TOP) platform win32 includes ; + SubDirHdrs $(PDCLIB_TOP) platform win32 internals ; + + if $(PDCLIB_TOOLCHAIN) = "WATCOM" { + SubDirHdrs $(WATCOM) h ; + } +} + +if $(PDCLIB_TOOLCHAIN) = "gcc" { + PDCLIB_TEST_LINKFLAGS += -nostdlib ; + PDCLIB_TEST_LINKLIBS += -lgcc -lkernel32 -lshell32 ; +} else if $(PDCLIB_TOOLCHAIN) = "WATCOM" { + PDCLIB_TEST_LINKFLAGS = "-\"option start=_mainCRTStartup\"" ; + PDCLIB_TEST_LINKLIBS = + $(WATCOM)\\lib386\\nt\\kernel32.lib + $(WATCOM)\\lib386\\nt\\shell32.lib + $(WATCOM)\\lib386\\nt\\clib3r.lib ; + PDCLIB_REGTEST_CCHDRS = [ FIncludes $(WATCOM)\\h ] ; +} else { + ECHO Win32 doesn't support toolchain $(PDCLIB_TOOLCHAIN) ; + EXIT ; +} + +PDCLIB_OPTIONS = + notime + mincoll + tss_errno + basecodecs + c_locale + ; + +CRT0 = [ FDirName platform win32 crt0$(SUFOBJ) ] ; diff --git a/platform/win32/Jamfile b/platform/win32/Jamfile index 35b8dea..62f3bb5 100644 --- a/platform/win32/Jamfile +++ b/platform/win32/Jamfile @@ -1,6 +1,6 @@ -SubDir PDCLIB_TOP platform win32 ; -PDCLibConfig ; - -Object $(CRT0) : $(CRT0:S=.c) ; - +SubDir PDCLIB_TOP platform win32 ; +PDCLibConfig ; + +Object $(CRT0) : $(CRT0:S=.c) ; + DEPENDS all : $(CRT0) ; \ No newline at end of file diff --git a/platform/win32/crt0.c b/platform/win32/crt0.c index 471e42c..8cbb2c5 100644 --- a/platform/win32/crt0.c +++ b/platform/win32/crt0.c @@ -1,142 +1,142 @@ -#include -#include -#include -#include -#include -#include // Watcom bug: winnt.h assumes string.h defines wchar_t -#include -#include "_PDCLIB_io.h" -#include "_PDCLIB_locale.h" -#include "_PDCLIB_clocale.h" - -static char ** argvToAnsi( wchar_t ** wargv, int argc ) -{ - char ** argv = malloc( sizeof( *argv ) * argc ); - for ( int i = 0; i != argc; ++i ) { - int sz = WideCharToMultiByte( CP_ACP, WC_COMPOSITECHECK | WC_SEPCHARS, - wargv[i], -1, NULL, 0, NULL, NULL ); - if(!(argv[i] = malloc(sz))) { - fputs("Error in C runtime initialization: " - "unable to allocate buffer for argument", stderr); - abort(); - } - - int rv = WideCharToMultiByte( CP_ACP, WC_COMPOSITECHECK | WC_SEPCHARS, - wargv[i], -1, argv[i], sz, NULL, NULL ); - - if(rv != sz) { - fputs("Error in C runtime initialization: " - "size mismatch during character set conversion", stderr); - abort(); - } - } - return argv; -} - -static int argc; -static wchar_t * cl; -static wchar_t ** wargv; -static char ** argv; - -static void freeArgs( void ) -{ - for(int i = 0; i != argc; i++) { - free( argv[i] ); - } - free( argv ); - LocalFree( wargv ); -} - -extern void (*_PDCLIB_sigfpe)( int ); -extern void (*_PDCLIB_sigill)( int ); -extern void (*_PDCLIB_sigsegv)( int ); - -static LPTOP_LEVEL_EXCEPTION_FILTER oldFilter; -static LONG CALLBACK sehExceptionFilter( EXCEPTION_POINTERS * exInfo ) -{ - int sig; - void (*handler)( int ); - - switch( exInfo->ExceptionRecord->ExceptionCode ) { - case EXCEPTION_ACCESS_VIOLATION: - case EXCEPTION_ARRAY_BOUNDS_EXCEEDED: - case EXCEPTION_DATATYPE_MISALIGNMENT: - case EXCEPTION_GUARD_PAGE: - case EXCEPTION_IN_PAGE_ERROR: - case EXCEPTION_STACK_OVERFLOW: - sig = SIGSEGV; - handler = _PDCLIB_sigsegv; - break; - - case EXCEPTION_ILLEGAL_INSTRUCTION: - case EXCEPTION_PRIV_INSTRUCTION: - sig = SIGILL; - handler = _PDCLIB_sigill; - break; - - case EXCEPTION_INT_DIVIDE_BY_ZERO: - case EXCEPTION_INT_OVERFLOW: - case EXCEPTION_FLT_DENORMAL_OPERAND: - case EXCEPTION_FLT_DIVIDE_BY_ZERO: - case EXCEPTION_FLT_INEXACT_RESULT: - case EXCEPTION_FLT_INVALID_OPERATION: - case EXCEPTION_FLT_OVERFLOW: - case EXCEPTION_FLT_STACK_CHECK: - case EXCEPTION_FLT_UNDERFLOW: - sig = SIGFPE; - handler = _PDCLIB_sigfpe; - break; - - default: - return oldFilter ? oldFilter( exInfo ) : EXCEPTION_EXECUTE_HANDLER; - } - - if(handler == SIG_DFL) { - return EXCEPTION_EXECUTE_HANDLER; - } else if(handler == SIG_IGN) { - return EXCEPTION_CONTINUE_EXECUTION; - } else { - handler( sig ); - return EXCEPTION_CONTINUE_EXECUTION; - } -} - -extern int main( int argc, char ** argv, char ** envp ); - -void __cdecl mainCRTStartup( void ); - -void __cdecl mainCRTStartup( void ) -{ - stdin->handle.pointer = GetStdHandle(STD_INPUT_HANDLE); - stdout->handle.pointer = GetStdHandle(STD_OUTPUT_HANDLE); - stderr->handle.pointer = GetStdHandle(STD_ERROR_HANDLE); - - oldFilter = SetUnhandledExceptionFilter( sehExceptionFilter ); - - cl = GetCommandLineW(); - wargv = CommandLineToArgvW(cl, &argc); - argv = argvToAnsi(wargv, argc); - - _PDCLIB_initclocale( &_PDCLIB_global_locale ); - - if(tss_create(&_PDCLIB_locale_tss, (tss_dtor_t) freelocale) - != thrd_success) { - fputs( "Error during C runtime initialization: " - "Unable to allocate locale TLS", stderr ); - exit( EXIT_FAILURE ); - } - - if( mtx_init(&stdin->lock, mtx_recursive) != thrd_success - || mtx_init(&stdout->lock, mtx_recursive) != thrd_success - || mtx_init(&stderr->lock, mtx_recursive) != thrd_success ) { - fputs( "Error during C runtime initialization: " - "Unable to allocate stdio mutex", stderr ); - exit( EXIT_FAILURE ); - } - - atexit(freeArgs); - - int exitStatus = main(argc, argv, NULL); - - exit(exitStatus); +#include +#include +#include +#include +#include +#include // Watcom bug: winnt.h assumes string.h defines wchar_t +#include +#include "_PDCLIB_io.h" +#include "_PDCLIB_locale.h" +#include "_PDCLIB_clocale.h" + +static char ** argvToAnsi( wchar_t ** wargv, int argc ) +{ + char ** argv = malloc( sizeof( *argv ) * argc ); + for ( int i = 0; i != argc; ++i ) { + int sz = WideCharToMultiByte( CP_ACP, WC_COMPOSITECHECK | WC_SEPCHARS, + wargv[i], -1, NULL, 0, NULL, NULL ); + if(!(argv[i] = malloc(sz))) { + fputs("Error in C runtime initialization: " + "unable to allocate buffer for argument", stderr); + abort(); + } + + int rv = WideCharToMultiByte( CP_ACP, WC_COMPOSITECHECK | WC_SEPCHARS, + wargv[i], -1, argv[i], sz, NULL, NULL ); + + if(rv != sz) { + fputs("Error in C runtime initialization: " + "size mismatch during character set conversion", stderr); + abort(); + } + } + return argv; +} + +static int argc; +static wchar_t * cl; +static wchar_t ** wargv; +static char ** argv; + +static void freeArgs( void ) +{ + for(int i = 0; i != argc; i++) { + free( argv[i] ); + } + free( argv ); + LocalFree( wargv ); +} + +extern void (*_PDCLIB_sigfpe)( int ); +extern void (*_PDCLIB_sigill)( int ); +extern void (*_PDCLIB_sigsegv)( int ); + +static LPTOP_LEVEL_EXCEPTION_FILTER oldFilter; +static LONG CALLBACK sehExceptionFilter( EXCEPTION_POINTERS * exInfo ) +{ + int sig; + void (*handler)( int ); + + switch( exInfo->ExceptionRecord->ExceptionCode ) { + case EXCEPTION_ACCESS_VIOLATION: + case EXCEPTION_ARRAY_BOUNDS_EXCEEDED: + case EXCEPTION_DATATYPE_MISALIGNMENT: + case EXCEPTION_GUARD_PAGE: + case EXCEPTION_IN_PAGE_ERROR: + case EXCEPTION_STACK_OVERFLOW: + sig = SIGSEGV; + handler = _PDCLIB_sigsegv; + break; + + case EXCEPTION_ILLEGAL_INSTRUCTION: + case EXCEPTION_PRIV_INSTRUCTION: + sig = SIGILL; + handler = _PDCLIB_sigill; + break; + + case EXCEPTION_INT_DIVIDE_BY_ZERO: + case EXCEPTION_INT_OVERFLOW: + case EXCEPTION_FLT_DENORMAL_OPERAND: + case EXCEPTION_FLT_DIVIDE_BY_ZERO: + case EXCEPTION_FLT_INEXACT_RESULT: + case EXCEPTION_FLT_INVALID_OPERATION: + case EXCEPTION_FLT_OVERFLOW: + case EXCEPTION_FLT_STACK_CHECK: + case EXCEPTION_FLT_UNDERFLOW: + sig = SIGFPE; + handler = _PDCLIB_sigfpe; + break; + + default: + return oldFilter ? oldFilter( exInfo ) : EXCEPTION_EXECUTE_HANDLER; + } + + if(handler == SIG_DFL) { + return EXCEPTION_EXECUTE_HANDLER; + } else if(handler == SIG_IGN) { + return EXCEPTION_CONTINUE_EXECUTION; + } else { + handler( sig ); + return EXCEPTION_CONTINUE_EXECUTION; + } +} + +extern int main( int argc, char ** argv, char ** envp ); + +void __cdecl mainCRTStartup( void ); + +void __cdecl mainCRTStartup( void ) +{ + stdin->handle.pointer = GetStdHandle(STD_INPUT_HANDLE); + stdout->handle.pointer = GetStdHandle(STD_OUTPUT_HANDLE); + stderr->handle.pointer = GetStdHandle(STD_ERROR_HANDLE); + + oldFilter = SetUnhandledExceptionFilter( sehExceptionFilter ); + + cl = GetCommandLineW(); + wargv = CommandLineToArgvW(cl, &argc); + argv = argvToAnsi(wargv, argc); + + _PDCLIB_initclocale( &_PDCLIB_global_locale ); + + if(tss_create(&_PDCLIB_locale_tss, (tss_dtor_t) freelocale) + != thrd_success) { + fputs( "Error during C runtime initialization: " + "Unable to allocate locale TLS", stderr ); + exit( EXIT_FAILURE ); + } + + if( mtx_init(&stdin->lock, mtx_recursive) != thrd_success + || mtx_init(&stdout->lock, mtx_recursive) != thrd_success + || mtx_init(&stderr->lock, mtx_recursive) != thrd_success ) { + fputs( "Error during C runtime initialization: " + "Unable to allocate stdio mutex", stderr ); + exit( EXIT_FAILURE ); + } + + atexit(freeArgs); + + int exitStatus = main(argc, argv, NULL); + + exit(exitStatus); } \ No newline at end of file diff --git a/platform/win32/functions/_PDCLIB/_PDCLIB_fileops.c b/platform/win32/functions/_PDCLIB/_PDCLIB_fileops.c index 2bd5113..f9b695b 100644 --- a/platform/win32/functions/_PDCLIB/_PDCLIB_fileops.c +++ b/platform/win32/functions/_PDCLIB/_PDCLIB_fileops.c @@ -1,87 +1,87 @@ -/* _PDCLIB_fileops - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -#ifndef REGTEST -#include -#include -#include "_PDCLIB_glue.h" -#include -#include - -#if _PDCLIB_C_MIN(2011) -_Static_assert(SEEK_SET == FILE_BEGIN, "SEEK_SET is incorrect"); -_Static_assert(SEEK_CUR == FILE_CURRENT, "SEEK_CUR is incorrect"); -_Static_assert(SEEK_END == FILE_END, "SEEK_END is incorrect"); -#endif - -void _PDCLIB_w32errno(void); - -static bool readf( _PDCLIB_fd_t self, void * buf, size_t length, - size_t * numBytesRead ) -{ - DWORD dwLen = length > INT32_MAX ? INT32_MAX : length; - DWORD dwBytesRead; - if(ReadFile(self.pointer, buf, dwLen, &dwBytesRead, NULL)) { - *numBytesRead = dwBytesRead; - return true; - } else { - _PDCLIB_w32errno(); - return false; - } -} - -static bool writef( _PDCLIB_fd_t self, const void * buf, size_t length, - size_t * numBytesWritten ) -{ - DWORD dwLen = length > INT32_MAX ? INT32_MAX : length; - DWORD dwBytesWritten; - - if(WriteFile(self.pointer, buf, dwLen, &dwBytesWritten, NULL)) { - *numBytesWritten = dwBytesWritten; - return true; - } else { - _PDCLIB_w32errno(); - return false; - } -} -static bool seekf( _PDCLIB_fd_t self, int_fast64_t offset, int whence, - int_fast64_t* newPos ) -{ - LARGE_INTEGER liOffset; - liOffset.QuadPart = offset; - if(!SetFilePointerEx( self.pointer, liOffset, &liOffset, whence )) { - _PDCLIB_w32errno(); - return false; - } - - *newPos = liOffset.QuadPart; - return true; -} - -static void closef( _PDCLIB_fd_t self ) -{ - CloseHandle( self.pointer ); -} - -const _PDCLIB_fileops_t _PDCLIB_fileops = { - .read = readf, - .write = writef, - .seek = seekf, - .close = closef, -}; - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - // Tested by stdio test cases - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_fileops + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +#ifndef REGTEST +#include +#include +#include "_PDCLIB_glue.h" +#include +#include + +#if _PDCLIB_C_MIN(2011) +_Static_assert(SEEK_SET == FILE_BEGIN, "SEEK_SET is incorrect"); +_Static_assert(SEEK_CUR == FILE_CURRENT, "SEEK_CUR is incorrect"); +_Static_assert(SEEK_END == FILE_END, "SEEK_END is incorrect"); +#endif + +void _PDCLIB_w32errno(void); + +static bool readf( _PDCLIB_fd_t self, void * buf, size_t length, + size_t * numBytesRead ) +{ + DWORD dwLen = length > INT32_MAX ? INT32_MAX : length; + DWORD dwBytesRead; + if(ReadFile(self.pointer, buf, dwLen, &dwBytesRead, NULL)) { + *numBytesRead = dwBytesRead; + return true; + } else { + _PDCLIB_w32errno(); + return false; + } +} + +static bool writef( _PDCLIB_fd_t self, const void * buf, size_t length, + size_t * numBytesWritten ) +{ + DWORD dwLen = length > INT32_MAX ? INT32_MAX : length; + DWORD dwBytesWritten; + + if(WriteFile(self.pointer, buf, dwLen, &dwBytesWritten, NULL)) { + *numBytesWritten = dwBytesWritten; + return true; + } else { + _PDCLIB_w32errno(); + return false; + } +} +static bool seekf( _PDCLIB_fd_t self, int_fast64_t offset, int whence, + int_fast64_t* newPos ) +{ + LARGE_INTEGER liOffset; + liOffset.QuadPart = offset; + if(!SetFilePointerEx( self.pointer, liOffset, &liOffset, whence )) { + _PDCLIB_w32errno(); + return false; + } + + *newPos = liOffset.QuadPart; + return true; +} + +static void closef( _PDCLIB_fd_t self ) +{ + CloseHandle( self.pointer ); +} + +const _PDCLIB_fileops_t _PDCLIB_fileops = { + .read = readf, + .write = writef, + .seek = seekf, + .close = closef, +}; + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + // Tested by stdio test cases + return TEST_RESULTS; +} + +#endif diff --git a/platform/win32/functions/_PDCLIB/_PDCLIB_freepages.c b/platform/win32/functions/_PDCLIB/_PDCLIB_freepages.c index 6779b50..4a0404a 100644 --- a/platform/win32/functions/_PDCLIB/_PDCLIB_freepages.c +++ b/platform/win32/functions/_PDCLIB/_PDCLIB_freepages.c @@ -1,30 +1,30 @@ -/* _PDCLIB_allocpages( int const ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -/* This is a stub implementation of _PDCLIB_allocpages -*/ - -#include -#include -#include -#ifndef REGTEST -#include "_PDCLIB_glue.h" - -void _PDCLIB_freepages( void * p, size_t n ) -{ - return; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_allocpages( int const ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +/* This is a stub implementation of _PDCLIB_allocpages +*/ + +#include +#include +#include +#ifndef REGTEST +#include "_PDCLIB_glue.h" + +void _PDCLIB_freepages( void * p, size_t n ) +{ + return; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/platform/win32/functions/_PDCLIB/_PDCLIB_runTlsCallbacks.c b/platform/win32/functions/_PDCLIB/_PDCLIB_runTlsCallbacks.c index 2a656a4..064fd40 100644 --- a/platform/win32/functions/_PDCLIB/_PDCLIB_runTlsCallbacks.c +++ b/platform/win32/functions/_PDCLIB/_PDCLIB_runTlsCallbacks.c @@ -1,34 +1,34 @@ -#include -#include - -#ifndef REGTEST -extern PIMAGE_TLS_CALLBACK __crt_xl_start__; -#ifdef __GNUC__ -__attribute__((section(".CRT$XLZZZ"))) -#else -__declspec(allocate(".CRT$XLZZZ")) -#endif -PIMAGE_TLS_CALLBACK __crt_xl_end__ = NULL; - -/* Runs all TLS callbacks registered in the executable - */ - -void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv); -void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv) -{ - PIMAGE_TLS_CALLBACK * pcb = &__crt_xl_start__; - - while(*pcb) (*(pcb++))(image, reason, pv); -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - +#include +#include + +#ifndef REGTEST +extern PIMAGE_TLS_CALLBACK __crt_xl_start__; +#ifdef __GNUC__ +__attribute__((section(".CRT$XLZZZ"))) +#else +__declspec(allocate(".CRT$XLZZZ")) +#endif +PIMAGE_TLS_CALLBACK __crt_xl_end__ = NULL; + +/* Runs all TLS callbacks registered in the executable + */ + +void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv); +void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv) +{ + PIMAGE_TLS_CALLBACK * pcb = &__crt_xl_start__; + + while(*pcb) (*(pcb++))(image, reason, pv); +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/_PDCLIB/_PDCLIB_w32errno.c b/platform/win32/functions/_PDCLIB/_PDCLIB_w32errno.c index 6a7bc01..8f2c802 100644 --- a/platform/win32/functions/_PDCLIB/_PDCLIB_w32errno.c +++ b/platform/win32/functions/_PDCLIB/_PDCLIB_w32errno.c @@ -1,57 +1,57 @@ -/* _PDCLIB_allocpages( int const ) - - This file is part of the Public Domain C Library (PDCLib). - Permission is granted to use, modify, and / or redistribute at will. -*/ - -/* This is a stub implementation of _PDCLIB_allocpages -*/ - -#ifndef REGTEST -#include -#include // Watcom bug: winnt.h assumes string.h defines wchar_t -#include - -void _PDCLIB_w32errno(void); - -void _PDCLIB_w32errno(void) -{ - // Not exhaustive - switch(GetLastError()) { - case ERROR_SUCCESS: - return; - case ERROR_FILE_NOT_FOUND: - case ERROR_PATH_NOT_FOUND: - case ERROR_INVALID_DRIVE: - errno = ENOENT; break; - case ERROR_TOO_MANY_OPEN_FILES: - errno = EMFILE; break; - case ERROR_ACCESS_DENIED: - case ERROR_WRITE_PROTECT: - errno = EPERM; break; - case ERROR_INVALID_HANDLE: - errno = EBADF; break; - case ERROR_NOT_ENOUGH_MEMORY: - case ERROR_OUTOFMEMORY: - errno = ENOMEM; break; - case ERROR_NOT_READY: - errno = EAGAIN; break; - case ERROR_BAD_LENGTH: - errno = EINVAL; break; - default: - // TODO: reconsider what to use here? - errno = ENOSYS; break; - } -} - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - -#endif +/* _PDCLIB_allocpages( int const ) + + This file is part of the Public Domain C Library (PDCLib). + Permission is granted to use, modify, and / or redistribute at will. +*/ + +/* This is a stub implementation of _PDCLIB_allocpages +*/ + +#ifndef REGTEST +#include +#include // Watcom bug: winnt.h assumes string.h defines wchar_t +#include + +void _PDCLIB_w32errno(void); + +void _PDCLIB_w32errno(void) +{ + // Not exhaustive + switch(GetLastError()) { + case ERROR_SUCCESS: + return; + case ERROR_FILE_NOT_FOUND: + case ERROR_PATH_NOT_FOUND: + case ERROR_INVALID_DRIVE: + errno = ENOENT; break; + case ERROR_TOO_MANY_OPEN_FILES: + errno = EMFILE; break; + case ERROR_ACCESS_DENIED: + case ERROR_WRITE_PROTECT: + errno = EPERM; break; + case ERROR_INVALID_HANDLE: + errno = EBADF; break; + case ERROR_NOT_ENOUGH_MEMORY: + case ERROR_OUTOFMEMORY: + errno = ENOMEM; break; + case ERROR_NOT_READY: + errno = EAGAIN; break; + case ERROR_BAD_LENGTH: + errno = EINVAL; break; + default: + // TODO: reconsider what to use here? + errno = ENOSYS; break; + } +} + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + +#endif diff --git a/platform/win32/functions/_PDCLIB/_tls_used.c b/platform/win32/functions/_PDCLIB/_tls_used.c index 328d77e..e13168b 100644 --- a/platform/win32/functions/_PDCLIB/_tls_used.c +++ b/platform/win32/functions/_PDCLIB/_tls_used.c @@ -1,55 +1,55 @@ -#ifndef REGTEST -#include -#include -#include - -/* Win32 TLS support - * - * Components which depend upon TLS must express a dependency on the symbol - * _tls_used. This will cause said symbol to be emitted. - * - * The linker (in the case of both Microsoft's linker and Binutils, at least) - * will point the TLS directory entry in the PE header to _tls_used. - * - * NOTE: On Windows versions < NT 6.0, the TLS support _only_ works for - * the main executable and any DLLs loaded as dependencies of it - */ - -extern char __tls_start__[], __tls_end__[]; -ULONG _tls_index = TLS_OUT_OF_INDEXES; - -extern void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv); -static PIMAGE_TLS_CALLBACK tlsCallbacks[] = { - &_PDCLIB_runTlsCallbacks, - NULL, -}; - -#ifdef __GNUC__ -__attribute__((__section__(".rdata$T"))) -#else -__declspec(allocate(".rdata$T")) -#endif -#ifdef _WIN64 -const IMAGE_TLS_DIRECTORY64 _tls_used = { -#else -const IMAGE_TLS_DIRECTORY _tls_used = { -#endif - (uintptr_t) &__tls_start__, - (uintptr_t) &__tls_end__, - (uintptr_t) &_tls_index, // TLS index - (uintptr_t) &tlsCallbacks[0], // TLS callback array - (ULONG) 0, // Size of zero fill - (ULONG) 0 // Characteristics -}; -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include +#include + +/* Win32 TLS support + * + * Components which depend upon TLS must express a dependency on the symbol + * _tls_used. This will cause said symbol to be emitted. + * + * The linker (in the case of both Microsoft's linker and Binutils, at least) + * will point the TLS directory entry in the PE header to _tls_used. + * + * NOTE: On Windows versions < NT 6.0, the TLS support _only_ works for + * the main executable and any DLLs loaded as dependencies of it + */ + +extern char __tls_start__[], __tls_end__[]; +ULONG _tls_index = TLS_OUT_OF_INDEXES; + +extern void NTAPI _PDCLIB_runTlsCallbacks(void * image, DWORD reason, PVOID pv); +static PIMAGE_TLS_CALLBACK tlsCallbacks[] = { + &_PDCLIB_runTlsCallbacks, + NULL, +}; + +#ifdef __GNUC__ +__attribute__((__section__(".rdata$T"))) +#else +__declspec(allocate(".rdata$T")) +#endif +#ifdef _WIN64 +const IMAGE_TLS_DIRECTORY64 _tls_used = { +#else +const IMAGE_TLS_DIRECTORY _tls_used = { +#endif + (uintptr_t) &__tls_start__, + (uintptr_t) &__tls_end__, + (uintptr_t) &_tls_index, // TLS index + (uintptr_t) &tlsCallbacks[0], // TLS callback array + (ULONG) 0, // Size of zero fill + (ULONG) 0 // Characteristics +}; +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/call_once.c b/platform/win32/functions/threads/call_once.c index 211b219..6996b3e 100644 --- a/platform/win32/functions/threads/call_once.c +++ b/platform/win32/functions/threads/call_once.c @@ -1,79 +1,79 @@ -#ifndef REGTEST -#include -#include - -static volatile HANDLE onceHandle = NULL; - -static void initOnceHandle( _PDCLIB_once_flag *flag ) -{ - HANDLE tOnceHandle = CreateEvent(NULL, TRUE, TRUE, NULL); - HANDLE oldVal - = InterlockedCompareExchangePointer(&flag->_Handle, tOnceHandle, NULL); - if(oldVal != NULL) - CloseHandle(tOnceHandle); -} - -void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)) -{ - if(!flag->_Handle) initOnceHandle(flag); - - long oldVal = InterlockedCompareExchange(&flag->_State, 1, -1); - for(;;) { - if(oldVal == 0) { - // Initialized - return; - } else if(oldVal == -1) { - // We are doing the initialization - func(); - if(InterlockedDecrement(&flag->_State) == 0) - CloseHandle(flag->_Handle); - SetEvent(flag->_Handle); - return; - } else { - // Somebody else is initializing - we are waiting - long newOldVal = InterlockedCompareExchange(&flag->_State, oldVal, - oldVal+1); - if(newOldVal == oldVal) { - // We incremented the "waiters" counter - if(WaitForSingleObject(flag->_Handle, INFINITE) != WAIT_OBJECT_0) - abort(); - if(InterlockedDecrement(&flag->_State) == 0) - CloseHandle(flag->_Handle); - return; - } else { - oldVal = newOldVal; - continue; - } - } - } -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#ifndef REGTEST -static int count = 0; -static once_flag once = ONCE_FLAG_INIT; - -static void do_once(void) -{ - count++; -} -#endif - -int main( void ) -{ -#ifndef REGTEST - TESTCASE(count == 0); - call_once(&once, do_once); - TESTCASE(count == 1); - call_once(&once, do_once); - TESTCASE(count == 1); - do_once(); - TESTCASE(count == 2); -#endif - return TEST_RESULTS; -} - -#endif +#ifndef REGTEST +#include +#include + +static volatile HANDLE onceHandle = NULL; + +static void initOnceHandle( _PDCLIB_once_flag *flag ) +{ + HANDLE tOnceHandle = CreateEvent(NULL, TRUE, TRUE, NULL); + HANDLE oldVal + = InterlockedCompareExchangePointer(&flag->_Handle, tOnceHandle, NULL); + if(oldVal != NULL) + CloseHandle(tOnceHandle); +} + +void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)) +{ + if(!flag->_Handle) initOnceHandle(flag); + + long oldVal = InterlockedCompareExchange(&flag->_State, 1, -1); + for(;;) { + if(oldVal == 0) { + // Initialized + return; + } else if(oldVal == -1) { + // We are doing the initialization + func(); + if(InterlockedDecrement(&flag->_State) == 0) + CloseHandle(flag->_Handle); + SetEvent(flag->_Handle); + return; + } else { + // Somebody else is initializing - we are waiting + long newOldVal = InterlockedCompareExchange(&flag->_State, oldVal, + oldVal+1); + if(newOldVal == oldVal) { + // We incremented the "waiters" counter + if(WaitForSingleObject(flag->_Handle, INFINITE) != WAIT_OBJECT_0) + abort(); + if(InterlockedDecrement(&flag->_State) == 0) + CloseHandle(flag->_Handle); + return; + } else { + oldVal = newOldVal; + continue; + } + } + } +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#ifndef REGTEST +static int count = 0; +static once_flag once = ONCE_FLAG_INIT; + +static void do_once(void) +{ + count++; +} +#endif + +int main( void ) +{ +#ifndef REGTEST + TESTCASE(count == 0); + call_once(&once, do_once); + TESTCASE(count == 1); + call_once(&once, do_once); + TESTCASE(count == 1); + do_once(); + TESTCASE(count == 2); +#endif + return TEST_RESULTS; +} + +#endif diff --git a/platform/win32/functions/threads/mtx_destroy.c b/platform/win32/functions/threads/mtx_destroy.c index ac89e11..2f8a6c3 100644 --- a/platform/win32/functions/threads/mtx_destroy.c +++ b/platform/win32/functions/threads/mtx_destroy.c @@ -1,19 +1,19 @@ -#ifndef REGTEST -#include -#include - -void mtx_destroy(mtx_t *mtx) -{ - CloseHandle(mtx->_WaitEvHandle); -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +void mtx_destroy(mtx_t *mtx) +{ + CloseHandle(mtx->_WaitEvHandle); +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/mtx_init.c b/platform/win32/functions/threads/mtx_init.c index 7205551..b97b366 100644 --- a/platform/win32/functions/threads/mtx_init.c +++ b/platform/win32/functions/threads/mtx_init.c @@ -1,29 +1,29 @@ -#ifndef REGTEST -#include -#include - -int mtx_init(mtx_t *mtx, int type) -{ - mtx->_WaitEvHandle = CreateEvent(NULL, - /* bManualReset*/ FALSE, - /* bInitialState*/ FALSE, - /* name*/ NULL); - if(mtx->_WaitEvHandle == NULL) - return thrd_error; - - mtx->_ThreadId = 0; - mtx->_NestCount = 0;; - - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +int mtx_init(mtx_t *mtx, int type) +{ + mtx->_WaitEvHandle = CreateEvent(NULL, + /* bManualReset*/ FALSE, + /* bInitialState*/ FALSE, + /* name*/ NULL); + if(mtx->_WaitEvHandle == NULL) + return thrd_error; + + mtx->_ThreadId = 0; + mtx->_NestCount = 0;; + + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/mtx_lock.c b/platform/win32/functions/threads/mtx_lock.c index b76c8ec..f2a1741 100644 --- a/platform/win32/functions/threads/mtx_lock.c +++ b/platform/win32/functions/threads/mtx_lock.c @@ -1,34 +1,34 @@ -#ifndef REGTEST -#include -#include - -int mtx_lock(mtx_t *mtx) -{ - DWORD myId = GetCurrentThreadId(); - - if(mtx->_ThreadId == (long) myId) { - mtx->_NestCount++; - return thrd_success; - } - - for(;;) { - LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); - if(prev == 0) - return thrd_success; - - DWORD rv = WaitForSingleObject(mtx->_WaitEvHandle, INFINITE); - if(rv != WAIT_OBJECT_0) - return thrd_error; - } -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +int mtx_lock(mtx_t *mtx) +{ + DWORD myId = GetCurrentThreadId(); + + if(mtx->_ThreadId == (long) myId) { + mtx->_NestCount++; + return thrd_success; + } + + for(;;) { + LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); + if(prev == 0) + return thrd_success; + + DWORD rv = WaitForSingleObject(mtx->_WaitEvHandle, INFINITE); + if(rv != WAIT_OBJECT_0) + return thrd_error; + } +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/mtx_timedlock.c b/platform/win32/functions/threads/mtx_timedlock.c index 79c96e9..a0ddb2b 100644 --- a/platform/win32/functions/threads/mtx_timedlock.c +++ b/platform/win32/functions/threads/mtx_timedlock.c @@ -1,58 +1,58 @@ -#ifndef REGTEST -#include -#include -#include - -int mtx_timedlock(mtx_t *_PDCLIB_restrict mtx, - const struct timespec *_PDCLIB_restrict until) -{ - DWORD myId = GetCurrentThreadId(); - - if(mtx->_ThreadId == (long) myId) { - mtx->_NestCount++; - return thrd_success; - } - - - for(;;) { - LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); - if(prev == 0) - return thrd_success; - - struct timespec now; - int32_t msToWait = 0; - if(timespec_get(&now, TIME_UTC) != TIME_UTC) { - // timespec_get must work! - return thrd_error; - } else { - int64_t deltaSec = (int64_t)until->tv_sec - now.tv_sec; - long deltaNsec = (long)until->tv_nsec - now.tv_nsec; - - if(INT32_MAX / 2000U < deltaSec) { - // Risk of overflow - do a shorter timeout on this iteration - msToWait = INT32_MAX / 2; - } else { - msToWait = deltaSec * 1000 + deltaNsec / 1000; - } - } - - if(msToWait < 0) { - return thrd_timeout; - } - - DWORD rv = WaitForSingleObject(mtx->_WaitEvHandle, msToWait); - if(rv != WAIT_OBJECT_0 && rv != WAIT_TIMEOUT) - return thrd_error; - } -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include +#include + +int mtx_timedlock(mtx_t *_PDCLIB_restrict mtx, + const struct timespec *_PDCLIB_restrict until) +{ + DWORD myId = GetCurrentThreadId(); + + if(mtx->_ThreadId == (long) myId) { + mtx->_NestCount++; + return thrd_success; + } + + + for(;;) { + LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); + if(prev == 0) + return thrd_success; + + struct timespec now; + int32_t msToWait = 0; + if(timespec_get(&now, TIME_UTC) != TIME_UTC) { + // timespec_get must work! + return thrd_error; + } else { + int64_t deltaSec = (int64_t)until->tv_sec - now.tv_sec; + long deltaNsec = (long)until->tv_nsec - now.tv_nsec; + + if(INT32_MAX / 2000U < deltaSec) { + // Risk of overflow - do a shorter timeout on this iteration + msToWait = INT32_MAX / 2; + } else { + msToWait = deltaSec * 1000 + deltaNsec / 1000; + } + } + + if(msToWait < 0) { + return thrd_timeout; + } + + DWORD rv = WaitForSingleObject(mtx->_WaitEvHandle, msToWait); + if(rv != WAIT_OBJECT_0 && rv != WAIT_TIMEOUT) + return thrd_error; + } +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/mtx_trylock.c b/platform/win32/functions/threads/mtx_trylock.c index 753dd6e..4308fb1 100644 --- a/platform/win32/functions/threads/mtx_trylock.c +++ b/platform/win32/functions/threads/mtx_trylock.c @@ -1,33 +1,33 @@ -#ifndef REGTEST -#include -#include - -int mtx_trylock(mtx_t *mtx) -{ - DWORD myId = GetCurrentThreadId(); - - if(mtx->_ThreadId == (long) myId) { - mtx->_NestCount++; - return thrd_success; - } - - if(mtx->_ThreadId != 0) - return thrd_busy; - - LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); - if(prev == 0) - return thrd_success; - else - return thrd_busy; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +int mtx_trylock(mtx_t *mtx) +{ + DWORD myId = GetCurrentThreadId(); + + if(mtx->_ThreadId == (long) myId) { + mtx->_NestCount++; + return thrd_success; + } + + if(mtx->_ThreadId != 0) + return thrd_busy; + + LONG prev = InterlockedCompareExchange(&mtx->_ThreadId, myId, 0); + if(prev == 0) + return thrd_success; + else + return thrd_busy; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/mtx_unlock.c b/platform/win32/functions/threads/mtx_unlock.c index bd1e603..dcbdc78 100644 --- a/platform/win32/functions/threads/mtx_unlock.c +++ b/platform/win32/functions/threads/mtx_unlock.c @@ -1,31 +1,31 @@ -#ifndef REGTEST -#include -#include - -extern void _PDCLIB_w32errno( void ); -int mtx_unlock(mtx_t *mtx) -{ - if(mtx->_NestCount) { - mtx->_NestCount--; - return thrd_success; - } - - mtx->_ThreadId = 0; - DWORD rv = SetEvent(mtx->_WaitEvHandle); - if(rv == 0) { - _PDCLIB_w32errno(); - return thrd_error; - } - return thrd_success; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +extern void _PDCLIB_w32errno( void ); +int mtx_unlock(mtx_t *mtx) +{ + if(mtx->_NestCount) { + mtx->_NestCount--; + return thrd_success; + } + + mtx->_ThreadId = 0; + DWORD rv = SetEvent(mtx->_WaitEvHandle); + if(rv == 0) { + _PDCLIB_w32errno(); + return thrd_error; + } + return thrd_success; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/tss_create.c b/platform/win32/functions/threads/tss_create.c index a9394af..4d41e03 100644 --- a/platform/win32/functions/threads/tss_create.c +++ b/platform/win32/functions/threads/tss_create.c @@ -1,73 +1,73 @@ -#ifndef REGTEST -#include -#include -#include - -/* Pull in TLS support */ -extern char _tls_used[]; - -struct _PDCLIB_tss * _PDCLIB_tss_first = NULL; - -int tss_create( tss_t *key, tss_dtor_t dtor ) -{ - *key = malloc( sizeof *key ); - if( !*key ) { - return thrd_nomem; - } - - (*key)->_Key = TlsAlloc(); - if((*key)->_Key == TLS_OUT_OF_INDEXES) { - return thrd_error; - } - (*key)->_Destructor = dtor; - (*key)->_Next = _PDCLIB_tss_first; - - // TODO: make this atomic (& validate no other TLS blocks have been - // simultaneously allocated) - _PDCLIB_tss_first = *key; - - return thrd_success; -} - -static void NTAPI runTlsDestructors( void * image, DWORD reason, PVOID pv ) -{ - if( reason == DLL_THREAD_DETACH ) { - for(unsigned i = 0; i < TSS_DTOR_ITERATIONS; i++) { - struct _PDCLIB_tss * tss = _PDCLIB_tss_first; - bool destructorsRan = false; - while( tss ) { - void * val = TlsGetValue( tss->_Key ); - if( val ) { - TlsSetValue( tss->_Key, NULL ); - if( tss->_Destructor ) { - tss->_Destructor( val ); - destructorsRan = true; - } - } - - tss = tss->_Next; - } - if(!destructorsRan) break; - } - } -} - -#ifdef __GNUC__ -__attribute__((__section__(".CRT$XLC"))) -#else -__declspec(allocate(".CRT$XLC")) -#endif -PIMAGE_TLS_CALLBACK _PDCLIB_runTlsDestructors = runTlsDestructors; - -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include +#include + +/* Pull in TLS support */ +extern char _tls_used[]; + +struct _PDCLIB_tss * _PDCLIB_tss_first = NULL; + +int tss_create( tss_t *key, tss_dtor_t dtor ) +{ + *key = malloc( sizeof *key ); + if( !*key ) { + return thrd_nomem; + } + + (*key)->_Key = TlsAlloc(); + if((*key)->_Key == TLS_OUT_OF_INDEXES) { + return thrd_error; + } + (*key)->_Destructor = dtor; + (*key)->_Next = _PDCLIB_tss_first; + + // TODO: make this atomic (& validate no other TLS blocks have been + // simultaneously allocated) + _PDCLIB_tss_first = *key; + + return thrd_success; +} + +static void NTAPI runTlsDestructors( void * image, DWORD reason, PVOID pv ) +{ + if( reason == DLL_THREAD_DETACH ) { + for(unsigned i = 0; i < TSS_DTOR_ITERATIONS; i++) { + struct _PDCLIB_tss * tss = _PDCLIB_tss_first; + bool destructorsRan = false; + while( tss ) { + void * val = TlsGetValue( tss->_Key ); + if( val ) { + TlsSetValue( tss->_Key, NULL ); + if( tss->_Destructor ) { + tss->_Destructor( val ); + destructorsRan = true; + } + } + + tss = tss->_Next; + } + if(!destructorsRan) break; + } + } +} + +#ifdef __GNUC__ +__attribute__((__section__(".CRT$XLC"))) +#else +__declspec(allocate(".CRT$XLC")) +#endif +PIMAGE_TLS_CALLBACK _PDCLIB_runTlsDestructors = runTlsDestructors; + +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/tss_delete.c b/platform/win32/functions/threads/tss_delete.c index 90be920..ce841d5 100644 --- a/platform/win32/functions/threads/tss_delete.c +++ b/platform/win32/functions/threads/tss_delete.c @@ -1,39 +1,39 @@ -#ifndef REGTEST -#include -#include -#include - -extern struct _PDCLIB_tss * _PDCLIB_tss_first; -void tss_delete( tss_t key ) -{ - struct _PDCLIB_tss * prev = NULL; - struct _PDCLIB_tss * cur = _PDCLIB_tss_first; - while(cur) { - if(cur == key) { - if(prev) { - prev->_Next = key->_Next; - } else { - _PDCLIB_tss_first = key->_Next; - } - - TlsFree(key->_Key); - free(key); - return; - } - } - - // Not actually a TSS key - abort(); -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include +#include + +extern struct _PDCLIB_tss * _PDCLIB_tss_first; +void tss_delete( tss_t key ) +{ + struct _PDCLIB_tss * prev = NULL; + struct _PDCLIB_tss * cur = _PDCLIB_tss_first; + while(cur) { + if(cur == key) { + if(prev) { + prev->_Next = key->_Next; + } else { + _PDCLIB_tss_first = key->_Next; + } + + TlsFree(key->_Key); + free(key); + return; + } + } + + // Not actually a TSS key + abort(); +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/tss_get.c b/platform/win32/functions/threads/tss_get.c index acb7c62..a5e5efb 100644 --- a/platform/win32/functions/threads/tss_get.c +++ b/platform/win32/functions/threads/tss_get.c @@ -1,33 +1,33 @@ -#ifndef REGTEST -#include -#include - -void *tss_get(tss_t key) -{ - return TlsGetValue(key->_Key); -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -#ifndef REGTEST -static tss_t key; -static char v; -#endif - -// Todo: make a thread and test destruction! - -int main( void ) -{ -#ifndef REGTEST - TESTCASE(tss_create(&key, NULL) == thrd_success); - TESTCASE(tss_get(key) == NULL); - TESTCASE(tss_set(key, &v) == thrd_success); - TESTCASE(tss_get(key) == &v); - tss_delete(key); -#endif - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +void *tss_get(tss_t key) +{ + return TlsGetValue(key->_Key); +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +#ifndef REGTEST +static tss_t key; +static char v; +#endif + +// Todo: make a thread and test destruction! + +int main( void ) +{ +#ifndef REGTEST + TESTCASE(tss_create(&key, NULL) == thrd_success); + TESTCASE(tss_get(key) == NULL); + TESTCASE(tss_set(key, &v) == thrd_success); + TESTCASE(tss_get(key) == &v); + tss_delete(key); +#endif + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/functions/threads/tss_set.c b/platform/win32/functions/threads/tss_set.c index 5ed15ce..f81d274 100644 --- a/platform/win32/functions/threads/tss_set.c +++ b/platform/win32/functions/threads/tss_set.c @@ -1,22 +1,22 @@ -#ifndef REGTEST -#include -#include - -int tss_set(tss_t key, void *val) -{ - if(TlsSetValue(key->_Key, val)) - return thrd_success; - return thrd_error; -} -#endif - -#ifdef TEST -#include "_PDCLIB_test.h" - -/* Tested in tss_get.c */ -int main( void ) -{ - return TEST_RESULTS; -} - +#ifndef REGTEST +#include +#include + +int tss_set(tss_t key, void *val) +{ + if(TlsSetValue(key->_Key, val)) + return thrd_success; + return thrd_error; +} +#endif + +#ifdef TEST +#include "_PDCLIB_test.h" + +/* Tested in tss_get.c */ +int main( void ) +{ + return TEST_RESULTS; +} + #endif \ No newline at end of file diff --git a/platform/win32/internals/_PDCLIB_threadconfig.h b/platform/win32/internals/_PDCLIB_threadconfig.h index 5969a7b..097942d 100644 --- a/platform/win32/internals/_PDCLIB_threadconfig.h +++ b/platform/win32/internals/_PDCLIB_threadconfig.h @@ -1,40 +1,40 @@ -#ifndef _PDCLIB_THREADCONFIG_H -#define _PDCLIB_THREADCONFIG_H -#include "_PDCLIB_aux.h" -#include "_PDCLIB_int.h" - +#ifndef _PDCLIB_THREADCONFIG_H +#define _PDCLIB_THREADCONFIG_H +#include "_PDCLIB_aux.h" +#include "_PDCLIB_int.h" + #ifdef __cplusplus extern "C" { -#endif -#define _PDCLIB_TSS_DTOR_ITERATIONS 3 -#define _PDCLIB_ONCE_FLAG_INIT { -1, 0 } -#define _PDCLIB_ONCE_FLAG_IS_DONE( _f ) ((_f)->_State == 0) -typedef struct { - long _State; - void *_Handle; -} _PDCLIB_once_flag; - -void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)); - -//#define _PDCLIB_THRD_HAVE_MISC -//#define _PDCLIB_CND_T char -#define _PDCLIB_MTX_T struct _PDCLIB_mtx - -struct _PDCLIB_mtx { - void * _WaitEvHandle; - volatile long _ThreadId; - volatile unsigned int _NestCount; -}; - -#define _PDCLIB_TSS_T struct _PDCLIB_tss * - -struct _PDCLIB_tss { - void (*_Destructor)(void*); - struct _PDCLIB_tss * _Next; - unsigned int _Key; -}; - +#endif +#define _PDCLIB_TSS_DTOR_ITERATIONS 3 +#define _PDCLIB_ONCE_FLAG_INIT { -1, 0 } +#define _PDCLIB_ONCE_FLAG_IS_DONE( _f ) ((_f)->_State == 0) +typedef struct { + long _State; + void *_Handle; +} _PDCLIB_once_flag; + +void _PDCLIB_call_once(_PDCLIB_once_flag *flag, void (*func)(void)); + +//#define _PDCLIB_THRD_HAVE_MISC +//#define _PDCLIB_CND_T char +#define _PDCLIB_MTX_T struct _PDCLIB_mtx + +struct _PDCLIB_mtx { + void * _WaitEvHandle; + volatile long _ThreadId; + volatile unsigned int _NestCount; +}; + +#define _PDCLIB_TSS_T struct _PDCLIB_tss * + +struct _PDCLIB_tss { + void (*_Destructor)(void*); + struct _PDCLIB_tss * _Next; + unsigned int _Key; +}; + #ifdef __cplusplus } -#endif -#endif +#endif +#endif -- 2.40.0