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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/*
Copyright (c) 2012, Matthias Schiffer <mschiffer@universe-factory.net>
Partly based on QuickTun Copyright (c) 2010, Ivo Smits <Ivo@UCIS.nl>.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "fastd.h"
#include "peer.h"
#include <arpa/inet.h>
static void print_default_peer_str(const fastd_context *ctx, const fastd_peer *peer) {
char addr_buf[INET6_ADDRSTRLEN] = "";
char pl = '<', pr = '>';
if (fastd_peer_is_temporary(peer)) {
pl = '{';
pr = '}';
}
switch (peer->address.sa.sa_family) {
case AF_UNSPEC:
fprintf(stderr, "%cfloating%c", pl, pr);
return;
case AF_INET:
if (inet_ntop(AF_INET, &peer->address.in.sin_addr, addr_buf, sizeof(addr_buf)))
fprintf(stderr, "%c%s:%u%c", pl, addr_buf, ntohs(peer->address.in.sin_port), pr);
return;
case AF_INET6:
if (inet_ntop(AF_INET6, &peer->address.in6.sin6_addr, addr_buf, sizeof(addr_buf)))
fprintf(stderr, "%c[%s]:%u%c", pl, addr_buf, ntohs(peer->address.in6.sin6_port), pr);
break;
default:
exit_bug(ctx, "unsupported address family");
}
}
#pragma GCC diagnostic ignored "-Wformat-security"
void fastd_printf(const fastd_context *ctx, const char *format, ...) {
va_list ap;
va_start(ap, format);
char *format_dup = strdup(format);
char *str;
for (str = format_dup; *str; str++) {
if (*str != '%') {
fputc(*str, stderr);
continue;
}
int len, flag_l = 0, flag_L = 0, flag_j = 0, flag_z = 0, flag_t = 0;
for(len = 1; str[len]; len++) {
char last;
bool finished = true;
char addr_buf[INET6_ADDRSTRLEN];
void *p;
fastd_peer *peer;
fastd_eth_addr *eth_addr;
switch (str[len]) {
case 'l':
flag_l++;
finished = false;
break;
case 'L':
flag_L++;
finished = false;
break;
case 'j':
flag_j++;
finished = false;
break;
case 'z':
flag_z++;
finished = false;
break;
case 't':
flag_t++;
finished = false;
break;
case '%':
fputc('%', stderr);
break;
case 'd':
case 'i':
case 'o':
case 'u':
case 'x':
case 'X':
last = str[len+1];
str[len+1] = 0;
if (flag_j)
fprintf(stderr, str, va_arg(ap, intmax_t));
else if (flag_z)
fprintf(stderr, str, va_arg(ap, size_t));
else if (flag_t)
fprintf(stderr, str, va_arg(ap, ptrdiff_t));
else if (flag_l == 0)
fprintf(stderr, str, va_arg(ap, int));
else if (flag_l == 1)
fprintf(stderr, str, va_arg(ap, long));
else
fprintf(stderr, str, va_arg(ap, long long));
str[len+1] = last;
break;
case 'e':
case 'f':
case 'F':
case 'g':
case 'G':
case 'a':
case 'A':
last = str[len+1];
str[len+1] = 0;
if (flag_L)
fprintf(stderr, str, va_arg(ap, long double));
else
fprintf(stderr, str, va_arg(ap, double));
str[len+1] = last;
break;
case 'c':
last = str[len+1];
str[len+1] = 0;
fprintf(stderr, str, va_arg(ap, int));
str[len+1] = last;
break;
case 's':
case 'p':
last = str[len+1];
str[len+1] = 0;
fprintf(stderr, str, va_arg(ap, void*));
str[len+1] = last;
break;
case 'm':
last = str[len+1];
str[len+1] = 0;
fprintf(stderr, str);
str[len+1] = last;
break;
case 'I':
p = va_arg(ap, void*);
if (p) {
if (inet_ntop(flag_l ? AF_INET6 : AF_INET, p, addr_buf, sizeof(addr_buf)))
fprintf(stderr, "%s", addr_buf);
}
else {
fprintf(stderr, "(null)");
}
break;
case 'E':
eth_addr = va_arg(ap, fastd_eth_addr*);
if (eth_addr) {
fprintf(stderr, "%02x:%02x:%02x:%02x:%02x:%02x",
eth_addr->data[0], eth_addr->data[1], eth_addr->data[2],
eth_addr->data[3], eth_addr->data[4], eth_addr->data[5]);
}
else {
fprintf(stderr, "(null)");
}
break;
case 'P':
peer = va_arg(ap, void*);
if (peer) {
if (peer->config && peer->config->name)
fprintf(stderr, "%s", peer->config->name);
else
print_default_peer_str(ctx, peer);
}
else {
fprintf(stderr, "(null)");
}
break;
default:
finished = false;
}
if (finished) {
str += len;
break;
}
}
}
free(format_dup);
va_end(ap);
}
|