Searched refs:key (Results 301 - 325 of 570) sorted by relevance

<<11121314151617181920>>

/haiku/headers/libs/print/libprint/
H A DJobSetupDlg.h38 Range(const char* label, const char* key, const R* range, BSlider* slider);
62 Range<T, R>::Range(const char* label, const char* key, const R* range, argument
66 fKey(key),
126 const char* key);
/haiku/src/apps/cortex/Persistence/
H A DStringContent.cpp70 const char* key,
69 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument
/haiku/src/apps/cortex/Persistence/Wrappers/
H A DFlatMessageIO.h119 const char* key,
/haiku/src/apps/cortex/RouteApp/
H A Droute_app_io.h103 // fills in either key or outName/kind for the provided
105 // an appropriate 'preset' key value will be returned.
122 // given a key, looks for a system-default node
125 const char* key,
H A DDormantNodeIO.h104 const char* key,
H A DConnectionIO.h111 const char* key,
/haiku/src/apps/icon-o-matic/generic/gui/stateview/
H A DMultipleManipulatorState.cpp172 MultipleManipulatorState::HandleKeyDown(uint32 key, uint32 modifiers, argument
177 // handle the key down handles the matching key up event...
183 if (manipulator->HandleKeyDown(key, modifiers, _command))
191 MultipleManipulatorState::HandleKeyUp(uint32 key, uint32 modifiers, argument
198 if (manipulator->HandleKeyUp(key, modifiers, _command))
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DAttributeIndex.h36 virtual AbstractIndexIterator* InternalFind(const void* key,
/haiku/src/kits/package/
H A DPackageInfoSet.cpp60 size_t HashKey(const char* key) const
62 return BString::HashValue(key);
70 bool Compare(const char* key, const PackageInfo* value) const argument
72 return value->Name() == key;
/haiku/src/preferences/shortcuts/
H A DShortcutsSpec.h51 const char* bytes, int32 key);
/haiku/headers/os/locale/
H A DCollator.h57 status_t GetSortKey(const char* string, BString* key)
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DInode.cpp69 struct node_key *key = volume->GetNode(ino, fParent); local
70 if (key != NULL) {
71 fCluster = key->cluster;
72 fOffset = key->offset;
/haiku/src/add-ons/kernel/network/stack/
H A Dinterfaces.h92 size_t HashKey(const KeyType& key) const
94 return (size_t)key;
102 bool Compare(const KeyType& key, domain_datalink* datalink) const argument
104 return datalink->domain->family == key;
/haiku/src/system/kernel/slab/
H A DMemoryManager.h120 size_t HashKey(addr_t key) const
122 return key / SLAB_AREA_SIZE;
130 bool Compare(addr_t key, const Area* value) const argument
132 return key == value->BaseAddress();
/haiku/src/system/kernel/vm/
H A DVMAddressSpace.cpp51 size_t HashKey(team_id key) const
53 return key;
61 bool Compare(team_id key, const VMAddressSpace* value) const argument
63 return value->ID() == key;
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DAttribute.h45 void GetKey(uint8 *key, size_t *length);
/haiku/headers/private/locale/
H A DDefaultCatalog.h46 status_t SetRawString(const CatKey& key, const char *translated);
/haiku/headers/private/kernel/
H A DNotifications.h237 size_t HashKey(const char* key) const
238 { return hash_hash_string(key); }
241 bool Compare(const char* key, NotificationService* service) const argument
242 { return !strcmp(key, service->Name()); }
/haiku/src/add-ons/kernel/drivers/input/hid_shared/
H A DKeyboardProtocolHandler.h40 void _WriteKey(uint32 key, bool down);
/haiku/src/system/kernel/scheduler/
H A Dscheduling_analysis.cpp46 virtual bool Equals(const HashObjectKey* key) const = 0;
111 const ThreadKey* key = dynamic_cast<const ThreadKey*>(_key); local
112 if (key == NULL)
114 return key->id == id;
153 const WaitObjectKey* key = dynamic_cast<const WaitObjectKey*>(_key); local
154 if (key == NULL)
156 return key->type == type && key->object == object;
198 const ThreadWaitObjectKey* key local
200 if (key
[all...]
/haiku/headers/posix/
H A Dpthread.h262 extern int pthread_key_create(pthread_key_t *key,
264 extern int pthread_key_delete(pthread_key_t key);
265 extern void *pthread_getspecific(pthread_key_t key);
266 extern int pthread_setspecific(pthread_key_t key, const void *value);
/haiku/src/libs/libtelnet/
H A Dpk.c35 /* public key routines */
59 * Choose top 128 bits of the common key to use as our idea key.
87 * Choose middle 64 bits of the common key to use as our des key, possibly
116 * get common key from my secret key and his public key
149 * Generate a random public/secret key pair
193 * Adjust the input key s
215 pk_encode(char *in, char *out, DesData *key) argument
236 pk_decode(char *in, char *out, DesData *key) argument
[all...]
/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp143 AVLTreeBase::Find(const void* key) const
148 int cmp = fCompare->CompareKeyNode(key, node);
163 AVLTreeBase::FindClosest(const void* key, bool less) const argument
169 int cmp = fCompare->CompareKeyNode(key, node);
184 int cmp = fCompare->CompareKeyNode(key, node);
217 AVLTreeBase::Remove(const void* key) argument
222 int cmp = fCompare->CompareKeyNode(key, node);
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DVolume.cpp155 btrfs_key* key = (btrfs_key*)start; local
157 B_PRIx64 " type 0x%x\n", key->ObjectID(), key->Offset(),
158 key->Type());
159 if (key->Type() != BTRFS_KEY_TYPE_CHUNK_ITEM) {
163 btrfs_chunk* chunk = (btrfs_chunk*)(key + 1);
164 fChunk = new(std::nothrow) Chunk(chunk, key->Offset());
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_crypto_wep.c136 * IV must not duplicate during the lifetime of the key.
139 * because the session key itself is shared. So we use a
178 * Add privacy headers appropriate for the specified key.
237 * the specified key.
345 wep_encrypt(struct ieee80211_key *key, struct mbuf *m0, int hdrlen) argument
348 struct wep_ctx *ctx = key->wk_private;
363 memcpy(rc4key + IEEE80211_WEP_IVLEN, key->wk_key, key->wk_keylen);
369 keylen = key->wk_keylen + IEEE80211_WEP_IVLEN;
428 wep_decrypt(struct ieee80211_key *key, struc argument
[all...]

Completed in 127 milliseconds

<<11121314151617181920>>