[f06894d] | 1 | /***************************************************************************\ |
---|
| 2 | * * |
---|
| 3 | * BitlBee - An IRC to IM gateway * |
---|
[21167d2] | 4 | * Jabber module - Misc. stuff * |
---|
[f06894d] | 5 | * * |
---|
| 6 | * Copyright 2006 Wilmer van der Gaast <wilmer@gaast.net> * |
---|
| 7 | * * |
---|
| 8 | * This program is free software; you can redistribute it and/or modify * |
---|
| 9 | * it under the terms of the GNU General Public License as published by * |
---|
| 10 | * the Free Software Foundation; either version 2 of the License, or * |
---|
| 11 | * (at your option) any later version. * |
---|
| 12 | * * |
---|
| 13 | * This program is distributed in the hope that it will be useful, * |
---|
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of * |
---|
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
---|
| 16 | * GNU General Public License for more details. * |
---|
| 17 | * * |
---|
| 18 | * You should have received a copy of the GNU General Public License along * |
---|
| 19 | * with this program; if not, write to the Free Software Foundation, Inc., * |
---|
| 20 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. * |
---|
| 21 | * * |
---|
| 22 | \***************************************************************************/ |
---|
| 23 | |
---|
| 24 | #include "jabber.h" |
---|
[89d736a] | 25 | #include "md5.h" |
---|
| 26 | #include "base64.h" |
---|
[f06894d] | 27 | |
---|
[dfa41a4] | 28 | static unsigned int next_id = 1; |
---|
[21167d2] | 29 | |
---|
[ebe7b36] | 30 | char *set_eval_priority( set_t *set, char *value ) |
---|
[f06894d] | 31 | { |
---|
| 32 | account_t *acc = set->data; |
---|
[788a1af] | 33 | int i; |
---|
[f06894d] | 34 | |
---|
[788a1af] | 35 | if( sscanf( value, "%d", &i ) == 1 ) |
---|
| 36 | { |
---|
| 37 | /* Priority is a signed 8-bit integer, according to RFC 3921. */ |
---|
| 38 | if( i < -128 || i > 127 ) |
---|
[7125cb3] | 39 | return SET_INVALID; |
---|
[788a1af] | 40 | } |
---|
| 41 | else |
---|
[7125cb3] | 42 | return SET_INVALID; |
---|
[172a73f1] | 43 | |
---|
| 44 | /* Only run this stuff if the account is online ATM, |
---|
| 45 | and if the setting seems to be acceptable. */ |
---|
[0da65d5] | 46 | if( acc->ic ) |
---|
[f06894d] | 47 | { |
---|
[ebe7b36] | 48 | /* Although set_eval functions usually are very nice and |
---|
| 49 | convenient, they have one disadvantage: If I would just |
---|
| 50 | call p_s_u() now to send the new prio setting, it would |
---|
| 51 | send the old setting because the set->value gets changed |
---|
[e35d1a1] | 52 | after the (this) eval returns a non-NULL value. |
---|
[ebe7b36] | 53 | |
---|
| 54 | So now I can choose between implementing post-set |
---|
| 55 | functions next to evals, or just do this little hack: */ |
---|
| 56 | |
---|
| 57 | g_free( set->value ); |
---|
[788a1af] | 58 | set->value = g_strdup( value ); |
---|
[ebe7b36] | 59 | |
---|
| 60 | /* (Yes, sorry, I prefer the hack. :-P) */ |
---|
| 61 | |
---|
[0da65d5] | 62 | presence_send_update( acc->ic ); |
---|
[f06894d] | 63 | } |
---|
| 64 | |
---|
[788a1af] | 65 | return value; |
---|
[f06894d] | 66 | } |
---|
| 67 | |
---|
| 68 | char *set_eval_tls( set_t *set, char *value ) |
---|
| 69 | { |
---|
| 70 | if( g_strcasecmp( value, "try" ) == 0 ) |
---|
| 71 | return value; |
---|
| 72 | else |
---|
| 73 | return set_eval_bool( set, value ); |
---|
| 74 | } |
---|
[21167d2] | 75 | |
---|
| 76 | struct xt_node *jabber_make_packet( char *name, char *type, char *to, struct xt_node *children ) |
---|
| 77 | { |
---|
| 78 | struct xt_node *node; |
---|
| 79 | |
---|
| 80 | node = xt_new_node( name, NULL, children ); |
---|
| 81 | |
---|
| 82 | if( type ) |
---|
| 83 | xt_add_attr( node, "type", type ); |
---|
| 84 | if( to ) |
---|
| 85 | xt_add_attr( node, "to", to ); |
---|
| 86 | |
---|
[dfa41a4] | 87 | /* IQ packets should always have an ID, so let's generate one. It |
---|
| 88 | might get overwritten by jabber_cache_add() if this packet has |
---|
| 89 | to be saved until we receive a response. Cached packets get |
---|
| 90 | slightly different IDs so we can recognize them. */ |
---|
| 91 | if( strcmp( name, "iq" ) == 0 ) |
---|
| 92 | { |
---|
| 93 | char *id = g_strdup_printf( "%s%05x", JABBER_PACKET_ID, ( next_id++ ) & 0xfffff ); |
---|
| 94 | xt_add_attr( node, "id", id ); |
---|
| 95 | g_free( id ); |
---|
| 96 | } |
---|
| 97 | |
---|
[fe7a554] | 98 | return node; |
---|
| 99 | } |
---|
| 100 | |
---|
[2c2df7d] | 101 | struct xt_node *jabber_make_error_packet( struct xt_node *orig, char *err_cond, char *err_type, char *err_code ) |
---|
[259edd4] | 102 | { |
---|
| 103 | struct xt_node *node, *c; |
---|
| 104 | char *to; |
---|
| 105 | |
---|
| 106 | /* Create the "defined-condition" tag. */ |
---|
| 107 | c = xt_new_node( err_cond, NULL, NULL ); |
---|
[47d3ac4] | 108 | xt_add_attr( c, "xmlns", XMLNS_STANZA_ERROR ); |
---|
[259edd4] | 109 | |
---|
| 110 | /* Put it in an <error> tag. */ |
---|
| 111 | c = xt_new_node( "error", NULL, c ); |
---|
| 112 | xt_add_attr( c, "type", err_type ); |
---|
| 113 | |
---|
[2c2df7d] | 114 | /* Add the error code, if present */ |
---|
| 115 | if (err_code) |
---|
| 116 | xt_add_attr( c, "code", err_code ); |
---|
| 117 | |
---|
[259edd4] | 118 | /* To make the actual error packet, we copy the original packet and |
---|
| 119 | add our <error>/type="error" tag. Including the original packet |
---|
| 120 | is recommended, so let's just do it. */ |
---|
| 121 | node = xt_dup( orig ); |
---|
| 122 | xt_add_child( node, c ); |
---|
| 123 | xt_add_attr( node, "type", "error" ); |
---|
| 124 | |
---|
| 125 | /* Return to sender. */ |
---|
| 126 | if( ( to = xt_find_attr( node, "from" ) ) ) |
---|
| 127 | { |
---|
| 128 | xt_add_attr( node, "to", to ); |
---|
| 129 | xt_remove_attr( node, "from" ); |
---|
| 130 | } |
---|
| 131 | |
---|
| 132 | return node; |
---|
| 133 | } |
---|
| 134 | |
---|
[dfa41a4] | 135 | /* Cache a node/packet for later use. Mainly useful for IQ packets if you need |
---|
[fe7a554] | 136 | them when you receive the response. Use this BEFORE sending the packet so |
---|
[e35d1a1] | 137 | it'll get a new id= tag, and do NOT free() the packet after sending it! */ |
---|
[0da65d5] | 138 | void jabber_cache_add( struct im_connection *ic, struct xt_node *node, jabber_cache_event func ) |
---|
[fe7a554] | 139 | { |
---|
[0da65d5] | 140 | struct jabber_data *jd = ic->proto_data; |
---|
[038d17f] | 141 | struct jabber_cache_entry *entry = g_new0( struct jabber_cache_entry, 1 ); |
---|
[89d736a] | 142 | md5_state_t id_hash; |
---|
| 143 | md5_byte_t id_sum[16]; |
---|
| 144 | char *id, *asc_hash; |
---|
[fe7a554] | 145 | |
---|
[89d736a] | 146 | next_id ++; |
---|
| 147 | |
---|
| 148 | id_hash = jd->cached_id_prefix; |
---|
| 149 | md5_append( &id_hash, (md5_byte_t*) &next_id, sizeof( next_id ) ); |
---|
| 150 | md5_finish( &id_hash, id_sum ); |
---|
| 151 | asc_hash = base64_encode( id_sum, 12 ); |
---|
| 152 | |
---|
| 153 | id = g_strdup_printf( "%s%s", JABBER_CACHED_ID, asc_hash ); |
---|
[fe7a554] | 154 | xt_add_attr( node, "id", id ); |
---|
[21167d2] | 155 | g_free( id ); |
---|
[89d736a] | 156 | g_free( asc_hash ); |
---|
[038d17f] | 157 | |
---|
| 158 | entry->node = node; |
---|
[861c199] | 159 | entry->func = func; |
---|
[979cfb4] | 160 | entry->saved_at = time( NULL ); |
---|
[038d17f] | 161 | g_hash_table_insert( jd->node_cache, xt_find_attr( node, "id" ), entry ); |
---|
[fe7a554] | 162 | } |
---|
| 163 | |
---|
[038d17f] | 164 | void jabber_cache_entry_free( gpointer data ) |
---|
| 165 | { |
---|
| 166 | struct jabber_cache_entry *entry = data; |
---|
[21167d2] | 167 | |
---|
[038d17f] | 168 | xt_free_node( entry->node ); |
---|
| 169 | g_free( entry ); |
---|
| 170 | } |
---|
| 171 | |
---|
| 172 | gboolean jabber_cache_clean_entry( gpointer key, gpointer entry, gpointer nullpointer ); |
---|
| 173 | |
---|
[861c199] | 174 | /* This one should be called from time to time (from keepalive, in this case) |
---|
| 175 | to make sure things don't stay in the node cache forever. By marking nodes |
---|
| 176 | during the first run and deleting marked nodes during a next run, every |
---|
| 177 | node should be available in the cache for at least a minute (assuming the |
---|
| 178 | function is indeed called every minute). */ |
---|
[0da65d5] | 179 | void jabber_cache_clean( struct im_connection *ic ) |
---|
[038d17f] | 180 | { |
---|
[0da65d5] | 181 | struct jabber_data *jd = ic->proto_data; |
---|
[979cfb4] | 182 | time_t threshold = time( NULL ) - JABBER_CACHE_MAX_AGE; |
---|
[038d17f] | 183 | |
---|
[979cfb4] | 184 | g_hash_table_foreach_remove( jd->node_cache, jabber_cache_clean_entry, &threshold ); |
---|
[038d17f] | 185 | } |
---|
| 186 | |
---|
[979cfb4] | 187 | gboolean jabber_cache_clean_entry( gpointer key, gpointer entry_, gpointer threshold_ ) |
---|
[038d17f] | 188 | { |
---|
| 189 | struct jabber_cache_entry *entry = entry_; |
---|
[979cfb4] | 190 | time_t *threshold = threshold_; |
---|
[038d17f] | 191 | |
---|
[979cfb4] | 192 | return entry->saved_at < *threshold; |
---|
[21167d2] | 193 | } |
---|
[5e202b0] | 194 | |
---|
[4306d8b] | 195 | xt_status jabber_cache_handle_packet( struct im_connection *ic, struct xt_node *node ) |
---|
| 196 | { |
---|
| 197 | struct jabber_data *jd = ic->proto_data; |
---|
| 198 | struct jabber_cache_entry *entry; |
---|
| 199 | char *s; |
---|
| 200 | |
---|
| 201 | if( ( s = xt_find_attr( node, "id" ) ) == NULL || |
---|
[89d736a] | 202 | strncmp( s, JABBER_CACHED_ID, strlen( JABBER_CACHED_ID ) ) != 0 ) |
---|
[4306d8b] | 203 | { |
---|
| 204 | /* Silently ignore it, without an ID (or a non-cache |
---|
| 205 | ID) we don't know how to handle the packet and we |
---|
| 206 | probably don't have to. */ |
---|
| 207 | return XT_HANDLED; |
---|
| 208 | } |
---|
| 209 | |
---|
| 210 | entry = g_hash_table_lookup( jd->node_cache, s ); |
---|
| 211 | |
---|
| 212 | if( entry == NULL ) |
---|
| 213 | { |
---|
[89d736a] | 214 | /* |
---|
| 215 | There's no longer an easy way to see if we generated this |
---|
| 216 | one or someone else, and there's a ten-minute timeout anyway, |
---|
| 217 | so meh. |
---|
| 218 | |
---|
[43462708] | 219 | imcb_log( ic, "Warning: Received %s-%s packet with unknown/expired ID %s!", |
---|
[4306d8b] | 220 | node->name, xt_find_attr( node, "type" ) ? : "(no type)", s ); |
---|
[89d736a] | 221 | */ |
---|
[4306d8b] | 222 | } |
---|
| 223 | else if( entry->func ) |
---|
| 224 | { |
---|
| 225 | return entry->func( ic, node, entry->node ); |
---|
| 226 | } |
---|
| 227 | |
---|
| 228 | return XT_HANDLED; |
---|
| 229 | } |
---|
| 230 | |
---|
[5e202b0] | 231 | const struct jabber_away_state jabber_away_state_list[] = |
---|
| 232 | { |
---|
| 233 | { "away", "Away" }, |
---|
[840bba8] | 234 | { "chat", "Free for Chat" }, /* WTF actually uses this? */ |
---|
[5e202b0] | 235 | { "dnd", "Do not Disturb" }, |
---|
| 236 | { "xa", "Extended Away" }, |
---|
| 237 | { "", NULL } |
---|
| 238 | }; |
---|
| 239 | |
---|
| 240 | const struct jabber_away_state *jabber_away_state_by_code( char *code ) |
---|
| 241 | { |
---|
| 242 | int i; |
---|
| 243 | |
---|
[840bba8] | 244 | if( code == NULL ) |
---|
| 245 | return NULL; |
---|
| 246 | |
---|
[5e202b0] | 247 | for( i = 0; jabber_away_state_list[i].full_name; i ++ ) |
---|
| 248 | if( g_strcasecmp( jabber_away_state_list[i].code, code ) == 0 ) |
---|
| 249 | return jabber_away_state_list + i; |
---|
| 250 | |
---|
| 251 | return NULL; |
---|
| 252 | } |
---|
| 253 | |
---|
| 254 | const struct jabber_away_state *jabber_away_state_by_name( char *name ) |
---|
| 255 | { |
---|
| 256 | int i; |
---|
| 257 | |
---|
[840bba8] | 258 | if( name == NULL ) |
---|
| 259 | return NULL; |
---|
| 260 | |
---|
[5e202b0] | 261 | for( i = 0; jabber_away_state_list[i].full_name; i ++ ) |
---|
| 262 | if( g_strcasecmp( jabber_away_state_list[i].full_name, name ) == 0 ) |
---|
| 263 | return jabber_away_state_list + i; |
---|
| 264 | |
---|
| 265 | return NULL; |
---|
| 266 | } |
---|
[8e5e2e9] | 267 | |
---|
| 268 | struct jabber_buddy_ask_data |
---|
| 269 | { |
---|
[0da65d5] | 270 | struct im_connection *ic; |
---|
[8e5e2e9] | 271 | char *handle; |
---|
| 272 | char *realname; |
---|
| 273 | }; |
---|
| 274 | |
---|
[9143aeb] | 275 | static void jabber_buddy_ask_yes( void *data ) |
---|
[8e5e2e9] | 276 | { |
---|
[9143aeb] | 277 | struct jabber_buddy_ask_data *bla = data; |
---|
| 278 | |
---|
[0da65d5] | 279 | presence_send_request( bla->ic, bla->handle, "subscribed" ); |
---|
[8e5e2e9] | 280 | |
---|
[f0cb961] | 281 | if( imcb_find_buddy( bla->ic, bla->handle ) == NULL ) |
---|
[84b045d] | 282 | imcb_ask_add( bla->ic, bla->handle, NULL ); |
---|
[8e5e2e9] | 283 | |
---|
| 284 | g_free( bla->handle ); |
---|
| 285 | g_free( bla ); |
---|
| 286 | } |
---|
| 287 | |
---|
[9143aeb] | 288 | static void jabber_buddy_ask_no( void *data ) |
---|
[8e5e2e9] | 289 | { |
---|
[9143aeb] | 290 | struct jabber_buddy_ask_data *bla = data; |
---|
| 291 | |
---|
[0da65d5] | 292 | presence_send_request( bla->ic, bla->handle, "subscribed" ); |
---|
[8e5e2e9] | 293 | |
---|
| 294 | g_free( bla->handle ); |
---|
| 295 | g_free( bla ); |
---|
| 296 | } |
---|
| 297 | |
---|
[0da65d5] | 298 | void jabber_buddy_ask( struct im_connection *ic, char *handle ) |
---|
[8e5e2e9] | 299 | { |
---|
| 300 | struct jabber_buddy_ask_data *bla = g_new0( struct jabber_buddy_ask_data, 1 ); |
---|
| 301 | char *buf; |
---|
| 302 | |
---|
[0da65d5] | 303 | bla->ic = ic; |
---|
[8e5e2e9] | 304 | bla->handle = g_strdup( handle ); |
---|
| 305 | |
---|
| 306 | buf = g_strdup_printf( "The user %s wants to add you to his/her buddy list.", handle ); |
---|
[84b045d] | 307 | imcb_ask( ic, buf, bla, jabber_buddy_ask_yes, jabber_buddy_ask_no ); |
---|
[6266fca] | 308 | g_free( buf ); |
---|
[8e5e2e9] | 309 | } |
---|
[6a1128d] | 310 | |
---|
[0d3f30f] | 311 | /* Returns a new string. Don't leak it! */ |
---|
[e35d1a1] | 312 | char *jabber_normalize( const char *orig ) |
---|
[0d3f30f] | 313 | { |
---|
| 314 | int len, i; |
---|
| 315 | char *new; |
---|
| 316 | |
---|
| 317 | len = strlen( orig ); |
---|
| 318 | new = g_new( char, len + 1 ); |
---|
[98de2cc] | 319 | |
---|
| 320 | /* So it turns out the /resource part is case sensitive. Yeah, and |
---|
| 321 | it's Unicode but feck Unicode. :-P So stop once we see a slash. */ |
---|
| 322 | for( i = 0; i < len && orig[i] != '/' ; i ++ ) |
---|
[0d3f30f] | 323 | new[i] = tolower( orig[i] ); |
---|
[98de2cc] | 324 | for( ; orig[i]; i ++ ) |
---|
[2ff2076] | 325 | new[i] = orig[i]; |
---|
[0d3f30f] | 326 | |
---|
| 327 | new[i] = 0; |
---|
| 328 | return new; |
---|
| 329 | } |
---|
| 330 | |
---|
[6a1128d] | 331 | /* Adds a buddy/resource to our list. Returns NULL if full_jid is not really a |
---|
[0d3f30f] | 332 | FULL jid or if we already have this buddy/resource. XXX: No, great, actually |
---|
| 333 | buddies from transports don't (usually) have resources. So we'll really have |
---|
| 334 | to deal with that properly. Set their ->resource property to NULL. Do *NOT* |
---|
| 335 | allow to mix this stuff, though... */ |
---|
[0da65d5] | 336 | struct jabber_buddy *jabber_buddy_add( struct im_connection *ic, char *full_jid_ ) |
---|
[6a1128d] | 337 | { |
---|
[0da65d5] | 338 | struct jabber_data *jd = ic->proto_data; |
---|
[6a1128d] | 339 | struct jabber_buddy *bud, *new, *bi; |
---|
[0d3f30f] | 340 | char *s, *full_jid; |
---|
[6a1128d] | 341 | |
---|
[0d3f30f] | 342 | full_jid = jabber_normalize( full_jid_ ); |
---|
| 343 | |
---|
| 344 | if( ( s = strchr( full_jid, '/' ) ) ) |
---|
| 345 | *s = 0; |
---|
[6a1128d] | 346 | |
---|
| 347 | new = g_new0( struct jabber_buddy, 1 ); |
---|
| 348 | |
---|
| 349 | if( ( bud = g_hash_table_lookup( jd->buddies, full_jid ) ) ) |
---|
| 350 | { |
---|
[0d3f30f] | 351 | /* If this is a transport buddy or whatever, it can't have more |
---|
| 352 | than one instance, so this is always wrong: */ |
---|
| 353 | if( s == NULL || bud->resource == NULL ) |
---|
| 354 | { |
---|
| 355 | if( s ) *s = '/'; |
---|
| 356 | g_free( new ); |
---|
| 357 | g_free( full_jid ); |
---|
| 358 | return NULL; |
---|
| 359 | } |
---|
| 360 | |
---|
| 361 | new->bare_jid = bud->bare_jid; |
---|
[6a1128d] | 362 | |
---|
| 363 | /* We already have another resource for this buddy, add the |
---|
| 364 | new one to the list. */ |
---|
| 365 | for( bi = bud; bi; bi = bi->next ) |
---|
| 366 | { |
---|
[0d3f30f] | 367 | /* Check for dupes. */ |
---|
[98de2cc] | 368 | if( strcmp( bi->resource, s + 1 ) == 0 ) |
---|
[6a1128d] | 369 | { |
---|
| 370 | *s = '/'; |
---|
| 371 | g_free( new ); |
---|
[0d3f30f] | 372 | g_free( full_jid ); |
---|
[6a1128d] | 373 | return NULL; |
---|
| 374 | } |
---|
| 375 | /* Append the new item to the list. */ |
---|
| 376 | else if( bi->next == NULL ) |
---|
| 377 | { |
---|
| 378 | bi->next = new; |
---|
| 379 | break; |
---|
| 380 | } |
---|
| 381 | } |
---|
| 382 | } |
---|
| 383 | else |
---|
| 384 | { |
---|
[b9f8b87] | 385 | /* Keep in mind that full_jid currently isn't really |
---|
| 386 | a full JID... */ |
---|
[0d3f30f] | 387 | new->bare_jid = g_strdup( full_jid ); |
---|
| 388 | g_hash_table_insert( jd->buddies, new->bare_jid, new ); |
---|
[6a1128d] | 389 | } |
---|
| 390 | |
---|
[0d3f30f] | 391 | if( s ) |
---|
| 392 | { |
---|
| 393 | *s = '/'; |
---|
| 394 | new->full_jid = full_jid; |
---|
| 395 | new->resource = strchr( new->full_jid, '/' ) + 1; |
---|
| 396 | } |
---|
| 397 | else |
---|
| 398 | { |
---|
| 399 | /* Let's waste some more bytes of RAM instead of to make |
---|
[b9f8b87] | 400 | memory management a total disaster here. And it saves |
---|
| 401 | me one g_free() call in this function. :-P */ |
---|
[0d3f30f] | 402 | new->full_jid = full_jid; |
---|
| 403 | } |
---|
[6a1128d] | 404 | |
---|
| 405 | return new; |
---|
| 406 | } |
---|
| 407 | |
---|
[788a1af] | 408 | /* Finds a buddy from our structures. Can find both full- and bare JIDs. When |
---|
| 409 | asked for a bare JID, it uses the "resource_select" setting to see which |
---|
| 410 | resource to pick. */ |
---|
[0da65d5] | 411 | struct jabber_buddy *jabber_buddy_by_jid( struct im_connection *ic, char *jid_, get_buddy_flags_t flags ) |
---|
[6a1128d] | 412 | { |
---|
[0da65d5] | 413 | struct jabber_data *jd = ic->proto_data; |
---|
[6a1128d] | 414 | struct jabber_buddy *bud; |
---|
[0d3f30f] | 415 | char *s, *jid; |
---|
| 416 | |
---|
| 417 | jid = jabber_normalize( jid_ ); |
---|
[6a1128d] | 418 | |
---|
| 419 | if( ( s = strchr( jid, '/' ) ) ) |
---|
| 420 | { |
---|
[98de2cc] | 421 | int bare_exists = 0; |
---|
[e35d1a1] | 422 | |
---|
[6a1128d] | 423 | *s = 0; |
---|
| 424 | if( ( bud = g_hash_table_lookup( jd->buddies, jid ) ) ) |
---|
[0d3f30f] | 425 | { |
---|
[0adce21] | 426 | /* Just return the first one for this bare JID. */ |
---|
| 427 | if( flags & GET_BUDDY_FIRST ) |
---|
| 428 | { |
---|
| 429 | *s = '/'; |
---|
| 430 | g_free( jid ); |
---|
| 431 | return bud; |
---|
| 432 | } |
---|
| 433 | |
---|
[0d3f30f] | 434 | /* Is this one of those no-resource buddies? */ |
---|
| 435 | if( bud->resource == NULL ) |
---|
| 436 | { |
---|
[0adce21] | 437 | *s = '/'; |
---|
[16b5f86] | 438 | g_free( jid ); |
---|
| 439 | return NULL; |
---|
[0d3f30f] | 440 | } |
---|
[0adce21] | 441 | |
---|
| 442 | /* See if there's an exact match. */ |
---|
| 443 | for( ; bud; bud = bud->next ) |
---|
[98de2cc] | 444 | if( strcmp( bud->resource, s + 1 ) == 0 ) |
---|
[0adce21] | 445 | break; |
---|
[0d3f30f] | 446 | } |
---|
[e35d1a1] | 447 | else |
---|
| 448 | { |
---|
[98de2cc] | 449 | /* This variable tells the if down here that the bare |
---|
| 450 | JID already exists and we should feel free to add |
---|
| 451 | more resources, if the caller asked for that. */ |
---|
| 452 | bare_exists = 1; |
---|
[e35d1a1] | 453 | } |
---|
[0d3f30f] | 454 | |
---|
[98de2cc] | 455 | if( bud == NULL && ( flags & GET_BUDDY_CREAT ) && |
---|
| 456 | ( !bare_exists || imcb_find_buddy( ic, jid ) ) ) |
---|
[16b5f86] | 457 | { |
---|
| 458 | *s = '/'; |
---|
[0da65d5] | 459 | bud = jabber_buddy_add( ic, jid ); |
---|
[16b5f86] | 460 | } |
---|
[0d3f30f] | 461 | |
---|
| 462 | g_free( jid ); |
---|
| 463 | return bud; |
---|
[6a1128d] | 464 | } |
---|
| 465 | else |
---|
| 466 | { |
---|
[a21a8ac] | 467 | struct jabber_buddy *best_prio, *best_time; |
---|
| 468 | char *set; |
---|
| 469 | |
---|
[0d3f30f] | 470 | bud = g_hash_table_lookup( jd->buddies, jid ); |
---|
| 471 | |
---|
| 472 | g_free( jid ); |
---|
| 473 | |
---|
| 474 | if( bud == NULL ) |
---|
[16b5f86] | 475 | /* No match. Create it now? */ |
---|
[f0cb961] | 476 | return ( ( flags & GET_BUDDY_CREAT ) && imcb_find_buddy( ic, jid_ ) ) ? |
---|
[0da65d5] | 477 | jabber_buddy_add( ic, jid_ ) : NULL; |
---|
[16b5f86] | 478 | else if( bud->resource && ( flags & GET_BUDDY_EXACT ) ) |
---|
| 479 | /* We want an exact match, so in thise case there shouldn't be a /resource. */ |
---|
| 480 | return NULL; |
---|
[98de2cc] | 481 | else if( bud->resource == NULL || bud->next == NULL ) |
---|
[16b5f86] | 482 | /* No need for selection if there's only one option. */ |
---|
[0d3f30f] | 483 | return bud; |
---|
[0adce21] | 484 | else if( flags & GET_BUDDY_FIRST ) |
---|
| 485 | /* Looks like the caller doesn't care about details. */ |
---|
| 486 | return bud; |
---|
[0d3f30f] | 487 | |
---|
| 488 | best_prio = best_time = bud; |
---|
[a21a8ac] | 489 | for( ; bud; bud = bud->next ) |
---|
| 490 | { |
---|
| 491 | if( bud->priority > best_prio->priority ) |
---|
| 492 | best_prio = bud; |
---|
| 493 | if( bud->last_act > best_time->last_act ) |
---|
| 494 | best_time = bud; |
---|
| 495 | } |
---|
| 496 | |
---|
[0da65d5] | 497 | if( ( set = set_getstr( &ic->acc->set, "resource_select" ) ) == NULL ) |
---|
[a21a8ac] | 498 | return NULL; |
---|
| 499 | else if( strcmp( set, "activity" ) == 0 ) |
---|
| 500 | return best_time; |
---|
| 501 | else /* if( strcmp( set, "priority" ) == 0 ) */ |
---|
| 502 | return best_prio; |
---|
[6a1128d] | 503 | } |
---|
| 504 | } |
---|
| 505 | |
---|
[b9f8b87] | 506 | /* I'm keeping a separate ext_jid attribute to save a JID that makes sense |
---|
| 507 | to export to BitlBee. This is mainly for groupchats right now. It's |
---|
| 508 | a bit of a hack, but I just think having the user nickname in the hostname |
---|
| 509 | part of the hostmask doesn't look nice on IRC. Normally you can convert |
---|
| 510 | a normal JID to ext_jid by swapping the part before and after the / and |
---|
| 511 | replacing the / with a =. But there should be some stripping (@s are |
---|
| 512 | allowed in Jabber nicks...). */ |
---|
| 513 | struct jabber_buddy *jabber_buddy_by_ext_jid( struct im_connection *ic, char *jid_, get_buddy_flags_t flags ) |
---|
| 514 | { |
---|
| 515 | struct jabber_buddy *bud; |
---|
| 516 | char *s, *jid; |
---|
| 517 | |
---|
| 518 | jid = jabber_normalize( jid_ ); |
---|
| 519 | |
---|
| 520 | if( ( s = strchr( jid, '=' ) ) == NULL ) |
---|
| 521 | return NULL; |
---|
| 522 | |
---|
| 523 | for( bud = jabber_buddy_by_jid( ic, s + 1, GET_BUDDY_FIRST ); bud; bud = bud->next ) |
---|
| 524 | { |
---|
| 525 | /* Hmmm, could happen if not all people in the chat are anonymized? */ |
---|
| 526 | if( bud->ext_jid == NULL ) |
---|
| 527 | continue; |
---|
| 528 | |
---|
| 529 | if( strcmp( bud->ext_jid, jid ) == 0 ) |
---|
| 530 | break; |
---|
| 531 | } |
---|
| 532 | |
---|
| 533 | g_free( jid ); |
---|
| 534 | |
---|
| 535 | return bud; |
---|
| 536 | } |
---|
| 537 | |
---|
[788a1af] | 538 | /* Remove one specific full JID from our list. Use this when a buddy goes |
---|
[0d3f30f] | 539 | off-line (because (s)he can still be online from a different location. |
---|
| 540 | XXX: See above, we should accept bare JIDs too... */ |
---|
[0da65d5] | 541 | int jabber_buddy_remove( struct im_connection *ic, char *full_jid_ ) |
---|
[6a1128d] | 542 | { |
---|
[0da65d5] | 543 | struct jabber_data *jd = ic->proto_data; |
---|
[6a1128d] | 544 | struct jabber_buddy *bud, *prev, *bi; |
---|
[0d3f30f] | 545 | char *s, *full_jid; |
---|
[6a1128d] | 546 | |
---|
[0d3f30f] | 547 | full_jid = jabber_normalize( full_jid_ ); |
---|
| 548 | |
---|
| 549 | if( ( s = strchr( full_jid, '/' ) ) ) |
---|
| 550 | *s = 0; |
---|
[6a1128d] | 551 | |
---|
| 552 | if( ( bud = g_hash_table_lookup( jd->buddies, full_jid ) ) ) |
---|
| 553 | { |
---|
| 554 | /* If there's only one item in the list (and if the resource |
---|
| 555 | matches), removing it is simple. (And the hash reference |
---|
| 556 | should be removed too!) */ |
---|
[3e6764a] | 557 | if( bud->next == NULL && |
---|
| 558 | ( ( s == NULL && bud->resource == NULL ) || |
---|
[98de2cc] | 559 | ( bud->resource && s && strcmp( bud->resource, s + 1 ) == 0 ) ) ) |
---|
[6a1128d] | 560 | { |
---|
[0d3f30f] | 561 | g_hash_table_remove( jd->buddies, bud->bare_jid ); |
---|
| 562 | g_free( bud->bare_jid ); |
---|
[6286f80] | 563 | g_free( bud->ext_jid ); |
---|
[a21a8ac] | 564 | g_free( bud->full_jid ); |
---|
[6a1128d] | 565 | g_free( bud->away_message ); |
---|
| 566 | g_free( bud ); |
---|
[0d3f30f] | 567 | |
---|
| 568 | g_free( full_jid ); |
---|
| 569 | |
---|
| 570 | return 1; |
---|
| 571 | } |
---|
| 572 | else if( s == NULL || bud->resource == NULL ) |
---|
| 573 | { |
---|
| 574 | /* Tried to remove a bare JID while this JID does seem |
---|
| 575 | to have resources... (Or the opposite.) *sigh* */ |
---|
| 576 | g_free( full_jid ); |
---|
| 577 | return 0; |
---|
[6a1128d] | 578 | } |
---|
| 579 | else |
---|
| 580 | { |
---|
| 581 | for( bi = bud, prev = NULL; bi; bi = (prev=bi)->next ) |
---|
[98de2cc] | 582 | if( strcmp( bi->resource, s + 1 ) == 0 ) |
---|
[6a1128d] | 583 | break; |
---|
| 584 | |
---|
[0d3f30f] | 585 | g_free( full_jid ); |
---|
| 586 | |
---|
[6a1128d] | 587 | if( bi ) |
---|
| 588 | { |
---|
| 589 | if( prev ) |
---|
| 590 | prev->next = bi->next; |
---|
| 591 | else |
---|
| 592 | /* The hash table should point at the second |
---|
| 593 | item, because we're removing the first. */ |
---|
[0d3f30f] | 594 | g_hash_table_replace( jd->buddies, bi->bare_jid, bi->next ); |
---|
[6a1128d] | 595 | |
---|
[6286f80] | 596 | g_free( bi->ext_jid ); |
---|
[a21a8ac] | 597 | g_free( bi->full_jid ); |
---|
[6a1128d] | 598 | g_free( bi->away_message ); |
---|
| 599 | g_free( bi ); |
---|
[0d3f30f] | 600 | |
---|
| 601 | return 1; |
---|
[6a1128d] | 602 | } |
---|
| 603 | else |
---|
| 604 | { |
---|
| 605 | return 0; |
---|
| 606 | } |
---|
| 607 | } |
---|
| 608 | } |
---|
| 609 | else |
---|
| 610 | { |
---|
[0d3f30f] | 611 | g_free( full_jid ); |
---|
[6a1128d] | 612 | return 0; |
---|
| 613 | } |
---|
| 614 | } |
---|
[788a1af] | 615 | |
---|
| 616 | /* Remove a buddy completely; removes all resources that belong to the |
---|
| 617 | specified bare JID. Use this when removing someone from the contact |
---|
| 618 | list, for example. */ |
---|
[9da0bbf] | 619 | int jabber_buddy_remove_bare( struct im_connection *ic, char *bare_jid ) |
---|
[788a1af] | 620 | { |
---|
[0da65d5] | 621 | struct jabber_data *jd = ic->proto_data; |
---|
[788a1af] | 622 | struct jabber_buddy *bud, *next; |
---|
| 623 | |
---|
[9da0bbf] | 624 | if( strchr( bare_jid, '/' ) ) |
---|
[788a1af] | 625 | return 0; |
---|
| 626 | |
---|
[9da0bbf] | 627 | if( ( bud = jabber_buddy_by_jid( ic, bare_jid, GET_BUDDY_FIRST ) ) ) |
---|
[788a1af] | 628 | { |
---|
| 629 | /* Most important: Remove the hash reference. We don't know |
---|
| 630 | this buddy anymore. */ |
---|
[0d3f30f] | 631 | g_hash_table_remove( jd->buddies, bud->bare_jid ); |
---|
[9da0bbf] | 632 | g_free( bud->bare_jid ); |
---|
[788a1af] | 633 | |
---|
| 634 | /* Deallocate the linked list of resources. */ |
---|
| 635 | while( bud ) |
---|
| 636 | { |
---|
[9da0bbf] | 637 | /* ext_jid && anonymous means that this buddy is |
---|
| 638 | specific to one groupchat (the one we're |
---|
| 639 | currently cleaning up) so it can be deleted |
---|
| 640 | completely. */ |
---|
| 641 | if( bud->ext_jid && bud->flags & JBFLAG_IS_ANONYMOUS ) |
---|
| 642 | imcb_remove_buddy( ic, bud->ext_jid, NULL ); |
---|
| 643 | |
---|
[788a1af] | 644 | next = bud->next; |
---|
[6286f80] | 645 | g_free( bud->ext_jid ); |
---|
[788a1af] | 646 | g_free( bud->full_jid ); |
---|
| 647 | g_free( bud->away_message ); |
---|
| 648 | g_free( bud ); |
---|
| 649 | bud = next; |
---|
| 650 | } |
---|
| 651 | |
---|
| 652 | return 1; |
---|
| 653 | } |
---|
| 654 | else |
---|
| 655 | { |
---|
| 656 | return 0; |
---|
| 657 | } |
---|
| 658 | } |
---|
[e35d1a1] | 659 | |
---|
[43671b9] | 660 | time_t jabber_get_timestamp( struct xt_node *xt ) |
---|
| 661 | { |
---|
| 662 | struct tm tp, utc; |
---|
| 663 | struct xt_node *c; |
---|
| 664 | time_t res, tres; |
---|
| 665 | char *s = NULL; |
---|
| 666 | |
---|
| 667 | for( c = xt->children; ( c = xt_find_node( c, "x" ) ); c = c->next ) |
---|
| 668 | { |
---|
| 669 | if( ( s = xt_find_attr( c, "xmlns" ) ) && strcmp( s, XMLNS_DELAY ) == 0 ) |
---|
| 670 | break; |
---|
| 671 | } |
---|
| 672 | |
---|
| 673 | if( !c || !( s = xt_find_attr( c, "stamp" ) ) ) |
---|
| 674 | return 0; |
---|
| 675 | |
---|
| 676 | memset( &tp, 0, sizeof( tp ) ); |
---|
| 677 | if( sscanf( s, "%4d%2d%2dT%2d:%2d:%2d", &tp.tm_year, &tp.tm_mon, &tp.tm_mday, |
---|
| 678 | &tp.tm_hour, &tp.tm_min, &tp.tm_sec ) != 6 ) |
---|
| 679 | return 0; |
---|
| 680 | |
---|
| 681 | tp.tm_year -= 1900; |
---|
| 682 | tp.tm_mon --; |
---|
| 683 | tp.tm_isdst = -1; /* GRRRRRRRRRRR */ |
---|
| 684 | |
---|
| 685 | res = mktime( &tp ); |
---|
| 686 | /* Problem is, mktime() just gave us the GMT timestamp for the |
---|
| 687 | given local time... While the given time WAS NOT local. So |
---|
| 688 | we should fix this now. |
---|
| 689 | |
---|
| 690 | Now I could choose between messing with environment variables |
---|
| 691 | (kludgy) or using timegm() (not portable)... Or doing the |
---|
| 692 | following, which I actually prefer... */ |
---|
| 693 | gmtime_r( &res, &utc ); |
---|
| 694 | utc.tm_isdst = -1; /* Once more: GRRRRRRRRRRRRRRRRRR!!! */ |
---|
| 695 | if( utc.tm_hour == tp.tm_hour && utc.tm_min == tp.tm_min ) |
---|
| 696 | /* Sweet! We're in UTC right now... */ |
---|
| 697 | return res; |
---|
| 698 | |
---|
| 699 | tres = mktime( &utc ); |
---|
| 700 | res += res - tres; |
---|
| 701 | |
---|
| 702 | /* Yes, this is a hack. And it will go wrong around DST changes. |
---|
| 703 | BUT this is more likely to be threadsafe than messing with |
---|
| 704 | environment variables, and possibly more portable... */ |
---|
| 705 | |
---|
| 706 | return res; |
---|
| 707 | } |
---|
[1baaef8] | 708 | |
---|
| 709 | struct jabber_error *jabber_error_parse( struct xt_node *node, char *xmlns ) |
---|
| 710 | { |
---|
[5bd21df] | 711 | struct jabber_error *err; |
---|
[1baaef8] | 712 | struct xt_node *c; |
---|
| 713 | char *s; |
---|
| 714 | |
---|
[5bd21df] | 715 | if( node == NULL ) |
---|
| 716 | return NULL; |
---|
| 717 | |
---|
| 718 | err = g_new0( struct jabber_error, 1 ); |
---|
[1baaef8] | 719 | err->type = xt_find_attr( node, "type" ); |
---|
| 720 | |
---|
| 721 | for( c = node->children; c; c = c->next ) |
---|
| 722 | { |
---|
| 723 | if( !( s = xt_find_attr( c, "xmlns" ) ) || |
---|
| 724 | strcmp( s, xmlns ) != 0 ) |
---|
| 725 | continue; |
---|
| 726 | |
---|
| 727 | if( strcmp( c->name, "text" ) != 0 ) |
---|
| 728 | { |
---|
| 729 | err->code = c->name; |
---|
| 730 | } |
---|
| 731 | /* Only use the text if it doesn't have an xml:lang attribute, |
---|
| 732 | if it's empty or if it's set to something English. */ |
---|
| 733 | else if( !( s = xt_find_attr( c, "xml:lang" ) ) || |
---|
| 734 | !*s || strncmp( s, "en", 2 ) == 0 ) |
---|
| 735 | { |
---|
| 736 | err->text = c->text; |
---|
| 737 | } |
---|
| 738 | } |
---|
| 739 | |
---|
| 740 | return err; |
---|
| 741 | } |
---|
| 742 | |
---|
| 743 | void jabber_error_free( struct jabber_error *err ) |
---|
| 744 | { |
---|
| 745 | g_free( err ); |
---|
| 746 | } |
---|