• Home
  • Raw
  • Download

Lines Matching refs:levels

98     UBiDiLevel *levels=pBiDi->levels;  in setTrailingWSStart()  local
118 while(start>0 && levels[start-1]==paraLevel) { in setTrailingWSStart()
173 pLineBiDi->levels=pParaBiDi->levels+start; in ubidi_setLine()
193 const UBiDiLevel *levels=pLineBiDi->levels; in ubidi_setLine() local
206 level=(UBiDiLevel)(levels[0]&1); in ubidi_setLine()
220 } else if((levels[i]&1)!=level) { in ubidi_setLine()
260 return pBiDi->levels[charIndex]; in ubidi_getLevelAt()
276 return pBiDi->levels; in ubidi_getLevels()
287 UBiDiLevel *levels=pBiDi->levelsMemory; in ubidi_getLevels() local
289 if(start>0 && levels!=pBiDi->levels) { in ubidi_getLevels()
290 uprv_memcpy(levels, pBiDi->levels, start); in ubidi_getLevels()
294 uprv_memset(levels+start, pBiDi->paraLevel, length-start); in ubidi_getLevels()
298 return pBiDi->levels=levels; in ubidi_getLevels()
346 *pLevel=pBiDi->levels[logicalPosition]; in ubidi_getLogicalRun()
441 UBiDiLevel *levels; in reorderLine() local
457 levels=pBiDi->levels; in reorderLine()
472 while(firstRun<runCount && levels[runs[firstRun].logicalStart]<maxLevel) { in reorderLine()
480 … for(limitRun=firstRun; ++limitRun<runCount && levels[runs[limitRun].logicalStart]>=maxLevel;) {} in reorderLine()
568 UBiDiLevel *levels=pBiDi->levels; in ubidi_getRuns() local
587 if(levels[i]!=level) { in ubidi_getRuns()
589 level=levels[i]; in ubidi_getRuns()
599 getSingleRun(pBiDi, levels[0]); in ubidi_getRuns()
631 level=levels[i]; in ubidi_getRuns()
640 while(++i<limit && levels[i]==level) {} in ubidi_getRuns()
670 ADD_ODD_BIT_FROM_LEVEL(runs[i].logicalStart, levels[runs[i].logicalStart]); in ubidi_getRuns()
714 prepareReorder(const UBiDiLevel *levels, int32_t length, in prepareReorder() argument
720 if(levels==NULL || length<=0) { in prepareReorder()
728 level=levels[--start]; in prepareReorder()
754 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderLogical() argument
758 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderLogical()
778 while(start<length && levels[start]<maxLevel) { in ubidi_reorderLogical()
786 for(limit=start; ++limit<length && levels[limit]>=maxLevel;) {} in ubidi_reorderLogical()
817 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) { in ubidi_reorderVisual() argument
821 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) { in ubidi_reorderVisual()
841 while(start<length && levels[start]<maxLevel) { in ubidi_reorderVisual()
849 for(limit=start; ++limit<length && levels[limit]>=maxLevel;) {} in ubidi_reorderVisual()