a1730e18f1
Change-Id: Iecd80244b3803b6d5916bfd793741e67f05d0d46 Reviewed-on: https://skia-review.googlesource.com/c/skia/+/227437 Commit-Queue: Hal Canary <halcanary@google.com> Commit-Queue: Mike Klein <mtklein@google.com> Reviewed-by: Mike Klein <mtklein@google.com> Auto-Submit: Hal Canary <halcanary@google.com>
121 lines
3.8 KiB
C++
121 lines
3.8 KiB
C++
/*
|
|
* Copyright 2006 The Android Open Source Project
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
#ifndef SkMetaData_DEFINED
|
|
#define SkMetaData_DEFINED
|
|
|
|
#include "include/core/SkScalar.h"
|
|
|
|
/** A map from c-string keys to arrays of POD (int32_t, kScalar, void*, or bool)
|
|
values.
|
|
*/
|
|
class SkMetaData {
|
|
public:
|
|
/** Used to manage the life-cycle of a ptr in the metadata. This is option
|
|
in setPtr, and is invoked when the metadata is destroyed.
|
|
*/
|
|
typedef void* (*PtrProc)(void* ptr, bool doRef);
|
|
|
|
SkMetaData() {}
|
|
~SkMetaData() { if (fRec) { this->reset(); } }
|
|
void reset();
|
|
|
|
bool findS32(const char name[], int32_t* value = nullptr) const;
|
|
bool findScalar(const char name[], SkScalar* value = nullptr) const;
|
|
const SkScalar* findScalars(const char name[], int* count,
|
|
SkScalar values[] = nullptr) const;
|
|
bool findPtr(const char name[], void** value = nullptr, PtrProc* = nullptr) const;
|
|
bool findBool(const char name[], bool* value = nullptr) const;
|
|
|
|
bool hasS32(const char name[], int32_t value) const {
|
|
int32_t v;
|
|
return this->findS32(name, &v) && v == value;
|
|
}
|
|
bool hasScalar(const char name[], SkScalar value) const {
|
|
SkScalar v;
|
|
return this->findScalar(name, &v) && v == value;
|
|
}
|
|
bool hasPtr(const char name[], void* value) const {
|
|
void* v;
|
|
return this->findPtr(name, &v) && v == value;
|
|
}
|
|
bool hasBool(const char name[], bool value) const {
|
|
bool v;
|
|
return this->findBool(name, &v) && v == value;
|
|
}
|
|
|
|
void setS32(const char name[], int32_t value);
|
|
void setScalar(const char name[], SkScalar value);
|
|
SkScalar* setScalars(const char name[], int count, const SkScalar values[] = nullptr);
|
|
void setPtr(const char name[], void* value, PtrProc proc = nullptr);
|
|
void setBool(const char name[], bool value);
|
|
|
|
bool removeS32(const char name[]);
|
|
bool removeScalar(const char name[]);
|
|
bool removePtr(const char name[]);
|
|
bool removeBool(const char name[]);
|
|
|
|
enum Type {
|
|
kS32_Type,
|
|
kScalar_Type,
|
|
kPtr_Type,
|
|
kBool_Type,
|
|
|
|
kTypeCount
|
|
};
|
|
|
|
struct Rec;
|
|
class Iter;
|
|
friend class Iter;
|
|
|
|
class Iter {
|
|
public:
|
|
Iter() : fRec(nullptr) {}
|
|
Iter(const SkMetaData&);
|
|
|
|
/** Reset the iterator, so that calling next() will return the first
|
|
data element. This is done implicitly in the constructor.
|
|
*/
|
|
void reset(const SkMetaData&);
|
|
|
|
/** Each time next is called, it returns the name of the next data element,
|
|
or null when there are no more elements. If non-null is returned, then the
|
|
element's type is returned (if not null), and the number of data values
|
|
is returned in count (if not null).
|
|
*/
|
|
const char* next(Type*, int* count);
|
|
|
|
private:
|
|
Rec* fRec;
|
|
};
|
|
|
|
public:
|
|
struct Rec {
|
|
Rec* fNext;
|
|
uint16_t fDataCount; // number of elements
|
|
uint8_t fDataLen; // sizeof a single element
|
|
uint8_t fType;
|
|
|
|
const void* data() const { return (this + 1); }
|
|
void* data() { return (this + 1); }
|
|
const char* name() const { return (const char*)this->data() + fDataLen * fDataCount; }
|
|
char* name() { return (char*)this->data() + fDataLen * fDataCount; }
|
|
|
|
static Rec* Alloc(size_t);
|
|
static void Free(Rec*);
|
|
};
|
|
Rec* fRec = nullptr;
|
|
|
|
const Rec* find(const char name[], Type) const;
|
|
void* set(const char name[], const void* data, size_t len, Type, int count);
|
|
bool remove(const char name[], Type);
|
|
|
|
SkMetaData(const SkMetaData&) = delete;
|
|
SkMetaData& operator=(const SkMetaData&) = delete;
|
|
};
|
|
|
|
#endif
|