a ac actionNeutrals actions actionWeak addLevel AL AN ao ASSERT AxA Axx B BIDI_DetermineLevels BIDI_GetStrengths BIDI_ReorderL2vLevel BIDI_ReorderV2lLevel BN classify cn CS directions EmbeddingDirection EN En ES ET ExE GetDeferredNeutrals GetDeferredType GetResolvedNeutrals GetResolvedType GreaterEven GreaterOdd In IX L l la lc le let Ln ln LnL lo LRE LRO ls lt LxL MAX_LEVEL N na neutralactions NIx nL NSM NxE NxL NxN NxR Nxx ON PDF R r ra rc re resolveExplicit resolveImplicit resolveNeutrals resolvestates resolveWeak ret reverse RLE RLO Rn rn ro rs rt S SetDeferredRun stateNeutrals states stateWeak WINE_DEFAULT_DEBUG_CHANNEL WS xa xIx xl xr XX xxA xxE xxL xxN xxR xxx

static int resolveExplicit ( int  level, int  dir, WORD *  pcls, WORD *  plevel, int  cch, int  nNest  ) [static] Definition at line 212 of file bidi.c. Referenced by BIDI_DetermineLevels(). { /* always called with a valid nesting level nesting levels are != embedding levels */ int nLastValid = nNest; int ich = 0; /* check input values */ ASSERT(nNest >= 0 && level >= 0 && level <= MAX_LEVEL); /* process the text */ for (; ich < cch; ich++) { WORD cls = pcls[ich]; switch (cls) { case LRO: case LRE: nNest++; if (GreaterEven(level) <= MAX_LEVEL - (cls == LRO ? 2 : 0)) { plevel[ich] = GreaterEven(level); pcls[ich] = BN; ich += resolveExplicit(plevel[ich], (cls == LRE ? N : L), &pcls[ich+1], &plevel[ich+1], cch - (ich+1), nNest); nNest--; continue; } cls = pcls[ich] = BN; break; case RLO: case RLE: nNest++; if (GreaterOdd(level) <= MAX_LEVEL - (cls == RLO ? 2 : 0)) { plevel[ich] = GreaterOdd(level); pcls[ich] = BN; ich += resolveExplicit(plevel[ich], (cls == RLE ? N : R), &pcls[ich+1], &plevel[ich+1], cch - (ich+1), nNest); nNest--; continue; } cls = pcls[ich] = BN; break; case PDF: cls = pcls[ich] = BN; if (nNest) { if (nLastValid < nNest) { nNest--; } else { cch = ich; /* break the loop, but complete body */ } } } /* Apply the override */ if (dir != N) { cls = dir; } plevel[ich] = level; if (pcls[ich] != BN) pcls[ich] = cls; } return ich; }