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 int countUsersWithHost(char *host) {
106 struct UserNode *user;
107 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN+1; i++) {
108 for(user = userList[i]; user; user = user->next) {
109 if(!strcmp(user->host, host)) {
117 struct UserNode* addUser(const char *nick) {
118 int userListIndex = get_nicklist_entry(*nick);
119 if(userListIndex == -1 || !is_valid_nick(nick))
121 struct UserNode *user = malloc(sizeof(*user));
124 perror("malloc() failed");
127 strcpy(user->nick, nick);
128 user->created = time(0);
131 user->realname[0] = 0;
133 user->channel = NULL;
134 user->next = userList[userListIndex];
135 userList[userListIndex] = user;
139 struct UserNode* addUserMask(const char *mask) {
140 char cmask[strlen(mask)+1];
143 struct UserNode *user = NULL;
144 for(i = 0; i < strlen(mask)+1; i++) {
145 if(cmask[i] == '!') {
147 user = addUser(cmask);
148 if(user == NULL) return NULL;
150 } else if(cmask[i] == '.' && !user) {
153 } else if(cmask[i] == '@') {
154 if(user == NULL) return NULL;
156 strcpy(user->ident, &cmask[ii]);
158 } else if(cmask[i] == '\0') {
159 if(user == NULL) return NULL;
160 strcpy(user->host, &cmask[ii]);
166 struct UserNode* createTempUser(const char *mask) {
167 //note: it could also be a server we have to create a temponary user for...
168 char cmask[strlen(mask)+1];
171 struct UserNode *user = NULL;
172 for(i = 0; i < strlen(mask)+1; i++) {
173 if(cmask[i] == '!') {
175 user = malloc(sizeof(*user));
178 perror("malloc() failed");
181 strcpy(user->nick, cmask);
182 user->created = time(0);
185 user->realname[0] = 0;
187 user->channel = NULL;
189 } else if(cmask[i] == '.' && !user) {
191 user = malloc(sizeof(*user));
194 perror("malloc() failed");
197 strcpy(user->host, cmask);
198 user->created = time(0);
201 user->realname[0] = 0;
202 user->flags = USERFLAG_ISSERVER;
203 user->channel = NULL;
205 } else if(cmask[i] == '@') {
206 if(user == NULL) return NULL;
208 strcpy(user->ident, &cmask[ii]);
210 } else if(cmask[i] == '\0') {
213 user = malloc(sizeof(*user));
216 perror("malloc() failed");
219 strcpy(user->nick, cmask);
220 user->created = time(0);
223 user->realname[0] = 0;
225 user->channel = NULL;
228 strcpy(user->host, &cmask[ii]);
234 int renameUser(struct UserNode* user, const char *new_nick) {
235 if(!is_valid_nick(new_nick))
237 if(user->nick[0] == *new_nick) {
238 strcpy(user->nick, new_nick);
241 int userListIndex = get_nicklist_entry(*new_nick);
243 strcpy(user->nick, new_nick);
244 user->next = userList[userListIndex];
245 userList[userListIndex] = user;
249 void delUser(struct UserNode* user, int freeUser) {
250 int userListIndex = get_nicklist_entry(user->nick[0]);
251 if(userListIndex == -1) return;
252 struct UserNode *cuser, *last_user = NULL;
253 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
256 last_user->next = user->next;
258 userList[userListIndex] = user->next;
264 struct ChanUser *chanUser, *next;
265 for(chanUser = user->channel; chanUser; chanUser = next) {
266 next = chanUser->next_chan;
267 removeChanUserFromLists(chanUser, 1, 0, freeUser);
276 void clearTempUsers() {
277 int userListIndex = TEMPUSER_LIST_INDEX;
278 struct UserNode *cuser, *last_user = NULL, *next;
279 time_t now = time(0);
280 for(cuser = userList[userListIndex]; cuser; cuser = next) {
282 if(cuser->flags & USERFLAG_FREETMPUSER || now - cuser->created >= 300) {
284 last_user->next = cuser->next;
286 userList[userListIndex] = cuser->next;