1 |
/* |
2 |
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd) |
3 |
* |
4 |
* Copyright (c) 1997-2015 ircd-hybrid development team |
5 |
* |
6 |
* This program is free software; you can redistribute it and/or modify |
7 |
* it under the terms of the GNU General Public License as published by |
8 |
* the Free Software Foundation; either version 2 of the License, or |
9 |
* (at your option) any later version. |
10 |
* |
11 |
* This program is distributed in the hope that it will be useful, |
12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 |
* GNU General Public License for more details. |
15 |
* |
16 |
* You should have received a copy of the GNU General Public License |
17 |
* along with this program; if not, write to the Free Software |
18 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 |
19 |
* USA |
20 |
*/ |
21 |
|
22 |
/*! \file whowas.c |
23 |
* \brief WHOWAS user cache. |
24 |
* \version $Id$ |
25 |
*/ |
26 |
|
27 |
#include "stdinc.h" |
28 |
#include "list.h" |
29 |
#include "whowas.h" |
30 |
#include "client.h" |
31 |
#include "hash.h" |
32 |
#include "irc_string.h" |
33 |
#include "ircd.h" |
34 |
|
35 |
|
36 |
static struct Whowas WHOWAS[NICKNAMEHISTORYLENGTH]; |
37 |
dlink_list WHOWASHASH[HASHSIZE]; |
38 |
|
39 |
|
40 |
void |
41 |
whowas_init(void) |
42 |
{ |
43 |
for (unsigned int i = 0; i < NICKNAMEHISTORYLENGTH; ++i) |
44 |
WHOWAS[i].hashv = -1; |
45 |
} |
46 |
|
47 |
void |
48 |
whowas_add_history(struct Client *client_p, const int online) |
49 |
{ |
50 |
static unsigned int whowas_next = 0; |
51 |
struct Whowas *const who = &WHOWAS[whowas_next]; |
52 |
|
53 |
assert(IsClient(client_p)); |
54 |
|
55 |
if (++whowas_next == NICKNAMEHISTORYLENGTH) |
56 |
whowas_next = 0; |
57 |
|
58 |
if (who->hashv != -1) |
59 |
{ |
60 |
if (who->online) |
61 |
dlinkDelete(&who->cnode, &who->online->whowas); |
62 |
|
63 |
dlinkDelete(&who->tnode, &WHOWASHASH[who->hashv]); |
64 |
} |
65 |
|
66 |
who->hashv = strhash(client_p->name); |
67 |
who->shide = IsHidden(client_p->servptr) != 0; |
68 |
who->logoff = CurrentTime; |
69 |
|
70 |
strlcpy(who->account, client_p->account, sizeof(who->account)); |
71 |
strlcpy(who->name, client_p->name, sizeof(who->name)); |
72 |
strlcpy(who->username, client_p->username, sizeof(who->username)); |
73 |
strlcpy(who->hostname, client_p->host, sizeof(who->hostname)); |
74 |
strlcpy(who->realname, client_p->info, sizeof(who->realname)); |
75 |
strlcpy(who->servername, client_p->servptr->name, sizeof(who->servername)); |
76 |
|
77 |
if (online) |
78 |
{ |
79 |
who->online = client_p; |
80 |
dlinkAdd(who, &who->cnode, &client_p->whowas); |
81 |
} |
82 |
else |
83 |
who->online = NULL; |
84 |
|
85 |
dlinkAdd(who, &who->tnode, &WHOWASHASH[who->hashv]); |
86 |
} |
87 |
|
88 |
void |
89 |
whowas_off_history(struct Client *client_p) |
90 |
{ |
91 |
dlink_node *node = NULL, *node_next = NULL; |
92 |
|
93 |
DLINK_FOREACH_SAFE(node, node_next, client_p->whowas.head) |
94 |
{ |
95 |
struct Whowas *temp = node->data; |
96 |
|
97 |
temp->online = NULL; |
98 |
dlinkDelete(&temp->cnode, &client_p->whowas); |
99 |
} |
100 |
} |
101 |
|
102 |
struct Client * |
103 |
whowas_get_history(const char *nick, time_t timelimit) |
104 |
{ |
105 |
dlink_node *node = NULL; |
106 |
|
107 |
timelimit = CurrentTime - timelimit; |
108 |
|
109 |
DLINK_FOREACH(node, WHOWASHASH[strhash(nick)].head) |
110 |
{ |
111 |
struct Whowas *temp = node->data; |
112 |
|
113 |
if (temp->logoff < timelimit) |
114 |
continue; |
115 |
if (irccmp(nick, temp->name)) |
116 |
continue; |
117 |
return temp->online; |
118 |
} |
119 |
|
120 |
return NULL; |
121 |
} |
122 |
|
123 |
void |
124 |
whowas_count_memory(unsigned int *const count, uint64_t *const bytes) |
125 |
{ |
126 |
const struct Whowas *tmp = &WHOWAS[0]; |
127 |
|
128 |
for (unsigned int i = 0; i < NICKNAMEHISTORYLENGTH; ++i, ++tmp) |
129 |
{ |
130 |
if (tmp->hashv != -1) |
131 |
{ |
132 |
(*count)++; |
133 |
(*bytes) += sizeof(struct Whowas); |
134 |
} |
135 |
} |
136 |
} |