Lines Matching refs:trie
51 UNewTrie *trie; in utrie_open() local
61 trie=fillIn; in utrie_open()
63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie)); in utrie_open()
64 if(trie==NULL) { in utrie_open()
68 uprv_memset(trie, 0, sizeof(UNewTrie)); in utrie_open()
69 trie->isAllocated= (UBool)(fillIn==NULL); in utrie_open()
72 trie->data=aliasData; in utrie_open()
73 trie->isDataAllocated=FALSE; in utrie_open()
75 trie->data=(uint32_t *)uprv_malloc(maxDataLength*4); in utrie_open()
76 if(trie->data==NULL) { in utrie_open()
77 uprv_free(trie); in utrie_open()
80 trie->isDataAllocated=TRUE; in utrie_open()
94 trie->index[i++]=j; in utrie_open()
100 trie->dataLength=j; in utrie_open()
102 trie->data[--j]=initialValue; in utrie_open()
105 trie->leadUnitValue=leadUnitValue; in utrie_open()
106 trie->indexLength=UTRIE_MAX_INDEX_LENGTH; in utrie_open()
107 trie->dataCapacity=maxDataLength; in utrie_open()
108 trie->isLatin1Linear=latin1Linear; in utrie_open()
109 trie->isCompacted=FALSE; in utrie_open()
110 return trie; in utrie_open()
115 UNewTrie *trie; in utrie_clone() local
135 trie=utrie_open(fillIn, aliasData, aliasDataCapacity, in utrie_clone()
138 if(trie==NULL) { in utrie_clone()
141 uprv_memcpy(trie->index, other->index, sizeof(trie->index)); in utrie_clone()
142 uprv_memcpy(trie->data, other->data, other->dataLength*4); in utrie_clone()
143 trie->dataLength=other->dataLength; in utrie_clone()
144 trie->isDataAllocated=isDataAllocated; in utrie_clone()
147 return trie; in utrie_clone()
151 utrie_close(UNewTrie *trie) { in utrie_close() argument
152 if(trie!=NULL) { in utrie_close()
153 if(trie->isDataAllocated) { in utrie_close()
154 uprv_free(trie->data); in utrie_close()
155 trie->data=NULL; in utrie_close()
157 if(trie->isAllocated) { in utrie_close()
158 uprv_free(trie); in utrie_close()
164 utrie_getData(UNewTrie *trie, int32_t *pLength) { in utrie_getData() argument
165 if(trie==NULL || pLength==NULL) { in utrie_getData()
169 *pLength=trie->dataLength; in utrie_getData()
170 return trie->data; in utrie_getData()
174 utrie_allocDataBlock(UNewTrie *trie) { in utrie_allocDataBlock() argument
177 newBlock=trie->dataLength; in utrie_allocDataBlock()
179 if(newTop>trie->dataCapacity) { in utrie_allocDataBlock()
183 trie->dataLength=newTop; in utrie_allocDataBlock()
194 utrie_getDataBlock(UNewTrie *trie, UChar32 c) { in utrie_getDataBlock() argument
198 indexValue=trie->index[c]; in utrie_getDataBlock()
204 newBlock=utrie_allocDataBlock(trie); in utrie_getDataBlock()
209 trie->index[c]=newBlock; in utrie_getDataBlock()
212 uprv_memcpy(trie->data+newBlock, trie->data-indexValue, 4*UTRIE_DATA_BLOCK_LENGTH); in utrie_getDataBlock()
220 utrie_set32(UNewTrie *trie, UChar32 c, uint32_t value) { in utrie_set32() argument
224 if(trie==NULL || trie->isCompacted || (uint32_t)c>0x10ffff) { in utrie_set32()
228 block=utrie_getDataBlock(trie, c); in utrie_set32()
233 trie->data[block+(c&UTRIE_MASK)]=value; in utrie_set32()
238 utrie_get32(UNewTrie *trie, UChar32 c, UBool *pInBlockZero) { in utrie_get32() argument
242 if(trie==NULL || trie->isCompacted || (uint32_t)c>0x10ffff) { in utrie_get32()
249 block=trie->index[c>>UTRIE_SHIFT]; in utrie_get32()
254 return trie->data[ABS(block)+(c&UTRIE_MASK)]; in utrie_get32()
282 utrie_setRange32(UNewTrie *trie, UChar32 start, UChar32 limit, uint32_t value, UBool overwrite) { in utrie_setRange32() argument
292 if( trie==NULL || trie->isCompacted || in utrie_setRange32()
301 initialValue=trie->data[0]; in utrie_setRange32()
306 block=utrie_getDataBlock(trie, start); in utrie_setRange32()
313 utrie_fillBlock(trie->data+block, start&UTRIE_MASK, UTRIE_DATA_BLOCK_LENGTH, in utrie_setRange32()
317 utrie_fillBlock(trie->data+block, start&UTRIE_MASK, limit&UTRIE_MASK, in utrie_setRange32()
337 block=trie->index[start>>UTRIE_SHIFT]; in utrie_setRange32()
340 … utrie_fillBlock(trie->data+block, 0, UTRIE_DATA_BLOCK_LENGTH, value, initialValue, overwrite); in utrie_setRange32()
341 } else if(trie->data[-block]!=value && (block==0 || overwrite)) { in utrie_setRange32()
344 trie->index[start>>UTRIE_SHIFT]=-repeatBlock; in utrie_setRange32()
347 repeatBlock=utrie_getDataBlock(trie, start); in utrie_setRange32()
353 trie->index[start>>UTRIE_SHIFT]=-repeatBlock; in utrie_setRange32()
354 … utrie_fillBlock(trie->data+repeatBlock, 0, UTRIE_DATA_BLOCK_LENGTH, value, initialValue, TRUE); in utrie_setRange32()
363 block=utrie_getDataBlock(trie, start); in utrie_setRange32()
368 utrie_fillBlock(trie->data+block, 0, rest, value, initialValue, overwrite); in utrie_setRange32()
403 utrie_fold(UNewTrie *trie, UNewTrieGetFoldedValue *getFoldedValue, UErrorCode *pErrorCode) { in utrie_fold() argument
413 idx=trie->index; in utrie_fold()
428 if(trie->leadUnitValue==trie->data[0]) { in utrie_fold()
432 block=utrie_allocDataBlock(trie); in utrie_fold()
438 …utrie_fillBlock(trie->data+block, 0, UTRIE_DATA_BLOCK_LENGTH, trie->leadUnitValue, trie->data[0], … in utrie_fold()
442 trie->index[c]=block; in utrie_fold()
473 value=getFoldedValue(trie, c, block+UTRIE_SURROGATE_BLOCK_COUNT); in utrie_fold()
474 if(value!=utrie_get32(trie, U16_LEAD(c), NULL)) { in utrie_fold()
475 if(!utrie_set32(trie, U16_LEAD(c), value)) { in utrie_fold()
532 trie->indexLength=indexLength; in utrie_fold()
544 _findUnusedBlocks(UNewTrie *trie) { in _findUnusedBlocks() argument
548 uprv_memset(trie->map, 0xff, (UTRIE_MAX_BUILD_TIME_DATA_LENGTH>>UTRIE_SHIFT)*4); in _findUnusedBlocks()
551 for(i=0; i<trie->indexLength; ++i) { in _findUnusedBlocks()
552 trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]=0; in _findUnusedBlocks()
556 trie->map[0]=0; in _findUnusedBlocks()
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) { in utrie_compact() argument
596 if(trie==NULL) { in utrie_compact()
600 if(trie->isCompacted) { in utrie_compact()
607 _findUnusedBlocks(trie); in utrie_compact()
610 if(trie->isLatin1Linear && UTRIE_SHIFT<=8) { in utrie_compact()
617 for(start=newStart; start<trie->dataLength;) { in utrie_compact()
625 if(trie->map[start>>UTRIE_SHIFT]<0) { in utrie_compact()
635 (i=_findSameDataBlock(trie->data, newStart, start, in utrie_compact()
640 trie->map[start>>UTRIE_SHIFT]=i; in utrie_compact()
653 i>0 && !equal_uint32(trie->data+(newStart-i), trie->data+start, i); in utrie_compact()
661 trie->map[start>>UTRIE_SHIFT]=newStart-i; in utrie_compact()
666 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
670 trie->map[start>>UTRIE_SHIFT]=newStart; in utrie_compact()
672 trie->data[newStart++]=trie->data[start++]; in utrie_compact()
675 trie->map[start>>UTRIE_SHIFT]=start; in utrie_compact()
682 for(i=0; i<trie->indexLength; ++i) { in utrie_compact()
683 trie->index[i]=trie->map[ABS(trie->index[i])>>UTRIE_SHIFT]; in utrie_compact()
689 (long)trie->dataLength, (long)newStart); in utrie_compact()
692 trie->dataLength=newStart; in utrie_compact()
719 defaultGetFoldedValue(UNewTrie *trie, UChar32 start, int32_t offset) { in defaultGetFoldedValue() argument
724 initialValue=trie->data[0]; in defaultGetFoldedValue()
727 value=utrie_get32(trie, start, &inBlockZero); in defaultGetFoldedValue()
740 utrie_serialize(UNewTrie *trie, void *dt, int32_t capacity, in utrie_serialize() argument
755 if(trie==NULL || capacity<0 || (capacity>0 && dt==NULL)) { in utrie_serialize()
765 if(!trie->isCompacted) { in utrie_serialize()
767 utrie_compact(trie, FALSE, pErrorCode); in utrie_serialize()
770 utrie_fold(trie, getFoldedValue, pErrorCode); in utrie_serialize()
773 utrie_compact(trie, TRUE, pErrorCode); in utrie_serialize()
775 trie->isCompacted=TRUE; in utrie_serialize()
782 …if( (reduceTo16Bits ? (trie->dataLength+trie->indexLength) : trie->dataLength) >= UTRIE_MAX_DATA_L… in utrie_serialize()
786 length=sizeof(UTrieHeader)+2*trie->indexLength; in utrie_serialize()
788 length+=2*trie->dataLength; in utrie_serialize()
790 length+=4*trie->dataLength; in utrie_serialize()
799 (long)trie->indexLength, (long)trie->dataLength, (long)length); in utrie_serialize()
812 if(trie->isLatin1Linear) { in utrie_serialize()
816 header->indexLength=trie->indexLength; in utrie_serialize()
817 header->dataLength=trie->dataLength; in utrie_serialize()
822 p=(uint32_t *)trie->index; in utrie_serialize()
824 for(i=trie->indexLength; i>0; --i) { in utrie_serialize()
825 *dest16++=(uint16_t)((*p++ + trie->indexLength)>>UTRIE_INDEX_SHIFT); in utrie_serialize()
829 p=trie->data; in utrie_serialize()
830 for(i=trie->dataLength; i>0; --i) { in utrie_serialize()
835 p=(uint32_t *)trie->index; in utrie_serialize()
837 for(i=trie->indexLength; i>0; --i) { in utrie_serialize()
842 uprv_memcpy(dest16, trie->data, 4*trie->dataLength); in utrie_serialize()
855 utrie_unserialize(UTrie *trie, const void *data, int32_t length, UErrorCode *pErrorCode) { in utrie_unserialize() argument
885 trie->isLatin1Linear= (UBool)((options&UTRIE_OPTIONS_LATIN1_IS_LINEAR)!=0); in utrie_unserialize()
888 trie->indexLength=header->indexLength; in utrie_unserialize()
889 trie->dataLength=header->dataLength; in utrie_unserialize()
894 if(length<2*trie->indexLength) { in utrie_unserialize()
899 trie->index=p16; in utrie_unserialize()
900 p16+=trie->indexLength; in utrie_unserialize()
901 length-=2*trie->indexLength; in utrie_unserialize()
905 if(length<4*trie->dataLength) { in utrie_unserialize()
909 trie->data32=(const uint32_t *)p16; in utrie_unserialize()
910 trie->initialValue=trie->data32[0]; in utrie_unserialize()
911 length=(int32_t)sizeof(UTrieHeader)+2*trie->indexLength+4*trie->dataLength; in utrie_unserialize()
913 if(length<2*trie->dataLength) { in utrie_unserialize()
919 trie->data32=NULL; in utrie_unserialize()
920 trie->initialValue=trie->index[trie->indexLength]; in utrie_unserialize()
921 length=(int32_t)sizeof(UTrieHeader)+2*trie->indexLength+2*trie->dataLength; in utrie_unserialize()
924 trie->getFoldingOffset=utrie_defaultGetFoldingOffset; in utrie_unserialize()
930 utrie_unserializeDummy(UTrie *trie, in utrie_unserializeDummy() argument
948 trie->indexLength=UTRIE_BMP_INDEX_LENGTH+UTRIE_SURROGATE_BLOCK_COUNT; in utrie_unserializeDummy()
949 trie->dataLength=latin1Length; in utrie_unserializeDummy()
951 trie->dataLength+=UTRIE_DATA_BLOCK_LENGTH; in utrie_unserializeDummy()
954 actualLength=trie->indexLength*2; in utrie_unserializeDummy()
956 actualLength+=trie->dataLength*2; in utrie_unserializeDummy()
958 actualLength+=trie->dataLength*4; in utrie_unserializeDummy()
967 trie->isLatin1Linear=TRUE; in utrie_unserializeDummy()
968 trie->initialValue=initialValue; in utrie_unserializeDummy()
972 trie->index=p16; in utrie_unserializeDummy()
976 block=(uint16_t)(trie->indexLength>>UTRIE_INDEX_SHIFT); in utrie_unserializeDummy()
977 limit=trie->indexLength; in utrie_unserializeDummy()
992 trie->data32=NULL; in utrie_unserializeDummy()
995 p16+=trie->indexLength; in utrie_unserializeDummy()
1011 uprv_memset(p16, 0, trie->indexLength*2); in utrie_unserializeDummy()
1023 trie->data32=p32=(uint32_t *)(p16+trie->indexLength); in utrie_unserializeDummy()
1039 trie->getFoldingOffset=utrie_defaultGetFoldingOffset; in utrie_unserializeDummy()
1057 utrie_enum(const UTrie *trie, in utrie_enum() argument
1067 if(trie==NULL || trie->index==NULL || enumRange==NULL) { in utrie_enum()
1074 idx=trie->index; in utrie_enum()
1075 data32=trie->data32; in utrie_enum()
1078 initialValue=enumValue(context, trie->initialValue); in utrie_enum()
1081 nullBlock=trie->indexLength; in utrie_enum()
1165 offset=trie->getFoldingOffset(value); in utrie_enum()