/haiku/src/system/kernel/fs/ |
H A D | EntryCache.h | 61 uint32 HashKey(const EntryCacheKey& key) const 63 return key.hash; 72 bool Compare(const EntryCacheKey& key, const EntryCacheEntry* value) const argument 74 return value->dir_id == key.dir_id 75 && strcmp(value->name, key.name) == 0;
|
/haiku/src/apps/icon-o-matic/generic/gui/stateview/ |
H A D | StateView.cpp | 22 // key events for a given control is ok 51 uint32 key; local 53 if (message->FindInt32("raw_char", (int32*)&key) >= B_OK 55 if (fTarget->HandleKeyDown(key, modifiers)) 66 uint32 key; local 68 if (message->FindInt32("raw_char", (int32*)&key) >= B_OK 70 if (fTarget->HandleKeyUp(key, modifiers)) 296 uint32 key; local 300 && message->FindInt32("raw_char", (int32*)&key) >= B_OK 302 if (HandleKeyDown(key, modifier 312 uint32 key; local 404 HandleKeyDown(uint32 key, uint32 modifiers) argument 430 HandleKeyUp(uint32 key, uint32 modifiers) argument 523 _HandleKeyDown(uint32 key, uint32 modifiers) argument 530 _HandleKeyUp(uint32 key, uint32 modifiers) argument [all...] |
/haiku/src/tests/system/kernel/util/ |
H A D | OrderedMapTest.h | 108 inline void Generate(Key &key, Value &value) argument 110 key = GenerateKey(); 138 inline void Generate(Key &key, Value &value) argument 141 key = fGetKey(value); 329 void Insert(const Key &key, const Value &value) argument 331 CHK(fMyMap.Insert(key, value) == B_OK); 332 fReferenceMap[key] = value; 336 void Put(const Key &key, const Value &value) argument 338 CHK(fMyMap.Put(key, value) == B_OK); 339 fReferenceMap[key] 343 Get(const Key &key) argument 357 Remove(const Key &key) argument 478 Find(const Key &key) argument 504 FindClose(const Key &key, bool less) argument 533 FindClose(const Key &key, bool less) const argument 675 Key key; local 716 Key key; local 762 Key key = it->Key(); local 800 Key key; local 823 Key key = v.IteratorForIndex(index)->Key(); local 942 Key key = v.IteratorForIndex(i)->Key(); local 953 Key key = v.IteratorForIndex(i)->Key(); local 1004 Key key = v.IteratorForIndex(i)->Key(); local 1024 Key key = entryStrategy.GenerateKey(); local [all...] |
/haiku/src/apps/debuganalyzer/model/ |
H A D | ThreadModel.h | 80 const type_and_name* key, 178 type_and_name key; local 179 key.type = a->Type(); 180 key.name = a->Name(); 181 return CompareWithTypeName(&key, b); 186 ThreadModel::WaitObjectGroup::CompareWithTypeName(const type_and_name* key, argument 189 if (key->type != group->Type()) 190 return key->type < group->Type() ? -1 : 1; 192 return strcmp(key->name, group->Name());
|
/haiku/src/libs/print/libprint/ |
H A D | JobData.cpp | 79 DriverSpecificSettings::HasString(const char* key) const 82 return fSettings.FindString(key, &value) == B_OK; 87 DriverSpecificSettings::GetString(const char* key) const 89 ASSERT(HasString(key)); 91 fSettings.FindString(key, &value); 97 DriverSpecificSettings::SetString(const char* key, const char* value) argument 99 if (HasString(key)) 100 fSettings.ReplaceString(key, value); 102 fSettings.AddString(key, value); 107 DriverSpecificSettings::HasBoolean(const char* key) cons 125 SetBoolean(const char* key, bool value) argument 153 SetInt(const char* key, int32 value) argument 181 SetDouble(const char* key, double value) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/ |
H A D | Node.h | 151 size_t HashKey(const StringKey& key) const 153 return key.Hash(); 161 bool Compare(const StringKey& key, const Node* value) const argument 163 return key == value->Name(); 177 size_t HashKey(ino_t key) const 179 return (uint64)(key >> 32) ^ (uint32)key; 187 bool Compare(ino_t key, const Node* value) const argument 189 return value->ID() == key;
|
/haiku/src/apps/haikudepot/model/ |
H A D | ValidationFailure.cpp | 90 BString key; local 94 key.SetToFormat("%s%" B_PRId32, KEY_PREFIX_MESSAGE, i); 95 result = into->AddString(key, fMessages.StringAt(i)); 173 BString key; local 180 key.SetToFormat("%s%" B_PRId32, KEY_PREFIX_ITEM, i); 181 result = into->AddMessage(key, &itemMessage); 220 BString key; local 224 key.SetToFormat("%s%" B_PRId32, KEY_PREFIX_ITEM, i); 225 if (from->FindMessage(key, &itemMessage) != B_OK)
|
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
H A D | PackageSettings.h | 128 size_t HashKey(const EntryKey& key) const 130 return key.Hash(); 138 bool Compare(const EntryKey& key, const Entry* value) const argument 140 return key.Parent() == value->Parent() 141 && strcmp(key.Name(), value->Name()) == 0; 167 size_t HashKey(const StringKey& key) const 169 return key.Hash(); 177 bool Compare(const StringKey& key, const PackageSettingsItem* value) const argument 179 return key == value->Name();
|
/haiku/src/apps/mail/ |
H A D | WIndex.cpp | 218 WIndex::Lookup(int32 key) argument 231 if (key < ((WIndexEntry *)(fEntryList + (M * fEntrySize)))->key) 233 else if (key > ((WIndexEntry *)(fEntryList + (M * fEntrySize)))->key) 305 int32 key = 0; local 313 key ^= (a * x + b) % m; 314 key <<= 1; 317 key = update_crc(0, s, strlen(s)); 319 if (key < 356 int32 key; local [all...] |
/haiku/src/bin/unzip/ |
H A D | crypt.c | 91 /* char *key = (char *)NULL; moved to globals.h */ 94 local int testkey OF((__GPRO__ ZCONST uch *h, ZCONST char *key)); 360 if (key != (char *)NULL) { /* key is the global password pointer */ 408 if (!GLOBAL(key)) { 409 if ((GLOBAL(key) = (char *)malloc(strlen(passwrd)+1)) == 412 strcpy(GLOBAL(key), passwrd); 415 } else if (GLOBAL(key)) { /* get rid of previous zipfile's key */ 416 free(GLOBAL(key)); 417 GLOBAL(key) = (char *)NULL; variable 437 GLOBAL(key) = NULL; variable 441 *GLOBAL(key) = '\\0'; /* We try the NIL password, ... */ variable 517 ZCONST char *key; /* decryption password to test */ variable 528 init_keys(__G__ key); variable [all...] |
H A D | cryptf.c | 94 /* char *key = (char *)NULL; moved to globals.h */ 97 local int testkey OF((__GPRO__ ZCONST uch *h, ZCONST char *key)); 363 if (key != (char *)NULL) { /* key is the global password pointer */ 411 if (!GLOBAL(key)) { 412 if ((GLOBAL(key) = (char *)malloc(strlen(passwrd)+1)) == 415 strcpy(GLOBAL(key), passwrd); 418 } else if (GLOBAL(key)) { /* get rid of previous zipfile's key */ 419 free(GLOBAL(key)); 420 GLOBAL(key) = (char *)NULL; variable 440 GLOBAL(key) = NULL; variable 444 *GLOBAL(key) = '\\0'; /* We try the NIL password, ... */ variable 520 ZCONST char *key; /* decryption password to test */ variable 531 init_keys(__G__ key); variable [all...] |
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | StringPool.cpp | 68 StringPool::_GetLocked(const StringDataKey& key) argument 70 if (StringData* string = sStrings->Lookup(key)) { 87 StringDataKey key(string, length); 88 StringData* data = _GetLocked(key); 94 StringData* newString = StringData::Create(key); 100 data = _GetLocked(key);
|
/haiku/src/apps/cortex/RouteApp/ |
H A D | LiveNodeIO.cpp | 100 // match key against previously imported nodes 101 err = context->getNodeFor(key(), outNode); 104 // match key against system nodes 105 err = _match_system_node_key(key(), manager, outNode); 109 "!!! No node found for key '%s'\n", 110 key())); 169 context.writeAttr("key", m_key.String()); 197 const char* key, 201 if(!strcmp(key, "key")) { 196 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument 206 err << "LiveNodeIO: unknown attribute '" << key << "'\\n"; local [all...] |
H A D | NodeSetIOContext.h | 70 // If no key is given, a new one will be generated. 73 const char* key=0); 95 const char* key, 100 // the node/key set 105 // next node key value
|
/haiku/src/libs/compat/openbsd_wlan/net80211/ |
H A D | ieee80211_crypto.c | 93 /* clear pre-shared key from memory */ 115 * Return the length in bytes of a cipher suite key (see Table 60). 203 /* All other cases (including WEP) use a group key. */ 230 /* retrieve group data key id from IV field */ 239 /* retrieve integrity group key id from MMIE */ 261 panic("%s: key unset for sw crypto: id=%d cipher=%d flags=0x%x", 280 panic("invalid key cipher 0x%x", k->k_cipher); 291 /* find key for decryption */ 313 /* key not defined */ 324 ieee80211_prf(const u_int8_t *key, size_ argument 353 ieee80211_kdf(const u_int8_t *key, size_t key_len, const u_int8_t *label, size_t label_len, const u_int8_t *context, size_t context_len, u_int8_t *output, size_t len) argument 466 ieee80211_eapol_key_mic(struct ieee80211_eapol_key *key, const u_int8_t *kck) argument 501 ieee80211_eapol_key_check_mic(struct ieee80211_eapol_key *key, const u_int8_t *kck) argument 520 ieee80211_eapol_key_encrypt(struct ieee80211com *ic, struct ieee80211_eapol_key *key, const u_int8_t *kek) argument 579 ieee80211_eapol_key_decrypt(struct ieee80211_eapol_key *key, const u_int8_t *kek) argument 622 ieee80211_pmksa_add(struct ieee80211com *ic, enum ieee80211_akm akm, const u_int8_t *macaddr, const u_int8_t *key, u_int32_t lifetime) argument [all...] |
H A D | ieee80211_regdomain.c | 60 bsearch(const void *key, const void *base0, size_t nmemb, size_t size, argument 69 cmp = (*compar)(key, p); 72 if (cmp > 0) { /* key > p: move right */ 98 const struct ieee80211_countryname key = { CTRY_DEFAULT, name }, *value; local 100 if ((value = bsearch(&key, &ieee80211_r_ctry, 112 struct ieee80211_regdomainname key; local 114 key.rn_domain = DMN_DEFAULT; 115 key.rn_name = name; 117 if ((value = bsearch(&key, &ieee80211_r_names,
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Inode.cpp | 190 TRACE("Inode::FindBlock(%" B_PRIdINO ") key.Offset() %" B_PRId64 "\n", 264 TRACE("Inode::ReadAt(%" B_PRIdINO ") key.Offset() %" B_PRId64 "\n", ID(), 386 btrfs_key key; local 387 key.SetObjectID(fID); 388 key.SetType(BTRFS_KEY_TYPE_DIR_INDEX); 389 key.SetOffset(-1); 391 if (fVolume->FSTree()->FindPrevious(path, key, NULL)) 394 return key.Offset() + 1; 406 item.key.SetObjectID(fID); 407 item.key 427 btrfs_key key; local 521 btrfs_key key; local [all...] |
/haiku/src/kits/locale/ |
H A D | HashMapCatalog.cpp | 60 // Two keys are equal if their hashval and key (string,context,comment) 72 // Two keys are equal if their hashval and key (string,context,comment) 126 CatKey key(string, context, comment); 127 return GetString(key); 134 CatKey key(id); 135 return GetString(key); 140 HashMapCatalog::GetString(const CatKey& key) argument 142 BString value = fCatMap.Get(key); 231 CatKey key(stringCopy.String(), context, commentCopy.String()); 232 return fCatMap.Put(key, translatedCop 251 SetString(const CatKey& key, const char *translated) argument [all...] |
/haiku/src/apps/debuganalyzer/gui/ |
H A D | SubWindowManager.cpp | 59 SubWindowManager::LookupSubWindow(const SubWindowKey& key) const 61 return fSubWindows.Lookup(key);
|
/haiku/src/bin/debug/ltrace/ |
H A D | ltrace_stub.cpp | 60 size_t HashKey(const void* key) const 62 return (addr_t)key >> 2; 70 bool Compare(const void* key, PatchEntry* value) const argument 72 return value->originalFunction == key; 86 size_t HashKey(const void* key) const 88 return (addr_t)key >> 2; 96 bool Compare(const void* key, PatchEntry* value) const argument 98 return value->patchedFunction == key;
|
/haiku/src/system/libroot/posix/sys/ |
H A D | xsi_msg_queue.cpp | 32 msgget(key_t key, int messageQueueFlags) argument 34 RETURN_AND_SET_ERRNO(_kern_xsi_msgget(key, messageQueueFlags));
|
/haiku/src/system/libroot/posix/crypt/ |
H A D | crypt.cpp | 132 _crypt_rn(const char* key, const char* setting, struct crypt_data* data, size_t size) argument 155 return _crypt_des_r(key, setting, data->buf); 179 if (crypto_scrypt(reinterpret_cast<const uint8*>(key), strlen(key), 196 crypt(const char* key, const char* salt) argument 199 return _crypt_rn(key, salt, &data, sizeof(struct crypt_data)); 205 fcrypt(const char* key, const char* salt) argument 207 return crypt(key, salt);
|
/haiku/headers/os/net/ |
H A D | net_settings.h | 18 const char* key; member in struct:_ns_entry
|
/haiku/headers/posix/sys/ |
H A D | ipc.h | 14 #define IPC_CREAT 01000 /* create key */ 15 #define IPC_EXCL 02000 /* fail if key exists */ 23 /* Private key */ 28 key_t key; /* IPC identifier */ member in struct:ipc_perm
|
/haiku/headers/private/kernel/posix/ |
H A D | xsi_message_queue.h | 22 int _user_xsi_msgget(key_t key, int messageQueueFlags);
|