| OLD | NEW |
| 1 /* | 1 /* |
| 2 ****************************************************************************** | 2 ****************************************************************************** |
| 3 * | 3 * |
| 4 * Copyright (C) 1999-2013, International Business Machines | 4 * Copyright (C) 1999-2013, International Business Machines |
| 5 * Corporation and others. All Rights Reserved. | 5 * Corporation and others. All Rights Reserved. |
| 6 * | 6 * |
| 7 ****************************************************************************** | 7 ****************************************************************************** |
| 8 * file name: ubidiimp.h | 8 * file name: ubidiimp.h |
| 9 * encoding: US-ASCII | 9 * encoding: US-ASCII |
| 10 * tab size: 8 (not used) | 10 * tab size: 8 (not used) |
| (...skipping 165 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 176 DirProp lastStrong; /* bidi class of last strong char found
in this run */ | 176 DirProp lastStrong; /* bidi class of last strong char found
in this run */ |
| 177 UBiDiDirection contextDir; /* L or R to use as context for followin
g openings */ | 177 UBiDiDirection contextDir; /* L or R to use as context for followin
g openings */ |
| 178 uint8_t filler; /* to complete a nice multiple of 4 char
s */ | 178 uint8_t filler; /* to complete a nice multiple of 4 char
s */ |
| 179 } IsoRun; | 179 } IsoRun; |
| 180 | 180 |
| 181 typedef struct BracketData { | 181 typedef struct BracketData { |
| 182 UBiDi *pBiDi; | 182 UBiDi *pBiDi; |
| 183 /* array of opening entries which should be enough in most cases; no malloc(
) */ | 183 /* array of opening entries which should be enough in most cases; no malloc(
) */ |
| 184 Opening simpleOpenings[SIMPLE_OPENINGS_SIZE]; | 184 Opening simpleOpenings[SIMPLE_OPENINGS_SIZE]; |
| 185 Opening *openings; /* pointer to current array of entries *
/ | 185 Opening *openings; /* pointer to current array of entries *
/ |
| 186 int32_t openingsSize; /* number of allocated entries */ | 186 int32_t openingsCount; /* number of allocated entries */ |
| 187 int32_t isoRunLast; /* index of last used entry */ | 187 int32_t isoRunLast; /* index of last used entry */ |
| 188 /* array of nested isolated sequence entries; can never excess UBIDI_MAX_EXP
LICIT_LEVEL | 188 /* array of nested isolated sequence entries; can never excess UBIDI_MAX_EXP
LICIT_LEVEL |
| 189 + 1 for index 0, + 1 for before the first isolated sequence */ | 189 + 1 for index 0, + 1 for before the first isolated sequence */ |
| 190 IsoRun isoRuns[UBIDI_MAX_EXPLICIT_LEVEL+2]; | 190 IsoRun isoRuns[UBIDI_MAX_EXPLICIT_LEVEL+2]; |
| 191 UBool isNumbersSpecial; /* reordering mode for NUMBERS_SPECIAL *
/ | 191 UBool isNumbersSpecial; /* reordering mode for NUMBERS_SPECIAL *
/ |
| 192 } BracketData; | 192 } BracketData; |
| 193 | 193 |
| 194 typedef struct Isolate { | 194 typedef struct Isolate { |
| 195 int32_t start1; | 195 int32_t start1; |
| 196 int16_t stateImp; | 196 int16_t stateImp; |
| (...skipping 275 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 472 ubidi_getMemory((BidiMemoryForAllocation *)&(pBiDi)->runsMemory, &(pBiDi
)->runsSize, \ | 472 ubidi_getMemory((BidiMemoryForAllocation *)&(pBiDi)->runsMemory, &(pBiDi
)->runsSize, \ |
| 473 TRUE, (length)*sizeof(Run)) | 473 TRUE, (length)*sizeof(Run)) |
| 474 | 474 |
| 475 #define getInitialIsolatesMemory(pBiDi, length) \ | 475 #define getInitialIsolatesMemory(pBiDi, length) \ |
| 476 ubidi_getMemory((BidiMemoryForAllocation *)&(pBiDi)->isolatesMemory, &(p
BiDi)->isolatesSize, \ | 476 ubidi_getMemory((BidiMemoryForAllocation *)&(pBiDi)->isolatesMemory, &(p
BiDi)->isolatesSize, \ |
| 477 TRUE, (length)*sizeof(Isolate)) | 477 TRUE, (length)*sizeof(Isolate)) |
| 478 | 478 |
| 479 #endif | 479 #endif |
| 480 | 480 |
| 481 #endif | 481 #endif |
| OLD | NEW |