1 /* UserNode.c - NeonServ v5.3
2 * Copyright (C) 2011-2012 Philipp Kreil (pk910)
4 * This program is free software: you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation, either version 3 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program. If not, see <http://www.gnu.org/licenses/>.
21 #include "IRCEvents.h"
24 static struct UserNode **userList;
26 void init_UserNode() {
27 userList = calloc(VALID_NICK_CHARS_FIRST_LEN+1, sizeof(*userList));
30 void free_UserNode() {
31 //kamikaze free all users
32 //chanusers will be destroyed in free_ChanNode()
34 struct UserNode *user, *next;
35 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
36 for(user = userList[i]; user; user = next) {
44 int is_valid_nick(const char *nick) {
46 //first char must be one of: a-zA-Z{|}~[\]^_`
47 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
49 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
50 for (i = 0; nick[i]; ++i)
51 if (!strchr(VALID_NICK_CHARS, nick[i]))
53 if (strlen(nick) > NICKLEN)
58 static int get_nicklist_entry(int nick) {
60 char *valid_chars = VALID_NICK_CHARS_FIRST;
61 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
62 if(valid_chars[i] == nick)
68 struct UserNode* getUserByNick(const char *nick) { //case sensitive
69 int userListIndex = get_nicklist_entry(*nick);
70 if(userListIndex == -1 || userList[userListIndex] == NULL)
72 struct UserNode *user;
73 for(user = userList[userListIndex]; user; user = user->next) {
74 if(!stricmp(nick, user->nick))
80 struct UserNode* getUserByMask(const char *mask) { //case sensitive
81 char cmask[strlen(mask)+1];
84 struct UserNode *user = NULL;
85 for(i = 0; i < strlen(mask); i++) {
88 user = getUserByNick(&cmask[0]);
90 } else if(cmask[i] == '.') {
98 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
100 return getUserByNick(nick);
103 struct UserNode *user;
105 //search in the lower case "section"
106 userListIndex = get_nicklist_entry(tolower(*nick));
107 if(userListIndex != -1 && userList[userListIndex] != NULL) {
108 for(user = userList[userListIndex]; user; user = user->next) {
109 if(!stricmp(nick, user->nick))
113 //search in the upper case "section"
114 userListIndex = get_nicklist_entry(toupper(*nick));
115 if(userListIndex != -1 && userList[userListIndex] != NULL) {
116 for(user = userList[userListIndex]; user; user = user->next) {
117 if(!stricmp(nick, user->nick))
124 int countUsersWithHost(char *host) {
126 struct UserNode *user;
127 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
128 for(user = userList[i]; user; user = user->next) {
129 if(!strcmp(user->host, host)) {
137 char *getAuthFakehost(char *auth) {
139 struct UserNode *user;
140 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
141 for(user = userList[i]; user; user = user->next) {
142 if((user->flags & USERFLAG_ISAUTHED) && !strcmp(user->auth, auth) && isFakeHost(user->host)) {
150 struct UserNode* getAllUsers(struct UserNode *last) {
151 if(last == NULL || last->next == NULL) {
156 cindex = get_nicklist_entry(last->nick[0]) + 1;
157 while(userList[cindex] == NULL && cindex < VALID_NICK_CHARS_FIRST_LEN)
159 if(cindex > VALID_NICK_CHARS_FIRST_LEN) return NULL;
160 return userList[cindex];
165 struct UserNode* getUsersWithAuth(const char *auth, struct UserNode *last) {
166 int cindex = (last ? get_nicklist_entry(last->nick[0]) : 0);
167 struct UserNode *cuser = last;
168 while(cindex <= VALID_NICK_CHARS_FIRST_LEN) {
169 for(cuser = (cuser ? cuser->next : userList[cindex]); cuser; cuser = cuser->next) {
170 if((cuser->flags & USERFLAG_ISAUTHED) && !strcmp(cuser->auth, auth))
181 struct UserNode *user;
182 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
183 for(user = userList[i]; user; user = user->next) {
190 struct UserNode* addUser(const char *nick) {
191 int userListIndex = get_nicklist_entry(*nick);
192 if(userListIndex == -1 || !is_valid_nick(nick))
194 struct UserNode *user = malloc(sizeof(*user));
197 perror("malloc() failed");
200 strcpy(user->nick, nick);
201 user->created = time(0);
205 user->realname[0] = 0;
207 user->channel = NULL;
209 SYNCHRONIZE(cache_sync);
210 user->next = userList[userListIndex];
211 userList[userListIndex] = user;
212 DESYNCHRONIZE(cache_sync);
216 struct UserNode* addUserMask(const char *mask) {
217 char cmask[strlen(mask)+1];
220 struct UserNode *user = NULL;
221 for(i = 0; i < strlen(mask)+1; i++) {
222 if(cmask[i] == '!') {
224 user = addUser(cmask);
225 if(user == NULL) return NULL;
227 } else if(cmask[i] == '.' && !user) {
230 } else if(cmask[i] == '@') {
231 if(user == NULL) return NULL;
233 strcpy(user->ident, &cmask[ii]);
235 } else if(cmask[i] == '\0') {
236 if(user == NULL) return NULL;
237 strcpy(user->host, &cmask[ii]);
243 struct UserNode* createTempUser(const char *nick) {
244 int already_on_list = 0;
245 struct UserNode *user = NULL;
246 if(!is_valid_nick(nick)) {
249 for(user = userList[TEMPUSER_LIST_INDEX]; user; user = user->next) {
250 if(!stricmp(user->nick, nick)) {
256 user = malloc(sizeof(*user));
258 perror("malloc() failed");
264 user->realname[0] = 0;
266 user->channel = NULL;
269 user->flags &= ~USERFLAG_FREETMPUSER;
270 user->created = time(0);
271 if(user->created - user->last_who > REWHO_TIMEOUT)
272 user->flags &= ~USERFLAG_ISAUTHED; //remove authed flag (security reasons)
273 strcpy(user->nick, nick);
274 if(!already_on_list) {
275 SYNCHRONIZE(cache_sync);
276 user->next = userList[TEMPUSER_LIST_INDEX];
277 userList[TEMPUSER_LIST_INDEX] = user;
278 DESYNCHRONIZE(cache_sync);
283 struct UserNode* createTempUserMask(const char *mask) {
284 //note: it could also be a server we have to create a temponary user for...
285 char cmask[strlen(mask)+1];
288 int already_on_list = 0;
289 struct UserNode *user = NULL;
290 for(i = 0; i < strlen(mask)+1; i++) {
291 if(cmask[i] == '!') {
293 if(!is_valid_nick(cmask)) {
296 for(user = userList[TEMPUSER_LIST_INDEX]; user; user = user->next) {
297 if(!stricmp(user->nick, cmask)) {
303 user = malloc(sizeof(*user));
305 perror("malloc() failed");
311 user->realname[0] = 0;
313 user->channel = NULL;
316 user->flags &= ~USERFLAG_FREETMPUSER;
317 user->created = time(0);
318 if(user->created - user->last_who > REWHO_TIMEOUT)
319 user->flags &= ~USERFLAG_ISAUTHED; //remove authed flag (security reasons)
320 strcpy(user->nick, cmask);
322 } else if(cmask[i] == '.' && !user) {
324 user = malloc(sizeof(*user));
327 perror("malloc() failed");
330 strcpy(user->host, cmask);
331 user->created = time(0);
335 user->realname[0] = 0;
336 user->flags = USERFLAG_ISSERVER;
337 user->channel = NULL;
340 } else if(cmask[i] == '@') {
341 if(user == NULL) return NULL;
343 strcpy(user->ident, &cmask[ii]);
345 } else if(cmask[i] == '\0') {
348 user = malloc(sizeof(*user));
351 perror("malloc() failed");
354 strcpy(user->nick, cmask);
355 user->created = time(0);
359 user->realname[0] = 0;
361 user->channel = NULL;
365 strcpy(user->host, &cmask[ii]);
368 if(!already_on_list) {
369 SYNCHRONIZE(cache_sync);
370 user->next = userList[TEMPUSER_LIST_INDEX];
371 userList[TEMPUSER_LIST_INDEX] = user;
372 DESYNCHRONIZE(cache_sync);
377 int renameUser(struct UserNode* user, const char *new_nick) {
378 if(!is_valid_nick(new_nick))
380 if(user->nick[0] == *new_nick) {
381 strcpy(user->nick, new_nick);
384 //delUser(user, 0); //EPIC FAIL! This deletes the user from the channel Userlist -.-
385 //manually remove the user from the old userList
386 SYNCHRONIZE(cache_sync);
387 int userListIndex = get_nicklist_entry(user->nick[0]);
388 if(userListIndex != -1) {
389 struct UserNode *cuser, *last_user = NULL;
390 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
393 last_user->next = user->next;
395 userList[userListIndex] = user->next;
401 userListIndex = get_nicklist_entry(*new_nick);
402 strcpy(user->nick, new_nick);
403 user->next = userList[userListIndex];
404 userList[userListIndex] = user;
405 DESYNCHRONIZE(cache_sync);
409 void delUser(struct UserNode* user, int freeUser) {
410 int userListIndex = ((user->flags & USERFLAG_ISTMPUSER) ? TEMPUSER_LIST_INDEX : get_nicklist_entry(user->nick[0]));
411 if(userListIndex == -1) return;
412 SYNCHRONIZE(cache_sync);
413 event_freeuser(user);
414 struct UserNode *cuser, *last_user = NULL;
415 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
418 last_user->next = user->next;
420 userList[userListIndex] = user->next;
425 if(freeUser && (user->flags & USERFLAG_IS_ON_WHO_QUEUE)) {
426 user->flags |= USERFLAG_FREE_AFTER_WHO;
430 struct ChanUser *chanUser, *next;
431 for(chanUser = user->channel; chanUser; chanUser = next) {
432 next = chanUser->next_chan;
433 removeChanUserFromLists(chanUser, 1, 0, freeUser);
438 freeIPNode(user->ip);
442 DESYNCHRONIZE(cache_sync);
445 void clearTempUsers() {
446 SYNCHRONIZE(cache_sync);
447 int userListIndex = TEMPUSER_LIST_INDEX;
448 struct UserNode *cuser, *next;
449 time_t now = time(0);
450 for(cuser = userList[userListIndex]; cuser; cuser = next) {
452 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
456 DESYNCHRONIZE(cache_sync);