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/ASTMatchers/ASTMatchers.h"
24 #include "clang/ASTMatchers/Dynamic/Diagnostics.h"
25 #include "clang/ASTMatchers/Dynamic/VariantValue.h"
26 #include "clang/Basic/LLVM.h"
27 #include "llvm/ADT/STLExtras.h"
31 namespace ast_matchers {
35 /// \brief Helper template class to just from argument type to the right is/get
36 /// functions in VariantValue.
37 /// Used to verify and extract the matcher arguments below.
38 template <class T> struct ArgTypeTraits;
39 template <class T> struct ArgTypeTraits<const T &> : public ArgTypeTraits<T> {
42 template <> struct ArgTypeTraits<std::string> {
43 static bool is(const VariantValue &Value) { return Value.isString(); }
44 static const std::string &get(const VariantValue &Value) {
45 return Value.getString();
47 static ArgKind getKind() {
48 return ArgKind(ArgKind::AK_String);
53 struct ArgTypeTraits<StringRef> : public ArgTypeTraits<std::string> {
56 template <class T> struct ArgTypeTraits<ast_matchers::internal::Matcher<T> > {
57 static bool is(const VariantValue &Value) {
58 return Value.isMatcher() && Value.getMatcher().hasTypedMatcher<T>();
60 static ast_matchers::internal::Matcher<T> get(const VariantValue &Value) {
61 return Value.getMatcher().getTypedMatcher<T>();
63 static ArgKind getKind() {
64 return ArgKind(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
68 template <> struct ArgTypeTraits<unsigned> {
69 static bool is(const VariantValue &Value) { return Value.isUnsigned(); }
70 static unsigned get(const VariantValue &Value) {
71 return Value.getUnsigned();
73 static ArgKind getKind() {
74 return ArgKind(ArgKind::AK_Unsigned);
78 template <> struct ArgTypeTraits<attr::Kind> {
80 static attr::Kind getAttrKind(llvm::StringRef AttrKind) {
81 return llvm::StringSwitch<attr::Kind>(AttrKind)
82 #define ATTR(X) .Case("attr::" #X, attr:: X)
83 #include "clang/Basic/AttrList.inc"
84 .Default(attr::Kind(-1));
87 static bool is(const VariantValue &Value) {
88 return Value.isString() &&
89 getAttrKind(Value.getString()) != attr::Kind(-1);
91 static attr::Kind get(const VariantValue &Value) {
92 return getAttrKind(Value.getString());
94 static ArgKind getKind() {
95 return ArgKind(ArgKind::AK_String);
99 template <> struct ArgTypeTraits<clang::CastKind> {
101 static clang::CastKind getCastKind(llvm::StringRef AttrKind) {
102 return llvm::StringSwitch<clang::CastKind>(AttrKind)
103 #define CAST_OPERATION(Name) .Case( #Name, CK_##Name)
104 #include "clang/AST/OperationKinds.def"
105 .Default(CK_Invalid);
109 static bool is(const VariantValue &Value) {
110 return Value.isString() &&
111 getCastKind(Value.getString()) != CK_Invalid;
113 static clang::CastKind get(const VariantValue &Value) {
114 return getCastKind(Value.getString());
116 static ArgKind getKind() {
117 return ArgKind(ArgKind::AK_String);
121 /// \brief Matcher descriptor interface.
123 /// Provides a \c create() method that constructs the matcher from the provided
124 /// arguments, and various other methods for type introspection.
125 class MatcherDescriptor {
127 virtual ~MatcherDescriptor() {}
128 virtual VariantMatcher create(SourceRange NameRange,
129 ArrayRef<ParserValue> Args,
130 Diagnostics *Error) const = 0;
132 /// Returns whether the matcher is variadic. Variadic matchers can take any
133 /// number of arguments, but they must be of the same type.
134 virtual bool isVariadic() const = 0;
136 /// Returns the number of arguments accepted by the matcher if not variadic.
137 virtual unsigned getNumArgs() const = 0;
139 /// Given that the matcher is being converted to type \p ThisKind, append the
140 /// set of argument types accepted for argument \p ArgNo to \p ArgKinds.
141 // FIXME: We should provide the ability to constrain the output of this
142 // function based on the types of other matcher arguments.
143 virtual void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
144 std::vector<ArgKind> &ArgKinds) const = 0;
146 /// Returns whether this matcher is convertible to the given type. If it is
147 /// so convertible, store in *Specificity a value corresponding to the
148 /// "specificity" of the converted matcher to the given context, and in
149 /// *LeastDerivedKind the least derived matcher kind which would result in the
150 /// same matcher overload. Zero specificity indicates that this conversion
151 /// would produce a trivial matcher that will either always or never match.
152 /// Such matchers are excluded from code completion results.
153 virtual bool isConvertibleTo(
154 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity = nullptr,
155 ast_type_traits::ASTNodeKind *LeastDerivedKind = nullptr) const = 0;
157 /// Returns whether the matcher will, given a matcher of any type T, yield a
158 /// matcher of type T.
159 virtual bool isPolymorphic() const { return false; }
162 inline bool isRetKindConvertibleTo(
163 ArrayRef<ast_type_traits::ASTNodeKind> RetKinds,
164 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
165 ast_type_traits::ASTNodeKind *LeastDerivedKind) {
166 for (const ast_type_traits::ASTNodeKind &NodeKind : RetKinds) {
167 if (ArgKind(NodeKind).isConvertibleTo(Kind, Specificity)) {
168 if (LeastDerivedKind)
169 *LeastDerivedKind = NodeKind;
176 /// \brief Simple callback implementation. Marshaller and function are provided.
178 /// This class wraps a function of arbitrary signature and a marshaller
179 /// function into a MatcherDescriptor.
180 /// The marshaller is in charge of taking the VariantValue arguments, checking
181 /// their types, unpacking them and calling the underlying function.
182 class FixedArgCountMatcherDescriptor : public MatcherDescriptor {
184 typedef VariantMatcher (*MarshallerType)(void (*Func)(),
185 StringRef MatcherName,
186 SourceRange NameRange,
187 ArrayRef<ParserValue> Args,
190 /// \param Marshaller Function to unpack the arguments and call \c Func
191 /// \param Func Matcher construct function. This is the function that
192 /// compile-time matcher expressions would use to create the matcher.
193 /// \param RetKinds The list of matcher types to which the matcher is
195 /// \param ArgKinds The types of the arguments this matcher takes.
196 FixedArgCountMatcherDescriptor(
197 MarshallerType Marshaller, void (*Func)(), StringRef MatcherName,
198 ArrayRef<ast_type_traits::ASTNodeKind> RetKinds,
199 ArrayRef<ArgKind> ArgKinds)
200 : Marshaller(Marshaller), Func(Func), MatcherName(MatcherName),
201 RetKinds(RetKinds.begin(), RetKinds.end()),
202 ArgKinds(ArgKinds.begin(), ArgKinds.end()) {}
204 VariantMatcher create(SourceRange NameRange,
205 ArrayRef<ParserValue> Args,
206 Diagnostics *Error) const override {
207 return Marshaller(Func, MatcherName, NameRange, Args, Error);
210 bool isVariadic() const override { return false; }
211 unsigned getNumArgs() const override { return ArgKinds.size(); }
212 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
213 std::vector<ArgKind> &Kinds) const override {
214 Kinds.push_back(ArgKinds[ArgNo]);
216 bool isConvertibleTo(
217 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
218 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
219 return isRetKindConvertibleTo(RetKinds, Kind, Specificity,
224 const MarshallerType Marshaller;
225 void (* const Func)();
226 const std::string MatcherName;
227 const std::vector<ast_type_traits::ASTNodeKind> RetKinds;
228 const std::vector<ArgKind> ArgKinds;
231 /// \brief Helper methods to extract and merge all possible typed matchers
232 /// out of the polymorphic object.
233 template <class PolyMatcher>
234 static void mergePolyMatchers(const PolyMatcher &Poly,
235 std::vector<DynTypedMatcher> &Out,
236 ast_matchers::internal::EmptyTypeList) {}
238 template <class PolyMatcher, class TypeList>
239 static void mergePolyMatchers(const PolyMatcher &Poly,
240 std::vector<DynTypedMatcher> &Out, TypeList) {
241 Out.push_back(ast_matchers::internal::Matcher<typename TypeList::head>(Poly));
242 mergePolyMatchers(Poly, Out, typename TypeList::tail());
245 /// \brief Convert the return values of the functions into a VariantMatcher.
247 /// There are 2 cases right now: The return value is a Matcher<T> or is a
248 /// polymorphic matcher. For the former, we just construct the VariantMatcher.
249 /// For the latter, we instantiate all the possible Matcher<T> of the poly
251 static VariantMatcher outvalueToVariantMatcher(const DynTypedMatcher &Matcher) {
252 return VariantMatcher::SingleMatcher(Matcher);
255 template <typename T>
256 static VariantMatcher outvalueToVariantMatcher(const T &PolyMatcher,
257 typename T::ReturnTypes * =
259 std::vector<DynTypedMatcher> Matchers;
260 mergePolyMatchers(PolyMatcher, Matchers, typename T::ReturnTypes());
261 VariantMatcher Out = VariantMatcher::PolymorphicMatcher(std::move(Matchers));
265 template <typename T>
266 inline void buildReturnTypeVectorFromTypeList(
267 std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
269 ast_type_traits::ASTNodeKind::getFromNodeKind<typename T::head>());
270 buildReturnTypeVectorFromTypeList<typename T::tail>(RetTypes);
275 buildReturnTypeVectorFromTypeList<ast_matchers::internal::EmptyTypeList>(
276 std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {}
278 template <typename T>
279 struct BuildReturnTypeVector {
280 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
281 buildReturnTypeVectorFromTypeList<typename T::ReturnTypes>(RetTypes);
285 template <typename T>
286 struct BuildReturnTypeVector<ast_matchers::internal::Matcher<T> > {
287 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
288 RetTypes.push_back(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
292 template <typename T>
293 struct BuildReturnTypeVector<ast_matchers::internal::BindableMatcher<T> > {
294 static void build(std::vector<ast_type_traits::ASTNodeKind> &RetTypes) {
295 RetTypes.push_back(ast_type_traits::ASTNodeKind::getFromNodeKind<T>());
299 /// \brief Variadic marshaller function.
300 template <typename ResultT, typename ArgT,
301 ResultT (*Func)(ArrayRef<const ArgT *>)>
303 variadicMatcherDescriptor(StringRef MatcherName, SourceRange NameRange,
304 ArrayRef<ParserValue> Args, Diagnostics *Error) {
305 ArgT **InnerArgs = new ArgT *[Args.size()]();
307 bool HasError = false;
308 for (size_t i = 0, e = Args.size(); i != e; ++i) {
309 typedef ArgTypeTraits<ArgT> ArgTraits;
310 const ParserValue &Arg = Args[i];
311 const VariantValue &Value = Arg.Value;
312 if (!ArgTraits::is(Value)) {
313 Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
314 << (i + 1) << ArgTraits::getKind().asString() << Value.getTypeAsString();
318 InnerArgs[i] = new ArgT(ArgTraits::get(Value));
323 Out = outvalueToVariantMatcher(Func(llvm::makeArrayRef(InnerArgs,
327 for (size_t i = 0, e = Args.size(); i != e; ++i) {
334 /// \brief Matcher descriptor for variadic functions.
336 /// This class simply wraps a VariadicFunction with the right signature to export
337 /// it as a MatcherDescriptor.
338 /// This allows us to have one implementation of the interface for as many free
339 /// functions as we want, reducing the number of symbols and size of the
341 class VariadicFuncMatcherDescriptor : public MatcherDescriptor {
343 typedef VariantMatcher (*RunFunc)(StringRef MatcherName,
344 SourceRange NameRange,
345 ArrayRef<ParserValue> Args,
348 template <typename ResultT, typename ArgT,
349 ResultT (*F)(ArrayRef<const ArgT *>)>
350 VariadicFuncMatcherDescriptor(
351 ast_matchers::internal::VariadicFunction<ResultT, ArgT, F> Func,
352 StringRef MatcherName)
353 : Func(&variadicMatcherDescriptor<ResultT, ArgT, F>),
354 MatcherName(MatcherName.str()),
355 ArgsKind(ArgTypeTraits<ArgT>::getKind()) {
356 BuildReturnTypeVector<ResultT>::build(RetKinds);
359 VariantMatcher create(SourceRange NameRange,
360 ArrayRef<ParserValue> Args,
361 Diagnostics *Error) const override {
362 return Func(MatcherName, NameRange, Args, Error);
365 bool isVariadic() const override { return true; }
366 unsigned getNumArgs() const override { return 0; }
367 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
368 std::vector<ArgKind> &Kinds) const override {
369 Kinds.push_back(ArgsKind);
371 bool isConvertibleTo(
372 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
373 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
374 return isRetKindConvertibleTo(RetKinds, Kind, Specificity,
380 const std::string MatcherName;
381 std::vector<ast_type_traits::ASTNodeKind> RetKinds;
382 const ArgKind ArgsKind;
385 /// \brief Return CK_Trivial when appropriate for VariadicDynCastAllOfMatchers.
386 class DynCastAllOfMatcherDescriptor : public VariadicFuncMatcherDescriptor {
388 template <typename BaseT, typename DerivedT>
389 DynCastAllOfMatcherDescriptor(
390 ast_matchers::internal::VariadicDynCastAllOfMatcher<BaseT, DerivedT> Func,
391 StringRef MatcherName)
392 : VariadicFuncMatcherDescriptor(Func, MatcherName),
393 DerivedKind(ast_type_traits::ASTNodeKind::getFromNodeKind<DerivedT>()) {
397 isConvertibleTo(ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
398 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
399 // If Kind is not a base of DerivedKind, either DerivedKind is a base of
400 // Kind (in which case the match will always succeed) or Kind and
401 // DerivedKind are unrelated (in which case it will always fail), so set
403 if (VariadicFuncMatcherDescriptor::isConvertibleTo(Kind, Specificity,
405 if (Kind.isSame(DerivedKind) || !Kind.isBaseOf(DerivedKind)) {
416 const ast_type_traits::ASTNodeKind DerivedKind;
419 /// \brief Helper macros to check the arguments on all marshaller functions.
420 #define CHECK_ARG_COUNT(count) \
421 if (Args.size() != count) { \
422 Error->addError(NameRange, Error->ET_RegistryWrongArgCount) \
423 << count << Args.size(); \
424 return VariantMatcher(); \
427 #define CHECK_ARG_TYPE(index, type) \
428 if (!ArgTypeTraits<type>::is(Args[index].Value)) { \
429 Error->addError(Args[index].Range, Error->ET_RegistryWrongArgType) \
430 << (index + 1) << ArgTypeTraits<type>::getKind().asString() \
431 << Args[index].Value.getTypeAsString(); \
432 return VariantMatcher(); \
435 /// \brief 0-arg marshaller function.
436 template <typename ReturnType>
437 static VariantMatcher matcherMarshall0(void (*Func)(), StringRef MatcherName,
438 SourceRange NameRange,
439 ArrayRef<ParserValue> Args,
440 Diagnostics *Error) {
441 typedef ReturnType (*FuncType)();
443 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)());
446 /// \brief 1-arg marshaller function.
447 template <typename ReturnType, typename ArgType1>
448 static VariantMatcher matcherMarshall1(void (*Func)(), StringRef MatcherName,
449 SourceRange NameRange,
450 ArrayRef<ParserValue> Args,
451 Diagnostics *Error) {
452 typedef ReturnType (*FuncType)(ArgType1);
454 CHECK_ARG_TYPE(0, ArgType1);
455 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
456 ArgTypeTraits<ArgType1>::get(Args[0].Value)));
459 /// \brief 2-arg marshaller function.
460 template <typename ReturnType, typename ArgType1, typename ArgType2>
461 static VariantMatcher matcherMarshall2(void (*Func)(), StringRef MatcherName,
462 SourceRange NameRange,
463 ArrayRef<ParserValue> Args,
464 Diagnostics *Error) {
465 typedef ReturnType (*FuncType)(ArgType1, ArgType2);
467 CHECK_ARG_TYPE(0, ArgType1);
468 CHECK_ARG_TYPE(1, ArgType2);
469 return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
470 ArgTypeTraits<ArgType1>::get(Args[0].Value),
471 ArgTypeTraits<ArgType2>::get(Args[1].Value)));
474 #undef CHECK_ARG_COUNT
475 #undef CHECK_ARG_TYPE
477 /// \brief Helper class used to collect all the possible overloads of an
478 /// argument adaptative matcher function.
479 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
480 typename FromTypes, typename ToTypes>
481 class AdaptativeOverloadCollector {
483 AdaptativeOverloadCollector(
484 StringRef Name, std::vector<std::unique_ptr<MatcherDescriptor>> &Out)
485 : Name(Name), Out(Out) {
486 collect(FromTypes());
490 typedef ast_matchers::internal::ArgumentAdaptingMatcherFunc<
491 ArgumentAdapterT, FromTypes, ToTypes> AdaptativeFunc;
493 /// \brief End case for the recursion
494 static void collect(ast_matchers::internal::EmptyTypeList) {}
496 /// \brief Recursive case. Get the overload for the head of the list, and
497 /// recurse to the tail.
498 template <typename FromTypeList>
499 inline void collect(FromTypeList);
502 std::vector<std::unique_ptr<MatcherDescriptor>> &Out;
505 /// \brief MatcherDescriptor that wraps multiple "overloads" of the same
508 /// It will try every overload and generate appropriate errors for when none or
509 /// more than one overloads match the arguments.
510 class OverloadedMatcherDescriptor : public MatcherDescriptor {
512 OverloadedMatcherDescriptor(
513 MutableArrayRef<std::unique_ptr<MatcherDescriptor>> Callbacks)
514 : Overloads(std::make_move_iterator(Callbacks.begin()),
515 std::make_move_iterator(Callbacks.end())) {}
517 ~OverloadedMatcherDescriptor() override {}
519 VariantMatcher create(SourceRange NameRange,
520 ArrayRef<ParserValue> Args,
521 Diagnostics *Error) const override {
522 std::vector<VariantMatcher> Constructed;
523 Diagnostics::OverloadContext Ctx(Error);
524 for (const auto &O : Overloads) {
525 VariantMatcher SubMatcher = O->create(NameRange, Args, Error);
526 if (!SubMatcher.isNull()) {
527 Constructed.push_back(SubMatcher);
531 if (Constructed.empty()) return VariantMatcher(); // No overload matched.
532 // We ignore the errors if any matcher succeeded.
534 if (Constructed.size() > 1) {
535 // More than one constructed. It is ambiguous.
536 Error->addError(NameRange, Error->ET_RegistryAmbiguousOverload);
537 return VariantMatcher();
539 return Constructed[0];
542 bool isVariadic() const override {
543 bool Overload0Variadic = Overloads[0]->isVariadic();
545 for (const auto &O : Overloads) {
546 assert(Overload0Variadic == O->isVariadic());
549 return Overload0Variadic;
552 unsigned getNumArgs() const override {
553 unsigned Overload0NumArgs = Overloads[0]->getNumArgs();
555 for (const auto &O : Overloads) {
556 assert(Overload0NumArgs == O->getNumArgs());
559 return Overload0NumArgs;
562 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
563 std::vector<ArgKind> &Kinds) const override {
564 for (const auto &O : Overloads) {
565 if (O->isConvertibleTo(ThisKind))
566 O->getArgKinds(ThisKind, ArgNo, Kinds);
570 bool isConvertibleTo(
571 ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
572 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
573 for (const auto &O : Overloads) {
574 if (O->isConvertibleTo(Kind, Specificity, LeastDerivedKind))
581 std::vector<std::unique_ptr<MatcherDescriptor>> Overloads;
584 /// \brief Variadic operator marshaller function.
585 class VariadicOperatorMatcherDescriptor : public MatcherDescriptor {
587 typedef DynTypedMatcher::VariadicOperator VarOp;
588 VariadicOperatorMatcherDescriptor(unsigned MinCount, unsigned MaxCount,
589 VarOp Op, StringRef MatcherName)
590 : MinCount(MinCount), MaxCount(MaxCount), Op(Op),
591 MatcherName(MatcherName) {}
593 VariantMatcher create(SourceRange NameRange,
594 ArrayRef<ParserValue> Args,
595 Diagnostics *Error) const override {
596 if (Args.size() < MinCount || MaxCount < Args.size()) {
597 const std::string MaxStr =
598 (MaxCount == UINT_MAX ? "" : Twine(MaxCount)).str();
599 Error->addError(NameRange, Error->ET_RegistryWrongArgCount)
600 << ("(" + Twine(MinCount) + ", " + MaxStr + ")") << Args.size();
601 return VariantMatcher();
604 std::vector<VariantMatcher> InnerArgs;
605 for (size_t i = 0, e = Args.size(); i != e; ++i) {
606 const ParserValue &Arg = Args[i];
607 const VariantValue &Value = Arg.Value;
608 if (!Value.isMatcher()) {
609 Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
610 << (i + 1) << "Matcher<>" << Value.getTypeAsString();
611 return VariantMatcher();
613 InnerArgs.push_back(Value.getMatcher());
615 return VariantMatcher::VariadicOperatorMatcher(Op, std::move(InnerArgs));
618 bool isVariadic() const override { return true; }
619 unsigned getNumArgs() const override { return 0; }
620 void getArgKinds(ast_type_traits::ASTNodeKind ThisKind, unsigned ArgNo,
621 std::vector<ArgKind> &Kinds) const override {
622 Kinds.push_back(ThisKind);
624 bool isConvertibleTo(ast_type_traits::ASTNodeKind Kind, unsigned *Specificity,
625 ast_type_traits::ASTNodeKind *LeastDerivedKind) const override {
628 if (LeastDerivedKind)
629 *LeastDerivedKind = Kind;
632 bool isPolymorphic() const override { return true; }
635 const unsigned MinCount;
636 const unsigned MaxCount;
638 const StringRef MatcherName;
641 /// Helper functions to select the appropriate marshaller functions.
642 /// They detect the number of arguments, arguments types and return type.
644 /// \brief 0-arg overload
645 template <typename ReturnType>
646 std::unique_ptr<MatcherDescriptor>
647 makeMatcherAutoMarshall(ReturnType (*Func)(), StringRef MatcherName) {
648 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
649 BuildReturnTypeVector<ReturnType>::build(RetTypes);
650 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
651 matcherMarshall0<ReturnType>, reinterpret_cast<void (*)()>(Func),
652 MatcherName, RetTypes, None);
655 /// \brief 1-arg overload
656 template <typename ReturnType, typename ArgType1>
657 std::unique_ptr<MatcherDescriptor>
658 makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1), StringRef MatcherName) {
659 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
660 BuildReturnTypeVector<ReturnType>::build(RetTypes);
661 ArgKind AK = ArgTypeTraits<ArgType1>::getKind();
662 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
663 matcherMarshall1<ReturnType, ArgType1>,
664 reinterpret_cast<void (*)()>(Func), MatcherName, RetTypes, AK);
667 /// \brief 2-arg overload
668 template <typename ReturnType, typename ArgType1, typename ArgType2>
669 std::unique_ptr<MatcherDescriptor>
670 makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1, ArgType2),
671 StringRef MatcherName) {
672 std::vector<ast_type_traits::ASTNodeKind> RetTypes;
673 BuildReturnTypeVector<ReturnType>::build(RetTypes);
674 ArgKind AKs[] = { ArgTypeTraits<ArgType1>::getKind(),
675 ArgTypeTraits<ArgType2>::getKind() };
676 return llvm::make_unique<FixedArgCountMatcherDescriptor>(
677 matcherMarshall2<ReturnType, ArgType1, ArgType2>,
678 reinterpret_cast<void (*)()>(Func), MatcherName, RetTypes, AKs);
681 /// \brief Variadic overload.
682 template <typename ResultT, typename ArgT,
683 ResultT (*Func)(ArrayRef<const ArgT *>)>
684 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
685 ast_matchers::internal::VariadicFunction<ResultT, ArgT, Func> VarFunc,
686 StringRef MatcherName) {
687 return llvm::make_unique<VariadicFuncMatcherDescriptor>(VarFunc, MatcherName);
690 /// \brief Overload for VariadicDynCastAllOfMatchers.
692 /// Not strictly necessary, but DynCastAllOfMatcherDescriptor gives us better
693 /// completion results for that type of matcher.
694 template <typename BaseT, typename DerivedT>
695 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
696 ast_matchers::internal::VariadicDynCastAllOfMatcher<BaseT, DerivedT>
698 StringRef MatcherName) {
699 return llvm::make_unique<DynCastAllOfMatcherDescriptor>(VarFunc, MatcherName);
702 /// \brief Argument adaptative overload.
703 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
704 typename FromTypes, typename ToTypes>
705 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
706 ast_matchers::internal::ArgumentAdaptingMatcherFunc<ArgumentAdapterT,
708 StringRef MatcherName) {
709 std::vector<std::unique_ptr<MatcherDescriptor>> Overloads;
710 AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes, ToTypes>(MatcherName,
712 return llvm::make_unique<OverloadedMatcherDescriptor>(Overloads);
715 template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
716 typename FromTypes, typename ToTypes>
717 template <typename FromTypeList>
718 inline void AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes,
719 ToTypes>::collect(FromTypeList) {
720 Out.push_back(makeMatcherAutoMarshall(
721 &AdaptativeFunc::template create<typename FromTypeList::head>, Name));
722 collect(typename FromTypeList::tail());
725 /// \brief Variadic operator overload.
726 template <unsigned MinCount, unsigned MaxCount>
727 std::unique_ptr<MatcherDescriptor> makeMatcherAutoMarshall(
728 ast_matchers::internal::VariadicOperatorMatcherFunc<MinCount, MaxCount>
730 StringRef MatcherName) {
731 return llvm::make_unique<VariadicOperatorMatcherDescriptor>(
732 MinCount, MaxCount, Func.Op, MatcherName);
735 } // namespace internal
736 } // namespace dynamic
737 } // namespace ast_matchers
740 #endif // LLVM_CLANG_AST_MATCHERS_DYNAMIC_MARSHALLERS_H