path
stringlengths
14
112
content
stringlengths
0
6.32M
size
int64
0
6.32M
max_lines
int64
1
100k
repo_name
stringclasses
2 values
autogenerated
bool
1 class
cosmopolitan/libc/str/chomp16.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Mutates line to remove line-ending characters. * * @param line is NULL-propagating * @see getline */ char16_t *_chomp16(char16_t *line) { size_t i; if (line) { for (i = strlen16(line); i--;) { if (line[i] == '\r' || line[i] == '\n') { line[i] = '\0'; } else { break; } } } return line; }
2,212
40
jart/cosmopolitan
false
cosmopolitan/libc/str/isupper.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns nonzero if c is uppercase alpha ascii character. */ int isupper(int c) { return 'A' <= c && c <= 'Z'; }
1,985
27
jart/cosmopolitan
false
cosmopolitan/libc/str/endswith.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns true if s has suffix. * * @param s is a NUL-terminated string * @param suffix is also NUL-terminated */ bool _endswith(const char *s, const char *suffix) { size_t n, m; n = strlen(s); m = strlen(suffix); if (m > n) return false; return !memcmp(s + n - m, suffix, m); }
2,161
34
jart/cosmopolitan
false
cosmopolitan/libc/str/stpncpy.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Prepares static search buffer. * * 1. If SRC is too long, it's truncated and *not* NUL-terminated. * * 2. If SRC is too short, the remainder is zero-filled. * * Please note this function isn't designed to prevent untrustworthy * data from modifying memory without authorization. Consider trying * memccpy() for that purpose. * * @return dest + stride * @see stncpy(), memccpy() * @asyncsignalsafe */ char *stpncpy(char *dest, const char *src, size_t stride) { char *p; if ((p = memccpy(dest, src, '\0', stride))) { bzero(p, dest + stride - p); } return dest + stride; }
2,465
43
jart/cosmopolitan
false
cosmopolitan/libc/str/iswgraph.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns nonzero if c is printable and not a space. */ int iswgraph(wint_t c) { return iswprint(c) && !iswspace(c); }
1,990
27
jart/cosmopolitan
false
cosmopolitan/libc/str/explicit_bzero.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2023 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Sets memory to zero w/ accompanying non-optimizing macro. * * This is intended for security-conscious applications. * * @param p points to bytes that'll be cleared * @param n is number of bytes to clear */ void explicit_bzero(void *p, size_t n) { bzero(p, n); }
2,140
32
jart/cosmopolitan
false
cosmopolitan/libc/str/wcschr.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2023 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns pointer to first instance of character. */ wchar_t *wcschr(const wchar_t *s, wchar_t c) { for (;; ++s) { if (*s == c) return s; if (!*s) return 0; } }
2,042
30
jart/cosmopolitan
false
cosmopolitan/libc/str/eastasianwidth.txt
# EastAsianWidth-15.0.0.txt # Date: 2022-01-28, 13:07:15 GMT [KW, LI] # © 2022 Unicode®, Inc. # Unicode and the Unicode Logo are registered trademarks of Unicode, Inc. in the U.S. and other countries. # For terms of use, see https://www.unicode.org/terms_of_use.html # # Unicode Character Database # For documentation, see https://www.unicode.org/reports/tr44/ # # East_Asian_Width Property # # This file is a normative contributory data file in the # Unicode Character Database. # # The format is two fields separated by a semicolon. # Field 0: Unicode code point value or range of code point values # Field 1: East_Asian_Width property, consisting of one of the following values: # "A", "F", "H", "N", "Na", "W" # - All code points, assigned or unassigned, that are not listed # explicitly are given the value "N". # - The unassigned code points in the following blocks default to "W": # CJK Unified Ideographs Extension A: U+3400..U+4DBF # CJK Unified Ideographs: U+4E00..U+9FFF # CJK Compatibility Ideographs: U+F900..U+FAFF # - All undesignated code points in Planes 2 and 3, whether inside or # outside of allocated blocks, default to "W": # Plane 2: U+20000..U+2FFFD # Plane 3: U+30000..U+3FFFD # # Character ranges are specified as for other property files in the # Unicode Character Database. # # For legacy reasons, there are no spaces before or after the semicolon # which separates the two fields. The comments following the number sign # "#" list the General_Category property value or the L& alias of the # derived value LC, the Unicode character name or names, and, in lines # with ranges of code points, the code point count in square brackets. # # For more information, see UAX #11: East Asian Width, # at https://www.unicode.org/reports/tr11/ # # @missing: 0000..10FFFF; N 0000..001F;N # Cc [32] <control-0000>..<control-001F> 0020;Na # Zs SPACE 0021..0023;Na # Po [3] EXCLAMATION MARK..NUMBER SIGN 0024;Na # Sc DOLLAR SIGN 0025..0027;Na # Po [3] PERCENT SIGN..APOSTROPHE 0028;Na # Ps LEFT PARENTHESIS 0029;Na # Pe RIGHT PARENTHESIS 002A;Na # Po ASTERISK 002B;Na # Sm PLUS SIGN 002C;Na # Po COMMA 002D;Na # Pd HYPHEN-MINUS 002E..002F;Na # Po [2] FULL STOP..SOLIDUS 0030..0039;Na # Nd [10] DIGIT ZERO..DIGIT NINE 003A..003B;Na # Po [2] COLON..SEMICOLON 003C..003E;Na # Sm [3] LESS-THAN SIGN..GREATER-THAN SIGN 003F..0040;Na # Po [2] QUESTION MARK..COMMERCIAL AT 0041..005A;Na # Lu [26] LATIN CAPITAL LETTER A..LATIN CAPITAL LETTER Z 005B;Na # Ps LEFT SQUARE BRACKET 005C;Na # Po REVERSE SOLIDUS 005D;Na # Pe RIGHT SQUARE BRACKET 005E;Na # Sk CIRCUMFLEX ACCENT 005F;Na # Pc LOW LINE 0060;Na # Sk GRAVE ACCENT 0061..007A;Na # Ll [26] LATIN SMALL LETTER A..LATIN SMALL LETTER Z 007B;Na # Ps LEFT CURLY BRACKET 007C;Na # Sm VERTICAL LINE 007D;Na # Pe RIGHT CURLY BRACKET 007E;Na # Sm TILDE 007F;N # Cc <control-007F> 0080..009F;N # Cc [32] <control-0080>..<control-009F> 00A0;N # Zs NO-BREAK SPACE 00A1;A # Po INVERTED EXCLAMATION MARK 00A2..00A3;Na # Sc [2] CENT SIGN..POUND SIGN 00A4;A # Sc CURRENCY SIGN 00A5;Na # Sc YEN SIGN 00A6;Na # So BROKEN BAR 00A7;A # Po SECTION SIGN 00A8;A # Sk DIAERESIS 00A9;N # So COPYRIGHT SIGN 00AA;A # Lo FEMININE ORDINAL INDICATOR 00AB;N # Pi LEFT-POINTING DOUBLE ANGLE QUOTATION MARK 00AC;Na # Sm NOT SIGN 00AD;A # Cf SOFT HYPHEN 00AE;A # So REGISTERED SIGN 00AF;Na # Sk MACRON 00B0;A # So DEGREE SIGN 00B1;A # Sm PLUS-MINUS SIGN 00B2..00B3;A # No [2] SUPERSCRIPT TWO..SUPERSCRIPT THREE 00B4;A # Sk ACUTE ACCENT 00B5;N # Ll MICRO SIGN 00B6..00B7;A # Po [2] PILCROW SIGN..MIDDLE DOT 00B8;A # Sk CEDILLA 00B9;A # No SUPERSCRIPT ONE 00BA;A # Lo MASCULINE ORDINAL INDICATOR 00BB;N # Pf RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK 00BC..00BE;A # No [3] VULGAR FRACTION ONE QUARTER..VULGAR FRACTION THREE QUARTERS 00BF;A # Po INVERTED QUESTION MARK 00C0..00C5;N # Lu [6] LATIN CAPITAL LETTER A WITH GRAVE..LATIN CAPITAL LETTER A WITH RING ABOVE 00C6;A # Lu LATIN CAPITAL LETTER AE 00C7..00CF;N # Lu [9] LATIN CAPITAL LETTER C WITH CEDILLA..LATIN CAPITAL LETTER I WITH DIAERESIS 00D0;A # Lu LATIN CAPITAL LETTER ETH 00D1..00D6;N # Lu [6] LATIN CAPITAL LETTER N WITH TILDE..LATIN CAPITAL LETTER O WITH DIAERESIS 00D7;A # Sm MULTIPLICATION SIGN 00D8;A # Lu LATIN CAPITAL LETTER O WITH STROKE 00D9..00DD;N # Lu [5] LATIN CAPITAL LETTER U WITH GRAVE..LATIN CAPITAL LETTER Y WITH ACUTE 00DE..00E1;A # L& [4] LATIN CAPITAL LETTER THORN..LATIN SMALL LETTER A WITH ACUTE 00E2..00E5;N # Ll [4] LATIN SMALL LETTER A WITH CIRCUMFLEX..LATIN SMALL LETTER A WITH RING ABOVE 00E6;A # Ll LATIN SMALL LETTER AE 00E7;N # Ll LATIN SMALL LETTER C WITH CEDILLA 00E8..00EA;A # Ll [3] LATIN SMALL LETTER E WITH GRAVE..LATIN SMALL LETTER E WITH CIRCUMFLEX 00EB;N # Ll LATIN SMALL LETTER E WITH DIAERESIS 00EC..00ED;A # Ll [2] LATIN SMALL LETTER I WITH GRAVE..LATIN SMALL LETTER I WITH ACUTE 00EE..00EF;N # Ll [2] LATIN SMALL LETTER I WITH CIRCUMFLEX..LATIN SMALL LETTER I WITH DIAERESIS 00F0;A # Ll LATIN SMALL LETTER ETH 00F1;N # Ll LATIN SMALL LETTER N WITH TILDE 00F2..00F3;A # Ll [2] LATIN SMALL LETTER O WITH GRAVE..LATIN SMALL LETTER O WITH ACUTE 00F4..00F6;N # Ll [3] LATIN SMALL LETTER O WITH CIRCUMFLEX..LATIN SMALL LETTER O WITH DIAERESIS 00F7;A # Sm DIVISION SIGN 00F8..00FA;A # Ll [3] LATIN SMALL LETTER O WITH STROKE..LATIN SMALL LETTER U WITH ACUTE 00FB;N # Ll LATIN SMALL LETTER U WITH CIRCUMFLEX 00FC;A # Ll LATIN SMALL LETTER U WITH DIAERESIS 00FD;N # Ll LATIN SMALL LETTER Y WITH ACUTE 00FE;A # Ll LATIN SMALL LETTER THORN 00FF;N # Ll LATIN SMALL LETTER Y WITH DIAERESIS 0100;N # Lu LATIN CAPITAL LETTER A WITH MACRON 0101;A # Ll LATIN SMALL LETTER A WITH MACRON 0102..0110;N # L& [15] LATIN CAPITAL LETTER A WITH BREVE..LATIN CAPITAL LETTER D WITH STROKE 0111;A # Ll LATIN SMALL LETTER D WITH STROKE 0112;N # Lu LATIN CAPITAL LETTER E WITH MACRON 0113;A # Ll LATIN SMALL LETTER E WITH MACRON 0114..011A;N # L& [7] LATIN CAPITAL LETTER E WITH BREVE..LATIN CAPITAL LETTER E WITH CARON 011B;A # Ll LATIN SMALL LETTER E WITH CARON 011C..0125;N # L& [10] LATIN CAPITAL LETTER G WITH CIRCUMFLEX..LATIN SMALL LETTER H WITH CIRCUMFLEX 0126..0127;A # L& [2] LATIN CAPITAL LETTER H WITH STROKE..LATIN SMALL LETTER H WITH STROKE 0128..012A;N # L& [3] LATIN CAPITAL LETTER I WITH TILDE..LATIN CAPITAL LETTER I WITH MACRON 012B;A # Ll LATIN SMALL LETTER I WITH MACRON 012C..0130;N # L& [5] LATIN CAPITAL LETTER I WITH BREVE..LATIN CAPITAL LETTER I WITH DOT ABOVE 0131..0133;A # L& [3] LATIN SMALL LETTER DOTLESS I..LATIN SMALL LIGATURE IJ 0134..0137;N # L& [4] LATIN CAPITAL LETTER J WITH CIRCUMFLEX..LATIN SMALL LETTER K WITH CEDILLA 0138;A # Ll LATIN SMALL LETTER KRA 0139..013E;N # L& [6] LATIN CAPITAL LETTER L WITH ACUTE..LATIN SMALL LETTER L WITH CARON 013F..0142;A # L& [4] LATIN CAPITAL LETTER L WITH MIDDLE DOT..LATIN SMALL LETTER L WITH STROKE 0143;N # Lu LATIN CAPITAL LETTER N WITH ACUTE 0144;A # Ll LATIN SMALL LETTER N WITH ACUTE 0145..0147;N # L& [3] LATIN CAPITAL LETTER N WITH CEDILLA..LATIN CAPITAL LETTER N WITH CARON 0148..014B;A # L& [4] LATIN SMALL LETTER N WITH CARON..LATIN SMALL LETTER ENG 014C;N # Lu LATIN CAPITAL LETTER O WITH MACRON 014D;A # Ll LATIN SMALL LETTER O WITH MACRON 014E..0151;N # L& [4] LATIN CAPITAL LETTER O WITH BREVE..LATIN SMALL LETTER O WITH DOUBLE ACUTE 0152..0153;A # L& [2] LATIN CAPITAL LIGATURE OE..LATIN SMALL LIGATURE OE 0154..0165;N # L& [18] LATIN CAPITAL LETTER R WITH ACUTE..LATIN SMALL LETTER T WITH CARON 0166..0167;A # L& [2] LATIN CAPITAL LETTER T WITH STROKE..LATIN SMALL LETTER T WITH STROKE 0168..016A;N # L& [3] LATIN CAPITAL LETTER U WITH TILDE..LATIN CAPITAL LETTER U WITH MACRON 016B;A # Ll LATIN SMALL LETTER U WITH MACRON 016C..017F;N # L& [20] LATIN CAPITAL LETTER U WITH BREVE..LATIN SMALL LETTER LONG S 0180..01BA;N # L& [59] LATIN SMALL LETTER B WITH STROKE..LATIN SMALL LETTER EZH WITH TAIL 01BB;N # Lo LATIN LETTER TWO WITH STROKE 01BC..01BF;N # L& [4] LATIN CAPITAL LETTER TONE FIVE..LATIN LETTER WYNN 01C0..01C3;N # Lo [4] LATIN LETTER DENTAL CLICK..LATIN LETTER RETROFLEX CLICK 01C4..01CD;N # L& [10] LATIN CAPITAL LETTER DZ WITH CARON..LATIN CAPITAL LETTER A WITH CARON 01CE;A # Ll LATIN SMALL LETTER A WITH CARON 01CF;N # Lu LATIN CAPITAL LETTER I WITH CARON 01D0;A # Ll LATIN SMALL LETTER I WITH CARON 01D1;N # Lu LATIN CAPITAL LETTER O WITH CARON 01D2;A # Ll LATIN SMALL LETTER O WITH CARON 01D3;N # Lu LATIN CAPITAL LETTER U WITH CARON 01D4;A # Ll LATIN SMALL LETTER U WITH CARON 01D5;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND MACRON 01D6;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND MACRON 01D7;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND ACUTE 01D8;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND ACUTE 01D9;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND CARON 01DA;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND CARON 01DB;N # Lu LATIN CAPITAL LETTER U WITH DIAERESIS AND GRAVE 01DC;A # Ll LATIN SMALL LETTER U WITH DIAERESIS AND GRAVE 01DD..024F;N # L& [115] LATIN SMALL LETTER TURNED E..LATIN SMALL LETTER Y WITH STROKE 0250;N # Ll LATIN SMALL LETTER TURNED A 0251;A # Ll LATIN SMALL LETTER ALPHA 0252..0260;N # Ll [15] LATIN SMALL LETTER TURNED ALPHA..LATIN SMALL LETTER G WITH HOOK 0261;A # Ll LATIN SMALL LETTER SCRIPT G 0262..0293;N # Ll [50] LATIN LETTER SMALL CAPITAL G..LATIN SMALL LETTER EZH WITH CURL 0294;N # Lo LATIN LETTER GLOTTAL STOP 0295..02AF;N # Ll [27] LATIN LETTER PHARYNGEAL VOICED FRICATIVE..LATIN SMALL LETTER TURNED H WITH FISHHOOK AND TAIL 02B0..02C1;N # Lm [18] MODIFIER LETTER SMALL H..MODIFIER LETTER REVERSED GLOTTAL STOP 02C2..02C3;N # Sk [2] MODIFIER LETTER LEFT ARROWHEAD..MODIFIER LETTER RIGHT ARROWHEAD 02C4;A # Sk MODIFIER LETTER UP ARROWHEAD 02C5;N # Sk MODIFIER LETTER DOWN ARROWHEAD 02C6;N # Lm MODIFIER LETTER CIRCUMFLEX ACCENT 02C7;A # Lm CARON 02C8;N # Lm MODIFIER LETTER VERTICAL LINE 02C9..02CB;A # Lm [3] MODIFIER LETTER MACRON..MODIFIER LETTER GRAVE ACCENT 02CC;N # Lm MODIFIER LETTER LOW VERTICAL LINE 02CD;A # Lm MODIFIER LETTER LOW MACRON 02CE..02CF;N # Lm [2] MODIFIER LETTER LOW GRAVE ACCENT..MODIFIER LETTER LOW ACUTE ACCENT 02D0;A # Lm MODIFIER LETTER TRIANGULAR COLON 02D1;N # Lm MODIFIER LETTER HALF TRIANGULAR COLON 02D2..02D7;N # Sk [6] MODIFIER LETTER CENTRED RIGHT HALF RING..MODIFIER LETTER MINUS SIGN 02D8..02DB;A # Sk [4] BREVE..OGONEK 02DC;N # Sk SMALL TILDE 02DD;A # Sk DOUBLE ACUTE ACCENT 02DE;N # Sk MODIFIER LETTER RHOTIC HOOK 02DF;A # Sk MODIFIER LETTER CROSS ACCENT 02E0..02E4;N # Lm [5] MODIFIER LETTER SMALL GAMMA..MODIFIER LETTER SMALL REVERSED GLOTTAL STOP 02E5..02EB;N # Sk [7] MODIFIER LETTER EXTRA-HIGH TONE BAR..MODIFIER LETTER YANG DEPARTING TONE MARK 02EC;N # Lm MODIFIER LETTER VOICING 02ED;N # Sk MODIFIER LETTER UNASPIRATED 02EE;N # Lm MODIFIER LETTER DOUBLE APOSTROPHE 02EF..02FF;N # Sk [17] MODIFIER LETTER LOW DOWN ARROWHEAD..MODIFIER LETTER LOW LEFT ARROW 0300..036F;A # Mn [112] COMBINING GRAVE ACCENT..COMBINING LATIN SMALL LETTER X 0370..0373;N # L& [4] GREEK CAPITAL LETTER HETA..GREEK SMALL LETTER ARCHAIC SAMPI 0374;N # Lm GREEK NUMERAL SIGN 0375;N # Sk GREEK LOWER NUMERAL SIGN 0376..0377;N # L& [2] GREEK CAPITAL LETTER PAMPHYLIAN DIGAMMA..GREEK SMALL LETTER PAMPHYLIAN DIGAMMA 037A;N # Lm GREEK YPOGEGRAMMENI 037B..037D;N # Ll [3] GREEK SMALL REVERSED LUNATE SIGMA SYMBOL..GREEK SMALL REVERSED DOTTED LUNATE SIGMA SYMBOL 037E;N # Po GREEK QUESTION MARK 037F;N # Lu GREEK CAPITAL LETTER YOT 0384..0385;N # Sk [2] GREEK TONOS..GREEK DIALYTIKA TONOS 0386;N # Lu GREEK CAPITAL LETTER ALPHA WITH TONOS 0387;N # Po GREEK ANO TELEIA 0388..038A;N # Lu [3] GREEK CAPITAL LETTER EPSILON WITH TONOS..GREEK CAPITAL LETTER IOTA WITH TONOS 038C;N # Lu GREEK CAPITAL LETTER OMICRON WITH TONOS 038E..0390;N # L& [3] GREEK CAPITAL LETTER UPSILON WITH TONOS..GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS 0391..03A1;A # Lu [17] GREEK CAPITAL LETTER ALPHA..GREEK CAPITAL LETTER RHO 03A3..03A9;A # Lu [7] GREEK CAPITAL LETTER SIGMA..GREEK CAPITAL LETTER OMEGA 03AA..03B0;N # L& [7] GREEK CAPITAL LETTER IOTA WITH DIALYTIKA..GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS 03B1..03C1;A # Ll [17] GREEK SMALL LETTER ALPHA..GREEK SMALL LETTER RHO 03C2;N # Ll GREEK SMALL LETTER FINAL SIGMA 03C3..03C9;A # Ll [7] GREEK SMALL LETTER SIGMA..GREEK SMALL LETTER OMEGA 03CA..03F5;N # L& [44] GREEK SMALL LETTER IOTA WITH DIALYTIKA..GREEK LUNATE EPSILON SYMBOL 03F6;N # Sm GREEK REVERSED LUNATE EPSILON SYMBOL 03F7..03FF;N # L& [9] GREEK CAPITAL LETTER SHO..GREEK CAPITAL REVERSED DOTTED LUNATE SIGMA SYMBOL 0400;N # Lu CYRILLIC CAPITAL LETTER IE WITH GRAVE 0401;A # Lu CYRILLIC CAPITAL LETTER IO 0402..040F;N # Lu [14] CYRILLIC CAPITAL LETTER DJE..CYRILLIC CAPITAL LETTER DZHE 0410..044F;A # L& [64] CYRILLIC CAPITAL LETTER A..CYRILLIC SMALL LETTER YA 0450;N # Ll CYRILLIC SMALL LETTER IE WITH GRAVE 0451;A # Ll CYRILLIC SMALL LETTER IO 0452..0481;N # L& [48] CYRILLIC SMALL LETTER DJE..CYRILLIC SMALL LETTER KOPPA 0482;N # So CYRILLIC THOUSANDS SIGN 0483..0487;N # Mn [5] COMBINING CYRILLIC TITLO..COMBINING CYRILLIC POKRYTIE 0488..0489;N # Me [2] COMBINING CYRILLIC HUNDRED THOUSANDS SIGN..COMBINING CYRILLIC MILLIONS SIGN 048A..04FF;N # L& [118] CYRILLIC CAPITAL LETTER SHORT I WITH TAIL..CYRILLIC SMALL LETTER HA WITH STROKE 0500..052F;N # L& [48] CYRILLIC CAPITAL LETTER KOMI DE..CYRILLIC SMALL LETTER EL WITH DESCENDER 0531..0556;N # Lu [38] ARMENIAN CAPITAL LETTER AYB..ARMENIAN CAPITAL LETTER FEH 0559;N # Lm ARMENIAN MODIFIER LETTER LEFT HALF RING 055A..055F;N # Po [6] ARMENIAN APOSTROPHE..ARMENIAN ABBREVIATION MARK 0560..0588;N # Ll [41] ARMENIAN SMALL LETTER TURNED AYB..ARMENIAN SMALL LETTER YI WITH STROKE 0589;N # Po ARMENIAN FULL STOP 058A;N # Pd ARMENIAN HYPHEN 058D..058E;N # So [2] RIGHT-FACING ARMENIAN ETERNITY SIGN..LEFT-FACING ARMENIAN ETERNITY SIGN 058F;N # Sc ARMENIAN DRAM SIGN 0591..05BD;N # Mn [45] HEBREW ACCENT ETNAHTA..HEBREW POINT METEG 05BE;N # Pd HEBREW PUNCTUATION MAQAF 05BF;N # Mn HEBREW POINT RAFE 05C0;N # Po HEBREW PUNCTUATION PASEQ 05C1..05C2;N # Mn [2] HEBREW POINT SHIN DOT..HEBREW POINT SIN DOT 05C3;N # Po HEBREW PUNCTUATION SOF PASUQ 05C4..05C5;N # Mn [2] HEBREW MARK UPPER DOT..HEBREW MARK LOWER DOT 05C6;N # Po HEBREW PUNCTUATION NUN HAFUKHA 05C7;N # Mn HEBREW POINT QAMATS QATAN 05D0..05EA;N # Lo [27] HEBREW LETTER ALEF..HEBREW LETTER TAV 05EF..05F2;N # Lo [4] HEBREW YOD TRIANGLE..HEBREW LIGATURE YIDDISH DOUBLE YOD 05F3..05F4;N # Po [2] HEBREW PUNCTUATION GERESH..HEBREW PUNCTUATION GERSHAYIM 0600..0605;N # Cf [6] ARABIC NUMBER SIGN..ARABIC NUMBER MARK ABOVE 0606..0608;N # Sm [3] ARABIC-INDIC CUBE ROOT..ARABIC RAY 0609..060A;N # Po [2] ARABIC-INDIC PER MILLE SIGN..ARABIC-INDIC PER TEN THOUSAND SIGN 060B;N # Sc AFGHANI SIGN 060C..060D;N # Po [2] ARABIC COMMA..ARABIC DATE SEPARATOR 060E..060F;N # So [2] ARABIC POETIC VERSE SIGN..ARABIC SIGN MISRA 0610..061A;N # Mn [11] ARABIC SIGN SALLALLAHOU ALAYHE WASSALLAM..ARABIC SMALL KASRA 061B;N # Po ARABIC SEMICOLON 061C;N # Cf ARABIC LETTER MARK 061D..061F;N # Po [3] ARABIC END OF TEXT MARK..ARABIC QUESTION MARK 0620..063F;N # Lo [32] ARABIC LETTER KASHMIRI YEH..ARABIC LETTER FARSI YEH WITH THREE DOTS ABOVE 0640;N # Lm ARABIC TATWEEL 0641..064A;N # Lo [10] ARABIC LETTER FEH..ARABIC LETTER YEH 064B..065F;N # Mn [21] ARABIC FATHATAN..ARABIC WAVY HAMZA BELOW 0660..0669;N # Nd [10] ARABIC-INDIC DIGIT ZERO..ARABIC-INDIC DIGIT NINE 066A..066D;N # Po [4] ARABIC PERCENT SIGN..ARABIC FIVE POINTED STAR 066E..066F;N # Lo [2] ARABIC LETTER DOTLESS BEH..ARABIC LETTER DOTLESS QAF 0670;N # Mn ARABIC LETTER SUPERSCRIPT ALEF 0671..06D3;N # Lo [99] ARABIC LETTER ALEF WASLA..ARABIC LETTER YEH BARREE WITH HAMZA ABOVE 06D4;N # Po ARABIC FULL STOP 06D5;N # Lo ARABIC LETTER AE 06D6..06DC;N # Mn [7] ARABIC SMALL HIGH LIGATURE SAD WITH LAM WITH ALEF MAKSURA..ARABIC SMALL HIGH SEEN 06DD;N # Cf ARABIC END OF AYAH 06DE;N # So ARABIC START OF RUB EL HIZB 06DF..06E4;N # Mn [6] ARABIC SMALL HIGH ROUNDED ZERO..ARABIC SMALL HIGH MADDA 06E5..06E6;N # Lm [2] ARABIC SMALL WAW..ARABIC SMALL YEH 06E7..06E8;N # Mn [2] ARABIC SMALL HIGH YEH..ARABIC SMALL HIGH NOON 06E9;N # So ARABIC PLACE OF SAJDAH 06EA..06ED;N # Mn [4] ARABIC EMPTY CENTRE LOW STOP..ARABIC SMALL LOW MEEM 06EE..06EF;N # Lo [2] ARABIC LETTER DAL WITH INVERTED V..ARABIC LETTER REH WITH INVERTED V 06F0..06F9;N # Nd [10] EXTENDED ARABIC-INDIC DIGIT ZERO..EXTENDED ARABIC-INDIC DIGIT NINE 06FA..06FC;N # Lo [3] ARABIC LETTER SHEEN WITH DOT BELOW..ARABIC LETTER GHAIN WITH DOT BELOW 06FD..06FE;N # So [2] ARABIC SIGN SINDHI AMPERSAND..ARABIC SIGN SINDHI POSTPOSITION MEN 06FF;N # Lo ARABIC LETTER HEH WITH INVERTED V 0700..070D;N # Po [14] SYRIAC END OF PARAGRAPH..SYRIAC HARKLEAN ASTERISCUS 070F;N # Cf SYRIAC ABBREVIATION MARK 0710;N # Lo SYRIAC LETTER ALAPH 0711;N # Mn SYRIAC LETTER SUPERSCRIPT ALAPH 0712..072F;N # Lo [30] SYRIAC LETTER BETH..SYRIAC LETTER PERSIAN DHALATH 0730..074A;N # Mn [27] SYRIAC PTHAHA ABOVE..SYRIAC BARREKH 074D..074F;N # Lo [3] SYRIAC LETTER SOGDIAN ZHAIN..SYRIAC LETTER SOGDIAN FE 0750..077F;N # Lo [48] ARABIC LETTER BEH WITH THREE DOTS HORIZONTALLY BELOW..ARABIC LETTER KAF WITH TWO DOTS ABOVE 0780..07A5;N # Lo [38] THAANA LETTER HAA..THAANA LETTER WAAVU 07A6..07B0;N # Mn [11] THAANA ABAFILI..THAANA SUKUN 07B1;N # Lo THAANA LETTER NAA 07C0..07C9;N # Nd [10] NKO DIGIT ZERO..NKO DIGIT NINE 07CA..07EA;N # Lo [33] NKO LETTER A..NKO LETTER JONA RA 07EB..07F3;N # Mn [9] NKO COMBINING SHORT HIGH TONE..NKO COMBINING DOUBLE DOT ABOVE 07F4..07F5;N # Lm [2] NKO HIGH TONE APOSTROPHE..NKO LOW TONE APOSTROPHE 07F6;N # So NKO SYMBOL OO DENNEN 07F7..07F9;N # Po [3] NKO SYMBOL GBAKURUNEN..NKO EXCLAMATION MARK 07FA;N # Lm NKO LAJANYALAN 07FD;N # Mn NKO DANTAYALAN 07FE..07FF;N # Sc [2] NKO DOROME SIGN..NKO TAMAN SIGN 0800..0815;N # Lo [22] SAMARITAN LETTER ALAF..SAMARITAN LETTER TAAF 0816..0819;N # Mn [4] SAMARITAN MARK IN..SAMARITAN MARK DAGESH 081A;N # Lm SAMARITAN MODIFIER LETTER EPENTHETIC YUT 081B..0823;N # Mn [9] SAMARITAN MARK EPENTHETIC YUT..SAMARITAN VOWEL SIGN A 0824;N # Lm SAMARITAN MODIFIER LETTER SHORT A 0825..0827;N # Mn [3] SAMARITAN VOWEL SIGN SHORT A..SAMARITAN VOWEL SIGN U 0828;N # Lm SAMARITAN MODIFIER LETTER I 0829..082D;N # Mn [5] SAMARITAN VOWEL SIGN LONG I..SAMARITAN MARK NEQUDAA 0830..083E;N # Po [15] SAMARITAN PUNCTUATION NEQUDAA..SAMARITAN PUNCTUATION ANNAAU 0840..0858;N # Lo [25] MANDAIC LETTER HALQA..MANDAIC LETTER AIN 0859..085B;N # Mn [3] MANDAIC AFFRICATION MARK..MANDAIC GEMINATION MARK 085E;N # Po MANDAIC PUNCTUATION 0860..086A;N # Lo [11] SYRIAC LETTER MALAYALAM NGA..SYRIAC LETTER MALAYALAM SSA 0870..0887;N # Lo [24] ARABIC LETTER ALEF WITH ATTACHED FATHA..ARABIC BASELINE ROUND DOT 0888;N # Sk ARABIC RAISED ROUND DOT 0889..088E;N # Lo [6] ARABIC LETTER NOON WITH INVERTED SMALL V..ARABIC VERTICAL TAIL 0890..0891;N # Cf [2] ARABIC POUND MARK ABOVE..ARABIC PIASTRE MARK ABOVE 0898..089F;N # Mn [8] ARABIC SMALL HIGH WORD AL-JUZ..ARABIC HALF MADDA OVER MADDA 08A0..08C8;N # Lo [41] ARABIC LETTER BEH WITH SMALL V BELOW..ARABIC LETTER GRAF 08C9;N # Lm ARABIC SMALL FARSI YEH 08CA..08E1;N # Mn [24] ARABIC SMALL HIGH FARSI YEH..ARABIC SMALL HIGH SIGN SAFHA 08E2;N # Cf ARABIC DISPUTED END OF AYAH 08E3..08FF;N # Mn [29] ARABIC TURNED DAMMA BELOW..ARABIC MARK SIDEWAYS NOON GHUNNA 0900..0902;N # Mn [3] DEVANAGARI SIGN INVERTED CANDRABINDU..DEVANAGARI SIGN ANUSVARA 0903;N # Mc DEVANAGARI SIGN VISARGA 0904..0939;N # Lo [54] DEVANAGARI LETTER SHORT A..DEVANAGARI LETTER HA 093A;N # Mn DEVANAGARI VOWEL SIGN OE 093B;N # Mc DEVANAGARI VOWEL SIGN OOE 093C;N # Mn DEVANAGARI SIGN NUKTA 093D;N # Lo DEVANAGARI SIGN AVAGRAHA 093E..0940;N # Mc [3] DEVANAGARI VOWEL SIGN AA..DEVANAGARI VOWEL SIGN II 0941..0948;N # Mn [8] DEVANAGARI VOWEL SIGN U..DEVANAGARI VOWEL SIGN AI 0949..094C;N # Mc [4] DEVANAGARI VOWEL SIGN CANDRA O..DEVANAGARI VOWEL SIGN AU 094D;N # Mn DEVANAGARI SIGN VIRAMA 094E..094F;N # Mc [2] DEVANAGARI VOWEL SIGN PRISHTHAMATRA E..DEVANAGARI VOWEL SIGN AW 0950;N # Lo DEVANAGARI OM 0951..0957;N # Mn [7] DEVANAGARI STRESS SIGN UDATTA..DEVANAGARI VOWEL SIGN UUE 0958..0961;N # Lo [10] DEVANAGARI LETTER QA..DEVANAGARI LETTER VOCALIC LL 0962..0963;N # Mn [2] DEVANAGARI VOWEL SIGN VOCALIC L..DEVANAGARI VOWEL SIGN VOCALIC LL 0964..0965;N # Po [2] DEVANAGARI DANDA..DEVANAGARI DOUBLE DANDA 0966..096F;N # Nd [10] DEVANAGARI DIGIT ZERO..DEVANAGARI DIGIT NINE 0970;N # Po DEVANAGARI ABBREVIATION SIGN 0971;N # Lm DEVANAGARI SIGN HIGH SPACING DOT 0972..097F;N # Lo [14] DEVANAGARI LETTER CANDRA A..DEVANAGARI LETTER BBA 0980;N # Lo BENGALI ANJI 0981;N # Mn BENGALI SIGN CANDRABINDU 0982..0983;N # Mc [2] BENGALI SIGN ANUSVARA..BENGALI SIGN VISARGA 0985..098C;N # Lo [8] BENGALI LETTER A..BENGALI LETTER VOCALIC L 098F..0990;N # Lo [2] BENGALI LETTER E..BENGALI LETTER AI 0993..09A8;N # Lo [22] BENGALI LETTER O..BENGALI LETTER NA 09AA..09B0;N # Lo [7] BENGALI LETTER PA..BENGALI LETTER RA 09B2;N # Lo BENGALI LETTER LA 09B6..09B9;N # Lo [4] BENGALI LETTER SHA..BENGALI LETTER HA 09BC;N # Mn BENGALI SIGN NUKTA 09BD;N # Lo BENGALI SIGN AVAGRAHA 09BE..09C0;N # Mc [3] BENGALI VOWEL SIGN AA..BENGALI VOWEL SIGN II 09C1..09C4;N # Mn [4] BENGALI VOWEL SIGN U..BENGALI VOWEL SIGN VOCALIC RR 09C7..09C8;N # Mc [2] BENGALI VOWEL SIGN E..BENGALI VOWEL SIGN AI 09CB..09CC;N # Mc [2] BENGALI VOWEL SIGN O..BENGALI VOWEL SIGN AU 09CD;N # Mn BENGALI SIGN VIRAMA 09CE;N # Lo BENGALI LETTER KHANDA TA 09D7;N # Mc BENGALI AU LENGTH MARK 09DC..09DD;N # Lo [2] BENGALI LETTER RRA..BENGALI LETTER RHA 09DF..09E1;N # Lo [3] BENGALI LETTER YYA..BENGALI LETTER VOCALIC LL 09E2..09E3;N # Mn [2] BENGALI VOWEL SIGN VOCALIC L..BENGALI VOWEL SIGN VOCALIC LL 09E6..09EF;N # Nd [10] BENGALI DIGIT ZERO..BENGALI DIGIT NINE 09F0..09F1;N # Lo [2] BENGALI LETTER RA WITH MIDDLE DIAGONAL..BENGALI LETTER RA WITH LOWER DIAGONAL 09F2..09F3;N # Sc [2] BENGALI RUPEE MARK..BENGALI RUPEE SIGN 09F4..09F9;N # No [6] BENGALI CURRENCY NUMERATOR ONE..BENGALI CURRENCY DENOMINATOR SIXTEEN 09FA;N # So BENGALI ISSHAR 09FB;N # Sc BENGALI GANDA MARK 09FC;N # Lo BENGALI LETTER VEDIC ANUSVARA 09FD;N # Po BENGALI ABBREVIATION SIGN 09FE;N # Mn BENGALI SANDHI MARK 0A01..0A02;N # Mn [2] GURMUKHI SIGN ADAK BINDI..GURMUKHI SIGN BINDI 0A03;N # Mc GURMUKHI SIGN VISARGA 0A05..0A0A;N # Lo [6] GURMUKHI LETTER A..GURMUKHI LETTER UU 0A0F..0A10;N # Lo [2] GURMUKHI LETTER EE..GURMUKHI LETTER AI 0A13..0A28;N # Lo [22] GURMUKHI LETTER OO..GURMUKHI LETTER NA 0A2A..0A30;N # Lo [7] GURMUKHI LETTER PA..GURMUKHI LETTER RA 0A32..0A33;N # Lo [2] GURMUKHI LETTER LA..GURMUKHI LETTER LLA 0A35..0A36;N # Lo [2] GURMUKHI LETTER VA..GURMUKHI LETTER SHA 0A38..0A39;N # Lo [2] GURMUKHI LETTER SA..GURMUKHI LETTER HA 0A3C;N # Mn GURMUKHI SIGN NUKTA 0A3E..0A40;N # Mc [3] GURMUKHI VOWEL SIGN AA..GURMUKHI VOWEL SIGN II 0A41..0A42;N # Mn [2] GURMUKHI VOWEL SIGN U..GURMUKHI VOWEL SIGN UU 0A47..0A48;N # Mn [2] GURMUKHI VOWEL SIGN EE..GURMUKHI VOWEL SIGN AI 0A4B..0A4D;N # Mn [3] GURMUKHI VOWEL SIGN OO..GURMUKHI SIGN VIRAMA 0A51;N # Mn GURMUKHI SIGN UDAAT 0A59..0A5C;N # Lo [4] GURMUKHI LETTER KHHA..GURMUKHI LETTER RRA 0A5E;N # Lo GURMUKHI LETTER FA 0A66..0A6F;N # Nd [10] GURMUKHI DIGIT ZERO..GURMUKHI DIGIT NINE 0A70..0A71;N # Mn [2] GURMUKHI TIPPI..GURMUKHI ADDAK 0A72..0A74;N # Lo [3] GURMUKHI IRI..GURMUKHI EK ONKAR 0A75;N # Mn GURMUKHI SIGN YAKASH 0A76;N # Po GURMUKHI ABBREVIATION SIGN 0A81..0A82;N # Mn [2] GUJARATI SIGN CANDRABINDU..GUJARATI SIGN ANUSVARA 0A83;N # Mc GUJARATI SIGN VISARGA 0A85..0A8D;N # Lo [9] GUJARATI LETTER A..GUJARATI VOWEL CANDRA E 0A8F..0A91;N # Lo [3] GUJARATI LETTER E..GUJARATI VOWEL CANDRA O 0A93..0AA8;N # Lo [22] GUJARATI LETTER O..GUJARATI LETTER NA 0AAA..0AB0;N # Lo [7] GUJARATI LETTER PA..GUJARATI LETTER RA 0AB2..0AB3;N # Lo [2] GUJARATI LETTER LA..GUJARATI LETTER LLA 0AB5..0AB9;N # Lo [5] GUJARATI LETTER VA..GUJARATI LETTER HA 0ABC;N # Mn GUJARATI SIGN NUKTA 0ABD;N # Lo GUJARATI SIGN AVAGRAHA 0ABE..0AC0;N # Mc [3] GUJARATI VOWEL SIGN AA..GUJARATI VOWEL SIGN II 0AC1..0AC5;N # Mn [5] GUJARATI VOWEL SIGN U..GUJARATI VOWEL SIGN CANDRA E 0AC7..0AC8;N # Mn [2] GUJARATI VOWEL SIGN E..GUJARATI VOWEL SIGN AI 0AC9;N # Mc GUJARATI VOWEL SIGN CANDRA O 0ACB..0ACC;N # Mc [2] GUJARATI VOWEL SIGN O..GUJARATI VOWEL SIGN AU 0ACD;N # Mn GUJARATI SIGN VIRAMA 0AD0;N # Lo GUJARATI OM 0AE0..0AE1;N # Lo [2] GUJARATI LETTER VOCALIC RR..GUJARATI LETTER VOCALIC LL 0AE2..0AE3;N # Mn [2] GUJARATI VOWEL SIGN VOCALIC L..GUJARATI VOWEL SIGN VOCALIC LL 0AE6..0AEF;N # Nd [10] GUJARATI DIGIT ZERO..GUJARATI DIGIT NINE 0AF0;N # Po GUJARATI ABBREVIATION SIGN 0AF1;N # Sc GUJARATI RUPEE SIGN 0AF9;N # Lo GUJARATI LETTER ZHA 0AFA..0AFF;N # Mn [6] GUJARATI SIGN SUKUN..GUJARATI SIGN TWO-CIRCLE NUKTA ABOVE 0B01;N # Mn ORIYA SIGN CANDRABINDU 0B02..0B03;N # Mc [2] ORIYA SIGN ANUSVARA..ORIYA SIGN VISARGA 0B05..0B0C;N # Lo [8] ORIYA LETTER A..ORIYA LETTER VOCALIC L 0B0F..0B10;N # Lo [2] ORIYA LETTER E..ORIYA LETTER AI 0B13..0B28;N # Lo [22] ORIYA LETTER O..ORIYA LETTER NA 0B2A..0B30;N # Lo [7] ORIYA LETTER PA..ORIYA LETTER RA 0B32..0B33;N # Lo [2] ORIYA LETTER LA..ORIYA LETTER LLA 0B35..0B39;N # Lo [5] ORIYA LETTER VA..ORIYA LETTER HA 0B3C;N # Mn ORIYA SIGN NUKTA 0B3D;N # Lo ORIYA SIGN AVAGRAHA 0B3E;N # Mc ORIYA VOWEL SIGN AA 0B3F;N # Mn ORIYA VOWEL SIGN I 0B40;N # Mc ORIYA VOWEL SIGN II 0B41..0B44;N # Mn [4] ORIYA VOWEL SIGN U..ORIYA VOWEL SIGN VOCALIC RR 0B47..0B48;N # Mc [2] ORIYA VOWEL SIGN E..ORIYA VOWEL SIGN AI 0B4B..0B4C;N # Mc [2] ORIYA VOWEL SIGN O..ORIYA VOWEL SIGN AU 0B4D;N # Mn ORIYA SIGN VIRAMA 0B55..0B56;N # Mn [2] ORIYA SIGN OVERLINE..ORIYA AI LENGTH MARK 0B57;N # Mc ORIYA AU LENGTH MARK 0B5C..0B5D;N # Lo [2] ORIYA LETTER RRA..ORIYA LETTER RHA 0B5F..0B61;N # Lo [3] ORIYA LETTER YYA..ORIYA LETTER VOCALIC LL 0B62..0B63;N # Mn [2] ORIYA VOWEL SIGN VOCALIC L..ORIYA VOWEL SIGN VOCALIC LL 0B66..0B6F;N # Nd [10] ORIYA DIGIT ZERO..ORIYA DIGIT NINE 0B70;N # So ORIYA ISSHAR 0B71;N # Lo ORIYA LETTER WA 0B72..0B77;N # No [6] ORIYA FRACTION ONE QUARTER..ORIYA FRACTION THREE SIXTEENTHS 0B82;N # Mn TAMIL SIGN ANUSVARA 0B83;N # Lo TAMIL SIGN VISARGA 0B85..0B8A;N # Lo [6] TAMIL LETTER A..TAMIL LETTER UU 0B8E..0B90;N # Lo [3] TAMIL LETTER E..TAMIL LETTER AI 0B92..0B95;N # Lo [4] TAMIL LETTER O..TAMIL LETTER KA 0B99..0B9A;N # Lo [2] TAMIL LETTER NGA..TAMIL LETTER CA 0B9C;N # Lo TAMIL LETTER JA 0B9E..0B9F;N # Lo [2] TAMIL LETTER NYA..TAMIL LETTER TTA 0BA3..0BA4;N # Lo [2] TAMIL LETTER NNA..TAMIL LETTER TA 0BA8..0BAA;N # Lo [3] TAMIL LETTER NA..TAMIL LETTER PA 0BAE..0BB9;N # Lo [12] TAMIL LETTER MA..TAMIL LETTER HA 0BBE..0BBF;N # Mc [2] TAMIL VOWEL SIGN AA..TAMIL VOWEL SIGN I 0BC0;N # Mn TAMIL VOWEL SIGN II 0BC1..0BC2;N # Mc [2] TAMIL VOWEL SIGN U..TAMIL VOWEL SIGN UU 0BC6..0BC8;N # Mc [3] TAMIL VOWEL SIGN E..TAMIL VOWEL SIGN AI 0BCA..0BCC;N # Mc [3] TAMIL VOWEL SIGN O..TAMIL VOWEL SIGN AU 0BCD;N # Mn TAMIL SIGN VIRAMA 0BD0;N # Lo TAMIL OM 0BD7;N # Mc TAMIL AU LENGTH MARK 0BE6..0BEF;N # Nd [10] TAMIL DIGIT ZERO..TAMIL DIGIT NINE 0BF0..0BF2;N # No [3] TAMIL NUMBER TEN..TAMIL NUMBER ONE THOUSAND 0BF3..0BF8;N # So [6] TAMIL DAY SIGN..TAMIL AS ABOVE SIGN 0BF9;N # Sc TAMIL RUPEE SIGN 0BFA;N # So TAMIL NUMBER SIGN 0C00;N # Mn TELUGU SIGN COMBINING CANDRABINDU ABOVE 0C01..0C03;N # Mc [3] TELUGU SIGN CANDRABINDU..TELUGU SIGN VISARGA 0C04;N # Mn TELUGU SIGN COMBINING ANUSVARA ABOVE 0C05..0C0C;N # Lo [8] TELUGU LETTER A..TELUGU LETTER VOCALIC L 0C0E..0C10;N # Lo [3] TELUGU LETTER E..TELUGU LETTER AI 0C12..0C28;N # Lo [23] TELUGU LETTER O..TELUGU LETTER NA 0C2A..0C39;N # Lo [16] TELUGU LETTER PA..TELUGU LETTER HA 0C3C;N # Mn TELUGU SIGN NUKTA 0C3D;N # Lo TELUGU SIGN AVAGRAHA 0C3E..0C40;N # Mn [3] TELUGU VOWEL SIGN AA..TELUGU VOWEL SIGN II 0C41..0C44;N # Mc [4] TELUGU VOWEL SIGN U..TELUGU VOWEL SIGN VOCALIC RR 0C46..0C48;N # Mn [3] TELUGU VOWEL SIGN E..TELUGU VOWEL SIGN AI 0C4A..0C4D;N # Mn [4] TELUGU VOWEL SIGN O..TELUGU SIGN VIRAMA 0C55..0C56;N # Mn [2] TELUGU LENGTH MARK..TELUGU AI LENGTH MARK 0C58..0C5A;N # Lo [3] TELUGU LETTER TSA..TELUGU LETTER RRRA 0C5D;N # Lo TELUGU LETTER NAKAARA POLLU 0C60..0C61;N # Lo [2] TELUGU LETTER VOCALIC RR..TELUGU LETTER VOCALIC LL 0C62..0C63;N # Mn [2] TELUGU VOWEL SIGN VOCALIC L..TELUGU VOWEL SIGN VOCALIC LL 0C66..0C6F;N # Nd [10] TELUGU DIGIT ZERO..TELUGU DIGIT NINE 0C77;N # Po TELUGU SIGN SIDDHAM 0C78..0C7E;N # No [7] TELUGU FRACTION DIGIT ZERO FOR ODD POWERS OF FOUR..TELUGU FRACTION DIGIT THREE FOR EVEN POWERS OF FOUR 0C7F;N # So TELUGU SIGN TUUMU 0C80;N # Lo KANNADA SIGN SPACING CANDRABINDU 0C81;N # Mn KANNADA SIGN CANDRABINDU 0C82..0C83;N # Mc [2] KANNADA SIGN ANUSVARA..KANNADA SIGN VISARGA 0C84;N # Po KANNADA SIGN SIDDHAM 0C85..0C8C;N # Lo [8] KANNADA LETTER A..KANNADA LETTER VOCALIC L 0C8E..0C90;N # Lo [3] KANNADA LETTER E..KANNADA LETTER AI 0C92..0CA8;N # Lo [23] KANNADA LETTER O..KANNADA LETTER NA 0CAA..0CB3;N # Lo [10] KANNADA LETTER PA..KANNADA LETTER LLA 0CB5..0CB9;N # Lo [5] KANNADA LETTER VA..KANNADA LETTER HA 0CBC;N # Mn KANNADA SIGN NUKTA 0CBD;N # Lo KANNADA SIGN AVAGRAHA 0CBE;N # Mc KANNADA VOWEL SIGN AA 0CBF;N # Mn KANNADA VOWEL SIGN I 0CC0..0CC4;N # Mc [5] KANNADA VOWEL SIGN II..KANNADA VOWEL SIGN VOCALIC RR 0CC6;N # Mn KANNADA VOWEL SIGN E 0CC7..0CC8;N # Mc [2] KANNADA VOWEL SIGN EE..KANNADA VOWEL SIGN AI 0CCA..0CCB;N # Mc [2] KANNADA VOWEL SIGN O..KANNADA VOWEL SIGN OO 0CCC..0CCD;N # Mn [2] KANNADA VOWEL SIGN AU..KANNADA SIGN VIRAMA 0CD5..0CD6;N # Mc [2] KANNADA LENGTH MARK..KANNADA AI LENGTH MARK 0CDD..0CDE;N # Lo [2] KANNADA LETTER NAKAARA POLLU..KANNADA LETTER FA 0CE0..0CE1;N # Lo [2] KANNADA LETTER VOCALIC RR..KANNADA LETTER VOCALIC LL 0CE2..0CE3;N # Mn [2] KANNADA VOWEL SIGN VOCALIC L..KANNADA VOWEL SIGN VOCALIC LL 0CE6..0CEF;N # Nd [10] KANNADA DIGIT ZERO..KANNADA DIGIT NINE 0CF1..0CF2;N # Lo [2] KANNADA SIGN JIHVAMULIYA..KANNADA SIGN UPADHMANIYA 0CF3;N # Mc KANNADA SIGN COMBINING ANUSVARA ABOVE RIGHT 0D00..0D01;N # Mn [2] MALAYALAM SIGN COMBINING ANUSVARA ABOVE..MALAYALAM SIGN CANDRABINDU 0D02..0D03;N # Mc [2] MALAYALAM SIGN ANUSVARA..MALAYALAM SIGN VISARGA 0D04..0D0C;N # Lo [9] MALAYALAM LETTER VEDIC ANUSVARA..MALAYALAM LETTER VOCALIC L 0D0E..0D10;N # Lo [3] MALAYALAM LETTER E..MALAYALAM LETTER AI 0D12..0D3A;N # Lo [41] MALAYALAM LETTER O..MALAYALAM LETTER TTTA 0D3B..0D3C;N # Mn [2] MALAYALAM SIGN VERTICAL BAR VIRAMA..MALAYALAM SIGN CIRCULAR VIRAMA 0D3D;N # Lo MALAYALAM SIGN AVAGRAHA 0D3E..0D40;N # Mc [3] MALAYALAM VOWEL SIGN AA..MALAYALAM VOWEL SIGN II 0D41..0D44;N # Mn [4] MALAYALAM VOWEL SIGN U..MALAYALAM VOWEL SIGN VOCALIC RR 0D46..0D48;N # Mc [3] MALAYALAM VOWEL SIGN E..MALAYALAM VOWEL SIGN AI 0D4A..0D4C;N # Mc [3] MALAYALAM VOWEL SIGN O..MALAYALAM VOWEL SIGN AU 0D4D;N # Mn MALAYALAM SIGN VIRAMA 0D4E;N # Lo MALAYALAM LETTER DOT REPH 0D4F;N # So MALAYALAM SIGN PARA 0D54..0D56;N # Lo [3] MALAYALAM LETTER CHILLU M..MALAYALAM LETTER CHILLU LLL 0D57;N # Mc MALAYALAM AU LENGTH MARK 0D58..0D5E;N # No [7] MALAYALAM FRACTION ONE ONE-HUNDRED-AND-SIXTIETH..MALAYALAM FRACTION ONE FIFTH 0D5F..0D61;N # Lo [3] MALAYALAM LETTER ARCHAIC II..MALAYALAM LETTER VOCALIC LL 0D62..0D63;N # Mn [2] MALAYALAM VOWEL SIGN VOCALIC L..MALAYALAM VOWEL SIGN VOCALIC LL 0D66..0D6F;N # Nd [10] MALAYALAM DIGIT ZERO..MALAYALAM DIGIT NINE 0D70..0D78;N # No [9] MALAYALAM NUMBER TEN..MALAYALAM FRACTION THREE SIXTEENTHS 0D79;N # So MALAYALAM DATE MARK 0D7A..0D7F;N # Lo [6] MALAYALAM LETTER CHILLU NN..MALAYALAM LETTER CHILLU K 0D81;N # Mn SINHALA SIGN CANDRABINDU 0D82..0D83;N # Mc [2] SINHALA SIGN ANUSVARAYA..SINHALA SIGN VISARGAYA 0D85..0D96;N # Lo [18] SINHALA LETTER AYANNA..SINHALA LETTER AUYANNA 0D9A..0DB1;N # Lo [24] SINHALA LETTER ALPAPRAANA KAYANNA..SINHALA LETTER DANTAJA NAYANNA 0DB3..0DBB;N # Lo [9] SINHALA LETTER SANYAKA DAYANNA..SINHALA LETTER RAYANNA 0DBD;N # Lo SINHALA LETTER DANTAJA LAYANNA 0DC0..0DC6;N # Lo [7] SINHALA LETTER VAYANNA..SINHALA LETTER FAYANNA 0DCA;N # Mn SINHALA SIGN AL-LAKUNA 0DCF..0DD1;N # Mc [3] SINHALA VOWEL SIGN AELA-PILLA..SINHALA VOWEL SIGN DIGA AEDA-PILLA 0DD2..0DD4;N # Mn [3] SINHALA VOWEL SIGN KETTI IS-PILLA..SINHALA VOWEL SIGN KETTI PAA-PILLA 0DD6;N # Mn SINHALA VOWEL SIGN DIGA PAA-PILLA 0DD8..0DDF;N # Mc [8] SINHALA VOWEL SIGN GAETTA-PILLA..SINHALA VOWEL SIGN GAYANUKITTA 0DE6..0DEF;N # Nd [10] SINHALA LITH DIGIT ZERO..SINHALA LITH DIGIT NINE 0DF2..0DF3;N # Mc [2] SINHALA VOWEL SIGN DIGA GAETTA-PILLA..SINHALA VOWEL SIGN DIGA GAYANUKITTA 0DF4;N # Po SINHALA PUNCTUATION KUNDDALIYA 0E01..0E30;N # Lo [48] THAI CHARACTER KO KAI..THAI CHARACTER SARA A 0E31;N # Mn THAI CHARACTER MAI HAN-AKAT 0E32..0E33;N # Lo [2] THAI CHARACTER SARA AA..THAI CHARACTER SARA AM 0E34..0E3A;N # Mn [7] THAI CHARACTER SARA I..THAI CHARACTER PHINTHU 0E3F;N # Sc THAI CURRENCY SYMBOL BAHT 0E40..0E45;N # Lo [6] THAI CHARACTER SARA E..THAI CHARACTER LAKKHANGYAO 0E46;N # Lm THAI CHARACTER MAIYAMOK 0E47..0E4E;N # Mn [8] THAI CHARACTER MAITAIKHU..THAI CHARACTER YAMAKKAN 0E4F;N # Po THAI CHARACTER FONGMAN 0E50..0E59;N # Nd [10] THAI DIGIT ZERO..THAI DIGIT NINE 0E5A..0E5B;N # Po [2] THAI CHARACTER ANGKHANKHU..THAI CHARACTER KHOMUT 0E81..0E82;N # Lo [2] LAO LETTER KO..LAO LETTER KHO SUNG 0E84;N # Lo LAO LETTER KHO TAM 0E86..0E8A;N # Lo [5] LAO LETTER PALI GHA..LAO LETTER SO TAM 0E8C..0EA3;N # Lo [24] LAO LETTER PALI JHA..LAO LETTER LO LING 0EA5;N # Lo LAO LETTER LO LOOT 0EA7..0EB0;N # Lo [10] LAO LETTER WO..LAO VOWEL SIGN A 0EB1;N # Mn LAO VOWEL SIGN MAI KAN 0EB2..0EB3;N # Lo [2] LAO VOWEL SIGN AA..LAO VOWEL SIGN AM 0EB4..0EBC;N # Mn [9] LAO VOWEL SIGN I..LAO SEMIVOWEL SIGN LO 0EBD;N # Lo LAO SEMIVOWEL SIGN NYO 0EC0..0EC4;N # Lo [5] LAO VOWEL SIGN E..LAO VOWEL SIGN AI 0EC6;N # Lm LAO KO LA 0EC8..0ECE;N # Mn [7] LAO TONE MAI EK..LAO YAMAKKAN 0ED0..0ED9;N # Nd [10] LAO DIGIT ZERO..LAO DIGIT NINE 0EDC..0EDF;N # Lo [4] LAO HO NO..LAO LETTER KHMU NYO 0F00;N # Lo TIBETAN SYLLABLE OM 0F01..0F03;N # So [3] TIBETAN MARK GTER YIG MGO TRUNCATED A..TIBETAN MARK GTER YIG MGO -UM GTER TSHEG MA 0F04..0F12;N # Po [15] TIBETAN MARK INITIAL YIG MGO MDUN MA..TIBETAN MARK RGYA GRAM SHAD 0F13;N # So TIBETAN MARK CARET -DZUD RTAGS ME LONG CAN 0F14;N # Po TIBETAN MARK GTER TSHEG 0F15..0F17;N # So [3] TIBETAN LOGOTYPE SIGN CHAD RTAGS..TIBETAN ASTROLOGICAL SIGN SGRA GCAN -CHAR RTAGS 0F18..0F19;N # Mn [2] TIBETAN ASTROLOGICAL SIGN -KHYUD PA..TIBETAN ASTROLOGICAL SIGN SDONG TSHUGS 0F1A..0F1F;N # So [6] TIBETAN SIGN RDEL DKAR GCIG..TIBETAN SIGN RDEL DKAR RDEL NAG 0F20..0F29;N # Nd [10] TIBETAN DIGIT ZERO..TIBETAN DIGIT NINE 0F2A..0F33;N # No [10] TIBETAN DIGIT HALF ONE..TIBETAN DIGIT HALF ZERO 0F34;N # So TIBETAN MARK BSDUS RTAGS 0F35;N # Mn TIBETAN MARK NGAS BZUNG NYI ZLA 0F36;N # So TIBETAN MARK CARET -DZUD RTAGS BZHI MIG CAN 0F37;N # Mn TIBETAN MARK NGAS BZUNG SGOR RTAGS 0F38;N # So TIBETAN MARK CHE MGO 0F39;N # Mn TIBETAN MARK TSA -PHRU 0F3A;N # Ps TIBETAN MARK GUG RTAGS GYON 0F3B;N # Pe TIBETAN MARK GUG RTAGS GYAS 0F3C;N # Ps TIBETAN MARK ANG KHANG GYON 0F3D;N # Pe TIBETAN MARK ANG KHANG GYAS 0F3E..0F3F;N # Mc [2] TIBETAN SIGN YAR TSHES..TIBETAN SIGN MAR TSHES 0F40..0F47;N # Lo [8] TIBETAN LETTER KA..TIBETAN LETTER JA 0F49..0F6C;N # Lo [36] TIBETAN LETTER NYA..TIBETAN LETTER RRA 0F71..0F7E;N # Mn [14] TIBETAN VOWEL SIGN AA..TIBETAN SIGN RJES SU NGA RO 0F7F;N # Mc TIBETAN SIGN RNAM BCAD 0F80..0F84;N # Mn [5] TIBETAN VOWEL SIGN REVERSED I..TIBETAN MARK HALANTA 0F85;N # Po TIBETAN MARK PALUTA 0F86..0F87;N # Mn [2] TIBETAN SIGN LCI RTAGS..TIBETAN SIGN YANG RTAGS 0F88..0F8C;N # Lo [5] TIBETAN SIGN LCE TSA CAN..TIBETAN SIGN INVERTED MCHU CAN 0F8D..0F97;N # Mn [11] TIBETAN SUBJOINED SIGN LCE TSA CAN..TIBETAN SUBJOINED LETTER JA 0F99..0FBC;N # Mn [36] TIBETAN SUBJOINED LETTER NYA..TIBETAN SUBJOINED LETTER FIXED-FORM RA 0FBE..0FC5;N # So [8] TIBETAN KU RU KHA..TIBETAN SYMBOL RDO RJE 0FC6;N # Mn TIBETAN SYMBOL PADMA GDAN 0FC7..0FCC;N # So [6] TIBETAN SYMBOL RDO RJE RGYA GRAM..TIBETAN SYMBOL NOR BU BZHI -KHYIL 0FCE..0FCF;N # So [2] TIBETAN SIGN RDEL NAG RDEL DKAR..TIBETAN SIGN RDEL NAG GSUM 0FD0..0FD4;N # Po [5] TIBETAN MARK BSKA- SHOG GI MGO RGYAN..TIBETAN MARK CLOSING BRDA RNYING YIG MGO SGAB MA 0FD5..0FD8;N # So [4] RIGHT-FACING SVASTI SIGN..LEFT-FACING SVASTI SIGN WITH DOTS 0FD9..0FDA;N # Po [2] TIBETAN MARK LEADING MCHAN RTAGS..TIBETAN MARK TRAILING MCHAN RTAGS 1000..102A;N # Lo [43] MYANMAR LETTER KA..MYANMAR LETTER AU 102B..102C;N # Mc [2] MYANMAR VOWEL SIGN TALL AA..MYANMAR VOWEL SIGN AA 102D..1030;N # Mn [4] MYANMAR VOWEL SIGN I..MYANMAR VOWEL SIGN UU 1031;N # Mc MYANMAR VOWEL SIGN E 1032..1037;N # Mn [6] MYANMAR VOWEL SIGN AI..MYANMAR SIGN DOT BELOW 1038;N # Mc MYANMAR SIGN VISARGA 1039..103A;N # Mn [2] MYANMAR SIGN VIRAMA..MYANMAR SIGN ASAT 103B..103C;N # Mc [2] MYANMAR CONSONANT SIGN MEDIAL YA..MYANMAR CONSONANT SIGN MEDIAL RA 103D..103E;N # Mn [2] MYANMAR CONSONANT SIGN MEDIAL WA..MYANMAR CONSONANT SIGN MEDIAL HA 103F;N # Lo MYANMAR LETTER GREAT SA 1040..1049;N # Nd [10] MYANMAR DIGIT ZERO..MYANMAR DIGIT NINE 104A..104F;N # Po [6] MYANMAR SIGN LITTLE SECTION..MYANMAR SYMBOL GENITIVE 1050..1055;N # Lo [6] MYANMAR LETTER SHA..MYANMAR LETTER VOCALIC LL 1056..1057;N # Mc [2] MYANMAR VOWEL SIGN VOCALIC R..MYANMAR VOWEL SIGN VOCALIC RR 1058..1059;N # Mn [2] MYANMAR VOWEL SIGN VOCALIC L..MYANMAR VOWEL SIGN VOCALIC LL 105A..105D;N # Lo [4] MYANMAR LETTER MON NGA..MYANMAR LETTER MON BBE 105E..1060;N # Mn [3] MYANMAR CONSONANT SIGN MON MEDIAL NA..MYANMAR CONSONANT SIGN MON MEDIAL LA 1061;N # Lo MYANMAR LETTER SGAW KAREN SHA 1062..1064;N # Mc [3] MYANMAR VOWEL SIGN SGAW KAREN EU..MYANMAR TONE MARK SGAW KAREN KE PHO 1065..1066;N # Lo [2] MYANMAR LETTER WESTERN PWO KAREN THA..MYANMAR LETTER WESTERN PWO KAREN PWA 1067..106D;N # Mc [7] MYANMAR VOWEL SIGN WESTERN PWO KAREN EU..MYANMAR SIGN WESTERN PWO KAREN TONE-5 106E..1070;N # Lo [3] MYANMAR LETTER EASTERN PWO KAREN NNA..MYANMAR LETTER EASTERN PWO KAREN GHWA 1071..1074;N # Mn [4] MYANMAR VOWEL SIGN GEBA KAREN I..MYANMAR VOWEL SIGN KAYAH EE 1075..1081;N # Lo [13] MYANMAR LETTER SHAN KA..MYANMAR LETTER SHAN HA 1082;N # Mn MYANMAR CONSONANT SIGN SHAN MEDIAL WA 1083..1084;N # Mc [2] MYANMAR VOWEL SIGN SHAN AA..MYANMAR VOWEL SIGN SHAN E 1085..1086;N # Mn [2] MYANMAR VOWEL SIGN SHAN E ABOVE..MYANMAR VOWEL SIGN SHAN FINAL Y 1087..108C;N # Mc [6] MYANMAR SIGN SHAN TONE-2..MYANMAR SIGN SHAN COUNCIL TONE-3 108D;N # Mn MYANMAR SIGN SHAN COUNCIL EMPHATIC TONE 108E;N # Lo MYANMAR LETTER RUMAI PALAUNG FA 108F;N # Mc MYANMAR SIGN RUMAI PALAUNG TONE-5 1090..1099;N # Nd [10] MYANMAR SHAN DIGIT ZERO..MYANMAR SHAN DIGIT NINE 109A..109C;N # Mc [3] MYANMAR SIGN KHAMTI TONE-1..MYANMAR VOWEL SIGN AITON A 109D;N # Mn MYANMAR VOWEL SIGN AITON AI 109E..109F;N # So [2] MYANMAR SYMBOL SHAN ONE..MYANMAR SYMBOL SHAN EXCLAMATION 10A0..10C5;N # Lu [38] GEORGIAN CAPITAL LETTER AN..GEORGIAN CAPITAL LETTER HOE 10C7;N # Lu GEORGIAN CAPITAL LETTER YN 10CD;N # Lu GEORGIAN CAPITAL LETTER AEN 10D0..10FA;N # Ll [43] GEORGIAN LETTER AN..GEORGIAN LETTER AIN 10FB;N # Po GEORGIAN PARAGRAPH SEPARATOR 10FC;N # Lm MODIFIER LETTER GEORGIAN NAR 10FD..10FF;N # Ll [3] GEORGIAN LETTER AEN..GEORGIAN LETTER LABIAL SIGN 1100..115F;W # Lo [96] HANGUL CHOSEONG KIYEOK..HANGUL CHOSEONG FILLER 1160..11FF;N # Lo [160] HANGUL JUNGSEONG FILLER..HANGUL JONGSEONG SSANGNIEUN 1200..1248;N # Lo [73] ETHIOPIC SYLLABLE HA..ETHIOPIC SYLLABLE QWA 124A..124D;N # Lo [4] ETHIOPIC SYLLABLE QWI..ETHIOPIC SYLLABLE QWE 1250..1256;N # Lo [7] ETHIOPIC SYLLABLE QHA..ETHIOPIC SYLLABLE QHO 1258;N # Lo ETHIOPIC SYLLABLE QHWA 125A..125D;N # Lo [4] ETHIOPIC SYLLABLE QHWI..ETHIOPIC SYLLABLE QHWE 1260..1288;N # Lo [41] ETHIOPIC SYLLABLE BA..ETHIOPIC SYLLABLE XWA 128A..128D;N # Lo [4] ETHIOPIC SYLLABLE XWI..ETHIOPIC SYLLABLE XWE 1290..12B0;N # Lo [33] ETHIOPIC SYLLABLE NA..ETHIOPIC SYLLABLE KWA 12B2..12B5;N # Lo [4] ETHIOPIC SYLLABLE KWI..ETHIOPIC SYLLABLE KWE 12B8..12BE;N # Lo [7] ETHIOPIC SYLLABLE KXA..ETHIOPIC SYLLABLE KXO 12C0;N # Lo ETHIOPIC SYLLABLE KXWA 12C2..12C5;N # Lo [4] ETHIOPIC SYLLABLE KXWI..ETHIOPIC SYLLABLE KXWE 12C8..12D6;N # Lo [15] ETHIOPIC SYLLABLE WA..ETHIOPIC SYLLABLE PHARYNGEAL O 12D8..1310;N # Lo [57] ETHIOPIC SYLLABLE ZA..ETHIOPIC SYLLABLE GWA 1312..1315;N # Lo [4] ETHIOPIC SYLLABLE GWI..ETHIOPIC SYLLABLE GWE 1318..135A;N # Lo [67] ETHIOPIC SYLLABLE GGA..ETHIOPIC SYLLABLE FYA 135D..135F;N # Mn [3] ETHIOPIC COMBINING GEMINATION AND VOWEL LENGTH MARK..ETHIOPIC COMBINING GEMINATION MARK 1360..1368;N # Po [9] ETHIOPIC SECTION MARK..ETHIOPIC PARAGRAPH SEPARATOR 1369..137C;N # No [20] ETHIOPIC DIGIT ONE..ETHIOPIC NUMBER TEN THOUSAND 1380..138F;N # Lo [16] ETHIOPIC SYLLABLE SEBATBEIT MWA..ETHIOPIC SYLLABLE PWE 1390..1399;N # So [10] ETHIOPIC TONAL MARK YIZET..ETHIOPIC TONAL MARK KURT 13A0..13F5;N # Lu [86] CHEROKEE LETTER A..CHEROKEE LETTER MV 13F8..13FD;N # Ll [6] CHEROKEE SMALL LETTER YE..CHEROKEE SMALL LETTER MV 1400;N # Pd CANADIAN SYLLABICS HYPHEN 1401..166C;N # Lo [620] CANADIAN SYLLABICS E..CANADIAN SYLLABICS CARRIER TTSA 166D;N # So CANADIAN SYLLABICS CHI SIGN 166E;N # Po CANADIAN SYLLABICS FULL STOP 166F..167F;N # Lo [17] CANADIAN SYLLABICS QAI..CANADIAN SYLLABICS BLACKFOOT W 1680;N # Zs OGHAM SPACE MARK 1681..169A;N # Lo [26] OGHAM LETTER BEITH..OGHAM LETTER PEITH 169B;N # Ps OGHAM FEATHER MARK 169C;N # Pe OGHAM REVERSED FEATHER MARK 16A0..16EA;N # Lo [75] RUNIC LETTER FEHU FEOH FE F..RUNIC LETTER X 16EB..16ED;N # Po [3] RUNIC SINGLE PUNCTUATION..RUNIC CROSS PUNCTUATION 16EE..16F0;N # Nl [3] RUNIC ARLAUG SYMBOL..RUNIC BELGTHOR SYMBOL 16F1..16F8;N # Lo [8] RUNIC LETTER K..RUNIC LETTER FRANKS CASKET AESC 1700..1711;N # Lo [18] TAGALOG LETTER A..TAGALOG LETTER HA 1712..1714;N # Mn [3] TAGALOG VOWEL SIGN I..TAGALOG SIGN VIRAMA 1715;N # Mc TAGALOG SIGN PAMUDPOD 171F;N # Lo TAGALOG LETTER ARCHAIC RA 1720..1731;N # Lo [18] HANUNOO LETTER A..HANUNOO LETTER HA 1732..1733;N # Mn [2] HANUNOO VOWEL SIGN I..HANUNOO VOWEL SIGN U 1734;N # Mc HANUNOO SIGN PAMUDPOD 1735..1736;N # Po [2] PHILIPPINE SINGLE PUNCTUATION..PHILIPPINE DOUBLE PUNCTUATION 1740..1751;N # Lo [18] BUHID LETTER A..BUHID LETTER HA 1752..1753;N # Mn [2] BUHID VOWEL SIGN I..BUHID VOWEL SIGN U 1760..176C;N # Lo [13] TAGBANWA LETTER A..TAGBANWA LETTER YA 176E..1770;N # Lo [3] TAGBANWA LETTER LA..TAGBANWA LETTER SA 1772..1773;N # Mn [2] TAGBANWA VOWEL SIGN I..TAGBANWA VOWEL SIGN U 1780..17B3;N # Lo [52] KHMER LETTER KA..KHMER INDEPENDENT VOWEL QAU 17B4..17B5;N # Mn [2] KHMER VOWEL INHERENT AQ..KHMER VOWEL INHERENT AA 17B6;N # Mc KHMER VOWEL SIGN AA 17B7..17BD;N # Mn [7] KHMER VOWEL SIGN I..KHMER VOWEL SIGN UA 17BE..17C5;N # Mc [8] KHMER VOWEL SIGN OE..KHMER VOWEL SIGN AU 17C6;N # Mn KHMER SIGN NIKAHIT 17C7..17C8;N # Mc [2] KHMER SIGN REAHMUK..KHMER SIGN YUUKALEAPINTU 17C9..17D3;N # Mn [11] KHMER SIGN MUUSIKATOAN..KHMER SIGN BATHAMASAT 17D4..17D6;N # Po [3] KHMER SIGN KHAN..KHMER SIGN CAMNUC PII KUUH 17D7;N # Lm KHMER SIGN LEK TOO 17D8..17DA;N # Po [3] KHMER SIGN BEYYAL..KHMER SIGN KOOMUUT 17DB;N # Sc KHMER CURRENCY SYMBOL RIEL 17DC;N # Lo KHMER SIGN AVAKRAHASANYA 17DD;N # Mn KHMER SIGN ATTHACAN 17E0..17E9;N # Nd [10] KHMER DIGIT ZERO..KHMER DIGIT NINE 17F0..17F9;N # No [10] KHMER SYMBOL LEK ATTAK SON..KHMER SYMBOL LEK ATTAK PRAM-BUON 1800..1805;N # Po [6] MONGOLIAN BIRGA..MONGOLIAN FOUR DOTS 1806;N # Pd MONGOLIAN TODO SOFT HYPHEN 1807..180A;N # Po [4] MONGOLIAN SIBE SYLLABLE BOUNDARY MARKER..MONGOLIAN NIRUGU 180B..180D;N # Mn [3] MONGOLIAN FREE VARIATION SELECTOR ONE..MONGOLIAN FREE VARIATION SELECTOR THREE 180E;N # Cf MONGOLIAN VOWEL SEPARATOR 180F;N # Mn MONGOLIAN FREE VARIATION SELECTOR FOUR 1810..1819;N # Nd [10] MONGOLIAN DIGIT ZERO..MONGOLIAN DIGIT NINE 1820..1842;N # Lo [35] MONGOLIAN LETTER A..MONGOLIAN LETTER CHI 1843;N # Lm MONGOLIAN LETTER TODO LONG VOWEL SIGN 1844..1878;N # Lo [53] MONGOLIAN LETTER TODO E..MONGOLIAN LETTER CHA WITH TWO DOTS 1880..1884;N # Lo [5] MONGOLIAN LETTER ALI GALI ANUSVARA ONE..MONGOLIAN LETTER ALI GALI INVERTED UBADAMA 1885..1886;N # Mn [2] MONGOLIAN LETTER ALI GALI BALUDA..MONGOLIAN LETTER ALI GALI THREE BALUDA 1887..18A8;N # Lo [34] MONGOLIAN LETTER ALI GALI A..MONGOLIAN LETTER MANCHU ALI GALI BHA 18A9;N # Mn MONGOLIAN LETTER ALI GALI DAGALGA 18AA;N # Lo MONGOLIAN LETTER MANCHU ALI GALI LHA 18B0..18F5;N # Lo [70] CANADIAN SYLLABICS OY..CANADIAN SYLLABICS CARRIER DENTAL S 1900..191E;N # Lo [31] LIMBU VOWEL-CARRIER LETTER..LIMBU LETTER TRA 1920..1922;N # Mn [3] LIMBU VOWEL SIGN A..LIMBU VOWEL SIGN U 1923..1926;N # Mc [4] LIMBU VOWEL SIGN EE..LIMBU VOWEL SIGN AU 1927..1928;N # Mn [2] LIMBU VOWEL SIGN E..LIMBU VOWEL SIGN O 1929..192B;N # Mc [3] LIMBU SUBJOINED LETTER YA..LIMBU SUBJOINED LETTER WA 1930..1931;N # Mc [2] LIMBU SMALL LETTER KA..LIMBU SMALL LETTER NGA 1932;N # Mn LIMBU SMALL LETTER ANUSVARA 1933..1938;N # Mc [6] LIMBU SMALL LETTER TA..LIMBU SMALL LETTER LA 1939..193B;N # Mn [3] LIMBU SIGN MUKPHRENG..LIMBU SIGN SA-I 1940;N # So LIMBU SIGN LOO 1944..1945;N # Po [2] LIMBU EXCLAMATION MARK..LIMBU QUESTION MARK 1946..194F;N # Nd [10] LIMBU DIGIT ZERO..LIMBU DIGIT NINE 1950..196D;N # Lo [30] TAI LE LETTER KA..TAI LE LETTER AI 1970..1974;N # Lo [5] TAI LE LETTER TONE-2..TAI LE LETTER TONE-6 1980..19AB;N # Lo [44] NEW TAI LUE LETTER HIGH QA..NEW TAI LUE LETTER LOW SUA 19B0..19C9;N # Lo [26] NEW TAI LUE VOWEL SIGN VOWEL SHORTENER..NEW TAI LUE TONE MARK-2 19D0..19D9;N # Nd [10] NEW TAI LUE DIGIT ZERO..NEW TAI LUE DIGIT NINE 19DA;N # No NEW TAI LUE THAM DIGIT ONE 19DE..19DF;N # So [2] NEW TAI LUE SIGN LAE..NEW TAI LUE SIGN LAEV 19E0..19FF;N # So [32] KHMER SYMBOL PATHAMASAT..KHMER SYMBOL DAP-PRAM ROC 1A00..1A16;N # Lo [23] BUGINESE LETTER KA..BUGINESE LETTER HA 1A17..1A18;N # Mn [2] BUGINESE VOWEL SIGN I..BUGINESE VOWEL SIGN U 1A19..1A1A;N # Mc [2] BUGINESE VOWEL SIGN E..BUGINESE VOWEL SIGN O 1A1B;N # Mn BUGINESE VOWEL SIGN AE 1A1E..1A1F;N # Po [2] BUGINESE PALLAWA..BUGINESE END OF SECTION 1A20..1A54;N # Lo [53] TAI THAM LETTER HIGH KA..TAI THAM LETTER GREAT SA 1A55;N # Mc TAI THAM CONSONANT SIGN MEDIAL RA 1A56;N # Mn TAI THAM CONSONANT SIGN MEDIAL LA 1A57;N # Mc TAI THAM CONSONANT SIGN LA TANG LAI 1A58..1A5E;N # Mn [7] TAI THAM SIGN MAI KANG LAI..TAI THAM CONSONANT SIGN SA 1A60;N # Mn TAI THAM SIGN SAKOT 1A61;N # Mc TAI THAM VOWEL SIGN A 1A62;N # Mn TAI THAM VOWEL SIGN MAI SAT 1A63..1A64;N # Mc [2] TAI THAM VOWEL SIGN AA..TAI THAM VOWEL SIGN TALL AA 1A65..1A6C;N # Mn [8] TAI THAM VOWEL SIGN I..TAI THAM VOWEL SIGN OA BELOW 1A6D..1A72;N # Mc [6] TAI THAM VOWEL SIGN OY..TAI THAM VOWEL SIGN THAM AI 1A73..1A7C;N # Mn [10] TAI THAM VOWEL SIGN OA ABOVE..TAI THAM SIGN KHUEN-LUE KARAN 1A7F;N # Mn TAI THAM COMBINING CRYPTOGRAMMIC DOT 1A80..1A89;N # Nd [10] TAI THAM HORA DIGIT ZERO..TAI THAM HORA DIGIT NINE 1A90..1A99;N # Nd [10] TAI THAM THAM DIGIT ZERO..TAI THAM THAM DIGIT NINE 1AA0..1AA6;N # Po [7] TAI THAM SIGN WIANG..TAI THAM SIGN REVERSED ROTATED RANA 1AA7;N # Lm TAI THAM SIGN MAI YAMOK 1AA8..1AAD;N # Po [6] TAI THAM SIGN KAAN..TAI THAM SIGN CAANG 1AB0..1ABD;N # Mn [14] COMBINING DOUBLED CIRCUMFLEX ACCENT..COMBINING PARENTHESES BELOW 1ABE;N # Me COMBINING PARENTHESES OVERLAY 1ABF..1ACE;N # Mn [16] COMBINING LATIN SMALL LETTER W BELOW..COMBINING LATIN SMALL LETTER INSULAR T 1B00..1B03;N # Mn [4] BALINESE SIGN ULU RICEM..BALINESE SIGN SURANG 1B04;N # Mc BALINESE SIGN BISAH 1B05..1B33;N # Lo [47] BALINESE LETTER AKARA..BALINESE LETTER HA 1B34;N # Mn BALINESE SIGN REREKAN 1B35;N # Mc BALINESE VOWEL SIGN TEDUNG 1B36..1B3A;N # Mn [5] BALINESE VOWEL SIGN ULU..BALINESE VOWEL SIGN RA REPA 1B3B;N # Mc BALINESE VOWEL SIGN RA REPA TEDUNG 1B3C;N # Mn BALINESE VOWEL SIGN LA LENGA 1B3D..1B41;N # Mc [5] BALINESE VOWEL SIGN LA LENGA TEDUNG..BALINESE VOWEL SIGN TALING REPA TEDUNG 1B42;N # Mn BALINESE VOWEL SIGN PEPET 1B43..1B44;N # Mc [2] BALINESE VOWEL SIGN PEPET TEDUNG..BALINESE ADEG ADEG 1B45..1B4C;N # Lo [8] BALINESE LETTER KAF SASAK..BALINESE LETTER ARCHAIC JNYA 1B50..1B59;N # Nd [10] BALINESE DIGIT ZERO..BALINESE DIGIT NINE 1B5A..1B60;N # Po [7] BALINESE PANTI..BALINESE PAMENENG 1B61..1B6A;N # So [10] BALINESE MUSICAL SYMBOL DONG..BALINESE MUSICAL SYMBOL DANG GEDE 1B6B..1B73;N # Mn [9] BALINESE MUSICAL SYMBOL COMBINING TEGEH..BALINESE MUSICAL SYMBOL COMBINING GONG 1B74..1B7C;N # So [9] BALINESE MUSICAL SYMBOL RIGHT-HAND OPEN DUG..BALINESE MUSICAL SYMBOL LEFT-HAND OPEN PING 1B7D..1B7E;N # Po [2] BALINESE PANTI LANTANG..BALINESE PAMADA LANTANG 1B80..1B81;N # Mn [2] SUNDANESE SIGN PANYECEK..SUNDANESE SIGN PANGLAYAR 1B82;N # Mc SUNDANESE SIGN PANGWISAD 1B83..1BA0;N # Lo [30] SUNDANESE LETTER A..SUNDANESE LETTER HA 1BA1;N # Mc SUNDANESE CONSONANT SIGN PAMINGKAL 1BA2..1BA5;N # Mn [4] SUNDANESE CONSONANT SIGN PANYAKRA..SUNDANESE VOWEL SIGN PANYUKU 1BA6..1BA7;N # Mc [2] SUNDANESE VOWEL SIGN PANAELAENG..SUNDANESE VOWEL SIGN PANOLONG 1BA8..1BA9;N # Mn [2] SUNDANESE VOWEL SIGN PAMEPET..SUNDANESE VOWEL SIGN PANEULEUNG 1BAA;N # Mc SUNDANESE SIGN PAMAAEH 1BAB..1BAD;N # Mn [3] SUNDANESE SIGN VIRAMA..SUNDANESE CONSONANT SIGN PASANGAN WA 1BAE..1BAF;N # Lo [2] SUNDANESE LETTER KHA..SUNDANESE LETTER SYA 1BB0..1BB9;N # Nd [10] SUNDANESE DIGIT ZERO..SUNDANESE DIGIT NINE 1BBA..1BBF;N # Lo [6] SUNDANESE AVAGRAHA..SUNDANESE LETTER FINAL M 1BC0..1BE5;N # Lo [38] BATAK LETTER A..BATAK LETTER U 1BE6;N # Mn BATAK SIGN TOMPI 1BE7;N # Mc BATAK VOWEL SIGN E 1BE8..1BE9;N # Mn [2] BATAK VOWEL SIGN PAKPAK E..BATAK VOWEL SIGN EE 1BEA..1BEC;N # Mc [3] BATAK VOWEL SIGN I..BATAK VOWEL SIGN O 1BED;N # Mn BATAK VOWEL SIGN KARO O 1BEE;N # Mc BATAK VOWEL SIGN U 1BEF..1BF1;N # Mn [3] BATAK VOWEL SIGN U FOR SIMALUNGUN SA..BATAK CONSONANT SIGN H 1BF2..1BF3;N # Mc [2] BATAK PANGOLAT..BATAK PANONGONAN 1BFC..1BFF;N # Po [4] BATAK SYMBOL BINDU NA METEK..BATAK SYMBOL BINDU PANGOLAT 1C00..1C23;N # Lo [36] LEPCHA LETTER KA..LEPCHA LETTER A 1C24..1C2B;N # Mc [8] LEPCHA SUBJOINED LETTER YA..LEPCHA VOWEL SIGN UU 1C2C..1C33;N # Mn [8] LEPCHA VOWEL SIGN E..LEPCHA CONSONANT SIGN T 1C34..1C35;N # Mc [2] LEPCHA CONSONANT SIGN NYIN-DO..LEPCHA CONSONANT SIGN KANG 1C36..1C37;N # Mn [2] LEPCHA SIGN RAN..LEPCHA SIGN NUKTA 1C3B..1C3F;N # Po [5] LEPCHA PUNCTUATION TA-ROL..LEPCHA PUNCTUATION TSHOOK 1C40..1C49;N # Nd [10] LEPCHA DIGIT ZERO..LEPCHA DIGIT NINE 1C4D..1C4F;N # Lo [3] LEPCHA LETTER TTA..LEPCHA LETTER DDA 1C50..1C59;N # Nd [10] OL CHIKI DIGIT ZERO..OL CHIKI DIGIT NINE 1C5A..1C77;N # Lo [30] OL CHIKI LETTER LA..OL CHIKI LETTER OH 1C78..1C7D;N # Lm [6] OL CHIKI MU TTUDDAG..OL CHIKI AHAD 1C7E..1C7F;N # Po [2] OL CHIKI PUNCTUATION MUCAAD..OL CHIKI PUNCTUATION DOUBLE MUCAAD 1C80..1C88;N # Ll [9] CYRILLIC SMALL LETTER ROUNDED VE..CYRILLIC SMALL LETTER UNBLENDED UK 1C90..1CBA;N # Lu [43] GEORGIAN MTAVRULI CAPITAL LETTER AN..GEORGIAN MTAVRULI CAPITAL LETTER AIN 1CBD..1CBF;N # Lu [3] GEORGIAN MTAVRULI CAPITAL LETTER AEN..GEORGIAN MTAVRULI CAPITAL LETTER LABIAL SIGN 1CC0..1CC7;N # Po [8] SUNDANESE PUNCTUATION BINDU SURYA..SUNDANESE PUNCTUATION BINDU BA SATANGA 1CD0..1CD2;N # Mn [3] VEDIC TONE KARSHANA..VEDIC TONE PRENKHA 1CD3;N # Po VEDIC SIGN NIHSHVASA 1CD4..1CE0;N # Mn [13] VEDIC SIGN YAJURVEDIC MIDLINE SVARITA..VEDIC TONE RIGVEDIC KASHMIRI INDEPENDENT SVARITA 1CE1;N # Mc VEDIC TONE ATHARVAVEDIC INDEPENDENT SVARITA 1CE2..1CE8;N # Mn [7] VEDIC SIGN VISARGA SVARITA..VEDIC SIGN VISARGA ANUDATTA WITH TAIL 1CE9..1CEC;N # Lo [4] VEDIC SIGN ANUSVARA ANTARGOMUKHA..VEDIC SIGN ANUSVARA VAMAGOMUKHA WITH TAIL 1CED;N # Mn VEDIC SIGN TIRYAK 1CEE..1CF3;N # Lo [6] VEDIC SIGN HEXIFORM LONG ANUSVARA..VEDIC SIGN ROTATED ARDHAVISARGA 1CF4;N # Mn VEDIC TONE CANDRA ABOVE 1CF5..1CF6;N # Lo [2] VEDIC SIGN JIHVAMULIYA..VEDIC SIGN UPADHMANIYA 1CF7;N # Mc VEDIC SIGN ATIKRAMA 1CF8..1CF9;N # Mn [2] VEDIC TONE RING ABOVE..VEDIC TONE DOUBLE RING ABOVE 1CFA;N # Lo VEDIC SIGN DOUBLE ANUSVARA ANTARGOMUKHA 1D00..1D2B;N # Ll [44] LATIN LETTER SMALL CAPITAL A..CYRILLIC LETTER SMALL CAPITAL EL 1D2C..1D6A;N # Lm [63] MODIFIER LETTER CAPITAL A..GREEK SUBSCRIPT SMALL LETTER CHI 1D6B..1D77;N # Ll [13] LATIN SMALL LETTER UE..LATIN SMALL LETTER TURNED G 1D78;N # Lm MODIFIER LETTER CYRILLIC EN 1D79..1D7F;N # Ll [7] LATIN SMALL LETTER INSULAR G..LATIN SMALL LETTER UPSILON WITH STROKE 1D80..1D9A;N # Ll [27] LATIN SMALL LETTER B WITH PALATAL HOOK..LATIN SMALL LETTER EZH WITH RETROFLEX HOOK 1D9B..1DBF;N # Lm [37] MODIFIER LETTER SMALL TURNED ALPHA..MODIFIER LETTER SMALL THETA 1DC0..1DFF;N # Mn [64] COMBINING DOTTED GRAVE ACCENT..COMBINING RIGHT ARROWHEAD AND DOWN ARROWHEAD BELOW 1E00..1EFF;N # L& [256] LATIN CAPITAL LETTER A WITH RING BELOW..LATIN SMALL LETTER Y WITH LOOP 1F00..1F15;N # L& [22] GREEK SMALL LETTER ALPHA WITH PSILI..GREEK SMALL LETTER EPSILON WITH DASIA AND OXIA 1F18..1F1D;N # Lu [6] GREEK CAPITAL LETTER EPSILON WITH PSILI..GREEK CAPITAL LETTER EPSILON WITH DASIA AND OXIA 1F20..1F45;N # L& [38] GREEK SMALL LETTER ETA WITH PSILI..GREEK SMALL LETTER OMICRON WITH DASIA AND OXIA 1F48..1F4D;N # Lu [6] GREEK CAPITAL LETTER OMICRON WITH PSILI..GREEK CAPITAL LETTER OMICRON WITH DASIA AND OXIA 1F50..1F57;N # Ll [8] GREEK SMALL LETTER UPSILON WITH PSILI..GREEK SMALL LETTER UPSILON WITH DASIA AND PERISPOMENI 1F59;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA 1F5B;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA AND VARIA 1F5D;N # Lu GREEK CAPITAL LETTER UPSILON WITH DASIA AND OXIA 1F5F..1F7D;N # L& [31] GREEK CAPITAL LETTER UPSILON WITH DASIA AND PERISPOMENI..GREEK SMALL LETTER OMEGA WITH OXIA 1F80..1FB4;N # L& [53] GREEK SMALL LETTER ALPHA WITH PSILI AND YPOGEGRAMMENI..GREEK SMALL LETTER ALPHA WITH OXIA AND YPOGEGRAMMENI 1FB6..1FBC;N # L& [7] GREEK SMALL LETTER ALPHA WITH PERISPOMENI..GREEK CAPITAL LETTER ALPHA WITH PROSGEGRAMMENI 1FBD;N # Sk GREEK KORONIS 1FBE;N # Ll GREEK PROSGEGRAMMENI 1FBF..1FC1;N # Sk [3] GREEK PSILI..GREEK DIALYTIKA AND PERISPOMENI 1FC2..1FC4;N # Ll [3] GREEK SMALL LETTER ETA WITH VARIA AND YPOGEGRAMMENI..GREEK SMALL LETTER ETA WITH OXIA AND YPOGEGRAMMENI 1FC6..1FCC;N # L& [7] GREEK SMALL LETTER ETA WITH PERISPOMENI..GREEK CAPITAL LETTER ETA WITH PROSGEGRAMMENI 1FCD..1FCF;N # Sk [3] GREEK PSILI AND VARIA..GREEK PSILI AND PERISPOMENI 1FD0..1FD3;N # Ll [4] GREEK SMALL LETTER IOTA WITH VRACHY..GREEK SMALL LETTER IOTA WITH DIALYTIKA AND OXIA 1FD6..1FDB;N # L& [6] GREEK SMALL LETTER IOTA WITH PERISPOMENI..GREEK CAPITAL LETTER IOTA WITH OXIA 1FDD..1FDF;N # Sk [3] GREEK DASIA AND VARIA..GREEK DASIA AND PERISPOMENI 1FE0..1FEC;N # L& [13] GREEK SMALL LETTER UPSILON WITH VRACHY..GREEK CAPITAL LETTER RHO WITH DASIA 1FED..1FEF;N # Sk [3] GREEK DIALYTIKA AND VARIA..GREEK VARIA 1FF2..1FF4;N # Ll [3] GREEK SMALL LETTER OMEGA WITH VARIA AND YPOGEGRAMMENI..GREEK SMALL LETTER OMEGA WITH OXIA AND YPOGEGRAMMENI 1FF6..1FFC;N # L& [7] GREEK SMALL LETTER OMEGA WITH PERISPOMENI..GREEK CAPITAL LETTER OMEGA WITH PROSGEGRAMMENI 1FFD..1FFE;N # Sk [2] GREEK OXIA..GREEK DASIA 2000..200A;N # Zs [11] EN QUAD..HAIR SPACE 200B..200F;N # Cf [5] ZERO WIDTH SPACE..RIGHT-TO-LEFT MARK 2010;A # Pd HYPHEN 2011..2012;N # Pd [2] NON-BREAKING HYPHEN..FIGURE DASH 2013..2015;A # Pd [3] EN DASH..HORIZONTAL BAR 2016;A # Po DOUBLE VERTICAL LINE 2017;N # Po DOUBLE LOW LINE 2018;A # Pi LEFT SINGLE QUOTATION MARK 2019;A # Pf RIGHT SINGLE QUOTATION MARK 201A;N # Ps SINGLE LOW-9 QUOTATION MARK 201B;N # Pi SINGLE HIGH-REVERSED-9 QUOTATION MARK 201C;A # Pi LEFT DOUBLE QUOTATION MARK 201D;A # Pf RIGHT DOUBLE QUOTATION MARK 201E;N # Ps DOUBLE LOW-9 QUOTATION MARK 201F;N # Pi DOUBLE HIGH-REVERSED-9 QUOTATION MARK 2020..2022;A # Po [3] DAGGER..BULLET 2023;N # Po TRIANGULAR BULLET 2024..2027;A # Po [4] ONE DOT LEADER..HYPHENATION POINT 2028;N # Zl LINE SEPARATOR 2029;N # Zp PARAGRAPH SEPARATOR 202A..202E;N # Cf [5] LEFT-TO-RIGHT EMBEDDING..RIGHT-TO-LEFT OVERRIDE 202F;N # Zs NARROW NO-BREAK SPACE 2030;A # Po PER MILLE SIGN 2031;N # Po PER TEN THOUSAND SIGN 2032..2033;A # Po [2] PRIME..DOUBLE PRIME 2034;N # Po TRIPLE PRIME 2035;A # Po REVERSED PRIME 2036..2038;N # Po [3] REVERSED DOUBLE PRIME..CARET 2039;N # Pi SINGLE LEFT-POINTING ANGLE QUOTATION MARK 203A;N # Pf SINGLE RIGHT-POINTING ANGLE QUOTATION MARK 203B;A # Po REFERENCE MARK 203C..203D;N # Po [2] DOUBLE EXCLAMATION MARK..INTERROBANG 203E;A # Po OVERLINE 203F..2040;N # Pc [2] UNDERTIE..CHARACTER TIE 2041..2043;N # Po [3] CARET INSERTION POINT..HYPHEN BULLET 2044;N # Sm FRACTION SLASH 2045;N # Ps LEFT SQUARE BRACKET WITH QUILL 2046;N # Pe RIGHT SQUARE BRACKET WITH QUILL 2047..2051;N # Po [11] DOUBLE QUESTION MARK..TWO ASTERISKS ALIGNED VERTICALLY 2052;N # Sm COMMERCIAL MINUS SIGN 2053;N # Po SWUNG DASH 2054;N # Pc INVERTED UNDERTIE 2055..205E;N # Po [10] FLOWER PUNCTUATION MARK..VERTICAL FOUR DOTS 205F;N # Zs MEDIUM MATHEMATICAL SPACE 2060..2064;N # Cf [5] WORD JOINER..INVISIBLE PLUS 2066..206F;N # Cf [10] LEFT-TO-RIGHT ISOLATE..NOMINAL DIGIT SHAPES 2070;N # No SUPERSCRIPT ZERO 2071;N # Lm SUPERSCRIPT LATIN SMALL LETTER I 2074;A # No SUPERSCRIPT FOUR 2075..2079;N # No [5] SUPERSCRIPT FIVE..SUPERSCRIPT NINE 207A..207C;N # Sm [3] SUPERSCRIPT PLUS SIGN..SUPERSCRIPT EQUALS SIGN 207D;N # Ps SUPERSCRIPT LEFT PARENTHESIS 207E;N # Pe SUPERSCRIPT RIGHT PARENTHESIS 207F;A # Lm SUPERSCRIPT LATIN SMALL LETTER N 2080;N # No SUBSCRIPT ZERO 2081..2084;A # No [4] SUBSCRIPT ONE..SUBSCRIPT FOUR 2085..2089;N # No [5] SUBSCRIPT FIVE..SUBSCRIPT NINE 208A..208C;N # Sm [3] SUBSCRIPT PLUS SIGN..SUBSCRIPT EQUALS SIGN 208D;N # Ps SUBSCRIPT LEFT PARENTHESIS 208E;N # Pe SUBSCRIPT RIGHT PARENTHESIS 2090..209C;N # Lm [13] LATIN SUBSCRIPT SMALL LETTER A..LATIN SUBSCRIPT SMALL LETTER T 20A0..20A8;N # Sc [9] EURO-CURRENCY SIGN..RUPEE SIGN 20A9;H # Sc WON SIGN 20AA..20AB;N # Sc [2] NEW SHEQEL SIGN..DONG SIGN 20AC;A # Sc EURO SIGN 20AD..20C0;N # Sc [20] KIP SIGN..SOM SIGN 20D0..20DC;N # Mn [13] COMBINING LEFT HARPOON ABOVE..COMBINING FOUR DOTS ABOVE 20DD..20E0;N # Me [4] COMBINING ENCLOSING CIRCLE..COMBINING ENCLOSING CIRCLE BACKSLASH 20E1;N # Mn COMBINING LEFT RIGHT ARROW ABOVE 20E2..20E4;N # Me [3] COMBINING ENCLOSING SCREEN..COMBINING ENCLOSING UPWARD POINTING TRIANGLE 20E5..20F0;N # Mn [12] COMBINING REVERSE SOLIDUS OVERLAY..COMBINING ASTERISK ABOVE 2100..2101;N # So [2] ACCOUNT OF..ADDRESSED TO THE SUBJECT 2102;N # Lu DOUBLE-STRUCK CAPITAL C 2103;A # So DEGREE CELSIUS 2104;N # So CENTRE LINE SYMBOL 2105;A # So CARE OF 2106;N # So CADA UNA 2107;N # Lu EULER CONSTANT 2108;N # So SCRUPLE 2109;A # So DEGREE FAHRENHEIT 210A..2112;N # L& [9] SCRIPT SMALL G..SCRIPT CAPITAL L 2113;A # Ll SCRIPT SMALL L 2114;N # So L B BAR SYMBOL 2115;N # Lu DOUBLE-STRUCK CAPITAL N 2116;A # So NUMERO SIGN 2117;N # So SOUND RECORDING COPYRIGHT 2118;N # Sm SCRIPT CAPITAL P 2119..211D;N # Lu [5] DOUBLE-STRUCK CAPITAL P..DOUBLE-STRUCK CAPITAL R 211E..2120;N # So [3] PRESCRIPTION TAKE..SERVICE MARK 2121..2122;A # So [2] TELEPHONE SIGN..TRADE MARK SIGN 2123;N # So VERSICLE 2124;N # Lu DOUBLE-STRUCK CAPITAL Z 2125;N # So OUNCE SIGN 2126;A # Lu OHM SIGN 2127;N # So INVERTED OHM SIGN 2128;N # Lu BLACK-LETTER CAPITAL Z 2129;N # So TURNED GREEK SMALL LETTER IOTA 212A;N # Lu KELVIN SIGN 212B;A # Lu ANGSTROM SIGN 212C..212D;N # Lu [2] SCRIPT CAPITAL B..BLACK-LETTER CAPITAL C 212E;N # So ESTIMATED SYMBOL 212F..2134;N # L& [6] SCRIPT SMALL E..SCRIPT SMALL O 2135..2138;N # Lo [4] ALEF SYMBOL..DALET SYMBOL 2139;N # Ll INFORMATION SOURCE 213A..213B;N # So [2] ROTATED CAPITAL Q..FACSIMILE SIGN 213C..213F;N # L& [4] DOUBLE-STRUCK SMALL PI..DOUBLE-STRUCK CAPITAL PI 2140..2144;N # Sm [5] DOUBLE-STRUCK N-ARY SUMMATION..TURNED SANS-SERIF CAPITAL Y 2145..2149;N # L& [5] DOUBLE-STRUCK ITALIC CAPITAL D..DOUBLE-STRUCK ITALIC SMALL J 214A;N # So PROPERTY LINE 214B;N # Sm TURNED AMPERSAND 214C..214D;N # So [2] PER SIGN..AKTIESELSKAB 214E;N # Ll TURNED SMALL F 214F;N # So SYMBOL FOR SAMARITAN SOURCE 2150..2152;N # No [3] VULGAR FRACTION ONE SEVENTH..VULGAR FRACTION ONE TENTH 2153..2154;A # No [2] VULGAR FRACTION ONE THIRD..VULGAR FRACTION TWO THIRDS 2155..215A;N # No [6] VULGAR FRACTION ONE FIFTH..VULGAR FRACTION FIVE SIXTHS 215B..215E;A # No [4] VULGAR FRACTION ONE EIGHTH..VULGAR FRACTION SEVEN EIGHTHS 215F;N # No FRACTION NUMERATOR ONE 2160..216B;A # Nl [12] ROMAN NUMERAL ONE..ROMAN NUMERAL TWELVE 216C..216F;N # Nl [4] ROMAN NUMERAL FIFTY..ROMAN NUMERAL ONE THOUSAND 2170..2179;A # Nl [10] SMALL ROMAN NUMERAL ONE..SMALL ROMAN NUMERAL TEN 217A..2182;N # Nl [9] SMALL ROMAN NUMERAL ELEVEN..ROMAN NUMERAL TEN THOUSAND 2183..2184;N # L& [2] ROMAN NUMERAL REVERSED ONE HUNDRED..LATIN SMALL LETTER REVERSED C 2185..2188;N # Nl [4] ROMAN NUMERAL SIX LATE FORM..ROMAN NUMERAL ONE HUNDRED THOUSAND 2189;A # No VULGAR FRACTION ZERO THIRDS 218A..218B;N # So [2] TURNED DIGIT TWO..TURNED DIGIT THREE 2190..2194;A # Sm [5] LEFTWARDS ARROW..LEFT RIGHT ARROW 2195..2199;A # So [5] UP DOWN ARROW..SOUTH WEST ARROW 219A..219B;N # Sm [2] LEFTWARDS ARROW WITH STROKE..RIGHTWARDS ARROW WITH STROKE 219C..219F;N # So [4] LEFTWARDS WAVE ARROW..UPWARDS TWO HEADED ARROW 21A0;N # Sm RIGHTWARDS TWO HEADED ARROW 21A1..21A2;N # So [2] DOWNWARDS TWO HEADED ARROW..LEFTWARDS ARROW WITH TAIL 21A3;N # Sm RIGHTWARDS ARROW WITH TAIL 21A4..21A5;N # So [2] LEFTWARDS ARROW FROM BAR..UPWARDS ARROW FROM BAR 21A6;N # Sm RIGHTWARDS ARROW FROM BAR 21A7..21AD;N # So [7] DOWNWARDS ARROW FROM BAR..LEFT RIGHT WAVE ARROW 21AE;N # Sm LEFT RIGHT ARROW WITH STROKE 21AF..21B7;N # So [9] DOWNWARDS ZIGZAG ARROW..CLOCKWISE TOP SEMICIRCLE ARROW 21B8..21B9;A # So [2] NORTH WEST ARROW TO LONG BAR..LEFTWARDS ARROW TO BAR OVER RIGHTWARDS ARROW TO BAR 21BA..21CD;N # So [20] ANTICLOCKWISE OPEN CIRCLE ARROW..LEFTWARDS DOUBLE ARROW WITH STROKE 21CE..21CF;N # Sm [2] LEFT RIGHT DOUBLE ARROW WITH STROKE..RIGHTWARDS DOUBLE ARROW WITH STROKE 21D0..21D1;N # So [2] LEFTWARDS DOUBLE ARROW..UPWARDS DOUBLE ARROW 21D2;A # Sm RIGHTWARDS DOUBLE ARROW 21D3;N # So DOWNWARDS DOUBLE ARROW 21D4;A # Sm LEFT RIGHT DOUBLE ARROW 21D5..21E6;N # So [18] UP DOWN DOUBLE ARROW..LEFTWARDS WHITE ARROW 21E7;A # So UPWARDS WHITE ARROW 21E8..21F3;N # So [12] RIGHTWARDS WHITE ARROW..UP DOWN WHITE ARROW 21F4..21FF;N # Sm [12] RIGHT ARROW WITH SMALL CIRCLE..LEFT RIGHT OPEN-HEADED ARROW 2200;A # Sm FOR ALL 2201;N # Sm COMPLEMENT 2202..2203;A # Sm [2] PARTIAL DIFFERENTIAL..THERE EXISTS 2204..2206;N # Sm [3] THERE DOES NOT EXIST..INCREMENT 2207..2208;A # Sm [2] NABLA..ELEMENT OF 2209..220A;N # Sm [2] NOT AN ELEMENT OF..SMALL ELEMENT OF 220B;A # Sm CONTAINS AS MEMBER 220C..220E;N # Sm [3] DOES NOT CONTAIN AS MEMBER..END OF PROOF 220F;A # Sm N-ARY PRODUCT 2210;N # Sm N-ARY COPRODUCT 2211;A # Sm N-ARY SUMMATION 2212..2214;N # Sm [3] MINUS SIGN..DOT PLUS 2215;A # Sm DIVISION SLASH 2216..2219;N # Sm [4] SET MINUS..BULLET OPERATOR 221A;A # Sm SQUARE ROOT 221B..221C;N # Sm [2] CUBE ROOT..FOURTH ROOT 221D..2220;A # Sm [4] PROPORTIONAL TO..ANGLE 2221..2222;N # Sm [2] MEASURED ANGLE..SPHERICAL ANGLE 2223;A # Sm DIVIDES 2224;N # Sm DOES NOT DIVIDE 2225;A # Sm PARALLEL TO 2226;N # Sm NOT PARALLEL TO 2227..222C;A # Sm [6] LOGICAL AND..DOUBLE INTEGRAL 222D;N # Sm TRIPLE INTEGRAL 222E;A # Sm CONTOUR INTEGRAL 222F..2233;N # Sm [5] SURFACE INTEGRAL..ANTICLOCKWISE CONTOUR INTEGRAL 2234..2237;A # Sm [4] THEREFORE..PROPORTION 2238..223B;N # Sm [4] DOT MINUS..HOMOTHETIC 223C..223D;A # Sm [2] TILDE OPERATOR..REVERSED TILDE 223E..2247;N # Sm [10] INVERTED LAZY S..NEITHER APPROXIMATELY NOR ACTUALLY EQUAL TO 2248;A # Sm ALMOST EQUAL TO 2249..224B;N # Sm [3] NOT ALMOST EQUAL TO..TRIPLE TILDE 224C;A # Sm ALL EQUAL TO 224D..2251;N # Sm [5] EQUIVALENT TO..GEOMETRICALLY EQUAL TO 2252;A # Sm APPROXIMATELY EQUAL TO OR THE IMAGE OF 2253..225F;N # Sm [13] IMAGE OF OR APPROXIMATELY EQUAL TO..QUESTIONED EQUAL TO 2260..2261;A # Sm [2] NOT EQUAL TO..IDENTICAL TO 2262..2263;N # Sm [2] NOT IDENTICAL TO..STRICTLY EQUIVALENT TO 2264..2267;A # Sm [4] LESS-THAN OR EQUAL TO..GREATER-THAN OVER EQUAL TO 2268..2269;N # Sm [2] LESS-THAN BUT NOT EQUAL TO..GREATER-THAN BUT NOT EQUAL TO 226A..226B;A # Sm [2] MUCH LESS-THAN..MUCH GREATER-THAN 226C..226D;N # Sm [2] BETWEEN..NOT EQUIVALENT TO 226E..226F;A # Sm [2] NOT LESS-THAN..NOT GREATER-THAN 2270..2281;N # Sm [18] NEITHER LESS-THAN NOR EQUAL TO..DOES NOT SUCCEED 2282..2283;A # Sm [2] SUBSET OF..SUPERSET OF 2284..2285;N # Sm [2] NOT A SUBSET OF..NOT A SUPERSET OF 2286..2287;A # Sm [2] SUBSET OF OR EQUAL TO..SUPERSET OF OR EQUAL TO 2288..2294;N # Sm [13] NEITHER A SUBSET OF NOR EQUAL TO..SQUARE CUP 2295;A # Sm CIRCLED PLUS 2296..2298;N # Sm [3] CIRCLED MINUS..CIRCLED DIVISION SLASH 2299;A # Sm CIRCLED DOT OPERATOR 229A..22A4;N # Sm [11] CIRCLED RING OPERATOR..DOWN TACK 22A5;A # Sm UP TACK 22A6..22BE;N # Sm [25] ASSERTION..RIGHT ANGLE WITH ARC 22BF;A # Sm RIGHT TRIANGLE 22C0..22FF;N # Sm [64] N-ARY LOGICAL AND..Z NOTATION BAG MEMBERSHIP 2300..2307;N # So [8] DIAMETER SIGN..WAVY LINE 2308;N # Ps LEFT CEILING 2309;N # Pe RIGHT CEILING 230A;N # Ps LEFT FLOOR 230B;N # Pe RIGHT FLOOR 230C..2311;N # So [6] BOTTOM RIGHT CROP..SQUARE LOZENGE 2312;A # So ARC 2313..2319;N # So [7] SEGMENT..TURNED NOT SIGN 231A..231B;W # So [2] WATCH..HOURGLASS 231C..231F;N # So [4] TOP LEFT CORNER..BOTTOM RIGHT CORNER 2320..2321;N # Sm [2] TOP HALF INTEGRAL..BOTTOM HALF INTEGRAL 2322..2328;N # So [7] FROWN..KEYBOARD 2329;W # Ps LEFT-POINTING ANGLE BRACKET 232A;W # Pe RIGHT-POINTING ANGLE BRACKET 232B..237B;N # So [81] ERASE TO THE LEFT..NOT CHECK MARK 237C;N # Sm RIGHT ANGLE WITH DOWNWARDS ZIGZAG ARROW 237D..239A;N # So [30] SHOULDERED OPEN BOX..CLEAR SCREEN SYMBOL 239B..23B3;N # Sm [25] LEFT PARENTHESIS UPPER HOOK..SUMMATION BOTTOM 23B4..23DB;N # So [40] TOP SQUARE BRACKET..FUSE 23DC..23E1;N # Sm [6] TOP PARENTHESIS..BOTTOM TORTOISE SHELL BRACKET 23E2..23E8;N # So [7] WHITE TRAPEZIUM..DECIMAL EXPONENT SYMBOL 23E9..23EC;W # So [4] BLACK RIGHT-POINTING DOUBLE TRIANGLE..BLACK DOWN-POINTING DOUBLE TRIANGLE 23ED..23EF;N # So [3] BLACK RIGHT-POINTING DOUBLE TRIANGLE WITH VERTICAL BAR..BLACK RIGHT-POINTING TRIANGLE WITH DOUBLE VERTICAL BAR 23F0;W # So ALARM CLOCK 23F1..23F2;N # So [2] STOPWATCH..TIMER CLOCK 23F3;W # So HOURGLASS WITH FLOWING SAND 23F4..23FF;N # So [12] BLACK MEDIUM LEFT-POINTING TRIANGLE..OBSERVER EYE SYMBOL 2400..2426;N # So [39] SYMBOL FOR NULL..SYMBOL FOR SUBSTITUTE FORM TWO 2440..244A;N # So [11] OCR HOOK..OCR DOUBLE BACKSLASH 2460..249B;A # No [60] CIRCLED DIGIT ONE..NUMBER TWENTY FULL STOP 249C..24E9;A # So [78] PARENTHESIZED LATIN SMALL LETTER A..CIRCLED LATIN SMALL LETTER Z 24EA;N # No CIRCLED DIGIT ZERO 24EB..24FF;A # No [21] NEGATIVE CIRCLED NUMBER ELEVEN..NEGATIVE CIRCLED DIGIT ZERO 2500..254B;A # So [76] BOX DRAWINGS LIGHT HORIZONTAL..BOX DRAWINGS HEAVY VERTICAL AND HORIZONTAL 254C..254F;N # So [4] BOX DRAWINGS LIGHT DOUBLE DASH HORIZONTAL..BOX DRAWINGS HEAVY DOUBLE DASH VERTICAL 2550..2573;A # So [36] BOX DRAWINGS DOUBLE HORIZONTAL..BOX DRAWINGS LIGHT DIAGONAL CROSS 2574..257F;N # So [12] BOX DRAWINGS LIGHT LEFT..BOX DRAWINGS HEAVY UP AND LIGHT DOWN 2580..258F;A # So [16] UPPER HALF BLOCK..LEFT ONE EIGHTH BLOCK 2590..2591;N # So [2] RIGHT HALF BLOCK..LIGHT SHADE 2592..2595;A # So [4] MEDIUM SHADE..RIGHT ONE EIGHTH BLOCK 2596..259F;N # So [10] QUADRANT LOWER LEFT..QUADRANT UPPER RIGHT AND LOWER LEFT AND LOWER RIGHT 25A0..25A1;A # So [2] BLACK SQUARE..WHITE SQUARE 25A2;N # So WHITE SQUARE WITH ROUNDED CORNERS 25A3..25A9;A # So [7] WHITE SQUARE CONTAINING BLACK SMALL SQUARE..SQUARE WITH DIAGONAL CROSSHATCH FILL 25AA..25B1;N # So [8] BLACK SMALL SQUARE..WHITE PARALLELOGRAM 25B2..25B3;A # So [2] BLACK UP-POINTING TRIANGLE..WHITE UP-POINTING TRIANGLE 25B4..25B5;N # So [2] BLACK UP-POINTING SMALL TRIANGLE..WHITE UP-POINTING SMALL TRIANGLE 25B6;A # So BLACK RIGHT-POINTING TRIANGLE 25B7;A # Sm WHITE RIGHT-POINTING TRIANGLE 25B8..25BB;N # So [4] BLACK RIGHT-POINTING SMALL TRIANGLE..WHITE RIGHT-POINTING POINTER 25BC..25BD;A # So [2] BLACK DOWN-POINTING TRIANGLE..WHITE DOWN-POINTING TRIANGLE 25BE..25BF;N # So [2] BLACK DOWN-POINTING SMALL TRIANGLE..WHITE DOWN-POINTING SMALL TRIANGLE 25C0;A # So BLACK LEFT-POINTING TRIANGLE 25C1;A # Sm WHITE LEFT-POINTING TRIANGLE 25C2..25C5;N # So [4] BLACK LEFT-POINTING SMALL TRIANGLE..WHITE LEFT-POINTING POINTER 25C6..25C8;A # So [3] BLACK DIAMOND..WHITE DIAMOND CONTAINING BLACK SMALL DIAMOND 25C9..25CA;N # So [2] FISHEYE..LOZENGE 25CB;A # So WHITE CIRCLE 25CC..25CD;N # So [2] DOTTED CIRCLE..CIRCLE WITH VERTICAL FILL 25CE..25D1;A # So [4] BULLSEYE..CIRCLE WITH RIGHT HALF BLACK 25D2..25E1;N # So [16] CIRCLE WITH LOWER HALF BLACK..LOWER HALF CIRCLE 25E2..25E5;A # So [4] BLACK LOWER RIGHT TRIANGLE..BLACK UPPER RIGHT TRIANGLE 25E6..25EE;N # So [9] WHITE BULLET..UP-POINTING TRIANGLE WITH RIGHT HALF BLACK 25EF;A # So LARGE CIRCLE 25F0..25F7;N # So [8] WHITE SQUARE WITH UPPER LEFT QUADRANT..WHITE CIRCLE WITH UPPER RIGHT QUADRANT 25F8..25FC;N # Sm [5] UPPER LEFT TRIANGLE..BLACK MEDIUM SQUARE 25FD..25FE;W # Sm [2] WHITE MEDIUM SMALL SQUARE..BLACK MEDIUM SMALL SQUARE 25FF;N # Sm LOWER RIGHT TRIANGLE 2600..2604;N # So [5] BLACK SUN WITH RAYS..COMET 2605..2606;A # So [2] BLACK STAR..WHITE STAR 2607..2608;N # So [2] LIGHTNING..THUNDERSTORM 2609;A # So SUN 260A..260D;N # So [4] ASCENDING NODE..OPPOSITION 260E..260F;A # So [2] BLACK TELEPHONE..WHITE TELEPHONE 2610..2613;N # So [4] BALLOT BOX..SALTIRE 2614..2615;W # So [2] UMBRELLA WITH RAIN DROPS..HOT BEVERAGE 2616..261B;N # So [6] WHITE SHOGI PIECE..BLACK RIGHT POINTING INDEX 261C;A # So WHITE LEFT POINTING INDEX 261D;N # So WHITE UP POINTING INDEX 261E;A # So WHITE RIGHT POINTING INDEX 261F..263F;N # So [33] WHITE DOWN POINTING INDEX..MERCURY 2640;A # So FEMALE SIGN 2641;N # So EARTH 2642;A # So MALE SIGN 2643..2647;N # So [5] JUPITER..PLUTO 2648..2653;W # So [12] ARIES..PISCES 2654..265F;N # So [12] WHITE CHESS KING..BLACK CHESS PAWN 2660..2661;A # So [2] BLACK SPADE SUIT..WHITE HEART SUIT 2662;N # So WHITE DIAMOND SUIT 2663..2665;A # So [3] BLACK CLUB SUIT..BLACK HEART SUIT 2666;N # So BLACK DIAMOND SUIT 2667..266A;A # So [4] WHITE CLUB SUIT..EIGHTH NOTE 266B;N # So BEAMED EIGHTH NOTES 266C..266D;A # So [2] BEAMED SIXTEENTH NOTES..MUSIC FLAT SIGN 266E;N # So MUSIC NATURAL SIGN 266F;A # Sm MUSIC SHARP SIGN 2670..267E;N # So [15] WEST SYRIAC CROSS..PERMANENT PAPER SIGN 267F;W # So WHEELCHAIR SYMBOL 2680..2692;N # So [19] DIE FACE-1..HAMMER AND PICK 2693;W # So ANCHOR 2694..269D;N # So [10] CROSSED SWORDS..OUTLINED WHITE STAR 269E..269F;A # So [2] THREE LINES CONVERGING RIGHT..THREE LINES CONVERGING LEFT 26A0;N # So WARNING SIGN 26A1;W # So HIGH VOLTAGE SIGN 26A2..26A9;N # So [8] DOUBLED FEMALE SIGN..HORIZONTAL MALE WITH STROKE SIGN 26AA..26AB;W # So [2] MEDIUM WHITE CIRCLE..MEDIUM BLACK CIRCLE 26AC..26BC;N # So [17] MEDIUM SMALL WHITE CIRCLE..SESQUIQUADRATE 26BD..26BE;W # So [2] SOCCER BALL..BASEBALL 26BF;A # So SQUARED KEY 26C0..26C3;N # So [4] WHITE DRAUGHTS MAN..BLACK DRAUGHTS KING 26C4..26C5;W # So [2] SNOWMAN WITHOUT SNOW..SUN BEHIND CLOUD 26C6..26CD;A # So [8] RAIN..DISABLED CAR 26CE;W # So OPHIUCHUS 26CF..26D3;A # So [5] PICK..CHAINS 26D4;W # So NO ENTRY 26D5..26E1;A # So [13] ALTERNATE ONE-WAY LEFT WAY TRAFFIC..RESTRICTED LEFT ENTRY-2 26E2;N # So ASTRONOMICAL SYMBOL FOR URANUS 26E3;A # So HEAVY CIRCLE WITH STROKE AND TWO DOTS ABOVE 26E4..26E7;N # So [4] PENTAGRAM..INVERTED PENTAGRAM 26E8..26E9;A # So [2] BLACK CROSS ON SHIELD..SHINTO SHRINE 26EA;W # So CHURCH 26EB..26F1;A # So [7] CASTLE..UMBRELLA ON GROUND 26F2..26F3;W # So [2] FOUNTAIN..FLAG IN HOLE 26F4;A # So FERRY 26F5;W # So SAILBOAT 26F6..26F9;A # So [4] SQUARE FOUR CORNERS..PERSON WITH BALL 26FA;W # So TENT 26FB..26FC;A # So [2] JAPANESE BANK SYMBOL..HEADSTONE GRAVEYARD SYMBOL 26FD;W # So FUEL PUMP 26FE..26FF;A # So [2] CUP ON BLACK SQUARE..WHITE FLAG WITH HORIZONTAL MIDDLE BLACK STRIPE 2700..2704;N # So [5] BLACK SAFETY SCISSORS..WHITE SCISSORS 2705;W # So WHITE HEAVY CHECK MARK 2706..2709;N # So [4] TELEPHONE LOCATION SIGN..ENVELOPE 270A..270B;W # So [2] RAISED FIST..RAISED HAND 270C..2727;N # So [28] VICTORY HAND..WHITE FOUR POINTED STAR 2728;W # So SPARKLES 2729..273C;N # So [20] STRESS OUTLINED WHITE STAR..OPEN CENTRE TEARDROP-SPOKED ASTERISK 273D;A # So HEAVY TEARDROP-SPOKED ASTERISK 273E..274B;N # So [14] SIX PETALLED BLACK AND WHITE FLORETTE..HEAVY EIGHT TEARDROP-SPOKED PROPELLER ASTERISK 274C;W # So CROSS MARK 274D;N # So SHADOWED WHITE CIRCLE 274E;W # So NEGATIVE SQUARED CROSS MARK 274F..2752;N # So [4] LOWER RIGHT DROP-SHADOWED WHITE SQUARE..UPPER RIGHT SHADOWED WHITE SQUARE 2753..2755;W # So [3] BLACK QUESTION MARK ORNAMENT..WHITE EXCLAMATION MARK ORNAMENT 2756;N # So BLACK DIAMOND MINUS WHITE X 2757;W # So HEAVY EXCLAMATION MARK SYMBOL 2758..2767;N # So [16] LIGHT VERTICAL BAR..ROTATED FLORAL HEART BULLET 2768;N # Ps MEDIUM LEFT PARENTHESIS ORNAMENT 2769;N # Pe MEDIUM RIGHT PARENTHESIS ORNAMENT 276A;N # Ps MEDIUM FLATTENED LEFT PARENTHESIS ORNAMENT 276B;N # Pe MEDIUM FLATTENED RIGHT PARENTHESIS ORNAMENT 276C;N # Ps MEDIUM LEFT-POINTING ANGLE BRACKET ORNAMENT 276D;N # Pe MEDIUM RIGHT-POINTING ANGLE BRACKET ORNAMENT 276E;N # Ps HEAVY LEFT-POINTING ANGLE QUOTATION MARK ORNAMENT 276F;N # Pe HEAVY RIGHT-POINTING ANGLE QUOTATION MARK ORNAMENT 2770;N # Ps HEAVY LEFT-POINTING ANGLE BRACKET ORNAMENT 2771;N # Pe HEAVY RIGHT-POINTING ANGLE BRACKET ORNAMENT 2772;N # Ps LIGHT LEFT TORTOISE SHELL BRACKET ORNAMENT 2773;N # Pe LIGHT RIGHT TORTOISE SHELL BRACKET ORNAMENT 2774;N # Ps MEDIUM LEFT CURLY BRACKET ORNAMENT 2775;N # Pe MEDIUM RIGHT CURLY BRACKET ORNAMENT 2776..277F;A # No [10] DINGBAT NEGATIVE CIRCLED DIGIT ONE..DINGBAT NEGATIVE CIRCLED NUMBER TEN 2780..2793;N # No [20] DINGBAT CIRCLED SANS-SERIF DIGIT ONE..DINGBAT NEGATIVE CIRCLED SANS-SERIF NUMBER TEN 2794;N # So HEAVY WIDE-HEADED RIGHTWARDS ARROW 2795..2797;W # So [3] HEAVY PLUS SIGN..HEAVY DIVISION SIGN 2798..27AF;N # So [24] HEAVY SOUTH EAST ARROW..NOTCHED LOWER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW 27B0;W # So CURLY LOOP 27B1..27BE;N # So [14] NOTCHED UPPER RIGHT-SHADOWED WHITE RIGHTWARDS ARROW..OPEN-OUTLINED RIGHTWARDS ARROW 27BF;W # So DOUBLE CURLY LOOP 27C0..27C4;N # Sm [5] THREE DIMENSIONAL ANGLE..OPEN SUPERSET 27C5;N # Ps LEFT S-SHAPED BAG DELIMITER 27C6;N # Pe RIGHT S-SHAPED BAG DELIMITER 27C7..27E5;N # Sm [31] OR WITH DOT INSIDE..WHITE SQUARE WITH RIGHTWARDS TICK 27E6;Na # Ps MATHEMATICAL LEFT WHITE SQUARE BRACKET 27E7;Na # Pe MATHEMATICAL RIGHT WHITE SQUARE BRACKET 27E8;Na # Ps MATHEMATICAL LEFT ANGLE BRACKET 27E9;Na # Pe MATHEMATICAL RIGHT ANGLE BRACKET 27EA;Na # Ps MATHEMATICAL LEFT DOUBLE ANGLE BRACKET 27EB;Na # Pe MATHEMATICAL RIGHT DOUBLE ANGLE BRACKET 27EC;Na # Ps MATHEMATICAL LEFT WHITE TORTOISE SHELL BRACKET 27ED;Na # Pe MATHEMATICAL RIGHT WHITE TORTOISE SHELL BRACKET 27EE;N # Ps MATHEMATICAL LEFT FLATTENED PARENTHESIS 27EF;N # Pe MATHEMATICAL RIGHT FLATTENED PARENTHESIS 27F0..27FF;N # Sm [16] UPWARDS QUADRUPLE ARROW..LONG RIGHTWARDS SQUIGGLE ARROW 2800..28FF;N # So [256] BRAILLE PATTERN BLANK..BRAILLE PATTERN DOTS-12345678 2900..297F;N # Sm [128] RIGHTWARDS TWO-HEADED ARROW WITH VERTICAL STROKE..DOWN FISH TAIL 2980..2982;N # Sm [3] TRIPLE VERTICAL BAR DELIMITER..Z NOTATION TYPE COLON 2983;N # Ps LEFT WHITE CURLY BRACKET 2984;N # Pe RIGHT WHITE CURLY BRACKET 2985;Na # Ps LEFT WHITE PARENTHESIS 2986;Na # Pe RIGHT WHITE PARENTHESIS 2987;N # Ps Z NOTATION LEFT IMAGE BRACKET 2988;N # Pe Z NOTATION RIGHT IMAGE BRACKET 2989;N # Ps Z NOTATION LEFT BINDING BRACKET 298A;N # Pe Z NOTATION RIGHT BINDING BRACKET 298B;N # Ps LEFT SQUARE BRACKET WITH UNDERBAR 298C;N # Pe RIGHT SQUARE BRACKET WITH UNDERBAR 298D;N # Ps LEFT SQUARE BRACKET WITH TICK IN TOP CORNER 298E;N # Pe RIGHT SQUARE BRACKET WITH TICK IN BOTTOM CORNER 298F;N # Ps LEFT SQUARE BRACKET WITH TICK IN BOTTOM CORNER 2990;N # Pe RIGHT SQUARE BRACKET WITH TICK IN TOP CORNER 2991;N # Ps LEFT ANGLE BRACKET WITH DOT 2992;N # Pe RIGHT ANGLE BRACKET WITH DOT 2993;N # Ps LEFT ARC LESS-THAN BRACKET 2994;N # Pe RIGHT ARC GREATER-THAN BRACKET 2995;N # Ps DOUBLE LEFT ARC GREATER-THAN BRACKET 2996;N # Pe DOUBLE RIGHT ARC LESS-THAN BRACKET 2997;N # Ps LEFT BLACK TORTOISE SHELL BRACKET 2998;N # Pe RIGHT BLACK TORTOISE SHELL BRACKET 2999..29D7;N # Sm [63] DOTTED FENCE..BLACK HOURGLASS 29D8;N # Ps LEFT WIGGLY FENCE 29D9;N # Pe RIGHT WIGGLY FENCE 29DA;N # Ps LEFT DOUBLE WIGGLY FENCE 29DB;N # Pe RIGHT DOUBLE WIGGLY FENCE 29DC..29FB;N # Sm [32] INCOMPLETE INFINITY..TRIPLE PLUS 29FC;N # Ps LEFT-POINTING CURVED ANGLE BRACKET 29FD;N # Pe RIGHT-POINTING CURVED ANGLE BRACKET 29FE..29FF;N # Sm [2] TINY..MINY 2A00..2AFF;N # Sm [256] N-ARY CIRCLED DOT OPERATOR..N-ARY WHITE VERTICAL BAR 2B00..2B1A;N # So [27] NORTH EAST WHITE ARROW..DOTTED SQUARE 2B1B..2B1C;W # So [2] BLACK LARGE SQUARE..WHITE LARGE SQUARE 2B1D..2B2F;N # So [19] BLACK VERY SMALL SQUARE..WHITE VERTICAL ELLIPSE 2B30..2B44;N # Sm [21] LEFT ARROW WITH SMALL CIRCLE..RIGHTWARDS ARROW THROUGH SUPERSET 2B45..2B46;N # So [2] LEFTWARDS QUADRUPLE ARROW..RIGHTWARDS QUADRUPLE ARROW 2B47..2B4C;N # Sm [6] REVERSE TILDE OPERATOR ABOVE RIGHTWARDS ARROW..RIGHTWARDS ARROW ABOVE REVERSE TILDE OPERATOR 2B4D..2B4F;N # So [3] DOWNWARDS TRIANGLE-HEADED ZIGZAG ARROW..SHORT BACKSLANTED SOUTH ARROW 2B50;W # So WHITE MEDIUM STAR 2B51..2B54;N # So [4] BLACK SMALL STAR..WHITE RIGHT-POINTING PENTAGON 2B55;W # So HEAVY LARGE CIRCLE 2B56..2B59;A # So [4] HEAVY OVAL WITH OVAL INSIDE..HEAVY CIRCLED SALTIRE 2B5A..2B73;N # So [26] SLANTED NORTH ARROW WITH HOOKED HEAD..DOWNWARDS TRIANGLE-HEADED ARROW TO BAR 2B76..2B95;N # So [32] NORTH WEST TRIANGLE-HEADED ARROW TO BAR..RIGHTWARDS BLACK ARROW 2B97..2BFF;N # So [105] SYMBOL FOR TYPE A ELECTRONICS..HELLSCHREIBER PAUSE SYMBOL 2C00..2C5F;N # L& [96] GLAGOLITIC CAPITAL LETTER AZU..GLAGOLITIC SMALL LETTER CAUDATE CHRIVI 2C60..2C7B;N # L& [28] LATIN CAPITAL LETTER L WITH DOUBLE BAR..LATIN LETTER SMALL CAPITAL TURNED E 2C7C..2C7D;N # Lm [2] LATIN SUBSCRIPT SMALL LETTER J..MODIFIER LETTER CAPITAL V 2C7E..2C7F;N # Lu [2] LATIN CAPITAL LETTER S WITH SWASH TAIL..LATIN CAPITAL LETTER Z WITH SWASH TAIL 2C80..2CE4;N # L& [101] COPTIC CAPITAL LETTER ALFA..COPTIC SYMBOL KAI 2CE5..2CEA;N # So [6] COPTIC SYMBOL MI RO..COPTIC SYMBOL SHIMA SIMA 2CEB..2CEE;N # L& [4] COPTIC CAPITAL LETTER CRYPTOGRAMMIC SHEI..COPTIC SMALL LETTER CRYPTOGRAMMIC GANGIA 2CEF..2CF1;N # Mn [3] COPTIC COMBINING NI ABOVE..COPTIC COMBINING SPIRITUS LENIS 2CF2..2CF3;N # L& [2] COPTIC CAPITAL LETTER BOHAIRIC KHEI..COPTIC SMALL LETTER BOHAIRIC KHEI 2CF9..2CFC;N # Po [4] COPTIC OLD NUBIAN FULL STOP..COPTIC OLD NUBIAN VERSE DIVIDER 2CFD;N # No COPTIC FRACTION ONE HALF 2CFE..2CFF;N # Po [2] COPTIC FULL STOP..COPTIC MORPHOLOGICAL DIVIDER 2D00..2D25;N # Ll [38] GEORGIAN SMALL LETTER AN..GEORGIAN SMALL LETTER HOE 2D27;N # Ll GEORGIAN SMALL LETTER YN 2D2D;N # Ll GEORGIAN SMALL LETTER AEN 2D30..2D67;N # Lo [56] TIFINAGH LETTER YA..TIFINAGH LETTER YO 2D6F;N # Lm TIFINAGH MODIFIER LETTER LABIALIZATION MARK 2D70;N # Po TIFINAGH SEPARATOR MARK 2D7F;N # Mn TIFINAGH CONSONANT JOINER 2D80..2D96;N # Lo [23] ETHIOPIC SYLLABLE LOA..ETHIOPIC SYLLABLE GGWE 2DA0..2DA6;N # Lo [7] ETHIOPIC SYLLABLE SSA..ETHIOPIC SYLLABLE SSO 2DA8..2DAE;N # Lo [7] ETHIOPIC SYLLABLE CCA..ETHIOPIC SYLLABLE CCO 2DB0..2DB6;N # Lo [7] ETHIOPIC SYLLABLE ZZA..ETHIOPIC SYLLABLE ZZO 2DB8..2DBE;N # Lo [7] ETHIOPIC SYLLABLE CCHA..ETHIOPIC SYLLABLE CCHO 2DC0..2DC6;N # Lo [7] ETHIOPIC SYLLABLE QYA..ETHIOPIC SYLLABLE QYO 2DC8..2DCE;N # Lo [7] ETHIOPIC SYLLABLE KYA..ETHIOPIC SYLLABLE KYO 2DD0..2DD6;N # Lo [7] ETHIOPIC SYLLABLE XYA..ETHIOPIC SYLLABLE XYO 2DD8..2DDE;N # Lo [7] ETHIOPIC SYLLABLE GYA..ETHIOPIC SYLLABLE GYO 2DE0..2DFF;N # Mn [32] COMBINING CYRILLIC LETTER BE..COMBINING CYRILLIC LETTER IOTIFIED BIG YUS 2E00..2E01;N # Po [2] RIGHT ANGLE SUBSTITUTION MARKER..RIGHT ANGLE DOTTED SUBSTITUTION MARKER 2E02;N # Pi LEFT SUBSTITUTION BRACKET 2E03;N # Pf RIGHT SUBSTITUTION BRACKET 2E04;N # Pi LEFT DOTTED SUBSTITUTION BRACKET 2E05;N # Pf RIGHT DOTTED SUBSTITUTION BRACKET 2E06..2E08;N # Po [3] RAISED INTERPOLATION MARKER..DOTTED TRANSPOSITION MARKER 2E09;N # Pi LEFT TRANSPOSITION BRACKET 2E0A;N # Pf RIGHT TRANSPOSITION BRACKET 2E0B;N # Po RAISED SQUARE 2E0C;N # Pi LEFT RAISED OMISSION BRACKET 2E0D;N # Pf RIGHT RAISED OMISSION BRACKET 2E0E..2E16;N # Po [9] EDITORIAL CORONIS..DOTTED RIGHT-POINTING ANGLE 2E17;N # Pd DOUBLE OBLIQUE HYPHEN 2E18..2E19;N # Po [2] INVERTED INTERROBANG..PALM BRANCH 2E1A;N # Pd HYPHEN WITH DIAERESIS 2E1B;N # Po TILDE WITH RING ABOVE 2E1C;N # Pi LEFT LOW PARAPHRASE BRACKET 2E1D;N # Pf RIGHT LOW PARAPHRASE BRACKET 2E1E..2E1F;N # Po [2] TILDE WITH DOT ABOVE..TILDE WITH DOT BELOW 2E20;N # Pi LEFT VERTICAL BAR WITH QUILL 2E21;N # Pf RIGHT VERTICAL BAR WITH QUILL 2E22;N # Ps TOP LEFT HALF BRACKET 2E23;N # Pe TOP RIGHT HALF BRACKET 2E24;N # Ps BOTTOM LEFT HALF BRACKET 2E25;N # Pe BOTTOM RIGHT HALF BRACKET 2E26;N # Ps LEFT SIDEWAYS U BRACKET 2E27;N # Pe RIGHT SIDEWAYS U BRACKET 2E28;N # Ps LEFT DOUBLE PARENTHESIS 2E29;N # Pe RIGHT DOUBLE PARENTHESIS 2E2A..2E2E;N # Po [5] TWO DOTS OVER ONE DOT PUNCTUATION..REVERSED QUESTION MARK 2E2F;N # Lm VERTICAL TILDE 2E30..2E39;N # Po [10] RING POINT..TOP HALF SECTION SIGN 2E3A..2E3B;N # Pd [2] TWO-EM DASH..THREE-EM DASH 2E3C..2E3F;N # Po [4] STENOGRAPHIC FULL STOP..CAPITULUM 2E40;N # Pd DOUBLE HYPHEN 2E41;N # Po REVERSED COMMA 2E42;N # Ps DOUBLE LOW-REVERSED-9 QUOTATION MARK 2E43..2E4F;N # Po [13] DASH WITH LEFT UPTURN..CORNISH VERSE DIVIDER 2E50..2E51;N # So [2] CROSS PATTY WITH RIGHT CROSSBAR..CROSS PATTY WITH LEFT CROSSBAR 2E52..2E54;N # Po [3] TIRONIAN SIGN CAPITAL ET..MEDIEVAL QUESTION MARK 2E55;N # Ps LEFT SQUARE BRACKET WITH STROKE 2E56;N # Pe RIGHT SQUARE BRACKET WITH STROKE 2E57;N # Ps LEFT SQUARE BRACKET WITH DOUBLE STROKE 2E58;N # Pe RIGHT SQUARE BRACKET WITH DOUBLE STROKE 2E59;N # Ps TOP HALF LEFT PARENTHESIS 2E5A;N # Pe TOP HALF RIGHT PARENTHESIS 2E5B;N # Ps BOTTOM HALF LEFT PARENTHESIS 2E5C;N # Pe BOTTOM HALF RIGHT PARENTHESIS 2E5D;N # Pd OBLIQUE HYPHEN 2E80..2E99;W # So [26] CJK RADICAL REPEAT..CJK RADICAL RAP 2E9B..2EF3;W # So [89] CJK RADICAL CHOKE..CJK RADICAL C-SIMPLIFIED TURTLE 2F00..2FD5;W # So [214] KANGXI RADICAL ONE..KANGXI RADICAL FLUTE 2FF0..2FFB;W # So [12] IDEOGRAPHIC DESCRIPTION CHARACTER LEFT TO RIGHT..IDEOGRAPHIC DESCRIPTION CHARACTER OVERLAID 3000;F # Zs IDEOGRAPHIC SPACE 3001..3003;W # Po [3] IDEOGRAPHIC COMMA..DITTO MARK 3004;W # So JAPANESE INDUSTRIAL STANDARD SYMBOL 3005;W # Lm IDEOGRAPHIC ITERATION MARK 3006;W # Lo IDEOGRAPHIC CLOSING MARK 3007;W # Nl IDEOGRAPHIC NUMBER ZERO 3008;W # Ps LEFT ANGLE BRACKET 3009;W # Pe RIGHT ANGLE BRACKET 300A;W # Ps LEFT DOUBLE ANGLE BRACKET 300B;W # Pe RIGHT DOUBLE ANGLE BRACKET 300C;W # Ps LEFT CORNER BRACKET 300D;W # Pe RIGHT CORNER BRACKET 300E;W # Ps LEFT WHITE CORNER BRACKET 300F;W # Pe RIGHT WHITE CORNER BRACKET 3010;W # Ps LEFT BLACK LENTICULAR BRACKET 3011;W # Pe RIGHT BLACK LENTICULAR BRACKET 3012..3013;W # So [2] POSTAL MARK..GETA MARK 3014;W # Ps LEFT TORTOISE SHELL BRACKET 3015;W # Pe RIGHT TORTOISE SHELL BRACKET 3016;W # Ps LEFT WHITE LENTICULAR BRACKET 3017;W # Pe RIGHT WHITE LENTICULAR BRACKET 3018;W # Ps LEFT WHITE TORTOISE SHELL BRACKET 3019;W # Pe RIGHT WHITE TORTOISE SHELL BRACKET 301A;W # Ps LEFT WHITE SQUARE BRACKET 301B;W # Pe RIGHT WHITE SQUARE BRACKET 301C;W # Pd WAVE DASH 301D;W # Ps REVERSED DOUBLE PRIME QUOTATION MARK 301E..301F;W # Pe [2] DOUBLE PRIME QUOTATION MARK..LOW DOUBLE PRIME QUOTATION MARK 3020;W # So POSTAL MARK FACE 3021..3029;W # Nl [9] HANGZHOU NUMERAL ONE..HANGZHOU NUMERAL NINE 302A..302D;W # Mn [4] IDEOGRAPHIC LEVEL TONE MARK..IDEOGRAPHIC ENTERING TONE MARK 302E..302F;W # Mc [2] HANGUL SINGLE DOT TONE MARK..HANGUL DOUBLE DOT TONE MARK 3030;W # Pd WAVY DASH 3031..3035;W # Lm [5] VERTICAL KANA REPEAT MARK..VERTICAL KANA REPEAT MARK LOWER HALF 3036..3037;W # So [2] CIRCLED POSTAL MARK..IDEOGRAPHIC TELEGRAPH LINE FEED SEPARATOR SYMBOL 3038..303A;W # Nl [3] HANGZHOU NUMERAL TEN..HANGZHOU NUMERAL THIRTY 303B;W # Lm VERTICAL IDEOGRAPHIC ITERATION MARK 303C;W # Lo MASU MARK 303D;W # Po PART ALTERNATION MARK 303E;W # So IDEOGRAPHIC VARIATION INDICATOR 303F;N # So IDEOGRAPHIC HALF FILL SPACE 3041..3096;W # Lo [86] HIRAGANA LETTER SMALL A..HIRAGANA LETTER SMALL KE 3099..309A;W # Mn [2] COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK..COMBINING KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK 309B..309C;W # Sk [2] KATAKANA-HIRAGANA VOICED SOUND MARK..KATAKANA-HIRAGANA SEMI-VOICED SOUND MARK 309D..309E;W # Lm [2] HIRAGANA ITERATION MARK..HIRAGANA VOICED ITERATION MARK 309F;W # Lo HIRAGANA DIGRAPH YORI 30A0;W # Pd KATAKANA-HIRAGANA DOUBLE HYPHEN 30A1..30FA;W # Lo [90] KATAKANA LETTER SMALL A..KATAKANA LETTER VO 30FB;W # Po KATAKANA MIDDLE DOT 30FC..30FE;W # Lm [3] KATAKANA-HIRAGANA PROLONGED SOUND MARK..KATAKANA VOICED ITERATION MARK 30FF;W # Lo KATAKANA DIGRAPH KOTO 3105..312F;W # Lo [43] BOPOMOFO LETTER B..BOPOMOFO LETTER NN 3131..318E;W # Lo [94] HANGUL LETTER KIYEOK..HANGUL LETTER ARAEAE 3190..3191;W # So [2] IDEOGRAPHIC ANNOTATION LINKING MARK..IDEOGRAPHIC ANNOTATION REVERSE MARK 3192..3195;W # No [4] IDEOGRAPHIC ANNOTATION ONE MARK..IDEOGRAPHIC ANNOTATION FOUR MARK 3196..319F;W # So [10] IDEOGRAPHIC ANNOTATION TOP MARK..IDEOGRAPHIC ANNOTATION MAN MARK 31A0..31BF;W # Lo [32] BOPOMOFO LETTER BU..BOPOMOFO LETTER AH 31C0..31E3;W # So [36] CJK STROKE T..CJK STROKE Q 31F0..31FF;W # Lo [16] KATAKANA LETTER SMALL KU..KATAKANA LETTER SMALL RO 3200..321E;W # So [31] PARENTHESIZED HANGUL KIYEOK..PARENTHESIZED KOREAN CHARACTER O HU 3220..3229;W # No [10] PARENTHESIZED IDEOGRAPH ONE..PARENTHESIZED IDEOGRAPH TEN 322A..3247;W # So [30] PARENTHESIZED IDEOGRAPH MOON..CIRCLED IDEOGRAPH KOTO 3248..324F;A # No [8] CIRCLED NUMBER TEN ON BLACK SQUARE..CIRCLED NUMBER EIGHTY ON BLACK SQUARE 3250;W # So PARTNERSHIP SIGN 3251..325F;W # No [15] CIRCLED NUMBER TWENTY ONE..CIRCLED NUMBER THIRTY FIVE 3260..327F;W # So [32] CIRCLED HANGUL KIYEOK..KOREAN STANDARD SYMBOL 3280..3289;W # No [10] CIRCLED IDEOGRAPH ONE..CIRCLED IDEOGRAPH TEN 328A..32B0;W # So [39] CIRCLED IDEOGRAPH MOON..CIRCLED IDEOGRAPH NIGHT 32B1..32BF;W # No [15] CIRCLED NUMBER THIRTY SIX..CIRCLED NUMBER FIFTY 32C0..32FF;W # So [64] IDEOGRAPHIC TELEGRAPH SYMBOL FOR JANUARY..SQUARE ERA NAME REIWA 3300..33FF;W # So [256] SQUARE APAATO..SQUARE GAL 3400..4DBF;W # Lo [6592] CJK UNIFIED IDEOGRAPH-3400..CJK UNIFIED IDEOGRAPH-4DBF 4DC0..4DFF;N # So [64] HEXAGRAM FOR THE CREATIVE HEAVEN..HEXAGRAM FOR BEFORE COMPLETION 4E00..9FFF;W # Lo [20992] CJK UNIFIED IDEOGRAPH-4E00..CJK UNIFIED IDEOGRAPH-9FFF A000..A014;W # Lo [21] YI SYLLABLE IT..YI SYLLABLE E A015;W # Lm YI SYLLABLE WU A016..A48C;W # Lo [1143] YI SYLLABLE BIT..YI SYLLABLE YYR A490..A4C6;W # So [55] YI RADICAL QOT..YI RADICAL KE A4D0..A4F7;N # Lo [40] LISU LETTER BA..LISU LETTER OE A4F8..A4FD;N # Lm [6] LISU LETTER TONE MYA TI..LISU LETTER TONE MYA JEU A4FE..A4FF;N # Po [2] LISU PUNCTUATION COMMA..LISU PUNCTUATION FULL STOP A500..A60B;N # Lo [268] VAI SYLLABLE EE..VAI SYLLABLE NG A60C;N # Lm VAI SYLLABLE LENGTHENER A60D..A60F;N # Po [3] VAI COMMA..VAI QUESTION MARK A610..A61F;N # Lo [16] VAI SYLLABLE NDOLE FA..VAI SYMBOL JONG A620..A629;N # Nd [10] VAI DIGIT ZERO..VAI DIGIT NINE A62A..A62B;N # Lo [2] VAI SYLLABLE NDOLE MA..VAI SYLLABLE NDOLE DO A640..A66D;N # L& [46] CYRILLIC CAPITAL LETTER ZEMLYA..CYRILLIC SMALL LETTER DOUBLE MONOCULAR O A66E;N # Lo CYRILLIC LETTER MULTIOCULAR O A66F;N # Mn COMBINING CYRILLIC VZMET A670..A672;N # Me [3] COMBINING CYRILLIC TEN MILLIONS SIGN..COMBINING CYRILLIC THOUSAND MILLIONS SIGN A673;N # Po SLAVONIC ASTERISK A674..A67D;N # Mn [10] COMBINING CYRILLIC LETTER UKRAINIAN IE..COMBINING CYRILLIC PAYEROK A67E;N # Po CYRILLIC KAVYKA A67F;N # Lm CYRILLIC PAYEROK A680..A69B;N # L& [28] CYRILLIC CAPITAL LETTER DWE..CYRILLIC SMALL LETTER CROSSED O A69C..A69D;N # Lm [2] MODIFIER LETTER CYRILLIC HARD SIGN..MODIFIER LETTER CYRILLIC SOFT SIGN A69E..A69F;N # Mn [2] COMBINING CYRILLIC LETTER EF..COMBINING CYRILLIC LETTER IOTIFIED E A6A0..A6E5;N # Lo [70] BAMUM LETTER A..BAMUM LETTER KI A6E6..A6EF;N # Nl [10] BAMUM LETTER MO..BAMUM LETTER KOGHOM A6F0..A6F1;N # Mn [2] BAMUM COMBINING MARK KOQNDON..BAMUM COMBINING MARK TUKWENTIS A6F2..A6F7;N # Po [6] BAMUM NJAEMLI..BAMUM QUESTION MARK A700..A716;N # Sk [23] MODIFIER LETTER CHINESE TONE YIN PING..MODIFIER LETTER EXTRA-LOW LEFT-STEM TONE BAR A717..A71F;N # Lm [9] MODIFIER LETTER DOT VERTICAL BAR..MODIFIER LETTER LOW INVERTED EXCLAMATION MARK A720..A721;N # Sk [2] MODIFIER LETTER STRESS AND HIGH TONE..MODIFIER LETTER STRESS AND LOW TONE A722..A76F;N # L& [78] LATIN CAPITAL LETTER EGYPTOLOGICAL ALEF..LATIN SMALL LETTER CON A770;N # Lm MODIFIER LETTER US A771..A787;N # L& [23] LATIN SMALL LETTER DUM..LATIN SMALL LETTER INSULAR T A788;N # Lm MODIFIER LETTER LOW CIRCUMFLEX ACCENT A789..A78A;N # Sk [2] MODIFIER LETTER COLON..MODIFIER LETTER SHORT EQUALS SIGN A78B..A78E;N # L& [4] LATIN CAPITAL LETTER SALTILLO..LATIN SMALL LETTER L WITH RETROFLEX HOOK AND BELT A78F;N # Lo LATIN LETTER SINOLOGICAL DOT A790..A7CA;N # L& [59] LATIN CAPITAL LETTER N WITH DESCENDER..LATIN SMALL LETTER S WITH SHORT STROKE OVERLAY A7D0..A7D1;N # L& [2] LATIN CAPITAL LETTER CLOSED INSULAR G..LATIN SMALL LETTER CLOSED INSULAR G A7D3;N # Ll LATIN SMALL LETTER DOUBLE THORN A7D5..A7D9;N # L& [5] LATIN SMALL LETTER DOUBLE WYNN..LATIN SMALL LETTER SIGMOID S A7F2..A7F4;N # Lm [3] MODIFIER LETTER CAPITAL C..MODIFIER LETTER CAPITAL Q A7F5..A7F6;N # L& [2] LATIN CAPITAL LETTER REVERSED HALF H..LATIN SMALL LETTER REVERSED HALF H A7F7;N # Lo LATIN EPIGRAPHIC LETTER SIDEWAYS I A7F8..A7F9;N # Lm [2] MODIFIER LETTER CAPITAL H WITH STROKE..MODIFIER LETTER SMALL LIGATURE OE A7FA;N # Ll LATIN LETTER SMALL CAPITAL TURNED M A7FB..A7FF;N # Lo [5] LATIN EPIGRAPHIC LETTER REVERSED F..LATIN EPIGRAPHIC LETTER ARCHAIC M A800..A801;N # Lo [2] SYLOTI NAGRI LETTER A..SYLOTI NAGRI LETTER I A802;N # Mn SYLOTI NAGRI SIGN DVISVARA A803..A805;N # Lo [3] SYLOTI NAGRI LETTER U..SYLOTI NAGRI LETTER O A806;N # Mn SYLOTI NAGRI SIGN HASANTA A807..A80A;N # Lo [4] SYLOTI NAGRI LETTER KO..SYLOTI NAGRI LETTER GHO A80B;N # Mn SYLOTI NAGRI SIGN ANUSVARA A80C..A822;N # Lo [23] SYLOTI NAGRI LETTER CO..SYLOTI NAGRI LETTER HO A823..A824;N # Mc [2] SYLOTI NAGRI VOWEL SIGN A..SYLOTI NAGRI VOWEL SIGN I A825..A826;N # Mn [2] SYLOTI NAGRI VOWEL SIGN U..SYLOTI NAGRI VOWEL SIGN E A827;N # Mc SYLOTI NAGRI VOWEL SIGN OO A828..A82B;N # So [4] SYLOTI NAGRI POETRY MARK-1..SYLOTI NAGRI POETRY MARK-4 A82C;N # Mn SYLOTI NAGRI SIGN ALTERNATE HASANTA A830..A835;N # No [6] NORTH INDIC FRACTION ONE QUARTER..NORTH INDIC FRACTION THREE SIXTEENTHS A836..A837;N # So [2] NORTH INDIC QUARTER MARK..NORTH INDIC PLACEHOLDER MARK A838;N # Sc NORTH INDIC RUPEE MARK A839;N # So NORTH INDIC QUANTITY MARK A840..A873;N # Lo [52] PHAGS-PA LETTER KA..PHAGS-PA LETTER CANDRABINDU A874..A877;N # Po [4] PHAGS-PA SINGLE HEAD MARK..PHAGS-PA MARK DOUBLE SHAD A880..A881;N # Mc [2] SAURASHTRA SIGN ANUSVARA..SAURASHTRA SIGN VISARGA A882..A8B3;N # Lo [50] SAURASHTRA LETTER A..SAURASHTRA LETTER LLA A8B4..A8C3;N # Mc [16] SAURASHTRA CONSONANT SIGN HAARU..SAURASHTRA VOWEL SIGN AU A8C4..A8C5;N # Mn [2] SAURASHTRA SIGN VIRAMA..SAURASHTRA SIGN CANDRABINDU A8CE..A8CF;N # Po [2] SAURASHTRA DANDA..SAURASHTRA DOUBLE DANDA A8D0..A8D9;N # Nd [10] SAURASHTRA DIGIT ZERO..SAURASHTRA DIGIT NINE A8E0..A8F1;N # Mn [18] COMBINING DEVANAGARI DIGIT ZERO..COMBINING DEVANAGARI SIGN AVAGRAHA A8F2..A8F7;N # Lo [6] DEVANAGARI SIGN SPACING CANDRABINDU..DEVANAGARI SIGN CANDRABINDU AVAGRAHA A8F8..A8FA;N # Po [3] DEVANAGARI SIGN PUSHPIKA..DEVANAGARI CARET A8FB;N # Lo DEVANAGARI HEADSTROKE A8FC;N # Po DEVANAGARI SIGN SIDDHAM A8FD..A8FE;N # Lo [2] DEVANAGARI JAIN OM..DEVANAGARI LETTER AY A8FF;N # Mn DEVANAGARI VOWEL SIGN AY A900..A909;N # Nd [10] KAYAH LI DIGIT ZERO..KAYAH LI DIGIT NINE A90A..A925;N # Lo [28] KAYAH LI LETTER KA..KAYAH LI LETTER OO A926..A92D;N # Mn [8] KAYAH LI VOWEL UE..KAYAH LI TONE CALYA PLOPHU A92E..A92F;N # Po [2] KAYAH LI SIGN CWI..KAYAH LI SIGN SHYA A930..A946;N # Lo [23] REJANG LETTER KA..REJANG LETTER A A947..A951;N # Mn [11] REJANG VOWEL SIGN I..REJANG CONSONANT SIGN R A952..A953;N # Mc [2] REJANG CONSONANT SIGN H..REJANG VIRAMA A95F;N # Po REJANG SECTION MARK A960..A97C;W # Lo [29] HANGUL CHOSEONG TIKEUT-MIEUM..HANGUL CHOSEONG SSANGYEORINHIEUH A980..A982;N # Mn [3] JAVANESE SIGN PANYANGGA..JAVANESE SIGN LAYAR A983;N # Mc JAVANESE SIGN WIGNYAN A984..A9B2;N # Lo [47] JAVANESE LETTER A..JAVANESE LETTER HA A9B3;N # Mn JAVANESE SIGN CECAK TELU A9B4..A9B5;N # Mc [2] JAVANESE VOWEL SIGN TARUNG..JAVANESE VOWEL SIGN TOLONG A9B6..A9B9;N # Mn [4] JAVANESE VOWEL SIGN WULU..JAVANESE VOWEL SIGN SUKU MENDUT A9BA..A9BB;N # Mc [2] JAVANESE VOWEL SIGN TALING..JAVANESE VOWEL SIGN DIRGA MURE A9BC..A9BD;N # Mn [2] JAVANESE VOWEL SIGN PEPET..JAVANESE CONSONANT SIGN KERET A9BE..A9C0;N # Mc [3] JAVANESE CONSONANT SIGN PENGKAL..JAVANESE PANGKON A9C1..A9CD;N # Po [13] JAVANESE LEFT RERENGGAN..JAVANESE TURNED PADA PISELEH A9CF;N # Lm JAVANESE PANGRANGKEP A9D0..A9D9;N # Nd [10] JAVANESE DIGIT ZERO..JAVANESE DIGIT NINE A9DE..A9DF;N # Po [2] JAVANESE PADA TIRTA TUMETES..JAVANESE PADA ISEN-ISEN A9E0..A9E4;N # Lo [5] MYANMAR LETTER SHAN GHA..MYANMAR LETTER SHAN BHA A9E5;N # Mn MYANMAR SIGN SHAN SAW A9E6;N # Lm MYANMAR MODIFIER LETTER SHAN REDUPLICATION A9E7..A9EF;N # Lo [9] MYANMAR LETTER TAI LAING NYA..MYANMAR LETTER TAI LAING NNA A9F0..A9F9;N # Nd [10] MYANMAR TAI LAING DIGIT ZERO..MYANMAR TAI LAING DIGIT NINE A9FA..A9FE;N # Lo [5] MYANMAR LETTER TAI LAING LLA..MYANMAR LETTER TAI LAING BHA AA00..AA28;N # Lo [41] CHAM LETTER A..CHAM LETTER HA AA29..AA2E;N # Mn [6] CHAM VOWEL SIGN AA..CHAM VOWEL SIGN OE AA2F..AA30;N # Mc [2] CHAM VOWEL SIGN O..CHAM VOWEL SIGN AI AA31..AA32;N # Mn [2] CHAM VOWEL SIGN AU..CHAM VOWEL SIGN UE AA33..AA34;N # Mc [2] CHAM CONSONANT SIGN YA..CHAM CONSONANT SIGN RA AA35..AA36;N # Mn [2] CHAM CONSONANT SIGN LA..CHAM CONSONANT SIGN WA AA40..AA42;N # Lo [3] CHAM LETTER FINAL K..CHAM LETTER FINAL NG AA43;N # Mn CHAM CONSONANT SIGN FINAL NG AA44..AA4B;N # Lo [8] CHAM LETTER FINAL CH..CHAM LETTER FINAL SS AA4C;N # Mn CHAM CONSONANT SIGN FINAL M AA4D;N # Mc CHAM CONSONANT SIGN FINAL H AA50..AA59;N # Nd [10] CHAM DIGIT ZERO..CHAM DIGIT NINE AA5C..AA5F;N # Po [4] CHAM PUNCTUATION SPIRAL..CHAM PUNCTUATION TRIPLE DANDA AA60..AA6F;N # Lo [16] MYANMAR LETTER KHAMTI GA..MYANMAR LETTER KHAMTI FA AA70;N # Lm MYANMAR MODIFIER LETTER KHAMTI REDUPLICATION AA71..AA76;N # Lo [6] MYANMAR LETTER KHAMTI XA..MYANMAR LOGOGRAM KHAMTI HM AA77..AA79;N # So [3] MYANMAR SYMBOL AITON EXCLAMATION..MYANMAR SYMBOL AITON TWO AA7A;N # Lo MYANMAR LETTER AITON RA AA7B;N # Mc MYANMAR SIGN PAO KAREN TONE AA7C;N # Mn MYANMAR SIGN TAI LAING TONE-2 AA7D;N # Mc MYANMAR SIGN TAI LAING TONE-5 AA7E..AA7F;N # Lo [2] MYANMAR LETTER SHWE PALAUNG CHA..MYANMAR LETTER SHWE PALAUNG SHA AA80..AAAF;N # Lo [48] TAI VIET LETTER LOW KO..TAI VIET LETTER HIGH O AAB0;N # Mn TAI VIET MAI KANG AAB1;N # Lo TAI VIET VOWEL AA AAB2..AAB4;N # Mn [3] TAI VIET VOWEL I..TAI VIET VOWEL U AAB5..AAB6;N # Lo [2] TAI VIET VOWEL E..TAI VIET VOWEL O AAB7..AAB8;N # Mn [2] TAI VIET MAI KHIT..TAI VIET VOWEL IA AAB9..AABD;N # Lo [5] TAI VIET VOWEL UEA..TAI VIET VOWEL AN AABE..AABF;N # Mn [2] TAI VIET VOWEL AM..TAI VIET TONE MAI EK AAC0;N # Lo TAI VIET TONE MAI NUENG AAC1;N # Mn TAI VIET TONE MAI THO AAC2;N # Lo TAI VIET TONE MAI SONG AADB..AADC;N # Lo [2] TAI VIET SYMBOL KON..TAI VIET SYMBOL NUENG AADD;N # Lm TAI VIET SYMBOL SAM AADE..AADF;N # Po [2] TAI VIET SYMBOL HO HOI..TAI VIET SYMBOL KOI KOI AAE0..AAEA;N # Lo [11] MEETEI MAYEK LETTER E..MEETEI MAYEK LETTER SSA AAEB;N # Mc MEETEI MAYEK VOWEL SIGN II AAEC..AAED;N # Mn [2] MEETEI MAYEK VOWEL SIGN UU..MEETEI MAYEK VOWEL SIGN AAI AAEE..AAEF;N # Mc [2] MEETEI MAYEK VOWEL SIGN AU..MEETEI MAYEK VOWEL SIGN AAU AAF0..AAF1;N # Po [2] MEETEI MAYEK CHEIKHAN..MEETEI MAYEK AHANG KHUDAM AAF2;N # Lo MEETEI MAYEK ANJI AAF3..AAF4;N # Lm [2] MEETEI MAYEK SYLLABLE REPETITION MARK..MEETEI MAYEK WORD REPETITION MARK AAF5;N # Mc MEETEI MAYEK VOWEL SIGN VISARGA AAF6;N # Mn MEETEI MAYEK VIRAMA AB01..AB06;N # Lo [6] ETHIOPIC SYLLABLE TTHU..ETHIOPIC SYLLABLE TTHO AB09..AB0E;N # Lo [6] ETHIOPIC SYLLABLE DDHU..ETHIOPIC SYLLABLE DDHO AB11..AB16;N # Lo [6] ETHIOPIC SYLLABLE DZU..ETHIOPIC SYLLABLE DZO AB20..AB26;N # Lo [7] ETHIOPIC SYLLABLE CCHHA..ETHIOPIC SYLLABLE CCHHO AB28..AB2E;N # Lo [7] ETHIOPIC SYLLABLE BBA..ETHIOPIC SYLLABLE BBO AB30..AB5A;N # Ll [43] LATIN SMALL LETTER BARRED ALPHA..LATIN SMALL LETTER Y WITH SHORT RIGHT LEG AB5B;N # Sk MODIFIER BREVE WITH INVERTED BREVE AB5C..AB5F;N # Lm [4] MODIFIER LETTER SMALL HENG..MODIFIER LETTER SMALL U WITH LEFT HOOK AB60..AB68;N # Ll [9] LATIN SMALL LETTER SAKHA YAT..LATIN SMALL LETTER TURNED R WITH MIDDLE TILDE AB69;N # Lm MODIFIER LETTER SMALL TURNED W AB6A..AB6B;N # Sk [2] MODIFIER LETTER LEFT TACK..MODIFIER LETTER RIGHT TACK AB70..ABBF;N # Ll [80] CHEROKEE SMALL LETTER A..CHEROKEE SMALL LETTER YA ABC0..ABE2;N # Lo [35] MEETEI MAYEK LETTER KOK..MEETEI MAYEK LETTER I LONSUM ABE3..ABE4;N # Mc [2] MEETEI MAYEK VOWEL SIGN ONAP..MEETEI MAYEK VOWEL SIGN INAP ABE5;N # Mn MEETEI MAYEK VOWEL SIGN ANAP ABE6..ABE7;N # Mc [2] MEETEI MAYEK VOWEL SIGN YENAP..MEETEI MAYEK VOWEL SIGN SOUNAP ABE8;N # Mn MEETEI MAYEK VOWEL SIGN UNAP ABE9..ABEA;N # Mc [2] MEETEI MAYEK VOWEL SIGN CHEINAP..MEETEI MAYEK VOWEL SIGN NUNG ABEB;N # Po MEETEI MAYEK CHEIKHEI ABEC;N # Mc MEETEI MAYEK LUM IYEK ABED;N # Mn MEETEI MAYEK APUN IYEK ABF0..ABF9;N # Nd [10] MEETEI MAYEK DIGIT ZERO..MEETEI MAYEK DIGIT NINE AC00..D7A3;W # Lo [11172] HANGUL SYLLABLE GA..HANGUL SYLLABLE HIH D7B0..D7C6;N # Lo [23] HANGUL JUNGSEONG O-YEO..HANGUL JUNGSEONG ARAEA-E D7CB..D7FB;N # Lo [49] HANGUL JONGSEONG NIEUN-RIEUL..HANGUL JONGSEONG PHIEUPH-THIEUTH D800..DB7F;N # Cs [896] <surrogate-D800>..<surrogate-DB7F> DB80..DBFF;N # Cs [128] <surrogate-DB80>..<surrogate-DBFF> DC00..DFFF;N # Cs [1024] <surrogate-DC00>..<surrogate-DFFF> E000..F8FF;A # Co [6400] <private-use-E000>..<private-use-F8FF> F900..FA6D;W # Lo [366] CJK COMPATIBILITY IDEOGRAPH-F900..CJK COMPATIBILITY IDEOGRAPH-FA6D FA6E..FA6F;W # Cn [2] <reserved-FA6E>..<reserved-FA6F> FA70..FAD9;W # Lo [106] CJK COMPATIBILITY IDEOGRAPH-FA70..CJK COMPATIBILITY IDEOGRAPH-FAD9 FADA..FAFF;W # Cn [38] <reserved-FADA>..<reserved-FAFF> FB00..FB06;N # Ll [7] LATIN SMALL LIGATURE FF..LATIN SMALL LIGATURE ST FB13..FB17;N # Ll [5] ARMENIAN SMALL LIGATURE MEN NOW..ARMENIAN SMALL LIGATURE MEN XEH FB1D;N # Lo HEBREW LETTER YOD WITH HIRIQ FB1E;N # Mn HEBREW POINT JUDEO-SPANISH VARIKA FB1F..FB28;N # Lo [10] HEBREW LIGATURE YIDDISH YOD YOD PATAH..HEBREW LETTER WIDE TAV FB29;N # Sm HEBREW LETTER ALTERNATIVE PLUS SIGN FB2A..FB36;N # Lo [13] HEBREW LETTER SHIN WITH SHIN DOT..HEBREW LETTER ZAYIN WITH DAGESH FB38..FB3C;N # Lo [5] HEBREW LETTER TET WITH DAGESH..HEBREW LETTER LAMED WITH DAGESH FB3E;N # Lo HEBREW LETTER MEM WITH DAGESH FB40..FB41;N # Lo [2] HEBREW LETTER NUN WITH DAGESH..HEBREW LETTER SAMEKH WITH DAGESH FB43..FB44;N # Lo [2] HEBREW LETTER FINAL PE WITH DAGESH..HEBREW LETTER PE WITH DAGESH FB46..FB4F;N # Lo [10] HEBREW LETTER TSADI WITH DAGESH..HEBREW LIGATURE ALEF LAMED FB50..FBB1;N # Lo [98] ARABIC LETTER ALEF WASLA ISOLATED FORM..ARABIC LETTER YEH BARREE WITH HAMZA ABOVE FINAL FORM FBB2..FBC2;N # Sk [17] ARABIC SYMBOL DOT ABOVE..ARABIC SYMBOL WASLA ABOVE FBD3..FD3D;N # Lo [363] ARABIC LETTER NG ISOLATED FORM..ARABIC LIGATURE ALEF WITH FATHATAN ISOLATED FORM FD3E;N # Pe ORNATE LEFT PARENTHESIS FD3F;N # Ps ORNATE RIGHT PARENTHESIS FD40..FD4F;N # So [16] ARABIC LIGATURE RAHIMAHU ALLAAH..ARABIC LIGATURE RAHIMAHUM ALLAAH FD50..FD8F;N # Lo [64] ARABIC LIGATURE TEH WITH JEEM WITH MEEM INITIAL FORM..ARABIC LIGATURE MEEM WITH KHAH WITH MEEM INITIAL FORM FD92..FDC7;N # Lo [54] ARABIC LIGATURE MEEM WITH JEEM WITH KHAH INITIAL FORM..ARABIC LIGATURE NOON WITH JEEM WITH YEH FINAL FORM FDCF;N # So ARABIC LIGATURE SALAAMUHU ALAYNAA FDF0..FDFB;N # Lo [12] ARABIC LIGATURE SALLA USED AS KORANIC STOP SIGN ISOLATED FORM..ARABIC LIGATURE JALLAJALALOUHOU FDFC;N # Sc RIAL SIGN FDFD..FDFF;N # So [3] ARABIC LIGATURE BISMILLAH AR-RAHMAN AR-RAHEEM..ARABIC LIGATURE AZZA WA JALL FE00..FE0F;A # Mn [16] VARIATION SELECTOR-1..VARIATION SELECTOR-16 FE10..FE16;W # Po [7] PRESENTATION FORM FOR VERTICAL COMMA..PRESENTATION FORM FOR VERTICAL QUESTION MARK FE17;W # Ps PRESENTATION FORM FOR VERTICAL LEFT WHITE LENTICULAR BRACKET FE18;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT WHITE LENTICULAR BRAKCET FE19;W # Po PRESENTATION FORM FOR VERTICAL HORIZONTAL ELLIPSIS FE20..FE2F;N # Mn [16] COMBINING LIGATURE LEFT HALF..COMBINING CYRILLIC TITLO RIGHT HALF FE30;W # Po PRESENTATION FORM FOR VERTICAL TWO DOT LEADER FE31..FE32;W # Pd [2] PRESENTATION FORM FOR VERTICAL EM DASH..PRESENTATION FORM FOR VERTICAL EN DASH FE33..FE34;W # Pc [2] PRESENTATION FORM FOR VERTICAL LOW LINE..PRESENTATION FORM FOR VERTICAL WAVY LOW LINE FE35;W # Ps PRESENTATION FORM FOR VERTICAL LEFT PARENTHESIS FE36;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT PARENTHESIS FE37;W # Ps PRESENTATION FORM FOR VERTICAL LEFT CURLY BRACKET FE38;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT CURLY BRACKET FE39;W # Ps PRESENTATION FORM FOR VERTICAL LEFT TORTOISE SHELL BRACKET FE3A;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT TORTOISE SHELL BRACKET FE3B;W # Ps PRESENTATION FORM FOR VERTICAL LEFT BLACK LENTICULAR BRACKET FE3C;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT BLACK LENTICULAR BRACKET FE3D;W # Ps PRESENTATION FORM FOR VERTICAL LEFT DOUBLE ANGLE BRACKET FE3E;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT DOUBLE ANGLE BRACKET FE3F;W # Ps PRESENTATION FORM FOR VERTICAL LEFT ANGLE BRACKET FE40;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT ANGLE BRACKET FE41;W # Ps PRESENTATION FORM FOR VERTICAL LEFT CORNER BRACKET FE42;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT CORNER BRACKET FE43;W # Ps PRESENTATION FORM FOR VERTICAL LEFT WHITE CORNER BRACKET FE44;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT WHITE CORNER BRACKET FE45..FE46;W # Po [2] SESAME DOT..WHITE SESAME DOT FE47;W # Ps PRESENTATION FORM FOR VERTICAL LEFT SQUARE BRACKET FE48;W # Pe PRESENTATION FORM FOR VERTICAL RIGHT SQUARE BRACKET FE49..FE4C;W # Po [4] DASHED OVERLINE..DOUBLE WAVY OVERLINE FE4D..FE4F;W # Pc [3] DASHED LOW LINE..WAVY LOW LINE FE50..FE52;W # Po [3] SMALL COMMA..SMALL FULL STOP FE54..FE57;W # Po [4] SMALL SEMICOLON..SMALL EXCLAMATION MARK FE58;W # Pd SMALL EM DASH FE59;W # Ps SMALL LEFT PARENTHESIS FE5A;W # Pe SMALL RIGHT PARENTHESIS FE5B;W # Ps SMALL LEFT CURLY BRACKET FE5C;W # Pe SMALL RIGHT CURLY BRACKET FE5D;W # Ps SMALL LEFT TORTOISE SHELL BRACKET FE5E;W # Pe SMALL RIGHT TORTOISE SHELL BRACKET FE5F..FE61;W # Po [3] SMALL NUMBER SIGN..SMALL ASTERISK FE62;W # Sm SMALL PLUS SIGN FE63;W # Pd SMALL HYPHEN-MINUS FE64..FE66;W # Sm [3] SMALL LESS-THAN SIGN..SMALL EQUALS SIGN FE68;W # Po SMALL REVERSE SOLIDUS FE69;W # Sc SMALL DOLLAR SIGN FE6A..FE6B;W # Po [2] SMALL PERCENT SIGN..SMALL COMMERCIAL AT FE70..FE74;N # Lo [5] ARABIC FATHATAN ISOLATED FORM..ARABIC KASRATAN ISOLATED FORM FE76..FEFC;N # Lo [135] ARABIC FATHA ISOLATED FORM..ARABIC LIGATURE LAM WITH ALEF FINAL FORM FEFF;N # Cf ZERO WIDTH NO-BREAK SPACE FF01..FF03;F # Po [3] FULLWIDTH EXCLAMATION MARK..FULLWIDTH NUMBER SIGN FF04;F # Sc FULLWIDTH DOLLAR SIGN FF05..FF07;F # Po [3] FULLWIDTH PERCENT SIGN..FULLWIDTH APOSTROPHE FF08;F # Ps FULLWIDTH LEFT PARENTHESIS FF09;F # Pe FULLWIDTH RIGHT PARENTHESIS FF0A;F # Po FULLWIDTH ASTERISK FF0B;F # Sm FULLWIDTH PLUS SIGN FF0C;F # Po FULLWIDTH COMMA FF0D;F # Pd FULLWIDTH HYPHEN-MINUS FF0E..FF0F;F # Po [2] FULLWIDTH FULL STOP..FULLWIDTH SOLIDUS FF10..FF19;F # Nd [10] FULLWIDTH DIGIT ZERO..FULLWIDTH DIGIT NINE FF1A..FF1B;F # Po [2] FULLWIDTH COLON..FULLWIDTH SEMICOLON FF1C..FF1E;F # Sm [3] FULLWIDTH LESS-THAN SIGN..FULLWIDTH GREATER-THAN SIGN FF1F..FF20;F # Po [2] FULLWIDTH QUESTION MARK..FULLWIDTH COMMERCIAL AT FF21..FF3A;F # Lu [26] FULLWIDTH LATIN CAPITAL LETTER A..FULLWIDTH LATIN CAPITAL LETTER Z FF3B;F # Ps FULLWIDTH LEFT SQUARE BRACKET FF3C;F # Po FULLWIDTH REVERSE SOLIDUS FF3D;F # Pe FULLWIDTH RIGHT SQUARE BRACKET FF3E;F # Sk FULLWIDTH CIRCUMFLEX ACCENT FF3F;F # Pc FULLWIDTH LOW LINE FF40;F # Sk FULLWIDTH GRAVE ACCENT FF41..FF5A;F # Ll [26] FULLWIDTH LATIN SMALL LETTER A..FULLWIDTH LATIN SMALL LETTER Z FF5B;F # Ps FULLWIDTH LEFT CURLY BRACKET FF5C;F # Sm FULLWIDTH VERTICAL LINE FF5D;F # Pe FULLWIDTH RIGHT CURLY BRACKET FF5E;F # Sm FULLWIDTH TILDE FF5F;F # Ps FULLWIDTH LEFT WHITE PARENTHESIS FF60;F # Pe FULLWIDTH RIGHT WHITE PARENTHESIS FF61;H # Po HALFWIDTH IDEOGRAPHIC FULL STOP FF62;H # Ps HALFWIDTH LEFT CORNER BRACKET FF63;H # Pe HALFWIDTH RIGHT CORNER BRACKET FF64..FF65;H # Po [2] HALFWIDTH IDEOGRAPHIC COMMA..HALFWIDTH KATAKANA MIDDLE DOT FF66..FF6F;H # Lo [10] HALFWIDTH KATAKANA LETTER WO..HALFWIDTH KATAKANA LETTER SMALL TU FF70;H # Lm HALFWIDTH KATAKANA-HIRAGANA PROLONGED SOUND MARK FF71..FF9D;H # Lo [45] HALFWIDTH KATAKANA LETTER A..HALFWIDTH KATAKANA LETTER N FF9E..FF9F;H # Lm [2] HALFWIDTH KATAKANA VOICED SOUND MARK..HALFWIDTH KATAKANA SEMI-VOICED SOUND MARK FFA0..FFBE;H # Lo [31] HALFWIDTH HANGUL FILLER..HALFWIDTH HANGUL LETTER HIEUH FFC2..FFC7;H # Lo [6] HALFWIDTH HANGUL LETTER A..HALFWIDTH HANGUL LETTER E FFCA..FFCF;H # Lo [6] HALFWIDTH HANGUL LETTER YEO..HALFWIDTH HANGUL LETTER OE FFD2..FFD7;H # Lo [6] HALFWIDTH HANGUL LETTER YO..HALFWIDTH HANGUL LETTER YU FFDA..FFDC;H # Lo [3] HALFWIDTH HANGUL LETTER EU..HALFWIDTH HANGUL LETTER I FFE0..FFE1;F # Sc [2] FULLWIDTH CENT SIGN..FULLWIDTH POUND SIGN FFE2;F # Sm FULLWIDTH NOT SIGN FFE3;F # Sk FULLWIDTH MACRON FFE4;F # So FULLWIDTH BROKEN BAR FFE5..FFE6;F # Sc [2] FULLWIDTH YEN SIGN..FULLWIDTH WON SIGN FFE8;H # So HALFWIDTH FORMS LIGHT VERTICAL FFE9..FFEC;H # Sm [4] HALFWIDTH LEFTWARDS ARROW..HALFWIDTH DOWNWARDS ARROW FFED..FFEE;H # So [2] HALFWIDTH BLACK SQUARE..HALFWIDTH WHITE CIRCLE FFF9..FFFB;N # Cf [3] INTERLINEAR ANNOTATION ANCHOR..INTERLINEAR ANNOTATION TERMINATOR FFFC;N # So OBJECT REPLACEMENT CHARACTER FFFD;A # So REPLACEMENT CHARACTER 10000..1000B;N # Lo [12] LINEAR B SYLLABLE B008 A..LINEAR B SYLLABLE B046 JE 1000D..10026;N # Lo [26] LINEAR B SYLLABLE B036 JO..LINEAR B SYLLABLE B032 QO 10028..1003A;N # Lo [19] LINEAR B SYLLABLE B060 RA..LINEAR B SYLLABLE B042 WO 1003C..1003D;N # Lo [2] LINEAR B SYLLABLE B017 ZA..LINEAR B SYLLABLE B074 ZE 1003F..1004D;N # Lo [15] LINEAR B SYLLABLE B020 ZO..LINEAR B SYLLABLE B091 TWO 10050..1005D;N # Lo [14] LINEAR B SYMBOL B018..LINEAR B SYMBOL B089 10080..100FA;N # Lo [123] LINEAR B IDEOGRAM B100 MAN..LINEAR B IDEOGRAM VESSEL B305 10100..10102;N # Po [3] AEGEAN WORD SEPARATOR LINE..AEGEAN CHECK MARK 10107..10133;N # No [45] AEGEAN NUMBER ONE..AEGEAN NUMBER NINETY THOUSAND 10137..1013F;N # So [9] AEGEAN WEIGHT BASE UNIT..AEGEAN MEASURE THIRD SUBUNIT 10140..10174;N # Nl [53] GREEK ACROPHONIC ATTIC ONE QUARTER..GREEK ACROPHONIC STRATIAN FIFTY MNAS 10175..10178;N # No [4] GREEK ONE HALF SIGN..GREEK THREE QUARTERS SIGN 10179..10189;N # So [17] GREEK YEAR SIGN..GREEK TRYBLION BASE SIGN 1018A..1018B;N # No [2] GREEK ZERO SIGN..GREEK ONE QUARTER SIGN 1018C..1018E;N # So [3] GREEK SINUSOID SIGN..NOMISMA SIGN 10190..1019C;N # So [13] ROMAN SEXTANS SIGN..ASCIA SYMBOL 101A0;N # So GREEK SYMBOL TAU RHO 101D0..101FC;N # So [45] PHAISTOS DISC SIGN PEDESTRIAN..PHAISTOS DISC SIGN WAVY BAND 101FD;N # Mn PHAISTOS DISC SIGN COMBINING OBLIQUE STROKE 10280..1029C;N # Lo [29] LYCIAN LETTER A..LYCIAN LETTER X 102A0..102D0;N # Lo [49] CARIAN LETTER A..CARIAN LETTER UUU3 102E0;N # Mn COPTIC EPACT THOUSANDS MARK 102E1..102FB;N # No [27] COPTIC EPACT DIGIT ONE..COPTIC EPACT NUMBER NINE HUNDRED 10300..1031F;N # Lo [32] OLD ITALIC LETTER A..OLD ITALIC LETTER ESS 10320..10323;N # No [4] OLD ITALIC NUMERAL ONE..OLD ITALIC NUMERAL FIFTY 1032D..1032F;N # Lo [3] OLD ITALIC LETTER YE..OLD ITALIC LETTER SOUTHERN TSE 10330..10340;N # Lo [17] GOTHIC LETTER AHSA..GOTHIC LETTER PAIRTHRA 10341;N # Nl GOTHIC LETTER NINETY 10342..10349;N # Lo [8] GOTHIC LETTER RAIDA..GOTHIC LETTER OTHAL 1034A;N # Nl GOTHIC LETTER NINE HUNDRED 10350..10375;N # Lo [38] OLD PERMIC LETTER AN..OLD PERMIC LETTER IA 10376..1037A;N # Mn [5] COMBINING OLD PERMIC LETTER AN..COMBINING OLD PERMIC LETTER SII 10380..1039D;N # Lo [30] UGARITIC LETTER ALPA..UGARITIC LETTER SSU 1039F;N # Po UGARITIC WORD DIVIDER 103A0..103C3;N # Lo [36] OLD PERSIAN SIGN A..OLD PERSIAN SIGN HA 103C8..103CF;N # Lo [8] OLD PERSIAN SIGN AURAMAZDAA..OLD PERSIAN SIGN BUUMISH 103D0;N # Po OLD PERSIAN WORD DIVIDER 103D1..103D5;N # Nl [5] OLD PERSIAN NUMBER ONE..OLD PERSIAN NUMBER HUNDRED 10400..1044F;N # L& [80] DESERET CAPITAL LETTER LONG I..DESERET SMALL LETTER EW 10450..1047F;N # Lo [48] SHAVIAN LETTER PEEP..SHAVIAN LETTER YEW 10480..1049D;N # Lo [30] OSMANYA LETTER ALEF..OSMANYA LETTER OO 104A0..104A9;N # Nd [10] OSMANYA DIGIT ZERO..OSMANYA DIGIT NINE 104B0..104D3;N # Lu [36] OSAGE CAPITAL LETTER A..OSAGE CAPITAL LETTER ZHA 104D8..104FB;N # Ll [36] OSAGE SMALL LETTER A..OSAGE SMALL LETTER ZHA 10500..10527;N # Lo [40] ELBASAN LETTER A..ELBASAN LETTER KHE 10530..10563;N # Lo [52] CAUCASIAN ALBANIAN LETTER ALT..CAUCASIAN ALBANIAN LETTER KIW 1056F;N # Po CAUCASIAN ALBANIAN CITATION MARK 10570..1057A;N # Lu [11] VITHKUQI CAPITAL LETTER A..VITHKUQI CAPITAL LETTER GA 1057C..1058A;N # Lu [15] VITHKUQI CAPITAL LETTER HA..VITHKUQI CAPITAL LETTER RE 1058C..10592;N # Lu [7] VITHKUQI CAPITAL LETTER SE..VITHKUQI CAPITAL LETTER XE 10594..10595;N # Lu [2] VITHKUQI CAPITAL LETTER Y..VITHKUQI CAPITAL LETTER ZE 10597..105A1;N # Ll [11] VITHKUQI SMALL LETTER A..VITHKUQI SMALL LETTER GA 105A3..105B1;N # Ll [15] VITHKUQI SMALL LETTER HA..VITHKUQI SMALL LETTER RE 105B3..105B9;N # Ll [7] VITHKUQI SMALL LETTER SE..VITHKUQI SMALL LETTER XE 105BB..105BC;N # Ll [2] VITHKUQI SMALL LETTER Y..VITHKUQI SMALL LETTER ZE 10600..10736;N # Lo [311] LINEAR A SIGN AB001..LINEAR A SIGN A664 10740..10755;N # Lo [22] LINEAR A SIGN A701 A..LINEAR A SIGN A732 JE 10760..10767;N # Lo [8] LINEAR A SIGN A800..LINEAR A SIGN A807 10780..10785;N # Lm [6] MODIFIER LETTER SMALL CAPITAL AA..MODIFIER LETTER SMALL B WITH HOOK 10787..107B0;N # Lm [42] MODIFIER LETTER SMALL DZ DIGRAPH..MODIFIER LETTER SMALL V WITH RIGHT HOOK 107B2..107BA;N # Lm [9] MODIFIER LETTER SMALL CAPITAL Y..MODIFIER LETTER SMALL S WITH CURL 10800..10805;N # Lo [6] CYPRIOT SYLLABLE A..CYPRIOT SYLLABLE JA 10808;N # Lo CYPRIOT SYLLABLE JO 1080A..10835;N # Lo [44] CYPRIOT SYLLABLE KA..CYPRIOT SYLLABLE WO 10837..10838;N # Lo [2] CYPRIOT SYLLABLE XA..CYPRIOT SYLLABLE XE 1083C;N # Lo CYPRIOT SYLLABLE ZA 1083F;N # Lo CYPRIOT SYLLABLE ZO 10840..10855;N # Lo [22] IMPERIAL ARAMAIC LETTER ALEPH..IMPERIAL ARAMAIC LETTER TAW 10857;N # Po IMPERIAL ARAMAIC SECTION SIGN 10858..1085F;N # No [8] IMPERIAL ARAMAIC NUMBER ONE..IMPERIAL ARAMAIC NUMBER TEN THOUSAND 10860..10876;N # Lo [23] PALMYRENE LETTER ALEPH..PALMYRENE LETTER TAW 10877..10878;N # So [2] PALMYRENE LEFT-POINTING FLEURON..PALMYRENE RIGHT-POINTING FLEURON 10879..1087F;N # No [7] PALMYRENE NUMBER ONE..PALMYRENE NUMBER TWENTY 10880..1089E;N # Lo [31] NABATAEAN LETTER FINAL ALEPH..NABATAEAN LETTER TAW 108A7..108AF;N # No [9] NABATAEAN NUMBER ONE..NABATAEAN NUMBER ONE HUNDRED 108E0..108F2;N # Lo [19] HATRAN LETTER ALEPH..HATRAN LETTER QOPH 108F4..108F5;N # Lo [2] HATRAN LETTER SHIN..HATRAN LETTER TAW 108FB..108FF;N # No [5] HATRAN NUMBER ONE..HATRAN NUMBER ONE HUNDRED 10900..10915;N # Lo [22] PHOENICIAN LETTER ALF..PHOENICIAN LETTER TAU 10916..1091B;N # No [6] PHOENICIAN NUMBER ONE..PHOENICIAN NUMBER THREE 1091F;N # Po PHOENICIAN WORD SEPARATOR 10920..10939;N # Lo [26] LYDIAN LETTER A..LYDIAN LETTER C 1093F;N # Po LYDIAN TRIANGULAR MARK 10980..1099F;N # Lo [32] MEROITIC HIEROGLYPHIC LETTER A..MEROITIC HIEROGLYPHIC SYMBOL VIDJ-2 109A0..109B7;N # Lo [24] MEROITIC CURSIVE LETTER A..MEROITIC CURSIVE LETTER DA 109BC..109BD;N # No [2] MEROITIC CURSIVE FRACTION ELEVEN TWELFTHS..MEROITIC CURSIVE FRACTION ONE HALF 109BE..109BF;N # Lo [2] MEROITIC CURSIVE LOGOGRAM RMT..MEROITIC CURSIVE LOGOGRAM IMN 109C0..109CF;N # No [16] MEROITIC CURSIVE NUMBER ONE..MEROITIC CURSIVE NUMBER SEVENTY 109D2..109FF;N # No [46] MEROITIC CURSIVE NUMBER ONE HUNDRED..MEROITIC CURSIVE FRACTION TEN TWELFTHS 10A00;N # Lo KHAROSHTHI LETTER A 10A01..10A03;N # Mn [3] KHAROSHTHI VOWEL SIGN I..KHAROSHTHI VOWEL SIGN VOCALIC R 10A05..10A06;N # Mn [2] KHAROSHTHI VOWEL SIGN E..KHAROSHTHI VOWEL SIGN O 10A0C..10A0F;N # Mn [4] KHAROSHTHI VOWEL LENGTH MARK..KHAROSHTHI SIGN VISARGA 10A10..10A13;N # Lo [4] KHAROSHTHI LETTER KA..KHAROSHTHI LETTER GHA 10A15..10A17;N # Lo [3] KHAROSHTHI LETTER CA..KHAROSHTHI LETTER JA 10A19..10A35;N # Lo [29] KHAROSHTHI LETTER NYA..KHAROSHTHI LETTER VHA 10A38..10A3A;N # Mn [3] KHAROSHTHI SIGN BAR ABOVE..KHAROSHTHI SIGN DOT BELOW 10A3F;N # Mn KHAROSHTHI VIRAMA 10A40..10A48;N # No [9] KHAROSHTHI DIGIT ONE..KHAROSHTHI FRACTION ONE HALF 10A50..10A58;N # Po [9] KHAROSHTHI PUNCTUATION DOT..KHAROSHTHI PUNCTUATION LINES 10A60..10A7C;N # Lo [29] OLD SOUTH ARABIAN LETTER HE..OLD SOUTH ARABIAN LETTER THETH 10A7D..10A7E;N # No [2] OLD SOUTH ARABIAN NUMBER ONE..OLD SOUTH ARABIAN NUMBER FIFTY 10A7F;N # Po OLD SOUTH ARABIAN NUMERIC INDICATOR 10A80..10A9C;N # Lo [29] OLD NORTH ARABIAN LETTER HEH..OLD NORTH ARABIAN LETTER ZAH 10A9D..10A9F;N # No [3] OLD NORTH ARABIAN NUMBER ONE..OLD NORTH ARABIAN NUMBER TWENTY 10AC0..10AC7;N # Lo [8] MANICHAEAN LETTER ALEPH..MANICHAEAN LETTER WAW 10AC8;N # So MANICHAEAN SIGN UD 10AC9..10AE4;N # Lo [28] MANICHAEAN LETTER ZAYIN..MANICHAEAN LETTER TAW 10AE5..10AE6;N # Mn [2] MANICHAEAN ABBREVIATION MARK ABOVE..MANICHAEAN ABBREVIATION MARK BELOW 10AEB..10AEF;N # No [5] MANICHAEAN NUMBER ONE..MANICHAEAN NUMBER ONE HUNDRED 10AF0..10AF6;N # Po [7] MANICHAEAN PUNCTUATION STAR..MANICHAEAN PUNCTUATION LINE FILLER 10B00..10B35;N # Lo [54] AVESTAN LETTER A..AVESTAN LETTER HE 10B39..10B3F;N # Po [7] AVESTAN ABBREVIATION MARK..LARGE ONE RING OVER TWO RINGS PUNCTUATION 10B40..10B55;N # Lo [22] INSCRIPTIONAL PARTHIAN LETTER ALEPH..INSCRIPTIONAL PARTHIAN LETTER TAW 10B58..10B5F;N # No [8] INSCRIPTIONAL PARTHIAN NUMBER ONE..INSCRIPTIONAL PARTHIAN NUMBER ONE THOUSAND 10B60..10B72;N # Lo [19] INSCRIPTIONAL PAHLAVI LETTER ALEPH..INSCRIPTIONAL PAHLAVI LETTER TAW 10B78..10B7F;N # No [8] INSCRIPTIONAL PAHLAVI NUMBER ONE..INSCRIPTIONAL PAHLAVI NUMBER ONE THOUSAND 10B80..10B91;N # Lo [18] PSALTER PAHLAVI LETTER ALEPH..PSALTER PAHLAVI LETTER TAW 10B99..10B9C;N # Po [4] PSALTER PAHLAVI SECTION MARK..PSALTER PAHLAVI FOUR DOTS WITH DOT 10BA9..10BAF;N # No [7] PSALTER PAHLAVI NUMBER ONE..PSALTER PAHLAVI NUMBER ONE HUNDRED 10C00..10C48;N # Lo [73] OLD TURKIC LETTER ORKHON A..OLD TURKIC LETTER ORKHON BASH 10C80..10CB2;N # Lu [51] OLD HUNGARIAN CAPITAL LETTER A..OLD HUNGARIAN CAPITAL LETTER US 10CC0..10CF2;N # Ll [51] OLD HUNGARIAN SMALL LETTER A..OLD HUNGARIAN SMALL LETTER US 10CFA..10CFF;N # No [6] OLD HUNGARIAN NUMBER ONE..OLD HUNGARIAN NUMBER ONE THOUSAND 10D00..10D23;N # Lo [36] HANIFI ROHINGYA LETTER A..HANIFI ROHINGYA MARK NA KHONNA 10D24..10D27;N # Mn [4] HANIFI ROHINGYA SIGN HARBAHAY..HANIFI ROHINGYA SIGN TASSI 10D30..10D39;N # Nd [10] HANIFI ROHINGYA DIGIT ZERO..HANIFI ROHINGYA DIGIT NINE 10E60..10E7E;N # No [31] RUMI DIGIT ONE..RUMI FRACTION TWO THIRDS 10E80..10EA9;N # Lo [42] YEZIDI LETTER ELIF..YEZIDI LETTER ET 10EAB..10EAC;N # Mn [2] YEZIDI COMBINING HAMZA MARK..YEZIDI COMBINING MADDA MARK 10EAD;N # Pd YEZIDI HYPHENATION MARK 10EB0..10EB1;N # Lo [2] YEZIDI LETTER LAM WITH DOT ABOVE..YEZIDI LETTER YOT WITH CIRCUMFLEX ABOVE 10EFD..10EFF;N # Mn [3] ARABIC SMALL LOW WORD SAKTA..ARABIC SMALL LOW WORD MADDA 10F00..10F1C;N # Lo [29] OLD SOGDIAN LETTER ALEPH..OLD SOGDIAN LETTER FINAL TAW WITH VERTICAL TAIL 10F1D..10F26;N # No [10] OLD SOGDIAN NUMBER ONE..OLD SOGDIAN FRACTION ONE HALF 10F27;N # Lo OLD SOGDIAN LIGATURE AYIN-DALETH 10F30..10F45;N # Lo [22] SOGDIAN LETTER ALEPH..SOGDIAN INDEPENDENT SHIN 10F46..10F50;N # Mn [11] SOGDIAN COMBINING DOT BELOW..SOGDIAN COMBINING STROKE BELOW 10F51..10F54;N # No [4] SOGDIAN NUMBER ONE..SOGDIAN NUMBER ONE HUNDRED 10F55..10F59;N # Po [5] SOGDIAN PUNCTUATION TWO VERTICAL BARS..SOGDIAN PUNCTUATION HALF CIRCLE WITH DOT 10F70..10F81;N # Lo [18] OLD UYGHUR LETTER ALEPH..OLD UYGHUR LETTER LESH 10F82..10F85;N # Mn [4] OLD UYGHUR COMBINING DOT ABOVE..OLD UYGHUR COMBINING TWO DOTS BELOW 10F86..10F89;N # Po [4] OLD UYGHUR PUNCTUATION BAR..OLD UYGHUR PUNCTUATION FOUR DOTS 10FB0..10FC4;N # Lo [21] CHORASMIAN LETTER ALEPH..CHORASMIAN LETTER TAW 10FC5..10FCB;N # No [7] CHORASMIAN NUMBER ONE..CHORASMIAN NUMBER ONE HUNDRED 10FE0..10FF6;N # Lo [23] ELYMAIC LETTER ALEPH..ELYMAIC LIGATURE ZAYIN-YODH 11000;N # Mc BRAHMI SIGN CANDRABINDU 11001;N # Mn BRAHMI SIGN ANUSVARA 11002;N # Mc BRAHMI SIGN VISARGA 11003..11037;N # Lo [53] BRAHMI SIGN JIHVAMULIYA..BRAHMI LETTER OLD TAMIL NNNA 11038..11046;N # Mn [15] BRAHMI VOWEL SIGN AA..BRAHMI VIRAMA 11047..1104D;N # Po [7] BRAHMI DANDA..BRAHMI PUNCTUATION LOTUS 11052..11065;N # No [20] BRAHMI NUMBER ONE..BRAHMI NUMBER ONE THOUSAND 11066..1106F;N # Nd [10] BRAHMI DIGIT ZERO..BRAHMI DIGIT NINE 11070;N # Mn BRAHMI SIGN OLD TAMIL VIRAMA 11071..11072;N # Lo [2] BRAHMI LETTER OLD TAMIL SHORT E..BRAHMI LETTER OLD TAMIL SHORT O 11073..11074;N # Mn [2] BRAHMI VOWEL SIGN OLD TAMIL SHORT E..BRAHMI VOWEL SIGN OLD TAMIL SHORT O 11075;N # Lo BRAHMI LETTER OLD TAMIL LLA 1107F;N # Mn BRAHMI NUMBER JOINER 11080..11081;N # Mn [2] KAITHI SIGN CANDRABINDU..KAITHI SIGN ANUSVARA 11082;N # Mc KAITHI SIGN VISARGA 11083..110AF;N # Lo [45] KAITHI LETTER A..KAITHI LETTER HA 110B0..110B2;N # Mc [3] KAITHI VOWEL SIGN AA..KAITHI VOWEL SIGN II 110B3..110B6;N # Mn [4] KAITHI VOWEL SIGN U..KAITHI VOWEL SIGN AI 110B7..110B8;N # Mc [2] KAITHI VOWEL SIGN O..KAITHI VOWEL SIGN AU 110B9..110BA;N # Mn [2] KAITHI SIGN VIRAMA..KAITHI SIGN NUKTA 110BB..110BC;N # Po [2] KAITHI ABBREVIATION SIGN..KAITHI ENUMERATION SIGN 110BD;N # Cf KAITHI NUMBER SIGN 110BE..110C1;N # Po [4] KAITHI SECTION MARK..KAITHI DOUBLE DANDA 110C2;N # Mn KAITHI VOWEL SIGN VOCALIC R 110CD;N # Cf KAITHI NUMBER SIGN ABOVE 110D0..110E8;N # Lo [25] SORA SOMPENG LETTER SAH..SORA SOMPENG LETTER MAE 110F0..110F9;N # Nd [10] SORA SOMPENG DIGIT ZERO..SORA SOMPENG DIGIT NINE 11100..11102;N # Mn [3] CHAKMA SIGN CANDRABINDU..CHAKMA SIGN VISARGA 11103..11126;N # Lo [36] CHAKMA LETTER AA..CHAKMA LETTER HAA 11127..1112B;N # Mn [5] CHAKMA VOWEL SIGN A..CHAKMA VOWEL SIGN UU 1112C;N # Mc CHAKMA VOWEL SIGN E 1112D..11134;N # Mn [8] CHAKMA VOWEL SIGN AI..CHAKMA MAAYYAA 11136..1113F;N # Nd [10] CHAKMA DIGIT ZERO..CHAKMA DIGIT NINE 11140..11143;N # Po [4] CHAKMA SECTION MARK..CHAKMA QUESTION MARK 11144;N # Lo CHAKMA LETTER LHAA 11145..11146;N # Mc [2] CHAKMA VOWEL SIGN AA..CHAKMA VOWEL SIGN EI 11147;N # Lo CHAKMA LETTER VAA 11150..11172;N # Lo [35] MAHAJANI LETTER A..MAHAJANI LETTER RRA 11173;N # Mn MAHAJANI SIGN NUKTA 11174..11175;N # Po [2] MAHAJANI ABBREVIATION SIGN..MAHAJANI SECTION MARK 11176;N # Lo MAHAJANI LIGATURE SHRI 11180..11181;N # Mn [2] SHARADA SIGN CANDRABINDU..SHARADA SIGN ANUSVARA 11182;N # Mc SHARADA SIGN VISARGA 11183..111B2;N # Lo [48] SHARADA LETTER A..SHARADA LETTER HA 111B3..111B5;N # Mc [3] SHARADA VOWEL SIGN AA..SHARADA VOWEL SIGN II 111B6..111BE;N # Mn [9] SHARADA VOWEL SIGN U..SHARADA VOWEL SIGN O 111BF..111C0;N # Mc [2] SHARADA VOWEL SIGN AU..SHARADA SIGN VIRAMA 111C1..111C4;N # Lo [4] SHARADA SIGN AVAGRAHA..SHARADA OM 111C5..111C8;N # Po [4] SHARADA DANDA..SHARADA SEPARATOR 111C9..111CC;N # Mn [4] SHARADA SANDHI MARK..SHARADA EXTRA SHORT VOWEL MARK 111CD;N # Po SHARADA SUTRA MARK 111CE;N # Mc SHARADA VOWEL SIGN PRISHTHAMATRA E 111CF;N # Mn SHARADA SIGN INVERTED CANDRABINDU 111D0..111D9;N # Nd [10] SHARADA DIGIT ZERO..SHARADA DIGIT NINE 111DA;N # Lo SHARADA EKAM 111DB;N # Po SHARADA SIGN SIDDHAM 111DC;N # Lo SHARADA HEADSTROKE 111DD..111DF;N # Po [3] SHARADA CONTINUATION SIGN..SHARADA SECTION MARK-2 111E1..111F4;N # No [20] SINHALA ARCHAIC DIGIT ONE..SINHALA ARCHAIC NUMBER ONE THOUSAND 11200..11211;N # Lo [18] KHOJKI LETTER A..KHOJKI LETTER JJA 11213..1122B;N # Lo [25] KHOJKI LETTER NYA..KHOJKI LETTER LLA 1122C..1122E;N # Mc [3] KHOJKI VOWEL SIGN AA..KHOJKI VOWEL SIGN II 1122F..11231;N # Mn [3] KHOJKI VOWEL SIGN U..KHOJKI VOWEL SIGN AI 11232..11233;N # Mc [2] KHOJKI VOWEL SIGN O..KHOJKI VOWEL SIGN AU 11234;N # Mn KHOJKI SIGN ANUSVARA 11235;N # Mc KHOJKI SIGN VIRAMA 11236..11237;N # Mn [2] KHOJKI SIGN NUKTA..KHOJKI SIGN SHADDA 11238..1123D;N # Po [6] KHOJKI DANDA..KHOJKI ABBREVIATION SIGN 1123E;N # Mn KHOJKI SIGN SUKUN 1123F..11240;N # Lo [2] KHOJKI LETTER QA..KHOJKI LETTER SHORT I 11241;N # Mn KHOJKI VOWEL SIGN VOCALIC R 11280..11286;N # Lo [7] MULTANI LETTER A..MULTANI LETTER GA 11288;N # Lo MULTANI LETTER GHA 1128A..1128D;N # Lo [4] MULTANI LETTER CA..MULTANI LETTER JJA 1128F..1129D;N # Lo [15] MULTANI LETTER NYA..MULTANI LETTER BA 1129F..112A8;N # Lo [10] MULTANI LETTER BHA..MULTANI LETTER RHA 112A9;N # Po MULTANI SECTION MARK 112B0..112DE;N # Lo [47] KHUDAWADI LETTER A..KHUDAWADI LETTER HA 112DF;N # Mn KHUDAWADI SIGN ANUSVARA 112E0..112E2;N # Mc [3] KHUDAWADI VOWEL SIGN AA..KHUDAWADI VOWEL SIGN II 112E3..112EA;N # Mn [8] KHUDAWADI VOWEL SIGN U..KHUDAWADI SIGN VIRAMA 112F0..112F9;N # Nd [10] KHUDAWADI DIGIT ZERO..KHUDAWADI DIGIT NINE 11300..11301;N # Mn [2] GRANTHA SIGN COMBINING ANUSVARA ABOVE..GRANTHA SIGN CANDRABINDU 11302..11303;N # Mc [2] GRANTHA SIGN ANUSVARA..GRANTHA SIGN VISARGA 11305..1130C;N # Lo [8] GRANTHA LETTER A..GRANTHA LETTER VOCALIC L 1130F..11310;N # Lo [2] GRANTHA LETTER EE..GRANTHA LETTER AI 11313..11328;N # Lo [22] GRANTHA LETTER OO..GRANTHA LETTER NA 1132A..11330;N # Lo [7] GRANTHA LETTER PA..GRANTHA LETTER RA 11332..11333;N # Lo [2] GRANTHA LETTER LA..GRANTHA LETTER LLA 11335..11339;N # Lo [5] GRANTHA LETTER VA..GRANTHA LETTER HA 1133B..1133C;N # Mn [2] COMBINING BINDU BELOW..GRANTHA SIGN NUKTA 1133D;N # Lo GRANTHA SIGN AVAGRAHA 1133E..1133F;N # Mc [2] GRANTHA VOWEL SIGN AA..GRANTHA VOWEL SIGN I 11340;N # Mn GRANTHA VOWEL SIGN II 11341..11344;N # Mc [4] GRANTHA VOWEL SIGN U..GRANTHA VOWEL SIGN VOCALIC RR 11347..11348;N # Mc [2] GRANTHA VOWEL SIGN EE..GRANTHA VOWEL SIGN AI 1134B..1134D;N # Mc [3] GRANTHA VOWEL SIGN OO..GRANTHA SIGN VIRAMA 11350;N # Lo GRANTHA OM 11357;N # Mc GRANTHA AU LENGTH MARK 1135D..11361;N # Lo [5] GRANTHA SIGN PLUTA..GRANTHA LETTER VOCALIC LL 11362..11363;N # Mc [2] GRANTHA VOWEL SIGN VOCALIC L..GRANTHA VOWEL SIGN VOCALIC LL 11366..1136C;N # Mn [7] COMBINING GRANTHA DIGIT ZERO..COMBINING GRANTHA DIGIT SIX 11370..11374;N # Mn [5] COMBINING GRANTHA LETTER A..COMBINING GRANTHA LETTER PA 11400..11434;N # Lo [53] NEWA LETTER A..NEWA LETTER HA 11435..11437;N # Mc [3] NEWA VOWEL SIGN AA..NEWA VOWEL SIGN II 11438..1143F;N # Mn [8] NEWA VOWEL SIGN U..NEWA VOWEL SIGN AI 11440..11441;N # Mc [2] NEWA VOWEL SIGN O..NEWA VOWEL SIGN AU 11442..11444;N # Mn [3] NEWA SIGN VIRAMA..NEWA SIGN ANUSVARA 11445;N # Mc NEWA SIGN VISARGA 11446;N # Mn NEWA SIGN NUKTA 11447..1144A;N # Lo [4] NEWA SIGN AVAGRAHA..NEWA SIDDHI 1144B..1144F;N # Po [5] NEWA DANDA..NEWA ABBREVIATION SIGN 11450..11459;N # Nd [10] NEWA DIGIT ZERO..NEWA DIGIT NINE 1145A..1145B;N # Po [2] NEWA DOUBLE COMMA..NEWA PLACEHOLDER MARK 1145D;N # Po NEWA INSERTION SIGN 1145E;N # Mn NEWA SANDHI MARK 1145F..11461;N # Lo [3] NEWA LETTER VEDIC ANUSVARA..NEWA SIGN UPADHMANIYA 11480..114AF;N # Lo [48] TIRHUTA ANJI..TIRHUTA LETTER HA 114B0..114B2;N # Mc [3] TIRHUTA VOWEL SIGN AA..TIRHUTA VOWEL SIGN II 114B3..114B8;N # Mn [6] TIRHUTA VOWEL SIGN U..TIRHUTA VOWEL SIGN VOCALIC LL 114B9;N # Mc TIRHUTA VOWEL SIGN E 114BA;N # Mn TIRHUTA VOWEL SIGN SHORT E 114BB..114BE;N # Mc [4] TIRHUTA VOWEL SIGN AI..TIRHUTA VOWEL SIGN AU 114BF..114C0;N # Mn [2] TIRHUTA SIGN CANDRABINDU..TIRHUTA SIGN ANUSVARA 114C1;N # Mc TIRHUTA SIGN VISARGA 114C2..114C3;N # Mn [2] TIRHUTA SIGN VIRAMA..TIRHUTA SIGN NUKTA 114C4..114C5;N # Lo [2] TIRHUTA SIGN AVAGRAHA..TIRHUTA GVANG 114C6;N # Po TIRHUTA ABBREVIATION SIGN 114C7;N # Lo TIRHUTA OM 114D0..114D9;N # Nd [10] TIRHUTA DIGIT ZERO..TIRHUTA DIGIT NINE 11580..115AE;N # Lo [47] SIDDHAM LETTER A..SIDDHAM LETTER HA 115AF..115B1;N # Mc [3] SIDDHAM VOWEL SIGN AA..SIDDHAM VOWEL SIGN II 115B2..115B5;N # Mn [4] SIDDHAM VOWEL SIGN U..SIDDHAM VOWEL SIGN VOCALIC RR 115B8..115BB;N # Mc [4] SIDDHAM VOWEL SIGN E..SIDDHAM VOWEL SIGN AU 115BC..115BD;N # Mn [2] SIDDHAM SIGN CANDRABINDU..SIDDHAM SIGN ANUSVARA 115BE;N # Mc SIDDHAM SIGN VISARGA 115BF..115C0;N # Mn [2] SIDDHAM SIGN VIRAMA..SIDDHAM SIGN NUKTA 115C1..115D7;N # Po [23] SIDDHAM SIGN SIDDHAM..SIDDHAM SECTION MARK WITH CIRCLES AND FOUR ENCLOSURES 115D8..115DB;N # Lo [4] SIDDHAM LETTER THREE-CIRCLE ALTERNATE I..SIDDHAM LETTER ALTERNATE U 115DC..115DD;N # Mn [2] SIDDHAM VOWEL SIGN ALTERNATE U..SIDDHAM VOWEL SIGN ALTERNATE UU 11600..1162F;N # Lo [48] MODI LETTER A..MODI LETTER LLA 11630..11632;N # Mc [3] MODI VOWEL SIGN AA..MODI VOWEL SIGN II 11633..1163A;N # Mn [8] MODI VOWEL SIGN U..MODI VOWEL SIGN AI 1163B..1163C;N # Mc [2] MODI VOWEL SIGN O..MODI VOWEL SIGN AU 1163D;N # Mn MODI SIGN ANUSVARA 1163E;N # Mc MODI SIGN VISARGA 1163F..11640;N # Mn [2] MODI SIGN VIRAMA..MODI SIGN ARDHACANDRA 11641..11643;N # Po [3] MODI DANDA..MODI ABBREVIATION SIGN 11644;N # Lo MODI SIGN HUVA 11650..11659;N # Nd [10] MODI DIGIT ZERO..MODI DIGIT NINE 11660..1166C;N # Po [13] MONGOLIAN BIRGA WITH ORNAMENT..MONGOLIAN TURNED SWIRL BIRGA WITH DOUBLE ORNAMENT 11680..116AA;N # Lo [43] TAKRI LETTER A..TAKRI LETTER RRA 116AB;N # Mn TAKRI SIGN ANUSVARA 116AC;N # Mc TAKRI SIGN VISARGA 116AD;N # Mn TAKRI VOWEL SIGN AA 116AE..116AF;N # Mc [2] TAKRI VOWEL SIGN I..TAKRI VOWEL SIGN II 116B0..116B5;N # Mn [6] TAKRI VOWEL SIGN U..TAKRI VOWEL SIGN AU 116B6;N # Mc TAKRI SIGN VIRAMA 116B7;N # Mn TAKRI SIGN NUKTA 116B8;N # Lo TAKRI LETTER ARCHAIC KHA 116B9;N # Po TAKRI ABBREVIATION SIGN 116C0..116C9;N # Nd [10] TAKRI DIGIT ZERO..TAKRI DIGIT NINE 11700..1171A;N # Lo [27] AHOM LETTER KA..AHOM LETTER ALTERNATE BA 1171D..1171F;N # Mn [3] AHOM CONSONANT SIGN MEDIAL LA..AHOM CONSONANT SIGN MEDIAL LIGATING RA 11720..11721;N # Mc [2] AHOM VOWEL SIGN A..AHOM VOWEL SIGN AA 11722..11725;N # Mn [4] AHOM VOWEL SIGN I..AHOM VOWEL SIGN UU 11726;N # Mc AHOM VOWEL SIGN E 11727..1172B;N # Mn [5] AHOM VOWEL SIGN AW..AHOM SIGN KILLER 11730..11739;N # Nd [10] AHOM DIGIT ZERO..AHOM DIGIT NINE 1173A..1173B;N # No [2] AHOM NUMBER TEN..AHOM NUMBER TWENTY 1173C..1173E;N # Po [3] AHOM SIGN SMALL SECTION..AHOM SIGN RULAI 1173F;N # So AHOM SYMBOL VI 11740..11746;N # Lo [7] AHOM LETTER CA..AHOM LETTER LLA 11800..1182B;N # Lo [44] DOGRA LETTER A..DOGRA LETTER RRA 1182C..1182E;N # Mc [3] DOGRA VOWEL SIGN AA..DOGRA VOWEL SIGN II 1182F..11837;N # Mn [9] DOGRA VOWEL SIGN U..DOGRA SIGN ANUSVARA 11838;N # Mc DOGRA SIGN VISARGA 11839..1183A;N # Mn [2] DOGRA SIGN VIRAMA..DOGRA SIGN NUKTA 1183B;N # Po DOGRA ABBREVIATION SIGN 118A0..118DF;N # L& [64] WARANG CITI CAPITAL LETTER NGAA..WARANG CITI SMALL LETTER VIYO 118E0..118E9;N # Nd [10] WARANG CITI DIGIT ZERO..WARANG CITI DIGIT NINE 118EA..118F2;N # No [9] WARANG CITI NUMBER TEN..WARANG CITI NUMBER NINETY 118FF;N # Lo WARANG CITI OM 11900..11906;N # Lo [7] DIVES AKURU LETTER A..DIVES AKURU LETTER E 11909;N # Lo DIVES AKURU LETTER O 1190C..11913;N # Lo [8] DIVES AKURU LETTER KA..DIVES AKURU LETTER JA 11915..11916;N # Lo [2] DIVES AKURU LETTER NYA..DIVES AKURU LETTER TTA 11918..1192F;N # Lo [24] DIVES AKURU LETTER DDA..DIVES AKURU LETTER ZA 11930..11935;N # Mc [6] DIVES AKURU VOWEL SIGN AA..DIVES AKURU VOWEL SIGN E 11937..11938;N # Mc [2] DIVES AKURU VOWEL SIGN AI..DIVES AKURU VOWEL SIGN O 1193B..1193C;N # Mn [2] DIVES AKURU SIGN ANUSVARA..DIVES AKURU SIGN CANDRABINDU 1193D;N # Mc DIVES AKURU SIGN HALANTA 1193E;N # Mn DIVES AKURU VIRAMA 1193F;N # Lo DIVES AKURU PREFIXED NASAL SIGN 11940;N # Mc DIVES AKURU MEDIAL YA 11941;N # Lo DIVES AKURU INITIAL RA 11942;N # Mc DIVES AKURU MEDIAL RA 11943;N # Mn DIVES AKURU SIGN NUKTA 11944..11946;N # Po [3] DIVES AKURU DOUBLE DANDA..DIVES AKURU END OF TEXT MARK 11950..11959;N # Nd [10] DIVES AKURU DIGIT ZERO..DIVES AKURU DIGIT NINE 119A0..119A7;N # Lo [8] NANDINAGARI LETTER A..NANDINAGARI LETTER VOCALIC RR 119AA..119D0;N # Lo [39] NANDINAGARI LETTER E..NANDINAGARI LETTER RRA 119D1..119D3;N # Mc [3] NANDINAGARI VOWEL SIGN AA..NANDINAGARI VOWEL SIGN II 119D4..119D7;N # Mn [4] NANDINAGARI VOWEL SIGN U..NANDINAGARI VOWEL SIGN VOCALIC RR 119DA..119DB;N # Mn [2] NANDINAGARI VOWEL SIGN E..NANDINAGARI VOWEL SIGN AI 119DC..119DF;N # Mc [4] NANDINAGARI VOWEL SIGN O..NANDINAGARI SIGN VISARGA 119E0;N # Mn NANDINAGARI SIGN VIRAMA 119E1;N # Lo NANDINAGARI SIGN AVAGRAHA 119E2;N # Po NANDINAGARI SIGN SIDDHAM 119E3;N # Lo NANDINAGARI HEADSTROKE 119E4;N # Mc NANDINAGARI VOWEL SIGN PRISHTHAMATRA E 11A00;N # Lo ZANABAZAR SQUARE LETTER A 11A01..11A0A;N # Mn [10] ZANABAZAR SQUARE VOWEL SIGN I..ZANABAZAR SQUARE VOWEL LENGTH MARK 11A0B..11A32;N # Lo [40] ZANABAZAR SQUARE LETTER KA..ZANABAZAR SQUARE LETTER KSSA 11A33..11A38;N # Mn [6] ZANABAZAR SQUARE FINAL CONSONANT MARK..ZANABAZAR SQUARE SIGN ANUSVARA 11A39;N # Mc ZANABAZAR SQUARE SIGN VISARGA 11A3A;N # Lo ZANABAZAR SQUARE CLUSTER-INITIAL LETTER RA 11A3B..11A3E;N # Mn [4] ZANABAZAR SQUARE CLUSTER-FINAL LETTER YA..ZANABAZAR SQUARE CLUSTER-FINAL LETTER VA 11A3F..11A46;N # Po [8] ZANABAZAR SQUARE INITIAL HEAD MARK..ZANABAZAR SQUARE CLOSING DOUBLE-LINED HEAD MARK 11A47;N # Mn ZANABAZAR SQUARE SUBJOINER 11A50;N # Lo SOYOMBO LETTER A 11A51..11A56;N # Mn [6] SOYOMBO VOWEL SIGN I..SOYOMBO VOWEL SIGN OE 11A57..11A58;N # Mc [2] SOYOMBO VOWEL SIGN AI..SOYOMBO VOWEL SIGN AU 11A59..11A5B;N # Mn [3] SOYOMBO VOWEL SIGN VOCALIC R..SOYOMBO VOWEL LENGTH MARK 11A5C..11A89;N # Lo [46] SOYOMBO LETTER KA..SOYOMBO CLUSTER-INITIAL LETTER SA 11A8A..11A96;N # Mn [13] SOYOMBO FINAL CONSONANT SIGN G..SOYOMBO SIGN ANUSVARA 11A97;N # Mc SOYOMBO SIGN VISARGA 11A98..11A99;N # Mn [2] SOYOMBO GEMINATION MARK..SOYOMBO SUBJOINER 11A9A..11A9C;N # Po [3] SOYOMBO MARK TSHEG..SOYOMBO MARK DOUBLE SHAD 11A9D;N # Lo SOYOMBO MARK PLUTA 11A9E..11AA2;N # Po [5] SOYOMBO HEAD MARK WITH MOON AND SUN AND TRIPLE FLAME..SOYOMBO TERMINAL MARK-2 11AB0..11ABF;N # Lo [16] CANADIAN SYLLABICS NATTILIK HI..CANADIAN SYLLABICS SPA 11AC0..11AF8;N # Lo [57] PAU CIN HAU LETTER PA..PAU CIN HAU GLOTTAL STOP FINAL 11B00..11B09;N # Po [10] DEVANAGARI HEAD MARK..DEVANAGARI SIGN MINDU 11C00..11C08;N # Lo [9] BHAIKSUKI LETTER A..BHAIKSUKI LETTER VOCALIC L 11C0A..11C2E;N # Lo [37] BHAIKSUKI LETTER E..BHAIKSUKI LETTER HA 11C2F;N # Mc BHAIKSUKI VOWEL SIGN AA 11C30..11C36;N # Mn [7] BHAIKSUKI VOWEL SIGN I..BHAIKSUKI VOWEL SIGN VOCALIC L 11C38..11C3D;N # Mn [6] BHAIKSUKI VOWEL SIGN E..BHAIKSUKI SIGN ANUSVARA 11C3E;N # Mc BHAIKSUKI SIGN VISARGA 11C3F;N # Mn BHAIKSUKI SIGN VIRAMA 11C40;N # Lo BHAIKSUKI SIGN AVAGRAHA 11C41..11C45;N # Po [5] BHAIKSUKI DANDA..BHAIKSUKI GAP FILLER-2 11C50..11C59;N # Nd [10] BHAIKSUKI DIGIT ZERO..BHAIKSUKI DIGIT NINE 11C5A..11C6C;N # No [19] BHAIKSUKI NUMBER ONE..BHAIKSUKI HUNDREDS UNIT MARK 11C70..11C71;N # Po [2] MARCHEN HEAD MARK..MARCHEN MARK SHAD 11C72..11C8F;N # Lo [30] MARCHEN LETTER KA..MARCHEN LETTER A 11C92..11CA7;N # Mn [22] MARCHEN SUBJOINED LETTER KA..MARCHEN SUBJOINED LETTER ZA 11CA9;N # Mc MARCHEN SUBJOINED LETTER YA 11CAA..11CB0;N # Mn [7] MARCHEN SUBJOINED LETTER RA..MARCHEN VOWEL SIGN AA 11CB1;N # Mc MARCHEN VOWEL SIGN I 11CB2..11CB3;N # Mn [2] MARCHEN VOWEL SIGN U..MARCHEN VOWEL SIGN E 11CB4;N # Mc MARCHEN VOWEL SIGN O 11CB5..11CB6;N # Mn [2] MARCHEN SIGN ANUSVARA..MARCHEN SIGN CANDRABINDU 11D00..11D06;N # Lo [7] MASARAM GONDI LETTER A..MASARAM GONDI LETTER E 11D08..11D09;N # Lo [2] MASARAM GONDI LETTER AI..MASARAM GONDI LETTER O 11D0B..11D30;N # Lo [38] MASARAM GONDI LETTER AU..MASARAM GONDI LETTER TRA 11D31..11D36;N # Mn [6] MASARAM GONDI VOWEL SIGN AA..MASARAM GONDI VOWEL SIGN VOCALIC R 11D3A;N # Mn MASARAM GONDI VOWEL SIGN E 11D3C..11D3D;N # Mn [2] MASARAM GONDI VOWEL SIGN AI..MASARAM GONDI VOWEL SIGN O 11D3F..11D45;N # Mn [7] MASARAM GONDI VOWEL SIGN AU..MASARAM GONDI VIRAMA 11D46;N # Lo MASARAM GONDI REPHA 11D47;N # Mn MASARAM GONDI RA-KARA 11D50..11D59;N # Nd [10] MASARAM GONDI DIGIT ZERO..MASARAM GONDI DIGIT NINE 11D60..11D65;N # Lo [6] GUNJALA GONDI LETTER A..GUNJALA GONDI LETTER UU 11D67..11D68;N # Lo [2] GUNJALA GONDI LETTER EE..GUNJALA GONDI LETTER AI 11D6A..11D89;N # Lo [32] GUNJALA GONDI LETTER OO..GUNJALA GONDI LETTER SA 11D8A..11D8E;N # Mc [5] GUNJALA GONDI VOWEL SIGN AA..GUNJALA GONDI VOWEL SIGN UU 11D90..11D91;N # Mn [2] GUNJALA GONDI VOWEL SIGN EE..GUNJALA GONDI VOWEL SIGN AI 11D93..11D94;N # Mc [2] GUNJALA GONDI VOWEL SIGN OO..GUNJALA GONDI VOWEL SIGN AU 11D95;N # Mn GUNJALA GONDI SIGN ANUSVARA 11D96;N # Mc GUNJALA GONDI SIGN VISARGA 11D97;N # Mn GUNJALA GONDI VIRAMA 11D98;N # Lo GUNJALA GONDI OM 11DA0..11DA9;N # Nd [10] GUNJALA GONDI DIGIT ZERO..GUNJALA GONDI DIGIT NINE 11EE0..11EF2;N # Lo [19] MAKASAR LETTER KA..MAKASAR ANGKA 11EF3..11EF4;N # Mn [2] MAKASAR VOWEL SIGN I..MAKASAR VOWEL SIGN U 11EF5..11EF6;N # Mc [2] MAKASAR VOWEL SIGN E..MAKASAR VOWEL SIGN O 11EF7..11EF8;N # Po [2] MAKASAR PASSIMBANG..MAKASAR END OF SECTION 11F00..11F01;N # Mn [2] KAWI SIGN CANDRABINDU..KAWI SIGN ANUSVARA 11F02;N # Lo KAWI SIGN REPHA 11F03;N # Mc KAWI SIGN VISARGA 11F04..11F10;N # Lo [13] KAWI LETTER A..KAWI LETTER O 11F12..11F33;N # Lo [34] KAWI LETTER KA..KAWI LETTER JNYA 11F34..11F35;N # Mc [2] KAWI VOWEL SIGN AA..KAWI VOWEL SIGN ALTERNATE AA 11F36..11F3A;N # Mn [5] KAWI VOWEL SIGN I..KAWI VOWEL SIGN VOCALIC R 11F3E..11F3F;N # Mc [2] KAWI VOWEL SIGN E..KAWI VOWEL SIGN AI 11F40;N # Mn KAWI VOWEL SIGN EU 11F41;N # Mc KAWI SIGN KILLER 11F42;N # Mn KAWI CONJOINER 11F43..11F4F;N # Po [13] KAWI DANDA..KAWI PUNCTUATION CLOSING SPIRAL 11F50..11F59;N # Nd [10] KAWI DIGIT ZERO..KAWI DIGIT NINE 11FB0;N # Lo LISU LETTER YHA 11FC0..11FD4;N # No [21] TAMIL FRACTION ONE THREE-HUNDRED-AND-TWENTIETH..TAMIL FRACTION DOWNSCALING FACTOR KIIZH 11FD5..11FDC;N # So [8] TAMIL SIGN NEL..TAMIL SIGN MUKKURUNI 11FDD..11FE0;N # Sc [4] TAMIL SIGN KAACU..TAMIL SIGN VARAAKAN 11FE1..11FF1;N # So [17] TAMIL SIGN PAARAM..TAMIL SIGN VAKAIYARAA 11FFF;N # Po TAMIL PUNCTUATION END OF TEXT 12000..12399;N # Lo [922] CUNEIFORM SIGN A..CUNEIFORM SIGN U U 12400..1246E;N # Nl [111] CUNEIFORM NUMERIC SIGN TWO ASH..CUNEIFORM NUMERIC SIGN NINE U VARIANT FORM 12470..12474;N # Po [5] CUNEIFORM PUNCTUATION SIGN OLD ASSYRIAN WORD DIVIDER..CUNEIFORM PUNCTUATION SIGN DIAGONAL QUADCOLON 12480..12543;N # Lo [196] CUNEIFORM SIGN AB TIMES NUN TENU..CUNEIFORM SIGN ZU5 TIMES THREE DISH TENU 12F90..12FF0;N # Lo [97] CYPRO-MINOAN SIGN CM001..CYPRO-MINOAN SIGN CM114 12FF1..12FF2;N # Po [2] CYPRO-MINOAN SIGN CM301..CYPRO-MINOAN SIGN CM302 13000..1342F;N # Lo [1072] EGYPTIAN HIEROGLYPH A001..EGYPTIAN HIEROGLYPH V011D 13430..13440;N # Cf [17] EGYPTIAN HIEROGLYPH VERTICAL JOINER..EGYPTIAN HIEROGLYPH MIRROR HORIZONTALLY 13441..13446;N # Lo [6] EGYPTIAN HIEROGLYPH FULL BLANK..EGYPTIAN HIEROGLYPH WIDE LOST SIGN 13447..13455;N # Mn [15] EGYPTIAN HIEROGLYPH MODIFIER DAMAGED AT TOP START..EGYPTIAN HIEROGLYPH MODIFIER DAMAGED 14400..14646;N # Lo [583] ANATOLIAN HIEROGLYPH A001..ANATOLIAN HIEROGLYPH A530 16800..16A38;N # Lo [569] BAMUM LETTER PHASE-A NGKUE MFON..BAMUM LETTER PHASE-F VUEQ 16A40..16A5E;N # Lo [31] MRO LETTER TA..MRO LETTER TEK 16A60..16A69;N # Nd [10] MRO DIGIT ZERO..MRO DIGIT NINE 16A6E..16A6F;N # Po [2] MRO DANDA..MRO DOUBLE DANDA 16A70..16ABE;N # Lo [79] TANGSA LETTER OZ..TANGSA LETTER ZA 16AC0..16AC9;N # Nd [10] TANGSA DIGIT ZERO..TANGSA DIGIT NINE 16AD0..16AED;N # Lo [30] BASSA VAH LETTER ENNI..BASSA VAH LETTER I 16AF0..16AF4;N # Mn [5] BASSA VAH COMBINING HIGH TONE..BASSA VAH COMBINING HIGH-LOW TONE 16AF5;N # Po BASSA VAH FULL STOP 16B00..16B2F;N # Lo [48] PAHAWH HMONG VOWEL KEEB..PAHAWH HMONG CONSONANT CAU 16B30..16B36;N # Mn [7] PAHAWH HMONG MARK CIM TUB..PAHAWH HMONG MARK CIM TAUM 16B37..16B3B;N # Po [5] PAHAWH HMONG SIGN VOS THOM..PAHAWH HMONG SIGN VOS FEEM 16B3C..16B3F;N # So [4] PAHAWH HMONG SIGN XYEEM NTXIV..PAHAWH HMONG SIGN XYEEM FAIB 16B40..16B43;N # Lm [4] PAHAWH HMONG SIGN VOS SEEV..PAHAWH HMONG SIGN IB YAM 16B44;N # Po PAHAWH HMONG SIGN XAUS 16B45;N # So PAHAWH HMONG SIGN CIM TSOV ROG 16B50..16B59;N # Nd [10] PAHAWH HMONG DIGIT ZERO..PAHAWH HMONG DIGIT NINE 16B5B..16B61;N # No [7] PAHAWH HMONG NUMBER TENS..PAHAWH HMONG NUMBER TRILLIONS 16B63..16B77;N # Lo [21] PAHAWH HMONG SIGN VOS LUB..PAHAWH HMONG SIGN CIM NRES TOS 16B7D..16B8F;N # Lo [19] PAHAWH HMONG CLAN SIGN TSHEEJ..PAHAWH HMONG CLAN SIGN VWJ 16E40..16E7F;N # L& [64] MEDEFAIDRIN CAPITAL LETTER M..MEDEFAIDRIN SMALL LETTER Y 16E80..16E96;N # No [23] MEDEFAIDRIN DIGIT ZERO..MEDEFAIDRIN DIGIT THREE ALTERNATE FORM 16E97..16E9A;N # Po [4] MEDEFAIDRIN COMMA..MEDEFAIDRIN EXCLAMATION OH 16F00..16F4A;N # Lo [75] MIAO LETTER PA..MIAO LETTER RTE 16F4F;N # Mn MIAO SIGN CONSONANT MODIFIER BAR 16F50;N # Lo MIAO LETTER NASALIZATION 16F51..16F87;N # Mc [55] MIAO SIGN ASPIRATION..MIAO VOWEL SIGN UI 16F8F..16F92;N # Mn [4] MIAO TONE RIGHT..MIAO TONE BELOW 16F93..16F9F;N # Lm [13] MIAO LETTER TONE-2..MIAO LETTER REFORMED TONE-8 16FE0..16FE1;W # Lm [2] TANGUT ITERATION MARK..NUSHU ITERATION MARK 16FE2;W # Po OLD CHINESE HOOK MARK 16FE3;W # Lm OLD CHINESE ITERATION MARK 16FE4;W # Mn KHITAN SMALL SCRIPT FILLER 16FF0..16FF1;W # Mc [2] VIETNAMESE ALTERNATE READING MARK CA..VIETNAMESE ALTERNATE READING MARK NHAY 17000..187F7;W # Lo [6136] TANGUT IDEOGRAPH-17000..TANGUT IDEOGRAPH-187F7 18800..18AFF;W # Lo [768] TANGUT COMPONENT-001..TANGUT COMPONENT-768 18B00..18CD5;W # Lo [470] KHITAN SMALL SCRIPT CHARACTER-18B00..KHITAN SMALL SCRIPT CHARACTER-18CD5 18D00..18D08;W # Lo [9] TANGUT IDEOGRAPH-18D00..TANGUT IDEOGRAPH-18D08 1AFF0..1AFF3;W # Lm [4] KATAKANA LETTER MINNAN TONE-2..KATAKANA LETTER MINNAN TONE-5 1AFF5..1AFFB;W # Lm [7] KATAKANA LETTER MINNAN TONE-7..KATAKANA LETTER MINNAN NASALIZED TONE-5 1AFFD..1AFFE;W # Lm [2] KATAKANA LETTER MINNAN NASALIZED TONE-7..KATAKANA LETTER MINNAN NASALIZED TONE-8 1B000..1B0FF;W # Lo [256] KATAKANA LETTER ARCHAIC E..HENTAIGANA LETTER RE-2 1B100..1B122;W # Lo [35] HENTAIGANA LETTER RE-3..KATAKANA LETTER ARCHAIC WU 1B132;W # Lo HIRAGANA LETTER SMALL KO 1B150..1B152;W # Lo [3] HIRAGANA LETTER SMALL WI..HIRAGANA LETTER SMALL WO 1B155;W # Lo KATAKANA LETTER SMALL KO 1B164..1B167;W # Lo [4] KATAKANA LETTER SMALL WI..KATAKANA LETTER SMALL N 1B170..1B2FB;W # Lo [396] NUSHU CHARACTER-1B170..NUSHU CHARACTER-1B2FB 1BC00..1BC6A;N # Lo [107] DUPLOYAN LETTER H..DUPLOYAN LETTER VOCALIC M 1BC70..1BC7C;N # Lo [13] DUPLOYAN AFFIX LEFT HORIZONTAL SECANT..DUPLOYAN AFFIX ATTACHED TANGENT HOOK 1BC80..1BC88;N # Lo [9] DUPLOYAN AFFIX HIGH ACUTE..DUPLOYAN AFFIX HIGH VERTICAL 1BC90..1BC99;N # Lo [10] DUPLOYAN AFFIX LOW ACUTE..DUPLOYAN AFFIX LOW ARROW 1BC9C;N # So DUPLOYAN SIGN O WITH CROSS 1BC9D..1BC9E;N # Mn [2] DUPLOYAN THICK LETTER SELECTOR..DUPLOYAN DOUBLE MARK 1BC9F;N # Po DUPLOYAN PUNCTUATION CHINOOK FULL STOP 1BCA0..1BCA3;N # Cf [4] SHORTHAND FORMAT LETTER OVERLAP..SHORTHAND FORMAT UP STEP 1CF00..1CF2D;N # Mn [46] ZNAMENNY COMBINING MARK GORAZDO NIZKO S KRYZHEM ON LEFT..ZNAMENNY COMBINING MARK KRYZH ON LEFT 1CF30..1CF46;N # Mn [23] ZNAMENNY COMBINING TONAL RANGE MARK MRACHNO..ZNAMENNY PRIZNAK MODIFIER ROG 1CF50..1CFC3;N # So [116] ZNAMENNY NEUME KRYUK..ZNAMENNY NEUME PAUK 1D000..1D0F5;N # So [246] BYZANTINE MUSICAL SYMBOL PSILI..BYZANTINE MUSICAL SYMBOL GORGON NEO KATO 1D100..1D126;N # So [39] MUSICAL SYMBOL SINGLE BARLINE..MUSICAL SYMBOL DRUM CLEF-2 1D129..1D164;N # So [60] MUSICAL SYMBOL MULTIPLE MEASURE REST..MUSICAL SYMBOL ONE HUNDRED TWENTY-EIGHTH NOTE 1D165..1D166;N # Mc [2] MUSICAL SYMBOL COMBINING STEM..MUSICAL SYMBOL COMBINING SPRECHGESANG STEM 1D167..1D169;N # Mn [3] MUSICAL SYMBOL COMBINING TREMOLO-1..MUSICAL SYMBOL COMBINING TREMOLO-3 1D16A..1D16C;N # So [3] MUSICAL SYMBOL FINGERED TREMOLO-1..MUSICAL SYMBOL FINGERED TREMOLO-3 1D16D..1D172;N # Mc [6] MUSICAL SYMBOL COMBINING AUGMENTATION DOT..MUSICAL SYMBOL COMBINING FLAG-5 1D173..1D17A;N # Cf [8] MUSICAL SYMBOL BEGIN BEAM..MUSICAL SYMBOL END PHRASE 1D17B..1D182;N # Mn [8] MUSICAL SYMBOL COMBINING ACCENT..MUSICAL SYMBOL COMBINING LOURE 1D183..1D184;N # So [2] MUSICAL SYMBOL ARPEGGIATO UP..MUSICAL SYMBOL ARPEGGIATO DOWN 1D185..1D18B;N # Mn [7] MUSICAL SYMBOL COMBINING DOIT..MUSICAL SYMBOL COMBINING TRIPLE TONGUE 1D18C..1D1A9;N # So [30] MUSICAL SYMBOL RINFORZANDO..MUSICAL SYMBOL DEGREE SLASH 1D1AA..1D1AD;N # Mn [4] MUSICAL SYMBOL COMBINING DOWN BOW..MUSICAL SYMBOL COMBINING SNAP PIZZICATO 1D1AE..1D1EA;N # So [61] MUSICAL SYMBOL PEDAL MARK..MUSICAL SYMBOL KORON 1D200..1D241;N # So [66] GREEK VOCAL NOTATION SYMBOL-1..GREEK INSTRUMENTAL NOTATION SYMBOL-54 1D242..1D244;N # Mn [3] COMBINING GREEK MUSICAL TRISEME..COMBINING GREEK MUSICAL PENTASEME 1D245;N # So GREEK MUSICAL LEIMMA 1D2C0..1D2D3;N # No [20] KAKTOVIK NUMERAL ZERO..KAKTOVIK NUMERAL NINETEEN 1D2E0..1D2F3;N # No [20] MAYAN NUMERAL ZERO..MAYAN NUMERAL NINETEEN 1D300..1D356;N # So [87] MONOGRAM FOR EARTH..TETRAGRAM FOR FOSTERING 1D360..1D378;N # No [25] COUNTING ROD UNIT DIGIT ONE..TALLY MARK FIVE 1D400..1D454;N # L& [85] MATHEMATICAL BOLD CAPITAL A..MATHEMATICAL ITALIC SMALL G 1D456..1D49C;N # L& [71] MATHEMATICAL ITALIC SMALL I..MATHEMATICAL SCRIPT CAPITAL A 1D49E..1D49F;N # Lu [2] MATHEMATICAL SCRIPT CAPITAL C..MATHEMATICAL SCRIPT CAPITAL D 1D4A2;N # Lu MATHEMATICAL SCRIPT CAPITAL G 1D4A5..1D4A6;N # Lu [2] MATHEMATICAL SCRIPT CAPITAL J..MATHEMATICAL SCRIPT CAPITAL K 1D4A9..1D4AC;N # Lu [4] MATHEMATICAL SCRIPT CAPITAL N..MATHEMATICAL SCRIPT CAPITAL Q 1D4AE..1D4B9;N # L& [12] MATHEMATICAL SCRIPT CAPITAL S..MATHEMATICAL SCRIPT SMALL D 1D4BB;N # Ll MATHEMATICAL SCRIPT SMALL F 1D4BD..1D4C3;N # Ll [7] MATHEMATICAL SCRIPT SMALL H..MATHEMATICAL SCRIPT SMALL N 1D4C5..1D505;N # L& [65] MATHEMATICAL SCRIPT SMALL P..MATHEMATICAL FRAKTUR CAPITAL B 1D507..1D50A;N # Lu [4] MATHEMATICAL FRAKTUR CAPITAL D..MATHEMATICAL FRAKTUR CAPITAL G 1D50D..1D514;N # Lu [8] MATHEMATICAL FRAKTUR CAPITAL J..MATHEMATICAL FRAKTUR CAPITAL Q 1D516..1D51C;N # Lu [7] MATHEMATICAL FRAKTUR CAPITAL S..MATHEMATICAL FRAKTUR CAPITAL Y 1D51E..1D539;N # L& [28] MATHEMATICAL FRAKTUR SMALL A..MATHEMATICAL DOUBLE-STRUCK CAPITAL B 1D53B..1D53E;N # Lu [4] MATHEMATICAL DOUBLE-STRUCK CAPITAL D..MATHEMATICAL DOUBLE-STRUCK CAPITAL G 1D540..1D544;N # Lu [5] MATHEMATICAL DOUBLE-STRUCK CAPITAL I..MATHEMATICAL DOUBLE-STRUCK CAPITAL M 1D546;N # Lu MATHEMATICAL DOUBLE-STRUCK CAPITAL O 1D54A..1D550;N # Lu [7] MATHEMATICAL DOUBLE-STRUCK CAPITAL S..MATHEMATICAL DOUBLE-STRUCK CAPITAL Y 1D552..1D6A5;N # L& [340] MATHEMATICAL DOUBLE-STRUCK SMALL A..MATHEMATICAL ITALIC SMALL DOTLESS J 1D6A8..1D6C0;N # Lu [25] MATHEMATICAL BOLD CAPITAL ALPHA..MATHEMATICAL BOLD CAPITAL OMEGA 1D6C1;N # Sm MATHEMATICAL BOLD NABLA 1D6C2..1D6DA;N # Ll [25] MATHEMATICAL BOLD SMALL ALPHA..MATHEMATICAL BOLD SMALL OMEGA 1D6DB;N # Sm MATHEMATICAL BOLD PARTIAL DIFFERENTIAL 1D6DC..1D6FA;N # L& [31] MATHEMATICAL BOLD EPSILON SYMBOL..MATHEMATICAL ITALIC CAPITAL OMEGA 1D6FB;N # Sm MATHEMATICAL ITALIC NABLA 1D6FC..1D714;N # Ll [25] MATHEMATICAL ITALIC SMALL ALPHA..MATHEMATICAL ITALIC SMALL OMEGA 1D715;N # Sm MATHEMATICAL ITALIC PARTIAL DIFFERENTIAL 1D716..1D734;N # L& [31] MATHEMATICAL ITALIC EPSILON SYMBOL..MATHEMATICAL BOLD ITALIC CAPITAL OMEGA 1D735;N # Sm MATHEMATICAL BOLD ITALIC NABLA 1D736..1D74E;N # Ll [25] MATHEMATICAL BOLD ITALIC SMALL ALPHA..MATHEMATICAL BOLD ITALIC SMALL OMEGA 1D74F;N # Sm MATHEMATICAL BOLD ITALIC PARTIAL DIFFERENTIAL 1D750..1D76E;N # L& [31] MATHEMATICAL BOLD ITALIC EPSILON SYMBOL..MATHEMATICAL SANS-SERIF BOLD CAPITAL OMEGA 1D76F;N # Sm MATHEMATICAL SANS-SERIF BOLD NABLA 1D770..1D788;N # Ll [25] MATHEMATICAL SANS-SERIF BOLD SMALL ALPHA..MATHEMATICAL SANS-SERIF BOLD SMALL OMEGA 1D789;N # Sm MATHEMATICAL SANS-SERIF BOLD PARTIAL DIFFERENTIAL 1D78A..1D7A8;N # L& [31] MATHEMATICAL SANS-SERIF BOLD EPSILON SYMBOL..MATHEMATICAL SANS-SERIF BOLD ITALIC CAPITAL OMEGA 1D7A9;N # Sm MATHEMATICAL SANS-SERIF BOLD ITALIC NABLA 1D7AA..1D7C2;N # Ll [25] MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL ALPHA..MATHEMATICAL SANS-SERIF BOLD ITALIC SMALL OMEGA 1D7C3;N # Sm MATHEMATICAL SANS-SERIF BOLD ITALIC PARTIAL DIFFERENTIAL 1D7C4..1D7CB;N # L& [8] MATHEMATICAL SANS-SERIF BOLD ITALIC EPSILON SYMBOL..MATHEMATICAL BOLD SMALL DIGAMMA 1D7CE..1D7FF;N # Nd [50] MATHEMATICAL BOLD DIGIT ZERO..MATHEMATICAL MONOSPACE DIGIT NINE 1D800..1D9FF;N # So [512] SIGNWRITING HAND-FIST INDEX..SIGNWRITING HEAD 1DA00..1DA36;N # Mn [55] SIGNWRITING HEAD RIM..SIGNWRITING AIR SUCKING IN 1DA37..1DA3A;N # So [4] SIGNWRITING AIR BLOW SMALL ROTATIONS..SIGNWRITING BREATH EXHALE 1DA3B..1DA6C;N # Mn [50] SIGNWRITING MOUTH CLOSED NEUTRAL..SIGNWRITING EXCITEMENT 1DA6D..1DA74;N # So [8] SIGNWRITING SHOULDER HIP SPINE..SIGNWRITING TORSO-FLOORPLANE TWISTING 1DA75;N # Mn SIGNWRITING UPPER BODY TILTING FROM HIP JOINTS 1DA76..1DA83;N # So [14] SIGNWRITING LIMB COMBINATION..SIGNWRITING LOCATION DEPTH 1DA84;N # Mn SIGNWRITING LOCATION HEAD NECK 1DA85..1DA86;N # So [2] SIGNWRITING LOCATION TORSO..SIGNWRITING LOCATION LIMBS DIGITS 1DA87..1DA8B;N # Po [5] SIGNWRITING COMMA..SIGNWRITING PARENTHESIS 1DA9B..1DA9F;N # Mn [5] SIGNWRITING FILL MODIFIER-2..SIGNWRITING FILL MODIFIER-6 1DAA1..1DAAF;N # Mn [15] SIGNWRITING ROTATION MODIFIER-2..SIGNWRITING ROTATION MODIFIER-16 1DF00..1DF09;N # Ll [10] LATIN SMALL LETTER FENG DIGRAPH WITH TRILL..LATIN SMALL LETTER T WITH HOOK AND RETROFLEX HOOK 1DF0A;N # Lo LATIN LETTER RETROFLEX CLICK WITH RETROFLEX HOOK 1DF0B..1DF1E;N # Ll [20] LATIN SMALL LETTER ESH WITH DOUBLE BAR..LATIN SMALL LETTER S WITH CURL 1DF25..1DF2A;N # Ll [6] LATIN SMALL LETTER D WITH MID-HEIGHT LEFT HOOK..LATIN SMALL LETTER T WITH MID-HEIGHT LEFT HOOK 1E000..1E006;N # Mn [7] COMBINING GLAGOLITIC LETTER AZU..COMBINING GLAGOLITIC LETTER ZHIVETE 1E008..1E018;N # Mn [17] COMBINING GLAGOLITIC LETTER ZEMLJA..COMBINING GLAGOLITIC LETTER HERU 1E01B..1E021;N # Mn [7] COMBINING GLAGOLITIC LETTER SHTA..COMBINING GLAGOLITIC LETTER YATI 1E023..1E024;N # Mn [2] COMBINING GLAGOLITIC LETTER YU..COMBINING GLAGOLITIC LETTER SMALL YUS 1E026..1E02A;N # Mn [5] COMBINING GLAGOLITIC LETTER YO..COMBINING GLAGOLITIC LETTER FITA 1E030..1E06D;N # Lm [62] MODIFIER LETTER CYRILLIC SMALL A..MODIFIER LETTER CYRILLIC SMALL STRAIGHT U WITH STROKE 1E08F;N # Mn COMBINING CYRILLIC SMALL LETTER BYELORUSSIAN-UKRAINIAN I 1E100..1E12C;N # Lo [45] NYIAKENG PUACHUE HMONG LETTER MA..NYIAKENG PUACHUE HMONG LETTER W 1E130..1E136;N # Mn [7] NYIAKENG PUACHUE HMONG TONE-B..NYIAKENG PUACHUE HMONG TONE-D 1E137..1E13D;N # Lm [7] NYIAKENG PUACHUE HMONG SIGN FOR PERSON..NYIAKENG PUACHUE HMONG SYLLABLE LENGTHENER 1E140..1E149;N # Nd [10] NYIAKENG PUACHUE HMONG DIGIT ZERO..NYIAKENG PUACHUE HMONG DIGIT NINE 1E14E;N # Lo NYIAKENG PUACHUE HMONG LOGOGRAM NYAJ 1E14F;N # So NYIAKENG PUACHUE HMONG CIRCLED CA 1E290..1E2AD;N # Lo [30] TOTO LETTER PA..TOTO LETTER A 1E2AE;N # Mn TOTO SIGN RISING TONE 1E2C0..1E2EB;N # Lo [44] WANCHO LETTER AA..WANCHO LETTER YIH 1E2EC..1E2EF;N # Mn [4] WANCHO TONE TUP..WANCHO TONE KOINI 1E2F0..1E2F9;N # Nd [10] WANCHO DIGIT ZERO..WANCHO DIGIT NINE 1E2FF;N # Sc WANCHO NGUN SIGN 1E4D0..1E4EA;N # Lo [27] NAG MUNDARI LETTER O..NAG MUNDARI LETTER ELL 1E4EB;N # Lm NAG MUNDARI SIGN OJOD 1E4EC..1E4EF;N # Mn [4] NAG MUNDARI SIGN MUHOR..NAG MUNDARI SIGN SUTUH 1E4F0..1E4F9;N # Nd [10] NAG MUNDARI DIGIT ZERO..NAG MUNDARI DIGIT NINE 1E7E0..1E7E6;N # Lo [7] ETHIOPIC SYLLABLE HHYA..ETHIOPIC SYLLABLE HHYO 1E7E8..1E7EB;N # Lo [4] ETHIOPIC SYLLABLE GURAGE HHWA..ETHIOPIC SYLLABLE HHWE 1E7ED..1E7EE;N # Lo [2] ETHIOPIC SYLLABLE GURAGE MWI..ETHIOPIC SYLLABLE GURAGE MWEE 1E7F0..1E7FE;N # Lo [15] ETHIOPIC SYLLABLE GURAGE QWI..ETHIOPIC SYLLABLE GURAGE PWEE 1E800..1E8C4;N # Lo [197] MENDE KIKAKUI SYLLABLE M001 KI..MENDE KIKAKUI SYLLABLE M060 NYON 1E8C7..1E8CF;N # No [9] MENDE KIKAKUI DIGIT ONE..MENDE KIKAKUI DIGIT NINE 1E8D0..1E8D6;N # Mn [7] MENDE KIKAKUI COMBINING NUMBER TEENS..MENDE KIKAKUI COMBINING NUMBER MILLIONS 1E900..1E943;N # L& [68] ADLAM CAPITAL LETTER ALIF..ADLAM SMALL LETTER SHA 1E944..1E94A;N # Mn [7] ADLAM ALIF LENGTHENER..ADLAM NUKTA 1E94B;N # Lm ADLAM NASALIZATION MARK 1E950..1E959;N # Nd [10] ADLAM DIGIT ZERO..ADLAM DIGIT NINE 1E95E..1E95F;N # Po [2] ADLAM INITIAL EXCLAMATION MARK..ADLAM INITIAL QUESTION MARK 1EC71..1ECAB;N # No [59] INDIC SIYAQ NUMBER ONE..INDIC SIYAQ NUMBER PREFIXED NINE 1ECAC;N # So INDIC SIYAQ PLACEHOLDER 1ECAD..1ECAF;N # No [3] INDIC SIYAQ FRACTION ONE QUARTER..INDIC SIYAQ FRACTION THREE QUARTERS 1ECB0;N # Sc INDIC SIYAQ RUPEE MARK 1ECB1..1ECB4;N # No [4] INDIC SIYAQ NUMBER ALTERNATE ONE..INDIC SIYAQ ALTERNATE LAKH MARK 1ED01..1ED2D;N # No [45] OTTOMAN SIYAQ NUMBER ONE..OTTOMAN SIYAQ NUMBER NINETY THOUSAND 1ED2E;N # So OTTOMAN SIYAQ MARRATAN 1ED2F..1ED3D;N # No [15] OTTOMAN SIYAQ ALTERNATE NUMBER TWO..OTTOMAN SIYAQ FRACTION ONE SIXTH 1EE00..1EE03;N # Lo [4] ARABIC MATHEMATICAL ALEF..ARABIC MATHEMATICAL DAL 1EE05..1EE1F;N # Lo [27] ARABIC MATHEMATICAL WAW..ARABIC MATHEMATICAL DOTLESS QAF 1EE21..1EE22;N # Lo [2] ARABIC MATHEMATICAL INITIAL BEH..ARABIC MATHEMATICAL INITIAL JEEM 1EE24;N # Lo ARABIC MATHEMATICAL INITIAL HEH 1EE27;N # Lo ARABIC MATHEMATICAL INITIAL HAH 1EE29..1EE32;N # Lo [10] ARABIC MATHEMATICAL INITIAL YEH..ARABIC MATHEMATICAL INITIAL QAF 1EE34..1EE37;N # Lo [4] ARABIC MATHEMATICAL INITIAL SHEEN..ARABIC MATHEMATICAL INITIAL KHAH 1EE39;N # Lo ARABIC MATHEMATICAL INITIAL DAD 1EE3B;N # Lo ARABIC MATHEMATICAL INITIAL GHAIN 1EE42;N # Lo ARABIC MATHEMATICAL TAILED JEEM 1EE47;N # Lo ARABIC MATHEMATICAL TAILED HAH 1EE49;N # Lo ARABIC MATHEMATICAL TAILED YEH 1EE4B;N # Lo ARABIC MATHEMATICAL TAILED LAM 1EE4D..1EE4F;N # Lo [3] ARABIC MATHEMATICAL TAILED NOON..ARABIC MATHEMATICAL TAILED AIN 1EE51..1EE52;N # Lo [2] ARABIC MATHEMATICAL TAILED SAD..ARABIC MATHEMATICAL TAILED QAF 1EE54;N # Lo ARABIC MATHEMATICAL TAILED SHEEN 1EE57;N # Lo ARABIC MATHEMATICAL TAILED KHAH 1EE59;N # Lo ARABIC MATHEMATICAL TAILED DAD 1EE5B;N # Lo ARABIC MATHEMATICAL TAILED GHAIN 1EE5D;N # Lo ARABIC MATHEMATICAL TAILED DOTLESS NOON 1EE5F;N # Lo ARABIC MATHEMATICAL TAILED DOTLESS QAF 1EE61..1EE62;N # Lo [2] ARABIC MATHEMATICAL STRETCHED BEH..ARABIC MATHEMATICAL STRETCHED JEEM 1EE64;N # Lo ARABIC MATHEMATICAL STRETCHED HEH 1EE67..1EE6A;N # Lo [4] ARABIC MATHEMATICAL STRETCHED HAH..ARABIC MATHEMATICAL STRETCHED KAF 1EE6C..1EE72;N # Lo [7] ARABIC MATHEMATICAL STRETCHED MEEM..ARABIC MATHEMATICAL STRETCHED QAF 1EE74..1EE77;N # Lo [4] ARABIC MATHEMATICAL STRETCHED SHEEN..ARABIC MATHEMATICAL STRETCHED KHAH 1EE79..1EE7C;N # Lo [4] ARABIC MATHEMATICAL STRETCHED DAD..ARABIC MATHEMATICAL STRETCHED DOTLESS BEH 1EE7E;N # Lo ARABIC MATHEMATICAL STRETCHED DOTLESS FEH 1EE80..1EE89;N # Lo [10] ARABIC MATHEMATICAL LOOPED ALEF..ARABIC MATHEMATICAL LOOPED YEH 1EE8B..1EE9B;N # Lo [17] ARABIC MATHEMATICAL LOOPED LAM..ARABIC MATHEMATICAL LOOPED GHAIN 1EEA1..1EEA3;N # Lo [3] ARABIC MATHEMATICAL DOUBLE-STRUCK BEH..ARABIC MATHEMATICAL DOUBLE-STRUCK DAL 1EEA5..1EEA9;N # Lo [5] ARABIC MATHEMATICAL DOUBLE-STRUCK WAW..ARABIC MATHEMATICAL DOUBLE-STRUCK YEH 1EEAB..1EEBB;N # Lo [17] ARABIC MATHEMATICAL DOUBLE-STRUCK LAM..ARABIC MATHEMATICAL DOUBLE-STRUCK GHAIN 1EEF0..1EEF1;N # Sm [2] ARABIC MATHEMATICAL OPERATOR MEEM WITH HAH WITH TATWEEL..ARABIC MATHEMATICAL OPERATOR HAH WITH DAL 1F000..1F003;N # So [4] MAHJONG TILE EAST WIND..MAHJONG TILE NORTH WIND 1F004;W # So MAHJONG TILE RED DRAGON 1F005..1F02B;N # So [39] MAHJONG TILE GREEN DRAGON..MAHJONG TILE BACK 1F030..1F093;N # So [100] DOMINO TILE HORIZONTAL BACK..DOMINO TILE VERTICAL-06-06 1F0A0..1F0AE;N # So [15] PLAYING CARD BACK..PLAYING CARD KING OF SPADES 1F0B1..1F0BF;N # So [15] PLAYING CARD ACE OF HEARTS..PLAYING CARD RED JOKER 1F0C1..1F0CE;N # So [14] PLAYING CARD ACE OF DIAMONDS..PLAYING CARD KING OF DIAMONDS 1F0CF;W # So PLAYING CARD BLACK JOKER 1F0D1..1F0F5;N # So [37] PLAYING CARD ACE OF CLUBS..PLAYING CARD TRUMP-21 1F100..1F10A;A # No [11] DIGIT ZERO FULL STOP..DIGIT NINE COMMA 1F10B..1F10C;N # No [2] DINGBAT CIRCLED SANS-SERIF DIGIT ZERO..DINGBAT NEGATIVE CIRCLED SANS-SERIF DIGIT ZERO 1F10D..1F10F;N # So [3] CIRCLED ZERO WITH SLASH..CIRCLED DOLLAR SIGN WITH OVERLAID BACKSLASH 1F110..1F12D;A # So [30] PARENTHESIZED LATIN CAPITAL LETTER A..CIRCLED CD 1F12E..1F12F;N # So [2] CIRCLED WZ..COPYLEFT SYMBOL 1F130..1F169;A # So [58] SQUARED LATIN CAPITAL LETTER A..NEGATIVE CIRCLED LATIN CAPITAL LETTER Z 1F16A..1F16F;N # So [6] RAISED MC SIGN..CIRCLED HUMAN FIGURE 1F170..1F18D;A # So [30] NEGATIVE SQUARED LATIN CAPITAL LETTER A..NEGATIVE SQUARED SA 1F18E;W # So NEGATIVE SQUARED AB 1F18F..1F190;A # So [2] NEGATIVE SQUARED WC..SQUARE DJ 1F191..1F19A;W # So [10] SQUARED CL..SQUARED VS 1F19B..1F1AC;A # So [18] SQUARED THREE D..SQUARED VOD 1F1AD;N # So MASK WORK SYMBOL 1F1E6..1F1FF;N # So [26] REGIONAL INDICATOR SYMBOL LETTER A..REGIONAL INDICATOR SYMBOL LETTER Z 1F200..1F202;W # So [3] SQUARE HIRAGANA HOKA..SQUARED KATAKANA SA 1F210..1F23B;W # So [44] SQUARED CJK UNIFIED IDEOGRAPH-624B..SQUARED CJK UNIFIED IDEOGRAPH-914D 1F240..1F248;W # So [9] TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-672C..TORTOISE SHELL BRACKETED CJK UNIFIED IDEOGRAPH-6557 1F250..1F251;W # So [2] CIRCLED IDEOGRAPH ADVANTAGE..CIRCLED IDEOGRAPH ACCEPT 1F260..1F265;W # So [6] ROUNDED SYMBOL FOR FU..ROUNDED SYMBOL FOR CAI 1F300..1F320;W # So [33] CYCLONE..SHOOTING STAR 1F321..1F32C;N # So [12] THERMOMETER..WIND BLOWING FACE 1F32D..1F335;W # So [9] HOT DOG..CACTUS 1F336;N # So HOT PEPPER 1F337..1F37C;W # So [70] TULIP..BABY BOTTLE 1F37D;N # So FORK AND KNIFE WITH PLATE 1F37E..1F393;W # So [22] BOTTLE WITH POPPING CORK..GRADUATION CAP 1F394..1F39F;N # So [12] HEART WITH TIP ON THE LEFT..ADMISSION TICKETS 1F3A0..1F3CA;W # So [43] CAROUSEL HORSE..SWIMMER 1F3CB..1F3CE;N # So [4] WEIGHT LIFTER..RACING CAR 1F3CF..1F3D3;W # So [5] CRICKET BAT AND BALL..TABLE TENNIS PADDLE AND BALL 1F3D4..1F3DF;N # So [12] SNOW CAPPED MOUNTAIN..STADIUM 1F3E0..1F3F0;W # So [17] HOUSE BUILDING..EUROPEAN CASTLE 1F3F1..1F3F3;N # So [3] WHITE PENNANT..WAVING WHITE FLAG 1F3F4;W # So WAVING BLACK FLAG 1F3F5..1F3F7;N # So [3] ROSETTE..LABEL 1F3F8..1F3FA;W # So [3] BADMINTON RACQUET AND SHUTTLECOCK..AMPHORA 1F3FB..1F3FF;W # Sk [5] EMOJI MODIFIER FITZPATRICK TYPE-1-2..EMOJI MODIFIER FITZPATRICK TYPE-6 1F400..1F43E;W # So [63] RAT..PAW PRINTS 1F43F;N # So CHIPMUNK 1F440;W # So EYES 1F441;N # So EYE 1F442..1F4FC;W # So [187] EAR..VIDEOCASSETTE 1F4FD..1F4FE;N # So [2] FILM PROJECTOR..PORTABLE STEREO 1F4FF..1F53D;W # So [63] PRAYER BEADS..DOWN-POINTING SMALL RED TRIANGLE 1F53E..1F54A;N # So [13] LOWER RIGHT SHADOWED WHITE CIRCLE..DOVE OF PEACE 1F54B..1F54E;W # So [4] KAABA..MENORAH WITH NINE BRANCHES 1F54F;N # So BOWL OF HYGIEIA 1F550..1F567;W # So [24] CLOCK FACE ONE OCLOCK..CLOCK FACE TWELVE-THIRTY 1F568..1F579;N # So [18] RIGHT SPEAKER..JOYSTICK 1F57A;W # So MAN DANCING 1F57B..1F594;N # So [26] LEFT HAND TELEPHONE RECEIVER..REVERSED VICTORY HAND 1F595..1F596;W # So [2] REVERSED HAND WITH MIDDLE FINGER EXTENDED..RAISED HAND WITH PART BETWEEN MIDDLE AND RING FINGERS 1F597..1F5A3;N # So [13] WHITE DOWN POINTING LEFT HAND INDEX..BLACK DOWN POINTING BACKHAND INDEX 1F5A4;W # So BLACK HEART 1F5A5..1F5FA;N # So [86] DESKTOP COMPUTER..WORLD MAP 1F5FB..1F5FF;W # So [5] MOUNT FUJI..MOYAI 1F600..1F64F;W # So [80] GRINNING FACE..PERSON WITH FOLDED HANDS 1F650..1F67F;N # So [48] NORTH WEST POINTING LEAF..REVERSE CHECKER BOARD 1F680..1F6C5;W # So [70] ROCKET..LEFT LUGGAGE 1F6C6..1F6CB;N # So [6] TRIANGLE WITH ROUNDED CORNERS..COUCH AND LAMP 1F6CC;W # So SLEEPING ACCOMMODATION 1F6CD..1F6CF;N # So [3] SHOPPING BAGS..BED 1F6D0..1F6D2;W # So [3] PLACE OF WORSHIP..SHOPPING TROLLEY 1F6D3..1F6D4;N # So [2] STUPA..PAGODA 1F6D5..1F6D7;W # So [3] HINDU TEMPLE..ELEVATOR 1F6DC..1F6DF;W # So [4] WIRELESS..RING BUOY 1F6E0..1F6EA;N # So [11] HAMMER AND WRENCH..NORTHEAST-POINTING AIRPLANE 1F6EB..1F6EC;W # So [2] AIRPLANE DEPARTURE..AIRPLANE ARRIVING 1F6F0..1F6F3;N # So [4] SATELLITE..PASSENGER SHIP 1F6F4..1F6FC;W # So [9] SCOOTER..ROLLER SKATE 1F700..1F776;N # So [119] ALCHEMICAL SYMBOL FOR QUINTESSENCE..LUNAR ECLIPSE 1F77B..1F77F;N # So [5] HAUMEA..ORCUS 1F780..1F7D9;N # So [90] BLACK LEFT-POINTING ISOSCELES RIGHT TRIANGLE..NINE POINTED WHITE STAR 1F7E0..1F7EB;W # So [12] LARGE ORANGE CIRCLE..LARGE BROWN SQUARE 1F7F0;W # So HEAVY EQUALS SIGN 1F800..1F80B;N # So [12] LEFTWARDS ARROW WITH SMALL TRIANGLE ARROWHEAD..DOWNWARDS ARROW WITH LARGE TRIANGLE ARROWHEAD 1F810..1F847;N # So [56] LEFTWARDS ARROW WITH SMALL EQUILATERAL ARROWHEAD..DOWNWARDS HEAVY ARROW 1F850..1F859;N # So [10] LEFTWARDS SANS-SERIF ARROW..UP DOWN SANS-SERIF ARROW 1F860..1F887;N # So [40] WIDE-HEADED LEFTWARDS LIGHT BARB ARROW..WIDE-HEADED SOUTH WEST VERY HEAVY BARB ARROW 1F890..1F8AD;N # So [30] LEFTWARDS TRIANGLE ARROWHEAD..WHITE ARROW SHAFT WIDTH TWO THIRDS 1F8B0..1F8B1;N # So [2] ARROW POINTING UPWARDS THEN NORTH WEST..ARROW POINTING RIGHTWARDS THEN CURVING SOUTH WEST 1F900..1F90B;N # So [12] CIRCLED CROSS FORMEE WITH FOUR DOTS..DOWNWARD FACING NOTCHED HOOK WITH DOT 1F90C..1F93A;W # So [47] PINCHED FINGERS..FENCER 1F93B;N # So MODERN PENTATHLON 1F93C..1F945;W # So [10] WRESTLERS..GOAL NET 1F946;N # So RIFLE 1F947..1F9FF;W # So [185] FIRST PLACE MEDAL..NAZAR AMULET 1FA00..1FA53;N # So [84] NEUTRAL CHESS KING..BLACK CHESS KNIGHT-BISHOP 1FA60..1FA6D;N # So [14] XIANGQI RED GENERAL..XIANGQI BLACK SOLDIER 1FA70..1FA7C;W # So [13] BALLET SHOES..CRUTCH 1FA80..1FA88;W # So [9] YO-YO..FLUTE 1FA90..1FABD;W # So [46] RINGED PLANET..WING 1FABE;W # Cn <reserved-1FABE> 1FABF..1FAC5;W # So [7] GOOSE..PERSON WITH CROWN 1FACE..1FADB;W # So [14] MOOSE..PEA POD 1FAE0..1FAE8;W # So [9] MELTING FACE..SHAKING FACE 1FAF0..1FAF8;W # So [9] HAND WITH INDEX FINGER AND THUMB CROSSED..RIGHTWARDS PUSHING HAND 1FB00..1FB92;N # So [147] BLOCK SEXTANT-1..UPPER HALF INVERSE MEDIUM SHADE AND LOWER HALF BLOCK 1FB94..1FBCA;N # So [55] LEFT HALF INVERSE MEDIUM SHADE AND RIGHT HALF BLOCK..WHITE UP-POINTING CHEVRON 1FBF0..1FBF9;N # Nd [10] SEGMENTED DIGIT ZERO..SEGMENTED DIGIT NINE 20000..2A6DF;W # Lo [42720] CJK UNIFIED IDEOGRAPH-20000..CJK UNIFIED IDEOGRAPH-2A6DF 2A6E0..2A6FF;W # Cn [32] <reserved-2A6E0>..<reserved-2A6FF> 2A700..2B738;W # Lo [4153] CJK UNIFIED IDEOGRAPH-2A700..CJK UNIFIED IDEOGRAPH-2B738 2B739..2B73F;W # Cn [7] <reserved-2B739>..<reserved-2B73F> 2B740..2B81D;W # Lo [222] CJK UNIFIED IDEOGRAPH-2B740..CJK UNIFIED IDEOGRAPH-2B81D 2B81E..2B81F;W # Cn [2] <reserved-2B81E>..<reserved-2B81F> 2B820..2CEA1;W # Lo [5762] CJK UNIFIED IDEOGRAPH-2B820..CJK UNIFIED IDEOGRAPH-2CEA1 2CEA2..2CEAF;W # Cn [14] <reserved-2CEA2>..<reserved-2CEAF> 2CEB0..2EBE0;W # Lo [7473] CJK UNIFIED IDEOGRAPH-2CEB0..CJK UNIFIED IDEOGRAPH-2EBE0 2EBE1..2F7FF;W # Cn [3103] <reserved-2EBE1>..<reserved-2F7FF> 2F800..2FA1D;W # Lo [542] CJK COMPATIBILITY IDEOGRAPH-2F800..CJK COMPATIBILITY IDEOGRAPH-2FA1D 2FA1E..2FA1F;W # Cn [2] <reserved-2FA1E>..<reserved-2FA1F> 2FA20..2FFFD;W # Cn [1502] <reserved-2FA20>..<reserved-2FFFD> 30000..3134A;W # Lo [4939] CJK UNIFIED IDEOGRAPH-30000..CJK UNIFIED IDEOGRAPH-3134A 3134B..3134F;W # Cn [5] <reserved-3134B>..<reserved-3134F> 31350..323AF;W # Lo [4192] CJK UNIFIED IDEOGRAPH-31350..CJK UNIFIED IDEOGRAPH-323AF 323B0..3FFFD;W # Cn [56398] <reserved-323B0>..<reserved-3FFFD> E0001;N # Cf LANGUAGE TAG E0020..E007F;N # Cf [96] TAG SPACE..CANCEL TAG E0100..E01EF;A # Mn [240] VARIATION SELECTOR-17..VARIATION SELECTOR-256 F0000..FFFFD;A # Co [65534] <private-use-F0000>..<private-use-FFFFD> 100000..10FFFD;A # Co [65534] <private-use-100000>..<private-use-10FFFD> # EOF
186,313
2,620
jart/cosmopolitan
false
cosmopolitan/libc/str/wctomb.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/limits.h" #include "libc/str/str.h" int wctomb(char *s, wchar_t wc) { if (!s) return 0; return wcrtomb(s, wc, 0); }
1,972
26
jart/cosmopolitan
false
cosmopolitan/libc/str/update.sh
#!/bin/sh [ -d libc/str ] || exit [ -x o//examples/curl.com ] || make -j8 o//examples/curl.com || exit mkdir -p o/tmp/ || exit shineget() { echo $2 o//examples/curl.com $2 >o/tmp/$$ || exit mv o/tmp/$$ $1 || exit } shineget libc/str/blocks.txt https://www.unicode.org/Public/UCD/latest/ucd/Blocks.txt shineget libc/str/unicodedata.txt https://www.unicode.org/Public/UCD/latest/ucd/UnicodeData.txt shineget libc/str/eastasianwidth.txt https://www.unicode.org/Public/UCD/latest/ucd/EastAsianWidth.txt shineget libc/str/SpecialCasing.txt https://www.unicode.org/Public/UCD/latest/ucd/SpecialCasing.txt
619
16
jart/cosmopolitan
false
cosmopolitan/libc/str/iswpunct_l.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/locale.h" #include "libc/str/str.h" int iswpunct_l(wint_t c, locale_t l) { return iswpunct(c); }
1,955
25
jart/cosmopolitan
false
cosmopolitan/libc/str/strncasecmp16.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Compares NUL-terminated UCS-2 strings case-insensitively w/ limit. * * @param a is first non-null NUL-terminated char16 string pointer * @param b is second non-null NUL-terminated char16 string pointer * @return is <0, 0, or >0 based on uint8_t comparison * @asyncsignalsafe */ int strncasecmp16(const char16_t *a, const char16_t *b, size_t n) { int x, y; size_t i = 0; if (!n-- || a == b) return 0; while ((x = towlower(a[i])) == (y = towlower(b[i])) && b[i] && i < n) ++i; return x - y; }
2,377
36
jart/cosmopolitan
false
cosmopolitan/libc/str/getx86processormodel.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/mem/bisect.internal.h" #include "libc/nexgen32e/x86info.h" static int CmpX86ProcModelKey(const struct X86ProcessorModel *a, const struct X86ProcessorModel *b) { return a->key > b->key ? 1 : a->key < b->key ? -1 : 0; } /** * Identifies microarchitecture of host processor. * * @param key can be kX86ProcessorModelKey for host info * @see https://en.wikichip.org/wiki/intel/cpuid * @see https://a4lg.com/tech/x86/database/x86-families-and-models.en.html */ const struct X86ProcessorModel *getx86processormodel(short key) { return bisect(&(struct X86ProcessorModel){key}, kX86ProcessorModels, kX86ProcessorModelCount, sizeof(struct X86ProcessorModel), (void *)CmpX86ProcModelKey, NULL); }
2,611
39
jart/cosmopolitan
false
cosmopolitan/libc/str/bcmp.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/dce.h" #include "libc/intrin/likely.h" #include "libc/nexgen32e/x86feature.h" #include "libc/str/str.h" typedef uint64_t xmm_t __attribute__((__vector_size__(16), __aligned__(1))); static int bcmp_sse(const char *p, const char *q, size_t n) { xmm_t a; while (n > 32) { a = *(const xmm_t *)p ^ *(const xmm_t *)q; if (a[0] | a[1]) return 1; p += 16; q += 16; n -= 16; } a = *(const xmm_t *)p ^ *(const xmm_t *)q | *(const xmm_t *)(p + n - 16) ^ *(const xmm_t *)(q + n - 16); return !!(a[0] | a[1]); } #ifdef __x86_64__ microarchitecture("avx") static int bcmp_avx(const char *p, const char *q, size_t n) { xmm_t a, b, c, d; if (n > 32) { if (n >= 16 + 64) { do { a = ((const xmm_t *)p)[0] ^ ((const xmm_t *)q)[0]; b = ((const xmm_t *)p)[1] ^ ((const xmm_t *)q)[1]; c = ((const xmm_t *)p)[2] ^ ((const xmm_t *)q)[2]; d = ((const xmm_t *)p)[3] ^ ((const xmm_t *)q)[3]; a = a | b | c | d; if (a[0] | a[1]) return 1; p += 64; q += 64; n -= 64; } while (n >= 16 + 64); } while (n > 16 + 16) { a = *(const xmm_t *)p ^ *(const xmm_t *)q; if (a[0] | a[1]) return 1; p += 16; q += 16; n -= 16; } } a = *(const xmm_t *)p ^ *(const xmm_t *)q | *(const xmm_t *)(p + n - 16) ^ *(const xmm_t *)(q + n - 16); return !!(a[0] | a[1]); } #endif /** * Tests inequality of first 𝑛 bytes of 𝑝 and 𝑞. * * bcmp n=0 992 picoseconds * bcmp n=1 992 ps/byte 984 mb/s * bcmp n=2 661 ps/byte 1,476 mb/s * bcmp n=3 441 ps/byte 2,214 mb/s * bcmp n=4 330 ps/byte 2,952 mb/s * bcmp n=5 264 ps/byte 3,690 mb/s * bcmp n=6 165 ps/byte 5,905 mb/s * bcmp n=7 189 ps/byte 5,166 mb/s * bcmp n=8 124 ps/byte 7,873 mb/s * bcmp n=9 183 ps/byte 5,314 mb/s * bcmp n=15 110 ps/byte 8,857 mb/s * bcmp n=16 62 ps/byte 15,746 mb/s * bcmp n=17 175 ps/byte 5,577 mb/s * bcmp n=31 96 ps/byte 10,169 mb/s * bcmp n=32 93 ps/byte 10,497 mb/s * bcmp n=33 80 ps/byte 12,179 mb/s * bcmp n=80 37 ps/byte 26,244 mb/s * bcmp n=128 36 ps/byte 26,994 mb/s * bcmp n=256 27 ps/byte 35,992 mb/s * bcmp n=16384 19 ps/byte 49,411 mb/s * bcmp n=32768 27 ps/byte 34,914 mb/s * bcmp n=131072 30 ps/byte 32,303 mb/s * * @return 0 if a and b have equal contents, otherwise nonzero * @see timingsafe_bcmp() * @asyncsignalsafe */ int bcmp(const void *a, const void *b, size_t n) { int c; unsigned u; uint32_t i, j; uint64_t x, y; const char *p, *q; if ((p = a) == (q = b)) return 0; if (!IsTiny()) { if (n <= 16) { if (n >= 8) { __builtin_memcpy(&x, p, 8); __builtin_memcpy(&y, q, 8); if (x ^ y) return 1; __builtin_memcpy(&x, p + n - 8, 8); __builtin_memcpy(&y, q + n - 8, 8); return !!(x ^ y); } else if (n >= 4) { __builtin_memcpy(&i, p, 4); __builtin_memcpy(&j, q, 4); if (i ^ j) return 1; __builtin_memcpy(&i, p + n - 4, 4); __builtin_memcpy(&j, q + n - 4, 4); return !!(i ^ j); } #ifdef __x86_64__ } else if (LIKELY(X86_HAVE(AVX))) { return bcmp_avx(p, q, n); #endif } else { return bcmp_sse(p, q, n); } } while (n--) { if ((c = p[n] ^ q[n])) { return c; } } return 0; }
6,025
141
jart/cosmopolitan
false
cosmopolitan/libc/str/highwayhash64.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2017 Google LLC │ │ │ │ Licensed under the Apache License, Version 2.0 (the "License"); │ │ you may not use this file except in compliance with the License. │ │ You may obtain a copy of the License at │ │ │ │ http://www.apache.org/licenses/LICENSE-2.0 │ │ │ │ Unless required by applicable law or agreed to in writing, software │ │ distributed under the License is distributed on an "AS IS" BASIS, │ │ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. │ │ See the License for the specific language governing permissions and │ │ limitations under the License. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/highwayhash64.h" #include "libc/intrin/bits.h" asm(".ident\t\"\\n\\n\ HighwayHash (Apache 2.0)\\n\ Copyright 2017 Google LLC\""); asm(".include \"libc/disclaimer.inc\""); typedef struct { uint64_t v0[4]; uint64_t v1[4]; uint64_t mul0[4]; uint64_t mul1[4]; } HighwayHashState; static void HighwayHashReset(const uint64_t key[4], HighwayHashState *state) { state->mul0[0] = 0xdbe6d5d5fe4cce2f; state->mul0[1] = 0xa4093822299f31d0; state->mul0[2] = 0x13198a2e03707344; state->mul0[3] = 0x243f6a8885a308d3; state->mul1[0] = 0x3bd39e10cb0ef593; state->mul1[1] = 0xc0acf169b5f18a8c; state->mul1[2] = 0xbe5466cf34e90c6c; state->mul1[3] = 0x452821e638d01377; state->v0[0] = state->mul0[0] ^ key[0]; state->v0[1] = state->mul0[1] ^ key[1]; state->v0[2] = state->mul0[2] ^ key[2]; state->v0[3] = state->mul0[3] ^ key[3]; state->v1[0] = state->mul1[0] ^ ((key[0] >> 32) | (key[0] << 32)); state->v1[1] = state->mul1[1] ^ ((key[1] >> 32) | (key[1] << 32)); state->v1[2] = state->mul1[2] ^ ((key[2] >> 32) | (key[2] << 32)); state->v1[3] = state->mul1[3] ^ ((key[3] >> 32) | (key[3] << 32)); } static void ZipperMergeAndAdd(const uint64_t v1, const uint64_t v0, uint64_t *add1, uint64_t *add0) { *add0 += (((v0 & 0xff000000) | (v1 & 0xff00000000)) >> 24) | (((v0 & 0xff0000000000) | (v1 & 0xff000000000000)) >> 16) | (v0 & 0xff0000) | ((v0 & 0xff00) << 32) | ((v1 & 0xff00000000000000) >> 8) | (v0 << 56); *add1 += (((v1 & 0xff000000) | (v0 & 0xff00000000)) >> 24) | (v1 & 0xff0000) | ((v1 & 0xff0000000000) >> 16) | ((v1 & 0xff00) << 24) | ((v0 & 0xff000000000000) >> 8) | ((v1 & 0xff) << 48) | (v0 & 0xff00000000000000); } static void Update(const uint64_t lanes[4], HighwayHashState *state) { int i; for (i = 0; i < 4; ++i) { state->v1[i] += state->mul0[i] + lanes[i]; state->mul0[i] ^= (state->v1[i] & 0xffffffff) * (state->v0[i] >> 32); state->v0[i] += state->mul1[i]; state->mul1[i] ^= (state->v0[i] & 0xffffffff) * (state->v1[i] >> 32); } ZipperMergeAndAdd(state->v1[1], state->v1[0], &state->v0[1], &state->v0[0]); ZipperMergeAndAdd(state->v1[3], state->v1[2], &state->v0[3], &state->v0[2]); ZipperMergeAndAdd(state->v0[1], state->v0[0], &state->v1[1], &state->v1[0]); ZipperMergeAndAdd(state->v0[3], state->v0[2], &state->v1[3], &state->v1[2]); } static void HighwayHashUpdatePacket(const uint8_t *packet, HighwayHashState *state) { uint64_t lanes[4]; lanes[0] = READ64LE(packet + 000); lanes[1] = READ64LE(packet + 010); lanes[2] = READ64LE(packet + 020); lanes[3] = READ64LE(packet + 030); Update(lanes, state); } static void Rotate32By(uint64_t count, uint64_t lanes[4]) { int i; for (i = 0; i < 4; ++i) { uint32_t half0 = lanes[i] & 0xffffffff; uint32_t half1 = (lanes[i] >> 32); lanes[i] = (half0 << count) | (half0 >> (32 - count)); lanes[i] |= (uint64_t)((half1 << count) | (half1 >> (32 - count))) << 32; } } static void HighwayHashUpdateRemainder(const uint8_t *bytes, const size_t size_mod32, HighwayHashState *state) { int i; const size_t size_mod4 = size_mod32 & 3; const uint8_t *remainder = bytes + (size_mod32 & ~3); uint8_t packet[32] = {0}; for (i = 0; i < 4; ++i) { state->v0[i] += ((uint64_t)size_mod32 << 32) + size_mod32; } Rotate32By(size_mod32, state->v1); for (i = 0; i < remainder - bytes; i++) { packet[i] = bytes[i]; } if (size_mod32 & 16) { for (i = 0; i < 4; i++) { packet[28 + i] = remainder[i + size_mod4 - 4]; } } else { if (size_mod4) { packet[16 + 0] = remainder[0]; packet[16 + 1] = remainder[size_mod4 >> 1]; packet[16 + 2] = remainder[size_mod4 - 1]; } } HighwayHashUpdatePacket(packet, state); } static void Permute(const uint64_t v[4], uint64_t *permuted) { permuted[0] = v[2] >> 32 | v[2] << 32; permuted[1] = v[3] >> 32 | v[3] << 32; permuted[2] = v[0] >> 32 | v[0] << 32; permuted[3] = v[1] >> 32 | v[1] << 32; } static void PermuteAndUpdate(HighwayHashState *state) { uint64_t permuted[4]; Permute(state->v0, permuted); Update(permuted, state); } static uint64_t HighwayHashFinalize64(HighwayHashState *state) { int i; for (i = 0; i < 4; i++) PermuteAndUpdate(state); return state->v0[0] + state->v1[0] + state->mul0[0] + state->mul1[0]; } static void ProcessAll(const uint8_t *data, size_t size, const uint64_t key[4], HighwayHashState *state) { size_t i; HighwayHashReset(key, state); for (i = 0; i + 32 <= size; i += 32) { HighwayHashUpdatePacket(data + i, state); } if ((size & 31) != 0) HighwayHashUpdateRemainder(data + i, size & 31, state); } /** * Computes Highway Hash. * * highwayhash64 n=0 121 nanoseconds * highwayhash64 n=8 16 ns/byte 59,865 kb/s * highwayhash64 n=31 4 ns/byte 222 mb/s * highwayhash64 n=32 3 ns/byte 248 mb/s * highwayhash64 n=63 2 ns/byte 387 mb/s * highwayhash64 n=64 2 ns/byte 422 mb/s * highwayhash64 n=128 1 ns/byte 644 mb/s * highwayhash64 n=256 1 ns/byte 875 mb/s * highwayhash64 n=22851 721 ps/byte 1,354 mb/s * */ uint64_t HighwayHash64(const void *data, size_t size, const uint64_t key[4]) { HighwayHashState state; ProcessAll(data, size, key, &state); return HighwayHashFinalize64(&state); }
7,497
174
jart/cosmopolitan
false
cosmopolitan/libc/str/getzipcdirsize.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/zip.h" /** * Returns size of zip central directory. */ uint64_t GetZipCdirSize(const uint8_t *eocd) { if (READ32LE(eocd) == kZipCdir64HdrMagic) { return ZIP_CDIR64_SIZE(eocd); } else { return ZIP_CDIR_SIZE(eocd); } }
2,085
31
jart/cosmopolitan
false
cosmopolitan/libc/str/strnwidth.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/bsf.h" #include "libc/intrin/pcmpgtb.h" #include "libc/intrin/pmovmskb.h" #include "libc/intrin/psubb.h" #include "libc/macros.internal.h" #include "libc/str/str.h" #include "libc/str/thompike.h" #include "libc/str/unicode.h" /** * Returns monospace display width of UTF-8 string. * * - Control codes are discounted * - ANSI escape sequences are discounted * - East asian glyphs, emoji, etc. count as two * * @param s is NUL-terminated string * @param n is max bytes to consider * @param o is offset for doing tabs * @return monospace display width */ int strnwidth(const char *s, size_t n, size_t o) { size_t i; wint_t c, w; unsigned l, r, k; enum { kAscii, kUtf8, kEsc, kCsi } t; for (w = r = t = l = i = 0; i < n;) { if ((c = s[i++] & 0xff)) { switch (t) { case kAscii: if (0x20 <= c && c <= 0x7E) { ++l; } else if (c == '\t') { if ((k = (o + i - 1) & 7)) { l += 8 - k; } else { l += 8; } } else if (c == 033) { t = kEsc; } else if (c >= 0300) { t = kUtf8; w = ThomPikeByte(c); r = ThomPikeLen(c) - 1; } break; case kUtf8: if (ThomPikeCont(c)) { w = ThomPikeMerge(w, c); if (--r) break; } l += MAX(0, wcwidth(w)); t = kAscii; break; case kEsc: if (c == '[') { t = kCsi; } else if (!(040 <= c && c < 060)) { t = kAscii; } break; case kCsi: if (!(060 <= c && c < 0100)) { t = kAscii; } break; default: unreachable; } } else { break; } } return l; }
3,678
94
jart/cosmopolitan
false
cosmopolitan/libc/str/wcsnlen_s.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2023 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns length of NUL-terminated wide string w/ limit & blankets. * * @param s is wide string * @param n is max length (a count of wide characters, not bytes) * @return length in characters * @asyncsignalsafe */ size_t wcsnlen_s(const wchar_t *s, size_t n) { if (!s) return 0; return wcsnlen(s, n); }
2,181
33
jart/cosmopolitan
false
cosmopolitan/libc/str/wmemmove.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" wchar_t *wmemmove(wchar_t *dest, const wchar_t *src, size_t count) { size_t bytes; if (__builtin_mul_overflow(count, sizeof(wchar_t), &bytes)) bytes = -1; return memmove(dest, src, bytes); }
2,060
26
jart/cosmopolitan
false
cosmopolitan/libc/str/crc32c.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/nexgen32e/crc32.h" #include "libc/nexgen32e/x86feature.h" /** * Computes 32-bit Castagnoli Cyclic Redundancy Check. * * x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1 * 0b00011110110111000110111101000001 * _bitreverse32(0x1edc6f41) * * @param init is the initial hash value * @param data points to the data * @param size is the byte size of data * @return eax is the new hash value * @note Used by ISCSI, TensorFlow, etc. */ uint32_t crc32c(uint32_t init, const void *data, size_t size) { uint64_t h; static bool once; const unsigned char *p, *pe; static uint32_t kCrc32cTab[256]; if (!once) { crc32init(kCrc32cTab, 0x82f63b78); once = 0; } p = data; pe = p + size; h = init ^ 0xffffffff; if (X86_HAVE(SSE4_2)) { while (p < pe && ((intptr_t)p & 7)) { h = h >> 8 ^ kCrc32cTab[(h & 0xff) ^ *p++]; } for (; p + 8 <= pe; p += 8) { asm("crc32q\t%1,%0" : "+r"(h) : "rm"(*(const uint64_t *)p)); } while (p < pe) { asm("crc32b\t%1,%0" : "+r"(h) : "rm"(*p++)); } } else { while (p < pe) { h = h >> 8 ^ kCrc32cTab[(h & 0xff) ^ *p++]; } } return h ^ 0xffffffff; }
3,036
64
jart/cosmopolitan
false
cosmopolitan/libc/str/langinfo.c
/*-*- mode:c;indent-tabs-mode:t;c-basic-offset:8;tab-width:8;coding:utf-8 -*-│ │vi: set et ft=c ts=8 tw=8 fenc=utf-8 :vi│ ╚──────────────────────────────────────────────────────────────────────────────╝ │ │ │ Musl Libc │ │ Copyright © 2005-2014 Rich Felker, et al. │ │ │ │ Permission is hereby granted, free of charge, to any person obtaining │ │ a copy of this software and associated documentation files (the │ │ "Software"), to deal in the Software without restriction, including │ │ without limitation the rights to use, copy, modify, merge, publish, │ │ distribute, sublicense, and/or sell copies of the Software, and to │ │ permit persons to whom the Software is furnished to do so, subject to │ │ the following conditions: │ │ │ │ The above copyright notice and this permission notice shall be │ │ included in all copies or substantial portions of the Software. │ │ │ │ THE SOFTWARE IS 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. │ │ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY │ │ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, │ │ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE │ │ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │ │ │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/langinfo.h" #include "libc/str/locale.h" #include "libc/str/nltypes.h" #include "libc/thread/tls.h" asm(".ident\t\"\\n\\n\ Musl libc (MIT License)\\n\ Copyright 2005-2014 Rich Felker, et. al.\""); asm(".include \"libc/disclaimer.inc\""); // clang-format off static const char c_time[] = "Sun\0" "Mon\0" "Tue\0" "Wed\0" "Thu\0" "Fri\0" "Sat\0" "Sunday\0" "Monday\0" "Tuesday\0" "Wednesday\0" "Thursday\0" "Friday\0" "Saturday\0" "Jan\0" "Feb\0" "Mar\0" "Apr\0" "May\0" "Jun\0" "Jul\0" "Aug\0" "Sep\0" "Oct\0" "Nov\0" "Dec\0" "January\0" "February\0" "March\0" "April\0" "May\0" "June\0" "July\0" "August\0" "September\0" "October\0" "November\0" "December\0" "AM\0" "PM\0" "%a %b %e %T %Y\0" "%m/%d/%y\0" "%H:%M:%S\0" "%I:%M:%S %p\0" "\0" "\0" "%m/%d/%y\0" "0123456789\0" "%a %b %e %T %Y\0" "%H:%M:%S"; static const char c_messages[] = "^[yY]\0" "^[nN]\0" "yes\0" "no"; static const char c_numeric[] = ".\0" ""; char *nl_langinfo_l(nl_item item, locale_t loc) { int cat = item >> 16; int idx = item & 65535; const char *str; if (!loc) return ""; if (item == CODESET) return loc->cat[LC_CTYPE] ? "UTF-8" : "ASCII"; /* _NL_LOCALE_NAME extension */ if (idx == 65535 && cat < LC_ALL) return loc->cat[cat] ? (char *)loc->cat[cat]->name : "C"; switch (cat) { case LC_NUMERIC: if (idx > 1) return ""; str = c_numeric; break; case LC_TIME: if (idx > 0x31) return ""; str = c_time; break; case LC_MONETARY: if (idx > 0) return ""; str = ""; break; case LC_MESSAGES: if (idx > 3) return ""; str = c_messages; break; default: return ""; } for (; idx; idx--, str++) for (; *str; str++); // if (cat != LC_NUMERIC && *str) str = LCTRANS(str, cat, loc); return (char *)str; } char *nl_langinfo(nl_item item) { return nl_langinfo_l(item, (locale_t)__get_tls()->tib_locale); }
4,478
108
jart/cosmopolitan
false
cosmopolitan/libc/str/setlocale.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/safemacros.internal.h" #include "libc/str/locale.h" #include "libc/str/str.h" /** * Sets program locale. * * Cosmopolitan only supports the C or POSIX locale. * * "You can have any locale you want as long as it's C." -- Henry Ford */ char *setlocale(int category, const char *locale) { if (!locale || (*locale == '\0')) return "C"; if (!strcmp(locale, "C") || !strcmp(locale, "POSIX")) { return locale; } else { return NULL; } }
2,310
38
jart/cosmopolitan
false
cosmopolitan/libc/str/isalpha.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns nonzero if c is upper or lower. */ int isalpha(int c) { return ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z'); }
1,996
27
jart/cosmopolitan
false
cosmopolitan/libc/str/wcsendswith.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns true if s has suffix. * * @param s is a NUL-terminated string * @param suffix is also NUL-terminated */ bool _wcsendswith(const wchar_t *s, const wchar_t *suffix) { size_t n, m; n = wcslen(s); m = wcslen(suffix); if (m > n) return false; return memcmp(s + n - m, suffix, m * sizeof(wchar_t)) == 0; }
2,192
34
jart/cosmopolitan
false
cosmopolitan/libc/str/memmem.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/dce.h" #include "libc/intrin/asan.internal.h" #include "libc/intrin/likely.h" #include "libc/str/str.h" typedef char xmm_t __attribute__((__vector_size__(16), __aligned__(16))); /** * Searches for fixed-length substring in memory region. * * @param haystack is the region of memory to be searched * @param haystacklen is its character count * @param needle contains the memory for which we're searching * @param needlelen is its character count * @return pointer to first result or NULL if not found */ noasan void *memmem(const void *haystack, size_t haystacklen, const void *needle, size_t needlelen) { #ifdef __x86_64__ char c; xmm_t n, *v; unsigned i, k, m; const char *p, *q, *e; if (IsAsan()) __asan_verify(needle, needlelen); if (IsAsan()) __asan_verify(haystack, haystacklen); if (!needlelen) return haystack; if (UNLIKELY(needlelen > haystacklen)) return 0; q = needle; c = *q; n = (xmm_t){c, c, c, c, c, c, c, c, c, c, c, c, c, c, c, c}; p = haystack; e = p + haystacklen; k = (uintptr_t)p & 15; v = (const xmm_t *)((uintptr_t)p & -16); m = __builtin_ia32_pmovmskb128(*v == n); m >>= k; m <<= k; for (;;) { while (!m) { ++v; if ((const char *)v >= e) return 0; m = __builtin_ia32_pmovmskb128(*v == n); } do { k = __builtin_ctzl(m); p = (const char *)v + k; if (UNLIKELY(p + needlelen > e)) return 0; for (i = 1;; ++i) { if (i == needlelen) return (/*unconst*/ char *)p; if (p[i] != q[i]) break; } m &= ~(1 << k); } while (m); } #else size_t i, j; if (!needlelen) return haystack; if (needlelen > haystacklen) return 0; for (i = 0; i < haystacklen; ++i) { for (j = 0;; ++j) { if (j == needlelen) return (/*unconst*/ char *)haystack + i; if (i + j == haystacklen) break; if (((char *)haystack)[i + j] != ((char *)needle)[j]) break; } } return 0; #endif }
3,808
87
jart/cosmopolitan
false
cosmopolitan/libc/str/iswspace_l.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/locale.h" #include "libc/str/str.h" int iswspace_l(wint_t c, locale_t l) { return iswspace(c); }
1,955
25
jart/cosmopolitan
false
cosmopolitan/libc/str/highwayhash64.h
#ifndef COSMOPOLITAN_LIBC_STR_HIGHWAYHASH64_H_ #define COSMOPOLITAN_LIBC_STR_HIGHWAYHASH64_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ uint64_t HighwayHash64(const void *, size_t, const uint64_t[4]); COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_STR_HIGHWAYHASH64_H_ */
340
11
jart/cosmopolitan
false
cosmopolitan/libc/str/hextoint.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Converts ASCII hexadecimal character to integer case-insensitively. * @return integer or 0 if c ∉ [0-9A-Fa-f] */ int hextoint(int c) { if ('0' <= c && c <= '9') { return c - '0'; } else if ('a' <= c && c <= 'f') { return c - 'a' + 10; } else if ('A' <= c && c <= 'F') { return c - 'A' + 10; } else { return 0; } }
2,214
36
jart/cosmopolitan
false
cosmopolitan/libc/str/smoothsort.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╚──────────────────────────────────────────────────────────────────────────────╝ │ Copyright (C) 2011 by Valentin Ochs │ │ │ │ Permission is hereby granted, free of charge, to any person obtaining a copy │ │ of this software and associated documentation files (the "Software"), to │ │ deal in the Software without restriction, including without limitation the │ │ rights to use, copy, modify, merge, publish, distribute, sublicense, and/or │ │ sell copies of the Software, and to permit persons to whom the Software is │ │ furnished to do so, subject to the following conditions: │ │ │ │ The above copyright notice and this permission notice shall be included in │ │ all copies or substantial portions of the Software. │ │ │ │ THE SOFTWARE IS 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. IN NO EVENT SHALL THE │ │ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER │ │ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING │ │ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS │ │ IN THE SOFTWARE. │ └─────────────────────────────────────────────────────────────────────────────*/ #include "libc/assert.h" #include "libc/intrin/bsf.h" #include "libc/mem/alg.h" #include "libc/str/str.h" asm(".ident\t\"\\n\\n\ Smoothsort (MIT License)\\n\ Copyright 2011 Valentin Ochs\\n\ Discovered by Edsger Dijkstra\""); asm(".include \"libc/disclaimer.inc\""); typedef int (*cmpfun)(const void *, const void *, void *); struct SmoothSort { size_t lp[12 * sizeof(size_t)]; unsigned char *ar[14 * sizeof(size_t) + 1]; unsigned char tmp[256]; }; static inline int ntz(unsigned long x) { return __builtin_ctzl(x); } static inline int pntz(size_t p[2]) { int r = ntz(p[0] - 1); if (r != 0 || (r = CHAR_BIT * sizeof(size_t) + ntz(p[1])) != CHAR_BIT * sizeof(size_t)) { return r; } return 0; } // SmoothSort_shl() and SmoothSort_shr() need n > 0 static inline void SmoothSort_shl(size_t p[2], int n) { if (n >= CHAR_BIT * sizeof(size_t)) { n -= CHAR_BIT * sizeof(size_t); p[1] = p[0]; p[0] = 0; } p[1] <<= n; p[1] |= p[0] >> (sizeof(size_t) * CHAR_BIT - n); p[0] <<= n; } static inline void SmoothSort_shr(size_t p[2], int n) { if (n >= CHAR_BIT * sizeof(size_t)) { n -= CHAR_BIT * sizeof(size_t); p[0] = p[1]; p[1] = 0; } p[0] >>= n; p[0] |= p[1] << (sizeof(size_t) * CHAR_BIT - n); p[1] >>= n; } static void SmoothSort_cycle(struct SmoothSort *s, size_t width, int n) { size_t l; int i; if (n < 2) { return; } s->ar[n] = s->tmp; while (width) { l = sizeof(s->tmp) < width ? sizeof(s->tmp) : width; memcpy(s->ar[n], s->ar[0], l); for (i = 0; i < n; i++) { memcpy(s->ar[i], s->ar[i + 1], l); s->ar[i] += l; } width -= l; } } static void SmoothSort_sift(struct SmoothSort *s, unsigned char *head, size_t width, cmpfun cmp, void *arg, int pshift) { unsigned char *rt, *lf; int i = 1; s->ar[0] = head; while (pshift > 1) { rt = head - width; lf = head - width - s->lp[pshift - 2]; if (cmp(s->ar[0], lf, arg) >= 0 && cmp(s->ar[0], rt, arg) >= 0) { break; } if (cmp(lf, rt, arg) >= 0) { s->ar[i++] = lf; head = lf; pshift -= 1; } else { s->ar[i++] = rt; head = rt; pshift -= 2; } } SmoothSort_cycle(s, width, i); } static void SmoothSort_trinkle(struct SmoothSort *s, unsigned char *head, size_t width, cmpfun cmp, void *arg, size_t pp[2], int pshift, int trusty) { unsigned char *stepson, *rt, *lf; size_t p[2]; int i = 1; int trail; p[0] = pp[0]; p[1] = pp[1]; s->ar[0] = head; while (p[0] != 1 || p[1] != 0) { stepson = head - s->lp[pshift]; if (cmp(stepson, s->ar[0], arg) <= 0) { break; } if (!trusty && pshift > 1) { rt = head - width; lf = head - width - s->lp[pshift - 2]; if (cmp(rt, stepson, arg) >= 0 || cmp(lf, stepson, arg) >= 0) { break; } } s->ar[i++] = stepson; head = stepson; trail = pntz(p); SmoothSort_shr(p, trail); pshift += trail; trusty = 0; } if (!trusty) { SmoothSort_cycle(s, width, i); SmoothSort_sift(s, head, width, cmp, arg, pshift); } } static void SmoothSort(struct SmoothSort *s, void *base, size_t nel, size_t width, cmpfun cmp, void *arg) { size_t i, size = width * nel; unsigned char *head, *high; size_t p[2] = {1, 0}; int pshift = 1; int trail; if (!size) return; head = base; high = head + size - width; // precompute Leonardo numbers, scaled by element width for (s->lp[0] = s->lp[1] = width, i = 2; (s->lp[i] = s->lp[i - 2] + s->lp[i - 1] + width) < size; i++) { } while (head < high) { if ((p[0] & 3) == 3) { SmoothSort_sift(s, head, width, cmp, arg, pshift); SmoothSort_shr(p, 2); pshift += 2; } else { if (s->lp[pshift - 1] >= high - head) { SmoothSort_trinkle(s, head, width, cmp, arg, p, pshift, 0); } else { SmoothSort_sift(s, head, width, cmp, arg, pshift); } if (pshift == 1) { SmoothSort_shl(p, 1); pshift = 0; } else { SmoothSort_shl(p, pshift - 1); pshift = 1; } } p[0] |= 1; head += width; } SmoothSort_trinkle(s, head, width, cmp, arg, p, pshift, 0); while (pshift != 1 || p[0] != 1 || p[1] != 0) { if (pshift <= 1) { trail = pntz(p); SmoothSort_shr(p, trail); pshift += trail; } else { SmoothSort_shl(p, 2); pshift -= 2; p[0] ^= 7; SmoothSort_shr(p, 1); SmoothSort_trinkle(s, head - s->lp[pshift] - width, width, cmp, arg, p, pshift + 1, 1); SmoothSort_shl(p, 1); p[0] |= 1; SmoothSort_trinkle(s, head - width, width, cmp, arg, p, pshift, 1); } head -= width; } } /** * Sorts array. * * @param base points to an array to sort in-place * @param count is the item count * @param width is the size of each item * @param cmp is a callback returning <0, 0, or >0 * @param arg will optionally be passed as the third argument to cmp * @see smoothsort() * @see qsort() */ void smoothsort_r(void *base, size_t count, size_t width, cmpfun cmp, void *arg) { struct SmoothSort s; SmoothSort(&s, base, count, width, cmp, arg); } /** * Sorts array. * * @param base points to an array to sort in-place * @param count is the item count * @param width is the size of each item * @param cmp is a callback returning <0, 0, or >0 * @see smoothsort_r() * @see qsort() */ void smoothsort(void *base, size_t count, size_t width, int cmp(const void *, const void *)) { struct SmoothSort s; SmoothSort(&s, base, count, width, (cmpfun)cmp, 0); }
8,014
245
jart/cosmopolitan
false
cosmopolitan/libc/str/tprecode8to16.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/pcmpgtb.h" #include "libc/intrin/pmovmskb.h" #include "libc/intrin/punpckhbw.h" #include "libc/intrin/punpcklbw.h" #include "libc/str/str.h" #include "libc/str/thompike.h" #include "libc/str/utf16.h" /* 34x speedup for ascii */ static inline noasan axdx_t tprecode8to16_sse2(char16_t *dst, size_t dstsize, const char *src, axdx_t r) { uint8_t v1[16], v2[16], vz[16]; __builtin_memset(vz, 0, 16); while (r.ax + 16 < dstsize) { __builtin_memcpy(v1, src + r.dx, 16); pcmpgtb((int8_t *)v2, (int8_t *)v1, (int8_t *)vz); if (pmovmskb(v2) != 0xFFFF) break; punpcklbw(v2, v1, vz); punpckhbw(v1, v1, vz); __builtin_memcpy(dst + r.ax + 0, v2, 16); __builtin_memcpy(dst + r.ax + 8, v1, 16); r.ax += 16; r.dx += 16; } return r; } /** * Transcodes UTF-8 to UTF-16. * * This is a low-level function intended for the core runtime. Use * utf8to16() for a much better API that uses malloc(). * * @param dst is output buffer * @param dstsize is shorts in dst * @param src is NUL-terminated UTF-8 input string * @return ax shorts written excluding nul * @return dx index of character after nul word in src */ axdx_t tprecode8to16(char16_t *dst, size_t dstsize, const char *src) { axdx_t r; unsigned w; int x, y, a, b, i, n; r.ax = 0; r.dx = 0; for (;;) { if (!IsTiny() && !((uintptr_t)(src + r.dx) & 15)) { r = tprecode8to16_sse2(dst, dstsize, src, r); } x = src[r.dx++] & 0377; if (x >= 0300) { a = ThomPikeByte(x); n = ThomPikeLen(x) - 1; for (i = 0;;) { if (!(b = src[r.dx + i] & 0377)) break; if (!ThomPikeCont(b)) break; a = ThomPikeMerge(a, b); if (++i == n) { r.dx += i; x = a; break; } } } if (!x) break; w = EncodeUtf16(x); while (w && r.ax + 1 < dstsize) { dst[r.ax++] = w; w >>= 16; } } if (r.ax < dstsize) { dst[r.ax] = 0; } return r; }
3,866
95
jart/cosmopolitan
false
cosmopolitan/libc/str/wmemset.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Sets wide memory. * @asyncsignalsafe */ wchar_t *wmemset(wchar_t *p, wchar_t c, size_t n) { size_t i; for (i = 0; i < n; ++i) { p[i] = c; } return p; }
2,036
32
jart/cosmopolitan
false
cosmopolitan/libc/str/wcsrchr.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Searches for last instance of wchar_t in string. * * @param s is NUL-terminated wchar_t string to search * @param c is the needle * @return address of last c in s, or NULL if not found * @asyncsignalsafe */ wchar_t *wcsrchr(const wchar_t *s, wchar_t c) { return wmemrchr(s, c, wcslen(s)); }
2,169
32
jart/cosmopolitan
false
cosmopolitan/libc/str/compareslicescase.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/macros.internal.h" #include "libc/str/slice.h" int CompareSlicesCase(const char *a, size_t n, const char *b, size_t m) { int c; if ((c = memcasecmp(a, b, MIN(n, m)))) return c; if (n < m) return -1; if (n > m) return +1; return 0; }
2,095
29
jart/cosmopolitan
false
cosmopolitan/libc/str/isutf8.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/dce.h" #include "libc/intrin/asan.internal.h" #include "libc/intrin/likely.h" #include "libc/str/str.h" typedef char xmm_t __attribute__((__vector_size__(16), __aligned__(16))); static const char kUtf8Dispatch[] = { 0, 0, 1, 1, 1, 1, 1, 1, // 0300 utf8-2 1, 1, 1, 1, 1, 1, 1, 1, // 0310 1, 1, 1, 1, 1, 1, 1, 1, // 0320 1, 1, 1, 1, 1, 1, 1, 1, // 0330 2, 3, 3, 3, 3, 3, 3, 3, // 0340 utf8-3 3, 3, 3, 3, 3, 3, 3, 3, // 0350 4, 5, 5, 5, 5, 0, 0, 0, // 0360 utf8-4 0, 0, 0, 0, 0, 0, 0, 0, // 0370 }; /** * Returns true if text is utf-8. * * _isutf8 n=0 1 nanoseconds * _isutf8 n=5 661 ps/byte 1,476 mb/s * _isutf8 ascii n=22851 26 ps/byte 35 GB/s * _isutf8 unicode n=3193 543 ps/byte 1,795 mb/s * * This function considers all ASCII characters including NUL to be * valid UTF-8. The conditions for something not being valid are: * * - Incorrect sequencing of 0300 (FIRST) and 0200 (CONT) chars * - Thompson-Pike varint sequence not encodable as UTF-16 * - Overlong UTF-8 encoding * * @param size if -1 implies strlen */ noasan bool _isutf8(const void *data, size_t size) { long c; unsigned m; const char *p, *e; if (size == -1) size = data ? strlen(data) : 0; if (IsAsan()) __asan_verify(data, size); p = data; e = p + size; while (p < e) { #ifdef __x86_64__ if (!((intptr_t)p & 15)) { for (;;) { if ((m = __builtin_ia32_pmovmskb128(*(xmm_t *)p >= (xmm_t){0}) ^ 0xffff)) { m = __builtin_ctzll(m); p += m; break; } else if ((p += 16) >= e) { break; } } if (p >= e) { return true; } } #endif if (LIKELY((c = *p++ & 255) < 0200)) continue; if (UNLIKELY(c < 0300)) return false; switch (kUtf8Dispatch[c - 0300]) { case 0: return false; case 1: if (p < e && (*p & 0300) == 0200) { ++p; break; } else { return false; // missing cont } case 2: if (p < e && (*p & 0377) < 0240) { return false; // overlong } // fallthrough case 3: if (p + 2 <= e && // (p[0] & 0300) == 0200 && // (p[1] & 0300) == 0200) { // p += 2; break; } else { return false; // missing cont } case 4: if (p < e && (*p & 0377) < 0220) { return false; // overlong } // fallthrough case 5: if (p + 3 <= e && // (((uint32_t)(p[+2] & 0377) << 030 | // (uint32_t)(p[+1] & 0377) << 020 | // (uint32_t)(p[+0] & 0377) << 010 | // (uint32_t)(p[-1] & 0377) << 000) & // 0xC0C0C000) == 0x80808000) { // p += 3; break; } else { return false; // missing cont } default: unreachable; } } return true; }
4,939
129
jart/cosmopolitan
false
cosmopolitan/libc/str/wctrans.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" wctrans_t wctrans(const char *s) { if (!strcmp(s, "toupper")) return (wctrans_t)1; if (!strcmp(s, "tolower")) return (wctrans_t)2; return 0; }
2,012
26
jart/cosmopolitan
false
cosmopolitan/libc/str/kx86processormodels.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/bits.h" #include "libc/macros.internal.h" #include "libc/nexgen32e/x86info.h" _Hide const struct X86ProcessorModel kX86ProcessorModels[] = { /* <SORTED> */ {0x060F, X86_MARCH_CORE2, X86_GRADE_CLIENT}, {0x0616, X86_MARCH_CORE2, X86_GRADE_MOBILE}, {0x0617, X86_MARCH_CORE2, X86_GRADE_SERVER}, {0x061A, X86_MARCH_NEHALEM, X86_GRADE_DENSITY}, {0x061C, X86_MARCH_BONNELL, X86_GRADE_APPLIANCE}, {0x061D, X86_MARCH_CORE2, X86_GRADE_SERVER}, {0x061E, X86_MARCH_NEHALEM, X86_GRADE_CLIENT}, {0x061F, X86_MARCH_NEHALEM, X86_GRADE_DESKTOP}, {0x0625, X86_MARCH_WESTMERE, X86_GRADE_CLIENT}, {0x0626, X86_MARCH_BONNELL, X86_GRADE_TABLET}, {0x0627, X86_MARCH_SALTWELL, X86_GRADE_TABLET}, {0x062A, X86_MARCH_SANDYBRIDGE, X86_GRADE_CLIENT}, {0x062C, X86_MARCH_WESTMERE, X86_GRADE_DENSITY}, {0x062D, X86_MARCH_SANDYBRIDGE, X86_GRADE_SERVER}, {0x062E, X86_MARCH_NEHALEM, X86_GRADE_SERVER}, {0x062F, X86_MARCH_WESTMERE, X86_GRADE_SERVER}, {0x0635, X86_MARCH_SALTWELL, X86_GRADE_TABLET}, {0x0636, X86_MARCH_SALTWELL, X86_GRADE_APPLIANCE}, {0x0637, X86_MARCH_SILVERMONT, X86_GRADE_APPLIANCE}, {0x063A, X86_MARCH_IVYBRIDGE, X86_GRADE_CLIENT}, {0x063C, X86_MARCH_HASWELL, X86_GRADE_CLIENT}, {0x063D, X86_MARCH_BROADWELL, X86_GRADE_CLIENT}, {0x063E, X86_MARCH_IVYBRIDGE, X86_GRADE_SERVER}, {0x063F, X86_MARCH_HASWELL, X86_GRADE_SERVER}, {0x0645, X86_MARCH_HASWELL, X86_GRADE_MOBILE}, {0x0646, X86_MARCH_HASWELL, X86_GRADE_DESKTOP}, {0x0647, X86_MARCH_BROADWELL, X86_GRADE_DESKTOP}, {0x064A, X86_MARCH_SILVERMONT, X86_GRADE_TABLET}, {0x064C, X86_MARCH_AIRMONT, X86_GRADE_APPLIANCE}, {0x064D, X86_MARCH_SILVERMONT, X86_GRADE_DENSITY}, {0x064E, X86_MARCH_SKYLAKE, X86_GRADE_MOBILE}, {0x064F, X86_MARCH_BROADWELL, X86_GRADE_SERVER}, {0x0655, X86_MARCH_SKYLAKE, X86_GRADE_SERVER}, {0x0656, X86_MARCH_BROADWELL, X86_GRADE_DENSITY}, {0x0657, X86_MARCH_KNIGHTSLANDING, X86_GRADE_SCIENCE}, {0x065A, X86_MARCH_AIRMONT, X86_GRADE_TABLET}, {0x065C, X86_MARCH_GOLDMONT, X86_GRADE_APPLIANCE}, {0x065E, X86_MARCH_SKYLAKE, X86_GRADE_CLIENT}, {0x065F, X86_MARCH_GOLDMONT, X86_GRADE_DENSITY}, {0x0666, X86_MARCH_CANNONLAKE, X86_GRADE_MOBILE}, {0x066A, X86_MARCH_ICELAKE, X86_GRADE_SERVER}, {0x066C, X86_MARCH_ICELAKE, X86_GRADE_DENSITY}, {0x0675, X86_MARCH_AIRMONT, X86_GRADE_APPLIANCE}, {0x067A, X86_MARCH_GOLDMONTPLUS, X86_GRADE_APPLIANCE}, {0x067D, X86_MARCH_ICELAKE, X86_GRADE_CLIENT}, {0x067E, X86_MARCH_ICELAKE, X86_GRADE_MOBILE}, {0x0685, X86_MARCH_KNIGHTSMILL, X86_GRADE_SCIENCE}, {0x0686, X86_MARCH_TREMONT, X86_GRADE_APPLIANCE}, {0x068C, X86_MARCH_TIGERLAKE, X86_GRADE_MOBILE}, {0x068D, X86_MARCH_TIGERLAKE, X86_GRADE_CLIENT}, {0x068E, X86_MARCH_KABYLAKE, X86_GRADE_MOBILE}, {0x0696, X86_MARCH_TREMONT, X86_GRADE_APPLIANCE}, {0x069D, X86_MARCH_ICELAKE, X86_GRADE_SCIENCE}, {0x069E, X86_MARCH_KABYLAKE, X86_GRADE_CLIENT}, /* </SORTED> */ }; _Hide const size_t kX86ProcessorModelCount = ARRAYLEN(kX86ProcessorModels);
4,966
83
jart/cosmopolitan
false
cosmopolitan/libc/str/isascii.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns nonzero if c is ascii. */ int isascii(int c) { return 0x00 <= c && c <= 0x7F; }
1,961
27
jart/cosmopolitan
false
cosmopolitan/libc/str/findembeddedape.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/bits.h" #include "libc/log/libfatal.internal.h" #include "libc/macros.internal.h" #include "libc/str/str.h" #define TRIES 8 /** * Returns offset of binary embedded inside binary. * * This can be used to load zip assets from an executable that hasn't * gone through the `objcopy -S -O binary` step. We make the assumption * that an x86_64-pc-linux-gnu toolchain is being used. This routine * would need to be changed to accommodate binaries built locally on * Apple, FreeBSD, etc. * * @param p needs to be page aligned * @param n is byte length of p * @return base address of image or NULL if not found */ uint8_t *FindEmbeddedApe(const uint8_t *p, size_t n) { size_t i; uint64_t w; n = MIN(n, TRIES * PAGESIZE); for (i = 0; i + 8 <= n; i += PAGESIZE) { w = READ64LE(p + i); if (w == READ64LE("MZqFpD='") || w == READ64LE("\177ELF\2\1\1\11")) { return (/*unconst*/ uint8_t *)(p + i); } } return 0; }
2,801
51
jart/cosmopolitan
false
cosmopolitan/libc/str/toascii.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" int toascii(int c) { return c & 127; }
1,904
24
jart/cosmopolitan
false
cosmopolitan/libc/str/memfrob.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Memfrob implements a crypto algorithm proven to be unbreakable, * without meeting its requirements concerning secrecy or length. */ void *memfrob(void *buf, size_t size) { size_t i; unsigned char *p; for (p = buf, i = 0; i < size; ++i) { p[i] ^= '*'; } return buf; }
2,153
33
jart/cosmopolitan
false
cosmopolitan/libc/str/khextoint.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/tab.internal.h" _Alignas(int8_t) const int8_t kHexToInt[256] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x00 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x10 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x20 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, -1, -1, // 0x30 -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x40 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x50 -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x60 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x70 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x80 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x90 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xa0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xb0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xc0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xd0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xe0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xf0 };
3,156
39
jart/cosmopolitan
false
cosmopolitan/libc/str/c16rtomb.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╚──────────────────────────────────────────────────────────────────────────────╝ │ │ │ Musl Libc │ │ Copyright © 2005-2014 Rich Felker, et al. │ │ │ │ Permission is hereby granted, free of charge, to any person obtaining │ │ a copy of this software and associated documentation files (the │ │ "Software"), to deal in the Software without restriction, including │ │ without limitation the rights to use, copy, modify, merge, publish, │ │ distribute, sublicense, and/or sell copies of the Software, and to │ │ permit persons to whom the Software is furnished to do so, subject to │ │ the following conditions: │ │ │ │ The above copyright notice and this permission notice shall be │ │ included in all copies or substantial portions of the Software. │ │ │ │ THE SOFTWARE IS 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. │ │ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY │ │ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, │ │ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE │ │ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │ │ │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/calls.h" #include "libc/errno.h" #include "libc/limits.h" #include "libc/str/mb.internal.h" #include "libc/str/str.h" asm(".ident\t\"\\n\\n\ Musl libc (MIT License)\\n\ Copyright 2005-2014 Rich Felker, et. al.\""); asm(".include \"libc/disclaimer.inc\""); size_t c16rtomb(char *restrict s, char16_t c16, mbstate_t *restrict ps) { static unsigned internal_state; if (!ps) ps = (void *)&internal_state; unsigned *x = (unsigned *)ps; wchar_t wc; if (!s) { if (*x) goto ilseq; return 1; } if (!*x && c16 - 0xd800u < 0x400) { *x = c16 - 0xd7c0 << 10; return 0; } if (*x) { if (c16 - 0xdc00u >= 0x400) goto ilseq; else wc = *x + c16 - 0xdc00; *x = 0; } else { wc = c16; } return wcrtomb(s, wc, 0); ilseq: *x = 0; errno = EILSEQ; return -1; }
3,435
67
jart/cosmopolitan
false
cosmopolitan/libc/str/longsort.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/strace.internal.h" #include "libc/runtime/runtime.h" static inline void InsertionSort(long *A, long n) { long i, j, t; for (i = 1; i < n; i++) { t = A[i]; j = i - 1; while (j >= 0 && A[j] > t) { A[j + 1] = A[j]; j = j - 1; } A[j + 1] = t; } } static void LongSort(long *A, long n) { long t, p, i, j; if (n <= 32) { InsertionSort(A, n); } else { for (p = A[n >> 1], i = 0, j = n - 1;; i++, j--) { while (A[i] < p) i++; while (A[j] > p) j--; if (i >= j) break; t = A[i]; A[i] = A[j]; A[j] = t; } LongSort(A, i); LongSort(A + i, n - i); } } /** * Sorting algorithm for longs that doesn't take long. * * "What disorder is this? Give me my long sort!" * -Lord Capulet * */ void _longsort(long *A, size_t n) { LongSort(A, n); if (n > 1000) { STRACE("_longsort(%p, %'zu)", A, n); } }
2,790
66
jart/cosmopolitan
false
cosmopolitan/libc/str/iswblank_l.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/locale.h" #include "libc/str/str.h" int iswblank_l(wint_t c, locale_t l) { return iswblank(c); }
1,955
25
jart/cosmopolitan
false
cosmopolitan/libc/str/strverscmp.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╚──────────────────────────────────────────────────────────────────────────────╝ │ │ │ Musl Libc │ │ Copyright © 2005-2014 Rich Felker, et al. │ │ │ │ Permission is hereby granted, free of charge, to any person obtaining │ │ a copy of this software and associated documentation files (the │ │ "Software"), to deal in the Software without restriction, including │ │ without limitation the rights to use, copy, modify, merge, publish, │ │ distribute, sublicense, and/or sell copies of the Software, and to │ │ permit persons to whom the Software is furnished to do so, subject to │ │ the following conditions: │ │ │ │ The above copyright notice and this permission notice shall be │ │ included in all copies or substantial portions of the Software. │ │ │ │ THE SOFTWARE IS 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. │ │ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY │ │ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, │ │ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE │ │ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │ │ │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" asm(".ident\t\"\\n\\n\ Musl libc (MIT License)\\n\ Copyright 2005-2014 Rich Felker, et. al.\""); asm(".include \"libc/disclaimer.inc\""); /** * Compares two version strings. */ int strverscmp(const char *l0, const char *r0) { const unsigned char *l = (const void *)l0; const unsigned char *r = (const void *)r0; size_t i, dp, j; int z = 1; /* Find maximal matching prefix and track its maximal digit * suffix and whether those digits are all zeros. */ for (dp = i = 0; l[i] == r[i]; i++) { int c = l[i]; if (!c) return 0; if (!isdigit(c)) { dp = i + 1, z = 1; } else if (c != '0') { z = 0; } } if (l[dp] != '0' && r[dp] != '0') { /* If we're not looking at a digit sequence that began * with a zero, longest digit string is greater. */ for (j = i; isdigit(l[j]); j++) { if (!isdigit(r[j])) { return 1; } } if (isdigit(r[j])) { return -1; } } else if (z && dp < i && (isdigit(l[i]) || isdigit(r[i]))) { /* Otherwise, if common prefix of digit sequence is * all zeros, digits order less than non-digits. */ return (unsigned char)(l[i] - '0') - (unsigned char)(r[i] - '0'); } return l[i] - r[i]; }
3,848
72
jart/cosmopolitan
false
cosmopolitan/libc/str/getzipcdircommentsize.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/zip.h" /** * Returns comment of zip central directory. */ uint64_t GetZipCdirCommentSize(const uint8_t *eocd) { if (READ32LE(eocd) == kZipCdir64HdrMagic && ZIP_CDIR64_COMMENTSIZE(eocd)) { return ZIP_CDIR64_COMMENTSIZE(eocd); } else { return ZIP_CDIR_COMMENTSIZE(eocd); } }
2,141
31
jart/cosmopolitan
false
cosmopolitan/libc/str/localeconv.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/limits.h" #include "libc/str/unicode.h" static const struct lconv kLocaleConv = { .decimal_point = ".", .thousands_sep = "", .grouping = "", .int_curr_symbol = "", .currency_symbol = "", .mon_decimal_point = "", .mon_thousands_sep = "", .mon_grouping = "", .positive_sign = "", .negative_sign = "", .int_frac_digits = CHAR_MAX, .frac_digits = CHAR_MAX, .p_cs_precedes = CHAR_MAX, .p_sep_by_space = CHAR_MAX, .n_cs_precedes = CHAR_MAX, .n_sep_by_space = CHAR_MAX, .p_sign_posn = CHAR_MAX, .n_sign_posn = CHAR_MAX, .int_p_cs_precedes = CHAR_MAX, .int_p_sep_by_space = CHAR_MAX, .int_n_cs_precedes = CHAR_MAX, .int_n_sep_by_space = CHAR_MAX, .int_p_sign_posn = CHAR_MAX, .int_n_sign_posn = CHAR_MAX, }; struct lconv *localeconv(void) { return (/* unconst */ struct lconv *)&kLocaleConv; }
2,737
52
jart/cosmopolitan
false
cosmopolitan/libc/str/strntolower.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" char *strntolower(char *s, size_t n) { unsigned char *p = (unsigned char *)s; for (;;) { if (n-- && *p) { if ('A' <= *p && *p <= 'Z') { *p += 'a' - 'A'; } ++p; } else { break; } } return s; }
2,107
35
jart/cosmopolitan
false
cosmopolitan/libc/str/a64l.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" static const signed char kBase64i[256] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0x00 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0x10 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, /* 0x20 */ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, -1, -1, -1, -1, -1, -1, /* 0x30 */ -1, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, /* 0x40 */ 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, -1, -1, -1, -1, -1, /* 0x50 */ -1, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, /* 0x60 */ 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, -1, -1, -1, /* 0x70 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0x80 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0x90 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xA0 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xB0 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xC0 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xD0 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xE0 */ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0xF0 */ }; /** * Converts base64 to 32-bit integer, the posix way. * @see l64a() for inverse * @see DecodeBase64() */ long a64l(const char *s) { uint32_t i, v, x; for (x = i = 0; i < 6; ++i) { v = kBase64i[s[i] & 0xff]; if (v == -1) break; x |= v << (i * 6); } return (int32_t)x; }
3,469
54
jart/cosmopolitan
false
cosmopolitan/libc/str/getziplfileuncompressedsize.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/zip.h" /** * Returns uncompressed size in bytes from zip local file header. */ uint64_t GetZipLfileUncompressedSize(const uint8_t *z) { uint64_t x; const uint8_t *p, *pe; x = ZIP_LFILE_UNCOMPRESSEDSIZE(z); if (x == 0xFFFFFFFF) { for (p = ZIP_LFILE_EXTRA(z), pe = p + ZIP_LFILE_EXTRASIZE(z); p < pe; p += ZIP_EXTRA_SIZE(p)) { if (ZIP_EXTRA_HEADERID(p) == kZipExtraZip64 && 0 + 8 <= ZIP_EXTRA_CONTENTSIZE(p)) { return READ64LE(ZIP_EXTRA_CONTENT(p) + 0); } } } return x; }
2,383
39
jart/cosmopolitan
false
cosmopolitan/libc/str/strncat.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Appends at most 𝑛 bytes from 𝑠 to 𝑑. * * @param 𝑑 is both a NUL-terminated string and a buffer, needing * an ARRAYLEN() of at least strlen(𝑑)+strnlen(𝑠,𝑛)+1 * @param 𝑠 is character array which needn't be NUL-terminated * @param 𝑛 is maximum number of characters from s to copy * @return 𝑑 * @note 𝑑 and 𝑠 can't overlap * @asyncsignaslenafe */ char *strncat(char *d, const char *s, size_t n) { size_t o; if (!memccpy(d + (o = strlen(d)), s, '\0', n)) { d[o + n] = '\0'; } return d; }
2,414
39
jart/cosmopolitan
false
cosmopolitan/libc/str/memccpy.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/bits.h" #include "libc/str/str.h" /** * Copies at most N bytes from SRC to DST until 𝑐 is encountered. * * This is little-known C Standard Library approach, dating back to the * Fourth Edition of System Five, for copying a C strings to fixed-width * buffers, with added generality. * * For example, strictly: * * char buf[16]; * CHECK_NOTNULL(memccpy(buf, s, '\0', sizeof(buf))); * * Or unstrictly: * * if (!memccpy(buf, s, '\0', sizeof(buf))) strcpy(buf, "?"); * * Are usually more sensible than the following: * * char cstrbuf[16]; * snprintf(cstrbuf, sizeof(cstrbuf), "%s", CSTR); * * @param c is search character and is masked with 255 * @return DST + idx(c) + 1, or NULL if 𝑐 ∉ 𝑠₀․․ₙ₋₁ * @note DST and SRC can't overlap * @asyncsignalsafe */ void *memccpy(void *dst, const void *src, int c, size_t n) { size_t i; unsigned char *d; const unsigned char *s; for (d = dst, s = src, i = 0; i < n; ++i) { if ((d[i] = s[i]) == (c & 255)) { return d + i + 1; } } return 0; }
2,925
59
jart/cosmopolitan
false
cosmopolitan/libc/str/rldecode2.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/nexgen32e/kompressor.h" #include "libc/str/str.h" void rldecode2(void *d, const struct RlDecode *r) { char *p; for (p = d; r->repititions; ++r) { memset(p, r->byte, r->repititions); p += r->repititions; } }
2,073
29
jart/cosmopolitan
false
cosmopolitan/libc/str/wcsspn.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/nexgen32e/hascharacter.internal.h" #include "libc/str/str.h" /** * Returns prefix length, consisting of chars in accept. * * @param accept is nul-terminated character set * @see strcspn(), strtok_r() * @asyncsignalsafe */ size_t wcsspn(const wchar_t *s, const wchar_t *accept) { size_t i; for (i = 0; s[i]; ++i) { if (!HasCharacterWide(s[i], accept)) { break; } } return i; }
2,256
38
jart/cosmopolitan
false
cosmopolitan/libc/str/iswalnum.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/str/str.h" /** * Returns nonzero if c is lower, alpha, or digit. */ int iswalnum(wint_t c) { return iswdigit(c) || iswalpha(c); }
1,986
27
jart/cosmopolitan
false
cosmopolitan/libc/str/windowstimetotimeval.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/fmt/conv.h" /** * Converts Windows COBOL timestamp to UNIX epoch in microseconds. */ struct timeval WindowsTimeToTimeVal(int64_t x) { return (struct timeval){x / HECTONANOSECONDS - MODERNITYSECONDS, x % HECTONANOSECONDS / 10}; }
2,111
28
jart/cosmopolitan
false
cosmopolitan/libc/str/tpdecodecb.internal.h
#ifndef COSMOPOLITAN_LIBC_STR_TPDECODECB_H_ #define COSMOPOLITAN_LIBC_STR_TPDECODECB_H_ #include "libc/intrin/bsr.h" #if !(__ASSEMBLER__ + __LINKER__ + 0) /* TODO(jart): DELETE? */ /** * Generic Thompson-Pike Varint Decoder. * @return number of bytes successfully consumed or -1 w/ errno * @note synchronization is performed * @todo delete */ forceinline int tpdecodecb(wint_t *out, int first, int get(void *arg, uint32_t i), void *arg) { uint32_t wc, cb, need, msb, j, i = 1; if (__builtin_expect((wc = first) == -1, 0)) return -1; while (__builtin_expect((wc & 0b11000000) == 0b10000000, 0)) { if ((wc = get(arg, i++)) == -1) return -1; } if (__builtin_expect(!(0 <= wc && wc <= 0x7F), 0)) { msb = wc < 252 ? _bsr(~wc & 0xff) : 1; need = 7 - msb; wc &= ((1u << msb) - 1) | 0b00000011; for (j = 1; j < need; ++j) { if ((cb = get(arg, i++)) == -1) return -1; if ((cb & 0b11000000) == 0b10000000) { wc = wc << 6 | (cb & 0b00111111); } else { if (out) *out = u'\xFFFD'; return -1; } } } if (__builtin_expect(!!out, 1)) *out = (wint_t)wc; return i; } #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_STR_TPDECODECB_H_ */
1,267
41
jart/cosmopolitan
false
cosmopolitan/libc/time/kweekdaynameshort.S
#if 0 /*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #endif #include "libc/macros.internal.h" // Type #1: // - Indexable C-String Array // - extern const char kWeekdayNameShort[7][4]; // Type #2: // - Double-NUL Terminated String // - extern const char kWeekdayNameShort[]; .section .rodata,"a",@progbits .underrun kWeekdayNameShort: .asciz "Sun" .asciz "Mon" .asciz "Tue" .asciz "Wed" .asciz "Thu" .asciz "Fri" .asciz "Sat" .byte 0 .endobj kWeekdayNameShort,globl .overrun .previous
1,230
32
jart/cosmopolitan
false
cosmopolitan/libc/time/localtime.c
/*-*- mode:c; indent-tabs-mode:t; tab-width:8; coding:utf-8 -*-│ │vi: set et ft=c ts=8 tw=8 fenc=utf-8 :vi│ ╚─────────────────────────────────────────────────────────────────────────────*/ #define LOCALTIME_IMPLEMENTATION #include "libc/calls/blockcancel.internal.h" #include "libc/calls/calls.h" #include "libc/intrin/bits.h" #include "libc/intrin/nopl.internal.h" #include "libc/mem/gc.h" #include "libc/mem/mem.h" #include "libc/str/str.h" #include "libc/sysv/consts/o.h" #include "libc/thread/thread.h" #include "libc/thread/tls.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" #include "libc/time/tz.internal.h" #include "libc/time/tzfile.internal.h" STATIC_YOINK("zip_uri_support"); STATIC_YOINK("usr/share/zoneinfo/"); STATIC_YOINK("usr/share/zoneinfo/Anchorage"); STATIC_YOINK("usr/share/zoneinfo/Beijing"); STATIC_YOINK("usr/share/zoneinfo/Berlin"); STATIC_YOINK("usr/share/zoneinfo/Boulder"); STATIC_YOINK("usr/share/zoneinfo/Chicago"); STATIC_YOINK("usr/share/zoneinfo/GMT"); STATIC_YOINK("usr/share/zoneinfo/GST"); STATIC_YOINK("usr/share/zoneinfo/Honolulu"); STATIC_YOINK("usr/share/zoneinfo/Israel"); STATIC_YOINK("usr/share/zoneinfo/Japan"); STATIC_YOINK("usr/share/zoneinfo/London"); STATIC_YOINK("usr/share/zoneinfo/Melbourne"); STATIC_YOINK("usr/share/zoneinfo/New_York"); STATIC_YOINK("usr/share/zoneinfo/UTC"); // clang-format off /* Convert timestamp from time_t to struct tm. */ /* ** This file is in the public domain, so clarified as of ** 1996-06-05 by Arthur David Olson. */ /* ** Leap second handling from Bradley White. ** POSIX-style TZ environment variable handling from Guy Harris. */ static pthread_mutex_t locallock; void localtime_lock(void) { pthread_mutex_lock(&locallock); } void localtime_unlock(void) { pthread_mutex_unlock(&locallock); } void localtime_funlock(void) { pthread_mutex_init(&locallock, 0); } __attribute__((__constructor__)) static void localtime_init(void) { localtime_funlock(); pthread_atfork(localtime_lock, localtime_unlock, localtime_funlock); } #ifdef _NOPL0 #define localtime_lock() _NOPL0("__threadcalls", localtime_lock) #define localtime_unlock() _NOPL0("__threadcalls", localtime_unlock) #endif #ifndef TZ_ABBR_MAX_LEN #define TZ_ABBR_MAX_LEN 16 #endif /* !defined TZ_ABBR_MAX_LEN */ #ifndef TZ_ABBR_CHAR_SET #define TZ_ABBR_CHAR_SET \ "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 :+-._" #endif /* !defined TZ_ABBR_CHAR_SET */ #ifndef TZ_ABBR_ERR_CHAR #define TZ_ABBR_ERR_CHAR '_' #endif /* !defined TZ_ABBR_ERR_CHAR */ #ifndef WILDABBR /* ** Someone might make incorrect use of a time zone abbreviation: ** 1. They might reference tzname[0] before calling tzset (explicitly ** or implicitly). ** 2. They might reference tzname[1] before calling tzset (explicitly ** or implicitly). ** 3. They might reference tzname[1] after setting to a time zone ** in which Daylight Saving Time is never observed. ** 4. They might reference tzname[0] after setting to a time zone ** in which Standard Time is never observed. ** 5. They might reference tm.TM_ZONE after calling offtime. ** What's best to do in the above cases is open to debate; ** for now, we just set things up so that in any of the five cases ** WILDABBR is used. Another possibility: initialize tzname[0] to the ** string "tzname[0] used before set", and similarly for the other cases. ** And another: initialize tzname[0] to "ERA", with an explanation in the ** manual page of what this "time zone abbreviation" means (doing this so ** that tzname[0] has the "normal" length of three characters). */ #define WILDABBR " " #endif /* !defined WILDABBR */ static const char wildabbr[] = WILDABBR; static const char gmt[] = "GMT"; /* ** The DST rules to use if TZ has no rules and we can't load TZDEFRULES. ** Default to US rules as of 2017-05-07. ** POSIX does not specify the default DST rules; ** for historical reasons, US rules are a common default. */ #ifndef TZDEFRULESTRING #define TZDEFRULESTRING ",M3.2.0,M11.1.0" #endif struct ttinfo { /* time type information */ int_fast32_t tt_utoff; /* UT offset in seconds */ bool tt_isdst; /* used to set tm_isdst */ int tt_desigidx; /* abbreviation list index */ bool tt_ttisstd; /* transition is std time */ bool tt_ttisut; /* transition is UT */ }; struct lsinfo { /* leap second information */ time_t ls_trans; /* transition time */ int_fast32_t ls_corr; /* correction to apply */ }; #define SMALLEST(a, b) (((a) < (b)) ? (a) : (b)) #define BIGGEST(a, b) (((a) > (b)) ? (a) : (b)) /* This abbreviation means local time is unspecified. */ static char const UNSPEC[] = "-00"; /* How many extra bytes are needed at the end of struct state's chars array. This needs to be at least 1 for null termination in case the input data isn't properly terminated, and it also needs to be big enough for ttunspecified to work without crashing. */ enum { CHARS_EXTRA = BIGGEST(sizeof UNSPEC, 2) - 1 }; #ifdef TZNAME_MAX #define MY_TZNAME_MAX TZNAME_MAX #endif /* defined TZNAME_MAX */ #ifndef TZNAME_MAX #define MY_TZNAME_MAX 255 #endif /* !defined TZNAME_MAX */ struct state { int leapcnt; int timecnt; int typecnt; int charcnt; bool goback; bool goahead; time_t ats[TZ_MAX_TIMES]; unsigned char types[TZ_MAX_TIMES]; struct ttinfo ttis[TZ_MAX_TYPES]; char chars[BIGGEST(BIGGEST(TZ_MAX_CHARS + CHARS_EXTRA, sizeof gmt), (2 * (MY_TZNAME_MAX + 1)))]; struct lsinfo lsis[TZ_MAX_LEAPS]; /* The time type to use for early times or if no transitions. It is always zero for recent tzdb releases. It might be nonzero for data from tzdb 2018e or earlier. */ int defaulttype; }; enum r_type { JULIAN_DAY, /* Jn = Julian day */ DAY_OF_YEAR, /* n = day of year */ MONTH_NTH_DAY_OF_WEEK /* Mm.n.d = month, week, day of week */ }; struct rule { enum r_type r_type; /* type of rule */ int r_day; /* day number of rule */ int r_week; /* week number of rule */ int r_mon; /* month number of rule */ int_fast32_t r_time; /* transition time of rule */ }; static struct tm *gmtsub(struct state const *, time_t const *, int_fast32_t, struct tm *); static bool increment_overflow(int *, int); static bool increment_overflow_time(time_t *, int_fast32_t); static int_fast32_t leapcorr(struct state const *, time_t); static bool normalize_overflow32(int_fast32_t *, int *, int); static struct tm *localtime_timesub(time_t const *, int_fast32_t, struct state const *, struct tm *); static bool localtime_typesequiv(struct state const *, int, int); static bool localtime_tzparse(char const *, struct state *, struct state *); static struct state * lclptr; static struct state * gmtptr; #ifndef TZ_STRLEN_MAX #define TZ_STRLEN_MAX 255 #endif /* !defined TZ_STRLEN_MAX */ static char lcl_TZname[TZ_STRLEN_MAX + 1]; static int lcl_is_set; /* ** Section 4.12.3 of X3.159-1989 requires that ** Except for the strftime function, these functions [asctime, ** ctime, gmtime, localtime] return values in one of two static ** objects: a broken-down time structure and an array of char. ** Thanks to Paul Eggert for noting this. */ static struct tm tm; #if 2 <= HAVE_TZNAME + TZ_TIME_T char * tzname[2] = { (char *) wildabbr, (char *) wildabbr }; #endif #if 2 <= USG_COMPAT + TZ_TIME_T long timezone; int daylight; #endif #if 2 <= ALTZONE + TZ_TIME_T long altzone; #endif /* Initialize *S to a value based on UTOFF, ISDST, and DESIGIDX. */ static void init_ttinfo(struct ttinfo *s, int_fast32_t utoff, bool isdst, int desigidx) { s->tt_utoff = utoff; s->tt_isdst = isdst; s->tt_desigidx = desigidx; s->tt_ttisstd = false; s->tt_ttisut = false; } /* Return true if SP's time type I does not specify local time. */ static bool ttunspecified(struct state const *sp, int i) { char const *abbr = &sp->chars[sp->ttis[i].tt_desigidx]; /* memcmp is likely faster than strcmp, and is safe due to CHARS_EXTRA. */ return memcmp(abbr, UNSPEC, sizeof UNSPEC) == 0; } forceinline int_fast32_t detzcode(const char *const codep) { return READ32BE(codep); } forceinline int_fast64_t detzcode64(const char *const codep) { return READ64BE(codep); } static void update_tzname_etc(struct state const *sp, struct ttinfo const *ttisp) { #if HAVE_TZNAME tzname[ttisp->tt_isdst] = (char *) &sp->chars[ttisp->tt_desigidx]; #endif if (!ttisp->tt_isdst) timezone = - ttisp->tt_utoff; #if ALTZONE if (ttisp->tt_isdst) altzone = - ttisp->tt_utoff; #endif } static void settzname(void) { register struct state * const sp = lclptr; register int i; #if HAVE_TZNAME tzname[0] = tzname[1] = (char *) (sp ? wildabbr : gmt); #endif daylight = 0; timezone = 0; #if ALTZONE altzone = 0; #endif if (sp == NULL) { return; } /* ** And to get the latest time zone abbreviations into tzname. . . */ for (i = 0; i < sp->typecnt; ++i) { register const struct ttinfo * const ttisp = &sp->ttis[i]; update_tzname_etc(sp, ttisp); } for (i = 0; i < sp->timecnt; ++i) { register const struct ttinfo * const ttisp = &sp->ttis[ sp->types[i]]; update_tzname_etc(sp, ttisp); if (ttisp->tt_isdst) daylight = 1; } } static void scrub_abbrs(struct state *sp) { int i; /* ** First, replace bogus characters. */ for (i = 0; i < sp->charcnt; ++i) if (strchr(TZ_ABBR_CHAR_SET, sp->chars[i]) == NULL) sp->chars[i] = TZ_ABBR_ERR_CHAR; /* ** Second, truncate long abbreviations. */ for (i = 0; i < sp->typecnt; ++i) { register const struct ttinfo * const ttisp = &sp->ttis[i]; char *cp = &sp->chars[ttisp->tt_desigidx]; if (strlen(cp) > TZ_ABBR_MAX_LEN && strcmp(cp, GRANDPARENTED) != 0) *(cp + TZ_ABBR_MAX_LEN) = '\0'; } } /* Input buffer for data read from a compiled tz file. */ union input_buffer { /* The first part of the buffer, interpreted as a header. */ struct tzhead tzhead; /* The entire buffer. */ char buf[2 * sizeof(struct tzhead) + 2 * sizeof(struct state) + 4 * TZ_MAX_TIMES]; }; /* TZDIR with a trailing '/' rather than a trailing '\0'. */ static char const tzdirslash[sizeof TZDIR] = TZDIR "/"; /* Local storage needed for 'tzloadbody'. */ union local_storage { /* The results of analyzing the file's contents after it is opened. */ struct file_analysis { /* The input buffer. */ union input_buffer u; /* A temporary state used for parsing a TZ string in the file. */ struct state st; } u; /* The file name to be opened. */ char fullname[BIGGEST(sizeof(struct file_analysis), sizeof tzdirslash + 1024)]; }; /* Load tz data from the file named NAME into *SP. Read extended format if DOEXTEND. Use *LSP for temporary storage. Return 0 on success, an errno value on failure. */ static int localtime_tzloadbody_(char const *name, struct state *sp, bool doextend, union local_storage *lsp) { register int i; register int fid; register int stored; register ssize_t nread; register bool doaccess; register union input_buffer *up = &lsp->u.u; register int tzheadsize = sizeof(struct tzhead); sp->goback = sp->goahead = false; if (! name) { name = TZDEFAULT; if (! name) return EINVAL; } if (name[0] == ':') ++name; #ifdef SUPPRESS_TZDIR /* Do not prepend TZDIR. This is intended for specialized applications only, due to its security implications. */ doaccess = true; #else doaccess = name[0] == '/'; #endif if (!doaccess) { char const *dot; size_t namelen = strlen(name); if (sizeof lsp->fullname - sizeof tzdirslash <= namelen) return ENAMETOOLONG; /* Create a string "TZDIR/NAME". Using sprintf here would pull in stdio (and would fail if the resulting string length exceeded INT_MAX!). */ memcpy(lsp->fullname, tzdirslash, sizeof tzdirslash); strcpy(lsp->fullname + sizeof tzdirslash, name); /* Set doaccess if NAME contains a ".." file name component, as such a name could read a file outside the TZDIR virtual subtree. */ for (dot = name; (dot = strchr(dot, '.')); dot++) if ((dot == name || dot[-1] == '/') && dot[1] == '.' && (dot[2] == '/' || !dot[2])) { doaccess = true; break; } name = lsp->fullname; } if (doaccess && access(name, R_OK) != 0) return errno; fid = open(name, O_RDONLY); if (fid < 0) return errno; nread = read(fid, up->buf, sizeof up->buf); if (nread < tzheadsize) { int err = nread < 0 ? errno : EINVAL; close(fid); return err; } if (close(fid) < 0) return errno; for (stored = 4; stored <= 8; stored *= 2) { char version = up->tzhead.tzh_version[0]; bool skip_datablock = stored == 4 && version; int_fast32_t datablock_size; int_fast32_t ttisstdcnt = detzcode(up->tzhead.tzh_ttisstdcnt); int_fast32_t ttisutcnt = detzcode(up->tzhead.tzh_ttisutcnt); int_fast64_t prevtr = -1; int_fast32_t prevcorr = 0; int_fast32_t leapcnt = detzcode(up->tzhead.tzh_leapcnt); int_fast32_t timecnt = detzcode(up->tzhead.tzh_timecnt); int_fast32_t typecnt = detzcode(up->tzhead.tzh_typecnt); int_fast32_t charcnt = detzcode(up->tzhead.tzh_charcnt); char const *p = up->buf + tzheadsize; /* Although tzfile(5) currently requires typecnt to be nonzero, support future formats that may allow zero typecnt in files that have a TZ string and no transitions. */ if (! (0 <= leapcnt && leapcnt < TZ_MAX_LEAPS && 0 <= typecnt && typecnt < TZ_MAX_TYPES && 0 <= timecnt && timecnt < TZ_MAX_TIMES && 0 <= charcnt && charcnt < TZ_MAX_CHARS && 0 <= ttisstdcnt && ttisstdcnt < TZ_MAX_TYPES && 0 <= ttisutcnt && ttisutcnt < TZ_MAX_TYPES)) return EINVAL; datablock_size = (timecnt * stored /* ats */ + timecnt /* types */ + typecnt * 6 /* ttinfos */ + charcnt /* chars */ + leapcnt * (stored + 4) /* lsinfos */ + ttisstdcnt /* ttisstds */ + ttisutcnt); /* ttisuts */ if (nread < tzheadsize + datablock_size) return EINVAL; if (skip_datablock) p += datablock_size; else { if (! ((ttisstdcnt == typecnt || ttisstdcnt == 0) && (ttisutcnt == typecnt || ttisutcnt == 0))) return EINVAL; sp->leapcnt = leapcnt; sp->timecnt = timecnt; sp->typecnt = typecnt; sp->charcnt = charcnt; /* Read transitions, discarding those out of time_t range. But pretend the last transition before TIME_T_MIN occurred at TIME_T_MIN. */ timecnt = 0; for (i = 0; i < sp->timecnt; ++i) { int_fast64_t at = stored == 4 ? detzcode(p) : detzcode64(p); sp->types[i] = at <= TIME_T_MAX; if (sp->types[i]) { time_t attime = ((TYPE_SIGNED(time_t) ? at < TIME_T_MIN : at < 0) ? TIME_T_MIN : at); if (timecnt && attime <= sp->ats[timecnt - 1]) { if (attime < sp->ats[timecnt - 1]) return EINVAL; sp->types[i - 1] = 0; timecnt--; } sp->ats[timecnt++] = attime; } p += stored; } timecnt = 0; for (i = 0; i < sp->timecnt; ++i) { unsigned char typ = *p++; if (sp->typecnt <= typ) return EINVAL; if (sp->types[i]) sp->types[timecnt++] = typ; } sp->timecnt = timecnt; for (i = 0; i < sp->typecnt; ++i) { register struct ttinfo * ttisp; unsigned char isdst, desigidx; ttisp = &sp->ttis[i]; ttisp->tt_utoff = detzcode(p); p += 4; isdst = *p++; if (! (isdst < 2)) return EINVAL; ttisp->tt_isdst = isdst; desigidx = *p++; if (! (desigidx < sp->charcnt)) return EINVAL; ttisp->tt_desigidx = desigidx; } for (i = 0; i < sp->charcnt; ++i) sp->chars[i] = *p++; /* Ensure '\0'-terminated, and make it safe to call ttunspecified later. */ memset(&sp->chars[i], 0, CHARS_EXTRA); /* Read leap seconds, discarding those out of time_t range. */ leapcnt = 0; for (i = 0; i < sp->leapcnt; ++i) { int_fast64_t tr = stored == 4 ? detzcode(p) : detzcode64(p); int_fast32_t corr = detzcode(p + stored); p += stored + 4; /* Leap seconds cannot occur before the Epoch, or out of order. */ if (tr <= prevtr) return EINVAL; /* To avoid other botches in this code, each leap second's correction must differ from the previous one's by 1 second or less, except that the first correction can be any value; these requirements are more generous than RFC 8536, to allow future RFC extensions. */ if (! (i == 0 || (prevcorr < corr ? corr == prevcorr + 1 : (corr == prevcorr || corr == prevcorr - 1)))) return EINVAL; prevtr = tr; prevcorr = corr; if (tr <= TIME_T_MAX) { sp->lsis[leapcnt].ls_trans = tr; sp->lsis[leapcnt].ls_corr = corr; leapcnt++; } } sp->leapcnt = leapcnt; for (i = 0; i < sp->typecnt; ++i) { register struct ttinfo * ttisp; ttisp = &sp->ttis[i]; if (ttisstdcnt == 0) ttisp->tt_ttisstd = false; else { if (*p != true && *p != false) return EINVAL; ttisp->tt_ttisstd = *p++; } } for (i = 0; i < sp->typecnt; ++i) { register struct ttinfo * ttisp; ttisp = &sp->ttis[i]; if (ttisutcnt == 0) ttisp->tt_ttisut = false; else { if (*p != true && *p != false) return EINVAL; ttisp->tt_ttisut = *p++; } } } nread -= p - up->buf; memmove(up->buf, p, nread); /* If this is an old file, we're done. */ if (!version) break; } if (doextend && nread > 2 && up->buf[0] == '\n' && up->buf[nread - 1] == '\n' && sp->typecnt + 2 <= TZ_MAX_TYPES) { struct state *ts = &lsp->u.st; up->buf[nread - 1] = '\0'; if (localtime_tzparse(&up->buf[1], ts, sp)) { /* Attempt to reuse existing abbreviations. Without this, America/Anchorage would be right on the edge after 2037 when TZ_MAX_CHARS is 50, as sp->charcnt equals 40 (for LMT AST AWT APT AHST AHDT YST AKDT AKST) and ts->charcnt equals 10 (for AKST AKDT). Reusing means sp->charcnt can stay 40 in this example. */ int gotabbr = 0; int charcnt = sp->charcnt; for (i = 0; i < ts->typecnt; i++) { char *tsabbr = ts->chars + ts->ttis[i].tt_desigidx; int j; for (j = 0; j < charcnt; j++) if (strcmp(sp->chars + j, tsabbr) == 0) { ts->ttis[i].tt_desigidx = j; gotabbr++; break; } if (! (j < charcnt)) { int tsabbrlen = strlen(tsabbr); if (j + tsabbrlen < TZ_MAX_CHARS) { strcpy(sp->chars + j, tsabbr); charcnt = j + tsabbrlen + 1; ts->ttis[i].tt_desigidx = j; gotabbr++; } } } if (gotabbr == ts->typecnt) { sp->charcnt = charcnt; /* Ignore any trailing, no-op transitions generated by zic as they don't help here and can run afoul of bugs in zic 2016j or earlier. */ while (1 < sp->timecnt && (sp->types[sp->timecnt - 1] == sp->types[sp->timecnt - 2])) sp->timecnt--; for (i = 0; i < ts->timecnt && sp->timecnt < TZ_MAX_TIMES; i++) { time_t t = ts->ats[i]; if (increment_overflow_time(&t, leapcorr(sp, t)) || (0 < sp->timecnt && t <= sp->ats[sp->timecnt - 1])) continue; sp->ats[sp->timecnt] = t; sp->types[sp->timecnt] = (sp->typecnt + ts->types[i]); sp->timecnt++; } for (i = 0; i < ts->typecnt; i++) sp->ttis[sp->typecnt++] = ts->ttis[i]; } } } if (sp->typecnt == 0) return EINVAL; if (sp->timecnt > 1) { if (sp->ats[0] <= TIME_T_MAX - SECSPERREPEAT) { time_t repeatat = sp->ats[0] + SECSPERREPEAT; int repeattype = sp->types[0]; for (i = 1; i < sp->timecnt; ++i) if (sp->ats[i] == repeatat && localtime_typesequiv(sp, sp->types[i], repeattype)) { sp->goback = true; break; } } if (TIME_T_MIN + SECSPERREPEAT <= sp->ats[sp->timecnt - 1]) { time_t repeatat = sp->ats[sp->timecnt - 1] - SECSPERREPEAT; int repeattype = sp->types[sp->timecnt - 1]; for (i = sp->timecnt - 2; i >= 0; --i) if (sp->ats[i] == repeatat && localtime_typesequiv(sp, sp->types[i], repeattype)) { sp->goahead = true; break; } } } /* Infer sp->defaulttype from the data. Although this default type is always zero for data from recent tzdb releases, things are trickier for data from tzdb 2018e or earlier. The first set of heuristics work around bugs in 32-bit data generated by tzdb 2013c or earlier. The workaround is for zones like Australia/Macquarie where timestamps before the first transition have a time type that is not the earliest standard-time type. See: https://mm.icann.org/pipermail/tz/2013-May/019368.html */ /* ** If type 0 does not specify local time, or is unused in transitions, ** it's the type to use for early times. */ for (i = 0; i < sp->timecnt; ++i) if (sp->types[i] == 0) break; i = i < sp->timecnt && ! ttunspecified(sp, 0) ? -1 : 0; /* ** Absent the above, ** if there are transition times ** and the first transition is to a daylight time ** find the standard type less than and closest to ** the type of the first transition. */ if (i < 0 && sp->timecnt > 0 && sp->ttis[sp->types[0]].tt_isdst) { i = sp->types[0]; while (--i >= 0) if (!sp->ttis[i].tt_isdst) break; } /* The next heuristics are for data generated by tzdb 2018e or earlier, for zones like EST5EDT where the first transition is to DST. */ /* ** If no result yet, find the first standard type. ** If there is none, punt to type zero. */ if (i < 0) { i = 0; while (sp->ttis[i].tt_isdst) if (++i >= sp->typecnt) { i = 0; break; } } /* A simple 'sp->defaulttype = 0;' would suffice here if we didn't have to worry about 2018e-or-earlier data. Even simpler would be to remove the defaulttype member and just use 0 in its place. */ sp->defaulttype = i; return 0; } static int /* [jart] pthread cancellation safe */ localtime_tzloadbody(char const *name, struct state *sp, bool doextend, union local_storage *lsp) { int rc; BLOCK_CANCELLATIONS; rc = localtime_tzloadbody_(name, sp, doextend, lsp); ALLOW_CANCELLATIONS; return rc; } /* Load tz data from the file named NAME into *SP. Read extended format if DOEXTEND. Return 0 on success, an errno value on failure. */ static int localtime_tzload(char const *name, struct state *sp, bool doextend) { union local_storage *lsp = malloc(sizeof *lsp); if (!lsp) { return HAVE_MALLOC_ERRNO ? errno : ENOMEM; } else { int err = localtime_tzloadbody(name, sp, doextend, lsp); free(lsp); return err; } } static bool localtime_typesequiv(const struct state *sp, int a, int b) { register bool result; if (sp == NULL || a < 0 || a >= sp->typecnt || b < 0 || b >= sp->typecnt) result = false; else { register const struct ttinfo * ap = &sp->ttis[a]; register const struct ttinfo * bp = &sp->ttis[b]; result = (ap->tt_utoff == bp->tt_utoff && ap->tt_isdst == bp->tt_isdst && ap->tt_ttisstd == bp->tt_ttisstd && ap->tt_ttisut == bp->tt_ttisut && (strcmp(&sp->chars[ap->tt_desigidx], &sp->chars[bp->tt_desigidx]) == 0)); } return result; } static const int mon_lengths[2][MONSPERYEAR] = { { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }, { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 } }; static const int year_lengths[2] = { DAYSPERNYEAR, DAYSPERLYEAR }; /* Is C an ASCII digit? */ static inline bool is_digit(char c) { return '0' <= c && c <= '9'; } /* ** Given a pointer into a timezone string, scan until a character that is not ** a valid character in a time zone abbreviation is found. ** Return a pointer to that character. */ static nosideeffect const char * getzname(register const char *strp) { register char c; while ((c = *strp) != '\0' && !is_digit(c) && c != ',' && c != '-' && c != '+') ++strp; return strp; } /* ** Given a pointer into an extended timezone string, scan until the ending ** delimiter of the time zone abbreviation is located. ** Return a pointer to the delimiter. ** ** As with getzname above, the legal character set is actually quite ** restricted, with other characters producing undefined results. ** We don't do any checking here; checking is done later in common-case code. */ static nosideeffect const char * getqzname(register const char *strp, const int delim) { register int c; while ((c = *strp) != '\0' && c != delim) ++strp; return strp; } /* ** Given a pointer into a timezone string, extract a number from that string. ** Check that the number is within a specified range; if it is not, return ** NULL. ** Otherwise, return a pointer to the first character not part of the number. */ static const char * getnum(register const char *strp, int *const nump, const int min, const int max) { register char c; register int num; if (strp == NULL || !is_digit(c = *strp)) return NULL; num = 0; do { num = num * 10 + (c - '0'); if (num > max) return NULL; /* illegal value */ c = *++strp; } while (is_digit(c)); if (num < min) return NULL; /* illegal value */ *nump = num; return strp; } /* ** Given a pointer into a timezone string, extract a number of seconds, ** in hh[:mm[:ss]] form, from the string. ** If any error occurs, return NULL. ** Otherwise, return a pointer to the first character not part of the number ** of seconds. */ static const char * getsecs(register const char *strp, int_fast32_t *const secsp) { int num; int_fast32_t secsperhour = SECSPERHOUR; /* ** 'HOURSPERDAY * DAYSPERWEEK - 1' allows quasi-Posix rules like ** "M10.4.6/26", which does not conform to Posix, ** but which specifies the equivalent of ** "02:00 on the first Sunday on or after 23 Oct". */ strp = getnum(strp, &num, 0, HOURSPERDAY * DAYSPERWEEK - 1); if (strp == NULL) return NULL; *secsp = num * secsperhour; if (*strp == ':') { ++strp; strp = getnum(strp, &num, 0, MINSPERHOUR - 1); if (strp == NULL) return NULL; *secsp += num * SECSPERMIN; if (*strp == ':') { ++strp; /* 'SECSPERMIN' allows for leap seconds. */ strp = getnum(strp, &num, 0, SECSPERMIN); if (strp == NULL) return NULL; *secsp += num; } } return strp; } /* ** Given a pointer into a timezone string, extract an offset, in ** [+-]hh[:mm[:ss]] form, from the string. ** If any error occurs, return NULL. ** Otherwise, return a pointer to the first character not part of the time. */ static const char * getoffset(register const char *strp, int_fast32_t *const offsetp) { register bool neg = false; if (*strp == '-') { neg = true; ++strp; } else if (*strp == '+') ++strp; strp = getsecs(strp, offsetp); if (strp == NULL) return NULL; /* illegal time */ if (neg) *offsetp = -*offsetp; return strp; } /* ** Given a pointer into a timezone string, extract a rule in the form ** date[/time]. See POSIX section 8 for the format of "date" and "time". ** If a valid rule is not found, return NULL. ** Otherwise, return a pointer to the first character not part of the rule. */ static const char * getrule(const char *strp, register struct rule *const rulep) { if (*strp == 'J') { /* ** Julian day. */ rulep->r_type = JULIAN_DAY; ++strp; strp = getnum(strp, &rulep->r_day, 1, DAYSPERNYEAR); } else if (*strp == 'M') { /* ** Month, week, day. */ rulep->r_type = MONTH_NTH_DAY_OF_WEEK; ++strp; strp = getnum(strp, &rulep->r_mon, 1, MONSPERYEAR); if (strp == NULL) return NULL; if (*strp++ != '.') return NULL; strp = getnum(strp, &rulep->r_week, 1, 5); if (strp == NULL) return NULL; if (*strp++ != '.') return NULL; strp = getnum(strp, &rulep->r_day, 0, DAYSPERWEEK - 1); } else if (is_digit(*strp)) { /* ** Day of year. */ rulep->r_type = DAY_OF_YEAR; strp = getnum(strp, &rulep->r_day, 0, DAYSPERLYEAR - 1); } else return NULL; /* invalid format */ if (strp == NULL) return NULL; if (*strp == '/') { /* ** Time specified. */ ++strp; strp = getoffset(strp, &rulep->r_time); } else rulep->r_time = 2 * SECSPERHOUR; /* default = 2:00:00 */ return strp; } /* ** Given a year, a rule, and the offset from UT at the time that rule takes ** effect, calculate the year-relative time that rule takes effect. */ static int_fast32_t transtime(const int year, register const struct rule *const rulep, const int_fast32_t offset) { register bool leapyear; register int_fast32_t value; register int i; int d, m1, yy0, yy1, yy2, dow; leapyear = isleap(year); switch (rulep->r_type) { case JULIAN_DAY: /* ** Jn - Julian day, 1 == January 1, 60 == March 1 even in leap ** years. ** In non-leap years, or if the day number is 59 or less, just ** add SECSPERDAY times the day number-1 to the time of ** January 1, midnight, to get the day. */ value = (rulep->r_day - 1) * SECSPERDAY; if (leapyear && rulep->r_day >= 60) value += SECSPERDAY; break; case DAY_OF_YEAR: /* ** n - day of year. ** Just add SECSPERDAY times the day number to the time of ** January 1, midnight, to get the day. */ value = rulep->r_day * SECSPERDAY; break; case MONTH_NTH_DAY_OF_WEEK: /* ** Mm.n.d - nth "dth day" of month m. */ /* ** Use Zeller's Congruence to get day-of-week of first day of ** month. */ m1 = (rulep->r_mon + 9) % 12 + 1; yy0 = (rulep->r_mon <= 2) ? (year - 1) : year; yy1 = yy0 / 100; yy2 = yy0 % 100; dow = ((26 * m1 - 2) / 10 + 1 + yy2 + yy2 / 4 + yy1 / 4 - 2 * yy1) % 7; if (dow < 0) dow += DAYSPERWEEK; /* ** "dow" is the day-of-week of the first day of the month. Get ** the day-of-month (zero-origin) of the first "dow" day of the ** month. */ d = rulep->r_day - dow; if (d < 0) d += DAYSPERWEEK; for (i = 1; i < rulep->r_week; ++i) { if (d + DAYSPERWEEK >= mon_lengths[leapyear][rulep->r_mon - 1]) break; d += DAYSPERWEEK; } /* ** "d" is the day-of-month (zero-origin) of the day we want. */ value = d * SECSPERDAY; for (i = 0; i < rulep->r_mon - 1; ++i) value += mon_lengths[leapyear][i] * SECSPERDAY; break; default: UNREACHABLE(); } /* ** "value" is the year-relative time of 00:00:00 UT on the day in ** question. To get the year-relative time of the specified local ** time on that day, add the transition time and the current offset ** from UT. */ return value + rulep->r_time + offset; } /* ** Given a POSIX section 8-style TZ string, fill in the rule tables as ** appropriate. */ static bool localtime_tzparse(const char *name, struct state *sp, struct state *basep) { const char * stdname; const char * dstname; size_t stdlen; size_t dstlen; size_t charcnt; int_fast32_t stdoffset; int_fast32_t dstoffset; register char * cp; register bool load_ok; time_t atlo = TIME_T_MIN, leaplo = TIME_T_MIN; stdname = name; if (*name == '<') { name++; stdname = name; name = getqzname(name, '>'); if (*name != '>') return false; stdlen = name - stdname; name++; } else { name = getzname(name); stdlen = name - stdname; } if (!stdlen) return false; name = getoffset(name, &stdoffset); if (name == NULL) return false; charcnt = stdlen + 1; if (sizeof sp->chars < charcnt) return false; if (basep) { if (0 < basep->timecnt) atlo = basep->ats[basep->timecnt - 1]; load_ok = false; sp->leapcnt = basep->leapcnt; memcpy(sp->lsis, basep->lsis, sp->leapcnt * sizeof *sp->lsis); } else { load_ok = localtime_tzload(TZDEFRULES, sp, false) == 0; if (!load_ok) sp->leapcnt = 0; /* So, we're off a little. */ } if (0 < sp->leapcnt) leaplo = sp->lsis[sp->leapcnt - 1].ls_trans; if (*name != '\0') { if (*name == '<') { dstname = ++name; name = getqzname(name, '>'); if (*name != '>') return false; dstlen = name - dstname; name++; } else { dstname = name; name = getzname(name); dstlen = name - dstname; /* length of DST abbr. */ } if (!dstlen) return false; charcnt += dstlen + 1; if (sizeof sp->chars < charcnt) return false; if (*name != '\0' && *name != ',' && *name != ';') { name = getoffset(name, &dstoffset); if (name == NULL) return false; } else dstoffset = stdoffset - SECSPERHOUR; if (*name == '\0' && !load_ok) name = TZDEFRULESTRING; if (*name == ',' || *name == ';') { struct rule start; struct rule end; register int year; register int timecnt; time_t janfirst; int_fast32_t janoffset = 0; int yearbeg, yearlim; ++name; if ((name = getrule(name, &start)) == NULL) return false; if (*name++ != ',') return false; if ((name = getrule(name, &end)) == NULL) return false; if (*name != '\0') return false; sp->typecnt = 2; /* standard time and DST */ /* ** Two transitions per year, from EPOCH_YEAR forward. */ init_ttinfo(&sp->ttis[0], -stdoffset, false, 0); init_ttinfo(&sp->ttis[1], -dstoffset, true, stdlen + 1); sp->defaulttype = 0; timecnt = 0; janfirst = 0; yearbeg = EPOCH_YEAR; do { int_fast32_t yearsecs = year_lengths[isleap(yearbeg - 1)] * SECSPERDAY; yearbeg--; if (increment_overflow_time(&janfirst, -yearsecs)) { janoffset = -yearsecs; break; } } while (atlo < janfirst && EPOCH_YEAR - YEARSPERREPEAT / 2 < yearbeg); while (true) { int_fast32_t yearsecs = year_lengths[isleap(yearbeg)] * SECSPERDAY; int yearbeg1 = yearbeg; time_t janfirst1 = janfirst; if (increment_overflow_time(&janfirst1, yearsecs) || increment_overflow(&yearbeg1, 1) || atlo <= janfirst1) break; yearbeg = yearbeg1; janfirst = janfirst1; } yearlim = yearbeg; if (increment_overflow(&yearlim, YEARSPERREPEAT + 1)) yearlim = INT_MAX; for (year = yearbeg; year < yearlim; year++) { int_fast32_t starttime = transtime(year, &start, stdoffset), endtime = transtime(year, &end, dstoffset); int_fast32_t yearsecs = (year_lengths[isleap(year)] * SECSPERDAY); bool reversed = endtime < starttime; if (reversed) { int_fast32_t swap = starttime; starttime = endtime; endtime = swap; } if (reversed || (starttime < endtime && endtime - starttime < yearsecs)) { if (TZ_MAX_TIMES - 2 < timecnt) break; sp->ats[timecnt] = janfirst; if (! increment_overflow_time (&sp->ats[timecnt], janoffset + starttime) && atlo <= sp->ats[timecnt]) sp->types[timecnt++] = !reversed; sp->ats[timecnt] = janfirst; if (! increment_overflow_time (&sp->ats[timecnt], janoffset + endtime) && atlo <= sp->ats[timecnt]) { sp->types[timecnt++] = reversed; } } if (endtime < leaplo) { yearlim = year; if (increment_overflow(&yearlim, YEARSPERREPEAT + 1)) yearlim = INT_MAX; } if (increment_overflow_time (&janfirst, janoffset + yearsecs)) break; janoffset = 0; } sp->timecnt = timecnt; if (! timecnt) { sp->ttis[0] = sp->ttis[1]; sp->typecnt = 1; /* Perpetual DST. */ } else if (YEARSPERREPEAT < year - yearbeg) sp->goback = sp->goahead = true; } else { register int_fast32_t theirstdoffset; register int_fast32_t theirdstoffset; register int_fast32_t theiroffset; register bool isdst; register int i; register int j; if (*name != '\0') return false; /* ** Initial values of theirstdoffset and theirdstoffset. */ theirstdoffset = 0; for (i = 0; i < sp->timecnt; ++i) { j = sp->types[i]; if (!sp->ttis[j].tt_isdst) { theirstdoffset = - sp->ttis[j].tt_utoff; break; } } theirdstoffset = 0; for (i = 0; i < sp->timecnt; ++i) { j = sp->types[i]; if (sp->ttis[j].tt_isdst) { theirdstoffset = - sp->ttis[j].tt_utoff; break; } } /* ** Initially we're assumed to be in standard time. */ isdst = false; /* ** Now juggle transition times and types ** tracking offsets as you do. */ for (i = 0; i < sp->timecnt; ++i) { j = sp->types[i]; sp->types[i] = sp->ttis[j].tt_isdst; if (sp->ttis[j].tt_ttisut) { /* No adjustment to transition time */ } else { /* ** If daylight saving time is in ** effect, and the transition time was ** not specified as standard time, add ** the daylight saving time offset to ** the transition time; otherwise, add ** the standard time offset to the ** transition time. */ /* ** Transitions from DST to DDST ** will effectively disappear since ** POSIX provides for only one DST ** offset. */ if (isdst && !sp->ttis[j].tt_ttisstd) { sp->ats[i] += dstoffset - theirdstoffset; } else { sp->ats[i] += stdoffset - theirstdoffset; } } theiroffset = -sp->ttis[j].tt_utoff; if (sp->ttis[j].tt_isdst) theirdstoffset = theiroffset; else theirstdoffset = theiroffset; } /* ** Finally, fill in ttis. */ init_ttinfo(&sp->ttis[0], -stdoffset, false, 0); init_ttinfo(&sp->ttis[1], -dstoffset, true, stdlen + 1); sp->typecnt = 2; sp->defaulttype = 0; } } else { dstlen = 0; sp->typecnt = 1; /* only standard time */ sp->timecnt = 0; init_ttinfo(&sp->ttis[0], -stdoffset, false, 0); sp->defaulttype = 0; } sp->charcnt = charcnt; cp = sp->chars; memcpy(cp, stdname, stdlen); cp += stdlen; *cp++ = '\0'; if (dstlen != 0) { memcpy(cp, dstname, dstlen); *(cp + dstlen) = '\0'; } return true; } static void gmtload(struct state *const sp) { if (localtime_tzload(gmt, sp, true) != 0) localtime_tzparse("GMT0", sp, NULL); } /* Initialize *SP to a value appropriate for the TZ setting NAME. Return 0 on success, an errno value on failure. */ static int zoneinit(struct state *sp, char const *name) { if (name && ! name[0]) { /* ** User wants it fast rather than right. */ sp->leapcnt = 0; /* so, we're off a little */ sp->timecnt = 0; sp->typecnt = 0; sp->charcnt = 0; sp->goback = sp->goahead = false; init_ttinfo(&sp->ttis[0], 0, false, 0); strcpy(sp->chars, gmt); sp->defaulttype = 0; return 0; } else { int err = localtime_tzload(name, sp, true); if (err != 0 && name && name[0] != ':' && localtime_tzparse(name, sp, NULL)) err = 0; if (err == 0) scrub_abbrs(sp); return err; } } static void FreeLocaltime(void *p) { free(p); } static void localtime_tzset_unlocked(void) { char const *name = getenv("TZ"); struct state *sp = lclptr; int lcl = name ? strlen(name) < sizeof lcl_TZname : -1; if (lcl < 0 ? lcl_is_set < 0 : 0 < lcl_is_set && strcmp(lcl_TZname, name) == 0) return; if (!sp) { lclptr = sp = malloc(sizeof *lclptr); __cxa_atexit(FreeLocaltime, sp, 0); } if (sp) { if (zoneinit(sp, name) != 0) zoneinit(sp, ""); if (0 < lcl) strcpy(lcl_TZname, name); } settzname(); lcl_is_set = lcl; } void tzset(void) { localtime_lock(); localtime_tzset_unlocked(); localtime_unlock(); } static void FreeGmt(void *p) { free(p); } static void localtime_gmtcheck(void) { static bool gmt_is_set; localtime_lock(); if (! gmt_is_set) { gmtptr = malloc(sizeof *gmtptr); __cxa_atexit(FreeGmt, gmtptr, 0); if (gmtptr) gmtload(gmtptr); gmt_is_set = true; } localtime_unlock(); } /* ** The easy way to behave "as if no library function calls" localtime ** is to not call it, so we drop its guts into "localsub", which can be ** freely called. (And no, the PANS doesn't require the above behavior, ** but it *is* desirable.) ** ** If successful and SETNAME is nonzero, ** set the applicable parts of tzname, timezone and altzone; ** however, it's OK to omit this step if the timezone is POSIX-compatible, ** since in that case tzset should have already done this step correctly. ** SETNAME's type is int_fast32_t for compatibility with gmtsub, ** but it is actually a boolean and its value should be 0 or 1. */ /*ARGSUSED*/ static struct tm * localsub(struct state const *sp, time_t const *timep, int_fast32_t setname, struct tm *const tmp) { register const struct ttinfo * ttisp; register int i; register struct tm * result; const time_t t = *timep; if (sp == NULL) { /* Don't bother to set tzname etc.; tzset has already done it. */ return gmtsub(gmtptr, timep, 0, tmp); } if ((sp->goback && t < sp->ats[0]) || (sp->goahead && t > sp->ats[sp->timecnt - 1])) { time_t newt; register time_t seconds; register time_t years; if (t < sp->ats[0]) seconds = sp->ats[0] - t; else seconds = t - sp->ats[sp->timecnt - 1]; --seconds; /* Beware integer overflow, as SECONDS might be close to the maximum time_t. */ years = seconds / SECSPERREPEAT * YEARSPERREPEAT; seconds = years * AVGSECSPERYEAR; years += YEARSPERREPEAT; if (t < sp->ats[0]) newt = t + seconds + SECSPERREPEAT; else newt = t - seconds - SECSPERREPEAT; if (newt < sp->ats[0] || newt > sp->ats[sp->timecnt - 1]) return NULL; /* "cannot happen" */ result = localsub(sp, &newt, setname, tmp); if (result) { register int_fast64_t newy; newy = result->tm_year; if (t < sp->ats[0]) newy -= years; else newy += years; if (! (INT_MIN <= newy && newy <= INT_MAX)) return NULL; result->tm_year = newy; } return result; } if (sp->timecnt == 0 || t < sp->ats[0]) { i = sp->defaulttype; } else { register int lo = 1; register int hi = sp->timecnt; while (lo < hi) { register int mid = (lo + hi) >> 1; if (t < sp->ats[mid]) hi = mid; else lo = mid + 1; } i = sp->types[lo - 1]; } ttisp = &sp->ttis[i]; /* ** To get (wrong) behavior that's compatible with System V Release 2.0 ** you'd replace the statement below with ** t += ttisp->tt_utoff; ** timesub(&t, 0L, sp, tmp); */ result = localtime_timesub(&t, ttisp->tt_utoff, sp, tmp); if (result) { result->tm_isdst = ttisp->tt_isdst; result->tm_zone = (char *) &sp->chars[ttisp->tt_desigidx]; if (setname) update_tzname_etc(sp, ttisp); } return result; } static struct tm * localtime_tzset(time_t const *timep, struct tm *tmp, bool setname) { localtime_lock(); if (setname || !lcl_is_set) localtime_tzset_unlocked(); tmp = localsub(lclptr, timep, setname, tmp); localtime_unlock(); return tmp; } struct tm * localtime(const time_t *timep) { return localtime_tzset(timep, &tm, true); } struct tm * localtime_r(const time_t *timep, struct tm *tmp) { return localtime_tzset(timep, tmp, false); } /* ** gmtsub is to gmtime as localsub is to localtime. */ static struct tm * gmtsub(struct state const *sp, time_t const *timep, int_fast32_t offset, struct tm *tmp) { register struct tm * result; result = localtime_timesub(timep, offset, gmtptr, tmp); /* ** Could get fancy here and deliver something such as ** "+xx" or "-xx" if offset is non-zero, ** but this is no time for a treasure hunt. */ tmp->tm_zone = ((char *) (offset ? wildabbr : gmtptr ? gmtptr->chars : gmt)); return result; } /* * Re-entrant version of gmtime. */ struct tm * gmtime_r(const time_t *timep, struct tm *tmp) { localtime_gmtcheck(); return gmtsub(gmtptr, timep, 0, tmp); } struct tm * gmtime(const time_t *timep) { return gmtime_r(timep, &tm); } /* ** Return the number of leap years through the end of the given year ** where, to make the math easy, the answer for year zero is defined as zero. */ static time_t leaps_thru_end_of_nonneg(time_t y) { return y / 4 - y / 100 + y / 400; } static time_t leaps_thru_end_of(time_t y) { return (y < 0 ? -1 - leaps_thru_end_of_nonneg(-1 - y) : leaps_thru_end_of_nonneg(y)); } static struct tm * localtime_timesub(const time_t *timep, int_fast32_t offset, const struct state *sp, struct tm *tmp) { register const struct lsinfo * lp; register time_t tdays; register const int * ip; register int_fast32_t corr; register int i; int_fast32_t idays, rem, dayoff, dayrem; time_t y; /* If less than SECSPERMIN, the number of seconds since the most recent positive leap second; otherwise, do not add 1 to localtime tm_sec because of leap seconds. */ time_t secs_since_posleap = SECSPERMIN; corr = 0; i = (sp == NULL) ? 0 : sp->leapcnt; while (--i >= 0) { lp = &sp->lsis[i]; if (*timep >= lp->ls_trans) { corr = lp->ls_corr; if ((i == 0 ? 0 : lp[-1].ls_corr) < corr) secs_since_posleap = *timep - lp->ls_trans; break; } } /* Calculate the year, avoiding integer overflow even if time_t is unsigned. */ tdays = *timep / SECSPERDAY; rem = *timep % SECSPERDAY; rem += offset % SECSPERDAY - corr % SECSPERDAY + 3 * SECSPERDAY; dayoff = offset / SECSPERDAY - corr / SECSPERDAY + rem / SECSPERDAY - 3; rem %= SECSPERDAY; /* y = (EPOCH_YEAR + floor((tdays + dayoff) / DAYSPERREPEAT) * YEARSPERREPEAT), sans overflow. But calculate against 1570 (EPOCH_YEAR - YEARSPERREPEAT) instead of against 1970 so that things work for localtime values before 1970 when time_t is unsigned. */ dayrem = tdays % DAYSPERREPEAT; dayrem += dayoff % DAYSPERREPEAT; y = (EPOCH_YEAR - YEARSPERREPEAT + ((1 + dayoff / DAYSPERREPEAT + dayrem / DAYSPERREPEAT - ((dayrem % DAYSPERREPEAT) < 0) + tdays / DAYSPERREPEAT) * YEARSPERREPEAT)); /* idays = (tdays + dayoff) mod DAYSPERREPEAT, sans overflow. */ idays = tdays % DAYSPERREPEAT; idays += dayoff % DAYSPERREPEAT + 2 * DAYSPERREPEAT; idays %= DAYSPERREPEAT; /* Increase Y and decrease IDAYS until IDAYS is in range for Y. */ while (year_lengths[isleap(y)] <= idays) { int tdelta = idays / DAYSPERLYEAR; int_fast32_t ydelta = tdelta + !tdelta; time_t newy = y + ydelta; register int leapdays; leapdays = leaps_thru_end_of(newy - 1) - leaps_thru_end_of(y - 1); idays -= ydelta * DAYSPERNYEAR; idays -= leapdays; y = newy; } if (!TYPE_SIGNED(time_t) && y < TM_YEAR_BASE) { int signed_y = y; tmp->tm_year = signed_y - TM_YEAR_BASE; } else if ((!TYPE_SIGNED(time_t) || INT_MIN + TM_YEAR_BASE <= y) && y - TM_YEAR_BASE <= INT_MAX) tmp->tm_year = y - TM_YEAR_BASE; else { errno = EOVERFLOW; return NULL; } tmp->tm_yday = idays; /* ** The "extra" mods below avoid overflow problems. */ tmp->tm_wday = (TM_WDAY_BASE + ((tmp->tm_year % DAYSPERWEEK) * (DAYSPERNYEAR % DAYSPERWEEK)) + leaps_thru_end_of(y - 1) - leaps_thru_end_of(TM_YEAR_BASE - 1) + idays); tmp->tm_wday %= DAYSPERWEEK; if (tmp->tm_wday < 0) tmp->tm_wday += DAYSPERWEEK; tmp->tm_hour = rem / SECSPERHOUR; rem %= SECSPERHOUR; tmp->tm_min = rem / SECSPERMIN; tmp->tm_sec = rem % SECSPERMIN; /* Use "... ??:??:60" at the end of the localtime minute containing the second just before the positive leap second. */ tmp->tm_sec += secs_since_posleap <= tmp->tm_sec; ip = mon_lengths[isleap(y)]; for (tmp->tm_mon = 0; idays >= ip[tmp->tm_mon]; ++(tmp->tm_mon)) idays -= ip[tmp->tm_mon]; tmp->tm_mday = idays + 1; tmp->tm_isdst = 0; tmp->tm_gmtoff = offset; return tmp; } /* ** Adapted from code provided by Robert Elz, who writes: ** The "best" way to do mktime I think is based on an idea of Bob ** Kridle's (so its said...) from a long time ago. ** It does a binary search of the time_t space. Since time_t's are ** just 32 bits, its a max of 32 iterations (even at 64 bits it ** would still be very reasonable). */ #ifndef WRONG #define WRONG (-1) #endif /* !defined WRONG */ /* ** Normalize logic courtesy Paul Eggert. */ forceinline bool increment_overflow(int *ip, int j) { #if defined(__GNUC__) && __GNUC__ >= 6 int i = *ip; if (__builtin_add_overflow(i, j, &i)) return true; *ip = i; return false; #else register int const i = *ip; /* ** If i >= 0 there can only be overflow if i + j > INT_MAX ** or if j > INT_MAX - i; given i >= 0, INT_MAX - i cannot overflow. ** If i < 0 there can only be overflow if i + j < INT_MIN ** or if j < INT_MIN - i; given i < 0, INT_MIN - i cannot overflow. */ if ((i >= 0) ? (j > INT_MAX - i) : (j < INT_MIN - i)) return true; *ip += j; return false; #endif } forceinline bool increment_overflow32(int_fast32_t *const lp, int const m) { #if defined(__GNUC__) && __GNUC__ >= 6 int_fast32_t i = *lp; if (__builtin_add_overflow(i, m, &i)) return true; *lp = i; return false; #else register int_fast32_t const l = *lp; if ((l >= 0) ? (m > INT_FAST32_MAX - l) : (m < INT_FAST32_MIN - l)) return true; *lp += m; return false; #endif } forceinline bool increment_overflow_time(time_t *tp, int_fast32_t j) { #if defined(__GNUC__) && __GNUC__ >= 6 time_t i = *tp; if (__builtin_add_overflow(i, j, &i)) return true; *tp = i; return false; #else /* ** This is like ** 'if (! (TIME_T_MIN <= *tp + j && *tp + j <= TIME_T_MAX)) ...', ** except that it does the right thing even if *tp + j would overflow. */ if (! (j < 0 ? (TYPE_SIGNED(time_t) ? TIME_T_MIN - j <= *tp : -1 - j < *tp) : *tp <= TIME_T_MAX - j)) return true; *tp += j; return false; #endif } static bool normalize_overflow(int *const tensptr, int *const unitsptr, const int base) { register int tensdelta; tensdelta = (*unitsptr >= 0) ? (*unitsptr / base) : (-1 - (-1 - *unitsptr) / base); *unitsptr -= tensdelta * base; return increment_overflow(tensptr, tensdelta); } static bool normalize_overflow32(int_fast32_t *tensptr, int *unitsptr, int base) { register int tensdelta; tensdelta = (*unitsptr >= 0) ? (*unitsptr / base) : (-1 - (-1 - *unitsptr) / base); *unitsptr -= tensdelta * base; return increment_overflow32(tensptr, tensdelta); } static int tmcomp(register const struct tm *const atmp, register const struct tm *const btmp) { register int result; if (atmp->tm_year != btmp->tm_year) return atmp->tm_year < btmp->tm_year ? -1 : 1; if ((result = (atmp->tm_mon - btmp->tm_mon)) == 0 && (result = (atmp->tm_mday - btmp->tm_mday)) == 0 && (result = (atmp->tm_hour - btmp->tm_hour)) == 0 && (result = (atmp->tm_min - btmp->tm_min)) == 0) result = atmp->tm_sec - btmp->tm_sec; return result; } static time_t localtime_time2sub( struct tm *const tmp, struct tm *(*funcp)(struct state const *, time_t const *, int_fast32_t, struct tm *), struct state const *sp, const int_fast32_t offset, bool *okayp, bool do_norm_secs) { register int dir; register int i, j; register int saved_seconds; register int_fast32_t li; register time_t lo; register time_t hi; int_fast32_t y; time_t newt; time_t t; struct tm yourtm, mytm; *okayp = false; yourtm = *tmp; if (do_norm_secs) { if (normalize_overflow(&yourtm.tm_min, &yourtm.tm_sec, SECSPERMIN)) return WRONG; } if (normalize_overflow(&yourtm.tm_hour, &yourtm.tm_min, MINSPERHOUR)) return WRONG; if (normalize_overflow(&yourtm.tm_mday, &yourtm.tm_hour, HOURSPERDAY)) return WRONG; y = yourtm.tm_year; if (normalize_overflow32(&y, &yourtm.tm_mon, MONSPERYEAR)) return WRONG; /* ** Turn y into an actual year number for now. ** It is converted back to an offset from TM_YEAR_BASE later. */ if (increment_overflow32(&y, TM_YEAR_BASE)) return WRONG; while (yourtm.tm_mday <= 0) { if (increment_overflow32(&y, -1)) return WRONG; li = y + (1 < yourtm.tm_mon); yourtm.tm_mday += year_lengths[isleap(li)]; } while (yourtm.tm_mday > DAYSPERLYEAR) { li = y + (1 < yourtm.tm_mon); yourtm.tm_mday -= year_lengths[isleap(li)]; if (increment_overflow32(&y, 1)) return WRONG; } for ( ; ; ) { i = mon_lengths[isleap(y)][yourtm.tm_mon]; if (yourtm.tm_mday <= i) break; yourtm.tm_mday -= i; if (++yourtm.tm_mon >= MONSPERYEAR) { yourtm.tm_mon = 0; if (increment_overflow32(&y, 1)) return WRONG; } } if (increment_overflow32(&y, -TM_YEAR_BASE)) return WRONG; if (! (INT_MIN <= y && y <= INT_MAX)) return WRONG; yourtm.tm_year = y; if (yourtm.tm_sec >= 0 && yourtm.tm_sec < SECSPERMIN) saved_seconds = 0; else if (y + TM_YEAR_BASE < EPOCH_YEAR) { /* ** We can't set tm_sec to 0, because that might push the ** time below the minimum representable time. ** Set tm_sec to 59 instead. ** This assumes that the minimum representable time is ** not in the same minute that a leap second was deleted from, ** which is a safer assumption than using 58 would be. */ if (increment_overflow(&yourtm.tm_sec, 1 - SECSPERMIN)) return WRONG; saved_seconds = yourtm.tm_sec; yourtm.tm_sec = SECSPERMIN - 1; } else { saved_seconds = yourtm.tm_sec; yourtm.tm_sec = 0; } /* ** Do a binary search (this works whatever time_t's type is). */ lo = TIME_T_MIN; hi = TIME_T_MAX; for ( ; ; ) { t = lo / 2 + hi / 2; if (t < lo) t = lo; else if (t > hi) t = hi; if (! funcp(sp, &t, offset, &mytm)) { /* ** Assume that t is too extreme to be represented in ** a struct tm; arrange things so that it is less ** extreme on the next pass. */ dir = (t > 0) ? 1 : -1; } else dir = tmcomp(&mytm, &yourtm); if (dir != 0) { if (t == lo) { if (t == TIME_T_MAX) return WRONG; ++t; ++lo; } else if (t == hi) { if (t == TIME_T_MIN) return WRONG; --t; --hi; } if (lo > hi) return WRONG; if (dir > 0) hi = t; else lo = t; continue; } #if defined TM_GMTOFF && ! UNINIT_TRAP if (mytm.TM_GMTOFF != yourtm.TM_GMTOFF && (yourtm.TM_GMTOFF < 0 ? (-SECSPERDAY <= yourtm.TM_GMTOFF && (mytm.TM_GMTOFF <= (SMALLEST(INT_FAST32_MAX, LONG_MAX) + yourtm.TM_GMTOFF))) : (yourtm.TM_GMTOFF <= SECSPERDAY && ((BIGGEST(INT_FAST32_MIN, LONG_MIN) + yourtm.TM_GMTOFF) <= mytm.TM_GMTOFF)))) { /* MYTM matches YOURTM except with the wrong UT offset. YOURTM.TM_GMTOFF is plausible, so try it instead. It's OK if YOURTM.TM_GMTOFF contains uninitialized data, since the guess gets checked. */ time_t altt = t; int_fast32_t diff = mytm.TM_GMTOFF - yourtm.TM_GMTOFF; if (!increment_overflow_time(&altt, diff)) { struct tm alttm; if (funcp(sp, &altt, offset, &alttm) && alttm.tm_isdst == mytm.tm_isdst && alttm.TM_GMTOFF == yourtm.TM_GMTOFF && tmcomp(&alttm, &yourtm) == 0) { t = altt; mytm = alttm; } } } #endif if (yourtm.tm_isdst < 0 || mytm.tm_isdst == yourtm.tm_isdst) break; /* ** Right time, wrong type. ** Hunt for right time, right type. ** It's okay to guess wrong since the guess ** gets checked. */ if (sp == NULL) return WRONG; for (i = sp->typecnt - 1; i >= 0; --i) { if (sp->ttis[i].tt_isdst != yourtm.tm_isdst) continue; for (j = sp->typecnt - 1; j >= 0; --j) { if (sp->ttis[j].tt_isdst == yourtm.tm_isdst) continue; if (ttunspecified(sp, j)) continue; newt = (t + sp->ttis[j].tt_utoff - sp->ttis[i].tt_utoff); if (! funcp(sp, &newt, offset, &mytm)) continue; if (tmcomp(&mytm, &yourtm) != 0) continue; if (mytm.tm_isdst != yourtm.tm_isdst) continue; /* ** We have a match. */ t = newt; goto label; } } return WRONG; } label: newt = t + saved_seconds; if ((newt < t) != (saved_seconds < 0)) return WRONG; t = newt; if (funcp(sp, &t, offset, tmp)) *okayp = true; return t; } static time_t localtime_time2( struct tm * const tmp, struct tm *(*funcp)(struct state const *, time_t const *, int_fast32_t, struct tm *), struct state const *sp, const int_fast32_t offset, bool *okayp) { time_t t; /* ** First try without normalization of seconds ** (in case tm_sec contains a value associated with a leap second). ** If that fails, try with normalization of seconds. */ t = localtime_time2sub(tmp, funcp, sp, offset, okayp, false); return *okayp ? t : localtime_time2sub(tmp,funcp,sp,offset,okayp,true); } static time_t localtime_time1( struct tm *const tmp, struct tm *(*funcp)(struct state const *, time_t const *, int_fast32_t, struct tm *), struct state const *sp, const int_fast32_t offset) { register time_t t; register int samei, otheri; register int sameind, otherind; register int i; register int nseen; char seen[TZ_MAX_TYPES]; unsigned char types[TZ_MAX_TYPES]; bool okay; if (tmp == NULL) { errno = EINVAL; return WRONG; } if (tmp->tm_isdst > 1) tmp->tm_isdst = 1; t = localtime_time2(tmp, funcp, sp, offset, &okay); if (okay) return t; if (tmp->tm_isdst < 0) #ifdef PCTS /* ** POSIX Conformance Test Suite code courtesy Grant Sullivan. */ tmp->tm_isdst = 0; /* reset to std and try again */ #else return t; #endif /* !defined PCTS */ /* ** We're supposed to assume that somebody took a time of one type ** and did some math on it that yielded a "struct tm" that's bad. ** We try to divine the type they started from and adjust to the ** type they need. */ if (sp == NULL) return WRONG; for (i = 0; i < sp->typecnt; ++i) seen[i] = false; nseen = 0; for (i = sp->timecnt - 1; i >= 0; --i) if (!seen[sp->types[i]] && !ttunspecified(sp, sp->types[i])) { seen[sp->types[i]] = true; types[nseen++] = sp->types[i]; } for (sameind = 0; sameind < nseen; ++sameind) { samei = types[sameind]; if (sp->ttis[samei].tt_isdst != tmp->tm_isdst) continue; for (otherind = 0; otherind < nseen; ++otherind) { otheri = types[otherind]; if (sp->ttis[otheri].tt_isdst == tmp->tm_isdst) continue; tmp->tm_sec += (sp->ttis[otheri].tt_utoff - sp->ttis[samei].tt_utoff); tmp->tm_isdst = !tmp->tm_isdst; t = localtime_time2(tmp, funcp, sp, offset, &okay); if (okay) return t; tmp->tm_sec -= (sp->ttis[otheri].tt_utoff - sp->ttis[samei].tt_utoff); tmp->tm_isdst = !tmp->tm_isdst; } } return WRONG; } static time_t mktime_tzname(struct state *sp, struct tm *tmp, bool setname) { if (sp) return localtime_time1(tmp, localsub, sp, setname); else { localtime_gmtcheck(); return localtime_time1(tmp, gmtsub, gmtptr, 0); } } time_t mktime(struct tm *tmp) { time_t t; localtime_lock(); localtime_tzset_unlocked(); t = mktime_tzname(lclptr, tmp, true); localtime_unlock(); return t; } static int_fast32_t leapcorr(struct state const *sp, time_t t) { register struct lsinfo const * lp; register int i; i = sp->leapcnt; while (--i >= 0) { lp = &sp->lsis[i]; if (t >= lp->ls_trans) return lp->ls_corr; } return 0; }
58,803
2,197
jart/cosmopolitan
false
cosmopolitan/libc/time/xiso8601.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/struct/timespec.h" #include "libc/calls/struct/timeval.h" #include "libc/dce.h" #include "libc/errno.h" #include "libc/mem/fmt.h" #include "libc/mem/mem.h" #include "libc/sysv/consts/clock.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" #include "libc/x/x.h" // TODO(jart): DELETE static char *xiso8601_impl(struct timespec *opt_ts, int sswidth) { char *p; struct tm tm; struct timespec ts; int64_t sec, subsec; char timebuf[64], zonebuf[8]; if (opt_ts) { sec = opt_ts->tv_sec; subsec = opt_ts->tv_nsec; } else { errno = 0; clock_gettime(CLOCK_REALTIME, &ts); sec = ts.tv_sec; subsec = ts.tv_nsec; sswidth = 9; if (errno == ENOSYS) { subsec /= 1000; sswidth = 6; } } if (IsWindows() && sswidth == 9) { subsec /= 100; sswidth = 7; /* windows nt uses hectonanoseconds */ } localtime_r(&sec, &tm); strftime(timebuf, sizeof(timebuf), "%Y-%m-%dT%H:%M:%S", &tm); strftime(zonebuf, sizeof(zonebuf), "%z", &tm); (asprintf)(&p, "%s.%0*ld%s", timebuf, sswidth, subsec, zonebuf); return p; } /** * Returns allocated string representation of nanosecond timestamp. */ char *xiso8601ts(struct timespec *opt_ts) { return xiso8601_impl(opt_ts, 9); } /** * Returns allocated string representation of microsecond timestamp. */ char *xiso8601tv(struct timeval *opt_tv) { return xiso8601_impl( opt_tv ? &(struct timespec){opt_tv->tv_sec, opt_tv->tv_usec} : NULL, 6); }
3,326
77
jart/cosmopolitan
false
cosmopolitan/libc/time/iso8601us.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/assert.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" /** * Converts timestamp to ISO-8601 formatted string. * * For example: * * char *GetTimestamp(void) { * struct timespec ts; * static _Thread_local struct tm tm; * static _Thread_local int64_t last; * static _Thread_local char str[27]; * clock_gettime(0, &ts); * if (ts.tv_sec != last) { * localtime_r(&ts.tv_sec, &tm); * last = ts.tv_sec; * } * iso8601us(str, &tm, ts.tv_nsec); * return str; * } * * Will return timestamps that look like: * * 2020-01-01T13:14:15.123456 * * The generated timestamp is always exactly 26 characters long. It is * also always nul terminated too. * * This function defines no failure conditions. The results of passing * timestamp, or nanosecond values outside their appropriate intervals * is undefined. * * This goes 19x faster than strftime(). * * iso8601 l: 21c 7ns * iso8601us l: 39c 13ns * strftime l: 779c 252ns * * @param p is buffer with at least 20 bytes * @param tm has valid gmtime_r() or localtime_r() output * @param ns is nanosecond value associated with timestamp * @return pointer to nul terminator within `p`, cf. stpcpy() * @see iso8601() if microsecond resolution isn't desirable * @asyncsignalsafe * @threadsafe */ char *iso8601us(char p[hasatleast 27], struct tm *tm, long ns) { p = iso8601(p, tm); _unassert(0 <= ns && ns < 1000000000); *p++ = '.'; *p++ = '0' + ns / 100000000; *p++ = '0' + ns / 10000000 % 10; *p++ = '0' + ns / 1000000 % 10; *p++ = '0' + ns / 100000 % 10; *p++ = '0' + ns / 10000 % 10; *p++ = '0' + ns / 1000 % 10; *p = 0; return p; }
3,662
80
jart/cosmopolitan
false
cosmopolitan/libc/time/strftime.c
/*-*- mode:c; indent-tabs-mode:t; tab-width:8; coding:utf-8 -*-│ │vi: set et ft=c ts=8 tw=8 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright (c) 1989 The Regents of the University of California. │ │ All rights reserved. │ │ │ │ Redistribution and use in source and binary forms are permitted │ │ provided that the above copyright notice and this paragraph are │ │ duplicated in all such forms and that any documentation, │ │ advertising materials, and other materials related to such │ │ distribution and use acknowledge that the software was developed │ │ by the University of California, Berkeley. The name of the │ │ University may not be used to endorse or promote products derived │ │ from this software without specific prior written permission. │ │ THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR │ │ IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/fmt/fmt.h" #include "libc/inttypes.h" #include "libc/stdio/stdio.h" #include "libc/str/locale.h" #include "libc/time/time.h" #include "libc/time/tz.internal.h" // clang-format off // converts broken-down timestamp to string #define DIVISOR 100 asm(".ident\t\"\\n\\n\ strftime (BSD-3)\\n\ Copyright 1989 The Regents of the University of California\""); asm(".include \"libc/disclaimer.inc\""); /* ** Based on the UCB version with the copyright notice appearing above. ** ** This is ANSIish only when "multibyte character == plain character". */ struct lc_time_T { const char * mon[MONSPERYEAR]; const char * month[MONSPERYEAR]; const char * wday[DAYSPERWEEK]; const char * weekday[DAYSPERWEEK]; const char * X_fmt; const char * x_fmt; const char * c_fmt; const char * am; const char * pm; const char * date_fmt; }; #define Locale (&C_time_locale) static const struct lc_time_T C_time_locale = { { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }, { "January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December" }, { "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" }, { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday" }, /* X_fmt */ "%H:%M:%S", /* ** x_fmt ** C99 and later require this format. ** Using just numbers (as here) makes Quakers happier; ** it's also compatible with SVR4. */ "%m/%d/%y", /* ** c_fmt ** C99 and later require this format. ** Previously this code used "%D %X", but we now conform to C99. ** Note that ** "%a %b %d %H:%M:%S %Y" ** is used by Solaris 2.3. */ "%a %b %e %T %Y", /* am */ "AM", /* pm */ "PM", /* date_fmt */ "%a %b %e %H:%M:%S %Z %Y" }; enum warn { IN_NONE, IN_SOME, IN_THIS, IN_ALL }; #ifndef YEAR_2000_NAME #define YEAR_2000_NAME "CHECK_STRFTIME_FORMATS_FOR_TWO_DIGIT_YEARS" #endif /* !defined YEAR_2000_NAME */ static char * strftime_add(const char *str, char *pt, const char *ptlim) { while (pt < ptlim && (*pt = *str++) != '\0') ++pt; return pt; } static char * strftime_conv(int n, const char *format, char *pt, const char *ptlim) { char buf[INT_STRLEN_MAXIMUM(int) + 1]; (sprintf)(buf, format, n); return strftime_add(buf, pt, ptlim); } /* ** POSIX and the C Standard are unclear or inconsistent about ** what %C and %y do if the year is negative or exceeds 9999. ** Use the convention that %C concatenated with %y yields the ** same output as %Y, and that %Y contains at least 4 bytes, ** with more only if necessary. */ static char * strftime_yconv( int a, int b, bool convert_top, bool convert_yy, char *pt, const char *ptlim) { register int lead; register int trail; trail = a % DIVISOR + b % DIVISOR; lead = a / DIVISOR + b / DIVISOR + trail / DIVISOR; trail %= DIVISOR; if (trail < 0 && lead > 0) { trail += DIVISOR; --lead; } else if (lead < 0 && trail > 0) { trail -= DIVISOR; ++lead; } if (convert_top) { if (lead == 0 && trail < 0) pt = strftime_add("-0", pt, ptlim); else pt = strftime_conv(lead, "%02d", pt, ptlim); } if (convert_yy) pt = strftime_conv(((trail < 0) ? -trail : trail), "%02d", pt, ptlim); return pt; } static char * strftime_fmt(const char *format, const struct tm *t, char *pt, const char *ptlim, enum warn *warnp) { for ( ; *format; ++format) { if (*format == '%') { label: switch (*++format) { case '\0': --format; break; case 'A': pt = strftime_add( (t->tm_wday < 0 || t->tm_wday >= DAYSPERWEEK) ? "?" : Locale->weekday[t->tm_wday], pt, ptlim); continue; case 'a': pt = strftime_add( (t->tm_wday < 0 || t->tm_wday >= DAYSPERWEEK) ? "?" : Locale->wday[t->tm_wday], pt, ptlim); continue; case 'B': pt = strftime_add( (t->tm_mon < 0 || t->tm_mon >= MONSPERYEAR) ? "?" : Locale->month[t->tm_mon], pt, ptlim); continue; case 'b': case 'h': pt = strftime_add( (t->tm_mon < 0 || t->tm_mon >= MONSPERYEAR) ? "?" : Locale->mon[t->tm_mon], pt, ptlim); continue; case 'C': /* ** %C used to do a... ** _fmt("%a %b %e %X %Y", t); ** ...whereas now POSIX 1003.2 calls for ** something completely different. ** (ado, 1993-05-24) */ pt = strftime_yconv(t->tm_year, TM_YEAR_BASE, true, false, pt, ptlim); continue; case 'c': { enum warn warn2 = IN_SOME; pt = strftime_fmt(Locale->c_fmt, t, pt, ptlim, &warn2); if (warn2 == IN_ALL) warn2 = IN_THIS; if (warn2 > *warnp) *warnp = warn2; } continue; case 'D': pt = strftime_fmt("%m/%d/%y", t, pt, ptlim, warnp); continue; case 'd': pt = strftime_conv(t->tm_mday, "%02d", pt, ptlim); continue; case 'E': case 'O': /* ** Locale modifiers of C99 and later. ** The sequences ** %Ec %EC %Ex %EX %Ey %EY ** %Od %oe %OH %OI %Om %OM ** %OS %Ou %OU %OV %Ow %OW %Oy ** are supposed to provide alternative ** representations. */ goto label; case 'e': pt = strftime_conv(t->tm_mday, "%2d", pt, ptlim); continue; case 'F': pt = strftime_fmt("%Y-%m-%d", t, pt, ptlim, warnp); continue; case 'H': pt = strftime_conv(t->tm_hour, "%02d", pt, ptlim); continue; case 'I': pt = strftime_conv((t->tm_hour % 12) ? (t->tm_hour % 12) : 12, "%02d", pt, ptlim); continue; case 'j': pt = strftime_conv(t->tm_yday + 1, "%03d", pt, ptlim); continue; case 'k': /* ** This used to be... ** _conv(t->tm_hour % 12 ? ** t->tm_hour % 12 : 12, 2, ' '); ** ...and has been changed to the below to ** match SunOS 4.1.1 and Arnold Robbins' ** strftime version 3.0. That is, "%k" and ** "%l" have been swapped. ** (ado, 1993-05-24) */ pt = strftime_conv(t->tm_hour, "%2d", pt, ptlim); continue; #ifdef KITCHEN_SINK case 'K': /* ** After all this time, still unclaimed! */ pt = strftime_add("kitchen sink", pt, ptlim); continue; #endif /* defined KITCHEN_SINK */ case 'l': /* ** This used to be... ** _conv(t->tm_hour, 2, ' '); ** ...and has been changed to the below to ** match SunOS 4.1.1 and Arnold Robbin's ** strftime version 3.0. That is, "%k" and ** "%l" have been swapped. ** (ado, 1993-05-24) */ pt = strftime_conv((t->tm_hour % 12) ? (t->tm_hour % 12) : 12, "%2d", pt, ptlim); continue; case 'M': pt = strftime_conv(t->tm_min, "%02d", pt, ptlim); continue; case 'm': pt = strftime_conv(t->tm_mon + 1, "%02d", pt, ptlim); continue; case 'n': pt = strftime_add("\n", pt, ptlim); continue; case 'p': pt = strftime_add( (t->tm_hour >= (HOURSPERDAY / 2)) ? Locale->pm : Locale->am, pt, ptlim); continue; case 'R': pt = strftime_fmt("%H:%M", t, pt, ptlim, warnp); continue; case 'r': pt = strftime_fmt("%I:%M:%S %p", t, pt, ptlim, warnp); continue; case 'S': pt = strftime_conv(t->tm_sec, "%02d", pt, ptlim); continue; case 's': { struct tm tm; char buf[INT_STRLEN_MAXIMUM( time_t) + 1]; time_t mkt; tm = *t; tm.tm_yday = -1; mkt = mktime(&tm); if (mkt == (time_t) -1) { /* Fail unless this -1 represents a valid time. */ struct tm tm_1; if (!localtime_r(&mkt, &tm_1)) return NULL; if (!(tm.tm_year == tm_1.tm_year && tm.tm_yday == tm_1.tm_yday && tm.tm_hour == tm_1.tm_hour && tm.tm_min == tm_1.tm_min && tm.tm_sec == tm_1.tm_sec)) return NULL; } if (TYPE_SIGNED(time_t)) { intmax_t n = mkt; (sprintf)(buf, "%"PRIdMAX, n); } else { uintmax_t n = mkt; (sprintf)(buf, "%"PRIuMAX, n); } pt = strftime_add(buf, pt, ptlim); } continue; case 'T': pt = strftime_fmt("%H:%M:%S", t, pt, ptlim, warnp); continue; case 't': pt = strftime_add("\t", pt, ptlim); continue; case 'U': pt = strftime_conv((t->tm_yday + DAYSPERWEEK - t->tm_wday) / DAYSPERWEEK, "%02d", pt, ptlim); continue; case 'u': /* ** From Arnold Robbins' strftime version 3.0: ** "ISO 8601: Weekday as a decimal number ** [1 (Monday) - 7]" ** (ado, 1993-05-24) */ pt = strftime_conv((t->tm_wday == 0) ? DAYSPERWEEK : t->tm_wday, "%d", pt, ptlim); continue; case 'V': /* ISO 8601 week number */ case 'G': /* ISO 8601 year (four digits) */ case 'g': /* ISO 8601 year (two digits) */ /* ** From Arnold Robbins' strftime version 3.0: "the week number of the ** year (the first Monday as the first day of week 1) as a decimal number ** (01-53)." ** (ado, 1993-05-24) ** ** From <https://www.cl.cam.ac.uk/~mgk25/iso-time.html> by Markus Kuhn: ** "Week 01 of a year is per definition the first week which has the ** Thursday in this year, which is equivalent to the week which contains ** the fourth day of January. In other words, the first week of a new year ** is the week which has the majority of its days in the new year. Week 01 ** might also contain days from the previous year and the week before week ** 01 of a year is the last week (52 or 53) of the previous year even if ** it contains days from the new year. A week starts with Monday (day 1) ** and ends with Sunday (day 7). For example, the first week of the year ** 1997 lasts from 1996-12-30 to 1997-01-05..." ** (ado, 1996-01-02) */ { int year; int base; int yday; int wday; int w; year = t->tm_year; base = TM_YEAR_BASE; yday = t->tm_yday; wday = t->tm_wday; for ( ; ; ) { int len; int bot; int top; len = isleap_sum(year, base) ? DAYSPERLYEAR : DAYSPERNYEAR; /* ** What yday (-3 ... 3) does ** the ISO year begin on? */ bot = ((yday + 11 - wday) % DAYSPERWEEK) - 3; /* ** What yday does the NEXT ** ISO year begin on? */ top = bot - (len % DAYSPERWEEK); if (top < -3) top += DAYSPERWEEK; top += len; if (yday >= top) { ++base; w = 1; break; } if (yday >= bot) { w = 1 + ((yday - bot) / DAYSPERWEEK); break; } --base; yday += isleap_sum(year, base) ? DAYSPERLYEAR : DAYSPERNYEAR; } if (*format == 'V') pt = strftime_conv(w, "%02d", pt, ptlim); else if (*format == 'g') { *warnp = IN_ALL; pt = strftime_yconv(year, base, false, true, pt, ptlim); } else pt = strftime_yconv(year, base, true, true, pt, ptlim); } continue; case 'v': /* ** From Arnold Robbins' strftime version 3.0: ** "date as dd-bbb-YYYY" ** (ado, 1993-05-24) */ pt = strftime_fmt("%e-%b-%Y", t, pt, ptlim, warnp); continue; case 'W': pt = strftime_conv( (t->tm_yday + DAYSPERWEEK - (t->tm_wday ? (t->tm_wday - 1) : (DAYSPERWEEK - 1))) / DAYSPERWEEK, "%02d", pt, ptlim); continue; case 'w': pt = strftime_conv(t->tm_wday, "%d", pt, ptlim); continue; case 'X': pt = strftime_fmt(Locale->X_fmt, t, pt, ptlim, warnp); continue; case 'x': { enum warn warn2 = IN_SOME; pt = strftime_fmt(Locale->x_fmt, t, pt, ptlim, &warn2); if (warn2 == IN_ALL) warn2 = IN_THIS; if (warn2 > *warnp) *warnp = warn2; } continue; case 'y': *warnp = IN_ALL; pt = strftime_yconv(t->tm_year, TM_YEAR_BASE, false, true, pt, ptlim); continue; case 'Y': pt = strftime_yconv(t->tm_year, TM_YEAR_BASE, true, true, pt, ptlim); continue; case 'Z': pt = strftime_add(t->tm_zone, pt, ptlim); /* ** C99 and later say that %Z must be ** replaced by the empty string if the ** time zone abbreviation is not ** determinable. */ continue; case 'z': { long diff; char const * sign; bool negative; diff = t->tm_gmtoff; negative = diff < 0; if (diff == 0) { negative = t->tm_zone[0] == '-'; } if (negative) { sign = "-"; diff = -diff; } else sign = "+"; pt = strftime_add(sign, pt, ptlim); diff /= SECSPERMIN; diff = (diff / MINSPERHOUR) * 100 + (diff % MINSPERHOUR); pt = strftime_conv(diff, "%04d", pt, ptlim); } continue; case '+': pt = strftime_fmt(Locale->date_fmt, t, pt, ptlim, warnp); continue; case '%': /* ** X311J/88-090 (4.12.3.5): if conversion char is ** undefined, behavior is undefined. Print out the ** character itself as printf(3) also does. */ default: break; } } if (pt == ptlim) break; *pt++ = *format; } return pt; } /** * Converts time to string, e.g. * * char b[64]; * int64_t sec; * struct tm tm; * time(&sec); * localtime_r(&sec, &tm); * strftime(b, sizeof(b), "%Y-%m-%dT%H:%M:%S%z", &tm); // ISO8601 * strftime(b, sizeof(b), "%a, %d %b %Y %H:%M:%S %Z", &tm); // RFC1123 * * @return bytes copied excluding nul, or 0 on error * @see FormatHttpDateTime() */ size_t strftime(char *s, size_t maxsize, const char *format, const struct tm *t) { char * p; int saved_errno = errno; enum warn warn = IN_NONE; tzset(); p = strftime_fmt(format, t, s, s + maxsize, &warn); if (!p) { errno = EOVERFLOW; return 0; } if (p == s + maxsize) { errno = ERANGE; return 0; } *p = '\0'; errno = saved_errno; return p - s; } size_t strftime_l(char *s, size_t maxsize, char const *format, struct tm const *t, locale_t locale) { /* Just call strftime, as only the C locale is supported. */ return strftime(s, maxsize, format, t); }
15,865
603
jart/cosmopolitan
false
cosmopolitan/libc/time/kmonthnameshort.S
#if 0 /*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #endif #include "libc/macros.internal.h" // Type #1: // - Indexable C-String Array // - extern const char kMonthNameShort[12][4]; // Type #2: // - Double-NUL Terminated String // - extern const char kMonthNameShort[]; .section .rodata,"a",@progbits .underrun kMonthNameShort: .ascin "Jan",4 .ascin "Feb",4 .ascin "Mar",4 .ascin "Apr",4 .ascin "May",4 .ascin "Jun",4 .ascin "Jul",4 .ascin "Aug",4 .ascin "Sep",4 .ascin "Oct",4 .ascin "Nov",4 .ascin "Dec",4 .byte 0 .endobj kMonthNameShort,globl .overrun .previous
1,317
37
jart/cosmopolitan
false
cosmopolitan/libc/time/dsleep.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/struct/timespec.h" #include "libc/nexgen32e/nexgen32e.h" #include "libc/time/time.h" // todo(jart): delete /** * Sleeps w/ higher precision. */ long double dsleep(long double secs) { struct timespec dur, rem; dur.tv_sec = secs; dur.tv_nsec = secs * 1e9; dur.tv_nsec = dur.tv_nsec % 1000000000; if (secs > 1e-6) { nanosleep(&dur, &rem); secs = rem.tv_nsec; secs *= 1 / 1e9; secs += rem.tv_sec; return secs; } else { return 0; } }
2,328
43
jart/cosmopolitan
false
cosmopolitan/libc/time/times.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/calls.h" #include "libc/calls/struct/rusage.h" #include "libc/calls/struct/timeval.h" #include "libc/calls/struct/tms.h" #include "libc/calls/syscall_support-nt.internal.h" #include "libc/dce.h" #include "libc/fmt/conv.h" #include "libc/nt/accounting.h" #include "libc/nt/runtime.h" #include "libc/runtime/clktck.h" #include "libc/runtime/sysconf.h" #include "libc/sysv/consts/rusage.h" #include "libc/time/time.h" static dontinline long ConvertMicros(struct timeval tv) { return tv.tv_sec * CLK_TCK + tv.tv_usec / (1000000 / CLK_TCK); } static dontinline long times2(struct tms *out_times, struct rusage *ru) { struct timeval tv; struct NtFileTime CreationTime, ExitTime, KernelTime, UserTime; if (!IsWindows()) { if (getrusage(RUSAGE_SELF, ru) == -1) return -1; out_times->tms_utime = ConvertMicros(ru->ru_utime); out_times->tms_stime = ConvertMicros(ru->ru_stime); if (getrusage(RUSAGE_CHILDREN, ru) == -1) return -1; out_times->tms_cutime = ConvertMicros(ru->ru_utime); out_times->tms_cstime = ConvertMicros(ru->ru_stime); } else { if (!GetProcessTimes(GetCurrentProcess(), &CreationTime, &ExitTime, &KernelTime, &UserTime)) { return __winerr(); } out_times->tms_utime = ReadFileTime(UserTime); out_times->tms_stime = ReadFileTime(KernelTime); out_times->tms_cutime = 0; out_times->tms_cstime = 0; } if (gettimeofday(&tv, NULL) == -1) return -1; return ConvertMicros(tv); } /** * Returns accounting data for process on time-sharing system. */ long times(struct tms *out_times) { struct rusage ru; return times2(out_times, &ru); }
3,495
68
jart/cosmopolitan
false
cosmopolitan/libc/time/difftime.c
/*-*- mode:c; indent-tabs-mode:t; tab-width:8; coding:utf-8 -*-│ │vi: set et ft=c ts=8 tw=8 fenc=utf-8 :vi│ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/macros.internal.h" #include "libc/time/tz.internal.h" // clang-format off /* Return the difference between two timestamps. */ /* ** This file is in the public domain, so clarified as of ** 1996-06-05 by Arthur David Olson. */ /* Return -X as a double. Using this avoids casting to 'double'. */ static inline double dminus(double x) { return -x; } double difftime(time_t time1, time_t time0) { /* ** If double is large enough, simply convert and subtract ** (assuming that the larger type has more precision). */ if (sizeof(time_t) < sizeof(double)) { double t1 = time1, t0 = time0; return t1 - t0; } /* ** The difference of two unsigned values can't overflow ** if the minuend is greater than or equal to the subtrahend. */ if (!TYPE_SIGNED(time_t)) return time0 <= time1 ? time1 - time0 : dminus(time0 - time1); /* Use uintmax_t if wide enough. */ if (sizeof(time_t) <= sizeof(uintmax_t)) { uintmax_t t1 = time1, t0 = time0; return time0 <= time1 ? t1 - t0 : dminus(t0 - t1); } /* ** Handle cases where both time1 and time0 have the same sign ** (meaning that their difference cannot overflow). */ if ((time1 < 0) == (time0 < 0)) return time1 - time0; /* ** The values have opposite signs and uintmax_t is too narrow. ** This suffers from double rounding; attempt to lessen that ** by using long double temporaries. */ { long double t1 = time1, t0 = time0; return t1 - t0; } }
1,860
63
jart/cosmopolitan
false
cosmopolitan/libc/time/time.mk
#-*-mode:makefile-gmake;indent-tabs-mode:t;tab-width:8;coding:utf-8-*-┐ #───vi: set et ft=make ts=8 tw=8 fenc=utf-8 :vi───────────────────────┘ PKGS += LIBC_TIME LIBC_TIME_ARTIFACTS += LIBC_TIME_A LIBC_TIME_ZONEINFOS = $(wildcard usr/share/zoneinfo/*) LIBC_TIME = $(LIBC_TIME_A_DEPS) $(LIBC_TIME_A) LIBC_TIME_A = o/$(MODE)/libc/time/time.a LIBC_TIME_A_FILES := $(wildcard libc/time/struct/*) $(wildcard libc/time/*) LIBC_TIME_A_HDRS := $(filter %.h,$(LIBC_TIME_A_FILES)) LIBC_TIME_A_SRCS_S = $(filter %.S,$(LIBC_TIME_A_FILES)) LIBC_TIME_A_SRCS_C = $(filter %.c,$(LIBC_TIME_A_FILES)) LIBC_TIME_A_SRCS = \ $(LIBC_TIME_A_SRCS_S) \ $(LIBC_TIME_A_SRCS_C) LIBC_TIME_A_OBJS = \ o/$(MODE)/usr/share/zoneinfo/.zip.o \ $(LIBC_TIME_A_SRCS_S:%.S=o/$(MODE)/%.o) \ $(LIBC_TIME_A_SRCS_C:%.c=o/$(MODE)/%.o) \ $(LIBC_TIME_A_SRCS_C:%.c=o/$(MODE)/%.o) \ $(LIBC_TIME_ZONEINFOS:%=o/$(MODE)/%.zip.o) LIBC_TIME_A_CHECKS = \ $(LIBC_TIME_A).pkg \ $(LIBC_TIME_A_HDRS:%=o/$(MODE)/%.ok) LIBC_TIME_A_DIRECTDEPS = \ LIBC_CALLS \ LIBC_INTRIN \ LIBC_FMT \ LIBC_MEM \ LIBC_NEXGEN32E \ LIBC_NT_KERNEL32 \ LIBC_NT_NTDLL \ LIBC_RUNTIME \ LIBC_STR \ LIBC_STUBS \ LIBC_SYSV \ LIBC_SYSV_CALLS \ LIBC_ZIPOS \ THIRD_PARTY_COMPILER_RT LIBC_TIME_A_DEPS := \ $(call uniq,$(foreach x,$(LIBC_TIME_A_DIRECTDEPS),$($(x)))) $(LIBC_TIME_A): libc/time/ \ $(LIBC_TIME_A).pkg \ $(LIBC_TIME_A_OBJS) $(LIBC_TIME_A).pkg: \ $(LIBC_TIME_A_OBJS) \ $(foreach x,$(LIBC_TIME_A_DIRECTDEPS),$($(x)_A).pkg) o/$(MODE)/libc/time/strftime.o: private \ OVERRIDE_CFLAGS += \ -fno-jump-tables o/$(MODE)/libc/time/localtime.o: private \ OVERRIDE_CFLAGS += \ -fdata-sections \ -ffunction-sections # we need -O3 because: # we're dividing by constants o/$(MODE)/libc/time/iso8601.o \ o/$(MODE)/libc/time/iso8601us.o: private \ OVERRIDE_CFLAGS += \ -O3 o/$(MODE)/usr/share/zoneinfo/.zip.o: \ usr/share/zoneinfo o/$(MODE)/libc/time/kmonthname.o: libc/time/kmonthname.S @$(COMPILE) -AOBJECTIFY.S $(OBJECTIFY.S) $(OUTPUT_OPTION) -c $< o/$(MODE)/libc/time/kmonthnameshort.o: libc/time/kmonthnameshort.S @$(COMPILE) -AOBJECTIFY.S $(OBJECTIFY.S) $(OUTPUT_OPTION) -c $< o/$(MODE)/libc/time/kweekdayname.o: libc/time/kweekdayname.S @$(COMPILE) -AOBJECTIFY.S $(OBJECTIFY.S) $(OUTPUT_OPTION) -c $< o/$(MODE)/libc/time/kweekdaynameshort.o: libc/time/kweekdaynameshort.S @$(COMPILE) -AOBJECTIFY.S $(OBJECTIFY.S) $(OUTPUT_OPTION) -c $< LIBC_TIME_LIBS = $(foreach x,$(LIBC_TIME_ARTIFACTS),$($(x))) LIBC_TIME_SRCS = $(foreach x,$(LIBC_TIME_ARTIFACTS),$($(x)_SRCS)) LIBC_TIME_HDRS = $(foreach x,$(LIBC_TIME_ARTIFACTS),$($(x)_HDRS)) LIBC_TIME_CHECKS = $(foreach x,$(LIBC_TIME_ARTIFACTS),$($(x)_CHECKS)) LIBC_TIME_OBJS = $(foreach x,$(LIBC_TIME_ARTIFACTS),$($(x)_OBJS)) $(LIBC_TIME_OBJS): $(BUILD_FILES) libc/time/time.mk .PHONY: o/$(MODE)/libc/time o/$(MODE)/libc/time: $(LIBC_TIME_CHECKS)
2,997
94
jart/cosmopolitan
false
cosmopolitan/libc/time/iso8601.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/assert.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" /** * Converts timestamp to ISO-8601 formatted string. * * For example: * * char *GetZuluTime(void) { * char *p; * struct tm tm; * struct timespec ts; * static _Thread_local int64_t last; * static _Thread_local char str[21]; * clock_gettime(0, &ts); * if (ts.tv_sec != last) { * gmtime_r(&ts.tv_sec, &tm); * last = ts.tv_sec; * stpcpy(iso8601(str, &tm), "Z"); * } * return str; * } * * Will return timestamps that look like: * * 2020-01-01T13:14:15Z * * The generated timestamp is always exactly 19 characters long. It is * also always nul terminated too. * * This function defines no failure conditions. The results of passing * timestamp values outside of the appropriate intervals is undefined. * * @param p is buffer with at least 20 bytes * @param tm has valid gmtime_r() or localtime_r() output * @return pointer to nul terminator within `p`, cf. stpcpy() * @see iso8601us() for microsecond timestamps * @asyncsignalsafe * @threadsafe */ char *iso8601(char p[hasatleast 20], struct tm *tm) { int x; x = tm->tm_year + 1900; _unassert(0 <= x && x <= 9999); *p++ = '0' + x / 1000; *p++ = '0' + x / 100 % 10; *p++ = '0' + x / 10 % 10; *p++ = '0' + x % 10; *p++ = '-'; x = tm->tm_mon + 1; _unassert(1 <= x && x <= 12); *p++ = '0' + x / 10; *p++ = '0' + x % 10; *p++ = '-'; x = tm->tm_mday; _unassert(1 <= x && x <= 31); *p++ = '0' + x / 10; *p++ = '0' + x % 10; *p++ = 'T'; x = tm->tm_hour; _unassert(0 <= x && x <= 23); *p++ = '0' + x / 10; *p++ = '0' + x % 10; *p++ = ':'; x = tm->tm_min; _unassert(0 <= x && x <= 59); *p++ = '0' + x / 10; *p++ = '0' + x % 10; *p++ = ':'; x = tm->tm_sec; _unassert(0 <= x && x <= 60); *p++ = '0' + x / 10; *p++ = '0' + x % 10; *p = 0; return p; }
3,801
96
jart/cosmopolitan
false
cosmopolitan/libc/time/tz.internal.h
#ifndef COSMOPOLITAN_THIRD_PARTY_TZ_PRIVATE_H_ #define COSMOPOLITAN_THIRD_PARTY_TZ_PRIVATE_H_ #include "libc/calls/calls.h" #include "libc/calls/weirdtypes.h" #include "libc/errno.h" #include "libc/inttypes.h" #include "libc/limits.h" #include "libc/macros.internal.h" #include "libc/runtime/runtime.h" #include "libc/sysv/consts/ok.h" #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ /* clang-format off */ /* Private header for tzdb code. */ /* ** This file is in the public domain, so clarified as of ** 1996-06-05 by Arthur David Olson. */ /* ** This header is for use ONLY with the time conversion code. ** There is no guarantee that it will remain unchanged, ** or that it will remain at all. ** Do NOT copy it to any system include directory. ** Thank you! */ /* ** zdump has been made independent of the rest of the time ** conversion package to increase confidence in the verification it provides. ** You can use zdump to help in verifying other implementations. ** To do this, compile with -DUSE_LTZ=0 and link without the tz library. */ #ifndef USE_LTZ # define USE_LTZ 1 #endif /* This string was in the Factory zone through version 2016f. */ #define GRANDPARENTED "Local time zone must be set--see zic manual page" /* ** Defaults for preprocessor symbols. ** You can override these in your C compiler options, e.g. '-DHAVE_GETTEXT=1'. */ #ifndef HAVE_DECL_ASCTIME_R #define HAVE_DECL_ASCTIME_R 1 #endif #if !defined HAVE_GENERIC && defined __has_extension # if __has_extension(c_generic_selections) # define HAVE_GENERIC 1 # else # define HAVE_GENERIC 0 # endif #endif /* _Generic is buggy in pre-4.9 GCC. */ #if !defined HAVE_GENERIC && defined __GNUC__ # define HAVE_GENERIC (4 < __GNUC__ + (9 <= __GNUC_MINOR__)) #endif #ifndef HAVE_GENERIC # define HAVE_GENERIC (201112 <= __STDC_VERSION__) #endif #ifndef HAVE_GETTEXT #define HAVE_GETTEXT 0 #endif /* !defined HAVE_GETTEXT */ #ifndef HAVE_INCOMPATIBLE_CTIME_R #define HAVE_INCOMPATIBLE_CTIME_R 0 #endif #ifndef HAVE_LINK #define HAVE_LINK 1 #endif /* !defined HAVE_LINK */ #ifndef HAVE_MALLOC_ERRNO #define HAVE_MALLOC_ERRNO 1 #endif #ifndef HAVE_POSIX_DECLS #define HAVE_POSIX_DECLS 1 #endif #ifndef HAVE_STRTOLL #define HAVE_STRTOLL 1 #endif #ifndef HAVE_SYMLINK #define HAVE_SYMLINK 1 #endif /* !defined HAVE_SYMLINK */ #if HAVE_INCOMPATIBLE_CTIME_R #define asctime_r _incompatible_asctime_r #define ctime_r _incompatible_ctime_r #endif /* HAVE_INCOMPATIBLE_CTIME_R */ /* ** Nested includes */ /* Avoid clashes with NetBSD by renaming NetBSD's declarations. If defining the 'timezone' variable, avoid a clash with FreeBSD's 'timezone' function by renaming its declaration. */ #define localtime_rz sys_localtime_rz #define mktime_z sys_mktime_z #define posix2time_z sys_posix2time_z #define time2posix_z sys_time2posix_z #if defined USG_COMPAT && USG_COMPAT == 2 # define timezone sys_timezone #endif #define timezone_t sys_timezone_t #define tzalloc sys_tzalloc #define tzfree sys_tzfree #undef localtime_rz #undef mktime_z #undef posix2time_z #undef time2posix_z #if defined USG_COMPAT && USG_COMPAT == 2 # undef timezone #endif #undef timezone_t #undef tzalloc #undef tzfree #if HAVE_GETTEXT #include <libintl.h> #endif /* HAVE_GETTEXT */ #ifndef HAVE_STRFTIME_L # if _POSIX_VERSION < 200809 # define HAVE_STRFTIME_L 0 # else # define HAVE_STRFTIME_L 1 # endif #endif #ifndef USG_COMPAT # ifndef _XOPEN_VERSION # define USG_COMPAT 0 # else # define USG_COMPAT 1 # endif #endif #ifndef HAVE_TZNAME # if _POSIX_VERSION < 198808 && !USG_COMPAT # define HAVE_TZNAME 0 # else # define HAVE_TZNAME 1 # endif #endif #ifndef ALTZONE # if defined __sun || defined _M_XENIX # define ALTZONE 1 # else # define ALTZONE 0 # endif #endif #ifndef R_OK #define R_OK 4 #endif /* !defined R_OK */ #if 3 <= __GNUC__ # define ATTRIBUTE_FORMAT(spec) __attribute__((__format__ spec)) #else # define ATTRIBUTE_FORMAT(spec) /* empty */ #endif /* ** Workarounds for compilers/systems. */ #ifndef EPOCH_LOCAL # define EPOCH_LOCAL 0 #endif #ifndef EPOCH_OFFSET # define EPOCH_OFFSET 0 #endif /* ** Compile with -Dtime_tz=T to build the tz package with a private ** int64_t type equivalent to T rather than the system-supplied int64_t. ** This debugging feature can test unusual design decisions ** (e.g., int64_t wider than 'long', or unsigned int64_t) even on ** typical platforms. */ #if defined time_tz || EPOCH_LOCAL || EPOCH_OFFSET != 0 # define TZ_INT64_T 1 #else # define TZ_INT64_T 0 #endif #if defined LOCALTIME_IMPLEMENTATION && TZ_INT64_T static int64_t sys_time(int64_t *x) { return time(x); } #endif #if TZ_INT64_T typedef time_tz tz_int64_t; # undef asctime # define asctime tz_asctime # undef asctime_r # define asctime_r tz_asctime_r # undef ctime # define ctime tz_ctime # undef ctime_r # define ctime_r tz_ctime_r # undef difftime # define difftime tz_difftime # undef gmtime # define gmtime tz_gmtime # undef gmtime_r # define gmtime_r tz_gmtime_r # undef localtime # define localtime tz_localtime # undef localtime_r # define localtime_r tz_localtime_r # undef localtime_rz # define localtime_rz tz_localtime_rz # undef mktime # define mktime tz_mktime # undef mktime_z # define mktime_z tz_mktime_z # undef offtime # define offtime tz_offtime # undef posix2time # define posix2time tz_posix2time # undef posix2time_z # define posix2time_z tz_posix2time_z # undef strftime # define strftime tz_strftime # undef time # define time tz_time # undef time2posix # define time2posix tz_time2posix # undef time2posix_z # define time2posix_z tz_time2posix_z # undef int64_t # define int64_t tz_int64_t # undef timegm # define timegm tz_timegm # undef timelocal # define timelocal tz_timelocal # undef timeoff # define timeoff tz_timeoff # undef tzalloc # define tzalloc tz_tzalloc # undef tzfree # define tzfree tz_tzfree # undef tzset # define tzset tz_tzset # if HAVE_STRFTIME_L # undef strftime_l # define strftime_l tz_strftime_l # endif # if HAVE_TZNAME # undef tzname # define tzname tz_tzname # endif # if USG_COMPAT # undef daylight # define daylight tz_daylight # undef timezone # define timezone tz_timezone # endif # if ALTZONE # undef altzone # define altzone tz_altzone # endif char *asctime(struct tm const *); char *asctime_r(struct tm const *restrict, char *restrict); char *ctime(int64_t const *); char *ctime_r(int64_t const *, char *); double difftime(int64_t, int64_t) pureconst; size_t strftime(char *restrict, size_t, char const *restrict, struct tm const *restrict); # if HAVE_STRFTIME_L size_t strftime_l(char *restrict, size_t, char const *restrict, struct tm const *restrict, locale_t); # endif struct tm *gmtime(int64_t const *); struct tm *gmtime_r(int64_t const *restrict, struct tm *restrict); struct tm *localtime(int64_t const *); struct tm *localtime_r(int64_t const *restrict, struct tm *restrict); int64_t mktime(struct tm *); int64_t time(int64_t *); void tzset(void); #endif #if !HAVE_DECL_ASCTIME_R && !defined asctime_r extern char *asctime_r(struct tm const *restrict, char *restrict); #endif #ifndef HAVE_DECL_ENVIRON # if defined environ || defined __USE_GNU # define HAVE_DECL_ENVIRON 1 # else # define HAVE_DECL_ENVIRON 0 # endif #endif #if 2 <= HAVE_TZNAME + (TZ_INT64_T || !HAVE_POSIX_DECLS) extern char *tzname[]; #endif #if 2 <= USG_COMPAT + (TZ_INT64_T || !HAVE_POSIX_DECLS) extern long timezone; extern int daylight; #endif #if 2 <= ALTZONE + (TZ_INT64_T || !HAVE_POSIX_DECLS) extern long altzone; #endif /* ** The STD_INSPIRED functions are similar, but most also need ** declarations if time_tz is defined. */ #ifdef STD_INSPIRED # if TZ_INT64_T || !defined offtime struct tm *offtime(int64_t const *, long); # endif # if TZ_INT64_T || !defined timegm int64_t timegm(struct tm *); # endif # if TZ_INT64_T || !defined timelocal int64_t timelocal(struct tm *); # endif # if TZ_INT64_T || !defined timeoff int64_t timeoff(struct tm *, long); # endif # if TZ_INT64_T || !defined time2posix int64_t time2posix(int64_t); # endif # if TZ_INT64_T || !defined posix2time int64_t posix2time(int64_t); # endif #endif /* Infer TM_ZONE on systems where this information is known, but suppress guessing if NO_TM_ZONE is defined. Similarly for TM_GMTOFF. */ #define TM_GMTOFF tm_gmtoff #define TM_ZONE tm_zone /* ** Define functions that are ABI compatible with NetBSD but have ** better prototypes. NetBSD 6.1.4 defines a pointer type timezone_t ** and labors under the misconception that 'const timezone_t' is a ** pointer to a constant. This use of 'const' is ineffective, so it ** is not done here. What we call 'struct state' NetBSD calls ** 'struct __state', but this is a private name so it doesn't matter. */ #if NETBSD_INSPIRED typedef struct state *timezone_t; struct tm *localtime_rz(timezone_t restrict, int64_t const *restrict, struct tm *restrict); int64_t mktime_z(timezone_t restrict, struct tm *restrict); timezone_t tzalloc(char const *); void tzfree(timezone_t); # ifdef STD_INSPIRED # if TZ_INT64_T || !defined posix2time_z int64_t posix2time_z(timezone_t, int64_t) nosideeffect; # endif # if TZ_INT64_T || !defined time2posix_z int64_t time2posix_z(timezone_t, int64_t) nosideeffect; # endif # endif #endif /* ** Finally, some convenience items. */ #define TWOS_COMPLEMENT(t) ((t) ~ (t) 0 < 0) /* Max and min values of the integer type T, of which only the bottom B bits are used, and where the highest-order used bit is considered to be a sign bit if T is signed. */ #define MAXVAL(t, b) \ ((t) (((t) 1 << ((b) - 1 - TYPE_SIGNED(t))) \ - 1 + ((t) 1 << ((b) - 1 - TYPE_SIGNED(t))))) #define MINVAL(t, b) \ ((t) (TYPE_SIGNED(t) ? - TWOS_COMPLEMENT(t) - MAXVAL(t, b) : 0)) /* The extreme time values, assuming no padding. */ #define INT64_T_MIN_NO_PADDING MINVAL(int64_t, TYPE_BIT(int64_t)) #define INT64_T_MAX_NO_PADDING MAXVAL(int64_t, TYPE_BIT(int64_t)) /* The extreme time values. These are macros, not constants, so that any portability problems occur only when compiling .c files that use the macros, which is safer for applications that need only zdump and zic. This implementation assumes no padding if int64_t is signed and either the compiler lacks support for _Generic or int64_t is not one of the standard signed integer types. */ #if HAVE_GENERIC # define INT64_T_MIN \ _Generic((int64_t) 0, \ signed char: SCHAR_MIN, short: SHRT_MIN, \ int: INT_MIN, long: LONG_MIN, long long: LLONG_MIN, \ default: INT64_T_MIN_NO_PADDING) # define INT64_T_MAX \ (TYPE_SIGNED(int64_t) \ ? _Generic((int64_t) 0, \ signed char: SCHAR_MAX, short: SHRT_MAX, \ int: INT_MAX, long: LONG_MAX, long long: LLONG_MAX, \ default: INT64_T_MAX_NO_PADDING) \ : (int64_t) -1) #else # define INT64_T_MIN INT64_T_MIN_NO_PADDING # define INT64_T_MAX INT64_T_MAX_NO_PADDING #endif /* ** 302 / 1000 is log10(2.0) rounded up. ** Subtract one for the sign bit if the type is signed; ** add one for integer division truncation; ** add one more for a minus sign if the type is signed. */ #define INT_STRLEN_MAXIMUM(type) \ ((TYPE_BIT(type) - TYPE_SIGNED(type)) * 302 / 1000 + \ 1 + TYPE_SIGNED(type)) /* ** INITIALIZE(x) */ #define INITIALIZE(x) ((x) = 0) /* Whether memory access must strictly follow the C standard. If 0, it's OK to read uninitialized storage so long as the value is not relied upon. Defining it to 0 lets mktime access parts of struct tm that might be uninitialized, as a heuristic when the standard doesn't say what to return and when tm_gmtoff can help mktime likely infer a better value. */ #ifndef UNINIT_TRAP # define UNINIT_TRAP 0 #endif #ifdef DEBUG # define UNREACHABLE() abort() #elif 4 < __GNUC__ + (5 <= __GNUC_MINOR__) # define UNREACHABLE() __builtin_unreachable() #elif defined __has_builtin # if __has_builtin(__builtin_unreachable) # define UNREACHABLE() __builtin_unreachable() # endif #endif #ifndef UNREACHABLE # define UNREACHABLE() ((void) 0) #endif /* ** For the benefit of GNU folk... ** '_(MSGID)' uses the current locale's message library string for MSGID. ** The default is to use gettext if available, and use MSGID otherwise. */ #if HAVE_GETTEXT #define _(msgid) gettext(msgid) #else /* !HAVE_GETTEXT */ #define _(msgid) msgid #endif /* !HAVE_GETTEXT */ #if !defined TZ_DOMAIN && defined HAVE_GETTEXT # define TZ_DOMAIN "tz" #endif #if HAVE_INCOMPATIBLE_CTIME_R #undef asctime_r #undef ctime_r char *asctime_r(struct tm const *, char *); char *ctime_r(int64_t const *, char *); #endif /* HAVE_INCOMPATIBLE_CTIME_R */ /* Handy macros that are independent of tzfile implementation. */ #define SECSPERMIN 60 #define MINSPERHOUR 60 #define HOURSPERDAY 24 #define DAYSPERWEEK 7 #define DAYSPERNYEAR 365 #define DAYSPERLYEAR 366 #define SECSPERHOUR (SECSPERMIN * MINSPERHOUR) #define SECSPERDAY ((int_fast32_t) SECSPERHOUR * HOURSPERDAY) #define MONSPERYEAR 12 #define YEARSPERREPEAT 400 /* years before a Gregorian repeat */ #define DAYSPERREPEAT ((int_fast32_t) 400 * 365 + 100 - 4 + 1) #define SECSPERREPEAT ((int_fast64_t) DAYSPERREPEAT * SECSPERDAY) #define AVGSECSPERYEAR (SECSPERREPEAT / YEARSPERREPEAT) #define TM_SUNDAY 0 #define TM_MONDAY 1 #define TM_TUESDAY 2 #define TM_WEDNESDAY 3 #define TM_THURSDAY 4 #define TM_FRIDAY 5 #define TM_SATURDAY 6 #define TM_JANUARY 0 #define TM_FEBRUARY 1 #define TM_MARCH 2 #define TM_APRIL 3 #define TM_MAY 4 #define TM_JUNE 5 #define TM_JULY 6 #define TM_AUGUST 7 #define TM_SEPTEMBER 8 #define TM_OCTOBER 9 #define TM_NOVEMBER 10 #define TM_DECEMBER 11 #define TM_YEAR_BASE 1900 #define TM_WDAY_BASE TM_MONDAY #define EPOCH_YEAR 1970 #define EPOCH_WDAY TM_THURSDAY #define isleap(y) (((y) % 4) == 0 && (((y) % 100) != 0 || ((y) % 400) == 0)) /* ** Since everything in isleap is modulo 400 (or a factor of 400), we know that ** isleap(y) == isleap(y % 400) ** and so ** isleap(a + b) == isleap((a + b) % 400) ** or ** isleap(a + b) == isleap(a % 400 + b % 400) ** This is true even if % means modulo rather than Fortran remainder ** (which is allowed by C89 but not by C99 or later). ** We use this to avoid addition overflow problems. */ #define isleap_sum(a, b) isleap((a) % 400 + (b) % 400) COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_THIRD_PARTY_TZ_PRIVATE_H_ */
14,372
544
jart/cosmopolitan
false
cosmopolitan/libc/time/timezone.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/time/time.h" char *tzname[2]; long timezone; int daylight;
1,911
24
jart/cosmopolitan
false
cosmopolitan/libc/time/asctime.c
#include "libc/fmt/fmt.h" #include "libc/str/str.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" #include "libc/time/tz.internal.h" #include "third_party/python/Include/object.h" // clang-format off /* asctime and asctime_r a la POSIX and ISO C, except pad years before 1000. */ /* ** This file is in the public domain, so clarified as of ** 1996-06-05 by Arthur David Olson. */ /* ** Avoid the temptation to punt entirely to strftime; ** the output of strftime is supposed to be locale specific ** whereas the output of asctime is supposed to be constant. */ /* ** Some systems only handle "%.2d"; others only handle "%02d"; ** "%02.2d" makes (most) everybody happy. ** At least some versions of gcc warn about the %02.2d; ** we conditionalize below to avoid the warning. */ /* ** All years associated with 32-bit time_t values are exactly four digits long; ** some years associated with 64-bit time_t values are not. ** Vintage programs are coded for years that are always four digits long ** and may assume that the newline always lands in the same place. ** For years that are less than four digits, we pad the output with ** leading zeroes to get the newline in the traditional place. ** The -4 ensures that we get four characters of output even if ** we call a strftime variant that produces fewer characters for some years. ** The ISO C and POSIX standards prohibit padding the year, ** but many implementations pad anyway; most likely the standards are buggy. */ #ifdef __GNUC__ #define ASCTIME_FMT "%s %s%3d %2.2d:%2.2d:%2.2d %-4s\n" #else /* !defined __GNUC__ */ #define ASCTIME_FMT "%s %s%3d %02.2d:%02.2d:%02.2d %-4s\n" #endif /* !defined __GNUC__ */ /* ** For years that are more than four digits we put extra spaces before the year ** so that code trying to overwrite the newline won't end up overwriting ** a digit within a year and truncating the year (operating on the assumption ** that no output is better than wrong output). */ #ifdef __GNUC__ #define ASCTIME_FMT_B "%s %s%3d %2.2d:%2.2d:%2.2d %s\n" #else /* !defined __GNUC__ */ #define ASCTIME_FMT_B "%s %s%3d %02.2d:%02.2d:%02.2d %s\n" #endif /* !defined __GNUC__ */ #define STD_ASCTIME_BUF_SIZE 26 /* ** Big enough for something such as ** ??? ???-2147483648 -2147483648:-2147483648:-2147483648 -2147483648\n ** (two three-character abbreviations, five strings denoting integers, ** seven explicit spaces, two explicit colons, a newline, ** and a trailing NUL byte). ** The values above are for systems where an int is 32 bits and are provided ** as an example; the define below calculates the maximum for the system at ** hand. */ #define MAX_ASCTIME_BUF_SIZE (2*3+5*INT_STRLEN_MAXIMUM(int)+7+2+1+1) static char buf_asctime[MAX_ASCTIME_BUF_SIZE]; char * asctime_r(register const struct tm *timeptr, char buf[hasatleast 26]) { register const char * wn; register const char * mn; char year[INT_STRLEN_MAXIMUM(int) + 2]; char result[MAX_ASCTIME_BUF_SIZE]; if (timeptr == NULL) { errno = EINVAL; return strcpy(buf, "??? ??? ?? ??:??:?? ????\n"); } if (timeptr->tm_wday < 0 || timeptr->tm_wday >= DAYSPERWEEK) wn = "???"; else wn = kWeekdayNameShort[timeptr->tm_wday]; if (timeptr->tm_mon < 0 || timeptr->tm_mon >= MONSPERYEAR) mn = "???"; else mn = kMonthNameShort[timeptr->tm_mon]; /* ** Use strftime's %Y to generate the year, to avoid overflow problems ** when computing timeptr->tm_year + TM_YEAR_BASE. ** Assume that strftime is unaffected by other out-of-range members ** (e.g., timeptr->tm_mday) when processing "%Y". */ strftime(year, sizeof year, "%Y", timeptr); /* ** We avoid using snprintf since it's not available on all systems. */ (sprintf)(result, ((strlen(year) <= 4) ? ASCTIME_FMT : ASCTIME_FMT_B), wn, mn, timeptr->tm_mday, timeptr->tm_hour, timeptr->tm_min, timeptr->tm_sec, year); if (strlen(result) < STD_ASCTIME_BUF_SIZE || buf == buf_asctime) return strcpy(buf, result); else { errno = EOVERFLOW; return NULL; } } char * asctime(register const struct tm *timeptr) { return asctime_r(timeptr, buf_asctime); }
4,173
118
jart/cosmopolitan
false
cosmopolitan/libc/time/clockstonanos.internal.h
#ifndef COSMOPOLITAN_LIBC_TIME_CLOCKSTONANOS_INTERNAL_H_ #define COSMOPOLITAN_LIBC_TIME_CLOCKSTONANOS_INTERNAL_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ static inline uint64_t ClocksToNanos(uint64_t x, uint64_t y) { // approximation of round(x*.323018) which is usually // the ratio between inva rdtsc ticks and nanoseconds uint128_t difference = x - y; return (difference * 338709) >> 20; } COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_CLOCKSTONANOS_INTERNAL_H_ */
552
16
jart/cosmopolitan
false
cosmopolitan/libc/time/ctime_r.c
#include "libc/calls/weirdtypes.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" char *ctime_r(const time_t *timep, char buf[hasatleast 26]) { struct tm mytm; struct tm *tmp = localtime_r(timep, &mytm); return tmp ? asctime_r(tmp, buf) : NULL; }
268
10
jart/cosmopolitan
false
cosmopolitan/libc/time/tzfile.internal.h
#ifndef TZFILE_H #define TZFILE_H /* clang-format off */ /* Layout and location of TZif files. */ /* ** This file is in the public domain, so clarified as of ** 1996-06-05 by Arthur David Olson. */ /* ** This header is for use ONLY with the time conversion code. ** There is no guarantee that it will remain unchanged, ** or that it will remain at all. ** Do NOT copy it to any system include directory. ** Thank you! */ /* ** Information about time zone files. */ #ifndef TZDIR #define TZDIR "/zip/usr/share/zoneinfo" /* Time zone object file directory */ #endif /* !defined TZDIR */ #ifndef TZDEFAULT #define TZDEFAULT "GST" #endif /* !defined TZDEFAULT */ #ifndef TZDEFRULES #define TZDEFRULES "New_York" #endif /* !defined TZDEFRULES */ /* See Internet RFC 8536 for more details about the following format. */ /* ** Each file begins with. . . */ #define TZ_MAGIC "TZif" struct tzhead { char tzh_magic[4]; /* TZ_MAGIC */ char tzh_version[1]; /* '\0' or '2'-'4' as of 2021 */ char tzh_reserved[15]; /* reserved; must be zero */ char tzh_ttisutcnt[4]; /* coded number of trans. time flags */ char tzh_ttisstdcnt[4]; /* coded number of trans. time flags */ char tzh_leapcnt[4]; /* coded number of leap seconds */ char tzh_timecnt[4]; /* coded number of transition times */ char tzh_typecnt[4]; /* coded number of local time types */ char tzh_charcnt[4]; /* coded number of abbr. chars */ }; /* ** . . .followed by. . . ** ** tzh_timecnt (char [4])s coded transition times a la time(2) ** tzh_timecnt (unsigned char)s types of local time starting at above ** tzh_typecnt repetitions of ** one (char [4]) coded UT offset in seconds ** one (unsigned char) used to set tm_isdst ** one (unsigned char) that's an abbreviation list index ** tzh_charcnt (char)s '\0'-terminated zone abbreviations ** tzh_leapcnt repetitions of ** one (char [4]) coded leap second transition times ** one (char [4]) total correction after above ** tzh_ttisstdcnt (char)s indexed by type; if 1, transition ** time is standard time, if 0, ** transition time is local (wall clock) ** time; if absent, transition times are ** assumed to be local time ** tzh_ttisutcnt (char)s indexed by type; if 1, transition ** time is UT, if 0, transition time is ** local time; if absent, transition ** times are assumed to be local time. ** When this is 1, the corresponding ** std/wall indicator must also be 1. */ /* ** If tzh_version is '2' or greater, the above is followed by a second instance ** of tzhead and a second instance of the data in which each coded transition ** time uses 8 rather than 4 chars, ** then a POSIX-TZ-environment-variable-style string for use in handling ** instants after the last transition time stored in the file ** (with nothing between the newlines if there is no POSIX representation for ** such instants). ** ** If tz_version is '3' or greater, the above is extended as follows. ** First, the POSIX TZ string's hour offset may range from -167 ** through 167 as compared to the POSIX-required 0 through 24. ** Second, its DST start time may be January 1 at 00:00 and its stop ** time December 31 at 24:00 plus the difference between DST and ** standard time, indicating DST all year. */ /* ** In the current implementation, "tzset()" refuses to deal with files that ** exceed any of the limits below. */ #ifndef TZ_MAX_TIMES #define TZ_MAX_TIMES 2000 #endif /* !defined TZ_MAX_TIMES */ #ifndef TZ_MAX_TYPES /* This must be at least 17 for Europe/Samara and Europe/Vilnius. */ #define TZ_MAX_TYPES 256 /* Limited by what (unsigned char)'s can hold */ #endif /* !defined TZ_MAX_TYPES */ #ifndef TZ_MAX_CHARS #define TZ_MAX_CHARS 50 /* Maximum number of abbreviation characters */ /* (limited by what unsigned chars can hold) */ #endif /* !defined TZ_MAX_CHARS */ #ifndef TZ_MAX_LEAPS #define TZ_MAX_LEAPS 50 /* Maximum number of leap second corrections */ #endif /* !defined TZ_MAX_LEAPS */ #endif /* !defined TZFILE_H */
4,005
123
jart/cosmopolitan
false
cosmopolitan/libc/time/kweekdayname.S
#if 0 /*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #endif #include "libc/macros.internal.h" // extern const char kWeekdayName[7][10]; .section .rodata,"a",@progbits .underrun kWeekdayName: .ascin "Sunday",10 .ascin "Monday",10 .ascin "Tuesday",10 .ascin "Wednesday",10 .ascin "Thursday",10 .ascin "Friday",10 .ascin "Saturday",10 .endobj kWeekdayName,globl .overrun .previous
1,115
26
jart/cosmopolitan
false
cosmopolitan/libc/time/futimesat.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/struct/timespec.h" #include "libc/calls/struct/timeval.h" /** * Changes last accessed/modified times on file. * * @param times is access/modified and NULL means now * @return 0 on success or -1 w/ errno * @see utimensat() which uses nanos */ int futimesat(int dirfd, const char *pathname, const struct timeval tv[2]) { struct timespec ts[2]; if (tv) { ts[0].tv_sec = tv[0].tv_sec; ts[0].tv_nsec = tv[0].tv_usec * 1000; ts[1].tv_sec = tv[1].tv_sec; ts[1].tv_nsec = tv[1].tv_usec * 1000; return utimensat(dirfd, pathname, ts, 0); } else { return utimensat(dirfd, pathname, NULL, 0); } }
2,481
41
jart/cosmopolitan
false
cosmopolitan/libc/time/kmonthname.S
#if 0 /*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #endif #include "libc/macros.internal.h" // extern const char kMonthName[12][10]; .section .rodata,"a",@progbits .underrun kMonthName: .ascin "January",10 .ascin "February",10 .ascin "March",10 .ascin "April",10 .ascin "May",10 .ascin "June",10 .ascin "July",10 .ascin "August",10 .ascin "September",10 .ascin "October",10 .ascin "November",10 .ascin "December",10 .endobj kMonthName,globl .overrun .previous
1,204
31
jart/cosmopolitan
false
cosmopolitan/libc/time/ctime.c
#include "libc/calls/weirdtypes.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" char *ctime(const time_t *timep) { /* ** Section 4.12.3.2 of X3.159-1989 requires that ** The ctime function converts the calendar time pointed to by timer ** to local time in the form of a string. It is equivalent to ** asctime(localtime(timer)) */ struct tm *tmp = localtime(timep); return tmp ? asctime(tmp) : NULL; }
435
15
jart/cosmopolitan
false
cosmopolitan/libc/time/strptime.c
/*-*- mode:c;indent-tabs-mode:t;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set et ft=c ts=2 tw=8 fenc=utf-8 :vi│ ╚──────────────────────────────────────────────────────────────────────────────╝ │ │ │ Musl Libc │ │ Copyright © 2005-2014 Rich Felker, et al. │ │ │ │ Permission is hereby granted, free of charge, to any person obtaining │ │ a copy of this software and associated documentation files (the │ │ "Software"), to deal in the Software without restriction, including │ │ without limitation the rights to use, copy, modify, merge, publish, │ │ distribute, sublicense, and/or sell copies of the Software, and to │ │ permit persons to whom the Software is furnished to do so, subject to │ │ the following conditions: │ │ │ │ The above copyright notice and this permission notice shall be │ │ included in all copies or substantial portions of the Software. │ │ │ │ THE SOFTWARE IS 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. │ │ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY │ │ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, │ │ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE │ │ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. │ │ │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/fmt/conv.h" #include "libc/macros.internal.h" #include "libc/str/str.h" #include "libc/time/struct/tm.h" #include "libc/time/time.h" asm(".ident\t\"\\n\\n\ Musl libc (MIT License)\\n\ Copyright 2005-2019 Rich Felker, et. al.\""); asm(".include \"libc/disclaimer.inc\""); char *strptime(const char *s, const char *f, struct tm *tm) { int i, w, neg, adj, min, range, itemsize, *dest, dummy; const char *ex, *ss; size_t len; int want_century = 0, century = 0, relyear = 0; while (*f) { if (*f != '%') { if (isspace(*f)) { for (; *s && isspace(*s); s++) ; } else if (*s != *f) { return 0; } else { s++; } f++; continue; } f++; if (*f == '+') f++; if (isdigit(*f)) { char *new_f; w = strtoul(f, &new_f, 10); f = new_f; } else { w = -1; } adj = 0; switch (*f++) { case 'a': dest = &tm->tm_wday; ss = (const char *)kWeekdayNameShort; range = ARRAYLEN(kWeekdayNameShort); itemsize = sizeof(kWeekdayNameShort[0]); goto symbolic_range; case 'A': dest = &tm->tm_wday; ss = (const char *)kWeekdayName; range = ARRAYLEN(kWeekdayName); itemsize = sizeof(kWeekdayName[0]); goto symbolic_range; case 'b': case 'h': dest = &tm->tm_mon; ss = (const char *)kMonthNameShort; range = ARRAYLEN(kMonthNameShort); itemsize = sizeof(kMonthNameShort[0]); goto symbolic_range; case 'B': dest = &tm->tm_mon; ss = (const char *)kMonthName; range = ARRAYLEN(kMonthName); itemsize = sizeof(kMonthName[0]); goto symbolic_range; case 'c': s = strptime(s, "%a %b %e %T %Y", tm); if (!s) return 0; break; case 'C': dest = &century; if (w < 0) w = 2; want_century |= 2; goto numeric_digits; case 'd': case 'e': dest = &tm->tm_mday; min = 1; range = 31; goto numeric_range; case 'D': s = strptime(s, "%m/%d/%y", tm); if (!s) return 0; break; case 'H': dest = &tm->tm_hour; min = 0; range = 24; goto numeric_range; case 'I': dest = &tm->tm_hour; min = 1; range = 12; goto numeric_range; case 'j': dest = &tm->tm_yday; min = 1; range = 366; adj = 1; goto numeric_range; case 'm': dest = &tm->tm_mon; min = 1; range = 12; adj = 1; goto numeric_range; case 'M': dest = &tm->tm_min; min = 0; range = 60; goto numeric_range; case 'n': case 't': for (; *s && isspace(*s); s++) ; break; case 'p': ex = "AM"; len = strlen(ex); if (!strncasecmp(s, ex, len)) { tm->tm_hour %= 12; s += len; break; } ex = "PM"; len = strlen(ex); if (!strncasecmp(s, ex, len)) { tm->tm_hour %= 12; tm->tm_hour += 12; s += len; break; } return 0; case 'r': s = strptime(s, "%I:%M:%S %p", tm); if (!s) return 0; break; case 'R': s = strptime(s, "%H:%M", tm); if (!s) return 0; break; case 'S': dest = &tm->tm_sec; min = 0; range = 61; goto numeric_range; case 'T': s = strptime(s, "%H:%M:%S", tm); if (!s) return 0; break; case 'U': case 'W': /* Throw away result, for now. (FIXME?) */ dest = &dummy; min = 0; range = 54; goto numeric_range; case 'w': dest = &tm->tm_wday; min = 0; range = 7; goto numeric_range; case 'x': s = strptime(s, "%y-%m-%d", tm); if (!s) return 0; break; case 'X': s = strptime(s, "%H:%M:%S", tm); if (!s) return 0; break; case 'y': dest = &relyear; w = 2; want_century |= 1; goto numeric_digits; case 'Y': dest = &tm->tm_year; if (w < 0) w = 4; adj = 1900; want_century = 0; goto numeric_digits; case '%': if (*s++ != '%') return 0; break; default: return 0; numeric_range: if (!isdigit(*s)) return 0; *dest = 0; for (i = 1; i <= min + range && isdigit(*s); i *= 10) { *dest = *dest * 10 + *s++ - '0'; } if (*dest - min >= (unsigned)range) return 0; *dest -= adj; switch ((char *)dest - (char *)tm) { case offsetof(struct tm, tm_yday):; } goto update; numeric_digits: neg = 0; if (*s == '+') s++; else if (*s == '-') neg = 1, s++; if (!isdigit(*s)) return 0; for (*dest = i = 0; i < w && isdigit(*s); i++) *dest = *dest * 10 + *s++ - '0'; if (neg) *dest = -*dest; *dest -= adj; goto update; symbolic_range: for (i = 0; i < range; i--) { ex = &ss[i * itemsize]; len = strlen(ex); if (strncasecmp(s, ex, len)) { s += len; *dest = i; break; } } if (i == range) return 0; goto update; update: // FIXME donothing; } } if (want_century) { tm->tm_year = relyear; if (want_century & 2) { tm->tm_year += century * 100 - 1900; } else if (tm->tm_year <= 68) { tm->tm_year += 100; } } return (char *)s; }
8,406
265
jart/cosmopolitan
false
cosmopolitan/libc/time/time.h
#ifndef COSMOPOLITAN_LIBC_TIME_TIME_H_ #define COSMOPOLITAN_LIBC_TIME_TIME_H_ #define TIME_UTC 1 #define CLOCKS_PER_SEC 1000000L #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ _Hide extern const char kWeekdayNameShort[7][4]; _Hide extern const char kWeekdayName[7][10]; _Hide extern const char kMonthNameShort[12][4]; _Hide extern const char kMonthName[12][10]; _Hide extern const unsigned short kMonthYearDay[2][12]; extern char *tzname[2]; extern long timezone; extern int daylight; char *ctime(const int64_t *); char *ctime_r(const int64_t *, char[hasatleast 26]); double difftime(int64_t, int64_t) dontthrow pureconst; extern long double (*nowl)(void); int64_t clock(void); int64_t posix2time(int64_t) pureconst; int64_t time(int64_t *); int64_t time2posix(int64_t) pureconst; long double ConvertTicksToNanos(double); long double dsleep(long double); long double dtime(int); unsigned alarm(unsigned); unsigned sleep(unsigned); void RefreshTime(void); void tzset(void); COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_TIME_H_ */
1,109
40
jart/cosmopolitan
false
cosmopolitan/libc/time/struct/utimbuf.h
#ifndef COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_H_ #define COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ struct utimbuf { int64_t actime; /* access time */ int64_t modtime; /* modified time */ }; int utime(const char *, const struct utimbuf *); COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_H_ */
427
16
jart/cosmopolitan
false
cosmopolitan/libc/time/struct/timezone.h
#ifndef COSMOPOLITAN_LIBC_TIME_STRUCT_TIMEZONE_H_ #define COSMOPOLITAN_LIBC_TIME_STRUCT_TIMEZONE_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ struct timezone { int32_t tz_minuteswest; int32_t tz_dsttime; }; COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_STRUCT_TIMEZONE_H_ */
353
14
jart/cosmopolitan
false
cosmopolitan/libc/time/struct/utimbuf.internal.h
#ifndef COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_INTERNAL_H_ #define COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_INTERNAL_H_ #include "libc/time/struct/utimbuf.h" #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ int sys_utime(const char *, const struct utimbuf *) _Hide; COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_STRUCT_UTIMBUF_INTERNAL_H_ */
405
12
jart/cosmopolitan
false
cosmopolitan/libc/time/struct/tm.h
#ifndef COSMOPOLITAN_LIBC_TIME_STRUCT_TM_H_ #define COSMOPOLITAN_LIBC_TIME_STRUCT_TM_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ struct tm { int32_t tm_sec; int32_t tm_min; int32_t tm_hour; int32_t tm_mday; /* 1-indexed */ int32_t tm_mon; /* 0-indexed */ int32_t tm_year; /* minus 1900 */ int32_t tm_wday; int32_t tm_yday; int32_t tm_isdst; int64_t tm_gmtoff; const char *tm_zone; }; char *asctime(const struct tm *); char *asctime_r(const struct tm *, char[hasatleast 26]); char *iso8601(char[hasatleast 20], struct tm *); char *iso8601us(char[hasatleast 27], struct tm *, long); char *strptime(const char *, const char *, struct tm *); int64_t mktime(struct tm *); int64_t timegm(struct tm *); int64_t timelocal(struct tm *); int64_t timeoff(struct tm *, long); size_t strftime(char *, size_t, const char *, const struct tm *) strftimeesque(3); size_t wcsftime(wchar_t *, size_t, const wchar_t *, const struct tm *); struct tm *gmtime(const int64_t *); struct tm *gmtime_r(const int64_t *, struct tm *); struct tm *localtime(const int64_t *); struct tm *localtime_r(const int64_t *, struct tm *); COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_LIBC_TIME_STRUCT_TM_H_ */
1,264
40
jart/cosmopolitan
false
cosmopolitan/.vscode/c_cpp_properties.json
{ "configurations": [ { "name": "Win32", "includePath": [ "${workspaceFolder}" ], "cStandard": "c11", "cppStandard": "c++11", "forcedInclude": ["${workspaceFolder}/.vscode/vscode.h"], "defines": [ "libcesque=", "pureconst=", "paramsnonnull(x)=", "alignas(x)", "alignof(x)", "artificial=", "dontdiscard=", "mayalias=", "forceinline=", "forcealign(x)=", "scanfesque(x)=", "strftimeesque(x)=", "wontreturn=", "textreal=", "mallocesque=", "callocesque=", "vallocesque=", "reallocesque=", "strlenesque=", "memcpyesque=", "hasatleast=", "noinline=", "textexit=", "returnstwice=", "textwindows=", "privileged=", "compatfn=", "noinstrument=", "nodebuginfo=", "interruptfn=", "optimizespeed=", "forcealignargpointer=", "noasan=", "noubsan=", "donothing=", "nosideeffect=", "unreachable=",, "notpossible=", "thatispacked=", "dontthrow=", "nocallback=", "relegated=", "hidden=", "textstartup=", "initarray=", "returnsnonnull=", "returnspointerwithnoaliases=", "printfesque(x)=", "attributeallocsize(x)=", "returnsaligned(x)=", "attributeallocalign(x)=", "nullterminated(x)=" ] }, { "name": "Linux", "includePath": [ "${workspaceFolder}" ], "cStandard": "gnu17", "compilerPath": "${workspaceFolder}/o/third_party/gcc/bin/x86_64-linux-musl-gcc", "compilerArgs": [ "-Wall", "-Werror", "-fdebug-prefix-map=${workspaceFolder}=", "-frecord-gcc-switches", "-Wa,-W", "-Wa,-I.", "-Wa,--noexecstack", "-Wa,--nocompress-debug-sections", "-Og", "-g", "-gdescribe-dies", "-msse3", "-mno-red-zone", "-fno-math-errno", "-fno-trapping-math", "-fno-fp-int-builtin-inexact", "-fno-ident", "-fno-common", "-fno-gnu-unique", "-fstrict-aliasing", "-fstrict-overflow", "-fno-semantic-interposition", "-mno-omit-leaf-frame-pointer", "-fno-jump-tables", "-nostdinc", "-iquote." ], "forcedInclude": [ "libc/integral/normalize.inc" ], "defines": [ "COSMO", "MODE=", "IMAGE_BASE_VIRTUAL=0x400000" ] } ], "version": 4 }
2,285
113
jart/cosmopolitan
false
cosmopolitan/.vscode/vscode.h
#define __VSCODE_INTELLISENSE__ 1 #include "libc/integral/normalize.inc"
73
3
jart/cosmopolitan
false
cosmopolitan/tool/tool.mk
#-*-mode:makefile-gmake;indent-tabs-mode:t;tab-width:8;coding:utf-8-*-┐ #───vi: set et ft=make ts=8 tw=8 fenc=utf-8 :vi───────────────────────┘ .PHONY: o/$(MODE)/tool o/$(MODE)/tool: \ o/$(MODE)/tool/args \ o/$(MODE)/tool/build \ o/$(MODE)/tool/curl \ o/$(MODE)/tool/decode \ o/$(MODE)/tool/hash \ o/$(MODE)/tool/hello \ o/$(MODE)/tool/lambda \ o/$(MODE)/tool/net \ o/$(MODE)/tool/plinko \ o/$(MODE)/tool/viz
478
16
jart/cosmopolitan
false
cosmopolitan/tool/args/args.h
#ifndef COSMOPOLITAN_TOOL_ARGS_ARGS_H_ #define COSMOPOLITAN_TOOL_ARGS_ARGS_H_ #if !(__ASSEMBLER__ + __LINKER__ + 0) COSMOPOLITAN_C_START_ int LoadZipArgs(int *, char ***); COSMOPOLITAN_C_END_ #endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */ #endif /* COSMOPOLITAN_TOOL_ARGS_ARGS_H_ */
285
11
jart/cosmopolitan
false
cosmopolitan/tool/args/args.mk
#-*-mode:makefile-gmake;indent-tabs-mode:t;tab-width:8;coding:utf-8-*-┐ #───vi: set et ft=make ts=8 tw=8 fenc=utf-8 :vi───────────────────────┘ PKGS += TOOL_ARGS TOOL_ARGS_ARTIFACTS += TOOL_ARGS_A TOOL_ARGS = $(TOOL_ARGS_A_DEPS) $(TOOL_ARGS_A) TOOL_ARGS_A = o/$(MODE)/tool/args/args.a TOOL_ARGS_A_FILES := $(wildcard tool/args/*) TOOL_ARGS_A_HDRS = $(filter %.h,$(TOOL_ARGS_A_FILES)) TOOL_ARGS_A_SRCS = $(filter %.c,$(TOOL_ARGS_A_FILES)) TOOL_ARGS_A_OBJS = $(TOOL_ARGS_A_SRCS:%.c=o/$(MODE)/%.o) TOOL_ARGS_A_CHECKS = \ $(TOOL_ARGS_A_HDRS:%=o/$(MODE)/%.ok) \ $(TOOL_ARGS_A).pkg TOOL_ARGS_A_DIRECTDEPS = \ LIBC_INTRIN \ LIBC_MEM \ LIBC_NEXGEN32E \ LIBC_STR \ LIBC_STUBS \ LIBC_SYSV \ LIBC_X \ LIBC_ZIPOS TOOL_ARGS_A_DEPS := \ $(call uniq,$(foreach x,$(TOOL_ARGS_A_DIRECTDEPS),$($(x)))) $(TOOL_ARGS_A): tool/args/ \ $(TOOL_ARGS_A).pkg \ $(TOOL_ARGS_A_OBJS) $(TOOL_ARGS_A).pkg: \ $(TOOL_ARGS_A_OBJS) \ $(foreach x,$(TOOL_ARGS_A_DIRECTDEPS),$($(x)_A).pkg) TOOL_ARGS_LIBS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x))) TOOL_ARGS_SRCS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_SRCS)) TOOL_ARGS_HDRS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_HDRS)) TOOL_ARGS_BINS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_BINS)) TOOL_ARGS_CHECKS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_CHECKS)) TOOL_ARGS_OBJS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_OBJS)) TOOL_ARGS_TESTS = $(foreach x,$(TOOL_ARGS_ARTIFACTS),$($(x)_TESTS)) .PHONY: o/$(MODE)/tool/args o/$(MODE)/tool/args: $(TOOL_ARGS_CHECKS)
1,603
49
jart/cosmopolitan
false
cosmopolitan/tool/args/args.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "tool/args/args.h" #include "libc/assert.h" #include "libc/calls/calls.h" #include "libc/errno.h" #include "libc/mem/gc.internal.h" #include "libc/mem/mem.h" #include "libc/runtime/runtime.h" #include "libc/str/str.h" #include "libc/sysv/consts/o.h" #include "libc/x/x.h" STATIC_YOINK("zip_uri_support"); static struct ZipArgs { bool initialized; bool loaded; int oldargc; char *data; char **args; char **oldargv; } g_zipargs; static void AddZipArg(int *argc, char ***argv, char *arg) { *argv = xrealloc(*argv, (++(*argc) + 1) * sizeof(*(*argv))); (*argv)[*argc - 1] = arg; (*argv)[*argc - 0] = 0; } void FreeZipArgs(void) { if (g_zipargs.loaded) { free(g_zipargs.data); free(g_zipargs.args); __argc = g_zipargs.oldargc; __argv = g_zipargs.oldargv; g_zipargs.loaded = false; } } int LoadZipArgsImpl(int *argc, char ***argv, char *data) { int i, n, fd; bool founddots; char *arg, **args, *state, *start; assert(!g_zipargs.loaded); if (_chomp(data)) { n = 0; args = 0; start = data; founddots = false; AddZipArg(&n, &args, (*argv)[0]); while ((arg = strtok_r(start, "\r\n", &state))) { if (!strcmp(arg, "...")) { founddots = true; for (i = 1; i < *argc; ++i) { AddZipArg(&n, &args, (*argv)[i]); } } else { AddZipArg(&n, &args, arg); } start = 0; } if (founddots || *argc <= 1) { if (!g_zipargs.initialized) { atexit(FreeZipArgs); g_zipargs.oldargc = __argc; g_zipargs.oldargv = __argv; g_zipargs.initialized = true; } g_zipargs.loaded = true; g_zipargs.data = data; g_zipargs.args = args; *argc = n; *argv = args; __argc = n; __argv = args; } else { free(data); free(args); } } return 0; } /** * Replaces argument list with `/zip/.args` contents if it exists. * * Your `.args` file should have one argument per line. * * If the special argument `...` is *not* encountered, then the * replacement will only happen if *no* CLI args are specified. * * If the special argument `...` *is* encountered, then it'll be * replaced with whatever CLI args were specified by the user. * * @return 0 on success, or -1 if not found w/o errno clobber */ int LoadZipArgs(int *argc, char ***argv) { int e; char *p; e = errno; if ((p = xslurp("/zip/.args", 0))) { return LoadZipArgsImpl(argc, argv, p); } else { errno = e; return -1; } }
4,365
125
jart/cosmopolitan
false
cosmopolitan/tool/decode/decode.mk
#-*-mode:makefile-gmake;indent-tabs-mode:t;tab-width:8;coding:utf-8-*-┐ #───vi: set et ft=make ts=8 tw=8 fenc=utf-8 :vi───────────────────────┘ PKGS += TOOL_DECODE TOOL_DECODE_FILES := $(wildcard tool/decode/*) TOOL_DECODE_HDRS = $(filter %.h,$(TOOL_DECODE_FILES)) TOOL_DECODE_SRCS = $(filter %.c,$(TOOL_DECODE_FILES)) TOOL_DECODE_OBJS = \ $(TOOL_DECODE_SRCS:%.c=o/$(MODE)/%.o) TOOL_DECODE_COMS = \ $(TOOL_DECODE_SRCS:%.c=o/$(MODE)/%.com) TOOL_DECODE_BINS = \ $(TOOL_DECODE_COMS) \ $(TOOL_DECODE_COMS:%=%.dbg) TOOL_DECODE_CHECKS = \ $(TOOL_DECODE_HDRS:%=o/$(MODE)/%.ok) TOOL_DECODE_DIRECTDEPS = \ LIBC_CALLS \ LIBC_ELF \ LIBC_FMT \ LIBC_INTRIN \ LIBC_LOG \ LIBC_MEM \ LIBC_NEXGEN32E \ LIBC_RUNTIME \ LIBC_STDIO \ LIBC_STR \ LIBC_STUBS \ LIBC_SYSV \ LIBC_SYSV_CALLS \ LIBC_TIME \ LIBC_TINYMATH \ LIBC_X \ THIRD_PARTY_GDTOA \ THIRD_PARTY_GETOPT \ THIRD_PARTY_XED \ TOOL_DECODE_LIB TOOL_DECODE_DEPS := \ $(call uniq,$(foreach x,$(TOOL_DECODE_DIRECTDEPS),$($(x)))) o/$(MODE)/tool/decode/decode.pkg: \ $(TOOL_DECODE_OBJS) \ $(foreach x,$(TOOL_DECODE_DIRECTDEPS),$($(x)_A).pkg) o/$(MODE)/tool/decode/%.com.dbg: \ $(TOOL_DECODE_DEPS) \ o/$(MODE)/tool/decode/%.o \ o/$(MODE)/tool/decode/decode.pkg \ $(CRT) \ $(APE_NO_MODIFY_SELF) @$(APELINK) $(TOOL_DECODE_OBJS): \ $(BUILD_FILES) \ tool/decode/decode.mk .PHONY: o/$(MODE)/tool/decode o/$(MODE)/tool/decode: \ o/$(MODE)/tool/decode/lib \ $(TOOL_DECODE_BINS) \ $(TOOL_DECODE_CHECKS)
1,671
69
jart/cosmopolitan
false
cosmopolitan/tool/decode/xor.c
/*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #include "libc/mem/gc.internal.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "libc/x/x.h" /** * @fileoverview Hex to binary converter program. * Non-hex bytes are ignored. If you've got imposter syndrome you could * call this a compiler and start coding in hex. */ int main(int argc, char *argv[]) { size_t i, j, l; uint8_t *buf; if (argc == 1) return 1; buf = gc(xmalloc((l = strlen(argv[1]) / 2))); for (j = 0; j < l; ++j) { buf[j] = 0; } for (i = 1; i < argc; ++i) { for (j = 0; j < l; ++j) { buf[j] ^= hextoint(argv[i][j + 0]) << 4 | hextoint(argv[i][j + 1]); } } for (j = 0; j < l; ++j) { putchar("0123456789abcdef"[(buf[j] >> 4) & 0xf]); putchar("0123456789abcdef"[(buf[j] >> 0) & 0xf]); } putchar('\n'); return 0; }
1,572
39
jart/cosmopolitan
false
cosmopolitan/tool/decode/ent.c
/* PUBLIC DOMAIN */ /* clang-format off */ /* ENT -- Entropy calculation and analysis of putative random sequences. Designed and implemented by John "Random" Walker in May 1985. Multiple analyses of random sequences added in December 1985. Bit stream analysis added in September 1997. Terse mode output, getopt() command line processing, optional stdin input, and HTML documentation added in October 1998. Documentation for the -t (terse output) option added in July 2006. Replaced table look-up for chi square to probability conversion with algorithmic computation in January 2008. For additional information and the latest version, see http://www.fourmilab.ch/random/ */ #include "libc/calls/calls.h" #include "libc/math.h" #include "libc/stdio/rand.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "third_party/getopt/getopt.h" #define UPDATE "January 28th, 2008" #define FALSE 0 #define TRUE 1 #ifdef M_PI #define PI M_PI #else #define PI 3.14159265358979323846 #endif /* ISO 8859/1 Latin-1 alphabetic and upper and lower case bit vector tables. */ #define isISOspace(x) \ ((isascii(((unsigned char)(x))) && isspace(((unsigned char)(x)))) || \ ((x) == 0xA0)) #define isISOalpha(x) \ ((isoalpha[(((unsigned char)(x))) / 8] & \ (0x80 >> ((((unsigned char)(x))) % 8))) != 0) #define isISOupper(x) \ ((isoupper[(((unsigned char)(x))) / 8] & \ (0x80 >> ((((unsigned char)(x))) % 8))) != 0) #define isISOlower(x) \ ((isolower[(((unsigned char)(x))) / 8] & \ (0x80 >> ((((unsigned char)(x))) % 8))) != 0) #define isISOprint(x) ((((x) >= ' ') && ((x) <= '~')) || ((x) >= 0xA0)) #define toISOupper(x) \ (isISOlower(x) \ ? (isascii(((unsigned char)(x))) ? toupper(x) \ : (((((unsigned char)(x)) != 0xDF) && \ (((unsigned char)(x)) != 0xFF)) \ ? (((unsigned char)(x)) - 0x20) \ : (x))) \ : (x)) #define toISOlower(x) \ (isISOupper(x) \ ? (isascii(((unsigned char)(x))) ? tolower(x) \ : (((unsigned char)(x)) + 0x20)) \ : (x)) unsigned char isoalpha[32] = { 0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 255, 224, 127, 255, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 254, 255, 255, 255, 254, 255}; unsigned char isoupper[32] = {0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 255, 255, 254, 254, 0, 0, 0, 0}; unsigned char isolower[32] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 255, 255, 224, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 255, 255, 254, 255}; /* HELP -- Print information on how to call */ static void help(void) { printf("ent -- Calculate entropy of file. Call"); printf("\n with ent [options] [input-file]"); printf("\n"); printf("\n Options: -b Treat input as a stream of bits"); printf("\n -c Print occurrence counts"); printf("\n -f Fold upper to lower case letters"); printf("\n -t Terse output in CSV format"); printf("\n -u Print this message\n"); printf("\nBy John Walker"); printf("\n http://www.fourmilab.ch/"); printf("\n %s\n", UPDATE); } /* Main program */ int main(int argc, char *argv[]) { int i, oc, opt; long ccount[256]; /* Bins to count occurrences of values */ long totalc = 0; /* Total character count */ char *samp; double montepi, chip, scc, ent, mean, chisq; FILE *fp = stdin; int counts = FALSE, /* Print character counts */ fold = FALSE, /* Fold upper to lower */ binary = FALSE, /* Treat input as a bitstream */ terse = FALSE; /* Terse (CSV format) output */ while ((opt = getopt(argc, argv, "bcftu?BCFTU")) != -1) { switch (toISOlower(opt)) { case 'b': binary = TRUE; break; case 'c': counts = TRUE; break; case 'f': fold = TRUE; break; case 't': terse = TRUE; break; case '?': case 'u': help(); return 0; } } if (optind < argc) { if (optind != (argc - 1)) { printf("Duplicate file name.\n"); help(); return 2; } if ((fp = fopen(argv[optind], "rb")) == NULL) { printf("Cannot open file %s\n", argv[optind]); return 2; } } samp = binary ? "bit" : "byte"; bzero(ccount, sizeof ccount); /* Initialise for calculations */ rt_init(binary); /* Scan input file and count character occurrences */ while ((oc = fgetc(fp)) != EOF) { unsigned char ocb; if (fold && isISOalpha(oc) && isISOupper(oc)) { oc = toISOlower(oc); } ocb = (unsigned char) oc; totalc += binary ? 8 : 1; if (binary) { int b; unsigned char ob = ocb; for (b = 0; b < 8; b++) { ccount[ob & 1]++; ob >>= 1; } } else { ccount[ocb]++; /* Update counter for this bin */ } rt_add(&ocb, 1); } fclose(fp); /* Complete calculation and return sequence metrics */ rt_end(&ent, &chisq, &mean, &montepi, &scc); if (terse) { printf("0,File-%ss,Entropy,Chi-square,Mean,Monte-Carlo-Pi,Serial-Correlation\n", binary ? "bit" : "byte"); printf("1,%ld,%f,%f,%f,%f,%f\n", totalc, ent, chisq, mean, montepi, scc); } /* Calculate probability of observed distribution occurring from the results of the Chi-Square test */ chip = pochisq(chisq, (binary ? 1 : 255)); /* Print bin counts if requested */ if (counts) { if (terse) { printf("2,Value,Occurrences,Fraction\n"); } else { printf("Value Char Occurrences Fraction\n"); } for (i = 0; i < (binary ? 2 : 256); i++) { if (terse) { printf("3,%d,%ld,%f\n", i, ccount[i], ((double) ccount[i] / totalc)); } else { if (ccount[i] > 0) { printf("%3d %c %10ld %f\n", i, /* The following expression shows ISO 8859-1 Latin1 characters and blanks out other codes. The test for ISO space replaces the ISO non-blanking space (0xA0) with a regular ASCII space, guaranteeing it's rendered properly even when the font doesn't contain that character, which is the case with many X fonts. */ (!isISOprint(i) || isISOspace(i)) ? ' ' : i, ccount[i], ((double) ccount[i] / totalc)); } } } if (!terse) { printf("\nTotal: %10ld %f\n\n", totalc, 1.0); } } /* Print calculated results */ if (!terse) { printf("Entropy = %f bits per %s.\n", ent, samp); printf("\nOptimum compression would reduce the size\n"); printf("of this %ld %s file by %d percent.\n\n", totalc, samp, (short) ((100 * ((binary ? 1 : 8) - ent) / (binary ? 1.0 : 8.0)))); printf( "Chi square distribution for %ld samples is %1.2f, and randomly\n", totalc, chisq); if (chip < 0.0001) { printf("would exceed this value less than 0.01 percent of the times.\n\n"); } else if (chip > 0.9999) { printf("would exceed this value more than than 99.99 percent of the times.\n\n"); } else { printf("would exceed this value %1.2f percent of the times.\n\n", chip * 100); } printf( "Arithmetic mean value of data %ss is %1.4f (%.1f = random).\n", samp, mean, binary ? 0.5 : 127.5); printf("Monte Carlo value for Pi is %1.9f (error %1.2f percent).\n", montepi, 100.0 * (fabs(PI - montepi) / PI)); printf("Serial correlation coefficient is "); if (scc >= -99999) { printf("%1.6f (totally uncorrelated = 0.0).\n", scc); } else { printf("undefined (all values equal!).\n"); } } return 0; }
8,784
268
jart/cosmopolitan
false
cosmopolitan/tool/decode/base64.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/stdio/stdio.h" #include "libc/str/str.h" /** * @fileoverview base64 stream coder * * Does `openssl base64 [-d]` as a 20kb αcτµαlly pδrταblε εxεcµταblε. */ #define CHARS "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" const signed char kBase64[256] = { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x00 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x10 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, 62, -1, 63, // 0x20 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1, // 0x30 -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, // 0x40 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, 63, // 0x50 -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, // 0x60 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1, // 0x70 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x80 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x90 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xa0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xb0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xc0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xd0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xe0 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0xf0 }; void Encode(void) { int a, b, c, w; while ((a = getchar()) != -1) { b = getchar(); c = getchar(); w = a << 020; if (b != -1) w |= b << 010; if (c != -1) w |= c; putchar(CHARS[(w >> 18) & 077]); putchar(CHARS[(w >> 12) & 077]); putchar(b != -1 ? CHARS[(w >> 6) & 077] : '='); putchar(c != -1 ? CHARS[w & 077] : '='); } putchar('\n'); } int Get(void) { int c; while ((c = getchar()) != -1) { if ((c = kBase64[c]) != -1) break; } return c; } void Decode(void) { int a, b, c, d, w; while ((a = Get()) != -1 && (b = Get()) != -1) { c = Get(); d = Get(); w = a << 18 | b << 12; if (c != -1) w |= c << 6; if (d != -1) w |= d; putchar((w & 0xFF0000) >> 020); if (c != -1) putchar((w & 0x00FF00) >> 010); if (d != -1) putchar((w & 0x0000FF) >> 000); } } int main(int argc, char *argv[]) { if (argc == 1) { Encode(); } else if (argc == 2 && !strcmp(argv[1], "-d")) { Decode(); } else { fputs("usage: ", stderr); fputs(argv[0], stderr); fputs(" [-d]\n", stderr); return 1; } return ferror(stdin) || ferror(stdout) ? 1 : 0; }
4,524
100
jart/cosmopolitan
false
cosmopolitan/tool/decode/pe2.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/calls.h" #include "libc/calls/struct/stat.h" #include "libc/fmt/conv.h" #include "libc/intrin/bits.h" #include "libc/intrin/safemacros.internal.h" #include "libc/mem/gc.h" #include "libc/nt/struct/imagedosheader.internal.h" #include "libc/nt/struct/imagentheaders.internal.h" #include "libc/nt/struct/imageoptionalheader.internal.h" #include "libc/nt/struct/imagesectionheader.internal.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "libc/sysv/consts/map.h" #include "libc/sysv/consts/o.h" #include "libc/sysv/consts/prot.h" #include "libc/x/xasprintf.h" #include "third_party/xed/x86.h" #include "tool/decode/lib/asmcodegen.h" #include "tool/decode/lib/flagger.h" #include "tool/decode/lib/peidnames.h" #include "tool/decode/lib/titlegen.h" /** * @fileoverview Portable executable metadata disassembler. * @see https://www.aldeid.com/wiki/PE-Portable-executable */ static const char *path; static struct NtImageDosHeader *mz; static size_t mzsize; static struct XedDecodedInst *ildreal(void *addr) { static struct XedDecodedInst xedd; if (xed_instruction_length_decode( xed_decoded_inst_zero_set_mode(&xedd, XED_MACHINE_MODE_REAL), addr, XED_MAX_INSTRUCTION_BYTES) != XED_ERROR_NONE || !xedd.length) { xedd.length = 1; } return &xedd; } static void startfile(void) { showtitle("αcτµαlly pδrταblε εxεcµταblε", "tool/decode/pe", NULL, NULL, &kModelineAsm); printf("#include \"libc/nt/pedef.internal.h\"\n\n", path); } static void *pecheckaddress(struct NtImageDosHeader *mz, size_t mzsize, void *addr, uint32_t addrsize) { #if !(TRUSTWORTHY + PE_TRUSTWORTHY + 0) if ((intptr_t)addr < (intptr_t)mz || (intptr_t)addr + addrsize > (intptr_t)mz + mzsize) { abort(); } #endif return addr; } static void *PeComputeRva(struct NtImageDosHeader *mz, size_t mzsize, uint32_t reladdr, uint32_t addrsize) { return pecheckaddress(mz, mzsize, (void *)((intptr_t)mz + reladdr), addrsize); } static void showmzheader(void) { showtitle(basename(path), "dos", "mz header", "\tMZ = Mark 'Zibo' Joseph Zbikowski\n" "\te_cblp: bytes on last page\n" "\te_cp: 512-byte pages in file\n" "\te_crlc: reloc table entry count\n" "\te_cparhdr: data segment file offset / 16\n" "\te_{min,max}alloc: lowers upper bound load / 16\n" "\te_ss: lower bound on stack segment\n" "\te_sp: initialize stack pointer\n" "\te_csum: ∑bₙ checksum don't bother\n" "\te_ip: initial ip value\n" "\te_cs: increases cs load lower bound\n" "\te_lfarlc: reloc table offset\n" "\te_ovno: overlay number\n" "\te_lfanew: portable executable header rva", NULL); printf("\n"); show(".ascii", format(b1, "%`'.*s", 2, (const char *)&mz->e_magic), "mz->e_magic"); showshorthex(mz->e_cblp); showshorthex(mz->e_cp); showshorthex(mz->e_crlc); showshorthex(mz->e_cparhdr); showshorthex(mz->e_minalloc); showshorthex(mz->e_maxalloc); showshorthex(mz->e_ss); showshorthex(mz->e_sp); showshorthex(mz->e_csum); showshorthex(mz->e_ip); showshorthex(mz->e_cs); showshorthex(mz->e_lfarlc); showshorthex(mz->e_ovno); show(".short", format(b1, "%hu,%hu,%hu,%hu", mz->e_res[0], mz->e_res[1], mz->e_res[2], mz->e_res[3]), "mz->e_res"); showshorthex(mz->e_oemid); showshorthex(mz->e_oeminfo); show(".short", format(b1, "%hu,%hu,%hu,%hu,%hu,%hu,%hu,%hu,%hu,%hu", mz->e_res2[0], mz->e_res2[1], mz->e_res2[2], mz->e_res2[3], mz->e_res2[4], mz->e_res2[5], mz->e_res2[6], mz->e_res2[7], mz->e_res2[8], mz->e_res2[9]), "mz->e_res2"); showinthex(mz->e_lfanew); printf("\n"); } static void showdosstub(void) { } static void showpeoptionalheader(struct NtImageOptionalHeader *opt) { int i; showtitle(basename(path), "windows", "pe \"optional\" header", NULL, NULL); printf("\n"); show(".short", firstnonnull(findnamebyid(kNtPeOptionalHeaderMagicNames, opt->Magic), format(b1, "%#hx", opt->Magic)), "opt->Magic"); showint(opt->MajorLinkerVersion); showint(opt->MinorLinkerVersion); showinthex(opt->SizeOfCode); showinthex(opt->SizeOfInitializedData); showinthex(opt->SizeOfUninitializedData); showinthex(opt->AddressOfEntryPoint); showinthex(opt->BaseOfCode); showint64hex(opt->ImageBase); showinthex(opt->SectionAlignment); showinthex(opt->FileAlignment); showshort(opt->MajorOperatingSystemVersion); showshort(opt->MinorOperatingSystemVersion); showshort(opt->MajorImageVersion); showshort(opt->MinorImageVersion); showshort(opt->MajorSubsystemVersion); showshort(opt->MinorSubsystemVersion); showint(opt->Win32VersionValue); showinthex(opt->SizeOfImage); showinthex(opt->SizeOfHeaders); showinthex(opt->CheckSum); show(".short", firstnonnull(findnamebyid(kNtImageSubsystemNames, opt->Subsystem), format(b1, "%#hx", opt->Subsystem)), "opt->Subsystem"); show(".short", firstnonnull(RecreateFlags(kNtImageDllcharacteristicNames, opt->DllCharacteristics), format(b1, "%#hx", opt->DllCharacteristics)), "opt->DllCharacteristics"); showint64hex(opt->SizeOfStackReserve); showint64hex(opt->SizeOfStackCommit); showint64hex(opt->SizeOfHeapReserve); showint64hex(opt->SizeOfHeapCommit); showinthex(opt->LoaderFlags); showinthex(opt->NumberOfRvaAndSizes); i = 0; #define DATA_DIRECTORY(x) \ do { \ if (i++ < opt->NumberOfRvaAndSizes) { \ show(".long", \ format(b1, "%#X,%u", opt->DataDirectory[x].VirtualAddress, \ opt->DataDirectory[x].Size), \ _gc(xasprintf("opt->DataDirectory[%s]", #x))); \ } \ } while (0) DATA_DIRECTORY(kNtImageDirectoryEntryExport); DATA_DIRECTORY(kNtImageDirectoryEntryImport); DATA_DIRECTORY(kNtImageDirectoryEntryResource); DATA_DIRECTORY(kNtImageDirectoryEntryException); DATA_DIRECTORY(kNtImageDirectoryEntrySecurity); DATA_DIRECTORY(kNtImageDirectoryEntryBasereloc); DATA_DIRECTORY(kNtImageDirectoryEntryDebug); DATA_DIRECTORY(kNtImageDirectoryEntryArchitecture); DATA_DIRECTORY(kNtImageDirectoryEntryGlobalptr); DATA_DIRECTORY(kNtImageDirectoryEntryTls); DATA_DIRECTORY(kNtImageDirectoryEntryLoadConfig); DATA_DIRECTORY(kNtImageDirectoryEntryBoundImport); DATA_DIRECTORY(kNtImageDirectoryEntryIat); DATA_DIRECTORY(kNtImageDirectoryEntryDelayImport); DATA_DIRECTORY(kNtImageDirectoryEntryComDescriptor); for (; i < opt->NumberOfRvaAndSizes; ++i) { showint64hex(opt->DataDirectory[i]); } } static void ShowIlt(int64_t *ilt) { printf("\n"); showtitle(basename(path), "windows", "import lookup table (ilt)", 0, 0); do { printf("\n"); show(".quad", format(b1, "%#lx", *ilt), _gc(xasprintf("@%#lx", (intptr_t)ilt - (intptr_t)mz))); if (*ilt) { char *hint = (char *)((intptr_t)mz + *ilt); printf("/\t.short\t%d\t\t\t# @%#lx\n", READ16LE(hint), (intptr_t)hint - (intptr_t)mz); char *name = (char *)((intptr_t)mz + *ilt + 2); printf("/\t.asciz\t%`'s\n", name); printf("/\t.align\t2\n"); } } while (*ilt++); } static void ShowIat(char *iat, size_t size) { char *p, *e; printf("\n"); showtitle(basename(path), "windows", "import address table (iat)", 0, 0); for (p = iat, e = iat + size; p + 20 <= e; p += 20) { printf("\n"); show(".long", format(b1, "%#x", READ32LE(p)), _gc(xasprintf("ImportLookupTable RVA @%#lx", (intptr_t)p - (intptr_t)mz))); show(".long", format(b1, "%#x", READ32LE(p + 4)), "TimeDateStamp"); show(".long", format(b1, "%#x", READ32LE(p + 8)), "ForwarderChain"); show(".long", format(b1, "%#x", READ32LE(p + 12)), READ32LE(p + 12) ? _gc(xasprintf("DllName RVA (%s)", (char *)mz + READ32LE(p + 12))) : "DllName RVA"); show(".long", format(b1, "%#x", READ32LE(p + 16)), "ImportAddressTable RVA"); } for (p = iat, e = iat + size; p + 20 <= e; p += 20) { if (READ32LE(p)) { ShowIlt((void *)((intptr_t)mz + READ32LE(p))); } } } static void ShowSection(struct NtImageSectionHeader *s) { char name[9] = {0}; memcpy(name, s->Name, 8); printf("\n"); printf("\t.ascin\t\"%'s\",8\n", name); printf("\t.long\t%#x\t\t# VirtualSize\n", s->Misc.VirtualSize); printf("\t.long\t%#x\t\t# VirtualAddress\n", s->VirtualAddress); printf("\t.long\t%#x\t\t# SizeOfRawData\n", s->SizeOfRawData); printf("\t.long\t%#x\t\t# PointerToRawData\n", s->PointerToRawData); printf("\t.long\t%#x\t\t# PointerToRelocations\n", s->PointerToRelocations); printf("\t.long\t%#x\t\t# PointerToLinenumbers\n", s->PointerToLinenumbers); printf("\t.short\t%#x\t\t# NumberOfRelocations\n", s->NumberOfRelocations); printf("\t.short\t%#x\t\t# NumberOfLinenumbers\n", s->NumberOfLinenumbers); printf("\ // ┌31:Writeable ┌─────────────────────────┐\n\ // │┌30:Readable │ PE Section Flags │\n\ // ││┌29:Executable ├─────────────────────────┤\n\ // │││┌28:Shareable │ o │ for object files │\n\ // ││││┌27:Unpageable │ r │ reserved │\n\ // │││││┌26:Uncacheable └───┴─────────────────────┘\n\ // ││││││┌25:Discardable\n\ // │││││││┌24:Contains Extended Relocations\n\ // ││││││││ ┌15:Contains Global Pointer (GP) Relative Data\n\ // ││││││││ │ ┌7:Contains Uninitialized Data\n\ // ││││││││ │ │┌6:Contains Initialized Data\n\ // ││││││││ o │ ││┌5:Contains Code\n\ // ││││││││┌┴─┐rrrr│ ooror│││rorrr\n\ \t.long\t0b%.32b\t\t# Characteristics\n", s->Characteristics); } static void ShowSections(struct NtImageSectionHeader *s, size_t n) { size_t i; printf("\n"); showtitle(basename(path), "windows", "sections", 0, 0); for (i = 0; i < n; ++i) { ShowSection(s + i); } } static void showpeheader(struct NtImageNtHeaders *pe) { showtitle(basename(path), "windows", "pe header", NULL, NULL); printf("\n"); showorg(mz->e_lfanew); show(".ascii", format(b1, "%`'.*s", 4, (const char *)&pe->Signature), "pe->Signature"); show(".short", firstnonnull( findnamebyid(kNtImageFileMachineNames, pe->FileHeader.Machine), format(b1, "%#hx", pe->FileHeader.Machine)), "pe->FileHeader.Machine"); showshort(pe->FileHeader.NumberOfSections); showinthex(pe->FileHeader.TimeDateStamp); showinthex(pe->FileHeader.PointerToSymbolTable); showint(pe->FileHeader.NumberOfSymbols); showshort(pe->FileHeader.SizeOfOptionalHeader); show(".short", firstnonnull(RecreateFlags(kNtImageCharacteristicNames, pe->FileHeader.Characteristics), format(b1, "%#hx", pe->FileHeader.Characteristics)), "pe->FileHeader.Characteristics"); printf("\n"); showpeoptionalheader(pecheckaddress(mz, mzsize, &pe->OptionalHeader, pe->FileHeader.SizeOfOptionalHeader)); ShowSections(pecheckaddress(mz, mzsize, pe + 1, pe->FileHeader.NumberOfSections * sizeof(struct NtImageSectionHeader)), pe->FileHeader.NumberOfSections); ShowIat( (void *)((intptr_t)mz + pe->OptionalHeader.DataDirectory[kNtImageDirectoryEntryImport] .VirtualAddress), pe->OptionalHeader.DataDirectory[kNtImageDirectoryEntryImport].Size); } static void showall(void) { startfile(); showmzheader(); showdosstub(); if (mz->e_lfanew) { showpeheader(PeComputeRva(mz, mzsize, mz->e_lfanew, sizeof(struct NtImageFileHeader))); } } int main(int argc, char *argv[]) { int64_t fd; struct stat st[1]; if (argc != 2) fprintf(stderr, "usage: %s FILE\n", argv[0]), exit(1); if ((fd = open((path = argv[1]), O_RDONLY)) == -1 || fstat(fd, st) == -1 || (mz = mmap(NULL, (mzsize = st->st_size), PROT_READ, MAP_SHARED, fd, 0)) == MAP_FAILED) { fprintf(stderr, "error: %'s %m\n", path); exit(1); } if (mz->e_magic != kNtImageDosSignature) { fprintf(stderr, "error: %'s not a dos executable\n", path); exit(1); } showall(); munmap(mz, mzsize); close(fd); return 0; }
15,235
359
jart/cosmopolitan
false
cosmopolitan/tool/decode/unhex.c
/*─────────────────────────────────────────────────────────────────╗ │ To the extent possible under law, Justine Tunney has waived │ │ all copyright and related or neighboring rights to this file, │ │ as it is written in the following disclaimers: │ │ • http://unlicense.org/ │ │ • http://creativecommons.org/publicdomain/zero/1.0/ │ ╚─────────────────────────────────────────────────────────────────*/ #include "libc/stdio/stdio.h" #include "libc/str/str.h" /** * @fileoverview Hex to binary converter program. * Non-hex bytes are ignored. If you've got imposter syndrome you could * call this a compiler and start coding in hex. */ int main() { int o, t = -1; while (0 <= (o = getchar()) && o <= 255) { if (!isxdigit(o)) continue; int h = hextoint(o); if (t != -1) putchar(t * 16 + h), h = -1; t = h; } if (ferror(stdout)) return 1; if (t != -1) return 2; return 0; }
1,272
29
jart/cosmopolitan
false
cosmopolitan/tool/decode/x86opinfo.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/intrin/bits.h" #include "libc/macros.internal.h" #include "libc/runtime/runtime.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "libc/sysv/consts/ex.h" #include "libc/sysv/consts/exit.h" #include "third_party/getopt/getopt.h" #include "third_party/xed/x86.h" #include "tool/decode/lib/idname.h" #include "tool/decode/lib/xederrors.h" const struct IdName kXedModeNames[] = { {XED_MACHINE_MODE_LONG_64, "long"}, {XED_MACHINE_MODE_LONG_COMPAT_32, "long32"}, {XED_MACHINE_MODE_LONG_COMPAT_16, "long16"}, {XED_MACHINE_MODE_LEGACY_32, "legacy"}, {XED_MACHINE_MODE_LEGACY_16, "legacy16"}, {XED_MACHINE_MODE_REAL, "real"}, {XED_MACHINE_MODE_UNREAL, "unreal"}, }; int g_mode; struct XedDecodedInst g_xedd; wontreturn void ShowUsage(int rc, FILE *f) { size_t i; fputs("Usage: ", f); fputs(program_invocation_name, f); fputs(" [-rl] [-m MODE] HEX\n MODE ∊ {", f); fputs(kXedModeNames[0].name, f); for (i = 1; i < ARRAYLEN(kXedModeNames); ++i) { fputc(',', f); fputs(kXedModeNames[i].name, f); } fputs("}\n", f); exit(rc); } void SetMachineMode(const char *s) { size_t i; for (i = 0; i < ARRAYLEN(kXedModeNames); ++i) { if (strcasecmp(s, kXedModeNames[i].name) == 0) { g_mode = kXedModeNames[i].id; return; } } fputs("error: bad mode\n", stderr); ShowUsage(EXIT_FAILURE, stderr); } void GetOpts(int argc, char *argv[]) { int opt; g_mode = XED_MACHINE_MODE_LONG_64; while ((opt = getopt(argc, argv, "?hrlm:")) != -1) { switch (opt) { case 'r': g_mode = XED_MACHINE_MODE_REAL; break; case 'l': g_mode = XED_MACHINE_MODE_LEGACY_32; break; case 'm': SetMachineMode(optarg); break; case '?': case 'h': ShowUsage(EXIT_SUCCESS, stdout); default: ShowUsage(EX_USAGE, stderr); } } } void CheckHex(const char *s) { size_t i, n; if ((n = strlen(s)) % 2 == 1) { ShowUsage(EX_DATAERR, stderr); } for (i = 0; i < n; ++i) { if (!isxdigit(s[i + 0])) { ShowUsage(EX_DATAERR, stderr); } } } void ShowField(const char *name, uint64_t value) { if (value) { printf("/\t%-20s = %#lx\n", name, value); } } void ShowField2(const char *name, uint64_t value, bool cond) { if (value || cond) { printf("/\t%-20s = %#lx\n", name, value); } } void ShowOffset(const char *name, uint64_t off) { printf("/\t%-20s = %#lx\n", name, off); } int main(int argc, char *argv[]) { int err; size_t i, j, k; uint8_t buf[XED_MAX_INSTRUCTION_BYTES]; GetOpts(argc, argv); for (k = 0, i = optind; i < argc; ++i) { CheckHex(argv[i]); for (j = 0; argv[i][j]; j += 2) { if (++k > XED_MAX_INSTRUCTION_BYTES) ShowUsage(EX_DATAERR, stderr); buf[k - 1] = hextoint(argv[i][j + 0]) << 4 | hextoint(argv[i][j + 1]); } } xed_decoded_inst_zero_set_mode(&g_xedd, g_mode); if ((err = xed_instruction_length_decode(&g_xedd, buf, k)) != XED_ERROR_NONE) { fputs("XED_ERROR_", stderr); fputs(findnamebyid(kXedErrorIdNames, err), stderr); fputc('\n', stderr); exit(EXIT_FAILURE); } #define SHOWOP(F) ShowField(#F, g_xedd.op.F) #define SHOWOP2(F, C) ShowField2(#F, g_xedd.op.F, C) printf("/\t%-20s = %d\n", "length", g_xedd.length); SHOWOP(error); SHOWOP(lock); SHOWOP(osz); SHOWOP(asz); SHOWOP(rep); SHOWOP(rex); SHOWOP(rexb); SHOWOP(rexr); SHOWOP(rexrr); SHOWOP(rexw); SHOWOP(rexx); SHOWOP(map); SHOWOP(opcode); if (g_xedd.op.has_modrm) { printf("\n"); printf("/\t%-20s = 0b%02hhb (%d)\n", "mod", g_xedd.op.mod, g_xedd.op.mod); printf("/\t%-20s = 0b%03hhb (%d)\n", "reg", g_xedd.op.reg, g_xedd.op.reg); printf("/\t%-20s = 0b%03hhb (%d)\n", "rm", g_xedd.op.rm, g_xedd.op.rm); printf("\n"); } if (g_xedd.op.has_sib) { printf("/\t%-20s = 0b%02hhb (%d)\n", "scale", xed_sib_scale(g_xedd.op.sib), xed_sib_scale(g_xedd.op.sib)); printf("/\t%-20s = 0b%03hhb (%d)\n", "index", xed_sib_index(g_xedd.op.sib), xed_sib_index(g_xedd.op.sib)); printf("/\t%-20s = 0b%03hhb (%d)\n", "base", xed_sib_base(g_xedd.op.sib), xed_sib_base(g_xedd.op.sib)); printf("\n"); } SHOWOP2(disp, !!g_xedd.op.pos_disp); SHOWOP2(uimm0, !!g_xedd.op.pos_imm); SHOWOP2(uimm1, !!g_xedd.op.pos_imm1); SHOWOP(mode); SHOWOP(amd3dnow); SHOWOP(bcrc); SHOWOP(disp_width); SHOWOP(hint); SHOWOP(ild_f2); SHOWOP(ild_f3); SHOWOP(imm1_bytes); SHOWOP(imm_width); SHOWOP(imm_signed); SHOWOP(llrc); SHOWOP(mask); SHOWOP(max_bytes); SHOWOP(mode_first_prefix); SHOWOP(nprefixes); SHOWOP(nrexes); SHOWOP(nseg_prefixes); SHOWOP(out_of_bytes); SHOWOP(pos_disp); SHOWOP(pos_imm); SHOWOP(pos_imm1); SHOWOP(pos_modrm); SHOWOP(pos_opcode); SHOWOP(pos_sib); SHOWOP(realmode); SHOWOP(seg_ovd); SHOWOP(srm); SHOWOP(ubit); SHOWOP(vex_prefix); SHOWOP(vexdest210); SHOWOP(vexdest3); SHOWOP(vexdest4); SHOWOP(vexvalid); SHOWOP(vl); SHOWOP(zeroing); return 0; }
6,911
225
jart/cosmopolitan
false
cosmopolitan/tool/decode/dumpvdso.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2022 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/calls/calls.h" #include "libc/elf/struct/ehdr.h" #include "libc/runtime/runtime.h" #include "libc/sysv/consts/auxv.h" noasan int main(int argc, char *argv[]) { int i = 0; Elf64_Ehdr *ehdr; ehdr = (Elf64_Ehdr *)getauxval(AT_SYSINFO_EHDR); if (isatty(1)) exit(1); for (;;) { write(1, ((char *)ehdr) + i++, 1); } return 0; }
2,192
34
jart/cosmopolitan
false
cosmopolitan/tool/decode/scrubdox.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2021 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚──────────────────────────────────────────────────────────────────────────────┘ THIS PROGRAM TURNS TEXT LIKE THIS +------------------------------------------------------------------------+ | Button | Name | Go to | From 1.2.3 | | | | | go to | |------------+-------------+--------------------------------+------------| | [ < ] | Back | previous section in reading | 1.2.2 | | | | order | | |------------+-------------+--------------------------------+------------| | [ > ] | Forward | next section in reading order | 1.2.4 | |------------+-------------+--------------------------------+------------| | [ << ] | FastBack | previous or up-and-previous | 1.1 | | | | section | | |------------+-------------+--------------------------------+------------| | [ Up ] | Up | up section | 1.2 | |------------+-------------+--------------------------------+------------| | [ >> ] | FastForward | next or up-and-next section | 1.3 | |------------+-------------+--------------------------------+------------| | [Top] | Top | cover (top) of document | | |------------+-------------+--------------------------------+------------| | [Contents] | Contents | table of contents | | |------------+-------------+--------------------------------+------------| | [Index] | Index | concept index | | |------------+-------------+--------------------------------+------------| | [ ? ] | About | this page | | +------------------------------------------------------------------------+ INTO THIS ┌────────────┬─────────────┬────────────────────────────────┬────────────┐ │ Button │ Name │ Go to │ From 1.2.3 │ │ │ │ │ go to │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ < ] │ Back │ previous section in reading │ 1.2.2 │ │ │ │ order │ │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ > ] │ Forward │ next section in reading order │ 1.2.4 │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ << ] │ FastBack │ previous or up─and─previous │ 1.1 │ │ │ │ section │ │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ Up ] │ Up │ up section │ 1.2 │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ >> ] │ FastForward │ next or up─and─next section │ 1.3 │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [Top] │ Top │ cover (top) of document │ │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [Contents] │ Contents │ table of contents │ │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [Index] │ Index │ concept index │ │ ├────────────┼─────────────┼────────────────────────────────┼────────────┤ │ [ ? ] │ About │ this page │ │ └────────────┴─────────────┴────────────────────────────────┴────────────┘ */ #include "libc/log/log.h" #include "libc/macros.internal.h" #include "libc/mem/gc.h" #include "libc/mem/mem.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "libc/str/strwidth.h" #include "libc/x/x.h" #include "libc/x/xasprintf.h" #include "libc/x/xgetline.h" #define IsSpace(C) ((C) == ' ') #define IsPipe(C) ((C) == '|' || (C) == u'│') #define IsPlus(C) ((C) == '+' || (C) == u'┼') #define IsHyphen(C) ((C) == '-' || (C) == u'─') #define IsTick(C) ((C) == '`' || (C) == u'└') #define IsPipe(C) ((C) == '|' || (C) == u'│') #define IsEquals(C) ((C) == '=' || (C) == u'═') int n; int yn; int xn; FILE *f; bool *V; char **T; char16_t **L; static void DoIt(int y, int x) { if (V[y * (xn + 1) + x]) return; V[y * (xn + 1) + x] = 1; if (IsPipe(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsPlus(L[y][x]) && IsHyphen(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'┼'; } else if (IsPipe(L[y - 1][x]) && IsEquals(L[y][x - 1]) && IsPlus(L[y][x]) && IsEquals(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'╪'; } else if (IsSpace(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsHyphen(L[y][x]) && IsHyphen(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'┬'; } else if (IsPipe(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsHyphen(L[y][x]) && IsHyphen(L[y][x + 1]) && IsSpace(L[y + 1][x])) { L[y][x] = u'┴'; } else if (IsPipe(L[y - 1][x]) && IsSpace(L[y][x - 1]) && IsPipe(L[y][x]) && IsHyphen(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'├'; } else if (IsPipe(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsPipe(L[y][x]) && IsSpace(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'┤'; } else if (IsSpace(L[y - 1][x]) && IsSpace(L[y][x - 1]) && IsPlus(L[y][x]) && IsHyphen(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'┌'; } else if (IsPipe(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsPlus(L[y][x]) && IsSpace(L[y][x + 1]) && IsSpace(L[y + 1][x])) { L[y][x] = u'┘'; } else if (IsSpace(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsPlus(L[y][x]) && IsSpace(L[y][x + 1]) && IsPipe(L[y + 1][x])) { L[y][x] = u'┐'; } else if (IsPipe(L[y - 1][x]) && IsSpace(L[y][x - 1]) && IsPlus(L[y][x]) && IsHyphen(L[y][x + 1]) && IsSpace(L[y + 1][x])) { L[y][x] = u'└'; } else if (IsTick(L[y][x]) && IsPipe(L[y - 1][x]) && IsHyphen(L[y][x + 1]) && IsSpace(L[y + 1][x]) && IsSpace(L[y][x - 1])) { L[y][x] = u'└'; } else if (IsHyphen(L[y][x])) { L[y][x] = u'─'; } else if (IsPipe(L[y][x])) { L[y][x] = u'│'; } else if (IsEquals(L[y][x])) { L[y][x] = u'═'; } else { return; } DoIt(y - 1, x + 0); DoIt(y + 1, x + 0); DoIt(y + 0, x - 1); DoIt(y + 0, x + 1); } int main(int argc, char *argv[]) { char *s; int y, x; ShowCrashReports(); f = stdin; while ((s = _chomp(xgetline(f)))) { n = strwidth(s, 0); xn = MAX(xn, n); T = xrealloc(T, ++yn * sizeof(*T)); T[yn - 1] = s; } xn += 1000; L = xmalloc((yn + 2) * sizeof(*L)); L[0] = utf8to16(_gc(xasprintf(" %*s ", xn, " ")), -1, 0); for (y = 0; y < yn; ++y) { s = xasprintf(" %s%*s ", T[y], xn - n, " "); L[y + 1] = utf8to16(s, -1, 0); free(T[y]); free(s); } L[yn + 2 - 1] = utf8to16(_gc(xasprintf(" %*s ", xn, " ")), -1, 0); free(T); V = xcalloc((yn + 1) * (xn + 1), 1); for (y = 1; y <= yn; ++y) { for (x = 1; x <= xn; ++x) { if (IsPipe(L[y - 1][x]) && IsHyphen(L[y][x - 1]) && IsPlus(L[y][x]) && IsHyphen(L[y][x + 1]) && IsPipe(L[y + 1][x])) { DoIt(y, x); } if (IsTick(L[y][x]) && IsPipe(L[y - 1][x]) && IsHyphen(L[y][x + 1]) && IsSpace(L[y + 1][x]) && IsSpace(L[y][x - 1])) { DoIt(y, x); } } } for (y = 1; y + 1 < yn; ++y) { s = utf16to8(L[y], -1, 0); n = strlen(s); while (n && s[n - 1] == ' ') s[n - 1] = 0, --n; puts(s + 1); free(s); } for (y = 0; y < yn; ++y) { free(L[y]); } free(L); free(V); return 0; }
11,542
203
jart/cosmopolitan
false
cosmopolitan/tool/decode/zip.c
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│ │vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│ ╞══════════════════════════════════════════════════════════════════════════════╡ │ Copyright 2020 Justine Alexandra Roberts Tunney │ │ │ │ Permission to use, copy, modify, and/or distribute this software for │ │ any purpose with or without fee is hereby granted, provided that the │ │ above copyright notice and this permission notice appear in all copies. │ │ │ │ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │ │ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │ │ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │ │ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, 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 THIS SOFTWARE. │ ╚─────────────────────────────────────────────────────────────────────────────*/ #include "libc/zip.h" #include "libc/calls/calls.h" #include "libc/calls/struct/stat.h" #include "libc/fmt/conv.h" #include "libc/intrin/bits.h" #include "libc/intrin/safemacros.internal.h" #include "libc/log/check.h" #include "libc/log/log.h" #include "libc/mem/gc.h" #include "libc/mem/mem.h" #include "libc/nexgen32e/crc32.h" #include "libc/nt/struct/filetime.h" #include "libc/stdio/stdio.h" #include "libc/str/str.h" #include "libc/sysv/consts/map.h" #include "libc/sysv/consts/o.h" #include "libc/sysv/consts/prot.h" #include "libc/x/xasprintf.h" #include "libc/x/xiso8601.h" #include "tool/decode/lib/asmcodegen.h" #include "tool/decode/lib/disassemblehex.h" #include "tool/decode/lib/flagger.h" #include "tool/decode/lib/idname.h" #include "tool/decode/lib/ntfileflagnames.h" #include "tool/decode/lib/titlegen.h" #include "tool/decode/lib/zipnames.h" /** * @fileoverview Zip File Disassembler. */ dontdiscard char *FormatDosDate(uint16_t dosdate) { return xasprintf("%04u-%02u-%02u", ((dosdate >> 9) & 0b1111111) + 1980, (dosdate >> 5) & 0b1111, dosdate & 0b11111); } dontdiscard char *FormatDosTime(uint16_t dostime) { return xasprintf("%02u:%02u:%02u", (dostime >> 11) & 0b11111, (dostime >> 5) & 0b111111, (dostime << 1) & 0b111110); } void AdvancePosition(uint8_t *map, size_t *pos, size_t off) { if (off > *pos) { printf("\n/\t<%s>\n", "LIMBO"); disassemblehex(&map[*pos], off - *pos, stdout); printf("/\t</%s>\n", "LIMBO"); } *pos = off; } void ShowGeneralFlag(uint16_t generalflag) { puts("\ / ┌─utf8\n\ / │ ┌─strong encryption\n\ / │ │┌─compressed patch data\n\ / │ ││ ┌─crc and size go after file content\n\ / │ ││ │┌─{normal,max,fast,superfast}\n\ / │ ││ ││ ┌─encrypted\n\ / rrrr│uuuu││r│├┐│"); show(".short", format(b1, "0b%016b", generalflag), "generalflag"); } void ShowTimestamp(uint16_t time, uint16_t date) { show(".short", format(b1, "%#04hx", time), _gc(xasprintf("%s (%s)", "lastmodifiedtime", _gc(FormatDosTime(time))))); show(".short", format(b1, "%#04hx", date), _gc(xasprintf("%s (%s)", "lastmodifieddate", _gc(FormatDosDate(date))))); } void ShowCompressionMethod(uint16_t compressmethod) { show(".short", firstnonnull(findnamebyid(kZipCompressionNames, compressmethod), format(b1, "%hu", compressmethod)), "compressionmethod"); } void ShowNtfs(uint8_t *ntfs, size_t n) { struct timespec mtime, atime, ctime; mtime = WindowsTimeToTimeSpec(READ64LE(ntfs + 8)); atime = WindowsTimeToTimeSpec(READ64LE(ntfs + 16)); ctime = WindowsTimeToTimeSpec(READ64LE(ntfs + 24)); show(".long", _gc(xasprintf("%d", READ32LE(ntfs))), "ntfs reserved"); show(".short", _gc(xasprintf("0x%04x", READ16LE(ntfs + 4))), "ntfs attribute tag value #1"); show(".short", _gc(xasprintf("%hu", READ16LE(ntfs + 6))), "ntfs attribute tag size"); show(".quad", _gc(xasprintf("%lu", READ64LE(ntfs + 8))), _gc(xasprintf("%s (%s)", "ntfs last modified time", _gc(xiso8601(&mtime))))); show(".quad", _gc(xasprintf("%lu", READ64LE(ntfs + 16))), _gc(xasprintf("%s (%s)", "ntfs last access time", _gc(xiso8601(&atime))))); show(".quad", _gc(xasprintf("%lu", READ64LE(ntfs + 24))), _gc(xasprintf("%s (%s)", "ntfs creation time", _gc(xiso8601(&ctime))))); } void ShowExtendedTimestamp(uint8_t *p, size_t n, bool islocal) { int flag; if (n) { --n; flag = *p++; show(".byte", _gc(xasprintf("0b%03hhb", flag)), "fields present in local"); if ((flag & 1) && n >= 4) { show(".long", _gc(xasprintf("%u", READ32LE(p))), _gc(xasprintf("%s (%s)", "last modified", _gc(xiso8601(&(struct timespec){READ32LE(p)}))))); p += 4; n -= 4; } flag >>= 1; if (islocal) { if ((flag & 1) && n >= 4) { show(".long", _gc(xasprintf("%u", READ32LE(p))), _gc(xasprintf("%s (%s)", "access time", _gc(xiso8601(&(struct timespec){READ32LE(p)}))))); p += 4; n -= 4; } flag >>= 1; if ((flag & 1) && n >= 4) { show(".long", _gc(xasprintf("%u", READ32LE(p))), _gc(xasprintf("%s (%s)", "creation time", _gc(xiso8601(&(struct timespec){READ32LE(p)}))))); p += 4; n -= 4; } } } } void ShowZip64(uint8_t *p, size_t n, bool islocal) { if (n >= 8) { show(".quad", _gc(xasprintf("%lu", READ64LE(p))), _gc(xasprintf("uncompressed size (%,ld)", READ64LE(p)))); } if (n >= 16) { show(".quad", _gc(xasprintf("%lu", READ64LE(p + 8))), _gc(xasprintf("compressed size (%,ld)", READ64LE(p + 8)))); } if (n >= 24) { show(".quad", _gc(xasprintf("%lu", READ64LE(p + 16))), _gc(xasprintf("lfile hdr offset (%,ld)", READ64LE(p + 16)))); } if (n >= 28) { show(".long", _gc(xasprintf("%u", READ32LE(p + 24))), "disk number"); } } void ShowInfoZipNewUnixExtra(uint8_t *p, size_t n, bool islocal) { if (p[0] == 1 && p[1] == 4 && p[6] == 4) { show(".byte", "1", "version"); show(".byte", "4", "uid length"); show(".long", _gc(xasprintf("%u", READ32LE(p + 2))), "uid"); show(".byte", "4", "gid length"); show(".long", _gc(xasprintf("%u", READ32LE(p + 7))), "gid"); } else { disassemblehex(p, n, stdout); } } void ShowExtra(uint8_t *extra, bool islocal) { switch (ZIP_EXTRA_HEADERID(extra)) { case kZipExtraNtfs: ShowNtfs(ZIP_EXTRA_CONTENT(extra), ZIP_EXTRA_CONTENTSIZE(extra)); break; case kZipExtraExtendedTimestamp: ShowExtendedTimestamp(ZIP_EXTRA_CONTENT(extra), ZIP_EXTRA_CONTENTSIZE(extra), islocal); break; case kZipExtraZip64: ShowZip64(ZIP_EXTRA_CONTENT(extra), ZIP_EXTRA_CONTENTSIZE(extra), islocal); break; case kZipExtraInfoZipNewUnixExtra: ShowInfoZipNewUnixExtra(ZIP_EXTRA_CONTENT(extra), ZIP_EXTRA_CONTENTSIZE(extra), islocal); break; default: disassemblehex(ZIP_EXTRA_CONTENT(extra), ZIP_EXTRA_CONTENTSIZE(extra), stdout); break; } } void ShowExternalAttributes(uint8_t *cf) { uint32_t ea; ea = ZIP_CFILE_EXTERNALATTRIBUTES(cf); if (ZIP_CFILE_FILEATTRCOMPAT(cf) == kZipOsUnix) { show(".short", RecreateFlags(kNtFileFlagNames, ea & 0xffff), "dos file flags"); show(".short", format(b1, "%#o", ea >> 16), "st_mode"); } else { show(".long", RecreateFlags(kNtFileFlagNames, ea), "externalattributes"); } } void ShowExtras(uint8_t *extras, uint16_t extrassize, bool islocal) { int i; bool first; uint8_t *p, *pe; if (extrassize) { first = true; for (p = extras, pe = extras + extrassize, i = 0; p < pe; p += ZIP_EXTRA_SIZE(p), ++i) { show(".short", firstnonnull(findnamebyid(kZipExtraNames, ZIP_EXTRA_HEADERID(p)), _gc(xasprintf("0x%04hx", ZIP_EXTRA_HEADERID(p)))), _gc(xasprintf("%s[%d].%s", "extras", i, "headerid"))); show(".short", _gc(xasprintf("%df-%df", (i + 2) * 10, (i + 1) * 10)), _gc(xasprintf("%s[%d].%s (%hd %s)", "extras", i, "contentsize", ZIP_EXTRA_CONTENTSIZE(p), "bytes"))); if (first) { first = false; printf("%d:", (i + 1) * 10); } ShowExtra(p, islocal); printf("%d:", (i + 2) * 10); } } putchar('\n'); } void ShowLocalFileHeader(uint8_t *lf, uint16_t idx) { printf("\n/\t%s #%hu (%zu %s)\n", "local file", idx + 1, ZIP_LFILE_HDRSIZE(lf), "bytes"); show(".ascii", format(b1, "%`'.*s", 4, lf), "magic"); show(".byte", firstnonnull(findnamebyid(kZipEraNames, ZIP_LFILE_VERSIONNEED(lf)), _gc(xasprintf("%d", ZIP_LFILE_VERSIONNEED(lf)))), "pkzip version need"); show(".byte", firstnonnull(findnamebyid(kZipOsNames, ZIP_LFILE_OSNEED(lf)), _gc(xasprintf("%d", ZIP_LFILE_OSNEED(lf)))), "os need"); ShowGeneralFlag(ZIP_LFILE_GENERALFLAG(lf)); ShowCompressionMethod(ZIP_LFILE_COMPRESSIONMETHOD(lf)); ShowTimestamp(ZIP_LFILE_LASTMODIFIEDTIME(lf), ZIP_LFILE_LASTMODIFIEDDATE(lf)); show( ".long", format(b1, "%#x", ZIP_LFILE_CRC32(lf)), _gc(xasprintf("%s (%#x)", "crc32z", GetZipLfileCompressedSize(lf) /* crc32_z(0, ZIP_LFILE_CONTENT(lf), GetZipLfileCompressedSize(lf)) */))); if (ZIP_LFILE_COMPRESSEDSIZE(lf) == 0xFFFFFFFF) { show(".long", "0xFFFFFFFF", "compressedsize (zip64)"); } else { show(".long", "3f-2f", format(b1, "%s (%u %s)", "compressedsize", ZIP_LFILE_COMPRESSEDSIZE(lf), "bytes")); } show(".long", ZIP_LFILE_UNCOMPRESSEDSIZE(lf) == 0xFFFFFFFF ? "0xFFFFFFFF" : format(b1, "%u", ZIP_LFILE_UNCOMPRESSEDSIZE(lf)), "uncompressedsize"); show(".short", "1f-0f", format(b1, "%s (%hu %s)", "namesize", ZIP_LFILE_NAMESIZE(lf), "bytes")); show( ".short", "2f-1f", format(b1, "%s (%hu %s)", "extrasize", ZIP_LFILE_EXTRASIZE(lf), "bytes")); printf("0:"); show(".ascii", format(b1, "%`'s", _gc(strndup(ZIP_LFILE_NAME(lf), ZIP_LFILE_NAMESIZE(lf)))), "name"); printf("1:"); ShowExtras(ZIP_LFILE_EXTRA(lf), ZIP_LFILE_EXTRASIZE(lf), true); printf("2:"); /* disassemblehex(ZIP_LFILE_CONTENT(lf), ZIP_LFILE_COMPRESSEDSIZE(lf), * stdout); */ printf("3:\n"); } void ShowCentralFileHeader(uint8_t *cf) { printf("\n/\t%s (%zu %s)\n", "central directory file header", ZIP_CFILE_HDRSIZE(cf), "bytes"); show(".ascii", format(b1, "%`'.*s", 4, cf), "magic"); show(".byte", _gc(xasprintf("%d", ZIP_CFILE_VERSIONMADE(cf))), "zip version made"); show(".byte", firstnonnull(findnamebyid(kZipOsNames, ZIP_CFILE_FILEATTRCOMPAT(cf)), _gc(xasprintf("%d", ZIP_CFILE_FILEATTRCOMPAT(cf)))), "file attr compat"); show(".byte", firstnonnull(findnamebyid(kZipEraNames, ZIP_CFILE_VERSIONNEED(cf)), _gc(xasprintf("%d", ZIP_CFILE_VERSIONNEED(cf)))), "pkzip version need"); show(".byte", firstnonnull(findnamebyid(kZipOsNames, ZIP_CFILE_OSNEED(cf)), _gc(xasprintf("%d", ZIP_CFILE_OSNEED(cf)))), "os need"); ShowGeneralFlag(ZIP_CFILE_GENERALFLAG(cf)); ShowCompressionMethod(ZIP_CFILE_COMPRESSIONMETHOD(cf)); ShowTimestamp(ZIP_CFILE_LASTMODIFIEDTIME(cf), ZIP_CFILE_LASTMODIFIEDDATE(cf)); show(".long", format(b1, "%#x", ZIP_CFILE_CRC32(cf)), "crc32z"); if (ZIP_CFILE_COMPRESSEDSIZE(cf) == 0xFFFFFFFF) { show(".long", "0xFFFFFFFF", "compressedsize (zip64)"); } else { show(".long", format(b1, "%u", ZIP_CFILE_COMPRESSEDSIZE(cf)), "compressedsize"); } if (ZIP_CFILE_UNCOMPRESSEDSIZE(cf) == 0xFFFFFFFF) { show(".long", "0xFFFFFFFF", "compressedsize (zip64)"); } else { show(".long", format(b1, "%u", ZIP_CFILE_UNCOMPRESSEDSIZE(cf)), "uncompressedsize"); } show(".short", "1f-0f", format(b1, "%s (%hu %s)", "namesize", ZIP_CFILE_NAMESIZE(cf), "bytes")); show( ".short", "2f-1f", format(b1, "%s (%hu %s)", "extrasize", ZIP_CFILE_EXTRASIZE(cf), "bytes")); show(".short", "3f-2f", format(b1, "%s (%hu %s)", "commentsize", ZIP_CFILE_COMMENTSIZE(cf), "bytes")); show(".short", format(b1, "%hu", ZIP_CFILE_DISK(cf)), "disk"); show(".short", RecreateFlags(kZipIattrNames, ZIP_CFILE_INTERNALATTRIBUTES(cf) & 1), "internalattributes"); ShowExternalAttributes(cf); if (ZIP_CFILE_OFFSET(cf) == 0xFFFFFFFF) { show(".long", "0xFFFFFFFF", "lfile hdr offset (zip64)"); } else { show(".long", format(b1, "%u", ZIP_CFILE_OFFSET(cf)), "lfile hdr offset"); } printf("0:"); show(".ascii", format(b1, "%`'s", _gc(strndup(ZIP_CFILE_NAME(cf), ZIP_CFILE_NAMESIZE(cf)))), "name"); printf("1:"); ShowExtras(ZIP_CFILE_EXTRA(cf), ZIP_CFILE_EXTRASIZE(cf), false); printf("2:"); show(".ascii", format(b1, "%`'.*s", ZIP_CFILE_COMMENTSIZE(cf), ZIP_CFILE_COMMENT(cf)), "comment"); printf("3:\n"); } void ShowCentralDirHeader32(uint8_t *cd) { printf("\n/\t%s (%zu %s)\n", "end of central directory header", ZIP_CDIR_HDRSIZE(cd), "bytes"); show(".ascii", format(b1, "%`'.*s", 4, cd), "magic"); show(".short", format(b1, "%hd", ZIP_CDIR_DISK(cd)), "disk"); show(".short", format(b1, "%hd", ZIP_CDIR_STARTINGDISK(cd)), "startingdisk"); show(".short", format(b1, "%hu", ZIP_CDIR_RECORDSONDISK(cd)), "recordsondisk"); show(".short", format(b1, "%hu", ZIP_CDIR_RECORDS(cd)), "records"); show(".long", format(b1, "%u", ZIP_CDIR_SIZE(cd)), "size"); show(".long", format(b1, "%u", ZIP_CDIR_OFFSET(cd)), "cfile hdrs offset"); show(".short", "1f-0f", format(b1, "%s (%hu %s)", "commentsize", ZIP_CDIR_COMMENTSIZE(cd), "bytes")); printf("0:"); disassemblehex(ZIP_CDIR_COMMENT(cd), ZIP_CDIR_COMMENTSIZE(cd), stdout); printf("1:\n"); } void ShowCentralDirHeader64(uint8_t *cd) { printf("\n/\t%s (%zu %s)\n", "zip64 end of central directory header", ZIP_CDIR64_HDRSIZE(cd), "bytes"); show(".ascii", format(b1, "%`'.*s", 4, cd), "magic"); show(".quad", format(b1, "%lu", ZIP_CDIR64_HDRSIZE(cd) - 12), "hdr size"); show(".short", format(b1, "%hd", ZIP_CDIR64_VERSIONMADE(cd)), "version made"); show(".short", format(b1, "%hd", ZIP_CDIR64_VERSIONNEED(cd)), "version need"); show(".long", format(b1, "%d", ZIP_CDIR64_DISK(cd)), "disk"); show(".long", format(b1, "%d", ZIP_CDIR64_STARTINGDISK(cd)), "startingdisk"); show(".quad", format(b1, "%lu", ZIP_CDIR64_RECORDSONDISK(cd)), "recordsondisk"); show(".quad", format(b1, "%lu", ZIP_CDIR64_RECORDS(cd)), "records"); show(".quad", format(b1, "%lu", ZIP_CDIR64_SIZE(cd)), "cdir size"); show(".quad", format(b1, "%lu", ZIP_CDIR64_OFFSET(cd)), "cdir offset"); printf("0:"); disassemblehex(ZIP_CDIR64_COMMENT(cd), ZIP_CDIR64_COMMENTSIZE(cd), stdout); printf("1:\n"); cd += ZIP_CDIR64_HDRSIZE(cd); printf("\n/\t%s (%zu %s)\n", "zip64 end of central directory locator", kZipCdir64LocatorSize, "bytes"); show(".ascii", format(b1, "%`'.*s", 4, cd), "magic"); show(".long", format(b1, "%d", READ32LE(cd + 4)), "startingdisk"); show(".quad", format(b1, "%lu", READ64LE(cd + 4 + 4)), "eocd64 offset"); show(".long", format(b1, "%d", READ32LE(cd + 4 + 4 + 8)), "totaldisks"); } uint8_t *GetZipCdir32(const uint8_t *p, size_t n) { size_t i; if (n >= kZipCdirHdrMinSize) { i = n - kZipCdirHdrMinSize; do { if (READ32LE(p + i) == kZipCdirHdrMagic && IsZipCdir32(p, n, i)) { return (/*unconst*/ uint8_t *)(p + i); } } while (i--); } return NULL; } uint8_t *GetZipCdir64(const uint8_t *p, size_t n) { uint64_t i, j; if (n >= kZipCdir64LocatorSize) { i = n - kZipCdir64LocatorSize; do { if (READ32LE(p + i) == kZipCdir64LocatorMagic && (j = ZIP_LOCATE64_OFFSET(p + i)) + kZipCdir64HdrMinSize <= n) { return p + j; } } while (i--); } return NULL; } void DisassembleZip(const char *path, uint8_t *p, size_t n) { size_t pos; uint16_t i; static int records; uint8_t *eocd32, *eocd64, *cdir, *cf, *lf, *q; if (_endswith(path, ".com.dbg") && (q = memmem(p, n, "MZqFpD", 6))) { n -= q - p; p += q - p; } eocd32 = GetZipCdir32(p, n); eocd64 = GetZipCdir64(p, n); CHECK(eocd32 || eocd64); pos = 0; if (eocd64) { records = ZIP_CDIR64_RECORDS(eocd64); cdir = p + ZIP_CDIR64_OFFSET(eocd64); } else { records = ZIP_CDIR_RECORDS(eocd32); cdir = p + ZIP_CDIR_OFFSET(eocd32); } for (i = 0, cf = cdir; i < records; ++i, cf += ZIP_CFILE_HDRSIZE(cf)) { lf = p + GetZipCfileOffset(cf); CHECK_EQ(kZipLfileHdrMagic, ZIP_LFILE_MAGIC(lf)); AdvancePosition(p, &pos, lf - p); ShowLocalFileHeader(lf, i); pos = (lf - p) + ZIP_LFILE_SIZE(lf); } for (i = 0, cf = cdir; i < records; ++i, cf += ZIP_CFILE_HDRSIZE(cf)) { CHECK_EQ(kZipCfileHdrMagic, ZIP_CFILE_MAGIC(cf)); AdvancePosition(p, &pos, cf - p); ShowCentralFileHeader(cf); pos = (cf - p) + ZIP_CFILE_HDRSIZE(cf); } /* TODO(jart): This is absurd. */ if (eocd32 && eocd64) { if (eocd32 < eocd64) { ShowCentralDirHeader32(eocd32); AdvancePosition(p, &pos, eocd32 - p); ShowCentralDirHeader64(eocd64); AdvancePosition(p, &pos, eocd64 - p); } else { /* pos = eocd64 - p + ZIP_CDIR_HDRSIZE(eocd64); */ /* AdvancePosition(p, &pos, n); */ ShowCentralDirHeader64(eocd64); AdvancePosition(p, &pos, eocd64 - p); /* pos = eocd32 - p + ZIP_CDIR_HDRSIZE(eocd32); */ /* AdvancePosition(p, &pos, n); */ ShowCentralDirHeader32(eocd32); AdvancePosition(p, &pos, eocd32 - p); } } else if (eocd32) { ShowCentralDirHeader32(eocd32); AdvancePosition(p, &pos, eocd32 - p); } else { ShowCentralDirHeader64(eocd64); AdvancePosition(p, &pos, eocd64 - p); } pos = n; AdvancePosition(p, &pos, n); } int main(int argc, char *argv[]) { int fd; uint8_t *map; struct stat st; ShowCrashReports(); CHECK_EQ(2, argc); CHECK_NE(-1, (fd = open(argv[1], O_RDONLY))); CHECK_NE(-1, fstat(fd, &st)); CHECK_GE(st.st_size, kZipCdirHdrMinSize); CHECK_NE(MAP_FAILED, (map = mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0))); showtitle("αcτµαlly pδrταblε εxεcµταblε", "tool/decode/zip", basename(argv[1]), NULL, &kModelineAsm); DisassembleZip(argv[1], map, st.st_size); CHECK_NE(-1, munmap(map, st.st_size)); CHECK_NE(-1, close(fd)); return 0; }
19,748
506
jart/cosmopolitan
false