2009-01-22 13:04:56 +00:00
|
|
|
/*
|
2011-07-28 14:26:00 +00:00
|
|
|
* Copyright 2009 The Android Open Source Project
|
2009-01-22 13:04:56 +00:00
|
|
|
*
|
2011-07-28 14:26:00 +00:00
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
2009-01-22 13:04:56 +00:00
|
|
|
*/
|
|
|
|
|
2017-01-11 18:58:55 +00:00
|
|
|
#ifndef sk_tools_Registry_DEFINED
|
|
|
|
#define sk_tools_Registry_DEFINED
|
2009-01-22 13:04:56 +00:00
|
|
|
|
2019-04-23 17:05:21 +00:00
|
|
|
#include "include/core/SkTypes.h"
|
|
|
|
#include "include/private/SkNoncopyable.h"
|
2009-01-22 13:04:56 +00:00
|
|
|
|
2017-01-11 18:58:55 +00:00
|
|
|
namespace sk_tools {
|
|
|
|
|
2009-01-22 13:04:56 +00:00
|
|
|
/** Template class that registers itself (in the constructor) into a linked-list
|
|
|
|
and provides a function-pointer. This can be used to auto-register a set of
|
|
|
|
services, e.g. a set of image codecs.
|
|
|
|
*/
|
2017-01-11 18:58:55 +00:00
|
|
|
template <typename T> class Registry : SkNoncopyable {
|
2009-01-22 13:04:56 +00:00
|
|
|
public:
|
2018-07-30 21:07:07 +00:00
|
|
|
explicit Registry(T value) : fValue(value) {
|
2011-11-08 19:00:26 +00:00
|
|
|
#ifdef SK_BUILD_FOR_ANDROID
|
2009-04-01 20:26:42 +00:00
|
|
|
// work-around for double-initialization bug
|
|
|
|
{
|
2017-01-11 18:58:55 +00:00
|
|
|
Registry* reg = gHead;
|
2009-04-01 20:26:42 +00:00
|
|
|
while (reg) {
|
|
|
|
if (reg == this) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
reg = reg->fChain;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2009-01-22 13:04:56 +00:00
|
|
|
fChain = gHead;
|
2013-09-04 17:20:18 +00:00
|
|
|
gHead = this;
|
2009-01-22 13:04:56 +00:00
|
|
|
}
|
|
|
|
|
2017-01-11 18:58:55 +00:00
|
|
|
static const Registry* Head() { return gHead; }
|
2009-01-22 13:04:56 +00:00
|
|
|
|
2017-01-11 18:58:55 +00:00
|
|
|
const Registry* next() const { return fChain; }
|
2018-07-30 21:07:07 +00:00
|
|
|
const T& get() const { return fValue; }
|
|
|
|
|
|
|
|
// for (const T& t : sk_tools::Registry<T>::Range()) { process(t); }
|
|
|
|
struct Range {
|
|
|
|
struct Iterator {
|
|
|
|
const Registry* fPtr;
|
|
|
|
const T& operator*() { return SkASSERT(fPtr), fPtr->get(); }
|
|
|
|
void operator++() { if (fPtr) { fPtr = fPtr->next(); } }
|
|
|
|
bool operator!=(const Iterator& other) const { return fPtr != other.fPtr; }
|
|
|
|
};
|
|
|
|
Iterator begin() const { return Iterator{Registry::Head()}; }
|
|
|
|
Iterator end() const { return Iterator{nullptr}; }
|
|
|
|
};
|
2009-01-22 13:04:56 +00:00
|
|
|
|
|
|
|
private:
|
2018-07-30 21:07:07 +00:00
|
|
|
T fValue;
|
2017-01-11 18:58:55 +00:00
|
|
|
Registry* fChain;
|
2009-01-22 13:04:56 +00:00
|
|
|
|
2017-01-11 18:58:55 +00:00
|
|
|
static Registry* gHead;
|
2009-01-22 13:04:56 +00:00
|
|
|
};
|
|
|
|
|
2009-01-26 23:15:37 +00:00
|
|
|
// The caller still needs to declare an instance of this somewhere
|
2017-01-11 18:58:55 +00:00
|
|
|
template <typename T> Registry<T>* Registry<T>::gHead;
|
|
|
|
|
|
|
|
} // namespace sk_tools
|
2009-01-22 13:04:56 +00:00
|
|
|
|
|
|
|
#endif
|