Lines Matching refs:iRes
101412 /* Compare pReadr1 and pReadr2. Store the result in variable iRes. */
101413 int iRes;
101415 iRes = +1;
101417 iRes = -1;
101419 iRes = pTask->xCompare(pTask, &bCached,
101439 if( iRes<0 || (iRes==0 && pReadr1<pReadr2) ){
101814 int iRes;
101832 iRes = i2;
101834 iRes = i1;
101844 iRes = i1;
101846 iRes = i2;
101850 pMerger->aTree[iOut] = iRes;
197992 int iRes = 0;
197998 iRes = iTest;
198005 assert( key>=aEntry[iRes] );
198006 return (((unsigned int)c) >= ((aEntry[iRes]>>10) + (aEntry[iRes]&0x3FF)));
198065 int iRes = 0;
198071 iRes = iTest;
198077 assert( key>=aDia[iRes] );
198078 if( bComplex==0 && (aChar[iRes] & 0x80) ) return c;
198079 return (c > (aDia[iRes]>>3) + (aDia[iRes]&0x07)) ? c : ((int)aChar[iRes] & 0x7F);
198208 int iRes = -1;
198215 iRes = iTest;
198222 assert( iRes>=0 && c>=aEntry[iRes].iCode );
198223 p = &aEntry[iRes];
232681 int iRes;
232701 iRes = i2;
232703 iRes = i1;
232718 iRes = i1;
232720 iRes = i2;
232724 pRes->iFirst = (u16)iRes;
242416 int iRes = 0;
242422 iRes = iTest;
242428 assert( key>=aDia[iRes] );
242429 if( bComplex==0 && (aChar[iRes] & 0x80) ) return c;
242430 return (c > (aDia[iRes]>>3) + (aDia[iRes]&0x07)) ? c : ((int)aChar[iRes] & 0x7F);
242559 int iRes = -1;
242566 iRes = iTest;
242573 assert( iRes>=0 && c>=aEntry[iRes].iCode );
242574 p = &aEntry[iRes];
243075 int iRes = -1;
243091 iRes = iTest;
243098 if( iRes<0 ) return 0;
243099 if( iKey>=(aFts5UnicodeMap[iRes]+(aFts5UnicodeData[iRes]>>5)) ) return 0;
243100 ret = aFts5UnicodeData[iRes] & 0x1F;
243102 return ((iKey - aFts5UnicodeMap[iRes]) & 0x01) ? 5 : 9;