Lines Matching refs:pKey
13473 const char *pKey; /* Key associated with this element */ member
13480 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, void *pData);
13481 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey);
14908 const void *pKey; /* Key content for indexes. NULL for tables */ member
33898 unsigned int h = strHash(elem->pKey) % new_size;
33912 const char *pKey, /* The key we are searching for */
33922 h = strHash(pKey) % pH->htsize;
33934 if( sqlite3StrICmp(elem->pKey,pKey)==0 ){
33980 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey){
33982 assert( pKey!=0 );
33983 return findElementWithHash(pH, pKey, 0)->data;
34000 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, void *data){
34006 assert( pKey!=0 );
34007 elem = findElementWithHash(pH,pKey,&h);
34014 elem->pKey = pKey;
34021 new_elem->pKey = pKey;
34027 h = strHash(pKey) % pH->htsize;
65081 void *pKey; /* Saved key that was cursor last known position */
66243 assert( 0==pCur->pKey );
66256 void *pKey;
66258 pKey = sqlite3Malloc( pCur->nKey + 9 + 8 );
66259 if( pKey ){
66260 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
66262 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
66263 pCur->pKey = pKey;
66265 sqlite3_free(pKey);
66271 assert( !pCur->curIntKey || !pCur->pKey );
66286 assert( 0==pCur->pKey );
66376 sqlite3_free(pCur->pKey);
66377 pCur->pKey = 0;
66388 const void *pKey, /* Packed key if the btree is an index */
66396 if( pKey ){
66401 sqlite3VdbeRecordUnpack(pKeyInfo, (int)nKey, pKey, pIdxKey);
66434 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
66437 sqlite3_free(pCur->pKey);
66438 pCur->pKey = 0;
70145 sqlite3_free(pCur->pKey);
72223 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
72225 pSrc = pX->pKey;
74410 assert( (flags & BTREE_PREFORMAT) || (pX->pKey==0)==(pCur->pKeyInfo==0) );
74437 assert( pX->pKey==0 );
74502 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
74516 x2.pData = pX->pKey;
74651 assert( pCur->pKey==0 );
74652 pCur->pKey = sqlite3Malloc( pX->nKey );
74653 if( pCur->pKey==0 ){
74656 memcpy(pCur->pKey, pX->pKey, pX->nKey);
83201 const void *pKey, /* The binary record */
83204 const unsigned char *aKey = (const unsigned char *)pKey;
83364 int nKey, const void *pKey, /* The record to verify */
83371 const unsigned char *aKey = (const unsigned char*)pKey;
86251 const void *pKey
86258 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
91951 Mem *pKey; /* MEM cell holding key for the record */
91971 pKey = &aMem[pOp->p3];
91972 assert( pKey->flags & MEM_Int );
91973 assert( memIsValid(pKey) );
91974 REGISTER_TRACE(pOp->p3, pKey);
91975 x.nKey = pKey->u.i;
92012 x.pKey = 0;
92722 x.pKey = pIn2->z;
98368 void *pKey;
98380 pKey = pReader->aKey;
98383 pKey = SRVAL(pSorter->list.pList);
98385 return pKey;
98393 void *pKey; int nKey; /* Sorter key to copy into pOut */
98397 pKey = vdbeSorterRowkey(pSorter, &nKey);
98403 memcpy(pOut->z, pKey, nKey);
98434 void *pKey; int nKey; /* Sorter key to compare pVal with */
98447 pKey = vdbeSorterRowkey(pSorter, &nKey);
98448 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
112496 Expr *pKey /* Database key for encryption extension */
112511 SQLITE_OK!=resolveAttachExpr(&sName, pKey)
112537 sqlite3ExprCode(pParse, pKey, regArgs+2);
112553 sqlite3ExprDelete(db, pKey);
112581 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
112593 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
116763 KeyInfo *pKey; /* KeyInfo for index */
116785 pKey = sqlite3KeyInfoOfIndex(pParse, pIndex);
116786 assert( pKey!=0 || db->mallocFailed || pParse->nErr );
116791 sqlite3KeyInfoRef(pKey), P4_KEYINFO);
116807 (char *)pKey, P4_KEYINFO);
118513 KeyInfo *pKey;
118516 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
118518 pKey = sqlite3KeyInfoAlloc(pParse->db, nCol, 0);
118520 if( pKey ){
118521 assert( sqlite3KeyInfoIsWriteable(pKey) );
118524 pKey->aColl[i] = zColl==sqlite3StrBINARY ? 0 :
118526 pKey->aSortFlags[i] = pIdx->aSortOrder[i];
118527 assert( 0==(pKey->aSortFlags[i] & KEYINFO_ORDER_BIGNULL) );
118542 sqlite3KeyInfoUnref(pKey);
118543 pKey = 0;
118546 return pKey;
172258 void *pKey; int nKey; /* Key associated with this element */
172280 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
172281 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
172309 #define fts3HashKey(E) ((E)->pKey)
179737 const struct Fts3Keyword *pKey = &aKeyword[ii];
179739 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
179743 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
179745 int nKey = pKey->n;
179749 if( pKey->eType==FTSQUERY_NEAR ){
179768 pRet->eType = pKey->eType;
180684 if( pH->copyKey && elem->pKey ){
180685 fts3HashFree(elem->pKey);
180696 static int fts3StrHash(const void *pKey, int nKey){
180697 const char *z = (const char *)pKey;
180714 static int fts3BinHash(const void *pKey, int nKey){
180716 const char *z = (const char *)pKey;
180808 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
180821 const void *pKey, /* The key we are searching for */
180835 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
180869 if( pH->copyKey && elem->pKey ){
180870 fts3HashFree(elem->pKey);
180883 const void *pKey,
180892 h = (*xHash)(pKey,nKey);
180894 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
180902 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
180905 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
180926 const void *pKey, /* The key */
180939 hraw = (*xHash)(pKey, nKey);
180942 elem = fts3FindElementByHash(pH,pKey,nKey,h);
180962 if( pH->copyKey && pKey!=0 ){
180963 new_elem->pKey = fts3HashMalloc( nKey );
180964 if( new_elem->pKey==0 ){
180968 memcpy((void*)new_elem->pKey, pKey, nKey);
180970 new_elem->pKey = (void*)pKey;