Lines Matching defs:pKey
5090 const void *pKey, int nKey /* The key */
5103 const void *pKey, int nKey /* The new key */
7883 const char *pKey; int nKey; /* Key associated with this element */
7890 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7891 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7909 /* #define sqliteHashKey(E) ((E)->pKey) // NOT USED */
8662 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
22572 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
22585 const char *pKey, /* The key we are searching for */
22601 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
22644 ** that matches pKey,nKey. Return the data for this element if it is
22647 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){
22652 assert( pKey!=0 );
22655 h = strHash(pKey, nKey) % pH->htsize;
22659 elem = findElementGivenHash(pH, pKey, nKey, h);
22663 /* Insert an element into the hash table pH. The key is pKey,nKey
22677 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data){
22683 assert( pKey!=0 );
22686 h = strHash(pKey, nKey) % pH->htsize;
22690 elem = findElementGivenHash(pH,pKey,nKey,h);
22697 elem->pKey = pKey;
22705 new_elem->pKey = pKey;
22712 h = strHash(pKey, nKey) % pH->htsize;
49115 i64 nKey; /* Size of pKey, or last integer key */
49116 void *pKey; /* Saved key that was cursor's last known position */
49145 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
50139 ** and BtCursor.pKey. The cursor's state is set to CURSOR_REQUIRESEEK.
50148 assert( 0==pCur->pKey );
50161 void *pKey = sqlite3Malloc( (int)pCur->nKey );
50162 if( pKey ){
50163 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
50165 pCur->pKey = pKey;
50167 sqlite3_free(pKey);
50173 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
50214 sqlite3_free(pCur->pKey);
50215 pCur->pKey = 0;
50220 ** In this version of BtreeMoveto, pKey is a packed index record
50226 const void *pKey, /* Packed key if the btree is an index */
50227 i64 nKey, /* Integer key for tables. Size of pKey for indices */
50236 if( pKey ){
50242 sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey, pIdxKey);
50268 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext);
50270 sqlite3_free(pCur->pKey);
50271 pCur->pKey = 0;
55019 const void *pKey, i64 nKey, /* The key */
55067 if( NEVER(nKey>0x7fffffff || pKey==0) ){
55071 pSrc = pKey;
56450 ** Insert a new record into the BTree. The key is given by (pKey,nKey)
56455 ** For an INTKEY table, only the nKey value of the key is used. pKey is
56459 ** MovetoUnpacked() to seek cursor pCur to (pKey, nKey) has already
56461 ** number if pCur points at an entry that is smaller than (pKey, nKey), or
56463 ** (pKey, nKey)).
56473 const void *pKey, i64 nKey, /* The key of the new record */
56504 assert( (pKey==0)==(pCur->pKeyInfo==0) );
56528 rc = btreeMoveto(pCur, pKey, nKey, appendBias, &loc);
56544 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew);
62848 ** Given the nKey-byte encoding of a record in pKey[], populate the
62855 const void *pKey, /* The binary record */
62858 const unsigned char *aKey = (const unsigned char *)pKey;
65683 Mem *pKey; /* MEM cell holding key for the record */
69424 Mem *pKey; /* MEM cell holding key for the record */
69445 u.bi.pKey = &aMem[pOp->p3];
69446 assert( u.bi.pKey->flags & MEM_Int );
69447 assert( memIsValid(u.bi.pKey) );
69448 REGISTER_TRACE(pOp->p3, u.bi.pKey);
69449 u.bi.iKey = u.bi.pKey->u.i;
73158 void *pKey;
73163 pKey = pIter->aKey;
73166 pKey = pSorter->pRecord->pVal;
73168 return pKey;
73176 void *pKey; int nKey; /* Sorter key to copy into pOut */
73178 pKey = vdbeSorterRowkey(pSorter, &nKey);
73184 memcpy(pOut->z, pKey, nKey);
73205 void *pKey; int nKey; /* Sorter key to compare pVal with */
73207 pKey = vdbeSorterRowkey(pSorter, &nKey);
73208 vdbeSorterCompare(pCsr, 1, pVal->z, pVal->n, pKey, nKey, pRes);
76797 char *pKey;
76799 pKey = (char *)sqlite3IndexKeyinfo(pParse, pIdx);
76803 pKey,P4_KEYINFO_HANDOFF);
80741 KeyInfo *pKey;
80750 pKey = sqlite3IndexKeyinfo(pParse, pIdx);
80758 (char *)pKey, P4_KEYINFO_HANDOFF);
81678 Expr *pKey /* Database key for encryption extension */
81692 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
81718 sqlite3ExprCode(pParse, pKey, regArgs+2);
81737 sqlite3ExprDelete(db, pKey);
81765 ** ATTACH p AS pDbname KEY pKey
81767 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
81781 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
84575 KeyInfo *pKey; /* KeyInfo for index */
84598 pKey = sqlite3IndexKeyinfo(pParse, pIndex);
84600 (char *)pKey, P4_KEYINFO_HANDOFF);
84605 sqlite3VdbeAddOp4(v, OP_SorterOpen, iSorter, 0, 0, (char*)pKey, P4_KEYINFO);
85997 KeyInfo *pKey = (KeyInfo *)sqlite3DbMallocZero(db, nBytes);
85999 if( pKey ){
86000 pKey->db = pParse->db;
86001 pKey->aSortOrder = (u8 *)&(pKey->aColl[nCol]);
86002 assert( &pKey->aSortOrder[nCol]==&(((u8 *)pKey)[nBytes]) );
86006 pKey->aColl[i] = sqlite3LocateCollSeq(pParse, zColl);
86007 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
86009 pKey->nField = (u16)nCol;
86013 sqlite3DbFree(db, pKey);
86014 pKey = 0;
86016 return pKey;
89258 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
89261 sqlite3VdbeChangeP4(v, -1, (char*)pKey, P4_KEYINFO_HANDOFF);
91672 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
91675 (char*)pKey, P4_KEYINFO_HANDOFF);
91790 KeyInfo *pKey; /* Key information for an index */
91984 pKey = sqlite3IndexKeyinfo(pParse, pSrcIdx);
91986 (char*)pKey, P4_KEYINFO_HANDOFF);
91988 pKey = sqlite3IndexKeyinfo(pParse, pDestIdx);
91990 (char*)pKey, P4_KEYINFO_HANDOFF);
94600 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
94602 sqlite3VdbeChangeP4(v, -1, (char*)pKey, P4_KEYINFO_HANDOFF);
102607 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
102609 (char*)pKey, P4_KEYINFO_HANDOFF);
109897 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIx);
109902 (char*)pKey, P4_KEYINFO_HANDOFF);
119001 void *pKey; int nKey; /* Key associated with this element */
119007 ** FTS3_HASH_STRING pKey points to a string that is nKey bytes long
119011 ** FTS3_HASH_BINARY pKey points to binary data nKey bytes long.
119023 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
119024 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
119052 #define fts3HashKey(E) ((E)->pKey)
125566 const struct Fts3Keyword *pKey = &aKeyword[ii];
125568 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
125572 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
125574 int nKey = pKey->n;
125578 if( pKey->eType==FTSQUERY_NEAR ){
125600 pRet->eType = pKey->eType;
126503 if( pH->copyKey && elem->pKey ){
126504 fts3HashFree(elem->pKey);
126515 static int fts3StrHash(const void *pKey, int nKey){
126516 const char *z = (const char *)pKey;
126533 static int fts3BinHash(const void *pKey, int nKey){
126535 const char *z = (const char *)pKey;
126627 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
126640 const void *pKey, /* The key we are searching for */
126654 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
126688 if( pH->copyKey && elem->pKey ){
126689 fts3HashFree(elem->pKey);
126702 const void *pKey,
126711 h = (*xHash)(pKey,nKey);
126713 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
126718 ** that matches pKey,nKey. Return the data for this element if it is
126721 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
126724 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
126728 /* Insert an element into the hash table pH. The key is pKey,nKey
126745 const void *pKey, /* The key */
126758 hraw = (*xHash)(pKey, nKey);
126761 elem = fts3FindElementByHash(pH,pKey,nKey,h);
126781 if( pH->copyKey && pKey!=0 ){
126782 new_elem->pKey = fts3HashMalloc( nKey );
126783 if( new_elem->pKey==0 ){
126787 memcpy((void*)new_elem->pKey, pKey, nKey);
126789 new_elem->pKey = (void*)pKey;