Home
last modified time | relevance | path

Searched refs:upper_bound (Results 1 – 25 of 162) sorted by relevance

1234567

/openbsd-src/lib/libc/crypt/
H A Darc4random_uniform.c33 arc4random_uniform(uint32_t upper_bound) in arc4random_uniform() argument
37 if (upper_bound < 2) in arc4random_uniform()
41 min = -upper_bound % upper_bound; in arc4random_uniform()
55 return r % upper_bound; in arc4random_uniform()
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/
H A Dbinary_search.cc81 using std::upper_bound; in test02()
86 const int* p = upper_bound(A, A + N, 3); in test02()
89 const int* q = upper_bound(A, A + N, first); in test02()
92 const int* r = upper_bound(A, A + N, last); in test02()
95 const int* s = upper_bound(A, A + N, 4); in test02()
98 const int* t = upper_bound(C, C + N, 3, gt()); in test02()
101 const int* u = upper_bound(C, C + N, first, gt()); in test02()
104 const int* v = upper_bound(C, C + N, last, gt()); in test02()
107 const int* w = upper_bound(C, C + N, 4, gt()); in test02()
/openbsd-src/gnu/llvm/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFASTParser.cpp39 uint64_t upper_bound = 0; in ParseChildArrayInfo() local
83 upper_bound = form_value.Unsigned(); in ParseChildArrayInfo()
93 if (upper_bound_valid && upper_bound >= lower_bound) in ParseChildArrayInfo()
94 num_elements = upper_bound - lower_bound + 1; in ParseChildArrayInfo()
/openbsd-src/gnu/usr.bin/binutils/gdb/
H A Df-typeprint.c159 int upper_bound, lower_bound; in f_type_print_varspec_suffix() local
206 retcode = f77_get_dynamic_upperbound (type, &upper_bound); in f_type_print_varspec_suffix()
211 fprintf_filtered (stream, "%d", upper_bound); in f_type_print_varspec_suffix()
290 int upper_bound; in f_type_print_base() local
385 retcode = f77_get_dynamic_upperbound (type, &upper_bound); in f_type_print_base()
390 fprintf_filtered (stream, "character*%d", upper_bound); in f_type_print_base()
H A Df-valprint.c129 f77_get_dynamic_upperbound (struct type *type, int *upper_bound) in f77_get_dynamic_upperbound() argument
140 *upper_bound = in f77_get_dynamic_upperbound()
147 *upper_bound = DEFAULT_UPPER_BOUND; in f77_get_dynamic_upperbound()
153 *upper_bound = TYPE_ARRAY_UPPER_BOUND_VALUE (type); in f77_get_dynamic_upperbound()
162 f77_get_dynamic_lowerbound (type, upper_bound); in f77_get_dynamic_upperbound()
173 *upper_bound = read_memory_integer (ptr_to_upper_bound, 4); in f77_get_dynamic_upperbound()
177 *upper_bound = DEFAULT_UPPER_BOUND; in f77_get_dynamic_upperbound()
196 int upper_bound = -1; in f77_get_dynamic_length_of_aggregate() local
218 retcode = f77_get_dynamic_upperbound (type, &upper_bound); in f77_get_dynamic_length_of_aggregate()
225 (upper_bound - lower_bound + 1) * TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type))); in f77_get_dynamic_length_of_aggregate()
/openbsd-src/gnu/llvm/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp172 lldb::addr_t upper_bound, in FindInRange() argument
174 if (lower_bound > upper_bound) in FindInRange()
180 if (lower == m_bp_site_list.end() || (*lower).first >= upper_bound) in FindInRange()
194 upper = m_bp_site_list.upper_bound(upper_bound); in FindInRange()
/openbsd-src/gnu/llvm/libcxx/include/__algorithm/
H A Dupper_bound.h49 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in upper_bound() function
58 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { in upper_bound() function
59 return std::upper_bound( in upper_bound()
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_set.h195 iterator upper_bound(const key_type& __x) { in upper_bound() function
196 return _M_t.upper_bound(__x); in upper_bound()
198 const_iterator upper_bound(const key_type& __x) const { in upper_bound() function
199 return _M_t.upper_bound(__x); in upper_bound()
212 iterator upper_bound(const key_type& __x) const { in upper_bound() function
213 return _M_t.upper_bound(__x); in upper_bound()
H A Dstl_multiset.h196 iterator upper_bound(const key_type& __x) { in upper_bound() function
197 return _M_t.upper_bound(__x); in upper_bound()
199 const_iterator upper_bound(const key_type& __x) const { in upper_bound() function
200 return _M_t.upper_bound(__x); in upper_bound()
213 iterator upper_bound(const key_type& __x) const { in upper_bound() function
214 return _M_t.upper_bound(__x); in upper_bound()
H A Dstl_multimap.h513 upper_bound(const key_type& __x) { return _M_t.upper_bound(__x); } in upper_bound() function
522 upper_bound(const key_type& __x) const { return _M_t.upper_bound(__x); } in upper_bound() function
H A Dstl_map.h532 upper_bound(const key_type& __x) { return _M_t.upper_bound(__x); } in upper_bound() function
543 upper_bound(const key_type& __x) const in upper_bound() function
544 { return _M_t.upper_bound(__x); } in upper_bound()
/openbsd-src/gnu/usr.bin/perl/t/re/
H A Dpat_special_cc.t30 my $upper_bound= 10_000;
36 for my $ord (0 .. $upper_bound) {
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_multiset.h451 upper_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
452 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
455 upper_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
456 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_set.h466 upper_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
467 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
470 upper_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
471 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_multimap.h542 upper_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
543 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
552 upper_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
553 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_map.h608 upper_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
609 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
618 upper_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
619 { return _M_t.upper_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
/openbsd-src/gnu/llvm/compiler-rt/lib/orc/
H A Dinterval_map.h69 auto I = Impl.upper_bound(K); in find()
94 auto J = Impl.upper_bound(KS); in erase()
134 auto J = this->Impl.upper_bound(KS); in insert()
/openbsd-src/gnu/llvm/lldb/include/lldb/Utility/
H A DRangeMap.h432 B upper_bound; member
435 : RangeData<B, S, T>(rd), upper_bound() {} in AugmentedRangeData()
666 entry.upper_bound = entry.base + entry.size; in ComputeUpperBounds()
669 entry.upper_bound = in ComputeUpperBounds()
670 std::max(entry.upper_bound, ComputeUpperBounds(lo, mid)); in ComputeUpperBounds()
673 entry.upper_bound = in ComputeUpperBounds()
674 std::max(entry.upper_bound, ComputeUpperBounds(mid + 1, hi)); in ComputeUpperBounds()
676 return entry.upper_bound; in ComputeUpperBounds()
688 if (addr > entry.upper_bound) in FindEntryIndexesThatContain()
/openbsd-src/gnu/gcc/libstdc++-v3/include/debug/
H A Dset.h241 upper_bound(const key_type& __x) in upper_bound() function
242 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
247 upper_bound(const key_type& __x) const in upper_bound() function
248 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
H A Dmultiset.h236 upper_bound(const key_type& __x) in upper_bound() function
237 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
242 upper_bound(const key_type& __x) const in upper_bound() function
243 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
H A Dmultimap.h234 upper_bound(const key_type& __x) in upper_bound() function
235 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
238 upper_bound(const key_type& __x) const in upper_bound() function
239 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
H A Dmap.h247 upper_bound(const key_type& __x) in upper_bound() function
248 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
251 upper_bound(const key_type& __x) const in upper_bound() function
252 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp96 upper_bound(const_key_reference r_key) const in upper_bound() function in PB_DS_CLASS_C_DEC
118 upper_bound(const_key_reference r_key) in upper_bound() function in PB_DS_CLASS_C_DEC
/openbsd-src/gnu/llvm/libcxx/include/
H A Dset172 iterator upper_bound(const key_type& k);
173 const_iterator upper_bound(const key_type& k) const;
175 iterator upper_bound(const K& x); // C++14
177 const_iterator upper_bound(const K& x) const; // C++14
396 iterator upper_bound(const key_type& k);
397 const_iterator upper_bound(const key_type& k) const;
399 iterator upper_bound(const K& x); // C++14
401 const_iterator upper_bound(const K& x) const; // C++14
896 iterator upper_bound(const key_type& __k)
897 {return __tree_.upper_bound(__k);}
[all …]
/openbsd-src/gnu/llvm/lldb/source/Plugins/Trace/intel-pt/
H A DDecodedThread.cpp154 auto it = m_cpus.upper_bound(item_index); in GetCPUByIndex()
160 auto next_it = m_tscs.upper_bound(item_index); in GetTSCRangeByIndex()
168 auto next_it = m_nanoseconds.upper_bound(item_index); in GetNanosecondsRangeByIndex()

1234567