Home
last modified time | relevance | path

Searched refs:__f1 (Results 1 – 10 of 10) sorted by relevance

/external/libcxx/include/
Dforward_list857 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
1584 forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
1587 if (__f1 == nullptr)
1590 return __f1;
1592 if (__comp(__f2->__value_, __f1->__value_))
1596 __comp(__t->__next_->__value_, __f1->__value_))
1600 __t->__next_ = __f1;
1603 __r = __f1;
1604 __node_pointer __p = __f1;
1605 __f1 = __f1->__next_;
[all …]
Dlist1131 static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
2219 iterator __f1 = begin();
2223 while (__f1 != __e1 && __f2 != __e2)
2225 if (__comp(*__f2, *__f1))
2229 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2237 __m2 = _VSTD::next(__f1);
2238 __link_nodes(__f1.__ptr_, __f, __l);
2239 __f1 = __m2;
2242 ++__f1;
2286 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
[all …]
/external/llvm-project/llvm/test/CodeGen/PowerPC/
D2016-01-07-BranchWeightCrash.ll7 declare i32 @__f1(i8*, %struct.buffer_t* noalias)
18 %__f1_result = call i32 @__f1(i8* %__user_context, %struct.buffer_t* %f1.buffer) #5
/external/llvm/test/CodeGen/PowerPC/
D2016-01-07-BranchWeightCrash.ll7 declare i32 @__f1(i8*, %struct.buffer_t* noalias)
18 %__f1_result = call i32 @__f1(i8* %__user_context, %struct.buffer_t* %f1.buffer) #5
/external/llvm-project/libcxx/include/
Dforward_list863 __merge(__node_pointer __f1, __node_pointer __f2, _Compare& __comp);
1599 forward_list<_Tp, _Alloc>::__merge(__node_pointer __f1, __node_pointer __f2,
1602 if (__f1 == nullptr)
1605 return __f1;
1607 if (__comp(__f2->__value_, __f1->__value_))
1611 __comp(__t->__next_->__value_, __f1->__value_))
1615 __t->__next_ = __f1;
1618 __r = __f1;
1619 __node_pointer __p = __f1;
1620 __f1 = __f1->__next_;
[all …]
Dlist1138 static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
2235 iterator __f1 = begin();
2239 while (__f1 != __e1 && __f2 != __e2)
2241 if (__comp(*__f2, *__f1))
2245 for (; __m2 != __e2 && __comp(*__m2, *__f1); ++__m2, ++__ds)
2253 __m2 = _VSTD::next(__f1);
2254 __link_nodes(__f1.__ptr_, __f, __l);
2255 __f1 = __m2;
2258 ++__f1;
2302 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
[all …]
/external/llvm-project/pstl/include/pstl/internal/
Dutils.h67 __invoke_if_else(std::true_type, _F1 __f1, _F2) in __invoke_if_else() argument
69 return __f1(); in __invoke_if_else()
Dparallel_backend_serial.h125 __parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2) in __parallel_invoke() argument
127 std::forward<_F1>(__f1)(); in __parallel_invoke() local
Dparallel_backend_tbb.h1285 __parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2) in __parallel_invoke() argument
1288 …tbb::this_task_arena::isolate([&]() { tbb::parallel_invoke(std::forward<_F1>(__f1), std::forward<_… in __parallel_invoke()
Dalgorithm_impl.h2648 …[__is_vector](_RandomAccessIterator1 __f1, _RandomAccessIterator1 __l1, _RandomAccessIterator2 __f… in __pattern_merge()
2650 return __internal::__brick_merge(__f1, __l1, __f2, __l2, __f3, __comp, __is_vector); in __pattern_merge()
2710 … [__n, __move_values, __move_sequences](_BidirectionalIterator __f1, _BidirectionalIterator __l1, in __pattern_inplace_merge()
2713 …(__utils::__serial_move_merge(__n))(__f1, __l1, __f2, __l2, __f3, __comp, __move_values, __move_va… in __pattern_inplace_merge()
2715 return __f3 + (__l1 - __f1) + (__l2 - __f2); in __pattern_inplace_merge()