| /third_party/openssl/crypto/bn/ |
| D | rsa_sup_mul.c | 532 size_t l_im_count = 0, l_mul_count = 0, l_size = 0, l_mod_count = 0; in ossl_bn_rsa_do_unblind() local
544 l_size = l_im_count > l_mul_count ? l_im_count : l_mul_count; in ossl_bn_rsa_do_unblind()
545 l_im = OPENSSL_zalloc(l_size * LIMB_BYTE_SIZE); in ossl_bn_rsa_do_unblind()
546 l_mul = OPENSSL_zalloc(l_size * LIMB_BYTE_SIZE); in ossl_bn_rsa_do_unblind()
552 BN_to_limb(arg1, l_im, l_size); in ossl_bn_rsa_do_unblind()
553 BN_to_limb(arg2, l_mul, l_size); in ossl_bn_rsa_do_unblind()
556 l_ret = OPENSSL_malloc(2 * l_size * LIMB_BYTE_SIZE); in ossl_bn_rsa_do_unblind()
559 l_tmp_count = mul_limb_numb(l_size) > mod_montgomery_limb_numb(l_mod_count) ? in ossl_bn_rsa_do_unblind()
560 mul_limb_numb(l_size) : mod_montgomery_limb_numb(l_mod_count); in ossl_bn_rsa_do_unblind()
563 l_tmp_count = mul_limb_numb(l_size) > mod_limb_numb(2 * l_size, l_mod_count) ? in ossl_bn_rsa_do_unblind()
[all …]
|
| /third_party/boost/boost/move/algo/detail/ |
| D | pdqsort.hpp | 269 size_type l_size = size_type(pivot_pos - begin); in pdqsort_loop() local
271 bool highly_unbalanced = l_size < size / 8 || r_size < size / 8; in pdqsort_loop()
281 if (l_size >= insertion_sort_threshold) { in pdqsort_loop()
282 boost::adl_move_iter_swap(begin, begin + l_size / 4); in pdqsort_loop()
283 boost::adl_move_iter_swap(pivot_pos - 1, pivot_pos - l_size / 4); in pdqsort_loop()
285 if (l_size > ninther_threshold) { in pdqsort_loop()
286 boost::adl_move_iter_swap(begin + 1, begin + (l_size / 4 + 1)); in pdqsort_loop()
287 boost::adl_move_iter_swap(begin + 2, begin + (l_size / 4 + 2)); in pdqsort_loop()
288 boost::adl_move_iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); in pdqsort_loop()
289 boost::adl_move_iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); in pdqsort_loop()
|
| /third_party/boost/boost/sort/pdqsort/ |
| D | pdqsort.hpp | 264 int l_size = 0, r_size = 0; in partition_right_branchless() local
268 l_size = unknown_left; in partition_right_branchless()
271 l_size = block_size; in partition_right_branchless()
275 l_size = unknown_left/2; in partition_right_branchless()
276 r_size = unknown_left - l_size; in partition_right_branchless()
283 for (unsigned char i = 0; i < l_size;) { in partition_right_branchless()
299 if (num_l == 0) first += l_size; in partition_right_branchless()
441 diff_t l_size = pivot_pos - begin; in pdqsort_loop() local
443 bool highly_unbalanced = l_size < size / 8 || r_size < size / 8; in pdqsort_loop()
454 if (l_size >= insertion_sort_threshold) { in pdqsort_loop()
[all …]
|
| /third_party/boost/tools/build/src/engine/ |
| D | lists.cpp | 67 unsigned int const l_size = list_length( l ); in list_append() local
69 int const size = l_size + nl_size; in list_append()
73 if ( l_size <= ( 1u << ( bucket - 1 ) ) ) in list_append()
76 memcpy( list_begin( result ), list_begin( l ), l_size * sizeof( in list_append()
83 memcpy( list_begin( l ) + l_size, list_begin( nl ), nl_size * sizeof( in list_append()
|
| /third_party/boost/boost/spirit/home/x3/operator/detail/ |
| D | sequence.hpp | 130 static int const l_size = sequence_size<L, Context>::value; member
134 static int constexpr expected_size = l_size + r_size;
149 typedef typename fusion::result_of::advance_c<l_begin, l_size>::type l_end;
159 return l_part(i, fusion::advance_c<l_size>(i)); in left()
165 fusion::advance_c<l_size>(fusion::begin(s)) in right()
|
| /third_party/boost/boost/container/ |
| D | adaptive_pool.hpp | 331 std::size_t l_size = limit_size*sizeof(T); in priv_allocation_command() local
336 … ret = dlmalloc_allocation_command(command, sizeof(T), l_size, p_size, &r_size, reuse_ptr_void); in priv_allocation_command()
591 std::size_t l_size = limit_size*sizeof(T); in priv_allocation_command() local
596 … ret = dlmalloc_allocation_command(command, sizeof(T), l_size, p_size, &r_size, reuse_ptr_void); in priv_allocation_command()
|
| D | allocator.hpp | 350 std::size_t l_size = limit_size*sizeof(T); in priv_allocation_command() local
355 … ret = dlmalloc_allocation_command(command, sizeof(T), l_size, p_size, &r_size, reuse_ptr_void); in priv_allocation_command()
|
| D | node_allocator.hpp | 323 std::size_t l_size = limit_size*sizeof(T); in priv_allocation_command() local
328 … ret = dlmalloc_allocation_command(command, sizeof(T), l_size, p_size, &r_size, reuse_ptr_void); in priv_allocation_command()
|
| /third_party/mindspore/tests/ut/cpp/dataset/ |
| D | c_api_dataset_div2k_test.cc | 172 auto l_size = lr_image.Shape().size(); in TEST_F() local
174 MS_LOG(INFO) << "Tensor lr_image shape size: " << l_size; in TEST_F()
176 EXPECT_GT(l_size, 1); // Verify decode=true took effect in TEST_F()
|
| /third_party/boost/boost/test/tools/old/ |
| D | impl.hpp | 230 std::size_t l_size = pos; in operator ()() local
237 pr.message() << "\nCollections size mismatch: " << l_size << " != " << pos; in operator ()()
|
| /third_party/mindspore/mindspore/ops/operations/ |
| D | _inner_ops.py | 1308 l_size = (bs, heads, block_num, block_size // 16, block_size // 16, 16, 16)
1311 return l_size, g_size
|
| /third_party/boost/boost/interprocess/mem_algo/detail/ |
| D | simple_seq_fit_impl.hpp | 636 size_type l_size = limit_size*sizeof_object; in priv_allocation_command() local
643 ret = priv_allocate(command, l_size, r_size, reuse_ptr); in priv_allocation_command()
|
| /third_party/boost/boost/interprocess/mem_algo/ |
| D | rbtree_best_fit.hpp | 734 size_type l_size = limit_size*sizeof_object; in priv_allocation_command() local
741 ret = priv_allocate(command, l_size, r_size = p_size, reuse_ptr, sizeof_object); in priv_allocation_command()
|