/freebsd-11-stable/contrib/ncurses/ncurses/win32con/ |
H A D | win_driver.c | 813 WORD nKey = 0; local 827 nKey = LOWORD(key); 828 code = (int) (nKey & 0x7fff); 829 if (nKey & 0x8000) 1330 int nKey = MapKey(TCB, vk); local 1331 if ((nKey < 0) || FALSE == sp->_keypad_on) { 1488 WORD nKey; local 1506 nKey = LOWORD(key); 1507 if (!(nKey & 0x8000)) 1534 WORD nKey; local [all...] |
/freebsd-11-stable/crypto/heimdal/lib/sqlite/ |
H A D | sqlite3.h | 4230 const void *pKey, int nKey /* The key */ 4243 const void *pKey, int nKey /* The new key */
|
H A D | sqlite3.c | 4783 const void *pKey, int nKey /* The key */ 4796 const void *pKey, int nKey /* The new key */ 7377 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem 7384 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData); 7385 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey); 7404 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */ 8078 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey, 21852 static unsigned int strHash(const char *z, int nKey){ argument 21854 assert( nKey>=0 ); 21855 while( nKey > 21936 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument 22000 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument 22030 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument 47791 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo 47834 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor 48908 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument 52102 u32 nKey; local 52300 u32 nKey; local 53506 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument 54937 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument 61185 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, UnpackedRecord *p ) argument 63942 int nKey; member in struct:vdbeExecUnion::OP_IdxInsert_stack_vars 70397 int nKey; /* Number of bytes in key */ member in struct:VdbeSorterIter 71123 void *pKey; int nKey; /* Sorter key to copy into pOut */ local 71152 void *pKey; int nKey; /* Sorter key to compare pVal with */ local 78499 int nKey; local 99102 int nKey; local 113976 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem 115196 int nKey; local 119929 int nKey = pKey->n; local 120600 fts3StrHash(const void *pKey, int nKey) argument 120618 fts3BinHash(const void *pKey, int nKey) argument 120723 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument 120806 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument 120828 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument 123723 int nKey = fts3HashKeysize(pE); local [all...] |
/freebsd-11-stable/contrib/sqlite3/ |
H A D | sqlite3.c | 14032 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */ 15390 ** an arbitrary key and no data. These btrees have pKey,nKey set to the 15396 ** the key and passed in the nKey field. The pKey field is zero. 15406 ** nKey the ROWID length of pKey 15421 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member in struct:BtreePayload 64410 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */ member in struct:CellInfo 64471 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor 65768 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument 82391 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, UnpackedRecord *p ) argument 82556 vdbeAssertFieldCountWithinLimits( int nKey, const void *pKey, const KeyInfo *pKeyInfo ) argument 85429 vdbeUnpackRecord( KeyInfo *pKeyInfo, int nKey, const void *pKey ) argument 95101 int nKey; /* Number of bytes in key */ member in struct:PmaReader 96640 int nKey = pReader->nKey; local 97445 void *pKey; int nKey; /* Sorter key to copy into pOut */ local 97486 void *pKey; int nKey; /* Sorter key to compare pVal with */ local 113655 isDupColumn(Index *pIdx, int nKey, Index *pPk, int iCol) argument 116764 int nKey = pIdx->nKeyCol; local 117723 i16 nKey; /* Number of memory cells in the row key */ local 131222 int nKey; /* Number of PK columns for table pTab (>=1) */ member in struct:SortCtx::DeferredCsr 131808 int nKey; /* Number of sorting key columns, including OP_Sequence */ local 131979 int nKey = 1; local 132395 int nKey; local 132618 int nKey; /* Number of key columns in sorter record */ local 132690 int nKey = pSort->aDefer[i].nKey; local 140251 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */ local 169624 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem 171248 int nKey; local 177101 int nKey = pKey->n; local 178052 fts3StrHash(const void *pKey, int nKey) argument 178070 fts3BinHash(const void *pKey, int nKey) argument 178175 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument 178258 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument 178280 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument 181941 int nKey = fts3HashKeysize(pE); local 184455 fts3IncrmergeLoad( Fts3Table *p, sqlite3_int64 iAbsLevel, int iIdx, const char *zKey, int nKey, IncrmergeWriter *pWriter ) argument 185240 int nKey = pCsr->nTerm; local 189660 jsonLabelCompare(JsonNode *pNode, const char *zKey, u32 nKey) argument 189689 u32 i, j, nKey; local 190148 u32 nKey; local 219313 int nKey; /* Length of key in bytes */ member in struct:Fts5HashEntry [all...] |
H A D | shell.c | 8593 int nKey = STRLEN(zKey); local 8594 int iHash = idxHashString(zKey, nKey); 8599 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ 8603 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1); 8606 memcpy(pEntry->zKey, zKey, nKey); 8608 pEntry->zVal = &pEntry->zKey[nKey+1]; 8621 ** If zKey/nKey is present in the hash table, return a pointer to the 8624 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ argument 8627 if( nKey< 8644 idxHashSearch(IdxHash *pHash, const char *zKey, int nKey) argument [all...] |