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
|
/*
* Utility routines used in rsync.
*
* Copyright (C) 1996-2000 Andrew Tridgell
* Copyright (C) 1996 Paul Mackerras
* Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org>
* Copyright (C) 2003-2020 Wayne Davison
*
* 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, visit the http://fsf.org website.
*/
#include "rsync.h"
#include "itypes.h"
#include "inums.h"
extern size_t max_alloc;
char *do_calloc = "42";
/**
* Sleep for a specified number of milliseconds.
*
* Always returns True.
**/
int msleep(int t)
{
#ifdef HAVE_NANOSLEEP
struct timespec ts;
ts.tv_sec = t / 1000;
ts.tv_nsec = (t % 1000) * 1000000L;
while (nanosleep(&ts, &ts) < 0 && errno == EINTR) {}
#elif defined HAVE_USLEEP
usleep(t*1000);
#else
int tdiff = 0;
struct timeval tval, t1, t2;
gettimeofday(&t1, NULL);
while (tdiff < t) {
tval.tv_sec = (t-tdiff)/1000;
tval.tv_usec = 1000*((t-tdiff)%1000);
errno = 0;
select(0,NULL,NULL, NULL, &tval);
gettimeofday(&t2, NULL);
tdiff = (t2.tv_sec - t1.tv_sec)*1000 +
(t2.tv_usec - t1.tv_usec)/1000;
if (tdiff < 0)
t1 = t2; /* Time went backwards, so start over. */
}
#endif
return True;
}
void *my_alloc(void *ptr, size_t num, size_t size, const char *file, int line)
{
if (max_alloc && num >= max_alloc/size) {
if (!file)
return NULL;
rprintf(FERROR, "[%s] exceeded --max-alloc=%s setting (file=%s, line=%d)\n",
who_am_i(), do_big_num(max_alloc, 0, NULL), src_file(file), line);
exit_cleanup(RERR_MALLOC);
}
if (!ptr)
ptr = malloc(num * size);
else if (ptr == do_calloc)
ptr = calloc(num, size);
else
ptr = realloc(ptr, num * size);
if (!ptr && file)
_out_of_memory("my_alloc caller", file, line);
return ptr;
}
const char *sum_as_hex(int csum_type, const char *sum, int flist_csum)
{
static char buf[MAX_DIGEST_LEN*2+1];
int i, x1, x2;
int canonical = canonical_checksum(csum_type);
int sum_len = csum_len_for_type(csum_type, flist_csum);
char *c;
if (!canonical)
return NULL;
assert(sum_len*2 < (int)sizeof buf);
for (i = sum_len, c = buf; --i >= 0; ) {
int ndx = canonical < 0 ? sum_len - i - 1 : i;
x2 = CVAL(sum, ndx);
x1 = x2 >> 4;
x2 &= 0xF;
*c++ = x1 <= 9 ? x1 + '0' : x1 + 'a' - 10;
*c++ = x2 <= 9 ? x2 + '0' : x2 + 'a' - 10;
}
*c = '\0';
return buf;
}
NORETURN void _out_of_memory(const char *msg, const char *file, int line)
{
rprintf(FERROR, "[%s] out of memory: %s (file=%s, line=%d)\n", who_am_i(), msg, src_file(file), line);
exit_cleanup(RERR_MALLOC);
}
NORETURN void _overflow_exit(const char *msg, const char *file, int line)
{
rprintf(FERROR, "[%s] buffer overflow: %s (file=%s, line=%d)\n", who_am_i(), msg, src_file(file), line);
exit_cleanup(RERR_MALLOC);
}
const char *src_file(const char *file)
{
static const char *util2 = __FILE__;
static int prefix = -1;
if (prefix < 0) {
const char *cp = strrchr(util2, '/');
prefix = cp ? cp - util2 + 1 : 0;
}
if (prefix && strncmp(file, util2, prefix) == 0)
return file + prefix;
return file;
}
|
