2010-03-15 04:38:50 -07:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
// vim:cindent:ts=4:et:sw=4:
|
|
|
|
/* ***** 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 the Mozilla Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 2010
|
|
|
|
* 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 "TestHarness.h"
|
|
|
|
#include "nsCOMArray.h"
|
|
|
|
|
|
|
|
// {9e70a320-be02-11d1-8031-006008159b5a}
|
|
|
|
#define NS_IFOO_IID \
|
|
|
|
{0x9e70a320, 0xbe02, 0x11d1, \
|
|
|
|
{0x80, 0x31, 0x00, 0x60, 0x08, 0x15, 0x9b, 0x5a}}
|
|
|
|
|
|
|
|
class IFoo : public nsISupports {
|
|
|
|
public:
|
|
|
|
|
|
|
|
NS_DECLARE_STATIC_IID_ACCESSOR(NS_IFOO_IID)
|
|
|
|
|
|
|
|
NS_IMETHOD_(nsrefcnt) RefCnt() = 0;
|
|
|
|
NS_IMETHOD_(PRInt32) ID() = 0;
|
|
|
|
};
|
|
|
|
|
|
|
|
NS_DEFINE_STATIC_IID_ACCESSOR(IFoo, NS_IFOO_IID)
|
|
|
|
|
|
|
|
class Foo : public IFoo {
|
|
|
|
public:
|
|
|
|
|
|
|
|
Foo(PRInt32 aID);
|
|
|
|
~Foo();
|
|
|
|
|
|
|
|
// nsISupports implementation
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
|
|
|
|
// IFoo implementation
|
|
|
|
NS_IMETHOD_(nsrefcnt) RefCnt() { return mRefCnt; }
|
|
|
|
NS_IMETHOD_(PRInt32) ID() { return mID; }
|
|
|
|
|
|
|
|
static PRInt32 gCount;
|
|
|
|
|
|
|
|
PRInt32 mID;
|
|
|
|
};
|
|
|
|
|
|
|
|
PRInt32 Foo::gCount = 0;
|
|
|
|
|
|
|
|
Foo::Foo(PRInt32 aID)
|
|
|
|
{
|
|
|
|
mID = aID;
|
|
|
|
++gCount;
|
|
|
|
}
|
|
|
|
|
|
|
|
Foo::~Foo()
|
|
|
|
{
|
|
|
|
--gCount;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMPL_ISUPPORTS1(Foo, IFoo)
|
|
|
|
|
|
|
|
|
|
|
|
typedef nsCOMArray<IFoo> Array;
|
|
|
|
|
|
|
|
|
2010-06-09 11:13:16 -07:00
|
|
|
// {0e70a320-be02-11d1-8031-006008159b5a}
|
|
|
|
#define NS_IBAR_IID \
|
|
|
|
{0x0e70a320, 0xbe02, 0x11d1, \
|
|
|
|
{0x80, 0x31, 0x00, 0x60, 0x08, 0x15, 0x9b, 0x5a}}
|
|
|
|
|
|
|
|
class IBar : public nsISupports {
|
|
|
|
public:
|
|
|
|
|
|
|
|
NS_DECLARE_STATIC_IID_ACCESSOR(NS_IBAR_IID)
|
|
|
|
};
|
|
|
|
|
|
|
|
NS_DEFINE_STATIC_IID_ACCESSOR(IBar, NS_IBAR_IID)
|
|
|
|
|
|
|
|
class Bar : public IBar {
|
|
|
|
public:
|
|
|
|
|
2011-04-14 07:18:02 -07:00
|
|
|
explicit Bar(nsCOMArray<IBar>& aArray);
|
2010-06-09 11:13:16 -07:00
|
|
|
~Bar();
|
|
|
|
|
|
|
|
// nsISupports implementation
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
|
|
|
|
static PRInt32 sReleaseCalled;
|
|
|
|
|
|
|
|
private:
|
|
|
|
nsCOMArray<IBar>& mArray;
|
|
|
|
};
|
|
|
|
|
|
|
|
PRInt32 Bar::sReleaseCalled = 0;
|
|
|
|
|
|
|
|
typedef nsCOMArray<IBar> Array2;
|
|
|
|
|
2011-04-14 07:18:02 -07:00
|
|
|
Bar::Bar(Array2& aArray)
|
2010-06-09 11:13:16 -07:00
|
|
|
: mArray(aArray)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
Bar::~Bar()
|
|
|
|
{
|
2011-04-14 07:18:02 -07:00
|
|
|
if (mArray.RemoveObject(this)) {
|
2010-06-09 11:13:16 -07:00
|
|
|
fail("We should never manage to remove the object here");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMPL_ADDREF(Bar)
|
|
|
|
NS_IMPL_QUERY_INTERFACE1(Bar, IBar)
|
|
|
|
|
|
|
|
NS_IMETHODIMP_(nsrefcnt)
|
|
|
|
Bar::Release(void)
|
|
|
|
{
|
|
|
|
++Bar::sReleaseCalled;
|
|
|
|
NS_PRECONDITION(0 != mRefCnt, "dup release");
|
|
|
|
NS_ASSERT_OWNINGTHREAD(_class);
|
|
|
|
--mRefCnt;
|
|
|
|
NS_LOG_RELEASE(this, mRefCnt, "Bar");
|
|
|
|
if (mRefCnt == 0) {
|
|
|
|
mRefCnt = 1; /* stabilize */
|
2010-07-05 02:42:18 -07:00
|
|
|
delete this;
|
2010-06-09 11:13:16 -07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return mRefCnt;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-15 04:38:50 -07:00
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
ScopedXPCOM xpcom("nsCOMArrayTests");
|
|
|
|
if (xpcom.failed()) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int rv = 0;
|
|
|
|
|
|
|
|
Array arr;
|
|
|
|
|
|
|
|
for (PRInt32 i = 0; i < 20; ++i) {
|
|
|
|
nsCOMPtr<IFoo> foo = new Foo(i);
|
|
|
|
arr.AppendObject(foo);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (arr.Count() != 20 || Foo::gCount != 20) {
|
|
|
|
fail("nsCOMArray::AppendObject failed");
|
|
|
|
rv = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
arr.SetCount(10);
|
|
|
|
|
|
|
|
if (arr.Count() != 10 || Foo::gCount != 10) {
|
|
|
|
fail("nsCOMArray::SetCount shortening of array failed");
|
|
|
|
rv = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
arr.SetCount(30);
|
|
|
|
|
|
|
|
if (arr.Count() != 30 || Foo::gCount != 10) {
|
|
|
|
fail("nsCOMArray::SetCount lengthening of array failed");
|
|
|
|
rv = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (PRInt32 i = 0; i < 10; ++i) {
|
|
|
|
if (arr[i] == nsnull) {
|
|
|
|
fail("nsCOMArray elements should be non-null");
|
|
|
|
rv = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (PRInt32 i = 10; i < 30; ++i) {
|
|
|
|
if (arr[i] != nsnull) {
|
|
|
|
fail("nsCOMArray elements should be null");
|
|
|
|
rv = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-06-09 11:13:16 -07:00
|
|
|
PRInt32 base;
|
|
|
|
{
|
|
|
|
Array2 arr2;
|
|
|
|
|
2011-04-14 07:18:02 -07:00
|
|
|
IBar *thirdObject,
|
|
|
|
*fourthObject,
|
|
|
|
*fifthObject,
|
|
|
|
*ninthObject;
|
2010-06-09 11:13:16 -07:00
|
|
|
for (PRInt32 i = 0; i < 20; ++i) {
|
2011-04-14 07:18:02 -07:00
|
|
|
nsCOMPtr<IBar> bar = new Bar(arr2);
|
|
|
|
switch (i) {
|
|
|
|
case 2:
|
|
|
|
thirdObject = bar; break;
|
|
|
|
case 3:
|
|
|
|
fourthObject = bar; break;
|
|
|
|
case 4:
|
|
|
|
fifthObject = bar; break;
|
|
|
|
case 8:
|
|
|
|
ninthObject = bar; break;
|
2010-06-09 11:13:16 -07:00
|
|
|
}
|
|
|
|
arr2.AppendObject(bar);
|
|
|
|
}
|
|
|
|
|
|
|
|
base = Bar::sReleaseCalled;
|
|
|
|
|
|
|
|
arr2.SetCount(10);
|
|
|
|
if (Bar::sReleaseCalled != base + 10) {
|
|
|
|
fail("Release called multiple times for SetCount");
|
|
|
|
}
|
2011-04-14 07:18:02 -07:00
|
|
|
if (arr2.Count() != 10) {
|
|
|
|
fail("SetCount(10) should remove exactly ten objects");
|
|
|
|
}
|
2010-06-09 11:13:16 -07:00
|
|
|
|
|
|
|
arr2.RemoveObjectAt(9);
|
|
|
|
if (Bar::sReleaseCalled != base + 11) {
|
|
|
|
fail("Release called multiple times for RemoveObjectAt");
|
|
|
|
}
|
2011-04-14 07:18:02 -07:00
|
|
|
if (arr2.Count() != 9) {
|
|
|
|
fail("RemoveObjectAt should remove exactly one object");
|
|
|
|
}
|
2010-06-09 11:13:16 -07:00
|
|
|
|
|
|
|
arr2.RemoveObject(ninthObject);
|
|
|
|
if (Bar::sReleaseCalled != base + 12) {
|
|
|
|
fail("Release called multiple times for RemoveObject");
|
|
|
|
}
|
2011-04-14 07:18:02 -07:00
|
|
|
if (arr2.Count() != 8) {
|
|
|
|
fail("RemoveObject should remove exactly one object");
|
|
|
|
}
|
|
|
|
|
|
|
|
arr2.RemoveObjectsAt(2, 3);
|
|
|
|
if (Bar::sReleaseCalled != base + 15) {
|
|
|
|
fail("Release called more or less than three times for RemoveObjectsAt");
|
|
|
|
}
|
|
|
|
if (arr2.Count() != 5) {
|
|
|
|
fail("RemoveObjectsAt should remove exactly three objects");
|
|
|
|
}
|
|
|
|
for (PRInt32 j = 0; j < arr2.Count(); ++j) {
|
|
|
|
if (arr2.ObjectAt(j) == thirdObject) {
|
|
|
|
fail("RemoveObjectsAt should have removed thirdObject");
|
|
|
|
}
|
|
|
|
if (arr2.ObjectAt(j) == fourthObject) {
|
|
|
|
fail("RemoveObjectsAt should have removed fourthObject");
|
|
|
|
}
|
|
|
|
if (arr2.ObjectAt(j) == fifthObject) {
|
|
|
|
fail("RemoveObjectsAt should have removed fifthObject");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
arr2.RemoveObjectsAt(4, 1);
|
|
|
|
if (Bar::sReleaseCalled != base + 16) {
|
|
|
|
fail("Release called more or less than one time for RemoveObjectsAt");
|
|
|
|
}
|
|
|
|
if (arr2.Count() != 4) {
|
|
|
|
fail("RemoveObjectsAt should work for removing the last element");
|
|
|
|
}
|
2010-06-09 11:13:16 -07:00
|
|
|
|
|
|
|
arr2.Clear();
|
|
|
|
if (Bar::sReleaseCalled != base + 20) {
|
|
|
|
fail("Release called multiple times for Clear");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Bar::sReleaseCalled = 0;
|
|
|
|
|
|
|
|
{
|
|
|
|
Array2 arr2;
|
|
|
|
|
|
|
|
for (PRInt32 i = 0; i < 20; ++i) {
|
2011-04-14 07:18:02 -07:00
|
|
|
nsCOMPtr<IBar> bar = new Bar(arr2);
|
2010-06-09 11:13:16 -07:00
|
|
|
arr2.AppendObject(bar);
|
|
|
|
}
|
|
|
|
|
|
|
|
base = Bar::sReleaseCalled;
|
|
|
|
|
|
|
|
// Let arr2 be destroyed
|
|
|
|
}
|
|
|
|
if (Bar::sReleaseCalled != base + 20) {
|
|
|
|
fail("Release called multiple times for nsCOMArray::~nsCOMArray");
|
|
|
|
}
|
|
|
|
|
2010-03-15 04:38:50 -07:00
|
|
|
return rv;
|
|
|
|
}
|