/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | AttributeIndexImpl.cpp | 72 { memcpy(key, theKey, length); } 74 : attribute(attribute) { attribute->GetKey(key, &length); } 77 { memcpy(key, theKey, length); } 80 uint8 key[kMaxIndexKeyLength]; member in class:AttributeIndexImpl::PrimaryKey 109 return compare_keys(a.key, a.length, b.key, b.length, fType); 173 bool SetTo(AttributeIndexImpl *index, const uint8 *key, size_t length, 324 AttributeIndexImpl::InternalFind(const uint8 *key, size_t length) argument 326 if (!key || (fKeyLength > 0 && length != fKeyLength)) 330 if (!iterator->SetTo(this, key, lengt 443 SetTo(AttributeIndexImpl *index, const uint8 *key, size_t length, bool ignoreValue) argument [all...] |
H A D | Index.cpp | 59 Index::Find(const uint8 *key, size_t length, IndexEntryIterator *iterator) argument 62 if (key && iterator) { 64 = InternalFind(key, length);
|
/haiku/headers/private/kernel/util/ |
H A D | AVLTree.h | 61 Value* Find(const Key& key) const; 62 Value* FindClosest(const Key& key, bool less) const; 65 Value* Remove(const Key& key); 66 bool Remove(Value* key); 72 virtual int CompareKeyNode(const void* key, 335 AVLTree<Definition>::Find(const Key& key) const 337 if (AVLTreeNode* node = fTree.Find(&key)) 345 AVLTree<Definition>::FindClosest(const Key& key, bool less) const argument 347 if (AVLTreeNode* node = fTree.FindClosest(&key, less)) 371 AVLTree<Definition>::Remove(const Key& key) argument 388 CompareKeyNode(const void* key, const AVLTreeNode* node) argument [all...] |
/haiku/src/system/kernel/platform/atari_m68k/ |
H A D | platform.cpp | 418 uint8 key = 0; local 425 key = special; 427 return key; 430 key = special2; 432 return key; 441 //kprintf("no key\n"); 446 key = in8(IKBD_BASE+IKBD_DATA); 448 kprintf("key: %02x, %sshift %scontrol %salt\n", 449 key, 455 if (key [all...] |
/haiku/src/apps/debuganalyzer/model/ |
H A D | Model.h | 291 const type_and_object* key, 325 const type_and_object* key, 388 const type_and_object* key, 504 const creation_time_id* key, 582 size_t HashKey(thread_id key) const 583 { return (size_t)key; } 588 bool Compare(thread_id key, const ThreadSchedulingState* value) const argument 589 { return key == value->ID(); } 982 type_and_object key; local 983 key 991 CompareWithTypeObject(const type_and_object* key, const WaitObject* object) argument 1066 CompareWithTypeObject(const type_and_object* key, const WaitObjectGroup* group) argument 1181 CompareWithTypeObject(const type_and_object* key, const ThreadWaitObjectGroup* group) argument 1444 creation_time_id key; local 1452 CompareWithCreationTimeID(const creation_time_id* key, const Thread* thread) argument [all...] |
/haiku/src/tools/fs_shell/ |
H A D | hash.cpp | 40 int (*compare_func)(void *e, const void *key); 41 uint32_t (*hash_func)(void *e, const void *key, uint32_t range); 60 int compare_func(void *e, const void *key), 61 uint32_t hash_func(void *e, const void *key, uint32_t range)) 224 hash_lookup(struct hash_table *table, const void *key) argument 226 uint32_t hash = table->hash_func(NULL, key, table->table_size); 230 if (table->compare_func(element, key) == 0) 59 hash_init(uint32_t table_size, int next_ptr_offset, int compare_func(void *e, const void *key), uint32_t hash_func(void *e, const void *key, uint32_t range)) argument
|
/haiku/src/add-ons/kernel/file_systems/exfat/ |
H A D | Volume.cpp | 303 struct node_key key; local 304 key.cluster = cluster; 305 key.offset = offset; 308 struct node* node = fNodeTree.Lookup(key); 315 node->key = key; 333 return &node->key;
|
/haiku/src/system/boot/platform/riscv/ |
H A D | virtio.cpp | 284 int key = 0; local 286 key = pkt.code; 292 return key; 299 int key = 0; local 302 key = virtio_input_get_key(); 303 } while (key == 0); 305 return key;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.h | 62 status_t FindExact(Path* path, btrfs_key& key, 65 status_t FindNext(Path* path, btrfs_key& key, 68 status_t FindPrevious(Path* path, btrfs_key& key, 77 const btrfs_key& key) const; 112 /*! Search for key in the tree 114 * \return B_OK when key found, error code otherwise 116 status_t _Find(Path* path, btrfs_key& key, 193 status_t SearchSlot(const btrfs_key& key, int* slot, 283 TreeIterator(BTree* tree, const btrfs_key& key); 287 //! Set current key i [all...] |
H A D | BTree.cpp | 88 BTree::Node::SearchSlot(const btrfs_key& key, int* slot, btree_traversing type) argument 105 comp = key.Compare(*other); 112 return B_OK; // if key is in node 378 *_key = leaf->Item(slot)->key; 554 btrfs_key::Compare(const btrfs_key& key) const 556 if (ObjectID() > key.ObjectID()) 558 if (ObjectID() < key.ObjectID()) 560 if (Type() > key.Type()) 562 if (Type() < key.Type()) 564 if (Offset() > key 644 FindNext(Path* path, btrfs_key& key, void** _value, uint32* _size, uint32* _offset) const argument 652 FindPrevious(Path* path, btrfs_key& key, void** _value, uint32* _size, uint32* _offset) const argument 660 FindExact(Path* path, btrfs_key& key, void** _value, uint32* _size, uint32* _offset) const argument 889 TreeIterator(BTree* tree, const btrfs_key& key) argument 974 Find(const btrfs_key& key) argument [all...] |
/haiku/src/system/boot/platform/amiga_m68k/ |
H A D | console.cpp | 451 dprintf("key: class %d sclass %d code %d 0x%02x qual 0x%04x\n", 558 uint32 key; local 561 key = GetKey(); 562 if (key & 0x0000ffff == 0x0ff) 566 event.ie_Code = (uint16)(key & 0x0000ffff); 567 event.ie_Qualifier = (key & 0xffff0000) >> 16; 582 uint32 key; local 588 key = GetKey(); 589 } while (key & 0x0000ffff == 0x0ff); 593 event.ie_Code = (uint16)(key 790 int key = sInput.WaitForKey(); local [all...] |
/haiku/src/system/kernel/debug/ |
H A D | BreakpointManager.h | 89 static int Compare(addr_t key, const InstalledBreakpoint* node) argument 91 if (key < node->address) 93 return key == node->address ? 0 : 1;
|
/haiku/src/tests/kits/opengl/glut/game_mode/ |
H A D | game_mode.c | 11 void keyboard(unsigned char key, int x, int y); 116 keyboard(unsigned char key, int x, int y) argument 118 switch(key) {
|
/haiku/src/apps/stylededit/ |
H A D | FindWindow.cpp | 100 int8 key; local 101 if (message->FindInt8("byte", 0, &key) == B_OK) { 102 if (key == B_ESCAPE) {
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/ |
H A D | HaikuKernelFileSystem.cpp | 29 size_t HashKey(int32 key) const 30 { return key; } 33 bool Compare(int32 key, const HaikuKernelIORequest* value) const argument 34 { return value->id == key; } 46 size_t HashKey(int32 key) const 47 { return key; } 50 bool Compare(int32 key, const HaikuKernelIORequest* value) const argument 51 { return value->id == key; } 62 size_t HashKey(fs_vnode_ops* key) const 63 { return (size_t)(addr_t)key; } 66 Compare(fs_vnode_ops* key, const ValueType* value) const argument [all...] |
/haiku/src/tests/kits/locale/ |
H A D | collatorTest.cpp | 83 // Test sort key generation 100 BString key; local 101 gCollator->GetSortKey(strings[i], &key); 102 printf(" (%s)", key.String()); 115 " -c\tcomparison only, no sort key test\n"
|
/haiku/src/kits/locale/ |
H A D | DefaultCatalog.cpp | 164 DefaultCatalog::SetRawString(const CatKey& key, const char *translated) argument 166 return fCatMap.Put(key, translated); 391 res = archive.AddString("c:ostr", entry.key.fString.String()); 393 res = archive.AddString("c:ctxt", entry.key.fContext.String()); 395 res = archive.AddString("c:comt", entry.key.fComment.String()); 397 res = archive.AddInt32("c:hash", entry.key.fHashVal); 437 CatKey key; local 455 res = archiveMsg.FindInt32("c:hash", (int32*)&key.fHashVal); 459 key.fString = keyStr; 460 key [all...] |
/haiku/src/libs/compat/openbsd_wlan/crypto/ |
H A D | michael.c | 92 michael_key(const u_int8_t *key, MICHAEL_CTX *ctx) argument 95 GETLE32(key); 97 GETLE32(key + MICHAEL_RAW_BLOCK_LENGTH);
|
/haiku/headers/posix/sys/ |
H A D | sem.h | 60 int semget(key_t key, int numSems, int semFlags);
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/ |
H A D | fuse_config.c | 117 fuse_lib_opt_proc(void *data, const char *arg, int key, argument 122 (void)key; 189 static int fuse_mount_opt_proc(void *data, const char *arg, int key, argument 194 switch (key) {
|
/haiku/src/apps/cortex/Persistence/ |
H A D | StringContent.h | 86 const char* key,
|
/haiku/src/apps/debuganalyzer/gui/ |
H A D | SubWindow.h | 47 bool AddToSubWindowManager(SubWindowKey* key);
|
/haiku/src/apps/debugger/user_interface/gui/model/ |
H A D | VariablesViewStateHistory.cpp | 83 size_t HashKey(const Key& key) const 85 return key.HashValue(); 93 bool Compare(const Key& key, const StateEntry* value) const argument 95 return key == *value;
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | LastModifiedIndex.h | 30 virtual AbstractIndexIterator* InternalFind(const void* key,
|
H A D | SizeIndex.h | 30 virtual AbstractIndexIterator* InternalFind(const void* key,
|