Linux e000727e84fa 5.4.0-208-generic #228-Ubuntu SMP Fri Feb 7 19:41:33 UTC 2025 x86_64
Apache/2.4.62 (Debian)
: 192.168.16.2 | : 192.168.16.1
Cant Read [ /etc/named.conf ]
8.2.27
root
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
usr /
include /
c++ /
12 /
bits /
[ HOME SHELL ]
Name
Size
Permission
Action
algorithmfwd.h
23.97
KB
-rw-r--r--
align.h
3.62
KB
-rw-r--r--
alloc_traits.h
27.03
KB
-rw-r--r--
allocated_ptr.h
3.25
KB
-rw-r--r--
allocator.h
9.55
KB
-rw-r--r--
atomic_base.h
56.73
KB
-rw-r--r--
atomic_futex.h
12.08
KB
-rw-r--r--
atomic_lockfree_defines.h
2.3
KB
-rw-r--r--
atomic_timed_wait.h
13.18
KB
-rw-r--r--
atomic_wait.h
12.2
KB
-rw-r--r--
basic_ios.h
15.7
KB
-rw-r--r--
basic_ios.tcc
5.96
KB
-rw-r--r--
basic_string.h
149.19
KB
-rw-r--r--
basic_string.tcc
33.76
KB
-rw-r--r--
boost_concept_check.h
29.13
KB
-rw-r--r--
c++0x_warning.h
1.44
KB
-rw-r--r--
char_traits.h
28.54
KB
-rw-r--r--
charconv.h
3.35
KB
-rw-r--r--
chrono.h
41.53
KB
-rw-r--r--
codecvt.h
24.9
KB
-rw-r--r--
concept_check.h
3.34
KB
-rw-r--r--
cow_string.h
129.11
KB
-rw-r--r--
cpp_type_traits.h
13.72
KB
-rw-r--r--
cxxabi_forced.h
1.77
KB
-rw-r--r--
cxxabi_init_exception.h
2.17
KB
-rw-r--r--
deque.tcc
41.38
KB
-rw-r--r--
enable_special_members.h
12.16
KB
-rw-r--r--
erase_if.h
2.09
KB
-rw-r--r--
exception.h
2.45
KB
-rw-r--r--
exception_defines.h
1.61
KB
-rw-r--r--
exception_ptr.h
7.73
KB
-rw-r--r--
forward_list.h
49.87
KB
-rw-r--r--
forward_list.tcc
13.71
KB
-rw-r--r--
fs_dir.h
16.23
KB
-rw-r--r--
fs_fwd.h
10.66
KB
-rw-r--r--
fs_ops.h
10.49
KB
-rw-r--r--
fs_path.h
40.57
KB
-rw-r--r--
fstream.tcc
32.88
KB
-rw-r--r--
functexcept.h
3.43
KB
-rw-r--r--
functional_hash.h
8.51
KB
-rw-r--r--
gslice.h
5.39
KB
-rw-r--r--
gslice_array.h
7.67
KB
-rw-r--r--
hash_bytes.h
2.1
KB
-rw-r--r--
hashtable.h
87.83
KB
-rw-r--r--
hashtable_policy.h
63.21
KB
-rw-r--r--
indirect_array.h
7.68
KB
-rw-r--r--
invoke.h
5.92
KB
-rw-r--r--
ios_base.h
31.43
KB
-rw-r--r--
istream.tcc
31.38
KB
-rw-r--r--
iterator_concepts.h
32.61
KB
-rw-r--r--
list.tcc
17.62
KB
-rw-r--r--
locale_classes.h
24.46
KB
-rw-r--r--
locale_classes.tcc
8.18
KB
-rw-r--r--
locale_conv.h
18.74
KB
-rw-r--r--
locale_facets.h
91.72
KB
-rw-r--r--
locale_facets.tcc
39.51
KB
-rw-r--r--
locale_facets_nonio.h
69.1
KB
-rw-r--r--
locale_facets_nonio.tcc
53.76
KB
-rw-r--r--
localefwd.h
5.8
KB
-rw-r--r--
mask_array.h
7.5
KB
-rw-r--r--
max_size_type.h
21.96
KB
-rw-r--r--
memoryfwd.h
2.45
KB
-rw-r--r--
mofunc_impl.h
7.52
KB
-rw-r--r--
move.h
6.63
KB
-rw-r--r--
move_only_function.h
5.73
KB
-rw-r--r--
nested_exception.h
4.77
KB
-rw-r--r--
new_allocator.h
6.47
KB
-rw-r--r--
node_handle.h
10.67
KB
-rw-r--r--
ostream.tcc
11.69
KB
-rw-r--r--
ostream_insert.h
3.94
KB
-rw-r--r--
parse_numbers.h
7.8
KB
-rw-r--r--
postypes.h
7.33
KB
-rw-r--r--
predefined_ops.h
9.94
KB
-rw-r--r--
ptr_traits.h
8.88
KB
-rw-r--r--
quoted_string.h
4.93
KB
-rw-r--r--
random.h
174.24
KB
-rw-r--r--
random.tcc
103.38
KB
-rw-r--r--
range_access.h
10.97
KB
-rw-r--r--
ranges_algo.h
114.1
KB
-rw-r--r--
ranges_algobase.h
18.4
KB
-rw-r--r--
ranges_base.h
25.61
KB
-rw-r--r--
ranges_cmp.h
5.83
KB
-rw-r--r--
ranges_uninitialized.h
17.71
KB
-rw-r--r--
ranges_util.h
21.3
KB
-rw-r--r--
refwrap.h
13.21
KB
-rw-r--r--
regex.h
101.77
KB
-rw-r--r--
regex.tcc
16.13
KB
-rw-r--r--
regex_automaton.h
10.54
KB
-rw-r--r--
regex_automaton.tcc
7.58
KB
-rw-r--r--
regex_compiler.h
15.92
KB
-rw-r--r--
regex_compiler.tcc
18.38
KB
-rw-r--r--
regex_constants.h
14.51
KB
-rw-r--r--
regex_error.h
5.03
KB
-rw-r--r--
regex_executor.h
8.8
KB
-rw-r--r--
regex_executor.tcc
18.41
KB
-rw-r--r--
regex_scanner.h
6.88
KB
-rw-r--r--
regex_scanner.tcc
14.54
KB
-rw-r--r--
semaphore_base.h
7.7
KB
-rw-r--r--
shared_ptr.h
38.14
KB
-rw-r--r--
shared_ptr_atomic.h
20.7
KB
-rw-r--r--
shared_ptr_base.h
65.23
KB
-rw-r--r--
slice_array.h
9.35
KB
-rw-r--r--
specfun.h
46.13
KB
-rw-r--r--
sstream.tcc
9.91
KB
-rw-r--r--
std_abs.h
3.37
KB
-rw-r--r--
std_function.h
22.34
KB
-rw-r--r--
std_mutex.h
6.27
KB
-rw-r--r--
std_thread.h
8.24
KB
-rw-r--r--
stl_algo.h
210.67
KB
-rw-r--r--
stl_algobase.h
75.01
KB
-rw-r--r--
stl_bvector.h
40.27
KB
-rw-r--r--
stl_construct.h
8.46
KB
-rw-r--r--
stl_deque.h
76.34
KB
-rw-r--r--
stl_function.h
43.97
KB
-rw-r--r--
stl_heap.h
20.31
KB
-rw-r--r--
stl_iterator.h
79.65
KB
-rw-r--r--
stl_iterator_base_funcs.h
8.57
KB
-rw-r--r--
stl_iterator_base_types.h
9.46
KB
-rw-r--r--
stl_list.h
70.68
KB
-rw-r--r--
stl_map.h
54.8
KB
-rw-r--r--
stl_multimap.h
42.67
KB
-rw-r--r--
stl_multiset.h
36.84
KB
-rw-r--r--
stl_numeric.h
14.26
KB
-rw-r--r--
stl_pair.h
29.41
KB
-rw-r--r--
stl_queue.h
28.06
KB
-rw-r--r--
stl_raw_storage_iter.h
3.91
KB
-rw-r--r--
stl_relops.h
4.47
KB
-rw-r--r--
stl_set.h
37.09
KB
-rw-r--r--
stl_stack.h
13.71
KB
-rw-r--r--
stl_tempbuf.h
8.48
KB
-rw-r--r--
stl_tree.h
72.04
KB
-rw-r--r--
stl_uninitialized.h
35.32
KB
-rw-r--r--
stl_vector.h
68.73
KB
-rw-r--r--
stream_iterator.h
8.09
KB
-rw-r--r--
streambuf.tcc
4.58
KB
-rw-r--r--
streambuf_iterator.h
15.53
KB
-rw-r--r--
string_view.tcc
7
KB
-rw-r--r--
stringfwd.h
2.56
KB
-rw-r--r--
this_thread_sleep.h
3.21
KB
-rw-r--r--
uniform_int_dist.h
12.77
KB
-rw-r--r--
unique_lock.h
6.01
KB
-rw-r--r--
unique_ptr.h
35.54
KB
-rw-r--r--
unordered_map.h
74.87
KB
-rw-r--r--
unordered_set.h
61.46
KB
-rw-r--r--
uses_allocator.h
6.74
KB
-rw-r--r--
uses_allocator_args.h
6.96
KB
-rw-r--r--
utility.h
8.12
KB
-rw-r--r--
valarray_after.h
22.74
KB
-rw-r--r--
valarray_array.h
20.8
KB
-rw-r--r--
valarray_array.tcc
7.08
KB
-rw-r--r--
valarray_before.h
18.69
KB
-rw-r--r--
vector.tcc
30.82
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : atomic_futex.h
// -*- C++ -*- header. // Copyright (C) 2015-2022 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 <atomic> #if ! (defined(_GLIBCXX_HAVE_LINUX_FUTEX) && ATOMIC_INT_LOCK_FREE > 1) #include <mutex> #include <condition_variable> #endif #include <bits/chrono.h> #ifndef _GLIBCXX_ALWAYS_INLINE #define _GLIBCXX_ALWAYS_INLINE inline __attribute__((__always_inline__)) #endif namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION #ifdef _GLIBCXX_HAS_GTHREADS #if defined(_GLIBCXX_HAVE_LINUX_FUTEX) && ATOMIC_INT_LOCK_FREE > 1 struct __atomic_futex_unsigned_base { // __s and __ns are measured against CLOCK_REALTIME. Returns false // iff a timeout occurred. bool _M_futex_wait_until(unsigned *__addr, unsigned __val, bool __has_timeout, chrono::seconds __s, chrono::nanoseconds __ns); // __s and __ns are measured against CLOCK_MONOTONIC. Returns // false iff a timeout occurred. bool _M_futex_wait_until_steady(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::steady_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. // __s and __ns are measured against CLOCK_REALTIME. 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 } } // 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. // __s and __ns are measured against CLOCK_MONOTONIC. unsigned _M_load_and_test_until_steady(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_steady((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<std::chrono::system_clock, _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); } template<typename _Dur> unsigned _M_load_and_test_until_impl(unsigned __assumed, unsigned __operand, bool __equal, memory_order __mo, const chrono::time_point<std::chrono::steady_clock, _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_steady(__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) { using __dur = typename __clock_t::duration; return _M_load_when_equal_until(__val, __mo, __clock_t::now() + chrono::__detail::ceil<__dur>(__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) { typename _Clock::time_point __c_entry = _Clock::now(); do { const __clock_t::time_point __s_entry = __clock_t::now(); const auto __delta = __atime - __c_entry; const auto __s_atime = __s_entry + chrono::__detail::ceil<__clock_t::duration>(__delta); if (_M_load_when_equal_until(__val, __mo, __s_atime)) return true; __c_entry = _Clock::now(); } while (__c_entry < __atime); return false; } // 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<std::chrono::system_clock, _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; } // 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<std::chrono::steady_clock, _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_END_NAMESPACE_VERSION } // namespace std #endif
Close