454 lines
17 KiB
C
454 lines
17 KiB
C
|
//===--- Marshallers.h - Generic matcher function marshallers -*- C++ -*-===//
|
||
|
|
//
|
||
|
|
// The LLVM Compiler Infrastructure
|
||
|
|
//
|
||
|
|
// This file is distributed under the University of Illinois Open Source
|
||
|
|
// License. See LICENSE.TXT for details.
|
||
|
|
//
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
///
|
||
|
|
/// \file
|
||
|
|
/// \brief Functions templates and classes to wrap matcher construct functions.
|
||
|
|
///
|
||
|
|
/// A collection of template function and classes that provide a generic
|
||
|
|
/// marshalling layer on top of matcher construct functions.
|
||
|
|
/// These are used by the registry to export all marshaller constructors with
|
||
|
|
/// the same generic interface.
|
||
|
|
///
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
|
||
|
|
#ifndef LLVM_CLANG_AST_MATCHERS_DYNAMIC_MARSHALLERS_H
|
||
|
|
#define LLVM_CLANG_AST_MATCHERS_DYNAMIC_MARSHALLERS_H
|
||
|
|
|
||
|
|
#include <string>
|
||
|
|
|
||
|
|
#include "clang/ASTMatchers/ASTMatchers.h"
|
||
|
|
#include "clang/ASTMatchers/Dynamic/Diagnostics.h"
|
||
|
|
#include "clang/ASTMatchers/Dynamic/VariantValue.h"
|
||
|
|
#include "clang/Basic/LLVM.h"
|
||
|
|
#include "llvm/ADT/STLExtras.h"
|
||
|
|
#include "llvm/Support/type_traits.h"
|
||
|
|
|
||
|
|
namespace clang {
|
||
|
|
namespace ast_matchers {
|
||
|
|
namespace dynamic {
|
||
|
|
|
||
|
|
namespace internal {
|
||
|
|
|
||
|
|
/// \brief Helper template class to just from argument type to the right is/get
|
||
|
|
/// functions in VariantValue.
|
||
|
|
/// Used to verify and extract the matcher arguments below.
|
||
|
|
template <class T> struct ArgTypeTraits;
|
||
|
|
template <class T> struct ArgTypeTraits<const T &> : public ArgTypeTraits<T> {
|
||
|
|
};
|
||
|
|
|
||
|
|
template <> struct ArgTypeTraits<std::string> {
|
||
|
|
static StringRef asString() { return "String"; }
|
||
|
|
static bool is(const VariantValue &Value) { return Value.isString(); }
|
||
|
|
static const std::string &get(const VariantValue &Value) {
|
||
|
|
return Value.getString();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <>
|
||
|
|
struct ArgTypeTraits<StringRef> : public ArgTypeTraits<std::string> {
|
||
|
|
};
|
||
|
|
|
||
|
|
template <class T> struct ArgTypeTraits<ast_matchers::internal::Matcher<T> > {
|
||
|
|
static std::string asString() {
|
||
|
|
return (Twine("Matcher<") +
|
||
|
|
ast_type_traits::ASTNodeKind::getFromNodeKind<T>().asStringRef() +
|
||
|
|
">").str();
|
||
|
|
}
|
||
|
|
static bool is(const VariantValue &Value) {
|
||
|
|
return Value.isMatcher() && Value.getMatcher().hasTypedMatcher<T>();
|
||
|
|
}
|
||
|
|
static ast_matchers::internal::Matcher<T> get(const VariantValue &Value) {
|
||
|
|
return Value.getMatcher().getTypedMatcher<T>();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
template <> struct ArgTypeTraits<unsigned> {
|
||
|
|
static std::string asString() { return "Unsigned"; }
|
||
|
|
static bool is(const VariantValue &Value) { return Value.isUnsigned(); }
|
||
|
|
static unsigned get(const VariantValue &Value) {
|
||
|
|
return Value.getUnsigned();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief Generic MatcherCreate interface.
|
||
|
|
///
|
||
|
|
/// Provides a \c run() method that constructs the matcher from the provided
|
||
|
|
/// arguments.
|
||
|
|
class MatcherCreateCallback {
|
||
|
|
public:
|
||
|
|
virtual ~MatcherCreateCallback() {}
|
||
|
|
virtual VariantMatcher run(const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) const = 0;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief Simple callback implementation. Marshaller and function are provided.
|
||
|
|
///
|
||
|
|
/// This class wraps a function of arbitrary signature and a marshaller
|
||
|
|
/// function into a MatcherCreateCallback.
|
||
|
|
/// The marshaller is in charge of taking the VariantValue arguments, checking
|
||
|
|
/// their types, unpacking them and calling the underlying function.
|
||
|
|
class FixedArgCountMatcherCreateCallback : public MatcherCreateCallback {
|
||
|
|
public:
|
||
|
|
typedef VariantMatcher (*MarshallerType)(void (*Func)(),
|
||
|
|
StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error);
|
||
|
|
|
||
|
|
/// \param Marshaller Function to unpack the arguments and call \c Func
|
||
|
|
/// \param Func Matcher construct function. This is the function that
|
||
|
|
/// compile-time matcher expressions would use to create the matcher.
|
||
|
|
FixedArgCountMatcherCreateCallback(MarshallerType Marshaller, void (*Func)(),
|
||
|
|
StringRef MatcherName)
|
||
|
|
: Marshaller(Marshaller), Func(Func), MatcherName(MatcherName) {}
|
||
|
|
|
||
|
|
VariantMatcher run(const SourceRange &NameRange, ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) const {
|
||
|
|
return Marshaller(Func, MatcherName, NameRange, Args, Error);
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
const MarshallerType Marshaller;
|
||
|
|
void (* const Func)();
|
||
|
|
const std::string MatcherName;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief Simple callback implementation. Free function is wrapped.
|
||
|
|
///
|
||
|
|
/// This class simply wraps a free function with the right signature to export
|
||
|
|
/// it as a MatcherCreateCallback.
|
||
|
|
/// This allows us to have one implementation of the interface for as many free
|
||
|
|
/// functions as we want, reducing the number of symbols and size of the
|
||
|
|
/// object file.
|
||
|
|
class FreeFuncMatcherCreateCallback : public MatcherCreateCallback {
|
||
|
|
public:
|
||
|
|
typedef VariantMatcher (*RunFunc)(StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error);
|
||
|
|
|
||
|
|
FreeFuncMatcherCreateCallback(RunFunc Func, StringRef MatcherName)
|
||
|
|
: Func(Func), MatcherName(MatcherName.str()) {}
|
||
|
|
|
||
|
|
VariantMatcher run(const SourceRange &NameRange, ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) const {
|
||
|
|
return Func(MatcherName, NameRange, Args, Error);
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
const RunFunc Func;
|
||
|
|
const std::string MatcherName;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief Helper macros to check the arguments on all marshaller functions.
|
||
|
|
#define CHECK_ARG_COUNT(count) \
|
||
|
|
if (Args.size() != count) { \
|
||
|
|
Error->addError(NameRange, Error->ET_RegistryWrongArgCount) \
|
||
|
|
<< count << Args.size(); \
|
||
|
|
return VariantMatcher(); \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define CHECK_ARG_TYPE(index, type) \
|
||
|
|
if (!ArgTypeTraits<type>::is(Args[index].Value)) { \
|
||
|
|
Error->addError(Args[index].Range, Error->ET_RegistryWrongArgType) \
|
||
|
|
<< (index + 1) << ArgTypeTraits<type>::asString() \
|
||
|
|
<< Args[index].Value.getTypeAsString(); \
|
||
|
|
return VariantMatcher(); \
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Helper methods to extract and merge all possible typed matchers
|
||
|
|
/// out of the polymorphic object.
|
||
|
|
template <class PolyMatcher>
|
||
|
|
static void mergePolyMatchers(const PolyMatcher &Poly,
|
||
|
|
std::vector<DynTypedMatcher> &Out,
|
||
|
|
ast_matchers::internal::EmptyTypeList) {}
|
||
|
|
|
||
|
|
template <class PolyMatcher, class TypeList>
|
||
|
|
static void mergePolyMatchers(const PolyMatcher &Poly,
|
||
|
|
std::vector<DynTypedMatcher> &Out, TypeList) {
|
||
|
|
Out.push_back(ast_matchers::internal::Matcher<typename TypeList::head>(Poly));
|
||
|
|
mergePolyMatchers(Poly, Out, typename TypeList::tail());
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Convert the return values of the functions into a VariantMatcher.
|
||
|
|
///
|
||
|
|
/// There are 2 cases right now: The return value is a Matcher<T> or is a
|
||
|
|
/// polymorphic matcher. For the former, we just construct the VariantMatcher.
|
||
|
|
/// For the latter, we instantiate all the possible Matcher<T> of the poly
|
||
|
|
/// matcher.
|
||
|
|
static VariantMatcher outvalueToVariantMatcher(const DynTypedMatcher &Matcher) {
|
||
|
|
return VariantMatcher::SingleMatcher(Matcher);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename T>
|
||
|
|
static VariantMatcher outvalueToVariantMatcher(const T &PolyMatcher,
|
||
|
|
typename T::ReturnTypes * =
|
||
|
|
NULL) {
|
||
|
|
std::vector<DynTypedMatcher> Matchers;
|
||
|
|
mergePolyMatchers(PolyMatcher, Matchers, typename T::ReturnTypes());
|
||
|
|
VariantMatcher Out = VariantMatcher::PolymorphicMatcher(Matchers);
|
||
|
|
return Out;
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief 0-arg marshaller function.
|
||
|
|
template <typename ReturnType>
|
||
|
|
static VariantMatcher matcherMarshall0(void (*Func)(), StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) {
|
||
|
|
typedef ReturnType (*FuncType)();
|
||
|
|
CHECK_ARG_COUNT(0);
|
||
|
|
return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)());
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief 1-arg marshaller function.
|
||
|
|
template <typename ReturnType, typename ArgType1>
|
||
|
|
static VariantMatcher matcherMarshall1(void (*Func)(), StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) {
|
||
|
|
typedef ReturnType (*FuncType)(ArgType1);
|
||
|
|
CHECK_ARG_COUNT(1);
|
||
|
|
CHECK_ARG_TYPE(0, ArgType1);
|
||
|
|
return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
|
||
|
|
ArgTypeTraits<ArgType1>::get(Args[0].Value)));
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief 2-arg marshaller function.
|
||
|
|
template <typename ReturnType, typename ArgType1, typename ArgType2>
|
||
|
|
static VariantMatcher matcherMarshall2(void (*Func)(), StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) {
|
||
|
|
typedef ReturnType (*FuncType)(ArgType1, ArgType2);
|
||
|
|
CHECK_ARG_COUNT(2);
|
||
|
|
CHECK_ARG_TYPE(0, ArgType1);
|
||
|
|
CHECK_ARG_TYPE(1, ArgType2);
|
||
|
|
return outvalueToVariantMatcher(reinterpret_cast<FuncType>(Func)(
|
||
|
|
ArgTypeTraits<ArgType1>::get(Args[0].Value),
|
||
|
|
ArgTypeTraits<ArgType2>::get(Args[1].Value)));
|
||
|
|
}
|
||
|
|
|
||
|
|
#undef CHECK_ARG_COUNT
|
||
|
|
#undef CHECK_ARG_TYPE
|
||
|
|
|
||
|
|
/// \brief Variadic marshaller function.
|
||
|
|
template <typename ResultT, typename ArgT,
|
||
|
|
ResultT (*Func)(ArrayRef<const ArgT *>)>
|
||
|
|
VariantMatcher
|
||
|
|
variadicMatcherCreateCallback(StringRef MatcherName,
|
||
|
|
const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args, Diagnostics *Error) {
|
||
|
|
ArgT **InnerArgs = new ArgT *[Args.size()]();
|
||
|
|
|
||
|
|
bool HasError = false;
|
||
|
|
for (size_t i = 0, e = Args.size(); i != e; ++i) {
|
||
|
|
typedef ArgTypeTraits<ArgT> ArgTraits;
|
||
|
|
const ParserValue &Arg = Args[i];
|
||
|
|
const VariantValue &Value = Arg.Value;
|
||
|
|
if (!ArgTraits::is(Value)) {
|
||
|
|
Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
|
||
|
|
<< (i + 1) << ArgTraits::asString() << Value.getTypeAsString();
|
||
|
|
HasError = true;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
InnerArgs[i] = new ArgT(ArgTraits::get(Value));
|
||
|
|
}
|
||
|
|
|
||
|
|
VariantMatcher Out;
|
||
|
|
if (!HasError) {
|
||
|
|
Out = outvalueToVariantMatcher(
|
||
|
|
Func(ArrayRef<const ArgT *>(InnerArgs, Args.size())));
|
||
|
|
}
|
||
|
|
|
||
|
|
for (size_t i = 0, e = Args.size(); i != e; ++i) {
|
||
|
|
delete InnerArgs[i];
|
||
|
|
}
|
||
|
|
delete[] InnerArgs;
|
||
|
|
return Out;
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Helper class used to collect all the possible overloads of an
|
||
|
|
/// argument adaptative matcher function.
|
||
|
|
template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
|
||
|
|
typename FromTypes, typename ToTypes>
|
||
|
|
class AdaptativeOverloadCollector {
|
||
|
|
public:
|
||
|
|
AdaptativeOverloadCollector(StringRef Name,
|
||
|
|
std::vector<MatcherCreateCallback *> &Out)
|
||
|
|
: Name(Name), Out(Out) {
|
||
|
|
collect(FromTypes());
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
typedef ast_matchers::internal::ArgumentAdaptingMatcherFunc<
|
||
|
|
ArgumentAdapterT, FromTypes, ToTypes> AdaptativeFunc;
|
||
|
|
|
||
|
|
/// \brief End case for the recursion
|
||
|
|
static void collect(ast_matchers::internal::EmptyTypeList) {}
|
||
|
|
|
||
|
|
/// \brief Recursive case. Get the overload for the head of the list, and
|
||
|
|
/// recurse to the tail.
|
||
|
|
template <typename FromTypeList> inline void collect(FromTypeList);
|
||
|
|
|
||
|
|
const StringRef Name;
|
||
|
|
std::vector<MatcherCreateCallback *> &Out;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief MatcherCreateCallback that wraps multiple "overloads" of the same
|
||
|
|
/// matcher.
|
||
|
|
///
|
||
|
|
/// It will try every overload and generate appropriate errors for when none or
|
||
|
|
/// more than one overloads match the arguments.
|
||
|
|
class OverloadedMatcherCreateCallback : public MatcherCreateCallback {
|
||
|
|
public:
|
||
|
|
OverloadedMatcherCreateCallback(ArrayRef<MatcherCreateCallback *> Callbacks)
|
||
|
|
: Overloads(Callbacks) {}
|
||
|
|
|
||
|
|
virtual ~OverloadedMatcherCreateCallback() {
|
||
|
|
llvm::DeleteContainerPointers(Overloads);
|
||
|
|
}
|
||
|
|
|
||
|
|
virtual VariantMatcher run(const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) const {
|
||
|
|
std::vector<VariantMatcher> Constructed;
|
||
|
|
Diagnostics::OverloadContext Ctx(Error);
|
||
|
|
for (size_t i = 0, e = Overloads.size(); i != e; ++i) {
|
||
|
|
VariantMatcher SubMatcher = Overloads[i]->run(NameRange, Args, Error);
|
||
|
|
if (!SubMatcher.isNull()) {
|
||
|
|
Constructed.push_back(SubMatcher);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
if (Constructed.empty()) return VariantMatcher(); // No overload matched.
|
||
|
|
// We ignore the errors if any matcher succeeded.
|
||
|
|
Ctx.revertErrors();
|
||
|
|
if (Constructed.size() > 1) {
|
||
|
|
// More than one constructed. It is ambiguous.
|
||
|
|
Error->addError(NameRange, Error->ET_RegistryAmbiguousOverload);
|
||
|
|
return VariantMatcher();
|
||
|
|
}
|
||
|
|
return Constructed[0];
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
std::vector<MatcherCreateCallback *> Overloads;
|
||
|
|
};
|
||
|
|
|
||
|
|
/// \brief Variadic operator marshaller function.
|
||
|
|
class VariadicOperatorMatcherCreateCallback : public MatcherCreateCallback {
|
||
|
|
public:
|
||
|
|
typedef ast_matchers::internal::VariadicOperatorFunction VarFunc;
|
||
|
|
VariadicOperatorMatcherCreateCallback(VarFunc Func, StringRef MatcherName)
|
||
|
|
: Func(Func), MatcherName(MatcherName) {}
|
||
|
|
|
||
|
|
virtual VariantMatcher run(const SourceRange &NameRange,
|
||
|
|
ArrayRef<ParserValue> Args,
|
||
|
|
Diagnostics *Error) const {
|
||
|
|
std::vector<VariantMatcher> InnerArgs;
|
||
|
|
for (size_t i = 0, e = Args.size(); i != e; ++i) {
|
||
|
|
const ParserValue &Arg = Args[i];
|
||
|
|
const VariantValue &Value = Arg.Value;
|
||
|
|
if (!Value.isMatcher()) {
|
||
|
|
Error->addError(Arg.Range, Error->ET_RegistryWrongArgType)
|
||
|
|
<< (i + 1) << "Matcher<>" << Value.getTypeAsString();
|
||
|
|
return VariantMatcher();
|
||
|
|
}
|
||
|
|
InnerArgs.push_back(Value.getMatcher());
|
||
|
|
}
|
||
|
|
return VariantMatcher::VariadicOperatorMatcher(Func, InnerArgs);
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
const VarFunc Func;
|
||
|
|
const StringRef MatcherName;
|
||
|
|
};
|
||
|
|
|
||
|
|
|
||
|
|
/// Helper functions to select the appropriate marshaller functions.
|
||
|
|
/// They detect the number of arguments, arguments types and return type.
|
||
|
|
|
||
|
|
/// \brief 0-arg overload
|
||
|
|
template <typename ReturnType>
|
||
|
|
MatcherCreateCallback *makeMatcherAutoMarshall(ReturnType (*Func)(),
|
||
|
|
StringRef MatcherName) {
|
||
|
|
return new FixedArgCountMatcherCreateCallback(
|
||
|
|
matcherMarshall0<ReturnType>, reinterpret_cast<void (*)()>(Func),
|
||
|
|
MatcherName);
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief 1-arg overload
|
||
|
|
template <typename ReturnType, typename ArgType1>
|
||
|
|
MatcherCreateCallback *makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1),
|
||
|
|
StringRef MatcherName) {
|
||
|
|
return new FixedArgCountMatcherCreateCallback(
|
||
|
|
matcherMarshall1<ReturnType, ArgType1>,
|
||
|
|
reinterpret_cast<void (*)()>(Func), MatcherName);
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief 2-arg overload
|
||
|
|
template <typename ReturnType, typename ArgType1, typename ArgType2>
|
||
|
|
MatcherCreateCallback *makeMatcherAutoMarshall(ReturnType (*Func)(ArgType1,
|
||
|
|
ArgType2),
|
||
|
|
StringRef MatcherName) {
|
||
|
|
return new FixedArgCountMatcherCreateCallback(
|
||
|
|
matcherMarshall2<ReturnType, ArgType1, ArgType2>,
|
||
|
|
reinterpret_cast<void (*)()>(Func), MatcherName);
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Variadic overload.
|
||
|
|
template <typename ResultT, typename ArgT,
|
||
|
|
ResultT (*Func)(ArrayRef<const ArgT *>)>
|
||
|
|
MatcherCreateCallback *
|
||
|
|
makeMatcherAutoMarshall(llvm::VariadicFunction<ResultT, ArgT, Func> VarFunc,
|
||
|
|
StringRef MatcherName) {
|
||
|
|
return new FreeFuncMatcherCreateCallback(
|
||
|
|
&variadicMatcherCreateCallback<ResultT, ArgT, Func>, MatcherName);
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Argument adaptative overload.
|
||
|
|
template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
|
||
|
|
typename FromTypes, typename ToTypes>
|
||
|
|
MatcherCreateCallback *
|
||
|
|
makeMatcherAutoMarshall(ast_matchers::internal::ArgumentAdaptingMatcherFunc<
|
||
|
|
ArgumentAdapterT, FromTypes, ToTypes>,
|
||
|
|
StringRef MatcherName) {
|
||
|
|
std::vector<MatcherCreateCallback *> Overloads;
|
||
|
|
AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes, ToTypes>(MatcherName,
|
||
|
|
Overloads);
|
||
|
|
return new OverloadedMatcherCreateCallback(Overloads);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <template <typename ToArg, typename FromArg> class ArgumentAdapterT,
|
||
|
|
typename FromTypes, typename ToTypes>
|
||
|
|
template <typename FromTypeList>
|
||
|
|
inline void
|
||
|
|
AdaptativeOverloadCollector<ArgumentAdapterT, FromTypes, ToTypes>::collect(
|
||
|
|
FromTypeList) {
|
||
|
|
Out.push_back(makeMatcherAutoMarshall(
|
||
|
|
&AdaptativeFunc::template create<typename FromTypeList::head>, Name));
|
||
|
|
collect(typename FromTypeList::tail());
|
||
|
|
}
|
||
|
|
|
||
|
|
/// \brief Variadic operator overload.
|
||
|
|
MatcherCreateCallback *makeMatcherAutoMarshall(
|
||
|
|
ast_matchers::internal::VariadicOperatorMatcherFunc Func,
|
||
|
|
StringRef MatcherName) {
|
||
|
|
return new VariadicOperatorMatcherCreateCallback(Func.Func, MatcherName);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace internal
|
||
|
|
} // namespace dynamic
|
||
|
|
} // namespace ast_matchers
|
||
|
|
} // namespace clang
|
||
|
|
|
||
|
|
#endif // LLVM_CLANG_AST_MATCHERS_DYNAMIC_MARSHALLERS_H
|