Searched refs:nKey (Results 1 – 2 of 2) sorted by relevance
| /netbsd/src/external/public-domain/sqlite/dist/ |
| D | sqlite3.c | 16279 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
69634 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */
69695 i64 nKey; /* Size of pKey, or last integer key */
70739 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
70857 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
70866 pCur->nKey = sqlite3BtreePayloadSize(pCur);
70867 pKey = sqlite3Malloc( pCur->nKey + 9 + 8 );
70869 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
70871 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
70998 i64 nKey, /* Integer key for tables. Size of pKey for indices */
[all …]
|
| D | shell.c | 12073 int nKey = STRLEN(zKey); in idxHashAdd() local
12074 int iHash = idxHashString(zKey, nKey); in idxHashAdd()
12079 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashAdd()
12083 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1); in idxHashAdd()
12086 memcpy(pEntry->zKey, zKey, nKey); in idxHashAdd()
12088 pEntry->zVal = &pEntry->zKey[nKey+1]; in idxHashAdd()
12104 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ in idxHashFind() argument
12107 if( nKey<0 ) nKey = STRLEN(zKey); in idxHashFind()
12108 iHash = idxHashString(zKey, nKey); in idxHashFind()
12111 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashFind()
[all …]
|