Home
last modified time | relevance | path

Searched refs:n_max (Results 1 – 10 of 10) sorted by relevance

/external/llvm-project/pstl/test/std/algorithms/alg.sorting/
Dpartial_sort_copy.pass.cpp134 const std::size_t n_max = 100000; in test_partial_sort_copy() local
135 Sequence<T> in(n_max); in test_partial_sort_copy()
136 Sequence<T> out(2 * n_max); in test_partial_sort_copy()
137 Sequence<T> exp(2 * n_max); in test_partial_sort_copy()
141 for (; n1 < n_max; n1 = n1 <= 16 ? n1 + 1 : size_t(3.1415 * n1)) in test_partial_sort_copy()
162 n1 = n_max; in test_partial_sort_copy()
Dpartial_sort.pass.cpp112 const std::size_t n_max = 100000; in test_partial_sort() local
113 Sequence<T> in(n_max); in test_partial_sort()
114 Sequence<T> exp(n_max); in test_partial_sort()
115 for (std::size_t n = 0; n < n_max; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) in test_partial_sort()
/external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
Dincludes.pass.cpp71 const std::size_t n_max = 1000000; in test_includes() local
76 for (std::size_t n = 0; n < n_max; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) in test_includes()
78 for (std::size_t m = 0; m < n_max; m = m <= 16 ? m + 1 : size_t(2.71828 * m)) in test_includes()
Dset.pass.cpp180 const std::size_t n_max = 100000; in test_set() local
185 for (std::size_t n = 0; n < n_max; n = n <= 16 ? n + 1 : size_t(3.1415 * n)) in test_set()
187 for (std::size_t m = 0; m < n_max; m = m <= 16 ? m + 1 : size_t(2.71828 * m)) in test_set()
/external/llvm-project/llvm/test/CodeGen/Thumb2/
D2009-12-01-LoopIVUsers.ll37 %n_max = alloca i32 ; <i32*> [#uses=4]
72 store i32 %11, i32* %n_max, align 4
74 %13 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
77 %15 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
78 %16 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
/external/llvm/test/CodeGen/Thumb2/
D2009-12-01-LoopIVUsers.ll37 %n_max = alloca i32 ; <i32*> [#uses=4]
72 store i32 %11, i32* %n_max, align 4
74 %13 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
77 %15 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
78 %16 = load i32, i32* %n_max, align 4 ; <i32> [#uses=1]
/external/tensorflow/tensorflow/python/ops/numpy_ops/
Dnp_array_ops_test.py202 n_max = 3
205 for n in range(1, n_max + 1):
216 for n in range(1, n_max + 1):
234 n_max = 3
236 for n in range(1, n_max + 1):
240 for n in range(1, n_max + 1):
/external/skqp/src/compute/hs/gen/
Dmain.c413 uint32_t const n_max = MAX_MACRO(merge->levels[level].networks[0], in hsg_merge_levels_hint() local
416 if (n_max <= (merge->rows_bs + hsg_config.thread.xtra)) in hsg_merge_levels_hint()
421 hsg_config.thread.xtra = n_max - merge->rows_bs; in hsg_merge_levels_hint()
444 n_max - merge->rows_bs); in hsg_merge_levels_hint()
/external/skqp/src/compute/hs/cl/
Dhs_cl.c947 char const n_max = '0'+(char)count; in hs_create_kernels() local
949 for (char n = '0'; n<n_max; n++) in hs_create_kernels()
/external/libxml2/
Dtestapi.c26245 int n_max; in test_xmlValidGetPotentialChildren() local
26250 for (n_max = 0;n_max < gen_nb_int;n_max++) { in test_xmlValidGetPotentialChildren()
26255 max = gen_int(n_max, 3); in test_xmlValidGetPotentialChildren()
26263 des_int(n_max, max, 3); in test_xmlValidGetPotentialChildren()
26272 printf(" %d", n_max); in test_xmlValidGetPotentialChildren()
26302 int n_max; in test_xmlValidGetValidElements() local
26307 for (n_max = 0;n_max < gen_nb_int;n_max++) { in test_xmlValidGetValidElements()
26312 max = gen_int(n_max, 3); in test_xmlValidGetValidElements()
26320 des_int(n_max, max, 3); in test_xmlValidGetValidElements()
26329 printf(" %d", n_max); in test_xmlValidGetValidElements()
[all …]