reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/DenseMap.h
   40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
   45   ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; }
   46   const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; }
   66   using mapped_type = ValueT;
   69   using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>;
   71       DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>;
  185   ValueT lookup(const_arg_type_t<KeyT> Val) const {
  195   std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
  202   std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
  249   std::pair<iterator, bool> insert_as(std::pair<KeyT, ValueT> &&KV,
  299   ValueT &operator[](const KeyT &Key) {
  311   ValueT &operator[](KeyT &&Key) {
  380         ::new (&DestBucket->getSecond()) ValueT(std::move(B->getSecond()));
  392       const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) {
  520     ::new (&TheBucket->getSecond()) ValueT(std::forward<ValueArgs>(Values)...);
  526                                       ValueT &&Value, LookupKeyT &Lookup) {
  684 class DenseMap : public DenseMapBase<DenseMap<KeyT, ValueT, KeyInfoT, BucketT>,
  685                                      KeyT, ValueT, KeyInfoT, BucketT> {
  690   using BaseT = DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT, BucketT>;
 1163   using ConstIterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
 1199       const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I)
lib/Transforms/ObjCARC/ObjCARCOpts.cpp
  289     void InitFromPred(const BBState &Other);
  290     void InitFromSucc(const BBState &Other);
  291     void MergePred(const BBState &Other);
  292     void MergeSucc(const BBState &Other);
  333                         BBState &BBState) LLVM_ATTRIBUTE_UNUSED;
  337 void BBState::InitFromPred(const BBState &Other) {
  342 void BBState::InitFromSucc(const BBState &Other) {
  349 void BBState::MergePred(const BBState &Other) {
  392 void BBState::MergeSucc(const BBState &Other) {
  434 raw_ostream &llvm::operator<<(raw_ostream &OS, BBState &BBInfo) {
  510                             DenseMap<const BasicBlock *, BBState> &BBStates,
  511                             BBState &MyStates) const;
  514                                   BBState &MyStates);
  516                        DenseMap<const BasicBlock *, BBState> &BBStates,
  520                                  BBState &MyStates);
  522                       DenseMap<const BasicBlock *, BBState> &BBStates,
  524     bool Visit(Function &F, DenseMap<const BasicBlock *, BBState> &BBStates,
  534     PairUpRetainsAndReleases(DenseMap<const BasicBlock *, BBState> &BBStates,
  543     bool PerformCodePlacement(DenseMap<const BasicBlock *, BBState> &BBStates,
 1108                                DenseMap<const BasicBlock *, BBState> &BBStates,
 1109                                BBState &MyStates) const {
 1134       const DenseMap<const BasicBlock *, BBState>::iterator BBI =
 1197     BBState &MyStates) {
 1265                                DenseMap<const BasicBlock *, BBState> &BBStates,
 1270   BBState &MyStates = BBStates[BB];
 1274   BBState::edge_iterator SI(MyStates.succ_begin()),
 1278     DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Succ);
 1317   for (BBState::edge_iterator PI(MyStates.pred_begin()),
 1332                                     BBState &MyStates) {
 1401                          DenseMap<const BasicBlock *, BBState> &BBStates,
 1405   BBState &MyStates = BBStates[BB];
 1409   BBState::edge_iterator PI(MyStates.pred_begin()),
 1413     DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Pred);
 1455                   DenseMap<const BasicBlock *, BBState> &BBStates) {
 1466   BBState &MyStates = BBStates[EntryBB];
 1483         BBState &SuccStates = BBStates[SuccBB];
 1504   SmallVector<std::pair<BasicBlock *, BBState::edge_iterator>, 16> PredStack;
 1506     BBState &MyStates = BBStates[&ExitBB];
 1516       BBState::edge_iterator PE = BBStates[PredStack.back().first].pred_end();
 1531                        DenseMap<const BasicBlock *, BBState> &BBStates,
 1622     DenseMap<const BasicBlock *, BBState> &BBStates,
 1669           const BBState &NRRBBState = BBStates[NewRetainRelease->getParent()];
 1670           unsigned PathCount = BBState::OverflowOccurredValue;
 1700                 const BBState &RIPBBState = BBStates[RIP->getParent()];
 1701                 PathCount = BBState::OverflowOccurredValue;
 1741           const BBState &NRRBBState = BBStates[NewReleaseRetain->getParent()];
 1742           unsigned PathCount = BBState::OverflowOccurredValue;
 1757                 const BBState &RIPBBState = BBStates[RIP->getParent()];
 1759                 PathCount = BBState::OverflowOccurredValue;
 1821     DenseMap<const BasicBlock *, BBState> &BBStates,
 2050   DenseMap<const BasicBlock *, BBState> BBStates;
usr/include/c++/7.4.0/bits/move.h
   98     move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/stl_pair.h
  209     : private __pair_base<_T1, _T2>
  212       typedef _T2 second_type;   /// @c second_type is the second bound type
  215       _T2 second;                /// @c second is a copy of the second object
  252       using _PCCP = _PCC<true, _T1, _T2>;
  260       constexpr pair(const _T1& __a, const _T2& __b)
  269       explicit constexpr pair(const _T1& __a, const _T2& __b)
  283 			    _T1, _T2>;
  311        constexpr pair(_U1&& __x, const _T2& __y)
  318        explicit constexpr pair(_U1&& __x, const _T2& __y)
  380 		       is_copy_assignable<_T2>>::value,
  391 		       is_move_assignable<_T2>>::value,
  403 				is_assignable<_T2&, const _U2&>>::value,
  403 				is_assignable<_T2&, const _U2&>>::value,
  405 	operator=(const pair<_U1, _U2>& __p)
  414 				is_assignable<_T2&, _U2&&>>::value,
  414 				is_assignable<_T2&, _U2&&>>::value,
  416 	operator=(pair<_U1, _U2>&& __p)
usr/include/c++/7.4.0/type_traits
  215     : public __is_void_helper<typename remove_cv<_Tp>::type>::type
  581     : public __or_<is_lvalue_reference<_Tp>,
  582                    is_rvalue_reference<_Tp>>::type
  601     : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
  601     : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
  602                           is_void<_Tp>>>::type
  638     : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
  638     : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
  762     typename add_rvalue_reference<_Tp>::type declval() noexcept;
  889       typedef decltype(__test<_Tp>(0)) type;
  894     : public __and_<__not_<is_void<_Tp>>,
  895                     __is_default_constructible_impl<_Tp>>
  915     : public __is_default_constructible_atom<_Tp>::type
  921     : public __is_default_constructible_safe<_Tp>::type
 1286     : public is_assignable<_Tp&, const _Tp&>
 1286     : public is_assignable<_Tp&, const _Tp&>
 1292     : public __is_copy_assignable_impl<_Tp>
 1304     : public is_assignable<_Tp&, _Tp&&>
 1304     : public is_assignable<_Tp&, _Tp&&>
 1310     : public __is_move_assignable_impl<_Tp>
 1377     static void __helper(const _Tp&);
 1380     static true_type __test(const _Tp&,
 1381                             decltype(__helper<const _Tp&>({}))* = 0);
 1390     typedef decltype(__test(declval<_Tp>())) type;
 1395       : public __is_implicitly_default_constructible_impl<_Tp>::type
 1400       : public __and_<is_default_constructible<_Tp>,
 1401                       __is_implicitly_default_constructible_safe<_Tp>>
 1554     { typedef _Tp     type; };
 1563     { typedef _Tp     type; };
 1574       remove_const<typename remove_volatile<_Tp>::type>::type     type;
 1633     { typedef _Tp   type; };
 1659     { typedef _Tp&&   type; };
 1664     : public __add_rvalue_reference_helper<_Tp>