1b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* 2b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru****************************************************************************** 3b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* 450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho* Copyright (C) 2001-2010, International Business Machines 5b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* Corporation and others. All Rights Reserved. 6b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* 7b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru****************************************************************************** 8b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* file name: utrie2.h 9b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* encoding: US-ASCII 10b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* tab size: 8 (not used) 11b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* indentation:4 12b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* 13b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* created on: 2008aug16 (starting from a copy of utrie.h) 14b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru* created by: Markus W. Scherer 15b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru*/ 16b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 17b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#ifndef __UTRIE2_H__ 18b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define __UTRIE2_H__ 19b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 20b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#include "unicode/utypes.h" 21b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#include "udataswp.h" 22b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 23b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CDECL_BEGIN 24b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 25b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querustruct UTrie; /* forward declaration */ 26b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#ifndef __UTRIE_H__ 27b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef struct UTrie UTrie; 28b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#endif 29b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 30b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 31b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * \file 32b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 33b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * This is a common implementation of a Unicode trie. 34b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * It is a kind of compressed, serializable table of 16- or 32-bit values associated with 35b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Unicode code points (0..0x10ffff). (A map from code points to integers.) 36b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 37b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * This is the second common version of a Unicode trie (hence the name UTrie2). 38b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Compared with UTrie version 1: 39b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - Still splitting BMP code points 11:5 bits for index and data table lookups. 40b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - Still separate data for lead surrogate code _units_ vs. code _points_, 41b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * but the lead surrogate code unit values are not required any more 42b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * for data lookup for supplementary code points. 43b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - The "folding" mechanism is removed. In UTrie version 1, this somewhat 44b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * hard-to-explain mechanism was meant to be used for optimized UTF-16 45b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * processing, with application-specific encoding of indexing bits 46b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * in the lead surrogate data for the associated supplementary code points. 47b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - For the last single-value code point range (ending with U+10ffff), 48b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the starting code point ("highStart") and the value are stored. 49b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - For supplementary code points U+10000..highStart-1 a three-table lookup 50b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * (two index tables and one data table) is used. The first index 51b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * is truncated, omitting both the BMP portion and the high range. 52b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - There is a special small index for 2-byte UTF-8, and the initial data 53b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * entries are designed for fast 1/2-byte UTF-8 lookup. 54b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 55b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 56b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 57b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Trie structure. 58b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Use only with public API macros and functions. 59b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 60b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querustruct UTrie2; 61b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef struct UTrie2 UTrie2; 62b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 63b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Public UTrie2 API functions: read-only access ---------------------------- */ 64b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 65b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 66b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Selectors for the width of a UTrie2 data value. 67b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 68b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruenum UTrie2ValueBits { 69b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 16 bits per UTrie2 data value. */ 70b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_16_VALUE_BITS, 71b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 32 bits per UTrie2 data value. */ 72b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_32_VALUE_BITS, 73b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Number of selectors for the width of UTrie2 data values. */ 74b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_COUNT_VALUE_BITS 75b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru}; 76b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef enum UTrie2ValueBits UTrie2ValueBits; 77b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 78b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 79b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory. 80b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Inverse of utrie2_serialize(). 81b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The memory must remain valid and unchanged as long as the trie is used. 82b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * You must utrie2_close() the trie once you are done using it. 83b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 84b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param valueBits selects the data entry size; results in an 85b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * U_INVALID_FORMAT_ERROR if it does not match the serialized form 86b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param data a pointer to 32-bit-aligned memory containing the serialized form of a UTrie2 87b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param length the number of bytes available at data; 88b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * can be more than necessary 89b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pActualLength receives the actual number of bytes at data taken up by the trie data; 90b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * can be NULL 91b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 92b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the unserialized trie 93b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 94b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_open 95b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_serialize 96b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 97b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 98b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_openFromSerialized(UTrie2ValueBits valueBits, 99b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const void *data, int32_t length, int32_t *pActualLength, 100b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 101b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 102b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 103b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Open a frozen, empty "dummy" trie. 104b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * A dummy trie is an empty trie, used when a real data trie cannot 105b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * be loaded. Equivalent to calling utrie2_open() and utrie2_freeze(), 106b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * but without internally creating and compacting/serializing the 107b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * builder data structure. 108b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 109b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The trie always returns the initialValue, 110b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * or the errorValue for out-of-range code points and illegal UTF-8. 111b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 112b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * You must utrie2_close() the trie once you are done using it. 113b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 114b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param valueBits selects the data entry size 115b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param initialValue the initial value that is set for all code points 116b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param errorValue the value for out-of-range code points and illegal UTF-8 117b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 118b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the dummy trie 119b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 120b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_openFromSerialized 121b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_open 122b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 123b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 124b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_openDummy(UTrie2ValueBits valueBits, 125b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint32_t initialValue, uint32_t errorValue, 126b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 127b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 128b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 129b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Get a value from a code point as stored in the trie. 130b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Easier to use than UTRIE2_GET16() and UTRIE2_GET32() but slower. 131b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Easier to use because, unlike the macros, this function works on all UTrie2 132b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * objects, frozen or not, holding 16-bit or 32-bit data values. 133b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 134b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the trie 135b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c the code point 136b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the value 137b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 138b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI uint32_t U_EXPORT2 139b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_get32(const UTrie2 *trie, UChar32 c); 140b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 141b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* enumeration callback types */ 142b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 143b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 144b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Callback from utrie2_enum(), extracts a uint32_t value from a 145b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * trie value. This value will be passed on to the UTrie2EnumRange function. 146b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 147b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param context an opaque pointer, as passed into utrie2_enum() 148b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param value a value from the trie 149b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the value that is to be passed on to the UTrie2EnumRange function 150b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 151b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef uint32_t U_CALLCONV 152b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruUTrie2EnumValue(const void *context, uint32_t value); 153b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 154b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 155b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Callback from utrie2_enum(), is called for each contiguous range 156b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of code points with the same value as retrieved from the trie and 157b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * transformed by the UTrie2EnumValue function. 158b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 159b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The callback function can stop the enumeration by returning FALSE. 160b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 161b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param context an opaque pointer, as passed into utrie2_enum() 162b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start the first code point in a contiguous range with value 163b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param end the last code point in a contiguous range with value (inclusive) 164b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param value the value that is set for all code points in [start..end] 165b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return FALSE to stop the enumeration 166b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 167b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef UBool U_CALLCONV 168b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruUTrie2EnumRange(const void *context, UChar32 start, UChar32 end, uint32_t value); 169b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 170b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 171b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Enumerate efficiently all values in a trie. 172b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Do not modify the trie during the enumeration. 173b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 174b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * For each entry in the trie, the value to be delivered is passed through 175b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the UTrie2EnumValue function. 176b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The value is unchanged if that function pointer is NULL. 177b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 178b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * For each contiguous range of code points with a given (transformed) value, 179b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the UTrie2EnumRange function is called. 180b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 181b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie a pointer to the trie 182b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param enumValue a pointer to a function that may transform the trie entry value, 183b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * or NULL if the values from the trie are to be used directly 184b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param enumRange a pointer to a function that is called for each contiguous range 185b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of code points with the same (transformed) value 186b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param context an opaque pointer that is passed on to the callback functions 187b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 188b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 189b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_enum(const UTrie2 *trie, 190b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context); 191b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 192b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Building a trie ---------------------------------------------------------- */ 193b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 194b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 195b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Open an empty, writable trie. At build time, 32-bit data values are used. 196b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * utrie2_freeze() takes a valueBits parameter 197b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * which determines the data value width in the serialized and frozen forms. 198b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * You must utrie2_close() the trie once you are done using it. 199b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 200b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param initialValue the initial value that is set for all code points 201b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param errorValue the value for out-of-range code points and illegal UTF-8 202b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 203b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return a pointer to the allocated and initialized new trie 204b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 205b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 206b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_open(uint32_t initialValue, uint32_t errorValue, UErrorCode *pErrorCode); 207b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 208b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 209b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Clone a trie. 210b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * You must utrie2_close() the clone once you are done using it. 211b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 212b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param other the trie to clone 213b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 214b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return a pointer to the new trie clone 215b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 216b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 217b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_clone(const UTrie2 *other, UErrorCode *pErrorCode); 218b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 219b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 220b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Clone a trie. The clone will be mutable/writable even if the other trie 221b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * is frozen. (See utrie2_freeze().) 222b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * You must utrie2_close() the clone once you are done using it. 223b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 224b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param other the trie to clone 225b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 226b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return a pointer to the new trie clone 227b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 228b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 229b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_cloneAsThawed(const UTrie2 *other, UErrorCode *pErrorCode); 230b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 231b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 232b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Close a trie and release associated memory. 233b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 234b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the trie 235b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 236b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 237b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_close(UTrie2 *trie); 238b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 239b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 240b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Set a value for a code point. 241b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 242b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the unfrozen trie 243b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c the code point 244b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param value the value 245b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes: 246b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_NO_WRITE_PERMISSION if the trie is frozen 247b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 248b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 249b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode); 250b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 251b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 252b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Set a value in a range of code points [start..end]. 253b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * All code points c with start<=c<=end will get the value if 254b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * overwrite is TRUE or if the old value is the initial value. 255b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 256b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the unfrozen trie 257b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start the first code point to get the value 258b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param end the last code point to get the value (inclusive) 259b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param value the value 260b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param overwrite flag for whether old non-initial values are to be overwritten 261b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes: 262b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_NO_WRITE_PERMISSION if the trie is frozen 263b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 264b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 265b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_setRange32(UTrie2 *trie, 266b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UChar32 start, UChar32 end, 267b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint32_t value, UBool overwrite, 268b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 269b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 270b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 271b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Freeze a trie. Make it immutable (read-only) and compact it, 272b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * ready for serialization and for use with fast macros. 273b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Functions to set values will fail after serializing. 274b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 275b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * A trie can be frozen only once. If this function is called again with different 276b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * valueBits then it will set a U_ILLEGAL_ARGUMENT_ERROR. 277b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 278b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the trie 279b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param valueBits selects the data entry size; if smaller than 32 bits, then 280b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the values stored in the trie will be truncated 281b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes: 282b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_INDEX_OUTOFBOUNDS_ERROR if the compacted index or data arrays are too long 283b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * for serialization 284b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * (the trie will be immutable and usable, 285b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * but not frozen and not usable with the fast macros) 286b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 287b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_cloneAsThawed 288b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 289b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 290b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode); 291b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 292b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 293b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Test if the trie is frozen. (See utrie2_freeze().) 294b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 295b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the trie 296b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return TRUE if the trie is frozen, that is, immutable, ready for serialization 297b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * and for use with fast macros 298b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 299b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UBool U_EXPORT2 300b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_isFrozen(const UTrie2 *trie); 301b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 302b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 303b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Serialize a frozen trie into 32-bit aligned memory. 304b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * If the trie is not frozen, then the function returns with a U_ILLEGAL_ARGUMENT_ERROR. 305b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * A trie can be serialized multiple times. 306b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 307b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the frozen trie 308b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param data a pointer to 32-bit-aligned memory to be filled with the trie data, 309b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * can be NULL if capacity==0 310b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param capacity the number of bytes available at data, 311b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * or 0 for preflighting 312b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes: 313b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_BUFFER_OVERFLOW_ERROR if the data storage block is too small for serialization 314b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_ILLEGAL_ARGUMENT_ERROR if the trie is not frozen or the data and capacity 315b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * parameters are bad 316b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the number of bytes written or needed for the trie 317b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 318b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @see utrie2_openFromSerialized() 319b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 320b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI int32_t U_EXPORT2 321b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_serialize(UTrie2 *trie, 322b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru void *data, int32_t capacity, 323b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 324b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 325b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Public UTrie2 API: miscellaneous functions ------------------------------- */ 326b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 327b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 328b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Get the UTrie version from 32-bit-aligned memory containing the serialized form 329b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of either a UTrie (version 1) or a UTrie2 (version 2). 330b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 331b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param data a pointer to 32-bit-aligned memory containing the serialized form 332b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of a UTrie, version 1 or 2 333b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param length the number of bytes available at data; 334b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * can be more than necessary (see return value) 335b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param anyEndianOk If FALSE, only platform-endian serialized forms are recognized. 336b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * If TRUE, opposite-endian serialized forms are recognized as well. 337b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the UTrie version of the serialized form, or 0 if it is not 338b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * recognized as a serialized UTrie 339b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 340b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI int32_t U_EXPORT2 341b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_getVersion(const void *data, int32_t length, UBool anyEndianOk); 342b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 343b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 344b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Swap a serialized UTrie2. 345b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @internal 346b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 347b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI int32_t U_EXPORT2 348b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_swap(const UDataSwapper *ds, 349b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const void *inData, int32_t length, void *outData, 350b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 351b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 352b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 35327f654740f2a26ad62a5c155af9199af9e69b889claireho * Swap a serialized UTrie or UTrie2. 35427f654740f2a26ad62a5c155af9199af9e69b889claireho * @internal 35527f654740f2a26ad62a5c155af9199af9e69b889claireho */ 35627f654740f2a26ad62a5c155af9199af9e69b889clairehoU_CAPI int32_t U_EXPORT2 35727f654740f2a26ad62a5c155af9199af9e69b889clairehoutrie2_swapAnyVersion(const UDataSwapper *ds, 35827f654740f2a26ad62a5c155af9199af9e69b889claireho const void *inData, int32_t length, void *outData, 35927f654740f2a26ad62a5c155af9199af9e69b889claireho UErrorCode *pErrorCode); 36027f654740f2a26ad62a5c155af9199af9e69b889claireho 36127f654740f2a26ad62a5c155af9199af9e69b889claireho/** 362b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Build a UTrie2 (version 2) from a UTrie (version 1). 363b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Enumerates all values in the UTrie and builds a UTrie2 with the same values. 364b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The resulting UTrie2 will be frozen. 365b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 366b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie1 the runtime UTrie structure to be enumerated 367b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param errorValue the value for out-of-range code points and illegal UTF-8 368b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode 369b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return The frozen UTrie2 with the same values as the UTrie. 370b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 371b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI UTrie2 * U_EXPORT2 372b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_fromUTrie(const UTrie *trie1, uint32_t errorValue, UErrorCode *pErrorCode); 373b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 374b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Public UTrie2 API macros ------------------------------------------------- */ 375b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 376b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* 377b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * These macros provide fast data lookup from a frozen trie. 378b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * They will crash when used on an unfrozen trie. 379b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 380b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 381b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 382b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 16-bit trie value from a code point, with range checking. 383b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Returns trie->errorValue if c is not in the range 0..U+10ffff. 384b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 385b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 386b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code point 387b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint16_t) The code point's trie value. 388b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 389b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) 390b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 391b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 392b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 32-bit trie value from a code point, with range checking. 393b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Returns trie->errorValue if c is not in the range 0..U+10ffff. 394b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 395b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 396b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code point 397b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint32_t) The code point's trie value. 398b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 399b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET32(trie, c) _UTRIE2_GET((trie), data32, 0, (c)) 400b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 401b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 402b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-16: Get the next code point (UChar32 c, out), post-increment src, 403b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * and get a 16-bit value from the trie. 404b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 405b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 406b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const UChar *, in/out) the source text pointer 407b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param limit (const UChar *, in) the limit pointer for the text, or NULL if NUL-terminated 408b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, out) variable for the code point 409b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint16_t variable for the trie lookup result 410b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 411b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U16_NEXT16(trie, src, limit, c, result) _UTRIE2_U16_NEXT(trie, index, src, limit, c, result) 412b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 413b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 414b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-16: Get the next code point (UChar32 c, out), post-increment src, 415b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * and get a 32-bit value from the trie. 416b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 417b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 418b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const UChar *, in/out) the source text pointer 419b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param limit (const UChar *, in) the limit pointer for the text, or NULL if NUL-terminated 420b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, out) variable for the code point 421b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint32_t, out) uint32_t variable for the trie lookup result 422b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 423b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U16_NEXT32(trie, src, limit, c, result) _UTRIE2_U16_NEXT(trie, data32, src, limit, c, result) 424b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 425b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 426b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-16: Get the previous code point (UChar32 c, out), pre-decrement src, 427b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * and get a 16-bit value from the trie. 428b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 429b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 430b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start (const UChar *, in) the start pointer for the text 431b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const UChar *, in/out) the source text pointer 432b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, out) variable for the code point 433b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint16_t variable for the trie lookup result 434b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 435b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U16_PREV16(trie, start, src, c, result) _UTRIE2_U16_PREV(trie, index, start, src, c, result) 436b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 437b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 438b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-16: Get the previous code point (UChar32 c, out), pre-decrement src, 439b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * and get a 32-bit value from the trie. 440b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 441b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 442b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start (const UChar *, in) the start pointer for the text 443b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const UChar *, in/out) the source text pointer 444b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, out) variable for the code point 445b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint32_t, out) uint32_t variable for the trie lookup result 446b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 447b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U16_PREV32(trie, start, src, c, result) _UTRIE2_U16_PREV(trie, data32, start, src, c, result) 448b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 449b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 450b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-8: Post-increment src and get a 16-bit value from the trie. 451b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 452b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 453b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const char *, in/out) the source text pointer 454b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param limit (const char *, in) the limit pointer for the text (must not be NULL) 455b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint16_t variable for the trie lookup result 456b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 457b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U8_NEXT16(trie, src, limit, result)\ 458b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_U8_NEXT(trie, data16, index, src, limit, result) 459b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 460b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 461b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-8: Post-increment src and get a 32-bit value from the trie. 462b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 463b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 464b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const char *, in/out) the source text pointer 465b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param limit (const char *, in) the limit pointer for the text (must not be NULL) 466b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint32_t variable for the trie lookup result 467b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 468b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U8_NEXT32(trie, src, limit, result) \ 469b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_U8_NEXT(trie, data32, data32, src, limit, result) 470b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 471b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 472b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-8: Pre-decrement src and get a 16-bit value from the trie. 473b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 474b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 475b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start (const char *, in) the start pointer for the text 476b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const char *, in/out) the source text pointer 477b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint16_t variable for the trie lookup result 478b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 479b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U8_PREV16(trie, start, src, result) \ 480b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_U8_PREV(trie, data16, index, start, src, result) 481b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 482b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 483b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-8: Pre-decrement src and get a 32-bit value from the trie. 484b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 485b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 486b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param start (const char *, in) the start pointer for the text 487b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param src (const char *, in/out) the source text pointer 488b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param result (uint16_t, out) uint32_t variable for the trie lookup result 489b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 490b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_U8_PREV32(trie, start, src, result) \ 491b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_U8_PREV(trie, data32, data32, start, src, result) 492b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 493b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Public UTrie2 API: optimized UTF-16 access ------------------------------- */ 494b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 495b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* 496b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The following functions and macros are used for highly optimized UTF-16 497b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * text processing. The UTRIE2_U16_NEXTxy() macros do not depend on these. 498b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 499b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * A UTrie2 stores separate values for lead surrogate code _units_ vs. code _points_. 500b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTF-16 text processing can be optimized by detecting surrogate pairs and 501b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * assembling supplementary code points only when there is non-trivial data 502b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * available. 503b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 504b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * At build-time, use utrie2_enumForLeadSurrogate() to see if there 505b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * is non-trivial (non-initialValue) data for any of the supplementary 506b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * code points associated with a lead surrogate. 507b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * If so, then set a special (application-specific) value for the 508b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * lead surrogate code _unit_, with utrie2_set32ForLeadSurrogateCodeUnit(). 509b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 510b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * At runtime, use UTRIE2_GET16_FROM_U16_SINGLE_LEAD() or 511b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * UTRIE2_GET32_FROM_U16_SINGLE_LEAD() per code unit. If there is non-trivial 512b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * data and the code unit is a lead surrogate, then check if a trail surrogate 513b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * follows. If so, assemble the supplementary code point with 514b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * U16_GET_SUPPLEMENTARY() and look up its value with UTRIE2_GET16_FROM_SUPP() 515b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * or UTRIE2_GET32_FROM_SUPP(); otherwise reset the lead 516b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * surrogate's value or do a code point lookup for it. 517b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 518b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * If there is only trivial data for lead and trail surrogates, then processing 519b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * can often skip them. For example, in normalization or case mapping 520b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * all characters that do not have any mappings are simply copied as is. 521b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 522b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 523b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 524b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Get a value from a lead surrogate code unit as stored in the trie. 525b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 526b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the trie 527b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c the code unit (U+D800..U+DBFF) 528b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return the value 529b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 530b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI uint32_t U_EXPORT2 531b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_get32FromLeadSurrogateCodeUnit(const UTrie2 *trie, UChar32 c); 532b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 533b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 534b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Enumerate the trie values for the 1024=0x400 code points 535b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * corresponding to a given lead surrogate. 536b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * For example, for the lead surrogate U+D87E it will enumerate the values 537b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * for [U+2F800..U+2FC00[. 538b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Used by data builder code that sets special lead surrogate code unit values 539b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * for optimized UTF-16 string processing. 540b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 541b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Do not modify the trie during the enumeration. 542b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 543b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Except for the limited code point range, this functions just like utrie2_enum(): 544b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * For each entry in the trie, the value to be delivered is passed through 545b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the UTrie2EnumValue function. 546b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The value is unchanged if that function pointer is NULL. 547b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 548b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * For each contiguous range of code points with a given (transformed) value, 549b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * the UTrie2EnumRange function is called. 550b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 551b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie a pointer to the trie 552b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param enumValue a pointer to a function that may transform the trie entry value, 553b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * or NULL if the values from the trie are to be used directly 554b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param enumRange a pointer to a function that is called for each contiguous range 555b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of code points with the same (transformed) value 556b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param context an opaque pointer that is passed on to the callback functions 557b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 558b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 559b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_enumForLeadSurrogate(const UTrie2 *trie, UChar32 lead, 560b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, 561b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const void *context); 562b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 563b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 564b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Set a value for a lead surrogate code unit. 565b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 566b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie the unfrozen trie 567b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param lead the lead surrogate code unit (U+D800..U+DBFF) 568b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param value the value 569b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes: 570b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * - U_NO_WRITE_PERMISSION if the trie is frozen 571b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 572b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CAPI void U_EXPORT2 573b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_set32ForLeadSurrogateCodeUnit(UTrie2 *trie, 574b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UChar32 lead, uint32_t value, 575b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UErrorCode *pErrorCode); 576b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 577b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 578b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 16-bit trie value from a UTF-16 single/lead code unit (<=U+ffff). 579b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Same as UTRIE2_GET16() if c is a BMP code point except for lead surrogates, 580b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * but smaller and faster. 581b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 582b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 583b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code unit, must be 0<=c<=U+ffff 584b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint16_t) The code unit's trie value. 585b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 586b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, c) _UTRIE2_GET_FROM_U16_SINGLE_LEAD((trie), index, c) 587b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 588b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 589b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 32-bit trie value from a UTF-16 single/lead code unit (<=U+ffff). 590b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Same as UTRIE2_GET32() if c is a BMP code point except for lead surrogates, 591b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * but smaller and faster. 592b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 593b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 594b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code unit, must be 0<=c<=U+ffff 595b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint32_t) The code unit's trie value. 596b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 597b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c) _UTRIE2_GET_FROM_U16_SINGLE_LEAD((trie), data32, c) 598b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 599b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 600b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 16-bit trie value from a supplementary code point (U+10000..U+10ffff). 601b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 602b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 603b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code point, must be U+10000<=c<=U+10ffff 604b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint16_t) The code point's trie value. 605b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 606b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET16_FROM_SUPP(trie, c) _UTRIE2_GET_FROM_SUPP((trie), index, c) 607b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 608b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 609b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Return a 32-bit trie value from a supplementary code point (U+10000..U+10ffff). 610b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 611b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param trie (const UTrie2 *, in) a frozen trie 612b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @param c (UChar32, in) the input code point, must be U+10000<=c<=U+10ffff 613b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @return (uint32_t) The code point's trie value. 614b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 615b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define UTRIE2_GET32_FROM_SUPP(trie, c) _UTRIE2_GET_FROM_SUPP((trie), data32, c) 616b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 61750294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoU_CDECL_END 61850294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 61950294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho/* C++ convenience wrappers ------------------------------------------------- */ 62050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 62150294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho#ifdef XP_CPLUSPLUS 62250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 62350294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho#include "mutex.h" 62450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 62550294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoU_NAMESPACE_BEGIN 62650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 62750294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho// Use the Forward/Backward subclasses below. 62850294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoclass UTrie2StringIterator : public UMemory { 62950294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehopublic: 63050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UTrie2StringIterator(const UTrie2 *t, const UChar *p) : 63150294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho trie(t), codePointStart(p), codePointLimit(p), codePoint(U_SENTINEL) {} 63250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 63350294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho const UTrie2 *trie; 63450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho const UChar *codePointStart, *codePointLimit; 63550294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UChar32 codePoint; 63650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho}; 63750294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 63850294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoclass BackwardUTrie2StringIterator : public UTrie2StringIterator { 63950294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehopublic: 64050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho BackwardUTrie2StringIterator(const UTrie2 *t, const UChar *s, const UChar *p) : 64150294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UTrie2StringIterator(t, p), start(s) {} 64250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 64350294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho uint16_t previous16(); 64450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 64550294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho const UChar *start; 64650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho}; 64750294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 64850294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoclass ForwardUTrie2StringIterator : public UTrie2StringIterator { 64950294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehopublic: 65050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho // Iteration limit l can be NULL. 65150294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho // In that case, the caller must detect c==0 and stop. 65250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho ForwardUTrie2StringIterator(const UTrie2 *t, const UChar *p, const UChar *l) : 65350294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UTrie2StringIterator(t, p), limit(l) {} 65450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 65550294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho uint16_t next16(); 65650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 65750294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho const UChar *limit; 65850294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho}; 65950294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 66050294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoclass UTrie2Singleton { 66150294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehopublic: 66250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UTrie2Singleton(SimpleSingleton &s) : singleton(s) {} 66350294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho void deleteInstance() { 66450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho utrie2_close((UTrie2 *)singleton.fInstance); 66550294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho singleton.reset(); 66650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho } 66750294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UTrie2 *getInstance(InstantiatorFn *instantiator, const void *context, 66850294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho UErrorCode &errorCode); 66950294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoprivate: 67050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho SimpleSingleton &singleton; 67150294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho}; 67250294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 67350294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoU_NAMESPACE_END 67450294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 67550294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho#endif 67650294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 677b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Internal definitions ----------------------------------------------------- */ 678b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 67950294ead5e5d23f5bbfed76e00e6b510bd41eee1clairehoU_CDECL_BEGIN 68050294ead5e5d23f5bbfed76e00e6b510bd41eee1claireho 681b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Build-time trie structure. */ 682b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querustruct UNewTrie2; 683b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querutypedef struct UNewTrie2 UNewTrie2; 684b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 685b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* 686b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Trie structure definition. 687b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 688b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Either the data table is 16 bits wide and accessed via the index 689b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * pointer, with each index item increased by indexLength; 690b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * in this case, data32==NULL, and data16 is used for direct ASCII access. 691b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 692b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Or the data table is 32 bits wide and accessed via the data32 pointer. 693b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 694b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Querustruct UTrie2 { 695b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /* protected: used by macros and functions for reading values */ 696b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const uint16_t *index; 697b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const uint16_t *data16; /* for fast UTF-8 ASCII access, if 16b data */ 698b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const uint32_t *data32; /* NULL if 16b data is used via index */ 699b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 700b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int32_t indexLength, dataLength; 701b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint16_t index2NullOffset; /* 0xffff if there is no dedicated index-2 null block */ 702b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint16_t dataNullOffset; 703b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint32_t initialValue; 704b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Value returned for out-of-range code points and illegal UTF-8. */ 705b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint32_t errorValue; 706b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 707b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /* Start of the last range which ends at U+10ffff, and its value. */ 708b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UChar32 highStart; 709b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int32_t highValueIndex; 710b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 711b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /* private: used by builder and unserialization functions */ 712b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru void *memory; /* serialized bytes; NULL if not frozen yet */ 713b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int32_t length; /* number of serialized bytes at memory; 0 if not frozen yet */ 714b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UBool isMemoryOwned; /* TRUE if the trie owns the memory */ 715b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UBool padding1; 716b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int16_t padding2; 717b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UNewTrie2 *newTrie; /* builder object; NULL when frozen */ 718b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru}; 719b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 720b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 721b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Trie constants, defining shift widths, index array lengths, etc. 722b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 723b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * These are needed for the runtime macros but users can treat these as 724b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * implementation details and skip to the actual public API further below. 725b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 726b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruenum { 727b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Shift size for getting the index-1 table offset. */ 728b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_SHIFT_1=6+5, 729b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 730b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Shift size for getting the index-2 table offset. */ 731b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_SHIFT_2=5, 732b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 733b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 734b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Difference between the two shift sizes, 735b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * for getting an index-1 offset from an index-2 offset. 6=11-5 736b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 737b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_SHIFT_1_2=UTRIE2_SHIFT_1-UTRIE2_SHIFT_2, 738b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 739b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 740b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Number of index-1 entries for the BMP. 32=0x20 741b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * This part of the index-1 table is omitted from the serialized form. 742b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 743b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_OMITTED_BMP_INDEX_1_LENGTH=0x10000>>UTRIE2_SHIFT_1, 744b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 745b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Number of code points per index-1 table entry. 2048=0x800 */ 746b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_CP_PER_INDEX_1_ENTRY=1<<UTRIE2_SHIFT_1, 747b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 748b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Number of entries in an index-2 block. 64=0x40 */ 749b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_2_BLOCK_LENGTH=1<<UTRIE2_SHIFT_1_2, 750b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 751b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Mask for getting the lower bits for the in-index-2-block offset. */ 752b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_2_MASK=UTRIE2_INDEX_2_BLOCK_LENGTH-1, 753b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 754b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Number of entries in a data block. 32=0x20 */ 755b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_DATA_BLOCK_LENGTH=1<<UTRIE2_SHIFT_2, 756b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 757b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Mask for getting the lower bits for the in-data-block offset. */ 758b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_DATA_MASK=UTRIE2_DATA_BLOCK_LENGTH-1, 759b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 760b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 761b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Shift size for shifting left the index array values. 762b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Increases possible data size with 16-bit index values at the cost 763b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * of compactability. 764b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * This requires data blocks to be aligned by UTRIE2_DATA_GRANULARITY. 765b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 766b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_SHIFT=2, 767b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 768b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** The alignment size of a data block. Also the granularity for compaction. */ 769b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_DATA_GRANULARITY=1<<UTRIE2_INDEX_SHIFT, 770b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 771b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /* Fixed layout of the first part of the index array. ------------------- */ 772b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 773b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 774b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The BMP part of the index-2 table is fixed and linear and starts at offset 0. 775b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Length=2048=0x800=0x10000>>UTRIE2_SHIFT_2. 776b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 777b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_2_OFFSET=0, 778b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 779b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 780b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The part of the index-2 table for U+D800..U+DBFF stores values for 781b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * lead surrogate code _units_ not code _points_. 782b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Values for lead surrogate code _points_ are indexed with this portion of the table. 783b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Length=32=0x20=0x400>>UTRIE2_SHIFT_2. (There are 1024=0x400 lead surrogates.) 784b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 785b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_LSCP_INDEX_2_OFFSET=0x10000>>UTRIE2_SHIFT_2, 786b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_LSCP_INDEX_2_LENGTH=0x400>>UTRIE2_SHIFT_2, 787b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 788b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** Count the lengths of both BMP pieces. 2080=0x820 */ 789b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_2_BMP_LENGTH=UTRIE2_LSCP_INDEX_2_OFFSET+UTRIE2_LSCP_INDEX_2_LENGTH, 790b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 791b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 792b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The 2-byte UTF-8 version of the index-2 table follows at offset 2080=0x820. 793b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Length 32=0x20 for lead bytes C0..DF, regardless of UTRIE2_SHIFT_2. 794b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 795b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_UTF8_2B_INDEX_2_OFFSET=UTRIE2_INDEX_2_BMP_LENGTH, 796b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_UTF8_2B_INDEX_2_LENGTH=0x800>>6, /* U+0800 is the first code point after 2-byte UTF-8 */ 797b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 798b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 799b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The index-1 table, only used for supplementary code points, at offset 2112=0x840. 800b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Variable length, for code points up to highStart, where the last single-value range starts. 801b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Maximum length 512=0x200=0x100000>>UTRIE2_SHIFT_1. 802b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * (For 0x100000 supplementary code points U+10000..U+10ffff.) 803b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 804b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The part of the index-2 table for supplementary code points starts 805b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * after this index-1 table. 806b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * 807b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Both the index-1 table and the following part of the index-2 table 808b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * are omitted completely if there is only BMP data. 809b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 810b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_INDEX_1_OFFSET=UTRIE2_UTF8_2B_INDEX_2_OFFSET+UTRIE2_UTF8_2B_INDEX_2_LENGTH, 811b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_MAX_INDEX_1_LENGTH=0x100000>>UTRIE2_SHIFT_1, 812b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 813b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /* 814b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Fixed layout of the first part of the data array. ----------------------- 815b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Starts with 4 blocks (128=0x80 entries) for ASCII. 816b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 817b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 818b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** 819b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * The illegal-UTF-8 data block follows the ASCII block, at offset 128=0x80. 820b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Used with linear access for single bytes 0..0xbf for simple error handling. 821b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Length 64=0x40, not UTRIE2_DATA_BLOCK_LENGTH. 822b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 823b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_BAD_UTF8_DATA_OFFSET=0x80, 824b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 825b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru /** The start of non-linear-ASCII data blocks, at offset 192=0xc0. */ 826b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru UTRIE2_DATA_START_OFFSET=0xc0 827b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru}; 828b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 829b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/* Internal functions and macros -------------------------------------------- */ 830b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 831b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 832b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Internal function for part of the UTRIE2_U8_NEXTxx() macro implementations. 833b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Do not call directly. 834b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @internal 835b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 836b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_INTERNAL int32_t U_EXPORT2 837b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_internalU8NextIndex(const UTrie2 *trie, UChar32 c, 838b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const uint8_t *src, const uint8_t *limit); 839b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 840b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 841b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Internal function for part of the UTRIE2_U8_PREVxx() macro implementations. 842b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Do not call directly. 843b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * @internal 844b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 845b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_INTERNAL int32_t U_EXPORT2 846b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queruutrie2_internalU8PrevIndex(const UTrie2 *trie, UChar32 c, 847b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru const uint8_t *start, const uint8_t *src); 848b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 849b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 850b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal low-level trie getter. Returns a data index. */ 851b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_RAW(offset, trieIndex, c) \ 852b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (((int32_t)((trieIndex)[(offset)+((c)>>UTRIE2_SHIFT_2)]) \ 853b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru <<UTRIE2_INDEX_SHIFT)+ \ 854b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ((c)&UTRIE2_DATA_MASK)) 855b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 856b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a UTF-16 single/lead code unit. Returns the data index. */ 857b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_FROM_U16_SINGLE_LEAD(trieIndex, c) _UTRIE2_INDEX_RAW(0, trieIndex, c) 858b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 859b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a lead surrogate code point (D800..DBFF). Returns the data index. */ 860b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_FROM_LSCP(trieIndex, c) \ 861b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_RAW(UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2), trieIndex, c) 862b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 863b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a BMP code point. Returns the data index. */ 864b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_FROM_BMP(trieIndex, c) \ 865b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_RAW(U_IS_LEAD(c) ? UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2) : 0, \ 866b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru trieIndex, c) 867b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 868b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a supplementary code point below highStart. Returns the data index. */ 869b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_FROM_SUPP(trieIndex, c) \ 870b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (((int32_t)((trieIndex)[ \ 871b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trieIndex)[(UTRIE2_INDEX_1_OFFSET-UTRIE2_OMITTED_BMP_INDEX_1_LENGTH)+ \ 872b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ((c)>>UTRIE2_SHIFT_1)]+ \ 873b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (((c)>>UTRIE2_SHIFT_2)&UTRIE2_INDEX_2_MASK)]) \ 874b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru <<UTRIE2_INDEX_SHIFT)+ \ 875b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ((c)&UTRIE2_DATA_MASK)) 876b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 877b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 878b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Internal trie getter from a code point, with checking that c is in 0..10FFFF. 879b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Returns the data index. 880b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 881b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_INDEX_FROM_CP(trie, asciiOffset, c) \ 882b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ((uint32_t)(c)<0xd800 ? \ 883b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_RAW(0, (trie)->index, c) : \ 884b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (uint32_t)(c)<=0xffff ? \ 885b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_RAW( \ 886b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)<=0xdbff ? UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2) : 0, \ 887b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->index, c) : \ 888b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (uint32_t)(c)>0x10ffff ? \ 889b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (asciiOffset)+UTRIE2_BAD_UTF8_DATA_OFFSET : \ 890b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)>=(trie)->highStart ? \ 891b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->highValueIndex : \ 892b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_FROM_SUPP((trie)->index, c)) 893b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 894b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a UTF-16 single/lead code unit. Returns the data. */ 895b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_GET_FROM_U16_SINGLE_LEAD(trie, data, c) \ 896b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->data[_UTRIE2_INDEX_FROM_U16_SINGLE_LEAD((trie)->index, c)] 897b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 898b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal trie getter from a supplementary code point. Returns the data. */ 899b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_GET_FROM_SUPP(trie, data, c) \ 900b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->data[(c)>=(trie)->highStart ? (trie)->highValueIndex : \ 901b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru _UTRIE2_INDEX_FROM_SUPP((trie)->index, c)] 902b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 903b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 904b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Internal trie getter from a code point, with checking that c is in 0..10FFFF. 905b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Returns the data. 906b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 907b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_GET(trie, data, asciiOffset, c) \ 908b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->data[_UTRIE2_INDEX_FROM_CP(trie, asciiOffset, c)] 909b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 910b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal next-post-increment: get the next code point (c) and its data. */ 911b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_U16_NEXT(trie, data, src, limit, c, result) { \ 912b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru { \ 913b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint16_t __c2; \ 914b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)=*(src)++; \ 915b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru if(!U16_IS_LEAD(c)) { \ 916b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=_UTRIE2_GET_FROM_U16_SINGLE_LEAD(trie, data, c); \ 917b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else if((src)==(limit) || !U16_IS_TRAIL(__c2=*(src))) { \ 918b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[_UTRIE2_INDEX_FROM_LSCP((trie)->index, c)]; \ 919b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else { \ 920b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ++(src); \ 921b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)=U16_GET_SUPPLEMENTARY((c), __c2); \ 922b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=_UTRIE2_GET_FROM_SUPP((trie), data, (c)); \ 923b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 924b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 925b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru} 926b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 927b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal pre-decrement-previous: get the previous code point (c) and its data */ 928b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_U16_PREV(trie, data, start, src, c, result) { \ 929b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru { \ 930b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint16_t __c2; \ 931b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)=*--(src); \ 932b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru if(!U16_IS_TRAIL(c) || (src)==(start) || !U16_IS_LEAD(__c2=*((src)-1))) { \ 933b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[_UTRIE2_INDEX_FROM_BMP((trie)->index, c)]; \ 934b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else { \ 935b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru --(src); \ 936b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (c)=U16_GET_SUPPLEMENTARY(__c2, (c)); \ 937b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=_UTRIE2_GET_FROM_SUPP((trie), data, (c)); \ 938b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 939b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 940b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru} 941b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 942b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal UTF-8 next-post-increment: get the next code point's data. */ 943b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_U8_NEXT(trie, ascii, data, src, limit, result) { \ 944b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint8_t __lead=(uint8_t)*(src)++; \ 945b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru if(__lead<0xc0) { \ 946b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->ascii[__lead]; \ 947b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else { \ 948b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint8_t __t1, __t2; \ 949b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru if( /* handle U+0000..U+07FF inline */ \ 950b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru __lead<0xe0 && (src)<(limit) && \ 951b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (__t1=(uint8_t)(*(src)-0x80))<=0x3f \ 952b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ) { \ 953b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ++(src); \ 954b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[ \ 955b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (trie)->index[(UTRIE2_UTF8_2B_INDEX_2_OFFSET-0xc0)+__lead]+ \ 956b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru __t1]; \ 957b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else if( /* handle U+0000..U+CFFF inline */ \ 958b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru __lead<0xed && ((src)+1)<(limit) && \ 959b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (__t1=(uint8_t)(*(src)-0x80))<=0x3f && (__lead>0xe0 || __t1>=0x20) && \ 960b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (__t2=(uint8_t)(*((src)+1)-0x80))<= 0x3f \ 961b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ) { \ 962b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (src)+=2; \ 963b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[ \ 964b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru ((int32_t)((trie)->index[((__lead-0xe0)<<(12-UTRIE2_SHIFT_2))+ \ 965b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (__t1<<(6-UTRIE2_SHIFT_2))+(__t2>>UTRIE2_SHIFT_2)]) \ 966b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru <<UTRIE2_INDEX_SHIFT)+ \ 967b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (__t2&UTRIE2_DATA_MASK)]; \ 968b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else { \ 969b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int32_t __index=utrie2_internalU8NextIndex((trie), __lead, (const uint8_t *)(src), \ 970b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (const uint8_t *)(limit)); \ 971b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (src)+=__index&7; \ 972b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[__index>>3]; \ 973b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 974b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 975b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru} 976b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 977b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** Internal UTF-8 pre-decrement-previous: get the previous code point's data. */ 978b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#define _UTRIE2_U8_PREV(trie, ascii, data, start, src, result) { \ 979b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru uint8_t __b=(uint8_t)*--(src); \ 980b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru if(__b<0x80) { \ 981b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->ascii[__b]; \ 982b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } else { \ 983b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru int32_t __index=utrie2_internalU8PrevIndex((trie), __b, (const uint8_t *)(start), \ 984b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (const uint8_t *)(src)); \ 985b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (src)-=__index&7; \ 986b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru (result)=(trie)->data[__index>>3]; \ 987b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru } \ 988b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru} 989b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 990b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste QueruU_CDECL_END 991b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 992b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru/** 993b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru * Work around MSVC 2003 optimization bugs. 994b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru */ 995b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#if defined (U_HAVE_MSVC_2003_OR_EARLIER) 996b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#pragma optimize("", off) 997b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#endif 998b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru 999b0ac937921a2c196d8b9da665135bf6ba01a1ccfJean-Baptiste Queru#endif 1000