Home
last modified time | relevance | path

Searched full:forward (Results 1 – 25 of 2363) sorted by relevance

12345678910>>...95

/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h17 #include <__utility/forward.h>
53 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u))) //
54 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) {
55 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
79 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u))) //
80 -> decltype(std::forward<_T1>(__t) - std::forward<_T2>(__u)) {
81 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
105 noexcept(noexcept(std::forward<_T1>(__t) * std::forward<_T2>(__u))) //
106 -> decltype(std::forward<_T1>(__t) * std::forward<_T2>(__u)) {
107 return std::forward<_T1>(__t) * std::forward<_T2>(__u);
[all …]
H A Dranges_operations.h17 #include <__utility/forward.h>
33 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
34 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
44 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
45 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
55 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
56 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
66 noexcept(noexcept(bool(!(std::forward<_Up>(__u) < std::forward<_Tp>(__t))))) { in operator()
67 return !(std::forward<_Up>(__u) < std::forward<_Tp>(__t)); in operator()
77 noexcept(noexcept(bool(std::forward<_Up>(__u) < std::forward<_Tp>(__t)))) { in operator()
[all …]
H A Dcompose.h17 #include <__utility/forward.h>
30 std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_Args>(__args)...))))
31 -> decltype(std::invoke(std::forward<_Fn1>(__f1),
32 std::invoke(std::forward<_Fn2>(__f2), std::forward<_Args>(__args)...))) {
33 return std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_Arg
[all...]
H A Dbind_back.h17 #include <__utility/forward.h>
36 noexcept(noexcept(std::invoke(std::forward<_Fn>(__f),
37 std::forward<_Args>(__args)...,
38 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...)))
39 -> decltype(std::invoke(std::forward<_Fn>(__f),
40 std::forward<_Args>(__args)...,
41 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...)) {
42 return std::invoke(std::forward<_Fn>(__f),
43 std::forward<_Args>(__args)...,
44 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...);
[all …]
H A Dperfect_forward.h18 #include <__utility/forward.h>
45 : __bound_args_(std::forward<_Args>(__bound_args)...) {}
55 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)))
56 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) {
57 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...);
65 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)))
66 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) {
67 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...);
75 noexcept(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...)))
76 -> decltype(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Arg
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dcompare_partial_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
43 : std::forward<_T
[all...]
H A Dcompare_strong_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
43 : std::forward<_T
[all...]
H A Dcompare_weak_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
43 : std::forward<_T
[all...]
H A Dpartial_order.h18 #include <__utility/forward.h>
38 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
39 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
40 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
47 … noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 …-> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))))…
49 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
55 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
56 … -> decltype(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
57 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
[all …]
H A Dweak_order.h20 #include <__utility/forward.h>
40 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
41 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
42 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
75 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
76 … -> decltype(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
77 return weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
83 noexcept(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
84 … -> decltype(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
85 return weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
[all …]
H A Dstrong_order.h22 #include <__utility/forward.h>
47 noexcept(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 -> decltype(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
49 return strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
119 … noexcept(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
120 …-> decltype(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
121 return strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
126 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
127 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) {
128 return __go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>());
/freebsd/lib/libsys/
H A Dffclock.235 .Nd Retrieve feed-forward counter, get and set feed-forward clock estimates
48 The ffclock implements a feed-forward paradigm and decouples the timestamping
53 The feed-forward approach has demonstrated better performance and higher
56 In the feed-forward context, a
59 into seconds by using the feed-forward
65 feed-forward counter maintained by the kernel.
71 system calls allow the caller to get and set the kernel's feed-forward clock
75 system call should be invoked by a single instance of a feed-forward
79 system call can be called by any process to retrieve the feed-forward clock
82 The feed-forward approach does not require that the clock estimates be retrieved
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DADL.h28 -> decltype(begin(std::forward<RangeT>(range))) {
29 return begin(std::forward<RangeT>(range));
36 -> decltype(end(std::forward<RangeT>(range))) {
37 return end(std::forward<RangeT>(range));
44 -> decltype(rbegin(std::forward<RangeT>(range))) {
45 return rbegin(std::forward<RangeT>(range));
52 -> decltype(rend(std::forward<RangeT>(range))) {
53 return rend(std::forward<RangeT>(range));
62 swap(std::forward<T>(lhs), std::forward<T>(rhs)); in swap_impl()
69 -> decltype(size(std::forward<RangeT>(range))) {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dformat_arg.h22 #include <__utility/forward.h>
105 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__monostate_); in decltype()
107 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__boolean_); in decltype()
109 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__char_type_); in decltype()
111 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__int_); in decltype()
113 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__long_long_); in decltype()
116 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__i128_); in decltype()
121 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__unsigned_); in decltype()
123 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__unsigned_long_long_); in decltype()
126 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__u128_); in decltype()
[all …]
/freebsd/contrib/unbound/iterator/
H A Diter_fwd.h2 * iterator/iter_fwd.h - iterative resolver module forward zones.
40 * Keep track of forward zones, and read those from config.
51 * Iterator forward zones structure
70 * Iterator forward servers for a particular zone.
81 /** delegation point with forward server information for this zone.
82 * If NULL then this forward entry is used to indicate that a
114 * Find forward zone exactly by name
120 * @param fwd: forward storage.
130 * Find forward zone information
131 * For this qname/qclass find forward zone information, returns delegation
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dglue_algorithm_impl.h
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DNonTrivialTypeVisitor.h24 std::forward<Ts>(Args)...); in visit()
32 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...); in visitWithKind()
34 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...); in visitWithKind()
36 return asDerived().visitTrivial(FT, std::forward<Ts>(Args)...); in visitWithKind()
38 return asDerived().visitCXXDestructor(FT, std::forward<Ts>(Args)...); in visitWithKind()
40 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind()
54 std::forward<Ts>(Args)...); in visit()
62 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...); in visitWithKind()
64 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind()
66 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...); in visitWithKind()
[all …]
/freebsd/share/man/man4/
H A Dffclock.433 .Nd Feed-forward system clock
44 Feed-forward clock synchronisation algorithms implemented by an appropriate
53 Feed-forward synchronisation is also very well suited for virtualised
59 kernel support provides feed-forward timestamping functions within the kernel
60 and system calls to support feed-forward synchronisation daemons
70 Enable feed-forward clock support.
73 When feed-forward clock support is compiled into the kernel, multiple system
92 Feed-forward system clock configuration is possible via the
97 Feed-forward clock kernel version
102 Use reliable hardware timecounter as the feed-forward counter.
[all …]
/freebsd/crypto/openssh/regress/
H A Dmultiplex.sh88 verbose "test $tid: forward"
89 trace "forward over TCP/IP and check result"
99 trace "forward over UNIX and check result"
135 verbose "test $tid: cmd forward local (TCP)"
137 || fail "request local forward failed"
140 || fail "connect to local forward port failed"
142 || fail "cancel local forward failed"
144 && fail "local forward port still listening"
146 verbose "test $tid: cmd forward remote (TCP)"
148 || fail "request remote forward failed"
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h22 #include <__utility/forward.h>
51 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
77 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator()
78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
111 ranges::swap(std::forward<_Tp>(__t), std::forward<_Tp>(__t)); in requires()
112 ranges::swap(std::forward<_Up>(__u), std::forward<_Up>(__u)); in requires()
113 ranges::swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
114 ranges::swap(std::forward<_Up>(__u), std::forward<_Tp>(__t)); in requires()
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dto.h35 #include <__utility/forward.h>
59 requires { __c.push_back(std::forward<_Ref>(__ref)); } || in requires()
60 requires { __c.insert(__c.end(), std::forward<_Ref>(__ref)); }); in requires()
101 return _Container(std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to()
106 return _Container(from_range, std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to()
111 … return _Container(ranges::begin(__range), ranges::end(__range), std::forward<_Args>(__args)...); in to()
117 _Container __result(std::forward<_Args>(__args)...); in to()
134 return ranges::to<range_value_t<_Container>>(std::forward<decltype(__elem)>(__elem)); in to()
136 std::forward<_Args>(__args)...); in to()
198 return ranges::to<_DeduceExpr>(std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to()
[all …]
H A Ddrop_view.h43 #include <__utility/forward.h>
214 noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))))
215 -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))) {
216 return _LIBCPP_AUTO_CAST(std::forward<_Range>(__range));
228 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
231 … ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
234 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
245 … _RawRange(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
248 … std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))))
251 ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__expected/
H A Dexpected.h42 #include <__utility/forward.h>
75 throw bad_expected_access<_Err>(std::forward<_Arg>(__arg));
107 : __v(std::forward<_Args>(__args)...) {}
112 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
121 : __v(std::forward<_Args>(__args)...) {}
126 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
231 : __val_(std::forward<_Args>(__args)...) {}
235 : __unex_(std::forward<_Args>(__args)...) {}
240 : __val_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
245 : __unex_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duses_allocator_construction.h47 return std::forward_as_tuple(std::forward<_Args>(__args)...); in __uses_allocator_construction_args()
50 …return tuple<allocator_arg_t, const _Alloc&, _Args&&...>(allocator_arg, __alloc, std::forward<_Arg… in __uses_allocator_construction_args()
53 return std::forward_as_tuple(std::forward<_Args>(__args)..., __alloc); in __uses_allocator_construction_args()
68 __alloc, std::forward<decltype(__args1)>(__args1)...); in __uses_allocator_construction_args()
70 std::forward<_Tuple1>(__x)), in __uses_allocator_construction_args()
74 __alloc, std::forward<decltype(__args2)>(__args2)...); in __uses_allocator_construction_args()
76 std::forward<_Tuple2>(__y))); in __uses_allocator_construction_args()
90 std::forward_as_tuple(std::forward<_Up>(__u)), in __uses_allocator_construction_args()
91 std::forward_as_tuple(std::forward<_Vp>(__v))); in __uses_allocator_construction_args()
137 std::forward_as_tuple(std::get<0>(std::forward<_PairLike>(__p))), in __uses_allocator_construction_args()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Diter_swap.h22 #include <__utility/forward.h>
47 iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)); in requires()
60 noexcept(noexcept(iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)))) { in operator()
61 (void)iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)); in operator()
68 noexcept(noexcept(ranges::swap(*std::forward<_T1>(__x), *std::forward<_T2>(__y)))) { in operator()
69 ranges::swap(*std::forward<_T1>(__x), *std::forward<_T2>(__y)); in operator()
80 noexcept(*std::forward<_T1>(__x) = std::declval<iter_value_t<_T2>>())) { in operator()
83 *std::forward<_T1>(__x) = std::move(__old); in operator()

12345678910>>...95