File Manager

X7ROOT File Manager

Current Path: /usr/include/c++/8/bits

ðŸ“ ..
ðŸ“„ algorithmfwd.h(21.23 KB)
ðŸ“„ alloc_traits.h(19.6 KB)
ðŸ“„ allocated_ptr.h(3.22 KB)
ðŸ“„ allocator.h(7.39 KB)
ðŸ“„ atomic_base.h(23.28 KB)
ðŸ“„ atomic_futex.h(9.35 KB)
ðŸ“„ atomic_lockfree_defines.h(2.2 KB)
ðŸ“„ basic_ios.h(15.7 KB)
ðŸ“„ basic_ios.tcc(5.94 KB)
ðŸ“„ basic_string.h(237.01 KB)
ðŸ“„ basic_string.tcc(52.5 KB)
ðŸ“„ boost_concept_check.h(26.52 KB)
ðŸ“„ c++0x_warning.h(1.44 KB)
ðŸ“„ char_traits.h(20.42 KB)
ðŸ“„ codecvt.h(20.79 KB)
ðŸ“„ concept_check.h(3.34 KB)
ðŸ“„ cpp_type_traits.h(9.56 KB)
ðŸ“„ cxxabi_forced.h(1.77 KB)
ðŸ“„ cxxabi_init_exception.h(2.17 KB)
ðŸ“„ deque.tcc(33.32 KB)
ðŸ“„ enable_special_members.h(12.1 KB)
ðŸ“„ exception.h(2.23 KB)
ðŸ“„ exception_defines.h(1.61 KB)
ðŸ“„ exception_ptr.h(5.84 KB)
ðŸ“„ forward_list.h(47.77 KB)
ðŸ“„ forward_list.tcc(12.86 KB)
ðŸ“„ fs_dir.h(14.38 KB)
ðŸ“„ fs_fwd.h(10.04 KB)
ðŸ“„ fs_ops.h(9.5 KB)
ðŸ“„ fs_path.h(32.12 KB)
ðŸ“„ fstream.tcc(32.03 KB)
ðŸ“„ functexcept.h(3.18 KB)
ðŸ“„ functional_hash.h(8.04 KB)
ðŸ“„ gslice.h(5.39 KB)
ðŸ“„ gslice_array.h(7.59 KB)
ðŸ“„ hash_bytes.h(2.1 KB)
ðŸ“„ hashtable.h(72.06 KB)
ðŸ“„ hashtable_policy.h(66.38 KB)
ðŸ“„ indirect_array.h(7.68 KB)
ðŸ“„ invoke.h(3.57 KB)
ðŸ“„ ios_base.h(30.3 KB)
ðŸ“„ istream.tcc(30.36 KB)
ðŸ“„ list.tcc(15.6 KB)
ðŸ“„ locale_classes.h(24.31 KB)
ðŸ“„ locale_classes.tcc(8.18 KB)
ðŸ“„ locale_conv.h(15.72 KB)
ðŸ“„ locale_facets.h(90.16 KB)
ðŸ“„ locale_facets.tcc(38.62 KB)
ðŸ“„ locale_facets_nonio.h(67.36 KB)
ðŸ“„ locale_facets_nonio.tcc(44.22 KB)
ðŸ“„ localefwd.h(5.51 KB)
ðŸ“„ mask_array.h(7.42 KB)
ðŸ“„ memoryfwd.h(2.4 KB)
ðŸ“„ move.h(6.38 KB)
ðŸ“„ nested_exception.h(4.69 KB)
ðŸ“„ node_handle.h(8.02 KB)
ðŸ“„ ostream.tcc(12.03 KB)
ðŸ“„ ostream_insert.h(3.91 KB)
ðŸ“„ parse_numbers.h(7.76 KB)
ðŸ“„ postypes.h(8.02 KB)
ðŸ“„ predefined_ops.h(8.87 KB)
ðŸ“„ ptr_traits.h(6.47 KB)
ðŸ“„ quoted_string.h(4.93 KB)
ðŸ“„ random.h(171.14 KB)
ðŸ“„ random.tcc(103.12 KB)
ðŸ“„ range_access.h(9.79 KB)
ðŸ“„ refwrap.h(11.61 KB)
ðŸ“„ regex.h(95.12 KB)
ðŸ“„ regex.tcc(16.18 KB)
ðŸ“„ regex_automaton.h(10.47 KB)
ðŸ“„ regex_automaton.tcc(7.65 KB)
ðŸ“„ regex_compiler.h(17.63 KB)
ðŸ“„ regex_compiler.tcc(18.84 KB)
ðŸ“„ regex_constants.h(14.36 KB)
ðŸ“„ regex_error.h(4.79 KB)
ðŸ“„ regex_executor.h(7.31 KB)
ðŸ“„ regex_executor.tcc(18.4 KB)
ðŸ“„ regex_scanner.h(6.92 KB)
ðŸ“„ regex_scanner.tcc(14.66 KB)
ðŸ“„ shared_ptr.h(22.88 KB)
ðŸ“„ shared_ptr_atomic.h(9.54 KB)
ðŸ“„ shared_ptr_base.h(53.01 KB)
ðŸ“„ slice_array.h(9.13 KB)
ðŸ“„ specfun.h(45.95 KB)
ðŸ“„ sstream.tcc(9.9 KB)
ðŸ“„ std_abs.h(3.19 KB)
ðŸ“„ std_function.h(22.71 KB)
ðŸ“„ std_mutex.h(9.08 KB)
ðŸ“„ stl_algo.h(209.27 KB)
ðŸ“„ stl_algobase.h(49.31 KB)
ðŸ“„ stl_bvector.h(32.94 KB)
ðŸ“„ stl_construct.h(7.22 KB)
ðŸ“„ stl_deque.h(76.73 KB)
ðŸ“„ stl_function.h(40.77 KB)
ðŸ“„ stl_heap.h(19.73 KB)
ðŸ“„ stl_iterator.h(41.3 KB)
ðŸ“„ stl_iterator_base_funcs.h(7.99 KB)
ðŸ“„ stl_iterator_base_types.h(8.48 KB)
ðŸ“„ stl_list.h(65.97 KB)
ðŸ“„ stl_map.h(51.55 KB)
ðŸ“„ stl_multimap.h(40.58 KB)
ðŸ“„ stl_multiset.h(34.97 KB)
ðŸ“„ stl_numeric.h(13.51 KB)
ðŸ“„ stl_pair.h(18.21 KB)
ðŸ“„ stl_queue.h(23.51 KB)
ðŸ“„ stl_raw_storage_iter.h(3.74 KB)
ðŸ“„ stl_relops.h(4.49 KB)
ðŸ“„ stl_set.h(35.28 KB)
ðŸ“„ stl_stack.h(11.66 KB)
ðŸ“„ stl_tempbuf.h(8.15 KB)
ðŸ“„ stl_tree.h(73.15 KB)
ðŸ“„ stl_uninitialized.h(27.06 KB)
ðŸ“„ stl_vector.h(59.12 KB)
ðŸ“„ stream_iterator.h(6.5 KB)
ðŸ“„ streambuf.tcc(4.81 KB)
ðŸ“„ streambuf_iterator.h(13.44 KB)
ðŸ“„ string_view.tcc(6.54 KB)
ðŸ“„ stringfwd.h(2.55 KB)
ðŸ“„ uniform_int_dist.h(9.84 KB)
ðŸ“„ unique_ptr.h(25.38 KB)
ðŸ“„ unordered_map.h(73.58 KB)
ðŸ“„ unordered_set.h(57.76 KB)
ðŸ“„ uses_allocator.h(6.37 KB)
ðŸ“„ valarray_after.h(22.12 KB)
ðŸ“„ valarray_array.h(21.3 KB)
ðŸ“„ valarray_array.tcc(7.08 KB)
ðŸ“„ valarray_before.h(18.08 KB)
ðŸ“„ vector.tcc(28.95 KB)

