]>
jfr.im git - solanum.git/blob - src/monitor.c
2 * ircd-ratbox: an advanced Internet Relay Chat Daemon(ircd).
3 * monitor.c - Code for server-side notify lists
5 * Copyright (C) 2005 Lee Hardy <lee -at- leeh.co.uk>
6 * Copyright (C) 2005 ircd-ratbox development team
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
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.
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.
32 * $Id: monitor.c 3520 2007-06-30 22:15:35Z jilles $
44 static struct monitor
*monitorTable
[MONITOR_HASH_SIZE
];
45 BlockHeap
*monitor_heap
;
47 static void cleanup_monitor(void *unused
);
52 monitor_heap
= BlockHeapCreate(sizeof(struct monitor
), MONITOR_HEAP_SIZE
);
53 eventAddIsh("cleanup_monitor", cleanup_monitor
, NULL
, 3600);
56 static inline unsigned int
57 hash_monitor_nick(const char *name
)
59 return fnv_hash_upper((const unsigned char *) name
, MONITOR_HASH_BITS
);
63 find_monitor(const char *name
, int add
)
65 struct monitor
*monptr
;
67 unsigned int hashv
= hash_monitor_nick(name
);
69 for(monptr
= monitorTable
[hashv
]; monptr
; monptr
= monptr
->hnext
)
71 if(!irccmp(monptr
->name
, name
))
77 monptr
= BlockHeapAlloc(monitor_heap
);
78 strlcpy(monptr
->name
, name
, sizeof(monptr
->name
));
80 monptr
->hnext
= monitorTable
[hashv
];
81 monitorTable
[hashv
] = monptr
;
91 * inputs - client who has just connected
93 * side effects - notifies any clients monitoring this nickname that it has
94 * connected to the network
97 monitor_signon(struct Client
*client_p
)
99 char buf
[USERHOST_REPLYLEN
];
100 struct monitor
*monptr
= find_monitor(client_p
->name
, 0);
102 /* noones watching this nick */
106 ircsnprintf(buf
, sizeof(buf
), "%s!%s@%s",
107 client_p
->name
, client_p
->username
, client_p
->host
);
109 sendto_monitor(monptr
, form_str(RPL_MONONLINE
), me
.name
, "*", buf
);
114 * inputs - client who is exiting
116 * side effects - notifies any clients monitoring this nickname that it has
120 monitor_signoff(struct Client
*client_p
)
122 struct monitor
*monptr
= find_monitor(client_p
->name
, 0);
124 /* noones watching this nick */
128 sendto_monitor(monptr
, form_str(RPL_MONOFFLINE
), me
.name
, "*",
133 clear_monitor(struct Client
*client_p
)
135 struct monitor
*monptr
;
136 dlink_node
*ptr
, *next_ptr
;
138 DLINK_FOREACH_SAFE(ptr
, next_ptr
, client_p
->localClient
->monitor_list
.head
)
142 /* we leave the actual entry around with no users, itll be
143 * cleaned up periodically by cleanup_monitor() --anfl
145 dlinkFindDestroy(client_p
, &monptr
->users
);
146 free_dlink_node(ptr
);
149 client_p
->localClient
->monitor_list
.head
= client_p
->localClient
->monitor_list
.tail
= NULL
;
150 client_p
->localClient
->monitor_list
.length
= 0;
154 cleanup_monitor(void *unused
)
156 struct monitor
*last_ptr
= NULL
;
157 struct monitor
*next_ptr
, *ptr
;
160 for(i
= 0; i
< MONITOR_HASH_SIZE
; i
++)
163 for(ptr
= monitorTable
[i
]; ptr
; ptr
= next_ptr
)
165 next_ptr
= ptr
->hnext
;
167 if(!dlink_list_length(&ptr
->users
))
170 last_ptr
->hnext
= next_ptr
;
172 monitorTable
[i
] = next_ptr
;
174 BlockHeapFree(monitor_heap
, ptr
);