Home
last modified time | relevance | path

Searched refs:b_high (Results 1 – 25 of 100) sorted by relevance

1234

/dports/science/quantum-espresso/q-e-qe-6.7.0/PP/src/
H A Dfermi_proj.f90109 USE fermisurfer_common, ONLY : b_low, b_high
162 DO ibnd = b_low, b_high
253 ALLOCATE(wfc(b_low:b_high, nk1, nk2, nk3, ns), &
254 & eig(b_low:b_high, nk1, nk2, nk3, ns))
263 eig(b_low:b_high,i1,i2,i3,1) = et(b_low:b_high, equiv(i1,i2,i3) ) - ef1
264 eig(b_low:b_high,i1,i2,i3,2) = et(b_low:b_high, equiv(i1,i2,i3) + nk) - ef2
265 wfc(b_low:b_high,i1,i2,i3,1) = wt(b_low:b_high, equiv(i1,i2,i3) )
266 wfc(b_low:b_high,i1,i2,i3,2) = wt(b_low:b_high, equiv(i1,i2,i3) + nk)
268 eig(b_low:b_high,i1,i2,i3,1) = et(b_low:b_high, equiv(i1,i2,i3) ) - ef
269 wfc(b_low:b_high,i1,i2,i3,1) = wt(b_low:b_high, equiv(i1,i2,i3) )
[all …]
H A Dfermi_velocity.f9032 USE fermisurfer_common, ONLY : b_low, b_high, rotate_k_fs, write_fermisurfer
80 ALLOCATE(vf(b_low:b_high, nk1, nk2, nk3, ns), &
81 & eig(b_low:b_high, nk1, nk2, nk3, ns))
89 eig(b_low:b_high,i1,i2,i3,1) = et(b_low:b_high, equiv(i1,i2,i3) ) - ef1
90 eig(b_low:b_high,i1,i2,i3,2) = et(b_low:b_high, equiv(i1,i2,i3) + nk) - ef2
92 eig(b_low:b_high,i1,i2,i3,1) = et(b_low:b_high, equiv(i1,i2,i3) ) - ef
106 DO ibnd = b_low, b_high
137 CALL write_fermisurfer(eig(b_low:b_high, 1:nk1, 1:nk2, 1:nk3, 1), &
139 CALL write_fermisurfer(eig(b_low:b_high, 1:nk1, 1:nk2, 1:nk3, 2), &
142 CALL write_fermisurfer(eig(b_low:b_high, 1:nk1, 1:nk2, 1:nk3, 1), &
[all …]
H A Dfermisurfer_common.f9015 & b_high variable
61 IF(MINVAL(et( ibnd ,1:nks)) < MAX(ef1, ef2)) b_high = ibnd
67 WRITE(stdout,'(5x,a,i7)') "Highest band which contains FS : ", b_high
132 REAL(dp),INTENT(IN) :: eig(b_low:b_high,nk1,nk2,nk3), &
133 & mat(b_low:b_high,nk1,nk2,nk3)
141 & "Max : ", MAXVAL(mat(b_low:b_high,1:nk1,1:nk2,1:nk3)), &
142 & "Min : ", MINVAL(mat(b_low:b_high,1:nk1,1:nk2,1:nk3))
153 WRITE(fo,'(i6)') b_high - b_low + 1
161 DO ibnd = b_low, b_high
171 DO ibnd = b_low, b_high
/dports/graphics/diffpdf/diffpdf-2.1.3/
H A Dsequence_matcher.cpp54 : a_low(a_low_), a_high(a_high_), b_low(b_low_), b_high(b_high_) {} in Offsets()
59 int b_high; member
125 const int b_high = offset.b_high; in get_matching_blocks() local
127 b_high); in get_matching_blocks()
135 if (i + k < a_high && j + k < b_high) in get_matching_blocks()
136 offsets.append(Offsets(i + k, a_high, j + k, b_high)); in get_matching_blocks()
168 int b_low, int b_high) in find_longest_match() argument
179 if (j >= b_high) in find_longest_match()
198 while (best_i + best_size < a_high && best_j + best_size < b_high && in find_longest_match()
/dports/devel/py-rapidfuzz/rapidfuzz-1.8.0/src/rapidfuzz-cpp/rapidfuzz/details/
H A Dmatching_blocks.hpp59 …_t find_longest_match(std::size_t a_low, std::size_t a_high, std::size_t b_low, std::size_t b_high) in find_longest_match() argument
81 if (j >= b_high) break; in find_longest_match()
101 … j2len_.begin() + static_cast<std::vector<std::size_t>::difference_type>(b_high), 0); in find_longest_match()
111 while ((best_i + best_size) < a_high && (best_j + best_size) < b_high && in find_longest_match()
131 std::size_t a_low, a_high, b_low, b_high; in get_matching_blocks() local
132 std::tie(a_low, a_high, b_low, b_high) = queue[queue_head++]; in get_matching_blocks()
134 std::tie(spos, dpos, length) = find_longest_match(a_low, a_high, b_low, b_high); in get_matching_blocks()
139 if ((spos + length) < a_high && (dpos + length) < b_high) { in get_matching_blocks()
140 queue.emplace_back(spos + length, a_high, dpos + length, b_high); in get_matching_blocks()
/dports/devel/rapidfuzz-cpp/rapidfuzz-cpp-47df6f7/rapidfuzz/details/
H A Dmatching_blocks.hpp58 match_t find_longest_match(size_t a_low, size_t a_high, size_t b_low, size_t b_high) { in find_longest_match() argument
67 for(size_t j = b_low; j < b_high; ++j) { in find_longest_match()
86 for(size_t j = b_low+1; j < b_high; ++j) { in find_longest_match()
97 while ((best_i+best_size) < a_high && (best_j+best_size) < b_high in find_longest_match()
116 size_t a_low, a_high, b_low, b_high; in get_matching_blocks() local
117 std::tie(a_low, a_high, b_low, b_high) = queue[queue_head++]; in get_matching_blocks()
119 std::tie(spos, dpos, length) = find_longest_match(a_low, a_high, b_low, b_high); in get_matching_blocks()
124 if ((spos + length) < a_high && (dpos + length) < b_high) { in get_matching_blocks()
125 queue.emplace_back(spos + length, a_high, dpos + length, b_high); in get_matching_blocks()
/dports/devel/gdb/gdb-11.1/gdb/testsuite/gdb.arch/
H A Ds390-vregs.exp97 set b_high 3
101 set b [expr ($b_high << 32) | $b_low]
151 proc hex128 {a_high a_low b_high b_low} {
152 set result [format "%x%08x%08x%08x" $a_high $a_low $b_high $b_low]
166 [expr $b_high * (32 - $i) * $b_high * 32] \
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/base/
H A Dubsan.cc32 uint64_t b_high = static_cast<uint64_t>(b) >> 32; in __mulodi4() local
35 uint64_t r_mid1 = a_low * b_high; in __mulodi4()
37 uint64_t r_high = a_high * b_high; in __mulodi4()
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/base/
H A Dubsan.cc32 uint64_t b_high = static_cast<uint64_t>(b) >> 32; in __mulodi4() local
35 uint64_t r_mid1 = a_low * b_high; in __mulodi4()
37 uint64_t r_high = a_high * b_high; in __mulodi4()
/dports/lang/v8/v8-9.6.180.12/src/base/
H A Dubsan.cc32 uint64_t b_high = static_cast<uint64_t>(b) >> 32; in __mulodi4() local
35 uint64_t r_mid1 = a_low * b_high; in __mulodi4()
37 uint64_t r_high = a_high * b_high; in __mulodi4()
/dports/math/yices/yices-2.6.2/src/solvers/bv/
H A Dbv_intervals.c562 uint32_t *b_low, *b_high; in bv_interval_addmul_u() local
566 b_high = b->high; in bv_interval_addmul_u()
573 bv_interval_add_u_core(a, b_low, b_high, n); in bv_interval_addmul_u()
575 bv_interval_sub_u_core(a, b_low, b_high, n); in bv_interval_addmul_u()
581 bv_aux_addmul_u(aux, a->high, b_high, c, n); in bv_interval_addmul_u()
615 bv_aux_submul_u(aux, a->low, b_high, c, n); in bv_interval_addmul_u()
658 uint32_t *b_low, *b_high; in bv_interval_addmul_s() local
662 b_high = b->high; in bv_interval_addmul_s()
669 bv_interval_add_s_core(a, b_low, b_high, n); in bv_interval_addmul_s()
671 bv_interval_sub_s_core(a, b_low, b_high, n); in bv_interval_addmul_s()
[all …]
/dports/math/wfmath/wfmath-1.0.2/wfmath/
H A Dintersect.cpp183 CoordType b_low, b_high, r_low, r_high, dist; in Intersect() local
193 b_high = val; in Intersect()
198 b_high = 0; in Intersect()
206 b_high += val; in Intersect()
238 if(_Greater(r_low - dist, b_high, proper) in Intersect()
/dports/graphics/vips/vips-8.12.0/libvips/deprecated/
H A Dim_lab_morph.c127 double b_high = 0; in morph_init() local
154 b_high = b; in morph_init()
163 (b_high - b_low) * ((i - L_low) / (L_high - L_low)); in morph_init()
/dports/security/s2n/s2n-tls-1.1.2/pq-crypto/bike_r1/
H A Dgf2x_mul.c45 const uint64_t *b_high = b + half_n; in karatzuba() local
65 karatzuba(res2, a_high, b_high, half_n, secure_buf); in karatzuba()
/dports/security/s2n/s2n-tls-1.1.2/pq-crypto/bike_r2/
H A Dgf2x_mul.c45 const uint64_t *b_high = b + half_n; in karatzuba() local
65 karatzuba(res2, a_high, b_high, half_n, secure_buf); in karatzuba()
/dports/lang/v8/v8-9.6.180.12/src/bigint/
H A Ddigit-arithmetic.h99 digit_t b_high = b >> kHalfDigitBits; in digit_mul()
102 digit_t r_mid1 = a_low * b_high; in digit_mul()
104 digit_t r_high = a_high * b_high; in digit_mul()
/dports/games/eureka/eureka-1.27b-source/src/
H A Dm_files.cc1097 static void Backup_Prune(const char *dir_name, int b_low, int b_high, int wad_size) in Backup_Prune() argument
1110 for ( ; b_low <= b_high - backup_num + 1 ; b_low++) in Backup_Prune()
1152 int b_high = scan_data.high; in M_BackupWad() local
1154 if (b_low < b_high) in M_BackupWad()
1158 Backup_Prune(dir_name, b_low, b_high, wad_size); in M_BackupWad()
1163 const char * dest_name = Backup_Name(dir_name, b_high + 1); in M_BackupWad()
/dports/math/eclib/eclib-20210318/libsrc/eclib/
H A Dsieve_search.h145 long b_low, b_high; //Lower and upper bounds for the denominator variable
255 void set_b_high(long b) {if (b>0) b_high=b;}; in set_b_high()
/dports/math/pari/pari-2.13.3/src/modules/
H A Dratpoints.c110 long height, b_low, b_high, sp1, sp2, array_size; member
1059 if (p*p > (ulong) args->b_high) break; in sieving_info()
1259 if (args->b_high < 1) args->b_high = height; in find_points_work()
1260 if (args->b_high > height) args->b_high = height; in find_points_work()
1388 for (b = 1; bb = b*b, bb <= args->b_high; b++) in find_points_work()
1422 if (d > args->b_high) continue; in find_points_work()
1489 for (b = args->b_low; b <= args->b_high; b++) in find_points_work()
1542 for (b = args->b_low; b <= args->b_high; b++) in find_points_work()
1615 args.b_high = H; in ZX_hyperellratpoints()
1622 args.b_high = itos(gel(h,2)); in ZX_hyperellratpoints()
[all …]
/dports/devel/volk/volk-2.2.1/kernels/volk/
H A Dvolk_32fc_magnitude_32f.h403 float32x4_t a_vec, b_vec, a_high, a_low, b_high, b_low; in volk_32fc_magnitude_32f_neon_fancy_sweet() local
405 b_high = vdupq_n_f32( 0.561); in volk_32fc_magnitude_32f_neon_fancy_sweet()
430 b_vec = (float32x4_t)vaddq_s32(vandq_s32((int32x4_t)comp0, (int32x4_t)b_high), in volk_32fc_magnitude_32f_neon_fancy_sweet()
/dports/math/eclib/eclib-20210318/libsrc/
H A Dsieve_search.cc88 b_high = height; in init_data()
588 bb = (b_high >= p) ? p : b_high + 1; in init_f()
1112 long limit = (long)floor(sqrt((double)b_high)); in search()
1134 cout<<"search without use_squares with b_low "<<b_low<<"to b_high "<<b_high<<endl; in search()
1142 for(b = b_low; b <= b_high; b++) in search()
1167 for(b = b_low; b <= b_high; b++) in search()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/boringssl/src/crypto/hrss/
H A Dhrss.c672 const struct poly3_span b_high = {&b->s[low_len], &b->a[low_len]}; in poly3_mul_aux() local
679 poly3_span_add(&b_cross_sum, b, &b_high, low_len); in poly3_mul_aux()
683 b_cross_sum.s[low_len] = b_high.s[low_len]; in poly3_mul_aux()
684 b_cross_sum.a[low_len] = b_high.a[low_len]; in poly3_mul_aux()
696 poly3_mul_aux(&out_high, &child_scratch, &a_high, &b_high, high_len); in poly3_mul_aux()
1149 const vec_t *b_high = &b[low_len]; in poly_mul_vec_aux() local
1155 out[high_len + i] = vec_add(b_high[i], b[i]); in poly_mul_vec_aux()
1159 out[high_len + low_len] = b_high[low_len]; in poly_mul_vec_aux()
1245 const uint16_t *const b_high = &b[low_len]; in poly_mul_novec_aux() local
1249 out[high_len + i] = b_high[i] + b[i]; in poly_mul_novec_aux()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/boringssl/src/crypto/hrss/
H A Dhrss.c672 const struct poly3_span b_high = {&b->s[low_len], &b->a[low_len]}; in poly3_mul_aux() local
679 poly3_span_add(&b_cross_sum, b, &b_high, low_len); in poly3_mul_aux()
683 b_cross_sum.s[low_len] = b_high.s[low_len]; in poly3_mul_aux()
684 b_cross_sum.a[low_len] = b_high.a[low_len]; in poly3_mul_aux()
696 poly3_mul_aux(&out_high, &child_scratch, &a_high, &b_high, high_len); in poly3_mul_aux()
1149 const vec_t *b_high = &b[low_len]; in poly_mul_vec_aux() local
1155 out[high_len + i] = vec_add(b_high[i], b[i]); in poly_mul_vec_aux()
1159 out[high_len + low_len] = b_high[low_len]; in poly_mul_vec_aux()
1245 const uint16_t *const b_high = &b[low_len]; in poly_mul_novec_aux() local
1249 out[high_len + i] = b_high[i] + b[i]; in poly_mul_novec_aux()
[all …]
/dports/net/quiche/quiche-0.9.0/deps/boringssl/src/crypto/hrss/
H A Dhrss.c672 const struct poly3_span b_high = {&b->s[low_len], &b->a[low_len]}; in poly3_mul_aux() local
679 poly3_span_add(&b_cross_sum, b, &b_high, low_len); in poly3_mul_aux()
683 b_cross_sum.s[low_len] = b_high.s[low_len]; in poly3_mul_aux()
684 b_cross_sum.a[low_len] = b_high.a[low_len]; in poly3_mul_aux()
696 poly3_mul_aux(&out_high, &child_scratch, &a_high, &b_high, high_len); in poly3_mul_aux()
1149 const vec_t *b_high = &b[low_len]; in poly_mul_vec_aux() local
1155 out[high_len + i] = vec_add(b_high[i], b[i]); in poly_mul_vec_aux()
1159 out[high_len + low_len] = b_high[low_len]; in poly_mul_vec_aux()
1245 const uint16_t *const b_high = &b[low_len]; in poly_mul_novec_aux() local
1249 out[high_len + i] = b_high[i] + b[i]; in poly_mul_novec_aux()
[all …]
/dports/net/quiche/quiche-0.9.0/cargo-crates/boring-sys-1.1.1/deps/boringssl/src/crypto/hrss/
H A Dhrss.c672 const struct poly3_span b_high = {&b->s[low_len], &b->a[low_len]}; in poly3_mul_aux() local
679 poly3_span_add(&b_cross_sum, b, &b_high, low_len); in poly3_mul_aux()
683 b_cross_sum.s[low_len] = b_high.s[low_len]; in poly3_mul_aux()
684 b_cross_sum.a[low_len] = b_high.a[low_len]; in poly3_mul_aux()
696 poly3_mul_aux(&out_high, &child_scratch, &a_high, &b_high, high_len); in poly3_mul_aux()
1149 const vec_t *b_high = &b[low_len]; in poly_mul_vec_aux() local
1155 out[high_len + i] = vec_add(b_high[i], b[i]); in poly_mul_vec_aux()
1159 out[high_len + low_len] = b_high[low_len]; in poly_mul_vec_aux()
1245 const uint16_t *const b_high = &b[low_len]; in poly_mul_novec_aux() local
1249 out[high_len + i] = b_high[i] + b[i]; in poly_mul_novec_aux()
[all …]

1234