RetroArch/deps/pthreads/pthread_barrier.c

/*
 * pthread_barrier.c
 *
 * Description:
 * This translation unit implements barrier primitives.
 *
 * --------------------------------------------------------------------------
 *
 *      Pthreads-embedded (PTE) - POSIX Threads Library for embedded systems
 *      Copyright(C) 2008 Jason Schmidlapp
 *
 *      Contact Email: jschmidlapp@users.sourceforge.net
 *
 *
 *      Based upon Pthreads-win32 - POSIX Threads Library for Win32
 *      Copyright(C) 1998 John E. Bossom
 *      Copyright(C) 1999,2005 Pthreads-win32 contributors
 *
 *      Contact Email: rpj@callisto.canberra.edu.au
 *
 *      The original list of contributors to the Pthreads-win32 project
 *      is contained in the file CONTRIBUTORS.ptw32 included with the
 *      source code distribution. The list can also be seen at the
 *      following World Wide Web location:
 *      http://sources.redhat.com/pthreads-win32/contributors.html
 *
 *      This library is free software; you can redistribute it and/or
 *      modify it under the terms of the GNU Lesser General Public
 *      License as published by the Free Software Foundation; either
 *      version 2 of the License, or (at your option) any later version.
 *
 *      This library is distributed in the hope that it will be useful,
 *      but WITHOUT ANY WARRANTY; without even the implied warranty of
 *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *      Lesser General Public License for more details.
 *
 *      You should have received a copy of the GNU Lesser General Public
 *      License along with this library in the file COPYING.LIB;
 *      if not, write to the Free Software Foundation, Inc.,
 *      59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
 */

#include <stdlib.h>

#include "pthread.h"
#include "implement.h"

int pthread_barrier_destroy (pthread_barrier_t * barrier)
{
   int result = 0;
   pthread_barrier_t b;

   if (barrier == NULL || *barrier == (pthread_barrier_t) PTE_OBJECT_INVALID)
      return EINVAL;

   b = *barrier;
   *barrier = NULL;

   if (0 == (result = sem_destroy (&(b->semBarrierBreeched[0]))))
   {
      if (0 == (result = sem_destroy (&(b->semBarrierBreeched[1]))))
      {
         (void) free (b);
         return 0;
      }
      (void) sem_init (&(b->semBarrierBreeched[0]), b->pshared, 0);
   }

   *barrier = b;
   return (result);
}

int pthread_barrier_init (pthread_barrier_t * barrier,
      const pthread_barrierattr_t * attr, unsigned int count)
{
   pthread_barrier_t b;

   if (barrier == NULL || count == 0)
      return EINVAL;

   if (NULL != (b = (pthread_barrier_t) calloc (1, sizeof (*b))))
   {
      b->pshared = (attr != NULL && *attr != NULL
            ? (*attr)->pshared : PTHREAD_PROCESS_PRIVATE);

      b->nCurrentBarrierHeight = b->nInitialBarrierHeight = count;
      b->iStep = 0;

      /*
       * Two semaphores are used in the same way as two stepping
       * stones might be used in crossing a stream. Once all
       * threads are safely on one stone, the other stone can
       * be moved ahead, and the threads can start moving to it.
       * If some threads decide to eat their lunch before moving
       * then the other threads have to wait.
       */
      if (0 == sem_init (&(b->semBarrierBreeched[0]), b->pshared, 0))
      {
         if (0 == sem_init (&(b->semBarrierBreeched[1]), b->pshared, 0))
         {
            *barrier = b;
            return 0;
         }
         (void) sem_destroy (&(b->semBarrierBreeched[0]));
      }
      (void) free (b);
   }

   return ENOMEM;
}

int pthread_barrier_wait (pthread_barrier_t * barrier)
{
   int result;
   int step;
   pthread_barrier_t b;

   if (barrier == NULL || *barrier == (pthread_barrier_t) PTE_OBJECT_INVALID)
      return EINVAL;

   b = *barrier;
   step = b->iStep;

   if (0 == PTE_ATOMIC_DECREMENT ((int *) &(b->nCurrentBarrierHeight)))
   {
      /* Must be done before posting the semaphore. */
      b->nCurrentBarrierHeight = b->nInitialBarrierHeight;

      /*
       * There is no race condition between the semaphore wait and post
       * because we are using two alternating semas and all threads have
       * entered barrier_wait and checked nCurrentBarrierHeight before this
       * barrier's sema can be posted. Any threads that have not quite
       * entered sem_wait below when the multiple_post has completed
       * will nevertheless continue through the semaphore (barrier)
       * and will not be left stranded.
       */
      result = (b->nInitialBarrierHeight > 1
            ? sem_post_multiple (&(b->semBarrierBreeched[step]),
               b->nInitialBarrierHeight - 1) : 0);
   }
   else
   {
      /*
       * Use the non-cancelable version of sem_wait().
       */
      result = sem_wait (&(b->semBarrierBreeched[step]));
      //      result = sem_wait_nocancel (&(b->semBarrierBreeched[step]));
   }

   /*
    * The first thread across will be the PTHREAD_BARRIER_SERIAL_THREAD.
    * This also sets up the alternate semaphore as the next barrier.
    */
   if (0 == result)
   {
      result = (step ==
            PTE_ATOMIC_COMPARE_EXCHANGE (& (b->iStep),(1L - step),step) ?
            PTHREAD_BARRIER_SERIAL_THREAD : 0);
   }

   return (result);
}