mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
992 lines
33 KiB
C++
992 lines
33 KiB
C++
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
||
|
/* vim:set ts=4 sw=4 sts=4 cin et: */
|
||
|
/* ***** BEGIN LICENSE BLOCK *****
|
||
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
||
|
*
|
||
|
* The contents of this file are subject to the Mozilla Public License Version
|
||
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
||
|
* the License. You may obtain a copy of the License at
|
||
|
* http://www.mozilla.org/MPL/
|
||
|
*
|
||
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
||
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
||
|
* for the specific language governing rights and limitations under the
|
||
|
* License.
|
||
|
*
|
||
|
* The Original Code is nsDiskCacheMap.cpp, released
|
||
|
* March 23, 2001.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is
|
||
|
* Netscape Communications Corporation.
|
||
|
* Portions created by the Initial Developer are Copyright (C) 2001
|
||
|
* the Initial Developer. All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s):
|
||
|
* Patrick C. Beard <beard@netscape.com>
|
||
|
* Gordon Sheridan <gordon@netscape.com>
|
||
|
* Alfred Kayser <alfredkayser@nl.ibm.com>
|
||
|
* Darin Fisher <darin@meer.net>
|
||
|
*
|
||
|
* Alternatively, the contents of this file may be used under the terms of
|
||
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
||
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
||
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
||
|
* of those above. If you wish to allow use of your version of this file only
|
||
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
||
|
* use your version of this file under the terms of the MPL, indicate your
|
||
|
* decision by deleting the provisions above and replace them with the notice
|
||
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
||
|
* the provisions above, a recipient may use your version of this file under
|
||
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
||
|
*
|
||
|
* ***** END LICENSE BLOCK ***** */
|
||
|
|
||
|
#include "nsDiskCacheMap.h"
|
||
|
#include "nsDiskCacheBinding.h"
|
||
|
#include "nsDiskCacheEntry.h"
|
||
|
|
||
|
#include "nsCache.h"
|
||
|
|
||
|
#include <string.h>
|
||
|
|
||
|
|
||
|
/******************************************************************************
|
||
|
* nsDiskCacheMap
|
||
|
*****************************************************************************/
|
||
|
|
||
|
/**
|
||
|
* File operations
|
||
|
*/
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::Open(nsILocalFile * cacheDirectory)
|
||
|
{
|
||
|
NS_ENSURE_ARG_POINTER(cacheDirectory);
|
||
|
if (mMapFD) return NS_ERROR_ALREADY_INITIALIZED;
|
||
|
|
||
|
mCacheDirectory = cacheDirectory; // save a reference for ourselves
|
||
|
|
||
|
// create nsILocalFile for _CACHE_MAP_
|
||
|
nsresult rv;
|
||
|
nsCOMPtr<nsIFile> file;
|
||
|
rv = cacheDirectory->Clone(getter_AddRefs(file));
|
||
|
nsCOMPtr<nsILocalFile> localFile(do_QueryInterface(file, &rv));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
rv = localFile->AppendNative(NS_LITERAL_CSTRING("_CACHE_MAP_"));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
// open the file - restricted to user, the data could be confidential
|
||
|
rv = localFile->OpenNSPRFileDesc(PR_RDWR | PR_CREATE_FILE, 00600, &mMapFD);
|
||
|
if (NS_FAILED(rv)) return NS_ERROR_FILE_CORRUPTED;
|
||
|
|
||
|
PRBool cacheFilesExist = CacheFilesExist();
|
||
|
rv = NS_ERROR_FILE_CORRUPTED; // presume the worst
|
||
|
|
||
|
// check size of map file
|
||
|
PRUint32 mapSize = PR_Available(mMapFD);
|
||
|
if (mapSize == 0) { // creating a new _CACHE_MAP_
|
||
|
|
||
|
// block files shouldn't exist if we're creating the _CACHE_MAP_
|
||
|
if (cacheFilesExist)
|
||
|
goto error_exit;
|
||
|
|
||
|
// create the file - initialize in memory
|
||
|
memset(&mHeader, 0, sizeof(nsDiskCacheHeader));
|
||
|
mHeader.mVersion = nsDiskCache::kCurrentVersion;
|
||
|
mHeader.mRecordCount = kMinRecordCount;
|
||
|
mRecordArray = (nsDiskCacheRecord *)
|
||
|
PR_CALLOC(mHeader.mRecordCount * sizeof(nsDiskCacheRecord));
|
||
|
if (!mRecordArray) {
|
||
|
rv = NS_ERROR_OUT_OF_MEMORY;
|
||
|
goto error_exit;
|
||
|
}
|
||
|
} else if (mapSize >= sizeof(nsDiskCacheHeader)) { // read existing _CACHE_MAP_
|
||
|
|
||
|
// if _CACHE_MAP_ exists, so should the block files
|
||
|
if (!cacheFilesExist)
|
||
|
goto error_exit;
|
||
|
|
||
|
// read the header
|
||
|
PRUint32 bytesRead = PR_Read(mMapFD, &mHeader, sizeof(nsDiskCacheHeader));
|
||
|
if (sizeof(nsDiskCacheHeader) != bytesRead) goto error_exit;
|
||
|
mHeader.Unswap();
|
||
|
|
||
|
if (mHeader.mIsDirty || (mHeader.mVersion != nsDiskCache::kCurrentVersion))
|
||
|
goto error_exit;
|
||
|
|
||
|
PRUint32 recordArraySize =
|
||
|
mHeader.mRecordCount * sizeof(nsDiskCacheRecord);
|
||
|
if (mapSize < recordArraySize + sizeof(nsDiskCacheHeader))
|
||
|
goto error_exit;
|
||
|
|
||
|
// Get the space for the records
|
||
|
mRecordArray = (nsDiskCacheRecord *) PR_MALLOC(recordArraySize);
|
||
|
if (!mRecordArray) {
|
||
|
rv = NS_ERROR_OUT_OF_MEMORY;
|
||
|
goto error_exit;
|
||
|
}
|
||
|
|
||
|
// Read the records
|
||
|
bytesRead = PR_Read(mMapFD, mRecordArray, recordArraySize);
|
||
|
if (bytesRead < recordArraySize)
|
||
|
goto error_exit;
|
||
|
|
||
|
// Unswap each record
|
||
|
PRInt32 total = 0;
|
||
|
for (PRInt32 i = 0; i < mHeader.mRecordCount; ++i) {
|
||
|
if (mRecordArray[i].HashNumber()) {
|
||
|
#if defined(IS_LITTLE_ENDIAN)
|
||
|
mRecordArray[i].Unswap();
|
||
|
#endif
|
||
|
total ++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// verify entry count
|
||
|
if (total != mHeader.mEntryCount)
|
||
|
goto error_exit;
|
||
|
|
||
|
} else {
|
||
|
goto error_exit;
|
||
|
}
|
||
|
|
||
|
rv = OpenBlockFiles();
|
||
|
if (NS_FAILED(rv)) goto error_exit;
|
||
|
|
||
|
// set dirty bit and flush header
|
||
|
mHeader.mIsDirty = PR_TRUE;
|
||
|
rv = FlushHeader();
|
||
|
if (NS_FAILED(rv)) goto error_exit;
|
||
|
|
||
|
return NS_OK;
|
||
|
|
||
|
error_exit:
|
||
|
(void) Close(PR_FALSE);
|
||
|
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::Close(PRBool flush)
|
||
|
{
|
||
|
nsresult rv = NS_OK;
|
||
|
|
||
|
// If cache map file and its block files are still open, close them
|
||
|
if (mMapFD) {
|
||
|
// close block files
|
||
|
rv = CloseBlockFiles(flush);
|
||
|
if (NS_SUCCEEDED(rv) && flush && mRecordArray) {
|
||
|
// write the map records
|
||
|
rv = FlushRecords(PR_FALSE); // don't bother swapping buckets back
|
||
|
if (NS_SUCCEEDED(rv)) {
|
||
|
// clear dirty bit
|
||
|
mHeader.mIsDirty = PR_FALSE;
|
||
|
rv = FlushHeader();
|
||
|
}
|
||
|
}
|
||
|
if ((PR_Close(mMapFD) != PR_SUCCESS) && (NS_SUCCEEDED(rv)))
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
|
||
|
mMapFD = nsnull;
|
||
|
}
|
||
|
PR_FREEIF(mRecordArray);
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::Trim()
|
||
|
{
|
||
|
nsresult rv, rv2 = NS_OK;
|
||
|
for (int i=0; i < 3; ++i) {
|
||
|
rv = mBlockFile[i].Trim();
|
||
|
if (NS_FAILED(rv)) rv2 = rv; // if one or more errors, report at least one
|
||
|
}
|
||
|
// Try to shrink the records array
|
||
|
rv = ShrinkRecords();
|
||
|
if (NS_FAILED(rv)) rv2 = rv; // if one or more errors, report at least one
|
||
|
return rv2;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::FlushHeader()
|
||
|
{
|
||
|
if (!mMapFD) return NS_ERROR_NOT_AVAILABLE;
|
||
|
|
||
|
// seek to beginning of cache map
|
||
|
PRInt32 filePos = PR_Seek(mMapFD, 0, PR_SEEK_SET);
|
||
|
if (filePos != 0) return NS_ERROR_UNEXPECTED;
|
||
|
|
||
|
// write the header
|
||
|
mHeader.Swap();
|
||
|
PRInt32 bytesWritten = PR_Write(mMapFD, &mHeader, sizeof(nsDiskCacheHeader));
|
||
|
mHeader.Unswap();
|
||
|
if (sizeof(nsDiskCacheHeader) != bytesWritten) {
|
||
|
return NS_ERROR_UNEXPECTED;
|
||
|
}
|
||
|
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::FlushRecords(PRBool unswap)
|
||
|
{
|
||
|
if (!mMapFD) return NS_ERROR_NOT_AVAILABLE;
|
||
|
|
||
|
// seek to beginning of buckets
|
||
|
PRInt32 filePos = PR_Seek(mMapFD, sizeof(nsDiskCacheHeader), PR_SEEK_SET);
|
||
|
if (filePos != sizeof(nsDiskCacheHeader))
|
||
|
return NS_ERROR_UNEXPECTED;
|
||
|
|
||
|
#if defined(IS_LITTLE_ENDIAN)
|
||
|
// Swap each record
|
||
|
for (PRInt32 i = 0; i < mHeader.mRecordCount; ++i) {
|
||
|
if (mRecordArray[i].HashNumber())
|
||
|
mRecordArray[i].Swap();
|
||
|
}
|
||
|
#endif
|
||
|
|
||
|
PRInt32 recordArraySize = sizeof(nsDiskCacheRecord) * mHeader.mRecordCount;
|
||
|
|
||
|
PRInt32 bytesWritten = PR_Write(mMapFD, mRecordArray, recordArraySize);
|
||
|
if (bytesWritten != recordArraySize)
|
||
|
return NS_ERROR_UNEXPECTED;
|
||
|
|
||
|
#if defined(IS_LITTLE_ENDIAN)
|
||
|
if (unswap) {
|
||
|
// Unswap each record
|
||
|
for (PRInt32 i = 0; i < mHeader.mRecordCount; ++i) {
|
||
|
if (mRecordArray[i].HashNumber())
|
||
|
mRecordArray[i].Unswap();
|
||
|
}
|
||
|
}
|
||
|
#endif
|
||
|
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
|
||
|
/**
|
||
|
* Record operations
|
||
|
*/
|
||
|
|
||
|
PRUint32
|
||
|
nsDiskCacheMap::GetBucketRank(PRUint32 bucketIndex, PRUint32 targetRank)
|
||
|
{
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
PRUint32 rank = 0;
|
||
|
|
||
|
for (int i = mHeader.mBucketUsage[bucketIndex]-1; i >= 0; i--) {
|
||
|
if ((rank < records[i].EvictionRank()) &&
|
||
|
((targetRank == 0) || (records[i].EvictionRank() < targetRank)))
|
||
|
rank = records[i].EvictionRank();
|
||
|
}
|
||
|
return rank;
|
||
|
}
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::GrowRecords()
|
||
|
{
|
||
|
if (mHeader.mRecordCount >= kMaxRecordCount)
|
||
|
return NS_OK;
|
||
|
CACHE_LOG_DEBUG(("CACHE: GrowRecords\n"));
|
||
|
|
||
|
// Resize the record array
|
||
|
PRUint32 newCount = mHeader.mRecordCount << 1;
|
||
|
if (newCount > kMaxRecordCount)
|
||
|
newCount = kMaxRecordCount;
|
||
|
nsDiskCacheRecord *newArray = (nsDiskCacheRecord *)
|
||
|
PR_REALLOC(mRecordArray, newCount * sizeof(nsDiskCacheRecord));
|
||
|
if (!newArray)
|
||
|
return NS_ERROR_OUT_OF_MEMORY;
|
||
|
|
||
|
// Space out the buckets
|
||
|
PRUint32 oldRecordsPerBucket = GetRecordsPerBucket();
|
||
|
PRUint32 newRecordsPerBucket = newCount / kBuckets;
|
||
|
// Work from back to space out each bucket to the new array
|
||
|
for (int bucketIndex = kBuckets - 1; bucketIndex >= 0; --bucketIndex) {
|
||
|
// Move bucket
|
||
|
nsDiskCacheRecord *newRecords = newArray + bucketIndex * newRecordsPerBucket;
|
||
|
const PRUint32 count = mHeader.mBucketUsage[bucketIndex];
|
||
|
memmove(newRecords,
|
||
|
newArray + bucketIndex * oldRecordsPerBucket,
|
||
|
count * sizeof(nsDiskCacheRecord));
|
||
|
// Clear the new empty entries
|
||
|
for (PRUint32 i = count; i < newRecordsPerBucket; ++i)
|
||
|
newRecords[i].SetHashNumber(0);
|
||
|
}
|
||
|
|
||
|
// Set as the new record array
|
||
|
mRecordArray = newArray;
|
||
|
mHeader.mRecordCount = newCount;
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::ShrinkRecords()
|
||
|
{
|
||
|
if (mHeader.mRecordCount <= kMinRecordCount)
|
||
|
return NS_OK;
|
||
|
CACHE_LOG_DEBUG(("CACHE: ShrinkRecords\n"));
|
||
|
|
||
|
// Verify if we can shrink the record array: all buckets must be less than
|
||
|
// 1/2 filled
|
||
|
PRUint32 maxUsage = 0, bucketIndex;
|
||
|
for (bucketIndex = 0; bucketIndex < kBuckets; ++bucketIndex) {
|
||
|
if (maxUsage < mHeader.mBucketUsage[bucketIndex])
|
||
|
maxUsage = mHeader.mBucketUsage[bucketIndex];
|
||
|
}
|
||
|
// Determine new bucket size, halve size until maxUsage
|
||
|
PRUint32 oldRecordsPerBucket = GetRecordsPerBucket();
|
||
|
PRUint32 newRecordsPerBucket = oldRecordsPerBucket;
|
||
|
while (maxUsage < (newRecordsPerBucket >> 1))
|
||
|
newRecordsPerBucket >>= 1;
|
||
|
if (newRecordsPerBucket < kMinRecordCount)
|
||
|
newRecordsPerBucket = kMinRecordCount;
|
||
|
if (newRecordsPerBucket == oldRecordsPerBucket)
|
||
|
return NS_OK;
|
||
|
// Move the buckets close to each other
|
||
|
for (bucketIndex = 0; bucketIndex < kBuckets; ++bucketIndex) {
|
||
|
// Move bucket
|
||
|
memmove(mRecordArray + bucketIndex * newRecordsPerBucket,
|
||
|
mRecordArray + bucketIndex * oldRecordsPerBucket,
|
||
|
mHeader.mBucketUsage[bucketIndex] * sizeof(nsDiskCacheRecord));
|
||
|
}
|
||
|
|
||
|
// Shrink the record array memory block itself
|
||
|
PRUint32 newCount = newRecordsPerBucket * kBuckets;
|
||
|
nsDiskCacheRecord* newArray = (nsDiskCacheRecord *)
|
||
|
PR_REALLOC(mRecordArray, newCount * sizeof(nsDiskCacheRecord));
|
||
|
if (!newArray)
|
||
|
return NS_ERROR_OUT_OF_MEMORY;
|
||
|
|
||
|
// Set as the new record array
|
||
|
mRecordArray = newArray;
|
||
|
mHeader.mRecordCount = newCount;
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::AddRecord( nsDiskCacheRecord * mapRecord,
|
||
|
nsDiskCacheRecord * oldRecord)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: AddRecord [%x]\n", mapRecord->HashNumber()));
|
||
|
|
||
|
const PRUint32 hashNumber = mapRecord->HashNumber();
|
||
|
const PRUint32 bucketIndex = GetBucketIndex(hashNumber);
|
||
|
const PRUint32 count = mHeader.mBucketUsage[bucketIndex];
|
||
|
|
||
|
oldRecord->SetHashNumber(0); // signify no record
|
||
|
|
||
|
if (count == GetRecordsPerBucket()) {
|
||
|
// Ignore failure to grow the record space, we will then reuse old records
|
||
|
GrowRecords();
|
||
|
}
|
||
|
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
if (count < GetRecordsPerBucket()) {
|
||
|
// stick the new record at the end
|
||
|
records[count] = *mapRecord;
|
||
|
mHeader.mEntryCount++;
|
||
|
mHeader.mBucketUsage[bucketIndex]++;
|
||
|
if (mHeader.mEvictionRank[bucketIndex] < mapRecord->EvictionRank())
|
||
|
mHeader.mEvictionRank[bucketIndex] = mapRecord->EvictionRank();
|
||
|
} else {
|
||
|
// Find the record with the highest eviction rank
|
||
|
nsDiskCacheRecord * mostEvictable = &records[0];
|
||
|
for (int i = count-1; i > 0; i--) {
|
||
|
if (records[i].EvictionRank() > mostEvictable->EvictionRank())
|
||
|
mostEvictable = &records[i];
|
||
|
}
|
||
|
*oldRecord = *mostEvictable; // i == GetRecordsPerBucket(), so
|
||
|
// evict the mostEvictable
|
||
|
*mostEvictable = *mapRecord; // replace it with the new record
|
||
|
// check if we need to update mostEvictable entry in header
|
||
|
if (mHeader.mEvictionRank[bucketIndex] < mapRecord->EvictionRank())
|
||
|
mHeader.mEvictionRank[bucketIndex] = mapRecord->EvictionRank();
|
||
|
if (oldRecord->EvictionRank() >= mHeader.mEvictionRank[bucketIndex])
|
||
|
mHeader.mEvictionRank[bucketIndex] = GetBucketRank(bucketIndex, 0);
|
||
|
}
|
||
|
|
||
|
NS_ASSERTION(mHeader.mEvictionRank[bucketIndex] == GetBucketRank(bucketIndex, 0),
|
||
|
"eviction rank out of sync");
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::UpdateRecord( nsDiskCacheRecord * mapRecord)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: UpdateRecord [%x]\n", mapRecord->HashNumber()));
|
||
|
|
||
|
const PRUint32 hashNumber = mapRecord->HashNumber();
|
||
|
const PRUint32 bucketIndex = GetBucketIndex(hashNumber);
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
|
||
|
for (int i = mHeader.mBucketUsage[bucketIndex]-1; i >= 0; i--) {
|
||
|
if (records[i].HashNumber() == hashNumber) {
|
||
|
const PRUint32 oldRank = records[i].EvictionRank();
|
||
|
|
||
|
// stick the new record here
|
||
|
records[i] = *mapRecord;
|
||
|
|
||
|
// update eviction rank in header if necessary
|
||
|
if (mHeader.mEvictionRank[bucketIndex] < mapRecord->EvictionRank())
|
||
|
mHeader.mEvictionRank[bucketIndex] = mapRecord->EvictionRank();
|
||
|
else if (mHeader.mEvictionRank[bucketIndex] == oldRank)
|
||
|
mHeader.mEvictionRank[bucketIndex] = GetBucketRank(bucketIndex, 0);
|
||
|
|
||
|
NS_ASSERTION(mHeader.mEvictionRank[bucketIndex] == GetBucketRank(bucketIndex, 0),
|
||
|
"eviction rank out of sync");
|
||
|
return NS_OK;
|
||
|
}
|
||
|
}
|
||
|
NS_NOTREACHED("record not found");
|
||
|
return NS_ERROR_UNEXPECTED;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::FindRecord( PRUint32 hashNumber, nsDiskCacheRecord * result)
|
||
|
{
|
||
|
const PRUint32 bucketIndex = GetBucketIndex(hashNumber);
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
|
||
|
for (int i = mHeader.mBucketUsage[bucketIndex]-1; i >= 0; i--) {
|
||
|
if (records[i].HashNumber() == hashNumber) {
|
||
|
*result = records[i]; // copy the record
|
||
|
NS_ASSERTION(result->ValidRecord(), "bad cache map record");
|
||
|
return NS_OK;
|
||
|
}
|
||
|
}
|
||
|
return NS_ERROR_CACHE_KEY_NOT_FOUND;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::DeleteRecord( nsDiskCacheRecord * mapRecord)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: DeleteRecord [%x]\n", mapRecord->HashNumber()));
|
||
|
|
||
|
const PRUint32 hashNumber = mapRecord->HashNumber();
|
||
|
const PRUint32 bucketIndex = GetBucketIndex(hashNumber);
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
PRUint32 last = mHeader.mBucketUsage[bucketIndex]-1;
|
||
|
|
||
|
for (int i = last; i >= 0; i--) {
|
||
|
if (records[i].HashNumber() == hashNumber) {
|
||
|
// found it, now delete it.
|
||
|
PRUint32 evictionRank = records[i].EvictionRank();
|
||
|
NS_ASSERTION(evictionRank == mapRecord->EvictionRank(),
|
||
|
"evictionRank out of sync");
|
||
|
// if not the last record, shift last record into opening
|
||
|
records[i] = records[last];
|
||
|
records[last].SetHashNumber(0); // clear last record
|
||
|
mHeader.mBucketUsage[bucketIndex] = last;
|
||
|
mHeader.mEntryCount--;
|
||
|
|
||
|
// update eviction rank
|
||
|
PRUint32 bucketIndex = GetBucketIndex(mapRecord->HashNumber());
|
||
|
if (mHeader.mEvictionRank[bucketIndex] <= evictionRank) {
|
||
|
mHeader.mEvictionRank[bucketIndex] = GetBucketRank(bucketIndex, 0);
|
||
|
}
|
||
|
|
||
|
NS_ASSERTION(mHeader.mEvictionRank[bucketIndex] ==
|
||
|
GetBucketRank(bucketIndex, 0), "eviction rank out of sync");
|
||
|
return NS_OK;
|
||
|
}
|
||
|
}
|
||
|
return NS_ERROR_UNEXPECTED;
|
||
|
}
|
||
|
|
||
|
|
||
|
PRInt32
|
||
|
nsDiskCacheMap::VisitEachRecord(PRUint32 bucketIndex,
|
||
|
nsDiskCacheRecordVisitor * visitor,
|
||
|
PRUint32 evictionRank)
|
||
|
{
|
||
|
PRInt32 rv = kVisitNextRecord;
|
||
|
PRUint32 count = mHeader.mBucketUsage[bucketIndex];
|
||
|
nsDiskCacheRecord * records = GetFirstRecordInBucket(bucketIndex);
|
||
|
|
||
|
// call visitor for each entry (matching any eviction rank)
|
||
|
for (int i = count-1; i >= 0; i--) {
|
||
|
if (evictionRank > records[i].EvictionRank()) continue;
|
||
|
|
||
|
rv = visitor->VisitRecord(&records[i]);
|
||
|
if (rv == kStopVisitingRecords)
|
||
|
break; // Stop visiting records
|
||
|
|
||
|
if (rv == kDeleteRecordAndContinue) {
|
||
|
--count;
|
||
|
records[i] = records[count];
|
||
|
records[count].SetHashNumber(0);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if (mHeader.mBucketUsage[bucketIndex] - count != 0) {
|
||
|
mHeader.mEntryCount -= mHeader.mBucketUsage[bucketIndex] - count;
|
||
|
mHeader.mBucketUsage[bucketIndex] = count;
|
||
|
// recalc eviction rank
|
||
|
mHeader.mEvictionRank[bucketIndex] = GetBucketRank(bucketIndex, 0);
|
||
|
}
|
||
|
NS_ASSERTION(mHeader.mEvictionRank[bucketIndex] ==
|
||
|
GetBucketRank(bucketIndex, 0), "eviction rank out of sync");
|
||
|
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
/**
|
||
|
* VisitRecords
|
||
|
*
|
||
|
* Visit every record in cache map in the most convenient order
|
||
|
*/
|
||
|
nsresult
|
||
|
nsDiskCacheMap::VisitRecords( nsDiskCacheRecordVisitor * visitor)
|
||
|
{
|
||
|
for (int bucketIndex = 0; bucketIndex < kBuckets; ++bucketIndex) {
|
||
|
if (VisitEachRecord(bucketIndex, visitor, 0) == kStopVisitingRecords)
|
||
|
break;
|
||
|
}
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
|
||
|
/**
|
||
|
* EvictRecords
|
||
|
*
|
||
|
* Just like VisitRecords, but visits the records in order of their eviction rank
|
||
|
*/
|
||
|
nsresult
|
||
|
nsDiskCacheMap::EvictRecords( nsDiskCacheRecordVisitor * visitor)
|
||
|
{
|
||
|
PRUint32 tempRank[kBuckets];
|
||
|
int bucketIndex = 0;
|
||
|
|
||
|
// copy eviction rank array
|
||
|
for (bucketIndex = 0; bucketIndex < kBuckets; ++bucketIndex)
|
||
|
tempRank[bucketIndex] = mHeader.mEvictionRank[bucketIndex];
|
||
|
|
||
|
// Maximum number of iterations determined by number of records
|
||
|
// as a safety limiter for the loop
|
||
|
for (int n = 0; n < mHeader.mEntryCount; ++n) {
|
||
|
|
||
|
// find bucket with highest eviction rank
|
||
|
PRUint32 rank = 0;
|
||
|
for (int i = 0; i < kBuckets; ++i) {
|
||
|
if (rank < tempRank[i]) {
|
||
|
rank = tempRank[i];
|
||
|
bucketIndex = i;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if (rank == 0) break; // we've examined all the records
|
||
|
|
||
|
// visit records in bucket with eviction ranks >= target eviction rank
|
||
|
if (VisitEachRecord(bucketIndex, visitor, rank) == kStopVisitingRecords)
|
||
|
break;
|
||
|
|
||
|
// find greatest rank less than 'rank'
|
||
|
tempRank[bucketIndex] = GetBucketRank(bucketIndex, rank);
|
||
|
}
|
||
|
return NS_OK;
|
||
|
}
|
||
|
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::OpenBlockFiles()
|
||
|
{
|
||
|
// create nsILocalFile for block file
|
||
|
nsCOMPtr<nsILocalFile> blockFile;
|
||
|
nsresult rv;
|
||
|
|
||
|
for (int i = 0; i < 3; ++i) {
|
||
|
rv = GetBlockFileForIndex(i, getter_AddRefs(blockFile));
|
||
|
if (NS_FAILED(rv)) goto error_exit;
|
||
|
|
||
|
PRUint32 blockSize = GetBlockSizeForIndex(i+1); // +1 to match file selectors 1,2,3
|
||
|
rv = mBlockFile[i].Open(blockFile, blockSize);
|
||
|
if (NS_FAILED(rv)) goto error_exit;
|
||
|
}
|
||
|
return NS_OK;
|
||
|
|
||
|
error_exit:
|
||
|
(void)CloseBlockFiles(PR_FALSE); // we already have an error to report
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::CloseBlockFiles(PRBool flush)
|
||
|
{
|
||
|
nsresult rv, rv2 = NS_OK;
|
||
|
for (int i=0; i < 3; ++i) {
|
||
|
rv = mBlockFile[i].Close(flush);
|
||
|
if (NS_FAILED(rv)) rv2 = rv; // if one or more errors, report at least one
|
||
|
}
|
||
|
return rv2;
|
||
|
}
|
||
|
|
||
|
|
||
|
PRBool
|
||
|
nsDiskCacheMap::CacheFilesExist()
|
||
|
{
|
||
|
nsCOMPtr<nsILocalFile> blockFile;
|
||
|
nsresult rv;
|
||
|
|
||
|
for (int i = 0; i < 3; ++i) {
|
||
|
PRBool exists;
|
||
|
rv = GetBlockFileForIndex(i, getter_AddRefs(blockFile));
|
||
|
if (NS_FAILED(rv)) return PR_FALSE;
|
||
|
|
||
|
rv = blockFile->Exists(&exists);
|
||
|
if (NS_FAILED(rv) || !exists) return PR_FALSE;
|
||
|
}
|
||
|
|
||
|
return PR_TRUE;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::ReadDiskCacheEntry(nsDiskCacheRecord * record, nsDiskCacheEntry ** result)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: ReadDiskCacheEntry [%x]\n", record->HashNumber()));
|
||
|
|
||
|
nsresult rv = NS_ERROR_UNEXPECTED;
|
||
|
nsDiskCacheEntry * diskEntry = nsnull;
|
||
|
PRUint32 metaFile = record->MetaFile();
|
||
|
PRFileDesc * fd = nsnull;
|
||
|
PRInt32 bytesRead = 0;
|
||
|
*result = nsnull;
|
||
|
|
||
|
if (!record->MetaLocationInitialized()) return NS_ERROR_NOT_AVAILABLE;
|
||
|
|
||
|
if (metaFile == 0) { // entry/metadata stored in separate file
|
||
|
// open and read the file
|
||
|
nsCOMPtr<nsILocalFile> file;
|
||
|
rv = GetLocalFileForDiskCacheRecord(record, nsDiskCache::kMetaData, getter_AddRefs(file));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
PRFileDesc * fd = nsnull;
|
||
|
// open the file - restricted to user, the data could be confidential
|
||
|
rv = file->OpenNSPRFileDesc(PR_RDONLY, 00600, &fd);
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
PRInt32 fileSize = PR_Available(fd);
|
||
|
if (fileSize < 0) {
|
||
|
// an error occurred. We could call PR_GetError(), but how would that help?
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
goto exit;
|
||
|
}
|
||
|
|
||
|
diskEntry = (nsDiskCacheEntry *) new char[fileSize];
|
||
|
if (!diskEntry) {
|
||
|
rv = NS_ERROR_OUT_OF_MEMORY;
|
||
|
goto exit;
|
||
|
}
|
||
|
|
||
|
bytesRead = PR_Read(fd, diskEntry, fileSize);
|
||
|
if (bytesRead < fileSize) {
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
goto exit;
|
||
|
}
|
||
|
|
||
|
} else if (metaFile < 4) { // XXX magic number: use constant
|
||
|
// entry/metadata stored in cache block file
|
||
|
|
||
|
// allocate buffer
|
||
|
PRUint32 blockCount = record->MetaBlockCount();
|
||
|
bytesRead = blockCount * GetBlockSizeForIndex(metaFile);
|
||
|
diskEntry = (nsDiskCacheEntry *) new char[bytesRead];
|
||
|
|
||
|
// read diskEntry, note when the blocks are at the end of file,
|
||
|
// bytesRead may be less than blockSize*blockCount.
|
||
|
// But the bytesRead should at least agree with the real disk entry size.
|
||
|
rv = mBlockFile[metaFile - 1].ReadBlocks((char *)diskEntry,
|
||
|
record->MetaStartBlock(),
|
||
|
blockCount,
|
||
|
&bytesRead);
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
}
|
||
|
|
||
|
diskEntry->Unswap(); // disk to memory
|
||
|
// Check if calculated size agrees with bytesRead
|
||
|
if (bytesRead < 0 || (PRUint32)bytesRead < diskEntry->Size()) {
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
} else {
|
||
|
// pass ownership to caller
|
||
|
*result = diskEntry;
|
||
|
diskEntry = nsnull;
|
||
|
}
|
||
|
exit:
|
||
|
// XXX auto ptr would be nice
|
||
|
if (fd) (void) PR_Close(fd);
|
||
|
delete [] (char *)diskEntry;
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::WriteDiskCacheEntry(nsDiskCacheBinding * binding)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: WriteDiskCacheEntry [%x]\n",
|
||
|
binding->mRecord.HashNumber()));
|
||
|
|
||
|
nsresult rv = NS_OK;
|
||
|
PRUint32 size;
|
||
|
nsDiskCacheEntry * diskEntry = CreateDiskCacheEntry(binding, &size);
|
||
|
if (!diskEntry) return NS_ERROR_UNEXPECTED;
|
||
|
|
||
|
PRUint32 fileIndex = CalculateFileIndex(size);
|
||
|
|
||
|
// Deallocate old storage if necessary
|
||
|
if (binding->mRecord.MetaLocationInitialized()) {
|
||
|
// we have existing storage
|
||
|
|
||
|
if ((binding->mRecord.MetaFile() == 0) &&
|
||
|
(fileIndex == 0)) { // keeping the separate file
|
||
|
// just decrement total
|
||
|
// XXX if bindRecord.MetaFileSize == USHRT_MAX, stat the file to see how big it is
|
||
|
DecrementTotalSize(binding->mRecord.MetaFileSize());
|
||
|
NS_ASSERTION(binding->mRecord.MetaFileGeneration() == binding->mGeneration,
|
||
|
"generations out of sync");
|
||
|
} else {
|
||
|
rv = DeleteStorage(&binding->mRecord, nsDiskCache::kMetaData);
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
binding->mRecord.SetEvictionRank(ULONG_MAX - SecondsFromPRTime(PR_Now()));
|
||
|
|
||
|
if (fileIndex == 0) {
|
||
|
// Write entry data to separate file
|
||
|
PRUint32 metaFileSizeK = ((size + 0x03FF) >> 10); // round up to nearest 1k
|
||
|
nsCOMPtr<nsILocalFile> localFile;
|
||
|
|
||
|
// XXX handle metaFileSizeK > USHRT_MAX
|
||
|
binding->mRecord.SetMetaFileGeneration(binding->mGeneration);
|
||
|
binding->mRecord.SetMetaFileSize(metaFileSizeK);
|
||
|
rv = UpdateRecord(&binding->mRecord);
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
|
||
|
rv = GetLocalFileForDiskCacheRecord(&binding->mRecord,
|
||
|
nsDiskCache::kMetaData,
|
||
|
getter_AddRefs(localFile));
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
|
||
|
// open the file
|
||
|
PRFileDesc * fd;
|
||
|
// open the file - restricted to user, the data could be confidential
|
||
|
rv = localFile->OpenNSPRFileDesc(PR_RDWR | PR_TRUNCATE | PR_CREATE_FILE, 00600, &fd);
|
||
|
if (NS_FAILED(rv)) goto exit; // unable to open or create file
|
||
|
|
||
|
// write the file
|
||
|
diskEntry->Swap();
|
||
|
PRInt32 bytesWritten = PR_Write(fd, diskEntry, size);
|
||
|
|
||
|
PRStatus err = PR_Close(fd);
|
||
|
if ((bytesWritten != (PRInt32)size) || (err != PR_SUCCESS)) {
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
goto exit;
|
||
|
}
|
||
|
// XXX handle metaFileSizeK == USHRT_MAX
|
||
|
IncrementTotalSize(metaFileSizeK);
|
||
|
|
||
|
} else {
|
||
|
PRUint32 blockSize = GetBlockSizeForIndex(fileIndex);
|
||
|
PRUint32 blocks = ((size - 1) / blockSize) + 1;
|
||
|
|
||
|
// write entry data to disk cache block file
|
||
|
diskEntry->Swap();
|
||
|
PRInt32 startBlock;
|
||
|
rv = mBlockFile[fileIndex - 1].WriteBlocks(diskEntry, size, blocks, &startBlock);
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
|
||
|
// update binding and cache map record
|
||
|
binding->mRecord.SetMetaBlocks(fileIndex, startBlock, blocks);
|
||
|
rv = UpdateRecord(&binding->mRecord);
|
||
|
if (NS_FAILED(rv)) goto exit;
|
||
|
// XXX we should probably write out bucket ourselves
|
||
|
|
||
|
IncrementTotalSize(blocks, blockSize);
|
||
|
}
|
||
|
|
||
|
exit:
|
||
|
delete [] (char *)diskEntry;
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::ReadDataCacheBlocks(nsDiskCacheBinding * binding, char * buffer, PRUint32 size)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: ReadDataCacheBlocks [%x size=%u]\n",
|
||
|
binding->mRecord.HashNumber(), size));
|
||
|
|
||
|
PRUint32 fileIndex = binding->mRecord.DataFile();
|
||
|
PRInt32 readSize = size;
|
||
|
|
||
|
nsresult rv = mBlockFile[fileIndex - 1].ReadBlocks(buffer,
|
||
|
binding->mRecord.DataStartBlock(),
|
||
|
binding->mRecord.DataBlockCount(),
|
||
|
&readSize);
|
||
|
NS_ENSURE_SUCCESS(rv, rv);
|
||
|
if (readSize < (PRInt32)size) {
|
||
|
rv = NS_ERROR_UNEXPECTED;
|
||
|
}
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::WriteDataCacheBlocks(nsDiskCacheBinding * binding, char * buffer, PRUint32 size)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: WriteDataCacheBlocks [%x size=%u]\n",
|
||
|
binding->mRecord.HashNumber(), size));
|
||
|
|
||
|
nsresult rv = NS_OK;
|
||
|
|
||
|
// determine block file & number of blocks
|
||
|
PRUint32 fileIndex = CalculateFileIndex(size);
|
||
|
PRUint32 blockSize = GetBlockSizeForIndex(fileIndex);
|
||
|
PRUint32 blockCount = 0;
|
||
|
PRInt32 startBlock = 0;
|
||
|
|
||
|
if (size > 0) {
|
||
|
blockCount = ((size - 1) / blockSize) + 1;
|
||
|
|
||
|
rv = mBlockFile[fileIndex - 1].WriteBlocks(buffer, size, blockCount, &startBlock);
|
||
|
NS_ENSURE_SUCCESS(rv, rv);
|
||
|
|
||
|
IncrementTotalSize(blockCount, blockSize);
|
||
|
}
|
||
|
|
||
|
// update binding and cache map record
|
||
|
binding->mRecord.SetDataBlocks(fileIndex, startBlock, blockCount);
|
||
|
if (!binding->mDoomed) {
|
||
|
rv = UpdateRecord(&binding->mRecord);
|
||
|
}
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::DeleteStorage(nsDiskCacheRecord * record)
|
||
|
{
|
||
|
nsresult rv1 = DeleteStorage(record, nsDiskCache::kData);
|
||
|
nsresult rv2 = DeleteStorage(record, nsDiskCache::kMetaData);
|
||
|
return NS_FAILED(rv1) ? rv1 : rv2;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::DeleteStorage(nsDiskCacheRecord * record, PRBool metaData)
|
||
|
{
|
||
|
CACHE_LOG_DEBUG(("CACHE: DeleteStorage [%x %u]\n", record->HashNumber(),
|
||
|
metaData));
|
||
|
|
||
|
nsresult rv = NS_ERROR_UNEXPECTED;
|
||
|
PRUint32 fileIndex = metaData ? record->MetaFile() : record->DataFile();
|
||
|
nsCOMPtr<nsIFile> file;
|
||
|
|
||
|
if (fileIndex == 0) {
|
||
|
// delete the file
|
||
|
PRUint32 sizeK = metaData ? record->MetaFileSize() : record->DataFileSize();
|
||
|
// XXX if sizeK == USHRT_MAX, stat file for actual size
|
||
|
|
||
|
rv = GetFileForDiskCacheRecord(record, metaData, getter_AddRefs(file));
|
||
|
if (NS_SUCCEEDED(rv)) {
|
||
|
rv = file->Remove(PR_FALSE); // false == non-recursive
|
||
|
}
|
||
|
DecrementTotalSize(sizeK);
|
||
|
|
||
|
} else if (fileIndex < 4) {
|
||
|
// deallocate blocks
|
||
|
PRUint32 startBlock = metaData ? record->MetaStartBlock() : record->DataStartBlock();
|
||
|
PRUint32 blockCount = metaData ? record->MetaBlockCount() : record->DataBlockCount();
|
||
|
|
||
|
rv = mBlockFile[fileIndex - 1].DeallocateBlocks(startBlock, blockCount);
|
||
|
DecrementTotalSize(blockCount, GetBlockSizeForIndex(fileIndex));
|
||
|
}
|
||
|
if (metaData) record->ClearMetaLocation();
|
||
|
else record->ClearDataLocation();
|
||
|
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::GetFileForDiskCacheRecord(nsDiskCacheRecord * record,
|
||
|
PRBool meta,
|
||
|
nsIFile ** result)
|
||
|
{
|
||
|
if (!mCacheDirectory) return NS_ERROR_NOT_AVAILABLE;
|
||
|
|
||
|
nsCOMPtr<nsIFile> file;
|
||
|
nsresult rv = mCacheDirectory->Clone(getter_AddRefs(file));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
PRInt16 generation = record->Generation();
|
||
|
char name[32];
|
||
|
::sprintf(name, "%08X%c%02X", record->HashNumber(), (meta ? 'm' : 'd'), generation);
|
||
|
rv = file->AppendNative(nsDependentCString(name));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
NS_IF_ADDREF(*result = file);
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::GetLocalFileForDiskCacheRecord(nsDiskCacheRecord * record,
|
||
|
PRBool meta,
|
||
|
nsILocalFile ** result)
|
||
|
{
|
||
|
nsCOMPtr<nsIFile> file;
|
||
|
nsresult rv = GetFileForDiskCacheRecord(record, meta, getter_AddRefs(file));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
nsCOMPtr<nsILocalFile> localFile = do_QueryInterface(file, &rv);
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
NS_IF_ADDREF(*result = localFile);
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
nsresult
|
||
|
nsDiskCacheMap::GetBlockFileForIndex(PRUint32 index, nsILocalFile ** result)
|
||
|
{
|
||
|
if (!mCacheDirectory) return NS_ERROR_NOT_AVAILABLE;
|
||
|
|
||
|
nsCOMPtr<nsIFile> file;
|
||
|
nsresult rv = mCacheDirectory->Clone(getter_AddRefs(file));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
char name[32];
|
||
|
::sprintf(name, "_CACHE_%03d_", index + 1);
|
||
|
rv = file->AppendNative(nsDependentCString(name));
|
||
|
if (NS_FAILED(rv)) return rv;
|
||
|
|
||
|
nsCOMPtr<nsILocalFile> localFile = do_QueryInterface(file, &rv);
|
||
|
NS_IF_ADDREF(*result = localFile);
|
||
|
|
||
|
return rv;
|
||
|
}
|
||
|
|
||
|
|
||
|
PRUint32
|
||
|
nsDiskCacheMap::CalculateFileIndex(PRUint32 size)
|
||
|
{
|
||
|
if (size <= 1024) return 1;
|
||
|
if (size <= 4096) return 2;
|
||
|
if (size <= 16384) return 3;
|
||
|
return 0;
|
||
|
}
|
||
|
|