HomeSort by relevance Sort by last modified time
    Searched refs:n_copies (Results 1 - 9 of 9) sorted by null

  /external/libcxx/test/std/thread/futures/futures.task/futures.task.members/
ctor_func.pass.cpp 29 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);
ctor_func_alloc.pass.cpp 32 static int n_copies; member in class:A
36 A(const A& a) : data_(a.data_) {++n_copies;}
42 int A::n_copies = 0; member in class:A
56 assert(A::n_copies == 0);
60 A::n_copies = 0; member in class:A
71 assert(A::n_copies > 0);
75 A::n_copies = 0; member in class:A
87 A::n_copies = 0; member in class:A
99 A::n_copies = 0; member in class:A
108 assert(A::n_copies == 0)
111 A::n_copies = 0; member in class:A
123 A::n_copies = 0; member in class:A
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/thread/futures/futures.tas/futures.task.members/
ctor_func.pass.cpp 26 static int n_copies; member in class:A
30 A(const A& a) : data_(a.data_) {++n_copies;}
36 int A::n_copies = 0; member in class:A
48 assert(A::n_copies == 0);
51 A::n_copies = 0; member in class:A
52 A::n_copies = 0; member in class:A
60 assert(A::n_copies > 0);
ctor_func_alloc.pass.cpp 28 static int n_copies; member in class:A
32 A(const A& a) : data_(a.data_) {++n_copies;}
38 int A::n_copies = 0; member in class:A
52 assert(A::n_copies == 0);
56 A::n_copies = 0; member in class:A
67 assert(A::n_copies > 0);
71 A::n_copies = 0; member in class:A
83 A::n_copies = 0; member in class:A
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/thread/futures/futures.tas/futures.task.members/
ctor_func.pass.cpp 29 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);
ctor_func_alloc.pass.cpp 32 static int n_copies; member in class:A
36 A(const A& a) : data_(a.data_) {++n_copies;}
42 int A::n_copies = 0; member in class:A
56 assert(A::n_copies == 0);
60 A::n_copies = 0; member in class:A
71 assert(A::n_copies > 0);
75 A::n_copies = 0; member in class:A
87 A::n_copies = 0; member in class:A
99 A::n_copies = 0; member in class:A
108 assert(A::n_copies == 0)
111 A::n_copies = 0; member in class:A
123 A::n_copies = 0; member in class:A
    [all...]
  /external/harfbuzz_ng/src/
hb-ot-shape-complex-arabic.cc 534 int n_copies = 0; local
538 n_copies = (sign * w_remaining) / (sign * w_repeating) - 1;
542 hb_position_t shortfall = sign * w_remaining - sign * w_repeating * (n_copies + 1);
545 ++n_copies;
546 hb_position_t excess = (n_copies + 1) * sign * w_repeating - sign * w_remaining;
548 extra_repeat_overlap = excess / (n_copies * n_repeating);
553 extra_glyphs_needed += n_copies * n_repeating;
554 DEBUG_MSG (ARABIC, NULL, "will add extra %d copies of repeating tiles", n_copies);
565 repeat += n_copies;
  /external/valgrind/memcheck/tests/common/
sh-mem-vec128.tmpl.c 241 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/
SPUISelLowering.cpp 1955 size_t n_copies; local
    [all...]

Completed in 1158 milliseconds