detach -> release

src/effects/gradients/SkGradientBitmapCache.cpp

 
 /*
  * Copyright 2010 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #include "SkGradientBitmapCache.h"
@@ skipping 33 matching lines @@
     this->validate();
 
     Entry* entry = fHead;
     while (entry) {
         Entry* next = entry->fNext;
         delete entry;
         entry = next;
     }
 }
 
-SkGradientBitmapCache::Entry* SkGradientBitmapCache::detach(Entry* entry) const {
+SkGradientBitmapCache::Entry* SkGradientBitmapCache::release(Entry* entry) const {
     if (entry->fPrev) {
         SkASSERT(fHead != entry);
         entry->fPrev->fNext = entry->fNext;
     } else {
         SkASSERT(fHead == entry);
         fHead = entry->fNext;
     }
     if (entry->fNext) {
         SkASSERT(fTail != entry);
         entry->fNext->fPrev = entry->fPrev;
@@ skipping 18 matching lines @@
 bool SkGradientBitmapCache::find(const void* buffer, size_t size, SkBitmap* bm) const {
     AutoValidate av(this);
 
     Entry* entry = fHead;
     while (entry) {
         if (entry->equals(buffer, size)) {
             if (bm) {
                 *bm = entry->fBitmap;
             }
             // move to the head of our list, so we purge it last
-            this->detach(entry);
+            this->release(entry);
             this->attachToHead(entry);
             return true;
         }
         entry = entry->fNext;
     }
     return false;
 }
 
 void SkGradientBitmapCache::add(const void* buffer, size_t len, const SkBitmap& bm) {
     AutoValidate av(this);
 
     if (fEntryCount == fMaxEntries) {
         SkASSERT(fTail);
-        delete this->detach(fTail);
+        delete this->release(fTail);
         fEntryCount -= 1;
     }
 
     Entry* entry = new Entry(buffer, len, bm);
     this->attachToHead(entry);
     fEntryCount += 1;
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
@@ skipping 26 matching lines @@
             entry = entry->fPrev;
         }
         SkASSERT(0 == count);
     } else {
         SkASSERT(nullptr == fHead);
         SkASSERT(nullptr == fTail);
     }
 }
 
 #endif