1 | /****************************************************************************** |
---|
2 | * $Id: utils.c 1579 2007-03-23 08:28:01Z joshe $ |
---|
3 | * |
---|
4 | * Copyright (c) 2005-2007 Transmission authors and contributors |
---|
5 | * |
---|
6 | * Permission is hereby granted, free of charge, to any person obtaining a |
---|
7 | * copy of this software and associated documentation files (the "Software"), |
---|
8 | * to deal in the Software without restriction, including without limitation |
---|
9 | * the rights to use, copy, modify, merge, publish, distribute, sublicense, |
---|
10 | * and/or sell copies of the Software, and to permit persons to whom the |
---|
11 | * Software is furnished to do so, subject to the following conditions: |
---|
12 | * |
---|
13 | * The above copyright notice and this permission notice shall be included in |
---|
14 | * all copies or substantial portions of the Software. |
---|
15 | * |
---|
16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
---|
17 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
---|
18 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
---|
19 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
---|
20 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
---|
21 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER |
---|
22 | * DEALINGS IN THE SOFTWARE. |
---|
23 | *****************************************************************************/ |
---|
24 | |
---|
25 | #include "transmission.h" |
---|
26 | |
---|
27 | #define SPRINTF_BUFSIZE 100 |
---|
28 | |
---|
29 | static tr_lock_t * messageLock = NULL; |
---|
30 | static int messageLevel = 0; |
---|
31 | static int messageQueuing = 0; |
---|
32 | static tr_msg_list_t * messageQueue = NULL; |
---|
33 | static tr_msg_list_t ** messageQueueTail = &messageQueue; |
---|
34 | |
---|
35 | void tr_msgInit( void ) |
---|
36 | { |
---|
37 | if( NULL == messageLock ) |
---|
38 | { |
---|
39 | messageLock = calloc( 1, sizeof( *messageLock ) ); |
---|
40 | tr_lockInit( messageLock ); |
---|
41 | } |
---|
42 | } |
---|
43 | |
---|
44 | void tr_setMessageLevel( int level ) |
---|
45 | { |
---|
46 | tr_msgInit(); |
---|
47 | tr_lockLock( messageLock ); |
---|
48 | messageLevel = MAX( 0, level ); |
---|
49 | tr_lockUnlock( messageLock ); |
---|
50 | } |
---|
51 | |
---|
52 | int tr_getMessageLevel( void ) |
---|
53 | { |
---|
54 | int ret; |
---|
55 | |
---|
56 | tr_msgInit(); |
---|
57 | tr_lockLock( messageLock ); |
---|
58 | ret = messageLevel; |
---|
59 | tr_lockUnlock( messageLock ); |
---|
60 | |
---|
61 | return ret; |
---|
62 | } |
---|
63 | |
---|
64 | void tr_setMessageQueuing( int enabled ) |
---|
65 | { |
---|
66 | tr_msgInit(); |
---|
67 | tr_lockLock( messageLock ); |
---|
68 | messageQueuing = enabled; |
---|
69 | tr_lockUnlock( messageLock ); |
---|
70 | } |
---|
71 | |
---|
72 | tr_msg_list_t * tr_getQueuedMessages( void ) |
---|
73 | { |
---|
74 | tr_msg_list_t * ret; |
---|
75 | |
---|
76 | assert( NULL != messageLock ); |
---|
77 | tr_lockLock( messageLock ); |
---|
78 | ret = messageQueue; |
---|
79 | messageQueue = NULL; |
---|
80 | messageQueueTail = &messageQueue; |
---|
81 | tr_lockUnlock( messageLock ); |
---|
82 | |
---|
83 | return ret; |
---|
84 | } |
---|
85 | |
---|
86 | void tr_freeMessageList( tr_msg_list_t * list ) |
---|
87 | { |
---|
88 | tr_msg_list_t * next; |
---|
89 | |
---|
90 | while( NULL != list ) |
---|
91 | { |
---|
92 | next = list->next; |
---|
93 | free( list->message ); |
---|
94 | free( list ); |
---|
95 | list = next; |
---|
96 | } |
---|
97 | } |
---|
98 | |
---|
99 | void tr_msg( int level, char * msg, ... ) |
---|
100 | { |
---|
101 | va_list args1, args2; |
---|
102 | tr_msg_list_t * newmsg; |
---|
103 | int len1, len2; |
---|
104 | |
---|
105 | assert( NULL != messageLock ); |
---|
106 | tr_lockLock( messageLock ); |
---|
107 | |
---|
108 | if( !messageLevel ) |
---|
109 | { |
---|
110 | char * env; |
---|
111 | env = getenv( "TR_DEBUG" ); |
---|
112 | messageLevel = ( env ? atoi( env ) : 0 ) + 1; |
---|
113 | messageLevel = MAX( 1, messageLevel ); |
---|
114 | } |
---|
115 | |
---|
116 | if( messageLevel >= level ) |
---|
117 | { |
---|
118 | va_start( args1, msg ); |
---|
119 | if( messageQueuing ) |
---|
120 | { |
---|
121 | newmsg = calloc( 1, sizeof( *newmsg ) ); |
---|
122 | if( NULL != newmsg ) |
---|
123 | { |
---|
124 | newmsg->level = level; |
---|
125 | newmsg->when = time( NULL ); |
---|
126 | len1 = len2 = 0; |
---|
127 | va_start( args2, msg ); |
---|
128 | tr_vsprintf( &newmsg->message, &len1, &len2, msg, |
---|
129 | args1, args2 ); |
---|
130 | va_end( args2 ); |
---|
131 | if( NULL == newmsg->message ) |
---|
132 | { |
---|
133 | free( newmsg ); |
---|
134 | } |
---|
135 | else |
---|
136 | { |
---|
137 | *messageQueueTail = newmsg; |
---|
138 | messageQueueTail = &newmsg->next; |
---|
139 | } |
---|
140 | } |
---|
141 | } |
---|
142 | else |
---|
143 | { |
---|
144 | vfprintf( stderr, msg, args1 ); |
---|
145 | fputc( '\n', stderr ); |
---|
146 | } |
---|
147 | va_end( args1 ); |
---|
148 | } |
---|
149 | |
---|
150 | tr_lockUnlock( messageLock ); |
---|
151 | } |
---|
152 | |
---|
153 | int tr_rand( int sup ) |
---|
154 | { |
---|
155 | static int init = 0; |
---|
156 | if( !init ) |
---|
157 | { |
---|
158 | srand( tr_date() ); |
---|
159 | init = 1; |
---|
160 | } |
---|
161 | return rand() % sup; |
---|
162 | } |
---|
163 | |
---|
164 | void * tr_memmem( const void *vbig, size_t big_len, |
---|
165 | const void *vlittle, size_t little_len ) |
---|
166 | { |
---|
167 | const char *big = vbig; |
---|
168 | const char *little = vlittle; |
---|
169 | size_t ii, jj; |
---|
170 | |
---|
171 | if( 0 == big_len || 0 == little_len ) |
---|
172 | { |
---|
173 | return NULL; |
---|
174 | } |
---|
175 | |
---|
176 | for( ii = 0; ii + little_len <= big_len; ii++ ) |
---|
177 | { |
---|
178 | for( jj = 0; jj < little_len; jj++ ) |
---|
179 | { |
---|
180 | if( big[ii + jj] != little[jj] ) |
---|
181 | { |
---|
182 | break; |
---|
183 | } |
---|
184 | } |
---|
185 | if( jj == little_len ) |
---|
186 | { |
---|
187 | return (char*)big + ii; |
---|
188 | } |
---|
189 | } |
---|
190 | |
---|
191 | return NULL; |
---|
192 | } |
---|
193 | |
---|
194 | int tr_mkdir( char * path ) |
---|
195 | { |
---|
196 | char * p, * pp; |
---|
197 | struct stat sb; |
---|
198 | int done; |
---|
199 | |
---|
200 | p = path; |
---|
201 | while( '/' == *p ) |
---|
202 | p++; |
---|
203 | pp = p; |
---|
204 | done = 0; |
---|
205 | while( ( p = strchr( pp, '/' ) ) || ( p = strchr( pp, '\0' ) ) ) |
---|
206 | { |
---|
207 | if( '\0' == *p) |
---|
208 | { |
---|
209 | done = 1; |
---|
210 | } |
---|
211 | else |
---|
212 | { |
---|
213 | *p = '\0'; |
---|
214 | } |
---|
215 | if( stat( path, &sb ) ) |
---|
216 | { |
---|
217 | /* Folder doesn't exist yet */ |
---|
218 | if( mkdir( path, 0777 ) ) |
---|
219 | { |
---|
220 | tr_err( "Could not create directory %s (%s)", path, |
---|
221 | strerror( errno ) ); |
---|
222 | *p = '/'; |
---|
223 | return 1; |
---|
224 | } |
---|
225 | } |
---|
226 | else if( ( sb.st_mode & S_IFMT ) != S_IFDIR ) |
---|
227 | { |
---|
228 | /* Node exists but isn't a folder */ |
---|
229 | tr_err( "Remove %s, it's in the way.", path ); |
---|
230 | *p = '/'; |
---|
231 | return 1; |
---|
232 | } |
---|
233 | if( done ) |
---|
234 | { |
---|
235 | break; |
---|
236 | } |
---|
237 | *p = '/'; |
---|
238 | p++; |
---|
239 | pp = p; |
---|
240 | } |
---|
241 | |
---|
242 | return 0; |
---|
243 | } |
---|
244 | |
---|
245 | #define UPPER( cc ) \ |
---|
246 | ( 'a' <= (cc) && 'z' >= (cc) ? (cc) - ( 'a' - 'A' ) : (cc) ) |
---|
247 | |
---|
248 | int tr_strncasecmp( const char * first, const char * second, int len ) |
---|
249 | { |
---|
250 | int ii; |
---|
251 | char firstchar, secondchar; |
---|
252 | |
---|
253 | if( 0 > len ) |
---|
254 | { |
---|
255 | len = strlen( first ); |
---|
256 | ii = strlen( second ); |
---|
257 | len = MIN( len, ii ); |
---|
258 | } |
---|
259 | |
---|
260 | for( ii = 0; ii < len; ii++ ) |
---|
261 | { |
---|
262 | if( first[ii] != second[ii] ) |
---|
263 | { |
---|
264 | firstchar = UPPER( first[ii] ); |
---|
265 | secondchar = UPPER( second[ii] ); |
---|
266 | if( firstchar > secondchar ) |
---|
267 | { |
---|
268 | return 1; |
---|
269 | } |
---|
270 | else if( firstchar < secondchar ) |
---|
271 | { |
---|
272 | return -1; |
---|
273 | } |
---|
274 | } |
---|
275 | if( '\0' == first[ii] ) |
---|
276 | { |
---|
277 | /* if first[ii] is '\0' then second[ii] is too */ |
---|
278 | return 0; |
---|
279 | } |
---|
280 | } |
---|
281 | |
---|
282 | return 0; |
---|
283 | } |
---|
284 | |
---|
285 | int tr_sprintf( char ** buf, int * used, int * max, const char * format, ... ) |
---|
286 | { |
---|
287 | va_list ap1, ap2; |
---|
288 | int ret; |
---|
289 | |
---|
290 | va_start( ap1, format ); |
---|
291 | va_start( ap2, format ); |
---|
292 | ret = tr_vsprintf( buf, used, max, format, ap1, ap2 ); |
---|
293 | va_end( ap2 ); |
---|
294 | va_end( ap1 ); |
---|
295 | |
---|
296 | return ret; |
---|
297 | } |
---|
298 | |
---|
299 | int tr_vsprintf( char ** buf, int * used, int * max, const char * fmt, |
---|
300 | va_list ap1, va_list ap2 ) |
---|
301 | { |
---|
302 | int want; |
---|
303 | |
---|
304 | want = vsnprintf( NULL, 0, fmt, ap1 ); |
---|
305 | |
---|
306 | if( tr_concat( buf, used, max, NULL, want ) ) |
---|
307 | { |
---|
308 | return 1; |
---|
309 | } |
---|
310 | assert( *used + want + 1 <= *max ); |
---|
311 | |
---|
312 | *used += vsnprintf( *buf + *used, *max - *used, fmt, ap2 ); |
---|
313 | |
---|
314 | return 0; |
---|
315 | } |
---|
316 | |
---|
317 | int tr_concat( char ** buf, int * used, int * max, const char * data, int len ) |
---|
318 | { |
---|
319 | int newmax; |
---|
320 | char * newbuf; |
---|
321 | |
---|
322 | newmax = *max; |
---|
323 | while( *used + len + 1 > newmax ) |
---|
324 | { |
---|
325 | newmax += SPRINTF_BUFSIZE; |
---|
326 | } |
---|
327 | if( newmax > *max ) |
---|
328 | { |
---|
329 | newbuf = realloc( *buf, newmax ); |
---|
330 | if( NULL == newbuf ) |
---|
331 | { |
---|
332 | return 1; |
---|
333 | } |
---|
334 | *buf = newbuf; |
---|
335 | *max = newmax; |
---|
336 | } |
---|
337 | |
---|
338 | if( NULL != data ) |
---|
339 | { |
---|
340 | memcpy( *buf + *used, data, len ); |
---|
341 | *used += len; |
---|
342 | } |
---|
343 | |
---|
344 | return 0; |
---|
345 | } |
---|
346 | |
---|
347 | char * |
---|
348 | tr_dupstr( const char * base, int len ) |
---|
349 | { |
---|
350 | char * ret; |
---|
351 | |
---|
352 | ret = malloc( len + 1 ); |
---|
353 | if( NULL != ret ) |
---|
354 | { |
---|
355 | memcpy( ret, base, len ); |
---|
356 | ret[len] = '\0'; |
---|
357 | } |
---|
358 | |
---|
359 | return ret; |
---|
360 | } |
---|
361 | |
---|
362 | char * |
---|
363 | tr_errorString( int code ) |
---|
364 | { |
---|
365 | switch( code ) |
---|
366 | { |
---|
367 | case TR_OK: |
---|
368 | return "No error"; |
---|
369 | case TR_ERROR: |
---|
370 | return "Generic error"; |
---|
371 | case TR_ERROR_ASSERT: |
---|
372 | return "Assert error"; |
---|
373 | case TR_ERROR_IO_PARENT: |
---|
374 | return "Download folder does not exist"; |
---|
375 | case TR_ERROR_IO_PERMISSIONS: |
---|
376 | return "Insufficient permissions"; |
---|
377 | case TR_ERROR_IO_OTHER: |
---|
378 | return "Generic I/O error"; |
---|
379 | } |
---|
380 | return "Unknown error"; |
---|
381 | } |
---|
382 | |
---|