Lines Matching refs:pKey
6631 const void *pKey, int nKey /* The key */
6636 const void *pKey, int nKey /* The key */
6649 const void *pKey, int nKey /* The new key */
6654 const void *pKey, int nKey /* The new key */
13435 const char *pKey; /* Key associated with this element */ member
13442 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, void *pData);
13443 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey);
14569 const void *pKey; /* Key content for indexes. NULL for tables */ member
31983 unsigned int h = strHash(elem->pKey) % new_size;
31997 const char *pKey, /* The key we are searching for */
32007 h = strHash(pKey) % pH->htsize;
32019 if( sqlite3StrICmp(elem->pKey,pKey)==0 ){
32065 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey){
32067 assert( pKey!=0 );
32068 return findElementWithHash(pH, pKey, 0)->data;
32085 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, void *data){
32091 assert( pKey!=0 );
32092 elem = findElementWithHash(pH,pKey,&h);
32099 elem->pKey = pKey;
32106 new_elem->pKey = pKey;
32112 h = strHash(pKey) % pH->htsize;
62698 void *pKey; /* Saved key that was cursor last known position */
63844 assert( 0==pCur->pKey );
63857 void *pKey;
63859 pKey = sqlite3Malloc( pCur->nKey + 9 + 8 );
63860 if( pKey ){
63861 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
63863 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
63864 pCur->pKey = pKey;
63866 sqlite3_free(pKey);
63872 assert( !pCur->curIntKey || !pCur->pKey );
63887 assert( 0==pCur->pKey );
63974 sqlite3_free(pCur->pKey);
63975 pCur->pKey = 0;
63986 const void *pKey, /* Packed key if the btree is an index */
63994 if( pKey ){
63999 sqlite3VdbeRecordUnpack(pKeyInfo, (int)nKey, pKey, pIdxKey);
64034 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
64037 sqlite3_free(pCur->pKey);
64038 pCur->pKey = 0;
67654 sqlite3_free(pCur->pKey);
69612 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
69614 pSrc = pX->pKey;
71751 assert( (pX->pKey==0)==(pCur->pKeyInfo==0) );
71770 assert( pX->pKey==0 );
71836 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
71849 x2.pData = pX->pKey;
71955 assert( pCur->pKey==0 );
71956 pCur->pKey = sqlite3Malloc( pX->nKey );
71957 if( pCur->pKey==0 ){
71960 memcpy(pCur->pKey, pX->pKey, pX->nKey);
80111 const void *pKey, /* The binary record */
80114 const unsigned char *aKey = (const unsigned char *)pKey;
80269 int nKey, const void *pKey, /* The record to verify */
80276 const unsigned char *aKey = (const unsigned char*)pKey;
83039 const void *pKey
83046 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
88170 Mem *pKey; /* MEM cell holding key for the record */
88189 pKey = &aMem[pOp->p3];
88190 assert( pKey->flags & MEM_Int );
88191 assert( memIsValid(pKey) );
88192 REGISTER_TRACE(pOp->p3, pKey);
88193 x.nKey = pKey->u.i;
88230 x.pKey = 0;
88920 x.pKey = pIn2->z;
94390 void *pKey;
94402 pKey = pReader->aKey;
94405 pKey = SRVAL(pSorter->list.pList);
94407 return pKey;
94415 void *pKey; int nKey; /* Sorter key to copy into pOut */
94419 pKey = vdbeSorterRowkey(pSorter, &nKey);
94425 memcpy(pOut->z, pKey, nKey);
94456 void *pKey; int nKey; /* Sorter key to compare pVal with */
94469 pKey = vdbeSorterRowkey(pSorter, &nKey);
94470 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
106278 Expr *pKey /* Database key for encryption extension */
106293 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
106318 sqlite3ExprCode(pParse, pKey, regArgs+2);
106337 sqlite3ExprDelete(db, pKey);
106365 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
106377 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
109784 KeyInfo *pKey; /* KeyInfo for index */
109806 pKey = sqlite3KeyInfoOfIndex(pParse, pIndex);
109807 assert( pKey!=0 || db->mallocFailed || pParse->nErr );
109812 sqlite3KeyInfoRef(pKey), P4_KEYINFO);
109828 (char *)pKey, P4_KEYINFO);
111427 KeyInfo *pKey;
111430 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
111432 pKey = sqlite3KeyInfoAlloc(pParse->db, nCol, 0);
111434 if( pKey ){
111435 assert( sqlite3KeyInfoIsWriteable(pKey) );
111438 pKey->aColl[i] = zColl==sqlite3StrBINARY ? 0 :
111440 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
111455 sqlite3KeyInfoUnref(pKey);
111456 pKey = 0;
111459 return pKey;
159894 void *pKey; int nKey; /* Key associated with this element */
159916 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
159917 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
159945 #define fts3HashKey(E) ((E)->pKey)
167251 const struct Fts3Keyword *pKey = &aKeyword[ii];
167253 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
167257 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
167259 int nKey = pKey->n;
167263 if( pKey->eType==FTSQUERY_NEAR ){
167285 pRet->eType = pKey->eType;
168196 if( pH->copyKey && elem->pKey ){
168197 fts3HashFree(elem->pKey);
168208 static int fts3StrHash(const void *pKey, int nKey){
168209 const char *z = (const char *)pKey;
168226 static int fts3BinHash(const void *pKey, int nKey){
168228 const char *z = (const char *)pKey;
168320 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
168333 const void *pKey, /* The key we are searching for */
168347 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
168381 if( pH->copyKey && elem->pKey ){
168382 fts3HashFree(elem->pKey);
168395 const void *pKey,
168404 h = (*xHash)(pKey,nKey);
168406 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
168414 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
168417 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
168438 const void *pKey, /* The key */
168451 hraw = (*xHash)(pKey, nKey);
168454 elem = fts3FindElementByHash(pH,pKey,nKey,h);
168474 if( pH->copyKey && pKey!=0 ){
168475 new_elem->pKey = fts3HashMalloc( nKey );
168476 if( new_elem->pKey==0 ){
168480 memcpy((void*)new_elem->pKey, pKey, nKey);
168482 new_elem->pKey = (void*)pKey;
