Searched refs:nKey (Results 1 - 3 of 3) sorted by relevance

/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/etc/c/
H A Dsqlite3.d1174 const(void)*pKey, int nKey /** The key */
1180 const(void)* pKey, int nKey /* The key */
1193 const(void)*pKey, int nKey /** The new key */
1198 const(void)* pKey, int nKey /* The new key */
/netbsd-current/external/public-domain/sqlite/dist/
H A Dsqlite3.c14433 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
16248 ** an arbitrary key and no data. These btrees have pKey,nKey set to the
16254 ** the key and passed in the nKey field. The pKey field is zero.
16264 ** nKey the ROWID length of pKey
16279 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member in struct:BtreePayload
69634 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */ member in struct:CellInfo
69695 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
70995 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
88559 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, UnpackedRecord *p ) argument
88735 vdbeAssertFieldCountWithinLimits( int nKey, const void *pKey, const KeyInfo *pKeyInfo ) argument
92011 vdbeUnpackRecord( KeyInfo *pKeyInfo, int nKey, const void *pKey ) argument
102615 int nKey; /* Number of bytes in key */ member in struct:PmaReader
104156 int nKey = pReader->nKey; local
104962 void *pKey; int nKey; /* Sorter key to copy into pOut */ local
105003 void *pKey; int nKey; /* Sorter key to compare pVal with */ local
122881 isDupColumn(Index *pIdx, int nKey, Index *pPk, int iCol) argument
126169 int nKey = pIdx->nKeyCol; local
127181 i16 nKey; /* Number of memory cells in the row key */ local
141848 int nKey; /* Number of PK columns for table pTab (>=1) */ member in struct:SortCtx::DeferredCsr
142543 int nKey; /* Number of sorting key columns, including OP_Sequence */ local
142847 int nKey = 1; local
143226 int nKey; local
143450 int nKey; /* Number of key columns in sorter record */ local
143538 int nKey = pSort->aDefer[i].nKey; local
148491 int nKey; /* Key columns to be skipped */ local
152387 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */ local
184147 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
185780 int nKey; local
191726 int nKey = pKey->n; local
192677 fts3StrHash(const void *pKey, int nKey) argument
192695 fts3BinHash(const void *pKey, int nKey) argument
192800 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
192883 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
192905 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
196577 int nKey = fts3HashKeysize(pE); local
199111 fts3IncrmergeLoad( Fts3Table *p, sqlite3_int64 iAbsLevel, int iIdx, const char *zKey, int nKey, IncrmergeWriter *pWriter ) argument
199897 int nKey = pCsr->nTerm; local
205910 u32 i, j, k, nKey, sz, n, iEnd, rc; local
238071 int nKey; /* Length of key in bytes */ member in struct:Fts5HashEntry
[all...]
H A Dshell.c12073 int nKey = STRLEN(zKey); local
12074 int iHash = idxHashString(zKey, nKey);
12079 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){
12083 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1);
12086 memcpy(pEntry->zKey, zKey, nKey);
12088 pEntry->zVal = &pEntry->zKey[nKey+1];
12101 ** If zKey/nKey is present in the hash table, return a pointer to the
12104 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ argument
12107 if( nKey<
12124 idxHashSearch(IdxHash *pHash, const char *zKey, int nKey) argument
[all...]

Completed in 642 milliseconds