Editing: atomic_futex.h

// -*- C++ -*- header.

// Copyright (C) 2015-2018 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 bits/atomic_futex.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly.
 */

#ifndef _GLIBCXX_ATOMIC_FUTEX_H
#define _GLIBCXX_ATOMIC_FUTEX_H 1

#pragma GCC system_header

#include <bits/c++config.h>
#include <atomic>
#include <chrono>
#if ! (defined(_GLIBCXX_HAVE_LINUX_FUTEX) && ATOMIC_INT_LOCK_FREE > 1)
#include <mutex>
#include <condition_variable>
#endif

#ifndef _GLIBCXX_ALWAYS_INLINE
#define _GLIBCXX_ALWAYS_INLINE inline __attribute__((__always_inline__))
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

#if defined(_GLIBCXX_HAS_GTHREADS) && defined(_GLIBCXX_USE_C99_STDINT_TR1)
#if defined(_GLIBCXX_HAVE_LINUX_FUTEX) && ATOMIC_INT_LOCK_FREE > 1
  struct __atomic_futex_unsigned_base
  {
    // Returns false iff a timeout occurred.
    bool
    _M_futex_wait_until(unsigned *__addr, unsigned __val, bool __has_timeout,
	chrono::seconds __s, chrono::nanoseconds __ns);

// This can be executed after the object has been destroyed.
    static void _M_futex_notify_all(unsigned* __addr);
  };

