Home
last modified time | relevance | path

Searched refs:nKey (Results 1 – 5 of 5) sorted by relevance

/freebsd-12.1/contrib/ncurses/ncurses/win32con/
H A Dwin_driver.c813 WORD nKey = 0; in MapKey() local
827 nKey = LOWORD(key); in MapKey()
828 code = (int) (nKey & 0x7fff); in MapKey()
829 if (nKey & 0x8000) in MapKey()
1330 int nKey = MapKey(TCB, vk); in drv_twait() local
1488 WORD nKey; in drv_kyExist() local
1506 nKey = LOWORD(key); in drv_kyExist()
1507 if (!(nKey & 0x8000)) in drv_kyExist()
1534 WORD nKey; in drv_keyok() local
1552 nKey = (LOWORD(key)) & 0x7fff; in drv_keyok()
[all …]
/freebsd-12.1/crypto/heimdal/lib/sqlite/
H A Dsqlite3.h4230 const void *pKey, int nKey /* The key */
4243 const void *pKey, int nKey /* The new key */
H A Dsqlite3.c21857 nKey--; in strHash()
21954 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){ in findElementGivenHash()
22051 assert(nKey==elem->nKey); in sqlite3HashInsert()
22059 new_elem->nKey = nKey; in sqlite3HashInsert()
48921 assert( nKey==(i64)(int)nKey );
52317 nKey = (int)pCur->info.nKey;
53547 assert( info.nKey==nKey );
119937 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){
120603 if( nKey<=0 ) nKey = (int) strlen(z);
120788 int nKey
[all …]
/freebsd-12.1/contrib/sqlite3/
H A Dsqlite3.c65137 assert( nKey==(i64)(int)nKey );
68855 if( a->nKey!=b->nKey ) return 0;
70870 assert( info.nKey==pX->nKey );
73016 assert( pX->nKey==pCur->info.nKey );
73081 if( pCur->info.nKey==pX->nKey ){
73207 pCur->nKey = pX->nKey;
95547 int nKey = pReader->nKey;
129695 pSort->aDefer[nDefer].nKey = nKey;
130362 int nKey = pSort->aDefer[i].nKey;
174068 if( nKey<=0 ) nKey = (int) strlen(z);
[all …]
H A Dshell.c7092 int nKey = STRLEN(zKey); in idxHashAdd() local
7093 int iHash = idxHashString(zKey, nKey); in idxHashAdd()
7098 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashAdd()
7102 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1); in idxHashAdd()
7105 memcpy(pEntry->zKey, zKey, nKey); in idxHashAdd()
7107 pEntry->zVal = &pEntry->zKey[nKey+1]; in idxHashAdd()
7123 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ in idxHashFind() argument
7126 if( nKey<0 ) nKey = STRLEN(zKey); in idxHashFind()
7127 iHash = idxHashString(zKey, nKey); in idxHashFind()
7130 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashFind()
[all …]