X-Git-Url: https://git.saurik.com/apple/icu.git/blobdiff_plain/f3c0d7a59d99c2a94c6b8822291f0e42be3773c9..0f5d89e82340278ed3d7d50029f37cab2c41a57e:/icuSources/tools/gennorm2/n2builder.cpp diff --git a/icuSources/tools/gennorm2/n2builder.cpp b/icuSources/tools/gennorm2/n2builder.cpp index 66ccd700..7b8920d0 100644 --- a/icuSources/tools/gennorm2/n2builder.cpp +++ b/icuSources/tools/gennorm2/n2builder.cpp @@ -32,10 +32,13 @@ #include "unicode/udata.h" #include "unicode/uniset.h" #include "unicode/unistr.h" +#include "unicode/usetiter.h" #include "unicode/ustring.h" #include "charstr.h" +#include "extradata.h" #include "hash.h" #include "normalizer2impl.h" +#include "norms.h" #include "toolutil.h" #include "unewdata.h" #include "utrie2.h" @@ -55,8 +58,8 @@ static UDataInfo dataInfo={ 0, { 0x4e, 0x72, 0x6d, 0x32 }, /* dataFormat="Nrm2" */ - { 2, 0, 0, 0 }, /* formatVersion */ - { 5, 2, 0, 0 } /* dataVersion (Unicode version) */ + { 3, 0, 0, 0 }, /* formatVersion */ + { 10, 0, 0, 0 } /* dataVersion (Unicode version) */ }; U_NAMESPACE_BEGIN @@ -64,8 +67,7 @@ U_NAMESPACE_BEGIN class HangulIterator { public: struct Range { - UChar32 start, limit; - uint16_t norm16; + UChar32 start, end; }; HangulIterator() : rangeIndex(0) {} @@ -76,119 +78,29 @@ public: return NULL; } } - void reset() { rangeIndex=0; } private: static const Range ranges[4]; int32_t rangeIndex; }; const HangulIterator::Range HangulIterator::ranges[4]={ - { Hangul::JAMO_L_BASE, Hangul::JAMO_L_BASE+Hangul::JAMO_L_COUNT, 1 }, - { Hangul::JAMO_V_BASE, Hangul::JAMO_V_BASE+Hangul::JAMO_V_COUNT, Normalizer2Impl::JAMO_VT }, + { Hangul::JAMO_L_BASE, Hangul::JAMO_L_END }, + { Hangul::JAMO_V_BASE, Hangul::JAMO_V_END }, // JAMO_T_BASE+1: not U+11A7 - { Hangul::JAMO_T_BASE+1, Hangul::JAMO_T_BASE+Hangul::JAMO_T_COUNT, Normalizer2Impl::JAMO_VT }, - { Hangul::HANGUL_BASE, Hangul::HANGUL_BASE+Hangul::HANGUL_COUNT, 0 }, // will become minYesNo + { Hangul::JAMO_T_BASE+1, Hangul::JAMO_T_END }, + { Hangul::HANGUL_BASE, Hangul::HANGUL_END }, }; -struct CompositionPair { - CompositionPair(UChar32 t, UChar32 c) : trail(t), composite(c) {} - UChar32 trail, composite; -}; - -struct Norm { - enum MappingType { NONE, REMOVED, ROUND_TRIP, ONE_WAY }; - - UBool hasMapping() const { return mappingType>REMOVED; } - - // Requires hasMapping() and well-formed mapping. - void setMappingCP() { - UChar32 c; - if(!mapping->isEmpty() && mapping->length()==U16_LENGTH(c=mapping->char32At(0))) { - mappingCP=c; - } else { - mappingCP=U_SENTINEL; - } - } - - const CompositionPair *getCompositionPairs(int32_t &length) const { - if(compositions==NULL) { - length=0; - return NULL; - } else { - length=compositions->size()/2; - return reinterpret_cast(compositions->getBuffer()); - } - } - - UnicodeString *mapping; - UnicodeString *rawMapping; // non-NULL if the mapping is further decomposed - UChar32 mappingCP; // >=0 if mapping to 1 code point - int32_t mappingPhase; - MappingType mappingType; - - UVector32 *compositions; // (trail, composite) pairs - uint8_t cc; - UBool combinesBack; - UBool hasNoCompBoundaryAfter; - - enum OffsetType { - OFFSET_NONE, - // Composition for back-combining character. Allowed, but not normally used. - OFFSET_MAYBE_YES, - // Composition for a starter that does not have a decomposition mapping. - OFFSET_YES_YES, - // Round-trip mapping & composition for a starter. - OFFSET_YES_NO_MAPPING_AND_COMPOSITION, - // Round-trip mapping for a starter that itself does not combine-forward. - OFFSET_YES_NO_MAPPING_ONLY, - // One-way mapping. - OFFSET_NO_NO, - // Delta for an algorithmic one-way mapping. - OFFSET_DELTA - }; - enum { OFFSET_SHIFT=4, OFFSET_MASK=(1<rangeHandler(start, end, value); -} - -U_CDECL_END - Normalizer2DataBuilder::Normalizer2DataBuilder(UErrorCode &errorCode) : + norms(errorCode), phase(0), overrideHandling(OVERRIDE_PREVIOUS), optimization(OPTIMIZE_NORMAL), - norm16TrieLength(0) { + norm16Trie(nullptr), norm16TrieLength(0) { memset(unicodeVersion, 0, sizeof(unicodeVersion)); - normTrie=utrie2_open(0, 0, &errorCode); - normMem=utm_open("gennorm2 normalization structs", 10000, 0x110100, sizeof(Norm)); - norms=allocNorm(); // unused Norm struct at index 0 memset(indexes, 0, sizeof(indexes)); memset(smallFCD, 0, sizeof(smallFCD)); } Normalizer2DataBuilder::~Normalizer2DataBuilder() { - utrie2_close(normTrie); - int32_t normsLength=utm_countItems(normMem); - for(int32_t i=1; imappingType!=Norm::NONE) { @@ -271,11 +147,8 @@ void Normalizer2DataBuilder::setOverrideHandling(OverrideHandling oh) { } void Normalizer2DataBuilder::setCC(UChar32 c, uint8_t cc) { - createNorm(c)->cc=cc; -} - -uint8_t Normalizer2DataBuilder::getCC(UChar32 c) const { - return getNormRef(c).cc; + norms.createNorm(c)->cc=cc; + norms.ccSet.add(c); } static UBool isWellFormed(const UnicodeString &s) { @@ -292,10 +165,11 @@ void Normalizer2DataBuilder::setOneWayMapping(UChar32 c, const UnicodeString &m) (int)phase, (long)c); exit(U_INVALID_FORMAT_ERROR); } - Norm *p=checkNormForMapping(createNorm(c), c); + Norm *p=checkNormForMapping(norms.createNorm(c), c); p->mapping=new UnicodeString(m); p->mappingType=Norm::ONE_WAY; p->setMappingCP(); + norms.mappingSet.add(c); } void Normalizer2DataBuilder::setRoundTripMapping(UChar32 c, const UnicodeString &m) { @@ -321,670 +195,310 @@ void Normalizer2DataBuilder::setRoundTripMapping(UChar32 c, const UnicodeString (int)phase, (long)c, (int)numCP); exit(U_INVALID_FORMAT_ERROR); } - Norm *p=checkNormForMapping(createNorm(c), c); + Norm *p=checkNormForMapping(norms.createNorm(c), c); p->mapping=new UnicodeString(m); p->mappingType=Norm::ROUND_TRIP; p->mappingCP=U_SENTINEL; + norms.mappingSet.add(c); } void Normalizer2DataBuilder::removeMapping(UChar32 c) { - Norm *p=checkNormForMapping(getNorm(c), c); - if(p!=NULL) { - p->mappingType=Norm::REMOVED; - } -} - -class CompositionBuilder : public Normalizer2DBEnumerator { -public: - CompositionBuilder(Normalizer2DataBuilder &b) : Normalizer2DBEnumerator(b) {} - virtual UBool rangeHandler(UChar32 start, UChar32 end, uint32_t value) { - builder.addComposition(start, end, value); - return TRUE; - } -}; - -void -Normalizer2DataBuilder::addComposition(UChar32 start, UChar32 end, uint32_t value) { - if(norms[value].mappingType==Norm::ROUND_TRIP) { - if(start!=end) { - fprintf(stderr, - "gennorm2 error: same round-trip mapping for " - "more than 1 code point U+%04lX..U+%04lX\n", - (long)start, (long)end); - exit(U_INVALID_FORMAT_ERROR); - } - if(norms[value].cc!=0) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX has a round-trip mapping and ccc!=0, " - "not possible in Unicode normalization\n", - (long)start); - exit(U_INVALID_FORMAT_ERROR); - } - // setRoundTripMapping() ensured that there are exactly two code points. - const UnicodeString &m=*norms[value].mapping; - UChar32 lead=m.char32At(0); - UChar32 trail=m.char32At(m.length()-1); - if(getCC(lead)!=0) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX's round-trip mapping's starter U+%04lX has ccc!=0, " - "not possible in Unicode normalization\n", - (long)start, (long)lead); - exit(U_INVALID_FORMAT_ERROR); - } - // Flag for trailing character. - createNorm(trail)->combinesBack=TRUE; - // Insert (trail, composite) pair into compositions list for the lead character. - IcuToolErrorCode errorCode("gennorm2/addComposition()"); - Norm *leadNorm=createNorm(lead); - UVector32 *compositions=leadNorm->compositions; - int32_t i; - if(compositions==NULL) { - compositions=leadNorm->compositions=new UVector32(errorCode); - i=0; // "insert" the first pair at index 0 - } else { - // Insertion sort, and check for duplicate trail characters. - int32_t length; - const CompositionPair *pairs=leadNorm->getCompositionPairs(length); - for(i=0; iinsertElementAt(trail, 2*i, errorCode); - compositions->insertElementAt(start, 2*i+1, errorCode); - } -} - -UBool Normalizer2DataBuilder::combinesWithCCBetween(const Norm &norm, - uint8_t lowCC, uint8_t highCC) const { - if((highCC-lowCC)>=2) { - int32_t length; - const CompositionPair *pairs=norm.getCompositionPairs(length); - for(int32_t i=0; imappingType=Norm::REMOVED; + norms.mappingSet.add(c); } -class Decomposer : public Normalizer2DBEnumerator { -public: - Decomposer(Normalizer2DataBuilder &b) : Normalizer2DBEnumerator(b), didDecompose(FALSE) {} - virtual UBool rangeHandler(UChar32 start, UChar32 end, uint32_t value) { - didDecompose|=builder.decompose(start, end, value); - return TRUE; - } - UBool didDecompose; -}; - -UBool -Normalizer2DataBuilder::decompose(UChar32 start, UChar32 end, uint32_t value) { - if(norms[value].hasMapping()) { - Norm &norm=norms[value]; - const UnicodeString &m=*norm.mapping; - UnicodeString *decomposed=NULL; - const UChar *s=toUCharPtr(m.getBuffer()); - int32_t length=m.length(); - int32_t prev, i=0; - UChar32 c; - while(ichar32At(cNorm.mapping->length()-1); - uint8_t cTrailCC=getCC(cTrailChar); - if(cTrailCC>myTrailCC) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX's round-trip mapping's starter " - "U+%04lX decomposes and the " - "inner/earlier tccc=%hu > outer/following tccc=%hu, " - "not possible in Unicode normalization\n", - (long)start, (long)c, - (short)cTrailCC, (short)myTrailCC); - exit(U_INVALID_FORMAT_ERROR); - } - } else { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX's round-trip mapping's non-starter " - "U+%04lX decomposes, " - "not possible in Unicode normalization\n", - (long)start, (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - } - if(decomposed==NULL) { - decomposed=new UnicodeString(m, 0, prev); - } - decomposed->append(*cNorm.mapping); - } else if(Hangul::isHangul(c)) { - UChar buffer[3]; - int32_t hangulLength=Hangul::decompose(c, buffer); - if(norm.mappingType==Norm::ROUND_TRIP && prev!=0) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX's round-trip mapping's non-starter " - "U+%04lX decomposes, " - "not possible in Unicode normalization\n", - (long)start, (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - if(decomposed==NULL) { - decomposed=new UnicodeString(m, 0, prev); - } - decomposed->append(buffer, hangulLength); - } else if(decomposed!=NULL) { - decomposed->append(m, prev, i-prev); - } - } - if(decomposed!=NULL) { - if(norm.rawMapping==NULL) { - // Remember the original mapping when decomposing recursively. - norm.rawMapping=norm.mapping; - } else { - delete norm.mapping; - } - norm.mapping=decomposed; - // Not norm.setMappingCP(); because the original mapping - // is most likely to be encodable as a delta. - return TRUE; - } - } - return FALSE; -} - -class BuilderReorderingBuffer { -public: - BuilderReorderingBuffer() : fLength(0), fLastStarterIndex(-1), fDidReorder(FALSE) {} - void reset() { - fLength=0; - fLastStarterIndex=-1; - fDidReorder=FALSE; - } - int32_t length() const { return fLength; } - UBool isEmpty() const { return fLength==0; } - int32_t lastStarterIndex() const { return fLastStarterIndex; } - UChar32 charAt(int32_t i) const { return fArray[i]>>8; } - uint8_t ccAt(int32_t i) const { return (uint8_t)fArray[i]; } - UBool didReorder() const { return fDidReorder; } - void append(UChar32 c, uint8_t cc) { - if(cc==0 || fLength==0 || ccAt(fLength-1)<=cc) { - if(cc==0) { - fLastStarterIndex=fLength; - } - fArray[fLength++]=(c<<8)|cc; - return; - } - // Let this character bubble back to its canonical order. - int32_t i=fLength-1; - while(i>fLastStarterIndex && ccAt(i)>cc) { - --i; - } - ++i; // after the last starter or prevCC<=cc - // Move this and the following characters forward one to make space. - for(int32_t j=fLength; imapping; - int32_t length=m.length(); - if(length>Normalizer2Impl::MAPPING_LENGTH_MASK) { - return; // writeMapping() will complain about it and print the code point. - } - const UChar *s=toUCharPtr(m.getBuffer()); - int32_t i=0; - UChar32 c; - while(i1) { + // One-way mapping where after the last starter is at least one combining mark + // with a combining class greater than 1, + // which means that another combining mark can reorder before it. + // By contrast, in a round-trip mapping this does not prevent a boundary as long as + // the starter or composite does not combine-forward with a following combining mark. + return FALSE; } UChar32 starter=buffer.charAt(lastStarterIndex); - if( Hangul::isJamoL(starter) || - (Hangul::isJamoV(starter) && - 0compositions==NULL) { - return FALSE; // the last starter does not combine forward + + // Multiple starters can combine into one. + // Look for the first of the last sequence of starters, excluding Jamos. + int32_t i=lastStarterIndex; + UChar32 c; + while(0compositions==nullptr)) { + return TRUE; // The last starter does not combine forward. } - // Compose as far as possible, and see if further compositions are possible. uint8_t prevCC=0; - for(int32_t combMarkIndex=lastStarterIndex+1; combMarkIndexlastStarterIndex && norms.combinesWithCCBetween(*starterNorm, prevCC, cc)) { + // The starter combines with a mark that reorders before the current one. + return FALSE; } - if( prevCC=0 - ) { - buffer.setComposite(starter, combMarkIndex); - starterNorm=&getNormRef(starter); - if(starterNorm->compositions==NULL) { - return FALSE; // the composite does not combine further + UChar32 c=buffer.charAt(i); + if(starterNorm!=nullptr && (prevCCcombine(c))>=0) { + // The starter combines with c into a composite replacement starter. + starterNorm=norms.getNorm(starter); + if(i>=lastStarterIndex && + (starterNorm==nullptr || starterNorm->compositions==nullptr)) { + return TRUE; // The composite does not combine further. } + // Keep prevCC because we "removed" the combining mark. + } else if(cc==0) { + starterNorm=norms.getNorm(c); + if(i==lastStarterIndex && + (starterNorm==nullptr || starterNorm->compositions==nullptr)) { + return TRUE; // The new starter does not combine forward. + } + prevCC=0; } else { prevCC=cc; - ++combMarkIndex; - } - } - // TRUE if the final, forward-combining starter is at the end. - return prevCC==0; -} - -// Requires p->hasMapping(). -// Returns the offset of the "first unit" from the beginning of the extraData for c. -// That is the same as the length of the optional data for the raw mapping and the ccc/lccc word. -int32_t Normalizer2DataBuilder::writeMapping(UChar32 c, const Norm *p, UnicodeString &dataString) { - UnicodeString &m=*p->mapping; - int32_t length=m.length(); - if(length>Normalizer2Impl::MAPPING_LENGTH_MASK) { - fprintf(stderr, - "gennorm2 error: " - "mapping for U+%04lX longer than maximum of %d\n", - (long)c, Normalizer2Impl::MAPPING_LENGTH_MASK); - exit(U_INVALID_FORMAT_ERROR); - } - int32_t leadCC, trailCC; - if(length==0) { - leadCC=trailCC=0; - } else { - leadCC=getCC(m.char32At(0)); - trailCC=getCC(m.char32At(length-1)); - } - if(ccc!=0 || leadCC!=0)) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX below U+0300 has ccc!=0 or lccc!=0, not supported by ICU\n", - (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - // Write small-FCD data. - if((leadCC|trailCC)!=0) { - UChar32 lead= c<=0xffff ? c : U16_LEAD(c); - smallFCD[lead>>8]|=(uint8_t)1<<((lead>>5)&7); - } - // Write the mapping & raw mapping extraData. - int32_t firstUnit=length|(trailCC<<8); - int32_t preMappingLength=0; - if(p->rawMapping!=NULL) { - UnicodeString &rm=*p->rawMapping; - int32_t rmLength=rm.length(); - if(rmLength>Normalizer2Impl::MAPPING_LENGTH_MASK) { - fprintf(stderr, - "gennorm2 error: " - "raw mapping for U+%04lX longer than maximum of %d\n", - (long)c, Normalizer2Impl::MAPPING_LENGTH_MASK); - exit(U_INVALID_FORMAT_ERROR); - } - UChar rm0=rm.charAt(0); - if( rmLength==length-1 && - // 99: overlong substring lengths get pinned to remainder lengths anyway - 0==rm.compare(1, 99, m, 2, 99) && - rm0>Normalizer2Impl::MAPPING_LENGTH_MASK - ) { - // Compression: - // rawMapping=rm0+mapping.substring(2) -> store only rm0 - // - // The raw mapping is the same as the final mapping after replacing - // the final mapping's first two code units with the raw mapping's first one. - // In this case, we store only that first unit, rm0. - // This helps with a few hundred mappings. - dataString.append(rm0); - preMappingLength=1; - } else { - // Store the raw mapping with its length. - dataString.append(rm); - dataString.append((UChar)rmLength); - preMappingLength=rmLength+1; } - firstUnit|=Normalizer2Impl::MAPPING_HAS_RAW_MAPPING; } - int32_t cccLccc=p->cc|(leadCC<<8); - if(cccLccc!=0) { - dataString.append((UChar)cccLccc); - ++preMappingLength; - firstUnit|=Normalizer2Impl::MAPPING_HAS_CCC_LCCC_WORD; + if(prevCC==0) { + return FALSE; // forward-combining starter at the very end } - if(p->hasNoCompBoundaryAfter) { - firstUnit|=Normalizer2Impl::MAPPING_NO_COMP_BOUNDARY_AFTER; + if(norms.combinesWithCCBetween(*starterNorm, prevCC, 256)) { + // The starter combines with another mark. + return FALSE; } - dataString.append((UChar)firstUnit); - dataString.append(m); - return preMappingLength; + return TRUE; } -// Requires p->compositions!=NULL. -void Normalizer2DataBuilder::writeCompositions(UChar32 c, const Norm *p, UnicodeString &dataString) { - if(p->cc!=0) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX combines-forward and has ccc!=0, not possible in Unicode normalization\n", - (long)c); - exit(U_INVALID_FORMAT_ERROR); +UBool Normalizer2DataBuilder::mappingRecomposes(const BuilderReorderingBuffer &buffer) const { + if(buffer.lastStarterIndex()<0) { + return FALSE; // no starter } - int32_t length; - const CompositionPair *pairs=p->getCompositionPairs(length); - for(int32_t i=0; icombine(c)>=0) { + return TRUE; // normal composite + } else if(cc==0) { + if(Hangul::isJamoL(c)) { + if((i+1)>16; - thirdUnit=compositeAndFwd; + starterNorm=norms.getNorm(c); } - } else { - firstUnit=(Normalizer2Impl::COMP_1_TRAIL_LIMIT+ - (pair.trail>>Normalizer2Impl::COMP_1_TRAIL_SHIFT))| - Normalizer2Impl::COMP_1_TRIPLE; - secondUnit=(pair.trail<>16); - thirdUnit=compositeAndFwd; - } - // Set the high bit of the first unit if this is the last composition pair. - if(i==(length-1)) { - firstUnit|=Normalizer2Impl::COMP_1_LAST_TUPLE; - } - dataString.append((UChar)firstUnit).append((UChar)secondUnit); - if(thirdUnit>=0) { - dataString.append((UChar)thirdUnit); } + prevCC=cc; } + return FALSE; } -class ExtraDataWriter : public Normalizer2DBEnumerator { -public: - ExtraDataWriter(Normalizer2DataBuilder &b) : - Normalizer2DBEnumerator(b), - yesYesCompositions(1000, (UChar32)0xffff, 2), // 0=inert, 1=Jamo L, 2=start of compositions - yesNoMappingsAndCompositions(1000, (UChar32)0, 1) {} // 0=Hangul, 1=start of normal data - virtual UBool rangeHandler(UChar32 start, UChar32 end, uint32_t value) { - if(value!=0) { - if(start!=end) { - fprintf(stderr, - "gennorm2 error: unexpected shared data for " - "multiple code points U+%04lX..U+%04lX\n", - (long)start, (long)end); - exit(U_INTERNAL_PROGRAM_ERROR); - } - builder.writeExtraData(start, value, *this); - } - return TRUE; - } - UnicodeString maybeYesCompositions; - UnicodeString yesYesCompositions; - UnicodeString yesNoMappingsAndCompositions; - UnicodeString yesNoMappingsOnly; - UnicodeString noNoMappings; - Hashtable previousNoNoMappings; // If constructed in runtime code, pass in UErrorCode. -}; - -void Normalizer2DataBuilder::writeExtraData(UChar32 c, uint32_t value, ExtraDataWriter &writer) { - Norm *p=norms+value; - if(!p->hasMapping()) { - // Write small-FCD data. - // There is similar code in writeMapping() for characters that do have a mapping. - if(ccc!=0) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX below U+0300 has ccc!=0, not supported by ICU\n", - (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - if(p->cc!=0) { - UChar32 lead= c<=0xffff ? c : U16_LEAD(c); - smallFCD[lead>>8]|=(uint8_t)1<<((lead>>5)&7); - } - } - if(p->combinesBack) { - if(p->hasMapping()) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX combines-back and decomposes, not possible in Unicode normalization\n", - (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - if(p->compositions!=NULL) { - p->offset= - (writer.maybeYesCompositions.length()<length()>Normalizer2Impl::MAPPING_LENGTH_MASK) { + norm.error="mapping longer than maximum of 31"; + return; } - } else if(!p->hasMapping()) { - if(p->compositions!=NULL) { - p->offset= - (writer.yesYesCompositions.length()<mappingType==Norm::ROUND_TRIP) { - if(p->compositions!=NULL) { - int32_t offset=writer.yesNoMappingsAndCompositions.length()+ - writeMapping(c, p, writer.yesNoMappingsAndCompositions); - p->offset=(offset<offset=(offset<compositions!=NULL) { - fprintf(stderr, - "gennorm2 error: " - "U+%04lX combines-forward and has a one-way mapping, " - "not possible in Unicode normalization\n", - (long)c); - exit(U_INVALID_FORMAT_ERROR); - } - if(p->cc==0 && optimization!=OPTIMIZE_FAST) { - // Try a compact, algorithmic encoding. - // Only for ccc=0, because we can't store additional information - // and we do not recursively follow an algorithmic encoding for access to the ccc. - // - // Also, if hasNoCompBoundaryAfter is set, we can only use the algorithmic encoding - // if the mappingCP decomposes further, to ensure that there is a place to store it. - // We want to see that the final mapping does not have exactly 1 code point, - // or else we would have to recursively ensure that the final mapping is stored - // in normal extraData. - if(p->mappingCP>=0 && (!p->hasNoCompBoundaryAfter || 1!=p->mapping->countChar32())) { - int32_t delta=p->mappingCP-c; - if(-Normalizer2Impl::MAX_DELTA<=delta && delta<=Normalizer2Impl::MAX_DELTA) { - p->offset=(delta<offset==0) { - int32_t oldNoNoLength=writer.noNoMappings.length(); - int32_t offset=oldNoNoLength+writeMapping(c, p, writer.noNoMappings); - UnicodeString newMapping=writer.noNoMappings.tempSubString(oldNoNoLength); - int32_t previousOffset=writer.previousNoNoMappings.geti(newMapping); - if(previousOffset!=0) { - // Duplicate, remove the new units and point to the old ones. - writer.noNoMappings.truncate(oldNoNoLength); - p->offset=((previousOffset-1)<offset=(offset<offset>>Norm::OFFSET_SHIFT; - int32_t norm16=0; - UBool isDecompNo=FALSE; - UBool isCompNoMaybe=FALSE; - switch(p->offset&Norm::OFFSET_MASK) { - case Norm::OFFSET_NONE: - // No mapping, no compositions list. - if(p->combinesBack) { - norm16=Normalizer2Impl::MIN_NORMAL_MAYBE_YES+p->cc; - isDecompNo=(UBool)(p->cc!=0); - isCompNoMaybe=TRUE; - } else if(p->cc!=0) { - norm16=Normalizer2Impl::MIN_YES_YES_WITH_CC-1+p->cc; - isDecompNo=isCompNoMaybe=TRUE; +void Normalizer2DataBuilder::setSmallFCD(UChar32 c) { + UChar32 lead= c<=0xffff ? c : U16_LEAD(c); + smallFCD[lead>>8]|=(uint8_t)1<<((lead>>5)&7); +} + +void Normalizer2DataBuilder::writeNorm16(UChar32 start, UChar32 end, Norm &norm) { + if((norm.leadCC|norm.trailCC)!=0) { + for(UChar32 c=start; c<=end; ++c) { + setSmallFCD(c); + } + } + + int32_t norm16; + switch(norm.type) { + case Norm::INERT: + norm16=Normalizer2Impl::INERT; + break; + case Norm::YES_YES_COMBINES_FWD: + norm16=norm.offset*2; + break; + case Norm::YES_NO_COMBINES_FWD: + norm16=indexes[Normalizer2Impl::IX_MIN_YES_NO]+norm.offset*2; + break; + case Norm::YES_NO_MAPPING_ONLY: + norm16=indexes[Normalizer2Impl::IX_MIN_YES_NO_MAPPINGS_ONLY]+norm.offset*2; + break; + case Norm::NO_NO_COMP_YES: + norm16=indexes[Normalizer2Impl::IX_MIN_NO_NO]+norm.offset*2; + break; + case Norm::NO_NO_COMP_BOUNDARY_BEFORE: + norm16=indexes[Normalizer2Impl::IX_MIN_NO_NO_COMP_BOUNDARY_BEFORE]+norm.offset*2; + break; + case Norm::NO_NO_COMP_NO_MAYBE_CC: + norm16=indexes[Normalizer2Impl::IX_MIN_NO_NO_COMP_NO_MAYBE_CC]+norm.offset*2; + break; + case Norm::NO_NO_EMPTY: + norm16=indexes[Normalizer2Impl::IX_MIN_NO_NO_EMPTY]+norm.offset*2; + break; + case Norm::NO_NO_DELTA: + { + // Positive offset from minNoNoDelta, shifted left for additional bits. + int32_t offset=(norm.offset+Normalizer2Impl::MAX_DELTA)<=Norm::NO_NO_COMP_YES; + if(isCompNoMaybe && startstart; climit; ++c) { - if(utrie2_get32(norm16Trie, c)!=0) { + for(UChar32 c=range->start; c<=range->end; ++c) { + if(utrie2_get32(norm16Trie, c)>Normalizer2Impl::INERT) { fprintf(stderr, "gennorm2 error: " "illegal mapping/composition/ccc data for Hangul or Jamo U+%04lX\n", @@ -1005,32 +519,62 @@ void Normalizer2DataBuilder::setHangulData() { } // Set data for algorithmic runtime handling. IcuToolErrorCode errorCode("gennorm2/setHangulData()"); - hi.reset(); - while((range=hi.nextRange())!=NULL) { - uint16_t norm16=range->norm16; - if(norm16==0) { - norm16=(uint16_t)indexes[Normalizer2Impl::IX_MIN_YES_NO]; // Hangul LV/LVT encoded as minYesNo - if(range->startstart; - } - } else { - if(range->startstart; - } - } - utrie2_setRange32(norm16Trie, range->start, range->limit-1, norm16, TRUE, errorCode); - errorCode.assertSuccess(); + + // Jamo V/T are maybeYes + if(Hangul::JAMO_V_BASE*pMaxValue) { - *pMaxValue=value; + Norm16Summary *p=(Norm16Summary *)context; + if(value>p->maxNorm16) { + p->maxNorm16=value; } + p->andedNorm16&=value; return TRUE; } @@ -1038,67 +582,64 @@ U_CDECL_END void Normalizer2DataBuilder::processData() { IcuToolErrorCode errorCode("gennorm2/processData()"); - norm16Trie=utrie2_open(0, 0, errorCode); + norm16Trie=utrie2_open(Normalizer2Impl::INERT, Normalizer2Impl::INERT, errorCode); errorCode.assertSuccess(); - utrie2_enum(normTrie, NULL, enumRangeHandler, CompositionBuilder(*this).ptr()); + // Build composition lists before recursive decomposition, + // so that we still have the raw, pair-wise mappings. + CompositionBuilder compBuilder(norms); + norms.enumRanges(compBuilder); - Decomposer decomposer(*this); + // Recursively decompose all mappings. + Decomposer decomposer(norms); do { decomposer.didDecompose=FALSE; - utrie2_enum(normTrie, NULL, enumRangeHandler, &decomposer); + norms.enumRanges(decomposer); } while(decomposer.didDecompose); - BuilderReorderingBuffer buffer; - int32_t normsLength=utm_countItems(normMem); + // Set the Norm::Type and other properties. + int32_t normsLength=norms.length(); for(int32_t i=1; iminNoNoDelta) { fprintf(stderr, "gennorm2 error: " @@ -1106,13 +647,22 @@ void Normalizer2DataBuilder::processData() { exit(U_BUFFER_OVERFLOW_ERROR); } - utrie2_enum(normTrie, NULL, enumRangeHandler, Norm16Writer(*this).ptr()); + // writeNorm16() and setHangulData() reduce these as needed. + indexes[Normalizer2Impl::IX_MIN_DECOMP_NO_CP]=0x110000; + indexes[Normalizer2Impl::IX_MIN_COMP_NO_MAYBE_CP]=0x110000; + indexes[Normalizer2Impl::IX_MIN_LCCC_CP]=0x110000; + + // Map each code point to its norm16 value, + // including the properties that fit directly, + // and the offset to the "extra data" if necessary. + Norm16Writer norm16Writer(norms, *this); + norms.enumRanges(norm16Writer); setHangulData(); // Look for the "worst" norm16 value of any supplementary code point // corresponding to a lead surrogate, and set it as that surrogate's value. - // Enables quick check inner loops to look at only code units. + // Enables UTF-16 quick check inner loops to look at only code units. // // We could be more sophisticated: // We could collect a bit set for whether there are values in the different @@ -1121,17 +671,21 @@ void Normalizer2DataBuilder::processData() { // inner loops if necessary. // However, that seems like overkill for an optimization for supplementary characters. for(UChar lead=0xd800; lead<0xdc00; ++lead) { - uint32_t maxValue=utrie2_get32(norm16Trie, lead); - utrie2_enumForLeadSurrogate(norm16Trie, lead, NULL, enumRangeMaxValue, &maxValue); - if( maxValue>=(uint32_t)indexes[Normalizer2Impl::IX_LIMIT_NO_NO] && - maxValue>(uint32_t)indexes[Normalizer2Impl::IX_MIN_NO_NO] - ) { + uint32_t surrogateCPNorm16=utrie2_get32(norm16Trie, lead); + Norm16Summary summary={ surrogateCPNorm16, surrogateCPNorm16 }; + utrie2_enumForLeadSurrogate(norm16Trie, lead, NULL, enumRangeMaxValue, &summary); + uint32_t norm16=summary.maxNorm16; + if(norm16>=(uint32_t)indexes[Normalizer2Impl::IX_LIMIT_NO_NO] && + norm16>(uint32_t)indexes[Normalizer2Impl::IX_MIN_NO_NO]) { // Set noNo ("worst" value) if it got into "less-bad" maybeYes or ccc!=0. // Otherwise it might end up at something like JAMO_VT which stays in // the inner decomposition quick check loop. - maxValue=(uint32_t)indexes[Normalizer2Impl::IX_LIMIT_NO_NO]-1; + norm16=(uint32_t)indexes[Normalizer2Impl::IX_LIMIT_NO_NO]-1; } - utrie2_set32ForLeadSurrogateCodeUnit(norm16Trie, lead, maxValue, errorCode); + norm16= + (norm16&~Normalizer2Impl::HAS_COMP_BOUNDARY_AFTER)| + (summary.andedNorm16&Normalizer2Impl::HAS_COMP_BOUNDARY_AFTER); + utrie2_set32ForLeadSurrogateCodeUnit(norm16Trie, lead, norm16, errorCode); } // Adjust supplementary minimum code points to break quick check loops at their lead surrogates. @@ -1146,6 +700,10 @@ void Normalizer2DataBuilder::processData() { if(minCP>=0x10000) { indexes[Normalizer2Impl::IX_MIN_COMP_NO_MAYBE_CP]=U16_LEAD(minCP); } + minCP=indexes[Normalizer2Impl::IX_MIN_LCCC_CP]; + if(minCP>=0x10000) { + indexes[Normalizer2Impl::IX_MIN_LCCC_CP]=U16_LEAD(minCP); + } utrie2_freeze(norm16Trie, UTRIE2_16_VALUE_BITS, errorCode); norm16TrieLength=utrie2_serialize(norm16Trie, NULL, 0, errorCode); @@ -1175,10 +733,15 @@ void Normalizer2DataBuilder::processData() { printf("size of binary data file contents: %5ld bytes\n", (long)totalSize); printf("minDecompNoCodePoint: U+%04lX\n", (long)indexes[Normalizer2Impl::IX_MIN_DECOMP_NO_CP]); printf("minCompNoMaybeCodePoint: U+%04lX\n", (long)indexes[Normalizer2Impl::IX_MIN_COMP_NO_MAYBE_CP]); - printf("minYesNo: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_YES_NO]); + printf("minLcccCodePoint: U+%04lX\n", (long)indexes[Normalizer2Impl::IX_MIN_LCCC_CP]); + printf("minYesNo: (with compositions) 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_YES_NO]); printf("minYesNoMappingsOnly: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_YES_NO_MAPPINGS_ONLY]); - printf("minNoNo: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_NO_NO]); + printf("minNoNo: (comp-normalized) 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_NO_NO]); + printf("minNoNoCompBoundaryBefore: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_NO_NO_COMP_BOUNDARY_BEFORE]); + printf("minNoNoCompNoMaybeCC: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_NO_NO_COMP_NO_MAYBE_CC]); + printf("minNoNoEmpty: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_NO_NO_EMPTY]); printf("limitNoNo: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_LIMIT_NO_NO]); + printf("minNoNoDelta: 0x%04x\n", (int)minNoNoDelta); printf("minMaybeYes: 0x%04x\n", (int)indexes[Normalizer2Impl::IX_MIN_MAYBE_YES]); } @@ -1274,13 +837,6 @@ Normalizer2DataBuilder::writeCSourceFile(const char *filename) { line, smallFCD, 8, sizeof(smallFCD), "\n};\n\n"); - /*fputs( // TODO - "static const UCaseProps %s_singleton={\n" - " NULL,\n" - " %s_indexes,\n" - " %s_extraData,\n" - " %s_smallFCD,\n", - f);*/ sprintf(line, "static const UTrie2 %s_trie={\n", dataName.data()); char line2[100]; sprintf(line2, "%s_trieIndex", dataName.data()); @@ -1292,6 +848,198 @@ Normalizer2DataBuilder::writeCSourceFile(const char *filename) { fclose(f); } +namespace { + +bool equalStrings(const UnicodeString *s1, const UnicodeString *s2) { + if(s1 == nullptr) { + return s2 == nullptr; + } else if(s2 == nullptr) { + return false; + } else { + return *s1 == *s2; + } +} + +const char *typeChars = "?-=>"; + +void writeMapping(FILE *f, const UnicodeString *m) { + if(m != nullptr && !m->isEmpty()) { + int32_t i = 0; + UChar32 c = m->char32At(i); + fprintf(f, "%04lX", (long)c); + while((i += U16_LENGTH(c)) < m->length()) { + c = m->char32At(i); + fprintf(f, " %04lX", (long)c); + } + } + fputs("\n", f); +} + +} // namespace + +void +Normalizer2DataBuilder::writeDataFile(const char *filename, bool writeRemoved) const { + // Do not processData() before writing the input-syntax data file. + FILE *f = fopen(filename, "w"); + if(f == nullptr) { + fprintf(stderr, "gennorm2/writeDataFile() error: unable to create the output file %s\n", + filename); + exit(U_FILE_ACCESS_ERROR); + return; + } + + if(unicodeVersion[0] != 0 || unicodeVersion[1] != 0 || + unicodeVersion[2] != 0 || unicodeVersion[3] != 0) { + char uv[U_MAX_VERSION_STRING_LENGTH]; + u_versionToString(unicodeVersion, uv); + fprintf(f, "* Unicode %s\n\n", uv); + } + + UnicodeSetIterator ccIter(norms.ccSet); + UChar32 start = U_SENTINEL; + UChar32 end = U_SENTINEL; + uint8_t prevCC = 0; + bool done = false; + bool didWrite = false; + do { + UChar32 c; + uint8_t cc; + if(ccIter.next() && !ccIter.isString()) { + c = ccIter.getCodepoint(); + cc = norms.getCC(c); + } else { + c = 0x110000; + cc = 0; + done = true; + } + if(cc == prevCC && c == (end + 1)) { + end = c; + } else { + if(prevCC != 0) { + if(start == end) { + fprintf(f, "%04lX:%d\n", (long)start, (int)prevCC); + } else { + fprintf(f, "%04lX..%04lX:%d\n", (long)start, (long)end, (int)prevCC); + } + didWrite = true; + } + start = end = c; + prevCC = cc; + } + } while(!done); + if(didWrite) { + fputs("\n", f); + } + + UnicodeSetIterator mIter(norms.mappingSet); + start = U_SENTINEL; + end = U_SENTINEL; + const UnicodeString *prevMapping = nullptr; + Norm::MappingType prevType = Norm::NONE; + done = false; + do { + UChar32 c; + const Norm *norm; + if(mIter.next() && !mIter.isString()) { + c = mIter.getCodepoint(); + norm = norms.getNorm(c); + } else { + c = 0x110000; + norm = nullptr; + done = true; + } + const UnicodeString *mapping; + Norm::MappingType type; + if(norm == nullptr) { + mapping = nullptr; + type = Norm::NONE; + } else { + type = norm->mappingType; + if(type == Norm::NONE) { + mapping = nullptr; + } else { + mapping = norm->mapping; + } + } + if(type == prevType && equalStrings(mapping, prevMapping) && c == (end + 1)) { + end = c; + } else { + if(writeRemoved ? prevType != Norm::NONE : prevType > Norm::REMOVED) { + if(start == end) { + fprintf(f, "%04lX%c", (long)start, typeChars[prevType]); + } else { + fprintf(f, "%04lX..%04lX%c", (long)start, (long)end, typeChars[prevType]); + } + writeMapping(f, prevMapping); + } + start = end = c; + prevMapping = mapping; + prevType = type; + } + } while(!done); + + fclose(f); +} + +void +Normalizer2DataBuilder::computeDiff(const Normalizer2DataBuilder &b1, + const Normalizer2DataBuilder &b2, + Normalizer2DataBuilder &diff) { + // Compute diff = b1 - b2 + // so that we should be able to get b1 = b2 + diff. + if(0 != memcmp(b1.unicodeVersion, b2.unicodeVersion, U_MAX_VERSION_LENGTH)) { + memcpy(diff.unicodeVersion, b1.unicodeVersion, U_MAX_VERSION_LENGTH); + } + + UnicodeSet ccSet(b1.norms.ccSet); + ccSet.addAll(b2.norms.ccSet); + UnicodeSetIterator ccIter(ccSet); + while(ccIter.next() && !ccIter.isString()) { + UChar32 c = ccIter.getCodepoint(); + uint8_t cc1 = b1.norms.getCC(c); + uint8_t cc2 = b2.norms.getCC(c); + if(cc1 != cc2) { + diff.setCC(c, cc1); + } + } + + UnicodeSet mSet(b1.norms.mappingSet); + mSet.addAll(b2.norms.mappingSet); + UnicodeSetIterator mIter(mSet); + while(mIter.next() && !mIter.isString()) { + UChar32 c = mIter.getCodepoint(); + const Norm *norm1 = b1.norms.getNorm(c); + const Norm *norm2 = b2.norms.getNorm(c); + const UnicodeString *mapping1; + Norm::MappingType type1; + if(norm1 == nullptr || !norm1->hasMapping()) { + mapping1 = nullptr; + type1 = Norm::NONE; + } else { + mapping1 = norm1->mapping; + type1 = norm1->mappingType; + } + const UnicodeString *mapping2; + Norm::MappingType type2; + if(norm2 == nullptr || !norm2->hasMapping()) { + mapping2 = nullptr; + type2 = Norm::NONE; + } else { + mapping2 = norm2->mapping; + type2 = norm2->mappingType; + } + if(type1 == type2 && equalStrings(mapping1, mapping2)) { + // Nothing to do. + } else if(type1 == Norm::NONE) { + diff.removeMapping(c); + } else if(type1 == Norm::ROUND_TRIP) { + diff.setRoundTripMapping(c, *mapping1); + } else if(type1 == Norm::ONE_WAY) { + diff.setOneWayMapping(c, *mapping1); + } + } +} + U_NAMESPACE_END #endif /* #if !UCONFIG_NO_NORMALIZATION */