1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
* Copyright (c) 2026 Nakidai Perumenei <nakidai at disroot dot org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include "ircd.h"
#include <stddef.h>
#include <string.h>
#include <err.h>
struct Channel channels[CHANNELS_MAX];
size_t channels_c;
int
channel_join(struct Channel *channel, struct Peer *peer)
{
if (channel->users_c == lengthof(channel->users)
|| peer->channels_c == lengthof(peer->channels))
return 1;
peer->channels[peer->channels_c++] = channel;
channel->users[channel->users_c++] = peer;
writechanf(
0,
channel,
":%s!%s@%s JOIN %s",
getnick(peer),
peer->user,
peer->host,
channel->name
);
return 0;
}
int
channel_exit(struct Channel *channel, struct Peer *peer)
{
size_t i;
for (i = 0; i < channel->users_c; ++i)
if (channel->users[i]->fd == peer->fd)
break;
ensure(i != channel->users_c, (void)0, 1);
channel->users[i] = channel->users[--channel->users_c];
for (i = 0; i < peer->channels_c; ++i)
if (!strcmp(peer->channels[i]->name, channel->name))
break;
ensure(i != peer->channels_c, warnx(
"channel_exit(): channel had user, but user hadn't channel"
), 1)
peer->channels[i] = peer->channels[--peer->channels_c];
if (!channel->users_c)
{
for (i = 0; i < channels_c; ++i)
if (!strcmp(channels[i].name, channel->name))
break;
ensure(i != channels_c, warnx(
"channel_exit(): couldn't find empty channel"
), 1);
channel_remove(i);
}
return 0;
}
void
channel_remove(size_t cid)
{
struct Channel *tofix;
size_t i, j;
tofix = &channels[channels_c-1];
for (i = 0; i < tofix->users_c; ++i)
{
for (j = 0; j < tofix->users[i]->channels_c; ++j)
if (!strcmp(tofix->users[i]->channels[j]->name, tofix->name))
break;
if (j == tofix->users[i]->channels_c)
{
warnx(
"channel_remove(): %s doesn't belong to %s@%s, "
"though they believe in the opposite",
tofix->name,
getnick(tofix->users[i]),
tofix->users[i]->host
);
continue;
}
tofix->users[i]->channels[j] = &channels[cid];
}
channels[cid] = channels[--channels_c];
}
|