Lines Matching defs:maxCharLength
30 * Reduce tests for maxCharLength.
137 * Assume maxCharLength>1.
190 int32_t i, sum, maxCharLength,
215 maxCharLength=mbcsData->ucm->states.maxCharLength;
218 if(maxCharLength==1) {
222 /* allocate 1M * maxCharLength bytes for at most 1M mappings */
223 sum=0x100000*maxCharLength;
281 * MBCS: indexes need to be multiplied by 16*maxCharLength, indexes increment by 1
284 if(maxCharLength==1) {
309 mbcsData->stage3Top=(stage3NullLength+stage3AllocLength)*maxCharLength; /* ==sum*maxCharLength */
577 * We assume that length<=maxCharLength and that c<=0x10ffff.
683 int32_t maxCharLength;
687 maxCharLength=mbcsData->ucm->states.maxCharLength;
708 * We assume that length<=maxCharLength and that c<=0x10ffff.
752 blockSize=MBCS_UTF8_STAGE_3_BLOCK_SIZE*maxCharLength;
755 blockSize=MBCS_STAGE_3_BLOCK_SIZE*maxCharLength;
766 maxOverlap=(nextOffset&~(MBCS_STAGE_3_GRANULARITY-1))*maxCharLength;
771 overlap=(overlap/MBCS_STAGE_3_GRANULARITY)/maxCharLength;
772 overlap=(overlap*MBCS_STAGE_3_GRANULARITY)*maxCharLength;
778 if(newTop>MBCS_STAGE_3_MBCS_SIZE*(uint32_t)maxCharLength) {
783 /* each block has 16*maxCharLength bytes */
786 mbcsData->stage2[i++]=(newBlock/MBCS_STAGE_3_GRANULARITY)/maxCharLength;
787 newBlock+=MBCS_STAGE_3_BLOCK_SIZE*maxCharLength;
845 p=stage3+(stage3Index+nextOffset)*maxCharLength;
846 switch(maxCharLength) {
940 int32_t i, maxCharLength;
953 maxCharLength=mbcsData->ucm->states.maxCharLength;
963 if(SMALL && maxCharLength>1) {
968 if(SMALL && maxCharLength>1) {
1018 if(maxCharLength==1) {
1029 if(maxCharLength==1) {
1042 if(maxCharLength>1 && m->bLen==1) {
1070 oldLength=mbcsData->ucm->states.maxCharLength;
1327 int32_t maxCharLength, stage3Width;
1330 stage3Width=maxCharLength=states->maxCharLength;
1353 if(maxCharLength==1) {
1365 maxCharLength==1 ? "16" : "32",
1381 if(maxCharLength==1) {
1450 if(mbcsData->ucm->states.maxCharLength==1) {
1540 if(mbcsData->ucm->states.maxCharLength==1) {
