src/monitor.c

   1 /*
   2  * ircd-ratbox: an advanced Internet Relay Chat Daemon(ircd).
   3  * monitor.c - Code for server-side notify lists
   4  *
   5  * Copyright (C) 2005 Lee Hardy <lee -at- leeh.co.uk>
   6  * Copyright (C) 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 #include "stdinc.h"
  33 #include "tools.h"
  34 #include "client.h"
  35 #include "memory.h"
  36 #include "balloc.h"
  37 #include "monitor.h"
  38 #include "hash.h"
  39 #include "event.h"
  40 #include "numeric.h"
  41
  42 static struct monitor *monitorTable[MONITOR_HASH_SIZE];
  43 BlockHeap *monitor_heap;
  44
  45 static void cleanup_monitor(void *unused);
  46
  47 void
  48 init_monitor(void)
  49 {
  50         monitor_heap = BlockHeapCreate(sizeof(struct monitor), MONITOR_HEAP_SIZE);
  51         eventAddIsh("cleanup_monitor", cleanup_monitor, NULL, 3600);
  52 }
  53
  54 static inline unsigned int
  55 hash_monitor_nick(const char *name)
  56 {
  57         return fnv_hash_upper((const unsigned char *) name, MONITOR_HASH_BITS);
  58 }
  59
  60 struct monitor *
  61 find_monitor(const char *name, int add)
  62 {
  63         struct monitor *monptr;
  64
  65         unsigned int hashv = hash_monitor_nick(name);
  66
  67         for(monptr = monitorTable[hashv]; monptr; monptr = monptr->hnext)
  68         {
  69                 if(!irccmp(monptr->name, name))
  70                         return monptr;
  71         }
  72
  73         if(add)
  74         {
  75                 monptr = BlockHeapAlloc(monitor_heap);
  76                 strlcpy(monptr->name, name, sizeof(monptr->name));
  77
  78                 monptr->hnext = monitorTable[hashv];
  79                 monitorTable[hashv] = monptr;
  80
  81                 return monptr;
  82         }
  83
  84         return NULL;
  85 }
  86
  87 /* monitor_signon()
  88  *
  89  * inputs       - client who has just connected
  90  * outputs      -
  91  * side effects - notifies any clients monitoring this nickname that it has
  92  *                connected to the network
  93  */
  94 void
  95 monitor_signon(struct Client *client_p)
  96 {
  97         char buf[USERHOST_REPLYLEN];
  98         struct monitor *monptr = find_monitor(client_p->name, 0);
  99         struct Client *target_p;
 100         dlink_node *ptr;
 101
 102         /* noones watching this nick */
 103         if(monptr == NULL)
 104                 return;
 105
 106         ircsnprintf(buf, sizeof(buf), "%s!%s@%s",
 107                     client_p->name, client_p->username, client_p->host);
 108
 109         DLINK_FOREACH(ptr, monptr->users.head)
 110         {
 111                 target_p = ptr->data;
 112
 113                 sendto_one(target_p, form_str(RPL_MONONLINE),
 114                                 me.name, target_p->name, buf);
 115         }
 116 }
 117
 118 /* monitor_signoff()
 119  *
 120  * inputs       - client who is exiting
 121  * outputs      -
 122  * side effects - notifies any clients monitoring this nickname that it has
 123  *                left the network
 124  */
 125 void
 126 monitor_signoff(struct Client *client_p)
 127 {
 128         struct monitor *monptr = find_monitor(client_p->name, 0);
 129         dlink_node *ptr;
 130
 131         /* noones watching this nick */
 132         if(monptr == NULL)
 133                 return;
 134
 135         DLINK_FOREACH(ptr, monptr->users.head)
 136         {
 137                 sendto_one(ptr->data, form_str(RPL_MONOFFLINE),
 138                                 me.name, ((struct Client *) ptr->data)->name, client_p->name);
 139         }
 140 }
 141
 142 void
 143 clear_monitor(struct Client *client_p)
 144 {
 145         struct monitor *monptr;
 146         dlink_node *ptr, *next_ptr;
 147
 148         DLINK_FOREACH_SAFE(ptr, next_ptr, client_p->localClient->monitor_list.head)
 149         {
 150                 monptr = ptr->data;
 151
 152                 /* we leave the actual entry around with no users, itll be
 153                  * cleaned up periodically by cleanup_monitor() --anfl
 154                  */
 155                 dlinkFindDestroy(client_p, &monptr->users);
 156                 free_dlink_node(ptr);
 157         }
 158
 159         client_p->localClient->monitor_list.head = client_p->localClient->monitor_list.tail = NULL;
 160         client_p->localClient->monitor_list.length = 0;
 161 }
 162
 163 static void
 164 cleanup_monitor(void *unused)
 165 {
 166         struct monitor *last_ptr = NULL;
 167         struct monitor *next_ptr, *ptr;
 168         int i;
 169
 170         for(i = 0; i < MONITOR_HASH_SIZE; i++)
 171         {
 172                 last_ptr = NULL;
 173                 for(ptr = monitorTable[i]; ptr; ptr = next_ptr)
 174                 {
 175                         next_ptr = ptr->hnext;
 176
 177                         if(!dlink_list_length(&ptr->users))
 178                         {
 179                                 if(last_ptr)
 180                                         last_ptr->hnext = next_ptr;
 181                                 else
 182                                         monitorTable[i] = next_ptr;
 183
 184                                 BlockHeapFree(monitor_heap, ptr);
 185                         }
 186                         else
 187                                 last_ptr = ptr;
 188                 }
 189         }
 190 }