Lines Matching refs:success
77 KernTable::KernTable(const LETableReference& base, LEErrorCode &success)
80 if(LE_FAILURE(success) || fTable.isEmpty()) {
86 LEReferenceTo<KernTableHeader> header(fTable, success);
100 if(LE_FAILURE(success)) return;
103 LEReferenceTo<SubtableHeader> subhead(header, success, KERN_TABLE_HEADER_SIZE);
105 if (LE_SUCCESS(success) && !subhead.isEmpty() && subhead->version == 0) {
109 LEReferenceTo<Subtable_0> table(subhead, success, KERN_SUBTABLE_HEADER_SIZE);
111 if(table.isEmpty() || LE_FAILURE(success)) return;
125 if(LE_SUCCESS(success) && nPairs>0) {
130 success,
145 if(LE_SUCCESS(success) {
158 const PairInfo& p = pairs[i, success];
193 void KernTable::process(LEGlyphStorage& storage, LEErrorCode &success)
195 if (LE_SUCCESS(success) && !pairs.isEmpty()) {
200 for (int i = 1, e = storage.getGlyphCount(); LE_SUCCESS(success)&& i < e; ++i) {
208 const PairInfo *p = pairs.getAlias(0, success);
210 LEReferenceTo<PairInfo> tpRef(pairs, success, rangeShift); // ((char*)pairs) + rangeShift
212 if(LE_FAILURE(success)) return; // get out.
224 while (probe > KERN_PAIRINFO_SIZE && LE_SUCCESS(success)) {
226 tpRef = LEReferenceTo<PairInfo>(pairs, success, p, probe); // (char*)p + probe
229 if(LE_FAILURE(success)) break;
233 if (tkey <= key && LE_SUCCESS(success)) {
249 storage.adjustPosition(i, adjust, 0, success);
252 storage.adjustPosition(storage.getGlyphCount(), adjust, 0, success);
