Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /* | |
| 2 * Copyright 2016 Google Inc. | |
| 3 * | |
| 4 * Use of this source code is governed by a BSD-style license that can be | |
| 5 * found in the LICENSE file. | |
| 6 */ | |
| 7 | |
| 8 #include <unordered_map> | |
| 9 #include <vector> | |
| 10 | |
| 11 #include "SkData.h" | |
| 12 #include "SkMatrix.h" | |
| 13 #include "SkValue.h" | |
| 14 | |
| 15 class SkValue::Obj { | |
| 16 public: | |
| 17 void set(SkValue::Key k, SkValue&& v) { fMap[k] = std::move(v); } | |
| 18 const SkValue* get(SkValue::Key k) const { | |
| 19 auto it = fMap.find(k); | |
| 20 return it != fMap.end() ? &it->second : nullptr; | |
| 21 } | |
| 22 void foreach(std::function<void(Key, const SkValue&)> fn) const { | |
| 23 for (const auto& pair : fMap) { | |
| 24 fn(pair.first, pair.second); | |
| 25 } | |
| 26 } | |
| 27 | |
| 28 private: | |
| 29 std::unordered_map<SkValue::Key, SkValue> fMap; | |
| 30 }; | |
| 31 | |
| 32 class SkValue::Arr { | |
| 33 public: | |
| 34 size_t length() const { return fVec.size(); } | |
| 35 void append(SkValue&& val) { fVec.emplace_back(std::move(val)); } | |
| 36 const SkValue& at(size_t index) const { | |
| 37 SkASSERT(index < fVec.size()); | |
| 38 return fVec[index]; | |
| 39 } | |
| 40 | |
| 41 private: | |
| 42 std::vector<SkValue> fVec; | |
| 43 }; | |
| 44 | |
| 45 SkValue::SkValue() : fType(Null) {} | |
| 46 | |
| 47 SkValue::SkValue(const SkValue& o) { | |
| 48 memcpy(this, &o, sizeof(o)); | |
| 49 if (this->isData()) { | |
| 50 fBytes->ref(); | |
| 51 } else if (this->isObject()) { | |
| 52 fObject = new Obj(*fObject); | |
| 53 } else if (Array == fType) { | |
| 54 fArray = new Arr(*fArray); | |
| 55 } | |
| 56 } | |
| 57 | |
| 58 SkValue::SkValue(SkValue&& o) { | |
| 59 memcpy(this, &o, sizeof(o)); | |
| 60 new (&o) SkValue(); | |
| 61 } | |
| 62 | |
| 63 SkValue& SkValue::operator=(const SkValue& o) { | |
| 64 if (this != &o) { | |
| 65 this->~SkValue(); | |
| 66 new (this) SkValue(o); | |
| 67 } | |
| 68 return *this; | |
| 69 } | |
| 70 | |
| 71 SkValue& SkValue::operator=(SkValue&& o) { | |
| 72 if (this != &o) { | |
| 73 this->~SkValue(); | |
| 74 new (this) SkValue(std::move(o)); | |
| 75 } | |
| 76 return *this; | |
| 77 } | |
| 78 | |
| 79 SkValue::~SkValue() { | |
| 80 if (this->isData()) { | |
| 81 fBytes->unref(); | |
| 82 } else if (this->isObject()) { | |
| 83 delete fObject; | |
| 84 } else if (Array == fType) { | |
| 85 delete fArray; | |
| 86 } | |
| 87 } | |
| 88 | |
| 89 template <typename T> | |
| 90 SkValue SkValue::FromT(SkValue::Type type, T SkValue::*mp, T t) { | |
| 91 SkValue v; | |
| 92 v.fType = type; | |
| 93 v.*mp = t; | |
| 94 return v; | |
| 95 } | |
| 96 | |
| 97 SkValue SkValue::FromS32(int32_t x) { return FromT(S32, &SkValue::fS32, x); } | |
| 98 SkValue SkValue::FromU32(uint32_t x) { return FromT(U32, &SkValue::fU32, x); } | |
| 99 SkValue SkValue::FromF32(float x) { return FromT(F32, &SkValue::fF32, x); } | |
| 100 | |
| 101 int32_t SkValue::s32() const { SkASSERT(S32 == fType); return fS32; } | |
| 102 uint32_t SkValue::u32() const { SkASSERT(U32 == fType); return fU32; } | |
| 103 float SkValue::f32() const { SkASSERT(F32 == fType); return fF32; } | |
| 104 | |
| 105 SkValue SkValue::FromBytes(SkData* data) { | |
| 106 if (!data) { | |
| 107 return SkValue(); | |
| 108 } | |
| 109 SkValue v; | |
| 110 v.fType = Bytes; | |
| 111 v.fBytes = SkRef(data); | |
| 112 return v; | |
| 113 } | |
| 114 | |
| 115 SkValue SkValue::Object(SkValue::Type t) { | |
| 116 SkValue v; | |
| 117 v.fType = t; | |
| 118 SkASSERT(v.isObject()); | |
| 119 v.fObject = new Obj; | |
| 120 return v; | |
| 121 } | |
| 122 | |
| 123 SkValue SkValue::ValueArray() { | |
| 124 SkValue v; | |
| 125 v.fType = Array; | |
| 126 v.fArray = new Arr; | |
| 127 return v; | |
| 128 } | |
| 129 | |
| 130 SkData* SkValue::bytes() const { | |
| 131 SkASSERT(this->isData()); | |
| 132 return fBytes; | |
| 133 } | |
| 134 | |
| 135 void SkValue::set(SkValue::Key k, SkValue v) { | |
| 136 SkASSERT(this->isObject()); | |
| 137 fObject->set(k, std::move(v)); | |
| 138 } | |
| 139 | |
| 140 void SkValue::foreach(std::function<void(Key, const SkValue&)> fn) const { | |
| 141 SkASSERT(this->isObject()); | |
| 142 fObject->foreach(fn); | |
| 143 } | |
| 144 | |
| 145 size_t SkValue::length() const { | |
| 146 SkASSERT(Array == fType); | |
| 147 return fArray->length(); | |
| 148 } | |
| 149 | |
| 150 const SkValue& SkValue::at(size_t index) const { | |
| 151 SkASSERT(Array == fType); | |
| 152 return fArray->at(index); | |
| 153 } | |
| 154 | |
| 155 void SkValue::append(SkValue val) { | |
| 156 SkASSERT(Array == fType); | |
| 157 fArray->append(std::move(val)); | |
| 158 } | |
| 159 | |
| 160 template <typename T> | |
| 161 const T* SkValue::AsArray(SkValue::Type t, int* count) const { | |
|
mtklein
2016/01/20 15:47:50
I'm getting confused by AsArray, Array, ValueArray
hal.canary
2016/01/20 16:38:56
Righto. Done.
What should ValueArray be named?
| |
| 162 SkASSERT(t == fType); | |
|
mtklein
2016/01/20 15:47:50
merge related SkASSERT(t == fType && this->isData(
hal.canary
2016/01/20 16:38:56
Done.
| |
| 163 SkASSERT(count); | |
| 164 SkASSERT(this->isData()); | |
| 165 *count = fBytes->size() / sizeof(T); | |
| 166 return static_cast<const T*>(fBytes->data()); | |
| 167 } | |
| 168 | |
| 169 const uint16_t* SkValue::u16s(int* c) const { return AsArray<uint16_t>(U16s, c); } | |
| 170 const uint32_t* SkValue::u32s(int* c) const { return AsArray<uint32_t>(U32s, c); } | |
| 171 const float* SkValue::f32s(int* c) const { return AsArray<float >(F32s, c); } | |
| 172 | |
| 173 template <typename T> | |
| 174 SkValue SkValue::FromTs(SkValue::Type type, SkData* data) { | |
| 175 SkValue val; | |
| 176 val.fType = type; | |
| 177 val.fBytes = SkRef(data); | |
| 178 SkASSERT(val.isData()); | |
| 179 SkASSERT(0 == (reinterpret_cast<uintptr_t>(data->bytes()) & (sizeof(T)-1))); | |
| 180 return val; | |
| 181 } | |
| 182 | |
| 183 SkValue SkValue::FromU16s(SkData* d) { return FromTs<uint16_t>(U16s, d); } | |
| 184 SkValue SkValue::FromU32s(SkData* d) { return FromTs<uint32_t>(U32s, d); } | |
| 185 SkValue SkValue::FromF32s(SkData* d) { return FromTs< float>(F32s, d); } | |
| 186 | |
| 187 //////////////////////////////////////////////////////////////////////////////// | |
| 188 | |
| 189 template<> SkValue SkToValue<SkMatrix>(const SkMatrix& mat) { | |
| 190 auto val = SkValue::Object(SkValue::Matrix); | |
| 191 for (int i = 0; i < 9; ++i) { | |
| 192 if (mat[i] != SkMatrix::I()[i]) { | |
| 193 val.set(i, SkValue::FromF32(mat[i])); | |
| 194 } | |
| 195 } | |
| 196 return val; | |
| 197 } | |
| 198 | |
| 199 template<> bool SkFromValue<SkMatrix>(const SkValue& val, SkMatrix* m){ | |
| 200 SkASSERT(val.type() == SkValue::Matrix); | |
| 201 if (val.type() != SkValue::Matrix) { | |
| 202 return false; | |
| 203 } | |
| 204 *m = SkMatrix::I(); | |
| 205 bool good = true; | |
| 206 auto fn = [&](SkValue::Key key, const SkValue& v) { | |
| 207 if (key < 9) { | |
| 208 if (v.type() != SkValue::F32) { | |
| 209 SkASSERT(false); | |
| 210 good = false; | |
| 211 } else { | |
| 212 (*m)[key] = v.f32(); | |
| 213 } | |
| 214 } else { | |
| 215 SkASSERT(false); | |
| 216 good = false; | |
| 217 } | |
| 218 }; | |
| 219 val.foreach(fn); | |
| 220 return good; | |
| 221 } | |
| OLD | NEW |