template <unsigned _Waiter_bit = 0x80000000>
  class __atomic_futex_unsigned : __atomic_futex_unsigned_base
  {
    typedef chrono::system_clock __clock_t;

// This must be lock-free and at offset 0.
    atomic<unsigned> _M_data;

public:
    explicit
    __atomic_futex_unsigned(unsigned __data) : _M_data(__data)
    { }

_GLIBCXX_ALWAYS_INLINE unsigned
    _M_load(memory_order __mo)
    {
      return _M_data.load(__mo) & ~_Waiter_bit;
    }

private:
    // If a timeout occurs, returns a current value after the timeout;
    // otherwise, returns the operand's value if equal is true or a different
    // value if equal is false.
    // The assumed value is the caller's assumption about the current value
    // when making the call.
    unsigned
    _M_load_and_test_until(unsigned __assumed, unsigned __operand,
	bool __equal, memory_order __mo, bool __has_timeout,
	chrono::seconds __s, chrono::nanoseconds __ns)
    {
      for (;;)
	{
	  // Don't bother checking the value again because we expect the caller
	  // to have done it recently.
	  // memory_order_relaxed is sufficient because we can rely on just the
	  // modification order (store_notify uses an atomic RMW operation too),
	  // and the futex syscalls synchronize between themselves.
	  _M_data.fetch_or(_Waiter_bit, memory_order_relaxed);
	  bool __ret = _M_futex_wait_until((unsigned*)(void*)&_M_data,
					   __assumed | _Waiter_bit,
					   __has_timeout, __s, __ns);
	  // Fetch the current value after waiting (clears _Waiter_bit).
	  __assumed = _M_load(__mo);
	  if (!__ret || ((__operand == __assumed) == __equal))
	    return __assumed;
	  // TODO adapt wait time
	}
    }

// Returns the operand's value if equal is true or a different value if
    // equal is false.
    // The assumed value is the caller's assumption about the current value
    // when making the call.
    unsigned
    _M_load_and_test(unsigned __assumed, unsigned __operand,
	bool __equal, memory_order __mo)
    {
      return _M_load_and_test_until(__assumed, __operand, __equal, __mo,
				    false, {}, {});
    }

// If a timeout occurs, returns a current value after the timeout;
    // otherwise, returns the operand's value if equal is true or a different
    // value if equal is false.
    // The assumed value is the caller's assumption about the current value
    // when making the call.
    template<typename _Dur>
    unsigned
    _M_load_and_test_until_impl(unsigned __assumed, unsigned __operand,
	bool __equal, memory_order __mo,
	const chrono::time_point<__clock_t, _Dur>& __atime)
    {
      auto __s = chrono::time_point_cast<chrono::seconds>(__atime);
      auto __ns = chrono::duration_cast<chrono::nanoseconds>(__atime - __s);
      // XXX correct?
      return _M_load_and_test_until(__assumed, __operand, __equal, __mo,
	  true, __s.time_since_epoch(), __ns);
    }

public:

_GLIBCXX_ALWAYS_INLINE unsigned
    _M_load_when_not_equal(unsigned __val, memory_order __mo)
    {
      unsigned __i = _M_load(__mo);
      if ((__i & ~_Waiter_bit) != __val)
	return (__i & ~_Waiter_bit);
      // TODO Spin-wait first.
      return _M_load_and_test(__i, __val, false, __mo);
    }

_GLIBCXX_ALWAYS_INLINE void
    _M_load_when_equal(unsigned __val, memory_order __mo)
    {
      unsigned __i = _M_load(__mo);
      if ((__i & ~_Waiter_bit) == __val)
	return;
      // TODO Spin-wait first.
      _M_load_and_test(__i, __val, true, __mo);
    }

// Returns false iff a timeout occurred.
    template<typename _Rep, typename _Period>
      _GLIBCXX_ALWAYS_INLINE bool
      _M_load_when_equal_for(unsigned __val, memory_order __mo,
	  const chrono::duration<_Rep, _Period>& __rtime)
      {
	return _M_load_when_equal_until(__val, __mo,
					__clock_t::now() + __rtime);
      }

// Returns false iff a timeout occurred.
    template<typename _Clock, typename _Duration>
      _GLIBCXX_ALWAYS_INLINE bool
      _M_load_when_equal_until(unsigned __val, memory_order __mo,
	  const chrono::time_point<_Clock, _Duration>& __atime)
      {
	// DR 887 - Sync unknown clock to known clock.
	const typename _Clock::time_point __c_entry = _Clock::now();
	const __clock_t::time_point __s_entry = __clock_t::now();
	const auto __delta = __atime - __c_entry;
	const auto __s_atime = __s_entry + __delta;
	return _M_load_when_equal_until(__val, __mo, __s_atime);
      }

// Returns false iff a timeout occurred.
    template<typename _Duration>
    _GLIBCXX_ALWAYS_INLINE bool
    _M_load_when_equal_until(unsigned __val, memory_order __mo,
	const chrono::time_point<__clock_t, _Duration>& __atime)
    {
      unsigned __i = _M_load(__mo);
      if ((__i & ~_Waiter_bit) == __val)
	return true;
      // TODO Spin-wait first.  Ignore effect on timeout.
      __i = _M_load_and_test_until_impl(__i, __val, true, __mo, __atime);
      return (__i & ~_Waiter_bit) == __val;
    }

_GLIBCXX_ALWAYS_INLINE void
    _M_store_notify_all(unsigned __val, memory_order __mo)
    {
      unsigned* __futex = (unsigned *)(void *)&_M_data;
      if (_M_data.exchange(__val, __mo) & _Waiter_bit)
	_M_futex_notify_all(__futex);
    }
  };

