nptl/sysdeps/unix/sysv/linux/fork.c

   1 /* Copyright (C) 2002, 2003, 2007, 2008 Free Software Foundation, Inc.
   2    This file is part of the GNU C Library.
   3    Contributed by Ulrich Drepper <drepper@redhat.com>, 2002.
   4
   5    The GNU C Library is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU Lesser General Public
   7    License as published by the Free Software Foundation; either
   8    version 2.1 of the License, or (at your option) any later version.
   9
  10    The GNU C Library is distributed in the hope that it will be useful,
  11    but WITHOUT ANY WARRANTY; without even the implied warranty of
  12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13    Lesser General Public License for more details.
  14
  15    You should have received a copy of the GNU Lesser General Public
  16    License along with the GNU C Library; if not, write to the Free
  17    Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  18    02111-1307 USA.  */
  19
  20 #include <assert.h>
  21 #include <stdlib.h>
  22 #include <unistd.h>
  23 #include <sys/types.h>
  24 #include <sysdep.h>
  25 #include <libio/libioP.h>
  26 #include <tls.h>
  27 #include "fork.h"
  28 #include <hp-timing.h>
  29 #include <ldsodefs.h>
  30 #include <bits/stdio-lock.h>
  31 #include <atomic.h>
  32
  33
  34 unsigned long int *__fork_generation_pointer;
  35
  36
  37
  38 /* The single linked list of all currently registered for handlers.  */
  39 struct fork_handler *__fork_handlers;
  40
  41
  42 static void
  43 fresetlockfiles (void)
  44 {
  45   _IO_ITER i;
  46
  47   for (i = _IO_iter_begin(); i != _IO_iter_end(); i = _IO_iter_next(i))
  48     _IO_lock_init (*((_IO_lock_t *) _IO_iter_file(i)->_lock));
  49 }
  50
  51
  52 pid_t
  53 __libc_fork (void)
  54 {
  55   pid_t pid;
  56   struct used_handler
  57   {
  58     struct fork_handler *handler;
  59     struct used_handler *next;
  60   } *allp = NULL;
  61
  62   /* Run all the registered preparation handlers.  In reverse order.
  63      While doing this we build up a list of all the entries.  */
  64   struct fork_handler *runp;
  65   while ((runp = __fork_handlers) != NULL)
  66     {
  67       /* Make sure we read from the current RUNP pointer.  */
  68       atomic_full_barrier ();
  69
  70       unsigned int oldval = runp->refcntr;
  71
  72       if (oldval == 0)
  73         /* This means some other thread removed the list just after
  74            the pointer has been loaded.  Try again.  Either the list
  75            is empty or we can retry it.  */
  76         continue;
  77
  78       /* Bump the reference counter.  */
  79       if (atomic_compare_and_exchange_bool_acq (&__fork_handlers->refcntr,
  80                                                 oldval + 1, oldval))
  81         /* The value changed, try again.  */
  82         continue;
  83
  84       /* We bumped the reference counter for the first entry in the
  85          list.  That means that none of the following entries will
  86          just go away.  The unloading code works in the order of the
  87          list.
  88
  89          While executing the registered handlers we are building a
  90          list of all the entries so that we can go backward later on.  */
  91       while (1)
  92         {
  93           /* Execute the handler if there is one.  */
  94           if (runp->prepare_handler != NULL)
  95             runp->prepare_handler ();
  96
  97           /* Create a new element for the list.  */
  98           struct used_handler *newp
  99             = (struct used_handler *) alloca (sizeof (*newp));
 100           newp->handler = runp;
 101           newp->next = allp;
 102           allp = newp;
 103
 104           /* Advance to the next handler.  */
 105           runp = runp->next;
 106           if (runp == NULL)
 107             break;
 108
 109           /* Bump the reference counter for the next entry.  */
 110           atomic_increment (&runp->refcntr);
 111         }
 112
 113       /* We are done.  */
 114       break;
 115     }
 116
 117   _IO_list_lock ();
 118
 119 #ifndef NDEBUG
 120   pid_t ppid = THREAD_GETMEM (THREAD_SELF, tid);
 121 #endif
 122
 123   /* We need to prevent the getpid() code to update the PID field so
 124      that, if a signal arrives in the child very early and the signal
 125      handler uses getpid(), the value returned is correct.  */
 126   pid_t parentpid = THREAD_GETMEM (THREAD_SELF, pid);
 127   THREAD_SETMEM (THREAD_SELF, pid, -parentpid);
 128
 129 #ifdef ARCH_FORK
 130   pid = ARCH_FORK ();
 131 #else
 132 # error "ARCH_FORK must be defined so that the CLONE_SETTID flag is used"
 133   pid = INLINE_SYSCALL (fork, 0);
 134 #endif
 135
 136
 137   if (pid == 0)
 138     {
 139       struct pthread *self = THREAD_SELF;
 140
 141       assert (THREAD_GETMEM (self, tid) != ppid);
 142
 143       if (__fork_generation_pointer != NULL)
 144         *__fork_generation_pointer += 4;
 145
 146       /* Adjust the PID field for the new process.  */
 147       THREAD_SETMEM (self, pid, THREAD_GETMEM (self, tid));
 148
 149 #if HP_TIMING_AVAIL
 150       /* The CPU clock of the thread and process have to be set to zero.  */
 151       hp_timing_t now;
 152       HP_TIMING_NOW (now);
 153       THREAD_SETMEM (self, cpuclock_offset, now);
 154       GL(dl_cpuclock_offset) = now;
 155 #endif
 156
 157       /* Reset the file list.  These are recursive mutexes.  */
 158       fresetlockfiles ();
 159
 160       /* Reset locks in the I/O code.  */
 161       _IO_list_resetlock ();
 162
 163       /* Reset the lock the dynamic loader uses to protect its data.  */
 164       __rtld_lock_initialize (GL(dl_load_lock));
 165
 166       /* Run the handlers registered for the child.  */
 167       while (allp != NULL)
 168         {
 169           if (allp->handler->child_handler != NULL)
 170             allp->handler->child_handler ();
 171
 172           /* Note that we do not have to wake any possible waiter.
 173              This is the only thread in the new process.  The count
 174              may have been bumped up by other threads doing a fork.
 175              We reset it to 1, to avoid waiting for non-existing
 176              thread(s) to release the count.  */
 177           allp->handler->refcntr = 1;
 178
 179           /* XXX We could at this point look through the object pool
 180              and mark all objects not on the __fork_handlers list as
 181              unused.  This is necessary in case the fork() happened
 182              while another thread called dlclose() and that call had
 183              to create a new list.  */
 184
 185           allp = allp->next;
 186         }
 187
 188       /* Initialize the fork lock.  */
 189       __fork_lock = LLL_LOCK_INITIALIZER;
 190     }
 191   else
 192     {
 193       assert (THREAD_GETMEM (THREAD_SELF, tid) == ppid);
 194
 195       /* Restore the PID value.  */
 196       THREAD_SETMEM (THREAD_SELF, pid, parentpid);
 197
 198       /* We execute this even if the 'fork' call failed.  */
 199       _IO_list_unlock ();
 200
 201       /* Run the handlers registered for the parent.  */
 202       while (allp != NULL)
 203         {
 204           if (allp->handler->parent_handler != NULL)
 205             allp->handler->parent_handler ();
 206
 207           if (atomic_decrement_and_test (&allp->handler->refcntr)
 208               && allp->handler->need_signal)
 209             lll_futex_wake (allp->handler->refcntr, 1, LLL_PRIVATE);
 210
 211           allp = allp->next;
 212         }
 213     }
 214
 215   return pid;
 216 }
 217 weak_alias (__libc_fork, __fork)
 218 libc_hidden_def (__fork)
 219 weak_alias (__libc_fork, fork)