blob: a0c834a54acd1581402733f3a1fae63b04c01194 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/* map.h -- the map type for Go.
Copyright 2009, 2010 The Go Authors. All rights reserved.
Use of this source code is governed by a BSD-style
license that can be found in the LICENSE file. */
#include <stddef.h>
#include "go-type.h"
/* A map descriptor is what we need to manipulate the map. This is
constant for a given map type. */
struct __go_map_descriptor
{
/* A pointer to the type descriptor for the type of the map itself. */
const struct __go_map_type *__map_descriptor;
/* A map entry is a struct with three fields:
map_entry_type *next_entry;
key_type key;
value_type value;
This is the size of that struct. */
size_t __entry_size;
/* The offset of the key field in a map entry struct. */
size_t __key_offset;
/* The offset of the value field in a map entry struct (the value
field immediately follows the key field, but there may be some
bytes inserted for alignment). */
size_t __val_offset;
};
struct __go_map
{
/* The constant descriptor for this map. */
const struct __go_map_descriptor *__descriptor;
/* The number of elements in the hash table. */
size_t __element_count;
/* The number of entries in the __buckets array. */
size_t __bucket_count;
/* Each bucket is a pointer to a linked list of map entries. */
void **__buckets;
};
/* For a map iteration the compiled code will use a pointer to an
iteration structure. The iteration structure will be allocated on
the stack. The Go code must allocate at least enough space. */
struct __go_hash_iter
{
/* A pointer to the current entry. This will be set to NULL when
the range has completed. The Go will test this field, so it must
be the first one in the structure. */
const void *entry;
/* The map we are iterating over. */
const struct __go_map *map;
/* A pointer to the next entry in the current bucket. This permits
deleting the current entry. This will be NULL when we have seen
all the entries in the current bucket. */
const void *next_entry;
/* The bucket index of the current and next entry. */
size_t bucket;
};
extern struct __go_map *__go_new_map (const struct __go_map_descriptor *,
size_t);
extern unsigned long __go_map_next_prime (unsigned long);
extern void *__go_map_index (struct __go_map *, const void *, _Bool);
extern void __go_map_delete (struct __go_map *, const void *);
extern void __go_mapiterinit (const struct __go_map *, struct __go_hash_iter *);
extern void __go_mapiternext (struct __go_hash_iter *);
extern void __go_mapiter1 (struct __go_hash_iter *it, unsigned char *key);
extern void __go_mapiter2 (struct __go_hash_iter *it, unsigned char *key,
unsigned char *val);
|
