Lines Matching refs:pKey
4916 const void *pKey, int nKey /* The key */
4929 const void *pKey, int nKey /* The new key */
7616 const char *pKey; int nKey; /* Key associated with this element */ member
7623 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7624 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
8332 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
22360 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size; in rehash()
22373 const char *pKey, /* The key we are searching for */ in findElementGivenHash() argument
22389 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){ in findElementGivenHash()
22435 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){ in sqlite3HashFind() argument
22440 assert( pKey!=0 ); in sqlite3HashFind()
22443 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashFind()
22447 elem = findElementGivenHash(pH, pKey, nKey, h); in sqlite3HashFind()
22465 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data){ in sqlite3HashInsert() argument
22471 assert( pKey!=0 ); in sqlite3HashInsert()
22474 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashInsert()
22478 elem = findElementGivenHash(pH,pKey,nKey,h); in sqlite3HashInsert()
22485 elem->pKey = pKey; in sqlite3HashInsert()
22493 new_elem->pKey = pKey; in sqlite3HashInsert()
22500 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashInsert()
48952 void *pKey; /* Saved key that was cursor's last known position */
49945 assert( 0==pCur->pKey );
49958 void *pKey = sqlite3Malloc( (int)pCur->nKey );
49959 if( pKey ){
49960 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
49962 pCur->pKey = pKey;
49964 sqlite3_free(pKey);
49970 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
50012 sqlite3_free(pCur->pKey);
50013 pCur->pKey = 0;
50024 const void *pKey, /* Packed key if the btree is an index */
50034 if( pKey ){
50040 sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey, pIdxKey);
50066 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext);
50068 sqlite3_free(pCur->pKey);
50069 pCur->pKey = 0;
54691 const void *pKey, i64 nKey, /* The key */
54739 if( NEVER(nKey>0x7fffffff || pKey==0) ){
54743 pSrc = pKey;
56134 const void *pKey, i64 nKey, /* The key of the new record */
56165 assert( (pKey==0)==(pCur->pKeyInfo==0) );
56188 rc = btreeMoveto(pCur, pKey, nKey, appendBias, &loc);
56204 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew);
62414 const void *pKey, /* The binary record */
62417 const unsigned char *aKey = (const unsigned char *)pKey;
65226 Mem *pKey; /* MEM cell holding key for the record */
68898 Mem *pKey; /* MEM cell holding key for the record */
68919 u.bh.pKey = &aMem[pOp->p3];
68920 assert( u.bh.pKey->flags & MEM_Int );
68921 assert( memIsValid(u.bh.pKey) );
68922 REGISTER_TRACE(pOp->p3, u.bh.pKey);
68923 u.bh.iKey = u.bh.pKey->u.i;
72482 void *pKey;
72487 pKey = pIter->aKey;
72490 pKey = pSorter->pRecord->pVal;
72492 return pKey;
72500 void *pKey; int nKey; /* Sorter key to copy into pOut */
72502 pKey = vdbeSorterRowkey(pSorter, &nKey);
72508 memcpy(pOut->z, pKey, nKey);
72529 void *pKey; int nKey; /* Sorter key to compare pVal with */
72531 pKey = vdbeSorterRowkey(pSorter, &nKey);
72532 vdbeSorterCompare(pCsr, 1, pVal->z, pVal->n, pKey, nKey, pRes);
75915 char *pKey;
75917 pKey = (char *)sqlite3IndexKeyinfo(pParse, pIdx);
75921 pKey,P4_KEYINFO_HANDOFF);
79769 KeyInfo *pKey;
79778 pKey = sqlite3IndexKeyinfo(pParse, pIdx);
79786 (char *)pKey, P4_KEYINFO_HANDOFF);
80706 Expr *pKey /* Database key for encryption extension */
80720 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
80746 sqlite3ExprCode(pParse, pKey, regArgs+2);
80765 sqlite3ExprDelete(db, pKey);
80795 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
80809 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
83553 KeyInfo *pKey; /* KeyInfo for index */
83579 pKey = sqlite3IndexKeyinfo(pParse, pIndex);
83581 (char *)pKey, P4_KEYINFO_HANDOFF);
83589 sqlite3VdbeAddOp4(v, OP_SorterOpen, iSorter, 0, 0, (char*)pKey, P4_KEYINFO);
85001 KeyInfo *pKey = (KeyInfo *)sqlite3DbMallocZero(db, nBytes);
85003 if( pKey ){
85004 pKey->db = pParse->db;
85005 pKey->aSortOrder = (u8 *)&(pKey->aColl[nCol]);
85006 assert( &pKey->aSortOrder[nCol]==&(((u8 *)pKey)[nBytes]) );
85010 pKey->aColl[i] = sqlite3LocateCollSeq(pParse, zColl);
85011 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
85013 pKey->nField = (u16)nCol;
85017 sqlite3DbFree(db, pKey);
85018 pKey = 0;
85020 return pKey;
88130 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
88133 sqlite3VdbeChangeP4(v, -1, (char*)pKey, P4_KEYINFO_HANDOFF);
90475 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
90478 (char*)pKey, P4_KEYINFO_HANDOFF);
90593 KeyInfo *pKey; /* Key information for an index */
90787 pKey = sqlite3IndexKeyinfo(pParse, pSrcIdx);
90789 (char*)pKey, P4_KEYINFO_HANDOFF);
90791 pKey = sqlite3IndexKeyinfo(pParse, pDestIdx);
90793 (char*)pKey, P4_KEYINFO_HANDOFF);
100812 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
100814 (char*)pKey, P4_KEYINFO_HANDOFF);
107584 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIx);
107589 (char*)pKey, P4_KEYINFO_HANDOFF);
116399 void *pKey; int nKey; /* Key associated with this element */
116421 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
116422 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
116450 #define fts3HashKey(E) ((E)->pKey)
122742 const struct Fts3Keyword *pKey = &aKeyword[ii];
122744 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
122748 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
122750 int nKey = pKey->n;
122754 if( pKey->eType==FTSQUERY_NEAR ){
122776 pRet->eType = pKey->eType;
123414 if( pH->copyKey && elem->pKey ){
123415 fts3HashFree(elem->pKey);
123426 static int fts3StrHash(const void *pKey, int nKey){
123427 const char *z = (const char *)pKey;
123444 static int fts3BinHash(const void *pKey, int nKey){
123446 const char *z = (const char *)pKey;
123538 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
123551 const void *pKey, /* The key we are searching for */
123565 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
123599 if( pH->copyKey && elem->pKey ){
123600 fts3HashFree(elem->pKey);
123613 const void *pKey,
123622 h = (*xHash)(pKey,nKey);
123624 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
123632 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
123635 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
123656 const void *pKey, /* The key */
123669 hraw = (*xHash)(pKey, nKey);
123672 elem = fts3FindElementByHash(pH,pKey,nKey,h);
123692 if( pH->copyKey && pKey!=0 ){
123693 new_elem->pKey = fts3HashMalloc( nKey );
123694 if( new_elem->pKey==0 ){
123698 memcpy((void*)new_elem->pKey, pKey, nKey);
123700 new_elem->pKey = (void*)pKey;