Home
last modified time | relevance | path

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

/external/libcxx/test/std/thread/futures/futures.task/futures.task.members/
Dctor_func_alloc.pass.cpp34 static int n_copies; member in A
38 A(const A& a) : data_(a.data_) {++n_copies;} in A()
44 int A::n_copies = 0; member in A
58 assert(A::n_copies == 0); in main()
62 A::n_copies = 0; in main()
73 assert(A::n_copies > 0); in main()
77 A::n_copies = 0; in main()
89 A::n_copies = 0; in main()
101 A::n_copies = 0; in main()
110 assert(A::n_copies == 0); in main()
[all …]
Dctor_func.pass.cpp29 static int n_copies; member in A
33 A(const A& a) : data_(a.data_) {++n_copies;} in A()
39 int A::n_copies = 0; member in A
51 assert(A::n_copies == 0); in main()
54 A::n_copies = 0; in main()
55 A::n_copies = 0; in main()
63 assert(A::n_copies > 0); in main()
/external/harfbuzz_ng/src/
Dhb-ot-shape-complex-arabic.cc525 int n_copies = 0; in apply_stch() local
529 n_copies = (sign * w_remaining) / (sign * w_repeating) - 1; in apply_stch()
533 hb_position_t shortfall = sign * w_remaining - sign * w_repeating * (n_copies + 1); in apply_stch()
536 ++n_copies; in apply_stch()
537 hb_position_t excess = (n_copies + 1) * sign * w_repeating - sign * w_remaining; in apply_stch()
539 extra_repeat_overlap = excess / (n_copies * n_repeating); in apply_stch()
544 extra_glyphs_needed += n_copies * n_repeating; in apply_stch()
545 DEBUG_MSG (ARABIC, nullptr, "will add extra %d copies of repeating tiles", n_copies); in apply_stch()
557 repeat += n_copies; in apply_stch()
/external/swiftshader/third_party/LLVM/lib/Target/CellSPU/
DSPUISelLowering.cpp1955 size_t n_copies; in LowerSCALAR_TO_VECTOR() local
1961 case MVT::v16i8: n_copies = 16; VT = MVT::i8; break; in LowerSCALAR_TO_VECTOR()
1962 case MVT::v8i16: n_copies = 8; VT = MVT::i16; break; in LowerSCALAR_TO_VECTOR()
1963 case MVT::v4i32: n_copies = 4; VT = MVT::i32; break; in LowerSCALAR_TO_VECTOR()
1964 case MVT::v4f32: n_copies = 4; VT = MVT::f32; break; in LowerSCALAR_TO_VECTOR()
1965 case MVT::v2i64: n_copies = 2; VT = MVT::i64; break; in LowerSCALAR_TO_VECTOR()
1966 case MVT::v2f64: n_copies = 2; VT = MVT::f64; break; in LowerSCALAR_TO_VECTOR()
1970 for (size_t j = 0; j < n_copies; ++j) in LowerSCALAR_TO_VECTOR()