Searched refs:LE_FAILURE (Results 1 - 25 of 72) sorted by relevance

123

/openjdk9/jdk/src/java.desktop/share/native/libfontmanager/layout/
H A DGlyphDefinitionTables.cpp43 if(LE_FAILURE(success)) return LEReferenceTo<GlyphClassDefinitionTable>();
51 if(LE_FAILURE(success)) return LEReferenceTo<AttachmentListTable>();
59 if(LE_FAILURE(success)) return LEReferenceTo<LigatureCaretListTable>();
67 if(LE_FAILURE(success)) return LEReferenceTo<MarkAttachClassDefinitionTable>();
H A DContextualSubstSubtables.cpp58 if (LE_FAILURE(success)) {
113 if (LE_FAILURE(success)) { return FALSE; }
164 if (LE_FAILURE(success) || ! glyphIterator->next()) {
186 if (LE_FAILURE(success)) {
198 if( LE_FAILURE(success) ) {
207 if( LE_FAILURE(success) ) {
216 if( LE_FAILURE(success) ) {
232 if (LE_FAILURE(success)) {
238 if (LE_FAILURE(success)) {
248 if (LE_FAILURE(succes
[all...]
H A DGlyphPositioningTables.cpp49 if (LE_FAILURE(success)) {
54 if (LE_FAILURE(success)) {
H A DMultipleSubstSubtables.cpp44 if (LE_FAILURE(success)) {
60 if(LE_FAILURE(success)) return 0;
67 if (LE_FAILURE(success)) {
74 if (LE_FAILURE(success)) {
107 if (LE_FAILURE(success)) {
H A DCoverageTables.cpp42 if(LE_FAILURE(success)) return -1;
70 if(LE_FAILURE(success)) return -1;
85 if(LE_FAILURE(success)) return -1; // range checks array
109 if(LE_FAILURE(success)) return -1;
118 if (rangeIndex < 0 || LE_FAILURE(success)) { // could fail if array out of bounds
H A DStateTableProcessor.cpp51 if(LE_FAILURE(success)) return;
58 if(LE_FAILURE(success)) return;
69 if (LE_FAILURE(success)) return;
84 if (LE_FAILURE(success)) break;
102 if (LE_FAILURE(success)) { break; }
H A DContextualGlyphSubstProc2.cpp50 if(LE_FAILURE(success)) return;
68 if(LE_FAILURE(success)) return 0;
70 if(LE_FAILURE(success)) return 0;
112 if(LE_FAILURE(success)) return newGlyph;
114 if(LE_FAILURE(success)) return newGlyph;
123 if(LE_FAILURE(success)) return newGlyph;
158 if (LE_FAILURE(success)) return newGlyph;
165 if (LE_FAILURE(success)) { return newGlyph; }
H A DMarkArrays.cpp51 if(LE_FAILURE(success)) {
58 if(LE_FAILURE(success)) {
H A DLigatureSubstSubtables.cpp48 if (LE_FAILURE(success)) {
58 if( LE_FAILURE(success) ) { return 0; }
65 if(LE_FAILURE(success)) { return 0; }
69 if (LE_FAILURE(success)) { return 0; }
H A DSubtableProcessor2.cpp46 if(LE_FAILURE(success)) return;
H A DSubtableProcessor.cpp46 if(LE_FAILURE(success)) return;
H A DGXLayoutEngine2.cpp56 if (LE_FAILURE(success)) {
67 if (LE_FAILURE(success)) {
79 if (LE_FAILURE(success)) {
H A DLookups.cpp44 if(LE_FAILURE(success) || lookupTableIndex>lookupTableOffsetArrayRef.getCount()) {
56 if(LE_FAILURE(success) || subtableIndex>subTableOffsetArrayRef.getCount()) {
68 if(LE_FAILURE(success)) return 0;
H A DTrimmedArrayProcessor.cpp54 if(LE_FAILURE(success)) return;
58 if(LE_FAILURE(success)) return;
70 if(LE_FAILURE(success)) return;
H A DGXLayoutEngine.cpp59 if (LE_FAILURE(success)) {
70 if (LE_FAILURE(success)) {
83 if (LE_FAILURE(success)) {
H A DMarkToMarkPosnSubtables.cpp59 if (LE_FAILURE(success)) {
70 if(LE_FAILURE(success)) {
86 if(LE_FAILURE(success)) return 0;
97 if(LE_FAILURE(success)) return 0;
100 if(LE_FAILURE(success)) return 0;
H A DLigatureSubstProc.cpp53 if(LE_FAILURE(success)) return;
73 if (LE_FAILURE(success)) {
97 if (LE_FAILURE(success)) {
111 if (LE_FAILURE(success)) {
127 if(LE_FAILURE(success)) {
138 if (LE_FAILURE(success)) {
145 if (LE_FAILURE(success)) {
H A DLigatureSubstProc2.cpp55 if (LE_FAILURE(success)) return;
76 if(LE_FAILURE(success)) return 0;
98 if (LE_FAILURE(success)) {
110 if(LE_FAILURE(success)) {
121 if (LE_FAILURE(success)) {
140 if (LE_FAILURE(success)) {
147 if (LE_FAILURE(success)) {
H A DMarkToLigaturePosnSubtables.cpp58 if (LE_FAILURE(success)) {
69 if( LE_FAILURE(success) ) {
86 if (LE_FAILURE(success)) { return 0; }
99 if (LE_FAILURE(success)) { return 0; }
109 if (LE_FAILURE(success)) { return 0; }
111 if( LE_FAILURE(success) ) { return 0; }
114 if (LE_FAILURE(success)) { return 0; }
H A DMarkToBasePosnSubtables.cpp59 if (LE_FAILURE(success)) {
70 if(LE_FAILURE(success)) return 0;
74 if (markClass < 0 || markClass >= mcCount || LE_FAILURE(success)) {
85 if(LE_FAILURE(success)) return 0;
95 if( LE_FAILURE(success) ) { return 0; }
98 if( LE_FAILURE(success) ) { return 0; }
101 if( LE_FAILURE(success) ) { return 0; }
H A DClassDefinitionTables.cpp43 if (LE_FAILURE(success)) return 0;
69 if (LE_FAILURE(success)) return 0;
94 if(LE_FAILURE(success)) return 0;
111 if(LE_FAILURE(success)) return 0;
127 if(LE_FAILURE(success)) return 0;
134 if (rangeIndex < 0 || LE_FAILURE(success)) {
143 if(LE_FAILURE(success)) return 0;
H A DLEGlyphStorage.cpp92 if (LE_FAILURE(success)) {
153 if (LE_FAILURE(success)) {
175 if (LE_FAILURE(success)) {
198 if (LE_FAILURE(success)) {
219 if (LE_FAILURE(success)) {
241 if (LE_FAILURE(success)) {
262 if (LE_FAILURE(success)) {
281 if (LE_FAILURE(success)) {
300 if (LE_FAILURE(success)) {
319 if (LE_FAILURE(succes
[all...]
H A DLookupProcessor.cpp50 if (LE_FAILURE(success)) {
63 if (delta > 0 && LE_FAILURE(success)) {
80 if (LE_FAILURE(success)) {
101 if (!lookupTable.isValid() ||LE_FAILURE(success) ) {
110 if (LE_FAILURE(success)) {
128 if (LE_FAILURE(success)) {
180 if (LE_FAILURE(success)) {
244 if (!featureTable.isValid() || LE_FAILURE(success)) {
251 if (!featureTable.isValid() || LE_FAILURE(success)) {
258 if (LE_FAILURE(succes
[all...]
H A DThaiLayoutEngine.cpp86 if (LE_FAILURE(success)) {
109 if (LE_FAILURE(success)) {
128 if (LE_FAILURE(success)) {
H A DGlyphSubstitutionTables.cpp57 if (LE_FAILURE(success)) {

Completed in 123 milliseconds

123