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
|
// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (C) 2019 Luis Ressel <aranea@aixah.de>. All Rights Reserved.
*/
#include <errno.h>
#include <limits.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "containers.h"
#include "encoding.h"
#include "peer_names.h"
static bool parse_peer_name(char *line, struct wgpeer_name *slot)
{
char *name;
size_t len;
name = strpbrk(line, " \t");
if (!name)
return false;
*name = '\0';
if (!key_from_base64(slot->public_key, line))
return false;
len = strlen(++name);
if (name[len - 1] == '\n')
name[len - 1] = '\0';
slot->name = strdup(name);
return !!slot->name;
}
static int peer_name_cmp(const void *a, const void *b)
{
const struct wgpeer_name *x = a, *y = b;
return memcmp(x->public_key, y->public_key, WG_KEY_LEN);
}
bool peer_names_open(struct wgpeer_names *names, struct wgdevice *device)
{
size_t max_peers = 1, peers = 0, buf_len = 0, path_len;
struct wgpeer_name *arr, *arr2;
char *buf = NULL, *path;
FILE *f;
path = getenv("WG_PEER_NAMES");
if (!path || !path[0]) {
errno = 0;
return false;
}
path_len = strlen(path);
if (path[path_len - 1] == '/') {
size_t dev_len = strlen(device->name);
char *path2 = malloc(path_len + dev_len + 1);
if (!path2)
return false;
memcpy(path2, path, path_len);
memcpy(path2 + path_len, device->name, dev_len + 1);
f = fopen(path2, "r");
free(path2);
} else
f = fopen(path, "r");
if (!f)
return false;
arr = malloc(sizeof(struct wgpeer_name));
if (!arr)
return false;
while (getline(&buf, &buf_len, f) >= 0) {
if (parse_peer_name(buf, &arr[peers]) && (++peers == max_peers)) {
// TODO: Pulled this overflow check out of my ass, gotta revisit it later
if (SIZE_MAX / (2 * sizeof(struct wgpeer_name)) < max_peers) {
errno = ENOMEM;
return false;
}
max_peers *= 2;
arr2 = realloc(arr, max_peers * sizeof(struct wgpeer_name));
if (!arr2) {
free(arr);
return false;
}
arr = arr2;
}
}
free(buf);
if (!peers)
free(arr);
if ((arr2 = realloc(arr, peers * sizeof(struct wgpeer_name))))
arr = arr2;
qsort(arr, peers, sizeof(struct wgpeer_name), peer_name_cmp);
names->len = peers;
names->arr = arr;
return true;
}
void peer_names_free(struct wgpeer_names *names)
{
if (!names)
return;
for (size_t i = 0; i < names->len; ++i)
free(names->arr[i].name);
if (names->len)
free(names->arr);
}
char *peer_names_get(struct wgpeer_names *names, uint8_t key[static WG_KEY_LEN])
{
size_t r, l = 0;
if (!names || !names->len)
return NULL;
r = names->len - 1;
while (l <= r) {
size_t m = l + (r - l) / 2;
int cmp = memcmp(key, names->arr[m].public_key, WG_KEY_LEN);
if (!cmp)
return names->arr[m].name;
else if (cmp > 0)
l = m + 1;
else if (!m)
break;
else
r = m - 1;
}
return NULL;
}
|
