aboutsummaryrefslogtreecommitdiffstats
path: root/protocols/yahoo/yahoo_util.c
blob: 5375205f53a79d06ce9b13350f5a3d1284fb0962 (plain)
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
/*
 * libyahoo2: yahoo_util.c
 *
 * Copyright (C) 2002-2004, Philip S Tellis <philip.tellis AT gmx.net>
 *
 * 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 2 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, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

#if STDC_HEADERS
# include <string.h>
#else
# if !HAVE_STRCHR
#  define strchr index
#  define strrchr rindex
# endif
char *strchr (), *strrchr ();
# if !HAVE_MEMCPY
#  define memcpy(d, s, n) bcopy ((s), (d), (n))
#  define memmove(d, s, n) bcopy ((s), (d), (n))
# endif
#endif

#include "yahoo_util.h"

char * y_string_append(char * string, char * append)
{
	int size = strlen(string) + strlen(append) + 1;
	char * new_string = y_renew(char, string, size);

	if(new_string == NULL) {
		new_string = y_new(char, size);
		strcpy(new_string, string);
		FREE(string);
	}

	strcat(new_string, append);

	return new_string;
}

#if !HAVE_GLIB

void y_strfreev(char ** vector)
{
	char **v;
	for(v = vector; *v; v++) {
		FREE(*v);
	}
	FREE(vector);
}

char ** y_strsplit(char * str, char * sep, int nelem)
{
	char ** vector;
	char *s, *p;
	int i=0;
	int l = strlen(sep);
	if(nelem <= 0) {
		char * s;
		nelem=0;
		if (*str) {
			for(s=strstr(str, sep); s; s=strstr(s+l, sep),nelem++)
				;
			if(strcmp(str+strlen(str)-l, sep))
				nelem++;
		}
	}

	vector = y_new(char *, nelem + 1);

	for(p=str, s=strstr(p,sep); i<nelem && s; p=s+l, s=strstr(p,sep), i++) {
		int len = s-p;
		vector[i] = y_new(char, len+1);
		strncpy(vector[i], p, len);
		vector[i][len] = '\0';
	}

	if(i<nelem && *str) /* str didn't end with sep, and str isn't empty */
		vector[i++] = strdup(p);
			
	vector[i] = NULL;

	return vector;
}

void * y_memdup(const void * addr, int n)
{
	void * new_chunk = malloc(n);
	if(new_chunk)
		memcpy(new_chunk, addr, n);
	return new_chunk;
}

#endif
o">= irc->users; t = NULL; while( u ) { if( nick_cmp( u->nick, nick ) == 0 ) { /* Get this key now already, since "nick" might be free()d at the time we start playing with the hash... */ key = g_strdup( nick ); nick_lc( key ); if( t ) t->next = u->next; else irc->users = u->next; if( u->online ) irc_kill( irc, u ); g_free( u->nick ); if( u->nick != u->user ) g_free( u->user ); if( u->nick != u->host ) g_free( u->host ); if( u->nick != u->realname ) g_free( u->realname ); g_free( u->group ); g_free( u->away ); g_free( u->handle ); g_free( u->sendbuf ); if( u->sendbuf_timer ) b_event_remove( u->sendbuf_timer ); g_free( u ); if( !g_hash_table_lookup_extended( irc->userhash, key, &okey, &ovalue ) || ovalue != u ) { g_free( key ); return( 1 ); /* Although this is a severe error, the user is removed from the list... */ } g_hash_table_remove( irc->userhash, key ); g_free( key ); g_free( okey ); return( 1 ); } u = (t=u)->next; } return( 0 ); } user_t *user_find( irc_t *irc, char *nick ) { char key[512] = ""; strncpy( key, nick, sizeof( key ) - 1 ); if( nick_lc( key ) ) return( g_hash_table_lookup( irc->userhash, key ) ); else return( NULL ); } user_t *user_findhandle( struct im_connection *ic, char *handle ) { user_t *u; char *nick; /* First, let's try a hash lookup. If it works, it's probably faster. */ if( ( nick = g_hash_table_lookup( ic->acc->nicks, handle ) ) && ( u = user_find( ic->irc, nick ) ) && ( ic->acc->prpl->handle_cmp( handle, u->handle ) == 0 ) ) return u; /* However, it doesn't always work, so in that case we'll have to dig through the whole userlist. :-( */ for( u = ic->irc->users; u; u = u->next ) if( u->ic == ic && u->handle && ic->acc->prpl->handle_cmp( u->handle, handle ) == 0 ) return u; return NULL; } /* DO NOT PASS u->nick FOR oldnick !!! */ void user_rename( irc_t *irc, char *oldnick, char *newnick ) { user_t *u = user_find( irc, oldnick ); gpointer okey, ovalue; char *key; if( !u ) return; /* Should've been checked by the caller... */ g_free( u->nick ); if( u->nick == u->user ) u->user = NULL; if( u->nick == u->host ) u->host = NULL; if( u->nick == u->realname ) u->realname = NULL; u->nick = g_strdup( newnick ); if( !u->user ) u->user = u->nick; if( !u->host ) u->host = u->nick; if( !u->realname ) u->realname = u->nick; /* Remove the old reference to this user from the hash and create a new one with the new nick. This is indeed a bit messy. */ key = g_strdup( oldnick ); nick_lc( key ); if( !g_hash_table_lookup_extended( irc->userhash, key, &okey, &ovalue ) || ovalue != u ) { g_free( key ); return; /* This really shouldn't happen! */ } g_hash_table_remove( irc->userhash, key ); g_free( key ); g_free( okey ); key = g_strdup( newnick ); nick_lc( key ); g_hash_table_insert( irc->userhash, key, u ); /* Also, let's try to keep the linked list nicely sorted. Fear this code. If my teacher would see this, she would cry. ;-) */ { user_t *u1, *lu1; /* Remove the user from the old position in the chain. */ if( u == irc->users ) { irc->users = u->next; } else { u1 = u; for( lu1 = irc->users; lu1->next != u1; lu1 = lu1->next ); lu1->next = u1->next; } /* Search for the new position. */ for( lu1 = NULL, u1 = irc->users; u1; u1 = u1->next ) { if( nick_cmp( newnick, u1->nick ) < 0 ) break; lu1 = u1; } /* Insert it at this new position. */ u->next = u1; if( lu1 ) lu1->next = u; else irc->users = u; } }