| OLD | NEW |
| 1 | 1 |
| 2 /* | 2 /* |
| 3 * Copyright 2006 The Android Open Source Project | 3 * Copyright 2006 The Android Open Source Project |
| 4 * | 4 * |
| 5 * Use of this source code is governed by a BSD-style license that can be | 5 * Use of this source code is governed by a BSD-style license that can be |
| 6 * found in the LICENSE file. | 6 * found in the LICENSE file. |
| 7 */ | 7 */ |
| 8 | 8 |
| 9 | 9 |
| 10 #ifndef SkRefCnt_DEFINED | 10 #ifndef SkRefCnt_DEFINED |
| (...skipping 244 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 255 SkNVRefCnt() : fRefCnt(1) {} | 255 SkNVRefCnt() : fRefCnt(1) {} |
| 256 | 256 |
| 257 // Implementation is pretty much the same as SkRefCntBase. All required barr
iers are the same: | 257 // Implementation is pretty much the same as SkRefCntBase. All required barr
iers are the same: |
| 258 // - unique() needs acquire when it returns true, and no barrier if it ret
urns false; | 258 // - unique() needs acquire when it returns true, and no barrier if it ret
urns false; |
| 259 // - ref() doesn't need any barrier; | 259 // - ref() doesn't need any barrier; |
| 260 // - unref() needs a release barrier, and an acquire if it's going to call
delete. | 260 // - unref() needs a release barrier, and an acquire if it's going to call
delete. |
| 261 | 261 |
| 262 bool unique() const { return 1 == sk_acquire_load(&fRefCnt); } | 262 bool unique() const { return 1 == sk_acquire_load(&fRefCnt); } |
| 263 void ref() const { sk_atomic_inc(&fRefCnt); } | 263 void ref() const { sk_atomic_inc(&fRefCnt); } |
| 264 void unref() const { if (1 == sk_atomic_dec(&fRefCnt)) { SkDELETE((const De
rived*)this); } } | 264 void unref() const { if (1 == sk_atomic_dec(&fRefCnt)) { SkDELETE((const De
rived*)this); } } |
| 265 void deref() const { this->unref(); } // Chrome prefers to call deref(). |
| 265 private: | 266 private: |
| 266 mutable int32_t fRefCnt; | 267 mutable int32_t fRefCnt; |
| 267 }; | 268 }; |
| 268 | 269 |
| 269 #endif | 270 #endif |
| OLD | NEW |