2013-07-12 18:22:49 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2013 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*
|
|
|
|
*
|
2016-01-05 22:59:40 +00:00
|
|
|
* This header provides some of the helpers (like std::enable_if_t) which will
|
|
|
|
* become available with C++14 in the type_traits header (in the skstd
|
|
|
|
* namespace). This header also provides several Skia specific additions such
|
|
|
|
* as SK_WHEN and the sknonstd namespace.
|
2013-07-12 18:22:49 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef SkTLogic_DEFINED
|
|
|
|
#define SkTLogic_DEFINED
|
|
|
|
|
2019-04-04 22:00:05 +00:00
|
|
|
#include <cstddef>
|
2016-01-05 22:59:40 +00:00
|
|
|
#include <type_traits>
|
2015-08-05 19:09:57 +00:00
|
|
|
|
2015-08-28 14:09:20 +00:00
|
|
|
namespace skstd {
|
|
|
|
|
2016-01-05 22:59:40 +00:00
|
|
|
template <bool B> using bool_constant = std::integral_constant<bool, B>;
|
2015-09-07 19:45:52 +00:00
|
|
|
|
2016-01-05 22:59:40 +00:00
|
|
|
template <bool B, typename T, typename F> using conditional_t = typename std::conditional<B, T, F>::type;
|
|
|
|
template <bool B, typename T = void> using enable_if_t = typename std::enable_if<B, T>::type;
|
2015-08-28 14:09:20 +00:00
|
|
|
|
2016-01-05 22:59:40 +00:00
|
|
|
template <typename T> using remove_const_t = typename std::remove_const<T>::type;
|
|
|
|
template <typename T> using remove_volatile_t = typename std::remove_volatile<T>::type;
|
|
|
|
template <typename T> using remove_cv_t = typename std::remove_cv<T>::type;
|
2016-01-06 16:30:59 +00:00
|
|
|
template <typename T> using remove_pointer_t = typename std::remove_pointer<T>::type;
|
2016-01-05 22:59:40 +00:00
|
|
|
template <typename T> using remove_reference_t = typename std::remove_reference<T>::type;
|
|
|
|
template <typename T> using remove_extent_t = typename std::remove_extent<T>::type;
|
2015-08-28 14:09:20 +00:00
|
|
|
|
2016-01-05 22:59:40 +00:00
|
|
|
template <typename T> using add_const_t = typename std::add_const<T>::type;
|
|
|
|
template <typename T> using add_volatile_t = typename std::add_volatile<T>::type;
|
|
|
|
template <typename T> using add_cv_t = typename std::add_cv<T>::type;
|
|
|
|
template <typename T> using add_pointer_t = typename std::add_pointer<T>::type;
|
Use ::std for is_empty, is_class, add_xxx_reference, remove decay.
SkTLogic.h contains implemenetations of is_empty, is_class, decay,
decay_t, add_lvalue_reference, add_rvalue_reference, and
add_rvalue_reference_t. The declaration of is_class is only used by
is_empty. The current implementation of is_empty will not work
correctly with 'final'. The current implementation of
add_lvalue_reference does not support clarifications in c++17. No Skia
code is currently using decay, decay_t, add_rvalue_reference, and
add_rvalue_reference_t. In addition, there are no known issues with
any of these in ::std with any supported compiler.
The implementations of is_function and is_convertible are commented to
note why they are still present.
Review URL: https://codereview.chromium.org/1567123006
2016-01-08 19:05:09 +00:00
|
|
|
template <typename T> using add_lvalue_reference_t = typename std::add_lvalue_reference<T>::type;
|
2013-07-12 18:22:49 +00:00
|
|
|
|
2017-10-18 15:30:56 +00:00
|
|
|
template <typename T> using result_of_t = typename std::result_of<T>::type;
|
|
|
|
|
2016-03-08 16:35:23 +00:00
|
|
|
template <typename... T> using common_type_t = typename std::common_type<T...>::type;
|
|
|
|
|
2017-10-18 15:30:56 +00:00
|
|
|
template <std::size_t... Ints> struct index_sequence {
|
|
|
|
using type = index_sequence;
|
2019-04-04 22:00:05 +00:00
|
|
|
using value_type = std::size_t;
|
2017-10-18 15:30:56 +00:00
|
|
|
static constexpr std::size_t size() noexcept { return sizeof...(Ints); }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename S1, typename S2> struct make_index_sequence_combine;
|
2019-04-04 22:00:05 +00:00
|
|
|
template <std::size_t... I1, std::size_t... I2>
|
2017-10-18 15:30:56 +00:00
|
|
|
struct make_index_sequence_combine<skstd::index_sequence<I1...>, skstd::index_sequence<I2...>>
|
|
|
|
: skstd::index_sequence<I1..., (sizeof...(I1)+I2)...>
|
|
|
|
{ };
|
|
|
|
|
2019-04-04 22:00:05 +00:00
|
|
|
template <std::size_t N> struct make_index_sequence
|
2017-10-18 15:30:56 +00:00
|
|
|
: make_index_sequence_combine<typename skstd::make_index_sequence< N/2>::type,
|
|
|
|
typename skstd::make_index_sequence<N - N/2>::type>{};
|
|
|
|
template<> struct make_index_sequence<0> : skstd::index_sequence< >{};
|
|
|
|
template<> struct make_index_sequence<1> : skstd::index_sequence<0>{};
|
|
|
|
|
2019-07-03 22:05:12 +00:00
|
|
|
struct monostate {};
|
|
|
|
|
2019-10-07 14:41:30 +00:00
|
|
|
template<typename...> struct conjunction : std::true_type { };
|
2019-10-21 22:20:20 +00:00
|
|
|
template<typename T> struct conjunction<T> : T { };
|
|
|
|
template<typename T, typename... Ts>
|
|
|
|
struct conjunction<T, Ts...> : std::conditional<bool(T::value), conjunction<Ts...>, T>::type { };
|
2015-08-28 14:09:20 +00:00
|
|
|
} // namespace skstd
|
|
|
|
|
|
|
|
// The sknonstd namespace contains things we would like to be proposed and feel std-ish.
|
|
|
|
namespace sknonstd {
|
|
|
|
|
|
|
|
// The name 'copy' here is fraught with peril. In this case it means 'append', not 'overwrite'.
|
|
|
|
// Alternate proposed names are 'propagate', 'augment', or 'append' (and 'add', but already taken).
|
|
|
|
// std::experimental::propagate_const already exists for other purposes in TSv2.
|
|
|
|
// These also follow the <dest, source> pattern used by boost.
|
|
|
|
template <typename D, typename S> struct copy_const {
|
2016-01-07 20:39:11 +00:00
|
|
|
using type = skstd::conditional_t<std::is_const<S>::value, skstd::add_const_t<D>, D>;
|
2013-07-12 18:22:49 +00:00
|
|
|
};
|
2015-08-28 14:09:20 +00:00
|
|
|
template <typename D, typename S> using copy_const_t = typename copy_const<D, S>::type;
|
2013-07-12 18:22:49 +00:00
|
|
|
|
2015-08-28 14:09:20 +00:00
|
|
|
template <typename D, typename S> struct copy_volatile {
|
2016-01-07 20:39:11 +00:00
|
|
|
using type = skstd::conditional_t<std::is_volatile<S>::value, skstd::add_volatile_t<D>, D>;
|
2013-07-12 18:22:49 +00:00
|
|
|
};
|
2015-08-28 14:09:20 +00:00
|
|
|
template <typename D, typename S> using copy_volatile_t = typename copy_volatile<D, S>::type;
|
2013-07-12 18:22:49 +00:00
|
|
|
|
2015-08-28 14:09:20 +00:00
|
|
|
template <typename D, typename S> struct copy_cv {
|
|
|
|
using type = copy_volatile_t<copy_const_t<D, S>, S>;
|
2014-04-28 16:19:45 +00:00
|
|
|
};
|
2015-08-28 14:09:20 +00:00
|
|
|
template <typename D, typename S> using copy_cv_t = typename copy_cv<D, S>::type;
|
|
|
|
|
|
|
|
// The name 'same' here means 'overwrite'.
|
|
|
|
// Alternate proposed names are 'replace', 'transfer', or 'qualify_from'.
|
|
|
|
// same_xxx<D, S> can be written as copy_xxx<remove_xxx_t<D>, S>
|
|
|
|
template <typename D, typename S> using same_const = copy_const<skstd::remove_const_t<D>, S>;
|
|
|
|
template <typename D, typename S> using same_const_t = typename same_const<D, S>::type;
|
|
|
|
template <typename D, typename S> using same_volatile =copy_volatile<skstd::remove_volatile_t<D>,S>;
|
|
|
|
template <typename D, typename S> using same_volatile_t = typename same_volatile<D, S>::type;
|
|
|
|
template <typename D, typename S> using same_cv = copy_cv<skstd::remove_cv_t<D>, S>;
|
|
|
|
template <typename D, typename S> using same_cv_t = typename same_cv<D, S>::type;
|
2014-04-28 16:19:45 +00:00
|
|
|
|
2015-08-28 14:09:20 +00:00
|
|
|
} // namespace sknonstd
|
2014-04-28 16:19:45 +00:00
|
|
|
|
2015-09-28 17:33:02 +00:00
|
|
|
// Just a pithier wrapper for enable_if_t.
|
|
|
|
#define SK_WHEN(condition, T) skstd::enable_if_t<!!(condition), T>
|
Add pattern matchers for SkRecord
This is a mid-level library for finding patterns of commands in an SkRecord. At the API level, it's a bit regex inspired. Some examples:
- Pattern1<Is<DrawRect>> matches a single DrawRect
- Pattern1<Star<Is<DrawRect>>> matches 0 or more DrawRects
- Pattern2<Is<ClipRect>, Is<DrawRect>> matches a single clip rect followed by a single draw rect
- Pattern3<Is<Save>, Star<IsDraw>, Is<Restore>> matches a single Save, followed by any number of Draws, followed by Restore
- Pattern1<Or<Is<DrawRect>, Is<ClipRect>>> matches a DrawRect or a ClipRect
- Pattern1<Not<Is<ClipRect>>> matches a command that's notClipRect.
Once you have a pattern, you can call .search() on it to step through ranges of matching commands. This means patterns can replace most of the custom iteration logic for optimization passes: the generic pattern searching steps through all the optimization candidates, which optimization-specific code further inspects and mutates.
SkRecordTraits is now unused. Bye bye!
Generated code and performance of SkRecordOpts is very similar to what it was before. (I had to use SK_ALWAYS_INLINE in a few places to make this so.)
BUG=skia:2378
R=fmalita@chromium.org, bungeman@google.com, mtklein@google.com
Author: mtklein@chromium.org
Review URL: https://codereview.chromium.org/263063002
git-svn-id: http://skia.googlecode.com/svn/trunk@14582 2bbb7eff-a529-9590-31e7-b0007b416f81
2014-05-05 21:59:52 +00:00
|
|
|
|
2013-07-12 18:31:59 +00:00
|
|
|
#endif
|