1 /* UserNode.c - NeonServ v5.2
2 * Copyright (C) 2011 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 static struct UserNode **userList;
23 void init_UserNode() {
24 userList = calloc(VALID_NICK_CHARS_FIRST_LEN+1, sizeof(*userList));
27 void free_UserNode() {
28 //kamikaze free all users
29 //chanusers will be destroyed in free_ChanNode()
31 struct UserNode *user, *next;
32 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
33 for(user = userList[i]; user; user = next) {
41 int is_valid_nick(const char *nick) {
43 //first char must be one of: a-zA-Z{|}~[\]^_`
44 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
46 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
47 for (i = 0; nick[i]; ++i)
48 if (!strchr(VALID_NICK_CHARS, nick[i]))
50 if (strlen(nick) > NICKLEN)
55 static int get_nicklist_entry(int nick) {
57 char *valid_chars = VALID_NICK_CHARS_FIRST;
58 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
59 if(valid_chars[i] == nick)
65 struct UserNode* getUserByNick(const char *nick) { //case sensitive
66 int userListIndex = get_nicklist_entry(*nick);
67 if(userListIndex == -1 || userList[userListIndex] == NULL)
69 struct UserNode *user;
70 for(user = userList[userListIndex]; user; user = user->next) {
71 if(!stricmp(nick, user->nick))
77 struct UserNode* getUserByMask(const char *mask) { //case sensitive
78 char cmask[strlen(mask)+1];
81 struct UserNode *user = NULL;
82 for(i = 0; i < strlen(mask); i++) {
85 user = getUserByNick(&cmask[0]);
87 } else if(cmask[i] == '.') {
95 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
97 return getUserByNick(nick);
100 struct UserNode *user;
102 //search in the lower case "section"
103 userListIndex = get_nicklist_entry(tolower(*nick));
104 if(userListIndex != -1 && userList[userListIndex] != NULL) {
105 for(user = userList[userListIndex]; user; user = user->next) {
106 if(!stricmp(nick, user->nick))
110 //search in the upper case "section"
111 userListIndex = get_nicklist_entry(toupper(*nick));
112 if(userListIndex != -1 && userList[userListIndex] != NULL) {
113 for(user = userList[userListIndex]; user; user = user->next) {
114 if(!stricmp(nick, user->nick))
121 int countUsersWithHost(char *host) {
123 struct UserNode *user;
124 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
125 for(user = userList[i]; user; user = user->next) {
126 if(!strcmp(user->host, host)) {
134 char *getAuthFakehost(char *auth) {
136 struct UserNode *user;
137 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
138 for(user = userList[i]; user; user = user->next) {
139 if((user->flags & USERFLAG_ISAUTHED) && !strcmp(user->auth, auth) && isFakeHost(user->host)) {
147 struct UserNode* getAllUsers(struct UserNode *last) {
148 if(last == NULL || last->next == NULL) {
153 cindex = get_nicklist_entry(last->nick[0]) + 1;
154 while(userList[cindex] == NULL && cindex <= VALID_NICK_CHARS_FIRST_LEN)
156 if(cindex > VALID_NICK_CHARS_FIRST_LEN) return NULL;
157 return userList[cindex];
164 struct UserNode *user;
165 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
166 for(user = userList[i]; user; user = user->next) {
173 struct UserNode* addUser(const char *nick) {
174 int userListIndex = get_nicklist_entry(*nick);
175 if(userListIndex == -1 || !is_valid_nick(nick))
177 struct UserNode *user = malloc(sizeof(*user));
180 perror("malloc() failed");
183 strcpy(user->nick, nick);
184 user->created = time(0);
187 user->realname[0] = 0;
189 user->channel = NULL;
191 user->next = userList[userListIndex];
192 userList[userListIndex] = user;
196 struct UserNode* addUserMask(const char *mask) {
197 char cmask[strlen(mask)+1];
200 struct UserNode *user = NULL;
201 for(i = 0; i < strlen(mask)+1; i++) {
202 if(cmask[i] == '!') {
204 user = addUser(cmask);
205 if(user == NULL) return NULL;
207 } else if(cmask[i] == '.' && !user) {
210 } else if(cmask[i] == '@') {
211 if(user == NULL) return NULL;
213 strcpy(user->ident, &cmask[ii]);
215 } else if(cmask[i] == '\0') {
216 if(user == NULL) return NULL;
217 strcpy(user->host, &cmask[ii]);
223 struct UserNode* createTempUser(const char *mask) {
224 //note: it could also be a server we have to create a temponary user for...
225 char cmask[strlen(mask)+1];
228 struct UserNode *user = NULL;
229 for(i = 0; i < strlen(mask)+1; i++) {
230 if(cmask[i] == '!') {
232 user = malloc(sizeof(*user));
235 perror("malloc() failed");
238 strcpy(user->nick, cmask);
239 user->created = time(0);
242 user->realname[0] = 0;
244 user->channel = NULL;
247 } else if(cmask[i] == '.' && !user) {
249 user = malloc(sizeof(*user));
252 perror("malloc() failed");
255 strcpy(user->host, cmask);
256 user->created = time(0);
259 user->realname[0] = 0;
260 user->flags = USERFLAG_ISSERVER;
261 user->channel = NULL;
264 } else if(cmask[i] == '@') {
265 if(user == NULL) return NULL;
267 strcpy(user->ident, &cmask[ii]);
269 } else if(cmask[i] == '\0') {
272 user = malloc(sizeof(*user));
275 perror("malloc() failed");
278 strcpy(user->nick, cmask);
279 user->created = time(0);
282 user->realname[0] = 0;
284 user->channel = NULL;
288 strcpy(user->host, &cmask[ii]);
294 int renameUser(struct UserNode* user, const char *new_nick) {
295 if(!is_valid_nick(new_nick))
297 if(user->nick[0] == *new_nick) {
298 strcpy(user->nick, new_nick);
301 //delUser(user, 0); //EPIC FAIL! This deletes the user from the channel Userlist -.-
302 //manually remove the user from the old userList
303 int userListIndex = get_nicklist_entry(user->nick[0]);
304 if(userListIndex != -1) {
305 struct UserNode *cuser, *last_user = NULL;
306 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
309 last_user->next = user->next;
311 userList[userListIndex] = user->next;
317 userListIndex = get_nicklist_entry(*new_nick);
318 strcpy(user->nick, new_nick);
319 user->next = userList[userListIndex];
320 userList[userListIndex] = user;
324 void delUser(struct UserNode* user, int freeUser) {
325 int userListIndex = get_nicklist_entry(user->nick[0]);
326 if(userListIndex == -1) return;
327 struct UserNode *cuser, *last_user = NULL;
328 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
331 last_user->next = user->next;
333 userList[userListIndex] = user->next;
339 struct ChanUser *chanUser, *next;
340 for(chanUser = user->channel; chanUser; chanUser = next) {
341 next = chanUser->next_chan;
342 removeChanUserFromLists(chanUser, 1, 0, freeUser);
351 void clearTempUsers() {
352 int userListIndex = TEMPUSER_LIST_INDEX;
353 struct UserNode *cuser, *last_user = NULL, *next;
354 time_t now = time(0);
355 for(cuser = userList[userListIndex]; cuser; cuser = next) {
357 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
359 last_user->next = cuser->next;
361 userList[userListIndex] = cuser->next;