Home
last modified time | relevance | path

Searched refs:max_n2 (Results 1 – 4 of 4) sorted by relevance

/external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/
Dlexicographical_compare.pass.cpp61 std::size_t max_n2 = max_n / 10; in test() local
62 …_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbegin() + max_n2, in test()
64 … invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.begin() + max_n2, in test()
65 in2.begin() + 3 * max_n2, pred); in test()
68 max_n2 = 2 * max_n; in test()
69 …_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.begin() + max_n2, in test()
/external/libxaac/decoder/
Dixheaacd_hbe_trans.c365 WORD32 tr, n1, n2, max_trans_fac, max_n1, max_n2; in ixheaacd_hbe_xprod_proc_3() local
382 max_n1 = max_n2 = max_trans_fac = 0; in ixheaacd_hbe_xprod_proc_3()
400 max_n2 = n2; in ixheaacd_hbe_xprod_proc_3()
405 max_n2 < NO_QMF_SYNTH_CHANNELS) { in ixheaacd_hbe_xprod_proc_3()
425 idx = max_n2 & 3; in ixheaacd_hbe_xprod_proc_3()
433 vec_y_r[1] = qmf_in_buf_ri[2 * max_n2]; in ixheaacd_hbe_xprod_proc_3()
434 vec_y_i[1] = qmf_in_buf_ri[2 * max_n2 + 1]; in ixheaacd_hbe_xprod_proc_3()
438 HBE_ZERO_BAND_IDX][2 * max_n2]; in ixheaacd_hbe_xprod_proc_3()
440 HBE_ZERO_BAND_IDX][2 * max_n2 + 1]; in ixheaacd_hbe_xprod_proc_3()
446 HBE_ZERO_BAND_IDX][2 * max_n2]; in ixheaacd_hbe_xprod_proc_3()
[all …]
/external/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/
Dfind_first_of.pass.cpp60 const std::size_t max_n2 = (max_n1 * 10) / 8; in test() local
62 Sequence<T> in2(max_n2, [](std::size_t) { return T(0); }); in test()
Dfind_end.pass.cpp72 const std::size_t max_n2 = (max_n1 * 10) / 8; in test() local
74 Sequence<T> sub(max_n2, [bits](std::size_t) { return T(2 * HashBits(max_n1, bits - 1)); }); in test()