| 1 |
/* |
| 2 |
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd) |
| 3 |
* |
| 4 |
* Copyright (c) 2000 Kevin L. Mitchell <klmitch@mit.edu> |
| 5 |
* Copyright (c) 2013-2016 ircd-hybrid development team |
| 6 |
* |
| 7 |
* This program is free software; you can redistribute it and/or modify |
| 8 |
* it under the terms of the GNU General Public License as published by |
| 9 |
* the Free Software Foundation; either version 2 of the License, or |
| 10 |
* (at your option) any later version. |
| 11 |
* |
| 12 |
* This program is distributed in the hope that it will be useful, |
| 13 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 |
* GNU General Public License for more details. |
| 16 |
* |
| 17 |
* You should have received a copy of the GNU General Public License |
| 18 |
* along with this program; if not, write to the Free Software |
| 19 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 |
| 20 |
* USA |
| 21 |
*/ |
| 22 |
|
| 23 |
/*! \file motd.c |
| 24 |
* \brief Message-of-the-day manipulation implementation. |
| 25 |
* \version $Id$ |
| 26 |
*/ |
| 27 |
|
| 28 |
#include "stdinc.h" |
| 29 |
#include "list.h" |
| 30 |
#include "ircd.h" |
| 31 |
#include "conf.h" |
| 32 |
#include "send.h" |
| 33 |
#include "numeric.h" |
| 34 |
#include "client.h" |
| 35 |
#include "irc_string.h" |
| 36 |
#include "memory.h" |
| 37 |
#include "log.h" |
| 38 |
#include "motd.h" |
| 39 |
#include "hostmask.h" |
| 40 |
#include "misc.h" |
| 41 |
|
| 42 |
|
| 43 |
/** Global list of messages of the day. */ |
| 44 |
static struct |
| 45 |
{ |
| 46 |
struct Motd *local; /**< Local MOTD. */ |
| 47 |
struct Motd *remote; /**< Remote MOTD. */ |
| 48 |
dlink_list other; /**< MOTDs specified in configuration file. */ |
| 49 |
dlink_list cachelist; /**< List of MotdCache entries. */ |
| 50 |
} MotdList; |
| 51 |
|
| 52 |
|
| 53 |
/*! \brief Create a struct Motd and initialize it. |
| 54 |
* \param mask Hostmask (or connection class name) to filter on. |
| 55 |
* \param path Path to MOTD file. |
| 56 |
*/ |
| 57 |
static struct Motd * |
| 58 |
motd_create(const char *mask, const char *path) |
| 59 |
{ |
| 60 |
struct Motd *motd = xcalloc(sizeof(struct Motd)); |
| 61 |
|
| 62 |
if (EmptyString(mask)) |
| 63 |
motd->type = MOTD_UNIVERSAL; |
| 64 |
else if (class_find(mask, 1)) |
| 65 |
motd->type = MOTD_CLASS; |
| 66 |
else |
| 67 |
{ |
| 68 |
switch (parse_netmask(mask, &motd->address, &motd->addrbits)) |
| 69 |
{ |
| 70 |
case HM_IPV4: |
| 71 |
motd->type = MOTD_IPMASKV4; |
| 72 |
break; |
| 73 |
case HM_IPV6: |
| 74 |
motd->type = MOTD_IPMASKV6; |
| 75 |
break; |
| 76 |
default: /* HM_HOST */ |
| 77 |
motd->type = MOTD_HOSTMASK; |
| 78 |
break; |
| 79 |
} |
| 80 |
} |
| 81 |
|
| 82 |
if (mask) |
| 83 |
motd->mask = xstrdup(mask); |
| 84 |
|
| 85 |
motd->path = xstrdup(path); |
| 86 |
motd->maxcount = MOTD_MAXLINES; |
| 87 |
|
| 88 |
return motd; |
| 89 |
} |
| 90 |
|
| 91 |
/*! brief\ This function reads a motd out of a file (if needed) and caches it. |
| 92 |
* If a matching cache entry already exists, reuse it. Otherwise, |
| 93 |
* allocate and populate a new MotdCache for it. |
| 94 |
* \param motd Specification for MOTD file. |
| 95 |
* \return Matching MotdCache entry. |
| 96 |
*/ |
| 97 |
static struct MotdCache * |
| 98 |
motd_cache(struct Motd *motd) |
| 99 |
{ |
| 100 |
FILE *file = NULL; |
| 101 |
struct stat sb; |
| 102 |
char line[MOTD_LINESIZE + 2]; /* +2 for \r\n */ |
| 103 |
char *tmp = NULL; |
| 104 |
unsigned int i = 0; |
| 105 |
dlink_node *node = NULL; |
| 106 |
|
| 107 |
assert(motd); |
| 108 |
assert(motd->path); |
| 109 |
|
| 110 |
if (motd->cache) |
| 111 |
return motd->cache; |
| 112 |
|
| 113 |
/* Try to find it in the list of cached files */ |
| 114 |
DLINK_FOREACH(node, MotdList.cachelist.head) |
| 115 |
{ |
| 116 |
struct MotdCache *cache = node->data; |
| 117 |
|
| 118 |
if (!strcmp(cache->path, motd->path) && cache->maxcount == motd->maxcount) |
| 119 |
{ |
| 120 |
cache->ref++; /* Increase reference count */ |
| 121 |
motd->cache = cache; /* Remember cache */ |
| 122 |
return motd->cache; /* Return it */ |
| 123 |
} |
| 124 |
} |
| 125 |
|
| 126 |
/* Need the file's modification time */ |
| 127 |
if (stat(motd->path, &sb) == -1) |
| 128 |
{ |
| 129 |
ilog(LOG_TYPE_IRCD, "Couldn't stat \"%s\": %s", motd->path, |
| 130 |
strerror(errno)); |
| 131 |
return 0; |
| 132 |
} |
| 133 |
|
| 134 |
/* Gotta read in the file, now */ |
| 135 |
if ((file = fopen(motd->path, "r")) == NULL) |
| 136 |
{ |
| 137 |
ilog(LOG_TYPE_IRCD, "Couldn't open \"%s\": %s", motd->path, |
| 138 |
strerror(errno)); |
| 139 |
return 0; |
| 140 |
} |
| 141 |
|
| 142 |
/* Ok, allocate a structure; we'll realloc later to trim memory */ |
| 143 |
struct MotdCache *cache = xcalloc(sizeof(struct MotdCache) + (MOTD_LINESIZE * MOTD_MAXLINES)); |
| 144 |
cache->ref = 1; |
| 145 |
cache->path = xstrdup(motd->path); |
| 146 |
cache->maxcount = motd->maxcount; |
| 147 |
cache->modtime = sb.st_mtime; /* Store modtime */ |
| 148 |
|
| 149 |
while (cache->count < cache->maxcount && fgets(line, sizeof(line), file)) |
| 150 |
{ |
| 151 |
/* Copy over line, stopping when we overflow or hit line end */ |
| 152 |
for (tmp = line, i = 0; i < (MOTD_LINESIZE - 1) && *tmp && *tmp != '\r' && *tmp != '\n'; ++tmp, ++i) |
| 153 |
cache->motd[cache->count][i] = *tmp; |
| 154 |
cache->motd[cache->count][i] = '\0'; |
| 155 |
|
| 156 |
cache->count++; |
| 157 |
} |
| 158 |
|
| 159 |
fclose(file); /* Close the file */ |
| 160 |
|
| 161 |
/* Trim memory usage a little */ |
| 162 |
motd->cache = xcalloc(sizeof(struct MotdCache) + |
| 163 |
(MOTD_LINESIZE * cache->count)); |
| 164 |
memcpy(motd->cache, cache, sizeof(struct MotdCache) + |
| 165 |
(MOTD_LINESIZE * cache->count)); |
| 166 |
xfree(cache); |
| 167 |
|
| 168 |
/* Now link it in */ |
| 169 |
dlinkAdd(motd->cache, &motd->cache->node, &MotdList.cachelist); |
| 170 |
|
| 171 |
return motd->cache; |
| 172 |
} |
| 173 |
|
| 174 |
/*! \brief Clear and dereference the Motd::cache element of \a motd. |
| 175 |
* If the MotdCache::ref count goes to zero, free it. |
| 176 |
* \param motd MOTD to uncache. |
| 177 |
*/ |
| 178 |
static void |
| 179 |
motd_decache(struct Motd *motd) |
| 180 |
{ |
| 181 |
struct MotdCache *cache = NULL; |
| 182 |
|
| 183 |
assert(motd); |
| 184 |
|
| 185 |
if ((cache = motd->cache) == NULL) /* We can be called for records with no cache */ |
| 186 |
return; |
| 187 |
|
| 188 |
motd->cache = NULL; /* Zero the cache */ |
| 189 |
|
| 190 |
if (--cache->ref == 0) /* Reduce reference count */ |
| 191 |
{ |
| 192 |
dlinkDelete(&cache->node, &MotdList.cachelist); |
| 193 |
xfree(cache->path); /* Free path info */ |
| 194 |
xfree(cache); /* Very simple for a reason */ |
| 195 |
} |
| 196 |
} |
| 197 |
|
| 198 |
/*! \brief Deallocate a MOTD structure. |
| 199 |
* If it has cached content, uncache it. |
| 200 |
* \param motd MOTD to destroy. |
| 201 |
*/ |
| 202 |
static void |
| 203 |
motd_destroy(struct Motd *motd) |
| 204 |
{ |
| 205 |
assert(motd); |
| 206 |
|
| 207 |
if (motd->cache) /* Drop the cache */ |
| 208 |
motd_decache(motd); |
| 209 |
|
| 210 |
xfree(motd->path); /* We always must have a path */ |
| 211 |
xfree(motd->mask); |
| 212 |
xfree(motd); |
| 213 |
} |
| 214 |
|
| 215 |
/*! \brief Find the first matching MOTD block for a user. |
| 216 |
* If the user is remote, always use remote MOTD. |
| 217 |
* Otherwise, if there is a hostmask- or class-based MOTD that matches |
| 218 |
* the user, use it. |
| 219 |
* Otherwise, use the local MOTD. |
| 220 |
* \param client_p Client to find MOTD for. |
| 221 |
* \return Pointer to first matching MOTD for the client. |
| 222 |
*/ |
| 223 |
static struct Motd * |
| 224 |
motd_lookup(const struct Client *client_p) |
| 225 |
{ |
| 226 |
dlink_node *node = NULL; |
| 227 |
const struct ClassItem *class = NULL; |
| 228 |
|
| 229 |
assert(client_p); |
| 230 |
|
| 231 |
if (!MyConnect(client_p)) /* Not my user, always return remote motd */ |
| 232 |
return MotdList.remote; |
| 233 |
|
| 234 |
class = get_class_ptr(&client_p->connection->confs); |
| 235 |
assert(class); |
| 236 |
|
| 237 |
/* Check the motd blocks first */ |
| 238 |
DLINK_FOREACH(node, MotdList.other.head) |
| 239 |
{ |
| 240 |
struct Motd *motd = node->data; |
| 241 |
|
| 242 |
switch (motd->type) |
| 243 |
{ |
| 244 |
case MOTD_CLASS: |
| 245 |
if (!match(motd->mask, class->name)) |
| 246 |
return motd; |
| 247 |
break; |
| 248 |
case MOTD_HOSTMASK: |
| 249 |
if (!match(motd->mask, client_p->host) || !match(motd->mask, client_p->sockhost)) |
| 250 |
return motd; |
| 251 |
break; |
| 252 |
case MOTD_IPMASKV4: |
| 253 |
if (client_p->connection->aftype == AF_INET) |
| 254 |
if (match_ipv4(&client_p->connection->ip, &motd->address, motd->addrbits)) |
| 255 |
return motd; |
| 256 |
break; |
| 257 |
case MOTD_IPMASKV6: |
| 258 |
if (client_p->connection->aftype == AF_INET6) |
| 259 |
if (match_ipv6(&client_p->connection->ip, &motd->address, motd->addrbits)) |
| 260 |
return motd; |
| 261 |
break; |
| 262 |
default: break; |
| 263 |
} |
| 264 |
} |
| 265 |
|
| 266 |
return MotdList.local; /* Ok, return the default motd */ |
| 267 |
} |
| 268 |
|
| 269 |
/*! \brief Send the content of a MotdCache to a user. |
| 270 |
* If \a cache is NULL, simply send ERR_NOMOTD to the client. |
| 271 |
* \param client_p Client to send MOTD to. |
| 272 |
* \param cache MOTD body to send to client. |
| 273 |
*/ |
| 274 |
static void |
| 275 |
motd_forward(struct Client *client_p, const struct MotdCache *cache) |
| 276 |
{ |
| 277 |
if (!cache) /* No motd to send */ |
| 278 |
{ |
| 279 |
sendto_one_numeric(client_p, &me, ERR_NOMOTD); |
| 280 |
return; |
| 281 |
} |
| 282 |
|
| 283 |
/* Send the motd */ |
| 284 |
sendto_one_numeric(client_p, &me, RPL_MOTDSTART, me.name); |
| 285 |
|
| 286 |
for (unsigned int i = 0; i < cache->count; ++i) |
| 287 |
sendto_one_numeric(client_p, &me, RPL_MOTD, cache->motd[i]); |
| 288 |
|
| 289 |
sendto_one_numeric(client_p, &me, RPL_ENDOFMOTD); |
| 290 |
} |
| 291 |
|
| 292 |
/*! \brief Find the MOTD for a client and send it. |
| 293 |
* \param client_p Client being greeted. |
| 294 |
*/ |
| 295 |
void |
| 296 |
motd_send(struct Client *client_p) |
| 297 |
{ |
| 298 |
assert(client_p); |
| 299 |
|
| 300 |
motd_forward(client_p, motd_cache(motd_lookup(client_p))); |
| 301 |
} |
| 302 |
|
| 303 |
/*! \brief Send the signon MOTD to a user. |
| 304 |
* If general::short_motd is true and a matching MOTD exists for the |
| 305 |
* user, direct the client to type /MOTD to read it. Otherwise, call |
| 306 |
* motd_forward() for the user. |
| 307 |
* \param client_p Client that has just connected. |
| 308 |
*/ |
| 309 |
void |
| 310 |
motd_signon(struct Client *client_p) |
| 311 |
{ |
| 312 |
const struct MotdCache *cache = motd_cache(motd_lookup(client_p)); |
| 313 |
|
| 314 |
if (!ConfigGeneral.short_motd || !cache) |
| 315 |
motd_forward(client_p, cache); |
| 316 |
else |
| 317 |
{ |
| 318 |
sendto_one_notice(client_p, &me, ":*** Notice -- motd was last changed at %s", |
| 319 |
date_iso8601(cache->modtime)); |
| 320 |
sendto_one_notice(client_p, &me, ":*** Notice -- Please read the motd if you haven't read it"); |
| 321 |
sendto_one_numeric(client_p, &me, RPL_MOTDSTART, me.name); |
| 322 |
sendto_one_numeric(client_p, &me, RPL_MOTD, "*** This is the short motd ***"); |
| 323 |
sendto_one_numeric(client_p, &me, RPL_ENDOFMOTD); |
| 324 |
} |
| 325 |
} |
| 326 |
|
| 327 |
/*! \brief Clear all cached MOTD bodies. |
| 328 |
* The local and remote MOTDs are re-cached immediately. |
| 329 |
*/ |
| 330 |
void |
| 331 |
motd_recache(void) |
| 332 |
{ |
| 333 |
dlink_node *node = NULL; |
| 334 |
|
| 335 |
motd_decache(MotdList.local); /* Decache local and remote MOTDs */ |
| 336 |
motd_decache(MotdList.remote); |
| 337 |
|
| 338 |
DLINK_FOREACH(node, MotdList.other.head) /* Now all the others */ |
| 339 |
motd_decache(node->data); |
| 340 |
|
| 341 |
/* Now recache local and remote MOTDs */ |
| 342 |
motd_cache(MotdList.local); |
| 343 |
motd_cache(MotdList.remote); |
| 344 |
} |
| 345 |
|
| 346 |
/*! \brief Re-cache the local and remote MOTDs. |
| 347 |
* If they already exist, they are deallocated first. |
| 348 |
*/ |
| 349 |
void |
| 350 |
motd_init(void) |
| 351 |
{ |
| 352 |
if (MotdList.local) /* Destroy old local MOTD */ |
| 353 |
motd_destroy(MotdList.local); |
| 354 |
|
| 355 |
MotdList.local = motd_create(NULL, MPATH); |
| 356 |
motd_cache(MotdList.local); /* Initialize local MOTD and cache it */ |
| 357 |
|
| 358 |
if (MotdList.remote) /* Destroy old remote MOTD */ |
| 359 |
motd_destroy(MotdList.remote); |
| 360 |
|
| 361 |
MotdList.remote = motd_create(NULL, MPATH); |
| 362 |
motd_cache(MotdList.remote); /* Initialize remote MOTD and cache it */ |
| 363 |
} |
| 364 |
|
| 365 |
/* \brief Add a new MOTD. |
| 366 |
* \param mask Hostmask (or connection class name) to send this to. |
| 367 |
* \param path Pathname of file to send. |
| 368 |
*/ |
| 369 |
void |
| 370 |
motd_add(const char *mask, const char *path) |
| 371 |
{ |
| 372 |
struct Motd *motd = motd_create(mask, path); /* Create the motd */ |
| 373 |
|
| 374 |
dlinkAdd(motd, &motd->node, &MotdList.other); |
| 375 |
} |
| 376 |
|
| 377 |
/*! \brief Clear out all MOTDs. |
| 378 |
* Compared to motd_recache(), this destroys all hostmask- or |
| 379 |
* class-based MOTDs rather than simply uncaching them. |
| 380 |
* Re-cache the local and remote MOTDs. |
| 381 |
*/ |
| 382 |
void |
| 383 |
motd_clear(void) |
| 384 |
{ |
| 385 |
motd_decache(MotdList.local); /* Decache local and remote MOTDs */ |
| 386 |
motd_decache(MotdList.remote); |
| 387 |
|
| 388 |
while (MotdList.other.head) /* Destroy other MOTDs */ |
| 389 |
{ |
| 390 |
struct Motd *motd = MotdList.other.head->data; |
| 391 |
dlinkDelete(&motd->node, &MotdList.other); |
| 392 |
motd_destroy(motd); |
| 393 |
} |
| 394 |
|
| 395 |
/* Now recache local and remote MOTDs */ |
| 396 |
motd_cache(MotdList.local); |
| 397 |
motd_cache(MotdList.remote); |
| 398 |
} |
| 399 |
|
| 400 |
/*! \brief Report list of non-default MOTDs. |
| 401 |
* \param client_p Client requesting statistics. |
| 402 |
*/ |
| 403 |
void |
| 404 |
motd_report(struct Client *client_p, int parc, char *parv[]) |
| 405 |
{ |
| 406 |
dlink_node *node; |
| 407 |
|
| 408 |
DLINK_FOREACH(node, MotdList.other.head) |
| 409 |
{ |
| 410 |
const struct Motd *motd = node->data; |
| 411 |
|
| 412 |
sendto_one_numeric(client_p, &me, RPL_STATSTLINE, |
| 413 |
motd->mask, motd->path); |
| 414 |
} |
| 415 |
} |
| 416 |
|
| 417 |
/*! \brief Report MOTD memory usage to a client. |
| 418 |
* \param client_p Client requesting memory usage. |
| 419 |
*/ |
| 420 |
void |
| 421 |
motd_memory_count(struct Client *client_p) |
| 422 |
{ |
| 423 |
dlink_node *node; |
| 424 |
unsigned int mt = 0; /* Motd count */ |
| 425 |
unsigned int mtc = 0; /* Motd cache count */ |
| 426 |
size_t mtm = 0; /* Memory consumed by motd */ |
| 427 |
size_t mtcm = 0; /* Memory consumed by motd cache */ |
| 428 |
|
| 429 |
if (MotdList.local) |
| 430 |
{ |
| 431 |
++mt; |
| 432 |
mtm += sizeof(struct Motd); |
| 433 |
mtm += MotdList.local->path ? (strlen(MotdList.local->path) + 1) : 0; |
| 434 |
} |
| 435 |
|
| 436 |
if (MotdList.remote) |
| 437 |
{ |
| 438 |
++mt; |
| 439 |
mtm += sizeof(struct Motd); |
| 440 |
mtm += MotdList.remote->path ? (strlen(MotdList.remote->path) + 1) : 0; |
| 441 |
} |
| 442 |
|
| 443 |
DLINK_FOREACH(node, MotdList.other.head) |
| 444 |
{ |
| 445 |
const struct Motd *motd = node->data; |
| 446 |
|
| 447 |
++mt; |
| 448 |
mtm += sizeof(struct Motd); |
| 449 |
mtm += motd->path ? (strlen(motd->path) + 1) : 0; |
| 450 |
} |
| 451 |
|
| 452 |
DLINK_FOREACH(node, MotdList.cachelist.head) |
| 453 |
{ |
| 454 |
const struct MotdCache *cache = node->data; |
| 455 |
|
| 456 |
++mtc; |
| 457 |
mtcm += sizeof(struct MotdCache) + (MOTD_LINESIZE * (cache->count - 1)); |
| 458 |
} |
| 459 |
|
| 460 |
sendto_one_numeric(client_p, &me, RPL_STATSDEBUG | SND_EXPLICIT, |
| 461 |
"z :Motds %u(%zu) Cache %u(%zu)", |
| 462 |
mt, mtm, mtc, mtcm); |
| 463 |
} |
