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];
148 struct UserNode *user;
149 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
150 for(user = userList[i]; user; user = user->next) {
157 struct UserNode* addUser(const char *nick) {
158 int userListIndex = get_nicklist_entry(*nick);
159 if(userListIndex == -1 || !is_valid_nick(nick))
161 struct UserNode *user = malloc(sizeof(*user));
164 perror("malloc() failed");
167 strcpy(user->nick, nick);
168 user->created = time(0);
171 user->realname[0] = 0;
173 user->channel = NULL;
174 user->next = userList[userListIndex];
175 userList[userListIndex] = user;
179 struct UserNode* addUserMask(const char *mask) {
180 char cmask[strlen(mask)+1];
183 struct UserNode *user = NULL;
184 for(i = 0; i < strlen(mask)+1; i++) {
185 if(cmask[i] == '!') {
187 user = addUser(cmask);
188 if(user == NULL) return NULL;
190 } else if(cmask[i] == '.' && !user) {
193 } else if(cmask[i] == '@') {
194 if(user == NULL) return NULL;
196 strcpy(user->ident, &cmask[ii]);
198 } else if(cmask[i] == '\0') {
199 if(user == NULL) return NULL;
200 strcpy(user->host, &cmask[ii]);
206 struct UserNode* createTempUser(const char *mask) {
207 //note: it could also be a server we have to create a temponary user for...
208 char cmask[strlen(mask)+1];
211 struct UserNode *user = NULL;
212 for(i = 0; i < strlen(mask)+1; i++) {
213 if(cmask[i] == '!') {
215 user = malloc(sizeof(*user));
218 perror("malloc() failed");
221 strcpy(user->nick, cmask);
222 user->created = time(0);
225 user->realname[0] = 0;
227 user->channel = NULL;
229 } else if(cmask[i] == '.' && !user) {
231 user = malloc(sizeof(*user));
234 perror("malloc() failed");
237 strcpy(user->host, cmask);
238 user->created = time(0);
241 user->realname[0] = 0;
242 user->flags = USERFLAG_ISSERVER;
243 user->channel = NULL;
245 } else if(cmask[i] == '@') {
246 if(user == NULL) return NULL;
248 strcpy(user->ident, &cmask[ii]);
250 } else if(cmask[i] == '\0') {
253 user = malloc(sizeof(*user));
256 perror("malloc() failed");
259 strcpy(user->nick, cmask);
260 user->created = time(0);
263 user->realname[0] = 0;
265 user->channel = NULL;
268 strcpy(user->host, &cmask[ii]);
274 int renameUser(struct UserNode* user, const char *new_nick) {
275 if(!is_valid_nick(new_nick))
277 if(user->nick[0] == *new_nick) {
278 strcpy(user->nick, new_nick);
281 int userListIndex = get_nicklist_entry(*new_nick);
283 strcpy(user->nick, new_nick);
284 user->next = userList[userListIndex];
285 userList[userListIndex] = user;
289 void delUser(struct UserNode* user, int freeUser) {
290 int userListIndex = get_nicklist_entry(user->nick[0]);
291 if(userListIndex == -1) return;
292 struct UserNode *cuser, *last_user = NULL;
293 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
296 last_user->next = user->next;
298 userList[userListIndex] = user->next;
304 struct ChanUser *chanUser, *next;
305 for(chanUser = user->channel; chanUser; chanUser = next) {
306 next = chanUser->next_chan;
307 removeChanUserFromLists(chanUser, 1, 0, freeUser);
316 void clearTempUsers() {
317 int userListIndex = TEMPUSER_LIST_INDEX;
318 struct UserNode *cuser, *last_user = NULL, *next;
319 time_t now = time(0);
320 for(cuser = userList[userListIndex]; cuser; cuser = next) {
322 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
324 last_user->next = cuser->next;
326 userList[userListIndex] = cuser->next;