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
|
/********************************************************************\
* BitlBee -- An IRC to other IM-networks gateway *
* *
* Copyright 2002-2004 Wilmer van der Gaast and others *
\********************************************************************/
/* Stuff to handle, save and search buddies */
/*
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 with
the Debian GNU/Linux distribution in /usr/share/common-licenses/GPL;
if not, write to the Free Software Foundation, Inc., 59 Temple Place,
Suite 330, Boston, MA 02111-1307 USA
*/
#define BITLBEE_CORE
#include "bitlbee.h"
user_t *user_add( irc_t *irc, char *nick )
{
user_t *u, *lu = NULL;
char *key;
if( !nick_ok( nick ) )
return( NULL );
if( user_find( irc, nick ) != NULL )
return( NULL );
return( u );
}
int user_del( irc_t *irc, char *nick )
{
user_t *u, *t;
char *key;
gpointer okey, ovalue;
if( !nick_ok( nick ) )
return( 0 );
u = 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 );
return( 1 );
}
u = (t=u)->next;
}
return( 0 );
}
user_t *user_findhandle( struct im_connection *ic, const 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;
}
|
