Lines Matching full:countstates
189 if(states->countStates==MBCS_MAX_STATE_COUNT) {
194 error=parseState(s, states->stateTable[states->countStates],
195 &states->stateFlags[states->countStates]);
201 ++states->countStates;
342 * This is achieved in at most countStates iterations.
345 for(count=states->countStates; !allStatesReady && count>=0; --count) {
347 for(state=states->countStates-1; state>=0; --state) {
406 for(state=1; state<states->countStates; ++state) {
432 if(states->countStates==0) {
492 for(state=0; state<states->countStates; ++state) {
529 for(state=states->countStates-1; state>=0; --state) {
532 if((uint8_t)MBCS_ENTRY_STATE(entry)>=states->countStates) {
550 if(states->countStates>=2 && (states->stateFlags[1]&0xf)==MBCS_STATE_FLAG_DIRECT) {
555 if(states->countStates<3) {
556 fprintf(stderr, "ucm error: SI/SO codepages must have at least 3 states (not %x)\n", (int)states->countStates);
577 while(state<states->countStates) {
642 for(i=1; i<states->countStates; ++i) {
697 if(states->countStates>=MBCS_MAX_STATE_COUNT) {
703 oldStateTable=(int32_t (*)[256])uprv_malloc(states->countStates*1024);
708 uprv_memcpy(oldStateTable, states->stateTable, states->countStates*1024);
715 newState=states->countStates++;
739 for(i=0; i<states->countStates; ++i) {
760 --states->countStates;
761 uprv_memcpy(states->stateTable, oldStateTable, states->countStates*1024);
779 for(leadState=0; leadState<states->countStates; ++leadState) {
903 for(state=0; state<states->countStates; ++state) {
931 for(state=0; state<states->countStates; ++state) {
982 if(states->countStates==0) {
