/haiku/headers/posix/arpa/ |
H A D | nameser.h | 251 struct dst_key *key; member in struct:ns_tcp_tsig_state 293 ns_t_key = 25, /* Security key. */ 322 ns_t_tkey = 249, /* Transaction key */ 362 ns_kt_rsa = 1, /* key type RSA/MD5 */ 365 ns_kt_private = 254 /* Private key type starts with OID */ 381 #define NS_KEY_TYPE_NO_KEY 0xC000 /* No key usable for either; no key */ 390 #define NS_KEY_NAME_USER 0x0000 /* key is assoc. with user */ 391 #define NS_KEY_NAME_ENTITY 0x0200 /* key is assoc. with entity eg host */ 392 #define NS_KEY_NAME_ZONE 0x0100 /* key i [all...] |
/haiku/headers/posix/ |
H A D | pthread.h | 262 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);
|
H A D | search.h | 18 char *key; member in struct:entry 38 extern void *lfind(const void *key, const void *base, size_t *_elementCount, 40 extern void *lsearch(const void *key, void *base, size_t *_elementCount, 43 extern void *tdelete(const void *key, void **_root, 45 extern void *tfind(const void *key, void *const *root, 47 extern void *tsearch(const void *key, void **_root,
|
H A D | stdlib.h | 145 extern void *bsearch(const void *key, const void *base, size_t numElements, 175 extern void setkey(const char *key);
|
H A D | unistd.h | 479 extern char *crypt(const char *key, const char *salt);
|
/haiku/headers/private/file_systems/ |
H A D | QueryParser.h | 201 const uint8* key = NULL, size_t size = 0) = 0; 252 const uint8* key = NULL, size_t size = 0); 314 const uint8* key = NULL, size_t size = 0); 631 /*! Returns true when the key matches the equation. You have to 712 const char* attributeName, int32 type, const uint8* key, size_t size) 721 if (key == NULL) { 727 buffer = const_cast<uint8*>(key); 845 // let's see if we can use the beginning of the key for positioning 846 // the iterator and adjust the key size; if not, just leave the 1016 int32 type, const uint8* key, size_ 711 Match(Entry* entry, Node* node, const char* attributeName, int32 type, const uint8* key, size_t size) argument [all...] |
/haiku/headers/private/fs_shell/ |
H A D | fssh_driver_settings.h | 35 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/private/kernel/ |
H A D | Notifications.h | 237 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()); }
|
H A D | debug.h | 135 bool (*emergency_key_pressed)(char key); 180 extern bool debug_emergency_key_pressed(char key);
|
/haiku/headers/private/kernel/boot/platform/generic/ |
H A D | text_console.h | 55 #define TEXT_CONSOLE_IS_CURSOR_KEY(key) \ 56 (key >= TEXT_CONSOLE_CURSOR_KEYS_START \ 57 && key < TEXT_CONSOLE_CURSOR_KEYS_END)
|
/haiku/headers/private/kernel/platform/efi/protocol/ |
H A D | simple-text-input.h | 23 efi_input_key* key) EFIAPI;
|
/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...] |
H A D | AVLTreeBase.h | 31 virtual int CompareKeyNode(const void* key, 60 AVLTreeNode* Find(const void* key) const; 61 AVLTreeNode* FindClosest(const void* key, bool less) const; 64 AVLTreeNode* Remove(const void* key);
|
H A D | OpenHashTable.h | 38 size_t HashKey(KeyType key) const 40 return key >> 1; 48 bool Compare(KeyType key, ValueType* value) const 50 return value->bar == key; 153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const 158 size_t index = fDefinition.HashKey(key) & (fTableSize - 1); 162 if (fDefinition.Compare(key, slot)) 201 // TODO: a ValueType* Remove(const KeyType& key) method is missing 402 Iterator GetIterator(typename TypeOperation<KeyType>::ConstRefT key) const 407 size_t index = fDefinition.HashKey(key) [all...] |
H A D | VectorMap.h | 48 references to the entry's key/value. This allows EntryStrategy::Entry 79 status_t Insert(const Key &key, const Value &value); 80 status_t Put(const Key &key, const Value &value); 81 Value &Get(const Key &key); 82 const Value &Get(const Key &key) const; 84 int32 Remove(const Key &key); 98 Iterator Find(const Key &key); 99 ConstIterator Find(const Key &key) const; 100 Iterator FindClose(const Key &key, bool less); 101 ConstIterator FindClose(const Key &key, boo 299 Insert(const Key &key, const Value &value) argument 318 Put(const Key &key, const Value &value) argument 334 Get(const Key &key) argument 371 Remove(const Key &key) argument 535 Find(const Key &key) argument 587 FindClose(const Key &key, bool less) argument 628 FindClose(const Key &key, bool less) const argument 655 _FindInsertionIndex(const Key &key, bool &exists) const argument 688 Entry(const Key &key, const Value &value) argument 691 Key key; member in class:VectorMapEntryStrategy::Pair::Entry 710 MakeEntry(const Key &key, const Value &value) const argument 756 AreCompatible(const Key &key, const Value &value) const argument [all...] |
/haiku/headers/private/kernel/vm/ |
H A D | VMArea.h | 189 int Compare(area_id key, const VMArea* value) const argument 192 if (valueId == key) 194 return key < valueId ? -1 : 1;
|
H A D | VMCache.h | 60 static int Compare(page_num_t key, const NodeType* node) argument 62 return key == node->cache_offset ? 0 63 : (key < node->cache_offset ? -1 : 1);
|
/haiku/headers/private/locale/ |
H A D | DefaultCatalog.h | 46 status_t SetRawString(const CatKey& key, const char *translated);
|
/haiku/headers/private/shared/ |
H A D | LRUCache.h | 30 LRUOrderingNode(const Key& key, const Value& value) argument 32 fKey(key), 77 status_t Put(const Key& key, const Value& value) argument 79 LRUNode* node = fMap.Get(key); 87 node = new(std::nothrow) LRUNode(key, value); 90 status_t result = fMap.Put(key, node); 102 Value Remove(const Key& key) argument 104 LRUNode* node = fMap.Get(key); 108 fMap.Remove(key); 125 Value Get(const Key& key) argument [all...] |
/haiku/headers/private/system/ |
H A D | syscalls.h | 127 extern int _kern_xsi_semget(key_t key, int numSems, int flags); 136 extern int _kern_xsi_msgget(key_t key, int messageQueueFlags);
|
/haiku/headers/private/userlandfs/fuse/ |
H A D | fuse_opt.h | 35 * ii) The processing function is called, with 'value' as the key 87 * Value to set the variable to, or to be passed as 'key' to the 95 * called with the specified key. 97 #define FUSE_OPT_KEY(templ, key) { templ, -1U, key } 139 * Special key value for options to keep 147 * Special key value for options to discard 175 * @param key determines why the processing function was called 179 typedef int (*fuse_opt_proc_t)(void *data, const char *arg, int key,
|
/haiku/src/add-ons/input_server/devices/virtio/ |
H A D | VirtioInputDevice.cpp | 60 TRACE("key, "); 405 KeyboardHandler::_IsKeyPressed(const KeyboardState &state, uint32 key) argument 407 return key < 256 && IsBitSet(state.keys[key / 8], key % 8); 575 msg->AddInt32("key", i);
|
H A D | VirtioInputDevice.h | 99 uint32 key);
|
/haiku/src/add-ons/input_server/filters/shortcut_catcher/ |
H A D | CommandActuators.h | 30 // server add-on will execute the CommandActuator associated with a key combo 31 // when that key combo is detected. 40 // Called by the InputFilter whenever a key is pressed or depressed. 126 int32 offsets[128], char key, 129 void _SetStateBit(uint8* setStates, uint32 key, 228 // B_KEY_DOWN events are detected for its key This way a key can act sort of
|
/haiku/src/add-ons/kernel/bus_managers/ata/ |
H A D | ATAPrivate.h | 269 void SetSense(uint8 key, uint16 codeQualifier);
|