Home
last modified time | relevance | path

Searched refs:rci_t (Results 1 – 25 of 86) sorted by relevance

1234

/dports/math/m4ri/m4ri-release-20200125/m4ri/
H A Dbrilliantrussian.h56 void mzd_make_table(mzd_t const *M, rci_t r, rci_t c, int k, mzd_t *T, rci_t *L);
74 void mzd_process_rows(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k, mzd_t const *T…
91 …ocess_rows2(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k, mzd_t const *T0, rci_t
110 void mzd_process_rows3(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k,
111 mzd_t const *T0, rci_t const *L0, mzd_t const *T1, rci_t const *L1,
133 void mzd_process_rows4(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k,
134 mzd_t const *T0, rci_t const *L0, mzd_t const *T1, rci_t const *L1,
158 void mzd_process_rows5(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k,
159 mzd_t const *T0, rci_t const *L0, mzd_t const *T1, rci_t const *L1,
186 void mzd_process_rows6(mzd_t *M, rci_t startrow, rci_t endrow, rci_t startcol, int k,
[all …]
H A Dple_russian.h41 rci_t *M; /*!< lookup for multiplication */
42 rci_t *E; /*!< lookup for elimination */
53 ple_table_t *ple_table_init(int k, rci_t ncols);
124 rci_t const start_row, rci_t const stop_row,
126 mzp_t *P, mzp_t *Q, rci_t *pivots, rci_t *done, rci_t *done_row,
140 mzd_t *_mzd_ple_to_e(mzd_t *E, mzd_t const *A, rci_t r, rci_t c, int k, rci_t *offsets);
153 void _mzd_process_rows_ple_2(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k,…
166 void _mzd_process_rows_ple_3(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k,…
179 void _mzd_process_rows_ple_4(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k,…
192 void _mzd_process_rows_ple_5(mzd_t *M, rci_t startrow, rci_t stoprow, rci_t startcol, int const *k,…
[all …]
H A Dmzd.h320 mzd_t *mzd_init(rci_t const r, rci_t const c);
351 mzd_t *mzd_init_window(mzd_t *M, rci_t const lowr, rci_t const lowc, rci_t const highr, rci_t const…
359 …line mzd_t const *mzd_init_window_const(mzd_t const *M, rci_t const lowr, rci_t const lowc, rci_t in mzd_init_window_const()
427 void mzd_copy_row(mzd_t *B, rci_t i, mzd_t const *A, rci_t j);
437 void mzd_col_swap(mzd_t *M, rci_t const cola, rci_t const colb);
449 static inline void mzd_col_swap_in_rows(mzd_t *M, rci_t const cola, rci_t const colb, rci_t const s… in mzd_col_swap_in_rows()
664 static inline void mzd_row_add_offset(mzd_t *M, rci_t dstrow, rci_t srcrow, rci_t coloffset) { in mzd_row_add_offset()
724 void mzd_row_add(mzd_t *M, rci_t const sourcerow, rci_t const destrow);
953 mzd_t *mzd_submatrix(mzd_t *S, mzd_t const *M, rci_t const lowr, rci_t const lowc, rci_t const high…
1252 int mzd_find_pivot(mzd_t const *M, rci_t start_row, rci_t start_col, rci_t *r, rci_t *c);
[all …]
H A Dbrilliantrussian.c650 rci_t *L0 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
651 rci_t *L1 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
652 rci_t *L2 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
653 rci_t *L3 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
654 rci_t *L4 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
655 rci_t *L5 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_echelonize_m4ri()
838 rci_t _mzd_top_echelonize_m4ri(mzd_t *A, int k, rci_t r, rci_t c, rci_t max_r) { in _mzd_top_echelonize_m4ri()
858 rci_t *L0 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_top_echelonize_m4ri()
859 rci_t *L1 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_top_echelonize_m4ri()
860 rci_t *L2 = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_top_echelonize_m4ri()
[all …]
H A Dple.c47 rci_t r = _mzd_pluq(A, P, Q, cutoff); in mzd_pluq()
53 rci_t r = _mzd_ple(A, P, Q, cutoff); in _mzd_pluq()
65 rci_t ncols = A->ncols; in _mzd_ple()
68 rci_t nrows = mzd_first_zero_row(A); in _mzd_ple()
71 for(rci_t i = 0; i < A->ncols; ++i) in _mzd_ple()
77 rci_t nrows = A->nrows; in _mzd_ple()
191 rci_t curr_pos = 0; in _mzd_pluq_naive()
195 rci_t i, j; in _mzd_pluq_naive()
239 rci_t col_pos = 0; in _mzd_ple_naive()
240 rci_t row_pos = 0; in _mzd_ple_naive()
[all …]
H A Ddjb.h36 rci_t nrows; /*!< Number of rows of map */
37 rci_t ncols; /*!< Number of columns of map */
38 rci_t *target; /*!< target row at index i */
39 rci_t *source; /*!< source row at index i */
41 rci_t length; /*!< length of target, source and srctype */
58 static inline djb_t *djb_init(rci_t nrows, rci_t ncols) { in djb_init()
66 m->target = (rci_t*)malloc(sizeof(rci_t) * M4RI_DJB_BASE_SIZE); in djb_init()
67 m->source = (rci_t*)malloc(sizeof(rci_t) * M4RI_DJB_BASE_SIZE); in djb_init()
99 static inline void djb_push_back(djb_t *z, rci_t target, rci_t source, srctyp_t srctyp) { in djb_push_back()
105 z->target = (rci_t*)realloc(z->target, z->allocated*sizeof(rci_t)); in djb_push_back()
[all …]
H A Dple_russian.c43 T->M = (rci_t*)m4ri_mm_malloc(__M4RI_TWOPOW(k)*sizeof(rci_t)); in ple_table_init()
44 T->E = (rci_t*)m4ri_mm_malloc(__M4RI_TWOPOW(k)*sizeof(rci_t)); in ple_table_init()
57 static inline rci_t _max_value(rci_t *data, int length) { in _max_value()
58 rci_t max = 0; in _max_value()
100 rci_t const start_row, rci_t const stop_row, in _mzd_ple_submatrix()
129 rci_t i; in _mzd_ple_submatrix()
183 …ake_table_ple(mzd_t const *A, rci_t r, rci_t writecol, int k, int knar, ple_table_t *table, rci_t in mzd_make_table_ple()
343rci_t const start_row, rci_t const stop_row, rci_t const start_col, wi_t const addblock, in _mzd_ple_a11_1()
362 mzd_t *_mzd_ple_to_e(mzd_t *E, mzd_t const *A, rci_t r, rci_t c, int k, rci_t *offsets) { in _mzd_ple_to_e()
420 rci_t *done = (rci_t*)m4ri_mm_malloc(kk * sizeof(rci_t)); in _mzd_ple_russian()
[all …]
H A Dmzp.c27 mzp_t *mzp_init(rci_t length) { in mzp_init()
29 P->values = (rci_t*)m4ri_mm_malloc(sizeof(rci_t) * length); in mzp_init()
31 for (rci_t i = 0; i < length; ++i) { in mzp_init()
42 mzp_t *mzp_init_window(mzp_t *P, rci_t begin, rci_t end){ in mzp_init_window()
57 for(rci_t i=0; i<Q->length; i++) in mzp_copy()
91 …mzd_t *A, mzd_t const *B, rci_t const *permutation, word const *write_mask, rci_t const start_row,… in mzd_write_col_to_rows_blockd()
211 rci_t *permutation = (rci_t*)m4ri_mm_calloc(A->ncols, sizeof(rci_t)); in _mzd_apply_p_right_even()
217 rci_t t = permutation[i]; in _mzd_apply_p_right_even()
322 void mzd_apply_p_right_even_capped(mzd_t *A, mzp_t const *P, rci_t start_row, rci_t start_col) { in mzd_apply_p_right_even_capped()
351 void _mzd_compress_l(mzd_t *A, rci_t r1, rci_t n1, rci_t r2) { in _mzd_compress_l()
[all …]
H A Dmzp.h41 rci_t *values;
47 rci_t length;
57 mzp_t *mzp_init(rci_t length);
78 mzp_t *mzp_init_window(mzp_t *P, rci_t begin, rci_t end);
167 void mzd_apply_p_right_even_capped(mzd_t *A, mzp_t const *P, rci_t start_row, rci_t start_col);
180 void mzd_apply_p_right_trans_even_capped(mzd_t *A, mzp_t const *P, rci_t start_row, rci_t start_col…
222 void _mzd_compress_l(mzd_t *A, rci_t r1, rci_t n1, rci_t r2);
H A Dmzd.c149 mzd_t *mzd_init(rci_t r, rci_t c) { in mzd_init()
229 mzd_t *mzd_init_window(mzd_t *M, const rci_t lowr, const rci_t lowc, const rci_t highr, const rci_t in mzd_init_window()
284 void mzd_row_add(mzd_t *M, rci_t sourcerow, rci_t destrow) { in mzd_row_add()
288 void mzd_row_clear_offset(mzd_t *M, rci_t row, rci_t coloffset) { in mzd_row_clear_offset()
308 rci_t mzd_gauss_delayed(mzd_t *M, rci_t startcol, int full) { in mzd_gauss_delayed()
310 rci_t pivots = 0; in mzd_gauss_delayed()
1867 … *mzd_submatrix(mzd_t *S, mzd_t const *M, rci_t const startrow, rci_t const startcol, rci_t const … in mzd_submatrix()
1907 void mzd_col_swap(mzd_t *M, rci_t const cola, rci_t const colb) { in mzd_col_swap()
2014 void mzd_copy_row(mzd_t *B, rci_t i, mzd_t const *A, rci_t j) { in mzd_copy_row()
2036 int mzd_find_pivot(mzd_t const *A, rci_t start_row, rci_t start_col, rci_t *r, rci_t *c) { in mzd_find_pivot()
[all …]
H A Ddjb.c21 static inline int mzd_compare_rows_revlex(const mzd_t *A, rci_t a, rci_t b) { in mzd_compare_rows_revlex()
38 rci_t *data; /*!< Array with the elements */
58 .data = malloc(sizeof(rci_t) * heap_base_size) in heap_init()
71 h->data = realloc(h->data, sizeof(rci_t) * h->size); in heap_push()
90 rci_t temp = h->data[--h->count]; in heap_pop()
116 rci_t m = A->nrows; in djb_compile()
117 rci_t n = A->ncols; in djb_compile()
121 for (rci_t i=0; i < m; i++) in djb_compile()
130 rci_t temp = heap_front(h); in djb_compile()
149 rci_t i = m->length; in djb_apply_mzd()
[all …]
H A Dtriangular_russian.c15 for (rci_t i = 0; i < k; ++i) { in _mzd_trsm_upper_left_submatrix()
16 for (rci_t j = 0; j < i; ++j) { in _mzd_trsm_upper_left_submatrix()
85 L[i] = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_trsm_upper_left_russian()
88 rci_t i = 0; in _mzd_trsm_upper_left_russian()
109 rci_t x; in _mzd_trsm_upper_left_russian()
240 J[i] = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(k), sizeof(rci_t)); in _mzd_trsm_lower_left_russian()
244 rci_t i = 0; in _mzd_trsm_lower_left_russian()
331 void mzd_make_table_trtri(mzd_t const *M, rci_t r, rci_t c, int k, ple_table_t *Tb, rci_t startcol)… in mzd_make_table_trtri()
333 rci_t *L = Tb->E; in mzd_make_table_trtri()
417 rci_t id[m4ri_radix]; in mzd_trtri_upper_russian()
[all …]
/dports/math/m4ri/m4ri-release-20200125/tests/
H A Dtest_ple.c6 int check_pluq(mzd_t *A, rci_t *r) { in check_pluq()
9 const rci_t m = A->nrows; in check_pluq()
10 const rci_t n = A->ncols; in check_pluq()
55 int test_pluq_full_rank (rci_t m, rci_t n){ in test_pluq_full_rank()
118 int test_pluq_half_rank(rci_t m, rci_t n) { in test_pluq_half_rank()
193 int test_pluq_structured(rci_t m, rci_t n) { in test_pluq_structured()
205 rci_t r = 0; in test_pluq_structured()
217 int test_pluq_random(rci_t m, rci_t n) { in test_pluq_random()
223 rci_t r = 0; in test_pluq_random()
235 int test_pluq_string(rci_t m, rci_t n, const char *str) { in test_pluq_string()
[all …]
H A Dtesting.c3 mzd_t *mzd_init_test_matrix_random(rci_t M, rci_t N, rci_t m, rci_t n, word pattern, mzd_t **A) { in mzd_init_test_matrix_random()
6 for(rci_t i=0; i<M; i++) { in mzd_init_test_matrix_random()
7 for(rci_t j=0; j<(*A)->width; j++) { in mzd_init_test_matrix_random()
23 int mzd_check_pattern(mzd_t *A, rci_t m, rci_t n, word pattern) { in mzd_check_pattern()
25 for(rci_t i=0; i<A->nrows; i++) { in mzd_check_pattern()
27 for(rci_t j=0; j<A->width; j++) in mzd_check_pattern()
35 for(rci_t j=n/m4ri_radix+1; j<A->width; j++) in mzd_check_pattern()
H A Dtest_trsm.c6 int test_trsm_upper_right (rci_t m, rci_t n, int offset){ in test_trsm_upper_right()
19 for (rci_t i = 0; i < n; ++i){ in test_trsm_upper_right()
20 for (rci_t j = 0; j < i; ++j) in test_trsm_upper_right()
29 for (rci_t i = 0; i < m; ++i) in test_trsm_upper_right()
30 for (rci_t j = 0; j < n; ++j){ in test_trsm_upper_right()
60 int test_trsm_lower_right (rci_t m, rci_t n, int offset){ in test_trsm_lower_right()
72 for (rci_t i = 0; i < n; ++i){ in test_trsm_lower_right()
82 for (rci_t i = 0; i < m; ++i) in test_trsm_lower_right()
114 int test_trsm_lower_left (rci_t m, rci_t n, int offsetL, int offsetB){ in test_trsm_lower_left()
136 for (rci_t i = 0; i < m; ++i) in test_trsm_lower_left()
[all …]
H A Dtest_misc.c30 rci_t *Q = (rci_t*)calloc(sizeof(rci_t),length); in test_spread_and_shrink()
52 int test_png(rci_t m, rci_t n) { in test_png()
79 int test_submatrix(const rci_t m, const rci_t n, const rci_t lowr, const rci_t lowc, const rci_t hi… in test_submatrix()
88 for(rci_t i=0; i<highr-lowr; i++) { in test_submatrix()
89 for(rci_t j=0; j<highc-lowc; j++) { in test_submatrix()
/dports/math/m4rie/m4rie-release-20200115/src/
H A Dnewton_john.h42 rci_t *L; /**< A map such that L[a] points to the row where the first entry is a. */
54 njt_mzed_t *njt_mzed_init(const gf2e *ff, const rci_t ncols);
73 njt_mzed_t * mzed_make_table(njt_mzed_t *T, const mzed_t *A, const rci_t r, const rci_t c);
147 rci_t mzed_echelonize_newton_john(mzed_t *A, int full);
209 rci_t mzed_ple_newton_john(mzed_t *A, mzp_t *P, mzp_t *Q);
227 static inline void mzed_process_rows(mzed_t *M, const rci_t startrow, const rci_t endrow, rci_t sta… in mzed_process_rows()
245 …atic inline void mzed_process_rows2(mzed_t *M, const rci_t startrow, const rci_t endrow, const rci… in mzed_process_rows2()
265 …atic inline void mzed_process_rows3(mzed_t *M, const rci_t startrow, const rci_t endrow, const rci… in mzed_process_rows3()
286 …atic inline void mzed_process_rows4(mzed_t *M, const rci_t startrow, const rci_t endrow, const rci… in mzed_process_rows4()
308 …atic inline void mzed_process_rows5(mzed_t *M, const rci_t startrow, const rci_t endrow, const rci… in mzed_process_rows5()
[all …]
H A Dple.c26 rci_t col_pos = 0; in mzed_ple_naive()
27 rci_t row_pos = 0; in mzed_ple_naive()
30 rci_t i,j; in mzed_ple_naive()
64 for (rci_t i = row_pos; i < A->nrows; ++i) in mzed_ple_naive()
68 for (rci_t i=0; i < row_pos; i++) { in mzed_ple_naive()
74 rci_t _mzed_ple(mzed_t *A, mzp_t *P, mzp_t *Q, rci_t cutoff) { in _mzed_ple()
89 rci_t _mzd_slice_ple(mzd_slice_t *A, mzp_t *P, mzp_t *Q, rci_t cutoff) { in _mzd_slice_ple()
90 const rci_t ncols = A->ncols; in _mzd_slice_ple()
91 const rci_t nrows = A->nrows; in _mzd_slice_ple()
158 for (rci_t i = 0; i < nrows - r1; ++i) in _mzd_slice_ple()
[all …]
H A Dnewton_john.c34 T->L = (rci_t*)m4ri_mm_calloc(__M4RI_TWOPOW(ff->degree), sizeof(rci_t)); in njt_mzed_init()
63 … mzed_t *T0, rci_t r0, mzed_t *T1, rci_t r1, mzed_t *T2, rci_t r2, mzed_t *T3, rci_t r3) { in mzed_combine4()
92 … mzed_t *T0, rci_t r0, mzed_t *T1, rci_t r1, mzed_t *T2, rci_t r2, mzed_t *T3, rci_t r3, in mzed_combine8()
93 … mzed_t *T4, rci_t r4, mzed_t *T5, rci_t r5, mzed_t *T6, rci_t r6, mzed_t *T7, rci_t r7) { in mzed_combine8()
116 rci_t _mzed_gauss_submatrix_full(mzed_t *A, const rci_t r, const rci_t c, const rci_t end_row, int … in _mzed_gauss_submatrix_full()
117 rci_t i,j,l; in _mzed_gauss_submatrix_full()
238 rci_t r,c; in mzed_echelonize_newton_john()
243 rci_t kk = (rci_t)m4ri_opt_k(A->x->nrows, A->x->ncols, 0); in mzed_echelonize_newton_john()
256 rci_t kbar = 0; in mzed_echelonize_newton_john()
350 rci_t col_pos = 0; in mzed_ple_newton_john()
[all …]
H A Dple.h55 rci_t mzed_ple_naive(mzed_t *A, mzp_t *P, mzp_t *Q);
82 rci_t _mzd_slice_ple(mzd_slice_t *A, mzp_t *P, mzp_t *Q, rci_t cutoff);
104 static inline rci_t mzd_slice_ple(mzd_slice_t *A, mzp_t *P, mzp_t *Q) { in mzd_slice_ple()
125 rci_t _mzd_slice_pluq(mzd_slice_t *A, mzp_t *P, mzp_t *Q, rci_t cutoff);
141 static inline rci_t mzd_slice_pluq(mzd_slice_t *A, mzp_t *P, mzp_t *Q) { in mzd_slice_pluq()
173 rci_t _mzed_ple(mzed_t *A, mzp_t *P, mzp_t *Q, rci_t cutoff);
203 static inline rci_t mzed_ple(mzed_t *A, mzp_t *P, mzp_t *Q) { in mzed_ple()
H A Dm4ri_functions.h40 static inline word __mzd_read_bits(const mzd_t *M, const rci_t x, const rci_t y, const rci_t n) { in __mzd_read_bits()
52 static inline void __mzd_xor_bits(const mzd_t *M, const rci_t x, const rci_t y, const rci_t n, word… in __mzd_xor_bits()
62 static inline void __mzd_clear_bits(const mzd_t *M, const rci_t x, const rci_t y, const rci_t n) { in __mzd_clear_bits()
/dports/math/m4rie/m4rie-release-20200115/tests/
H A Dtesting.h38 const rci_t n = A->x->width-1; in mzed_set_canary()
40 for(rci_t i=0; i<A->nrows; i++) { in mzed_set_canary()
47 const rci_t n = A->x->width-1; in mzed_clear_canary()
49 for(rci_t i=0; i<A->nrows; i++) { in mzed_clear_canary()
57 const rci_t n = A->x->width-1; in mzed_canary_is_alive()
59 for(rci_t i=0; i<A->nrows; i++) { in mzed_canary_is_alive()
70 for(rci_t i=0; i<A->nrows; i++) { in mzed_interval_clean()
131 static inline mzed_t *random_mzed_t_rank(gf2e *ff, const rci_t m, const rci_t n, const rci_t r) { in random_mzed_t_rank()
139 for(rci_t i=0; i<r; i++) { in random_mzed_t_rank()
151 for(rci_t i=0; i<r; i++) { in random_mzed_t_rank()
[all …]
H A Dtest_trsm.c32 for(rci_t i=0; i<m; i++) { in random_mzed_t_upper_left()
33 for(rci_t j=0; j<i; j++) { in random_mzed_t_upper_left()
47 for(rci_t i=0; i<m; i++) { in random_mzed_t_lower_left()
62 for(rci_t i=0; i<m; i++) { in random_mzd_slice_t_upper_left()
77 for(rci_t i=0; i<m; i++) { in random_mzd_slice_t_lower_left()
89 int test_mzed_trsm_upper_left(gf2e *ff, rci_t m, rci_t n) { in test_mzed_trsm_upper_left()
126 for(rci_t i=0; i<m; i++) { in test_mzed_trsm_upper_left()
164 int test_mzed_trsm_lower_left(gf2e *ff, rci_t m, rci_t n) { in test_mzed_trsm_lower_left()
239 int test_mzd_slice_trsm_upper_left(gf2e *ff, rci_t m, rci_t n) { in test_mzd_slice_trsm_upper_left()
318 int test_mzd_slice_trsm_lower_left(gf2e *ff, rci_t m, rci_t n) { in test_mzd_slice_trsm_lower_left()
[all …]
H A Dtest_ple.c29 int test_mzd_slice_ple(gf2e *ff, const rci_t m, const rci_t n, const rci_t r) { in test_mzd_slice_ple()
43 rci_t rbar = mzd_slice_ple(LE, P, Q); in test_mzd_slice_ple()
47 for(rci_t j=0; j<r; j++) { in test_mzd_slice_ple()
48 for(rci_t i=j; i<LE->nrows; i++) { in test_mzd_slice_ple()
53 for(rci_t i=0; i<r; i++) { in test_mzd_slice_ple()
77 int test_mzed_ple(gf2e *ff, const rci_t m, const rci_t n, const rci_t r) { in test_mzed_ple()
99 rci_t r0 = mzed_ple_naive( LE0, P0, Q0); in test_mzed_ple()
125 for(rci_t j=0; j<r; j++) in test_mzed_ple()
126 for(rci_t i=j; i<LE0->nrows; i++) in test_mzed_ple()
133 for(rci_t i=0; i<r; i++) { in test_mzed_ple()
[all …]
/dports/math/m4ri/m4ri-release-20200125/bench/
H A Dbench_ple.c9 rci_t m;
10 rci_t n;
11 rci_t r;
30 for (rci_t i = 0; i < p->m; ++i) { in run()
31 for (rci_t j = i + 1; j < p->m; ++j) in run()
35 for(rci_t i = 0; i < MIN(p->m, p->n); ++i) { in run()
36 for (rci_t j = 0; j < i; ++j) in run()
41 for(rci_t i = 0; i < p->m; ++i) { in run()
43 for(rci_t j = 0; j < i; ++j) in run()
46 for(rci_t j = i; j < p->n; ++j) in run()
[all …]

1234