/freebsd-11-stable/contrib/unbound/compat/ |
H A D | arc4random_uniform.c | 24 * Calculate a uniformly distributed random number less than upper_bound 28 * returned is outside the range [0, 2**32 % upper_bound). This 30 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) 31 * after reduction modulo upper_bound. 34 arc4random_uniform(uint32_t upper_bound) argument 38 if (upper_bound < 2) 42 min = -upper_bound % upper_bound; 56 return r % upper_bound; [all...] |
/freebsd-11-stable/contrib/ntp/sntp/libevent/ |
H A D | arc4random.c | 513 * Calculate a uniformly distributed random number less than upper_bound 517 * returned is outside the range [0, 2**32 % upper_bound). This 519 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) 520 * after reduction modulo upper_bound. 523 arc4random_uniform(unsigned int upper_bound) argument 527 if (upper_bound < 2) 531 min = 0x100000000UL % upper_bound; 533 /* Calculate (2**32 % upper_bound) avoiding 64-bit math */ 534 if (upper_bound > [all...] |
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | f-typeprint.c | 160 int upper_bound, lower_bound; 207 retcode = f77_get_dynamic_upperbound (type, &upper_bound); 212 fprintf_filtered (stream, "%d", upper_bound); 291 int upper_bound; 386 retcode = f77_get_dynamic_upperbound (type, &upper_bound); 391 fprintf_filtered (stream, "character*%d", upper_bound); 159 int upper_bound, lower_bound; local 290 int upper_bound; local
|
H A D | f-valprint.c | 129 f77_get_dynamic_upperbound (struct type *type, int *upper_bound) argument 140 *upper_bound = 147 *upper_bound = DEFAULT_UPPER_BOUND; 153 *upper_bound = TYPE_ARRAY_UPPER_BOUND_VALUE (type); 158 upper_bound == lower_bound so that we show at least 162 f77_get_dynamic_lowerbound (type, upper_bound); 173 *upper_bound = read_memory_integer (ptr_to_upper_bound, 4); 177 *upper_bound = DEFAULT_UPPER_BOUND; 196 int upper_bound = -1; local 218 retcode = f77_get_dynamic_upperbound (type, &upper_bound); [all...] |
/freebsd-11-stable/contrib/jemalloc/src/ |
H A D | quarantine.c | 18 size_t upper_bound); 109 quarantine_drain(tsdn_t *tsdn, quarantine_t *quarantine, size_t upper_bound) argument 112 while (quarantine->curbytes > upper_bound && quarantine->curobjs > 0) 134 size_t upper_bound = (opt_quarantine >= usize) ? opt_quarantine local 136 quarantine_drain(tsd_tsdn(tsd), quarantine, upper_bound); local
|
/freebsd-11-stable/crypto/openssh/openbsd-compat/ |
H A D | arc4random.c | 272 * Calculate a uniformly distributed random number less than upper_bound 276 * returned is outside the range [0, 2**32 % upper_bound). This 278 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) 279 * after reduction modulo upper_bound. 282 arc4random_uniform(u_int32_t upper_bound) argument 286 if (upper_bound < 2) 290 min = -upper_bound % upper_bound; 304 return r % upper_bound; [all...] |
/freebsd-11-stable/lib/libc/gen/ |
H A D | arc4random.c | 260 * Calculate a uniformly distributed random number less than upper_bound 264 * returned is outside the range [0, 2**32 % upper_bound). This 266 * [2**32 % upper_bound, 2**32) which maps back to [0, upper_bound) 267 * after reduction modulo upper_bound. 270 arc4random_uniform(u_int32_t upper_bound) argument 274 if (upper_bound < 2) 278 min = -upper_bound % upper_bound; 291 return r % upper_bound; [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Breakpoint/ |
H A D | BreakpointSiteList.cpp | 172 lldb::addr_t upper_bound, 174 if (lower_bound > upper_bound) 180 if (lower == m_bp_site_list.end() || (*lower).first >= upper_bound) 194 upper = m_bp_site_list.upper_bound(upper_bound); 171 FindInRange(lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSiteList &bp_site_list) const argument
|
/freebsd-11-stable/contrib/ntp/scripts/ |
H A D | plot_summary.in | 108 my ($lower_bound, $upper_bound, $rms); 134 $upper_bound = $1 + $2; 135 $line .= "$1 $lower_bound $upper_bound"; 137 $max_offs = max($max_offs, $upper_bound);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | find_fn_imps.hpp | 96 upper_bound(const_key_reference r_key) const function in class:PB_DS_CLASS_C_DEC 118 upper_bound(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | debug_fn_imps.hpp | 78 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it));
|
H A D | split_join_fn_imps.hpp | 87 iterator it = upper_bound(r_key);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | debug_fn_imps.hpp | 82 _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Index/ |
H A D | FileIndexRecord.cpp | 39 auto It = llvm::upper_bound(Decls, NewInfo);
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/ |
H A D | ThreadCollection.cpp | 37 std::upper_bound(m_threads.begin(), m_threads.end(), thread_sp,
|
/freebsd-11-stable/contrib/libstdc++/include/bits/ |
H A D | stl_multimap.h | 542 upper_bound(const key_type& __x) function in class:multimap 543 { return _M_t.upper_bound(__x); } 552 upper_bound(const key_type& __x) const function in class:multimap 553 { return _M_t.upper_bound(__x); } 564 * c.upper_bound(val)) 581 * c.upper_bound(val))
|
H A D | stl_multiset.h | 451 upper_bound(const key_type& __x) function in class:multiset 452 { return _M_t.upper_bound(__x); } 455 upper_bound(const key_type& __x) const function in class:multiset 456 { return _M_t.upper_bound(__x); } 469 * c.upper_bound(val))
|
H A D | stl_set.h | 466 upper_bound(const key_type& __x) function in class:set 467 { return _M_t.upper_bound(__x); } 470 upper_bound(const key_type& __x) const function in class:set 471 { return _M_t.upper_bound(__x); } 484 * c.upper_bound(val))
|
H A D | stl_map.h | 608 upper_bound(const key_type& __x) function in class:map 609 { return _M_t.upper_bound(__x); } 618 upper_bound(const key_type& __x) const function in class:map 619 { return _M_t.upper_bound(__x); } 630 * c.upper_bound(val)) 649 * c.upper_bound(val))
|
/freebsd-11-stable/contrib/libstdc++/include/debug/ |
H A D | multiset.h | 236 upper_bound(const key_type& __x) function in class:std::__debug::multiset 237 { return iterator(_Base::upper_bound(__x), this); } 242 upper_bound(const key_type& __x) const function in class:std::__debug::multiset 243 { return const_iterator(_Base::upper_bound(__x), this); }
|
H A D | set.h | 241 upper_bound(const key_type& __x) function in class:std::__debug::set 242 { return iterator(_Base::upper_bound(__x), this); } 247 upper_bound(const key_type& __x) const function in class:std::__debug::set 248 { return const_iterator(_Base::upper_bound(__x), this); }
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | split_join_fn_imps.hpp | 98 node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Breakpoint/ |
H A D | BreakpointSiteList.h | 127 bool FindInRange(lldb::addr_t lower_bound, lldb::addr_t upper_bound,
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-ssa-loop-prefetch.c | 905 unsigned upper_bound, size_factor, constraint_factor; local 910 upper_bound = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES); 917 if (size_factor < upper_bound) 918 upper_bound = size_factor; 942 if (factor > upper_bound) 943 factor = upper_bound;
|
/freebsd-11-stable/contrib/libstdc++/include/backward/ |
H A D | algo.h | 104 using std::upper_bound;
|