Home
last modified time | relevance | path

Searched refs:FPLLL_DEBUG_CHECK (Results 1 – 17 of 17) sorted by relevance

/dports/math/fplll/fplll-5.4.1/fplll/
H A Dhouseholder.h514 FPLLL_DEBUG_CHECK(i >= 0 && i < d); in get_R()
522 FPLLL_DEBUG_CHECK(i >= 0 && i < d); in get_b()
541 FPLLL_DEBUG_CHECK(k >= 0 && k < d); in norm_square_b_row()
556 FPLLL_DEBUG_CHECK(k >= 0 && k < d); in norm_square_R_row()
557 FPLLL_DEBUG_CHECK(beg <= end); in norm_square_R_row()
558 FPLLL_DEBUG_CHECK(end <= k); in norm_square_R_row()
574 FPLLL_DEBUG_CHECK(k >= 0 && k < d); in norm_R_row()
575 FPLLL_DEBUG_CHECK(beg <= end); in norm_R_row()
625 FPLLL_DEBUG_CHECK(i >= 0 && i < d); in get_norm_square_b()
649 FPLLL_DEBUG_CHECK(k >= 0 && k < d); in norm_square_R_row_naively()
[all …]
H A Dhouseholder.cpp128 FPLLL_DEBUG_CHECK(enable_row_expo ? 1 : R(i, k).is_zero()); in update_R_last()
154 FPLLL_DEBUG_CHECK(i <= n_known_rows); in update_R()
189 FPLLL_DEBUG_CHECK(col_kept[i] == false); in refresh_R_bf()
217 FPLLL_DEBUG_CHECK(row_expo[i] >= 0); in refresh_R_bf()
250 FPLLL_DEBUG_CHECK(col_kept[i] == true); in refresh_R()
266 FPLLL_DEBUG_CHECK(i <= n_known_rows_naively); in update_R_naively()
285 FPLLL_DEBUG_CHECK(row_expo_naively[i] >= 0); in update_R_naively()
374 FPLLL_DEBUG_CHECK(0 <= i && i < j && j < d); in swap()
405 FPLLL_DEBUG_CHECK(k > 0 && k < d); in size_reduce()
525 FPLLL_DEBUG_CHECK(j >= 0 && i == n_known_rows && j < i); in row_addmul_we()
[all …]
H A Dhlll.cpp196 FPLLL_DEBUG_CHECK(expo0 == expo1); in lovasz_test()
227 FPLLL_DEBUG_CHECK(2 * expo0 == expo1); in lovasz_test()
266 FPLLL_DEBUG_CHECK(kappa >= size_reduction_end); in size_reduction()
267 FPLLL_DEBUG_CHECK(size_reduction_start < size_reduction_end); in size_reduction()
268 FPLLL_DEBUG_CHECK(0 <= size_reduction_start); in size_reduction()
387 FPLLL_DEBUG_CHECK(expo0 % 2 == 0); in verify_size_reduction()
405 FPLLL_DEBUG_CHECK(expo0 == expo1); // Since R[kappa] and b[kappa] share the same row_expo. in verify_size_reduction()
474 FPLLL_DEBUG_CHECK(expo0 == expo1); in verify_size_reduction()
536 FPLLL_DEBUG_CHECK(expo0 == expo1); in is_hlll_reduced()
560 FPLLL_DEBUG_CHECK(expo0 == expo1); in is_hlll_reduced()
H A Dgso_interface.h651 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < i && j < gso_valid_cols[i] && in get_mu_exp()
662 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < i && j < gso_valid_cols[i] && in get_mu_exp()
669 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < i && j < gso_valid_cols[i] && in get_mu()
680 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < gso_valid_cols[i] && in get_r_exp()
691 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < gso_valid_cols[i] && in get_r_exp()
698 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j < gso_valid_cols[i] && in get_r()
713 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && gso_valid_cols[i] >= j && j >= 0 && in set_r()
752 FPLLL_DEBUG_CHECK(row_op_first == -1); in row_op_begin()
H A Dgso.h115 FPLLL_DEBUG_CHECK(!(enable_int_gram && enable_row_expo)); in MatGSO()
262 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j <= i && j < n_source_rows && in get_gram()
281 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j <= i && j < n_source_rows && in get_int_gram()
297 FPLLL_DEBUG_CHECK(!cols_locked); in create_rows()
322 FPLLL_DEBUG_CHECK(!cols_locked && d >= n_removed_rows); in remove_last_rows()
H A Dgso_gram.cpp28 FPLLL_DEBUG_CHECK(n_known_rows < d); in discover_row()
31 FPLLL_DEBUG_CHECK(!(cols_locked && enable_int_gram)); in discover_row()
230 FPLLL_DEBUG_CHECK(j >= 0 && i < n_known_rows && j < n_source_rows); in row_addmul_we()
256 FPLLL_DEBUG_CHECK(!enable_inverse_transform); in row_swap()
285 FPLLL_DEBUG_CHECK(!cols_locked); in move_row()
288 FPLLL_DEBUG_CHECK(old_r < n_known_rows && !cols_locked); in move_row()
H A Dgso_interface.cpp28 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && new_valid_cols >= 0 && new_valid_cols <= i + 1); in invalidate_gso_row()
35 FPLLL_DEBUG_CHECK(row_op_first == first && row_op_last == last); in row_op_end()
90 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && gso_valid_cols[i] >= n_columns); in get_max_mu_exp()
139 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && last_j >= 0 && last_j < n_source_rows); in update_gso_row()
146 FPLLL_DEBUG_CHECK(j == i || gso_valid_cols[j] >= j); in update_gso_row()
H A Dgso.cpp58 FPLLL_DEBUG_CHECK(n_known_rows < d); in discover_row()
61 FPLLL_DEBUG_CHECK(!(cols_locked && enable_int_gram)); in discover_row()
239 FPLLL_DEBUG_CHECK(j >= 0 && /* i > j &&*/ i < n_known_rows && j < n_source_rows); in row_addmul_we()
266 FPLLL_DEBUG_CHECK(!enable_inverse_transform); in row_swap()
291 FPLLL_DEBUG_CHECK(!cols_locked); in move_row()
294 FPLLL_DEBUG_CHECK(old_r < n_known_rows && !cols_locked); in move_row()
H A Dgso_gram.h236 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j <= i && j < n_source_rows && in get_gram()
251 FPLLL_DEBUG_CHECK(i >= 0 && i < n_known_rows && j >= 0 && j <= i && j < n_source_rows && in get_int_gram()
266 FPLLL_DEBUG_CHECK(!cols_locked && d >= n_removed_rows); in remove_last_rows()
276 FPLLL_DEBUG_CHECK(!cols_locked); in create_rows()
H A Ddefs.h102 #define FPLLL_DEBUG_CHECK(x) assert(x); macro
109 #define FPLLL_DEBUG_CHECK(x) macro
H A Dbkz_param.cpp96 FPLLL_DEBUG_CHECK(block_size < 4096); // some arbitrary upper limit in load_strategies_json()
140 FPLLL_DEBUG_CHECK(pruning.expectation > 0.0 && pruning.expectation <= 1.0); in load_strategies_json()
H A Dbkz.cpp87 FPLLL_DEBUG_CHECK(param.strategies.size() > block_size); in get_pruning()
106 FPLLL_DEBUG_CHECK(param.strategies.size() > block_size); in svp_preprocessing()
145 FPLLL_DEBUG_CHECK(nz_vectors > 0); in svp_postprocessing()
151 FPLLL_DEBUG_CHECK(i_vector != -1 && i_vector != (pos - kappa)); in svp_postprocessing()
327 FPLLL_DEBUG_CHECK(pruning.metric == PRUNER_METRIC_PROBABILITY_OF_SHORTEST) in svp_reduction()
H A Dlll.cpp51 FPLLL_DEBUG_CHECK(kappa_min <= kappa_start && kappa_start < kappa_end && kappa_end <= m.d); in lll()
H A Dsvpcvp.cpp500 FPLLL_DEBUG_CHECK(mu.get_rows() == n && mu.get_cols() == n && r.get_rows() == n && in get_gscoords()
/dports/math/fplll/fplll-5.4.1/fplll/nr/
H A Dnumvect.h59 FPLLL_DEBUG_CHECK(0 <= first && first <= last && last < static_cast<int>(v.size())); in rotate_left_by_swap()
69 FPLLL_DEBUG_CHECK(0 <= first && first <= last && last < static_cast<int>(v.size())); in rotate_right_by_swap()
270 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in add()
277 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in sub()
284 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in mul()
293 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in div()
302 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in addmul()
315 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in addmul_2exp()
326 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in addmul_si()
334 FPLLL_DEBUG_CHECK(n <= size() && size() == v.size() && v.is_zero(n)); in addmul_si_2exp()
[all …]
H A Dmatrix.h160 FPLLL_DEBUG_CHECK(i >= 0 && i < r && j >= 0 && j < c); in operator()
166 FPLLL_DEBUG_CHECK(i >= 0 && i < r && j >= 0 && j < c); in operator()
172 FPLLL_DEBUG_CHECK(i >= 0 && i < r);
179 FPLLL_DEBUG_CHECK(i >= 0 && i < r);
H A Dmatrix.cpp67 FPLLL_DEBUG_CHECK(0 <= first && first <= last && last < n_valid_rows && n_valid_rows <= r); in rotate_gram_left()
82 FPLLL_DEBUG_CHECK(0 <= first && first <= last && last < n_valid_rows && n_valid_rows <= r); in rotate_gram_right()