35 #ifndef LLVM_CLANG_ASTMATCHERS_ASTMATCHERSINTERNAL_H
36 #define LLVM_CLANG_ASTMATCHERS_ASTMATCHERSINTERNAL_H
49 #include "llvm/ADT/ArrayRef.h"
50 #include "llvm/ADT/Optional.h"
51 #include "llvm/ADT/SmallVector.h"
52 #include "llvm/Support/ManagedStatic.h"
58 namespace ast_matchers {
69 template <
typename ResultT,
typename ArgT,
70 ResultT (*Func)(ArrayRef<const ArgT *>)>
71 struct VariadicFunction {
72 ResultT operator()()
const {
return Func(None); }
74 template <
typename... ArgsT>
75 ResultT operator()(
const ArgT &Arg1,
const ArgsT &... Args)
const {
76 return Execute(Arg1, static_cast<const ArgT &>(Args)...);
81 ResultT operator()(ArrayRef<ArgT> Args)
const {
82 SmallVector<const ArgT*, 8> InnerArgs;
83 for (
const ArgT &Arg : Args)
84 InnerArgs.push_back(&Arg);
85 return Func(InnerArgs);
91 template <
typename... ArgsT> ResultT Execute(
const ArgsT &... Args)
const {
92 const ArgT *
const ArgsArray[] = {&Args...};
93 return Func(ArrayRef<const ArgT *>(ArgsArray,
sizeof...(ArgsT)));
102 return Node.getType();
106 return Node.getUnderlyingType();
111 inline const FunctionProtoType *
112 getFunctionProtoType(
const FunctionProtoType &Node) {
116 inline const FunctionProtoType *getFunctionProtoType(
const FunctionDecl &Node) {
117 return Node.getType()->getAs<FunctionProtoType>();
121 class BoundNodesMap {
126 void addNode(StringRef
ID,
const ast_type_traits::DynTypedNode& DynNode) {
127 NodeMap[
ID] = DynNode;
134 template <
typename T>
135 const T *getNodeAs(StringRef
ID)
const {
136 IDToNodeMap::const_iterator It = NodeMap.find(ID);
137 if (It == NodeMap.end()) {
140 return It->second.get<T>();
143 ast_type_traits::DynTypedNode getNode(StringRef ID)
const {
144 IDToNodeMap::const_iterator It = NodeMap.find(ID);
145 if (It == NodeMap.end()) {
146 return ast_type_traits::DynTypedNode();
152 bool operator<(
const BoundNodesMap &Other)
const {
153 return NodeMap < Other.NodeMap;
161 typedef std::map<std::string, ast_type_traits::DynTypedNode> IDToNodeMap;
163 const IDToNodeMap &getMap()
const {
169 bool isComparable()
const {
170 for (
const auto &IDAndNode : NodeMap) {
171 if (!IDAndNode.second.getMemoizationData())
185 class BoundNodesTreeBuilder {
191 virtual ~Visitor() {}
196 virtual void visitMatch(
const BoundNodes& BoundNodesView) = 0;
200 void setBinding(StringRef Id,
const ast_type_traits::DynTypedNode &DynNode) {
201 if (Bindings.empty())
202 Bindings.emplace_back();
203 for (BoundNodesMap &Binding : Bindings)
204 Binding.addNode(Id, DynNode);
208 void addMatch(
const BoundNodesTreeBuilder &Bindings);
213 void visitMatches(Visitor* ResultVisitor);
215 template <
typename ExcludePredicate>
216 bool removeBindings(
const ExcludePredicate &Predicate) {
217 Bindings.erase(std::remove_if(Bindings.begin(), Bindings.end(), Predicate),
219 return !Bindings.empty();
223 bool operator<(
const BoundNodesTreeBuilder &Other)
const {
224 return Bindings < Other.Bindings;
229 bool isComparable()
const {
230 for (
const BoundNodesMap &NodesMap : Bindings) {
231 if (!NodesMap.isComparable())
238 SmallVector<BoundNodesMap, 16> Bindings;
241 class ASTMatchFinder;
248 class DynMatcherInterface
249 :
public llvm::ThreadSafeRefCountedBase<DynMatcherInterface> {
251 virtual ~DynMatcherInterface() {}
257 virtual bool dynMatches(
const ast_type_traits::DynTypedNode &DynNode,
259 BoundNodesTreeBuilder *
Builder)
const = 0;
269 template <
typename T>
270 class MatcherInterface :
public DynMatcherInterface {
276 virtual bool matches(
const T &Node,
278 BoundNodesTreeBuilder *
Builder)
const = 0;
280 bool dynMatches(
const ast_type_traits::DynTypedNode &DynNode,
282 BoundNodesTreeBuilder *
Builder)
const override {
283 return matches(DynNode.getUnchecked<T>(), Finder, Builder);
289 template <
typename T>
290 class SingleNodeMatcherInterface :
public MatcherInterface<T> {
295 virtual bool matchesNode(
const T &Node)
const = 0;
301 BoundNodesTreeBuilder * )
const override {
302 return matchesNode(Node);
306 template <
typename>
class Matcher;
315 class DynTypedMatcher {
318 template <
typename T>
319 DynTypedMatcher(MatcherInterface<T> *Implementation)
321 SupportedKind(ast_type_traits::ASTNodeKind::getFromNodeKind<T>()),
322 RestrictKind(SupportedKind), Implementation(Implementation) {}
325 enum VariadicOperator {
340 static DynTypedMatcher
341 constructVariadic(VariadicOperator Op,
342 ast_type_traits::ASTNodeKind SupportedKind,
348 static DynTypedMatcher trueMatcher(ast_type_traits::ASTNodeKind NodeKind);
350 void setAllowBind(
bool AB) { AllowBind = AB; }
355 bool canMatchNodesOfKind(ast_type_traits::ASTNodeKind
Kind)
const;
359 DynTypedMatcher dynCastTo(
const ast_type_traits::ASTNodeKind
Kind)
const;
362 bool matches(
const ast_type_traits::DynTypedNode &DynNode,
363 ASTMatchFinder *
Finder, BoundNodesTreeBuilder *
Builder)
const;
369 bool matchesNoKindCheck(
const ast_type_traits::DynTypedNode &DynNode,
371 BoundNodesTreeBuilder *
Builder)
const;
385 typedef std::pair<ast_type_traits::ASTNodeKind, uint64_t> MatcherIDType;
386 MatcherIDType getID()
const {
389 return std::make_pair(RestrictKind,
390 reinterpret_cast<uint64_t>(Implementation.get()));
397 ast_type_traits::ASTNodeKind getSupportedKind()
const {
398 return SupportedKind;
406 template <
typename T>
bool canConvertTo()
const {
407 return canConvertTo(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
409 bool canConvertTo(ast_type_traits::ASTNodeKind To)
const;
416 template <
typename T> Matcher<T> convertTo()
const {
417 assert(canConvertTo<T>());
418 return unconditionalConvertTo<T>();
425 template <
typename T> Matcher<T> unconditionalConvertTo()
const;
428 DynTypedMatcher(ast_type_traits::ASTNodeKind SupportedKind,
429 ast_type_traits::ASTNodeKind RestrictKind,
430 IntrusiveRefCntPtr<DynMatcherInterface> Implementation)
432 SupportedKind(SupportedKind),
433 RestrictKind(RestrictKind),
434 Implementation(std::move(Implementation)) {}
437 ast_type_traits::ASTNodeKind SupportedKind;
442 ast_type_traits::ASTNodeKind RestrictKind;
443 IntrusiveRefCntPtr<DynMatcherInterface> Implementation;
450 template <
typename T>
451 class WrapperMatcherInterface :
public MatcherInterface<T> {
453 explicit WrapperMatcherInterface(DynTypedMatcher &&
InnerMatcher)
467 template <
typename T>
471 explicit Matcher(MatcherInterface<T> *Implementation)
472 : Implementation(Implementation) {}
477 template <
typename From>
478 Matcher(
const Matcher<From> &Other,
479 typename std::enable_if<std::is_base_of<From, T>::value &&
480 !std::is_same<From, T>::value>::
type * =
nullptr)
481 : Implementation(restrictMatcher(Other.Implementation)) {
482 assert(Implementation.getSupportedKind().isSame(
483 ast_type_traits::ASTNodeKind::getFromNodeKind<T>()));
489 template <
typename TypeT>
490 Matcher(
const Matcher<TypeT> &Other,
491 typename std::enable_if<
492 std::is_same<T, QualType>::value &&
493 std::is_same<TypeT, Type>::value>::
type* =
nullptr)
494 : Implementation(new TypeToQualType<TypeT>(Other)) {}
499 template <
typename To>
500 Matcher<To> dynCastTo()
const {
501 static_assert(std::is_base_of<To, T>::value,
"Invalid dynCast call.");
502 return Matcher<To>(Implementation);
508 BoundNodesTreeBuilder *
Builder)
const {
514 DynTypedMatcher::MatcherIDType getID()
const {
515 return Implementation.getID();
522 operator DynTypedMatcher()
const {
return Implementation; }
530 template <
typename TypeT>
531 class TypeToQualType :
public WrapperMatcherInterface<QualType> {
534 : TypeToQualType::WrapperMatcherInterface(InnerMatcher) {}
536 bool matches(
const QualType &Node, ASTMatchFinder *Finder,
537 BoundNodesTreeBuilder *Builder)
const override {
547 template <
typename U>
friend class Matcher;
549 friend class DynTypedMatcher;
551 static DynTypedMatcher restrictMatcher(
const DynTypedMatcher &Other) {
552 return Other.dynCastTo(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
555 explicit Matcher(
const DynTypedMatcher &Implementation)
556 : Implementation(restrictMatcher(Implementation)) {
557 assert(this->Implementation.getSupportedKind()
558 .isSame(ast_type_traits::ASTNodeKind::getFromNodeKind<T>()));
561 DynTypedMatcher Implementation;
566 template <
typename T>
567 inline Matcher<T> makeMatcher(MatcherInterface<T> *Implementation) {
568 return Matcher<T>(Implementation);
576 inline Matcher<QualType> DynTypedMatcher::convertTo<QualType>()
const {
577 assert(canConvertTo<QualType>());
578 const ast_type_traits::ASTNodeKind SourceKind = getSupportedKind();
579 if (SourceKind.isSame(
580 ast_type_traits::ASTNodeKind::getFromNodeKind<Type>())) {
582 return unconditionalConvertTo<Type>();
584 return unconditionalConvertTo<QualType>();
588 template <
typename MatcherT,
typename IteratorT>
589 bool matchesFirstInRange(
const MatcherT &
Matcher, IteratorT Start,
590 IteratorT
End, ASTMatchFinder *Finder,
591 BoundNodesTreeBuilder *Builder) {
592 for (IteratorT
I = Start;
I !=
End; ++
I) {
593 BoundNodesTreeBuilder
Result(*Builder);
594 if (Matcher.matches(*
I, Finder, &Result)) {
595 *Builder = std::move(Result);
604 template <
typename MatcherT,
typename IteratorT>
605 bool matchesFirstInPointerRange(
const MatcherT &Matcher, IteratorT Start,
606 IteratorT End, ASTMatchFinder *Finder,
607 BoundNodesTreeBuilder *Builder) {
608 for (IteratorT
I = Start;
I !=
End; ++
I) {
609 BoundNodesTreeBuilder
Result(*Builder);
610 if (Matcher.matches(**
I, Finder, &Result)) {
611 *Builder = std::move(Result);
619 template <
typename Ty>
624 template <
typename Inner>
625 static yes& test(Inner *
I, decltype(I->getDecl()) * =
nullptr);
628 static no& test(...);
631 static const bool value =
sizeof(test<Ty>(
nullptr)) ==
sizeof(yes);
638 template <
typename T,
typename ArgT>
639 class HasOverloadedOperatorNameMatcher :
public SingleNodeMatcherInterface<T> {
640 static_assert(std::is_same<T, CXXOperatorCallExpr>::value ||
641 std::is_base_of<FunctionDecl, T>::value,
642 "unsupported class for matcher");
643 static_assert(std::is_same<ArgT, StringRef>::value,
644 "argument type must be StringRef");
647 explicit HasOverloadedOperatorNameMatcher(
const StringRef
Name)
648 : SingleNodeMatcherInterface<T>(), Name(Name) {}
650 bool matchesNode(
const T &Node)
const override {
651 return matchesSpecialized(Node);
659 bool matchesSpecialized(
const CXXOperatorCallExpr &Node)
const {
665 bool matchesSpecialized(
const FunctionDecl &Node)
const {
666 return Node.isOverloadedOperator() &&
676 class HasNameMatcher :
public SingleNodeMatcherInterface<NamedDecl> {
678 explicit HasNameMatcher(std::vector<std::string>
Names);
680 bool matchesNode(
const NamedDecl &Node)
const override;
687 bool matchesNodeUnqualified(
const NamedDecl &Node)
const;
695 bool matchesNodeFullFast(
const NamedDecl &Node)
const;
702 bool matchesNodeFullSlow(
const NamedDecl &Node)
const;
704 const bool UseUnqualifiedMatch;
705 const std::vector<std::string>
Names;
710 Matcher<NamedDecl>
hasAnyNameFunc(ArrayRef<const StringRef *> NameRefs);
716 template <
typename T,
typename DeclMatcherT>
717 class HasDeclarationMatcher :
public WrapperMatcherInterface<T> {
718 static_assert(std::is_same<DeclMatcherT, Matcher<Decl>>::value,
719 "instantiated with wrong types");
722 explicit HasDeclarationMatcher(
const Matcher<Decl> &
InnerMatcher)
723 : HasDeclarationMatcher::WrapperMatcherInterface(InnerMatcher) {}
725 bool matches(
const T &Node, ASTMatchFinder *Finder,
726 BoundNodesTreeBuilder *Builder)
const override {
727 return matchesSpecialized(Node, Finder, Builder);
733 template <
typename U>
734 bool matchesSpecialized(
735 const U &Node, ASTMatchFinder *Finder, BoundNodesTreeBuilder *Builder,
736 typename std::enable_if<has_getDecl<U>::value,
int>::
type = 0)
const {
742 bool matchesSpecialized(
const QualType &Node, ASTMatchFinder *Finder,
743 BoundNodesTreeBuilder *Builder)
const {
747 if (
auto *TD = Node->getAsTagDecl())
748 return matchesDecl(TD, Finder, Builder);
749 else if (
auto *TT = Node->getAs<TypedefType>())
755 else if (
auto *TTP = dyn_cast<TemplateTypeParmType>(Node.getTypePtr()))
757 else if (
auto *OCIT = Node->getAs<ObjCInterfaceType>())
759 else if (
auto *UUT = Node->getAs<UnresolvedUsingType>())
761 else if (
auto *ICNT = Node->getAs<InjectedClassNameType>())
769 ASTMatchFinder *Finder,
770 BoundNodesTreeBuilder *Builder)
const {
771 return matchesDecl(Node.getTemplateName().getAsTemplateDecl(),
777 bool matchesSpecialized(
const CallExpr &Node, ASTMatchFinder *Finder,
778 BoundNodesTreeBuilder *Builder)
const {
784 bool matchesSpecialized(
const CXXConstructExpr &Node,
785 ASTMatchFinder *Finder,
786 BoundNodesTreeBuilder *Builder)
const {
792 bool matchesSpecialized(
const MemberExpr &Node,
793 ASTMatchFinder *Finder,
794 BoundNodesTreeBuilder *Builder)
const {
800 bool matchesSpecialized(
const AddrLabelExpr &Node,
801 ASTMatchFinder *Finder,
802 BoundNodesTreeBuilder *Builder)
const {
808 bool matchesDecl(
const Decl *Node, ASTMatchFinder *Finder,
809 BoundNodesTreeBuilder *Builder)
const {
810 return Node !=
nullptr &&
818 template <
typename T>
820 static const bool value =
821 std::is_same<T, Decl>::value ||
822 std::is_same<T, Stmt>::value ||
823 std::is_same<T, QualType>::value ||
824 std::is_same<T, Type>::value ||
825 std::is_same<T, TypeLoc>::value ||
826 std::is_same<T, NestedNameSpecifier>::value ||
827 std::is_same<T, NestedNameSpecifierLoc>::value ||
828 std::is_same<T, CXXCtorInitializer>::value;
830 template <
typename T>
831 const bool IsBaseType<T>::value;
851 class ASTMatchFinder {
859 TK_IgnoreImplicitCastsAndParentheses
871 enum AncestorMatchMode {
878 virtual ~ASTMatchFinder() {}
884 virtual bool classIsDerivedFrom(
const CXXRecordDecl *Declaration,
885 const Matcher<NamedDecl> &
Base,
886 BoundNodesTreeBuilder *Builder) = 0;
888 template <
typename T>
889 bool matchesChildOf(
const T &Node,
890 const DynTypedMatcher &Matcher,
891 BoundNodesTreeBuilder *Builder,
892 TraversalKind Traverse,
894 static_assert(std::is_base_of<Decl, T>::value ||
895 std::is_base_of<Stmt, T>::value ||
896 std::is_base_of<NestedNameSpecifier, T>::value ||
897 std::is_base_of<NestedNameSpecifierLoc, T>::value ||
898 std::is_base_of<TypeLoc, T>::value ||
899 std::is_base_of<QualType, T>::value,
900 "unsupported type for recursive matching");
902 Matcher, Builder, Traverse, Bind);
905 template <
typename T>
906 bool matchesDescendantOf(
const T &Node,
907 const DynTypedMatcher &Matcher,
908 BoundNodesTreeBuilder *Builder,
910 static_assert(std::is_base_of<Decl, T>::value ||
911 std::is_base_of<Stmt, T>::value ||
912 std::is_base_of<NestedNameSpecifier, T>::value ||
913 std::is_base_of<NestedNameSpecifierLoc, T>::value ||
914 std::is_base_of<TypeLoc, T>::value ||
915 std::is_base_of<QualType, T>::value,
916 "unsupported type for recursive matching");
918 Matcher, Builder, Bind);
922 template <
typename T>
923 bool matchesAncestorOf(
const T &Node,
924 const DynTypedMatcher &Matcher,
925 BoundNodesTreeBuilder *Builder,
926 AncestorMatchMode MatchMode) {
927 static_assert(std::is_base_of<Decl, T>::value ||
928 std::is_base_of<NestedNameSpecifierLoc, T>::value ||
929 std::is_base_of<Stmt, T>::value ||
930 std::is_base_of<TypeLoc, T>::value,
931 "type not allowed for recursive matching");
933 Matcher, Builder, MatchMode);
936 virtual ASTContext &getASTContext()
const = 0;
939 virtual bool matchesChildOf(
const ast_type_traits::DynTypedNode &Node,
940 const DynTypedMatcher &Matcher,
941 BoundNodesTreeBuilder *Builder,
942 TraversalKind Traverse,
945 virtual bool matchesDescendantOf(
const ast_type_traits::DynTypedNode &Node,
946 const DynTypedMatcher &Matcher,
947 BoundNodesTreeBuilder *Builder,
950 virtual bool matchesAncestorOf(
const ast_type_traits::DynTypedNode &Node,
951 const DynTypedMatcher &Matcher,
952 BoundNodesTreeBuilder *Builder,
953 AncestorMatchMode MatchMode) = 0;
960 template <
typename... Ts>
struct TypeList {};
962 template <
typename T1,
typename... Ts>
struct TypeList<T1, Ts...> {
970 typedef TypeList<Ts...> tail;
974 typedef TypeList<> EmptyTypeList;
978 template <
typename AnyTypeList,
typename T>
979 struct TypeListContainsSuperOf {
980 static const bool value =
981 std::is_base_of<typename AnyTypeList::head, T>::value ||
982 TypeListContainsSuperOf<typename AnyTypeList::tail, T>::value;
984 template <
typename T>
985 struct TypeListContainsSuperOf<EmptyTypeList, T> {
986 static const bool value =
false;
992 typedef TypeList<
Decl,
Stmt, NestedNameSpecifier, NestedNameSpecifierLoc,
993 QualType,
Type, TypeLoc, CXXCtorInitializer> AllNodeBaseTypes;
999 template <
class T>
struct ExtractFunctionArgMeta;
1000 template <
class T>
struct ExtractFunctionArgMeta<void(T)> {
1005 typedef AllNodeBaseTypes AdaptativeDefaultFromTypes;
1006 typedef TypeList<
Decl,
Stmt, NestedNameSpecifier, NestedNameSpecifierLoc,
1007 TypeLoc, QualType> AdaptativeDefaultToTypes;
1010 typedef TypeList<CallExpr, CXXConstructExpr, DeclRefExpr, EnumType,
1011 InjectedClassNameType, LabelStmt, AddrLabelExpr, MemberExpr,
1013 TemplateTypeParmType, TypedefType,
1014 UnresolvedUsingType> HasDeclarationSupportedTypes;
1029 template <
template <
typename ToArg,
typename FromArg>
class ArgumentAdapterT,
1030 typename FromTypes = AdaptativeDefaultFromTypes,
1031 typename ToTypes = AdaptativeDefaultToTypes>
1032 struct ArgumentAdaptingMatcherFunc {
1033 template <
typename T>
class Adaptor {
1036 : InnerMatcher(InnerMatcher) {}
1038 typedef ToTypes ReturnTypes;
1040 template <
typename To>
operator Matcher<To>()
const {
1041 return Matcher<To>(
new ArgumentAdapterT<To, T>(
InnerMatcher));
1048 template <
typename T>
1053 template <
typename T>
1054 Adaptor<T> operator()(
const Matcher<T> &
InnerMatcher)
const {
1055 return create(InnerMatcher);
1071 template <
template <
typename T>
class MatcherT,
1072 typename ReturnTypesF = void(AllNodeBaseTypes)>
1073 class PolymorphicMatcherWithParam0 {
1076 template <
typename T>
1077 operator Matcher<T>()
const {
1078 static_assert(TypeListContainsSuperOf<ReturnTypes, T>::value,
1079 "right polymorphic conversion");
1080 return Matcher<T>(
new MatcherT<T>());
1084 template <
template <
typename T,
typename P1>
class MatcherT,
1086 typename ReturnTypesF = void(AllNodeBaseTypes)>
1087 class PolymorphicMatcherWithParam1 {
1089 explicit PolymorphicMatcherWithParam1(
const P1 &Param1)
1094 template <
typename T>
1095 operator Matcher<T>()
const {
1096 static_assert(TypeListContainsSuperOf<ReturnTypes, T>::value,
1097 "right polymorphic conversion");
1098 return Matcher<T>(
new MatcherT<T, P1>(Param1));
1105 template <
template <
typename T,
typename P1,
typename P2>
class MatcherT,
1106 typename P1,
typename P2,
1107 typename ReturnTypesF = void(AllNodeBaseTypes)>
1108 class PolymorphicMatcherWithParam2 {
1110 PolymorphicMatcherWithParam2(
const P1 &Param1,
const P2 &Param2)
1111 : Param1(Param1), Param2(Param2) {}
1115 template <
typename T>
1116 operator Matcher<T>()
const {
1117 static_assert(TypeListContainsSuperOf<ReturnTypes, T>::value,
1118 "right polymorphic conversion");
1119 return Matcher<T>(
new MatcherT<T, P1, P2>(Param1, Param2));
1133 typedef AllNodeBaseTypes ReturnTypes;
1135 template <
typename T>
1136 operator Matcher<T>()
const {
1137 return DynTypedMatcher::trueMatcher(
1138 ast_type_traits::ASTNodeKind::getFromNodeKind<T>())
1139 .template unconditionalConvertTo<T>();
1147 template <
typename T>
1148 class BindableMatcher :
public Matcher<T> {
1150 explicit BindableMatcher(
const Matcher<T> &M) : Matcher<T>(M) {}
1151 explicit BindableMatcher(MatcherInterface<T> *Implementation)
1152 : Matcher<T>(Implementation) {}
1158 Matcher<T> bind(StringRef ID)
const {
1159 return DynTypedMatcher(*
this)
1161 ->template unconditionalConvertTo<T>();
1166 operator DynTypedMatcher()
const {
1167 DynTypedMatcher
Result =
static_cast<const Matcher<T>&
>(*this);
1168 Result.setAllowBind(
true);
1177 template <
typename T,
typename ChildT>
1178 class HasMatcher :
public WrapperMatcherInterface<T> {
1181 explicit HasMatcher(
const Matcher<ChildT> &ChildMatcher)
1182 : HasMatcher::WrapperMatcherInterface(ChildMatcher) {}
1184 bool matches(
const T &Node, ASTMatchFinder *Finder,
1185 BoundNodesTreeBuilder *Builder)
const override {
1186 return Finder->matchesChildOf(Node, this->
InnerMatcher, Builder,
1187 ASTMatchFinder::TK_AsIs,
1188 ASTMatchFinder::BK_First);
1197 template <
typename T,
typename ChildT>
1198 class ForEachMatcher :
public WrapperMatcherInterface<T> {
1199 static_assert(IsBaseType<ChildT>::value,
1200 "for each only accepts base type matcher");
1203 explicit ForEachMatcher(
const Matcher<ChildT> &ChildMatcher)
1204 : ForEachMatcher::WrapperMatcherInterface(ChildMatcher) {}
1206 bool matches(
const T& Node, ASTMatchFinder* Finder,
1207 BoundNodesTreeBuilder* Builder)
const override {
1208 return Finder->matchesChildOf(
1210 ASTMatchFinder::TK_IgnoreImplicitCastsAndParentheses,
1211 ASTMatchFinder::BK_All);
1224 template <
typename... Ps>
class VariadicOperatorMatcher {
1226 VariadicOperatorMatcher(DynTypedMatcher::VariadicOperator Op, Ps &&... Params)
1227 : Op(Op), Params(std::forward<Ps>(Params)...) {}
1229 template <
typename T>
operator Matcher<T>()
const {
1230 return DynTypedMatcher::constructVariadic(
1231 Op, ast_type_traits::ASTNodeKind::getFromNodeKind<T>(),
1232 getMatchers<T>(llvm::index_sequence_for<Ps...>()))
1233 .template unconditionalConvertTo<T>();
1239 std::vector<DynTypedMatcher> getMatchers(llvm::index_sequence<Is...>)
const {
1240 return {Matcher<T>(std::get<Is>(Params))...};
1243 const DynTypedMatcher::VariadicOperator Op;
1244 std::tuple<Ps...> Params;
1249 template <
unsigned MinCount,
unsigned MaxCount>
1250 struct VariadicOperatorMatcherFunc {
1251 DynTypedMatcher::VariadicOperator Op;
1253 template <
typename... Ms>
1254 VariadicOperatorMatcher<Ms...> operator()(Ms &&... Ps)
const {
1255 static_assert(MinCount <=
sizeof...(Ms) &&
sizeof...(Ms) <= MaxCount,
1256 "invalid number of parameters for variadic matcher");
1257 return VariadicOperatorMatcher<Ms...>(Op, std::forward<Ms>(Ps)...);
1263 template <
typename T>
1264 inline Matcher<T> DynTypedMatcher::unconditionalConvertTo()
const {
1265 return Matcher<T>(*this);
1269 template<
typename T>
1270 BindableMatcher<T> makeAllOfComposite(
1274 return BindableMatcher<T>(TrueMatcher());
1282 typedef llvm::pointee_iterator<const Matcher<T> *
const *> PI;
1283 std::vector<DynTypedMatcher> DynMatchers(PI(
InnerMatchers.begin()),
1285 return BindableMatcher<T>(
1286 DynTypedMatcher::constructVariadic(
1287 DynTypedMatcher::VO_AllOf,
1288 ast_type_traits::ASTNodeKind::getFromNodeKind<T>(),
1289 std::move(DynMatchers))
1290 .template unconditionalConvertTo<T>());
1299 template<
typename T,
typename InnerT>
1300 BindableMatcher<T> makeDynCastAllOfComposite(
1302 return BindableMatcher<T>(
1310 template <
typename T,
typename DescendantT>
1311 class HasDescendantMatcher :
public WrapperMatcherInterface<T> {
1312 static_assert(IsBaseType<DescendantT>::value,
1313 "has descendant only accepts base type matcher");
1316 explicit HasDescendantMatcher(
const Matcher<DescendantT> &DescendantMatcher)
1317 : HasDescendantMatcher::WrapperMatcherInterface(DescendantMatcher) {}
1319 bool matches(
const T &Node, ASTMatchFinder *Finder,
1320 BoundNodesTreeBuilder *Builder)
const override {
1321 return Finder->matchesDescendantOf(Node, this->
InnerMatcher, Builder,
1322 ASTMatchFinder::BK_First);
1330 template <
typename T,
typename ParentT>
1331 class HasParentMatcher :
public WrapperMatcherInterface<T> {
1332 static_assert(IsBaseType<ParentT>::value,
1333 "has parent only accepts base type matcher");
1336 explicit HasParentMatcher(
const Matcher<ParentT> &ParentMatcher)
1337 : HasParentMatcher::WrapperMatcherInterface(ParentMatcher) {}
1339 bool matches(
const T &Node, ASTMatchFinder *Finder,
1340 BoundNodesTreeBuilder *Builder)
const override {
1341 return Finder->matchesAncestorOf(Node, this->
InnerMatcher, Builder,
1342 ASTMatchFinder::AMM_ParentOnly);
1350 template <
typename T,
typename AncestorT>
1351 class HasAncestorMatcher :
public WrapperMatcherInterface<T> {
1352 static_assert(IsBaseType<AncestorT>::value,
1353 "has ancestor only accepts base type matcher");
1356 explicit HasAncestorMatcher(
const Matcher<AncestorT> &AncestorMatcher)
1357 : HasAncestorMatcher::WrapperMatcherInterface(AncestorMatcher) {}
1359 bool matches(
const T &Node, ASTMatchFinder *Finder,
1360 BoundNodesTreeBuilder *Builder)
const override {
1361 return Finder->matchesAncestorOf(Node, this->
InnerMatcher, Builder,
1362 ASTMatchFinder::AMM_All);
1372 template <
typename T,
typename DescendantT>
1373 class ForEachDescendantMatcher :
public WrapperMatcherInterface<T> {
1374 static_assert(IsBaseType<DescendantT>::value,
1375 "for each descendant only accepts base type matcher");
1378 explicit ForEachDescendantMatcher(
1379 const Matcher<DescendantT> &DescendantMatcher)
1380 : ForEachDescendantMatcher::WrapperMatcherInterface(DescendantMatcher) {}
1382 bool matches(
const T &Node, ASTMatchFinder *Finder,
1383 BoundNodesTreeBuilder *Builder)
const override {
1384 return Finder->matchesDescendantOf(Node, this->
InnerMatcher, Builder,
1385 ASTMatchFinder::BK_All);
1391 template <
typename T,
typename ValueT>
1392 class ValueEqualsMatcher :
public SingleNodeMatcherInterface<T> {
1393 static_assert(std::is_base_of<CharacterLiteral, T>::value ||
1394 std::is_base_of<CXXBoolLiteralExpr, T>::value ||
1395 std::is_base_of<FloatingLiteral, T>::value ||
1396 std::is_base_of<IntegerLiteral, T>::value,
1397 "the node must have a getValue method");
1400 explicit ValueEqualsMatcher(
const ValueT &ExpectedValue)
1401 : ExpectedValue(ExpectedValue) {}
1403 bool matchesNode(
const T &Node)
const override {
1404 return Node.getValue() == ExpectedValue;
1408 const ValueT ExpectedValue;
1414 inline bool ValueEqualsMatcher<FloatingLiteral, double>::matchesNode(
1415 const FloatingLiteral &Node)
const {
1416 if ((&Node.getSemantics()) == &llvm::APFloat::IEEEsingle)
1417 return Node.getValue().convertToFloat() == ExpectedValue;
1418 if ((&Node.getSemantics()) == &llvm::APFloat::IEEEdouble)
1419 return Node.getValue().convertToDouble() == ExpectedValue;
1423 inline bool ValueEqualsMatcher<FloatingLiteral, float>::matchesNode(
1424 const FloatingLiteral &Node)
const {
1425 if ((&Node.getSemantics()) == &llvm::APFloat::IEEEsingle)
1426 return Node.getValue().convertToFloat() == ExpectedValue;
1427 if ((&Node.getSemantics()) == &llvm::APFloat::IEEEdouble)
1428 return Node.getValue().convertToDouble() == ExpectedValue;
1432 inline bool ValueEqualsMatcher<FloatingLiteral, llvm::APFloat>::matchesNode(
1433 const FloatingLiteral &Node)
const {
1434 return ExpectedValue.compare(Node.getValue()) == llvm::APFloat::cmpEqual;
1449 template <
typename SourceT,
typename TargetT>
1450 class VariadicDynCastAllOfMatcher
1451 :
public VariadicFunction<BindableMatcher<SourceT>, Matcher<TargetT>,
1452 makeDynCastAllOfComposite<SourceT, TargetT>> {
1454 VariadicDynCastAllOfMatcher() {}
1467 template <
typename T>
1468 class VariadicAllOfMatcher
1469 :
public VariadicFunction<BindableMatcher<T>, Matcher<T>,
1470 makeAllOfComposite<T>> {
1472 VariadicAllOfMatcher() {}
1477 template <
typename TLoc,
typename T>
1478 class LocMatcher :
public WrapperMatcherInterface<TLoc> {
1481 : LocMatcher::WrapperMatcherInterface(InnerMatcher) {}
1483 bool matches(
const TLoc &Node, ASTMatchFinder *Finder,
1484 BoundNodesTreeBuilder *Builder)
const override {
1487 return this->
InnerMatcher.matches(extract(Node), Finder, Builder);
1491 static ast_type_traits::DynTypedNode
1492 extract(
const NestedNameSpecifierLoc &Loc) {
1501 class TypeLocTypeMatcher :
public WrapperMatcherInterface<TypeLoc> {
1503 explicit TypeLocTypeMatcher(
const Matcher<QualType> &
InnerMatcher)
1504 : TypeLocTypeMatcher::WrapperMatcherInterface(InnerMatcher) {}
1506 bool matches(
const TypeLoc &Node, ASTMatchFinder *Finder,
1507 BoundNodesTreeBuilder *Builder)
const override {
1518 template <
typename T>
1519 class TypeTraverseMatcher :
public WrapperMatcherInterface<T> {
1521 explicit TypeTraverseMatcher(
const Matcher<QualType> &
InnerMatcher,
1522 QualType (T::*TraverseFunction)()
const)
1523 : TypeTraverseMatcher::WrapperMatcherInterface(InnerMatcher),
1524 TraverseFunction(TraverseFunction) {}
1526 bool matches(
const T &Node, ASTMatchFinder *Finder,
1527 BoundNodesTreeBuilder *Builder)
const override {
1528 QualType NextNode = (Node.*TraverseFunction)();
1529 if (NextNode.isNull())
1531 return this->InnerMatcher.matches(
1536 QualType (T::*TraverseFunction)()
const;
1542 template <
typename T>
1543 class TypeLocTraverseMatcher :
public WrapperMatcherInterface<T> {
1545 explicit TypeLocTraverseMatcher(
const Matcher<TypeLoc> &InnerMatcher,
1546 TypeLoc (T::*TraverseFunction)()
const)
1547 : TypeLocTraverseMatcher::WrapperMatcherInterface(InnerMatcher),
1548 TraverseFunction(TraverseFunction) {}
1550 bool matches(
const T &Node, ASTMatchFinder *Finder,
1551 BoundNodesTreeBuilder *Builder)
const override {
1552 TypeLoc NextNode = (Node.*TraverseFunction)();
1555 return this->InnerMatcher.matches(
1560 TypeLoc (T::*TraverseFunction)()
const;
1569 template <
typename InnerTBase,
1570 template <
typename OuterT>
class Getter,
1571 template <
typename OuterT>
class MatcherImpl,
1572 typename ReturnTypesF>
1573 class TypeTraversePolymorphicMatcher {
1575 typedef TypeTraversePolymorphicMatcher<InnerTBase, Getter, MatcherImpl,
1582 explicit TypeTraversePolymorphicMatcher(
1586 template <
typename OuterT>
operator Matcher<OuterT>()
const {
1587 return Matcher<OuterT>(
1588 new MatcherImpl<OuterT>(
InnerMatcher, Getter<OuterT>::value()));
1592 :
public VariadicFunction<Self, Matcher<InnerTBase>, &Self::create> {
1604 template <
typename Matcher, Matcher (*Func)()>
class MemoizedMatcher {
1606 Wrapper() : M(Func()) {}
1611 static const Matcher &getInstance() {
1612 static llvm::ManagedStatic<Wrapper> Instance;
1620 template <
typename InnerTBase,
template <
typename OuterT>
class Getter,
1621 template <
typename OuterT>
class MatcherImpl,
typename ReturnTypesF>
1622 TypeTraversePolymorphicMatcher<InnerTBase, Getter, MatcherImpl, ReturnTypesF>
1623 TypeTraversePolymorphicMatcher<
1624 InnerTBase, Getter, MatcherImpl,
1631 inline ArrayRef<TemplateArgument>
1632 getTemplateSpecializationArgs(
const ClassTemplateSpecializationDecl &D) {
1633 return D.getTemplateArgs().asArray();
1636 inline ArrayRef<TemplateArgument>
1638 return llvm::makeArrayRef(T.getArgs(), T.getNumArgs());
1641 struct NotEqualsBoundNodePredicate {
1642 bool operator()(
const internal::BoundNodesMap &
Nodes)
const {
1643 return Nodes.getNode(ID) !=
Node;
1646 ast_type_traits::DynTypedNode
Node;
1649 template <
typename Ty>
1650 struct GetBodyMatcher {
1651 static const Stmt *
get(
const Ty &
Node) {
1652 return Node.getBody();
1657 inline const Stmt *GetBodyMatcher<FunctionDecl>::get(
const FunctionDecl &Node) {
1658 return Node.doesThisDeclarationHaveABody() ? Node.getBody() :
nullptr;
1661 template <
typename Ty>
1662 struct HasSizeMatcher {
1663 static bool hasSize(
const Ty &Node,
unsigned int N) {
1664 return Node.getSize() == N;
1669 inline bool HasSizeMatcher<StringLiteral>::hasSize(
1670 const StringLiteral &Node,
unsigned int N) {
1671 return Node.getLength() == N;
1674 template <
typename Ty>
1675 struct GetSourceExpressionMatcher {
1676 static const Expr *
get(
const Ty &
Node) {
1677 return Node.getSubExpr();
1682 inline const Expr *GetSourceExpressionMatcher<OpaqueValueExpr>::get(
1683 const OpaqueValueExpr &Node) {
1684 return Node.getSourceExpr();
1687 template <
typename Ty>
1688 struct CompoundStmtMatcher {
1689 static const CompoundStmt *
get(
const Ty &
Node) {
1695 inline const CompoundStmt *
1696 CompoundStmtMatcher<StmtExpr>::get(
const StmtExpr &Node) {
1697 return Node.getSubStmt();
1705 #endif // LLVM_CLANG_ASTMATCHERS_ASTMATCHERSINTERNAL_H
__SIZE_TYPE__ size_t
The unsigned integer type of the result of the sizeof operator.
C Language Family Type Representation.
Defines the C++ template declaration subclasses.
const DynTypedMatcher *const Matcher
Defines the Objective-C statement AST node classes.
Defines the clang::Expr interface and subclasses for C++ expressions.
BoundNodesTreeBuilder Nodes
class LLVM_ALIGNAS(8) DependentTemplateSpecializationType const IdentifierInfo * Name
Represents a template specialization type whose template cannot be resolved, e.g. ...
const ASTMatchFinder::BindKind Bind
std::vector< DynTypedMatcher > InnerMatchers
const IntrusiveRefCntPtr< DynMatcherInterface > InnerMatcher
detail::InMemoryDirectory::const_iterator I
Matcher< NamedDecl > hasAnyNameFunc(ArrayRef< const StringRef * > NameRefs)
The result type of a method or function.
The l-value was considered opaque, so the alignment was determined from a type.
ASTMatchFinder *const Finder
static QualType getUnderlyingType(const SubRegion *R)
bool operator<(DeclarationName LHS, DeclarationName RHS)
Ordering on two declaration names.
static DynTypedNode create(const T &Node)
Creates a DynTypedNode from Node.
BoundNodesTreeBuilder BoundNodes
ast_type_traits::DynTypedNode Node
const internal::VariadicAllOfMatcher< Type > type
Matches Types in the clang AST.
std::unique_ptr< DiagnosticConsumer > create(StringRef OutputFile, DiagnosticOptions *Diags, bool MergeChildRecords=false)
Returns a DiagnosticConsumer that serializes diagnostics to a bitcode file.
const char * getOperatorSpelling(OverloadedOperatorKind Operator)
Retrieve the spelling of the given overloaded operator, without the preceding "operator" keyword...
Defines the C++ Decl subclasses, other than those for templates (found in DeclTemplate.h) and friends (in DeclFriend.h).
BoundNodesTreeBuilder *const Builder
bool matches(const til::SExpr *E1, const til::SExpr *E2)
TemplateSpecializationType(TemplateName T, ArrayRef< TemplateArgument > Args, QualType Canon, QualType Aliased)