Lines Matching defs:pKey
4509 const void *pKey, int nKey /* The key */
4522 const void *pKey, int nKey /* The new key */
6873 const char *pKey; int nKey; /* Key associated with this element */
6880 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
6881 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
6899 /* #define sqliteHashKey(E) ((E)->pKey) // NOT USED */
7584 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
21150 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
21163 const char *pKey, /* The key we are searching for */
21179 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
21222 ** that matches pKey,nKey. Return the data for this element if it is
21225 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){
21230 assert( pKey!=0 );
21233 h = strHash(pKey, nKey) % pH->htsize;
21237 elem = findElementGivenHash(pH, pKey, nKey, h);
21241 /* Insert an element into the hash table pH. The key is pKey,nKey
21255 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data){
21261 assert( pKey!=0 );
21264 h = strHash(pKey, nKey) % pH->htsize;
21268 elem = findElementGivenHash(pH,pKey,nKey,h);
21275 elem->pKey = pKey;
21283 new_elem->pKey = pKey;
21290 h = strHash(pKey, nKey) % pH->htsize;
44872 void *pKey; /* Saved key that was cursor's last known position */
44873 i64 nKey; /* Size of pKey, or last integer key */
44898 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
45927 ** and BtCursor.pKey. The cursor's state is set to CURSOR_REQUIRESEEK.
45936 assert( 0==pCur->pKey );
45949 void *pKey = sqlite3Malloc( (int)pCur->nKey );
45950 if( pKey ){
45951 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
45953 pCur->pKey = pKey;
45955 sqlite3_free(pKey);
45961 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
46003 sqlite3_free(pCur->pKey);
46004 pCur->pKey = 0;
46009 ** In this version of BtreeMoveto, pKey is a packed index record
46015 const void *pKey, /* Packed key if the btree is an index */
46016 i64 nKey, /* Integer key for tables. Size of pKey for indices */
46024 if( pKey ){
46026 pIdxKey = sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey,
46033 if( pKey ){
46054 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext);
46056 sqlite3_free(pCur->pKey);
46057 pCur->pKey = 0;
50593 const void *pKey, i64 nKey, /* The key */
50641 if( NEVER(nKey>0x7fffffff || pKey==0) ){
50645 pSrc = pKey;
51982 ** Insert a new record into the BTree. The key is given by (pKey,nKey)
51987 ** For an INTKEY table, only the nKey value of the key is used. pKey is
51991 ** MovetoUnpacked() to seek cursor pCur to (pKey, nKey) has already
51993 ** number if pCur points at an entry that is smaller than (pKey, nKey), or
51995 ** (pKey, nKey)).
52005 const void *pKey, i64 nKey, /* The key of the new record */
52035 assert( (pKey==0)==(pCur->pKeyInfo==0) );
52058 rc = btreeMoveto(pCur, pKey, nKey, appendBias, &loc);
52074 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew);
58058 ** Given the nKey-byte encoding of a record in pKey[], parse the
58073 const void *pKey, /* The binary record */
58077 const unsigned char *aKey = (const unsigned char *)pKey;
60790 Mem *pKey; /* MEM cell holding key for the record */
64314 Mem *pKey; /* MEM cell holding key for the record */
64335 u.bf.pKey = &aMem[pOp->p3];
64336 assert( u.bf.pKey->flags & MEM_Int );
64337 assert( memIsValid(u.bf.pKey) );
64338 REGISTER_TRACE(pOp->p3, u.bf.pKey);
64339 u.bf.iKey = u.bf.pKey->u.i;
70302 char *pKey;
70304 pKey = (char *)sqlite3IndexKeyinfo(pParse, pIdx);
70309 pKey,P4_KEYINFO_HANDOFF);
73538 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
73547 (char *)pKey, P4_KEYINFO_HANDOFF);
74358 Expr *pKey /* Database key for encryption extension */
74372 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
74396 sqlite3ExprCode(pParse, pKey, regArgs+2);
74415 sqlite3ExprDelete(db, pKey);
74443 ** ATTACH p AS pDbname KEY pKey
74445 SQLITE_PRIVATE void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){
74459 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
77130 KeyInfo *pKey; /* KeyInfo for index */
77154 pKey = sqlite3IndexKeyinfo(pParse, pIndex);
77156 (char *)pKey, P4_KEYINFO_HANDOFF);
78527 KeyInfo *pKey = (KeyInfo *)sqlite3DbMallocZero(db, nBytes);
78529 if( pKey ){
78530 pKey->db = pParse->db;
78531 pKey->aSortOrder = (u8 *)&(pKey->aColl[nCol]);
78532 assert( &pKey->aSortOrder[nCol]==&(((u8 *)pKey)[nBytes]) );
78536 pKey->aColl[i] = sqlite3LocateCollSeq(pParse, zColl);
78537 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
78539 pKey->nField = (u16)nCol;
78543 sqlite3DbFree(db, pKey);
78544 pKey = 0;
78546 return pKey;
81614 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
81617 sqlite3VdbeChangeP4(v, -1, (char*)pKey, P4_KEYINFO_HANDOFF);
83928 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
83931 (char*)pKey, P4_KEYINFO_HANDOFF);
84052 KeyInfo *pKey; /* Key information for an index */
84230 pKey = sqlite3IndexKeyinfo(pParse, pSrcIdx);
84232 (char*)pKey, P4_KEYINFO_HANDOFF);
84234 pKey = sqlite3IndexKeyinfo(pParse, pDestIdx);
84236 (char*)pKey, P4_KEYINFO_HANDOFF);
93930 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx);
93932 (char*)pKey, P4_KEYINFO_HANDOFF);
99994 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIx);
99999 (char*)pKey, P4_KEYINFO_HANDOFF);
108298 void *pKey; int nKey; /* Key associated with this element */
108304 ** FTS3_HASH_STRING pKey points to a string that is nKey bytes long
108308 ** FTS3_HASH_BINARY pKey points to binary data nKey bytes long.
108320 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
108321 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
108349 #define fts3HashKey(E) ((E)->pKey)
112262 const struct Fts3Keyword *pKey = &aKeyword[ii];
112264 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
112268 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
112270 int nKey = pKey->n;
112274 if( pKey->eType==FTSQUERY_NEAR ){
112296 pRet->eType = pKey->eType;
112924 if( pH->copyKey && elem->pKey ){
112925 fts3HashFree(elem->pKey);
112936 static int fts3StrHash(const void *pKey, int nKey){
112937 const char *z = (const char *)pKey;
112954 static int fts3BinHash(const void *pKey, int nKey){
112956 const char *z = (const char *)pKey;
113048 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
113061 const void *pKey, /* The key we are searching for */
113075 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
113109 if( pH->copyKey && elem->pKey ){
113110 fts3HashFree(elem->pKey);
113123 const void *pKey,
113132 h = (*xHash)(pKey,nKey);
113134 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
113139 ** that matches pKey,nKey. Return the data for this element if it is
113142 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
113145 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
113149 /* Insert an element into the hash table pH. The key is pKey,nKey
113166 const void *pKey, /* The key */
113179 hraw = (*xHash)(pKey, nKey);
113182 elem = fts3FindElementByHash(pH,pKey,nKey,h);
113202 if( pH->copyKey && pKey!=0 ){
113203 new_elem->pKey = fts3HashMalloc( nKey );
113204 if( new_elem->pKey==0 ){
113208 memcpy((void*)new_elem->pKey, pKey, nKey);
113210 new_elem->pKey = (void*)pKey;
