Admin

name	type	size	perms	modified	actions
[parent directory]
backward/	dir	-	0755	2026-02-27 06:27:10
bits/	dir	-	0755	2026-02-27 06:27:10
debug/	dir	-	0755	2026-02-27 06:27:10
decimal/	dir	-	0755	2026-02-27 06:27:10
experimental/	dir	-	0755	2026-02-27 06:27:10
ext/	dir	-	0755	2026-02-27 06:27:10
parallel/	dir	-	0755	2026-02-27 06:27:10
pstl/	dir	-	0755	2026-02-27 06:27:10
tr1/	dir	-	0755	2026-02-27 06:27:10
tr2/	dir	-	0755	2026-02-27 06:27:10
algorithm	file	3,044 B	0644	2025-12-18 20:59:51	edit
any	file	18,821 B	0644	2025-12-18 20:59:51	edit
array	file	15,571 B	0644	2025-12-18 20:59:51	edit
atomic	file	51,568 B	0644	2025-12-18 20:59:51	edit
barrier	file	8,084 B	0644	2025-12-18 20:59:51	edit
bit	file	14,378 B	0644	2025-12-18 20:59:51	edit
bitset	file	50,321 B	0644	2025-12-18 20:59:51	edit
cassert	file	1,648 B	0644	2025-12-18 20:59:51	edit
ccomplex	file	1,335 B	0644	2025-12-18 20:59:51	edit
cctype	file	2,409 B	0644	2025-12-18 20:59:51	edit
cerrno	file	1,770 B	0644	2025-12-18 20:59:51	edit
cfenv	file	2,051 B	0644	2025-12-18 20:59:51	edit
cfloat	file	1,889 B	0644	2025-12-18 20:59:51	edit
charconv	file	30,226 B	0644	2025-12-18 20:59:51	edit
chrono	file	97,033 B	0644	2025-12-18 20:59:51	edit
cinttypes	file	2,157 B	0644	2025-12-18 20:59:51	edit
ciso646	file	1,464 B	0644	2025-12-18 20:59:51	edit
climits	file	1,913 B	0644	2025-12-18 20:59:51	edit
clocale	file	1,905 B	0644	2025-12-18 20:59:51	edit
cmath	file	93,977 B	0644	2025-12-18 20:59:51	edit
codecvt	file	5,275 B	0644	2025-12-18 20:59:51	edit
compare	file	37,798 B	0644	2025-12-18 20:59:51	edit
complex	file	76,455 B	0644	2025-12-18 20:59:51	edit
complex.h	file	1,596 B	0644	2025-12-18 20:59:51	edit
concepts	file	12,808 B	0644	2025-12-18 20:59:51	edit
condition_variable	file	12,895 B	0644	2025-12-18 20:59:51	edit
coroutine	file	9,664 B	0644	2025-12-18 20:59:51	edit
csetjmp	file	1,949 B	0644	2025-12-18 20:59:51	edit
csignal	file	1,855 B	0644	2025-12-18 20:59:51	edit
cstdalign	file	1,407 B	0644	2025-12-18 20:59:51	edit
cstdarg	file	1,868 B	0644	2025-12-18 20:59:51	edit
cstdbool	file	1,401 B	0644	2025-12-18 20:59:51	edit
cstddef	file	6,656 B	0644	2025-12-18 20:59:51	edit
cstdint	file	3,853 B	0644	2025-12-18 20:59:51	edit
cstdio	file	4,439 B	0644	2025-12-18 20:59:51	edit
cstdlib	file	6,535 B	0644	2025-12-18 20:59:51	edit
cstring	file	3,156 B	0644	2025-12-18 20:59:51	edit
ctgmath	file	1,360 B	0644	2025-12-18 20:59:51	edit
ctime	file	2,298 B	0644	2025-12-18 20:59:51	edit
cuchar	file	2,904 B	0644	2025-12-18 20:59:51	edit
cwchar	file	6,542 B	0644	2025-12-18 20:59:51	edit
cwctype	file	2,793 B	0644	2025-12-18 20:59:51	edit
cxxabi.h	file	22,280 B	0644	2025-12-18 20:59:51	edit
deque	file	4,500 B	0644	2025-12-18 20:59:51	edit
exception	file	5,406 B	0644	2025-12-18 20:59:51	edit
execution	file	1,876 B	0644	2025-12-18 20:59:51	edit
expected	file	50,909 B	0644	2025-12-18 20:59:51	edit
fenv.h	file	2,020 B	0644	2025-12-18 20:59:51	edit
filesystem	file	1,700 B	0644	2025-12-18 20:59:51	edit
format	file	116,370 B	0644	2025-12-18 20:59:51	edit
forward_list	file	2,717 B	0644	2025-12-18 20:59:51	edit
fstream	file	40,728 B	0644	2025-12-18 20:59:51	edit
functional	file	46,545 B	0644	2025-12-18 20:59:51	edit
future	file	53,137 B	0644	2025-12-18 20:59:51	edit
initializer_list	file	3,001 B	0644	2025-12-18 20:59:51	edit
iomanip	file	16,614 B	0644	2025-12-18 20:59:51	edit
ios	file	1,649 B	0644	2025-12-18 20:59:51	edit
iosfwd	file	8,406 B	0644	2025-12-18 20:59:51	edit
iostream	file	3,074 B	0644	2025-12-18 20:59:51	edit
istream	file	36,319 B	0644	2025-12-18 20:59:51	edit
iterator	file	2,825 B	0644	2025-12-18 20:59:51	edit
latch	file	2,782 B	0644	2025-12-18 20:59:51	edit
limits	file	78,235 B	0644	2025-12-18 20:59:51	edit
list	file	3,684 B	0644	2025-12-18 20:59:51	edit
locale	file	1,534 B	0644	2025-12-18 20:59:51	edit
map	file	4,147 B	0644	2025-12-18 20:59:51	edit
math.h	file	4,573 B	0644	2025-12-18 20:59:51	edit
memory	file	4,938 B	0644	2025-12-18 20:59:51	edit
memory_resource	file	14,484 B	0644	2025-12-18 20:59:51	edit
mutex	file	27,270 B	0644	2025-12-18 20:59:51	edit
new	file	8,652 B	0644	2025-12-18 20:59:51	edit
numbers	file	7,038 B	0644	2025-12-18 20:59:51	edit
numeric	file	25,993 B	0644	2025-12-18 20:59:51	edit
optional	file	45,161 B	0644	2025-12-18 20:59:51	edit
ostream	file	27,196 B	0644	2025-12-18 20:59:51	edit
queue	file	2,516 B	0644	2025-12-18 20:59:51	edit
random	file	1,750 B	0644	2025-12-18 20:59:51	edit
ranges	file	259,904 B	0644	2025-12-18 20:59:51	edit
ratio	file	21,478 B	0644	2025-12-18 20:59:51	edit
regex	file	3,155 B	0644	2025-12-18 20:59:51	edit
scoped_allocator	file	17,741 B	0644	2025-12-18 20:59:51	edit
semaphore	file	3,050 B	0644	2025-12-18 20:59:51	edit
set	file	4,007 B	0644	2025-12-18 20:59:51	edit
shared_mutex	file	25,108 B	0644	2025-12-18 20:59:51	edit
source_location	file	2,747 B	0644	2025-12-18 20:59:51	edit
span	file	14,148 B	0644	2025-12-18 20:59:51	edit
spanstream	file	12,461 B	0644	2025-12-18 20:59:51	edit
sstream	file	39,767 B	0644	2025-12-18 20:59:51	edit
stack	file	2,440 B	0644	2025-12-18 20:59:51	edit
stacktrace	file	21,884 B	0644	2025-12-18 20:59:51	edit
stdatomic.h	file	4,069 B	0644	2025-12-18 20:59:51	edit
stdexcept	file	9,878 B	0644	2025-12-18 20:59:51	edit
stdfloat	file	1,766 B	0644	2025-12-18 20:59:51	edit
stdlib.h	file	2,305 B	0644	2025-12-18 20:59:51	edit
stop_token	file	16,075 B	0644	2025-12-18 20:59:51	edit
streambuf	file	29,938 B	0644	2025-12-18 20:59:51	edit
string	file	3,962 B	0644	2025-12-18 20:59:51	edit
string_view	file	27,986 B	0644	2025-12-18 20:59:51	edit
syncstream	file	8,369 B	0644	2025-12-18 20:59:51	edit
system_error	file	18,387 B	0644	2025-12-18 20:59:51	edit
tgmath.h	file	1,360 B	0644	2025-12-18 20:59:51	edit
thread	file	7,507 B	0644	2025-12-18 20:59:51	edit
tuple	file	78,325 B	0644	2025-12-18 20:59:51	edit
type_traits	file	115,061 B	0644	2025-12-18 20:59:51	edit
typeindex	file	3,512 B	0644	2025-12-18 20:59:51	edit
typeinfo	file	8,302 B	0644	2025-12-18 20:59:51	edit
unordered_map	file	3,448 B	0644	2025-12-18 20:59:51	edit
unordered_set	file	3,312 B	0644	2025-12-18 20:59:51	edit
utility	file	7,146 B	0644	2025-12-18 20:59:51	edit
valarray	file	41,169 B	0644	2025-12-18 20:59:51	edit
variant	file	66,271 B	0644	2025-12-18 20:59:51	edit
vector	file	4,837 B	0644	2025-12-18 20:59:51	edit
version	file	12,620 B	0644	2025-12-18 20:59:51	edit

