3 static struct UserNode **userList;
6 userList = calloc(VALID_NICK_CHARS_FIRST_LEN, sizeof(*userList));
10 int is_valid_nick(const char *nick) {
12 //first char must be one of: a-zA-Z{|}~[\]^_`
13 if (!strchr(VALID_NICK_CHARS_FIRST, *nick))
15 //all other chars must be one of: a-zA-Z0-9{|}~[\]^_`
16 for (i = 0; nick[i]; ++i)
17 if (!strchr(VALID_NICK_CHARS, nick[i]))
19 if (strlen(nick) > NICKLEN)
24 static int get_nicklist_entry(int nick) {
26 char *valid_chars = VALID_NICK_CHARS_FIRST;
27 for(i = 0; i < VALID_NICK_CHARS_FIRST_LEN; i++) {
28 if(valid_chars[i] == nick)
34 struct UserNode* getUserByNick(const char *nick) { //case sensitive
35 int userListIndex = get_nicklist_entry(*nick);
36 if(userListIndex == -1 || userList[userListIndex] == NULL)
38 struct UserNode *user;
39 for(user = userList[userListIndex]; user; user = user->next) {
40 if(!stricmp(nick, user->nick))
46 struct UserNode* getUserByMask(const char *mask) { //case sensitive
47 char cmask[strlen(mask)+1];
50 struct UserNode *user = NULL;
51 for(i = 0; i < strlen(mask); i++) {
54 user = getUserByNick(&cmask[0]);
56 } else if(cmask[i] == '.') {
64 struct UserNode* searchUserByNick(const char *nick) { //case insensitive
66 return getUserByNick(nick);
69 struct UserNode *user;
71 //search in the lower case "section"
72 userListIndex = get_nicklist_entry(tolower(*nick));
73 if(userListIndex != -1 && userList[userListIndex] != NULL) {
74 for(user = userList[userListIndex]; user; user = user->next) {
75 if(!stricmp(nick, user->nick))
79 //search in the upper case "section"
80 userListIndex = get_nicklist_entry(toupper(*nick));
81 if(userListIndex != -1 && userList[userListIndex] != NULL) {
82 for(user = userList[userListIndex]; user; user = user->next) {
83 if(!stricmp(nick, user->nick))
90 struct UserNode* addUser(const char *nick) {
91 int userListIndex = get_nicklist_entry(*nick);
92 if(userListIndex == -1 || !is_valid_nick(nick))
94 struct UserNode *user = malloc(sizeof(*user));
97 perror("malloc() failed");
100 strcpy(user->nick, nick);
103 user->realname[0] = 0;
105 user->channel = NULL;
106 user->next = userList[userListIndex];
107 userList[userListIndex] = user;
112 struct UserNode* addUserMask(const char *mask) {
113 char cmask[strlen(mask)+1];
116 struct UserNode *user = NULL;
117 for(i = 0; i < strlen(mask)+1; i++) {
118 if(cmask[i] == '!') {
120 user = addUser(&cmask[0]);
121 if(user == NULL) return NULL;
123 } else if(cmask[i] == '.' && !user) {
126 } else if(cmask[i] == '@') {
127 if(user == NULL) return NULL;
129 strcpy(user->ident, &cmask[ii]);
131 } else if(cmask[i] == '\0') {
132 if(user == NULL) return NULL;
133 strcpy(user->host, &cmask[ii]);
139 int renameUser(struct UserNode* user, const char *new_nick) {
140 if(!is_valid_nick(new_nick))
142 if(user->nick[0] == *new_nick) {
143 strcpy(user->nick, new_nick);
146 int userListIndex = get_nicklist_entry(*new_nick);
148 strcpy(user->nick, new_nick);
149 user->next = userList[userListIndex];
150 userList[userListIndex] = user;
154 void delUser(struct UserNode* user, int freeUser) {
155 int userListIndex = get_nicklist_entry(user->nick[0]);
156 if(userListIndex == -1) return;
157 struct UserNode *cuser, *last_user = NULL;
158 for(cuser = userList[userListIndex]; cuser; cuser = cuser->next) {
161 last_user->next = user->next;
163 userList[userListIndex] = user->next;