Searched refs:key (Results 1 - 25 of 517) sorted by relevance

1234567891011>>

/haiku/src/system/boot/platform/amiga_m68k/
H A Dkeyboard.cpp29 extern "C" union key
33 union key key; local
35 return key;
42 union key key; local
45 while ((key.d0 = check_for_key()) != 0) {
46 switch (key.code.ascii) {
/haiku/src/system/boot/platform/u-boot/
H A Dkeyboard.cpp31 extern "C" union key
34 union key key; local
35 key.ax=0;
36 return key;
/haiku/src/libs/posix_error_mapper/
H A Dpthread_specific.cpp12 (pthread_key_t *key, void (*destructorFunc)(void*)),
13 return B_TO_POSITIVE_ERROR(sReal_pthread_key_create(key, destructorFunc));
17 WRAPPER_FUNCTION(int, pthread_key_delete, (pthread_key_t key),
18 return B_TO_POSITIVE_ERROR(sReal_pthread_key_delete(key));
23 (pthread_key_t key, const void *value),
24 return B_TO_POSITIVE_ERROR(sReal_pthread_setspecific(key, value));
/haiku/src/system/boot/platform/atari_m68k/
H A Dkeyboard.cpp17 union key k;
34 extern "C" union key
37 union key key; local
38 key.d0 = Bconin(DEV_CON);
40 return key;
47 union key key; local
50 while ((key.d0 = check_for_key()) != 0) {
51 switch (key
[all...]
/haiku/src/libs/libtelnet/
H A Dencrypt.h73 #define VALIDKEY(key) ( key[0] | key[1] | key[2] | key[3] | \
74 key[4] | key[5] | key[6] | key[7])
/haiku/src/system/libroot/posix/pthread/
H A Dpthread_key.cpp17 /*! Retrieves the destructor of a key locklessly.
21 get_key_destructor(uint32 key, int32& sequence) argument
26 sequence = sKeyTable[key].sequence;
30 destructor = sKeyTable[key].destructor;
31 } while (sKeyTable[key].sequence != sequence);
37 /*! Function to get the thread specific value of a key in a lockless
39 \a sequence must be the sequence of the key table that this value
43 get_key_value(pthread_thread* thread, uint32 key, int32 sequence) argument
45 pthread_key_data& keyData = thread->specific[key];
66 for (uint32 key
106 pthread_key_delete(pthread_key_t key) argument
121 pthread_getspecific(pthread_key_t key) argument
139 pthread_setspecific(pthread_key_t key, const void* value) argument
[all...]
/haiku/src/system/libroot/posix/crypt/
H A Dcrypt_legacy.h8 char *crypt_legacy(const char *key, const char *salt);
/haiku/src/apps/terminal/
H A DPrefHandler.h27 const char *key; member in struct:pref_defaults
57 int32 getInt32(const char *key);
58 float getFloat(const char *key);
59 const char* getString(const char *key);
60 bool getBool(const char *key);
61 rgb_color getRGB(const char *key);
62 int getCursor(const char *key);
64 void setInt32(const char *key, int32 data);
65 void setFloat(const char *key, float data);
66 void setString(const char *key, cons
[all...]
H A DPrefHandler.cpp236 const char *key; local
240 fContainer.GetInfo(B_STRING_TYPE, i, &key, &type) == B_OK;
242 fContainer.GetInfo(B_STRING_TYPE, i, (char**)&key, &type) == B_OK;
246 key, getString(key));
259 PrefHandler::getInt32(const char *key) argument
261 const char *value = fContainer.FindString(key);
270 PrefHandler::getFloat(const char *key) argument
272 const char *value = fContainer.FindString(key);
284 PrefHandler::getString(const char *key) argument
296 getBool(const char *key) argument
307 getCursor(const char *key) argument
326 getRGB(const char *key) argument
350 setInt32(const char *key, int32 data) argument
361 setFloat(const char *key, float data) argument
372 setBool(const char *key, bool data) argument
384 setString(const char *key, const char *data) argument
395 setRGB(const char *key, const rgb_color data) argument
467 char key[B_FIELD_NAME_LENGTH], data[512]; local
[all...]
/haiku/src/bin/bfs_tools/lib/
H A DHashtable.h27 bool ContainsKey(const void *key);
28 void *GetValue(const void *key);
30 bool Put(const void *key, void *value);
31 void *Remove(const void *key);
44 : next(_next), key(_key), value(_value) {}
47 const void *key; member in class:Hashtable::Entry
52 Entry *GetHashEntry(const void *key);
H A DBPlusTree.h121 status_t GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
122 status_t GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
124 status_t Insert(uint8 *key, uint16 keyLength, off_t value);
126 status_t Insert(const char *key, off_t value);
127 status_t Insert(int32 key, off_t value);
128 status_t Insert(uint32 key, off_t value);
129 status_t Insert(int64 key, off_t value);
130 status_t Insert(uint64 key, off_t value);
131 status_t Insert(float key, off_t value);
132 status_t Insert(double key, off_
190 GetNextEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
195 GetPreviousEntry(void *key,uint16 *keyLength,uint16 maxLength,off_t *value) argument
200 Insert(const char *key,off_t value) argument
207 Insert(int32 key, off_t value) argument
214 Insert(uint32 key, off_t value) argument
221 Insert(int64 key, off_t value) argument
228 Insert(uint64 key, off_t value) argument
235 Insert(float key, off_t value) argument
242 Insert(double key, off_t value) argument
[all...]
/haiku/src/system/boot/platform/bios_ia32/
H A Dkeyboard.cpp23 // the zero flag is set when there is no key stroke waiting for us
27 // remove the key from the buffer
43 extern "C" union key
46 union key key; local
48 key.ax = check_for_key();
49 } while (key.ax == 0);
51 return key;
/haiku/headers/posix/
H A Dsearch.h18 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,
/haiku/src/apps/text_search/
H A DChangesIterator.cpp65 sprintf(buffer, "%s", entry.key.GetString());
88 HashString key(path);
89 if (fPathMap.ContainsKey(key))
94 fPathMap.Put(key, ENTRY_ADDED);
101 HashString key(path);
102 if (fPathMap.ContainsKey(key)) {
104 fPathMap.Remove(key);
112 HashString key(path);
113 if (fPathMap.ContainsKey(key) && fPathMap.Get(key)
[all...]
/haiku/headers/os/app/
H A DKeyStore.h18 BKey& key);
20 const char* secondaryIdentifier, BKey& key);
24 BKey& key);
28 BKey& key);
31 const char* secondaryIdentifier, BKey& key);
36 BKey& key);
38 status_t AddKey(const BKey& key);
39 status_t AddKey(const char* keyring, const BKey& key);
40 status_t RemoveKey(const BKey& key);
41 status_t RemoveKey(const char* keyring, const BKey& key);
[all...]
/haiku/src/add-ons/kernel/file_systems/packagefs/util/
H A DStringPool.h71 static StringData* _GetLocked(const StringDataKey& key);
83 static StringData* Create(const StringDataKey& key) argument
85 void* data = malloc(sizeof(StringData) + key.Length());
89 return new(data) StringData(key);
141 StringData(const StringDataKey& key) argument
144 fHash(key.Hash())
146 memcpy(fString, key.String(), key.Length());
147 fString[key.Length()] = '\0';
168 size_t HashKey(const StringDataKey& key) cons
178 Compare(const StringDataKey& key, const StringData* value) const argument
[all...]
/haiku/src/add-ons/mail_daemon/inbound_protocols/pop3/
H A Dmd5.h48 const unsigned char* key, int key_len);
51 const unsigned char* key, int key_len);
/haiku/src/apps/debuganalyzer/gui/
H A DSubWindowManager.h26 SubWindow* LookupSubWindow(const SubWindowKey& key) const;
36 size_t HashKey(const SubWindowKey& key) const
38 return key.HashCode();
46 bool Compare(const SubWindowKey& key, argument
49 return key.Equals(value->GetSubWindowKey());
/haiku/src/servers/app/
H A DHashTable.h29 bool ContainsKey(Hashable& key) const { return _GetHashEntry(key) != NULL; }
32 Hashable *GetValue(Hashable& key) const;
35 Hashable *RemoveItem(Hashable& key);
41 entry *_GetHashEntry(Hashable& key) const;
/haiku/src/system/libroot/posix/glibc/misc/
H A Dlsearch.c26 lsearch (const void *key, void *base, size_t *nmemb, size_t size, argument
32 result = lfind (key, base, nmemb, size, compar);
36 result = memcpy (base + (*nmemb) * size, key, size);
45 lfind (const void *key, const void *base, size_t *nmemb, size_t size, argument
51 while (cnt < *nmemb && (*compar) (key, result) != 0)
/haiku/src/add-ons/print/drivers/gutenprint/
H A DGPDriver.h32 const char* key);
34 const char* key);
36 const char* key);
38 const char* key);
40 const char* key);
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_crypto.c61 * Default "null" key management routines.
70 * Not in the global key table, the driver should handle this
71 * by allocating a slot in the h/w key table/cache. In
72 * lieu of that return key slot 0 for any unicast key
73 * request. We disallow the request if this is a group key.
75 * with a 4 key table. It also handles devices that pass
77 * and key index 0.
81 *keyix = 0; /* NB: use key index 0 for ucast key */
104 cipher_detach(struct ieee80211_key *key) argument
110 cipher_attach(struct ieee80211vap *vap, struct ieee80211_key *key) argument
119 dev_key_alloc(struct ieee80211vap *vap, struct ieee80211_key *key, ieee80211_keyix *keyix, ieee80211_keyix *rxkeyix) argument
127 dev_key_delete(struct ieee80211vap *vap, const struct ieee80211_key *key) argument
134 dev_key_set(struct ieee80211vap *vap, const struct ieee80211_key *key) argument
264 ieee80211_crypto_newkey(struct ieee80211vap *vap, int cipher, int flags, struct ieee80211_key *key) argument
423 _ieee80211_crypto_delkey(struct ieee80211vap *vap, struct ieee80211_key *key) argument
457 ieee80211_crypto_delkey(struct ieee80211vap *vap, struct ieee80211_key *key) argument
489 ieee80211_crypto_setkey(struct ieee80211vap *vap, struct ieee80211_key *key) argument
606 ieee80211_crypto_decap(struct ieee80211_node *ni, struct mbuf *m, int hdrlen, struct ieee80211_key **key) argument
[all...]
/haiku/src/servers/package/
H A DPackage.h67 size_t HashKey(const char* key) const
69 return BString::HashValue(key);
77 bool Compare(const char* key, const Package* value) const argument
79 return value->FileName() == key;
93 size_t HashKey(const node_ref& key) const
95 return (size_t)key.device + 17 * (size_t)key.node;
103 bool Compare(const node_ref& key, const Package* value) const argument
105 return key == value->NodeRef();
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/
H A DFUSEEntry.h109 size_t HashKey(const FUSEEntryRef& key) const
110 { return ((uint32)key.parentID ^ (uint32)(key.parentID >> 32)) * 37
111 + string_hash(key.name); }
114 bool Compare(const FUSEEntryRef& key, const FUSEEntry* value) const argument
115 { return value->parent->id == key.parentID
116 && strcmp(value->name, key.name) == 0; }
126 size_t HashKey(ino_t key) const
127 { return (uint32)key ^ (uint32)(key >> 3
130 Compare(ino_t key, const FUSENode* value) const argument
[all...]
/haiku/src/apps/cortex/Persistence/
H A Dxml_export_utils.h66 // Writes the given key/value as an XML attribute (a newline
72 const char* key,
77 stream << endl << context.indentString() << key;
78 pad_with_spaces(stream, key, context) << " = '" << value << '\'';
71 write_attr( const char* key, T value, ostream& stream, ExportContext& context) argument

Completed in 210 milliseconds

1234567891011>>