Lines Matching refs:pKey
4197 const void *pKey, int nKey /* The key */
4210 const void *pKey, int nKey /* The new key */
6253 const char *pKey; int nKey; /* Key associated with this element */
6260 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
6261 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
6279 /* #define sqliteHashKey(E) ((E)->pKey) // NOT USED */
6965 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
19608 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
19621 const char *pKey, /* The key we are searching for */
19637 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
19680 ** that matches pKey,nKey. Return the data for this element if it is
19683 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){
19688 assert( pKey!=0 );
19691 h = strHash(pKey, nKey) % pH->htsize;
19695 elem = findElementGivenHash(pH, pKey, nKey, h);
19699 /* Insert an element into the hash table pH. The key is pKey,nKey
19713 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data){
19719 assert( pKey!=0 );
19722 h = strHash(pKey, nKey) % pH->htsize;
19726 elem = findElementGivenHash(pH,pKey,nKey,h);
19733 elem->pKey = pKey;
19741 new_elem->pKey = pKey;
19748 h = strHash(pKey, nKey) % pH->htsize;
37069 void *pKey; /* Saved key that was cursor's last known position */
37070 i64 nKey; /* Size of pKey, or last integer key */
37095 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
38118 ** and BtCursor.pKey. The cursor's state is set to CURSOR_REQUIRESEEK.
38127 assert( 0==pCur->pKey );
38140 void *pKey = sqlite3Malloc( (int)pCur->nKey );
38141 if( pKey ){
38142 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
38144 pCur->pKey = pKey;
38146 sqlite3_free(pKey);
38152 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
38194 sqlite3_free(pCur->pKey);
38195 pCur->pKey = 0;
38200 ** In this version of BtreeMoveto, pKey is a packed index record
38206 const void *pKey, /* Packed key if the btree is an index */
38207 i64 nKey, /* Integer key for tables. Size of pKey for indices */
38215 if( pKey ){
38217 pIdxKey = sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey,
38224 if( pKey ){
38245 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext);
38247 sqlite3_free(pCur->pKey);
38248 pCur->pKey = 0;
42632 const void *pKey, i64 nKey, /* The key */
42680 if( NEVER(nKey>0x7fffffff || pKey==0) ){
42684 pSrc = pKey;
44013 ** Insert a new record into the BTree. The key is given by (pKey,nKey)
44018 ** For an INTKEY table, only the nKey value of the key is used. pKey is
44022 ** MovetoUnpacked() to seek cursor pCur to (pKey, nKey) has already
44024 ** number if pCur points at an entry that is smaller than (pKey, nKey), or
44026 ** (pKey, nKey)).
44036 const void *pKey, i64 nKey, /* The key of the new record */
44066 assert( (pKey==0)==(pCur->pKeyInfo==0) );
44089 rc = btreeMoveto(pCur, pKey, nKey, appendBias, &loc);
44105 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew);
49839 ** Given the nKey-byte encoding of a record in pKey[], parse the
49854 const void *pKey, /* The binary record */
49858 const unsigned char *aKey = (const unsigned char *)pKey;
52487 Mem *pKey; /* MEM cell holding key for the record */
55966 Mem *pKey; /* MEM cell holding key for the record */
55986 u.bf.pKey = &aMem[pOp->p3];
55987 assert( u.bf.pKey->flags & MEM_Int );
55988 REGISTER_TRACE(pOp->p3, u.bf.pKey);
55989 u.bf.iKey = u.bf.pKey->u.i;
61725 char *pKey;
61727 pKey = (char *)sqlite3IndexKeyinfo(pParse, pIdx);
61732 pKey,P4_KEYINFO_HANDOFF);
64925 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
64934 (char *)pKey, P4_KEYINFO_HANDOFF);
65714 Expr *pKey /* Database key for encryption extension */
65728 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
65752 sqlite3ExprCode(pParse, pKey, regArgs+2);
65771 sqlite3ExprDelete(db, pKey);
65798 ** ATTACH p AS pDbname KEY pKey
65800 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
65813 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
68503 KeyInfo *pKey; /* KeyInfo for index */
68527 pKey = sqlite3IndexKeyinfo(pParse, pIndex);
68529 (char *)pKey, P4_KEYINFO_HANDOFF);
69895 KeyInfo *pKey = (KeyInfo *)sqlite3DbMallocZero(db, nBytes);
69897 if( pKey ){
69898 pKey->db = pParse->db;
69899 pKey->aSortOrder = (u8 *)&(pKey->aColl[nCol]);
69900 assert( &pKey->aSortOrder[nCol]==&(((u8 *)pKey)[nBytes]) );
69904 pKey->aColl[i] = sqlite3LocateCollSeq(pParse, zColl);
69905 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
69907 pKey->nField = (u16)nCol;
69911 sqlite3DbFree(db, pKey);
69912 pKey = 0;
69914 return pKey;
72910 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
72913 sqlite3VdbeChangeP4(v, -1, (char*)pKey, P4_KEYINFO_HANDOFF);
75210 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
75213 (char*)pKey, P4_KEYINFO_HANDOFF);
75334 KeyInfo *pKey; /* Key information for an index */
75512 pKey = sqlite3IndexKeyinfo(pParse, pSrcIdx);
75514 (char*)pKey, P4_KEYINFO_HANDOFF);
75516 pKey = sqlite3IndexKeyinfo(pParse, pDestIdx);
75518 (char*)pKey, P4_KEYINFO_HANDOFF);
84923 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
84925 (char*)pKey, P4_KEYINFO_HANDOFF);
90415 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIx);
90420 (char*)pKey, P4_KEYINFO_HANDOFF);
98378 void *pKey; int nKey; /* Key associated with this element */
98384 ** FTS3_HASH_STRING pKey points to a string that is nKey bytes long
98388 ** FTS3_HASH_BINARY pKey points to binary data nKey bytes long.
98400 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
98401 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
98429 #define fts3HashKey(E) ((E)->pKey)
101247 const struct Fts3Keyword *pKey = &aKeyword[ii];
101249 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
101253 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
101255 int nKey = pKey->n;
101259 if( pKey->eType==FTSQUERY_NEAR ){
101282 pRet->eType = pKey->eType;
101907 if( pH->copyKey && elem->pKey ){
101908 fts3HashFree(elem->pKey);
101919 static int fts3StrHash(const void *pKey, int nKey){
101920 const char *z = (const char *)pKey;
101937 static int fts3BinHash(const void *pKey, int nKey){
101939 const char *z = (const char *)pKey;
102031 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
102044 const void *pKey, /* The key we are searching for */
102058 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
102092 if( pH->copyKey && elem->pKey ){
102093 fts3HashFree(elem->pKey);
102106 const void *pKey,
102115 h = (*xHash)(pKey,nKey);
102117 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
102122 ** that matches pKey,nKey. Return the data for this element if it is
102125 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
102128 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
102132 /* Insert an element into the hash table pH. The key is pKey,nKey
102149 const void *pKey, /* The key */
102162 hraw = (*xHash)(pKey, nKey);
102165 elem = fts3FindElementByHash(pH,pKey,nKey,h);
102185 if( pH->copyKey && pKey!=0 ){
102186 new_elem->pKey = fts3HashMalloc( nKey );
102187 if( new_elem->pKey==0 ){
102191 memcpy((void*)new_elem->pKey, pKey, nKey);
102193 new_elem->pKey = (void*)pKey;