Searched refs:lower_bound (Results 1 - 25 of 107) sorted by relevance

12345

/freebsd-11.0-release/contrib/gdb/gdb/
H A Df-valprint.c71 f77_get_dynamic_lowerbound (struct type *type, int *lower_bound) argument
82 *lower_bound =
89 *lower_bound = DEFAULT_LOWER_BOUND;
95 *lower_bound = TYPE_ARRAY_LOWER_BOUND_VALUE (type);
110 *lower_bound = read_memory_integer (ptr_to_lower_bound, 4);
114 *lower_bound = DEFAULT_LOWER_BOUND;
158 upper_bound == lower_bound so that we show at least
197 int lower_bound = 1; local
214 retcode = f77_get_dynamic_lowerbound (type, &lower_bound);
225 (upper_bound - lower_bound
[all...]
H A Df-typeprint.c160 int upper_bound, lower_bound;
184 retcode = f77_get_dynamic_lowerbound (type, &lower_bound);
190 else if (lower_bound == 1) /* The default */
193 fprintf_filtered (stream, "%d", lower_bound);
159 int upper_bound, lower_bound; local
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp209 BreakpointSiteList::FindInRange (lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSiteList &bp_site_list) const argument
211 if (lower_bound > upper_bound)
216 lower = m_bp_site_list.lower_bound(lower_bound);
228 if (prev_bp->GetLoadAddress() + prev_bp->GetByteSize() > lower_bound)
/freebsd-11.0-release/contrib/llvm/tools/lldb/include/lldb/Core/
H A DThreadSafeSTLMap.h130 const_iterator pos = m_collection.lower_bound (key);
148 return m_collection.lower_bound (key);
H A DUniqueCStringMap.h165 const_iterator pos = std::lower_bound (m_map.begin(), end, search_entry);
186 const_iterator pos = std::lower_bound (m_map.begin(), end, search_entry);
228 for (pos = std::lower_bound (m_map.begin(), end, search_entry); pos != end; ++pos)
327 iterator lower_pos = std::lower_bound (begin, end, search_entry);
H A DRangeMap.h379 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
406 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
434 typename Collection::const_iterator pos = std::lower_bound (begin, end, range, BaseLessThan);
654 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
681 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
709 typename Collection::const_iterator pos = std::lower_bound (begin, end, range, BaseLessThan);
919 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
948 typename Collection::iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
979 typename Collection::const_iterator pos = std::lower_bound (begin, end, entry, BaseLessThan);
1007 typename Collection::const_iterator pos = std::lower_bound (begi
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Lex/
H A DPPConditionalDirectiveRecord.cpp30 low = std::lower_bound(CondDirectiveLocs.begin(), CondDirectiveLocs.end(),
60 low = std::lower_bound(CondDirectiveLocs.begin(), CondDirectiveLocs.end(),
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/
H A Dfind_fn_imps.hpp50 lower_bound(const_key_reference r_key) const function in class:PB_DS_CLASS_C_DEC
73 lower_bound(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC
/freebsd-11.0-release/contrib/llvm/lib/MC/
H A DMCRegisterInfo.cpp66 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
77 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
H A DMCSection.cpp62 std::lower_bound(SubsectionFragmentMap.begin(),
/freebsd-11.0-release/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-11.0-release/contrib/llvm/tools/lldb/include/lldb/Breakpoint/
H A DBreakpointSiteList.h163 FindInRange (lldb::addr_t lower_bound, lldb::addr_t upper_bound, BreakpointSiteList &bp_site_list) const;
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/
H A Ddebug_fn_imps.hpp77 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
H A Dov_tree_map_.hpp244 point_iterator it = lower_bound(r_key);
265 point_iterator it = lower_bound(r_key);
279 lower_bound(const_key_reference r_key) function in class:pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
295 lower_bound(const_key_reference r_key) const function in class:pb_ds::detail::PB_DS_OV_TREE_CLASS_NAME
296 { return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); }
301 iterator pot_it = lower_bound(r_key);
320 iterator pot_it = lower_bound(r_key);
/freebsd-11.0-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Ddebug_fn_imps.hpp81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
H A Dfind_fn_imps.hpp166 lower_bound(const_key_reference r_key) function in class:PB_DS_CLASS_C_DEC
172 lower_bound(const_key_reference r_key) const function in class:PB_DS_CLASS_C_DEC
182 point_iterator l_bound_it = lower_bound(r_key);
200 const_point_iterator l_bound_it = lower_bound(r_key);
/freebsd-11.0-release/contrib/libstdc++/include/bits/
H A Dstl_map.h347 iterator __i = lower_bound(__k);
366 iterator __i = lower_bound(__k);
375 const_iterator __i = lower_bound(__k);
583 lower_bound(const key_type& __x) function in class:map
584 { return _M_t.lower_bound(__x); }
598 lower_bound(const key_type& __x) const function in class:map
599 { return _M_t.lower_bound(__x); }
629 * std::make_pair(c.lower_bound(val),
648 * std::make_pair(c.lower_bound(val),
H A Dstl_multimap.h517 lower_bound(const key_type& __x) function in class:multimap
518 { return _M_t.lower_bound(__x); }
532 lower_bound(const key_type& __x) const function in class:multimap
533 { return _M_t.lower_bound(__x); }
563 * std::make_pair(c.lower_bound(val),
580 * std::make_pair(c.lower_bound(val),
H A Dstl_multiset.h435 lower_bound(const key_type& __x) function in class:multiset
436 { return _M_t.lower_bound(__x); }
439 lower_bound(const key_type& __x) const function in class:multiset
440 { return _M_t.lower_bound(__x); }
468 * std::make_pair(c.lower_bound(val),
H A Dstl_set.h450 lower_bound(const key_type& __x) function in class:set
451 { return _M_t.lower_bound(__x); }
454 lower_bound(const key_type& __x) const function in class:set
455 { return _M_t.lower_bound(__x); }
483 * std::make_pair(c.lower_bound(val),
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Target/
H A DSectionLoadHistory.cpp66 StopIDToSectionLoadList::iterator pos = m_stop_id_to_section_load_list.lower_bound(stop_id);
84 StopIDToSectionLoadList::iterator pos = m_stop_id_to_section_load_list.lower_bound(stop_id);
/freebsd-11.0-release/contrib/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h71 typename SeqMap::iterator I = Seqs.lower_bound(Seq);
107 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq);
/freebsd-11.0-release/contrib/libstdc++/include/debug/
H A Dmultiset.h226 lower_bound(const key_type& __x) function in class:std::__debug::multiset
227 { return iterator(_Base::lower_bound(__x), this); }
232 lower_bound(const key_type& __x) const function in class:std::__debug::multiset
233 { return const_iterator(_Base::lower_bound(__x), this); }
H A Dset.h231 lower_bound(const key_type& __x) function in class:std::__debug::set
232 { return iterator(_Base::lower_bound(__x), this); }
237 lower_bound(const key_type& __x) const function in class:std::__debug::set
238 { return const_iterator(_Base::lower_bound(__x), this); }
/freebsd-11.0-release/contrib/llvm/include/llvm/MC/
H A DMCSubtargetInfo.h163 auto Found = std::lower_bound(ProcDesc.begin(), ProcDesc.end(), CPU);

Completed in 133 milliseconds

12345