| 1 |
/* |
| 2 |
* ircd-hybrid: an advanced, lightweight Internet Relay Chat Daemon (ircd) |
| 3 |
* |
| 4 |
* Copyright (c) 1997-2018 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 fdlist.c |
| 23 |
* \brief Maintains a list of file descriptors. |
| 24 |
* \version $Id$ |
| 25 |
*/ |
| 26 |
|
| 27 |
#include "stdinc.h" |
| 28 |
#include "fdlist.h" |
| 29 |
#include "client.h" /* struct Client */ |
| 30 |
#include "irc_string.h" |
| 31 |
#include "s_bsd.h" /* comm_setselect */ |
| 32 |
#include "send.h" |
| 33 |
#include "memory.h" |
| 34 |
#include "numeric.h" |
| 35 |
#include "misc.h" |
| 36 |
#include "res.h" |
| 37 |
|
| 38 |
|
| 39 |
fde_t *fd_table; |
| 40 |
int number_fd = LEAKED_FDS; |
| 41 |
int hard_fdlimit = 0; |
| 42 |
int highest_fd; |
| 43 |
|
| 44 |
|
| 45 |
void |
| 46 |
fdlist_init(void) |
| 47 |
{ |
| 48 |
struct rlimit limit; |
| 49 |
|
| 50 |
if (!getrlimit(RLIMIT_NOFILE, &limit)) |
| 51 |
{ |
| 52 |
limit.rlim_cur = limit.rlim_max; |
| 53 |
setrlimit(RLIMIT_NOFILE, &limit); |
| 54 |
} |
| 55 |
|
| 56 |
/* allow MAXCLIENTS_MIN clients even at the cost of MAX_BUFFER and |
| 57 |
* some not really LEAKED_FDS */ |
| 58 |
hard_fdlimit = IRCD_MAX(getdtablesize(), LEAKED_FDS + MAX_BUFFER + MAXCLIENTS_MIN); |
| 59 |
fd_table = xcalloc(sizeof(fde_t) * hard_fdlimit); |
| 60 |
} |
| 61 |
|
| 62 |
static void |
| 63 |
fdlist_update_highest_fd(int fd, int opening) |
| 64 |
{ |
| 65 |
if (fd < highest_fd) |
| 66 |
return; |
| 67 |
|
| 68 |
assert(fd < hard_fdlimit); |
| 69 |
|
| 70 |
if (fd > highest_fd) |
| 71 |
{ |
| 72 |
/* |
| 73 |
* assert() that we are not closing a FD bigger than our known highest FD. |
| 74 |
*/ |
| 75 |
assert(opening); |
| 76 |
highest_fd = fd; |
| 77 |
return; |
| 78 |
} |
| 79 |
|
| 80 |
/* If we are here, then fd == highest_fd */ |
| 81 |
/* |
| 82 |
* assert() that we are closing the highest FD; we can't be re-opening it. |
| 83 |
*/ |
| 84 |
assert(!opening); |
| 85 |
|
| 86 |
while (highest_fd >= 0 && fd_table[highest_fd].flags.open == 0) |
| 87 |
--highest_fd; |
| 88 |
} |
| 89 |
|
| 90 |
/* Called to open a given filedescriptor */ |
| 91 |
fde_t * |
| 92 |
fd_open(int fd, int is_socket, const char *desc) |
| 93 |
{ |
| 94 |
fde_t *F = &fd_table[fd]; |
| 95 |
|
| 96 |
assert(fd >= 0); |
| 97 |
assert(F->fd == 0); |
| 98 |
assert(F->flags.open == 0); |
| 99 |
|
| 100 |
/* |
| 101 |
* Note: normally we'd have to clear the other flags, but currently F |
| 102 |
* is always cleared before calling us. |
| 103 |
*/ |
| 104 |
F->fd = fd; |
| 105 |
F->comm_index = -1; |
| 106 |
F->flags.open = 1; |
| 107 |
F->flags.is_socket = is_socket; |
| 108 |
|
| 109 |
if (desc) |
| 110 |
strlcpy(F->desc, desc, sizeof(F->desc)); |
| 111 |
|
| 112 |
++number_fd; |
| 113 |
fdlist_update_highest_fd(fd, 1); |
| 114 |
|
| 115 |
return F; |
| 116 |
} |
| 117 |
|
| 118 |
/* Called to close a given filedescriptor */ |
| 119 |
void |
| 120 |
fd_close(fde_t *F) |
| 121 |
{ |
| 122 |
const int fd = F->fd; |
| 123 |
|
| 124 |
assert(F->fd >= 0); |
| 125 |
assert(F->flags.open); |
| 126 |
|
| 127 |
if (F->flags.is_socket) |
| 128 |
comm_setselect(F, COMM_SELECT_WRITE | COMM_SELECT_READ, NULL, NULL, 0); |
| 129 |
|
| 130 |
delete_resolver_queries(F); |
| 131 |
|
| 132 |
if (tls_isusing(&F->ssl)) |
| 133 |
tls_free(&F->ssl); |
| 134 |
|
| 135 |
/* Unlike squid, we're actually closing the FD here! -- adrian */ |
| 136 |
close(F->fd); |
| 137 |
memset(F, 0, sizeof(*F)); /* Must set F->flags.open == 0 before fdlist_update_highest_fd() */ |
| 138 |
|
| 139 |
--number_fd; |
| 140 |
fdlist_update_highest_fd(fd, 0); |
| 141 |
} |
| 142 |
|
| 143 |
/* |
| 144 |
* fd_dump() - dump the list of active filedescriptors |
| 145 |
*/ |
| 146 |
void |
| 147 |
fd_dump(struct Client *source_p, int parc, char *parv[]) |
| 148 |
{ |
| 149 |
for (int fd = 0; fd <= highest_fd; ++fd) |
| 150 |
{ |
| 151 |
const fde_t *F = &fd_table[fd]; |
| 152 |
|
| 153 |
if (F->flags.open) |
| 154 |
sendto_one_numeric(source_p, &me, RPL_STATSDEBUG | SND_EXPLICIT, |
| 155 |
"F :fd %-5d desc '%s'", F->fd, F->desc); |
| 156 |
} |
| 157 |
} |
| 158 |
|
| 159 |
/* |
| 160 |
* fd_note() - set the fd note |
| 161 |
* |
| 162 |
* Note: must be careful not to overflow fd_table[fd].desc when |
| 163 |
* calling. |
| 164 |
*/ |
| 165 |
void |
| 166 |
fd_note(fde_t *F, const char *format, ...) |
| 167 |
{ |
| 168 |
va_list args; |
| 169 |
|
| 170 |
if (format) |
| 171 |
{ |
| 172 |
va_start(args, format); |
| 173 |
vsnprintf(F->desc, sizeof(F->desc), format, args); |
| 174 |
va_end(args); |
| 175 |
} |
| 176 |
else |
| 177 |
F->desc[0] = '\0'; |
| 178 |
} |
| 179 |
|
| 180 |
/* Make sure stdio descriptors (0-2) and profiler descriptor (3) |
| 181 |
* always go somewhere harmless. Use -foreground for profiling |
| 182 |
* or executing from gdb */ |
| 183 |
void |
| 184 |
close_standard_fds(void) |
| 185 |
{ |
| 186 |
for (int i = 0; i < LOWEST_SAFE_FD; ++i) |
| 187 |
{ |
| 188 |
close(i); |
| 189 |
|
| 190 |
if (open("/dev/null", O_RDWR) < 0) |
| 191 |
exit(EXIT_FAILURE); /* we're hosed if we can't even open /dev/null */ |
| 192 |
} |
| 193 |
} |
| 194 |
|
| 195 |
void |
| 196 |
close_fds(void) |
| 197 |
{ |
| 198 |
for (int fd = 0; fd <= highest_fd; ++fd) |
| 199 |
close(fd); |
| 200 |
} |
