1 | /********************************************************************\ |
---|
2 | * BitlBee -- An IRC to other IM-networks gateway * |
---|
3 | * * |
---|
4 | * Copyright 2002-2012 Wilmer van der Gaast and others * |
---|
5 | \********************************************************************/ |
---|
6 | |
---|
7 | /* MSN module - Miscellaneous utilities */ |
---|
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., 51 Franklin St., |
---|
23 | Fifth Floor, Boston, MA 02110-1301 USA |
---|
24 | */ |
---|
25 | |
---|
26 | #include "nogaim.h" |
---|
27 | #include "msn.h" |
---|
28 | #include "md5.h" |
---|
29 | #include "soap.h" |
---|
30 | #include <ctype.h> |
---|
31 | |
---|
32 | static char *adlrml_entry(const char *handle_, msn_buddy_flags_t list) |
---|
33 | { |
---|
34 | char *domain, handle[strlen(handle_) + 1]; |
---|
35 | |
---|
36 | strcpy(handle, handle_); |
---|
37 | if ((domain = strchr(handle, '@'))) { |
---|
38 | *(domain++) = '\0'; |
---|
39 | } else { |
---|
40 | return NULL; |
---|
41 | } |
---|
42 | |
---|
43 | return g_markup_printf_escaped("<ml><d n=\"%s\"><c n=\"%s\" l=\"%d\" t=\"1\"/></d></ml>", |
---|
44 | domain, handle, list); |
---|
45 | } |
---|
46 | |
---|
47 | int msn_buddy_list_add(struct im_connection *ic, msn_buddy_flags_t list, const char *who, const char *realname, |
---|
48 | const char *group) |
---|
49 | { |
---|
50 | struct msn_data *md = ic->proto_data; |
---|
51 | char groupid[8]; |
---|
52 | bee_user_t *bu; |
---|
53 | struct msn_buddy_data *bd; |
---|
54 | char *adl; |
---|
55 | |
---|
56 | *groupid = '\0'; |
---|
57 | |
---|
58 | if (!((bu = bee_user_by_handle(ic->bee, ic, who)) || |
---|
59 | (bu = bee_user_new(ic->bee, ic, who, 0))) || |
---|
60 | !(bd = bu->data) || bd->flags & list) { |
---|
61 | return 1; |
---|
62 | } |
---|
63 | |
---|
64 | bd->flags |= list; |
---|
65 | |
---|
66 | if (list == MSN_BUDDY_FL) { |
---|
67 | msn_soap_ab_contact_add(ic, bu); |
---|
68 | } else { |
---|
69 | msn_soap_memlist_edit(ic, who, TRUE, list); |
---|
70 | } |
---|
71 | |
---|
72 | if ((adl = adlrml_entry(who, list))) { |
---|
73 | int st = msn_ns_write(ic, -1, "ADL %d %zd\r\n%s", |
---|
74 | ++md->trId, strlen(adl), adl); |
---|
75 | g_free(adl); |
---|
76 | |
---|
77 | return st; |
---|
78 | } |
---|
79 | |
---|
80 | return 1; |
---|
81 | } |
---|
82 | |
---|
83 | int msn_buddy_list_remove(struct im_connection *ic, msn_buddy_flags_t list, const char *who, const char *group) |
---|
84 | { |
---|
85 | struct msn_data *md = ic->proto_data; |
---|
86 | char groupid[8]; |
---|
87 | bee_user_t *bu; |
---|
88 | struct msn_buddy_data *bd; |
---|
89 | char *adl; |
---|
90 | |
---|
91 | *groupid = '\0'; |
---|
92 | |
---|
93 | if (!(bu = bee_user_by_handle(ic->bee, ic, who)) || |
---|
94 | !(bd = bu->data) || !(bd->flags & list)) { |
---|
95 | return 1; |
---|
96 | } |
---|
97 | |
---|
98 | bd->flags &= ~list; |
---|
99 | |
---|
100 | if (list == MSN_BUDDY_FL) { |
---|
101 | msn_soap_ab_contact_del(ic, bu); |
---|
102 | } else { |
---|
103 | msn_soap_memlist_edit(ic, who, FALSE, list); |
---|
104 | } |
---|
105 | |
---|
106 | if ((adl = adlrml_entry(who, list))) { |
---|
107 | int st = msn_ns_write(ic, -1, "RML %d %zd\r\n%s", |
---|
108 | ++md->trId, strlen(adl), adl); |
---|
109 | g_free(adl); |
---|
110 | |
---|
111 | return st; |
---|
112 | } |
---|
113 | |
---|
114 | return 1; |
---|
115 | } |
---|
116 | |
---|
117 | struct msn_buddy_ask_data { |
---|
118 | struct im_connection *ic; |
---|
119 | char *handle; |
---|
120 | char *realname; |
---|
121 | }; |
---|
122 | |
---|
123 | static void msn_buddy_ask_yes(void *data) |
---|
124 | { |
---|
125 | struct msn_buddy_ask_data *bla = data; |
---|
126 | |
---|
127 | msn_buddy_list_add(bla->ic, MSN_BUDDY_AL, bla->handle, bla->realname, NULL); |
---|
128 | |
---|
129 | imcb_ask_add(bla->ic, bla->handle, NULL); |
---|
130 | |
---|
131 | g_free(bla->handle); |
---|
132 | g_free(bla->realname); |
---|
133 | g_free(bla); |
---|
134 | } |
---|
135 | |
---|
136 | static void msn_buddy_ask_no(void *data) |
---|
137 | { |
---|
138 | struct msn_buddy_ask_data *bla = data; |
---|
139 | |
---|
140 | msn_buddy_list_add(bla->ic, MSN_BUDDY_BL, bla->handle, bla->realname, NULL); |
---|
141 | |
---|
142 | g_free(bla->handle); |
---|
143 | g_free(bla->realname); |
---|
144 | g_free(bla); |
---|
145 | } |
---|
146 | |
---|
147 | void msn_buddy_ask(bee_user_t *bu) |
---|
148 | { |
---|
149 | struct msn_buddy_ask_data *bla; |
---|
150 | struct msn_buddy_data *bd = bu->data; |
---|
151 | char buf[1024]; |
---|
152 | |
---|
153 | if (!(bd->flags & MSN_BUDDY_PL)) { |
---|
154 | return; |
---|
155 | } |
---|
156 | |
---|
157 | bla = g_new0(struct msn_buddy_ask_data, 1); |
---|
158 | bla->ic = bu->ic; |
---|
159 | bla->handle = g_strdup(bu->handle); |
---|
160 | bla->realname = g_strdup(bu->fullname); |
---|
161 | |
---|
162 | g_snprintf(buf, sizeof(buf), |
---|
163 | "The user %s (%s) wants to add you to his/her buddy list.", |
---|
164 | bu->handle, bu->fullname); |
---|
165 | imcb_ask(bu->ic, buf, bla, msn_buddy_ask_yes, msn_buddy_ask_no); |
---|
166 | } |
---|
167 | |
---|
168 | void msn_queue_feed(struct msn_data *h, char *bytes, int st) |
---|
169 | { |
---|
170 | h->rxq = g_renew(char, h->rxq, h->rxlen + st); |
---|
171 | memcpy(h->rxq + h->rxlen, bytes, st); |
---|
172 | h->rxlen += st; |
---|
173 | |
---|
174 | if (getenv("BITLBEE_DEBUG")) { |
---|
175 | fprintf(stderr, "\n\x1b[92m<<< "); |
---|
176 | write(2, bytes , st); |
---|
177 | fprintf(stderr, "\x1b[97m"); |
---|
178 | } |
---|
179 | } |
---|
180 | |
---|
181 | /* This one handles input from a MSN Messenger server. Both the NS and SB servers usually give |
---|
182 | commands, but sometimes they give additional data (payload). This function tries to handle |
---|
183 | this all in a nice way and send all data to the right places. */ |
---|
184 | |
---|
185 | /* Return values: -1: Read error, abort connection. |
---|
186 | 0: Command reported error; Abort *immediately*. (The connection does not exist anymore) |
---|
187 | 1: OK */ |
---|
188 | |
---|
189 | int msn_handler(struct msn_data *h) |
---|
190 | { |
---|
191 | int st = 1; |
---|
192 | |
---|
193 | while (st) { |
---|
194 | int i; |
---|
195 | |
---|
196 | if (h->msglen == 0) { |
---|
197 | for (i = 0; i < h->rxlen; i++) { |
---|
198 | if (h->rxq[i] == '\r' || h->rxq[i] == '\n') { |
---|
199 | char *cmd_text, **cmd; |
---|
200 | int count; |
---|
201 | |
---|
202 | cmd_text = g_strndup(h->rxq, i); |
---|
203 | cmd = g_strsplit_set(cmd_text, " ", -1); |
---|
204 | count = g_strv_length(cmd); |
---|
205 | |
---|
206 | st = msn_ns_command(h, cmd, count); |
---|
207 | |
---|
208 | g_strfreev(cmd); |
---|
209 | g_free(cmd_text); |
---|
210 | |
---|
211 | /* If the connection broke, don't continue. We don't even exist anymore. */ |
---|
212 | if (!st) { |
---|
213 | return(0); |
---|
214 | } |
---|
215 | |
---|
216 | if (h->msglen) { |
---|
217 | h->cmd_text = g_strndup(h->rxq, i); |
---|
218 | } |
---|
219 | |
---|
220 | /* Skip to the next non-emptyline */ |
---|
221 | while (i < h->rxlen && (h->rxq[i] == '\r' || h->rxq[i] == '\n')) { |
---|
222 | i++; |
---|
223 | } |
---|
224 | |
---|
225 | break; |
---|
226 | } |
---|
227 | } |
---|
228 | |
---|
229 | /* If we reached the end of the buffer, there's still an incomplete command there. |
---|
230 | Return and wait for more data. */ |
---|
231 | if (i && i == h->rxlen && h->rxq[i - 1] != '\r' && h->rxq[i - 1] != '\n') { |
---|
232 | break; |
---|
233 | } |
---|
234 | } else { |
---|
235 | char *msg, **cmd; |
---|
236 | int count; |
---|
237 | |
---|
238 | /* Do we have the complete message already? */ |
---|
239 | if (h->msglen > h->rxlen) { |
---|
240 | break; |
---|
241 | } |
---|
242 | |
---|
243 | msg = g_strndup(h->rxq, h->msglen); |
---|
244 | |
---|
245 | cmd = g_strsplit_set(h->cmd_text, " ", -1); |
---|
246 | count = g_strv_length(cmd); |
---|
247 | |
---|
248 | st = msn_ns_message(h, msg, h->msglen, cmd, count); |
---|
249 | |
---|
250 | g_strfreev(cmd); |
---|
251 | g_free(msg); |
---|
252 | g_free(h->cmd_text); |
---|
253 | h->cmd_text = NULL; |
---|
254 | |
---|
255 | if (!st) { |
---|
256 | return(0); |
---|
257 | } |
---|
258 | |
---|
259 | i = h->msglen; |
---|
260 | h->msglen = 0; |
---|
261 | } |
---|
262 | |
---|
263 | /* More data after this block? */ |
---|
264 | if (i < h->rxlen) { |
---|
265 | char *tmp; |
---|
266 | |
---|
267 | tmp = g_memdup(h->rxq + i, h->rxlen - i); |
---|
268 | g_free(h->rxq); |
---|
269 | h->rxq = tmp; |
---|
270 | h->rxlen -= i; |
---|
271 | i = 0; |
---|
272 | } else { |
---|
273 | /* If not, reset the rx queue and get lost. */ |
---|
274 | g_free(h->rxq); |
---|
275 | h->rxq = g_new0(char, 1); |
---|
276 | h->rxlen = 0; |
---|
277 | return(1); |
---|
278 | } |
---|
279 | } |
---|
280 | |
---|
281 | return(1); |
---|
282 | } |
---|
283 | |
---|
284 | /* Copied and heavily modified from http://tmsnc.sourceforge.net/chl.c */ |
---|
285 | char *msn_p11_challenge(char *challenge) |
---|
286 | { |
---|
287 | char *output, buf[256]; |
---|
288 | md5_state_t md5c; |
---|
289 | unsigned char md5Hash[16], *newHash; |
---|
290 | unsigned int *md5Parts, *chlStringParts, newHashParts[5]; |
---|
291 | long long nHigh = 0, nLow = 0; |
---|
292 | int i, n; |
---|
293 | |
---|
294 | /* Create the MD5 hash */ |
---|
295 | md5_init(&md5c); |
---|
296 | md5_append(&md5c, (unsigned char *) challenge, strlen(challenge)); |
---|
297 | md5_append(&md5c, (unsigned char *) MSNP11_PROD_KEY, strlen(MSNP11_PROD_KEY)); |
---|
298 | md5_finish(&md5c, md5Hash); |
---|
299 | |
---|
300 | /* Split it into four integers */ |
---|
301 | md5Parts = (unsigned int *) md5Hash; |
---|
302 | for (i = 0; i < 4; i++) { |
---|
303 | md5Parts[i] = GUINT32_TO_LE(md5Parts[i]); |
---|
304 | |
---|
305 | /* & each integer with 0x7FFFFFFF */ |
---|
306 | /* and save one unmodified array for later */ |
---|
307 | newHashParts[i] = md5Parts[i]; |
---|
308 | md5Parts[i] &= 0x7FFFFFFF; |
---|
309 | } |
---|
310 | |
---|
311 | /* make a new string and pad with '0' */ |
---|
312 | n = g_snprintf(buf, sizeof(buf) - 5, "%s%s00000000", challenge, MSNP11_PROD_ID); |
---|
313 | /* truncate at an 8-byte boundary */ |
---|
314 | buf[n &= ~7] = '\0'; |
---|
315 | |
---|
316 | /* split into integers */ |
---|
317 | chlStringParts = (unsigned int *) buf; |
---|
318 | |
---|
319 | /* this is magic */ |
---|
320 | for (i = 0; i < (n / 4) - 1; i += 2) { |
---|
321 | long long temp; |
---|
322 | |
---|
323 | chlStringParts[i] = GUINT32_TO_LE(chlStringParts[i]); |
---|
324 | chlStringParts[i + 1] = GUINT32_TO_LE(chlStringParts[i + 1]); |
---|
325 | |
---|
326 | temp = |
---|
327 | (md5Parts[0] * |
---|
328 | (((0x0E79A9C1 * |
---|
329 | (long long) chlStringParts[i]) % 0x7FFFFFFF) + nHigh) + md5Parts[1]) % 0x7FFFFFFF; |
---|
330 | nHigh = |
---|
331 | (md5Parts[2] * |
---|
332 | (((long long) chlStringParts[i + 1] + temp) % 0x7FFFFFFF) + md5Parts[3]) % 0x7FFFFFFF; |
---|
333 | nLow = nLow + nHigh + temp; |
---|
334 | } |
---|
335 | nHigh = (nHigh + md5Parts[1]) % 0x7FFFFFFF; |
---|
336 | nLow = (nLow + md5Parts[3]) % 0x7FFFFFFF; |
---|
337 | |
---|
338 | newHashParts[0] ^= nHigh; |
---|
339 | newHashParts[1] ^= nLow; |
---|
340 | newHashParts[2] ^= nHigh; |
---|
341 | newHashParts[3] ^= nLow; |
---|
342 | |
---|
343 | /* swap more bytes if big endian */ |
---|
344 | for (i = 0; i < 4; i++) { |
---|
345 | newHashParts[i] = GUINT32_TO_LE(newHashParts[i]); |
---|
346 | } |
---|
347 | |
---|
348 | /* make a string of the parts */ |
---|
349 | newHash = (unsigned char *) newHashParts; |
---|
350 | |
---|
351 | /* convert to hexadecimal */ |
---|
352 | output = g_new(char, 33); |
---|
353 | for (i = 0; i < 16; i++) { |
---|
354 | sprintf(output + i * 2, "%02x", newHash[i]); |
---|
355 | } |
---|
356 | |
---|
357 | return output; |
---|
358 | } |
---|
359 | |
---|
360 | gint msn_domaintree_cmp(gconstpointer a_, gconstpointer b_) |
---|
361 | { |
---|
362 | const char *a = a_, *b = b_; |
---|
363 | gint ret; |
---|
364 | |
---|
365 | if (!(a = strchr(a, '@')) || !(b = strchr(b, '@')) || |
---|
366 | (ret = strcmp(a, b)) == 0) { |
---|
367 | ret = strcmp(a_, b_); |
---|
368 | } |
---|
369 | |
---|
370 | return ret; |
---|
371 | } |
---|
372 | |
---|
373 | struct msn_group *msn_group_by_name(struct im_connection *ic, const char *name) |
---|
374 | { |
---|
375 | struct msn_data *md = ic->proto_data; |
---|
376 | GSList *l; |
---|
377 | |
---|
378 | for (l = md->groups; l; l = l->next) { |
---|
379 | struct msn_group *mg = l->data; |
---|
380 | |
---|
381 | if (g_strcasecmp(mg->name, name) == 0) { |
---|
382 | return mg; |
---|
383 | } |
---|
384 | } |
---|
385 | |
---|
386 | return NULL; |
---|
387 | } |
---|
388 | |
---|
389 | struct msn_group *msn_group_by_id(struct im_connection *ic, const char *id) |
---|
390 | { |
---|
391 | struct msn_data *md = ic->proto_data; |
---|
392 | GSList *l; |
---|
393 | |
---|
394 | for (l = md->groups; l; l = l->next) { |
---|
395 | struct msn_group *mg = l->data; |
---|
396 | |
---|
397 | if (g_strcasecmp(mg->id, id) == 0) { |
---|
398 | return mg; |
---|
399 | } |
---|
400 | } |
---|
401 | |
---|
402 | return NULL; |
---|
403 | } |
---|
404 | |
---|
405 | int msn_ns_set_display_name(struct im_connection *ic, const char *value) |
---|
406 | { |
---|
407 | // TODO, implement this through msn_set_away's method |
---|
408 | return 1; |
---|
409 | } |
---|
410 | |
---|
411 | const char *msn_normalize_handle(const char *handle) |
---|
412 | { |
---|
413 | if (strncmp(handle, "1:", 2) == 0) { |
---|
414 | return handle + 2; |
---|
415 | } else { |
---|
416 | return handle; |
---|
417 | } |
---|
418 | } |
---|