Lines Matching full:bidi
29 /* Comparing the description of the BiDi algorithm with this implementation
30 is easier with the same names for the BiDi types in the code as there.
65 used in the BiDi algorithm.
99 * in the BiDi algorithm (N2)
163 DirProp lastStrong; /* bidi class of last strong char found in this run */
164 DirProp lastBase; /* bidi class of last base char found in this run */
192 if <0, count of bidi controls within run */
210 /** BiDi control code points */
229 /* InsertPoints structure for noting where to put BiDi marks ---------------- */
293 /* are we performing an approximation of the "inverse BiDi" algorithm? */
300 * logical to visual modes come first, and all inverse BiDi modes
365 /* for inverse Bidi with insertion of directional marks */
371 /* for Bidi class callback */
391 #define RETURN_IF_NOT_VALID_PARA(bidi, errcode, retvalue) \
392 if(!IS_VALID_PARA(bidi)) { \
396 #define RETURN_IF_NOT_VALID_PARA_OR_LINE(bidi, errcode, retvalue) \
397 if(!IS_VALID_PARA_OR_LINE(bidi)) { \
409 #define RETURN_VOID_IF_NOT_VALID_PARA(bidi, errcode) \
410 if(!IS_VALID_PARA(bidi)) { \
414 #define RETURN_VOID_IF_NOT_VALID_PARA_OR_LINE(bidi, errcode) \
415 if(!IS_VALID_PARA_OR_LINE(bidi)) { \
