Home
last modified time | relevance | path

Searched refs:min_k (Results 1 – 25 of 239) sorted by relevance

12345678910

/dports/multimedia/opentoonz/opentoonz-1.5.0/thirdparty/openblas/xianyi-OpenBLAS-e6e87a2/lapack/lauum/
H A Dlauum_U_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
147 min_k = bk - ks; in CNAME()
148 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
150 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
178 min_k = bk - ks; in CNAME()
179 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
212 min_k = bk - ks; in CNAME()
213 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
215 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
238 min_k = bk - ks; in CNAME()
[all …]
H A Dlauum_L_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
159 min_k = bk - ks; in CNAME()
160 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
162 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
204 min_k = bk - ks; in CNAME()
205 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
207 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/GotoBLAS2/lapack/lauum/
H A Dlauum_U_single.c63 BLASLONG min_i, min_l, min_k; in CNAME() local
130 min_k = bk - ks; in CNAME()
131 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
133 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
161 min_k = bk - ks; in CNAME()
162 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
195 min_k = bk - ks; in CNAME()
196 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
198 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
221 min_k = bk - ks; in CNAME()
[all …]
H A Dlauum_L_single.c63 BLASLONG min_i, min_l, min_k; in CNAME() local
142 min_k = bk - ks; in CNAME()
143 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
145 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
187 min_k = bk - ks; in CNAME()
188 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
190 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
/dports/math/openblas/OpenBLAS-0.3.18/lapack/lauum/
H A Dlauum_U_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
147 min_k = bk - ks; in CNAME()
148 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
150 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
178 min_k = bk - ks; in CNAME()
179 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
212 min_k = bk - ks; in CNAME()
213 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
215 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
238 min_k = bk - ks; in CNAME()
[all …]
H A Dlauum_L_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
159 min_k = bk - ks; in CNAME()
160 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
162 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
204 min_k = bk - ks; in CNAME()
205 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
207 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
/dports/math/gotoblas/GotoBLAS2/lapack/lauum/
H A Dlauum_U_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
147 min_k = bk - ks; in CNAME()
148 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
150 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
178 min_k = bk - ks; in CNAME()
179 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
212 min_k = bk - ks; in CNAME()
213 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
215 TRMM_KERNEL(min_i, min_k, bk, dp1, in CNAME()
238 min_k = bk - ks; in CNAME()
[all …]
H A Dlauum_L_single.c80 BLASLONG min_i, min_l, min_k; in CNAME() local
159 min_k = bk - ks; in CNAME()
160 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
162 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
204 min_k = bk - ks; in CNAME()
205 if (min_k > GEMM_P) min_k = GEMM_P; in CNAME()
207 TRMM_KERNEL(min_k, min_l, bk, dp1, in CNAME()
/dports/multimedia/v4l_compat/linux-5.13-rc2/sound/soc/codecs/
H A Drl6231.c145 int k_t, min_k, max_k, n = 0, m = 0, m_t = 0; in rl6231_pll_calc() local
167 min_k = 80000000 / freq_out - 2; in rl6231_pll_calc()
171 if (min_k > RL6231_PLL_K_MAX) in rl6231_pll_calc()
172 min_k = max_k = RL6231_PLL_K_MAX; in rl6231_pll_calc()
178 k = min_k; in rl6231_pll_calc()
179 if (min_k < -1) in rl6231_pll_calc()
180 min_k = -1; in rl6231_pll_calc()
181 for (k_t = min_k; k_t <= max_k; k_t++) { in rl6231_pll_calc()
/dports/multimedia/libv4l/linux-5.13-rc2/sound/soc/codecs/
H A Drl6231.c145 int k_t, min_k, max_k, n = 0, m = 0, m_t = 0; in rl6231_pll_calc() local
167 min_k = 80000000 / freq_out - 2; in rl6231_pll_calc()
171 if (min_k > RL6231_PLL_K_MAX) in rl6231_pll_calc()
172 min_k = max_k = RL6231_PLL_K_MAX; in rl6231_pll_calc()
178 k = min_k; in rl6231_pll_calc()
179 if (min_k < -1) in rl6231_pll_calc()
180 min_k = -1; in rl6231_pll_calc()
181 for (k_t = min_k; k_t <= max_k; k_t++) { in rl6231_pll_calc()
/dports/multimedia/v4l-utils/linux-5.13-rc2/sound/soc/codecs/
H A Drl6231.c145 int k_t, min_k, max_k, n = 0, m = 0, m_t = 0; in rl6231_pll_calc() local
167 min_k = 80000000 / freq_out - 2; in rl6231_pll_calc()
171 if (min_k > RL6231_PLL_K_MAX) in rl6231_pll_calc()
172 min_k = max_k = RL6231_PLL_K_MAX; in rl6231_pll_calc()
178 k = min_k; in rl6231_pll_calc()
179 if (min_k < -1) in rl6231_pll_calc()
180 min_k = -1; in rl6231_pll_calc()
181 for (k_t = min_k; k_t <= max_k; k_t++) { in rl6231_pll_calc()
/dports/misc/vxl/vxl-3.3.2/contrib/mul/vil3d/tests/
H A Dtest_algo_structuring_element.cxx30 TEST("min_k()",se.min_k(),-2); in test_algo_structuring_element()
57 bool plane_k_ok = ( se.min_k() == 0 && se.max_k() == 0 ); in test_algo_structuring_element()
68 TEST("min_k()",se.min_k(),0); in test_algo_structuring_element()
78 TEST("min_k()",se.min_k(),0); in test_algo_structuring_element()
88 TEST("min_k()",se.min_k(),-3); in test_algo_structuring_element()
/dports/security/botan110/Botan-1.10.17/src/algo_base/
H A Dkey_spec.h38 Key_Length_Specification(size_t min_k,
41 min_keylen(min_k), in min_keylen() argument
42 max_keylen(max_k ? max_k : min_k), in min_keylen()
/dports/math/pdal/PDAL-2.3.0/doc/stages/
H A Dfilters.optimalneighborhood.rst9 the range ``min_k`` to ``max_k``. The neighborhood size that minimizes the
26 "min_k":8,
41 min_k
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/base/
H A Dsym_algo.h39 Key_Length_Specification(size_t min_k,
42 m_min_keylen(min_k), in m_min_keylen() argument
43 m_max_keylen(max_k ? max_k : min_k), in m_min_keylen()
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/base/
H A Dsym_algo.h39 Key_Length_Specification(size_t min_k,
42 m_min_keylen(min_k), in m_min_keylen() argument
43 m_max_keylen(max_k ? max_k : min_k), in m_min_keylen()
/dports/math/py-sympy/sympy-1.9/sympy/combinatorics/
H A Dschur_number.py64 min_k = 1
66 min_k = math.ceil(math.log(2*n + 1, 3))
68 return Integer(min_k)
/dports/security/botan2/Botan-2.18.2/src/lib/base/
H A Dsym_algo.h39 Key_Length_Specification(size_t min_k,
42 m_min_keylen(min_k), in m_min_keylen() argument
43 m_max_keylen(max_k ? max_k : min_k), in m_min_keylen()
/dports/math/igraph/igraph-0.9.5/src/community/spinglass/
H A DNetRoutines.cpp57 unsigned long min_k = 999999999, max_k = 0; in igraph_i_read_network() local
111 if (node1->Get_Degree() < min_k) { in igraph_i_read_network()
112 min_k = node1->Get_Degree(); in igraph_i_read_network()
120 net->min_k = min_k; in igraph_i_read_network()
/dports/math/R-cran-igraph/igraph/src/
H A DNetRoutines.cpp59 unsigned long min_k = 999999999, max_k = 0; in igraph_i_read_network() local
123 if (node1->Get_Degree() < min_k) { in igraph_i_read_network()
124 min_k = node1->Get_Degree(); in igraph_i_read_network()
132 net->min_k = min_k; in igraph_i_read_network()
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dextremal_polygon_2.h184 CGAL_optimisation_precondition( k >= t.min_k()); in CGAL_maximum_inscribed_rooted_k_gon_2()
192 if ( k == t.min_k()) in CGAL_maximum_inscribed_rooted_k_gon_2()
201 int i( t.min_k()); in CGAL_maximum_inscribed_rooted_k_gon_2()
297 CGAL_optimisation_precondition( number_of_points > t.min_k()); in CGAL_maximum_inscribed_rooted_k_gon_2()
298 CGAL_optimisation_precondition( size_of_gon >= t.min_k() - 1); in CGAL_maximum_inscribed_rooted_k_gon_2()
433 CGAL_optimisation_precondition( number_of_points >= t.min_k()); in extremal_polygon_2()
494 CGAL_optimisation_precondition( k >= t.min_k()); in CGAL_maximum_inscribed_k_gon_2()
633 CGAL_optimisation_precondition( k >= t.min_k()); in CGAL_maximum_inscribed_k_gon_2()
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/clk/sunxi-ng/
H A Dccu_nk.c15 unsigned long k, min_k, max_k; member
25 for (_k = nk->min_k; _k <= nk->max_k; _k++) { in ccu_nk_find_best()
104 _nk.min_k = nk->k.min ?: 1; in ccu_nk_round_rate()
129 _nk.min_k = nk->k.min ?: 1; in ccu_nk_set_rate()
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/clk/sunxi-ng/
H A Dccu_nk.c15 unsigned long k, min_k, max_k; member
25 for (_k = nk->min_k; _k <= nk->max_k; _k++) { in ccu_nk_find_best()
104 _nk.min_k = nk->k.min ?: 1; in ccu_nk_round_rate()
129 _nk.min_k = nk->k.min ?: 1; in ccu_nk_set_rate()
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/clk/sunxi-ng/
H A Dccu_nk.c15 unsigned long k, min_k, max_k; member
25 for (_k = nk->min_k; _k <= nk->max_k; _k++) { in ccu_nk_find_best()
104 _nk.min_k = nk->k.min ?: 1; in ccu_nk_round_rate()
129 _nk.min_k = nk->k.min ?: 1; in ccu_nk_set_rate()
/dports/biology/iqtree/IQ-TREE-2.0.6/obsolete/
H A Dgss.cpp264 int k, min_k, max_k, step_k, index; in findPD() local
269 min_k = params.min_budget; in findPD()
273 min_k = params.min_size; in findPD()
277 taxa_set.resize((max_k - min_k)/step_k + 1); in findPD()
284 for (k = min_k; k <= max_k; k += step_k) { in findPD()
285 index = (k - min_k) / step_k; in findPD()

12345678910