#else // ! (_GLIBCXX_HAVE_LINUX_FUTEX && ATOMIC_INT_LOCK_FREE > 1)

// If futexes are not available, use a mutex and a condvar to wait.
  // Because we access the data only within critical sections, all accesses
  // are sequentially consistent; thus, we satisfy any provided memory_order.
  template <unsigned _Waiter_bit = 0x80000000>
  class __atomic_futex_unsigned
  {
    typedef chrono::system_clock __clock_t;

unsigned _M_data;
    mutex _M_mutex;
    condition_variable _M_condvar;

public:
    explicit
    __atomic_futex_unsigned(unsigned __data) : _M_data(__data)
    { }

_GLIBCXX_ALWAYS_INLINE unsigned
    _M_load(memory_order __mo)
    {
      unique_lock<mutex> __lock(_M_mutex);
      return _M_data;
    }

_GLIBCXX_ALWAYS_INLINE unsigned
    _M_load_when_not_equal(unsigned __val, memory_order __mo)
    {
      unique_lock<mutex> __lock(_M_mutex);
      while (_M_data == __val)
	_M_condvar.wait(__lock);
      return _M_data;
    }

_GLIBCXX_ALWAYS_INLINE void
    _M_load_when_equal(unsigned __val, memory_order __mo)
    {
      unique_lock<mutex> __lock(_M_mutex);
      while (_M_data != __val)
	_M_condvar.wait(__lock);
    }

template<typename _Rep, typename _Period>
      _GLIBCXX_ALWAYS_INLINE bool
      _M_load_when_equal_for(unsigned __val, memory_order __mo,
	  const chrono::duration<_Rep, _Period>& __rtime)
      {
	unique_lock<mutex> __lock(_M_mutex);
	return _M_condvar.wait_for(__lock, __rtime,
				   [&] { return _M_data == __val;});
      }

template<typename _Clock, typename _Duration>
      _GLIBCXX_ALWAYS_INLINE bool
      _M_load_when_equal_until(unsigned __val, memory_order __mo,
	  const chrono::time_point<_Clock, _Duration>& __atime)
      {
	unique_lock<mutex> __lock(_M_mutex);
	return _M_condvar.wait_until(__lock, __atime,
				     [&] { return _M_data == __val;});
      }

_GLIBCXX_ALWAYS_INLINE void
    _M_store_notify_all(unsigned __val, memory_order __mo)
    {
      unique_lock<mutex> __lock(_M_mutex);
      _M_data = __val;
      _M_condvar.notify_all();
    }
  };

#endif // _GLIBCXX_HAVE_LINUX_FUTEX && ATOMIC_INT_LOCK_FREE > 1
#endif // _GLIBCXX_HAS_GTHREADS && _GLIBCXX_USE_C99_STDINT_TR1

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif

X7ROOT File Manager

Editing: atomic_futex.h

Upload File

Create Folder