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/>.
20 #include "IRCEvents.h"
22 static struct UserNode **userList;
24 void init_UserNode() {
25 userList = calloc(VALID_NICK_CHARS_FIRST_LEN+1, sizeof(*userList));
28 void free_UserNode() {
29 //kamikaze free all users
30 //chanusers will be destroyed in free_ChanNode()
32 struct UserNode *user, *next;
33 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
34 for(user = userList[i]; user; user = next) {
42 int is_valid_nick(const char *nick) {
44 //first char must be one of: a-zA-Z{|}~[\]^_`
45 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
47 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
48 for (i = 0; nick[i]; ++i)
49 if (!strchr(VALID_NICK_CHARS, nick[i]))
51 if (strlen(nick) > NICKLEN)
56 static int get_nicklist_entry(int nick) {
58 char *valid_chars = VALID_NICK_CHARS_FIRST;
59 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
60 if(valid_chars[i] == nick)
66 struct UserNode* getUserByNick(const char *nick) { //case sensitive
67 int userListIndex = get_nicklist_entry(*nick);
68 if(userListIndex == -1 || userList[userListIndex] == NULL)
70 struct UserNode *user;
71 for(user = userList[userListIndex]; user; user = user->next) {
72 if(!stricmp(nick, user->nick))
78 struct UserNode* getUserByMask(const char *mask) { //case sensitive
79 char cmask[strlen(mask)+1];
82 struct UserNode *user = NULL;
83 for(i = 0; i < strlen(mask); i++) {
86 user = getUserByNick(&cmask[0]);
88 } else if(cmask[i] == '.') {
96 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
98 return getUserByNick(nick);
101 struct UserNode *user;
103 //search in the lower case "section"
104 userListIndex = get_nicklist_entry(tolower(*nick));
105 if(userListIndex != -1 && userList[userListIndex] != NULL) {
106 for(user = userList[userListIndex]; user; user = user->next) {
107 if(!stricmp(nick, user->nick))
111 //search in the upper case "section"
112 userListIndex = get_nicklist_entry(toupper(*nick));
113 if(userListIndex != -1 && userList[userListIndex] != NULL) {
114 for(user = userList[userListIndex]; user; user = user->next) {
115 if(!stricmp(nick, user->nick))
122 int countUsersWithHost(char *host) {
124 struct UserNode *user;
125 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
126 for(user = userList[i]; user; user = user->next) {
127 if(!strcmp(user->host, host)) {
135 char *getAuthFakehost(char *auth) {
137 struct UserNode *user;
138 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
139 for(user = userList[i]; user; user = user->next) {
140 if((user->flags & USERFLAG_ISAUTHED) && !strcmp(user->auth, auth) && isFakeHost(user->host)) {
148 struct UserNode* getAllUsers(struct UserNode *last) {
149 if(last == NULL || last->next == NULL) {
154 cindex = get_nicklist_entry(last->nick[0]) + 1;
155 while(userList[cindex] == NULL && cindex <= VALID_NICK_CHARS_FIRST_LEN)
157 if(cindex > VALID_NICK_CHARS_FIRST_LEN) return NULL;
158 return userList[cindex];
163 struct UserNode* getUsersWithAuth(const char *auth, struct UserNode *last) {
164 int cindex = (last ? get_nicklist_entry(last->nick[0]) : 0);
165 struct UserNode *cuser = last;
166 while(cindex <= VALID_NICK_CHARS_FIRST_LEN) {
167 for(cuser = (cuser ? cuser->next : userList[cindex]); cuser; cuser = cuser->next) {
168 if((cuser->flags & USERFLAG_ISAUTHED) && !strcmp(cuser->auth, auth))
179 struct UserNode *user;
180 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
181 for(user = userList[i]; user; user = user->next) {
188 struct UserNode* addUser(const char *nick) {
189 int userListIndex = get_nicklist_entry(*nick);
190 if(userListIndex == -1 || !is_valid_nick(nick))
192 struct UserNode *user = malloc(sizeof(*user));
195 perror("malloc() failed");
198 strcpy(user->nick, nick);
199 user->created = time(0);
202 user->realname[0] = 0;
204 user->channel = NULL;
206 user->next = userList[userListIndex];
207 userList[userListIndex] = user;
211 struct UserNode* addUserMask(const char *mask) {
212 char cmask[strlen(mask)+1];
215 struct UserNode *user = NULL;
216 for(i = 0; i < strlen(mask)+1; i++) {
217 if(cmask[i] == '!') {
219 user = addUser(cmask);
220 if(user == NULL) return NULL;
222 } else if(cmask[i] == '.' && !user) {
225 } else if(cmask[i] == '@') {
226 if(user == NULL) return NULL;
228 strcpy(user->ident, &cmask[ii]);
230 } else if(cmask[i] == '\0') {
231 if(user == NULL) return NULL;
232 strcpy(user->host, &cmask[ii]);
238 struct UserNode* createTempUser(const char *mask) {
239 //note: it could also be a server we have to create a temponary user for...
240 char cmask[strlen(mask)+1];
243 struct UserNode *user = NULL;
244 for(i = 0; i < strlen(mask)+1; i++) {
245 if(cmask[i] == '!') {
247 if(!is_valid_nick(cmask)) {
250 user = malloc(sizeof(*user));
253 perror("malloc() failed");
256 strcpy(user->nick, cmask);
257 user->created = time(0);
260 user->realname[0] = 0;
262 user->channel = NULL;
265 } else if(cmask[i] == '.' && !user) {
267 user = malloc(sizeof(*user));
270 perror("malloc() failed");
273 strcpy(user->host, cmask);
274 user->created = time(0);
277 user->realname[0] = 0;
278 user->flags = USERFLAG_ISSERVER;
279 user->channel = NULL;
282 } else if(cmask[i] == '@') {
283 if(user == NULL) return NULL;
285 strcpy(user->ident, &cmask[ii]);
287 } else if(cmask[i] == '\0') {
290 user = malloc(sizeof(*user));
293 perror("malloc() failed");
296 strcpy(user->nick, cmask);
297 user->created = time(0);
300 user->realname[0] = 0;
302 user->channel = NULL;
306 strcpy(user->host, &cmask[ii]);
312 int renameUser(struct UserNode* user, const char *new_nick) {
313 if(!is_valid_nick(new_nick))
315 if(user->nick[0] == *new_nick) {
316 strcpy(user->nick, new_nick);
319 //delUser(user, 0); //EPIC FAIL! This deletes the user from the channel Userlist -.-
320 //manually remove the user from the old userList
321 int userListIndex = get_nicklist_entry(user->nick[0]);
322 if(userListIndex != -1) {
323 struct UserNode *cuser, *last_user = NULL;
324 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
327 last_user->next = user->next;
329 userList[userListIndex] = user->next;
335 userListIndex = get_nicklist_entry(*new_nick);
336 strcpy(user->nick, new_nick);
337 user->next = userList[userListIndex];
338 userList[userListIndex] = user;
342 void delUser(struct UserNode* user, int freeUser) {
343 int userListIndex = get_nicklist_entry(user->nick[0]);
344 if(userListIndex == -1) return;
345 event_freeuser(user);
346 struct UserNode *cuser, *last_user = NULL;
347 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
350 last_user->next = user->next;
352 userList[userListIndex] = user->next;
357 if(freeUser && (user->flags & USERFLAG_IS_ON_WHO_QUEUE)) {
358 user->flags |= USERFLAG_FREE_AFTER_WHO;
362 struct ChanUser *chanUser, *next;
363 for(chanUser = user->channel; chanUser; chanUser = next) {
364 next = chanUser->next_chan;
365 removeChanUserFromLists(chanUser, 1, 0, freeUser);
374 void clearTempUsers() {
375 int userListIndex = TEMPUSER_LIST_INDEX;
376 struct UserNode *cuser, *last_user = NULL, *next;
377 time_t now = time(0);
378 for(cuser = userList[userListIndex]; cuser; cuser = next) {
380 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
382 last_user->next = cuser->next;
384 userList[userListIndex] = cuser->next;