| /dports/devel/llvm80/llvm-8.0.1.src/test/Transforms/InstCombine/ |
| H A D | intptr3.ll | 3 define void @test(float* %a, float* readnone %a_end, i64 %b) unnamed_addr {
5 %cmp1 = icmp ult float* %a, %a_end
31 %cmp = icmp ult float* %incdec.ptr, %a_end
|
| /dports/devel/llvm70/llvm-7.0.1.src/test/Transforms/InstCombine/ |
| H A D | intptr3.ll | 3 define void @test(float* %a, float* readnone %a_end, i64 %b) unnamed_addr {
5 %cmp1 = icmp ult float* %a, %a_end
31 %cmp = icmp ult float* %incdec.ptr, %a_end
|
| /dports/biology/mummer/mummer-4.0.0beta2-2-g277dac5/src/tigr/ |
| H A D | combineMUMs.cc | 452 int a_end, b_end, match_to_end; in main() local
476 if (a_end == 0 && b_end == 0) in main()
523 ref_hi += a_end; in main()
1007 int a_end, b_end, match_to_end; in Extend_Backward() local
1022 MAX_ERRORS - 1, & a_end, & b_end, in Extend_Backward()
1026 (Ref + (* ref_lo - 1), a_end, in Extend_Backward()
1039 (* ref_lo) -= a_end; in Extend_Backward()
1059 int a_end, b_end, match_to_end; in Extend_Forward() local
1075 MAX_ERRORS - 1, & a_end, & b_end, in Extend_Forward()
1078 Show_Diffs (Ref + (* ref_hi) + 1, a_end, in Extend_Forward()
[all …]
|
| /dports/devel/dbus/dbus-1.12.20/dbus/ |
| H A D | dbus-string.c | 2018 const unsigned char *a_end; in _dbus_string_equal() local
2030 while (ap != a_end) in _dbus_string_equal()
2062 const unsigned char *a_end; in _dbus_string_equal_len() local
2075 while (ap != a_end) in _dbus_string_equal_len()
2112 const unsigned char *a_end; in _dbus_string_equal_substring() local
2129 a_end = ap + a_len; in _dbus_string_equal_substring()
2130 while (ap != a_end) in _dbus_string_equal_substring()
2157 const unsigned char *a_end; in _dbus_string_equal_c_str() local
2165 while (ap != a_end && *bp) in _dbus_string_equal_c_str()
2174 if (ap != a_end || *bp) in _dbus_string_equal_c_str()
[all …]
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/strings/ |
| H A D | ctype-sjis.cc | 1367 const uchar *a_end = a + a_length; in my_strnncoll_sjis_internal() local
1369 while (a < a_end && b < b_end) { in my_strnncoll_sjis_internal()
1371 pointer_cast<const char *>(a_end)) && in my_strnncoll_sjis_internal()
1403 const uchar *a_end = a + a_length, *b_end = b + b_length; in my_strnncollsp_sjis() local
1406 if (!res && (a != a_end || b != b_end)) { in my_strnncollsp_sjis()
1412 if (a == a_end) { in my_strnncollsp_sjis()
1414 a_end = b_end; in my_strnncollsp_sjis()
1419 for (; a < a_end; a++) { in my_strnncollsp_sjis()
|
| H A D | ctype-cp932.cc | 2158 const uchar *a_end = a + a_length; in my_strnncoll_cp932_internal() local
2160 while (a < a_end && b < b_end) { in my_strnncoll_cp932_internal()
2162 pointer_cast<const char *>(a_end)) && in my_strnncoll_cp932_internal()
2194 const uchar *a_end = a + a_length; in my_strnncollsp_cp932() local
2198 if (!res && (a != a_end || b != b_end)) { in my_strnncollsp_cp932()
2204 if (a == a_end) { in my_strnncollsp_cp932()
2206 a_end = b_end; in my_strnncollsp_cp932()
2211 for (; a < a_end; a++) { in my_strnncollsp_cp932()
|
| /dports/archivers/innoextract/innoextract-1.9/src/setup/ |
| H A D | version.cpp | 298 size_t a_end = version_str.find_first_not_of(digits, a_start); in load() local
299 if(a_end == std::string::npos || version_str[a_end] != '.') { in load()
302 unsigned a = util::to_unsigned(version_str.data() + a_start, a_end - a_start); in load()
304 size_t b_start = a_end + 1; in load()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in operator ()()
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in operator ()()
82 a_iter != a_end; ++a_iter ) { in operator ()()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | graph_stats.hpp | 80 a_iterator_type a_iter, a_end; in dup_edge_dist() local
81 for( boost::tie( a_iter, a_end ) = adjacent_vertices( v, g ); in dup_edge_dist()
82 a_iter != a_end; ++a_iter ) { in dup_edge_dist()
|
| /dports/lang/ghc/ghc-8.10.7/rts/win32/ |
| H A D | OSMem.c | 290 char *a_end, *fb_end; in osReleaseFreeMemory() local
307 a_end = a->base + a->size; in osReleaseFreeMemory()
311 while (fb != NULL && fb->base + fb->size < a_end) { in osReleaseFreeMemory()
327 if (fb_end == a_end) { in osReleaseFreeMemory()
354 fb->size = fb_end - a_end; in osReleaseFreeMemory()
355 fb->base = a_end; in osReleaseFreeMemory()
|