/haiku/src/kits/print/ |
H A D | PrintPanel.cpp | 34 int32 key; local 36 if (msg->FindInt32("key", &key) == B_OK && key == 1) {
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | reiserfs.h | 71 // directories use this key as well as old files 91 struct key { struct 107 key blk_right_delim_key; /* kept only for compatibility */ 119 * its key.*/ 120 struct key ih_key; 125 item. Note that the key, not this field, is used to 186 uint32 deh_offset; /* third component of the directory entry key */
|
/haiku/src/apps/drivesetup/ |
H A D | AbstractParametersPanel.cpp | 53 uint32 key; local 54 if (message->FindInt32("raw_char", (int32*)&key) >= B_OK) { 55 if (key == B_ESCAPE) {
|
/haiku/src/servers/app/drawing/interface/remote/ |
H A D | RemoteEventStream.cpp | 195 int32 key; local 196 if (message.Read(key) == B_OK) 197 event->AddInt32("key", key);
|
/haiku/src/apps/stylededit/ |
H A D | ReplaceWindow.cpp | 142 int8 key; local 143 if (message->FindInt8("byte", 0, &key) == B_OK) { 144 if (key == B_ESCAPE) { 149 // unlike the hack above. This kind of key filtering probably
|
/haiku/src/tools/locale/ |
H A D | linkcatkeys.cpp | 118 const CatKey &key(walker.GetKey()); 120 if (!targetCatImpl.GetString(key)) 121 targetCatImpl.SetRawString(key, walker.GetValue()); 168 fprintf(stderr, "%d key%s found and written to %s\n",
|
/haiku/src/apps/cortex/TipManager/ |
H A D | TipManager.cpp | 80 int8 key; local 81 message->FindInt8("byte", &key); 82 if(key == 'q') 277 // ignored, since I receive key events bound for other apps
|
/haiku/src/system/kernel/arch/sparc/ |
H A D | arch_platform.cpp | 165 int key; local 166 if (of_interpret("key", 0, 1, &key) == OF_FAILED) 168 return (char)key;
|
/haiku/src/libs/print/libprint/ |
H A D | BlockingWindow.cpp | 56 int32 key; local 58 if (msg->FindInt32("key", &key) == B_OK && key == 1) {
|
/haiku/src/apps/haikudepot/server/ |
H A D | ServerHelper.cpp | 253 // the names and values (strings) are key-value pairs indicating 261 BString key; local 263 if (dataItemMessage.FindString("key", &key) == B_OK 265 failures.AddFailure(key, value); 267 HDERROR("possibly corrupt validation message missing key "
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | ExtentAllocator.cpp | 445 btrfs_key key; local 446 key.SetType(BTRFS_KEY_TYPE_METADATA_ITEM); 448 key.SetType(BTRFS_KEY_TYPE_EXTENT_ITEM); 449 key.SetObjectID(start); 450 key.SetOffset(0); 452 TreeIterator iterator(fCurrentExtentTree, key); 456 key = iterator.Key(); 458 if (key.ObjectID() != Start()) 460 // When we couldn't find the item and key has 462 // key' [all...] |
/haiku/src/system/libnetwork/netresolv/dst/ |
H A D | support.c | 101 dst_s_id_calc(const u_char *key, const int keysize) argument 104 const u_char *kp = key; 107 if (!key || (keysize <= 0)) 127 * the key footprint/id calculated from the key data 143 /* compute a checksum on the key part of the key rr */ 228 * filename for a key file. '/', '\' and ':' are not allowed. 257 * Builds a key filename from the key nam [all...] |
/haiku/src/apps/mediaplayer/ |
H A D | VideoView.cpp | 185 rgb_color key; local 187 fVideoFrame, &key, B_FOLLOW_ALL, 190 fOverlayKeyColor = key; 191 SetLowColor(key); 210 rgb_color key; local 212 &key, B_FOLLOW_ALL, B_OVERLAY_FILTER_HORIZONTAL
|
/haiku/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 38 size_t HashKey(KeyType key) const 40 return key >> 1; 48 bool Compare(KeyType key, ValueType* value) const 50 return value->bar == key; 153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const 158 size_t index = fDefinition.HashKey(key) & (fTableSize - 1); 162 if (fDefinition.Compare(key, slot)) 201 // TODO: a ValueType* Remove(const KeyType& key) method is missing 402 Iterator GetIterator(typename TypeOperation<KeyType>::ConstRefT key) const 407 size_t index = fDefinition.HashKey(key) [all...] |
/haiku/headers/private/kernel/util/ |
H A D | OpenHashTable.h | 38 size_t HashKey(KeyType key) const 40 return key >> 1; 48 bool Compare(KeyType key, ValueType* value) const 50 return value->bar == key; 153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const 158 size_t index = fDefinition.HashKey(key) & (fTableSize - 1); 162 if (fDefinition.Compare(key, slot)) 201 // TODO: a ValueType* Remove(const KeyType& key) method is missing 402 Iterator GetIterator(typename TypeOperation<KeyType>::ConstRefT key) const 407 size_t index = fDefinition.HashKey(key) [all...] |
/haiku/src/apps/cortex/Persistence/Wrappers/ |
H A D | FlatMessageIO.cpp | 164 const char* key, 167 if(!strcmp(key, "encoding")) { 163 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument
|
/haiku/src/libs/compat/openbsd_wlan/crypto/ |
H A D | arc4.c | 30 rc4_keysetup(struct rc4_ctx *ctx, u_char *key, u_int32_t klen) argument 39 y = (key[x] + ctx->state[i] + y) & (RC4STATE - 1);
|
H A D | cmac.c | 51 AES_CMAC_SetKey(AES_CMAC_CTX *ctx, const u_int8_t key[AES_CMAC_KEY_LENGTH]) argument 53 AES_Setkey(&ctx->aesctx, key, 16);
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Attribute.cpp | 73 // get the current key for the attribute 81 // If there is an index and a change has been made within the key, notify 110 Attribute::GetKey(uint8 *key, size_t *length) argument 113 ReadAt(0, key, *length, length);
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/ |
H A D | helper.c | 88 static int fuse_helper_opt_proc(void *data, const char *arg, int key, argument 93 switch (key) {
|
/haiku/src/system/kernel/vm/ |
H A D | VMAnonymousCache.cpp | 109 swap_hash_key key; member in struct:swap_block 120 size_t HashKey(const swap_hash_key& key) const 122 off_t blockIndex = key.page_index >> SWAP_BLOCK_SHIFT; 123 VMAnonymousCache* cache = key.cache; 129 return HashKey(value->key); 132 bool Compare(const swap_hash_key& key, const swap_block* value) const argument 134 return (key.page_index & ~(off_t)SWAP_BLOCK_MASK) 135 == (value->key.page_index & ~(off_t)SWAP_BLOCK_MASK) 136 && key.cache == value->key 534 swap_hash_key key = { this, pageIndex }; local 657 swap_hash_key key = { this, pageIndex }; local 755 swap_hash_key key = { this, pageIndex }; local 1062 swap_hash_key key = { this, pageIndex }; local 1105 swap_hash_key key = { this, pageIndex }; local 1131 swap_hash_key key = { this, pageIndex }; local 1276 swap_hash_key key = { source, swapBlockPageIndex }; local [all...] |
/haiku/headers/os/interface/ |
H A D | Alert.h | 66 void SetShortcut(int32 buttonIndex, char key); 75 void AddButton(const char* label, char key = 0);
|
/haiku/src/add-ons/kernel/network/protocols/tcp/ |
H A D | EndpointManager.h | 44 size_t HashKey(const KeyType& key) const; 46 bool Compare(const KeyType& key,
|
/haiku/src/apps/deskcalc/ |
H A D | CalcView.h | 82 // Flash the key on the keypad 85 // Toggle whether or not the Num Lock key starts on 100 void _PressKey(int key); 103 void _FlashKey(int32 key, uint32 flashFlags);
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 1043 BPlusTree::_FindKey(const bplustree_node* node, const uint8* key, argument 1061 // binary search in the key array 1076 int32 cmp = _CompareKeys(key, keyLength, searchKey, searchLength); 1105 following the key, from the root node to the leaf node that could 1106 or should contain that key. 1109 BPlusTree::_SeekDown(Stack<node_and_key>& stack, const uint8* key, argument 1129 status_t status = _FindKey(node, key, keyLength, &nodeAndKey.keyIndex, 1233 // Test if the fragment will be empty if we remove this key's 1285 // search for free space in the duplicate nodes of that key 1365 BPlusTree::_InsertKey(bplustree_node* node, uint16 index, uint8* key, argument 1417 _SplitNode(bplustree_node* node, off_t nodeOffset, bplustree_node* other, off_t otherOffset, uint16* _keyIndex, uint8* key, uint16* _keyLength, off_t* _value) argument 1678 Insert(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument 2052 uint8* key = node->KeyAt(index, &length); local 2098 Remove(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument 2221 Replace(Transaction& transaction, const uint8* key, uint16 keyLength, off_t value) argument 2277 Find(const uint8* key, uint16 keyLength, off_t* _value) argument 2366 uint8* key = parent->KeyAt(i, &keyLength); local 2521 _ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level, off_t offset, off_t lastOffset, off_t nextOffset, const uint8* key, uint16 keyLength) argument 2640 Traverse(int8 direction, void* key, uint16* keyLength, uint16 maxLength, off_t* value, uint16* duplicate) argument 2808 Find(const uint8* key, uint16 keyLength) argument 3002 uint8* key = KeyAt(i, &length); local [all...] |