Lines Matching refs:that
4 * Use of this source code is governed by a BSD-style license that can be
88 bool operator==(const GrResourceKey& that) const {
91 return 0 == memcmp(fKey.get(), that.fKey.get(), kMetaDataCnt*sizeof(uint32_t)) &&
92 0 == memcmp(&fKey[kMetaDataCnt], &that.fKey[kMetaDataCnt], this->dataSize());
95 GrResourceKey& operator=(const GrResourceKey& that) {
96 if (this != &that) {
97 if (!that.isValid()) {
100 size_t bytes = that.size();
103 memcpy(fKey.get(), that.fKey.get(), bytes);
169 * scratch key should be interchangeable with respect to the code that uses them.
192 /** Uniquely identifies the type of resource that is cached as scratch. */
201 GrScratchKey(const GrScratchKey& that) { *this = that; }
210 GrScratchKey& operator=(const GrScratchKey& that) {
211 this->INHERITED::operator=(that);
215 bool operator==(const GrScratchKey& that) const { return this->INHERITED::operator==(that); }
216 bool operator!=(const GrScratchKey& that) const { return !(*this == that); }
226 * A key that allows for exclusive use of a resource for a use case (AKA "domain"). There are three
233 * The code path creates a domain which it sets on its keys. This guarantees that there are no
251 GrUniqueKey(const GrUniqueKey& that) { *this = that; }
258 GrUniqueKey& operator=(const GrUniqueKey& that) {
259 this->INHERITED::operator=(that);
260 this->setCustomData(sk_ref_sp(that.getCustomData()));
261 fTag = that.fTag;
265 bool operator==(const GrUniqueKey& that) const { return this->INHERITED::operator==(that); }
266 bool operator!=(const GrUniqueKey& that) const { return !(*this == that); }
288 /** Used to build a key that wraps another key and adds additional data. */
293 // add the inner key to the end of the key so that op[] can be indexed normally.
314 * It is common to need a frequently reused GrUniqueKey where the only requirement is that the key