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
|
/*
* (c) 2002 Thomas Osterried DL9SAU <thomas@x-berg.in-berlin.de>
* License: GPL. See http://www.fsf.org/
* Sources: http://x-berg.in-berlin.de/cgi-bin/viewcvs.cgi/ampr/axgetput/
*/
#include "includes.h"
#include "axgetput.h"
#include "util.h"
/* Use private function because some platforms are broken, eg 386BSD */
static int Xtolower(int c)
{
return (c >= 'A' && c <= 'Z') ? (c - 'A' + 'a') : c;
}
/*---------------------------------------------------------------------------*/
char *strlwc(char *s)
{
char *p;
for (p = s; (*p = Xtolower(*p)); p++) ;
return s;
}
/*---------------------------------------------------------------------------*/
char *strtrim(char *s)
{
char *p;
for (p = s; *p; p++) ;
while (--p >= s && isspace(*p & 0xff)) ;
p[1] = 0;
return s;
}
/*---------------------------------------------------------------------------*/
int my_read(int fd, char *s, int len_max, int *eof, char *p_break)
{
struct timeval timeout;
fd_set errfds;
int len_got;
*eof = 0;
for (len_got = 0; len_got < len_max; ) {
int len;
char *s_curr = s + len_got;
len = read(fd, s_curr, (p_break ? 1 : len_max));
if (len < 1) {
if (len == -1 && errno == EAGAIN) {
sleep(10);
continue;
}
*eof = 1;
/*
* len = 0: normal eof. if we're looking for a string, return -1 since
* we have'nt found
*/
return len == 0 && p_break ? -1 : (len_got ? len_got : len);
}
len_got += len;
/* read once? or char in p_break found? */
if (!p_break || strchr(p_break, *s_curr))
break;
}
timeout.tv_sec = 0;
timeout.tv_usec = 0;
FD_ZERO(&errfds);
FD_SET(fdout, &errfds);
if (select(fd+1, NULL, NULL, &errfds, &timeout) && FD_ISSET(fd, &errfds))
*eof = 1;
return len_got;
}
/*---------------------------------------------------------------------------*/
int secure_write(int fd, char *s, int len_write) {
int len_write_left_curr = len_write;
while (len_write_left_curr) {
int len;
len = write(fd, s, len_write_left_curr);
if (len < 0) {
if (len == -1 && errno == EAGAIN) {
sleep(10);
continue;
}
return -1;
}
if (len != len_write_left_curr) {
/* queue busy.. */
sleep(10);
}
s += len;
len_write_left_curr -= len;
}
return len_write;
}
/*---------------------------------------------------------------------------*/
char *get_fixed_filename(char *line, long size, unsigned int msg_crc, int generate_filename) {
static char filename[1024];
char *p, *q, *r;
*filename = 0;
p = strchr(line, '\"');
if (p) {
p++;
}
/* security.. */
q = strrchr((p ? p : line), '/');
if (q) {
p = ++q;
}
q = strrchr((p ? p : line), '\\');
if (q) {
p = ++q;
}
q = strrchr((p ? p : line), ':');
if (q) {
p = ++q;
}
if (!p) {
p = line;
}
while (*p && isspace(*p & 0xff))
p++;
for (r = filename, q = p; *q; q++) {
if (*q == '"' || *q == ';') {
break;
}
*r++ = *q;
}
*r = 0;
strtrim(filename);
q = strrchr(filename, '.');
if (q) {
if (!*(q+1)) {
/* remove trailing dots */
*q = 0;
} else {
/* make suffix lowercase */
strlwc(q);
}
}
if (!*filename && generate_filename) {
sprintf(filename, "unknown-%ld%d%ld.bin", size, msg_crc, time(NULL));
}
return filename;
}
/*---------------------------------------------------------------------------*/
/* Convert a MS-DOS time/date pair to a UNIX date (seconds since 1 1 70). */
/* Linear day numbers of the respective 1sts in non-leap years. */
static int day_n[] = { 0,31,59,90,120,151,181,212,243,273,304,334,0,0,0,0 };
/* JanFebMarApr May Jun Jul Aug Sep Oct Nov Dec */
/*---------------------------------------------------------------------------*/
long date_dos2unix(unsigned short time,unsigned short date)
{
int month,year;
long secs;
month = ((date >> 5) & 15)-1;
year = date >> 9;
secs = (time & 31)*2+60*((time >> 5) & 63)+(time >> 11)*3600+86400*
((date & 31)-1+day_n[month]+(year/4)+year*365-((year & 3) == 0 &&
month < 2 ? 1 : 0)+3653);
/* days since 1.1.70 plus 80's leap day */
return secs;
}
/*---------------------------------------------------------------------------*/
/* Convert linear UNIX date to a MS-DOS time/date pair. */
void date_unix2dos(int unix_date,unsigned short *time, unsigned short *date)
{
int day,year,nl_day,month;
*time = (unix_date % 60)/2+(((unix_date/60) % 60) << 5)+
(((unix_date/3600) % 24) << 11);
day = unix_date/86400-3652;
year = day/365;
if ((year+3)/4+365*year > day) year--;
day -= (year+3)/4+365*year;
if (day == 59 && !(year & 3)) {
nl_day = day;
month = 2;
}
else {
nl_day = (year & 3) || day <= 59 ? day : day-1;
for (month = 0; month < 12; month++)
if (day_n[month] > nl_day) break;
}
*date = nl_day-day_n[month-1]+1+(month << 5)+(year << 9);
}
|
