Searched refs:n_copies (Results 1 - 5 of 5) sorted by relevance

/external/libcxx/test/std/thread/futures/futures.task/futures.task.members/
H A Dctor_func.pass.cpp29 static int n_copies; member in class:A
33 A(const A& a) : data_(a.data_) {++n_copies;}
39 int A::n_copies = 0; member in class:A
51 assert(A::n_copies == 0);
54 A::n_copies = 0; member in class:A
55 A::n_copies = 0; member in class:A
63 assert(A::n_copies > 0);
H A Dctor_func_alloc.pass.cpp34 static int n_copies; member in class:A
38 A(const A& a) : data_(a.data_) {++n_copies;}
44 int A::n_copies = 0; member in class:A
58 assert(A::n_copies == 0);
62 A::n_copies = 0; member in class:A
73 assert(A::n_copies > 0);
77 A::n_copies = 0; member in class:A
89 A::n_copies = 0; member in class:A
101 A::n_copies = 0; member in class:A
110 assert(A::n_copies
113 A::n_copies = 0; member in class:A
125 A::n_copies = 0; member in class:A
[all...]
/external/harfbuzz_ng/src/
H A Dhb-ot-shape-complex-arabic.cc539 int n_copies = 0; local
543 n_copies = (sign * w_remaining) / (sign * w_repeating) - 1;
547 hb_position_t shortfall = sign * w_remaining - sign * w_repeating * (n_copies + 1);
550 ++n_copies;
551 hb_position_t excess = (n_copies + 1) * sign * w_repeating - sign * w_remaining;
553 extra_repeat_overlap = excess / (n_copies * n_repeating);
558 extra_glyphs_needed += n_copies * n_repeating;
559 DEBUG_MSG (ARABIC, nullptr, "will add extra %d copies of repeating tiles", n_copies);
571 repeat += n_copies;
/external/valgrind/memcheck/tests/common/
H A Dsh-mem-vec128.tmpl.c241 const U4 n_copies = N_EVENTS; local
247 for (i = 0; i < n_copies; i++) {
289 n_copies, n_d_aligned, n_s_aligned, n_both_aligned);
/external/swiftshader/third_party/LLVM/lib/Target/CellSPU/
H A DSPUISelLowering.cpp1955 size_t n_copies; local
1961 case MVT::v16i8: n_copies = 16; VT = MVT::i8; break;
1962 case MVT::v8i16: n_copies = 8; VT = MVT::i16; break;
1963 case MVT::v4i32: n_copies = 4; VT = MVT::i32; break;
1964 case MVT::v4f32: n_copies = 4; VT = MVT::f32; break;
1965 case MVT::v2i64: n_copies = 2; VT = MVT::i64; break;
1966 case MVT::v2f64: n_copies = 2; VT = MVT::f64; break;
1970 for (size_t j = 0; j < n_copies; ++j)

Completed in 254 milliseconds