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
|
// Copyright 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.
package runtime
#include "runtime.h"
#include "map.h"
typedef struct __go_map Hmap;
typedef struct __go_hash_iter hiter;
/* Access a value in a map, returning a value and a presence indicator. */
func mapaccess2(t *MapType, h *Hmap, key *byte, val *byte) (present bool) {
byte *mapval;
size_t valsize;
mapval = __go_map_index(h, key, 0);
valsize = t->__val_type->__size;
if (mapval == nil) {
__builtin_memset(val, 0, valsize);
present = 0;
} else {
__builtin_memcpy(val, mapval, valsize);
present = 1;
}
}
/* Optionally assign a value to a map (m[k] = v, p). */
func mapassign2(h *Hmap, key *byte, val *byte, p bool) {
if (!p) {
__go_map_delete(h, key);
} else {
byte *mapval;
size_t valsize;
mapval = __go_map_index(h, key, 1);
valsize = h->__descriptor->__map_descriptor->__val_type->__size;
__builtin_memcpy(mapval, val, valsize);
}
}
/* Delete a key from a map. */
func mapdelete(h *Hmap, key *byte) {
__go_map_delete(h, key);
}
/* Initialize a range over a map. */
func mapiterinit(h *Hmap, it *hiter) {
__go_mapiterinit(h, it);
}
/* Move to the next iteration, updating *HITER. */
func mapiternext(it *hiter) {
__go_mapiternext(it);
}
/* Get the key of the current iteration. */
func mapiter1(it *hiter, key *byte) {
__go_mapiter1(it, key);
}
/* Get the key and value of the current iteration. */
func mapiter2(it *hiter, key *byte, val *byte) {
__go_mapiter2(it, key, val);
}
|
