3 static struct ChanNode **chanList;
11 1 46 *everything else*
12 ---------------------------
15 chanList = calloc(47, sizeof(*chanList));
18 int is_valid_chan(const char *name) {
22 for (ii=1; name[ii]; ++ii) {
23 if ((name[ii] > 0) && (name[ii] <= 32))
27 if (name[ii] == '\xa0')
33 static int get_chanlist_entry(int name) {
34 if((name > 0 && name <= 32) || name == ',' || name == '\xa0') return -1; //invalid name
35 if(tolower(name) >= 97 && tolower(name) <= 122) {
36 return (tolower(name) - 97);
38 if(tolower(name) >= 48 && tolower(name) <= 57) {
39 return (tolower(name) - 48 + 26);
42 if(name == '{') return 36;
43 if(name == '|') return 37;
44 if(name == '}') return 38;
45 if(name == '~') return 39;
46 if(name == '[') return 40;
47 if(name == '\\') return 41;
48 if(name == ']') return 42;
49 if(name == '^') return 43;
50 if(name == '_') return 44;
51 if(name == '`') return 45;
55 struct ChanNode* getChanByName(const char *name) { //case insensitive
56 int chanListIndex = get_chanlist_entry(name[1]);
57 if(chanListIndex == -1 || chanList[chanListIndex] == NULL)
59 struct ChanNode *chan;
60 for(chan = chanList[chanListIndex]; chan; chan = chan->next) {
61 if(!stricmp(name, chan->name))
67 struct ChanNode* addChannel(const char *name) {
68 int chanListIndex = get_chanlist_entry(name[1]);
69 if(chanListIndex == -1 || !is_valid_chan(name))
71 struct ChanNode *chan = malloc(sizeof(*chan));
74 perror("malloc() failed");
77 strcpy(chan->name, name);
81 chan->next = chanList[chanListIndex];
82 chanList[chanListIndex] = chan;
86 void delChannel(struct ChanNode* chan, int freeChan) {
87 int chanListIndex = get_chanlist_entry(chan->name[1]);
88 if(chanListIndex == -1) return;
89 struct ChanNode *cchan, *last_chan = NULL;
90 for(cchan = chanList[chanListIndex]; cchan; cchan = cchan->next) {
93 last_chan->next = chan->next;
95 chanList[chanListIndex] = chan->next;