-/* WHOHandler.c - NeonServ v5.1
+/* WHOHandler.c - NeonServ v5.2
* Copyright (C) 2011 Philipp Kreil (pk910)
*
* This program is free software: you can redistribute it and/or modify
#define WHOQUEUETYPE_CHECKTYPE 0x07
#define WHOQUEUETYPE_FOUND 0x08
+#define MAXCALLBACKS 3
+
struct WHOQueueEntry {
char type;
- struct ClientSocket *client;
struct ChanNode *chan;
struct UserNode *user;
struct WHOQueueEntry *next;
- void *callback;
- void *data;
+ void *callback[MAXCALLBACKS];
+ void *data[MAXCALLBACKS];
};
-
-static struct WHOQueueEntry *first_entry = NULL, *last_entry = NULL;
-
static struct WHOQueueEntry* addWHOQueueEntry(struct ClientSocket *client) {
struct WHOQueueEntry *entry = malloc(sizeof(*entry));
if (!entry)
return NULL;
}
entry->next = NULL;
- entry->client = client;
- if(last_entry) {
- last_entry->next = entry;
- last_entry = entry;
+ if(client->whoqueue_last) {
+ client->whoqueue_last->next = entry;
} else {
- last_entry = entry;
- first_entry = entry;
+ client->whoqueue_first = entry;
}
+ client->whoqueue_last = entry;
return entry;
}
static struct WHOQueueEntry* getNextWHOQueueEntry(struct ClientSocket *client, int freeEntry) {
- if(!first_entry) return NULL;
- struct WHOQueueEntry *entry;
- for(entry = first_entry; entry; entry = entry->next) {
- if(entry->client == client)
- break;
- }
- if(entry == NULL) return NULL;
+ if(!client->whoqueue_first) return NULL;
+ struct WHOQueueEntry *entry = client->whoqueue_first;
if(freeEntry) {
- if(entry == first_entry)
- first_entry = entry->next;
- if(entry == last_entry) {
- struct WHOQueueEntry *last = NULL;
- for(last = first_entry; last; last = last->next)
- if(last->next == NULL) break;
- last_entry = last;
+ client->whoqueue_first = entry->next;
+ if(entry == client->whoqueue_last) {
+ client->whoqueue_last = NULL;
}
}
return entry;
}
+void clear_whoqueue(struct ClientSocket *client) {
+ if(!client->whoqueue_first) return;
+ struct WHOQueueEntry *entry, *next;
+ for(entry = client->whoqueue_first; entry; entry = next) {
+ next = entry->next;
+ free(entry);
+ }
+ client->whoqueue_last = NULL;
+}
+
void get_userlist(struct ChanNode *chan, userlist_callback_t callback, void *data) {
struct ClientSocket *bot;
for(bot = getBots(SOCKET_FLAG_READY, NULL); bot; bot = getBots(SOCKET_FLAG_READY, bot)) {
struct WHOQueueEntry* entry = addWHOQueueEntry(bot);
entry->type = WHOQUEUETYPE_ISONQUEUE | WHOQUEUETYPE_USERLIST;
entry->chan = chan;
- entry->callback = callback;
- entry->data = data;
+ entry->callback[0] = callback;
+ int i;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->callback[i] = NULL;
+ entry->data[0] = data;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->data[i] = NULL;
putsock(bot, "WHO %s,%d %%tuhnaf,%d", chan->name, entry->type, entry->type);
} else
callback(bot, chan, data);
struct WHOQueueEntry* entry = addWHOQueueEntry(bot);
entry->type = WHOQUEUETYPE_ISONQUEUE | WHOQUEUETYPE_USERLIST;
entry->chan = chan;
- entry->callback = callback;
- entry->data = data;
+ entry->callback[0] = callback;
+ int i;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->callback[i] = NULL;
+ entry->data[0] = data;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->data[i] = NULL;
putsock(bot, "WHO %s,%d d%%tuhnaf,%d", chan->name, entry->type, entry->type);
} else
callback(bot, chan, data);
}
void get_userauth(struct UserNode *user, userauth_callback_t callback, void *data) {
- struct ClientSocket *bot;
+ //check if we have already an active WHO for this user
+ struct ClientSocket *bot, *whobot = NULL;
+ struct WHOQueueEntry *entry;
for(bot = getBots(SOCKET_FLAG_READY, NULL); bot; bot = getBots(SOCKET_FLAG_READY, bot)) {
+ for(entry = bot->whoqueue_first; entry; entry = entry->next) {
+ if((entry->type & WHOQUEUETYPE_USERAUTH) && entry->user == user) {
+ int i = 0;
+ for(i = 1; i < MAXCALLBACKS; i++) {
+ if(!entry->callback[i]) {
+ entry->callback[i] = callback;
+ entry->data[i] = data;
+ return;
+ }
+ }
+ }
+ }
if(bot->flags & SOCKET_FLAG_PREFERRED)
- break;
+ whobot = bot;
}
+ bot = whobot;
if(bot == NULL) bot = getBots(SOCKET_FLAG_READY, NULL);
//check if we really need to who the user
if((user->flags & (USERFLAG_ISAUTHED | USERFLAG_ISIRCOP | USERFLAG_ISBOT | USERFLAG_ISSERVER)) || (time(0) - user->last_who) <= REWHO_TIMEOUT) {
callback(bot, user->nick, user, data);
return;
}
- struct WHOQueueEntry* entry = addWHOQueueEntry(bot);
+ entry = addWHOQueueEntry(bot);
entry->type = WHOQUEUETYPE_ISONQUEUE | WHOQUEUETYPE_USERAUTH;
entry->user = user;
- entry->callback = callback;
- entry->data = data;
+ entry->callback[0] = callback;
+ int i;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->callback[i] = NULL;
+ entry->data[0] = data;
+ for(i = 1; i < MAXCALLBACKS; i++)
+ entry->data[i] = NULL;
//WHO ".$user->getNick().",".$id." %tuhna,".$id
putsock(bot, "WHO %s,%d %%tuhna,%d", user->nick, entry->type, entry->type);
}
case '@':
chanuserflags |= CHANUSERFLAG_OPPED;
break;
+ case '%':
+ chanuserflags |= CHANUSERFLAG_HALFOPPED;
+ break;
case '+':
chanuserflags |= CHANUSERFLAG_VOICED;
break;
}
}
- struct UserNode *user;
- if(chanuserflags & CHANUSERFLAG_INVISIBLE) {
+ struct UserNode *user = getUserByNick(argv[4]);
+ struct ChanUser *chanuser;
+ if((chanuserflags & CHANUSERFLAG_INVISIBLE) && (!user || !isBot(user))) {
user = createTempUser(argv[4]);
user->flags |= USERFLAG_ISTMPUSER;
chan->flags |= CHANFLAG_HAVE_INVISIBLES;
- struct ChanUser *chanuser = addInvisibleChanUser(chan, user);
+ chanuser = addInvisibleChanUser(chan, user);
chanuser->flags = (chanuser->flags & ~CHANUSERFLAG_OPPED_OR_VOICED) | chanuserflags;
} else {
- user = getUserByNick(argv[4]);
if(user == NULL) {
user = addUser(argv[4]);
}
- if(!isUserOnChan(user, chan)) {
- struct ChanUser *chanuser = addChanUser(chan, user);
- chanuser->flags = (chanuser->flags & ~CHANUSERFLAG_OPPED_OR_VOICED) | chanuserflags;
+ if(!(chanuser = getChanUser(user, chan))) {
+ chanuser = addChanUser(chan, user);
}
+ chanuser->flags = (chanuser->flags & ~(CHANUSERFLAG_OPPED_OR_VOICED | CHANUSERFLAG_INVISIBLE)) | chanuserflags;
}
user->flags = (user->flags & ~USERFLAG_ISIRCOP) | userflags;
user->last_who = time(0);
strcpy(entry->user->auth, argv[5]);
entry->user->flags |= USERFLAG_ISAUTHED;
}
- userauth_callback_t *callback = entry->callback;
- callback(client, entry->user->nick, entry->user, entry->data);
+ for(i = 0; i < MAXCALLBACKS; i++) {
+ userauth_callback_t *callback = entry->callback[i];
+ if(!callback) break;
+ callback(client, entry->user->nick, entry->user, entry->data[i]);
+ }
}
}
void recv_whohandler_315(struct ClientSocket *client, char **argv, unsigned int argc) {
if(argc < 2) return;
- char *typestr = strstr(argv[1], ",") + 1;
+ char *typestr = strstr(argv[1], ",");
if(!typestr) return;
+ typestr++;
int type = atoi(typestr);
if(!(type & WHOQUEUETYPE_ISONQUEUE)) return;
struct WHOQueueEntry* entry = getNextWHOQueueEntry(client, 1);
if(type & WHOQUEUETYPE_USERLIST) {
//:OGN2.OnlineGamesNet.net 315 skynet #pk910,1 :End of /WHO list.
entry->chan->flags |= CHANFLAG_RECEIVED_USERLIST;
- userlist_callback_t *callback = entry->callback;
- callback(client, entry->chan, entry->data);
+ userlist_callback_t *callback;
+ int i;
+ for(i = 0; i < MAXCALLBACKS; i++) {
+ callback = entry->callback[i];
+ if(!callback) break;
+ callback(client, entry->chan, entry->data[i]);
+ }
if(entry->chan->flags & CHANFLAG_HAVE_INVISIBLES) {
//remove all invisible users again
struct ChanUser *chanuser, *next;
for(chanuser = getChannelUsers(entry->chan, NULL); chanuser; chanuser = next) {
next = getChannelUsers(entry->chan, chanuser);
- if(chanuser->flags & CHANUSERFLAG_INVISIBLE) {
+ if((chanuser->flags & CHANUSERFLAG_INVISIBLE) && !isBot(chanuser->user)) {
delChanUser(chanuser, 1);
}
}
}
} else if(type & WHOQUEUETYPE_USERAUTH) {
if(!(entry->type & WHOQUEUETYPE_FOUND)) {
- userauth_callback_t *callback = entry->callback;
- callback(client, entry->user->nick, NULL, entry->data);
+ userauth_callback_t *callback;
+ int i;
+ for(i = 0; i < MAXCALLBACKS; i++) {
+ callback = entry->callback[i];
+ if(!callback) break;
+ callback(client, entry->user->nick, NULL, entry->data[i]);
+ }
}
}
free(entry);
}
void free_whoqueue() {
- struct WHOQueueEntry *entry, *next;
- for(entry = first_entry; entry; entry = next) {
- next = entry->next;
- free(entry);
- }
- first_entry = NULL;
- last_entry = NULL;
+
}