editing: barrier

// <barrier> -*- C++ -*-

// Copyright (C) 2020-2023 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/>.

// This implementation is based on libcxx/include/barrier
//===-- barrier.h --------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------------------------------------------===//

/** @file include/barrier
 *  This is a Standard C++ Library header.
 */

#ifndef _GLIBCXX_BARRIER
#define _GLIBCXX_BARRIER 1

#pragma GCC system_header

#include <bits/requires_hosted.h> // threading primitive

#if __cplusplus > 201703L
#include <bits/atomic_base.h>
#if __cpp_lib_atomic_wait && __cpp_aligned_new
#include <bits/std_thread.h>
#include <bits/unique_ptr.h>

#include <array>

#define __cpp_lib_barrier 201907L

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

struct __empty_completion
  {
    _GLIBCXX_ALWAYS_INLINE void
    operator()() noexcept
    { }
  };

The default implementation of __tree_barrier is a classic tree barrier.

It looks different from literature pseudocode for two main reasons:
 1. Threads that call into std::barrier functions do not provide indices,
    so a numbering step is added before the actual barrier algorithm,
    appearing as an N+1 round to the N rounds of the tree barrier.
 2. A great deal of attention has been paid to avoid cache line thrashing
    by flattening the tree structure into cache-line sized arrays, that
    are indexed in an efficient way.

