Lines Matching refs:success
98 KernTable::KernTable(const LETableReference& base, LEErrorCode &success)
101 if(LE_FAILURE(success) || (fTable.isEmpty())) {
107 LEReferenceTo<KernTableHeader> header(fTable, success);
121 if(LE_FAILURE(success)) return;
124 LEReferenceTo<SubtableHeader> subhead(header, success, KERN_TABLE_HEADER_SIZE);
126 if (LE_SUCCESS(success) && !subhead.isEmpty() && subhead->version == 0) {
129 LEReferenceTo<Subtable_0> table(subhead, success, KERN_SUBTABLE_HEADER_SIZE);
131 if(table.isEmpty() || LE_FAILURE(success)) return;
145 if(LE_SUCCESS(success) && nPairs>0) {
153 success,
157 if (LE_SUCCESS(success) && pairs.isValid()) {
160 for (int i = 0; LE_SUCCESS(success) && i < nPairs; i++, p++) {
161 memcpy(p, pairs.getAlias(i,success), KERN_PAIRINFO_SIZE);
221 void KernTable::process(LEGlyphStorage& storage, LEErrorCode &success)
223 if(LE_FAILURE(success)) return;
226 success = LE_NO_ERROR;
231 for (int i = 1, e = storage.getGlyphCount(); LE_SUCCESS(success)&& i < e; ++i) {
281 storage.adjustPosition(i, adjust, 0, success);
283 storage.adjustPosition(storage.getGlyphCount(), adjust, 0, success);