Lines Matching refs:nKey
187 u16 nKey; /* Number of bytes in the key */ member
200 #define NKEY(b,h) (SWAB16(b,h.nKey) + h.nKeyHi*65536)
1328 int nKey, /* Number of bytes in pKey */ in fileBtreeKeyCompare() argument
1343 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1353 nKey -= n; in fileBtreeKeyCompare()
1356 while( nKey>0 && nLocal>0 ){ in fileBtreeKeyCompare()
1366 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1376 nKey -= n; in fileBtreeKeyCompare()
1381 c = nLocal - nKey; in fileBtreeKeyCompare()
1585 int fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes){ in fileBtreeMoveto() argument
1600 rc = fileBtreeKeyCompare(pCur, pKey, nKey, 0, &c); in fileBtreeMoveto()
1912 const void *pKey, int nKey, /* The key */ in fillInCell() argument
1925 pCell->h.nKey = SWAB16(pBt, nKey & 0xffff); in fillInCell()
1926 pCell->h.nKeyHi = nKey >> 16; in fillInCell()
1936 nPayload = nKey; in fillInCell()
2621 const void *pKey, int nKey, /* The key of the new record */ in fileBtreeInsert() argument
2634 if( !pBt->inTrans || nKey+nData==0 ){ in fileBtreeInsert()
2645 rc = fileBtreeMoveto(pCur, pKey, nKey, &loc); in fileBtreeInsert()
2651 rc = fillInCell(pBt, &newCell, pKey, nKey, pData, nData); in fileBtreeInsert()