enum class __barrier_phase_t : unsigned char { };

template<typename _CompletionF>
    class __tree_barrier
    {
      using __atomic_phase_ref_t = std::__atomic_ref<__barrier_phase_t>;
      using __atomic_phase_const_ref_t = std::__atomic_ref<const __barrier_phase_t>;
      static constexpr auto __phase_alignment =
		      __atomic_phase_ref_t::required_alignment;

using __tickets_t = std::array<__barrier_phase_t, 64>;
      struct alignas(64) /* naturally-align the heap state */ __state_t
      {
	alignas(__phase_alignment) __tickets_t __tickets;
      };

ptrdiff_t _M_expected;
      unique_ptr<__state_t[]> _M_state;
      __atomic_base<ptrdiff_t> _M_expected_adjustment;
      _CompletionF _M_completion;

alignas(__phase_alignment) __barrier_phase_t  _M_phase;

bool
      _M_arrive(__barrier_phase_t __old_phase, size_t __current)
      {
	const auto __old_phase_val = static_cast<unsigned char>(__old_phase);
	const auto __half_step =
			   static_cast<__barrier_phase_t>(__old_phase_val + 1);
	const auto __full_step =
			   static_cast<__barrier_phase_t>(__old_phase_val + 2);

size_t __current_expected = _M_expected;
	__current %= ((_M_expected + 1) >> 1);

for (int __round = 0; ; ++__round)
	  {
	    if (__current_expected <= 1)
		return true;
	    size_t const __end_node = ((__current_expected + 1) >> 1),
			 __last_node = __end_node - 1;
	    for ( ; ; ++__current)
	      {
		if (__current == __end_node)
		  __current = 0;
		auto __expect = __old_phase;
		__atomic_phase_ref_t __phase(_M_state[__current]
						.__tickets[__round]);
		if (__current == __last_node && (__current_expected & 1))
		  {
		    if (__phase.compare_exchange_strong(__expect, __full_step,
						        memory_order_acq_rel))
		      break;     // I'm 1 in 1, go to next __round
		  }
		else if (__phase.compare_exchange_strong(__expect, __half_step,
						         memory_order_acq_rel))
		  {
		    return false; // I'm 1 in 2, done with arrival
		  }
		else if (__expect == __half_step)
		  {
		    if (__phase.compare_exchange_strong(__expect, __full_step,
						        memory_order_acq_rel))
		      break;    // I'm 2 in 2, go to next __round
		  }
	      }
	    __current_expected = __last_node + 1;
	    __current >>= 1;
	  }
      }

public:
      using arrival_token = __barrier_phase_t;

static constexpr ptrdiff_t
      max() noexcept
      { return __PTRDIFF_MAX__; }

__tree_barrier(ptrdiff_t __expected, _CompletionF __completion)
	  : _M_expected(__expected), _M_expected_adjustment(0),
	    _M_completion(move(__completion)),
	    _M_phase(static_cast<__barrier_phase_t>(0))
      {
	size_t const __count = (_M_expected + 1) >> 1;

_M_state = std::make_unique<__state_t[]>(__count);
      }

[[nodiscard]] arrival_token
      arrive(ptrdiff_t __update)
      {
	std::hash<std::thread::id> __hasher;
	size_t __current = __hasher(std::this_thread::get_id());
	__atomic_phase_ref_t __phase(_M_phase);
	const auto __old_phase = __phase.load(memory_order_relaxed);
	const auto __cur = static_cast<unsigned char>(__old_phase);
	for(; __update; --__update)
	  {
	    if(_M_arrive(__old_phase, __current))
	      {
		_M_completion();
		_M_expected += _M_expected_adjustment.load(memory_order_relaxed);
		_M_expected_adjustment.store(0, memory_order_relaxed);
		auto __new_phase = static_cast<__barrier_phase_t>(__cur + 2);
		__phase.store(__new_phase, memory_order_release);
		__phase.notify_all();
	      }
	  }
	return __old_phase;
      }

void
      wait(arrival_token&& __old_phase) const
      {
	__atomic_phase_const_ref_t __phase(_M_phase);
	auto const __test_fn = [=]
	  {
	    return __phase.load(memory_order_acquire) != __old_phase;
	  };
	std::__atomic_wait_address(&_M_phase, __test_fn);
      }

void
      arrive_and_drop()
      {
	_M_expected_adjustment.fetch_sub(1, memory_order_relaxed);
	(void)arrive(1);
      }
    };

