1 | /********************************************************************\ |
---|
2 | * BitlBee -- An IRC to other IM-networks gateway * |
---|
3 | * * |
---|
4 | * Copyright 2002-2004 Wilmer van der Gaast and others * |
---|
5 | \********************************************************************/ |
---|
6 | |
---|
7 | /* Questions to the user (mainly authorization requests from IM) */ |
---|
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 | static void query_display( irc_t *irc, query_t *q ); |
---|
30 | static query_t *query_default( irc_t *irc ); |
---|
31 | |
---|
32 | query_t *query_add( irc_t *irc, struct im_connection *ic, char *question, void *yes, void *no, void *data ) |
---|
33 | { |
---|
34 | query_t *q = g_new0( query_t, 1 ); |
---|
35 | |
---|
36 | q->ic = ic; |
---|
37 | q->question = g_strdup( question ); |
---|
38 | q->yes = yes; |
---|
39 | q->no = no; |
---|
40 | q->data = data; |
---|
41 | |
---|
42 | if( strchr( irc->umode, 'b' ) != NULL ) |
---|
43 | { |
---|
44 | char *s; |
---|
45 | |
---|
46 | /* At least for the machine-parseable version, get rid of |
---|
47 | newlines to make "parsing" easier. */ |
---|
48 | for( s = q->question; *s; s ++ ) |
---|
49 | if( *s == '\r' || *s == '\n' ) |
---|
50 | *s = ' '; |
---|
51 | } |
---|
52 | |
---|
53 | if( irc->queries ) |
---|
54 | { |
---|
55 | query_t *l = irc->queries; |
---|
56 | |
---|
57 | while( l->next ) l = l->next; |
---|
58 | l->next = q; |
---|
59 | } |
---|
60 | else |
---|
61 | { |
---|
62 | irc->queries = q; |
---|
63 | } |
---|
64 | |
---|
65 | if( g_strcasecmp( set_getstr( &irc->set, "query_order" ), "lifo" ) == 0 || irc->queries == q ) |
---|
66 | query_display( irc, q ); |
---|
67 | |
---|
68 | return( q ); |
---|
69 | } |
---|
70 | |
---|
71 | void query_del( irc_t *irc, query_t *q ) |
---|
72 | { |
---|
73 | query_t *l; |
---|
74 | |
---|
75 | if( irc->queries == q ) |
---|
76 | { |
---|
77 | irc->queries = q->next; |
---|
78 | } |
---|
79 | else |
---|
80 | { |
---|
81 | for( l = irc->queries; l; l = l->next ) |
---|
82 | { |
---|
83 | if( l->next == q ) |
---|
84 | { |
---|
85 | l->next = q->next; |
---|
86 | break; |
---|
87 | } |
---|
88 | } |
---|
89 | |
---|
90 | if( !l ) |
---|
91 | return; /* Hrmmm... */ |
---|
92 | } |
---|
93 | |
---|
94 | g_free( q->question ); |
---|
95 | if( q->data ) g_free( q->data ); /* Memory leak... */ |
---|
96 | g_free( q ); |
---|
97 | } |
---|
98 | |
---|
99 | void query_del_by_conn( irc_t *irc, struct im_connection *ic ) |
---|
100 | { |
---|
101 | query_t *q, *n, *def; |
---|
102 | int count = 0; |
---|
103 | |
---|
104 | if(!ic) |
---|
105 | return; |
---|
106 | |
---|
107 | q = irc->queries; |
---|
108 | def = query_default( irc ); |
---|
109 | |
---|
110 | while( q ) |
---|
111 | { |
---|
112 | if( q->ic == ic ) |
---|
113 | { |
---|
114 | n = q->next; |
---|
115 | query_del( irc, q ); |
---|
116 | q = n; |
---|
117 | |
---|
118 | count ++; |
---|
119 | } |
---|
120 | else |
---|
121 | { |
---|
122 | q = q->next; |
---|
123 | } |
---|
124 | } |
---|
125 | |
---|
126 | if( count > 0 ) |
---|
127 | imcb_log( ic, "Flushed %d unanswered question(s) for this connection.", count ); |
---|
128 | |
---|
129 | q = query_default( irc ); |
---|
130 | if( q && q != def ) |
---|
131 | query_display( irc, q ); |
---|
132 | } |
---|
133 | |
---|
134 | void query_answer( irc_t *irc, query_t *q, int ans ) |
---|
135 | { |
---|
136 | int disp = 0; |
---|
137 | |
---|
138 | if( !q ) |
---|
139 | { |
---|
140 | q = query_default( irc ); |
---|
141 | disp = 1; |
---|
142 | } |
---|
143 | if( ans ) |
---|
144 | { |
---|
145 | if(q->ic) |
---|
146 | imcb_log( q->ic, "Accepted: %s", q->question ); |
---|
147 | else |
---|
148 | irc_usermsg( irc, "Accepted: %s", q->question ); |
---|
149 | if(q->yes) |
---|
150 | q->yes( q->ic ? q->ic : irc, q->data ); |
---|
151 | } |
---|
152 | else |
---|
153 | { |
---|
154 | if(q->ic) |
---|
155 | imcb_log( q->ic, "Rejected: %s", q->question ); |
---|
156 | else |
---|
157 | irc_usermsg( irc, "Rejected: %s", q->question ); |
---|
158 | if(q->no) |
---|
159 | q->no( q->ic ? q->ic : irc, q->data ); |
---|
160 | } |
---|
161 | q->data = NULL; |
---|
162 | |
---|
163 | query_del( irc, q ); |
---|
164 | |
---|
165 | if( disp && ( q = query_default( irc ) ) ) |
---|
166 | query_display( irc, q ); |
---|
167 | } |
---|
168 | |
---|
169 | static void query_display( irc_t *irc, query_t *q ) |
---|
170 | { |
---|
171 | if( q->ic ) |
---|
172 | { |
---|
173 | imcb_log( q->ic, "New request: %s\nYou can use the \2yes\2/\2no\2 commands to accept/reject this request.", q->question ); |
---|
174 | } |
---|
175 | else |
---|
176 | { |
---|
177 | irc_usermsg( irc, "New request: %s\nYou can use the \2yes\2/\2no\2 commands to accept/reject this request.", q->question ); |
---|
178 | } |
---|
179 | } |
---|
180 | |
---|
181 | static query_t *query_default( irc_t *irc ) |
---|
182 | { |
---|
183 | query_t *q; |
---|
184 | |
---|
185 | if( g_strcasecmp( set_getstr( &irc->set, "query_order" ), "fifo" ) == 0 ) |
---|
186 | q = irc->queries; |
---|
187 | else |
---|
188 | for( q = irc->queries; q && q->next; q = q->next ); |
---|
189 | |
---|
190 | return( q ); |
---|
191 | } |
---|