• Home
  • Raw
  • Download

Lines Matching refs:le_int32

104 static const le_int32 featureMapCount = LE_ARRAY_SIZE(featureMap);
111 static le_int32 compose(LEUnicode lead, LEUnicode vowel, LEUnicode trail, LEUnicode &syllable) in compose()
113 le_int32 lIndex = lead - LJMO_FIRST; in compose()
114 le_int32 vIndex = vowel - VJMO_FIRST; in compose()
115 le_int32 tIndex = trail - TJMO_FIRST; in compose()
116 le_int32 result = 3; in compose()
132 static le_int32 decompose(LEUnicode syllable, LEUnicode &lead, LEUnicode &vowel, LEUnicode &trail) in decompose()
134 le_int32 sIndex = syllable - HSYL_FIRST; in decompose()
151 static le_int32 getCharClass(LEUnicode ch, LEUnicode &lead, LEUnicode &vowel, LEUnicode &trail) in getCharClass()
172 le_int32 c = decompose(ch, lead, vowel, trail); in getCharClass()
186 …angulOpenTypeLayoutEngine(const LEFontInstance *fontInstance, le_int32 scriptCode, le_int32 /*lang… in HangulOpenTypeLayoutEngine() argument
187le_int32 typoFlags, const GlyphSubstitutionTableHeader *gsubTable) in HangulOpenTypeLayoutEngine()
195 …angulOpenTypeLayoutEngine(const LEFontInstance *fontInstance, le_int32 scriptCode, le_int32 /*lang… in HangulOpenTypeLayoutEngine() argument
196 le_int32 typoFlags) in HangulOpenTypeLayoutEngine()
209 le_int32 HangulOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, in characterProcessing()
221 le_int32 worstCase = count * 3; in characterProcessing()
238 le_int32 outCharCount = 0; in characterProcessing()
239 le_int32 limit = offset + count; in characterProcessing()
240 le_int32 i = offset; in characterProcessing()
243 le_int32 state = 0; in characterProcessing()
244 le_int32 inStart = i; in characterProcessing()
245 le_int32 outStart = outCharCount; in characterProcessing()
292 le_int32 inLength = i - inStart; in characterProcessing()
293 le_int32 outLength = outCharCount - outStart; in characterProcessing()
325 for(le_int32 d = inStart + 1; d < i; d += 1) { in characterProcessing()