|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
utils/TableGen/CodeGenDAGPatterns.h 43 class TreePatternNode;
References
include/llvm/Support/ScopedPrinter.h 61 template <class T> const std::string to_string(const T &Value) {
usr/include/c++/7.4.0/bits/alloc_traits.h 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;
137 allocator(const allocator<_Tp1>&) throw() { }
usr/include/c++/7.4.0/bits/shared_ptr.h 93 class shared_ptr : public __shared_ptr<_Tp>
107 using element_type = typename __shared_ptr<_Tp>::element_type;
236 shared_ptr(const shared_ptr<_Yp>& __r) noexcept
253 shared_ptr(shared_ptr<_Yp>&& __r) noexcept
299 _Assignable<const shared_ptr<_Yp>&>
300 operator=(const shared_ptr<_Yp>& __r) noexcept
324 _Assignable<shared_ptr<_Yp>>
325 operator=(shared_ptr<_Yp>&& __r) noexcept
352 shared_ptr(const weak_ptr<_Tp>& __r, std::nothrow_t)
687 inline shared_ptr<_Tp>
702 inline shared_ptr<_Tp>
705 typedef typename std::remove_const<_Tp>::type _Tp_nc;
706 return std::allocate_shared<_Tp>(std::allocator<_Tp_nc>(),
usr/include/c++/7.4.0/bits/shared_ptr_base.h 882 : is_convertible<_Yp*, _Tp*>::type
882 : is_convertible<_Yp*, _Tp*>::type
956 using element_type = _Tp;
1035 : public __shared_ptr_access<_Tp, _Lp>
1038 using element_type = typename remove_extent<_Tp>::type;
1126 __shared_ptr(const __shared_ptr<_Yp, _Lp>& __r) noexcept
1138 __shared_ptr(__shared_ptr<_Yp, _Lp>&& __r) noexcept
1192 _Assignable<_Yp>
1193 operator=(const __shared_ptr<_Yp, _Lp>& __r) noexcept
1218 _Assignable<_Yp>
1219 operator=(__shared_ptr<_Yp, _Lp>&& __r) noexcept
1272 swap(__shared_ptr<_Tp, _Lp>& __other) noexcept
1321 rebind_traits<typename std::remove_cv<_Tp>::type> __traits;
1344 __shared_ptr(const __weak_ptr<_Tp, _Lp>& __r, std::nothrow_t)
1377 typename enable_if<!__has_esft_base<_Yp2>::value>::type
1378 _M_enable_shared_from_this_with(_Yp*) noexcept
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;
84 new_allocator(const new_allocator<_Tp1>&) _GLIBCXX_USE_NOEXCEPT { }
111 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
130 { return size_t(-1) / sizeof(_Tp); }
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 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1942 { typedef _Tp type; };
utils/TableGen/CodeGenDAGPatterns.cpp 1327 static bool isImmAllOnesAllZerosMatch(const TreePatternNode *P) {
1341 static unsigned getPatternSize(const TreePatternNode *P,
1362 const TreePatternNode *Child = P->getChild(i);
1481 static TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
1481 static TreePatternNode *getOperandNum(unsigned OpNo, TreePatternNode *N,
1507 bool SDTypeConstraint::ApplyTypeConstraint(TreePatternNode *N,
1514 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo);
1535 TreePatternNode *OtherNode =
1556 TreePatternNode *OtherNode =
1564 TreePatternNode *BigOperand =
1572 TreePatternNode *VecOperand =
1582 TreePatternNode *BigVecOperand =
1596 TreePatternNode *OtherNode =
1604 TreePatternNode *OtherNode =
1862 bool TreePatternNode::isIsomorphicTo(const TreePatternNode *N,
1894 New = std::make_shared<TreePatternNode>(getLeafValue(), getNumTypes());
1900 New = std::make_shared<TreePatternNode>(getOperator(), std::move(CChildren),
1928 TreePatternNode *Child = getChild(i);
1999 TreePatternNodePtr R = std::make_shared<TreePatternNode>(
2302 static bool isOperandClass(const TreePatternNode *N, StringRef Class) {
2484 TreePatternNode *SubIdxChild = getChild(I + 1);
2524 TreePatternNode *Child = getChild(ChildNo++);
2599 static bool OnlyOnRHSOfCommutative(TreePatternNode *N) {
2690 void TreePattern::ComputeNamedNodes(TreePatternNode *N) {
2713 TreePatternNodePtr Res = std::make_shared<TreePatternNode>(DI, 1);
2728 TreePatternNodePtr Res = std::make_shared<TreePatternNode>(TheInit, 1);
2739 return std::make_shared<TreePatternNode>(TheInit, 1);
2843 std::make_shared<TreePatternNode>(IntInit::get(IID), 1));
2868 std::make_shared<TreePatternNode>(Operator, std::move(Children),
2916 InferAllTypes(const StringMap<SmallVector<TreePatternNode*,1> > *InNamedTypes) {
2930 SmallVectorImpl<TreePatternNode*> &Nodes = Entry.second;
2941 const SmallVectorImpl<TreePatternNode*> &InNodes =
2945 for (TreePatternNode *Node : Nodes) {
2970 TreePatternNode *N1 = Nodes[i], *N2 = Nodes[i+1];
3317 TreePatternNode *Dest = Pat->getChild(i);
3414 const TreePatternNode *N = Pat.getSrcPattern();
3421 bool IsNodeBitcast(const TreePatternNode *N) const {
3437 void AnalyzeNode(const TreePatternNode *N) {
3573 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) {
3737 OpNode = std::make_shared<TreePatternNode>(Xform, std::move(Children),
3748 TreePatternNodePtr ResultPattern = std::make_shared<TreePatternNode>(
3839 typedef std::pair<TreePatternNode *, unsigned> NameRecord;
3841 static void FindNames(TreePatternNode *P,
4052 static bool ForceArbitraryInstResultType(TreePatternNode *N, TreePattern &TP) {
4085 return std::make_shared<TreePatternNode>(Xform, std::move(Children),
4226 static void collectModes(std::set<unsigned> &Modes, const TreePatternNode *N) {
4316 static void FindDepVarsOf(TreePatternNode *N, DepVarMap &DepMap) {
4327 static void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) {
4382 TreePatternNodePtr R = std::make_shared<TreePatternNode>(
4542 TreePatternNode *Child = N->getChild(i);
utils/TableGen/CodeGenDAGPatterns.h 48 using TreePatternNodePtr = std::shared_ptr<TreePatternNode>;
419 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
487 bool ApplyTypeConstraints(TreePatternNode *N, TreePattern &TP) const;
727 TreePatternNode *getChild(unsigned N) const { return Children[N].get(); }
734 bool hasChild(const TreePatternNode *N) const {
810 bool isIsomorphicTo(const TreePatternNode *N,
855 inline raw_ostream &operator<<(raw_ostream &OS, const TreePatternNode &TPN) {
872 StringMap<SmallVector<TreePatternNode *, 1>> NamedNodes;
925 const StringMap<SmallVector<TreePatternNode *, 1>> &getNamedNodesMap() {
960 const StringMap<SmallVector<TreePatternNode *, 1>> *NamedTypes = nullptr);
980 void ComputeNamedNodes(TreePatternNode *N);
1128 TreePatternNode *getSrcPattern() const { return SrcPattern.get(); }
1130 TreePatternNode *getDstPattern() const { return DstPattern.get(); }
1324 inline bool SDNodeInfo::ApplyTypeConstraints(TreePatternNode *N,
utils/TableGen/DAGISelEmitter.cpp 40 static unsigned getResultPatternCost(TreePatternNode *P,
59 static unsigned getResultPatternSize(TreePatternNode *P,
82 const TreePatternNode *LT = LHS->getSrcPattern();
83 const TreePatternNode *RT = RHS->getSrcPattern();
utils/TableGen/DAGISelMatcherEmitter.cpp 160 static std::string GetPatFromTreePatternNode(const TreePatternNode *N) {
utils/TableGen/DAGISelMatcherGen.cpp 86 SmallVector<std::pair<const TreePatternNode*,
112 void EmitMatchCode(const TreePatternNode *N, TreePatternNode *NodeNoTypes,
112 void EmitMatchCode(const TreePatternNode *N, TreePatternNode *NodeNoTypes,
114 void EmitLeafMatchCode(const TreePatternNode *N);
115 void EmitOperatorMatchCode(const TreePatternNode *N,
116 TreePatternNode *NodeNoTypes,
132 void EmitResultOperand(const TreePatternNode *N,
134 void EmitResultOfNamedOperand(const TreePatternNode *N,
136 void EmitResultLeafAsOperand(const TreePatternNode *N,
138 void EmitResultInstructionAsOperand(const TreePatternNode *N,
140 void EmitResultSDNodeXFormAsOperand(const TreePatternNode *N,
202 void MatcherGen::EmitLeafMatchCode(const TreePatternNode *N) {
305 void MatcherGen::EmitOperatorMatchCode(const TreePatternNode *N,
306 TreePatternNode *NodeNoTypes,
411 const TreePatternNode *Root = Pattern.getSrcPattern();
499 void MatcherGen::EmitMatchCode(const TreePatternNode *N,
500 TreePatternNode *NodeNoTypes,
636 void MatcherGen::EmitResultOfNamedOperand(const TreePatternNode *N,
667 void MatcherGen::EmitResultLeafAsOperand(const TreePatternNode *N,
730 mayInstNodeLoadOrStore(const TreePatternNode *N,
739 numNodesThatMayLoadOrStore(const TreePatternNode *N,
759 EmitResultInstructionAsOperand(const TreePatternNode *N,
771 const TreePatternNode *SrcPat = Pattern.getSrcPattern();
840 const TreePatternNode *Child = N->getChild(ChildNo);
973 EmitResultSDNodeXFormAsOperand(const TreePatternNode *N,
993 void MatcherGen::EmitResultOperand(const TreePatternNode *N,
1035 const TreePatternNode *DstPat = Pattern.getDstPattern();
utils/TableGen/FastISelEmitter.cpp 187 bool initialize(TreePatternNode *InstPatNode, const CodeGenTarget &Target,
207 TreePatternNode *Op = InstPatNode->getChild(i);
429 static std::string PhyRegForNode(TreePatternNode *Op,
457 TreePatternNode *Dst = Pattern.getDstPattern();
476 TreePatternNode *ChildOp = Dst->getChild(i);
513 TreePatternNode *InstPatNode = Pattern.getSrcPattern();
utils/TableGen/GlobalISelEmitter.cpp 199 static std::string explainPredicates(const TreePatternNode *N) {
303 static Error isTrivialOperatorNode(const TreePatternNode *N) {
3273 const TreePatternNode *N) const;
3279 const TreePatternNode *Src, unsigned &TempOpIdx);
3283 const TreePatternNode *SrcChild,
3289 const TreePatternNode *Src, const TreePatternNode *Dst);
3289 const TreePatternNode *Src, const TreePatternNode *Dst);
3291 action_iterator InsertPt, RuleMatcher &M, const TreePatternNode *Dst,
3295 const TreePatternNode *Dst);
3301 const llvm::TreePatternNode *Dst);
3305 TreePatternNode *DstChild);
3337 TreePatternNode *SuperRegNode,
3338 TreePatternNode *SubRegIdxNode);
3340 inferSubRegIndexForNode(TreePatternNode *SubRegIdxNode);
3346 TreePatternNode *SubRegIdxNode);
3350 getRegClassFromLeaf(TreePatternNode *Leaf);
3355 inferRegClassFromPattern(TreePatternNode *N);
3424 GlobalISelEmitter::getEquivNode(Record &Equiv, const TreePatternNode *N) const {
3466 const TreePatternNode *Src, unsigned &TempOpIdx) {
3694 TreePatternNode *SrcChild = Src->getChild(NumChildren - 1);
3723 TreePatternNode *SrcChild = Src->getChild(i);
3771 static StringRef getSrcChildName(const TreePatternNode *SrcChild,
3789 const TreePatternNode *SrcChild,
3840 auto *SubOperand = SrcChild->getChild(i);
3931 TreePatternNode *DstChild) {
4075 RuleMatcher &M, InstructionMatcher &InsnMatcher, const TreePatternNode *Src,
4076 const TreePatternNode *Dst) {
4106 const action_iterator InsertPt, RuleMatcher &M, const TreePatternNode *Dst,
4204 action_iterator InsertPt, RuleMatcher &M, const TreePatternNode *Dst) {
4235 const llvm::TreePatternNode *Dst) {
4286 TreePatternNode *ValChild = Dst->getChild(I);
4287 TreePatternNode *SubRegChild = Dst->getChild(I + 1);
4407 GlobalISelEmitter::getRegClassFromLeaf(TreePatternNode *Leaf) {
4420 GlobalISelEmitter::inferRegClassFromPattern(TreePatternNode *N) {
4452 TreePatternNode *RCChild = N->getChild(IsRegSequence ? 0 : 1);
4478 TreePatternNode *SubRegIdxNode) {
4501 const TypeSetByHwMode &Ty, TreePatternNode *SuperRegNode,
4502 TreePatternNode *SubRegIdxNode) {
4516 GlobalISelEmitter::inferSubRegIndexForNode(TreePatternNode *SubRegIdxNode) {
4539 TreePatternNode *Src = P.getSrcPattern();
4540 TreePatternNode *Dst = P.getDstPattern();