|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
utils/TableGen/CodeGenDAGPatterns.h 42 class TreePattern;
utils/TableGen/DAGISelMatcher.h 28 class TreePattern;
References
include/llvm/ADT/DenseMapInfo.h 39 static inline T* getEmptyKey() {
41 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
45 static inline T* getTombstoneKey() {
47 Val <<= PointerLikeTypeTraits<T*>::NumLowBitsAvailable;
51 static unsigned getHashValue(const T *PtrVal) {
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
56 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
include/llvm/Support/PointerLikeTypeTraits.h 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 };
usr/include/c++/7.4.0/bits/unique_ptr.h 68 default_delete(const default_delete<_Up>&) noexcept { }
72 operator()(_Tp* __ptr) const
74 static_assert(!is_void<_Tp>::value,
76 static_assert(sizeof(_Tp)>0,
122 using type = _Up*;
137 using pointer = typename _Ptr<_Tp, _Dp>::type;
161 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
163 __uniq_ptr_impl<_Tp, _Dp> _M_t;
166 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
167 using element_type = _Tp;
252 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
297 __safe_conversion_up<_Up, _Ep>,
301 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
811 { typedef unique_ptr<_Tp> __single_object; };
823 inline typename _MakeUniq<_Tp>::__single_object
825 { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }
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
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1645 { typedef _Tp& type; };
1650 : public __add_lvalue_reference_helper<_Tp>
1983 { typedef _Up type; };
utils/TableGen/CodeGenDAGPatterns.cpp 851 TreePredicateFn::TreePredicateFn(TreePattern *N) : PatFragRec(N) {
1509 TreePattern &TP) const {
1619 TreePattern &TP) {
1649 bool TreePatternNode::ContainsUnresolvedType(TreePattern &TP) const {
1758 if (TreePattern *PFRec = CDP.getPatternFragmentIfRead(Operator)) {
1954 TreePatternNodePtr T, TreePattern &TP,
2033 TreePattern *Frag = TP.getDAGPatterns().getPatternFragment(Op);
2100 TreePattern &TP) {
2313 static void emitTooManyOperandsError(TreePattern &TP,
2321 static void emitTooFewOperandsError(TreePattern &TP,
2331 bool TreePatternNode::ApplyTypeConstraints(TreePattern &TP, bool NotRegisters) {
3111 TreePattern *P =
3112 (PatternFragments[Frag] = std::make_unique<TreePattern>(
3171 TreePattern &ThePat = *PatternFragments[Frag];
3210 TreePattern P(DefaultOps[i], DI, false, *this);
3237 static bool HandleUse(TreePattern &I, TreePatternNodePtr Pat,
3292 TreePattern &I, TreePatternNodePtr Pat,
3302 TreePattern SrcPattern(I.getRecord(), Pat, true, *this);
3360 TreePattern DestPattern(I.getRecord(), Dest, false, *this);
3607 TreePattern I(CGI.TheDef, Pat, true, *this);
3832 TreePattern Pattern(Instr, SrcPattern, true, *this);
3833 TreePattern Result(Instr, ResultPattern, false, *this);
3843 TreePattern *PatternTop) {
3874 void CodeGenDAGPatterns::AddPatternToMatch(TreePattern *Pattern,
4052 static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
4098 TreePattern &Pattern, TreePattern &Result,
4098 TreePattern &Pattern, TreePattern &Result,
4165 TreePattern Temp(Result.getRecord(), DstShared, false, *this);
4201 TreePattern Pattern(CurPattern, Tree, true, *this);
4207 TreePattern Result(CurPattern, LI, false, *this);
utils/TableGen/CodeGenDAGPatterns.h 263 TypeInfer(TreePattern &T) : TP(T), ForceMode(0) {}
359 TreePattern &TP;
420 TreePattern &TP) const;
487 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const;
496 TreePattern *PatFragRec;
499 TreePredicateFn(TreePattern *N);
502 TreePattern *getOrigPatFragRecord() const { return PatFragRec; }
715 bool isTypeCompletelyUnknown(unsigned ResNo, TreePattern &TP) const {
822 TreePattern &TP,
828 bool ApplyTypeConstraints(TreePattern &TP, bool NotRegisters);
835 TreePattern &TP);
837 TreePattern &TP);
839 TreePattern &TP);
844 bool UpdateNodeTypeFromInst(unsigned ResNo, Record *Operand, TreePattern &TP);
848 bool ContainsUnresolvedType(TreePattern &TP) const;
986 TreePattern &TP) {
994 TreePattern &TP) {
1002 TreePattern &TP) {
1153 std::map<Record *, std::unique_ptr<TreePattern>, LessRecordByID>
1169 using PatternRewriterFn = std::function<void (TreePattern *)>;
1241 TreePattern *getPatternFragment(Record *R) const {
1246 TreePattern *getPatternFragmentIfRead(Record *R) const {
1253 typedef std::map<Record *, std::unique_ptr<TreePattern>,
1312 TreePattern &Pattern, TreePattern &Result,
1312 TreePattern &Pattern, TreePattern &Result,
1314 void AddPatternToMatch(TreePattern *Pattern, PatternToMatch &&PTM);
1316 TreePattern &I, TreePatternNodePtr Pat,
1325 TreePattern &TP) const {
utils/TableGen/DAGISelMatcher.h 421 TreePattern *Pred;
utils/TableGen/DAGISelMatcherEmitter.cpp 50 DenseMap<TreePattern *, unsigned> NodePredicateMap;
56 StringMap<TinyPtrVector<TreePattern *>> NodePredicatesByCodeToRun;
102 TreePattern *TP = Pred.getOrigPatFragRecord();
105 TinyPtrVector<TreePattern *> &SameCodePreds =
848 for (auto *SimilarPred :
utils/TableGen/DAGISelMatcherGen.cpp 176 TreePattern &TP = *CGP.pf_begin()->second;
539 TreePattern *TP = Pred.Fn.getOrigPatFragRecord();
utils/TableGen/FastISelEmitter.cpp 58 DenseMap<TreePattern *, unsigned> ImmIDs;
172 TreePattern *TP = PredFn.getOrigPatFragRecord();