Searched refs:key (Results 76 - 100 of 570) sorted by relevance

1234567891011>>

/haiku/headers/private/kernel/util/
H A DSplayTree.h30 static int Compare(const KeyType& key, const NodeType* node);
74 Key key = Definition::GetKey(node); local
75 _Splay(key);
77 int c = Definition::Compare(key, fRoot);
97 Node* Remove(const Key& key) argument
102 _Splay(key);
104 if (Definition::Compare(key, fRoot) != 0)
115 _Splay(key);
128 Key key = Definition::GetKey(node); local
129 _Splay(key);
187 Lookup(const Key& key) argument
226 FindClosest(const Key& key, bool greater, bool orEqual) argument
279 _Splay(const Key& key) argument
514 Remove(const Key& key) argument
547 Lookup(const Key& key) argument
566 FindClosest(const Key& key, bool greater, bool orEqual) argument
591 GetIterator(const Key& key, bool greater, bool orEqual) argument
596 GetIterator(const Key& key, bool greater, bool orEqual) const argument
[all...]
/haiku/src/servers/package/
H A DPackageFile.h95 size_t HashKey(const entry_ref& key) const
97 size_t hash = BString::HashValue(key.name);
98 hash ^= (size_t)key.device;
99 hash ^= (size_t)key.directory;
108 bool Compare(const entry_ref& key, const PackageFile* value) const argument
110 return value->EntryRef() == key;
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DIndex.h48 bool Find(const void* key, size_t length,
51 // >= key
61 virtual AbstractIndexIterator* InternalFind(const void* key,
64 // value >= key
106 size_t HashKey(const StringKey& key) const
108 return key.Hash();
116 bool Compare(const StringKey& key, const Index* value) const argument
118 return key == value->Name();
/haiku/headers/os/drivers/
H A Ddriver_settings.h34 extern const char *get_driver_parameter(void *handle, const char *key,
35 const char *unknownValue, /* key not present */
36 const char *noargValue); /* key has no value */
37 extern bool get_driver_boolean_parameter(void *handle, const char *key,
45 /* Pass this as the key value to check if safe mode is enabled */
/haiku/headers/private/fs_shell/
H A Dfssh_driver_settings.h35 extern const char* fssh_get_driver_parameter(void *handle, const char *key,
36 const char *unknownValue, /* key not present */
37 const char *noargValue); /* key has no value */
39 const char *key, bool unknownValue,
47 /* Pass this as the key value to check if safe mode is enabled */
/haiku/headers/build/os/drivers/
H A Ddriver_settings.h33 extern const char *get_driver_parameter(void *handle, const char *key,
34 const char *unknownValue, /* key not present */
35 const char *noargValue); /* key has no value */
36 extern bool get_driver_boolean_parameter(void *handle, const char *key,
44 /* Pass this as the key value to check if safe mode is enabled */
/haiku/src/system/libroot/posix/stdlib/
H A Dbsearch.c57 bsearch(const void *key, const void *base0, size_t nmemb, size_t size, argument
67 cmp = COMPAR(key, p);
70 if (cmp > 0) { /* key > p: move right */
/haiku/src/system/libnetwork/netresolv/dst/
H A Ddst_internal.h39 char *dk_key_name; /*%< name of the key */
40 int dk_key_size; /*%< this is the size of the key in bits */
41 int dk_proto; /*%< what protocols this key can be used for */
42 int dk_alg; /*%< algorithm number from key record */
43 u_int32_t dk_flags; /*%< and the flags of the public key */
44 u_int16_t dk_id; /*%< identifier of the key */
45 void *dk_KEY_struct; /*%< pointer to key in crypto pkg fmt */
62 /* suffixes for key file names */
64 #define PUBLIC_KEY "key"
90 int (*sign)(const int mode, DST_KEY *key, voi
[all...]
/haiku/src/preferences/keymap/
H A DKeyboardLayout.cpp207 // semi-colon. After the initial position, key descriptions are expected
210 // A key description is of the form "<shape>:<scancodes>", where <shape>
214 // rectangular keys, or 'l' for the enter key. Additionally, you can use
217 // also used to determine the height of the first row of the enter key;
225 // 3) "<first>+<count>": one key with the <first> scancode is added, plus
229 // of a key, it accepts a size, but no shape modifiers. Also, instead of
236 "name = Generic 105-key International\n"
260 static const char* kDefaultLayout104 = "name = Generic 104-key\n"
344 KeyboardLayout::_AddAlternateKeyCode(Key* key, int32 modifier, int32 code) argument
346 if (key
354 _AddKey(const Key& key) argument
459 _AddKeyCodes(const parse_state& state, BPoint& rowLeftTop, Key& key, const char* data, int32& lastCount) argument
559 Key* key = KeyAt(i); local
607 _GetShape(const parse_state& state, const char* data, Key& key) argument
772 Key key; local
[all...]
/haiku/src/add-ons/kernel/network/protocols/unix/
H A DUnixAddressManager.h19 size_t HashKey(const KeyType& key) const
21 return key.HashCode();
29 bool Compare(const KeyType& key, UnixEndpoint* endpoint) const argument
31 return key == endpoint->Address();
/haiku/src/add-ons/print/drivers/gutenprint/
H A DGPCapabilityExtractor.cpp70 const char* key)
72 if (key == NULL)
75 fDefaultKey = key;
114 GPCapabilityExtractor::StringParameter(const char* name, const char* key, argument
117 bool isDefault = fDefaultKey == key;
128 AddCapability(fCapabilities->fInputSlots, capability, key);
134 AddCapability(fCapabilities->fPrintingModes, capability, key);
140 fNextDriverSpecificCategoryID], capability, key);
151 GPCapabilityExtractor::ResolutionParameter(const char* name, const char* key, argument
154 bool isDefault = fDefaultKey == key;
69 DefaultStringParameter(const char* name, const char* key) argument
185 PageSizeParameter(const char* name, const char* key, const char* displayName, BSize pageSize, BRect imageableArea) argument
319 AddCapability(GPArray<struct BaseCap>& array, EnumCap* capability, const char* key) argument
[all...]
/haiku/headers/private/package/hpkg/
H A DStrings.h58 size_t HashKey(const char* key) const
60 return hash_string(key);
68 bool Compare(const char* key, const CachedString* value) const argument
70 return strcmp(value->string, key) == 0;
/haiku/src/add-ons/kernel/file_systems/packagefs/resolvables/
H A DDependencyFamily.h83 size_t HashKey(const String& key) const
85 return key.Hash();
93 bool Compare(const String& key, const DependencyFamily* value) const argument
95 return key == value->Name();
H A DResolvableFamily.h60 size_t HashKey(const String& key) const
62 return key.Hash();
70 bool Compare(const String& key, const ResolvableFamily* value) const argument
72 return key == value->Name();
/haiku/src/system/kernel/slab/
H A DHashedObjectCache.h57 size_t HashKey(const void* key) const
59 return (addr_t)::lower_boundary(key, parent->slab_size)
68 bool Compare(const void* key, HashedSlab* value) const argument
70 return value->pages == key;
/haiku/src/system/libroot/posix/musl/search/
H A Dtdestroy.c14 if (freekey) freekey((void *)r->key);
/haiku/src/system/libroot/posix/musl/crypt/
H A Dcrypt_des.h12 char *_crypt_des_r(const char *key, const char *salt, char *outbuf);
/haiku/src/tests/apps/haikudepot/
H A DJwtTokenHelperTest.cpp84 JwtTokenHelperTest::_AssertStringValue(const BMessage& message, const char* key, argument
88 status_t result = message.FindString(key, &value);
95 JwtTokenHelperTest::_AssertDoubleValue(const BMessage& message, const char* key, argument
99 status_t result = message.FindDouble(key, &value);
/haiku/src/kits/debugger/dwarf/
H A DTypeUnit.h70 size_t HashKey(uint64 key) const
72 return (size_t)key;
80 bool Compare(uint64 key, TypeUnitTableEntry* value) const argument
82 return value->signature == key;
/haiku/src/system/boot/loader/file_systems/packagefs/
H A DPackageSettingsItem.h152 size_t HashKey(const EntryKey& key) const
154 return key.Hash();
162 bool Compare(const EntryKey& key, const Entry* value) const argument
165 return key.Parent() == value->Parent()
166 && strncmp(key.Name(), name, key.NameLength()) == 0
167 && name[key.NameLength()] == '\0';
/haiku/src/apps/webpositive/
H A DCredentialsStorage.cpp161 CredentialsStorage::Contains(const HashKeyString& key) argument
165 return fCredentialMap.ContainsKey(key);
170 CredentialsStorage::PutCredentials(const HashKeyString& key, argument
175 return fCredentialMap.Put(key, credentials);
180 CredentialsStorage::GetCredentials(const HashKeyString& key) argument
184 return fCredentialMap.Get(key);
206 BString key; local
207 if (credentialsArchive.FindString("key", &key) == B_OK) {
209 fCredentialMap.Put(key, credential
[all...]
/haiku/headers/private/debugger/util/
H A DWorker.h99 job_wait_status WaitFor(const JobKey& key);
153 void AbortJob(const JobKey& key);
154 Job* GetJob(const JobKey& key);
162 status_t AddListener(const JobKey& key,
164 void RemoveListener(const JobKey& key,
174 size_t HashKey(const JobKey& key) const
176 return key.HashValue();
184 bool Compare(const JobKey& key, Job* value) const argument
186 return value->Key() == key;
198 job_wait_status WaitForJob(Job* waitingJob, const JobKey& key);
[all...]
/haiku/headers/private/media/
H A DTMap.h7 template<class key, class value> class Map
25 Map(const Map<key, value> &other)
30 Map<key, value> &operator=(const Map<key, value> &other)
46 bool Insert(const key &k, const value &v)
60 bool Get(const key &k, value **v) const
71 bool Remove(const key &k) {
86 bool Has(const key &k) const
125 bool GetCurrentKey(key **k)
165 key
[all...]
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DDirectoryIterator.cpp27 btrfs_key key; local
28 key.SetType(BTRFS_KEY_TYPE_DIR_INDEX);
29 key.SetObjectID(inode->ID());
30 key.SetOffset(BTREE_BEGIN);
32 key);
122 btrfs_key key; local
123 key.SetType(BTRFS_KEY_TYPE_DIR_ITEM);
124 key.SetObjectID(fInode->ID());
125 key.SetOffset(hash);
130 status_t status = fInode->GetVolume()->FSTree()->FindExact(&path, key,
[all...]
/haiku/src/add-ons/translators/gif/
H A DSFHash.cpp58 int pos = item->key % size;
71 SFHash::GetItem(unsigned int key) argument
73 int pos = key % size;
77 if (item->key == key) return item;

Completed in 100 milliseconds

1234567891011>>