5 static struct UserNode **userList;
8 userList = calloc(VALID_NICK_CHARS_FIRST_LEN+1, sizeof(*userList));
11 void free_UserNode() {
12 //kamikaze free all users
13 //chanusers will be destroyed in free_ChanNode()
15 struct UserNode *user, *next;
16 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
17 for(user = userList[i]; user; user = next) {
25 int is_valid_nick(const char *nick) {
27 //first char must be one of: a-zA-Z{|}~[\]^_`
28 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
30 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
31 for (i = 0; nick[i]; ++i)
32 if (!strchr(VALID_NICK_CHARS, nick[i]))
34 if (strlen(nick) > NICKLEN)
39 static int get_nicklist_entry(int nick) {
41 char *valid_chars = VALID_NICK_CHARS_FIRST;
42 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
43 if(valid_chars[i] == nick)
49 struct UserNode* getUserByNick(const char *nick) { //case sensitive
50 int userListIndex = get_nicklist_entry(*nick);
51 if(userListIndex == -1 || userList[userListIndex] == NULL)
53 struct UserNode *user;
54 for(user = userList[userListIndex]; user; user = user->next) {
55 if(!stricmp(nick, user->nick))
61 struct UserNode* getUserByMask(const char *mask) { //case sensitive
62 char cmask[strlen(mask)+1];
65 struct UserNode *user = NULL;
66 for(i = 0; i < strlen(mask); i++) {
69 user = getUserByNick(&cmask[0]);
71 } else if(cmask[i] == '.') {
79 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
81 return getUserByNick(nick);
84 struct UserNode *user;
86 //search in the lower case "section"
87 userListIndex = get_nicklist_entry(tolower(*nick));
88 if(userListIndex != -1 && userList[userListIndex] != NULL) {
89 for(user = userList[userListIndex]; user; user = user->next) {
90 if(!stricmp(nick, user->nick))
94 //search in the upper case "section"
95 userListIndex = get_nicklist_entry(toupper(*nick));
96 if(userListIndex != -1 && userList[userListIndex] != NULL) {
97 for(user = userList[userListIndex]; user; user = user->next) {
98 if(!stricmp(nick, user->nick))
105 int countUsersWithHost(char *host) {
107 struct UserNode *user;
108 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
109 for(user = userList[i]; user; user = user->next) {
110 if(!strcmp(user->host, host)) {
118 char *getAuthFakehost(char *auth) {
120 struct UserNode *user;
121 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
122 for(user = userList[i]; user; user = user->next) {
123 if((user->flags & USERFLAG_ISAUTHED) && !strcmp(user->auth, auth) && isFakeHost(user->host)) {
131 struct UserNode* getAllUsers(struct UserNode *last) {
132 if(last == NULL || last->next == NULL) {
137 cindex = get_nicklist_entry(last->nick[0]) + 1;
138 while(userList[cindex] == NULL && cindex <= VALID_NICK_CHARS_FIRST_LEN)
140 if(cindex > VALID_NICK_CHARS_FIRST_LEN) return NULL;
141 return userList[cindex];
146 struct UserNode* addUser(const char *nick) {
147 int userListIndex = get_nicklist_entry(*nick);
148 if(userListIndex == -1 || !is_valid_nick(nick))
150 struct UserNode *user = malloc(sizeof(*user));
153 perror("malloc() failed");
156 strcpy(user->nick, nick);
157 user->created = time(0);
160 user->realname[0] = 0;
162 user->channel = NULL;
163 user->next = userList[userListIndex];
164 userList[userListIndex] = user;
168 struct UserNode* addUserMask(const char *mask) {
169 char cmask[strlen(mask)+1];
172 struct UserNode *user = NULL;
173 for(i = 0; i < strlen(mask)+1; i++) {
174 if(cmask[i] == '!') {
176 user = addUser(cmask);
177 if(user == NULL) return NULL;
179 } else if(cmask[i] == '.' && !user) {
182 } else if(cmask[i] == '@') {
183 if(user == NULL) return NULL;
185 strcpy(user->ident, &cmask[ii]);
187 } else if(cmask[i] == '\0') {
188 if(user == NULL) return NULL;
189 strcpy(user->host, &cmask[ii]);
195 struct UserNode* createTempUser(const char *mask) {
196 //note: it could also be a server we have to create a temponary user for...
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 = malloc(sizeof(*user));
207 perror("malloc() failed");
210 strcpy(user->nick, cmask);
211 user->created = time(0);
214 user->realname[0] = 0;
216 user->channel = NULL;
218 } else if(cmask[i] == '.' && !user) {
220 user = malloc(sizeof(*user));
223 perror("malloc() failed");
226 strcpy(user->host, cmask);
227 user->created = time(0);
230 user->realname[0] = 0;
231 user->flags = USERFLAG_ISSERVER;
232 user->channel = NULL;
234 } else if(cmask[i] == '@') {
235 if(user == NULL) return NULL;
237 strcpy(user->ident, &cmask[ii]);
239 } else if(cmask[i] == '\0') {
242 user = malloc(sizeof(*user));
245 perror("malloc() failed");
248 strcpy(user->nick, cmask);
249 user->created = time(0);
252 user->realname[0] = 0;
254 user->channel = NULL;
257 strcpy(user->host, &cmask[ii]);
263 int renameUser(struct UserNode* user, const char *new_nick) {
264 if(!is_valid_nick(new_nick))
266 if(user->nick[0] == *new_nick) {
267 strcpy(user->nick, new_nick);
270 int userListIndex = get_nicklist_entry(*new_nick);
272 strcpy(user->nick, new_nick);
273 user->next = userList[userListIndex];
274 userList[userListIndex] = user;
278 void delUser(struct UserNode* user, int freeUser) {
279 int userListIndex = get_nicklist_entry(user->nick[0]);
280 if(userListIndex == -1) return;
281 struct UserNode *cuser, *last_user = NULL;
282 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
285 last_user->next = user->next;
287 userList[userListIndex] = user->next;
293 struct ChanUser *chanUser, *next;
294 for(chanUser = user->channel; chanUser; chanUser = next) {
295 next = chanUser->next_chan;
296 removeChanUserFromLists(chanUser, 1, 0, freeUser);
305 void clearTempUsers() {
306 int userListIndex = TEMPUSER_LIST_INDEX;
307 struct UserNode *cuser, *last_user = NULL, *next;
308 time_t now = time(0);
309 for(cuser = userList[userListIndex]; cuser; cuser = next) {
311 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
313 last_user->next = cuser->next;
315 userList[userListIndex] = cuser->next;