2011-07-28 14:26:00 +00:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2019-07-15 18:01:37 +00:00
|
|
|
#include "tools/SkMetaData.h"
|
2017-03-20 15:19:23 +00:00
|
|
|
|
2019-04-23 17:05:21 +00:00
|
|
|
#include "include/private/SkMalloc.h"
|
|
|
|
#include "include/private/SkTo.h"
|
2011-03-30 18:23:21 +00:00
|
|
|
|
2008-12-17 15:59:43 +00:00
|
|
|
void SkMetaData::reset()
|
|
|
|
{
|
|
|
|
Rec* rec = fRec;
|
2011-03-30 18:23:21 +00:00
|
|
|
while (rec) {
|
2008-12-17 15:59:43 +00:00
|
|
|
Rec* next = rec->fNext;
|
|
|
|
Rec::Free(rec);
|
|
|
|
rec = next;
|
|
|
|
}
|
2015-08-27 14:41:13 +00:00
|
|
|
fRec = nullptr;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void SkMetaData::setS32(const char name[], int32_t value)
|
|
|
|
{
|
|
|
|
(void)this->set(name, &value, sizeof(int32_t), kS32_Type, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SkMetaData::setScalar(const char name[], SkScalar value)
|
|
|
|
{
|
|
|
|
(void)this->set(name, &value, sizeof(SkScalar), kScalar_Type, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
SkScalar* SkMetaData::setScalars(const char name[], int count, const SkScalar values[])
|
|
|
|
{
|
|
|
|
SkASSERT(count > 0);
|
|
|
|
if (count > 0)
|
|
|
|
return (SkScalar*)this->set(name, values, sizeof(SkScalar), kScalar_Type, count);
|
2015-08-27 14:41:13 +00:00
|
|
|
return nullptr;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
2019-07-25 14:36:30 +00:00
|
|
|
void SkMetaData::setPtr(const char name[], void* ptr) {
|
|
|
|
(void)this->set(name, &ptr, sizeof(void*), kPtr_Type, 1);
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void SkMetaData::setBool(const char name[], bool value)
|
|
|
|
{
|
|
|
|
(void)this->set(name, &value, sizeof(bool), kBool_Type, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void* SkMetaData::set(const char name[], const void* data, size_t dataSize, Type type, int count)
|
|
|
|
{
|
|
|
|
SkASSERT(name);
|
|
|
|
SkASSERT(dataSize);
|
|
|
|
SkASSERT(count > 0);
|
|
|
|
|
2020-08-21 20:52:48 +00:00
|
|
|
FindResult result = this->findWithPrev(name, type);
|
|
|
|
|
|
|
|
Rec* rec;
|
|
|
|
bool reuseRec = result.rec &&
|
|
|
|
result.rec->fDataLen == dataSize &&
|
|
|
|
result.rec->fDataCount == count;
|
|
|
|
if (reuseRec) {
|
|
|
|
rec = result.rec;
|
|
|
|
} else {
|
|
|
|
size_t len = strlen(name);
|
|
|
|
rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1);
|
|
|
|
rec->fType = SkToU8(type);
|
|
|
|
rec->fDataLen = SkToU8(dataSize);
|
|
|
|
rec->fDataCount = SkToU16(count);
|
|
|
|
|
|
|
|
memcpy(rec->name(), name, len + 1);
|
|
|
|
}
|
|
|
|
if (data) {
|
2008-12-17 15:59:43 +00:00
|
|
|
memcpy(rec->data(), data, dataSize * count);
|
2020-08-21 20:52:48 +00:00
|
|
|
}
|
2008-12-17 15:59:43 +00:00
|
|
|
|
2020-08-21 20:52:48 +00:00
|
|
|
if (reuseRec) {
|
|
|
|
// Do nothing, reused
|
|
|
|
} else if (result.rec) {
|
|
|
|
// Had one, but had to create a new one. Invalidates iterators.
|
|
|
|
// Delayed removal since name or data may have been in the result.rec.
|
|
|
|
this->remove(result);
|
|
|
|
if (result.prev) {
|
|
|
|
rec->fNext = result.prev->fNext;
|
|
|
|
result.prev->fNext = rec;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Adding a new one, stick it at head.
|
|
|
|
rec->fNext = fRec;
|
|
|
|
fRec = rec;
|
|
|
|
}
|
2008-12-17 15:59:43 +00:00
|
|
|
return rec->data();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::findS32(const char name[], int32_t* value) const
|
|
|
|
{
|
|
|
|
const Rec* rec = this->find(name, kS32_Type);
|
|
|
|
if (rec)
|
|
|
|
{
|
|
|
|
SkASSERT(rec->fDataCount == 1);
|
|
|
|
if (value)
|
|
|
|
*value = *(const int32_t*)rec->data();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::findScalar(const char name[], SkScalar* value) const
|
|
|
|
{
|
|
|
|
const Rec* rec = this->find(name, kScalar_Type);
|
|
|
|
if (rec)
|
|
|
|
{
|
|
|
|
SkASSERT(rec->fDataCount == 1);
|
|
|
|
if (value)
|
|
|
|
*value = *(const SkScalar*)rec->data();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
const SkScalar* SkMetaData::findScalars(const char name[], int* count, SkScalar values[]) const
|
|
|
|
{
|
|
|
|
const Rec* rec = this->find(name, kScalar_Type);
|
|
|
|
if (rec)
|
|
|
|
{
|
|
|
|
if (count)
|
|
|
|
*count = rec->fDataCount;
|
|
|
|
if (values)
|
|
|
|
memcpy(values, rec->data(), rec->fDataCount * rec->fDataLen);
|
|
|
|
return (const SkScalar*)rec->data();
|
|
|
|
}
|
2015-08-27 14:41:13 +00:00
|
|
|
return nullptr;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
2019-07-25 14:36:30 +00:00
|
|
|
bool SkMetaData::findPtr(const char name[], void** ptr) const {
|
2008-12-17 15:59:43 +00:00
|
|
|
const Rec* rec = this->find(name, kPtr_Type);
|
2011-03-30 18:23:21 +00:00
|
|
|
if (rec) {
|
2008-12-17 15:59:43 +00:00
|
|
|
SkASSERT(rec->fDataCount == 1);
|
2019-07-25 14:36:30 +00:00
|
|
|
void** found = (void**)rec->data();
|
2011-03-30 18:23:21 +00:00
|
|
|
if (ptr) {
|
2019-07-25 14:36:30 +00:00
|
|
|
*ptr = *found;
|
2011-03-30 18:23:21 +00:00
|
|
|
}
|
2008-12-17 15:59:43 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::findBool(const char name[], bool* value) const
|
|
|
|
{
|
|
|
|
const Rec* rec = this->find(name, kBool_Type);
|
|
|
|
if (rec)
|
|
|
|
{
|
|
|
|
SkASSERT(rec->fDataCount == 1);
|
|
|
|
if (value)
|
|
|
|
*value = *(const bool*)rec->data();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2020-08-21 20:52:48 +00:00
|
|
|
SkMetaData::FindResult SkMetaData::findWithPrev(const char name[], Type type) const {
|
|
|
|
FindResult current { fRec, nullptr };
|
|
|
|
while (current.rec) {
|
|
|
|
if (current.rec->fType == type && !strcmp(current.rec->name(), name))
|
|
|
|
return current;
|
|
|
|
current.prev = current.rec;
|
|
|
|
current.rec = current.rec->fNext;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
2020-08-21 20:52:48 +00:00
|
|
|
return current;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const SkMetaData::Rec* SkMetaData::find(const char name[], Type type) const {
|
|
|
|
return this->findWithPrev(name, type).rec;
|
|
|
|
}
|
|
|
|
|
|
|
|
void SkMetaData::remove(FindResult result) {
|
|
|
|
SkASSERT(result.rec);
|
|
|
|
if (result.prev) {
|
|
|
|
result.prev->fNext = result.rec->fNext;
|
|
|
|
} else {
|
|
|
|
fRec = result.rec->fNext;
|
|
|
|
}
|
|
|
|
Rec::Free(result.rec);
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
bool SkMetaData::remove(const char name[], Type type) {
|
2020-08-21 20:52:48 +00:00
|
|
|
FindResult result = this->findWithPrev(name, type);
|
|
|
|
if (!result.rec) {
|
|
|
|
return false;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
2020-08-21 20:52:48 +00:00
|
|
|
this->remove(result);
|
|
|
|
return true;
|
2008-12-17 15:59:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::removeS32(const char name[])
|
|
|
|
{
|
|
|
|
return this->remove(name, kS32_Type);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::removeScalar(const char name[])
|
|
|
|
{
|
|
|
|
return this->remove(name, kScalar_Type);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::removePtr(const char name[])
|
|
|
|
{
|
|
|
|
return this->remove(name, kPtr_Type);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SkMetaData::removeBool(const char name[])
|
|
|
|
{
|
|
|
|
return this->remove(name, kBool_Type);
|
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
2008-12-17 15:59:43 +00:00
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
SkMetaData::Iter::Iter(const SkMetaData& metadata) {
|
2008-12-17 15:59:43 +00:00
|
|
|
fRec = metadata.fRec;
|
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
void SkMetaData::Iter::reset(const SkMetaData& metadata) {
|
2008-12-17 15:59:43 +00:00
|
|
|
fRec = metadata.fRec;
|
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
const char* SkMetaData::Iter::next(SkMetaData::Type* t, int* count) {
|
2015-08-27 14:41:13 +00:00
|
|
|
const char* name = nullptr;
|
2008-12-17 15:59:43 +00:00
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
if (fRec) {
|
|
|
|
if (t) {
|
2008-12-17 15:59:43 +00:00
|
|
|
*t = (SkMetaData::Type)fRec->fType;
|
2011-03-30 18:23:21 +00:00
|
|
|
}
|
|
|
|
if (count) {
|
2008-12-17 15:59:43 +00:00
|
|
|
*count = fRec->fDataCount;
|
2011-03-30 18:23:21 +00:00
|
|
|
}
|
2008-12-17 15:59:43 +00:00
|
|
|
name = fRec->name();
|
|
|
|
|
|
|
|
fRec = fRec->fNext;
|
|
|
|
}
|
|
|
|
return name;
|
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
2008-12-17 15:59:43 +00:00
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
SkMetaData::Rec* SkMetaData::Rec::Alloc(size_t size) {
|
2008-12-17 15:59:43 +00:00
|
|
|
return (Rec*)sk_malloc_throw(size);
|
|
|
|
}
|
|
|
|
|
2011-03-30 18:23:21 +00:00
|
|
|
void SkMetaData::Rec::Free(Rec* rec) {
|
2008-12-17 15:59:43 +00:00
|
|
|
sk_free(rec);
|
|
|
|
}
|