Context Navigation

source: lib/misc.c @ ee6cc94

Last change on this file since ee6cc94 was ee6cc94, checked in by Wilmer van der Gaast <wilmer@…>, at 2010-08-08T15:25:13Z
Use local memory in http_encode() instead of malloc().
Property mode set to `100644`
File size: 13.1 KB

Line
1	/********************************************************************\
2	* BitlBee -- An IRC to other IM-networks gateway *
3	* *
4	* Copyright 2002-2006 Wilmer van der Gaast and others *
5	\********************************************************************/
6
7	/*
8	* Various utility functions. Some are copied from Gaim to support the
9	* IM-modules, most are from BitlBee.
10	*
11	* Copyright (C) 1998-1999, Mark Spencer <markster@marko.net>
12	* (and possibly other members of the Gaim team)
13	* Copyright 2002-2006 Wilmer van der Gaast <wilmer@gaast.net>
14	*/
15
16	/*
17	This program is free software; you can redistribute it and/or modify
18	it under the terms of the GNU General Public License as published by
19	the Free Software Foundation; either version 2 of the License, or
20	(at your option) any later version.
21
22	This program is distributed in the hope that it will be useful,
23	but WITHOUT ANY WARRANTY; without even the implied warranty of
24	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
25	GNU General Public License for more details.
26
27	You should have received a copy of the GNU General Public License with
28	the Debian GNU/Linux distribution in /usr/share/common-licenses/GPL;
29	if not, write to the Free Software Foundation, Inc., 59 Temple Place,
30	Suite 330, Boston, MA 02111-1307 USA
31	*/
32
33	#define BITLBEE_CORE
34	#include "nogaim.h"
35	#include "base64.h"
36	#include "md5.h"
37	#include <stdio.h>
38	#include <stdlib.h>
39	#include <string.h>
40	#include <ctype.h>
41	#include <glib.h>
42	#include <time.h>
43
44	#ifdef HAVE_RESOLV_A
45	#include <arpa/nameser.h>
46	#include <resolv.h>
47	#endif
48
49	#include "md5.h"
50	#include "ssl_client.h"
51
52	void strip_linefeed(gchar *text)
53	{
54	int i, j;
55	gchar *text2 = g_malloc(strlen(text) + 1);
56
57	for (i = 0, j = 0; text[i]; i++)
58	if (text[i] != '\r')
59	text2[j++] = text[i];
60	text2[j] = '\0';
61
62	strcpy(text, text2);
63	g_free(text2);
64	}
65
66	time_t get_time(int year, int month, int day, int hour, int min, int sec)
67	{
68	struct tm tm;
69
70	memset(&tm, 0, sizeof(struct tm));
71	tm.tm_year = year - 1900;
72	tm.tm_mon = month - 1;
73	tm.tm_mday = day;
74	tm.tm_hour = hour;
75	tm.tm_min = min;
76	tm.tm_sec = sec >= 0 ? sec : time(NULL) % 60;
77
78	return mktime(&tm);
79	}
80
81	typedef struct htmlentity
82	{
83	char code[7];
84	char is[3];
85	} htmlentity_t;
86
87	static const htmlentity_t ent[] =
88	{
89	{ "lt", "<" },
90	{ "gt", ">" },
91	{ "amp", "&" },
92	{ "apos", "'" },
93	{ "quot", "\"" },
94	{ "aacute", "á" },
95	{ "eacute", "é" },
96	{ "iacute", "é" },
97	{ "oacute", "ó" },
98	{ "uacute", "ú" },
99	{ "agrave", "à" },
100	{ "egrave", "è" },
101	{ "igrave", "ì" },
102	{ "ograve", "ò" },
103	{ "ugrave", "ù" },
104	{ "acirc", "â" },
105	{ "ecirc", "ê" },
106	{ "icirc", "î" },
107	{ "ocirc", "ô" },
108	{ "ucirc", "û" },
109	{ "auml", "ä" },
110	{ "euml", "ë" },
111	{ "iuml", "ï" },
112	{ "ouml", "ö" },
113	{ "uuml", "ü" },
114	{ "nbsp", " " },
115	{ "", "" }
116	};
117
118	void strip_html( char *in )
119	{
120	char *start = in;
121	char *out = g_malloc( strlen( in ) + 1 );
122	char s = out, cs;
123	int i, matched;
124
125	memset( out, 0, strlen( in ) + 1 );
126
127	while( *in )
128	{
129	if( in == '<' && ( isalpha( (in+1) ) \|\| *(in+1) == '/' ) )
130	{
131	/* If in points at a < and in+1 points at a letter or a slash, this is probably
132	a HTML-tag. Try to find a closing > and continue there. If the > can't be
133	found, assume that it wasn't a HTML-tag after all. */
134
135	cs = in;
136
137	while( in && in != '>' )
138	in ++;
139
140	if( *in )
141	{
142	if( g_strncasecmp( cs+1, "br", 2) == 0 )
143	*(s++) = '\n';
144	in ++;
145	}
146	else
147	{
148	in = cs;
149	(s++) = (in++);
150	}
151	}
152	else if( *in == '&' )
153	{
154	cs = ++in;
155	while( in && isalpha( in ) )
156	in ++;
157
158	if( *in == ';' ) in ++;
159	matched = 0;
160
161	for( i = 0; *ent[i].code; i ++ )
162	if( g_strncasecmp( ent[i].code, cs, strlen( ent[i].code ) ) == 0 )
163	{
164	int j;
165
166	for( j = 0; ent[i].is[j]; j ++ )
167	*(s++) = ent[i].is[j];
168
169	matched = 1;
170	break;
171	}
172
173	/* None of the entities were matched, so return the string */
174	if( !matched )
175	{
176	in = cs - 1;
177	(s++) = (in++);
178	}
179	}
180	else
181	{
182	(s++) = (in++);
183	}
184	}
185
186	strcpy( start, out );
187	g_free( out );
188	}
189
190	char escape_html( const char html )
191	{
192	const char *c = html;
193	GString *ret;
194	char *str;
195
196	if( html == NULL )
197	return( NULL );
198
199	ret = g_string_new( "" );
200
201	while( *c )
202	{
203	switch( *c )
204	{
205	case '&':
206	ret = g_string_append( ret, "&" );
207	break;
208	case '<':
209	ret = g_string_append( ret, "<" );
210	break;
211	case '>':
212	ret = g_string_append( ret, ">" );
213	break;
214	case '"':
215	ret = g_string_append( ret, """ );
216	break;
217	default:
218	ret = g_string_append_c( ret, *c );
219	}
220	c ++;
221	}
222
223	str = ret->str;
224	g_string_free( ret, FALSE );
225	return( str );
226	}
227
228	/* Decode%20a%20file%20name */
229	void http_decode( char *s )
230	{
231	char *t;
232	int i, j, k;
233
234	t = g_new( char, strlen( s ) + 1 );
235
236	for( i = j = 0; s[i]; i ++, j ++ )
237	{
238	if( s[i] == '%' )
239	{
240	if( sscanf( s + i + 1, "%2x", &k ) )
241	{
242	t[j] = k;
243	i += 2;
244	}
245	else
246	{
247	*t = 0;
248	break;
249	}
250	}
251	else
252	{
253	t[j] = s[i];
254	}
255	}
256	t[j] = 0;
257
258	strcpy( s, t );
259	g_free( t );
260	}
261
262	/* Warning: This one explodes the string. Worst-cases can make the string 3x its original size! */
263	/* This fuction is safe, but make sure you call it safely as well! */
264	void http_encode( char *s )
265	{
266	char t[strlen(s)+1];
267	int i, j;
268
269	strcpy( t, s );
270	for( i = j = 0; t[i]; i ++, j ++ )
271	{
272	/* if( t[i] <= ' ' \|\| ((unsigned char )t)[i] >= 128 \|\| t[i] == '%' ) /
273	if( !isalnum( t[i] ) )
274	{
275	sprintf( s + j, "%%%02X", ((unsigned char*)t)[i] );
276	j += 2;
277	}
278	else
279	{
280	s[j] = t[i];
281	}
282	}
283	s[j] = 0;
284	}
285
286	/* Strip newlines from a string. Modifies the string passed to it. */
287	char strip_newlines( char source )
288	{
289	int i;
290
291	for( i = 0; source[i] != '\0'; i ++ )
292	if( source[i] == '\n' \|\| source[i] == '\r' )
293	source[i] = ' ';
294
295	return source;
296	}
297
298	/* Wrap an IPv4 address into IPv6 space. Not thread-safe... */
299	char ipv6_wrap( char src )
300	{
301	static char dst[64];
302	int i;
303
304	for( i = 0; src[i]; i ++ )
305	if( ( src[i] < '0' \|\| src[i] > '9' ) && src[i] != '.' )
306	break;
307
308	/* Hmm, it's not even an IP... */
309	if( src[i] )
310	return src;
311
312	g_snprintf( dst, sizeof( dst ), "::ffff:%s", src );
313
314	return dst;
315	}
316
317	/* Unwrap an IPv4 address into IPv6 space. Thread-safe, because it's very simple. :-) */
318	char ipv6_unwrap( char src )
319	{
320	int i;
321
322	if( g_strncasecmp( src, "::ffff:", 7 ) != 0 )
323	return src;
324
325	for( i = 7; src[i]; i ++ )
326	if( ( src[i] < '0' \|\| src[i] > '9' ) && src[i] != '.' )
327	break;
328
329	/* Hmm, it's not even an IP... */
330	if( src[i] )
331	return src;
332
333	return ( src + 7 );
334	}
335
336	/* Convert from one charset to another.
337
338	from_cs, to_cs: Source and destination charsets
339	src, dst: Source and destination strings
340	size: Size if src. 0 == use strlen(). strlen() is not reliable for UNICODE/UTF16 strings though.
341	maxbuf: Maximum number of bytes to write to dst
342
343	Returns the number of bytes written to maxbuf or -1 on an error.
344	*/
345	signed int do_iconv( char from_cs, char to_cs, char src, char dst, size_t size, size_t maxbuf )
346	{
347	GIConv cd;
348	size_t res;
349	size_t inbytesleft, outbytesleft;
350	char *inbuf = src;
351	char *outbuf = dst;
352
353	cd = g_iconv_open( to_cs, from_cs );
354	if( cd == (GIConv) -1 )
355	return( -1 );
356
357	inbytesleft = size ? size : strlen( src );
358	outbytesleft = maxbuf - 1;
359	res = g_iconv( cd, &inbuf, &inbytesleft, &outbuf, &outbytesleft );
360	*outbuf = '\0';
361	g_iconv_close( cd );
362
363	if( res == (size_t) -1 )
364	return( -1 );
365	else
366	return( outbuf - dst );
367	}
368
369	/* A pretty reliable random number generator. Tries to use the /dev/random
370	devices first, and falls back to the random number generator from libc
371	when it fails. Opens randomizer devices with O_NONBLOCK to make sure a
372	lack of entropy won't halt BitlBee. */
373	void random_bytes( unsigned char *buf, int count )
374	{
375	#ifndef _WIN32
376	static int use_dev = -1;
377
378	/* Actually this probing code isn't really necessary, is it? */
379	if( use_dev == -1 )
380	{
381	if( access( "/dev/random", R_OK ) == 0 \|\| access( "/dev/urandom", R_OK ) == 0 )
382	use_dev = 1;
383	else
384	{
385	use_dev = 0;
386	srand( ( getpid() << 16 ) ^ time( NULL ) );
387	}
388	}
389
390	if( use_dev )
391	{
392	int fd;
393
394	/* At least on Linux, /dev/random can block if there's not
395	enough entropy. We really don't want that, so if it can't
396	give anything, use /dev/urandom instead. */
397	if( ( fd = open( "/dev/random", O_RDONLY \| O_NONBLOCK ) ) >= 0 )
398	if( read( fd, buf, count ) == count )
399	{
400	close( fd );
401	return;
402	}
403	close( fd );
404
405	/* urandom isn't supposed to block at all, but just to be
406	sure. If it blocks, we'll disable use_dev and use the libc
407	randomizer instead. */
408	if( ( fd = open( "/dev/urandom", O_RDONLY \| O_NONBLOCK ) ) >= 0 )
409	if( read( fd, buf, count ) == count )
410	{
411	close( fd );
412	return;
413	}
414	close( fd );
415
416	/* If /dev/random blocks once, we'll still try to use it
417	again next time. If /dev/urandom also fails for some
418	reason, stick with libc during this session. */
419
420	use_dev = 0;
421	srand( ( getpid() << 16 ) ^ time( NULL ) );
422	}
423
424	if( !use_dev )
425	#endif
426	{
427	int i;
428
429	/* Possibly the LSB of rand() isn't very random on some
430	platforms. Seems okay on at least Linux and OSX though. */
431	for( i = 0; i < count; i ++ )
432	buf[i] = rand() & 0xff;
433	}
434	}
435
436	int is_bool( char *value )
437	{
438	if( *value == 0 )
439	return 0;
440
441	if( ( g_strcasecmp( value, "true" ) == 0 ) \|\| ( g_strcasecmp( value, "yes" ) == 0 ) \|\| ( g_strcasecmp( value, "on" ) == 0 ) )
442	return 1;
443	if( ( g_strcasecmp( value, "false" ) == 0 ) \|\| ( g_strcasecmp( value, "no" ) == 0 ) \|\| ( g_strcasecmp( value, "off" ) == 0 ) )
444	return 1;
445
446	while( *value )
447	if( !isdigit( *value ) )
448	return 0;
449	else
450	value ++;
451
452	return 1;
453	}
454
455	int bool2int( char *value )
456	{
457	int i;
458
459	if( ( g_strcasecmp( value, "true" ) == 0 ) \|\| ( g_strcasecmp( value, "yes" ) == 0 ) \|\| ( g_strcasecmp( value, "on" ) == 0 ) )
460	return 1;
461	if( ( g_strcasecmp( value, "false" ) == 0 ) \|\| ( g_strcasecmp( value, "no" ) == 0 ) \|\| ( g_strcasecmp( value, "off" ) == 0 ) )
462	return 0;
463
464	if( sscanf( value, "%d", &i ) == 1 )
465	return i;
466
467	return 0;
468	}
469
470	struct ns_srv_reply srv_lookup( char service, char protocol, char domain )
471	{
472	struct ns_srv_reply *reply = NULL;
473	#ifdef HAVE_RESOLV_A
474	char name[1024];
475	unsigned char querybuf[1024];
476	const unsigned char *buf;
477	ns_msg nsh;
478	ns_rr rr;
479	int i, len, size;
480
481	g_snprintf( name, sizeof( name ), "_%s._%s.%s", service, protocol, domain );
482
483	if( ( size = res_query( name, ns_c_in, ns_t_srv, querybuf, sizeof( querybuf ) ) ) <= 0 )
484	return NULL;
485
486	if( ns_initparse( querybuf, size, &nsh ) != 0 )
487	return NULL;
488
489	if( ns_parserr( &nsh, ns_s_an, 0, &rr ) != 0 )
490	return NULL;
491
492	size = ns_rr_rdlen( rr );
493	buf = ns_rr_rdata( rr );
494
495	len = 0;
496	for( i = 6; i < size && buf[i]; i += buf[i] + 1 )
497	len += buf[i] + 1;
498
499	if( i > size )
500	return NULL;
501
502	reply = g_malloc( sizeof( struct ns_srv_reply ) + len );
503	memcpy( reply->name, buf + 7, len );
504
505	for( i = buf[6]; i < len && buf[7+i]; i += buf[7+i] + 1 )
506	reply->name[i] = '.';
507
508	if( i > len )
509	{
510	g_free( reply );
511	return NULL;
512	}
513
514	reply->prio = ( buf[0] << 8 ) \| buf[1];
515	reply->weight = ( buf[2] << 8 ) \| buf[3];
516	reply->port = ( buf[4] << 8 ) \| buf[5];
517	#endif
518
519	return reply;
520	}
521
522	/* Word wrapping. Yes, I know this isn't UTF-8 clean. I'm willing to take the risk. */
523	char word_wrap( const char msg, int line_len )
524	{
525	GString *ret = g_string_sized_new( strlen( msg ) + 16 );
526
527	while( strlen( msg ) > line_len )
528	{
529	int i;
530
531	/* First try to find out if there's a newline already. Don't
532	want to add more splits than necessary. */
533	for( i = line_len; i > 0 && msg[i] != '\n'; i -- );
534	if( msg[i] == '\n' )
535	{
536	g_string_append_len( ret, msg, i + 1 );
537	msg += i + 1;
538	continue;
539	}
540
541	for( i = line_len; i > 0; i -- )
542	{
543	if( msg[i] == '-' )
544	{
545	g_string_append_len( ret, msg, i + 1 );
546	g_string_append_c( ret, '\n' );
547	msg += i + 1;
548	break;
549	}
550	else if( msg[i] == ' ' )
551	{
552	g_string_append_len( ret, msg, i );
553	g_string_append_c( ret, '\n' );
554	msg += i + 1;
555	break;
556	}
557	}
558	if( i == 0 )
559	{
560	g_string_append_len( ret, msg, line_len );
561	g_string_append_c( ret, '\n' );
562	msg += line_len;
563	}
564	}
565	g_string_append( ret, msg );
566
567	return g_string_free( ret, FALSE );
568	}
569
570	gboolean ssl_sockerr_again( void *ssl )
571	{
572	if( ssl )
573	return ssl_errno == SSL_AGAIN;
574	else
575	return sockerr_again();
576	}
577
578	/* Returns values: -1 == Failure (base64-decoded to something unexpected)
579	0 == Okay
580	1 == Password doesn't match the hash. */
581	int md5_verify_password( char password, char hash )
582	{
583	md5_byte_t *pass_dec = NULL;
584	md5_byte_t pass_md5[16];
585	md5_state_t md5_state;
586	int ret = -1, i;
587
588	if( base64_decode( hash, &pass_dec ) == 21 )
589	{
590	md5_init( &md5_state );
591	md5_append( &md5_state, (md5_byte_t*) password, strlen( password ) );
592	md5_append( &md5_state, (md5_byte_t) pass_dec + 16, 5 ); / Hmmm, salt! */
593	md5_finish( &md5_state, pass_md5 );
594
595	for( i = 0; i < 16; i ++ )
596	{
597	if( pass_dec[i] != pass_md5[i] )
598	{
599	ret = 1;
600	break;
601	}
602	}
603
604	/* If we reached the end of the loop, it was a match! */
605	if( i == 16 )
606	ret = 0;
607	}
608
609	g_free( pass_dec );
610
611	return ret;
612	}

Note: See TracBrowser for help on using the repository browser.

Download in other formats: