Home
last modified time | relevance | path

Searched refs:lowi (Results 1 – 25 of 130) sorted by relevance

123456

/dports/math/gap/gap-4.11.0/pkg/ace-5.3/src/
H A Dcoinc.c245 int lowi; /* temp */ in al0_cols12() local
330 if ((lowi = COL1(dst)) != 0 && CT(lowi,inv1) == 0 && lowi != src) in al0_cols12()
331 { CT(lowi,inv1) = dst; } in al0_cols12()
355 if ((lowi = COL2(dst)) != 0 && CT(lowi,inv2) == 0 && lowi != src) in al0_cols12()
356 { CT(lowi,inv2) = dst; } in al0_cols12()
481 int lowi, highi; in al0_coinc() local
530 if ((lowi = CT(crep,i)) != 0) in al0_coinc()
532 if (lowi == chigh) in al0_coinc()
533 { lowi = crep; } in al0_coinc()
547 if ((lowi = CT(crep, i)) != 0 && CT(lowi, j) == 0) in al0_coinc()
[all …]
/dports/biology/gmap/gmap-2020-09-12/src/
H A Dintersect.c57 binary_search_uint4 (int lowi, int highi, UINT4 *positions, UINT4 goal) { in binary_search_uint4() argument
60 debug10(printf("entered binary search with lowi=%d, highi=%d, goal=%u\n",lowi,highi,goal)); in binary_search_uint4()
62 while (lowi < highi) { in binary_search_uint4()
63 middlei = lowi + ((highi - lowi) / 2); in binary_search_uint4()
65 lowi,positions[lowi],middlei,positions[middlei], in binary_search_uint4()
70 lowi = middlei + 1; in binary_search_uint4()
83 binary_search_uint8 (int lowi, int highi, Univcoord_T *positions, Univcoord_T goal) { in binary_search_uint8() argument
88 while (lowi < highi) { in binary_search_uint8()
89 middlei = lowi + ((highi - lowi) / 2); in binary_search_uint8()
91 lowi,positions[lowi],middlei,positions[middlei], in binary_search_uint8()
[all …]
H A Dsegment-search.c209 lowi,highi,(unsigned long long) goal));
211 while (lowi < highi) {
212 middlei = lowi + ((highi - lowi) / 2);
215 lowi,(unsigned long long) ((positions_high[lowi] << 32) + positions_low[lowi]),
222 lowi = middlei + 1;
237 binary_search (int lowi, int highi, Univcoord_T *positions, Univcoord_T goal) { in binary_search() argument
241 lowi,highi,(unsigned long long) goal)); in binary_search()
243 while (lowi < highi) { in binary_search()
244 middlei = lowi + ((highi - lowi) / 2); in binary_search()
246 lowi,(unsigned long long) positions[lowi], in binary_search()
[all …]
H A Dextension-search.c224 new->lowi = 0;
425 new->lowi = 0; in Elt_read_queryfwd()
509 new->lowi = 0; in Elt_read_queryrev()
577 this->lowi = 0;
652 this->lowi = 0;
668 while (lowi < highi) { in binary_search_univcoord()
669 middlei = lowi + ((highi - lowi) / 2); in binary_search_univcoord()
671 lowi,univdiagonals[lowi],middlei,univdiagonals[middlei], in binary_search_univcoord()
676 lowi = middlei + 1; in binary_search_univcoord()
690 int lowi, highi; in Elt_filter_univdiagonals() local
[all …]
H A Dregiondb.c195 binary_search_with_term (UINT4 lowi, UINT4 highi, UINT2 *positions, UINT4 term, UINT4 goal) { in binary_search_with_term() argument
199 lowi,highi,term,goal)); in binary_search_with_term()
201 while (lowi < highi) { in binary_search_with_term()
202 middlei = lowi + ((highi - lowi) / 2); in binary_search_with_term()
204 lowi,positions[lowi] + term,middlei,positions[middlei] + term, in binary_search_with_term()
209 lowi = middlei + 1; in binary_search_with_term()
326 binary_search_uint2 (int lowi, int highi, UINT2 *positions, UINT2 goal) { in binary_search_uint2() argument
331 while (lowi < highi) { in binary_search_uint2()
332 middlei = lowi + ((highi - lowi) / 2); in binary_search_uint2()
334 lowi,positions[lowi],middlei,positions[middlei], in binary_search_uint2()
[all …]
H A Dintersect-large.c39 binary_search_large (int lowi, int highi, unsigned char *positions_high, UINT4 *positions_low, Univ… in binary_search_large() argument
43 while (lowi < highi) { in binary_search_large()
44 middlei = lowi + ((highi - lowi) / 2); in binary_search_large()
47 lowi,(positions_high[lowi] << 32) + positions_low[lowi], in binary_search_large()
53 lowi = middlei + 1; in binary_search_large()
H A Dsam_sort.c559 Cell_binary_search (int lowi, int highi, T *cells, Univcoord_T goal) {
562 debug10(printf("entered binary search with lowi=%d, highi=%d, goal=%u\n",lowi,highi,goal));
564 while (lowi < highi) {
565 middlei = lowi + ((highi - lowi) / 2);
567 lowi,cells[lowi]->genomicpos,middlei,cells[middlei]->genomicpos,
572 lowi = middlei + 1;
576 while (middlei - 1 >= lowi && cells[middlei - 1]->genomicpos == goal) {
590 Cell_find (int lowi, int highi, T *cells, Univcoord_T goal, int readindex) {
593 i = Cell_binary_search(lowi,highi,cells,goal);
603 lowi,highi,goal,readindex);
/dports/finance/quantlib/QuantLib-1.20/ql/
H A Dprices.cpp120 std::vector<Real>::const_iterator openi, closei, highi, lowi; in makeSeries() local
124 lowi = low.begin(); in makeSeries()
126 retval[*i] = IntervalPrice(*openi, *closei, *highi, *lowi); in makeSeries()
127 ++openi; ++closei; ++highi; ++lowi; in makeSeries()
/dports/net/p5-Socket-Class/Socket-Class-2.258/xs/sc_ssl/openssl/source/crypto/bio/
H A Db_sock.c374 int i,lowi=0,j; in BIO_gethostbyname()
393 lowi=i; in BIO_gethostbyname()
431 if (ghbn_cache[lowi].ent != NULL) in BIO_gethostbyname()
432 ghbn_free(ghbn_cache[lowi].ent); /* XXX not thread-safe */ in BIO_gethostbyname()
433 ghbn_cache[lowi].name[0] = '\0'; in BIO_gethostbyname()
435 if((ret=ghbn_cache[lowi].ent=ghbn_dup(ret)) == NULL) in BIO_gethostbyname()
440 strncpy(ghbn_cache[lowi].name,name,128); in BIO_gethostbyname()
441 ghbn_cache[lowi].order=BIO_ghbn_miss+BIO_ghbn_hits; in BIO_gethostbyname()
/dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/
H A DStructuredGrid.cpp99 Vect3i lowi,highi; in get_overlap() local
100 lowi = get_cell_index_vector(snap_low); in get_overlap()
105 for (int i = lowi[0]; i <= highi[0]; ++i) { in get_overlap()
106 for (int j = lowi[1]; j <= highi[1]; ++j) { in get_overlap()
107 for (int k = lowi[2]; k <= highi[2]; ++k) { in get_overlap()
/dports/security/openssl-legacy-static/openssl-1.0.2u/apps/
H A Ds_socket.c524 int i, lowi = 0; in GetHostByName() local
530 lowi = i; in GetHostByName()
544 strcpy(ghbn_cache[lowi].name, name); in GetHostByName()
545 memcpy((char *)&(ghbn_cache[lowi].ent), ret, in GetHostByName()
547 ghbn_cache[lowi].order = ghbn_miss + ghbn_hits; in GetHostByName()
/dports/devel/liteide/gocode-cfcb188102ae/
H A Dripper.go37 lowi := -1
51 lowi = i
56 for i := lowi - 1; i >= 0; i-- {
/dports/devel/godot2/godot-2.1.6-stable/thirdparty/openssl/crypto/bio/
H A Db_sock.c402 int i, lowi = 0, j; in BIO_gethostbyname()
418 lowi = i; in BIO_gethostbyname()
455 if (ghbn_cache[lowi].ent != NULL) in BIO_gethostbyname()
456 ghbn_free(ghbn_cache[lowi].ent); /* XXX not thread-safe */ in BIO_gethostbyname()
457 ghbn_cache[lowi].name[0] = '\0'; in BIO_gethostbyname()
459 if ((ret = ghbn_cache[lowi].ent = ghbn_dup(ret)) == NULL) { in BIO_gethostbyname()
463 strncpy(ghbn_cache[lowi].name, name, 128); in BIO_gethostbyname()
464 ghbn_cache[lowi].order = BIO_ghbn_miss + BIO_ghbn_hits; in BIO_gethostbyname()
/dports/devel/godot2-tools/godot-2.1.6-stable/thirdparty/openssl/crypto/bio/
H A Db_sock.c402 int i, lowi = 0, j; in BIO_gethostbyname()
418 lowi = i; in BIO_gethostbyname()
455 if (ghbn_cache[lowi].ent != NULL) in BIO_gethostbyname()
456 ghbn_free(ghbn_cache[lowi].ent); /* XXX not thread-safe */ in BIO_gethostbyname()
457 ghbn_cache[lowi].name[0] = '\0'; in BIO_gethostbyname()
459 if ((ret = ghbn_cache[lowi].ent = ghbn_dup(ret)) == NULL) { in BIO_gethostbyname()
463 strncpy(ghbn_cache[lowi].name, name, 128); in BIO_gethostbyname()
464 ghbn_cache[lowi].order = BIO_ghbn_miss + BIO_ghbn_hits; in BIO_gethostbyname()
/dports/security/openssl-unsafe/openssl-c9ba19c/crypto/bio/
H A Db_sock.c381 int i, lowi = 0, j; in BIO_gethostbyname()
397 lowi = i; in BIO_gethostbyname()
434 if (ghbn_cache[lowi].ent != NULL) in BIO_gethostbyname()
435 ghbn_free(ghbn_cache[lowi].ent); /* XXX not thread-safe */ in BIO_gethostbyname()
436 ghbn_cache[lowi].name[0] = '\0'; in BIO_gethostbyname()
438 if ((ret = ghbn_cache[lowi].ent = ghbn_dup(ret)) == NULL) { in BIO_gethostbyname()
442 strncpy(ghbn_cache[lowi].name, name, 128); in BIO_gethostbyname()
443 ghbn_cache[lowi].order = BIO_ghbn_miss + BIO_ghbn_hits; in BIO_gethostbyname()
/dports/security/openssl-legacy-static/openssl-1.0.2u/crypto/bio/
H A Db_sock.c402 int i, lowi = 0, j; in BIO_gethostbyname()
418 lowi = i; in BIO_gethostbyname()
455 if (ghbn_cache[lowi].ent != NULL) in BIO_gethostbyname()
456 ghbn_free(ghbn_cache[lowi].ent); /* XXX not thread-safe */ in BIO_gethostbyname()
457 ghbn_cache[lowi].name[0] = '\0'; in BIO_gethostbyname()
459 if ((ret = ghbn_cache[lowi].ent = ghbn_dup(ret)) == NULL) { in BIO_gethostbyname()
463 strncpy(ghbn_cache[lowi].name, name, 128); in BIO_gethostbyname()
464 ghbn_cache[lowi].order = BIO_ghbn_miss + BIO_ghbn_hits; in BIO_gethostbyname()
/dports/net/p5-Socket-Class/Socket-Class-2.258/xs/sc_ssl/openssl/source/apps/
H A Ds_socket.c578 int i,lowi=0; in GetHostByName() local
586 lowi=i; in GetHostByName()
602 strcpy(ghbn_cache[lowi].name,name); in GetHostByName()
603 memcpy((char *)&(ghbn_cache[lowi].ent),ret,sizeof(struct hostent)); in GetHostByName()
604 ghbn_cache[lowi].order=ghbn_miss+ghbn_hits; in GetHostByName()
/dports/security/openssl-unsafe/openssl-c9ba19c/apps/
H A Ds_socket.c579 int i, lowi = 0; in GetHostByName() local
585 lowi = i; in GetHostByName()
599 strcpy(ghbn_cache[lowi].name, name); in GetHostByName()
600 memcpy((char *)&(ghbn_cache[lowi].ent), ret, in GetHostByName()
602 ghbn_cache[lowi].order = ghbn_miss + ghbn_hits; in GetHostByName()
/dports/security/sslwrap/sslwrap206/
H A Ds_socket.c584 int i,lowi=0; local
592 lowi=i;
606 strncpy(ghbn_cache[lowi].name,name,128);
607 memcpy((char *)&(ghbn_cache[lowi].ent),ret,sizeof(struct hostent));
608 ghbn_cache[lowi].order=ghbn_miss+ghbn_hits;
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-ssa-reassoc.c2355 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
2390 lowi = ranges[i].low; in optimize_range_tests_1()
2391 if (lowi == NULL_TREE) in optimize_range_tests_1()
2392 lowi = TYPE_MIN_VALUE (type); in optimize_range_tests_1()
2530 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
2531 if (lowi == NULL_TREE) in optimize_range_tests_to_bit_test()
2537 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
2538 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
2588 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
2619 lowi = build_zero_cst (TREE_TYPE (lowi)); in optimize_range_tests_to_bit_test()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-ssa-reassoc.c2355 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
2390 lowi = ranges[i].low; in optimize_range_tests_1()
2391 if (lowi == NULL_TREE) in optimize_range_tests_1()
2392 lowi = TYPE_MIN_VALUE (type); in optimize_range_tests_1()
2530 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
2531 if (lowi == NULL_TREE) in optimize_range_tests_to_bit_test()
2537 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
2538 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
2588 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
2619 lowi = build_zero_cst (TREE_TYPE (lowi)); in optimize_range_tests_to_bit_test()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-ssa-reassoc.c2976 lowi = fold_convert (type, lowi); in optimize_range_tests_xor()
3035 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
3070 lowi = ranges[i].low; in optimize_range_tests_1()
3071 if (lowi == NULL_TREE) in optimize_range_tests_1()
3210 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
3217 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
3218 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
3279 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3284 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3294 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-ssa-reassoc.c2932 lowi = fold_convert (type, lowi); in optimize_range_tests_xor()
2991 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
3026 lowi = ranges[i].low; in optimize_range_tests_1()
3027 if (lowi == NULL_TREE) in optimize_range_tests_1()
3166 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
3173 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
3174 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
3233 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3238 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3248 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-ssa-reassoc.c2932 lowi = fold_convert (type, lowi); in optimize_range_tests_xor()
2991 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
3026 lowi = ranges[i].low; in optimize_range_tests_1()
3027 if (lowi == NULL_TREE) in optimize_range_tests_1()
3166 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
3173 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
3174 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
3233 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3238 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3248 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
[all …]
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-ssa-reassoc.c2932 lowi = fold_convert (type, lowi); in optimize_range_tests_xor()
2991 lowi = fold_convert (type, lowi); in optimize_range_tests_diff()
3026 lowi = ranges[i].low; in optimize_range_tests_1()
3027 if (lowi == NULL_TREE) in optimize_range_tests_1()
3166 lowi = ranges[i].low; in optimize_range_tests_to_bit_test()
3173 tree exp = extract_bit_test_mask (ranges[i].exp, prec, lowi, lowi, in optimize_range_tests_to_bit_test()
3174 highi, &mask, &lowi); in optimize_range_tests_to_bit_test()
3233 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3238 lowi = wide_int_to_tree (TREE_TYPE (lowi), min); in optimize_range_tests_to_bit_test()
3248 wi::to_widest (lowi) in optimize_range_tests_to_bit_test()
[all …]

123456