4 static struct UserNode **userList;
7 userList = calloc(VALID_NICK_CHARS_FIRST_LEN+1, sizeof(*userList));
10 void free_UserNode() {
11 //kamikaze free all users
12 //chanusers will be destroyed in free_ChanNode()
14 struct UserNode *user, *next;
15 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
16 for(user = userList[i]; user; user = next) {
24 int is_valid_nick(const char *nick) {
26 //first char must be one of: a-zA-Z{|}~[\]^_`
27 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
29 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
30 for (i = 0; nick[i]; ++i)
31 if (!strchr(VALID_NICK_CHARS, nick[i]))
33 if (strlen(nick) > NICKLEN)
38 static int get_nicklist_entry(int nick) {
40 char *valid_chars = VALID_NICK_CHARS_FIRST;
41 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
42 if(valid_chars[i] == nick)
48 struct UserNode* getUserByNick(const char *nick) { //case sensitive
49 int userListIndex = get_nicklist_entry(*nick);
50 if(userListIndex == -1 || userList[userListIndex] == NULL)
52 struct UserNode *user;
53 for(user = userList[userListIndex]; user; user = user->next) {
54 if(!stricmp(nick, user->nick))
60 struct UserNode* getUserByMask(const char *mask) { //case sensitive
61 char cmask[strlen(mask)+1];
64 struct UserNode *user = NULL;
65 for(i = 0; i < strlen(mask); i++) {
68 user = getUserByNick(&cmask[0]);
70 } else if(cmask[i] == '.') {
78 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
80 return getUserByNick(nick);
83 struct UserNode *user;
85 //search in the lower case "section"
86 userListIndex = get_nicklist_entry(tolower(*nick));
87 if(userListIndex != -1 && userList[userListIndex] != NULL) {
88 for(user = userList[userListIndex]; user; user = user->next) {
89 if(!stricmp(nick, user->nick))
93 //search in the upper case "section"
94 userListIndex = get_nicklist_entry(toupper(*nick));
95 if(userListIndex != -1 && userList[userListIndex] != NULL) {
96 for(user = userList[userListIndex]; user; user = user->next) {
97 if(!stricmp(nick, user->nick))
104 struct UserNode* addUser(const char *nick) {
105 int userListIndex = get_nicklist_entry(*nick);
106 if(userListIndex == -1 || !is_valid_nick(nick))
108 struct UserNode *user = malloc(sizeof(*user));
111 perror("malloc() failed");
114 strcpy(user->nick, nick);
115 user->created = time(0);
118 user->realname[0] = 0;
120 user->channel = NULL;
121 user->next = userList[userListIndex];
122 userList[userListIndex] = user;
126 struct UserNode* addUserMask(const char *mask) {
127 char cmask[strlen(mask)+1];
130 struct UserNode *user = NULL;
131 for(i = 0; i < strlen(mask)+1; i++) {
132 if(cmask[i] == '!') {
134 user = addUser(cmask);
135 if(user == NULL) return NULL;
137 } else if(cmask[i] == '.' && !user) {
140 } else if(cmask[i] == '@') {
141 if(user == NULL) return NULL;
143 strcpy(user->ident, &cmask[ii]);
145 } else if(cmask[i] == '\0') {
146 if(user == NULL) return NULL;
147 strcpy(user->host, &cmask[ii]);
153 struct UserNode* createTempUser(const char *mask) {
154 //note: it could also be a server we have to create a temponary user for...
155 char cmask[strlen(mask)+1];
158 struct UserNode *user = NULL;
159 for(i = 0; i < strlen(mask)+1; i++) {
160 if(cmask[i] == '!') {
162 user = malloc(sizeof(*user));
165 perror("malloc() failed");
168 strcpy(user->nick, cmask);
169 user->created = time(0);
172 user->realname[0] = 0;
174 user->channel = NULL;
176 } else if(cmask[i] == '.' && !user) {
178 user = malloc(sizeof(*user));
181 perror("malloc() failed");
184 strcpy(user->host, cmask);
185 user->created = time(0);
188 user->realname[0] = 0;
189 user->flags = USERFLAG_ISSERVER;
190 user->channel = NULL;
192 } else if(cmask[i] == '@') {
193 if(user == NULL) return NULL;
195 strcpy(user->ident, &cmask[ii]);
197 } else if(cmask[i] == '\0') {
198 if(user == NULL) return NULL;
199 strcpy(user->host, &cmask[ii]);
205 int renameUser(struct UserNode* user, const char *new_nick) {
206 if(!is_valid_nick(new_nick))
208 if(user->nick[0] == *new_nick) {
209 strcpy(user->nick, new_nick);
212 int userListIndex = get_nicklist_entry(*new_nick);
214 strcpy(user->nick, new_nick);
215 user->next = userList[userListIndex];
216 userList[userListIndex] = user;
220 void delUser(struct UserNode* user, int freeUser) {
221 int userListIndex = get_nicklist_entry(user->nick[0]);
222 if(userListIndex == -1) return;
223 struct UserNode *cuser, *last_user = NULL;
224 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
227 last_user->next = user->next;
229 userList[userListIndex] = user->next;
235 struct ChanUser *chanUser, *next;
236 for(chanUser = user->channel; chanUser; chanUser = next) {
237 next = chanUser->next_chan;
238 removeChanUserFromLists(chanUser, 1, 0, freeUser);
247 void clearTempUsers() {
248 int userListIndex = TEMPUSER_LIST_INDEX;
249 struct UserNode *cuser, *last_user = NULL, *next;
250 time_t now = time(0);
251 for(cuser = userList[userListIndex]; cuser; cuser = next) {
253 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
255 last_user->next = cuser->next;
257 userList[userListIndex] = cuser->next;