mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
1322 lines
31 KiB
C++
1322 lines
31 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2; c-file-offsets: ((substatement-open . 0)) -*- */
|
|
/* ***** 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 mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is
|
|
* Netscape Communications Corporation.
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
* the Initial Developer. All Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
* either of 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 <stdlib.h>
|
|
|
|
#include "nsVoidArray.h"
|
|
#include "nsQuickSort.h"
|
|
#include "prbit.h"
|
|
#include "nsISupportsImpl.h" // for nsTraceRefcnt
|
|
#include "nsCRTGlue.h"
|
|
|
|
/**
|
|
* Grow the array by at least this many elements at a time.
|
|
*/
|
|
static const PRInt32 kMinGrowArrayBy = 8;
|
|
static const PRInt32 kMaxGrowArrayBy = 1024;
|
|
static const PRInt32 kAutoClearCompactSizeFactor = 4;
|
|
|
|
/**
|
|
* This is the threshold (in bytes) of the mImpl struct, past which
|
|
* we'll force the array to grow geometrically
|
|
*/
|
|
static const PRInt32 kLinearThreshold = 24 * sizeof(void *);
|
|
|
|
/**
|
|
* Compute the number of bytes requires for the mImpl struct that will
|
|
* hold |n| elements.
|
|
*/
|
|
#define SIZEOF_IMPL(n_) (sizeof(Impl) + sizeof(void *) * ((n_) - 1))
|
|
|
|
|
|
/**
|
|
* Compute the number of elements that an mImpl struct of |n| bytes
|
|
* will hold.
|
|
*/
|
|
#define CAPACITYOF_IMPL(n_) ((((n_) - sizeof(Impl)) / sizeof(void *)) + 1)
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
#define MAXVOID 10
|
|
|
|
class VoidStats {
|
|
public:
|
|
VoidStats();
|
|
~VoidStats();
|
|
|
|
};
|
|
|
|
static int sizesUsed; // number of the elements of the arrays used
|
|
static int sizesAlloced[MAXVOID]; // sizes of the allocations. sorted
|
|
static int NumberOfSize[MAXVOID]; // number of this allocation size (1 per array)
|
|
static int AllocedOfSize[MAXVOID]; // number of this allocation size (each size for array used)
|
|
static int MaxAuto[MAXVOID]; // AutoArrays that maxed out at this size
|
|
static int GrowInPlace[MAXVOID]; // arrays this size that grew in-place via realloc
|
|
|
|
// these are per-allocation
|
|
static int MaxElements[2000]; // # of arrays that maxed out at each size.
|
|
|
|
// statistics macros
|
|
#define ADD_TO_STATS(x,size) do {int i; for (i = 0; i < sizesUsed; i++) \
|
|
{ \
|
|
if (sizesAlloced[i] == (int)(size)) \
|
|
{ ((x)[i])++; break; } \
|
|
} \
|
|
if (i >= sizesUsed && sizesUsed < MAXVOID) \
|
|
{ sizesAlloced[sizesUsed] = (size); \
|
|
((x)[sizesUsed++])++; break; \
|
|
} \
|
|
} while (0)
|
|
|
|
#define SUB_FROM_STATS(x,size) do {int i; for (i = 0; i < sizesUsed; i++) \
|
|
{ \
|
|
if (sizesAlloced[i] == (int)(size)) \
|
|
{ ((x)[i])--; break; } \
|
|
} \
|
|
} while (0)
|
|
|
|
|
|
VoidStats::VoidStats()
|
|
{
|
|
sizesUsed = 1;
|
|
sizesAlloced[0] = 0;
|
|
}
|
|
|
|
VoidStats::~VoidStats()
|
|
{
|
|
int i;
|
|
for (i = 0; i < sizesUsed; i++)
|
|
{
|
|
printf("Size %d:\n",sizesAlloced[i]);
|
|
printf("\tNumber of VoidArrays this size (max): %d\n",NumberOfSize[i]-MaxAuto[i]);
|
|
printf("\tNumber of AutoVoidArrays this size (max): %d\n",MaxAuto[i]);
|
|
printf("\tNumber of allocations this size (total): %d\n",AllocedOfSize[i]);
|
|
printf("\tNumber of GrowsInPlace this size (total): %d\n",GrowInPlace[i]);
|
|
}
|
|
printf("Max Size of VoidArray:\n");
|
|
for (i = 0; i < (int)(sizeof(MaxElements)/sizeof(MaxElements[0])); i++)
|
|
{
|
|
if (MaxElements[i])
|
|
printf("\t%d: %d\n",i,MaxElements[i]);
|
|
}
|
|
}
|
|
|
|
// Just so constructor/destructor's get called
|
|
VoidStats gVoidStats;
|
|
#endif
|
|
|
|
void
|
|
nsVoidArray::SetArray(Impl *newImpl, PRInt32 aSize, PRInt32 aCount,
|
|
PRBool aOwner, PRBool aHasAuto)
|
|
{
|
|
// old mImpl has been realloced and so we don't free/delete it
|
|
NS_PRECONDITION(newImpl, "can't set size");
|
|
mImpl = newImpl;
|
|
mImpl->mCount = aCount;
|
|
mImpl->mBits = static_cast<PRUint32>(aSize & kArraySizeMask) |
|
|
(aOwner ? kArrayOwnerMask : 0) |
|
|
(aHasAuto ? kArrayHasAutoBufferMask : 0);
|
|
}
|
|
|
|
// This does all allocation/reallocation of the array.
|
|
// It also will compact down to N - good for things that might grow a lot
|
|
// at times, but usually are smaller, like JS deferred GC releases.
|
|
PRBool nsVoidArray::SizeTo(PRInt32 aSize)
|
|
{
|
|
PRUint32 oldsize = GetArraySize();
|
|
PRBool isOwner = IsArrayOwner();
|
|
PRBool hasAuto = HasAutoBuffer();
|
|
|
|
if (aSize == (PRInt32) oldsize)
|
|
return PR_TRUE; // no change
|
|
|
|
if (aSize <= 0)
|
|
{
|
|
// free the array if allocated
|
|
if (mImpl)
|
|
{
|
|
if (isOwner)
|
|
{
|
|
free(reinterpret_cast<char *>(mImpl));
|
|
if (hasAuto) {
|
|
static_cast<nsAutoVoidArray*>(this)->ResetToAutoBuffer();
|
|
}
|
|
else {
|
|
mImpl = nsnull;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
mImpl->mCount = 0; // nsAutoVoidArray
|
|
}
|
|
}
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (mImpl && isOwner)
|
|
{
|
|
// We currently own an array impl. Resize it appropriately.
|
|
if (aSize < mImpl->mCount)
|
|
{
|
|
// XXX Note: we could also just resize to mCount
|
|
return PR_TRUE; // can't make it that small, ignore request
|
|
}
|
|
|
|
char* bytes = (char *) realloc(mImpl,SIZEOF_IMPL(aSize));
|
|
Impl* newImpl = reinterpret_cast<Impl*>(bytes);
|
|
if (!newImpl)
|
|
return PR_FALSE;
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl == newImpl)
|
|
ADD_TO_STATS(GrowInPlace,oldsize);
|
|
ADD_TO_STATS(AllocedOfSize,SIZEOF_IMPL(aSize));
|
|
if (aSize > mMaxSize)
|
|
{
|
|
ADD_TO_STATS(NumberOfSize,SIZEOF_IMPL(aSize));
|
|
if (oldsize)
|
|
SUB_FROM_STATS(NumberOfSize,oldsize);
|
|
mMaxSize = aSize;
|
|
if (mIsAuto)
|
|
{
|
|
ADD_TO_STATS(MaxAuto,SIZEOF_IMPL(aSize));
|
|
SUB_FROM_STATS(MaxAuto,oldsize);
|
|
}
|
|
}
|
|
#endif
|
|
SetArray(newImpl, aSize, newImpl->mCount, PR_TRUE, hasAuto);
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if ((PRUint32) aSize < oldsize) {
|
|
// No point in allocating if it won't free the current Impl anyway.
|
|
return PR_TRUE;
|
|
}
|
|
|
|
// just allocate an array
|
|
// allocate the exact size requested
|
|
char* bytes = (char *) malloc(SIZEOF_IMPL(aSize));
|
|
Impl* newImpl = reinterpret_cast<Impl*>(bytes);
|
|
if (!newImpl)
|
|
return PR_FALSE;
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
ADD_TO_STATS(AllocedOfSize,SIZEOF_IMPL(aSize));
|
|
if (aSize > mMaxSize)
|
|
{
|
|
ADD_TO_STATS(NumberOfSize,SIZEOF_IMPL(aSize));
|
|
if (oldsize && !mImpl)
|
|
SUB_FROM_STATS(NumberOfSize,oldsize);
|
|
mMaxSize = aSize;
|
|
}
|
|
#endif
|
|
if (mImpl)
|
|
{
|
|
#if DEBUG_VOIDARRAY
|
|
ADD_TO_STATS(MaxAuto,SIZEOF_IMPL(aSize));
|
|
SUB_FROM_STATS(MaxAuto,0);
|
|
SUB_FROM_STATS(NumberOfSize,0);
|
|
mIsAuto = PR_TRUE;
|
|
#endif
|
|
// We must be growing an nsAutoVoidArray - copy since we didn't
|
|
// realloc.
|
|
memcpy(newImpl->mArray, mImpl->mArray,
|
|
mImpl->mCount * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
SetArray(newImpl, aSize, mImpl ? mImpl->mCount : 0, PR_TRUE, hasAuto);
|
|
// no memset; handled later in ReplaceElementAt if needed
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRBool nsVoidArray::GrowArrayBy(PRInt32 aGrowBy)
|
|
{
|
|
// We have to grow the array. Grow by kMinGrowArrayBy slots if we're
|
|
// smaller than kLinearThreshold bytes, or a power of two if we're
|
|
// larger. This is much more efficient with most memory allocators,
|
|
// especially if it's very large, or of the allocator is binned.
|
|
if (aGrowBy < kMinGrowArrayBy)
|
|
aGrowBy = kMinGrowArrayBy;
|
|
|
|
PRUint32 newCapacity = GetArraySize() + aGrowBy; // Minimum increase
|
|
PRUint32 newSize = SIZEOF_IMPL(newCapacity);
|
|
|
|
if (newSize >= (PRUint32) kLinearThreshold)
|
|
{
|
|
// newCount includes enough space for at least kMinGrowArrayBy new
|
|
// slots. Select the next power-of-two size in bytes above or
|
|
// equal to that.
|
|
// Also, limit the increase in size to about a VM page or two.
|
|
if (GetArraySize() >= kMaxGrowArrayBy)
|
|
{
|
|
newCapacity = GetArraySize() + PR_MAX(kMaxGrowArrayBy,aGrowBy);
|
|
newSize = SIZEOF_IMPL(newCapacity);
|
|
}
|
|
else
|
|
{
|
|
PR_CEILING_LOG2(newSize, newSize);
|
|
newCapacity = CAPACITYOF_IMPL(PR_BIT(newSize));
|
|
}
|
|
}
|
|
// frees old mImpl IF this succeeds
|
|
if (!SizeTo(newCapacity))
|
|
return PR_FALSE;
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
nsVoidArray::nsVoidArray()
|
|
: mImpl(nsnull)
|
|
{
|
|
MOZ_COUNT_CTOR(nsVoidArray);
|
|
#if DEBUG_VOIDARRAY
|
|
mMaxCount = 0;
|
|
mMaxSize = 0;
|
|
mIsAuto = PR_FALSE;
|
|
ADD_TO_STATS(NumberOfSize,0);
|
|
MaxElements[0]++;
|
|
#endif
|
|
}
|
|
|
|
nsVoidArray::nsVoidArray(PRInt32 aCount)
|
|
: mImpl(nsnull)
|
|
{
|
|
MOZ_COUNT_CTOR(nsVoidArray);
|
|
#if DEBUG_VOIDARRAY
|
|
mMaxCount = 0;
|
|
mMaxSize = 0;
|
|
mIsAuto = PR_FALSE;
|
|
MaxElements[0]++;
|
|
#endif
|
|
SizeTo(aCount);
|
|
}
|
|
|
|
nsVoidArray& nsVoidArray::operator=(const nsVoidArray& other)
|
|
{
|
|
PRInt32 otherCount = other.Count();
|
|
PRInt32 maxCount = GetArraySize();
|
|
if (otherCount)
|
|
{
|
|
if (otherCount > maxCount)
|
|
{
|
|
// frees old mImpl IF this succeeds
|
|
if (!GrowArrayBy(otherCount-maxCount))
|
|
return *this; // XXX The allocation failed - don't do anything
|
|
|
|
memcpy(mImpl->mArray, other.mImpl->mArray, otherCount * sizeof(mImpl->mArray[0]));
|
|
mImpl->mCount = otherCount;
|
|
}
|
|
else
|
|
{
|
|
// the old array can hold the new array
|
|
memcpy(mImpl->mArray, other.mImpl->mArray, otherCount * sizeof(mImpl->mArray[0]));
|
|
mImpl->mCount = otherCount;
|
|
// if it shrank a lot, compact it anyways
|
|
if ((otherCount*2) < maxCount && maxCount > 100)
|
|
{
|
|
Compact(); // shrank by at least 50 entries
|
|
}
|
|
}
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl->mCount > mMaxCount &&
|
|
mImpl->mCount < (PRInt32)(sizeof(MaxElements)/sizeof(MaxElements[0])))
|
|
{
|
|
MaxElements[mImpl->mCount]++;
|
|
MaxElements[mMaxCount]--;
|
|
mMaxCount = mImpl->mCount;
|
|
}
|
|
#endif
|
|
}
|
|
else
|
|
{
|
|
// Why do we drop the buffer here when we don't in Clear()?
|
|
SizeTo(0);
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
nsVoidArray::~nsVoidArray()
|
|
{
|
|
MOZ_COUNT_DTOR(nsVoidArray);
|
|
if (mImpl && IsArrayOwner())
|
|
free(reinterpret_cast<char*>(mImpl));
|
|
}
|
|
|
|
PRBool nsVoidArray::SetCount(PRInt32 aNewCount)
|
|
{
|
|
NS_ASSERTION(aNewCount >= 0,"SetCount(negative index)");
|
|
if (aNewCount < 0)
|
|
return PR_FALSE;
|
|
|
|
if (aNewCount == 0)
|
|
{
|
|
Clear();
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (PRUint32(aNewCount) > PRUint32(GetArraySize()))
|
|
{
|
|
PRInt32 oldCount = Count();
|
|
PRInt32 growDelta = aNewCount - oldCount;
|
|
|
|
// frees old mImpl IF this succeeds
|
|
if (!GrowArrayBy(growDelta))
|
|
return PR_FALSE;
|
|
}
|
|
|
|
if (aNewCount > mImpl->mCount)
|
|
{
|
|
// Make sure that new entries added to the array by this
|
|
// SetCount are cleared to 0. Some users of this assume that.
|
|
// This code means we don't have to memset when we allocate an array.
|
|
memset(&mImpl->mArray[mImpl->mCount], 0,
|
|
(aNewCount - mImpl->mCount) * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
mImpl->mCount = aNewCount;
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl->mCount > mMaxCount &&
|
|
mImpl->mCount < (PRInt32)(sizeof(MaxElements)/sizeof(MaxElements[0])))
|
|
{
|
|
MaxElements[mImpl->mCount]++;
|
|
MaxElements[mMaxCount]--;
|
|
mMaxCount = mImpl->mCount;
|
|
}
|
|
#endif
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRInt32 nsVoidArray::IndexOf(void* aPossibleElement) const
|
|
{
|
|
if (mImpl)
|
|
{
|
|
void** ap = mImpl->mArray;
|
|
void** end = ap + mImpl->mCount;
|
|
while (ap < end)
|
|
{
|
|
if (*ap == aPossibleElement)
|
|
{
|
|
return ap - mImpl->mArray;
|
|
}
|
|
ap++;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
PRBool nsVoidArray::InsertElementAt(void* aElement, PRInt32 aIndex)
|
|
{
|
|
PRInt32 oldCount = Count();
|
|
NS_ASSERTION(aIndex >= 0,"InsertElementAt(negative index)");
|
|
if (PRUint32(aIndex) > PRUint32(oldCount))
|
|
{
|
|
// An invalid index causes the insertion to fail
|
|
// Invalid indexes are ones that add more than one entry to the
|
|
// array (i.e., they can append).
|
|
return PR_FALSE;
|
|
}
|
|
|
|
if (oldCount >= GetArraySize())
|
|
{
|
|
if (!GrowArrayBy(1))
|
|
return PR_FALSE;
|
|
}
|
|
// else the array is already large enough
|
|
|
|
PRInt32 slide = oldCount - aIndex;
|
|
if (0 != slide)
|
|
{
|
|
// Slide data over to make room for the insertion
|
|
memmove(mImpl->mArray + aIndex + 1, mImpl->mArray + aIndex,
|
|
slide * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
mImpl->mArray[aIndex] = aElement;
|
|
mImpl->mCount++;
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl->mCount > mMaxCount &&
|
|
mImpl->mCount < (PRInt32)(sizeof(MaxElements)/sizeof(MaxElements[0])))
|
|
{
|
|
MaxElements[mImpl->mCount]++;
|
|
MaxElements[mMaxCount]--;
|
|
mMaxCount = mImpl->mCount;
|
|
}
|
|
#endif
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRBool nsVoidArray::InsertElementsAt(const nsVoidArray& other, PRInt32 aIndex)
|
|
{
|
|
PRInt32 oldCount = Count();
|
|
PRInt32 otherCount = other.Count();
|
|
|
|
NS_ASSERTION(aIndex >= 0,"InsertElementsAt(negative index)");
|
|
if (PRUint32(aIndex) > PRUint32(oldCount))
|
|
{
|
|
// An invalid index causes the insertion to fail
|
|
// Invalid indexes are ones that are more than one entry past the end of
|
|
// the array (i.e., they can append).
|
|
return PR_FALSE;
|
|
}
|
|
|
|
if (oldCount + otherCount > GetArraySize())
|
|
{
|
|
if (!GrowArrayBy(otherCount))
|
|
return PR_FALSE;;
|
|
}
|
|
// else the array is already large enough
|
|
|
|
PRInt32 slide = oldCount - aIndex;
|
|
if (0 != slide)
|
|
{
|
|
// Slide data over to make room for the insertion
|
|
memmove(mImpl->mArray + aIndex + otherCount, mImpl->mArray + aIndex,
|
|
slide * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
for (PRInt32 i = 0; i < otherCount; i++)
|
|
{
|
|
// copy all the elements (destroys aIndex)
|
|
mImpl->mArray[aIndex++] = other.mImpl->mArray[i];
|
|
mImpl->mCount++;
|
|
}
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl->mCount > mMaxCount &&
|
|
mImpl->mCount < (PRInt32)(sizeof(MaxElements)/sizeof(MaxElements[0])))
|
|
{
|
|
MaxElements[mImpl->mCount]++;
|
|
MaxElements[mMaxCount]--;
|
|
mMaxCount = mImpl->mCount;
|
|
}
|
|
#endif
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRBool nsVoidArray::ReplaceElementAt(void* aElement, PRInt32 aIndex)
|
|
{
|
|
NS_ASSERTION(aIndex >= 0,"ReplaceElementAt(negative index)");
|
|
if (aIndex < 0)
|
|
return PR_FALSE;
|
|
|
|
// Unlike InsertElementAt, ReplaceElementAt can implicitly add more
|
|
// than just the one element to the array.
|
|
if (PRUint32(aIndex) >= PRUint32(GetArraySize()))
|
|
{
|
|
PRInt32 oldCount = Count();
|
|
PRInt32 requestedCount = aIndex + 1;
|
|
PRInt32 growDelta = requestedCount - oldCount;
|
|
|
|
// frees old mImpl IF this succeeds
|
|
if (!GrowArrayBy(growDelta))
|
|
return PR_FALSE;
|
|
}
|
|
|
|
mImpl->mArray[aIndex] = aElement;
|
|
if (aIndex >= mImpl->mCount)
|
|
{
|
|
// Make sure that any entries implicitly added to the array by this
|
|
// ReplaceElementAt are cleared to 0. Some users of this assume that.
|
|
// This code means we don't have to memset when we allocate an array.
|
|
if (aIndex > mImpl->mCount) // note: not >=
|
|
{
|
|
// For example, if mCount is 2, and we do a ReplaceElementAt for
|
|
// element[5], then we need to set three entries ([2], [3], and [4])
|
|
// to 0.
|
|
memset(&mImpl->mArray[mImpl->mCount], 0,
|
|
(aIndex - mImpl->mCount) * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
mImpl->mCount = aIndex + 1;
|
|
|
|
#if DEBUG_VOIDARRAY
|
|
if (mImpl->mCount > mMaxCount &&
|
|
mImpl->mCount < (PRInt32)(sizeof(MaxElements)/sizeof(MaxElements[0])))
|
|
{
|
|
MaxElements[mImpl->mCount]++;
|
|
MaxElements[mMaxCount]--;
|
|
mMaxCount = mImpl->mCount;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
// useful for doing LRU arrays
|
|
PRBool nsVoidArray::MoveElement(PRInt32 aFrom, PRInt32 aTo)
|
|
{
|
|
void *tempElement;
|
|
|
|
if (aTo == aFrom)
|
|
return PR_TRUE;
|
|
|
|
NS_ASSERTION(aTo >= 0 && aFrom >= 0,"MoveElement(negative index)");
|
|
if (aTo >= Count() || aFrom >= Count())
|
|
{
|
|
// can't extend the array when moving an element. Also catches mImpl = null
|
|
return PR_FALSE;
|
|
}
|
|
tempElement = mImpl->mArray[aFrom];
|
|
|
|
if (aTo < aFrom)
|
|
{
|
|
// Moving one element closer to the head; the elements inbetween move down
|
|
memmove(mImpl->mArray + aTo + 1, mImpl->mArray + aTo,
|
|
(aFrom-aTo) * sizeof(mImpl->mArray[0]));
|
|
mImpl->mArray[aTo] = tempElement;
|
|
}
|
|
else // already handled aFrom == aTo
|
|
{
|
|
// Moving one element closer to the tail; the elements inbetween move up
|
|
memmove(mImpl->mArray + aFrom, mImpl->mArray + aFrom + 1,
|
|
(aTo-aFrom) * sizeof(mImpl->mArray[0]));
|
|
mImpl->mArray[aTo] = tempElement;
|
|
}
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRBool nsVoidArray::RemoveElementsAt(PRInt32 aIndex, PRInt32 aCount)
|
|
{
|
|
PRInt32 oldCount = Count();
|
|
NS_ASSERTION(aIndex >= 0,"RemoveElementsAt(negative index)");
|
|
if (PRUint32(aIndex) >= PRUint32(oldCount))
|
|
{
|
|
// An invalid index causes the replace to fail
|
|
return PR_FALSE;
|
|
}
|
|
// Limit to available entries starting at aIndex
|
|
if (aCount + aIndex > oldCount)
|
|
aCount = oldCount - aIndex;
|
|
|
|
// We don't need to move any elements if we're removing the
|
|
// last element in the array
|
|
if (aIndex < (oldCount - aCount))
|
|
{
|
|
memmove(mImpl->mArray + aIndex, mImpl->mArray + aIndex + aCount,
|
|
(oldCount - (aIndex + aCount)) * sizeof(mImpl->mArray[0]));
|
|
}
|
|
|
|
mImpl->mCount -= aCount;
|
|
return PR_TRUE;
|
|
}
|
|
|
|
PRBool nsVoidArray::RemoveElement(void* aElement)
|
|
{
|
|
PRInt32 theIndex = IndexOf(aElement);
|
|
if (theIndex != -1)
|
|
return RemoveElementAt(theIndex);
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
void nsVoidArray::Clear()
|
|
{
|
|
if (mImpl)
|
|
{
|
|
mImpl->mCount = 0;
|
|
// We don't have to free on Clear, but if we have a built-in buffer,
|
|
// it's worth considering.
|
|
if (HasAutoBuffer() && IsArrayOwner() &&
|
|
GetArraySize() > kAutoClearCompactSizeFactor * kAutoBufSize) {
|
|
SizeTo(0);
|
|
}
|
|
}
|
|
}
|
|
|
|
void nsVoidArray::Compact()
|
|
{
|
|
if (mImpl)
|
|
{
|
|
// XXX NOTE: this is quite inefficient in many cases if we're only
|
|
// compacting by a little, but some callers care more about memory use.
|
|
PRInt32 count = Count();
|
|
if (HasAutoBuffer() && count <= kAutoBufSize)
|
|
{
|
|
Impl* oldImpl = mImpl;
|
|
static_cast<nsAutoVoidArray*>(this)->ResetToAutoBuffer();
|
|
memcpy(mImpl->mArray, oldImpl->mArray,
|
|
count * sizeof(mImpl->mArray[0]));
|
|
free(reinterpret_cast<char *>(oldImpl));
|
|
}
|
|
else if (GetArraySize() > count)
|
|
{
|
|
SizeTo(Count());
|
|
}
|
|
}
|
|
}
|
|
|
|
// Needed because we want to pass the pointer to the item in the array
|
|
// to the comparator function, not a pointer to the pointer in the array.
|
|
struct VoidArrayComparatorContext {
|
|
nsVoidArrayComparatorFunc mComparatorFunc;
|
|
void* mData;
|
|
};
|
|
|
|
static int
|
|
VoidArrayComparator(const void* aElement1, const void* aElement2, void* aData)
|
|
{
|
|
VoidArrayComparatorContext* ctx = static_cast<VoidArrayComparatorContext*>(aData);
|
|
return (*ctx->mComparatorFunc)(*static_cast<void* const*>(aElement1),
|
|
*static_cast<void* const*>(aElement2),
|
|
ctx->mData);
|
|
}
|
|
|
|
void nsVoidArray::Sort(nsVoidArrayComparatorFunc aFunc, void* aData)
|
|
{
|
|
if (mImpl && mImpl->mCount > 1)
|
|
{
|
|
VoidArrayComparatorContext ctx = {aFunc, aData};
|
|
NS_QuickSort(mImpl->mArray, mImpl->mCount, sizeof(mImpl->mArray[0]),
|
|
VoidArrayComparator, &ctx);
|
|
}
|
|
}
|
|
|
|
PRBool nsVoidArray::EnumerateForwards(nsVoidArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
PRInt32 index = -1;
|
|
PRBool running = PR_TRUE;
|
|
|
|
if (mImpl)
|
|
{
|
|
while (running && (++index < mImpl->mCount))
|
|
{
|
|
running = (*aFunc)(mImpl->mArray[index], aData);
|
|
}
|
|
}
|
|
return running;
|
|
}
|
|
|
|
PRBool nsVoidArray::EnumerateBackwards(nsVoidArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
PRBool running = PR_TRUE;
|
|
|
|
if (mImpl)
|
|
{
|
|
PRInt32 index = Count();
|
|
while (running && (0 <= --index))
|
|
{
|
|
running = (*aFunc)(mImpl->mArray[index], aData);
|
|
}
|
|
}
|
|
return running;
|
|
}
|
|
|
|
//----------------------------------------------------------------
|
|
// nsAutoVoidArray
|
|
|
|
nsAutoVoidArray::nsAutoVoidArray()
|
|
: nsVoidArray()
|
|
{
|
|
// Don't need to clear it. Some users just call ReplaceElementAt(),
|
|
// but we'll clear it at that time if needed to save CPU cycles.
|
|
#if DEBUG_VOIDARRAY
|
|
mIsAuto = PR_TRUE;
|
|
ADD_TO_STATS(MaxAuto,0);
|
|
#endif
|
|
ResetToAutoBuffer();
|
|
}
|
|
|
|
//----------------------------------------------------------------
|
|
// nsCStringArray
|
|
|
|
nsCStringArray::nsCStringArray(void)
|
|
: nsVoidArray()
|
|
{
|
|
}
|
|
|
|
nsCStringArray::nsCStringArray(PRInt32 aCount)
|
|
: nsVoidArray(aCount)
|
|
{
|
|
}
|
|
|
|
nsCStringArray::~nsCStringArray(void)
|
|
{
|
|
Clear();
|
|
}
|
|
|
|
nsCStringArray&
|
|
nsCStringArray::operator=(const nsCStringArray& other)
|
|
{
|
|
if (this == &other)
|
|
{
|
|
return *this;
|
|
}
|
|
|
|
// Free our strings
|
|
Clear();
|
|
|
|
// Copy the pointers
|
|
nsVoidArray::operator=(other);
|
|
|
|
// Now copy the strings
|
|
PRInt32 count = Count();
|
|
for (PRInt32 i = 0; i < count; ++i)
|
|
{
|
|
nsCString* oldString = static_cast<nsCString*>(other.ElementAt(i));
|
|
nsCString* newString = new nsCString(*oldString);
|
|
if (!newString)
|
|
{
|
|
mImpl->mCount = i;
|
|
return *this;
|
|
}
|
|
mImpl->mArray[i] = newString;
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
void
|
|
nsCStringArray::CStringAt(PRInt32 aIndex, nsACString& aCString) const
|
|
{
|
|
nsCString* string = static_cast<nsCString*>(nsVoidArray::ElementAt(aIndex));
|
|
if (nsnull != string)
|
|
{
|
|
aCString = *string;
|
|
}
|
|
else
|
|
{
|
|
aCString.Truncate();
|
|
}
|
|
}
|
|
|
|
nsCString*
|
|
nsCStringArray::CStringAt(PRInt32 aIndex) const
|
|
{
|
|
return static_cast<nsCString*>(nsVoidArray::ElementAt(aIndex));
|
|
}
|
|
|
|
PRInt32
|
|
nsCStringArray::IndexOf(const nsACString& aPossibleString) const
|
|
{
|
|
if (mImpl)
|
|
{
|
|
void** ap = mImpl->mArray;
|
|
void** end = ap + mImpl->mCount;
|
|
while (ap < end)
|
|
{
|
|
nsCString* string = static_cast<nsCString*>(*ap);
|
|
if (string->Equals(aPossibleString))
|
|
{
|
|
return ap - mImpl->mArray;
|
|
}
|
|
ap++;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
#ifdef MOZILLA_INTERNAL_API
|
|
PRInt32
|
|
nsCStringArray::IndexOfIgnoreCase(const nsACString& aPossibleString) const
|
|
{
|
|
if (mImpl)
|
|
{
|
|
void** ap = mImpl->mArray;
|
|
void** end = ap + mImpl->mCount;
|
|
while (ap < end)
|
|
{
|
|
nsCString* string = static_cast<nsCString*>(*ap);
|
|
if (string->Equals(aPossibleString, nsCaseInsensitiveCStringComparator()))
|
|
{
|
|
return ap - mImpl->mArray;
|
|
}
|
|
ap++;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
#endif
|
|
|
|
PRBool
|
|
nsCStringArray::InsertCStringAt(const nsACString& aCString, PRInt32 aIndex)
|
|
{
|
|
nsCString* string = new nsCString(aCString);
|
|
if (!string)
|
|
return PR_FALSE;
|
|
if (nsVoidArray::InsertElementAt(string, aIndex))
|
|
return PR_TRUE;
|
|
|
|
delete string;
|
|
return PR_FALSE;
|
|
}
|
|
|
|
PRBool
|
|
nsCStringArray::ReplaceCStringAt(const nsACString& aCString, PRInt32 aIndex)
|
|
{
|
|
nsCString* string = static_cast<nsCString*>(nsVoidArray::ElementAt(aIndex));
|
|
if (nsnull != string)
|
|
{
|
|
*string = aCString;
|
|
return PR_TRUE;
|
|
}
|
|
return PR_FALSE;
|
|
}
|
|
|
|
PRBool
|
|
nsCStringArray::RemoveCString(const nsACString& aCString)
|
|
{
|
|
PRInt32 index = IndexOf(aCString);
|
|
if (-1 < index)
|
|
{
|
|
return RemoveCStringAt(index);
|
|
}
|
|
return PR_FALSE;
|
|
}
|
|
|
|
#ifdef MOZILLA_INTERNAL_API
|
|
PRBool
|
|
nsCStringArray::RemoveCStringIgnoreCase(const nsACString& aCString)
|
|
{
|
|
PRInt32 index = IndexOfIgnoreCase(aCString);
|
|
if (-1 < index)
|
|
{
|
|
return RemoveCStringAt(index);
|
|
}
|
|
return PR_FALSE;
|
|
}
|
|
#endif
|
|
|
|
PRBool nsCStringArray::RemoveCStringAt(PRInt32 aIndex)
|
|
{
|
|
nsCString* string = CStringAt(aIndex);
|
|
if (nsnull != string)
|
|
{
|
|
nsVoidArray::RemoveElementAt(aIndex);
|
|
delete string;
|
|
return PR_TRUE;
|
|
}
|
|
return PR_FALSE;
|
|
}
|
|
|
|
void
|
|
nsCStringArray::Clear(void)
|
|
{
|
|
PRInt32 index = Count();
|
|
while (0 <= --index)
|
|
{
|
|
nsCString* string = static_cast<nsCString*>(mImpl->mArray[index]);
|
|
delete string;
|
|
}
|
|
nsVoidArray::Clear();
|
|
}
|
|
|
|
static int
|
|
CompareCString(const nsCString* aCString1, const nsCString* aCString2, void*)
|
|
{
|
|
#ifdef MOZILLA_INTERNAL_API
|
|
return Compare(*aCString1, *aCString2);
|
|
#else
|
|
const char* s1;
|
|
const char* s2;
|
|
PRUint32 len1 = NS_CStringGetData(*aCString1, &s1);
|
|
PRUint32 len2 = NS_CStringGetData(*aCString2, &s2);
|
|
int r = memcmp(s1, s2, PR_MIN(len1, len2));
|
|
if (r)
|
|
return r;
|
|
|
|
if (len1 < len2)
|
|
return -1;
|
|
|
|
if (len1 > len2)
|
|
return 1;
|
|
|
|
return 0;
|
|
#endif
|
|
}
|
|
|
|
#ifdef MOZILLA_INTERNAL_API
|
|
static int
|
|
CompareCStringIgnoreCase(const nsCString* aCString1, const nsCString* aCString2, void*)
|
|
{
|
|
return Compare(*aCString1, *aCString2, nsCaseInsensitiveCStringComparator());
|
|
}
|
|
#endif
|
|
|
|
void nsCStringArray::Sort(void)
|
|
{
|
|
Sort(CompareCString, nsnull);
|
|
}
|
|
|
|
#ifdef MOZILLA_INTERNAL_API
|
|
void nsCStringArray::SortIgnoreCase(void)
|
|
{
|
|
Sort(CompareCStringIgnoreCase, nsnull);
|
|
}
|
|
#endif
|
|
|
|
void nsCStringArray::Sort(nsCStringArrayComparatorFunc aFunc, void* aData)
|
|
{
|
|
nsVoidArray::Sort(reinterpret_cast<nsVoidArrayComparatorFunc>(aFunc), aData);
|
|
}
|
|
|
|
PRBool
|
|
nsCStringArray::EnumerateForwards(nsCStringArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
PRBool running = PR_TRUE;
|
|
|
|
if (mImpl)
|
|
{
|
|
PRInt32 index = -1;
|
|
while (running && (++index < mImpl->mCount))
|
|
{
|
|
running = (*aFunc)(*static_cast<nsCString*>(mImpl->mArray[index]), aData);
|
|
}
|
|
}
|
|
return running;
|
|
}
|
|
|
|
PRBool
|
|
nsCStringArray::EnumerateBackwards(nsCStringArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
PRBool running = PR_TRUE;
|
|
|
|
if (mImpl)
|
|
{
|
|
PRInt32 index = Count();
|
|
while (running && (0 <= --index))
|
|
{
|
|
running = (*aFunc)(*static_cast<nsCString*>(mImpl->mArray[index]), aData);
|
|
}
|
|
}
|
|
return running;
|
|
}
|
|
|
|
|
|
//----------------------------------------------------------------------
|
|
// NOTE: nsSmallVoidArray elements MUST all have the low bit as 0.
|
|
// This means that normally it's only used for pointers, and in particular
|
|
// structures or objects.
|
|
nsSmallVoidArray::~nsSmallVoidArray()
|
|
{
|
|
if (HasSingle())
|
|
{
|
|
// Have to null out mImpl before the nsVoidArray dtor runs.
|
|
mImpl = nsnull;
|
|
}
|
|
}
|
|
|
|
nsSmallVoidArray&
|
|
nsSmallVoidArray::operator=(nsSmallVoidArray& other)
|
|
{
|
|
PRInt32 count = other.Count();
|
|
switch (count) {
|
|
case 0:
|
|
Clear();
|
|
break;
|
|
case 1:
|
|
Clear();
|
|
AppendElement(other.ElementAt(0));
|
|
break;
|
|
default:
|
|
if (GetArraySize() >= count || SizeTo(count)) {
|
|
*AsArray() = *other.AsArray();
|
|
}
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
PRInt32
|
|
nsSmallVoidArray::GetArraySize() const
|
|
{
|
|
if (HasSingle()) {
|
|
return 1;
|
|
}
|
|
|
|
return AsArray()->GetArraySize();
|
|
}
|
|
|
|
PRInt32
|
|
nsSmallVoidArray::Count() const
|
|
{
|
|
if (HasSingle()) {
|
|
return 1;
|
|
}
|
|
|
|
return AsArray()->Count();
|
|
}
|
|
|
|
void*
|
|
nsSmallVoidArray::FastElementAt(PRInt32 aIndex) const
|
|
{
|
|
NS_ASSERTION(0 <= aIndex && aIndex < Count(), "nsSmallVoidArray::FastElementAt: index out of range");
|
|
|
|
if (HasSingle()) {
|
|
return GetSingle();
|
|
}
|
|
|
|
return AsArray()->FastElementAt(aIndex);
|
|
}
|
|
|
|
PRInt32
|
|
nsSmallVoidArray::IndexOf(void* aPossibleElement) const
|
|
{
|
|
if (HasSingle()) {
|
|
return aPossibleElement == GetSingle() ? 0 : -1;
|
|
}
|
|
|
|
return AsArray()->IndexOf(aPossibleElement);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::InsertElementAt(void* aElement, PRInt32 aIndex)
|
|
{
|
|
NS_ASSERTION(!(NS_PTR_TO_INT32(aElement) & 0x1),
|
|
"Attempt to add element with 0x1 bit set to nsSmallVoidArray");
|
|
|
|
if (aIndex == 0 && IsEmpty()) {
|
|
SetSingle(aElement);
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (!EnsureArray()) {
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->InsertElementAt(aElement, aIndex);
|
|
}
|
|
|
|
PRBool nsSmallVoidArray::InsertElementsAt(const nsVoidArray &aOther, PRInt32 aIndex)
|
|
{
|
|
#ifdef DEBUG
|
|
for (int i = 0; i < aOther.Count(); i++) {
|
|
NS_ASSERTION(!(NS_PTR_TO_INT32(aOther.ElementAt(i)) & 0x1),
|
|
"Attempt to add element with 0x1 bit set to nsSmallVoidArray");
|
|
}
|
|
#endif
|
|
|
|
if (aIndex == 0 && IsEmpty() && aOther.Count() == 1) {
|
|
SetSingle(aOther.FastElementAt(0));
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (!EnsureArray()) {
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->InsertElementsAt(aOther, aIndex);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::ReplaceElementAt(void* aElement, PRInt32 aIndex)
|
|
{
|
|
NS_ASSERTION(!(NS_PTR_TO_INT32(aElement) & 0x1),
|
|
"Attempt to add element with 0x1 bit set to nsSmallVoidArray");
|
|
|
|
if (aIndex == 0 && (IsEmpty() || HasSingle())) {
|
|
SetSingle(aElement);
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (!EnsureArray()) {
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->ReplaceElementAt(aElement, aIndex);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::AppendElement(void* aElement)
|
|
{
|
|
NS_ASSERTION(!(NS_PTR_TO_INT32(aElement) & 0x1),
|
|
"Attempt to add element with 0x1 bit set to nsSmallVoidArray");
|
|
|
|
if (IsEmpty()) {
|
|
SetSingle(aElement);
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (!EnsureArray()) {
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->AppendElement(aElement);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::RemoveElement(void* aElement)
|
|
{
|
|
if (HasSingle()) {
|
|
if (aElement == GetSingle()) {
|
|
mImpl = nsnull;
|
|
return PR_TRUE;
|
|
}
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->RemoveElement(aElement);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::RemoveElementAt(PRInt32 aIndex)
|
|
{
|
|
if (HasSingle()) {
|
|
if (aIndex == 0) {
|
|
mImpl = nsnull;
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->RemoveElementAt(aIndex);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::RemoveElementsAt(PRInt32 aIndex, PRInt32 aCount)
|
|
{
|
|
if (HasSingle()) {
|
|
if (aIndex == 0) {
|
|
if (aCount > 0) {
|
|
mImpl = nsnull;
|
|
}
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return AsArray()->RemoveElementsAt(aIndex, aCount);
|
|
}
|
|
|
|
void
|
|
nsSmallVoidArray::Clear()
|
|
{
|
|
if (HasSingle()) {
|
|
mImpl = nsnull;
|
|
}
|
|
else {
|
|
AsArray()->Clear();
|
|
}
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::SizeTo(PRInt32 aMin)
|
|
{
|
|
if (!HasSingle()) {
|
|
return AsArray()->SizeTo(aMin);
|
|
}
|
|
|
|
if (aMin <= 0) {
|
|
mImpl = nsnull;
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
if (aMin == 1) {
|
|
return PR_TRUE;
|
|
}
|
|
|
|
void* single = GetSingle();
|
|
mImpl = nsnull;
|
|
if (!AsArray()->SizeTo(aMin)) {
|
|
SetSingle(single);
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
AsArray()->AppendElement(single);
|
|
|
|
return PR_TRUE;
|
|
}
|
|
|
|
void
|
|
nsSmallVoidArray::Compact()
|
|
{
|
|
if (!HasSingle()) {
|
|
AsArray()->Compact();
|
|
}
|
|
}
|
|
|
|
void
|
|
nsSmallVoidArray::Sort(nsVoidArrayComparatorFunc aFunc, void* aData)
|
|
{
|
|
if (!HasSingle()) {
|
|
AsArray()->Sort(aFunc,aData);
|
|
}
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::EnumerateForwards(nsVoidArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
if (HasSingle()) {
|
|
return (*aFunc)(GetSingle(), aData);
|
|
}
|
|
return AsArray()->EnumerateForwards(aFunc,aData);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::EnumerateBackwards(nsVoidArrayEnumFunc aFunc, void* aData)
|
|
{
|
|
if (HasSingle()) {
|
|
return (*aFunc)(GetSingle(), aData);
|
|
}
|
|
return AsArray()->EnumerateBackwards(aFunc,aData);
|
|
}
|
|
|
|
PRBool
|
|
nsSmallVoidArray::EnsureArray()
|
|
{
|
|
if (!HasSingle()) {
|
|
return PR_TRUE;
|
|
}
|
|
|
|
void* single = GetSingle();
|
|
mImpl = nsnull;
|
|
if (!AsArray()->AppendElement(single)) {
|
|
SetSingle(single);
|
|
|
|
return PR_FALSE;
|
|
}
|
|
|
|
return PR_TRUE;
|
|
}
|