//===- FunctionExtras.h - Function type erasure utilities -------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// /// \file /// This file provides a collection of function (or more generally, callable) /// type erasure utilities supplementing those provided by the standard library /// in ``. /// /// It provides `unique_function`, which works like `std::function` but supports /// move-only callable objects and const-qualification. /// /// Future plans: /// - Add a `function` that provides ref-qualified support, which doesn't work /// with `std::function`. /// - Provide support for specifying multiple signatures to type erase callable /// objects with an overload set, such as those produced by generic lambdas. /// - Expand to include a copyable utility that directly replaces std::function /// but brings the above improvements. /// /// Note that LLVM's utilities are greatly simplified by not supporting /// allocators. /// /// If the standard library ever begins to provide comparable facilities we can /// consider switching to those. /// //===----------------------------------------------------------------------===// #ifndef LLVM_ADT_FUNCTION_EXTRAS_H #define LLVM_ADT_FUNCTION_EXTRAS_H #include "llvm/ADT/PointerIntPair.h" #include "llvm/ADT/PointerUnion.h" #include "llvm/Support/MemAlloc.h" #include "llvm/Support/type_traits.h" #include #include namespace llvm { /// unique_function is a type-erasing functor similar to std::function. /// /// It can hold move-only function objects, like lambdas capturing unique_ptrs. /// Accordingly, it is movable but not copyable. /// /// It supports const-qualification: /// - unique_function has a const operator(). /// It can only hold functions which themselves have a const operator(). /// - unique_function has a non-const operator(). /// It can hold functions with a non-const operator(), like mutable lambdas. template class unique_function; namespace detail { template using EnableIfTrivial = std::enable_if_t::value && std::is_trivially_destructible::value>; template class UniqueFunctionBase { protected: static constexpr size_t InlineStorageSize = sizeof(void *) * 3; template struct IsSizeLessThanThresholdT : std::false_type {}; template struct IsSizeLessThanThresholdT< T, std::enable_if_t> : std::true_type {}; // Provide a type function to map parameters that won't observe extra copies // or moves and which are small enough to likely pass in register to values // and all other types to l-value reference types. We use this to compute the // types used in our erased call utility to minimize copies and moves unless // doing so would force things unnecessarily into memory. // // The heuristic used is related to common ABI register passing conventions. // It doesn't have to be exact though, and in one way it is more strict // because we want to still be able to observe either moves *or* copies. template using AdjustedParamT = typename std::conditional< !std::is_reference::value && llvm::is_trivially_copy_constructible::value && llvm::is_trivially_move_constructible::value && IsSizeLessThanThresholdT::value, T, T &>::type; // The type of the erased function pointer we use as a callback to dispatch to // the stored callable when it is trivial to move and destroy. using CallPtrT = ReturnT (*)(void *CallableAddr, AdjustedParamT... Params); using MovePtrT = void (*)(void *LHSCallableAddr, void *RHSCallableAddr); using DestroyPtrT = void (*)(void *CallableAddr); /// A struct to hold a single trivial callback with sufficient alignment for /// our bitpacking. struct alignas(8) TrivialCallback { CallPtrT CallPtr; }; /// A struct we use to aggregate three callbacks when we need full set of /// operations. struct alignas(8) NonTrivialCallbacks { CallPtrT CallPtr; MovePtrT MovePtr; DestroyPtrT DestroyPtr; }; // Create a pointer union between either a pointer to a static trivial call // pointer in a struct or a pointer to a static struct of the call, move, and // destroy pointers. using CallbackPointerUnionT = PointerUnion; // The main storage buffer. This will either have a pointer to out-of-line // storage or an inline buffer storing the callable. union StorageUnionT { // For out-of-line storage we keep a pointer to the underlying storage and // the size. This is enough to deallocate the memory. struct OutOfLineStorageT { void *StoragePtr; size_t Size; size_t Alignment; } OutOfLineStorage; static_assert( sizeof(OutOfLineStorageT) <= InlineStorageSize, "Should always use all of the out-of-line storage for inline storage!"); // For in-line storage, we just provide an aligned character buffer. We // provide three pointers worth of storage here. // This is mutable as an inlined `const unique_function` may // still modify its own mutable members. mutable typename std::aligned_storage::type InlineStorage; } StorageUnion; // A compressed pointer to either our dispatching callback or our table of // dispatching callbacks and the flag for whether the callable itself is // stored inline or not. PointerIntPair CallbackAndInlineFlag; bool isInlineStorage() const { return CallbackAndInlineFlag.getInt(); } bool isTrivialCallback() const { return CallbackAndInlineFlag.getPointer().template is(); } CallPtrT getTrivialCallback() const { return CallbackAndInlineFlag.getPointer().template get()->CallPtr; } NonTrivialCallbacks *getNonTrivialCallbacks() const { return CallbackAndInlineFlag.getPointer() .template get(); } CallPtrT getCallPtr() const { return isTrivialCallback() ? getTrivialCallback() : getNonTrivialCallbacks()->CallPtr; } // These three functions are only const in the narrow sense. They return // mutable pointers to function state. // This allows unique_function::operator() to be const, even if the // underlying functor may be internally mutable. // // const callers must ensure they're only used in const-correct ways. void *getCalleePtr() const { return isInlineStorage() ? getInlineStorage() : getOutOfLineStorage(); } void *getInlineStorage() const { return &StorageUnion.InlineStorage; } void *getOutOfLineStorage() const { return StorageUnion.OutOfLineStorage.StoragePtr; } size_t getOutOfLineStorageSize() const { return StorageUnion.OutOfLineStorage.Size; } size_t getOutOfLineStorageAlignment() const { return StorageUnion.OutOfLineStorage.Alignment; } void setOutOfLineStorage(void *Ptr, size_t Size, size_t Alignment) { StorageUnion.OutOfLineStorage = {Ptr, Size, Alignment}; } template static ReturnT CallImpl(void *CallableAddr, AdjustedParamT... Params) { auto &Func = *reinterpret_cast(CallableAddr); return Func(std::forward(Params)...); } template static void MoveImpl(void *LHSCallableAddr, void *RHSCallableAddr) noexcept { new (LHSCallableAddr) CallableT(std::move(*reinterpret_cast(RHSCallableAddr))); } template static void DestroyImpl(void *CallableAddr) noexcept { reinterpret_cast(CallableAddr)->~CallableT(); } // The pointers to call/move/destroy functions are determined for each // callable type (and called-as type, which determines the overload chosen). // (definitions are out-of-line). // By default, we need an object that contains all the different // type erased behaviors needed. Create a static instance of the struct type // here and each instance will contain a pointer to it. // Wrap in a struct to avoid https://gcc.gnu.org/PR71954 template struct CallbacksHolder { static NonTrivialCallbacks Callbacks; }; // See if we can create a trivial callback. We need the callable to be // trivially moved and trivially destroyed so that we don't have to store // type erased callbacks for those operations. template struct CallbacksHolder> { static TrivialCallback Callbacks; }; // A simple tag type so the call-as type to be passed to the constructor. template struct CalledAs {}; // Essentially the "main" unique_function constructor, but subclasses // provide the qualified type to be used for the call. // (We always store a T, even if the call will use a pointer to const T). template UniqueFunctionBase(CallableT Callable, CalledAs) { bool IsInlineStorage = true; void *CallableAddr = getInlineStorage(); if (sizeof(CallableT) > InlineStorageSize || alignof(CallableT) > alignof(decltype(StorageUnion.InlineStorage))) { IsInlineStorage = false; // Allocate out-of-line storage. FIXME: Use an explicit alignment // parameter in C++17 mode. auto Size = sizeof(CallableT); auto Alignment = alignof(CallableT); CallableAddr = allocate_buffer(Size, Alignment); setOutOfLineStorage(CallableAddr, Size, Alignment); } // Now move into the storage. new (CallableAddr) CallableT(std::move(Callable)); CallbackAndInlineFlag.setPointerAndInt( &CallbacksHolder::Callbacks, IsInlineStorage); } ~UniqueFunctionBase() { if (!CallbackAndInlineFlag.getPointer()) return; // Cache this value so we don't re-check it after type-erased operations. bool IsInlineStorage = isInlineStorage(); if (!isTrivialCallback()) getNonTrivialCallbacks()->DestroyPtr( IsInlineStorage ? getInlineStorage() : getOutOfLineStorage()); if (!IsInlineStorage) deallocate_buffer(getOutOfLineStorage(), getOutOfLineStorageSize(), getOutOfLineStorageAlignment()); } UniqueFunctionBase(UniqueFunctionBase &&RHS) noexcept { // Copy the callback and inline flag. CallbackAndInlineFlag = RHS.CallbackAndInlineFlag; // If the RHS is empty, just copying the above is sufficient. if (!RHS) return; if (!isInlineStorage()) { // The out-of-line case is easiest to move. StorageUnion.OutOfLineStorage = RHS.StorageUnion.OutOfLineStorage; } else if (isTrivialCallback()) { // Move is trivial, just memcpy the bytes across. memcpy(getInlineStorage(), RHS.getInlineStorage(), InlineStorageSize); } else { // Non-trivial move, so dispatch to a type-erased implementation. getNonTrivialCallbacks()->MovePtr(getInlineStorage(), RHS.getInlineStorage()); } // Clear the old callback and inline flag to get back to as-if-null. RHS.CallbackAndInlineFlag = {}; #ifndef NDEBUG // In debug builds, we also scribble across the rest of the storage. memset(RHS.getInlineStorage(), 0xAD, InlineStorageSize); #endif } UniqueFunctionBase &operator=(UniqueFunctionBase &&RHS) noexcept { if (this == &RHS) return *this; // Because we don't try to provide any exception safety guarantees we can // implement move assignment very simply by first destroying the current // object and then move-constructing over top of it. this->~UniqueFunctionBase(); new (this) UniqueFunctionBase(std::move(RHS)); return *this; } UniqueFunctionBase() = default; public: explicit operator bool() const { return (bool)CallbackAndInlineFlag.getPointer(); } }; template template typename UniqueFunctionBase::NonTrivialCallbacks UniqueFunctionBase< R, P...>::CallbacksHolder::Callbacks = { &CallImpl, &MoveImpl, &DestroyImpl}; template template typename UniqueFunctionBase::TrivialCallback UniqueFunctionBase::CallbacksHolder< CallableT, CalledAsT, EnableIfTrivial>::Callbacks{ &CallImpl}; } // namespace detail template class unique_function : public detail::UniqueFunctionBase { using Base = detail::UniqueFunctionBase; public: unique_function() = default; unique_function(std::nullptr_t) {} unique_function(unique_function &&) = default; unique_function(const unique_function &) = delete; unique_function &operator=(unique_function &&) = default; unique_function &operator=(const unique_function &) = delete; template unique_function(CallableT Callable) : Base(std::forward(Callable), typename Base::template CalledAs{}) {} R operator()(P... Params) { return this->getCallPtr()(this->getCalleePtr(), Params...); } }; template class unique_function : public detail::UniqueFunctionBase { using Base = detail::UniqueFunctionBase; public: unique_function() = default; unique_function(std::nullptr_t) {} unique_function(unique_function &&) = default; unique_function(const unique_function &) = delete; unique_function &operator=(unique_function &&) = default; unique_function &operator=(const unique_function &) = delete; template unique_function(CallableT Callable) : Base(std::forward(Callable), typename Base::template CalledAs{}) {} R operator()(P... Params) const { return this->getCallPtr()(this->getCalleePtr(), Params...); } }; } // end namespace llvm #endif // LLVM_ADT_FUNCTION_H