Changeset 5e801dc in mainline for kernel/generic/src
- Timestamp:
- 2019-02-25T14:42:38Z (6 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- a4e78743
- Parents:
- ee8d4d6
- git-author:
- Jiří Zárevúcky <zarevucky.jiri@…> (2019-02-25 14:42:38)
- git-committer:
- GitHub <noreply@…> (2019-02-25 14:42:38)
- Location:
- kernel/generic/src
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/src/adt/hash_table.c
ree8d4d6 r5e801dc 51 51 #include <adt/hash_table.h> 52 52 #include <adt/list.h> 53 #include <assert.h> 53 54 #include <stdlib.h> 54 #include <assert.h>55 55 #include <str.h> 56 56 … … 245 245 * 246 246 */ 247 ht_link_t *hash_table_find(const hash_table_t *h, void *key)247 ht_link_t *hash_table_find(const hash_table_t *h, const void *key) 248 248 { 249 249 assert(h && h->bucket); … … 306 306 * @return Returns the number of removed items. 307 307 */ 308 size_t hash_table_remove(hash_table_t *h, void *key)308 size_t hash_table_remove(hash_table_t *h, const void *key) 309 309 { 310 310 assert(h && h->bucket); -
kernel/generic/src/cap/cap.c
ree8d4d6 r5e801dc 101 101 } 102 102 103 static size_t caps_key_hash( void *key)104 { 105 c ap_handle_t *handle = (cap_handle_t *)key;103 static size_t caps_key_hash(const void *key) 104 { 105 const cap_handle_t *handle = key; 106 106 return hash_mix(cap_handle_raw(*handle)); 107 107 } 108 108 109 static bool caps_key_equal( void *key, const ht_link_t *item)110 { 111 c ap_handle_t *handle = (cap_handle_t *)key;109 static bool caps_key_equal(const void *key, const ht_link_t *item) 110 { 111 const cap_handle_t *handle = key; 112 112 cap_t *cap = hash_table_get_inst(item, cap_t, caps_link); 113 113 return *handle == cap->handle; -
kernel/generic/src/ddi/irq.c
ree8d4d6 r5e801dc 73 73 74 74 static size_t irq_ht_hash(const ht_link_t *); 75 static size_t irq_ht_key_hash( void *);75 static size_t irq_ht_key_hash(const void *); 76 76 static bool irq_ht_equal(const ht_link_t *, const ht_link_t *); 77 static bool irq_ht_key_equal( void *, const ht_link_t *);77 static bool irq_ht_key_equal(const void *, const ht_link_t *); 78 78 79 79 static hash_table_ops_t irq_ht_ops = { … … 208 208 209 209 /** Return the hash of the key. */ 210 size_t irq_ht_key_hash( void *key)211 { 212 inr_t *inr = (inr_t *)key;210 size_t irq_ht_key_hash(const void *key) 211 { 212 const inr_t *inr = key; 213 213 return hash_mix(*inr); 214 214 } … … 223 223 224 224 /** Return true if the key is equal to the item's lookup key. */ 225 bool irq_ht_key_equal( void *key, const ht_link_t *item)226 { 227 inr_t *inr = (inr_t *)key;225 bool irq_ht_key_equal(const void *key, const ht_link_t *item) 226 { 227 const inr_t *inr = key; 228 228 irq_t *irq = hash_table_get_inst(item, irq_t, link); 229 229 return irq->inr == *inr; -
kernel/generic/src/lib/ra.c
ree8d4d6 r5e801dc 67 67 68 68 /** Return the hash of the key */ 69 static size_t used_key_hash( void *key)70 { 71 uintptr_t *base = (uintptr_t *)key;69 static size_t used_key_hash(const void *key) 70 { 71 const uintptr_t *base = key; 72 72 return hash_mix(*base); 73 73 } 74 74 75 75 /** Return true if the key is equal to the item's lookup key */ 76 static bool used_key_equal( void *key, const ht_link_t *item)77 { 78 uintptr_t *base = (uintptr_t *)key;76 static bool used_key_equal(const void *key, const ht_link_t *item) 77 { 78 const uintptr_t *base = key; 79 79 ra_segment_t *seg = hash_table_get_inst(item, ra_segment_t, uh_link); 80 80 return seg->base == *base;
Note:
See TracChangeset
for help on using the changeset viewer.