template<typename _CompletionF = __empty_completion>
    class barrier
    {
      // Note, we may introduce a "central" barrier algorithm at some point
      // for more space constrained targets
      using __algorithm_t = __tree_barrier<_CompletionF>;
      __algorithm_t _M_b;

public:
      class arrival_token final
      {
      public:
	arrival_token(arrival_token&&) = default;
	arrival_token& operator=(arrival_token&&) = default;
	~arrival_token() = default;

private:
	friend class barrier;
	using __token = typename __algorithm_t::arrival_token;
	explicit arrival_token(__token __tok) noexcept : _M_tok(__tok) { }
	__token _M_tok;
      };

static constexpr ptrdiff_t
      max() noexcept
      { return __algorithm_t::max(); }

explicit
      barrier(ptrdiff_t __count, _CompletionF __completion = _CompletionF())
      : _M_b(__count, std::move(__completion))
      { }

barrier(barrier const&) = delete;
      barrier& operator=(barrier const&) = delete;

[[nodiscard]] arrival_token
      arrive(ptrdiff_t __update = 1)
      { return arrival_token{_M_b.arrive(__update)}; }

void
      wait(arrival_token&& __phase) const
      { _M_b.wait(std::move(__phase._M_tok)); }

void
      arrive_and_wait()
      { wait(arrive()); }

void
      arrive_and_drop()
      { _M_b.arrive_and_drop(); }
    };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace
#endif // __cpp_lib_atomic_wait && __cpp_aligned_new
#endif // __cplusplus > 201703L
#endif // _GLIBCXX_BARRIER

cancel