Mercurial > pidgin
view libpurple/protocols/oscar/util.c @ 27161:7054f810b0f9
Check in code that connects to oscar using clientLogin. This is the
authentication scheme they've publically documented. We still use
the old MD5-style login as the default, but you can optionally try
this out by checking a check box on the advanced tab of your oscar
account.
Functionally everything is supposed to be the same. However, for
some reason users with Mobile IM forwarding turned on don't show
up online and can't be messaged. Not sure why.
Using clientLogin DOES make it easier for AOL to track us. And yes,
it probably makes it easier for AOL to block us, too. But I don't
believe they want to do that. I believe they're trying to keep their
network open, and I think we should appreciate that and try to work
with them. We're not just some small open source project that slips
under the radar unnoticed anymore.
It's good to have options, right?
None of this code was taken from anywhere (outside of libpurple). I
wrote it all from scratch (and took a few bits from other places in
libpurple). I did use the documentation on http://dev.aol.com/aim ,
but I don't believe that affects us from a licensing standpoint in
any way. If you disagree we should talk about it on the devel
mailing list.
author | Mark Doliner <mark@kingant.net> |
---|---|
date | Tue, 23 Jun 2009 18:20:12 +0000 |
parents | 6e1967b0f90b |
children | 4f24d5da4cb3 |
line wrap: on
line source
/* * Purple's oscar protocol plugin * This file is the legal property of its developers. * Please see the AUTHORS file distributed alongside this file. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1301 USA */ /* * A little bit of this * A little bit of that * It started with a kiss * Now we're up to bat */ #include "oscar.h" #include <ctype.h> #ifdef _WIN32 #include "win32dep.h" #endif /* * Tokenizing functions. Used to portably replace strtok/sep. * -- DMP. * */ /* TODO: Get rid of this and use glib functions */ int aimutil_tokslen(char *toSearch, int theindex, char dl) { int curCount = 1; char *next; char *last; int toReturn; last = toSearch; next = strchr(toSearch, dl); while(curCount < theindex && next != NULL) { curCount++; last = next + 1; next = strchr(last, dl); } if ((curCount < theindex) || (next == NULL)) toReturn = strlen(toSearch) - (curCount - 1); else toReturn = next - toSearch - (curCount - 1); return toReturn; } int aimutil_itemcnt(char *toSearch, char dl) { int curCount; char *next; curCount = 1; next = strchr(toSearch, dl); while(next != NULL) { curCount++; next = strchr(next + 1, dl); } return curCount; } char * aimutil_itemindex(char *toSearch, int theindex, char dl) { int curCount; char *next; char *last; char *toReturn; curCount = 0; last = toSearch; next = strchr(toSearch, dl); while (curCount < theindex && next != NULL) { curCount++; last = next + 1; next = strchr(last, dl); } next = strchr(last, dl); if (curCount < theindex) { toReturn = g_malloc(sizeof(char)); *toReturn = '\0'; } else { if (next == NULL) { toReturn = g_malloc((strlen(last) + 1) * sizeof(char)); strcpy(toReturn, last); } else { toReturn = g_malloc((next - last + 1) * sizeof(char)); memcpy(toReturn, last, (next - last)); toReturn[next - last] = '\0'; } } return toReturn; } /** * Calculate the checksum of a given icon. */ guint16 aimutil_iconsum(const guint8 *buf, int buflen) { guint32 sum; int i; for (i=0, sum=0; i+1<buflen; i+=2) sum += (buf[i+1] << 8) + buf[i]; if (i < buflen) sum += buf[i]; sum = ((sum & 0xffff0000) >> 16) + (sum & 0x0000ffff); return sum; } /** * Check if the given name is a valid AIM username. * Example: BobDole * Example: Henry_Ford@mac.com * Example: 1KrazyKat@example.com * * @return TRUE if the name is valid, FALSE if not. */ static gboolean oscar_util_valid_name_aim(const char *name) { int i; if (purple_email_is_valid(name)) return TRUE; /* Normal AIM usernames can't start with a number */ if (isdigit(name[0])) return FALSE; for (i = 0; name[i] != '\0'; i++) { if (!isalnum(name[i]) && (name[i] != ' ')) return FALSE; } return TRUE; } /** * Check if the given name is a valid ICQ username. * Example: 1234567 * * @return TRUE if the name is valid, FALSE if not. */ gboolean oscar_util_valid_name_icq(const char *name) { int i; for (i = 0; name[i] != '\0'; i++) { if (!isdigit(name[i])) return FALSE; } return TRUE; } /** * Check if the given name is a valid SMS username. * Example: +19195551234 * * @return TRUE if the name is valid, FALSE if not. */ gboolean oscar_util_valid_name_sms(const char *name) { int i; if (name[0] != '+') return FALSE; for (i = 1; name[i] != '\0'; i++) { if (!isdigit(name[i])) return FALSE; } return TRUE; } /** * Check if the given name is a valid oscar username. * * @return TRUE if the name is valid, FALSE if not. */ gboolean oscar_util_valid_name(const char *name) { if ((name == NULL) || (*name == '\0')) return FALSE; return oscar_util_valid_name_icq(name) || oscar_util_valid_name_sms(name) || oscar_util_valid_name_aim(name); } /** * This takes two names and compares them using the rules * on usernames for AIM/AOL. Mainly, this means case and space * insensitivity (all case differences and spacing differences are * ignored, with the exception that usernames can not start with * a space). * * @return 0 if equal, non-0 if different */ /* TODO: Do something different for email addresses. */ int oscar_util_name_compare(const char *name1, const char *name2) { if ((name1 == NULL) || (name2 == NULL)) return -1; do { while (*name2 == ' ') name2++; while (*name1 == ' ') name1++; if (toupper(*name1) != toupper(*name2)) return 1; } while ((*name1 != '\0') && name1++ && name2++); return 0; }