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
|
/* Copyright (C) 2011 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <config.h>
#include <string.h>
#include <pthread.h>
#include <fcntl.h>
#include <unistd.h>
#include "common.h"
#include "util/utils.h"
#include "common/prng.h"
/*----------------------------------------------------------------------------*/
knot_lookup_table_t *knot_lookup_by_name(knot_lookup_table_t *table,
const char *name)
{
while (table->name != NULL) {
if (strcasecmp(name, table->name) == 0) {
return table;
}
table++;
}
return NULL;
}
/*----------------------------------------------------------------------------*/
knot_lookup_table_t *knot_lookup_by_id(knot_lookup_table_t *table,
int id)
{
while (table->name != NULL) {
if (table->id == id) {
return table;
}
table++;
}
return NULL;
}
/*----------------------------------------------------------------------------*/
size_t knot_strlcpy(char *dst, const char *src, size_t size)
{
char *d = dst;
const char *s = src;
size_t n = size;
/* Copy as many bytes as will fit */
if (n != 0 && --n != 0) {
do {
if ((*d++ = *s++) == 0) {
break;
}
} while (--n != 0);
}
/* Not enough room in dst, add NUL and traverse rest of src */
if (n == 0) {
if (size != 0) {
*d = '\0'; /* NUL-terminate dst */
}
while (*s++)
;
}
return(s - src - 1); /* count does not include NUL */
}
/*! \brief TLS key for rand seed. */
static pthread_key_t _qr_key;
static pthread_once_t _qr_once = PTHREAD_ONCE_INIT;
/*! \brief TLS key initializer. */
static void _qr_init()
{
(void) pthread_key_create(&_qr_key, NULL);
(void) pthread_setspecific(_qr_key, (void*)time(0));
}
size_t knot_quick_rand()
{
(void) pthread_once(&_qr_once, _qr_init);
size_t x = (size_t)pthread_getspecific(_qr_key);
/* Numerical Recipes in C.
* The Art of Scientific Computing, 2nd Edition,
* 1992, ISBN 0-521-43108-5.
* Page 284.
*/
x = 1664525L * x + 1013904223L;
(void) pthread_setspecific(_qr_key, (void*)x);
return x;
}
uint16_t knot_random_id()
{
return (uint16_t)(tls_rand() * ((uint16_t)~0));
}
struct flock* knot_file_lock(short type, short whence)
{
static struct flock ret;
ret.l_type = type;
ret.l_start = 0;
ret.l_whence = whence;
ret.l_len = 0;
ret.l_pid = getpid();
return &ret;
}
|
