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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/* $OpenBSD: map.c,v 1.6 2020/04/15 16:59:04 mpi Exp $ */
/*
* Copyright (c) 2020 Martin Pieuchot <mpi@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* Associative array implemented with RB-Tree.
*/
#include <sys/queue.h>
#include <sys/tree.h>
#include <assert.h>
#include <err.h>
#include <limits.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "bt_parser.h"
#include "btrace.h"
#ifndef MIN
#define MIN(_a,_b) ((_a) < (_b) ? (_a) : (_b))
#endif
#ifndef MAX
#define MAX(_a,_b) ((_a) > (_b) ? (_a) : (_b))
#endif
RB_HEAD(map, mentry);
#define KLEN 256
struct mentry {
RB_ENTRY(mentry) mlink;
char mkey[KLEN];
struct bt_arg *mval;
};
int mcmp(struct mentry *, struct mentry *);
struct mentry *mget(struct map *, const char *);
RB_GENERATE(map, mentry, mlink, mcmp);
int
mcmp(struct mentry *me0, struct mentry *me1)
{
return strncmp(me0->mkey, me1->mkey, KLEN - 1);
}
struct mentry *
mget(struct map *map, const char *key)
{
struct mentry me, *mep;
strlcpy(me.mkey, key, KLEN);
mep = RB_FIND(map, map, &me);
if (mep == NULL) {
mep = calloc(1, sizeof(struct mentry));
if (mep == NULL)
err(1, "mentry: calloc");
strlcpy(mep->mkey, key, KLEN);
RB_INSERT(map, map, mep);
}
return mep;
}
void
map_clear(struct map *map)
{
struct mentry *mep;
while ((mep = RB_MIN(map, map)) != NULL) {
RB_REMOVE(map, map, mep);
free(mep);
}
assert(RB_EMPTY(map));
free(map);
}
void
map_delete(struct map *map, const char *key)
{
struct mentry me, *mep;
strlcpy(me.mkey, key, KLEN);
mep = RB_FIND(map, map, &me);
if (mep != NULL) {
RB_REMOVE(map, map, mep);
free(mep);
}
}
struct bt_arg *
map_get(struct map *map, const char *key)
{
struct mentry *mep;
mep = mget(map, key);
if (mep->mval == NULL)
mep->mval = ba_new(0, B_AT_LONG);
return mep->mval;
}
struct map *
map_insert(struct map *map, const char *key, struct bt_arg *bval)
{
struct mentry *mep;
long val;
if (map == NULL) {
map = calloc(1, sizeof(struct map));
if (map == NULL)
err(1, "map: calloc");
}
mep = mget(map, key);
switch (bval->ba_type) {
case B_AT_STR:
case B_AT_LONG:
free(mep->mval);
mep->mval = bval;
break;
case B_AT_MF_COUNT:
if (mep->mval == NULL)
mep->mval = ba_new(0, B_AT_LONG);
val = (long)mep->mval->ba_value;
val++;
mep->mval->ba_value = (void *)val;
break;
case B_AT_MF_MAX:
if (mep->mval == NULL)
mep->mval = ba_new(0, B_AT_LONG);
val = (long)mep->mval->ba_value;
val = MAX(val, ba2long(bval->ba_value, NULL));
mep->mval->ba_value = (void *)val;
break;
case B_AT_MF_MIN:
if (mep->mval == NULL)
mep->mval = ba_new(0, B_AT_LONG);
val = (long)mep->mval->ba_value;
val = MIN(val, ba2long(bval->ba_value, NULL));
mep->mval->ba_value = (void *)val;
break;
case B_AT_MF_SUM:
if (mep->mval == NULL)
mep->mval = ba_new(0, B_AT_LONG);
val = (long)mep->mval->ba_value;
val += ba2long(bval->ba_value, NULL);
mep->mval->ba_value = (void *)val;
break;
default:
errx(1, "no insert support for type %d", bval->ba_type);
}
return map;
}
static struct bt_arg nullba = { {NULL }, (void *)0, NULL, B_AT_LONG };
static struct bt_arg maxba = { { NULL }, (void *)LONG_MAX, NULL, B_AT_LONG };
/* Print at most `top' entries of the map ordered by value. */
void
map_print(struct map *map, size_t top, const char *mapname)
{
struct mentry *mep, *mcur;
struct bt_arg *bhigh, *bprev;
size_t i;
if (map == NULL)
return;
bprev = &maxba;
for (i = 0; i < top; i++) {
mcur = NULL;
bhigh = &nullba;
RB_FOREACH(mep, map, map) {
if (bacmp(mep->mval, bhigh) >= 0 &&
bacmp(mep->mval, bprev) < 0 &&
mep->mval != bprev) {
mcur = mep;
bhigh = mcur->mval;
}
}
if (mcur == NULL)
break;
printf("@%s[%s]: %s\n", mapname, mcur->mkey,
ba2str(mcur->mval, NULL));
bprev = mcur->mval;
}
}
void
map_zero(struct map *map)
{
struct mentry *mep;
RB_FOREACH(mep, map, map) {
mep->mval->ba_value = 0;
mep->mval->ba_type = B_AT_LONG;
}
}
|
