Home
last modified time | relevance | path

Searched refs:_key (Results 1 – 4 of 4) sorted by relevance

/tools/perf/util/
A Dhashmap.h192 #define hashmap__for_each_key_entry(map, cur, _key) \ argument
194 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
198 if ((map)->equal_fn(cur->key, (_key), (map)->ctx))
200 #define hashmap__for_each_key_entry_safe(map, cur, tmp, _key) \ argument
202 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
206 if ((map)->equal_fn(cur->key, (_key), (map)->ctx))
A Dcomm.c92 static int comm_str__search(const void *_key, const void *_member) in comm_str__search() argument
94 const char *key = _key; in comm_str__search()
A Dannotate-data.c195 static int data_type_cmp(const void *_key, const struct rb_node *node) in data_type_cmp() argument
197 const struct annotated_data_type *key = _key; in data_type_cmp()
630 static int global_var_cmp(const void *_key, const struct rb_node *node) in global_var_cmp() argument
632 const u64 addr = (uintptr_t)_key; in global_var_cmp()
/tools/lib/bpf/
A Dhashmap.h192 #define hashmap__for_each_key_entry(map, cur, _key) \ argument
194 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
198 if ((map)->equal_fn(cur->key, (_key), (map)->ctx))
200 #define hashmap__for_each_key_entry_safe(map, cur, tmp, _key) \ argument
202 ? (map)->buckets[hash_bits((map)->hash_fn((_key), (map)->ctx), (map)->cap_bits)] \
206 if ((map)->equal_fn(cur->key, (_key), (map)->ctx))

Completed in 10 milliseconds