Searched refs:key (Results 376 - 400 of 570) sorted by relevance

<<11121314151617181920>>

/haiku/src/add-ons/kernel/file_systems/bfs/
H A DQuery.cpp87 int32 type = 0, const uint8* key = NULL,
126 int32 type = 0, const uint8* key = NULL,
184 int32 type = 0, const uint8* key = NULL,
371 const uint8* key, size_t size)
381 if (key == NULL)
384 buffer = const_cast<uint8*>(key);
532 // let's see if we can use the beginning of the key for positioning
533 // the iterator and adjust the key size; if not, just leave the
848 /*! Returns true when the key matches the equation. You have to
916 const uint8* key, size_
370 Match(Inode* inode, const char* attributeName, int32 type, const uint8* key, size_t size) argument
[all...]
/haiku/src/servers/app/stackandtile/
H A DStackAndTile.cpp133 StackAndTile::KeyPressed(uint32 what, int32 key, int32 modifiers) argument
136 || (what == B_UNMAPPED_KEY_DOWN && key == kRightOptionKey)
137 || (what == B_UNMAPPED_KEY_UP && key == kRightOptionKey)) {
142 || (what == B_UNMAPPED_KEY_DOWN && key == kRightOptionKey);
155 switch (key) {
171 if (key == kLeftArrowKey
172 || (key == kTabKey && (modifiers & B_SHIFT_KEY) != 0)) {
/haiku/src/preferences/shortcuts/
H A DShortcutsWindow.cpp76 // meta-key.
91 // Creates a pop-up that allows the user to choose a key-cap visually
699 int32 key; local
710 && (message->FindInt32("key", &key) == B_OK)) {
712 bytes, key);
713 } else if (message->FindInt32("unmappedkey", &key) ==
716 && ((key > 0xFF) || (GetKeyName(key) != NULL))
718 key)));
[all...]
H A DShortcutsSpec.cpp77 // In this state, neither key may be pressed.
182 if (from->FindInt32("key", (int32*) &fKey) != B_NO_ERROR) {
184 printf(" Error, no key int32 in archive BMessage!\n");
230 into->AddInt32("key", fKey);
489 int32 key)
495 if (key > -1) {
496 if ((int32)fKey != key) {
497 fKey = key;
488 ProcessColumnKeyStroke(int whichColumn, const char* bytes, int32 key) argument
/haiku/src/kits/interface/
H A DAlert.cpp146 char key; local
148 if (data->FindInt8("_but_key", i, (int8*)&key) == B_OK)
149 fKeys[i] = key;
250 BAlert::SetShortcut(int32 index, char key) argument
253 fKeys[index] = key;
364 BAlert::AddButton(const char* label, char key) argument
371 fKeys.push_back(key);
H A DWindow.cpp94 Shortcut(uint32 key, uint32 modifiers,
96 Shortcut(uint32 key, uint32 modifiers,
100 bool Matches(uint32 key, uint32 modifiers) const;
107 static uint32 PrepareKey(uint32 key);
242 BWindow::Shortcut::Shortcut(uint32 key, uint32 modifiers, BMenuItem* item) argument
244 fKey(PrepareKey(key)),
253 BWindow::Shortcut::Shortcut(uint32 key, uint32 modifiers, BMessage* message, argument
256 fKey(PrepareKey(key)),
273 BWindow::Shortcut::Matches(uint32 key, uint32 modifiers) const argument
275 return fKey == key
298 PrepareKey(uint32 key) argument
1685 AddShortcut(uint32 key, uint32 modifiers, BMenuItem* item) argument
1699 AddShortcut(uint32 key, uint32 modifiers, BMessage* message) argument
1706 AddShortcut(uint32 key, uint32 modifiers, BMessage* message, BHandler* target) argument
1725 HasShortcut(uint32 key, uint32 modifiers) argument
1732 RemoveShortcut(uint32 key, uint32 modifiers) argument
3632 char key = bytes[0]; local
3881 _FindShortcut(uint32 key, uint32 modifiers) argument
[all...]
/haiku/src/system/kernel/debug/
H A Dsystem_profiler.cpp148 size_t HashKey(const WaitObjectKey& key) const
150 return (size_t)key.object ^ (size_t)key.type;
158 bool Compare(const WaitObjectKey& key, argument
161 return value->type == key.type
162 && value->object == key.object;
1209 WaitObjectKey key; local
1210 key.object = object;
1211 key.type = type;
1212 WaitObject* waitObject = fWaitObjectTable.Lookup(key);
1228 WaitObjectKey key; local
[all...]
/haiku/src/system/boot/loader/
H A Dmenu.cpp178 MenuItem::SetShortcut(char key) argument
180 fShortcut = key;
390 Menu::AddShortcut(char key, shortcut_hook function) argument
396 shortcut->key = key;
405 Menu::FindShortcut(char key) const
407 if (key == 0)
412 if (shortcut->key == key)
421 return superMenu->FindShortcut(key);
428 FindItemByShortcut(char key) argument
[all...]
/haiku/src/libs/compat/openbsd_wlan/crypto/
H A Daes.c329 * Base key schedule code. The function sub_word() must be defined
334 aes_keysched_base(uint32_t *skey, const void *key, size_t key_len) argument
356 tmp = dec32le((const unsigned char *)key + (i << 2));
378 * AES key schedule, constant-time version. skey[] is filled with n+1
380 * on key size). The number of rounds is returned. If the key size is
384 aes_ct_keysched(uint32_t *comp_skey, const void *key, size_t key_len) argument
389 num_rounds = aes_keysched_base(skey, key, key_len);
661 AES_Setkey(AES_CTX *ctx, const uint8_t *key, int len) argument
663 ctx->num_rounds = aes_ct_keysched(ctx->sk, key, le
769 AES_KeySetup_Encrypt(uint32_t *skey, const uint8_t *key, int len) argument
840 AES_KeySetup_Decrypt(uint32_t *skey, const uint8_t *key, int len) argument
[all...]
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dindex.c276 fn = (FILE_NAME_ATTR *)&ie->key;
515 * Make sure data and key do not overflow from entry.
532 && ((le16_to_cpu(ie->key_length) + offsetof(INDEX_ENTRY, key))
540 if ((offsetof(INDEX_ENTRY, key.file_name.file_name)
541 + ie->key.file_name.file_name_length
564 * Find a key in the index block.
575 static int ntfs_ie_lookup(const void *key, const int key_len, argument
602 * The last entry cannot contain a key. It can however contain
616 /* Make sure key and data do not overflow from entry */
622 rc = icx->collate(icx->ni->vol, key, key_le
769 ntfs_index_lookup(const void *key, const int key_len, ntfs_index_context *icx) argument
1960 ntfs_index_remove(ntfs_inode *dir_ni, ntfs_inode *ni __attribute__((unused)), const void *key, const int keylen) argument
[all...]
/haiku/src/add-ons/mail_daemon/inbound_protocols/pop3/
H A Dmd5c.c333 const unsigned char* key, int key_len)
337 * key XORd with ipad
340 * key XORd with opad
345 /* start out by storing key in pads */
349 /* if key is longer than 64 bytes reset it to key=MD5(key) */
353 MD5Update(&tctx, (unsigned char*)key, key_len);
357 memcpy(k_ipad, key, key_len);
358 memcpy(k_opad, key, key_le
331 MD5Hmac(unsigned char *digest, const unsigned char* text, int text_len, const unsigned char* key, int key_len) argument
400 MD5HexHmac(char *hexdigest, const unsigned char* text, int text_len, const unsigned char* key, int key_len) argument
[all...]
/haiku/src/libs/glut/
H A DglutEvent.cpp211 win->keyboard(win->key, win->keyX, win->keyY);
235 win->keyboardUp(win->key, win->keyX, win->keyY);
416 switch(Window()->CurrentMessage()->FindInt32("key")) {
500 key = aChar;
512 // for the option key.. but we need to get the raw character,
514 key = Window()->CurrentMessage()->FindInt32("raw_char");
537 switch(Window()->CurrentMessage()->FindInt32("key")) {
621 key = aChar;
633 // for the option key.. but we need to get the raw character,
635 key
[all...]
/haiku/src/apps/icon-o-matic/
H A DCanvasView.cpp374 CanvasView::_HandleKeyDown(uint32 key, uint32 modifiers) argument
376 switch (key) {
398 return StateView::_HandleKeyDown(key, modifiers);
406 CanvasView::_HandleKeyUp(uint32 key, uint32 modifiers) argument
408 switch (key) {
415 return StateView::_HandleKeyUp(key, modifiers);
/haiku/src/kits/tracker/
H A DTextWidget.cpp309 uchar key; local
310 if (message->FindInt8("byte", (int8*)&key) != B_OK)
322 if (key == B_RETURN || key == B_ESCAPE) {
323 view->CommitActivePose(key == B_RETURN);
327 if (key == B_TAB) {
H A DIconCache.h124 size_t HashKey(KeyType key) const
126 return Class::Hash(key);
134 bool Compare(KeyType key, ValueType* value) const argument
136 return *value == key;
/haiku/headers/private/kernel/util/
H A DHeap.h88 inline status_t Insert(Element* element, Key key);
249 HEAP_CLASS_NAME::Insert(Element* element, Key key) argument
265 link->fKey = key;
/haiku/src/add-ons/locale/catalogs/plaintext/
H A DCatalog.cpp261 // SetString(key, translated.c_str());
313 original = entry.key.fString;
314 comment = entry.key.fComment;
323 << entry.key.fContext.String() << "\t"
/haiku/headers/private/kernel/vm/
H A DVMCache.h60 static int Compare(page_num_t key, const NodeType* node) argument
62 return key == node->cache_offset ? 0
63 : (key < node->cache_offset ? -1 : 1);
/haiku/src/system/libroot/add-ons/icu/
H A DICULocaleBackend.cpp465 pthread_key_t key; local
467 pthread_key_create(&key, ICULocaleBackend::_DestroyThreadLocalStorageValue);
469 return key;
/haiku/src/apps/cortex/RouteApp/
H A DDormantNodeIO.cpp165 // " key: %s\n"
298 context.writeAttr("key", m_nodeKey);
507 const char* key,
511 if(!strcmp(key, "key")) {
516 err << "DormantNodeIO: unknown attribute '" << key << "'\n"; local
506 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_superg.h145 int hdrspace, struct ieee80211_key *key);
/haiku/src/tests/system/kernel/util/
H A DBOpenHashTableTest.cpp47 size_t HashKey(const KeyType& key) const
49 return key;
57 bool Compare(const KeyType& key, Entry* entry) const argument
59 return key == entry->fValue;
/haiku/src/add-ons/input_server/devices/virtio/
H A DVirtioInputDevice.h99 uint32 key);
/haiku/src/system/kernel/
H A Dimage.cpp43 size_t HashKey(image_id key) const { return key; }
45 bool Compare(image_id key, struct image* value) const argument
46 { return value->info.basic_info.id == key; }
H A Dcondition_variable.cpp35 size_t HashKey(const void* key) const
36 { return (size_t)key; }
39 bool Compare(const void* key, ConditionVariable* variable) const argument
40 { return key == variable->fObject; }
508 kprintf("no condition variable at or with key %p\n", (void*)address);

Completed in 543 milliseconds

<<11121314151617181920>>