1 //===- Marshallers.h - Generic matcher function marshallers -----*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
11 /// \brief Functions templates and classes to wrap matcher construct functions.
13 /// A collection of template function and classes that provide a generic
14 /// marshalling layer on top of matcher construct functions.
15 /// These are used by the registry to export all marshaller constructors with
16 /// the same generic interface.
18 //===----------------------------------------------------------------------===//
20 #ifndef LLVM_CLANG_LIB_ASTMATCHERS_DYNAMIC_MARSHALLERS_H
21 #define LLVM_CLANG_LIB_ASTMATCHERS_DYNAMIC_MARSHALLERS_H
23 #include "clang/AST/ASTTypeTraits.h"
24 #include "clang/AST/OperationKinds.h"
25 #include "clang/ASTMatchers/ASTMatchersInternal.h"
26 #include "clang/ASTMatchers/Dynamic/Diagnostics.h"
27 #include "clang/ASTMatchers/Dynamic/VariantValue.h"
28 #include "clang/Basic/AttrKinds.h"
29 #include "clang/Basic/LLVM.h"
30 #include "llvm/ADT/ArrayRef.h"
31 #include "llvm/ADT/None.h"
32 #include "llvm/ADT/STLExtras.h"
33 #include "llvm/ADT/StringRef.h"
34 #include "llvm/ADT/StringSwitch.h"
35 #include "llvm/ADT/Twine.h"
46 namespace ast_matchers {
50 /// \brief Helper template class to just from argument type to the right is/get
51 /// functions in VariantValue.
52 /// Used to verify and extract the matcher arguments below.
53 template <class T> struct ArgTypeTraits;
54 template <class T> struct ArgTypeTraits<const T &> : public ArgTypeTraits<T> {
57 template <> struct ArgTypeTraits<std::string> {
58 static bool is(const VariantValue &Value) { return Value.isString(); }
60 static const std::string &get(const VariantValue &Value) {
61 return Value.getString();
64 static ArgKind getKind() {
65 return ArgKind(ArgKind::AK_String);
70 struct ArgTypeTraits<StringRef> : public ArgTypeTraits<std::string> {
73 template <class T> struct ArgTypeTraits<ast_matchers::internal::Matcher<T>> {
74 static bool is(const VariantValue &Value) {
75 return Value.isMatcher() && Value.getMatcher().hasTypedMatcher<T>();
78 static ast_matchers::internal::Matcher<T> get(const VariantValue &Value) {
79 return Value.getMatcher().getTypedMatcher<T>();
82 static ArgKind getKind() {
83 return ArgKind(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
87 template <> struct ArgTypeTraits<bool> {
88 static bool is(const VariantValue &Value) { return Value.isBoolean(); }
90 static bool get(const VariantValue &Value) {
91 return Value.getBoolean();
94 static ArgKind getKind() {
95 return ArgKind(ArgKind::AK_Boolean);
99 template <> struct ArgTypeTraits<double> {
100 static bool is(const VariantValue &Value) { return Value.isDouble(); }
102 static double get(const VariantValue &Value) {
103 return Value.getDouble();
106 static ArgKind getKind() {
107 return ArgKind(ArgKind::AK_Double);
111 template <> struct ArgTypeTraits<unsigned> {
112 static bool is(const VariantValue &Value) { return Value.isUnsigned(); }
114 static unsigned get(const VariantValue &Value) {
115 return Value.getUnsigned();
118 static ArgKind getKind() {
119 return ArgKind(ArgKind::AK_Unsigned);
123 template <> struct ArgTypeTraits<attr::Kind> {
125 static Optional<attr::Kind> getAttrKind(llvm::StringRef AttrKind) {
126 return llvm::StringSwitch<Optional<attr::Kind>>(AttrKind)
127 #define ATTR(X) .Case("attr::" #X, attr:: X)
128 #include "clang/Basic/AttrList.inc"
129 .Default(llvm::None);
133 static bool is(const VariantValue &Value) {
134 return Value.isString() && getAttrKind(Value.getString());
137 static attr::Kind get(const VariantValue &Value) {
138 return *getAttrKind(Value.getString());
141 static ArgKind getKind() {
142 return ArgKind(ArgKind::AK_String);
146 template <> struct ArgTypeTraits<CastKind> {
148 static Optional<CastKind> getCastKind(llvm::StringRef AttrKind) {
149 return llvm::StringSwitch<Optional<CastKind>>(AttrKind)
150 #define CAST_OPERATION(Name) .Case( #Name, CK_##Name)
151 #include "clang/AST/OperationKinds.def"
152 .Default(llvm::None);
156 static bool is(const VariantValue &Value) {
157 return Value.isString() && getCastKind(Value.getString());
160 static CastKind get(const VariantValue &Value) {
161 return *getCastKind(Value.getString());
164 static ArgKind getKind() {
165 return ArgKind(ArgKind::AK_String);
169 /// \brief Matcher descriptor interface.
171 /// Provides a \c create() method that constructs the matcher from the provided
172 /// arguments, and various other methods for type introspection.
173 class MatcherDescriptor {
175 virtual ~MatcherDescriptor() = default;
177 virtual VariantMatcher create(SourceRange NameRange,
178 ArrayRef<ParserValue> Args,
179 Diagnostics *Error) const = 0;
181 /// Returns whether the matcher is variadic. Variadic matchers can take any
182 /// number of arguments, but they must be of the same type.
183 virtual bool isVariadic() const = 0;
185 /// Returns the number of arguments accepted by the matcher if not variadic.
186 virtual unsigned getNumArgs() const = 0;
188 /// Given that the matcher is being converted to type \p ThisKind, append the
189 /// set of argument types accepted for argument \p ArgNo to \p ArgKinds.
190 // FIXME: We should provide the ability to constrain the output of this
191 // function based on the types of other matcher arguments.
192 virtual void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
193 std::vector<ArgKind> &ArgKinds) const = 0;
195 /// Returns whether this matcher is convertible to the given type. If it is
196 /// so convertible, store in *Specificity a value corresponding to the
197 /// "specificity" of the converted matcher to the given context, and in
198 /// *LeastDerivedKind the least derived matcher kind which would result in the
199 /// same matcher overload. Zero specificity indicates that this conversion
200 /// would produce a trivial matcher that will either always or never match.
201 /// Such matchers are excluded from code completion results.
202 virtual bool isConvertibleTo(
203 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity = nullptr,
204 ast_type_traits::ASTNodeKind *LeastDerivedKind = nullptr) const = 0;
206 /// Returns whether the matcher will, given a matcher of any type T, yield a
207 /// matcher of type T.
208 virtual bool isPolymorphic() const { return false; }
211 inline bool isRetKindConvertibleTo(
212 ArrayRef<ast_type_traits::ASTNodeKind> RetKinds,
213 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
214 ast_type_traits::ASTNodeKind *LeastDerivedKind) {
215 for (const ast_type_traits::ASTNodeKind &NodeKind : RetKinds) {
216 if (ArgKind(NodeKind).isConvertibleTo(Kind, Specificity)) {
217 if (LeastDerivedKind)
218 *LeastDerivedKind = NodeKind;
225 /// \brief Simple callback implementation. Marshaller and function are provided.
227 /// This class wraps a function of arbitrary signature and a marshaller
228 /// function into a MatcherDescriptor.
229 /// The marshaller is in charge of taking the VariantValue arguments, checking
230 /// their types, unpacking them and calling the underlying function.
231 class FixedArgCountMatcherDescriptor : public MatcherDescriptor {
233 using MarshallerType = VariantMatcher (*)(void (*Func)(),
234 StringRef MatcherName,
235 SourceRange NameRange,
236 ArrayRef<ParserValue> Args,
239 /// \param Marshaller Function to unpack the arguments and call \c Func
240 /// \param Func Matcher construct function. This is the function that
241 /// compile-time matcher expressions would use to create the matcher.
242 /// \param RetKinds The list of matcher types to which the matcher is
244 /// \param ArgKinds The types of the arguments this matcher takes.
245 FixedArgCountMatcherDescriptor(
246 MarshallerType Marshaller, void (*Func)(), StringRef MatcherName,
247 ArrayRef<ast_type_traits::ASTNodeKind> RetKinds,
248 ArrayRef<ArgKind> ArgKinds)
249 : Marshaller(Marshaller), Func(Func), MatcherName(MatcherName),
250 RetKinds(RetKinds.begin(), RetKinds.end()),
251 ArgKinds(ArgKinds.begin(), ArgKinds.end()) {}
253 VariantMatcher create(SourceRange NameRange,
254 ArrayRef<ParserValue> Args,
255 Diagnostics *Error) const override {
256 return Marshaller(Func, MatcherName, NameRange, Args, Error);
259 bool isVariadic() const override { return false; }
260 unsigned getNumArgs() const override { return ArgKinds.size(); }
262 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
263 std::vector<ArgKind> &Kinds) const override {
264 Kinds.push_back(ArgKinds[ArgNo]);
267 bool isConvertibleTo(
268 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
269 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
270 return isRetKindConvertibleTo(RetKinds, Kind, Specificity,
275 const MarshallerType Marshaller;
276 void (* const Func)();
277 const std::string MatcherName;
278 const std::vector<ast_type_traits::ASTNodeKind> RetKinds;
279 const std::vector<ArgKind> ArgKinds;
282 /// \brief Helper methods to extract and merge all possible typed matchers
283 /// out of the polymorphic object.
284 template <class PolyMatcher>
285 static void mergePolyMatchers(const PolyMatcher &Poly,
286 std::vector<DynTypedMatcher> &Out,
287 ast_matchers::internal::EmptyTypeList) {}
289 template <class PolyMatcher, class TypeList>
290 static void mergePolyMatchers(const PolyMatcher &Poly,
291 std::vector<DynTypedMatcher> &Out, TypeList) {
292 Out.push_back(ast_matchers::internal::Matcher<typename TypeList::head>(Poly));
293 mergePolyMatchers(Poly, Out, typename TypeList::tail());
296 /// \brief Convert the return values of the functions into a VariantMatcher.
298 /// There are 2 cases right now: The return value is a Matcher<T> or is a
299 /// polymorphic matcher. For the former, we just construct the VariantMatcher.
300 /// For the latter, we instantiate all the possible Matcher<T> of the poly
302 static VariantMatcher outvalueToVariantMatcher(const DynTypedMatcher &Matcher) {
303 return VariantMatcher::SingleMatcher(Matcher);
306 template <typename T>
307 static VariantMatcher outvalueToVariantMatcher(const T &PolyMatcher,
308 typename T::ReturnTypes * =
310 std::vector<DynTypedMatcher> Matchers;
311 mergePolyMatchers(PolyMatcher, Matchers, typename T::ReturnTypes());
312 VariantMatcher Out = VariantMatcher::PolymorphicMatcher(std::move(Matchers));
316 template <typename T>
317 inline void buildReturnTypeVectorFromTypeList(
318 std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
320 ast_type_traits::ASTNodeKind::getFromNodeKind<typename T::head>());
321 buildReturnTypeVectorFromTypeList<typename T::tail>(RetTypes);
326 buildReturnTypeVectorFromTypeList<ast_matchers::internal::EmptyTypeList>(
327 std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {}
329 template <typename T>
330 struct BuildReturnTypeVector {
331 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
332 buildReturnTypeVectorFromTypeList<typename T::ReturnTypes>(RetTypes);
336 template <typename T>
337 struct BuildReturnTypeVector<ast_matchers::internal::Matcher<T>> {
338 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
339 RetTypes.push_back(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
343 template <typename T>
344 struct BuildReturnTypeVector<ast_matchers::internal::BindableMatcher<T>> {
345 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
346 RetTypes.push_back(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
350 /// \brief Variadic marshaller function.
351 template <typename ResultT, typename ArgT,
352 ResultT (*Func)(ArrayRef<const ArgT *>)>
354 variadicMatcherDescriptor(StringRef MatcherName, SourceRange NameRange,
355 ArrayRef<ParserValue> Args, Diagnostics *Error) {
356 ArgT **InnerArgs = new ArgT *[Args.size()]();
358 bool HasError = false;
359 for (size_t i = 0, e = Args.size(); i != e; ++i) {
360 using ArgTraits = ArgTypeTraits<ArgT>;
362 const ParserValue &Arg = Args[i];
363 const VariantValue &Value = Arg.Value;
364 if (!ArgTraits::is(Value)) {
365 Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
366 << (i + 1) << ArgTraits::getKind().asString() << Value.getTypeAsString();
370 InnerArgs[i] = new ArgT(ArgTraits::get(Value));
375 Out = outvalueToVariantMatcher(Func(llvm::makeArrayRef(InnerArgs,
379 for (size_t i = 0, e = Args.size(); i != e; ++i) {
386 /// \brief Matcher descriptor for variadic functions.
388 /// This class simply wraps a VariadicFunction with the right signature to export
389 /// it as a MatcherDescriptor.
390 /// This allows us to have one implementation of the interface for as many free
391 /// functions as we want, reducing the number of symbols and size of the
393 class VariadicFuncMatcherDescriptor : public MatcherDescriptor {
395 using RunFunc = VariantMatcher (*)(StringRef MatcherName,
396 SourceRange NameRange,
397 ArrayRef<ParserValue> Args,
400 template <typename ResultT, typename ArgT,
401 ResultT (*F)(ArrayRef<const ArgT *>)>
402 VariadicFuncMatcherDescriptor(
403 ast_matchers::internal::VariadicFunction<ResultT, ArgT, F> Func,
404 StringRef MatcherName)
405 : Func(&variadicMatcherDescriptor<ResultT, ArgT, F>),
406 MatcherName(MatcherName.str()),
407 ArgsKind(ArgTypeTraits<ArgT>::getKind()) {
408 BuildReturnTypeVector<ResultT>::build(RetKinds);
411 VariantMatcher create(SourceRange NameRange,
412 ArrayRef<ParserValue> Args,
413 Diagnostics *Error) const override {
414 return Func(MatcherName, NameRange, Args, Error);
417 bool isVariadic() const override { return true; }
418 unsigned getNumArgs() const override { return 0; }
420 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
421 std::vector<ArgKind> &Kinds) const override {
422 Kinds.push_back(ArgsKind);
425 bool isConvertibleTo(
426 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
427 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
428 return isRetKindConvertibleTo(RetKinds, Kind, Specificity,
434 const std::string MatcherName;
435 std::vector<ast_type_traits::ASTNodeKind> RetKinds;
436 const ArgKind ArgsKind;
439 /// \brief Return CK_Trivial when appropriate for VariadicDynCastAllOfMatchers.
440 class DynCastAllOfMatcherDescriptor : public VariadicFuncMatcherDescriptor {
442 template <typename BaseT, typename DerivedT>
443 DynCastAllOfMatcherDescriptor(
444 ast_matchers::internal::VariadicDynCastAllOfMatcher<BaseT, DerivedT> Func,
445 StringRef MatcherName)
446 : VariadicFuncMatcherDescriptor(Func, MatcherName),
447 DerivedKind(ast_type_traits::ASTNodeKind::getFromNodeKind<DerivedT>()) {
451 isConvertibleTo(ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
452 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
453 // If Kind is not a base of DerivedKind, either DerivedKind is a base of
454 // Kind (in which case the match will always succeed) or Kind and
455 // DerivedKind are unrelated (in which case it will always fail), so set
457 if (VariadicFuncMatcherDescriptor::isConvertibleTo(Kind, Specificity,
459 if (Kind.isSame(DerivedKind) || !Kind.isBaseOf(DerivedKind)) {
470 const ast_type_traits::ASTNodeKind DerivedKind;
473 /// \brief Helper macros to check the arguments on all marshaller functions.
474 #define CHECK_ARG_COUNT(count) \
475 if (Args.size() != count) { \
476 Error->addError(NameRange, Error->ET_RegistryWrongArgCount) \
477 << count << Args.size(); \
478 return VariantMatcher(); \
481 #define CHECK_ARG_TYPE(index, type) \
482 if (!ArgTypeTraits<type>::is(Args[index].Value)) { \
483 Error->addError(Args[index].Range, Error->ET_RegistryWrongArgType) \
484 << (index + 1) << ArgTypeTraits<type>::getKind().asString() \
485 << Args[index].Value.getTypeAsString(); \
486 return VariantMatcher(); \
489 /// \brief 0-arg marshaller function.
490 template <typename ReturnType>
491 static VariantMatcher matcherMarshall0(void (*Func)(), StringRef MatcherName,
492 SourceRange NameRange,
493 ArrayRef<ParserValue> Args,
494 Diagnostics *Error) {
495 using FuncType = ReturnType (*)();
497 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)());
500 /// \brief 1-arg marshaller function.
501 template <typename ReturnType, typename ArgType1>
502 static VariantMatcher matcherMarshall1(void (*Func)(), StringRef MatcherName,
503 SourceRange NameRange,
504 ArrayRef<ParserValue> Args,
505 Diagnostics *Error) {
506 using FuncType = ReturnType (*)(ArgType1);
508 CHECK_ARG_TYPE(0, ArgType1);
509 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
510 ArgTypeTraits<ArgType1>::get(Args[0].Value)));
513 /// \brief 2-arg marshaller function.
514 template <typename ReturnType, typename ArgType1, typename ArgType2>
515 static VariantMatcher matcherMarshall2(void (*Func)(), StringRef MatcherName,
516 SourceRange NameRange,
517 ArrayRef<ParserValue> Args,
518 Diagnostics *Error) {
519 using FuncType = ReturnType (*)(ArgType1, ArgType2);
521 CHECK_ARG_TYPE(0, ArgType1);
522 CHECK_ARG_TYPE(1, ArgType2);
523 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
524 ArgTypeTraits<ArgType1>::get(Args[0].Value),
525 ArgTypeTraits<ArgType2>::get(Args[1].Value)));
528 #undef CHECK_ARG_COUNT
529 #undef CHECK_ARG_TYPE
531 /// \brief Helper class used to collect all the possible overloads of an
532 /// argument adaptative matcher function.
533 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
534 typename FromTypes, typename ToTypes>
535 class AdaptativeOverloadCollector {
537 AdaptativeOverloadCollector(
538 StringRef Name, std::vector<std::unique_ptr<MatcherDescriptor>> &Out)
539 : Name(Name), Out(Out) {
540 collect(FromTypes());
544 using AdaptativeFunc = ast_matchers::internal::ArgumentAdaptingMatcherFunc<
545 ArgumentAdapterT, FromTypes, ToTypes>;
547 /// \brief End case for the recursion
548 static void collect(ast_matchers::internal::EmptyTypeList) {}
550 /// \brief Recursive case. Get the overload for the head of the list, and
551 /// recurse to the tail.
552 template <typename FromTypeList>
553 inline void collect(FromTypeList);
556 std::vector<std::unique_ptr<MatcherDescriptor>> &Out;
559 /// \brief MatcherDescriptor that wraps multiple "overloads" of the same
562 /// It will try every overload and generate appropriate errors for when none or
563 /// more than one overloads match the arguments.
564 class OverloadedMatcherDescriptor : public MatcherDescriptor {
566 OverloadedMatcherDescriptor(
567 MutableArrayRef<std::unique_ptr<MatcherDescriptor>> Callbacks)
568 : Overloads(std::make_move_iterator(Callbacks.begin()),
569 std::make_move_iterator(Callbacks.end())) {}
571 ~OverloadedMatcherDescriptor() override = default;
573 VariantMatcher create(SourceRange NameRange,
574 ArrayRef<ParserValue> Args,
575 Diagnostics *Error) const override {
576 std::vector<VariantMatcher> Constructed;
577 Diagnostics::OverloadContext Ctx(Error);
578 for (const auto &O : Overloads) {
579 VariantMatcher SubMatcher = O->create(NameRange, Args, Error);
580 if (!SubMatcher.isNull()) {
581 Constructed.push_back(SubMatcher);
585 if (Constructed.empty()) return VariantMatcher(); // No overload matched.
586 // We ignore the errors if any matcher succeeded.
588 if (Constructed.size() > 1) {
589 // More than one constructed. It is ambiguous.
590 Error->addError(NameRange, Error->ET_RegistryAmbiguousOverload);
591 return VariantMatcher();
593 return Constructed[0];
596 bool isVariadic() const override {
597 bool Overload0Variadic = Overloads[0]->isVariadic();
599 for (const auto &O : Overloads) {
600 assert(Overload0Variadic == O->isVariadic());
603 return Overload0Variadic;
606 unsigned getNumArgs() const override {
607 unsigned Overload0NumArgs = Overloads[0]->getNumArgs();
609 for (const auto &O : Overloads) {
610 assert(Overload0NumArgs == O->getNumArgs());
613 return Overload0NumArgs;
616 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
617 std::vector<ArgKind> &Kinds) const override {
618 for (const auto &O : Overloads) {
619 if (O->isConvertibleTo(ThisKind))
620 O->getArgKinds(ThisKind, ArgNo, Kinds);
624 bool isConvertibleTo(
625 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
626 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
627 for (const auto &O : Overloads) {
628 if (O->isConvertibleTo(Kind, Specificity, LeastDerivedKind))
635 std::vector<std::unique_ptr<MatcherDescriptor>> Overloads;
638 /// \brief Variadic operator marshaller function.
639 class VariadicOperatorMatcherDescriptor : public MatcherDescriptor {
641 using VarOp = DynTypedMatcher::VariadicOperator;
643 VariadicOperatorMatcherDescriptor(unsigned MinCount, unsigned MaxCount,
644 VarOp Op, StringRef MatcherName)
645 : MinCount(MinCount), MaxCount(MaxCount), Op(Op),
646 MatcherName(MatcherName) {}
648 VariantMatcher create(SourceRange NameRange,
649 ArrayRef<ParserValue> Args,
650 Diagnostics *Error) const override {
651 if (Args.size() < MinCount || MaxCount < Args.size()) {
652 const std::string MaxStr =
653 (MaxCount == std::numeric_limits<unsigned>::max() ? ""
656 Error->addError(NameRange, Error->ET_RegistryWrongArgCount)
657 << ("(" + Twine(MinCount) + ", " + MaxStr + ")") << Args.size();
658 return VariantMatcher();
661 std::vector<VariantMatcher> InnerArgs;
662 for (size_t i = 0, e = Args.size(); i != e; ++i) {
663 const ParserValue &Arg = Args[i];
664 const VariantValue &Value = Arg.Value;
665 if (!Value.isMatcher()) {
666 Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
667 << (i + 1) << "Matcher<>" << Value.getTypeAsString();
668 return VariantMatcher();
670 InnerArgs.push_back(Value.getMatcher());
672 return VariantMatcher::VariadicOperatorMatcher(Op, std::move(InnerArgs));
675 bool isVariadic() const override { return true; }
676 unsigned getNumArgs() const override { return 0; }
678 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
679 std::vector<ArgKind> &Kinds) const override {
680 Kinds.push_back(ThisKind);
683 bool isConvertibleTo(ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
684 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
687 if (LeastDerivedKind)
688 *LeastDerivedKind = Kind;
692 bool isPolymorphic() const override { return true; }
695 const unsigned MinCount;
696 const unsigned MaxCount;
698 const StringRef MatcherName;
701 /// Helper functions to select the appropriate marshaller functions.
702 /// They detect the number of arguments, arguments types and return type.
704 /// \brief 0-arg overload
705 template <typename ReturnType>
706 std::unique_ptr<MatcherDescriptor>
707 makeMatcherAutoMarshall(ReturnType (*Func)(), StringRef MatcherName) {
708 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
709 BuildReturnTypeVector<ReturnType>::build(RetTypes);
710 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
711 matcherMarshall0<ReturnType>, reinterpret_cast<void (*)()>(Func),
712 MatcherName, RetTypes, None);
715 /// \brief 1-arg overload
716 template <typename ReturnType, typename ArgType1>
717 std::unique_ptr<MatcherDescriptor>
718 makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1), StringRef MatcherName) {
719 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
720 BuildReturnTypeVector<ReturnType>::build(RetTypes);
721 ArgKind AK = ArgTypeTraits<ArgType1>::getKind();
722 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
723 matcherMarshall1<ReturnType, ArgType1>,
724 reinterpret_cast<void (*)()>(Func), MatcherName, RetTypes, AK);
727 /// \brief 2-arg overload
728 template <typename ReturnType, typename ArgType1, typename ArgType2>
729 std::unique_ptr<MatcherDescriptor>
730 makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1, ArgType2),
731 StringRef MatcherName) {
732 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
733 BuildReturnTypeVector<ReturnType>::build(RetTypes);
734 ArgKind AKs[] = { ArgTypeTraits<ArgType1>::getKind(),
735 ArgTypeTraits<ArgType2>::getKind() };
736 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
737 matcherMarshall2<ReturnType, ArgType1, ArgType2>,
738 reinterpret_cast<void (*)()>(Func), MatcherName, RetTypes, AKs);
741 /// \brief Variadic overload.
742 template <typename ResultT, typename ArgT,
743 ResultT (*Func)(ArrayRef<const ArgT *>)>
744 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
745 ast_matchers::internal::VariadicFunction<ResultT, ArgT, Func> VarFunc,
746 StringRef MatcherName) {
747 return llvm::make_unique<VariadicFuncMatcherDescriptor>(VarFunc, MatcherName);
750 /// \brief Overload for VariadicDynCastAllOfMatchers.
752 /// Not strictly necessary, but DynCastAllOfMatcherDescriptor gives us better
753 /// completion results for that type of matcher.
754 template <typename BaseT, typename DerivedT>
755 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
756 ast_matchers::internal::VariadicDynCastAllOfMatcher<BaseT, DerivedT>
758 StringRef MatcherName) {
759 return llvm::make_unique<DynCastAllOfMatcherDescriptor>(VarFunc, MatcherName);
762 /// \brief Argument adaptative overload.
763 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
764 typename FromTypes, typename ToTypes>
765 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
766 ast_matchers::internal::ArgumentAdaptingMatcherFunc<ArgumentAdapterT,
768 StringRef MatcherName) {
769 std::vector<std::unique_ptr<MatcherDescriptor>> Overloads;
770 AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes, ToTypes>(MatcherName,
772 return llvm::make_unique<OverloadedMatcherDescriptor>(Overloads);
775 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
776 typename FromTypes, typename ToTypes>
777 template <typename FromTypeList>
778 inline void AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes,
779 ToTypes>::collect(FromTypeList) {
780 Out.push_back(makeMatcherAutoMarshall(
781 &AdaptativeFunc::template create<typename FromTypeList::head>, Name));
782 collect(typename FromTypeList::tail());
785 /// \brief Variadic operator overload.
786 template <unsigned MinCount, unsigned MaxCount>
787 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
788 ast_matchers::internal::VariadicOperatorMatcherFunc<MinCount, MaxCount>
790 StringRef MatcherName) {
791 return llvm::make_unique<VariadicOperatorMatcherDescriptor>(
792 MinCount, MaxCount, Func.Op, MatcherName);
795 } // namespace internal
796 } // namespace dynamic
797 } // namespace ast_matchers
800 #endif // LLVM_CLANG_AST_MATCHERS_DYNAMIC_MARSHALLERS_H