prefork.c revision 9aa4b0b53f1b26086d04c51d77e742b698cfa653
/* ====================================================================
* The Apache Software License, Version 1.1
*
* Copyright (c) 2000 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Apache" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation. For more
* information on the Apache Software Foundation, please see
*
* Portions of this software are based upon public domain software
* originally written at the National Center for Supercomputing Applications,
* University of Illinois, Urbana-Champaign.
*/
/*
* httpd.c: simple http daemon for answering WWW file requests
*
*
* 03-21-93 Rob McCool wrote original code (up to NCSA HTTPd 1.3)
*
* 03-06-95 blong
* changed server number for child-alone processes to 0 and changed name
* of processes
*
* 03-10-95 blong
* Added numerous speed hacks proposed by Robert S. Thau (rst@ai.mit.edu)
* including set group before fork, and call gettime before to fork
* to set up libraries.
*
* 04-14-95 rst / rh
* Brandon's code snarfed from NCSA 1.4, but tinkered to work with the
* Apache server, and also to have child processes do accept() directly.
*
* April-July '95 rst
* Extensive rework for Apache.
*/
/* TODO: this is a cobbled together prefork MPM example... it should mostly
* TODO: behave like apache-1.3... here's a short list of things I think
* TODO: need cleaning up still:
* TODO: - clean up scoreboard stuff when we figure out how to do it in 2.0
*/
#define CORE_PRIVATE
#include "ap_config.h"
#include "apr_portable.h"
#include "apr_thread_proc.h"
#include "httpd.h"
#include "mpm_default.h"
#include "mpm_status.h"
#include "http_main.h"
#include "http_log.h"
#include "http_config.h"
#include "http_core.h" /* for get_remote_host */
#include "http_connection.h"
#include "scoreboard.h"
#include "ap_mpm.h"
#include "unixd.h"
#include "mpm_common.h"
#include "iol_socket.h"
#include "ap_listen.h"
#include "ap_mmn.h"
#ifdef HAVE_SYS_TYPES_H
#endif
#ifdef HAVE_SYS_WAIT_H
#endif
#ifdef HAVE_SYS_SOCKET_H
#endif
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_NETINET_TCP_H
#endif
#ifdef HAVE_BSTRING_H
#include <bstring.h> /* for IRIX, FD_SET calls bzero() */
#endif
#ifdef HAVE_STRINGS_H
#include <strings.h>
#endif
#ifdef HAVE_TIME_H
#include <time.h>
#endif
#include <signal.h>
/* config globals */
static int ap_max_requests_per_child=0;
static const char *ap_pid_fname=NULL;
static ap_lock_t *accept_lock;
static const char *ap_scoreboard_fname=NULL;
static const char *ap_lock_fname;
static int ap_daemons_to_start=0;
static int ap_daemons_min_free=0;
static int ap_daemons_max_free=0;
static int ap_daemons_limit=0;
static time_t ap_restart_time=0;
static int ap_extended_status = 0;
static int maintain_connection_status = 1;
/*
* The max child slot ever assigned, preserved across restarts. Necessary
* to deal with MaxClients changes across SIGUSR1 restarts. We use this
* value to optimize routines that have to scan the entire scoreboard.
*/
int ap_max_daemons_limit = -1;
char ap_coredump_dir[MAX_STRING_LEN];
/* *Non*-shared http_main globals... */
static ap_socket_t *sd;
static int listenmaxfd;
/* one_process --- debugging mode variable; can be set from the command line
* with the -X flag. If set, this gets you the child_main loop running
* in the process which originally started up (no detach, no make_child),
* which is a pretty nice debugging environment. (You'll get a SIGHUP
* early in standalone_main; just continue through. This is the server
* trying to kill off any child processes which it might have lying
* around --- Apache doesn't keep track of their pids, it just sends
* SIGHUP to the process group, ignoring it in the root process.
* Continue through and you'll be fine.).
*/
static int one_process = 0;
int ap_my_pid; /* it seems silly to call getpid all the time */
#ifndef MULTITHREAD
static int my_child_num;
#endif
#ifdef TPF
int tpf_child = 0;
#endif /* TPF */
#ifdef GPROF
/*
* change directory for gprof to plop the gmon.out file
* configure in httpd.conf:
* GprofDir logs/ -> $ServerRoot/logs/gmon.out
* GprofDir logs/% -> $ServerRoot/logs/gprof.$pid/gmon.out
*/
static void chdir_for_gprof(void)
{
if(dir) {
char buf[512];
}
"gprof: error creating directory %s", dir);
}
}
else {
}
}
#else
#define chdir_for_gprof()
#endif
/* XXX - I don't know if TPF will ever use this module or not, so leave
* the ap_check_signals calls in but disable them - manoj */
#define ap_check_signals()
/* a clean exit from a child with proper cleanup */
static void clean_child_exit(int code)
{
if (pchild) {
}
}
static void expand_lock_fname(ap_pool_t *p)
{
/* XXXX possibly bogus cast */
}
/* Initialize mutex lock.
* Done by each child at its birth
*/
static void accept_mutex_child_init(ap_pool_t *p)
{
}
/* Initialize mutex lock.
* Must be safe to call this on a restart.
*/
static void accept_mutex_init(ap_pool_t *p)
{
if (rv) {
}
}
static void accept_mutex_on(void)
{
}
static void accept_mutex_off(void)
{
}
/* On some architectures it's safe to do unserialized accept()s in the single
* Listen case. But it's never safe to do it in the case where there's
* multiple Listen statements. Define SINGLE_LISTEN_UNSERIALIZED_ACCEPT
* when it's safe in the single Listen case.
*/
#else
#endif
#include "apr_shmem.h"
static ap_status_t cleanup_shared_mem(void *d)
{
return APR_SUCCESS;
}
static void setup_shared_mem(ap_pool_t *p)
{
char buf[512];
const char *fname;
if (ap_shm_init(&scoreboard_shm, SCOREBOARD_SIZE + NEW_SCOREBOARD_SIZE + 40, fname, p) != APR_SUCCESS) {
}
if (ap_scoreboard_image == NULL) {
}
}
static void reopen_scoreboard(ap_pool_t *p)
{
}
#endif
/* Called by parent process */
static void reinit_scoreboard(ap_pool_t *p)
{
int running_gen = 0;
if (ap_scoreboard_image)
if (ap_scoreboard_image == NULL) {
setup_shared_mem(p);
}
}
/* Routines called to deal with the scoreboard image
* --- note that we do *not* need write locks, since update_child_status
* only updates a *single* record in place, and only one process writes to
* a given scoreboard slot at a time (either the child process owning that
* slot, or the parent, noting that the child has died).
*
* As a final note --- setting the score entry to getpid() is always safe,
* since when the parent is writing an entry, it's only noting SERVER_DEAD
* anyway.
*/
ap_inline void ap_sync_scoreboard_image(void)
{
#ifdef SCOREBOARD_FILE
lseek(scoreboard_fd, 0L, 0);
;
#endif
}
API_EXPORT(int) ap_exists_scoreboard_image(void)
{
return (ap_scoreboard_image ? 1 : 0);
}
API_EXPORT(int) ap_get_max_daemons(void)
{
return ap_max_daemons_limit;
}
{
#ifdef SCOREBOARD_FILE
#endif
}
{
int old_status;
if (child_num < 0)
return -1;
if (ap_extended_status) {
/*
* Reset individual counters
*/
if (status == SERVER_DEAD) {
ss->my_access_count = 0L;
ss->my_bytes_served = 0L;
}
ss->conn_count = (unsigned short) 0;
ss->conn_bytes = (unsigned long) 0;
}
if (r) {
conn_rec *c = r->connection;
if (r->the_request == NULL) {
} else {
/* Don't reveal the password in the server-status view */
}
}
}
/* clean up the slot's vhostrec pointer (maybe re-used)
* and mark the slot as belonging to a new generation.
*/
#ifdef SCOREBOARD_FILE
sizeof(parent_score));
#endif
}
return old_status;
}
static void update_scoreboard_global(void)
{
#ifdef SCOREBOARD_FILE
sizeof ap_scoreboard_image->global);
#endif
}
{
if (child_num < 0)
return;
if (status == START_PREQUEST) {
}
else if (status == STOP_PREQUEST) {
}
}
/*
static void increment_counts(int child_num, request_rec *r)
{
long int bs = 0;
short_score *ss;
ap_sync_scoreboard_image();
ss = &ap_scoreboard_image->servers[child_num];
if (r->sent_bodyct)
ap_bgetopt(r->connection->client, BO_BYTECT, &bs);
#ifdef HAVE_TIMES
times(&ss->times);
#endif
ss->access_count++;
ss->my_access_count++;
ss->conn_count++;
ss->bytes_served += (unsigned long) bs;
ss->my_bytes_served += (unsigned long) bs;
ss->conn_bytes += (unsigned long) bs;
put_scoreboard_info(child_num, ss);
}
*/
{
int i;
for (i = 0; i < ap_max_daemons_limit; ++i)
return i;
return -1;
}
#if defined(NEED_WAITPID)
/*
Systems without a real waitpid sometimes lose a child's exit while waiting
for another. Search through the scoreboard for missing children.
*/
{
int n, pid;
for (n = 0; n < ap_max_daemons_limit; ++n) {
/* just mark it as having a successful exit status */
return(pid);
}
}
return 0;
}
#endif
/* handle all varieties of core dumping signals */
static void sig_coredump(int sig)
{
/* At this point we've got sig blocked, because we're still inside
* the signal handler. When we leave the signal handler it will
* be unblocked, and we'll take the signal... and coredump or whatever
* is appropriate for this particular Unix. In addition the parent
* will see the real signal we received -- whereas if we called
* abort() here, the parent would only see SIGABRT.
*/
}
/*****************************************************************
* Connection structures and accounting...
*/
{
clean_child_exit(0);
}
static int volatile deferred_die;
static int volatile usr1_just_die;
static void usr1_handler(int sig)
{
if (usr1_just_die) {
}
deferred_die = 1;
}
/* volatile just in case */
static int volatile shutdown_pending;
static int volatile restart_pending;
static int volatile is_graceful;
ap_generation_t volatile ap_my_generation=0;
{
if (shutdown_pending == 1) {
/* Um, is this _probably_ not an error, if the user has
* tried to do a shutdown twice quickly, so we won't
* worry about reporting it.
*/
return;
}
shutdown_pending = 1;
}
{
if (restart_pending == 1) {
/* Probably not an error - don't bother reporting it */
return;
}
restart_pending = 1;
}
}
static void set_signals(void)
{
#ifndef NO_USE_SIGACTION
if (!one_process) {
#if defined(SA_ONESHOT)
#elif defined(SA_RESETHAND)
#endif
#ifdef SIGBUS
#endif
#ifdef SIGABORT
#endif
#ifdef SIGABRT
#endif
#ifdef SIGILL
#endif
}
#ifdef SIGINT
#endif
#ifdef SIGXCPU
#endif
#ifdef SIGXFSZ
#endif
#ifdef SIGPIPE
#endif
/* we want to ignore HUPs and USR1 while we're busy processing one */
#else
if (!one_process) {
#ifdef SIGBUS
#endif /* SIGBUS */
#ifdef SIGABORT
#endif /* SIGABORT */
#ifdef SIGABRT
#endif /* SIGABRT */
#ifdef SIGILL
#endif /* SIGILL */
#ifdef SIGXCPU
#endif /* SIGXCPU */
#ifdef SIGXFSZ
#endif /* SIGXFSZ */
}
#ifdef SIGHUP
#endif /* SIGHUP */
#ifdef SIGUSR1
#endif /* SIGUSR1 */
#ifdef SIGPIPE
#endif /* SIGPIPE */
#endif
}
static void sock_disable_nagle(int s)
{
/* The Nagle algorithm says that we should delay sending partial
* packets in hopes of getting more data. We don't want to do
* this; we are not telnet. There are bad interactions between
* persistent connections and Nagle's algorithm that have very severe
* performance penalties. (Failing to disable Nagle is not much of a
* problem with simple HTTP.)
*
* In spite of these problems, failure here is not a shooting offense.
*/
int just_say_no = 1;
sizeof(int)) < 0) {
"setsockopt: (TCP_NODELAY)");
}
}
#else
#define sock_disable_nagle(s) /* NOOP */
#endif
/*****************************************************************
* Child process main loop.
* The following vars are static to avoid getting clobbered by longjmp();
* they are really private to child_main.
*/
static int srv;
static ap_socket_t *csd;
static int requests_this_child;
int ap_graceful_stop_signalled(void)
{
if (deferred_die ||
return 1;
}
return 0;
}
static void child_main(int child_num_arg)
{
int sockdes;
requests_this_child = 0;
/* Get a sub context for global allocations in this child, so that
* we can have cleanups occur when the child exits.
*/
/* needs to be done before we switch UIDs so we have permissions */
if (unixd_setup_child()) {
}
#ifdef OS2
/* Stop Ctrl-C/Ctrl-Break signals going to child processes */
{
unsigned long ulTimes;
}
#endif
while (!ap_graceful_stop_signalled()) {
/* Prepare to receive a SIGUSR1 due to graceful restart so that
* we can exit cleanly.
*/
usr1_just_die = 1;
/*
* (Re)initialize this child to a pre-connection state.
*/
current_conn = NULL;
if ((ap_max_requests_per_child > 0
&& requests_this_child++ >= ap_max_requests_per_child)) {
clean_child_exit(0);
}
/*
* Wait for an acceptable connection to arrive.
*/
/* Lock around "accept", if necessary */
for (;;) {
if (ap_listeners->next) {
/* more than one socket */
/* Single Unix documents select as returning errnos
* EBADF, EINTR, and EINVAL... and in none of those
* cases does it make sense to continue. In fact
* on Linux 2.0.x we seem to end up with EFAULT
* occasionally, and we'd loop forever due to it.
*/
clean_child_exit(1);
}
if (srv <= 0)
continue;
/* we remember the last_lr we searched last time around so that
we don't end up starving any particular listening socket */
lr = ap_listeners;
}
else {
if (!lr)
lr = ap_listeners;
}
do {
goto got_listener;
if (!lr)
lr = ap_listeners;
}
/* FIXME: if we get here, something bad has happened, and we're
probably gonna spin forever.
*/
continue;
}
else {
/* only one socket, just pretend we did the other stuff */
}
/* if we accept() something we don't want to die, so we have to
* defer the exit
*/
usr1_just_die = 0;
for (;;) {
if (deferred_die) {
/* we didn't get a socket, and we were told to die */
clean_child_exit(0);
}
break;
}
if (stat == APR_SUCCESS)
break; /* We have a socket ready for reading */
else {
/* TODO: this accept result handling stuff should be abstracted...
* it's already out of date between the various unix mpms
*/
/* Our old behaviour here was to continue after accept()
* errors. But this leads us into lots of troubles
* because most of the errors are quite fatal. For
* example, EMFILE can be caused by slow descriptor
* leaks (say in a 3rd party module, or libc). It's
* foolish for us to continue after an EMFILE. We also
* seem to tickle kernel bugs on some platforms which
* lead to never-ending loops here. So it seems best
* to just exit in most cases.
*/
switch (stat) {
#ifdef EPROTO
/* EPROTO on certain older kernels really means
* ECONNABORTED, so we need to ignore it for them.
* See discussion in new-httpd archives nh.9701
* search for EPROTO.
*
* Also see nh.9603, search for EPROTO:
* There is potentially a bug in Solaris 2.x x<6,
* and other boxes that implement tcp sockets in
* userland (i.e. on top of STREAMS). On these
* systems, EPROTO can actually result in a fatal
* loop. See PR#981 for example. It's hard to
* handle both uses of EPROTO.
*/
case EPROTO:
#endif
#ifdef ECONNABORTED
case ECONNABORTED:
#endif
/* Linux generates the rest of these, other tcp
* stacks (i.e. bsd) tend to hide them behind
* getsockopt() interfaces. They occur when
* the net goes sour or the client disconnects
* after the three-way handshake has been done
* in the kernel but before userland has picked
* up the socket.
*/
#ifdef ECONNRESET
case ECONNRESET:
#endif
#ifdef ETIMEDOUT
case ETIMEDOUT:
#endif
#ifdef EHOSTUNREACH
case EHOSTUNREACH:
#endif
#ifdef ENETUNREACH
case ENETUNREACH:
#endif
break;
#ifdef ENETDOWN
case ENETDOWN:
/*
* When the network layer has been shut down, there
* is not much use in simply exiting: the parent
* would simply re-create us (and we'd fail again).
* Use the CHILDFATAL code to tear the server down.
* @@@ Martin's idea for possible improvement:
* A different approach would be to define
* a new APEXIT_NETDOWN exit code, the reception
* of which would make the parent shutdown all
* children, then idle-loop until it detected that
* the network is up again, and restart the children.
* Ben Hyde noted that temporary ENETDOWN situations
* occur in mobile IP.
*/
"ap_accept: giving up.");
#endif /*ENETDOWN*/
#ifdef TPF
case EINACT:
"offload device inactive");
break;
default:
#else
default:
"ap_accept: (client socket)");
clean_child_exit(1);
#endif
}
}
if (ap_graceful_stop_signalled()) {
clean_child_exit(0);
}
usr1_just_die = 1;
}
/* We've got a socket, let's at least process one request off the
* socket before we accept a graceful restart request. We set
* the signal to ignore because we don't want to disturb any
* third party code.
*/
/*
* We now have a connection, so set it up with the appropriate
*/
if (sockdes >= FD_SETSIZE) {
"new file descriptor %d is too large; you probably need "
"to rebuild Apache with a larger FD_SETSIZE "
"(currently %d)",
continue;
}
#ifdef TPF
if (sockdes == 0) /* 0 is invalid socket for TPF */
continue;
#endif
(request_rec *) NULL);
}
}
{
int pid;
}
if (one_process) {
#ifdef SIGQUIT
#endif
}
#ifdef _OSD_POSIX
/* BS2000 requires a "special" version of fork() before a setuid() call */
#else
#endif
/* fork didn't succeed. Fix the scoreboard or else
* it will say SERVER_STARTING forever and ever
*/
/* In case system resources are maxxed out, we don't want
Apache running away with the CPU trying to fork over and
over and over again. */
sleep(10);
return -1;
}
if (!pid) {
#ifdef AIX_BIND_PROCESSOR
/* by default AIX binds to a single processor
* this bit unbinds children which will then bind to another cpu
*/
#include <sys/processor.h>
"processor unbind failed %d", status);
}
#endif
/* Disable the restart signal handlers and enable the just_die stuff.
* Note that since restart() just notes that a restart has been
* requested there's no race condition here.
*/
}
#ifdef SCOREBOARD_FILE
sizeof(parent_score));
#endif
return 0;
}
/* start up a bunch of children */
static void startup_children(int number_to_start)
{
int i;
for (i = 0; number_to_start && i < ap_daemons_limit; ++i) {
continue;
}
break;
}
}
}
/*
* idle_spawn_rate is the number of children that will be spawned on the
* next maintenance cycle if there aren't enough idle servers. It is
* doubled up to MAX_SPAWN_RATE, and reset only when a cycle goes by
* without the need to spawn.
*/
static int idle_spawn_rate = 1;
#ifndef MAX_SPAWN_RATE
#define MAX_SPAWN_RATE (32)
#endif
static int hold_off_on_exponential_spawning;
static void perform_idle_server_maintenance(void)
{
int i;
int to_kill;
int idle_count;
int free_length;
int free_slots[MAX_SPAWN_RATE];
int last_non_dead;
int total_non_dead;
/* initialize the free_list */
free_length = 0;
to_kill = -1;
idle_count = 0;
last_non_dead = -1;
total_non_dead = 0;
for (i = 0; i < ap_daemons_limit; ++i) {
int status;
break;
if (status == SERVER_DEAD) {
/* try to keep children numbers as low as possible */
if (free_length < idle_spawn_rate) {
free_slots[free_length] = i;
++free_length;
}
}
else {
/* We consider a starting server as idle because we started it
* at least a cycle ago, and if it still hasn't finished starting
* then we're just going to swamp things worse by forking more.
* So we hopefully won't need to fork more if we count it.
* This depends on the ordering of SERVER_READY and SERVER_STARTING.
*/
if (status <= SERVER_READY) {
++ idle_count;
/* always kill the highest numbered child if we have to...
* no really well thought out reason ... other than observing
* the server behaviour under linux where lower numbered children
* tend to service more hits (and hence are more likely to have
* their data in cpu caches).
*/
to_kill = i;
}
last_non_dead = i;
}
}
if (idle_count > ap_daemons_max_free) {
/* kill off one child... we use SIGUSR1 because that'll cause it to
* shut down gracefully, in case it happened to pick up a request
* while we were counting
*/
idle_spawn_rate = 1;
}
else if (idle_count < ap_daemons_min_free) {
/* terminate the free list */
if (free_length == 0) {
/* only report this condition once */
static int reported = 0;
if (!reported) {
"server reached MaxClients setting, consider"
" raising the MaxClients setting");
reported = 1;
}
idle_spawn_rate = 1;
}
else {
if (idle_spawn_rate >= 8) {
"server seems busy, (you may need "
"to increase StartServers, or Min/MaxSpareServers), "
"spawning %d children, there are %d idle, and "
"%d total children", idle_spawn_rate,
}
for (i = 0; i < free_length; ++i) {
#ifdef TPF
if(free_length == 1) {
shutdown_pending = 1;
"No active child processes: shutting down");
}
}
#else
#endif /* TPF */
}
/* the next time around we want to spawn twice as many if this
* wasn't good enough, but not if we've just done a graceful
*/
}
else if (idle_spawn_rate < MAX_SPAWN_RATE) {
idle_spawn_rate *= 2;
}
}
}
else {
idle_spawn_rate = 1;
}
}
/* Useful to erase the status of children that might be from previous
* generations */
static void ap_prefork_force_reset_connection_status(long conn_id)
{
int i;
for (i = 0; i < STATUSES_PER_CONNECTION; i++) {
} }
void ap_reset_connection_status(long conn_id)
{
if (maintain_connection_status) {
}
}
/*****************************************************************
* Executive routines.
*/
{
ap_server_conf = s;
if (ap_setup_listeners(s)) {
/* XXX: hey, what's the right way for the mpm to indicate a fatal error? */
return 1;
}
if (!is_graceful) {
}
#ifdef SCOREBOARD_FILE
else {
}
#endif
set_signals();
/* If we're doing a graceful_restart then we're going to see a lot
* of children exiting immediately when we get into the main loop
* below (because we just sent them SIGUSR1). This happens pretty
* rapidly... and for each one that exits we'll start a new one until
* we reach at least daemons_min_free. But we may be permitted to
* start more than that, so we'll just keep track of how many we're
* supposed to start up without the 1 second penalty between each fork.
*/
}
if (!is_graceful) {
}
else {
/* give the system some time to recover before kicking into
* exponential mode */
}
"%s configured -- resuming normal operations",
"Server built: %s", ap_get_server_built());
restart_pending = shutdown_pending = 0;
while (!restart_pending && !shutdown_pending) {
int child_slot;
/* this is a memory leak, but I'll fix it later. */
/* XXX: if it takes longer than 1 second for all our children
* to start up and get into IDLE state then we may spawn an
* extra child
*/
/* non-fatal death... note that it's gone in the scoreboard. */
if (child_slot >= 0) {
(request_rec *) NULL);
&& child_slot < ap_daemons_limit) {
/* we're still doing a 1-for-1 replacement of dead
* children with new children
*/
}
#ifdef APR_HAS_OTHER_CHILD
}
/* handled */
#endif
}
else if (is_graceful) {
/* Great, we've probably just lost a slot in the
* scoreboard. Somehow we don't know about this
* child.
*/
0, ap_server_conf,
}
/* Don't perform idle maintenance when a child dies,
* only do it when there's a timeout. Remember only a
* finite number of children can die, and it's pretty
* pathological for a lot to die suddenly.
*/
continue;
}
else if (remaining_children_to_start) {
/* we hit a 1 second timeout in which none of the previous
* generation of children needed to be reaped... so assume
* they're all done, and pick up the slack if any is left.
*/
/* In any event we really shouldn't do the code below because
* few of the servers we just started are in the IDLE state
* yet, so we'd mistakenly create an extra server.
*/
continue;
}
#ifdef TPF
sleep(1);
#endif /*TPF */
}
if (shutdown_pending) {
/* Time to gracefully shut down:
* Kill child processes, tell them to call child_exit, etc...
*/
}
/* cleanup pid file on normal shutdown */
{
0, ap_server_conf,
"removed PID file %s (pid=%ld)",
}
"caught SIGTERM, shutting down");
return 1;
}
/* we've been told to restart */
if (one_process) {
/* not worth thinking about */
return 1;
}
/* advance to the next generation */
/* XXX: we really need to make sure this new generation number isn't in
* use by any of the children.
*/
if (is_graceful) {
#ifndef SCOREBOARD_FILE
int i;
#endif
"SIGUSR1 received. Doing graceful restart");
/* kill off the idle ones */
}
#ifndef SCOREBOARD_FILE
/* This is mostly for debugging... so that we know what is still
* gracefully dealing with existing request. But we can't really
* do it if we're in a SCOREBOARD_FILE because it'll cause
* corruption too easily.
*/
for (i = 0; i < ap_daemons_limit; ++i) {
}
}
#endif
}
else {
/* Kill 'em off */
}
ap_reclaim_child_processes(0); /* Not when just starting up */
"SIGHUP received. Attempting to restart");
}
if (!is_graceful) {
}
return 0;
}
{
static int restart_num = 0;
/* sigh, want this only the second time around */
if (restart_num++ == 1) {
is_graceful = 0;
if (!one_process) {
ap_detach();
}
}
ap_extended_status = 0;
}
static void prefork_hooks(void)
{
INIT_SIGLIST();
#ifdef AUX3
(void) set42sig();
#endif
/* TODO: set one_process properly */ one_process = 0;
}
{
return err;
}
return "PidFile directive not allowed in <VirtualHost>";
}
ap_pid_fname = arg;
return NULL;
}
{
return err;
}
return NULL;
}
{
return err;
}
ap_lock_fname = arg;
return NULL;
}
{
return err;
}
return NULL;
}
{
return err;
}
if (ap_daemons_min_free <= 0) {
"WARNING: detected MinSpareServers set to non-positive.");
"Resetting to 1 to avoid almost certain Apache failure.");
"Please read the documentation.");
ap_daemons_min_free = 1;
}
return NULL;
}
{
return err;
}
return NULL;
}
{
return err;
}
if (ap_daemons_limit > HARD_SERVER_LIMIT) {
"WARNING: MaxClients of %d exceeds compile time limit "
" lowering MaxClients to %d. To increase, please "
"see the", HARD_SERVER_LIMIT);
" HARD_SERVER_LIMIT define in %s.",
}
else if (ap_daemons_limit < 1) {
"WARNING: Require MaxClients > 0, setting to 1");
ap_daemons_limit = 1;
}
return NULL;
}
{
return err;
}
return NULL;
}
{
const char *fname;
return err;
}
" does not exist or is not a directory", NULL);
}
return NULL;
}
/* Stub functions until this MPM supports the connection status API */
/* Don't mess with the string you get back from this function */
{
int i = 0;
if (!maintain_connection_status) return "";
while (i < STATUSES_PER_CONNECTION) {
break;
}
}
}
return NULL;
}
{
int i;
long *array_slot;
connection_list = ap_make_array(p, 0, sizeof(long));
/* We assume that there is a connection iff it has an entry in the status
* table. Connections without any status sound problematic to me, so this
* is probably for the best. - manoj */
for (i = 0; i < ap_max_daemons_limit; i++) {
*array_slot = i;
}
}
return connection_list;
}
{
int i = 0;
char **array_slot;
while (i < STATUSES_PER_CONNECTION) {
break;
}
i++;
}
return key_list;
}
/* Note: no effort is made here to prevent multiple threads from messing with
* a single connection at the same time. ap_update_connection_status should
* only be called by the thread that owns the connection */
const char *value)
{
int i = 0;
if (!maintain_connection_status) return;
while (i < STATUSES_PER_CONNECTION) {
break;
}
return;
}
i++;
}
/* Not found. Add an entry for this value */
if (i >= STATUSES_PER_CONNECTION) {
/* No room. Oh well, not much anyone can do about it. */
return;
}
return;
}
{
int i, j;
/* Go ahead and return what's in the connection status table even if we
* aren't maintaining it. We can at least look at what children from
* previous generations are up to. */
for (i = 0; i < ap_max_daemons_limit; i++) {
continue;
array_slot->conn_id = i;
for (j = 0; j < STATUSES_PER_CONNECTION; j++) {
}
else {
break;
}
}
}
return server_status;
}
static const command_rec prefork_cmds[] = {
"A file for logging the server process ID"),
"A file for Apache to maintain runtime process management information"),
"The lockfile used when Apache needs to lock the accept() call"),
"Number of child processes launched at server startup"),
"Minimum number of idle children, to handle request spikes"),
"Maximum number of idle children"),
"Maximum number of children alive at the same time"),
"Maximum number of requests a particular child serves before dying."),
"The location of the directory Apache changes to before dumping core"),
{ NULL }
};
NULL, /* hook to run before apache parses args */
NULL, /* create per-directory config structure */
NULL, /* merge per-directory config structures */
NULL, /* create per-server config structure */
NULL, /* merge per-server config structures */
prefork_cmds, /* command ap_table_t */
NULL, /* handlers */
prefork_hooks, /* register hooks */
};