]>
Commit | Line | Data |
---|---|---|
064af421 | 1 | /* |
2225c0b9 | 2 | * Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Nicira, Inc. |
064af421 | 3 | * |
a14bc59f BP |
4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
5 | * you may not use this file except in compliance with the License. | |
6 | * You may obtain a copy of the License at: | |
064af421 | 7 | * |
a14bc59f BP |
8 | * http://www.apache.org/licenses/LICENSE-2.0 |
9 | * | |
10 | * Unless required by applicable law or agreed to in writing, software | |
11 | * distributed under the License is distributed on an "AS IS" BASIS, | |
12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
13 | * See the License for the specific language governing permissions and | |
14 | * limitations under the License. | |
064af421 BP |
15 | */ |
16 | ||
17 | #include <config.h> | |
18 | #include "util.h" | |
ed2232fc | 19 | #include <ctype.h> |
064af421 | 20 | #include <errno.h> |
711e0157 | 21 | #include <limits.h> |
5fcbed74 | 22 | #include <pthread.h> |
064af421 | 23 | #include <stdarg.h> |
711e0157 | 24 | #include <stdint.h> |
064af421 BP |
25 | #include <stdio.h> |
26 | #include <stdlib.h> | |
27 | #include <string.h> | |
fee0c963 | 28 | #include <sys/stat.h> |
daf03c53 | 29 | #include <unistd.h> |
ed2232fc | 30 | #include "bitmap.h" |
ddc4f8e2 | 31 | #include "byte-order.h" |
064af421 | 32 | #include "coverage.h" |
275eebb9 | 33 | #include "ovs-rcu.h" |
728a8b14 | 34 | #include "ovs-thread.h" |
64559798 | 35 | #include "socket-util.h" |
e6211adc | 36 | #include "openvswitch/vlog.h" |
1805ee4b EM |
37 | #ifdef HAVE_PTHREAD_SET_NAME_NP |
38 | #include <pthread_np.h> | |
39 | #endif | |
daf03c53 | 40 | |
d98e6007 | 41 | VLOG_DEFINE_THIS_MODULE(util); |
5136ce49 | 42 | |
d76f09ea BP |
43 | COVERAGE_DEFINE(util_xalloc); |
44 | ||
781dee08 | 45 | /* argv[0] without directory names. */ |
91e12f0d | 46 | char *program_name; |
781dee08 | 47 | |
bc9fb3a9 BP |
48 | /* Name for the currently running thread or process, for log messages, process |
49 | * listings, and debuggers. */ | |
50 | DEFINE_PER_THREAD_MALLOCED_DATA(char *, subprogram_name); | |
781dee08 BP |
51 | |
52 | /* --version option output. */ | |
55d5bb44 | 53 | static char *program_version; |
064af421 | 54 | |
315ea327 | 55 | /* Buffer used by ovs_strerror() and ovs_format_message(). */ |
2ba4f163 BP |
56 | DEFINE_STATIC_PER_THREAD_DATA(struct { char s[128]; }, |
57 | strerror_buffer, | |
58 | { "" }); | |
5fcbed74 | 59 | |
ac01d085 GS |
60 | static char *xreadlink(const char *filename); |
61 | ||
4749f73d BP |
62 | void |
63 | ovs_assert_failure(const char *where, const char *function, | |
64 | const char *condition) | |
65 | { | |
66 | /* Prevent an infinite loop (or stack overflow) in case VLOG_ABORT happens | |
67 | * to trigger an assertion failure of its own. */ | |
68 | static int reentry = 0; | |
69 | ||
70 | switch (reentry++) { | |
71 | case 0: | |
72 | VLOG_ABORT("%s: assertion %s failed in %s()", | |
73 | where, condition, function); | |
428b2edd | 74 | OVS_NOT_REACHED(); |
4749f73d BP |
75 | |
76 | case 1: | |
77 | fprintf(stderr, "%s: assertion %s failed in %s()", | |
78 | where, condition, function); | |
79 | abort(); | |
80 | ||
81 | default: | |
82 | abort(); | |
83 | } | |
84 | } | |
85 | ||
064af421 | 86 | void |
d295e8e9 | 87 | out_of_memory(void) |
064af421 | 88 | { |
c1c8308a | 89 | ovs_abort(0, "virtual memory exhausted"); |
064af421 BP |
90 | } |
91 | ||
92 | void * | |
d295e8e9 | 93 | xcalloc(size_t count, size_t size) |
064af421 BP |
94 | { |
95 | void *p = count && size ? calloc(count, size) : malloc(1); | |
96 | COVERAGE_INC(util_xalloc); | |
97 | if (p == NULL) { | |
98 | out_of_memory(); | |
99 | } | |
100 | return p; | |
101 | } | |
102 | ||
ec6fde61 BP |
103 | void * |
104 | xzalloc(size_t size) | |
105 | { | |
106 | return xcalloc(1, size); | |
107 | } | |
108 | ||
064af421 | 109 | void * |
d295e8e9 | 110 | xmalloc(size_t size) |
064af421 BP |
111 | { |
112 | void *p = malloc(size ? size : 1); | |
113 | COVERAGE_INC(util_xalloc); | |
114 | if (p == NULL) { | |
115 | out_of_memory(); | |
116 | } | |
117 | return p; | |
118 | } | |
119 | ||
120 | void * | |
d295e8e9 | 121 | xrealloc(void *p, size_t size) |
064af421 BP |
122 | { |
123 | p = realloc(p, size ? size : 1); | |
124 | COVERAGE_INC(util_xalloc); | |
125 | if (p == NULL) { | |
126 | out_of_memory(); | |
127 | } | |
128 | return p; | |
129 | } | |
130 | ||
131 | void * | |
132 | xmemdup(const void *p_, size_t size) | |
133 | { | |
134 | void *p = xmalloc(size); | |
135 | memcpy(p, p_, size); | |
136 | return p; | |
137 | } | |
138 | ||
139 | char * | |
140 | xmemdup0(const char *p_, size_t length) | |
141 | { | |
142 | char *p = xmalloc(length + 1); | |
143 | memcpy(p, p_, length); | |
144 | p[length] = '\0'; | |
145 | return p; | |
146 | } | |
147 | ||
148 | char * | |
d295e8e9 | 149 | xstrdup(const char *s) |
064af421 BP |
150 | { |
151 | return xmemdup0(s, strlen(s)); | |
152 | } | |
153 | ||
2225c0b9 BP |
154 | char * MALLOC_LIKE |
155 | nullable_xstrdup(const char *s) | |
156 | { | |
157 | return s ? xstrdup(s) : NULL; | |
158 | } | |
159 | ||
aacf18c3 IM |
160 | bool |
161 | nullable_string_is_equal(const char *a, const char *b) | |
162 | { | |
163 | return a ? b && !strcmp(a, b) : !b; | |
164 | } | |
165 | ||
064af421 BP |
166 | char * |
167 | xvasprintf(const char *format, va_list args) | |
168 | { | |
169 | va_list args2; | |
170 | size_t needed; | |
171 | char *s; | |
172 | ||
173 | va_copy(args2, args); | |
174 | needed = vsnprintf(NULL, 0, format, args); | |
175 | ||
176 | s = xmalloc(needed + 1); | |
177 | ||
178 | vsnprintf(s, needed + 1, format, args2); | |
179 | va_end(args2); | |
180 | ||
181 | return s; | |
182 | } | |
183 | ||
184 | void * | |
185 | x2nrealloc(void *p, size_t *n, size_t s) | |
186 | { | |
187 | *n = *n == 0 ? 1 : 2 * *n; | |
188 | return xrealloc(p, *n * s); | |
189 | } | |
190 | ||
2fec66db BP |
191 | /* The desired minimum alignment for an allocated block of memory. */ |
192 | #define MEM_ALIGN MAX(sizeof(void *), 8) | |
193 | BUILD_ASSERT_DECL(IS_POW2(MEM_ALIGN)); | |
194 | BUILD_ASSERT_DECL(CACHE_LINE_SIZE >= MEM_ALIGN); | |
195 | ||
196 | /* Allocates and returns 'size' bytes of memory in dedicated cache lines. That | |
197 | * is, the memory block returned will not share a cache line with other data, | |
198 | * avoiding "false sharing". (The memory returned will not be at the start of | |
199 | * a cache line, though, so don't assume such alignment.) | |
200 | * | |
201 | * Use free_cacheline() to free the returned memory block. */ | |
202 | void * | |
203 | xmalloc_cacheline(size_t size) | |
204 | { | |
3dc62a6c YT |
205 | #ifdef HAVE_POSIX_MEMALIGN |
206 | void *p; | |
207 | int error; | |
208 | ||
209 | COVERAGE_INC(util_xalloc); | |
210 | error = posix_memalign(&p, CACHE_LINE_SIZE, size ? size : 1); | |
211 | if (error != 0) { | |
212 | out_of_memory(); | |
213 | } | |
214 | return p; | |
215 | #else | |
2fec66db BP |
216 | void **payload; |
217 | void *base; | |
218 | ||
219 | /* Allocate room for: | |
220 | * | |
221 | * - Up to CACHE_LINE_SIZE - 1 bytes before the payload, so that the | |
222 | * start of the payload doesn't potentially share a cache line. | |
223 | * | |
224 | * - A payload consisting of a void *, followed by padding out to | |
225 | * MEM_ALIGN bytes, followed by 'size' bytes of user data. | |
226 | * | |
227 | * - Space following the payload up to the end of the cache line, so | |
228 | * that the end of the payload doesn't potentially share a cache line | |
229 | * with some following block. */ | |
230 | base = xmalloc((CACHE_LINE_SIZE - 1) | |
231 | + ROUND_UP(MEM_ALIGN + size, CACHE_LINE_SIZE)); | |
232 | ||
233 | /* Locate the payload and store a pointer to the base at the beginning. */ | |
234 | payload = (void **) ROUND_UP((uintptr_t) base, CACHE_LINE_SIZE); | |
235 | *payload = base; | |
236 | ||
237 | return (char *) payload + MEM_ALIGN; | |
3dc62a6c | 238 | #endif |
2fec66db BP |
239 | } |
240 | ||
241 | /* Like xmalloc_cacheline() but clears the allocated memory to all zero | |
242 | * bytes. */ | |
243 | void * | |
244 | xzalloc_cacheline(size_t size) | |
245 | { | |
246 | void *p = xmalloc_cacheline(size); | |
247 | memset(p, 0, size); | |
248 | return p; | |
249 | } | |
250 | ||
251 | /* Frees a memory block allocated with xmalloc_cacheline() or | |
252 | * xzalloc_cacheline(). */ | |
253 | void | |
254 | free_cacheline(void *p) | |
255 | { | |
3dc62a6c YT |
256 | #ifdef HAVE_POSIX_MEMALIGN |
257 | free(p); | |
258 | #else | |
2fec66db BP |
259 | if (p) { |
260 | free(*(void **) ((uintptr_t) p - MEM_ALIGN)); | |
261 | } | |
3dc62a6c | 262 | #endif |
2fec66db BP |
263 | } |
264 | ||
064af421 BP |
265 | char * |
266 | xasprintf(const char *format, ...) | |
267 | { | |
268 | va_list args; | |
269 | char *s; | |
270 | ||
271 | va_start(args, format); | |
272 | s = xvasprintf(format, args); | |
273 | va_end(args); | |
274 | ||
275 | return s; | |
276 | } | |
277 | ||
e868fb3d BP |
278 | /* Similar to strlcpy() from OpenBSD, but it never reads more than 'size - 1' |
279 | * bytes from 'src' and doesn't return anything. */ | |
064af421 BP |
280 | void |
281 | ovs_strlcpy(char *dst, const char *src, size_t size) | |
282 | { | |
283 | if (size > 0) { | |
e868fb3d BP |
284 | size_t len = strnlen(src, size - 1); |
285 | memcpy(dst, src, len); | |
286 | dst[len] = '\0'; | |
064af421 BP |
287 | } |
288 | } | |
289 | ||
71d7c22f BP |
290 | /* Copies 'src' to 'dst'. Reads no more than 'size - 1' bytes from 'src'. |
291 | * Always null-terminates 'dst' (if 'size' is nonzero), and writes a zero byte | |
292 | * to every otherwise unused byte in 'dst'. | |
293 | * | |
294 | * Except for performance, the following call: | |
295 | * ovs_strzcpy(dst, src, size); | |
296 | * is equivalent to these two calls: | |
297 | * memset(dst, '\0', size); | |
298 | * ovs_strlcpy(dst, src, size); | |
299 | * | |
300 | * (Thus, ovs_strzcpy() is similar to strncpy() without some of the pitfalls.) | |
301 | */ | |
302 | void | |
303 | ovs_strzcpy(char *dst, const char *src, size_t size) | |
304 | { | |
305 | if (size > 0) { | |
306 | size_t len = strnlen(src, size - 1); | |
307 | memcpy(dst, src, len); | |
308 | memset(dst + len, '\0', size - len); | |
309 | } | |
310 | } | |
311 | ||
c1c8308a BP |
312 | /* Prints 'format' on stderr, formatting it like printf() does. If 'err_no' is |
313 | * nonzero, then it is formatted with ovs_retval_to_string() and appended to | |
314 | * the message inside parentheses. Then, terminates with abort(). | |
315 | * | |
316 | * This function is preferred to ovs_fatal() in a situation where it would make | |
317 | * sense for a monitoring process to restart the daemon. | |
318 | * | |
319 | * 'format' should not end with a new-line, because this function will add one | |
320 | * itself. */ | |
321 | void | |
322 | ovs_abort(int err_no, const char *format, ...) | |
323 | { | |
324 | va_list args; | |
325 | ||
326 | va_start(args, format); | |
d41d4b71 BP |
327 | ovs_abort_valist(err_no, format, args); |
328 | } | |
c1c8308a | 329 | |
d41d4b71 BP |
330 | /* Same as ovs_abort() except that the arguments are supplied as a va_list. */ |
331 | void | |
332 | ovs_abort_valist(int err_no, const char *format, va_list args) | |
333 | { | |
334 | ovs_error_valist(err_no, format, args); | |
c1c8308a BP |
335 | abort(); |
336 | } | |
337 | ||
338 | /* Prints 'format' on stderr, formatting it like printf() does. If 'err_no' is | |
339 | * nonzero, then it is formatted with ovs_retval_to_string() and appended to | |
340 | * the message inside parentheses. Then, terminates with EXIT_FAILURE. | |
341 | * | |
342 | * 'format' should not end with a new-line, because this function will add one | |
343 | * itself. */ | |
064af421 BP |
344 | void |
345 | ovs_fatal(int err_no, const char *format, ...) | |
346 | { | |
347 | va_list args; | |
348 | ||
064af421 | 349 | va_start(args, format); |
fcaddd4d BP |
350 | ovs_fatal_valist(err_no, format, args); |
351 | } | |
064af421 | 352 | |
fcaddd4d BP |
353 | /* Same as ovs_fatal() except that the arguments are supplied as a va_list. */ |
354 | void | |
355 | ovs_fatal_valist(int err_no, const char *format, va_list args) | |
356 | { | |
357 | ovs_error_valist(err_no, format, args); | |
064af421 BP |
358 | exit(EXIT_FAILURE); |
359 | } | |
360 | ||
c1c8308a BP |
361 | /* Prints 'format' on stderr, formatting it like printf() does. If 'err_no' is |
362 | * nonzero, then it is formatted with ovs_retval_to_string() and appended to | |
363 | * the message inside parentheses. | |
364 | * | |
365 | * 'format' should not end with a new-line, because this function will add one | |
366 | * itself. */ | |
064af421 BP |
367 | void |
368 | ovs_error(int err_no, const char *format, ...) | |
369 | { | |
064af421 BP |
370 | va_list args; |
371 | ||
064af421 | 372 | va_start(args, format); |
c1c8308a | 373 | ovs_error_valist(err_no, format, args); |
064af421 | 374 | va_end(args); |
c1c8308a BP |
375 | } |
376 | ||
377 | /* Same as ovs_error() except that the arguments are supplied as a va_list. */ | |
378 | void | |
379 | ovs_error_valist(int err_no, const char *format, va_list args) | |
380 | { | |
bc9fb3a9 | 381 | const char *subprogram_name = get_subprogram_name(); |
c1c8308a BP |
382 | int save_errno = errno; |
383 | ||
781dee08 BP |
384 | if (subprogram_name[0]) { |
385 | fprintf(stderr, "%s(%s): ", program_name, subprogram_name); | |
386 | } else { | |
387 | fprintf(stderr, "%s: ", program_name); | |
388 | } | |
389 | ||
c1c8308a | 390 | vfprintf(stderr, format, args); |
0fec26b0 | 391 | if (err_no != 0) { |
c18ea70d | 392 | fprintf(stderr, " (%s)", ovs_retval_to_string(err_no)); |
0fec26b0 | 393 | } |
064af421 BP |
394 | putc('\n', stderr); |
395 | ||
396 | errno = save_errno; | |
397 | } | |
398 | ||
c18ea70d AE |
399 | /* Many OVS functions return an int which is one of: |
400 | * - 0: no error yet | |
401 | * - >0: errno value | |
402 | * - EOF: end of file (not necessarily an error; depends on the function called) | |
403 | * | |
404 | * Returns the appropriate human-readable string. The caller must copy the | |
405 | * string if it wants to hold onto it, as the storage may be overwritten on | |
406 | * subsequent function calls. | |
407 | */ | |
408 | const char * | |
409 | ovs_retval_to_string(int retval) | |
410 | { | |
5fcbed74 BP |
411 | return (!retval ? "" |
412 | : retval == EOF ? "End of file" | |
413 | : ovs_strerror(retval)); | |
414 | } | |
c18ea70d | 415 | |
b26f46a4 GS |
416 | /* This function returns the string describing the error number in 'error' |
417 | * for POSIX platforms. For Windows, this function can be used for C library | |
418 | * calls. For socket calls that are also used in Windows, use sock_strerror() | |
419 | * instead. For WINAPI calls, look at ovs_lasterror_to_string(). */ | |
5fcbed74 BP |
420 | const char * |
421 | ovs_strerror(int error) | |
422 | { | |
423 | enum { BUFSIZE = sizeof strerror_buffer_get()->s }; | |
424 | int save_errno; | |
425 | char *buffer; | |
426 | char *s; | |
427 | ||
11b7f938 YT |
428 | if (error == 0) { |
429 | /* | |
430 | * strerror(0) varies among platforms: | |
431 | * | |
432 | * Success | |
433 | * No error | |
434 | * Undefined error: 0 | |
435 | * | |
436 | * We want to provide a consistent result here because | |
437 | * our testsuite has test cases which strictly matches | |
438 | * log messages containing this string. | |
439 | */ | |
440 | return "Success"; | |
441 | } | |
442 | ||
5fcbed74 BP |
443 | save_errno = errno; |
444 | buffer = strerror_buffer_get()->s; | |
445 | ||
446 | #if STRERROR_R_CHAR_P | |
447 | /* GNU style strerror_r() might return an immutable static string, or it | |
448 | * might write and return 'buffer', but in either case we can pass the | |
449 | * returned string directly to the caller. */ | |
450 | s = strerror_r(error, buffer, BUFSIZE); | |
451 | #else /* strerror_r() returns an int. */ | |
452 | s = buffer; | |
453 | if (strerror_r(error, buffer, BUFSIZE)) { | |
454 | /* strerror_r() is only allowed to fail on ERANGE (because the buffer | |
455 | * is too short). We don't check the actual failure reason because | |
456 | * POSIX requires strerror_r() to return the error but old glibc | |
457 | * (before 2.13) returns -1 and sets errno. */ | |
5865a8af | 458 | snprintf(buffer, BUFSIZE, "Unknown error %d", error); |
c18ea70d | 459 | } |
5fcbed74 BP |
460 | #endif |
461 | ||
462 | errno = save_errno; | |
463 | ||
464 | return s; | |
c18ea70d AE |
465 | } |
466 | ||
55d5bb44 JP |
467 | /* Sets global "program_name" and "program_version" variables. Should |
468 | * be called at the beginning of main() with "argv[0]" as the argument | |
469 | * to 'argv0'. | |
470 | * | |
e385ef55 EJ |
471 | * 'version' should contain the version of the caller's program. If 'version' |
472 | * is the same as the VERSION #define, the caller is assumed to be part of Open | |
473 | * vSwitch. Otherwise, it is assumed to be an external program linking against | |
474 | * the Open vSwitch libraries. | |
475 | * | |
55d5bb44 JP |
476 | */ |
477 | void | |
fa54d373 | 478 | ovs_set_program_name(const char *argv0, const char *version) |
064af421 | 479 | { |
ed596d3a | 480 | char *basename; |
91e12f0d | 481 | #ifdef _WIN32 |
ed596d3a | 482 | size_t max_len = strlen(argv0) + 1; |
fda546bd | 483 | |
144ccc02 | 484 | SetErrorMode(GetErrorMode() | SEM_NOGPFAULTERRORBOX); |
c9f80f7f | 485 | _set_output_format(_TWO_DIGIT_EXPONENT); |
144ccc02 | 486 | |
ed596d3a GS |
487 | basename = xmalloc(max_len); |
488 | _splitpath_s(argv0, NULL, 0, NULL, 0, basename, max_len, NULL, 0); | |
ed596d3a | 489 | #else |
064af421 | 490 | const char *slash = strrchr(argv0, '/'); |
91e12f0d | 491 | basename = xstrdup(slash ? slash + 1 : argv0); |
ed596d3a | 492 | #endif |
55d5bb44 | 493 | |
91e12f0d AA |
494 | assert_single_threaded(); |
495 | free(program_name); | |
7f2f24e3 SM |
496 | /* Remove libtool prefix, if it is there */ |
497 | if (strncmp(basename, "lt-", 3) == 0) { | |
498 | char *tmp_name = basename; | |
499 | basename = xstrdup(basename + 3); | |
500 | free(tmp_name); | |
501 | } | |
91e12f0d | 502 | program_name = basename; |
e385ef55 | 503 | |
7f2f24e3 | 504 | free(program_version); |
e385ef55 | 505 | if (!strcmp(version, VERSION)) { |
fa54d373 MC |
506 | program_version = xasprintf("%s (Open vSwitch) "VERSION"\n", |
507 | program_name); | |
e385ef55 EJ |
508 | } else { |
509 | program_version = xasprintf("%s %s\n" | |
fa54d373 MC |
510 | "Open vSwitch Library "VERSION"\n", |
511 | program_name, version); | |
e385ef55 | 512 | } |
55d5bb44 JP |
513 | } |
514 | ||
bc9fb3a9 BP |
515 | /* Returns the name of the currently running thread or process. */ |
516 | const char * | |
517 | get_subprogram_name(void) | |
518 | { | |
519 | const char *name = subprogram_name_get(); | |
520 | return name ? name : ""; | |
521 | } | |
522 | ||
40e7cf56 BP |
523 | /* Sets 'subprogram_name' as the name of the currently running thread or |
524 | * process. (This appears in log messages and may also be visible in system | |
525 | * process listings and debuggers.) */ | |
bc9fb3a9 | 526 | void |
40e7cf56 | 527 | set_subprogram_name(const char *subprogram_name) |
bc9fb3a9 | 528 | { |
40e7cf56 | 529 | char *pname = xstrdup(subprogram_name ? subprogram_name : program_name); |
d710edc4 BP |
530 | free(subprogram_name_set(pname)); |
531 | ||
8a8cd0ac | 532 | #if HAVE_GLIBC_PTHREAD_SETNAME_NP |
e584f6a8 | 533 | pthread_setname_np(pthread_self(), pname); |
8a8cd0ac | 534 | #elif HAVE_NETBSD_PTHREAD_SETNAME_NP |
e584f6a8 | 535 | pthread_setname_np(pthread_self(), "%s", pname); |
0f13e650 | 536 | #elif HAVE_PTHREAD_SET_NAME_NP |
e584f6a8 | 537 | pthread_set_name_np(pthread_self(), pname); |
0f13e650 | 538 | #endif |
bc9fb3a9 BP |
539 | } |
540 | ||
55d5bb44 JP |
541 | /* Returns a pointer to a string describing the program version. The |
542 | * caller must not modify or free the returned string. | |
b53055f4 | 543 | */ |
55d5bb44 | 544 | const char * |
b0248b2a | 545 | ovs_get_program_version(void) |
55d5bb44 JP |
546 | { |
547 | return program_version; | |
064af421 BP |
548 | } |
549 | ||
b0248b2a TG |
550 | /* Returns a pointer to a string describing the program name. The |
551 | * caller must not modify or free the returned string. | |
552 | */ | |
553 | const char * | |
554 | ovs_get_program_name(void) | |
555 | { | |
556 | return program_name; | |
557 | } | |
558 | ||
064af421 BP |
559 | /* Print the version information for the program. */ |
560 | void | |
55d5bb44 | 561 | ovs_print_version(uint8_t min_ofp, uint8_t max_ofp) |
064af421 | 562 | { |
55d5bb44 | 563 | printf("%s", program_version); |
064af421 BP |
564 | if (min_ofp || max_ofp) { |
565 | printf("OpenFlow versions %#x:%#x\n", min_ofp, max_ofp); | |
566 | } | |
567 | } | |
568 | ||
569 | /* Writes the 'size' bytes in 'buf' to 'stream' as hex bytes arranged 16 per | |
570 | * line. Numeric offsets are also included, starting at 'ofs' for the first | |
571 | * byte in 'buf'. If 'ascii' is true then the corresponding ASCII characters | |
572 | * are also rendered alongside. */ | |
573 | void | |
574 | ovs_hex_dump(FILE *stream, const void *buf_, size_t size, | |
575 | uintptr_t ofs, bool ascii) | |
576 | { | |
577 | const uint8_t *buf = buf_; | |
578 | const size_t per_line = 16; /* Maximum bytes per line. */ | |
579 | ||
580 | while (size > 0) | |
581 | { | |
582 | size_t start, end, n; | |
583 | size_t i; | |
584 | ||
585 | /* Number of bytes on this line. */ | |
586 | start = ofs % per_line; | |
587 | end = per_line; | |
588 | if (end - start > size) | |
589 | end = start + size; | |
590 | n = end - start; | |
591 | ||
592 | /* Print line. */ | |
34582733 | 593 | fprintf(stream, "%08"PRIxMAX" ", (uintmax_t) ROUND_DOWN(ofs, per_line)); |
064af421 BP |
594 | for (i = 0; i < start; i++) |
595 | fprintf(stream, " "); | |
596 | for (; i < end; i++) | |
34582733 | 597 | fprintf(stream, "%02x%c", |
064af421 BP |
598 | buf[i - start], i == per_line / 2 - 1? '-' : ' '); |
599 | if (ascii) | |
600 | { | |
601 | for (; i < per_line; i++) | |
602 | fprintf(stream, " "); | |
603 | fprintf(stream, "|"); | |
604 | for (i = 0; i < start; i++) | |
605 | fprintf(stream, " "); | |
606 | for (; i < end; i++) { | |
607 | int c = buf[i - start]; | |
608 | putc(c >= 32 && c < 127 ? c : '.', stream); | |
609 | } | |
610 | for (; i < per_line; i++) | |
611 | fprintf(stream, " "); | |
612 | fprintf(stream, "|"); | |
613 | } | |
614 | fprintf(stream, "\n"); | |
615 | ||
616 | ofs += n; | |
617 | buf += n; | |
618 | size -= n; | |
619 | } | |
620 | } | |
621 | ||
622 | bool | |
623 | str_to_int(const char *s, int base, int *i) | |
624 | { | |
625 | long long ll; | |
626 | bool ok = str_to_llong(s, base, &ll); | |
627 | *i = ll; | |
628 | return ok; | |
629 | } | |
630 | ||
631 | bool | |
632 | str_to_long(const char *s, int base, long *li) | |
633 | { | |
634 | long long ll; | |
635 | bool ok = str_to_llong(s, base, &ll); | |
636 | *li = ll; | |
637 | return ok; | |
638 | } | |
639 | ||
640 | bool | |
641 | str_to_llong(const char *s, int base, long long *x) | |
642 | { | |
643 | int save_errno = errno; | |
644 | char *tail; | |
645 | errno = 0; | |
646 | *x = strtoll(s, &tail, base); | |
647 | if (errno == EINVAL || errno == ERANGE || tail == s || *tail != '\0') { | |
648 | errno = save_errno; | |
649 | *x = 0; | |
650 | return false; | |
651 | } else { | |
652 | errno = save_errno; | |
653 | return true; | |
654 | } | |
655 | } | |
656 | ||
4c21aa06 ZK |
657 | bool |
658 | str_to_uint(const char *s, int base, unsigned int *u) | |
659 | { | |
660 | long long ll; | |
661 | bool ok = str_to_llong(s, base, &ll); | |
662 | if (!ok || ll < 0 || ll > UINT_MAX) { | |
a42023ee AZ |
663 | *u = 0; |
664 | return false; | |
4c21aa06 | 665 | } else { |
a42023ee AZ |
666 | *u = ll; |
667 | return true; | |
4c21aa06 ZK |
668 | } |
669 | } | |
670 | ||
f38b84ea BP |
671 | /* Converts floating-point string 's' into a double. If successful, stores |
672 | * the double in '*d' and returns true; on failure, stores 0 in '*d' and | |
673 | * returns false. | |
674 | * | |
675 | * Underflow (e.g. "1e-9999") is not considered an error, but overflow | |
676 | * (e.g. "1e9999)" is. */ | |
677 | bool | |
678 | str_to_double(const char *s, double *d) | |
679 | { | |
680 | int save_errno = errno; | |
681 | char *tail; | |
682 | errno = 0; | |
683 | *d = strtod(s, &tail); | |
684 | if (errno == EINVAL || (errno == ERANGE && *d != 0) | |
685 | || tail == s || *tail != '\0') { | |
686 | errno = save_errno; | |
687 | *d = 0; | |
688 | return false; | |
689 | } else { | |
690 | errno = save_errno; | |
691 | return true; | |
692 | } | |
693 | } | |
694 | ||
695 | /* Returns the value of 'c' as a hexadecimal digit. */ | |
696 | int | |
697 | hexit_value(int c) | |
698 | { | |
699 | switch (c) { | |
700 | case '0': case '1': case '2': case '3': case '4': | |
701 | case '5': case '6': case '7': case '8': case '9': | |
702 | return c - '0'; | |
703 | ||
704 | case 'a': case 'A': | |
705 | return 0xa; | |
706 | ||
707 | case 'b': case 'B': | |
708 | return 0xb; | |
709 | ||
710 | case 'c': case 'C': | |
711 | return 0xc; | |
712 | ||
713 | case 'd': case 'D': | |
714 | return 0xd; | |
715 | ||
716 | case 'e': case 'E': | |
717 | return 0xe; | |
718 | ||
719 | case 'f': case 'F': | |
720 | return 0xf; | |
f38b84ea | 721 | |
09246b99 BP |
722 | default: |
723 | return -1; | |
724 | } | |
f38b84ea | 725 | } |
29d4af60 | 726 | |
bf971267 | 727 | /* Returns the integer value of the 'n' hexadecimal digits starting at 's', or |
0429d959 BP |
728 | * UINTMAX_MAX if one of those "digits" is not really a hex digit. Sets '*ok' |
729 | * to true if the conversion succeeds or to false if a non-hex digit is | |
730 | * detected. */ | |
731 | uintmax_t | |
bf971267 BP |
732 | hexits_value(const char *s, size_t n, bool *ok) |
733 | { | |
0429d959 | 734 | uintmax_t value; |
bf971267 BP |
735 | size_t i; |
736 | ||
737 | value = 0; | |
738 | for (i = 0; i < n; i++) { | |
739 | int hexit = hexit_value(s[i]); | |
740 | if (hexit < 0) { | |
0429d959 BP |
741 | *ok = false; |
742 | return UINTMAX_MAX; | |
bf971267 BP |
743 | } |
744 | value = (value << 4) + hexit; | |
745 | } | |
0429d959 | 746 | *ok = true; |
bf971267 BP |
747 | return value; |
748 | } | |
749 | ||
e7ae59f9 JG |
750 | /* Parses the string in 's' as an integer in either hex or decimal format and |
751 | * puts the result right justified in the array 'valuep' that is 'field_width' | |
752 | * big. If the string is in hex format, the value may be arbitrarily large; | |
753 | * integers are limited to 64-bit values. (The rationale is that decimal is | |
754 | * likely to represent a number and 64 bits is a reasonable maximum whereas | |
755 | * hex could either be a number or a byte string.) | |
756 | * | |
757 | * On return 'tail' points to the first character in the string that was | |
758 | * not parsed as part of the value. ERANGE is returned if the value is too | |
759 | * large to fit in the given field. */ | |
760 | int | |
761 | parse_int_string(const char *s, uint8_t *valuep, int field_width, char **tail) | |
762 | { | |
763 | unsigned long long int integer; | |
764 | int i; | |
765 | ||
766 | if (!strncmp(s, "0x", 2) || !strncmp(s, "0X", 2)) { | |
767 | uint8_t *hexit_str; | |
768 | int len = 0; | |
769 | int val_idx; | |
770 | int err = 0; | |
771 | ||
772 | s += 2; | |
773 | hexit_str = xmalloc(field_width * 2); | |
774 | ||
775 | for (;;) { | |
776 | uint8_t hexit; | |
777 | bool ok; | |
778 | ||
779 | s += strspn(s, " \t\r\n"); | |
780 | hexit = hexits_value(s, 1, &ok); | |
781 | if (!ok) { | |
782 | *tail = CONST_CAST(char *, s); | |
783 | break; | |
784 | } | |
785 | ||
786 | if (hexit != 0 || len) { | |
787 | if (DIV_ROUND_UP(len + 1, 2) > field_width) { | |
788 | err = ERANGE; | |
789 | goto free; | |
790 | } | |
791 | ||
792 | hexit_str[len] = hexit; | |
793 | len++; | |
794 | } | |
795 | s++; | |
796 | } | |
797 | ||
798 | val_idx = field_width; | |
799 | for (i = len - 1; i >= 0; i -= 2) { | |
800 | val_idx--; | |
801 | valuep[val_idx] = hexit_str[i]; | |
802 | if (i > 0) { | |
803 | valuep[val_idx] += hexit_str[i - 1] << 4; | |
804 | } | |
805 | } | |
806 | ||
807 | memset(valuep, 0, val_idx); | |
808 | ||
809 | free: | |
810 | free(hexit_str); | |
a42023ee | 811 | return err; |
e7ae59f9 JG |
812 | } |
813 | ||
814 | errno = 0; | |
815 | integer = strtoull(s, tail, 0); | |
816 | if (errno) { | |
817 | return errno; | |
818 | } | |
819 | ||
820 | for (i = field_width - 1; i >= 0; i--) { | |
821 | valuep[i] = integer; | |
822 | integer >>= 8; | |
823 | } | |
824 | if (integer) { | |
825 | return ERANGE; | |
826 | } | |
827 | ||
828 | return 0; | |
829 | } | |
830 | ||
daf03c53 BP |
831 | /* Returns the current working directory as a malloc()'d string, or a null |
832 | * pointer if the current working directory cannot be determined. */ | |
833 | char * | |
834 | get_cwd(void) | |
835 | { | |
836 | long int path_max; | |
837 | size_t size; | |
838 | ||
839 | /* Get maximum path length or at least a reasonable estimate. */ | |
661c32dc | 840 | #ifndef _WIN32 |
daf03c53 | 841 | path_max = pathconf(".", _PC_PATH_MAX); |
661c32dc GS |
842 | #else |
843 | path_max = MAX_PATH; | |
844 | #endif | |
daf03c53 BP |
845 | size = (path_max < 0 ? 1024 |
846 | : path_max > 10240 ? 10240 | |
847 | : path_max); | |
848 | ||
849 | /* Get current working directory. */ | |
850 | for (;;) { | |
851 | char *buf = xmalloc(size); | |
852 | if (getcwd(buf, size)) { | |
853 | return xrealloc(buf, strlen(buf) + 1); | |
854 | } else { | |
855 | int error = errno; | |
856 | free(buf); | |
857 | if (error != ERANGE) { | |
10a89ef0 | 858 | VLOG_WARN("getcwd failed (%s)", ovs_strerror(error)); |
daf03c53 BP |
859 | return NULL; |
860 | } | |
861 | size *= 2; | |
862 | } | |
863 | } | |
864 | } | |
865 | ||
e1aff6f9 BP |
866 | static char * |
867 | all_slashes_name(const char *s) | |
868 | { | |
869 | return xstrdup(s[0] == '/' && s[1] == '/' && s[2] != '/' ? "//" | |
870 | : s[0] == '/' ? "/" | |
871 | : "."); | |
872 | } | |
873 | ||
3c1150ce | 874 | #ifndef _WIN32 |
29d4af60 BP |
875 | /* Returns the directory name portion of 'file_name' as a malloc()'d string, |
876 | * similar to the POSIX dirname() function but thread-safe. */ | |
877 | char * | |
878 | dir_name(const char *file_name) | |
879 | { | |
880 | size_t len = strlen(file_name); | |
881 | while (len > 0 && file_name[len - 1] == '/') { | |
882 | len--; | |
883 | } | |
884 | while (len > 0 && file_name[len - 1] != '/') { | |
885 | len--; | |
886 | } | |
887 | while (len > 0 && file_name[len - 1] == '/') { | |
888 | len--; | |
889 | } | |
e1aff6f9 BP |
890 | return len ? xmemdup0(file_name, len) : all_slashes_name(file_name); |
891 | } | |
892 | ||
893 | /* Returns the file name portion of 'file_name' as a malloc()'d string, | |
894 | * similar to the POSIX basename() function but thread-safe. */ | |
895 | char * | |
896 | base_name(const char *file_name) | |
897 | { | |
898 | size_t end, start; | |
899 | ||
900 | end = strlen(file_name); | |
901 | while (end > 0 && file_name[end - 1] == '/') { | |
902 | end--; | |
903 | } | |
904 | ||
905 | if (!end) { | |
906 | return all_slashes_name(file_name); | |
29d4af60 | 907 | } |
e1aff6f9 BP |
908 | |
909 | start = end; | |
910 | while (start > 0 && file_name[start - 1] != '/') { | |
911 | start--; | |
912 | } | |
913 | ||
914 | return xmemdup0(file_name + start, end - start); | |
29d4af60 | 915 | } |
3c1150ce | 916 | #endif /* _WIN32 */ |
18b9283b | 917 | |
daf03c53 BP |
918 | /* If 'file_name' starts with '/', returns a copy of 'file_name'. Otherwise, |
919 | * returns an absolute path to 'file_name' considering it relative to 'dir', | |
920 | * which itself must be absolute. 'dir' may be null or the empty string, in | |
921 | * which case the current working directory is used. | |
922 | * | |
ee8749ca AS |
923 | * Additionally on Windows, if 'file_name' has a ':', returns a copy of |
924 | * 'file_name' | |
925 | * | |
daf03c53 BP |
926 | * Returns a null pointer if 'dir' is null and getcwd() fails. */ |
927 | char * | |
928 | abs_file_name(const char *dir, const char *file_name) | |
929 | { | |
930 | if (file_name[0] == '/') { | |
931 | return xstrdup(file_name); | |
ee8749ca AS |
932 | #ifdef _WIN32 |
933 | } else if (strchr(file_name, ':')) { | |
934 | return xstrdup(file_name); | |
935 | #endif | |
daf03c53 BP |
936 | } else if (dir && dir[0]) { |
937 | char *separator = dir[strlen(dir) - 1] == '/' ? "" : "/"; | |
938 | return xasprintf("%s%s%s", dir, separator, file_name); | |
939 | } else { | |
940 | char *cwd = get_cwd(); | |
941 | if (cwd) { | |
942 | char *abs_name = xasprintf("%s/%s", cwd, file_name); | |
943 | free(cwd); | |
944 | return abs_name; | |
945 | } else { | |
946 | return NULL; | |
947 | } | |
948 | } | |
949 | } | |
950 | ||
fee0c963 BP |
951 | /* Like readlink(), but returns the link name as a null-terminated string in |
952 | * allocated memory that the caller must eventually free (with free()). | |
953 | * Returns NULL on error, in which case errno is set appropriately. */ | |
ac01d085 | 954 | static char * |
fee0c963 BP |
955 | xreadlink(const char *filename) |
956 | { | |
957 | size_t size; | |
958 | ||
959 | for (size = 64; ; size *= 2) { | |
960 | char *buf = xmalloc(size); | |
961 | ssize_t retval = readlink(filename, buf, size); | |
962 | int error = errno; | |
963 | ||
964 | if (retval >= 0 && retval < size) { | |
965 | buf[retval] = '\0'; | |
966 | return buf; | |
967 | } | |
968 | ||
969 | free(buf); | |
970 | if (retval < 0) { | |
971 | errno = error; | |
972 | return NULL; | |
973 | } | |
974 | } | |
975 | } | |
976 | ||
977 | /* Returns a version of 'filename' with symlinks in the final component | |
978 | * dereferenced. This differs from realpath() in that: | |
979 | * | |
980 | * - 'filename' need not exist. | |
981 | * | |
982 | * - If 'filename' does exist as a symlink, its referent need not exist. | |
983 | * | |
984 | * - Only symlinks in the final component of 'filename' are dereferenced. | |
985 | * | |
e9f56e84 GS |
986 | * For Windows platform, this function returns a string that has the same |
987 | * value as the passed string. | |
988 | * | |
fee0c963 BP |
989 | * The caller must eventually free the returned string (with free()). */ |
990 | char * | |
991 | follow_symlinks(const char *filename) | |
992 | { | |
e9f56e84 | 993 | #ifndef _WIN32 |
fee0c963 BP |
994 | struct stat s; |
995 | char *fn; | |
996 | int i; | |
997 | ||
998 | fn = xstrdup(filename); | |
999 | for (i = 0; i < 10; i++) { | |
1000 | char *linkname; | |
1001 | char *next_fn; | |
1002 | ||
1003 | if (lstat(fn, &s) != 0 || !S_ISLNK(s.st_mode)) { | |
1004 | return fn; | |
1005 | } | |
1006 | ||
1007 | linkname = xreadlink(fn); | |
1008 | if (!linkname) { | |
10a89ef0 BP |
1009 | VLOG_WARN("%s: readlink failed (%s)", |
1010 | filename, ovs_strerror(errno)); | |
fee0c963 BP |
1011 | return fn; |
1012 | } | |
1013 | ||
1014 | if (linkname[0] == '/') { | |
1015 | /* Target of symlink is absolute so use it raw. */ | |
1016 | next_fn = linkname; | |
1017 | } else { | |
1018 | /* Target of symlink is relative so add to 'fn''s directory. */ | |
1019 | char *dir = dir_name(fn); | |
1020 | ||
1021 | if (!strcmp(dir, ".")) { | |
1022 | next_fn = linkname; | |
1023 | } else { | |
1024 | char *separator = dir[strlen(dir) - 1] == '/' ? "" : "/"; | |
1025 | next_fn = xasprintf("%s%s%s", dir, separator, linkname); | |
1026 | free(linkname); | |
1027 | } | |
1028 | ||
1029 | free(dir); | |
1030 | } | |
1031 | ||
1032 | free(fn); | |
1033 | fn = next_fn; | |
1034 | } | |
1035 | ||
1036 | VLOG_WARN("%s: too many levels of symlinks", filename); | |
1037 | free(fn); | |
e9f56e84 | 1038 | #endif |
fee0c963 BP |
1039 | return xstrdup(filename); |
1040 | } | |
daf03c53 | 1041 | |
18b9283b | 1042 | /* Pass a value to this function if it is marked with |
d295e8e9 JP |
1043 | * __attribute__((warn_unused_result)) and you genuinely want to ignore |
1044 | * its return value. (Note that every scalar type can be implicitly | |
18b9283b | 1045 | * converted to bool.) */ |
c69ee87c | 1046 | void ignore(bool x OVS_UNUSED) { } |
44b4d050 BP |
1047 | |
1048 | /* Returns an appropriate delimiter for inserting just before the 0-based item | |
1049 | * 'index' in a list that has 'total' items in it. */ | |
1050 | const char * | |
1051 | english_list_delimiter(size_t index, size_t total) | |
1052 | { | |
1053 | return (index == 0 ? "" | |
1054 | : index < total - 1 ? ", " | |
1055 | : total > 2 ? ", and " | |
1056 | : " and "); | |
1057 | } | |
711e0157 | 1058 | |
0ee140fb | 1059 | /* Returns the number of trailing 0-bits in 'n'. Undefined if 'n' == 0. */ |
25f45143 | 1060 | #if __GNUC__ >= 4 || _MSC_VER |
0ee140fb | 1061 | /* Defined inline in util.h. */ |
aad29cd1 | 1062 | #else |
8c947903 | 1063 | /* Returns the number of trailing 0-bits in 'n'. Undefined if 'n' == 0. */ |
481da12c | 1064 | int |
d43d314e | 1065 | raw_ctz(uint64_t n) |
0ee140fb | 1066 | { |
d43d314e BP |
1067 | uint64_t k; |
1068 | int count = 63; | |
aad29cd1 BP |
1069 | |
1070 | #define CTZ_STEP(X) \ | |
0ee140fb BP |
1071 | k = n << (X); \ |
1072 | if (k) { \ | |
1073 | count -= X; \ | |
1074 | n = k; \ | |
1075 | } | |
d43d314e | 1076 | CTZ_STEP(32); |
0ee140fb BP |
1077 | CTZ_STEP(16); |
1078 | CTZ_STEP(8); | |
1079 | CTZ_STEP(4); | |
1080 | CTZ_STEP(2); | |
1081 | CTZ_STEP(1); | |
aad29cd1 BP |
1082 | #undef CTZ_STEP |
1083 | ||
0ee140fb | 1084 | return count; |
aad29cd1 | 1085 | } |
8c947903 JR |
1086 | |
1087 | /* Returns the number of leading 0-bits in 'n'. Undefined if 'n' == 0. */ | |
1088 | int | |
1089 | raw_clz64(uint64_t n) | |
1090 | { | |
1091 | uint64_t k; | |
1092 | int count = 63; | |
1093 | ||
1094 | #define CLZ_STEP(X) \ | |
1095 | k = n >> (X); \ | |
1096 | if (k) { \ | |
1097 | count -= X; \ | |
1098 | n = k; \ | |
1099 | } | |
1100 | CLZ_STEP(32); | |
1101 | CLZ_STEP(16); | |
1102 | CLZ_STEP(8); | |
1103 | CLZ_STEP(4); | |
1104 | CLZ_STEP(2); | |
1105 | CLZ_STEP(1); | |
1106 | #undef CLZ_STEP | |
1107 | ||
1108 | return count; | |
1109 | } | |
0ee140fb | 1110 | #endif |
75a75043 | 1111 | |
381657b3 | 1112 | #if NEED_COUNT_1BITS_8 |
a656cb77 BP |
1113 | #define INIT1(X) \ |
1114 | ((((X) & (1 << 0)) != 0) + \ | |
1115 | (((X) & (1 << 1)) != 0) + \ | |
1116 | (((X) & (1 << 2)) != 0) + \ | |
1117 | (((X) & (1 << 3)) != 0) + \ | |
1118 | (((X) & (1 << 4)) != 0) + \ | |
1119 | (((X) & (1 << 5)) != 0) + \ | |
1120 | (((X) & (1 << 6)) != 0) + \ | |
1121 | (((X) & (1 << 7)) != 0)) | |
1122 | #define INIT2(X) INIT1(X), INIT1((X) + 1) | |
1123 | #define INIT4(X) INIT2(X), INIT2((X) + 2) | |
1124 | #define INIT8(X) INIT4(X), INIT4((X) + 4) | |
1125 | #define INIT16(X) INIT8(X), INIT8((X) + 8) | |
1126 | #define INIT32(X) INIT16(X), INIT16((X) + 16) | |
1127 | #define INIT64(X) INIT32(X), INIT32((X) + 32) | |
1128 | ||
c3cc4d2d JR |
1129 | const uint8_t count_1bits_8[256] = { |
1130 | INIT64(0), INIT64(64), INIT64(128), INIT64(192) | |
1131 | }; | |
1132 | #endif | |
2a4ca27c | 1133 | |
75a75043 BP |
1134 | /* Returns true if the 'n' bytes starting at 'p' are zeros. */ |
1135 | bool | |
53cb9c3e | 1136 | is_all_zeros(const void *p_, size_t n) |
75a75043 | 1137 | { |
53cb9c3e | 1138 | const uint8_t *p = p_; |
75a75043 BP |
1139 | size_t i; |
1140 | ||
1141 | for (i = 0; i < n; i++) { | |
1142 | if (p[i] != 0x00) { | |
1143 | return false; | |
1144 | } | |
1145 | } | |
1146 | return true; | |
1147 | } | |
1148 | ||
1149 | /* Returns true if the 'n' bytes starting at 'p' are 0xff. */ | |
1150 | bool | |
53cb9c3e | 1151 | is_all_ones(const void *p_, size_t n) |
75a75043 | 1152 | { |
53cb9c3e | 1153 | const uint8_t *p = p_; |
75a75043 BP |
1154 | size_t i; |
1155 | ||
1156 | for (i = 0; i < n; i++) { | |
1157 | if (p[i] != 0xff) { | |
1158 | return false; | |
1159 | } | |
1160 | } | |
1161 | return true; | |
1162 | } | |
1163 | ||
ddc4f8e2 BP |
1164 | /* Copies 'n_bits' bits starting from bit 'src_ofs' in 'src' to the 'n_bits' |
1165 | * starting from bit 'dst_ofs' in 'dst'. 'src' is 'src_len' bytes long and | |
1166 | * 'dst' is 'dst_len' bytes long. | |
1167 | * | |
1168 | * If you consider all of 'src' to be a single unsigned integer in network byte | |
1169 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1170 | * with value 1 in src[src_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1171 | * the bit with value 4, ..., bit 8 is the bit with value 1 in src[src_len - | |
1172 | * 2], and so on. Similarly for 'dst'. | |
1173 | * | |
1174 | * Required invariants: | |
1175 | * src_ofs + n_bits <= src_len * 8 | |
1176 | * dst_ofs + n_bits <= dst_len * 8 | |
1177 | * 'src' and 'dst' must not overlap. | |
1178 | */ | |
1179 | void | |
1180 | bitwise_copy(const void *src_, unsigned int src_len, unsigned int src_ofs, | |
1181 | void *dst_, unsigned int dst_len, unsigned int dst_ofs, | |
1182 | unsigned int n_bits) | |
1183 | { | |
1184 | const uint8_t *src = src_; | |
1185 | uint8_t *dst = dst_; | |
1186 | ||
1187 | src += src_len - (src_ofs / 8 + 1); | |
1188 | src_ofs %= 8; | |
1189 | ||
1190 | dst += dst_len - (dst_ofs / 8 + 1); | |
1191 | dst_ofs %= 8; | |
1192 | ||
1193 | if (src_ofs == 0 && dst_ofs == 0) { | |
1194 | unsigned int n_bytes = n_bits / 8; | |
1195 | if (n_bytes) { | |
1196 | dst -= n_bytes - 1; | |
1197 | src -= n_bytes - 1; | |
1198 | memcpy(dst, src, n_bytes); | |
1199 | ||
1200 | n_bits %= 8; | |
1201 | src--; | |
1202 | dst--; | |
1203 | } | |
1204 | if (n_bits) { | |
1205 | uint8_t mask = (1 << n_bits) - 1; | |
1206 | *dst = (*dst & ~mask) | (*src & mask); | |
1207 | } | |
1208 | } else { | |
1209 | while (n_bits > 0) { | |
1210 | unsigned int max_copy = 8 - MAX(src_ofs, dst_ofs); | |
1211 | unsigned int chunk = MIN(n_bits, max_copy); | |
1212 | uint8_t mask = ((1 << chunk) - 1) << dst_ofs; | |
1213 | ||
1214 | *dst &= ~mask; | |
1215 | *dst |= ((*src >> src_ofs) << dst_ofs) & mask; | |
1216 | ||
1217 | src_ofs += chunk; | |
1218 | if (src_ofs == 8) { | |
1219 | src--; | |
1220 | src_ofs = 0; | |
1221 | } | |
1222 | dst_ofs += chunk; | |
1223 | if (dst_ofs == 8) { | |
1224 | dst--; | |
1225 | dst_ofs = 0; | |
1226 | } | |
1227 | n_bits -= chunk; | |
1228 | } | |
1229 | } | |
1230 | } | |
1231 | ||
6cc7ea5e BP |
1232 | /* Zeros the 'n_bits' bits starting from bit 'dst_ofs' in 'dst'. 'dst' is |
1233 | * 'dst_len' bytes long. | |
1234 | * | |
1235 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1236 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1237 | * with value 1 in dst[dst_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1238 | * the bit with value 4, ..., bit 8 is the bit with value 1 in dst[dst_len - | |
1239 | * 2], and so on. | |
1240 | * | |
1241 | * Required invariant: | |
1242 | * dst_ofs + n_bits <= dst_len * 8 | |
1243 | */ | |
1244 | void | |
1245 | bitwise_zero(void *dst_, unsigned int dst_len, unsigned dst_ofs, | |
1246 | unsigned int n_bits) | |
1247 | { | |
1248 | uint8_t *dst = dst_; | |
1249 | ||
1250 | if (!n_bits) { | |
1251 | return; | |
1252 | } | |
1253 | ||
1254 | dst += dst_len - (dst_ofs / 8 + 1); | |
1255 | dst_ofs %= 8; | |
1256 | ||
1257 | if (dst_ofs) { | |
1258 | unsigned int chunk = MIN(n_bits, 8 - dst_ofs); | |
1259 | ||
1260 | *dst &= ~(((1 << chunk) - 1) << dst_ofs); | |
1261 | ||
1262 | n_bits -= chunk; | |
1263 | if (!n_bits) { | |
1264 | return; | |
1265 | } | |
1266 | ||
1267 | dst--; | |
1268 | } | |
1269 | ||
1270 | while (n_bits >= 8) { | |
1271 | *dst-- = 0; | |
1272 | n_bits -= 8; | |
1273 | } | |
1274 | ||
1275 | if (n_bits) { | |
1276 | *dst &= ~((1 << n_bits) - 1); | |
1277 | } | |
1278 | } | |
1279 | ||
c2dd4932 BP |
1280 | /* Sets to 1 all of the 'n_bits' bits starting from bit 'dst_ofs' in 'dst'. |
1281 | * 'dst' is 'dst_len' bytes long. | |
1282 | * | |
1283 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1284 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1285 | * with value 1 in dst[dst_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1286 | * the bit with value 4, ..., bit 8 is the bit with value 1 in dst[dst_len - | |
1287 | * 2], and so on. | |
1288 | * | |
1289 | * Required invariant: | |
1290 | * dst_ofs + n_bits <= dst_len * 8 | |
1291 | */ | |
1292 | void | |
1293 | bitwise_one(void *dst_, unsigned int dst_len, unsigned dst_ofs, | |
1294 | unsigned int n_bits) | |
1295 | { | |
1296 | uint8_t *dst = dst_; | |
1297 | ||
1298 | if (!n_bits) { | |
1299 | return; | |
1300 | } | |
1301 | ||
1302 | dst += dst_len - (dst_ofs / 8 + 1); | |
1303 | dst_ofs %= 8; | |
1304 | ||
1305 | if (dst_ofs) { | |
1306 | unsigned int chunk = MIN(n_bits, 8 - dst_ofs); | |
1307 | ||
1308 | *dst |= ((1 << chunk) - 1) << dst_ofs; | |
1309 | ||
1310 | n_bits -= chunk; | |
1311 | if (!n_bits) { | |
1312 | return; | |
1313 | } | |
1314 | ||
1315 | dst--; | |
1316 | } | |
1317 | ||
1318 | while (n_bits >= 8) { | |
1319 | *dst-- = 0xff; | |
1320 | n_bits -= 8; | |
1321 | } | |
1322 | ||
1323 | if (n_bits) { | |
1324 | *dst |= (1 << n_bits) - 1; | |
1325 | } | |
1326 | } | |
1327 | ||
79a010aa BP |
1328 | /* Scans the 'n_bits' bits starting from bit 'dst_ofs' in 'dst' for 1-bits. |
1329 | * Returns false if any 1-bits are found, otherwise true. 'dst' is 'dst_len' | |
1330 | * bytes long. | |
1331 | * | |
1332 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1333 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1334 | * with value 1 in dst[dst_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1335 | * the bit with value 4, ..., bit 8 is the bit with value 1 in dst[dst_len - | |
1336 | * 2], and so on. | |
1337 | * | |
1338 | * Required invariant: | |
1339 | * dst_ofs + n_bits <= dst_len * 8 | |
1340 | */ | |
1341 | bool | |
1342 | bitwise_is_all_zeros(const void *p_, unsigned int len, unsigned int ofs, | |
1343 | unsigned int n_bits) | |
1344 | { | |
1345 | const uint8_t *p = p_; | |
1346 | ||
1347 | if (!n_bits) { | |
1348 | return true; | |
1349 | } | |
1350 | ||
1351 | p += len - (ofs / 8 + 1); | |
1352 | ofs %= 8; | |
1353 | ||
1354 | if (ofs) { | |
1355 | unsigned int chunk = MIN(n_bits, 8 - ofs); | |
1356 | ||
1357 | if (*p & (((1 << chunk) - 1) << ofs)) { | |
1358 | return false; | |
1359 | } | |
1360 | ||
1361 | n_bits -= chunk; | |
1362 | if (!n_bits) { | |
1363 | return true; | |
1364 | } | |
1365 | ||
1366 | p--; | |
1367 | } | |
1368 | ||
1369 | while (n_bits >= 8) { | |
1370 | if (*p) { | |
1371 | return false; | |
1372 | } | |
1373 | n_bits -= 8; | |
1374 | p--; | |
1375 | } | |
1376 | ||
1377 | if (n_bits && *p & ((1 << n_bits) - 1)) { | |
1378 | return false; | |
1379 | } | |
1380 | ||
1381 | return true; | |
1382 | } | |
1383 | ||
95a92d5a BP |
1384 | /* Scans the bits in 'p' that have bit offsets 'start' (inclusive) through |
1385 | * 'end' (exclusive) for the first bit with value 'target'. If one is found, | |
1386 | * returns its offset, otherwise 'end'. 'p' is 'len' bytes long. | |
099c06e3 BP |
1387 | * |
1388 | * If you consider all of 'p' to be a single unsigned integer in network byte | |
1389 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1390 | * with value 1 in p[len - 1], bit 1 is the bit with value 2, bit 2 is the bit | |
1391 | * with value 4, ..., bit 8 is the bit with value 1 in p[len - 2], and so on. | |
1392 | * | |
1393 | * Required invariant: | |
1394 | * start <= end | |
1395 | */ | |
1396 | unsigned int | |
95a92d5a | 1397 | bitwise_scan(const void *p, unsigned int len, bool target, unsigned int start, |
099c06e3 BP |
1398 | unsigned int end) |
1399 | { | |
099c06e3 BP |
1400 | unsigned int ofs; |
1401 | ||
1402 | for (ofs = start; ofs < end; ofs++) { | |
95a92d5a | 1403 | if (bitwise_get_bit(p, len, ofs) == target) { |
099c06e3 BP |
1404 | break; |
1405 | } | |
1406 | } | |
1407 | return ofs; | |
1408 | } | |
1409 | ||
95a92d5a BP |
1410 | /* Scans the bits in 'p' that have bit offsets 'start' (inclusive) through |
1411 | * 'end' (exclusive) for the first bit with value 'target', in reverse order. | |
1412 | * If one is found, returns its offset, otherwise 'end'. 'p' is 'len' bytes | |
1413 | * long. | |
1414 | * | |
1415 | * If you consider all of 'p' to be a single unsigned integer in network byte | |
1416 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1417 | * with value 1 in p[len - 1], bit 1 is the bit with value 2, bit 2 is the bit | |
1418 | * with value 4, ..., bit 8 is the bit with value 1 in p[len - 2], and so on. | |
1419 | * | |
1420 | * To scan an entire bit array in reverse order, specify start == len * 8 - 1 | |
1421 | * and end == -1, in which case the return value is nonnegative if successful | |
1422 | * and -1 if no 'target' match is found. | |
1423 | * | |
1424 | * Required invariant: | |
1425 | * start >= end | |
1426 | */ | |
1427 | int | |
1428 | bitwise_rscan(const void *p, unsigned int len, bool target, int start, int end) | |
1429 | { | |
76adea87 HZ |
1430 | const uint8_t *s = p; |
1431 | int start_byte = len - (start / 8 + 1); | |
1432 | int end_byte = len - (end / 8 + 1); | |
1433 | int ofs_byte; | |
95a92d5a | 1434 | int ofs; |
76adea87 | 1435 | uint8_t the_byte; |
95a92d5a | 1436 | |
76adea87 HZ |
1437 | /* Find the target in the start_byte from starting offset */ |
1438 | ofs_byte = start_byte; | |
1439 | the_byte = s[ofs_byte]; | |
1440 | for (ofs = start % 8; ofs >= 0; ofs--) { | |
1441 | if (((the_byte & (1u << ofs)) != 0) == target) { | |
95a92d5a BP |
1442 | break; |
1443 | } | |
1444 | } | |
76adea87 HZ |
1445 | if (ofs < 0) { |
1446 | /* Target not found in start byte, continue searching byte by byte */ | |
1447 | for (ofs_byte = start_byte + 1; ofs_byte <= end_byte; ofs_byte++) { | |
1448 | if ((target && s[ofs_byte]) | |
1449 | || (!target && (s[ofs_byte] != 0xff))) { | |
1450 | break; | |
1451 | } | |
1452 | } | |
1453 | if (ofs_byte > end_byte) { | |
1454 | return end; | |
1455 | } | |
1456 | the_byte = s[ofs_byte]; | |
1457 | /* Target is in the_byte, find it bit by bit */ | |
1458 | for (ofs = 7; ofs >= 0; ofs--) { | |
1459 | if (((the_byte & (1u << ofs)) != 0) == target) { | |
1460 | break; | |
1461 | } | |
1462 | } | |
1463 | } | |
1464 | int ret = (len - ofs_byte) * 8 - (8 - ofs); | |
1465 | if (ret < end) { | |
1466 | return end; | |
1467 | } | |
1468 | return ret; | |
95a92d5a | 1469 | } |
099c06e3 | 1470 | |
ddc4f8e2 BP |
1471 | /* Copies the 'n_bits' low-order bits of 'value' into the 'n_bits' bits |
1472 | * starting at bit 'dst_ofs' in 'dst', which is 'dst_len' bytes long. | |
1473 | * | |
1474 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1475 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1476 | * with value 1 in dst[dst_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1477 | * the bit with value 4, ..., bit 8 is the bit with value 1 in dst[dst_len - | |
1478 | * 2], and so on. | |
1479 | * | |
1480 | * Required invariants: | |
1481 | * dst_ofs + n_bits <= dst_len * 8 | |
1482 | * n_bits <= 64 | |
1483 | */ | |
1484 | void | |
1485 | bitwise_put(uint64_t value, | |
1486 | void *dst, unsigned int dst_len, unsigned int dst_ofs, | |
1487 | unsigned int n_bits) | |
1488 | { | |
1489 | ovs_be64 n_value = htonll(value); | |
1490 | bitwise_copy(&n_value, sizeof n_value, 0, | |
1491 | dst, dst_len, dst_ofs, | |
1492 | n_bits); | |
1493 | } | |
1494 | ||
1495 | /* Returns the value of the 'n_bits' bits starting at bit 'src_ofs' in 'src', | |
1496 | * which is 'src_len' bytes long. | |
1497 | * | |
1498 | * If you consider all of 'src' to be a single unsigned integer in network byte | |
1499 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1500 | * with value 1 in src[src_len - 1], bit 1 is the bit with value 2, bit 2 is | |
1501 | * the bit with value 4, ..., bit 8 is the bit with value 1 in src[src_len - | |
1502 | * 2], and so on. | |
1503 | * | |
1504 | * Required invariants: | |
1505 | * src_ofs + n_bits <= src_len * 8 | |
1506 | * n_bits <= 64 | |
1507 | */ | |
1508 | uint64_t | |
1509 | bitwise_get(const void *src, unsigned int src_len, | |
1510 | unsigned int src_ofs, unsigned int n_bits) | |
1511 | { | |
1512 | ovs_be64 value = htonll(0); | |
1513 | ||
1514 | bitwise_copy(src, src_len, src_ofs, | |
1515 | &value, sizeof value, 0, | |
1516 | n_bits); | |
1517 | return ntohll(value); | |
1518 | } | |
95a92d5a BP |
1519 | |
1520 | /* Returns the value of the bit with offset 'ofs' in 'src', which is 'len' | |
1521 | * bytes long. | |
1522 | * | |
1523 | * If you consider all of 'src' to be a single unsigned integer in network byte | |
1524 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1525 | * with value 1 in src[len - 1], bit 1 is the bit with value 2, bit 2 is the | |
1526 | * bit with value 4, ..., bit 8 is the bit with value 1 in src[len - 2], and so | |
1527 | * on. | |
1528 | * | |
1529 | * Required invariants: | |
1530 | * ofs < len * 8 | |
1531 | */ | |
1532 | bool | |
1533 | bitwise_get_bit(const void *src_, unsigned int len, unsigned int ofs) | |
1534 | { | |
1535 | const uint8_t *src = src_; | |
1536 | ||
1537 | return (src[len - (ofs / 8 + 1)] & (1u << (ofs % 8))) != 0; | |
1538 | } | |
1539 | ||
1540 | /* Sets the bit with offset 'ofs' in 'dst', which is 'len' bytes long, to 0. | |
1541 | * | |
1542 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1543 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1544 | * with value 1 in dst[len - 1], bit 1 is the bit with value 2, bit 2 is the | |
1545 | * bit with value 4, ..., bit 8 is the bit with value 1 in dst[len - 2], and so | |
1546 | * on. | |
1547 | * | |
1548 | * Required invariants: | |
1549 | * ofs < len * 8 | |
1550 | */ | |
1551 | void | |
1552 | bitwise_put0(void *dst_, unsigned int len, unsigned int ofs) | |
1553 | { | |
1554 | uint8_t *dst = dst_; | |
1555 | ||
1556 | dst[len - (ofs / 8 + 1)] &= ~(1u << (ofs % 8)); | |
1557 | } | |
1558 | ||
1559 | /* Sets the bit with offset 'ofs' in 'dst', which is 'len' bytes long, to 1. | |
1560 | * | |
1561 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1562 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1563 | * with value 1 in dst[len - 1], bit 1 is the bit with value 2, bit 2 is the | |
1564 | * bit with value 4, ..., bit 8 is the bit with value 1 in dst[len - 2], and so | |
1565 | * on. | |
1566 | * | |
1567 | * Required invariants: | |
1568 | * ofs < len * 8 | |
1569 | */ | |
1570 | void | |
1571 | bitwise_put1(void *dst_, unsigned int len, unsigned int ofs) | |
1572 | { | |
1573 | uint8_t *dst = dst_; | |
1574 | ||
1575 | dst[len - (ofs / 8 + 1)] |= 1u << (ofs % 8); | |
1576 | } | |
1577 | ||
1578 | /* Sets the bit with offset 'ofs' in 'dst', which is 'len' bytes long, to 'b'. | |
1579 | * | |
1580 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1581 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1582 | * with value 1 in dst[len - 1], bit 1 is the bit with value 2, bit 2 is the | |
1583 | * bit with value 4, ..., bit 8 is the bit with value 1 in dst[len - 2], and so | |
1584 | * on. | |
1585 | * | |
1586 | * Required invariants: | |
1587 | * ofs < len * 8 | |
1588 | */ | |
1589 | void | |
1590 | bitwise_put_bit(void *dst, unsigned int len, unsigned int ofs, bool b) | |
1591 | { | |
1592 | if (b) { | |
1593 | bitwise_put1(dst, len, ofs); | |
1594 | } else { | |
1595 | bitwise_put0(dst, len, ofs); | |
1596 | } | |
1597 | } | |
1598 | ||
1599 | /* Flips the bit with offset 'ofs' in 'dst', which is 'len' bytes long. | |
1600 | * | |
1601 | * If you consider all of 'dst' to be a single unsigned integer in network byte | |
1602 | * order, then bit N is the bit with value 2**N. That is, bit 0 is the bit | |
1603 | * with value 1 in dst[len - 1], bit 1 is the bit with value 2, bit 2 is the | |
1604 | * bit with value 4, ..., bit 8 is the bit with value 1 in dst[len - 2], and so | |
1605 | * on. | |
1606 | * | |
1607 | * Required invariants: | |
1608 | * ofs < len * 8 | |
1609 | */ | |
1610 | void | |
1611 | bitwise_toggle_bit(void *dst_, unsigned int len, unsigned int ofs) | |
1612 | { | |
1613 | uint8_t *dst = dst_; | |
1614 | ||
1615 | dst[len - (ofs / 8 + 1)] ^= 1u << (ofs % 8); | |
1616 | } | |
ed2232fc BP |
1617 | \f |
1618 | /* ovs_scan */ | |
1619 | ||
1620 | struct scan_spec { | |
1621 | unsigned int width; | |
1622 | enum { | |
1623 | SCAN_DISCARD, | |
1624 | SCAN_CHAR, | |
1625 | SCAN_SHORT, | |
1626 | SCAN_INT, | |
1627 | SCAN_LONG, | |
1628 | SCAN_LLONG, | |
1629 | SCAN_INTMAX_T, | |
1630 | SCAN_PTRDIFF_T, | |
1631 | SCAN_SIZE_T | |
1632 | } type; | |
1633 | }; | |
1634 | ||
1635 | static const char * | |
1636 | skip_spaces(const char *s) | |
1637 | { | |
1638 | while (isspace((unsigned char) *s)) { | |
1639 | s++; | |
1640 | } | |
1641 | return s; | |
1642 | } | |
1643 | ||
1644 | static const char * | |
1645 | scan_int(const char *s, const struct scan_spec *spec, int base, va_list *args) | |
1646 | { | |
1647 | const char *start = s; | |
1648 | uintmax_t value; | |
1649 | bool negative; | |
1650 | int n_digits; | |
1651 | ||
1652 | negative = *s == '-'; | |
1653 | s += *s == '-' || *s == '+'; | |
1654 | ||
1655 | if ((!base || base == 16) && *s == '0' && (s[1] == 'x' || s[1] == 'X')) { | |
1656 | base = 16; | |
1657 | s += 2; | |
1658 | } else if (!base) { | |
1659 | base = *s == '0' ? 8 : 10; | |
1660 | } | |
1661 | ||
1662 | if (s - start >= spec->width) { | |
1663 | return NULL; | |
1664 | } | |
1665 | ||
1666 | value = 0; | |
1667 | n_digits = 0; | |
1668 | while (s - start < spec->width) { | |
1669 | int digit = hexit_value(*s); | |
1670 | ||
1671 | if (digit < 0 || digit >= base) { | |
1672 | break; | |
1673 | } | |
1674 | value = value * base + digit; | |
1675 | n_digits++; | |
1676 | s++; | |
1677 | } | |
1678 | if (!n_digits) { | |
1679 | return NULL; | |
1680 | } | |
1681 | ||
1682 | if (negative) { | |
1683 | value = -value; | |
1684 | } | |
1685 | ||
1686 | switch (spec->type) { | |
1687 | case SCAN_DISCARD: | |
1688 | break; | |
1689 | case SCAN_CHAR: | |
1690 | *va_arg(*args, char *) = value; | |
1691 | break; | |
1692 | case SCAN_SHORT: | |
1693 | *va_arg(*args, short int *) = value; | |
1694 | break; | |
1695 | case SCAN_INT: | |
1696 | *va_arg(*args, int *) = value; | |
1697 | break; | |
1698 | case SCAN_LONG: | |
1699 | *va_arg(*args, long int *) = value; | |
1700 | break; | |
1701 | case SCAN_LLONG: | |
1702 | *va_arg(*args, long long int *) = value; | |
1703 | break; | |
1704 | case SCAN_INTMAX_T: | |
1705 | *va_arg(*args, intmax_t *) = value; | |
1706 | break; | |
1707 | case SCAN_PTRDIFF_T: | |
1708 | *va_arg(*args, ptrdiff_t *) = value; | |
1709 | break; | |
1710 | case SCAN_SIZE_T: | |
1711 | *va_arg(*args, size_t *) = value; | |
1712 | break; | |
1713 | } | |
1714 | return s; | |
1715 | } | |
1716 | ||
1717 | static const char * | |
1718 | skip_digits(const char *s) | |
1719 | { | |
1720 | while (*s >= '0' && *s <= '9') { | |
1721 | s++; | |
1722 | } | |
1723 | return s; | |
1724 | } | |
1725 | ||
1726 | static const char * | |
1727 | scan_float(const char *s, const struct scan_spec *spec, va_list *args) | |
1728 | { | |
1729 | const char *start = s; | |
1730 | long double value; | |
1731 | char *tail; | |
1732 | char *copy; | |
1733 | bool ok; | |
1734 | ||
1735 | s += *s == '+' || *s == '-'; | |
1736 | s = skip_digits(s); | |
1737 | if (*s == '.') { | |
1738 | s = skip_digits(s + 1); | |
1739 | } | |
1740 | if (*s == 'e' || *s == 'E') { | |
1741 | s++; | |
1742 | s += *s == '+' || *s == '-'; | |
1743 | s = skip_digits(s); | |
1744 | } | |
1745 | ||
1746 | if (s - start > spec->width) { | |
1747 | s = start + spec->width; | |
1748 | } | |
1749 | ||
1750 | copy = xmemdup0(start, s - start); | |
1751 | value = strtold(copy, &tail); | |
1752 | ok = *tail == '\0'; | |
1753 | free(copy); | |
1754 | if (!ok) { | |
1755 | return NULL; | |
1756 | } | |
1757 | ||
1758 | switch (spec->type) { | |
1759 | case SCAN_DISCARD: | |
1760 | break; | |
1761 | case SCAN_INT: | |
1762 | *va_arg(*args, float *) = value; | |
1763 | break; | |
1764 | case SCAN_LONG: | |
1765 | *va_arg(*args, double *) = value; | |
1766 | break; | |
1767 | case SCAN_LLONG: | |
1768 | *va_arg(*args, long double *) = value; | |
1769 | break; | |
1770 | ||
1771 | case SCAN_CHAR: | |
1772 | case SCAN_SHORT: | |
1773 | case SCAN_INTMAX_T: | |
1774 | case SCAN_PTRDIFF_T: | |
1775 | case SCAN_SIZE_T: | |
428b2edd | 1776 | OVS_NOT_REACHED(); |
ed2232fc BP |
1777 | } |
1778 | return s; | |
1779 | } | |
1780 | ||
1781 | static void | |
1782 | scan_output_string(const struct scan_spec *spec, | |
1783 | const char *s, size_t n, | |
1784 | va_list *args) | |
1785 | { | |
1786 | if (spec->type != SCAN_DISCARD) { | |
1787 | char *out = va_arg(*args, char *); | |
1788 | memcpy(out, s, n); | |
1789 | out[n] = '\0'; | |
1790 | } | |
1791 | } | |
1792 | ||
1793 | static const char * | |
1794 | scan_string(const char *s, const struct scan_spec *spec, va_list *args) | |
1795 | { | |
1796 | size_t n; | |
1797 | ||
1798 | for (n = 0; n < spec->width; n++) { | |
1799 | if (!s[n] || isspace((unsigned char) s[n])) { | |
1800 | break; | |
1801 | } | |
1802 | } | |
1803 | if (!n) { | |
1804 | return NULL; | |
1805 | } | |
1806 | ||
1807 | scan_output_string(spec, s, n, args); | |
1808 | return s + n; | |
1809 | } | |
1810 | ||
1811 | static const char * | |
1812 | parse_scanset(const char *p_, unsigned long *set, bool *complemented) | |
1813 | { | |
1814 | const uint8_t *p = (const uint8_t *) p_; | |
1815 | ||
1816 | *complemented = *p == '^'; | |
1817 | p += *complemented; | |
1818 | ||
1819 | if (*p == ']') { | |
1820 | bitmap_set1(set, ']'); | |
1821 | p++; | |
1822 | } | |
1823 | ||
1824 | while (*p && *p != ']') { | |
1825 | if (p[1] == '-' && p[2] != ']' && p[2] > *p) { | |
1826 | bitmap_set_multiple(set, *p, p[2] - *p + 1, true); | |
1827 | p += 3; | |
1828 | } else { | |
1829 | bitmap_set1(set, *p++); | |
1830 | } | |
1831 | } | |
1832 | if (*p == ']') { | |
1833 | p++; | |
1834 | } | |
1835 | return (const char *) p; | |
1836 | } | |
1837 | ||
1838 | static const char * | |
1839 | scan_set(const char *s, const struct scan_spec *spec, const char **pp, | |
1840 | va_list *args) | |
1841 | { | |
1842 | unsigned long set[BITMAP_N_LONGS(UCHAR_MAX + 1)]; | |
1843 | bool complemented; | |
1844 | unsigned int n; | |
1845 | ||
1846 | /* Parse the scan set. */ | |
1847 | memset(set, 0, sizeof set); | |
1848 | *pp = parse_scanset(*pp, set, &complemented); | |
1849 | ||
1850 | /* Parse the data. */ | |
1851 | n = 0; | |
1852 | while (s[n] | |
1853 | && bitmap_is_set(set, (unsigned char) s[n]) == !complemented | |
1854 | && n < spec->width) { | |
1855 | n++; | |
1856 | } | |
1857 | if (!n) { | |
1858 | return NULL; | |
1859 | } | |
1860 | scan_output_string(spec, s, n, args); | |
1861 | return s + n; | |
1862 | } | |
1863 | ||
1864 | static const char * | |
1865 | scan_chars(const char *s, const struct scan_spec *spec, va_list *args) | |
1866 | { | |
31499678 | 1867 | unsigned int n = spec->width == UINT_MAX ? 1 : spec->width; |
ed2232fc BP |
1868 | |
1869 | if (strlen(s) < n) { | |
1870 | return NULL; | |
1871 | } | |
1872 | if (spec->type != SCAN_DISCARD) { | |
1873 | memcpy(va_arg(*args, char *), s, n); | |
1874 | } | |
1875 | return s + n; | |
1876 | } | |
1877 | ||
f071cbba PS |
1878 | static bool |
1879 | ovs_scan__(const char *s, int *n, const char *format, va_list *args) | |
ed2232fc BP |
1880 | { |
1881 | const char *const start = s; | |
1882 | bool ok = false; | |
1883 | const char *p; | |
ed2232fc | 1884 | |
037821cf | 1885 | p = format; |
ed2232fc BP |
1886 | while (*p != '\0') { |
1887 | struct scan_spec spec; | |
1888 | unsigned char c = *p++; | |
1889 | bool discard; | |
1890 | ||
1891 | if (isspace(c)) { | |
1892 | s = skip_spaces(s); | |
1893 | continue; | |
1894 | } else if (c != '%') { | |
1895 | if (*s != c) { | |
1896 | goto exit; | |
1897 | } | |
1898 | s++; | |
1899 | continue; | |
1900 | } else if (*p == '%') { | |
1901 | if (*s++ != '%') { | |
1902 | goto exit; | |
1903 | } | |
1904 | p++; | |
1905 | continue; | |
1906 | } | |
1907 | ||
1908 | /* Parse '*' flag. */ | |
1909 | discard = *p == '*'; | |
1910 | p += discard; | |
1911 | ||
1912 | /* Parse field width. */ | |
1913 | spec.width = 0; | |
1914 | while (*p >= '0' && *p <= '9') { | |
1915 | spec.width = spec.width * 10 + (*p++ - '0'); | |
1916 | } | |
1917 | if (spec.width == 0) { | |
1918 | spec.width = UINT_MAX; | |
1919 | } | |
1920 | ||
1921 | /* Parse type modifier. */ | |
1922 | switch (*p) { | |
1923 | case 'h': | |
1924 | if (p[1] == 'h') { | |
1925 | spec.type = SCAN_CHAR; | |
1926 | p += 2; | |
1927 | } else { | |
1928 | spec.type = SCAN_SHORT; | |
1929 | p++; | |
1930 | } | |
1931 | break; | |
1932 | ||
1933 | case 'j': | |
1934 | spec.type = SCAN_INTMAX_T; | |
1935 | p++; | |
1936 | break; | |
1937 | ||
1938 | case 'l': | |
1939 | if (p[1] == 'l') { | |
1940 | spec.type = SCAN_LLONG; | |
1941 | p += 2; | |
1942 | } else { | |
1943 | spec.type = SCAN_LONG; | |
1944 | p++; | |
1945 | } | |
1946 | break; | |
1947 | ||
1948 | case 'L': | |
1949 | case 'q': | |
1950 | spec.type = SCAN_LLONG; | |
1951 | p++; | |
1952 | break; | |
1953 | ||
1954 | case 't': | |
1955 | spec.type = SCAN_PTRDIFF_T; | |
1956 | p++; | |
1957 | break; | |
1958 | ||
1959 | case 'z': | |
1960 | spec.type = SCAN_SIZE_T; | |
1961 | p++; | |
1962 | break; | |
1963 | ||
1964 | default: | |
1965 | spec.type = SCAN_INT; | |
1966 | break; | |
1967 | } | |
1968 | ||
1969 | if (discard) { | |
1970 | spec.type = SCAN_DISCARD; | |
1971 | } | |
1972 | ||
1973 | c = *p++; | |
1974 | if (c != 'c' && c != 'n' && c != '[') { | |
1975 | s = skip_spaces(s); | |
1976 | } | |
1977 | switch (c) { | |
1978 | case 'd': | |
f071cbba | 1979 | s = scan_int(s, &spec, 10, args); |
ed2232fc BP |
1980 | break; |
1981 | ||
1982 | case 'i': | |
f071cbba | 1983 | s = scan_int(s, &spec, 0, args); |
ed2232fc BP |
1984 | break; |
1985 | ||
1986 | case 'o': | |
f071cbba | 1987 | s = scan_int(s, &spec, 8, args); |
ed2232fc BP |
1988 | break; |
1989 | ||
1990 | case 'u': | |
f071cbba | 1991 | s = scan_int(s, &spec, 10, args); |
ed2232fc BP |
1992 | break; |
1993 | ||
1994 | case 'x': | |
1995 | case 'X': | |
f071cbba | 1996 | s = scan_int(s, &spec, 16, args); |
ed2232fc BP |
1997 | break; |
1998 | ||
1999 | case 'e': | |
2000 | case 'f': | |
2001 | case 'g': | |
2002 | case 'E': | |
2003 | case 'G': | |
f071cbba | 2004 | s = scan_float(s, &spec, args); |
ed2232fc BP |
2005 | break; |
2006 | ||
2007 | case 's': | |
f071cbba | 2008 | s = scan_string(s, &spec, args); |
ed2232fc BP |
2009 | break; |
2010 | ||
2011 | case '[': | |
f071cbba | 2012 | s = scan_set(s, &spec, &p, args); |
ed2232fc BP |
2013 | break; |
2014 | ||
2015 | case 'c': | |
f071cbba | 2016 | s = scan_chars(s, &spec, args); |
ed2232fc BP |
2017 | break; |
2018 | ||
2019 | case 'n': | |
2020 | if (spec.type != SCAN_DISCARD) { | |
f071cbba | 2021 | *va_arg(*args, int *) = s - start; |
ed2232fc BP |
2022 | } |
2023 | break; | |
2024 | } | |
2025 | ||
2026 | if (!s) { | |
2027 | goto exit; | |
2028 | } | |
2029 | } | |
f071cbba PS |
2030 | if (n) { |
2031 | *n = s - start; | |
2032 | } | |
ed2232fc | 2033 | |
f071cbba | 2034 | ok = true; |
ed2232fc | 2035 | exit: |
ed2232fc BP |
2036 | return ok; |
2037 | } | |
2038 | ||
f071cbba PS |
2039 | /* This is an implementation of the standard sscanf() function, with the |
2040 | * following exceptions: | |
2041 | * | |
2042 | * - It returns true if the entire format was successfully scanned and | |
2043 | * converted, false if any conversion failed. | |
2044 | * | |
2045 | * - The standard doesn't define sscanf() behavior when an out-of-range value | |
2046 | * is scanned, e.g. if a "%"PRIi8 conversion scans "-1" or "0x1ff". Some | |
2047 | * implementations consider this an error and stop scanning. This | |
2048 | * implementation never considers an out-of-range value an error; instead, | |
2049 | * it stores the least-significant bits of the converted value in the | |
2050 | * destination, e.g. the value 255 for both examples earlier. | |
2051 | * | |
2052 | * - Only single-byte characters are supported, that is, the 'l' modifier | |
2053 | * on %s, %[, and %c is not supported. The GNU extension 'a' modifier is | |
2054 | * also not supported. | |
2055 | * | |
2056 | * - %p is not supported. | |
2057 | */ | |
2058 | bool | |
2059 | ovs_scan(const char *s, const char *format, ...) | |
2060 | { | |
2061 | va_list args; | |
2062 | bool res; | |
2063 | ||
2064 | va_start(args, format); | |
2065 | res = ovs_scan__(s, NULL, format, &args); | |
2066 | va_end(args); | |
2067 | return res; | |
2068 | } | |
2069 | ||
2070 | /* | |
938a73da BP |
2071 | * This function is similar to ovs_scan(), with an extra parameter `n` added to |
2072 | * return the number of scanned characters. | |
f071cbba PS |
2073 | */ |
2074 | bool | |
2075 | ovs_scan_len(const char *s, int *n, const char *format, ...) | |
2076 | { | |
2077 | va_list args; | |
2078 | bool success; | |
2079 | int n1; | |
2080 | ||
2081 | va_start(args, format); | |
2082 | success = ovs_scan__(s + *n, &n1, format, &args); | |
2083 | va_end(args); | |
2084 | if (success) { | |
2085 | *n = *n + n1; | |
2086 | } | |
2087 | return success; | |
2088 | } | |
2089 | ||
5fd2f418 | 2090 | void |
275eebb9 PS |
2091 | xsleep(unsigned int seconds) |
2092 | { | |
275eebb9 | 2093 | ovsrcu_quiesce_start(); |
5fd2f418 GS |
2094 | #ifdef _WIN32 |
2095 | Sleep(seconds * 1000); | |
2096 | #else | |
2097 | sleep(seconds); | |
2098 | #endif | |
275eebb9 | 2099 | ovsrcu_quiesce_end(); |
275eebb9 PS |
2100 | } |
2101 | ||
20174b74 QM |
2102 | /* Determine whether standard output is a tty or not. This is useful to decide |
2103 | * whether to use color output or not when --color option for utilities is set | |
2104 | * to `auto`. | |
2105 | */ | |
2106 | bool | |
2107 | is_stdout_a_tty(void) | |
2108 | { | |
2109 | char const *t = getenv("TERM"); | |
2110 | return (isatty(STDOUT_FILENO) && t && strcmp(t, "dumb") != 0); | |
2111 | } | |
2112 | ||
06f14c92 GS |
2113 | #ifdef _WIN32 |
2114 | \f | |
06f14c92 | 2115 | char * |
315ea327 | 2116 | ovs_format_message(int error) |
06f14c92 | 2117 | { |
315ea327 GS |
2118 | enum { BUFSIZE = sizeof strerror_buffer_get()->s }; |
2119 | char *buffer = strerror_buffer_get()->s; | |
2120 | ||
11b7f938 YT |
2121 | if (error == 0) { |
2122 | /* See ovs_strerror */ | |
2123 | return "Success"; | |
2124 | } | |
2125 | ||
315ea327 GS |
2126 | FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, |
2127 | NULL, error, 0, buffer, BUFSIZE, NULL); | |
06f14c92 GS |
2128 | return buffer; |
2129 | } | |
315ea327 GS |
2130 | |
2131 | /* Returns a null-terminated string that explains the last error. | |
2132 | * Use this function to get the error string for WINAPI calls. */ | |
2133 | char * | |
2134 | ovs_lasterror_to_string(void) | |
2135 | { | |
2136 | return ovs_format_message(GetLastError()); | |
2137 | } | |
daa04db8 GS |
2138 | |
2139 | int | |
2140 | ftruncate(int fd, off_t length) | |
2141 | { | |
2142 | int error; | |
2143 | ||
2144 | error = _chsize_s(fd, length); | |
2145 | if (error) { | |
2146 | return -1; | |
2147 | } | |
2148 | return 0; | |
2149 | } | |
64559798 GS |
2150 | |
2151 | OVS_CONSTRUCTOR(winsock_start) { | |
2152 | WSADATA wsaData; | |
2153 | int error; | |
2154 | ||
2155 | error = WSAStartup(MAKEWORD(2, 2), &wsaData); | |
2156 | if (error != 0) { | |
2157 | VLOG_FATAL("WSAStartup failed: %s", sock_strerror(sock_errno())); | |
2158 | } | |
2159 | } | |
06f14c92 | 2160 | #endif |