Gecko [ sachasauda.akalacademy.ac.in ]

Name	Size	Permission
algo.h	95.66 KB	-rw-r--r--
algobase.h	11.42 KB	-rw-r--r--
algorithm	1.35 KB	-rw-r--r--
algorithmfwd.h	31.45 KB	-rw-r--r--
balanced_quicksort.h	16.38 KB	-rw-r--r--
base.h	11.96 KB	-rw-r--r--
basic_iterator.h	1.55 KB	-rw-r--r--
checkers.h	2.25 KB	-rw-r--r--
compatibility.h	3.7 KB	-rw-r--r--
compiletime_settings.h	2.76 KB	-rw-r--r--
equally_split.h	3.28 KB	-rw-r--r--
features.h	3.46 KB	-rw-r--r--
find.h	13.27 KB	-rw-r--r--
find_selectors.h	6.83 KB	-rw-r--r--
for_each.h	3.85 KB	-rw-r--r--
for_each_selectors.h	10.32 KB	-rw-r--r--
iterator.h	5.54 KB	-rw-r--r--
list_partition.h	6.38 KB	-rw-r--r--
losertree.h	27.78 KB	-rw-r--r--
merge.h	9.34 KB	-rw-r--r--
multiseq_selection.h	21.56 KB	-rw-r--r--
multiway_merge.h	68.78 KB	-rw-r--r--
multiway_mergesort.h	14.91 KB	-rw-r--r--
numeric	20.38 KB	-rw-r--r--
numericfwd.h	7.32 KB	-rw-r--r--
omp_loop.h	3.94 KB	-rw-r--r--
omp_loop_static.h	4.01 KB	-rw-r--r--
par_loop.h	4.45 KB	-rw-r--r--
parallel.h	1.54 KB	-rw-r--r--
partial_sum.h	7.3 KB	-rw-r--r--
partition.h	14.58 KB	-rw-r--r--
queue.h	5.4 KB	-rw-r--r--
quicksort.h	5.98 KB	-rw-r--r--
random_number.h	4.13 KB	-rw-r--r--
random_shuffle.h	18.24 KB	-rw-r--r--
search.h	5.26 KB	-rw-r--r--
set_operations.h	14.25 KB	-rw-r--r--
settings.h	12.17 KB	-rw-r--r--
sort.h	7.52 KB	-rw-r--r--
tags.h	5.84 KB	-rw-r--r--
types.h	3.63 KB	-rw-r--r--
unique_copy.h	6.02 KB	-rw-r--r--
workstealing.h	9.39 KB	-rw-r--r--

Code Editor : compatibility.h

// -*- C++ -*-

// Copyright (C) 2007-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License as published by the Free Software
// Foundation; either version 3, 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
// General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file parallel/compatibility.h
 *  @brief Compatibility layer, mostly concerned with atomic operations.
 *
 *  This file is a GNU parallel extension to the Standard C++ Library
 *  and contains implementation details for the library's internal use.
 */

// Written by Felix Putze.

#ifndef _GLIBCXX_PARALLEL_COMPATIBILITY_H
#define _GLIBCXX_PARALLEL_COMPATIBILITY_H 1

#include <parallel/types.h>
#include <parallel/base.h>

#if !defined(_WIN32) || defined (__CYGWIN__)
#include <sched.h>
#endif

#ifdef __MINGW32__
// Including <windows.h> will drag in all the windows32 names.  Since
// that can cause user code portability problems, we just declare the
// one needed function here.
extern "C"
__attribute((dllimport)) void __attribute__((stdcall)) Sleep (unsigned long);
#endif

namespace __gnu_parallel
{
  template<typename _Tp>
    inline _Tp
    __add_omp(volatile _Tp* __ptr, _Tp __addend)
    {
      int64_t __res;
#pragma omp critical
      {
	__res = *__ptr;
	*(__ptr) += __addend;
      }
      return __res;
    }

/** @brief Add a value to a variable, atomically.
   *
   *  @param __ptr Pointer to a signed integer.
   *  @param __addend Value to add.
   */
  template<typename _Tp>
    inline _Tp
    __fetch_and_add(volatile _Tp* __ptr, _Tp __addend)
    {
      if (__atomic_always_lock_free(sizeof(_Tp), __ptr))
	return __atomic_fetch_add(__ptr, __addend, __ATOMIC_ACQ_REL);
      return __add_omp(__ptr, __addend);
    }

template<typename _Tp>
    inline bool
    __cas_omp(volatile _Tp* __ptr, _Tp __comparand, _Tp __replacement)
    {
      bool __res = false;
#pragma omp critical
      {
	if (*__ptr == __comparand)
	  {
	    *__ptr = __replacement;
	    __res = true;
	  }
      }
      return __res;
    }

/** @brief Compare-and-swap
   *
   * Compare @c *__ptr and @c __comparand. If equal, let @c
   * *__ptr=__replacement and return @c true, return @c false otherwise.
   *
   *  @param __ptr Pointer to signed integer.
   *  @param __comparand Compare value.
   *  @param __replacement Replacement value.
   */
  template<typename _Tp>
    inline bool
    __compare_and_swap(volatile _Tp* __ptr, _Tp __comparand, _Tp __replacement)
    {
      if (__atomic_always_lock_free(sizeof(_Tp), __ptr))
	return __atomic_compare_exchange_n(__ptr, &__comparand, __replacement,
					   false, __ATOMIC_ACQ_REL,
					   __ATOMIC_RELAXED);
      return __cas_omp(__ptr, __comparand, __replacement);
    }

/** @brief Yield control to another thread, without waiting for
   *  the end of the time slice.
   */
  inline void
  __yield()
  {
#if defined (_WIN32) && !defined (__CYGWIN__)
    Sleep(0);
#else
    sched_yield();
#endif
  }
} // end namespace

#endif /* _GLIBCXX_PARALLEL_COMPATIBILITY_H */

${this.title}

Code Editor : compatibility.h