Home
last modified time | relevance | path

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

1234

/trueos/contrib/gdb/gdb/
HDf-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()
HDf-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()
/trueos/contrib/jemalloc/src/
HDquarantine.c22 static void quarantine_drain(quarantine_t *quarantine, size_t upper_bound);
92 quarantine_drain(quarantine_t *quarantine, size_t upper_bound) in quarantine_drain() argument
95 while (quarantine->curbytes > upper_bound && quarantine->curobjs > 0) in quarantine_drain()
126 size_t upper_bound = (opt_quarantine >= usize) ? opt_quarantine in quarantine() local
128 quarantine_drain(quarantine, upper_bound); in quarantine()
/trueos/crypto/openssh/openbsd-compat/
HDarc4random.c248 arc4random_uniform(u_int32_t upper_bound) in arc4random_uniform() argument
252 if (upper_bound < 2) in arc4random_uniform()
256 min = -upper_bound % upper_bound; in arc4random_uniform()
270 return r % upper_bound; in arc4random_uniform()
/trueos/lib/libc/gen/
HDarc4random.c271 arc4random_uniform(u_int32_t upper_bound) in arc4random_uniform() argument
275 if (upper_bound < 2) in arc4random_uniform()
279 min = -upper_bound % upper_bound; in arc4random_uniform()
292 return r % upper_bound; in arc4random_uniform()
/trueos/contrib/llvm/tools/lldb/source/Breakpoint/
HDBreakpointSiteList.cpp209 BreakpointSiteList::FindInRange (lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSite… in FindInRange() argument
211 if (lower_bound > upper_bound) in FindInRange()
218 || (*lower).first >= upper_bound) in FindInRange()
233 upper = m_bp_site_list.upper_bound(upper_bound); in FindInRange()
/trueos/contrib/ntp/scripts/
HDplot_summary.in113 my ($lower_bound, $upper_bound, $rms);
139 $upper_bound = $1 + $2;
140 $line .= "$1 $lower_bound $upper_bound";
142 $max_offs = max($max_offs, $upper_bound);
/trueos/contrib/libc++/include/
Dset152 iterator upper_bound(const key_type& k);
153 const_iterator upper_bound(const key_type& k) const;
155 iterator upper_bound(const K& x); // C++14
157 const_iterator upper_bound(const K& x) const; // C++14
331 iterator upper_bound(const key_type& k);
332 const_iterator upper_bound(const key_type& k) const;
334 iterator upper_bound(const K& x); // C++14
336 const_iterator upper_bound(const K& x) const; // C++14
691 iterator upper_bound(const key_type& __k)
692 {return __tree_.upper_bound(__k);}
[all …]
Dmap172 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
366 iterator upper_bound(const key_type& k);
367 const_iterator upper_bound(const key_type& k) const;
369 iterator upper_bound(const K& x); // C++14
371 const_iterator upper_bound(const K& x) const; // C++14
1132 iterator upper_bound(const key_type& __k)
1133 {return __tree_.upper_bound(__k);}
[all …]
/trueos/contrib/libstdc++/include/bits/
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()
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()
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()
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()
/trueos/contrib/llvm/tools/lldb/include/lldb/Core/
HDUniqueCStringMap.h98 m_map.insert (std::upper_bound (m_map.begin(), m_map.end(), e), e); in Insert()
104 m_map.insert (std::upper_bound (m_map.begin(), m_map.end(), e), e); in Insert()
334 iterator upper_pos = std::upper_bound (lower_pos, end, search_entry); in Erase()
/trueos/contrib/libstdc++/include/debug/
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()
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()
Dmap.h245 upper_bound(const key_type& __x) in upper_bound() function
246 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
249 upper_bound(const key_type& __x) const in upper_bound() function
250 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
Dmultimap.h232 upper_bound(const key_type& __x) in upper_bound() function
233 { return iterator(_Base::upper_bound(__x), this); } in upper_bound()
236 upper_bound(const key_type& __x) const in upper_bound() function
237 { return const_iterator(_Base::upper_bound(__x), this); } in upper_bound()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
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
Ddebug_fn_imps.hpp218 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*it)); in assert_iterators()
238 const_iterator upper_bound_it = upper_bound(PB_DS_V2F(*reverse_it)); in assert_iterators()
Dbin_search_tree_.hpp285 upper_bound(const_key_reference r_key);
288 upper_bound(const_key_reference r_key) const;
/trueos/contrib/gcc/
HDtree-ssa-loop-prefetch.c905 unsigned upper_bound, size_factor, constraint_factor; in determine_unroll_factor() local
910 upper_bound = PARAM_VALUE (PARAM_MAX_UNROLL_TIMES); in determine_unroll_factor()
917 if (size_factor < upper_bound) in determine_unroll_factor()
918 upper_bound = size_factor; in determine_unroll_factor()
942 if (factor > upper_bound) in determine_unroll_factor()
943 factor = upper_bound; in determine_unroll_factor()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
Dov_tree_map_.hpp299 upper_bound(const_key_reference r_key) in upper_bound() function in pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
313 upper_bound(const_key_reference r_key) const in upper_bound() function in pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
314 { return const_cast<PB_DS_CLASS_C_DEC&>(*this).upper_bound(r_key); } in upper_bound()
/trueos/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
Dfind_fn_imps.hpp180 upper_bound(const_key_reference r_key) in upper_bound() function in PB_DS_CLASS_C_DEC
198 upper_bound(const_key_reference r_key) const in upper_bound() function in PB_DS_CLASS_C_DEC
/trueos/contrib/llvm/tools/lldb/source/Plugins/SymbolFile/DWARF/
HDDWARFDIECollection.cpp25 iterator insert_pos = upper_bound(m_dies.begin(), end_pos, die); in Insert()

1234