Lines Matching defs:value
100 void *value;
121 #define IDX_NIL UINT_MAX /* special index value meaning "none" or "end" */
134 #define DIB_RAW_OVERFLOW ((dib_raw_t)0xfdU) /* indicates DIB value is greater than representable */
456 * Having an overflow DIB value is very unlikely. The hash function
462 * This returns the correct DIB value by recomputing the hash value in
539 return ((struct plain_hashmap_entry*)e)->value;
946 free(e->value);
1013 * The caller must place the entry (only its key and value, not link indexes)
1239 int hashmap_put(Hashmap *h, const void *key, void *value) {
1250 if (e->value == value)
1257 e->value = value;
1278 int hashmap_replace(Hashmap *h, const void *key, void *value) {
1300 e->value = value;
1306 e->value = value;
1310 int hashmap_update(Hashmap *h, const void *key, void *value) {
1322 e->value = value;
1358 return e->value;
1411 data = e->value;
1420 int hashmap_remove_and_put(Hashmap *h, const void *old_key, const void *new_key, void *value) {
1441 e->value = value;
1473 int hashmap_remove_and_replace(Hashmap *h, const void *old_key, const void *new_key, void *value) {
1503 e->value = value;
1509 void *hashmap_remove_value(Hashmap *h, const void *key, void *value) {
1522 if (e->value != value)
1527 return value;
1619 r = hashmap_put(h, pe->b.key, pe->value);
1698 ((struct plain_hashmap_entry*) n)->value =
1699 ((struct plain_hashmap_entry*) e)->value;
1735 ((struct plain_hashmap_entry*) n)->value =
1736 ((struct plain_hashmap_entry*) e)->value;
1809 return ordered_bucket_at(h, e->iterate_next)->p.value;
1812 int set_consume(Set *s, void *value) {
1815 r = set_put(s, value);
1817 free(value);