Context Navigation

source: user.c @ 66b9e86e

Last change on this file since 66b9e86e was 38cc9d4, checked in by Wilmer van der Gaast <wilmer@…>, at 2006-06-25T16:40:00Z
Fixed a memory leak (u->group).
Property mode set to `100644`
File size: 5.2 KB

Rev	Line
[b7d3cc34]	1	/********************************************************************\
	2	* BitlBee -- An IRC to other IM-networks gateway *
	3	* *
	4	* Copyright 2002-2004 Wilmer van der Gaast and others *
	5	\********************************************************************/
	6
	7	/* Stuff to handle, save and search buddies */
	8
	9	/*
	10	This program is free software; you can redistribute it and/or modify
	11	it under the terms of the GNU General Public License as published by
	12	the Free Software Foundation; either version 2 of the License, or
	13	(at your option) any later version.
	14
	15	This program is distributed in the hope that it will be useful,
	16	but WITHOUT ANY WARRANTY; without even the implied warranty of
	17	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	18	GNU General Public License for more details.
	19
	20	You should have received a copy of the GNU General Public License with
	21	the Debian GNU/Linux distribution in /usr/share/common-licenses/GPL;
	22	if not, write to the Free Software Foundation, Inc., 59 Temple Place,
	23	Suite 330, Boston, MA 02111-1307 USA
	24	*/
	25
	26	#define BITLBEE_CORE
	27	#include "bitlbee.h"
	28
	29	user_t user_add( irc_t irc, char *nick )
	30	{
	31	user_t u, lu = NULL;
	32	char *key;
	33
	34	if( !nick_ok( nick ) )
	35	return( NULL );
	36
	37	if( user_find( irc, nick ) != NULL )
	38	return( NULL );
	39
	40	if( ( u = irc->users ) )
	41	{
	42	while( u )
	43	{
	44	if( nick_cmp( nick, u->nick ) < 0 )
	45	break;
	46
	47	lu = u;
	48	u = u->next;
	49	}
	50
	51	u = g_new0( user_t, 1 );
	52	if( lu )
	53	{
	54	u->next = lu->next;
	55	lu->next = u;
	56	}
	57	else
	58	{
	59	u->next = irc->users;
	60	irc->users = u;
	61	}
	62	}
	63	else
	64	{
	65	irc->users = u = g_new0( user_t, 1 );
	66	}
	67
	68	u->user = u->realname = u->host = u->nick = g_strdup( nick );
	69	u->is_private = set_getint( irc, "private" );
	70
	71	key = g_strdup( nick );
	72	nick_lc( key );
	73	g_hash_table_insert( irc->userhash, key, u );
	74
	75	return( u );
	76	}
	77
	78	int user_del( irc_t irc, char nick )
	79	{
	80	user_t u, t;
	81	char *key;
	82	gpointer okey, ovalue;
	83
	84	if( !nick_ok( nick ) )
	85	return( 0 );
	86
	87	u = irc->users;
	88	t = NULL;
	89	while( u )
	90	{
	91	if( nick_cmp( u->nick, nick ) == 0 )
	92	{
	93	/* Get this key now already, since "nick" might be free()d
	94	at the time we start playing with the hash... */
	95	key = g_strdup( nick );
	96	nick_lc( key );
	97
	98	if( t )
	99	t->next = u->next;
	100	else
	101	irc->users = u->next;
	102	if( u->online )
	103	irc_kill( irc, u );
	104	g_free( u->nick );
	105	if( u->nick != u->user ) g_free( u->user );
	106	if( u->nick != u->host ) g_free( u->host );
	107	if( u->nick != u->realname ) g_free( u->realname );
[38cc9d4]	108	g_free( u->group );
	109	g_free( u->away );
	110	g_free( u->handle );
	111	g_free( u->sendbuf );
[ba9edaa]	112	if( u->sendbuf_timer ) b_event_remove( u->sendbuf_timer );
[b7d3cc34]	113	g_free( u );
	114
	115	if( !g_hash_table_lookup_extended( irc->userhash, key, &okey, &ovalue ) \|\| ovalue != u )
	116	{
	117	g_free( key );
	118	return( 1 ); /* Although this is a severe error, the user is removed from the list... */
	119	}
	120	g_hash_table_remove( irc->userhash, key );
	121	g_free( key );
	122	g_free( okey );
	123
	124	return( 1 );
	125	}
	126	u = (t=u)->next;
	127	}
	128
	129	return( 0 );
	130	}
	131
	132	user_t user_find( irc_t irc, char *nick )
	133	{
	134	char key[512] = "";
	135
	136	strncpy( key, nick, sizeof( key ) - 1 );
	137	if( nick_lc( key ) )
	138	return( g_hash_table_lookup( irc->userhash, key ) );
	139	else
	140	return( NULL );
	141	}
	142
	143	user_t user_findhandle( struct gaim_connection gc, char *handle )
	144	{
	145	user_t *u = gc->irc->users;
	146
	147	while( u )
	148	{
[9cb9868]	149	if( u->gc == gc && u->handle && gc->prpl->cmp_buddynames ( u->handle, handle ) == 0 )
[b7d3cc34]	150	break;
	151	u = u->next;
	152	}
	153
	154	return( u );
	155	}
	156
	157	void user_rename( irc_t irc, char oldnick, char *newnick )
	158	{
	159	user_t *u = user_find( irc, oldnick );
	160	gpointer okey, ovalue;
	161	char *key;
	162
	163	if( !u ) return; /* Should've been checked by the caller... */
	164
	165	g_free( u->nick );
	166	if( u->nick == u->user ) u->user = NULL;
	167	if( u->nick == u->host ) u->host = NULL;
	168	if( u->nick == u->realname ) u->realname = NULL;
	169	u->nick = g_strdup( newnick );
	170	if( !u->user ) u->user = u->nick;
[c53911e]	171	if( !u->host ) u->host = u->nick;
	172	if( !u->realname ) u->realname = u->nick;
[b7d3cc34]	173
	174	/* Remove the old reference to this user from the hash and create a
	175	new one with the new nick. This is indeed a bit messy. */
	176	key = g_strdup( oldnick );
	177	nick_lc( key );
	178	if( !g_hash_table_lookup_extended( irc->userhash, key, &okey, &ovalue ) \|\| ovalue != u )
	179	{
	180	g_free( key );
	181	return; /* This really shouldn't happen! */
	182	}
	183	g_hash_table_remove( irc->userhash, key );
	184	g_free( key );
	185	g_free( okey );
	186
	187	key = g_strdup( newnick );
	188	nick_lc( key );
	189	g_hash_table_insert( irc->userhash, key, u );
	190
	191	/* Also, let's try to keep the linked list nicely sorted. Fear this
	192	code. If my teacher would see this, she would cry. ;-) */
	193	{
	194	user_t u1, lu1;
	195
	196	/* Remove the user from the old position in the chain. */
	197	if( u == irc->users )
	198	{
	199	irc->users = u->next;
	200	}
	201	else
	202	{
	203	u1 = u;
	204	for( lu1 = irc->users; lu1->next != u1; lu1 = lu1->next );
	205	lu1->next = u1->next;
	206	}
	207
	208	/* Search for the new position. */
	209	for( lu1 = NULL, u1 = irc->users; u1; u1 = u1->next )
	210	{
	211	if( nick_cmp( newnick, u1->nick ) < 0 )
	212	break;
	213
	214	lu1 = u1;
	215	}
	216
	217	/* Insert it at this new position. */
	218	u->next = u1;
	219	if( lu1 )
	220	lu1->next = u;
	221	else
	222	irc->users = u;
	223	}
	224	}

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

Download in other formats: