Serene Runtime 1.0.0-dev
C runtime for the Serene programming language
Loading...
Searching...
No Matches
maps.c File Reference
Include dependency graph for maps.c:

Go to the source code of this file.

Functions

static bool srn_vmap_cmp (const hmap_t *hmap, const hmap_key_t *a, const hmap_key_t *b)
static hmap_hash_t srn_vmap_hash (const hmap_t *hmap, const hmap_key_t *k)
srn_value_tsrn_map_empty (srn_context_t *ctx, srn_metadata_t *metadata)
srn_value_tsrn_map_assoc (srn_context_t *ctx, srn_metadata_t *metadata, srn_value_t *map, srn_value_t *key, srn_value_t *value)

Variables

static const hmap_control_t value_map

Function Documentation

◆ srn_map_assoc()

srn_value_t * srn_map_assoc ( srn_context_t * ctx,
srn_metadata_t * metadata,
srn_value_t * map,
srn_value_t * key,
srn_value_t * value )

Definition at line 71 of file maps.c.

74 {
75 PANIC_IF_NULL(ctx);
76 PANIC_IF_NULL(map);
77 PANIC_IF_NULL(key);
78 PANIC_IF_NULL(value);
79
80 if (!IS_A(map, VMap)) {
81 return srn_errors_make_error(ctx, metadata, ABSURD, "expected a map");
82 }
83
84 // Hashing panics on the unhashable tags, and a panic from a data driven
85 // value is wrong in an API that reports failures as values.
86 if (!srn_value_hashable(key)) {
87 return srn_errors_make_error(ctx, metadata, ABSURD, "map key is not hashable");
88 }
89
90 hmap_key_t k = {.data = key, .len = sizeof(*key)};
91
92 srn_map_t *old = AS_MAP(map);
93 srn_map_t *neu = ALLOC(ctx, srn_map_t);
94
95 neu->inner = value_map.insert(&value_map, &old->inner, &k, value);
96 return srn_value_make(ctx, VMap, metadata, (void *)neu);
97}
#define ALLOC(ctx, T)
Definition context.h:84
srn_value_t * srn_value_make(srn_context_t *ctx, srn_value_tag_t tag, srn_metadata_t *metadata, void *payload)
Creates a new serene value.
Definition core.c:36
@ VMap
Definition core.h:126
#define AS_MAP(value_ref)
Definition core.h:182
#define IS_A(value_ref, field)
Definition core.h:167
@ ABSURD
Definition errors.h:76
static const hmap_control_t value_map
Definition maps.c:52
bool srn_value_hashable(const srn_value_t *v)
Whether v can be a hash key.
Definition protocols.c:139
Note: For key equality we use the memcpy function.
Definition hashmap.h:66
A persistent, immutable map.
Definition maps.h:29
hmap_t inner
Definition maps.h:30
#define PANIC_IF_NULL(ptr)
Definition utils.h:66
Here is the call graph for this function:
Here is the caller graph for this function:

◆ srn_map_empty()

srn_value_t * srn_map_empty ( srn_context_t * ctx,
srn_metadata_t * metadata )

Definition at line 64 of file maps.c.

64 {
65 PANIC_IF_NULL(ctx);
66 srn_map_t *m = ALLOC(ctx, srn_map_t);
67 m->inner = hmap_empty(ctx);
68 return srn_value_make(ctx, VMap, metadata, (void *)m);
69}
hmap_t hmap_empty(const srn_context_t *ctx)
Create, initialize and return a new hashmap pinned to ctx.
Definition hashmap.c:655
Here is the call graph for this function:
Here is the caller graph for this function:

◆ srn_vmap_cmp()

bool srn_vmap_cmp ( const hmap_t * hmap,
const hmap_key_t * a,
const hmap_key_t * b )
static

Definition at line 28 of file maps.c.

28 {
29 srn_value_t *va = (srn_value_t *)a->data;
30 srn_value_t *vb = (srn_value_t *)b->data;
31 srn_value_t *res = srn_value_eq(hmap->map_ctx, va, vb);
32 switch (TYPE(res)) {
33 case VFalse:
34 return false;
35 case VTrue:
36 return true;
37 default:
38 PANIC("Should never happen");
39 }
40}
#define TYPE(value_ref)
Definition core.h:165
@ VFalse
Definition core.h:115
@ VTrue
Definition core.h:114
srn_value_t * srn_value_eq(const srn_context_t *ctx, const srn_value_t *a, const srn_value_t *b)
Check to values for equality. Return a boolean.
Definition protocols.c:38
void * data
len 0 -> data == nullptr
Definition hashmap.h:68
const srn_context_t * map_ctx
The context that owns every allocation the map retains.
Definition hashmap.h:104
#define PANIC(msg)
Definition utils.h:53
Here is the call graph for this function:

◆ srn_vmap_hash()

hmap_hash_t srn_vmap_hash ( const hmap_t * hmap,
const hmap_key_t * k )
static

Definition at line 43 of file maps.c.

43 {
46 srn_value_t *v = (srn_value_t *)k->data;
47
49 return srn_value_hash(hmap->map_ctx, v);
50}
srn_hash_t srn_value_hash(const srn_context_t *ctx, const srn_value_t *v)
Compute the xxHash32 of a value using the engine seed.
Definition protocols.c:152
Here is the call graph for this function:

Variable Documentation

◆ value_map

const hmap_control_t value_map
static
Initial value:
= {
.cmp = &srn_vmap_cmp,
.hash = &srn_vmap_hash,
.insert = hmap_insert_ctl,
.lookup = hmap_lookup_ctl,
.copy_key = &hmap_copy_key,
}
void * hmap_lookup_ctl(const hmap_control_t *ctl, const hmap_t *hmap, const hmap_key_t *k, void *default_value)
Just like the hmap_lookup function but, it receives a hmap_control_t to customize the comparison and ...
Definition hashmap.c:638
hmap_t hmap_insert_ctl(const hmap_control_t *ctl, const hmap_t *hmap, hmap_key_t *k, void *v)
Just like the hmap_insert function but, it receives a hmap_control_t to customize the comparison and ...
Definition hashmap.c:594
hmap_key_t * hmap_copy_key(const hmap_t *hmap, const hmap_key_t *k)
The default copy_key hook.
Definition hashmap.c:678
static bool srn_vmap_cmp(const hmap_t *hmap, const hmap_key_t *a, const hmap_key_t *b)
Definition maps.c:28
static hmap_hash_t srn_vmap_hash(const hmap_t *hmap, const hmap_key_t *k)
Definition maps.c:43

Definition at line 52 of file maps.c.

52 {
53 .cmp = &srn_vmap_cmp,
54 .hash = &srn_vmap_hash,
55 .insert = hmap_insert_ctl,
56 .lookup = hmap_lookup_ctl,
57 // The key bytes are a shallow srn_value_t struct; copying them into the
58 // map's pinned context keeps the retained key valid independently of the
59 // assoc'ing caller's context. Anything the value points at (its payload,
60 // metadata) is still the caller's to keep alive.
61 .copy_key = &hmap_copy_key,
62};