Home
last modified time | relevance | path

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

/src/contrib/ncurses/ncurses/tinfo/
H A Dlib_win32con.c720 WORD nKey = 0; in MapKey() local
731 nKey = LOWORD(key); in MapKey()
732 code = (int) (nKey & 0x7fff); in MapKey()
733 if (nKey & 0x8000) in MapKey()
746 WORD nKey = 0; in AnsiKey() local
757 nKey = LOWORD(key); in AnsiKey()
758 code = (int) (nKey & 0x7fff); in AnsiKey()
759 if (nKey & 0x8000) in AnsiKey()
770 WORD nKey; in _nc_console_keyok() local
785 nKey = (LOWORD(key)) & 0x7fff; in _nc_console_keyok()
[all …]
/src/contrib/sqlite3/
H A Dsqlite3.c16742 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
70997 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */ member
71064 i64 nKey; /* Size of pKey, or last integer key */ member
72157 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
72275 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
72284 pCur->nKey = sqlite3BtreePayloadSize(pCur);
72285 pKey = sqlite3Malloc( ((i64)pCur->nKey) + 9 + 8 );
72287 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
72289 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
72416 i64 nKey, /* Integer key for tables. Size of pKey for indices */
[all …]
H A Dshell.c12991 int nKey = STRLEN(zKey); in idxHashAdd() local
12992 int iHash = idxHashString(zKey, nKey); in idxHashAdd()
12997 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashAdd()
13001 pEntry = idxMalloc(pRc, sizeof(IdxHashEntry) + nKey+1 + nVal+1); in idxHashAdd()
13004 memcpy(pEntry->zKey, zKey, nKey); in idxHashAdd()
13006 pEntry->zVal = &pEntry->zKey[nKey+1]; in idxHashAdd()
13022 static IdxHashEntry *idxHashFind(IdxHash *pHash, const char *zKey, int nKey){ in idxHashFind() argument
13025 if( nKey<0 ) nKey = STRLEN(zKey); in idxHashFind()
13026 iHash = idxHashString(zKey, nKey); in idxHashFind()
13029 if( STRLEN(pEntry->zKey)==nKey && 0==memcmp(pEntry->zKey, zKey, nKey) ){ in idxHashFind()
[all …]