|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
include/llvm/Analysis/RegionInfo.h 70 class RegionNode;
tools/polly/include/polly/Support/ScopHelper.h 30 class RegionNode;
References
include/llvm/Analysis/RegionInfo.h 90 using RegionNodeT = RegionNode;
899 bool operator==(const RegionNode &RN) const {
include/llvm/Analysis/RegionIterator.h 320 : public GraphTraits<FlatIt<RegionNode*>> {
include/llvm/Support/Casting.h 66 static inline bool doit(const From &) { return true; }
104 static inline bool doit(const From *Val) {
106 return isa_impl<To, From>::doit(*Val);
106 return isa_impl<To, From>::doit(*Val);
122 return isa_impl_wrap<To, SimpleFrom,
132 return isa_impl_cl<To,FromTy>::doit(Val);
142 return isa_impl_wrap<X, const Y,
172 using ret_type = To *; // Pointer arg case, return Ty*
176 using ret_type = const To *; // Constant pointer arg case, return const Ty*
198 using ret_type = typename cast_retty<To, SimpleFrom>::ret_type;
204 using ret_type = typename cast_retty_impl<To,FromTy>::ret_type;
210 To, From, typename simplify_type<From>::SimpleType>::ret_type;
227 static typename cast_retty<To, FromTy>::ret_type doit(const FromTy &Val) {
228 typename cast_retty<To, FromTy>::ret_type Res2
256 inline typename cast_retty<X, Y>::ret_type cast(Y &Val) {
263 inline typename cast_retty<X, Y *>::ret_type cast(Y *Val) {
263 inline typename cast_retty<X, Y *>::ret_type cast(Y *Val) {
263 inline typename cast_retty<X, Y *>::ret_type cast(Y *Val) {
265 return cast_convert_val<X, Y*,
265 return cast_convert_val<X, Y*,
266 typename simplify_type<Y*>::SimpleType>::doit(Val);
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 };
91 typedef PointerLikeTypeTraits<T *> NonConst;
93 static inline const void *getAsVoidPointer(const T *P) {
96 static inline const T *getFromVoidPointer(const void *P) {
lib/Analysis/RegionPrinter.cpp 43 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
43 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
61 struct DOTGraphTraits<RegionInfo *> : public DOTGraphTraits<RegionNode *> {
68 std::string getNodeLabel(RegionNode *Node, RegionInfo *G) {
73 std::string getEdgeAttributes(RegionNode *srcNode,
76 RegionNode *destNode = *CI;
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 817 for (RegionNode *E : R->elements()) {
lib/Transforms/Scalar/StructurizeCFG.cpp 74 using RNVector = SmallVector<RegionNode *, 8>;
195 SmallVector<RegionNode *, 8> Order;
208 RegionNode *PrevNode;
212 Loop *getAdjustedLoop(RegionNode *RN);
213 unsigned getAdjustedLoopDepth(RegionNode *RN);
215 void analyzeLoops(RegionNode *N);
221 void gatherPredicates(RegionNode *N);
235 void changeExit(RegionNode *Node, BasicBlock *NewExit,
246 bool dominatesPredicates(BasicBlock *BB, RegionNode *Node);
248 bool isPredictableTrue(RegionNode *Node);
313 Loop *StructurizeCFG::getAdjustedLoop(RegionNode *RN) {
323 unsigned StructurizeCFG::getAdjustedLoopDepth(RegionNode *RN) {
340 for (RegionNode *RN : RPOT) {
348 RegionNode *RN = cast<RegionNode>(*I);
348 RegionNode *RN = cast<RegionNode>(*I);
361 if (getAdjustedLoop(cast<RegionNode>(*LoopI)) == CurrentLoop) {
384 void StructurizeCFG::analyzeLoops(RegionNode *N) {
449 void StructurizeCFG::gatherPredicates(RegionNode *N) {
518 for (RegionNode *RN : reverse(Order)) {
676 void StructurizeCFG::changeExit(RegionNode *Node, BasicBlock *NewExit,
771 bool StructurizeCFG::dominatesPredicates(BasicBlock *BB, RegionNode *Node) {
779 bool StructurizeCFG::isPredictableTrue(RegionNode *Node) {
805 RegionNode *Node = Order.pop_back_val();
840 RegionNode *Node = Order.back();
1021 for (RegionNode *E : R->elements()) {
tools/polly/include/polly/ScopBuilder.h 811 void buildSchedule(RegionNode *RN, LoopStackTy &LoopStack);
tools/polly/include/polly/ScopInfo.h 2431 ArrayRef<ScopStmt *> getStmtListFor(RegionNode *RN) const;
tools/polly/include/polly/Support/ScopHelper.h 399 unsigned getNumBlocksInRegionNode(llvm::RegionNode *RN);
402 llvm::Loop *getRegionNodeLoop(llvm::RegionNode *RN, llvm::LoopInfo &LI);
tools/polly/lib/Analysis/ScopBuilder.cpp 162 static inline BasicBlock *getRegionNodeBasicBlock(RegionNode *RN) {
169 getRegionNodeSuccessor(RegionNode *RN, Instruction *TI, unsigned idx) {
177 static bool containsErrorBlock(RegionNode *RN, const Region &R, LoopInfo &LI,
595 for (auto *RN : RTraversal) {
880 for (auto *RN : RTraversal) {
996 for (auto *RN : RTraversal) {
1208 std::deque<RegionNode *> WorkList(RTraversal.begin(), RTraversal.end());
1209 std::deque<RegionNode *> DelayList;
1220 RegionNode *RN;
1248 void ScopBuilder::buildSchedule(RegionNode *RN, LoopStackTy &LoopStack) {
tools/polly/lib/Analysis/ScopGraphPrinter.cpp 66 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
66 std::string getNodeLabel(RegionNode *Node, RegionNode *Graph) {
84 : public DOTGraphTraits<RegionNode *> {
91 std::string getEdgeAttributes(RegionNode *srcNode,
94 RegionNode *destNode = *CI;
119 std::string getNodeLabel(RegionNode *Node, ScopDetectionWrapperPass *P) {
tools/polly/lib/Analysis/ScopInfo.cpp 2452 ArrayRef<ScopStmt *> Scop::getStmtListFor(RegionNode *RN) const {
tools/polly/lib/Support/ScopHelper.cpp 495 unsigned polly::getNumBlocksInRegionNode(RegionNode *RN) {
503 Loop *polly::getRegionNodeLoop(RegionNode *RN, LoopInfo &LI) {
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
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; };