reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
56 static inline void *getAsVoidPointer(T *P) { return P; } 57 static inline T *getFromVoidPointer(void *P) { return static_cast<T *>(P); } 59 enum { NumLowBitsAvailable = detail::ConstantLog2<alignof(T)>::value }; 91 typedef PointerLikeTypeTraits<T *> NonConst; 93 static inline const void *getAsVoidPointer(const T *P) { 96 static inline const T *getFromVoidPointer(const void *P) {usr/include/c++/7.4.0/bits/alloc_traits.h
53 { using type = typename _Tp::template rebind<_Up>::other; }; 387 using allocator_type = allocator<_Tp>; 389 using value_type = _Tp; 392 using pointer = _Tp*; 395 using const_pointer = const _Tp*; 474 construct(allocator_type& __a, _Up* __p, _Args&&... __args) 486 destroy(allocator_type& __a, _Up* __p)usr/include/c++/7.4.0/bits/allocator.h
108 class allocator: public __allocator_base<_Tp> 113 typedef _Tp* pointer; 114 typedef const _Tp* const_pointer; 115 typedef _Tp& reference; 116 typedef const _Tp& const_reference; 117 typedef _Tp value_type; 121 { typedef allocator<_Tp1> other; };usr/include/c++/7.4.0/bits/forward_list.h
103 __gnu_cxx::__aligned_buffer<_Tp> _M_storage; 105 _Tp* 109 const _Tp* 122 typedef _Fwd_list_iterator<_Tp> _Self; 123 typedef _Fwd_list_node<_Tp> _Node; 125 typedef _Tp value_type; 126 typedef _Tp* pointer; 127 typedef _Tp& reference; 189 typedef _Fwd_list_const_iterator<_Tp> _Self; 190 typedef const _Fwd_list_node<_Tp> _Node; 191 typedef _Fwd_list_iterator<_Tp> iterator; 193 typedef _Tp value_type; 194 typedef const _Tp* pointer; 195 typedef const _Tp& reference; 301 typedef _Fwd_list_iterator<_Tp> iterator; 302 typedef _Fwd_list_const_iterator<_Tp> const_iterator; 303 typedef _Fwd_list_node<_Tp> _Node; 407 class forward_list : private _Fwd_list_base<_Tp, _Alloc> 410 typedef _Fwd_list_base<_Tp, _Alloc> _Base; 411 typedef _Fwd_list_node<_Tp> _Node; 419 typedef _Tp value_type; 425 typedef _Fwd_list_iterator<_Tp> iterator; 426 typedef _Fwd_list_const_iterator<_Tp> const_iterator; 498 forward_list(size_type __n, const _Tp& __value, 550 forward_list(std::initializer_list<_Tp> __il, 605 operator=(std::initializer_list<_Tp> __il) 643 assign(size_type __n, const _Tp& __val) 655 assign(std::initializer_list<_Tp> __il) 822 push_front(const _Tp& __val) 829 push_front(_Tp&& __val) 880 insert_after(const_iterator __pos, const _Tp& __val) 887 insert_after(const_iterator __pos, _Tp&& __val) 906 insert_after(const_iterator __pos, size_type __n, const _Tp& __val); 945 insert_after(const_iterator __pos, std::initializer_list<_Tp> __il) 1137 remove(const _Tp& __val); 1332 _M_assign_n(size_type __n, const _Tp& __val, true_type) 1352 _M_assign_n(size_type __n, const _Tp& __val, false_type)usr/include/c++/7.4.0/bits/move.h
72 constexpr _Tp&& 83 constexpr _Tp&&usr/include/c++/7.4.0/bits/stl_function.h
121 typedef _Arg1 first_argument_type; 124 typedef _Arg2 second_argument_type; 381 struct less : public binary_function<_Tp, _Tp, bool> 381 struct less : public binary_function<_Tp, _Tp, bool> 385 operator()(const _Tp& __x, const _Tp& __y) const 385 operator()(const _Tp& __x, const _Tp& __y) const 462 operator()(_Tp&& __t, _Up&& __u) const 462 operator()(_Tp&& __t, _Up&& __u) constusr/include/c++/7.4.0/ext/aligned_buffer.h
85 : std::aligned_storage<sizeof(_Tp), std::alignment_of<_Tp>::value> 85 : std::aligned_storage<sizeof(_Tp), std::alignment_of<_Tp>::value> 88 std::aligned_storage<sizeof(_Tp), std::alignment_of<_Tp>::value>::type 88 std::aligned_storage<sizeof(_Tp), std::alignment_of<_Tp>::value>::type 108 _Tp* 112 const _Tp*usr/include/c++/7.4.0/ext/new_allocator.h
63 typedef _Tp* pointer; 64 typedef const _Tp* const_pointer; 65 typedef _Tp& reference; 66 typedef const _Tp& const_reference; 67 typedef _Tp value_type; 135 construct(_Up* __p, _Args&&... __args) 136 { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } 140 destroy(_Up* __p) { __p->~_Up(); }usr/include/c++/7.4.0/type_traits
1633 { typedef _Tp type; };
utils/TableGen/AsmMatcherEmitter.cpp177 std::vector<ClassInfo*> SuperClasses; 231 bool isRelatedTo(const ClassInfo &RHS) const { 257 const ClassInfo *Root = this; 261 const ClassInfo *RHSRoot = &RHS; 269 bool isSubsetOf(const ClassInfo &RHS) const { 275 SmallVector<const ClassInfo *, 16> Worklist(SuperClasses.begin(), 277 SmallPtrSet<const ClassInfo *, 16> Visited; 282 for (auto *Super : CI->SuperClasses) 292 const ClassInfo *Root = this; 300 const ClassInfo *findRoot() const { 301 const ClassInfo *Root = this; 310 bool operator<(const ClassInfo &RHS) const { 384 ClassInfo *Class; 666 AsmOperands[i].Class->Kind == ClassInfo::Token) 696 ClassInfo *CI; 698 static OperandMatchEntry create(const MatchableInfo *mi, ClassInfo *ci, 720 std::forward_list<ClassInfo> Classes; 729 typedef std::map<Record*, ClassInfo*, LessRecordByID> RegisterClassesTy; 736 std::map<Record*, ClassInfo*> AsmOperandClasses; 739 std::map<Record*, ClassInfo*> RegisterClassClasses; 743 std::map<std::string, ClassInfo*> TokenClasses; 747 ClassInfo *getTokenClass(StringRef Token); 750 ClassInfo *getOperandClass(const CGIOperandList::OperandInfo &OI, 752 ClassInfo *getOperandClass(Record *Rec, int SubOpIdx); 1128 ClassInfo *AsmMatcherInfo::getTokenClass(StringRef Token) { 1129 ClassInfo *&Entry = TokenClasses[Token]; 1134 Entry->Kind = ClassInfo::Token; 1149 ClassInfo * 1158 ClassInfo * 1171 if (ClassInfo *CI = AsmOperandClasses[MatchClass]) 1180 if (ClassInfo *CI = RegisterClassClasses[ClassRec]) 1186 if (ClassInfo *CI = RegisterClassClasses[Rec]) 1195 if (ClassInfo *CI = AsmOperandClasses[MatchClass]) 1265 std::map<RegisterSet, ClassInfo*, LessRegisterSet> RegisterSetClasses; 1269 ClassInfo *CI = &Classes.front(); 1270 CI->Kind = ClassInfo::RegisterClass0 + Index; 1288 ClassInfo *CI = RegisterSetClasses[RS]; 1302 ClassInfo *CI = RegisterSetClasses[RegisterSet(RC.getOrder().begin(), 1334 ClassInfo *CI = RegisterClasses[Rec]; 1358 ClassInfo *CI = AsmOperandClasses[Rec]; 1359 CI->Kind = ClassInfo::UserClass0 + Index; 1369 ClassInfo *SC = AsmOperandClasses[DI->getDef()]; 1443 typedef std::map<ClassInfo *, unsigned, deref<std::less<>>> OpClassMaskTy; 1462 ClassInfo *CI = OCM.first; 1645 ClassInfo *FromClass = getTokenClass(Rec->getValueAsString("FromToken")); 1646 ClassInfo *ToClass = getTokenClass(Rec->getValueAsString("ToToken")); 2349 std::forward_list<ClassInfo> &Infos, 2358 ClassInfo::ClassInfoKind LastKind = ClassInfo::Token; 2358 ClassInfo::ClassInfoKind LastKind = ClassInfo::Token; 2360 for (const auto &CI : Infos) { 2361 if (LastKind == ClassInfo::Token && CI.Kind != ClassInfo::Token) { 2361 if (LastKind == ClassInfo::Token && CI.Kind != ClassInfo::Token) { 2363 } else if (LastKind < ClassInfo::UserClass0 && 2364 CI.Kind >= ClassInfo::UserClass0) { 2371 if (CI.Kind == ClassInfo::Token) { 2403 for (const auto &CI: Info.Classes) { 2429 for (const auto &CI: Info.Classes) { 2468 for (const auto &CI : Info.Classes) { 2516 std::forward_list<ClassInfo> &Infos, 2524 for (const auto &A : Infos) { 2528 for (const auto &B : Infos) { 2576 std::forward_list<ClassInfo> &Infos, 2580 for (const auto &CI : Infos) { 2581 if (CI.Kind == ClassInfo::Token) 2919 for (const auto &CI : Info.Classes) { 3098 static void emitMatchClassKindNames(std::forward_list<ClassInfo> &Infos, 3106 for (const auto &CI : Infos) {