Searched refs:key (Results 326 - 350 of 570) sorted by relevance

<<11121314151617181920>>

/haiku/src/add-ons/kernel/file_systems/netfs/authentication_server/
H A DAuthenticationServer.cpp381 ServerKey key(context, server);
382 ServerEntry* serverEntry = fServerEntries->Get(key);
406 ServerKey key(context, server);
408 ServerEntry* serverEntry = fServerEntries->Get(key);
414 status_t error = fServerEntries->Put(key, serverEntry);
/haiku/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_crypto_tkip.c99 static void michael_mic(struct tkip_ctx *, const u8 *key,
145 "%s: Invalid key length %u, expecting %u\n",
286 * the specified key.
342 * NB: We can't update the rsc in the key until MIC is verified.
668 wep_encrypt(u8 *key, struct mbuf *m0, u_int off, size_t data_len, argument
683 j = (j + S[i] + key[i & 0x0f]) & 0xff;
729 wep_decrypt(u8 *key, struct mbuf *m, u_int off, size_t data_len) argument
741 j = (j + S[i] + key[i & 0x0f]) & 0xff;
875 michael_mic(struct tkip_ctx *ctx, const u8 *key, argument
886 l = get_le32(key);
1001 tkip_encrypt(struct tkip_ctx *ctx, struct ieee80211_key *key, struct mbuf *m, int hdrlen) argument
1027 tkip_decrypt(struct tkip_ctx *ctx, struct ieee80211_key *key, struct mbuf *m, int hdrlen) argument
[all...]
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/
H A Dif_em.h551 #define EM_RSSRK_VAL(key, i) (key[(i) * EM_RSSRK_SIZE] | \
552 key[(i) * EM_RSSRK_SIZE + 1] << 8 | \
553 key[(i) * EM_RSSRK_SIZE + 2] << 16 | \
554 key[(i) * EM_RSSRK_SIZE + 3] << 24)
/haiku/src/add-ons/media/media-add-ons/esound_sink/
H A DESDEndpoint.cpp97 char key[ESD_MAX_KEY]; local
108 key[i] = (char)(rand() % 256);
109 err = keyFile.Write(key, ESD_MAX_KEY);
115 err = keyFile.Read(key, ESD_MAX_KEY);
120 memcpy(fAuthKey, key, sizeof(esd_key_t));
228 /* send authentification key */
/haiku/src/libs/libtelnet/
H A Drsaencpwd.c60 * 4. This software produces public key authentication certificates
95 #define RSA_ENCPWD_CHALLENGEKEY 3 /* Challenge and public key */
197 char *cp, key[160]; local
218 j = getc(fp); key[i]=j;
222 r = accept_rsa_encpwd(&auth, key, challenge,
280 j = getc(fp); key[i]=j;
295 memmove(ptr, key, i);
/haiku/src/add-ons/kernel/network/protocols/ipv4/
H A Dipv4.cpp74 FragmentPacket(const ipv4_packet_key& key);
105 size_t HashKey(const KeyType& key) const
107 return (key.source ^ key.destination ^ key.protocol ^ key.id);
115 bool Compare(const KeyType& key, ValueType* value) const argument
119 return packetKey.id == key.id
120 && packetKey.source == key.source
121 && packetKey.destination == key
154 Compare(const KeyType &key, ValueType* value) const argument
243 FragmentPacket(const ipv4_packet_key& key) argument
544 struct ipv4_packet_key key; local
[all...]
/haiku/src/add-ons/mail_daemon/outbound_protocols/smtp/
H A DSMTP.cpp79 const unsigned char* key, int key_len)
83 // inner padding - key XORd with ipad
85 // outer padding - key XORd with opad
88 /* start out by storing key in pads */
92 /* if key is longer than 64 bytes reset it to key=MD5(key) */
96 MD5_Update(&tctx, (unsigned char*)key, key_len);
100 memcpy(k_ipad, key, key_len);
101 memcpy(k_opad, key, key_le
78 MD5Hmac(unsigned char *digest, const unsigned char* text, int text_len, const unsigned char* key, int key_len) argument
142 MD5HexHmac(char *hexdigest, const unsigned char* text, int text_len, const unsigned char* key, int key_len) argument
200 const char* key; local
[all...]
/haiku/src/apps/cortex/RouteApp/
H A DRouteAppNodeManager.cpp115 uint64 key = _makeIconKey(nodeID, iconSize); local
117 icon_map::const_iterator it = m_iconMap.find(key);
136 uint64 key = _makeIconKey(nodeInfo.node.node, iconSize); local
138 icon_map::const_iterator it = m_iconMap.find(key);
149 icon_map::value_type(key, icon));
588 const char* key,
708 uint64 key, media_node_id& nodeID, icon_size& iconSize) {
710 nodeID = key >> 32;
711 iconSize = icon_size(key & 0xffffffff);
587 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument
707 _readIconKey( uint64 key, media_node_id& nodeID, icon_size& iconSize) argument
/haiku/src/system/kernel/scheduler/
H A Dscheduler_cpu.cpp382 int32 key = GetKey(entry); local
383 kprintf("%3" B_PRId32 " %8" B_PRId32 " %3" B_PRId32 "%%\n", cpu, key,
387 sDebugCPUHeap.Insert(entry, key);
394 int32 key = GetKey(entry); local
396 Insert(entry, key);
625 int32 key = GetKey(entry); local
630 sDebugCoreHeap.Insert(entry, key);
637 int32 key = GetKey(entry); local
639 Insert(entry, key);
/haiku/src/system/kernel/fs/
H A Dnode_monitor.cpp169 size_t HashKey(monitor_hash_key* key) const
170 { return _Hash(key->device, key->node); }
174 bool Compare(monitor_hash_key* key, node_monitor *monitor) const argument
176 return key->device == monitor->device
177 && key->node == monitor->node;
195 size_t HashKey(dev_t key) const
196 { return _Hash(key); }
200 bool Compare(dev_t key, node_monitor *monitor) const argument
202 return key
366 struct monitor_hash_key key; local
[all...]
/haiku/src/system/libroot/posix/musl/crypt/
H A Dcrypt_des.c693 void __des_setkey(const unsigned char *key, struct expanded_key *ekey) argument
699 (uint32_t)key[3] |
700 ((uint32_t)key[2] << 8) |
701 ((uint32_t)key[1] << 16) |
702 ((uint32_t)key[0] << 24);
704 (uint32_t)key[7] |
705 ((uint32_t)key[6] << 8) |
706 ((uint32_t)key[5] << 16) |
707 ((uint32_t)key[4] << 24);
710 * Do key permutatio
877 const unsigned char *key = (const unsigned char *)_key; local
984 _crypt_des_r(const char *key, const char *setting, char *output) argument
[all...]
/haiku/src/apps/cortex/Persistence/Wrappers/
H A DMessageIO.cpp231 const char* key,
237 if(!strcmp(key, "what"))
239 else if(!strcmp(key, "name"))
292 const char* key,
296 if(!strcmp(key, "name"))
298 if(!strcmp(key, "value"))
230 xmlImportAttribute( const char* key, const char* value, ImportContext& context) argument
291 xmlImportChildAttribute( const char* key, const char* value, ImportContext& context) argument
/haiku/src/system/boot/loader/
H A Dheap.cpp156 static int Compare(const FreeChunkKey& key, const FreeChunk* node) argument
158 return key.Compare(node);
220 size_t HashKey(void* key) const
222 return size_t(key) / kAlignment;
230 bool Compare(void* key, LargeAllocation* value) const argument
232 return value->Address() == key;
/haiku/headers/os/interface/
H A DWindow.h137 void AddShortcut(uint32 key, uint32 modifiers,
139 void AddShortcut(uint32 key, uint32 modifiers,
141 bool HasShortcut(uint32 key, uint32 modifiers);
142 void RemoveShortcut(uint32 key, uint32 modifiers);
319 void AddShortcut(uint32 key, uint32 modifiers,
351 Shortcut* _FindShortcut(uint32 key, uint32 modifiers);
/haiku/src/system/libnetwork/netresolv/net/
H A Dhesiod.c315 char *buf, *key, *data, *p, **which; local
346 key = p;
367 if (strcasecmp(key, "lhs") == 0 ||
368 strcasecmp(key, "rhs") == 0) {
369 which = (strcasecmp(key, "lhs") == 0)
379 if (strcasecmp(key, "classes") == 0) {
/haiku/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6.cpp89 FragmentPacket(const ipv6_packet_key& key);
120 size_t HashKey(const KeyType& key) const
122 return jenkins_hashword((const uint32*)&key,
131 bool Compare(const KeyType& key, ValueType* value) const argument
135 return packetKey.id == key.id
136 && packetKey.source == key.source
137 && packetKey.destination == key.destination
138 && packetKey.protocol == key.protocol;
167 size_t HashKey(const KeyType &key) const;
171 bool Compare(const KeyType &key, ValueTyp argument
283 FragmentPacket(const ipv6_packet_key &key) argument
551 struct ipv6_packet_key key; local
[all...]
/haiku/src/add-ons/kernel/network/protocols/tcp/
H A DEndpointManager.cpp145 ConnectionHashDefinition::HashKey(const KeyType& key) const
148 key.first).HashPair(key.second);
160 ConnectionHashDefinition::Compare(const KeyType& key, argument
163 return endpoint->LocalAddress().EqualTo(key.first, true)
164 && endpoint->PeerAddress().EqualTo(key.second, true);
/haiku/headers/os/support/
H A DObjectList.h191 T* BinarySearchByKey(const Key& key,
195 T* BinarySearchByKey(const Key& key,
206 int32 BinarySearchIndexByKey(const Key& key,
712 BObjectList<T>::BinarySearch(const T& key, CompareFunction func) const argument
714 return (T*)_PointerList_::BinarySearch(&key, (GenericCompareFunction)func);
720 BObjectList<T>::BinarySearch(const T& key, CompareFunctionWithState func, argument
723 return (T*)_PointerList_::BinarySearch(&key,
731 BObjectList<T>::BinarySearchByKey(const Key& key, argument
734 return (T*)_PointerList_::BinarySearch(&key,
742 BObjectList<T>::BinarySearchByKey(const Key &key, argument
772 BinarySearchIndexByKey(const Key& key, int (*compare)(const Key*, const T*)) const argument
[all...]
/haiku/headers/private/firewire/
H A Diec13213.h131 uint32_t key:8, member in struct:csrreg
135 key:8;
/haiku/src/add-ons/kernel/bus_managers/ata/
H A DATARequest.cpp41 ATARequest::SetSense(uint8 key, uint16 codeQualifier) argument
43 fSenseKey = key;
/haiku/src/apps/icon-o-matic/shape/
H A DPathManipulator.h57 virtual bool HandleKeyDown(uint32 key, uint32 modifiers,
59 virtual bool HandleKeyUp(uint32 key, uint32 modifiers,
/haiku/src/servers/app/
H A DDesktopListener.h41 virtual bool KeyPressed(uint32 what, int32 key,
99 bool NotifyKeyPressed(uint32 what, int32 key,
/haiku/src/kits/debugger/files/
H A DFileManager.cpp85 size_t HashKey(const EntryPath& key) const
87 return key.HashValue();
95 bool Compare(const EntryPath& key, const LocatableEntry* value) const argument
97 return EntryPath(value) == key;
520 size_t HashKey(const BString& key) const
522 return StringUtils::HashValue(key);
530 bool Compare(const BString& key, const SourceFileEntry* value) const argument
532 return value->path == key;
/haiku/src/system/boot/platform/riscv/
H A Dstart.cpp68 int key = virtio_input_get_key(); local
69 switch(key) {
/haiku/src/system/kernel/posix/
H A Drealtime_sem.cpp159 size_t HashKey(const KeyType& key) const
161 return hash_hash_string(key);
169 bool Compare(const KeyType& key, NamedSem* semaphore) const argument
171 return strcmp(key, semaphore->Name()) == 0;
348 size_t HashKey(const KeyType& key) const
350 return (size_t)key;
358 bool Compare(const KeyType& key, TeamSemInfo* semaphore) const argument
360 return key == semaphore->ID();

Completed in 144 milliseconds

<<11121314151617181920>>