| /external/chromium/third_party/icu/source/i18n/ |
| ucol_cnt.cpp | 31 uint32_t *newData = (uint32_t *)uprv_realloc(tbl->CEs, 2*tbl->size*sizeof(uint32_t));
42 tbl->CEs = newData;
70 tbl->CEs = NULL;
82 el->CEs = (uint32_t *)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
83 if(el->CEs == NULL) {
89 uprv_free(el->CEs);
95 uprv_memset(el->CEs, 0, INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
110 uprv_free(el->CEs);
155 if(table->CEs != NULL) {
156 uprv_free(table->CEs);
[all...] |
| coleitr.cpp | 138 return (m_data_->iteratordata_.CEpos - m_data_->iteratordata_.CEs)
140 - that.m_data_->iteratordata_.CEs);
470 uprv_memcpy(coliter->CEs, othercoliter->CEs, sizeof(uint32_t) * UCOL_EXPAND_CE_BUFFER_SIZE);
480 CEsize = (int32_t)(othercoliter->CEpos - othercoliter->CEs);
482 uprv_memcpy(coliter->CEs, othercoliter->CEs, CEsize);
484 coliter->toReturn = coliter->CEs +
485 (othercoliter->toReturn - othercoliter->CEs);
486 coliter->CEpos = coliter->CEs + CEsize
[all...] |
| ucol_cnt.h | 41 uint32_t *CEs;
51 uint32_t *CEs;
|
| ucol_elm.h | 54 uint32_t *CEs;
67 uint32_t CEs[128]; /* These are collation elements - there could be more than one - in case of expansion */
|
| ucol_elm.cpp | 82 if(expansions->CEs == NULL) {
83 expansions->CEs = (uint32_t *)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
85 if (expansions->CEs == NULL) {
94 uint32_t *newData = (uint32_t *)uprv_realloc(expansions->CEs, 2*expansions->size*sizeof(uint32_t));
102 expansions->CEs = newData;
106 expansions->CEs[expansions->position] = value;
258 if(t->expansions->CEs != NULL) {
259 r->expansions->CEs = (uint32_t *)uprv_malloc(sizeof(uint32_t)*t->expansions->size);
261 if (r->expansions->CEs == NULL) {
265 uprv_memcpy(r->expansions->CEs, t->expansions->CEs, sizeof(uint32_t)*t->expansions->position)
[all...] |
| ucol_bld.cpp | 74 * Takes two CEs (lead and continuation) and
75 * compares them as CEs should be compared:
671 /* Here we have to pack CEs from parts */
692 tok->CEs[CEi] = value;
697 tok->CEs[0] = 0;
705 if(tok->CEs[0] != 0) { // case bits should be set only for non-ignorables
706 tok->CEs[0] &= 0xFFFFFF3F; // Clean the case bits field
712 tok->CEs[0] |= ucol_uprv_getCaseBits(src->UCA, cPoints, cSize, status);
716 tok->CEs[0] |= (caseCE & 0xC0);
723 fprintf(stderr, "%08X ", tok->CEs[i])
[all...] |
| ucol_imp.h | 70 * - serialized UTrie with mappings of code points to CEs
105 * uint32_t expansion; - offset to expansion table (uint32_t *expansion). This is an array of expansion CEs. Never 0.
110 * uint32_t contractionCEs; - offset to resulting contraction CEs (uint32_t *contractionCEs). When a contraction is resolved in the
113 * uint32_t contractionSize; - size of contraction table in elements (both Index and CEs).
116 * and last CEs in expansions.
274 uint32_t *toReturn; /* This is the CE from CEs buffer that should be returned */
275 uint32_t *CEpos; /* This is the position to which we have stored processed CEs */
288 uint32_t *extendCEs; /* This is use if CEs is not big enough */
289 int32_t extendCEsSize; /* Holds the size of the dynamic CEs buffer */
290 uint32_t CEs[UCOL_EXPAND_CE_BUFFER_SIZE]; /* This is where we store CEs *
[all...] |
| ucol_tok.h | 72 uint32_t CEs[128];
|
| ucoleitr.cpp | 384 ci->CEpos = ci->toReturn = ci->CEs;
557 // buffer raw CEs up to non-ignorable primary
578 // process the raw CEs
748 ci->CEpos = ci->toReturn = ci->CEs;
|
| ucol.cpp | 100 (s)->CEpos = (s)->toReturn = (s)->CEs;
857 * For generation of Implicit CEs
[all...] |
| usearch.cpp | 54 ci->CEpos = ci->toReturn = ci->extendCEs ? ci->extendCEs : ci->CEs;
86 * This is to squeeze the 21bit ces into a 256 table
397 // ** Should processed CEs be signed or unsigned?
476 * @param cesize size of the pattern ces
489 // number of characters to give the relevant ces, ie approximately
490 // the number of ces minus their expansion, since expansions can come
498 // number of ces from right of array to the count
627 // iterates the individual ces
815 * ces.
[all...] |
| /external/icu4c/i18n/ |
| ucol_cnt.cpp | 31 uint32_t *newData = (uint32_t *)uprv_realloc(tbl->CEs, 2*tbl->size*sizeof(uint32_t));
42 tbl->CEs = newData;
70 tbl->CEs = NULL;
82 el->CEs = (uint32_t *)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
83 if(el->CEs == NULL) {
89 uprv_free(el->CEs);
95 uprv_memset(el->CEs, 0, INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
110 uprv_free(el->CEs);
155 if(table->CEs != NULL) {
156 uprv_free(table->CEs);
[all...] |
| coleitr.cpp | 136 return (m_data_->iteratordata_.CEpos - m_data_->iteratordata_.CEs)
138 - that.m_data_->iteratordata_.CEs);
445 uprv_memcpy(coliter->CEs, othercoliter->CEs, sizeof(uint32_t) * UCOL_EXPAND_CE_BUFFER_SIZE);
455 CEsize = (int32_t)(othercoliter->CEpos - othercoliter->CEs);
457 uprv_memcpy(coliter->CEs, othercoliter->CEs, CEsize);
459 coliter->toReturn = coliter->CEs +
460 (othercoliter->toReturn - othercoliter->CEs);
461 coliter->CEpos = coliter->CEs + CEsize
[all...] |
| ucol_cnt.h | 41 uint32_t *CEs;
51 uint32_t *CEs;
|
| ucol_elm.h | 54 uint32_t *CEs;
67 uint32_t CEs[128]; /* These are collation elements - there could be more than one - in case of expansion */
|
| ucol_elm.cpp | 84 if(expansions->CEs == NULL) {
85 expansions->CEs = (uint32_t *)uprv_malloc(INIT_EXP_TABLE_SIZE*sizeof(uint32_t));
87 if (expansions->CEs == NULL) {
96 uint32_t *newData = (uint32_t *)uprv_realloc(expansions->CEs, 2*expansions->size*sizeof(uint32_t));
104 expansions->CEs = newData;
108 expansions->CEs[expansions->position] = value;
259 if(t->expansions->CEs != NULL) {
260 r->expansions->CEs = (uint32_t *)uprv_malloc(sizeof(uint32_t)*t->expansions->size);
262 if (r->expansions->CEs == NULL) {
266 uprv_memcpy(r->expansions->CEs, t->expansions->CEs, sizeof(uint32_t)*t->expansions->position)
[all...] |
| ucol_bld.cpp | 74 * Takes two CEs (lead and continuation) and
75 * compares them as CEs should be compared:
671 /* Here we have to pack CEs from parts */
692 tok->CEs[CEi] = value;
697 tok->CEs[0] = 0;
705 if(tok->CEs[0] != 0) { // case bits should be set only for non-ignorables
706 tok->CEs[0] &= 0xFFFFFF3F; // Clean the case bits field
712 tok->CEs[0] |= ucol_uprv_getCaseBits(src->UCA, cPoints, cSize, status);
716 tok->CEs[0] |= (caseCE & 0xC0);
723 fprintf(stderr, "%08X ", tok->CEs[i])
[all...] |
| ucol_tok.h | 72 uint32_t CEs[128];
|
| ucol_imp.h | 74 * - serialized UTrie with mappings of code points to CEs
109 * uint32_t expansion; - offset to expansion table (uint32_t *expansion). This is an array of expansion CEs. Never 0.
114 * uint32_t contractionCEs; - offset to resulting contraction CEs (uint32_t *contractionCEs). When a contraction is resolved in the
117 * uint32_t contractionSize; - size of contraction table in elements (both Index and CEs).
120 * and last CEs in expansions.
280 uint32_t *toReturn; /* This is the CE from CEs buffer that should be returned */
281 uint32_t *CEpos; /* This is the position to which we have stored processed CEs */
294 uint32_t *extendCEs; /* This is use if CEs is not big enough */
295 int32_t extendCEsSize; /* Holds the size of the dynamic CEs buffer */
296 uint32_t CEs[UCOL_EXPAND_CE_BUFFER_SIZE]; /* This is where we store CEs *
[all...] |
| ucoleitr.cpp | 375 ci->CEpos = ci->toReturn = ci->CEs;
544 // buffer raw CEs up to non-ignorable primary
565 // process the raw CEs
739 ci->CEpos = ci->toReturn = ci->CEs;
|
| ucol.cpp | 103 (s)->CEpos = (s)->toReturn = (s)->CEs;
244 oldCEs = data->CEs;
265 oldCapacity = LENGTHOF(data->CEs);
276 oldCapacity = LENGTHOF(data->CEs);
913 * For generation of Implicit CEs
[all...] |
| usearch.cpp | 56 ci->CEpos = ci->toReturn = ci->extendCEs ? ci->extendCEs : ci->CEs;
88 * This is to squeeze the 21bit ces into a 256 table
407 // ** Should processed CEs be signed or unsigned?
486 * @param cesize size of the pattern ces
499 // number of characters to give the relevant ces, ie approximately
500 // the number of ces minus their expansion, since expansions can come
508 // number of ces from right of array to the count
637 // iterates the individual ces
825 * ces.
[all...] |
| /external/icu4c/tools/genuca/ |
| genuca.cpp | 23 * 05/09/2001 weiv Case bits are now in the CEs, not in front
179 if(VERBOSE && isContinuation(element->CEs[1])) {
183 inverseTable[inversePos][0] = element->CEs[0];
184 if(element->noOfCEs > 1 && isContinuation(element->CEs[1])) {
185 inverseTable[inversePos][1] = element->CEs[1];
203 if(VERBOSE && isContinuation(element->CEs[1])) {
211 inverseTable[position][0] = element->CEs[0];
212 if(element->noOfCEs > 1 && isContinuation(element->CEs[1])) {
213 inverseTable[position][1] = element->CEs[1];
260 * Takes two CEs (lead and continuation) and
[all...] |
| /external/chromium/third_party/icu/source/tools/genuca/ |
| genuca.cpp | 23 * 05/09/2001 weiv Case bits are now in the CEs, not in front
179 if(VERBOSE && isContinuation(element->CEs[1])) {
183 inverseTable[inversePos][0] = element->CEs[0];
184 if(element->noOfCEs > 1 && isContinuation(element->CEs[1])) {
185 inverseTable[inversePos][1] = element->CEs[1];
203 if(VERBOSE && isContinuation(element->CEs[1])) {
211 inverseTable[position][0] = element->CEs[0];
212 if(element->noOfCEs > 1 && isContinuation(element->CEs[1])) {
213 inverseTable[position][1] = element->CEs[1];
260 * Takes two CEs (lead and continuation) and
[all...] |
