Lines Matching defs:maxCharLength
32 * Reduce tests for maxCharLength.
139 * Assume maxCharLength>1.
192 int32_t i, sum, maxCharLength,
217 maxCharLength=mbcsData->ucm->states.maxCharLength;
220 if(maxCharLength==1) {
224 /* allocate 1M * maxCharLength bytes for at most 1M mappings */
225 sum=0x100000*maxCharLength;
283 * MBCS: indexes need to be multiplied by 16*maxCharLength, indexes increment by 1
286 if(maxCharLength==1) {
311 mbcsData->stage3Top=(stage3NullLength+stage3AllocLength)*maxCharLength; /* ==sum*maxCharLength */
579 * We assume that length<=maxCharLength and that c<=0x10ffff.
685 int32_t maxCharLength;
689 maxCharLength=mbcsData->ucm->states.maxCharLength;
710 * We assume that length<=maxCharLength and that c<=0x10ffff.
754 blockSize=MBCS_UTF8_STAGE_3_BLOCK_SIZE*maxCharLength;
757 blockSize=MBCS_STAGE_3_BLOCK_SIZE*maxCharLength;
768 maxOverlap=(nextOffset&~(MBCS_STAGE_3_GRANULARITY-1))*maxCharLength;
773 overlap=(overlap/MBCS_STAGE_3_GRANULARITY)/maxCharLength;
774 overlap=(overlap*MBCS_STAGE_3_GRANULARITY)*maxCharLength;
780 if(newTop>MBCS_STAGE_3_MBCS_SIZE*(uint32_t)maxCharLength) {
785 /* each block has 16*maxCharLength bytes */
788 mbcsData->stage2[i++]=(newBlock/MBCS_STAGE_3_GRANULARITY)/maxCharLength;
789 newBlock+=MBCS_STAGE_3_BLOCK_SIZE*maxCharLength;
850 p=stage3+(stage3Index+nextOffset)*maxCharLength;
851 switch(maxCharLength) {
945 int32_t i, maxCharLength;
958 maxCharLength=mbcsData->ucm->states.maxCharLength;
968 if(SMALL && maxCharLength>1) {
973 if(SMALL && maxCharLength>1) {
1024 if(maxCharLength==1) {
1035 if(maxCharLength==1) {
1048 if(maxCharLength>1 && m->bLen==1) {
1081 oldLength=mbcsData->ucm->states.maxCharLength;
1338 int32_t maxCharLength, stage3Width;
1341 stage3Width=maxCharLength=states->maxCharLength;
1364 if(maxCharLength==1) {
1376 maxCharLength==1 ? "16" : "32",
1392 if(maxCharLength==1) {
1461 if(mbcsData->ucm->states.maxCharLength==1) {
1551 if(mbcsData->ucm->states.maxCharLength==1) {
