| /third_party/libbpf/src/ |
| H A D | hashmap.c | 13 #include "hashmap.h"
38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new()
55 struct hashmap *map = malloc(sizeof(struct hashmap)); in hashmap__new()
63 void hashmap__clear(struct hashmap *map) in hashmap__clear()
76 void hashmap__free(struct hashmap *map) in hashmap__free()
85 size_t hashmap__size(const struct hashmap *map) in hashmap__size()
90 size_t hashmap__capacity(const struct hashmap *map) in hashmap__capacity()
95 static bool hashmap_needs_to_grow(struct hashmap *ma
[all...] |
| H A D | hashmap.h | 72 struct hashmap { struct
83 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn,
85 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn,
88 void hashmap__clear(struct hashmap *map);
89 void hashmap__free(struct hashmap *map);
91 size_t hashmap__size(const struct hashmap *map);
92 size_t hashmap__capacity(const struct hashmap *map);
102 * This turns hashmap into a multimap by allowing multiple values to be
103 * associated with the same key. Most useful read API for such hashmap is
129 int hashmap_insert(struct hashmap *ma
[all...] |
| H A D | strset.c | 8 #include "hashmap.h"
19 struct hashmap *strs_hash;
42 struct hashmap *hash; in strset__new()
|
| H A D | btf_dump.c | 21 #include "hashmap.h"
109 struct hashmap *type_names;
114 struct hashmap *ident_names;
223 static void btf_dump_free_names(struct hashmap *map) in btf_dump_free_names()
649 static size_t btf_dump_name_dups(struct btf_dump *d, struct hashmap *name_map,
1632 static size_t btf_dump_name_dups(struct btf_dump *d, struct hashmap *name_map, in btf_dump_name_dups()
1656 struct hashmap *name_map) in btf_dump_resolve_name()
|
| H A D | Makefile | 57 btf_dump.o hashmap.o ringbuf.o strset.o linker.o gen_loader.o \
|
| /third_party/protobuf/ruby/ext/google/protobuf_c/ |
| H A D | map.c | 218 * this may be an ordinary Ruby hashmap or another Map instance with identical
222 * value_type). The contents of this initial hashmap or Map instance are
233 // hashmap). in Map_init()
412 // Ruby hashmap's :[]= method also returns the inserted value. in Map_index_set()
740 VALUE Map_merge(VALUE _self, VALUE hashmap) { in Map_merge() argument
742 return Map_merge_into_self(dupped, hashmap); in Map_merge()
751 VALUE Map_merge_into_self(VALUE _self, VALUE hashmap) { in Map_merge_into_self() argument
752 if (TYPE(hashmap) == T_HASH) { in Map_merge_into_self()
753 rb_hash_foreach(hashmap, merge_into_self_callback, _self); in Map_merge_into_self()
754 } else if (RB_TYPE_P(hashmap, T_DAT in Map_merge_into_self()
[all...] |
| H A D | protobuf.h | 80 keep a global hashmap, accessed by get_def_obj/add_def_obj below.
490 VALUE Map_merge(VALUE _self, VALUE hashmap);
491 VALUE Map_merge_into_self(VALUE _self, VALUE hashmap);
|
| /third_party/rust/crates/once_cell/examples/ |
| H A D | lazy_static.rs | 15 fn hashmap() -> &'static HashMap<u32, &'static str> { in hashmap() functions
34 assert_eq!(hashmap().get(&0), Some(&"foo")); in main()
35 assert_eq!(hashmap().get(&1), Some(&"bar")); in main()
|
| /third_party/protobuf/ruby/src/main/java/com/google/protobuf/jruby/ |
| H A D | RubyMap.java | 94 * this may be an ordinary Ruby hashmap or another Map instance with identical
98 * value_type). The contents of this initial hashmap or Map instance are
378 protected RubyMap mergeIntoSelf(final ThreadContext context, IRubyObject hashmap) { in mergeIntoSelf() argument
379 if (hashmap instanceof RubyHash) { in mergeIntoSelf()
380 ((RubyHash) hashmap).visitAll(new RubyHash.Visitor() { in mergeIntoSelf()
386 } else if (hashmap instanceof RubyMap) { in mergeIntoSelf()
387 RubyMap other = (RubyMap) hashmap; in mergeIntoSelf()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| H A D | hb-map.hh | 360 using hashmap = hb_hashmap_t<hb_codepoint_t,
372 hb_map_t (std::initializer_list<hb_pair_t<hb_codepoint_t, hb_codepoint_t>> lst) : hashmap (lst) {} in hb_map_t()
375 hb_map_t (const Iterable &o) : hashmap (o) {} in hb_map_t()
|
| /third_party/pulseaudio/src/pulsecore/ |
| H A D | json.h | 24 #include <pulsecore/hashmap.h>
|
| H A D | device-port.h | 34 #include <pulsecore/hashmap.h>
|
| H A D | mutex-win32.c | 27 #include <pulsecore/hashmap.h>
|
| H A D | core.h | 45 #include <pulsecore/hashmap.h>
196 pa_hashmap *modules_pending_unload; /* pa_module -> pa_module (hashmap-as-a-set) */
|
| /third_party/rust/crates/serde/test_suite/tests/macros/ |
| H A D | mod.rs | 45 macro_rules! hashmap { macros
|
| /third_party/pulseaudio/src/modules/rtp/ |
| H A D | headerlist.c | 29 #include <pulsecore/hashmap.h>
|
| /third_party/pulseaudio/src/modules/ |
| H A D | module-devd-detect.c | 34 #include <pulsecore/hashmap.h>
|
| H A D | module-systemd-login.c | 37 #include <pulsecore/hashmap.h>
126 /* We copy all sessions that still exist from one hashmap to the in get_session_list()
|
| H A D | module-console-kit.c | 35 #include <pulsecore/hashmap.h>
|
| H A D | module-zeroconf-discover.c | 40 #include <pulsecore/hashmap.h>
|
| /third_party/rust/crates/serde/test_suite/tests/ |
| H A D | test_de.rs | 1231 hashmap![1 => 2], in test_hashmap()
1240 hashmap![1 => 2, 3 => 4], in test_hashmap()
1251 hashmap![1 => hashmap![], 2 => hashmap![3 => 4, 5 => 6]], in test_hashmap()
1278 hashmap![FnvHasher @ 1 => 2, 3 => 4], in test_hashmap()
|
| H A D | test_ser.rs | 294 &hashmap![1 => 2], in test_hashmap()
303 &hashmap![FnvHasher @ 1 => 2], in test_hashmap()
|
| /third_party/pulseaudio/src/tests/ |
| H A D | hashmap-test.c | 6 #include <pulsecore/hashmap.h>
34 /* single_key_test exercises basic hashmap functionality on a single key. */
60 ck_abort_msg("Got wrong value from hashmap for k=0; got %p, want %p", get_ret, &entry); in START_TEST()
116 /* fill_all_buckets hits the hashmap with enough keys to exercise the bucket
194 ck_abort_msg("Got bad order iterating over hashmap: got %d, want %d", v->value, expected); in START_TEST()
202 ck_abort_msg("Got bad order iterating over hashmap: got %d, want %d", v->value, expected); in START_TEST()
207 /* Now empty out the hashmap. The iteration list should be empty. */ in START_TEST()
225 ck_abort_msg("Got bad order iterating over hashmap: got %d, want %d", v->value, expected); in START_TEST()
244 tc = tcase_create("hashmap"); in main()
|
| /third_party/pulseaudio/src/pulse/ |
| H A D | internal.h | 41 #include <pulsecore/hashmap.h>
|
| /third_party/pulseaudio/src/modules/raop/ |
| H A D | module-raop-discover.c | 41 #include <pulsecore/hashmap.h>
|