Searched refs:hash (Results 1 - 25 of 40) sorted by relevance

12

/seL4-camkes-master/projects/picotcp/include/
H A Dpico_constants.h47 uint32_t hash = 5381; local
51 hash = ((hash << 5) + hash) + ptr[i]; /* hash * 33 + char */
52 return hash;
H A Dpico_device.h23 uint32_t hash; member in struct:pico_device
H A Dpico_stack.h83 uint32_t pico_timer_add_hashed(pico_time expire, void (*timer)(pico_time, void *), void *arg, uint32_t hash);
84 void pico_timer_cancel_hashed(uint32_t hash);
H A Dpico_protocol.h75 uint32_t hash; member in struct:pico_protocol
H A Dpico_frame.h75 uint32_t hash; member in struct:pico_frame
/seL4-camkes-master/kernel/src/machine/
H A Dprofiler.c140 word_t hash = (pc >> 2) % MAX_UNIQUE_INSTRUCTIONS; local
149 if (profiler_entries[hash].pc == pc) {
152 profiler_entries[hash].count++;
155 } else if (profiler_entries[hash].pc == 0) {
159 profiler_entries[hash].pc = pc;
160 profiler_entries[hash].count = 1;
171 hash += hash2;
172 hash %= MAX_UNIQUE_INSTRUCTIONS;
/seL4-camkes-master/projects/camkes-tool/camkes/ast/tests/
H A Dtesthashing.py39 Test the hash of an `int` is just its value, which we expect.
42 self.assertEqual(i, hash(i),
43 'hash of %d is not %d as expected' % (i, i))
47 Test the hash of a `bool` is its integer value as expected.
49 self.assertEqual(hash(True), 1)
50 self.assertEqual(hash(False), 0)
/seL4-camkes-master/projects/projects_libs/libjansson/jansson-2.7/src/
H A Dhashtable.c29 /* Implementation of the hash function */
76 const char *key, size_t hash)
88 if(pair->hash == hash && strcmp(pair->key, key) == 0)
102 const char *key, size_t hash)
108 index = hash & hashmask(hashtable->order);
111 pair = hashtable_find_pair(hashtable, bucket, key, hash);
174 index = pair->hash % new_size;
215 size_t hash, index; local
222 hash
75 hashtable_find_pair(hashtable_t *hashtable, bucket_t *bucket, const char *key, size_t hash) argument
101 hashtable_do_del(hashtable_t *hashtable, const char *key, size_t hash) argument
264 size_t hash; local
279 size_t hash = hash_str(key); local
307 size_t hash; local
[all...]
H A Dhashtable.h20 size_t hash; member in struct:hashtable_pair
/seL4-camkes-master/tools/cogent/impl/fs/bilby/c/
H A Didx.c88 u32 hash = idx_hash_inum(inum); local
90 xnode = idx_index_search(&bi->idx_hash[hash], id);
132 u32 hash = idx_hash_inum(inum); local
134 xnode = index_insert_or_replace(bi, &bi->idx_hash[hash], id, allocated_node);
142 u32 hash = idx_hash_inum(inum); local
144 return index_insert_or_replace(bi, &bi->idx_hash[hash], id, NULL);
153 u32 hash = idx_hash_inum(inum); local
155 node = bi->idx_hash[hash].rbt_node;
182 u32 hash = idx_hash_inum(inum); local
184 xnode = idx_index_search(&bi->idx_hash[hash], i
[all...]
H A Dgim.c55 u32 hash = gim_hash_inum(inum_from_id(id)); local
56 struct rbt_root *root = &bi->gim_hash[hash];
88 u32 hash = gim_hash_inum(inum_from_id(id)); local
89 struct rbt_root *root = &bi->gim_hash[hash];
139 u32 hash = gim_hash_inum(inum); local
141 node = bi->gim_hash[hash].rbt_node;
210 u32 hash; local
216 hash = gim_hash_inum(inum_from_id(id));
221 rbt_erase(&gnode->node, &bi->gim_hash[hash]);
/seL4-camkes-master/projects/lwip/src/netif/ppp/
H A Dchap-md5.c67 unsigned char hash[MD5_HASH_SIZE]; local
75 /* Generate hash of ID, secret, challenge */
81 lwip_md5_finish(&ctx, hash);
84 /* Test if our hash matches the peer's response */
85 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) {
/seL4-camkes-master/projects/camkes-tool/camkes/internal/
H A Dhash.py19 This is based on how Python's native hash function
21 functionality in order to be able to hash lists and deterministically
22 hash strings.
45 return hash("None")
59 return hash(value)
/seL4-camkes-master/projects/musllibc/src/search/
H A Dhsearch.c8 open addressing hash table with 2^n table size
9 quadratic probing is used in case of hash collision
10 tab indices and hash are size_t
83 static ENTRY *lookup(char *key, size_t hash, struct hsearch_data *htab) argument
88 for (i=hash,j=1; ; i+=j++) {
130 size_t hash = keyhash(item.key); local
131 ENTRY *e = lookup(item.key, hash, htab);
149 e = lookup(item.key, hash, htab);
/seL4-camkes-master/projects/picotcp/stack/
H A Dpico_protocol.c24 if (a->hash < b->hash)
27 if (a->hash > b->hash)
195 p->hash = pico_hash(p->name, (uint32_t)strlen(p->name));
H A Dpico_stack.c558 uint32_t hash; member in struct:pico_timer_ref
634 void pico_timer_cancel_hashed(uint32_t hash) argument
638 if (hash == 0u)
643 if (tref->hash == hash) {
819 pico_timer_ref_add(pico_time expire, struct pico_timer *t, uint32_t id, uint32_t hash) argument
826 tref.hash = hash;
872 uint32_t pico_timer_add_hashed(pico_time expire, void (*timer)(pico_time, void *), void *arg, uint32_t hash) argument
884 return pico_timer_ref_add(expire, t, tmr_id++, hash);
[all...]
H A Dpico_device.c36 if (a->hash < b->hash)
40 if (a->hash > b->hash)
180 pico_rand_feed(dev->hash);
219 dev->hash = pico_hash(dev->name, len);
/seL4-camkes-master/projects/musllibc/src/network/
H A Dif_nameindex.c22 unsigned int hash[IFADDRS_HASH_SIZE]; member in struct:ifnameindexctx
52 i = ctx->hash[bucket];
76 map->hash_next = ctx->hash[bucket];
77 ctx->hash[bucket] = ctx->num;
H A Dgetifaddrs.c44 struct ifaddrs_storage *hash[IFADDRS_HASH_SIZE]; member in struct:ifaddrs_ctx
121 for (ifs0 = ctx->hash[ifa->ifa_index % IFADDRS_HASH_SIZE]; ifs0; ifs0 = ifs0->hash_next)
156 ifs->hash_next = ctx->hash[bucket];
157 ctx->hash[bucket] = ifs;
/seL4-camkes-master/projects/picotcp/modules/
H A Dpico_hotplug_detection.c24 if (a->dev->hash < b->dev->hash)
27 if (a->dev->hash > b->dev->hash)
/seL4-camkes-master/projects/projects_libs/libmsgpack/msgpack-c/include/msgpack/
H A Dcpp_config.hpp108 using std::hash;
/seL4-camkes-master/projects/musllibc/dist/
H A Dconfig.mak20 # Uncomment to fix broken distro-patched toolchains where hash-style=gnu(only)
21 #LDFLAGS += -Wl,--hash-style,both
/seL4-camkes-master/projects/picotcp/test/unit/
H A Dmodunit_pico_protocol.c34 .hash = 0
37 .hash = 1
40 a.hash = 1;
42 a.hash = 2;
/seL4-camkes-master/projects/projects_libs/libmsgpack/msgpack-c/test/
H A Dmsgpack_cpp11.cpp158 struct hash : std::hash<Key> { struct in namespace:TestEnumClassMemberClass::test
159 using std::hash<Key>::hash;
215 using type = unordered_map<int, int, test::hash<int>, test::equal_to<int>, test::map_allocator<int, int>>;
231 using type = unordered_map<int, int, test::hash<int>, test::equal_to<int>, test::map_allocator<int, int>>;
243 using type = unordered_multimap<int, int, test::hash<int>, test::equal_to<int>, test::map_allocator<int, int>>;
263 using type = unordered_multimap<int, int, test::hash<int>, test::equal_to<int>, test::map_allocator<int, int>>;
276 using type = unordered_set<int, test::hash<int>, test::equal_to<int>, test::set_allocator<int>>;
292 using type = unordered_set<int, test::hash<in
378 template <> struct hash<no_def_con> { struct in namespace:TestEnumClassMemberClass::std
[all...]
/seL4-camkes-master/tools/seL4/elfloader-tool/src/
H A Dcommon.c26 #include "hash.h"
133 __attribute__((unused)) const char *hash)
157 void *file_hash = cpio_get_file(_archive_start, cpio_len, (const char *)hash, &unused);
160 /* If the file hash doesn't have a pointer, the file doesn't exist, so we cannot confirm the file is what we expect. Abort */
162 printf("Cannot compare hashes for %s, expected hash, %s, doesn't exist\n", name, hash);
184 /* Print the hash so the user can see they're the same or different */
130 load_elf(const char *name, void *elf, paddr_t dest_paddr, struct image_info *info, int keep_headers, __attribute__((unused)) unsigned long size, __attribute__((unused)) const char *hash) argument

Completed in 133 milliseconds

12