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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/********************************************************************\
* BitlBee -- An IRC to other IM-networks gateway *
* *
* Copyright 2002-2004 Wilmer van der Gaast and others *
\********************************************************************/
/* Questions to the user (mainly authorization requests from IM) */
/*
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"
static void query_display( irc_t *irc, query_t *q );
static query_t *query_default( irc_t *irc );
query_t *query_add( irc_t *irc, struct im_connection *ic, char *question, void *yes, void *no, void *data )
{
query_t *q = g_new0( query_t, 1 );
q->ic = ic;
q->question = g_strdup( question );
q->yes = yes;
q->no = no;
q->data = data;
if( strchr( irc->umode, 'b' ) != NULL )
{
char *s;
/* At least for the machine-parseable version, get rid of
newlines to make "parsing" easier. */
for( s = q->question; *s; s ++ )
if( *s == '\r' || *s == '\n' )
*s = ' ';
}
if( irc->queries )
{
query_t *l = irc->queries;
while( l->next ) l = l->next;
l->next = q;
}
else
{
irc->queries = q;
}
if( g_strcasecmp( set_getstr( &irc->set, "query_order" ), "lifo" ) == 0 || irc->queries == q )
query_display( irc, q );
return( q );
}
void query_del( irc_t *irc, query_t *q )
{
query_t *l;
if( irc->queries == q )
{
irc->queries = q->next;
}
else
{
for( l = irc->queries; l; l = l->next )
{
if( l->next == q )
{
l->next = q->next;
break;
}
}
if( !l )
return; /* Hrmmm... */
}
g_free( q->question );
if( q->data ) g_free( q->data ); /* Memory leak... */
g_free( q );
}
void query_del_by_conn( irc_t *irc, struct im_connection *ic )
{
query_t *q, *n, *def;
int count = 0;
q = irc->queries;
def = query_default( irc );
while( q )
{
if( q->ic == ic )
{
n = q->next;
query_del( irc, q );
q = n;
count ++;
}
else
{
q = q->next;
}
}
if( count > 0 )
imc_log( ic, "Flushed %d unanswered question(s) for this connection.", count );
q = query_default( irc );
if( q && q != def )
query_display( irc, q );
}
void query_answer( irc_t *irc, query_t *q, int ans )
{
int disp = 0;
if( !q )
{
q = query_default( irc );
disp = 1;
}
if( ans )
{
imc_log( q->ic, "Accepted: %s", q->question );
q->yes( NULL, q->data );
}
else
{
imc_log( q->ic, "Rejected: %s", q->question );
q->no( NULL, q->data );
}
q->data = NULL;
query_del( irc, q );
if( disp && ( q = query_default( irc ) ) )
query_display( irc, q );
}
static void query_display( irc_t *irc, query_t *q )
{
if( q->ic )
{
imc_log( q->ic, "New request: %s\nYou can use the \2yes\2/\2no\2 commands to accept/reject this request.", q->question );
}
else
{
irc_usermsg( irc, "New request: %s\nYou can use the \2yes\2/\2no\2 commands to accept/reject this request.", q->question );
}
}
static query_t *query_default( irc_t *irc )
{
query_t *q;
if( g_strcasecmp( set_getstr( &irc->set, "query_order" ), "fifo" ) == 0 )
q = irc->queries;
else
for( q = irc->queries; q && q->next; q = q->next );
return( q );
}
|
