| /external/llvm/test/CodeGen/AMDGPU/ |
| predicate-dp4.ll | 4 ; CHECK: PRED_SETE_INT * Pred,
|
| /external/llvm/test/CodeGen/Hexagon/ |
| v60small.ll | 30 %4 = call <512 x i1> @llvm.hexagon.V6.pred.and(<512 x i1> %1, <512 x i1> %3)
37 %10 = call <512 x i1> @llvm.hexagon.V6.pred.and.n(<512 x i1> %7, <512 x i1> %9)
45 declare <512 x i1> @llvm.hexagon.V6.pred.and(<512 x i1>, <512 x i1>) #1
48 declare <512 x i1> @llvm.hexagon.V6.pred.and.n(<512 x i1>, <512 x i1>) #1
|
| /external/ltrace/testsuite/ltrace.torture/ |
| ia64-sigill.s | 2 .pred.safe_across_calls p1-p5,p16-p63
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_variance.c | 210 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 64 * 64); // compound pred buffer
267 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 32 * 64); // compound pred buffer
324 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 32 * 16); // compound pred buffer
381 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 16 * 32); // compound pred buffer
605 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 4 * 4); // compound pred buffer
652 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 8 * 8); // compound pred buffer
696 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 16 * 16); // compound pred buffer
741 DECLARE_ALIGNED_ARRAY(16, uint8_t, temp3, 64 * 64); // compound pred buffer
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
14 // && CopyConstructible<Pred>
16 // partition(Iter first, Iter last, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy_pred.pass.cpp | 13 // EquivalenceRelation<auto, InIter::value_type> Pred>
17 // && CopyConstructible<Pred>
19 // unique_copy(InIter first, InIter last, OutIter result, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/ |
| floating_point_comparison.hpp | 231 close_at_tolerance<FPT> pred( tolerance, fpc_type );
233 return pred( left, right );
244 close_at_tolerance<FPT> pred( tolerance, fpc_type );
246 return pred( left, right );
|
| /packages/inputmethods/LatinIME/java/res/values-sk/ |
| strings-action-keys.xml | 25 <string name="label_previous_key" msgid="1421141755779895275">"Pred."</string>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 126 template<typename Pred>
128 erase_if(Pred);
130 template<typename Pred>
132 split(Pred, PB_DS_CLASS_C_DEC&);
|
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pairing_heap_/ |
| erase_fn_imps.hpp | 198 template<typename Pred>
201 erase_if(Pred pred)
210 node_pointer p_out = base_type::prune(pred);
|
| pairing_heap_.hpp | 128 template<typename Pred>
130 erase_if(Pred);
132 template<typename Pred>
134 split(Pred, pairing_heap&);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
| erase_fn_imps.hpp | 204 template<typename Pred>
207 erase_if(Pred pred)
217 node_pointer p_out = base_type::prune(pred);
|
| thin_heap_.hpp | 125 template<typename Pred>
127 erase_if(Pred);
129 template<typename Pred>
131 split(Pred, PB_DS_CLASS_C_DEC&);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 126 template<typename Pred>
128 erase_if(Pred);
130 template<typename Pred>
132 split(Pred, PB_DS_CLASS_C_DEC&);
|
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pairing_heap_/ |
| erase_fn_imps.hpp | 198 template<typename Pred>
201 erase_if(Pred pred)
210 node_pointer p_out = base_type::prune(pred);
|
| pairing_heap_.hpp | 128 template<typename Pred>
130 erase_if(Pred);
132 template<typename Pred>
134 split(Pred, pairing_heap&);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
| erase_fn_imps.hpp | 204 template<typename Pred>
207 erase_if(Pred pred)
217 node_pointer p_out = base_type::prune(pred);
|
| thin_heap_.hpp | 125 template<typename Pred>
127 erase_if(Pred);
129 template<typename Pred>
131 split(Pred, PB_DS_CLASS_C_DEC&);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 126 template<typename Pred>
128 erase_if(Pred);
130 template<typename Pred>
132 split(Pred, PB_DS_CLASS_C_DEC&);
|
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
59 node_pointer p_out = base_type::prune(pred);
|
