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
|
/* Copyright (C) 2018 C. McEnroe <june@causal.agency>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <err.h>
#include <stdlib.h>
#include <string.h>
#include <sysexits.h>
#include "chat.h"
#define GLOBAL_TAGS \
X(TagNone, 0, "<none>") \
X(TagStatus, 1, "<status>") \
X(TagRaw, 2, "<raw>")
enum { GlobalTagsLen = 3 };
#define X(tag, id, name) const struct Tag tag = { id, name };
GLOBAL_TAGS
#undef X
static struct {
char *name[TagsLen];
size_t len;
} tags = {
.name = {
#define X(_, id, name) [id] = name,
GLOBAL_TAGS
#undef X
},
.len = GlobalTagsLen,
};
struct Tag tagFind(const char *name) {
for (size_t id = 0; id < tags.len; ++id) {
if (strcmp(tags.name[id], name)) continue;
return (struct Tag) { id, tags.name[id] };
}
return TagNone;
}
struct Tag tagFor(const char *name) {
struct Tag tag = tagFind(name);
if (tag.id != TagNone.id) return tag;
if (tags.len == TagsLen) return TagStatus;
size_t id = tags.len++;
tags.name[id] = strdup(name);
if (!tags.name[id]) err(EX_OSERR, "strdup");
return (struct Tag) { id, tags.name[id] };
}
|