Home
last modified time | relevance | path

Searched refs:lower_bound (Results 1 – 25 of 149) sorted by relevance

123456

/freebsd-12.1/contrib/gdb/gdb/
H A Df-valprint.c71 f77_get_dynamic_lowerbound (struct type *type, int *lower_bound) in f77_get_dynamic_lowerbound() argument
82 *lower_bound = in f77_get_dynamic_lowerbound()
89 *lower_bound = DEFAULT_LOWER_BOUND; in f77_get_dynamic_lowerbound()
95 *lower_bound = TYPE_ARRAY_LOWER_BOUND_VALUE (type); in f77_get_dynamic_lowerbound()
110 *lower_bound = read_memory_integer (ptr_to_lower_bound, 4); in f77_get_dynamic_lowerbound()
114 *lower_bound = DEFAULT_LOWER_BOUND; in f77_get_dynamic_lowerbound()
197 int lower_bound = 1; in f77_get_dynamic_length_of_aggregate() local
214 retcode = f77_get_dynamic_lowerbound (type, &lower_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()
H A Df-typeprint.c159 int upper_bound, lower_bound; in f_type_print_varspec_suffix() local
183 retcode = f77_get_dynamic_lowerbound (type, &lower_bound); in f_type_print_varspec_suffix()
189 else if (lower_bound == 1) /* The default */ in f_type_print_varspec_suffix()
192 fprintf_filtered (stream, "%d", lower_bound); in f_type_print_varspec_suffix()
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Dov_tree_map_.hpp244 point_iterator it = lower_bound(r_key); in operator []()
265 point_iterator it = lower_bound(r_key); in insert()
279 lower_bound(const_key_reference r_key) in lower_bound() function in pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
295 lower_bound(const_key_reference r_key) const in lower_bound() function in pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
296 { return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); } in lower_bound()
301 iterator pot_it = lower_bound(r_key); in upper_bound()
320 iterator pot_it = lower_bound(r_key); in find()
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_map.h347 iterator __i = lower_bound(__k); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
366 iterator __i = lower_bound(__k); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
375 const_iterator __i = lower_bound(__k); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
583 lower_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
584 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
598 lower_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
599 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_multiset.h435 lower_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
436 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
439 lower_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
440 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_set.h450 lower_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
451 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
454 lower_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
455 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
H A Dstl_multimap.h517 lower_bound(const key_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
518 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
532 lower_bound(const key_type& __x) const in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
533 { return _M_t.lower_bound(__x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
/freebsd-12.1/contrib/llvm/tools/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp172 bool BreakpointSiteList::FindInRange(lldb::addr_t lower_bound, in FindInRange() argument
175 if (lower_bound > upper_bound) in FindInRange()
180 lower = m_bp_site_list.lower_bound(lower_bound); in FindInRange()
191 if (prev_bp->GetLoadAddress() + prev_bp->GetByteSize() > lower_bound) in FindInRange()
/freebsd-12.1/contrib/llvm/tools/lldb/include/lldb/Core/
H A DUniqueCStringMap.h117 const_iterator pos = std::lower_bound(m_map.begin(), end, search_entry); in Find()
135 const_iterator pos = std::lower_bound(m_map.begin(), end, search_entry); in FindFirstValueForName()
167 for (pos = std::lower_bound(m_map.begin(), end, search_entry); pos != end; in GetValues()
241 iterator lower_pos = std::lower_bound(begin, end, search_entry); in Erase()
H A DRangeMap.h279 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryIndexThatContains()
301 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryThatContains()
323 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
365 auto pos = std::lower_bound(begin, end, entry); in Insert()
514 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryIndexThatContains()
536 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryThatContains()
558 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
765 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
782 auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan); in FindEntryStartsAt()
806 std::lower_bound(m_entries.begin(), end, addr, in FindEntryThatContainsOrFollows()
[all …]
H A DThreadSafeSTLMap.h90 const_iterator pos = m_collection.lower_bound(key); in LowerBoundNoLock()
105 return m_collection.lower_bound(key); in lower_bound_unsafe()
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dfind_fn_imps.hpp166 lower_bound(const_key_reference r_key) in lower_bound() function in PB_DS_CLASS_C_DEC
172 lower_bound(const_key_reference r_key) const in lower_bound() function in PB_DS_CLASS_C_DEC
182 point_iterator l_bound_it = lower_bound(r_key); in upper_bound()
200 const_point_iterator l_bound_it = lower_bound(r_key); in upper_bound()
/freebsd-12.1/contrib/ntp/scripts/
H A Dplot_summary.in108 my ($lower_bound, $upper_bound, $rms);
133 $lower_bound = $1 - $2;
135 $line .= "$1 $lower_bound $upper_bound";
136 $min_offs = min($min_offs, $lower_bound);
/freebsd-12.1/contrib/llvm/lib/MC/
H A DMCRegisterInfo.cpp74 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getDwarfRegNum()
87 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getLLVMRegNum()
99 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getLLVMRegNumFromEH()
/freebsd-12.1/contrib/libc++/include/
H A Dset162 iterator lower_bound(const key_type& k);
788 iterator lower_bound(const key_type& __k)
789 {return __tree_.lower_bound(__k);}
792 {return __tree_.lower_bound(__k);}
797 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
802 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1276 iterator lower_bound(const key_type& __k)
1277 {return __tree_.lower_bound(__k);}
1280 {return __tree_.lower_bound(__k);}
1285 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
[all …]
H A Dmap1245 iterator __p = lower_bound(__k);
1258 iterator __p = lower_bound(__k);
1271 iterator __p = lower_bound(__k);
1284 iterator __p = lower_bound(__k);
1400 {return __tree_.lower_bound(__k);}
1403 {return __tree_.lower_bound(__k);}
1408 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1413 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
2031 {return __tree_.lower_bound(__k);}
2039 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
[all …]
/freebsd-12.1/contrib/llvm/tools/lldb/source/Plugins/Process/POSIX/
H A DCrashReason.cpp25 void AppendBounds(std::string &str, lldb::addr_t lower_bound, in AppendBounds() argument
28 if ((unsigned long)addr < lower_bound) in AppendBounds()
35 stream.write_hex(lower_bound); in AppendBounds()
/freebsd-12.1/contrib/libstdc++/include/debug/
H A Dmultiset.h226 lower_bound(const key_type& __x) in lower_bound() function
227 { return iterator(_Base::lower_bound(__x), this); } in lower_bound()
232 lower_bound(const key_type& __x) const in lower_bound() function
233 { return const_iterator(_Base::lower_bound(__x), this); } in lower_bound()
H A Dset.h231 lower_bound(const key_type& __x) in lower_bound() function
232 { return iterator(_Base::lower_bound(__x), this); } in lower_bound()
237 lower_bound(const key_type& __x) const in lower_bound() function
238 { return const_iterator(_Base::lower_bound(__x), this); } in lower_bound()
H A Dmultimap.h224 lower_bound(const key_type& __x) in lower_bound() function
225 { return iterator(_Base::lower_bound(__x), this); } in lower_bound()
228 lower_bound(const key_type& __x) const in lower_bound() function
229 { return const_iterator(_Base::lower_bound(__x), this); } in lower_bound()
H A Dmap.h237 lower_bound(const key_type& __x) in lower_bound() function
238 { return iterator(_Base::lower_bound(__x), this); } in lower_bound()
241 lower_bound(const key_type& __x) const in lower_bound() function
242 { return const_iterator(_Base::lower_bound(__x), this); } in lower_bound()
/freebsd-12.1/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp50 lower_bound(const_key_reference r_key) const in lower_bound() function in PB_DS_CLASS_C_DEC
73 lower_bound(const_key_reference r_key) in lower_bound() function in PB_DS_CLASS_C_DEC
/freebsd-12.1/contrib/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h70 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add()
106 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Lex/
H A DPPConditionalDirectiveRecord.cpp30 low = std::lower_bound(CondDirectiveLocs.begin(), CondDirectiveLocs.end(), in rangeIntersectsConditionalDirective()
60 low = std::lower_bound(CondDirectiveLocs.begin(), CondDirectiveLocs.end(), in findConditionalDirectiveRegionLoc()
/freebsd-12.1/contrib/libc++/src/
H A Dregex.cpp232 _VSTD::lower_bound(begin(collatenames), end(collatenames), s, use_strcmp()); in __get_collation_name()
243 _VSTD::lower_bound(begin(ClassNames), end(ClassNames), s, use_strcmp()); in __get_classname()

123456