src/cache.c

   1 /*
   2  * ircd-ratbox: an advanced Internet Relay Chat Daemon(ircd).
   3  * cache.c - code for caching files
   4  *
   5  * Copyright (C) 2003 Lee Hardy <lee@leeh.co.uk>
   6  * Copyright (C) 2003-2005 ircd-ratbox development team
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions are
  10  * met:
  11  *
  12  * 1.Redistributions of source code must retain the above copyright notice,
  13  *   this list of conditions and the following disclaimer.
  14  * 2.Redistributions in binary form must reproduce the above copyright
  15  *   notice, this list of conditions and the following disclaimer in the
  16  *   documentation and/or other materials provided with the distribution.
  17  * 3.The name of the author may not be used to endorse or promote products
  18  *   derived from this software without specific prior written permission.
  19  *
  20  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  21  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  22  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  23  * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
  24  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  25  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  26  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  28  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
  29  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  30  * POSSIBILITY OF SUCH DAMAGE.
  31  *
  32  * $Id: cache.c 25119 2008-03-13 16:57:05Z androsyn $
  33  */
  34
  35 #include "stdinc.h"
  36 #include "ircd_defs.h"
  37 #include "common.h"
  38 #include "s_conf.h"
  39 #include "client.h"
  40 #include "hash.h"
  41 #include "cache.h"
  42 #include "irc_dictionary.h"
  43 #include "numeric.h"
  44
  45 struct cachefile *user_motd = NULL;
  46 struct cachefile *oper_motd = NULL;
  47 struct cacheline *emptyline = NULL;
  48 rb_dlink_list links_cache_list;
  49 char user_motd_changed[MAX_DATE_STRING];
  50
  51 struct Dictionary *help_dict_oper = NULL;
  52 struct Dictionary *help_dict_user = NULL;
  53
  54 /* init_cache()
  55  *
  56  * inputs       -
  57  * outputs      -
  58  * side effects - inits the file/line cache blockheaps, loads motds
  59  */
  60 void
  61 init_cache(void)
  62 {
  63         /* allocate the emptyline */
  64         emptyline = rb_malloc(sizeof(struct cacheline));
  65         emptyline->data[0] = ' ';
  66         emptyline->data[1] = '\0';
  67         user_motd_changed[0] = '\0';
  68
  69         user_motd = cache_file(MPATH, "ircd.motd", 0);
  70         oper_motd = cache_file(OPATH, "opers.motd", 0);
  71         memset(&links_cache_list, 0, sizeof(links_cache_list));
  72
  73         help_dict_oper = irc_dictionary_create(strcasecmp);
  74         help_dict_user = irc_dictionary_create(strcasecmp);
  75 }
  76
  77 /*
  78  * removes tabs from src, replaces with 8 spaces, and returns the length
  79  * of the new string.  if the new string would be greater than destlen,
  80  * it is truncated to destlen - 1
  81  */
  82 static size_t
  83 untabify(char *dest, const char *src, size_t destlen)
  84 {
  85         size_t x = 0, i;
  86         const char *s = src;
  87         char *d = dest;
  88
  89         while(*s != '\0' && x < destlen - 1)
  90         {
  91                 if(*s == '\t')
  92                 {
  93                         for(i = 0; i < 8 && x < destlen - 1; i++, x++, d++)
  94                                 *d = ' ';
  95                         s++;
  96                 } else
  97                 {
  98                         *d++ = *s++;
  99                         x++;
 100                 }
 101         }
 102         *d = '\0';
 103         return x;
 104 }
 105
 106 /* cache_file()
 107  *
 108  * inputs       - file to cache, files "shortname", flags to set
 109  * outputs      - pointer to file cached, else NULL
 110  * side effects -
 111  */
 112 struct cachefile *
 113 cache_file(const char *filename, const char *shortname, int flags)
 114 {
 115         FILE *in;
 116         struct cachefile *cacheptr;
 117         struct cacheline *lineptr;
 118         char line[BUFSIZE];
 119         char *p;
 120
 121         if((in = fopen(filename, "r")) == NULL)
 122                 return NULL;
 123
 124
 125         cacheptr = rb_malloc(sizeof(struct cachefile));
 126
 127         rb_strlcpy(cacheptr->name, shortname, sizeof(cacheptr->name));
 128         cacheptr->flags = flags;
 129
 130         /* cache the file... */
 131         while(fgets(line, sizeof(line), in) != NULL)
 132         {
 133                 if((p = strpbrk(line, "\r\n")) != NULL)
 134                         *p = '\0';
 135
 136                 if(!EmptyString(line))
 137                 {
 138                         lineptr = rb_malloc(sizeof(struct cacheline));
 139                         untabify(lineptr->data, line, sizeof(lineptr->data));
 140                         rb_dlinkAddTail(lineptr, &lineptr->linenode, &cacheptr->contents);
 141                 }
 142                 else
 143                         rb_dlinkAddTailAlloc(emptyline, &cacheptr->contents);
 144         }
 145
 146         fclose(in);
 147         return cacheptr;
 148 }
 149
 150 void
 151 cache_links(void *unused)
 152 {
 153         struct Client *target_p;
 154         rb_dlink_node *ptr;
 155         rb_dlink_node *next_ptr;
 156         char *links_line;
 157
 158         RB_DLINK_FOREACH_SAFE(ptr, next_ptr, links_cache_list.head)
 159         {
 160                 rb_free(ptr->data);
 161                 rb_free_rb_dlink_node(ptr);
 162         }
 163
 164         links_cache_list.head = links_cache_list.tail = NULL;
 165         links_cache_list.length = 0;
 166
 167         RB_DLINK_FOREACH(ptr, global_serv_list.head)
 168         {
 169                 target_p = ptr->data;
 170
 171                 /* skip ourselves (done in /links) and hidden servers */
 172                 if(IsMe(target_p) ||
 173                    (IsHidden(target_p) && !ConfigServerHide.disable_hidden))
 174                         continue;
 175
 176                 /* if the below is ever modified, change LINKSLINELEN */
 177                 links_line = rb_malloc(LINKSLINELEN);
 178                 rb_snprintf(links_line, LINKSLINELEN, "%s %s :1 %s",
 179                            target_p->name, me.name,
 180                            target_p->info[0] ? target_p->info :
 181                             "(Unknown Location)");
 182
 183                 rb_dlinkAddTailAlloc(links_line, &links_cache_list);
 184         }
 185 }
 186
 187 /* free_cachefile()
 188  *
 189  * inputs       - cachefile to free
 190  * outputs      -
 191  * side effects - cachefile and its data is free'd
 192  */
 193 void
 194 free_cachefile(struct cachefile *cacheptr)
 195 {
 196         rb_dlink_node *ptr;
 197         rb_dlink_node *next_ptr;
 198
 199         if(cacheptr == NULL)
 200                 return;
 201
 202         RB_DLINK_FOREACH_SAFE(ptr, next_ptr, cacheptr->contents.head)
 203         {
 204                 if(ptr->data != emptyline)
 205                         rb_free(ptr->data);
 206         }
 207
 208         rb_free(cacheptr);
 209 }
 210
 211 /* load_help()
 212  *
 213  * inputs       -
 214  * outputs      -
 215  * side effects - old help cache deleted
 216  *              - contents of help directories are loaded.
 217  */
 218 void
 219 load_help(void)
 220 {
 221         DIR *helpfile_dir = NULL;
 222         struct dirent *ldirent= NULL;
 223         char filename[MAXPATHLEN];
 224         struct cachefile *cacheptr;
 225         struct DictionaryIter iter;
 226
 227 #if defined(S_ISLNK) && defined(HAVE_LSTAT)
 228         struct stat sb;
 229 #endif
 230
 231         DICTIONARY_FOREACH(cacheptr, &iter, help_dict_oper)
 232         {
 233                 irc_dictionary_delete(help_dict_oper, cacheptr->name);
 234                 free_cachefile(cacheptr);
 235         }
 236         DICTIONARY_FOREACH(cacheptr, &iter, help_dict_user)
 237         {
 238                 irc_dictionary_delete(help_dict_user, cacheptr->name);
 239                 free_cachefile(cacheptr);
 240         }
 241
 242         helpfile_dir = opendir(HPATH);
 243
 244         if(helpfile_dir == NULL)
 245                 return;
 246
 247         while((ldirent = readdir(helpfile_dir)) != NULL)
 248         {
 249                 rb_snprintf(filename, sizeof(filename), "%s/%s", HPATH, ldirent->d_name);
 250                 cacheptr = cache_file(filename, ldirent->d_name, HELP_OPER);
 251                 irc_dictionary_add(help_dict_oper, cacheptr->name, cacheptr);
 252         }
 253
 254         closedir(helpfile_dir);
 255         helpfile_dir = opendir(UHPATH);
 256
 257         if(helpfile_dir == NULL)
 258                 return;
 259
 260         while((ldirent = readdir(helpfile_dir)) != NULL)
 261         {
 262                 rb_snprintf(filename, sizeof(filename), "%s/%s", UHPATH, ldirent->d_name);
 263
 264 #if defined(S_ISLNK) && defined(HAVE_LSTAT)
 265                 if(lstat(filename, &sb) < 0)
 266                         continue;
 267
 268                 /* ok, if its a symlink, we work on the presumption if an
 269                  * oper help exists of that name, its a symlink to that --fl
 270                  */
 271                 if(S_ISLNK(sb.st_mode))
 272                 {
 273                         cacheptr = irc_dictionary_retrieve(help_dict_oper, ldirent->d_name);
 274
 275                         if(cacheptr != NULL)
 276                         {
 277                                 cacheptr->flags |= HELP_USER;
 278                                 continue;
 279                         }
 280                 }
 281 #endif
 282
 283                 cacheptr = cache_file(filename, ldirent->d_name, HELP_USER);
 284                 irc_dictionary_add(help_dict_user, cacheptr->name, cacheptr);
 285         }
 286
 287         closedir(helpfile_dir);
 288 }
 289
 290 /* send_user_motd()
 291  *
 292  * inputs       - client to send motd to
 293  * outputs      - client is sent motd if exists, else ERR_NOMOTD
 294  * side effects -
 295  */
 296 void
 297 send_user_motd(struct Client *source_p)
 298 {
 299         struct cacheline *lineptr;
 300         rb_dlink_node *ptr;
 301         const char *myname = get_id(&me, source_p);
 302         const char *nick = get_id(source_p, source_p);
 303         if(user_motd == NULL || rb_dlink_list_length(&user_motd->contents) == 0)
 304         {
 305                 sendto_one(source_p, form_str(ERR_NOMOTD), myname, nick);
 306                 return;
 307         }
 308
 309         sendto_one(source_p, form_str(RPL_MOTDSTART), myname, nick, me.name);
 310
 311         RB_DLINK_FOREACH(ptr, user_motd->contents.head)
 312         {
 313                 lineptr = ptr->data;
 314                 sendto_one(source_p, form_str(RPL_MOTD), myname, nick, lineptr->data);
 315         }
 316
 317         sendto_one(source_p, form_str(RPL_ENDOFMOTD), myname, nick);
 318 }
 319
 320 void
 321 cache_user_motd(void)
 322 {
 323         struct stat sb;
 324         struct tm *local_tm;
 325
 326         if(stat(MPATH, &sb) == 0)
 327         {
 328                 local_tm = localtime(&sb.st_mtime);
 329
 330                 if(local_tm != NULL)
 331                 {
 332                         rb_snprintf(user_motd_changed, sizeof(user_motd_changed),
 333                                  "%d/%d/%d %d:%d",
 334                                  local_tm->tm_mday, local_tm->tm_mon + 1,
 335                                  1900 + local_tm->tm_year, local_tm->tm_hour,
 336                                  local_tm->tm_min);
 337                 }
 338         }
 339         free_cachefile(user_motd);
 340         user_motd = cache_file(MPATH, "ircd.motd", 0);
 341 }
 342
 343
 344 /* send_oper_motd()
 345  *
 346  * inputs       - client to send motd to
 347  * outputs      - client is sent oper motd if exists
 348  * side effects -
 349  */
 350 void
 351 send_oper_motd(struct Client *source_p)
 352 {
 353         struct cacheline *lineptr;
 354         rb_dlink_node *ptr;
 355
 356         if(oper_motd == NULL || rb_dlink_list_length(&oper_motd->contents) == 0)
 357                 return;
 358
 359         sendto_one(source_p, form_str(RPL_OMOTDSTART),
 360                    me.name, source_p->name);
 361
 362         RB_DLINK_FOREACH(ptr, oper_motd->contents.head)
 363         {
 364                 lineptr = ptr->data;
 365                 sendto_one(source_p, form_str(RPL_OMOTD),
 366                            me.name, source_p->name, lineptr->data);
 367         }
 368
 369         sendto_one(source_p, form_str(RPL_ENDOFOMOTD),
 370                    me.name, source_p->name);
 371 }