/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | index.h | 146 extern int ntfs_index_lookup(const void *key, const int key_len, 155 const void *key, const int keylen);
|
/haiku/src/add-ons/kernel/file_systems/exfat/ |
H A D | Inode.h | 203 static int Compare(KeyType key, const NodeType* node) argument 205 return key == node->ID() ? 0 206 : (key < node->ID() ? -1 : 1); 231 static int Compare(KeyType key, const NodeType* node) argument 233 return key == node->Cluster() ? 0 234 : (key < node->Cluster() ? -1 : 1);
|
/haiku/src/add-ons/print/drivers/gutenprint/ |
H A D | GPParameterVisitor.cpp | 192 const char* key = entry->name; local 195 stp_set_string_parameter(fVariables, kResolution, key); 200 ResolutionParameter(name, key, displayName, x, y); 204 stp_set_string_parameter(fVariables, kPageSize, key); 215 PageSizeParameter(name, key, displayName, pageSize, imageableArea); 217 StringParameter(name, key, displayName);
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | NameIndex.cpp | 193 NameIndex::InternalFind(const uint8 *key, size_t length) argument 195 if (!key || length == 0) 198 // if the key is not null-terminated, copy it 200 if (key[length - 1] != '\0') { 204 memcpy(clonedKey, key, length); 207 key = clonedKey; 212 if (!iterator->SetTo(this, (const char *)key)) {
|
H A D | TwoKeyAVLTree.h | 150 inline Node* Allocate(const Key& key, const Value& value) const argument 253 Value *FindFirst(const PrimaryKey &key, Iterator *iterator = NULL); 254 Value *FindLast(const PrimaryKey &key, Iterator *iterator = NULL); 373 TWO_KEY_AVL_TREE_CLASS_NAME::FindFirst(const PrimaryKey &key, argument 380 int cmp = fPrimaryKeyCompare(key, fGetPrimaryKey( 383 // found a matching node, now get the left-most node with that key 384 while (node->left && fPrimaryKeyCompare(key, 405 TWO_KEY_AVL_TREE_CLASS_NAME::FindLast(const PrimaryKey &key, argument 412 int cmp = fPrimaryKeyCompare(key, fGetPrimaryKey( 415 // found a matching node, now get the right-most node with that key [all...] |
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | multicast.h | 169 size_t HashKey(const KeyType &key) const 170 { return Addressing::HashAddress(*key.first) ^ key.second; } 174 bool Compare(const KeyType &key, ValueType *value) const argument 175 { return value->Interface()->index == key.second 176 && value->Address().s_addr == key.first->s_addr; }
|
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | multicast.h | 172 size_t HashKey(const KeyType &key) const 175 result = jenkins_hashword((const uint32*)key.first, 177 result = jenkins_hashword(&key.second, 1, result); 183 bool Compare(const KeyType &key, ValueType *value) const argument 184 { return value->Interface()->index == key.second 185 && value->Address() == *key.first; }
|
/haiku/src/system/boot/platform/openfirmware/ |
H A D | console.cpp | 351 // wait for a key 362 int key = translate_key(buffer[2]); local 363 if (key != 0) 364 return key; 385 int key = translate_key(buffer[2]); local 386 if (key != 0) 387 return key;
|
/haiku/src/system/kernel/fs/ |
H A D | EntryCache.cpp | 108 EntryCacheKey key(dirID, name); 115 EntryCacheEntry* entry = fEntries.Lookup(key); 150 EntryCacheKey key(dirID, name); 154 EntryCacheEntry* entry = fEntries.Lookup(key); 179 EntryCacheKey key(dirID, name); 183 EntryCacheEntry* entry = fEntries.Lookup(key);
|
/haiku/src/apps/debugger/user_interface/gui/ |
H A D | GraphicalUserInterface.cpp | 278 BString key(title); 279 key += choice1; 280 key += choice2; 281 key += choice3; 284 if (fDefaultActions.ItemAt(i)->fKey == key) 299 defaultAction->fKey = key;
|
/haiku/src/add-ons/media/plugins/ffmpeg/ |
H A D | AVFormatReader.cpp | 77 if (strcmp(entry->key, "TALB") == 0 || strcmp(entry->key, "TAL") == 0) 79 else if (strcmp(entry->key, "TCOM") == 0) 81 else if (strcmp(entry->key, "TCON") == 0 || strcmp(entry->key, "TCO") == 0) 83 else if (strcmp(entry->key, "TCOP") == 0) 85 else if (strcmp(entry->key, "TDRL") == 0 || strcmp(entry->key, "TDRC") == 0) 87 else if (strcmp(entry->key, "TENC") == 0 || strcmp(entry->key, "TE [all...] |
/haiku/src/bin/fwcontrol/ |
H A D | fwcrom.c | 131 if ((reg->key & CSRTYPE_MASK) == CSRTYPE_D) { 164 crom_search_key(struct crom_context *cc, uint8_t key) argument 170 if (reg->key == key) 189 if (reg->key == CSRKEY_SPEC && reg->val == spec) 194 if (reg->key == CSRKEY_VER && reg->val == ver) 217 if (reg->key != CROM_TEXTLEAF || 324 switch (reg->key & CSRTYPE_MASK) { 348 switch (reg->key) { 427 crom_add_entry(struct crom_chunk *chunk, int key, in argument 441 crom_add_chunk(struct crom_src *src, struct crom_chunk *parent, struct crom_chunk *child, int key) argument [all...] |
/haiku/src/kits/tracker/ |
H A D | ViewState.cpp | 212 uint32 key; local 213 if (stream->Read(&key, sizeof(uint32)) <= 0 218 key = SwapUInt32(key); 222 if (key != AttrHashString("BColumn", B_OBJECT_TYPE) 251 uint32 key = AttrHashString("BColumn", B_OBJECT_TYPE); local 252 stream->Write(&key, sizeof(uint32)); 256 // PRINT(("ArchiveToStream column, key %x, version %d\n", key, version)); 414 uint32 key local 537 uint32 key = AttrHashString("BViewState", B_OBJECT_TYPE); local [all...] |
/haiku/src/add-ons/input_server/filters/shortcut_catcher/ |
H A D | CommandActuators.cpp | 431 // This will handle key-repeats, which we don't want turned into lots 541 uint32 key = (uint32)FindKeyCode(arg.String()); local 543 if (key > 0) { 544 customKey = key; 545 const char* u = GetKeyUTF8(key); 680 int32 key = _LookupKeyCode(map, keys, map->normal_map, next, local 682 if (key < 0) { 683 key = _LookupKeyCode(map, keys, map->shift_map, next, states, 687 if (key < 0) { 688 key 832 _SetStateBit(uint8* setStates, uint32 key, bool on) const argument [all...] |
/haiku/src/libs/print/libprint/ |
H A D | JobSetupDlg.cpp | 592 const char* key = capability->Key(); local 594 name << "pds_" << key; local 599 if (fJobData->Settings().HasBoolean(key)) 600 value = fJobData->Settings().GetBoolean(key); 625 const char* key = capability->Key(); local 627 name << "pds_" << key; local 636 if (fJobData->Settings().HasInt(key)) 637 value = fJobData->Settings().GetInt(key); 645 IntRange intRange(label, key, range, slider); 665 const char* key local 667 name << "pds_" << key; local 692 GetDriverSpecificValue(PrinterCap::CapID category, const char* key) argument 970 const char* key = fPrinterCap->FindCap( local 983 const char* key = it->first.c_str(); local [all...] |
/haiku/headers/libs/print/libprint/ |
H A D | JobData.h | 35 bool HasString(const char* key) const; 36 const char* GetString(const char* key) const; 37 void SetString(const char* key, const char* value); 40 bool GetBoolean(const char* key) const; 41 void SetBoolean(const char* key, bool value); 44 int32 GetInt(const char* key) const; 45 void SetInt(const char* key, int32 value); 48 double GetDouble(const char* key) const; 49 void SetDouble(const char* key, double value);
|
/haiku/src/apps/soundrecorder/ |
H A D | TransportButton.cpp | 181 int32 key = 0; local 186 || message->FindInt32("key", &key) != B_OK) 214 uint32 key, uint32 modifiers, uint32 resizeFlags) 230 if (key) 231 keyPressFilter = new SkipButtonKeypressFilter(key, modifiers, this); 499 uint32 key, uint32 modifiers, uint32 resizeFlags) 503 NULL, NULL, 0, key, modifiers, resizeFlags), 634 uint32 key, uint32 modifiers, uint32 resizeFlags) 638 NULL, 0, key, modifier 208 TransportButton(BRect frame, const char *name, const unsigned char *normalBits, const unsigned char *pressedBits, const unsigned char *disabledBits, BMessage *invokeMessage, BMessage *startPressingMessage, BMessage *pressingMessage, BMessage *donePressingMessage, bigtime_t period, uint32 key, uint32 modifiers, uint32 resizeFlags) argument 497 PlayPauseButton(BRect frame, const char *name, BMessage *invokeMessage, BMessage *blinkMessage, uint32 key, uint32 modifiers, uint32 resizeFlags) argument 632 RecordButton(BRect frame, const char *name, BMessage *invokeMessage, BMessage *blinkMessage, uint32 key, uint32 modifiers, uint32 resizeFlags) argument [all...] |
H A D | TransportButton.h | 35 uint32 key = 0, // optional shortcut key 36 uint32 modifiers = 0, // optional shortcut key modifier 116 uint32 key = 0, // optional shortcut key 117 uint32 modifiers = 0, // optional shortcut key modifier 168 uint32 key = 0, // optional shortcut key 169 uint32 modifiers = 0, // optional shortcut key modifier
|
/haiku/src/bin/bfs_tools/ |
H A D | chkindex.cpp | 213 char key[B_FILE_NAME_LENGTH]; local 238 memcpy(key,&inode->InodeBuffer()->data.size,sizeof(off_t)); 243 strcpy(key,inode->Name()); 244 keyLength = strlen(key); 251 memcpy(key,&inode->InodeBuffer()->last_modified_time,sizeof(off_t)); 266 strncpy(key,(char *)data,B_FILE_NAME_LENGTH - 1); 267 key[B_FILE_NAME_LENGTH - 1] = '\0'; 278 if (tree.Find((uint8 *)key,keyLength,&value) < B_OK) 338 //printf("search for = %ld, key = %ld -> value = %lld (%ld, %d)\n",*(int32 *)&key,*(int3 [all...] |
/haiku/src/bin/bfs_tools/lib/ |
H A D | BPlusTree.cpp | 370 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument 417 // is the current key in the current node? 430 // reset current key 435 // there are no nodes left, so turn back to the last key 450 memcpy(key,keyStart,length); 456 ((char *)key)[length] = '\0'; 564 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next) argument 578 // binary search in the key array 586 int32 cmp = CompareKeys(key,keyLength,searchKey,searchLength); 619 status_t BPlusTree::SeekDown(Stack<node_and_key> &stack,uint8 *key,uint1 argument 651 InsertKey(bplustree_node *node,uint8 *key,uint16 keyLength,off_t value,uint16 index) argument 721 SplitNode(bplustree_node *node,off_t nodeOffset,uint16 *_keyIndex,uint8 *key,uint16 *_keyLength,off_t *_value) argument 950 Insert(uint8 *key,uint16 keyLength,off_t value) argument 1040 Find(uint8 *key,uint16 keyLength,off_t *value) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Key.h | 39 \brief Represents the on-disk structure for a key. 41 Unfortunately there exist two different key formats and one can not 46 class Key : private key { 49 Key(const Key &k) : key(k) {} 52 static Key* CastFrom(key* k) 54 static const Key* CastFrom(const key* k) 120 *static_cast<key*>(this) = k; 157 // VKey -- a versioned key 164 type fields of the key. If that is needed, the Compare() method has 263 TPRINT(("key [all...] |
/haiku/src/system/runtime_loader/ |
H A D | heap.cpp | 150 static int Compare(const FreeChunkKey& key, const FreeChunk* node) argument 152 return key.Compare(node); 344 FreeChunkKey key(size); 345 FreeChunk* chunk = sFreeChunkTree.FindClosest(key, true, true); 351 chunk = sFreeChunkTree.FindClosest(key, true, true);
|
/haiku/src/add-ons/kernel/drivers/network/ether/intel22x/dev/igc/ |
H A D | if_igc.h | 413 #define IGC_RSSRK_VAL(key, i) (key[(i) * IGC_RSSRK_SIZE] | \ 414 key[(i) * IGC_RSSRK_SIZE + 1] << 8 | \ 415 key[(i) * IGC_RSSRK_SIZE + 2] << 16 | \ 416 key[(i) * IGC_RSSRK_SIZE + 3] << 24)
|
/haiku/headers/private/kernel/util/ |
H A D | MultiHashTable.h | 106 ValueIterator Lookup(const KeyType &key) const 111 index = HashTable::fDefinition.HashKey(key) 117 if (HashTable::fDefinition.Compare(key, slot)) 140 // group values with the same key
|
/haiku/headers/private/locale/ |
H A D | HashMapCatalog.h | 26 * The key-type for the hash_map which maps native strings or IDs to 28 * The key-type should be efficient to use if it is just created by an ID 30 * which as a whole specify the key to the translated string. 43 // the hash-value of the key, computed from the three strings 59 // calculate the key 79 const char *GetString(const CatKey& key); 84 status_t SetString(const CatKey& key, const char *translated); 164 return current.key;
|