[apple/xnu.git] / libkern / c++ / OSOrderedSet.cpp

/*
 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
 *
 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. The rights granted to you under the License
 * may not be used to create, or enable the creation or redistribution of,
 * unlawful or unlicensed copies of an Apple operating system, or to
 * circumvent, violate, or enable the circumvention or violation of, any
 * terms of an Apple operating system software license agreement.
 * 
 * Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
 */

#include <libkern/c++/OSDictionary.h>
#include <libkern/c++/OSOrderedSet.h>
#include <libkern/c++/OSLib.h>

#define super OSCollection

OSDefineMetaClassAndStructors(OSOrderedSet, OSCollection)
OSMetaClassDefineReservedUnused(OSOrderedSet, 0);
OSMetaClassDefineReservedUnused(OSOrderedSet, 1);
OSMetaClassDefineReservedUnused(OSOrderedSet, 2);
OSMetaClassDefineReservedUnused(OSOrderedSet, 3);
OSMetaClassDefineReservedUnused(OSOrderedSet, 4);
OSMetaClassDefineReservedUnused(OSOrderedSet, 5);
OSMetaClassDefineReservedUnused(OSOrderedSet, 6);
OSMetaClassDefineReservedUnused(OSOrderedSet, 7);

#if OSALLOCDEBUG
extern "C" {
    extern int debug_container_malloc_size;
};
#define ACCUMSIZE(s) do { debug_container_malloc_size += (s); } while(0)
#else
#define ACCUMSIZE(s)
#endif

struct _Element {
    const OSMetaClassBase *		obj;
//    unsigned int	pri;
};

#define EXT_CAST(obj) \
    reinterpret_cast<OSObject *>(const_cast<OSMetaClassBase *>(obj))

bool OSOrderedSet::
initWithCapacity(unsigned int inCapacity,
                 OSOrderFunction inOrdering, void *inOrderingRef)
{
    int size;

    if (!super::init())
        return false;

    size = sizeof(_Element) * inCapacity;
    array = (_Element *) kalloc(size);
    if (!array)
        return false;

    count = 0;
    capacity = inCapacity;
    capacityIncrement = (inCapacity)? inCapacity : 16;
    ordering = inOrdering;
    orderingRef = inOrderingRef;

    bzero(array, size);
    ACCUMSIZE(size);

    return this;	
}

OSOrderedSet * OSOrderedSet::
withCapacity(unsigned int capacity,
             OSOrderFunction ordering, void * orderingRef)
{
    OSOrderedSet *me = new OSOrderedSet;

    if (me && !me->initWithCapacity(capacity, ordering, orderingRef)) {
        me->release();
	me = 0;
    }

    return me;
}

void OSOrderedSet::free()
{
    (void) super::setOptions(0, kImmutable);
    flushCollection();

    if (array) {
        kfree((vm_offset_t)array, sizeof(_Element) * capacity);
        ACCUMSIZE( -(sizeof(_Element) * capacity) );
    }

    super::free();
}

unsigned int OSOrderedSet::getCount() const { return count; }
unsigned int OSOrderedSet::getCapacity() const { return capacity; }
unsigned int OSOrderedSet::getCapacityIncrement() const
	{ return capacityIncrement; }
unsigned int OSOrderedSet::setCapacityIncrement(unsigned int increment)
{
    capacityIncrement = (increment)? increment : 16;
    return capacityIncrement;
}

unsigned int OSOrderedSet::ensureCapacity(unsigned int newCapacity)
{
    _Element *newArray;
    int oldSize, newSize;

    if (newCapacity <= capacity)
        return capacity;

    // round up
    newCapacity = (((newCapacity - 1) / capacityIncrement) + 1)
                * capacityIncrement;
    newSize = sizeof(_Element) * newCapacity;

    newArray = (_Element *) kalloc(newSize);
    if (newArray) {
        oldSize = sizeof(_Element) * capacity;

        ACCUMSIZE(newSize - oldSize);

        bcopy(array, newArray, oldSize);
        bzero(&newArray[capacity], newSize - oldSize);
        kfree((vm_offset_t)array, oldSize);
        array = newArray;
        capacity = newCapacity;
    }

    return capacity;
}

void OSOrderedSet::flushCollection()
{
    unsigned int i;

    haveUpdated();

    for (i = 0; i < count; i++)
        array[i].obj->taggedRelease(OSTypeID(OSCollection));

    count = 0;
}

/* internal */
bool OSOrderedSet::setObject(unsigned int index, const OSMetaClassBase *anObject)
{
    unsigned int i;
    unsigned int newCount = count + 1;

    if ((index > count) || !anObject)
        return false;

    if (containsObject(anObject))
        return false;

    // do we need more space?
    if (newCount > capacity && newCount > ensureCapacity(newCount))
        return false;

    haveUpdated();
    if (index != count) {
        for (i = count; i > index; i--)
            array[i] = array[i-1];
    }
    array[index].obj = anObject;
//    array[index].pri = pri;
    anObject->taggedRetain(OSTypeID(OSCollection));
    count++;

    return true;
}


bool OSOrderedSet::setFirstObject(const OSMetaClassBase *anObject)
{
    return( setObject(0, anObject));
}

bool OSOrderedSet::setLastObject(const OSMetaClassBase *anObject)
{
    return( setObject( count, anObject));
}


#define ORDER(obj1,obj2) \
    (ordering ? ((*ordering)( (OSObject *) obj1, (OSObject *) obj2, orderingRef)) : 0)

bool OSOrderedSet::setObject(const OSMetaClassBase *anObject )
{
    unsigned int i;

    // queue it behind those with same priority
    for( i = 0;
	(i < count) && (ORDER(array[i].obj, anObject) >= 0);
	i++ ) {}

    return( setObject(i, anObject));
}

void OSOrderedSet::removeObject(const OSMetaClassBase *anObject)
{
    bool		deleted = false;
    unsigned int 	i;

    for (i = 0; i < count; i++) {

        if( deleted)
            array[i-1] = array[i];
        else if( (array[i].obj == anObject)) {
            deleted = true;
	    haveUpdated();	// Pity we can't flush the log
            array[i].obj->taggedRelease(OSTypeID(OSCollection));
        }
    }

    if (deleted)
	count--;
}

bool OSOrderedSet::containsObject(const OSMetaClassBase *anObject) const
{
    return anObject && member(anObject);
}

bool OSOrderedSet::member(const OSMetaClassBase *anObject) const
{
    unsigned int i;

    for( i = 0;
	(i < count) && (array[i].obj != anObject);
	i++ ) {}

    return( i < count);
}

/* internal */
OSObject *OSOrderedSet::getObject( unsigned int index ) const
{
    if (index >= count)
        return 0;

//    if( pri)
//	*pri = array[index].pri;

    return( (OSObject *) array[index].obj );
}

OSObject *OSOrderedSet::getFirstObject() const
{
    if( count)
        return( (OSObject *) array[0].obj );
    else
	return( 0 );
}

OSObject *OSOrderedSet::getLastObject() const
{
    if( count)
        return( (OSObject *) array[count-1].obj );
    else
	return( 0 );
}

SInt32 OSOrderedSet::orderObject( const OSMetaClassBase * anObject )
{
    return( ORDER( anObject, 0 ));
}

void *OSOrderedSet::getOrderingRef()
{
    return orderingRef;
}

bool OSOrderedSet::isEqualTo(const OSOrderedSet *anOrderedSet) const
{
    unsigned int i;
    
    if ( this == anOrderedSet )
        return true;

    if ( count != anOrderedSet->getCount() )
        return false;

    for ( i = 0; i < count; i++ ) {
        if ( !array[i].obj->isEqualTo(anOrderedSet->getObject(i)) )
            return false;
    }

    return true;
}

bool OSOrderedSet::isEqualTo(const OSMetaClassBase *anObject) const
{
    OSOrderedSet *oSet;

    oSet = OSDynamicCast(OSOrderedSet, anObject);
    if ( oSet )
        return isEqualTo(oSet);
    else
        return false;
}

unsigned int OSOrderedSet::iteratorSize() const
{
    return( sizeof(unsigned int));
}

bool OSOrderedSet::initIterator(void *inIterator) const
{
    unsigned int *iteratorP = (unsigned int *) inIterator;

    *iteratorP = 0;
    return true;
}

bool OSOrderedSet::
getNextObjectForIterator(void *inIterator, OSObject **ret) const
{
    unsigned int *iteratorP = (unsigned int *) inIterator;
    unsigned int index = (*iteratorP)++;

    if (index < count)
        *ret = (OSObject *) array[index].obj;
    else
        *ret = 0;

    return (*ret != 0);
}


unsigned OSOrderedSet::setOptions(unsigned options, unsigned mask, void *)
{
    unsigned old = super::setOptions(options, mask);
    if ((old ^ options) & mask) {

	// Value changed need to recurse over all of the child collections
	for ( unsigned i = 0; i < count; i++ ) {
	    OSCollection *coll = OSDynamicCast(OSCollection, array[i].obj);
	    if (coll)
		coll->setOptions(options, mask);
	}
    }

    return old;
}

OSCollection * OSOrderedSet::copyCollection(OSDictionary *cycleDict)
{
    bool allocDict = !cycleDict;
    OSCollection *ret = 0;
    OSOrderedSet *newSet = 0;

    if (allocDict) {
	cycleDict = OSDictionary::withCapacity(16);
	if (!cycleDict)
	    return 0;
    }

    do {
	// Check for a cycle
	ret = super::copyCollection(cycleDict);
	if (ret)
	    continue;
	
	// Duplicate the set with no contents
	newSet = OSOrderedSet::withCapacity(capacity, ordering, orderingRef);
	if (!newSet)
	    continue;

	// Insert object into cycle Dictionary
	cycleDict->setObject((const OSSymbol *) this, newSet);

	newSet->capacityIncrement = capacityIncrement;

	// Now copy over the contents to the new duplicate
	for (unsigned int i = 0; i < count; i++) {
	    OSObject *obj = EXT_CAST(array[i].obj);
	    OSCollection *coll = OSDynamicCast(OSCollection, obj);
	    if (coll) {
		OSCollection *newColl = coll->copyCollection(cycleDict);
		if (newColl) {
		    obj = newColl;	// Rely on cycleDict ref for a bit
		    newColl->release();
		}
		else
		    goto abortCopy;
	    };
	    newSet->setLastObject(obj);
	};

	ret = newSet;
	newSet = 0;

    } while (false);

abortCopy:
    if (newSet)
	newSet->release();

    if (allocDict)
	cycleDict->release();

    return ret;
}
Commit	Line	Data
1c79356b A	1	/*
	2	* Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
	3	*
8f6c56a5	4	* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b	5	*
8f6c56a5 A	6	* This file contains Original Code and/or Modifications of Original Code
	7	* as defined in and that are subject to the Apple Public Source License
	8	* Version 2.0 (the 'License'). You may not use this file except in
	9	* compliance with the License. The rights granted to you under the License
	10	* may not be used to create, or enable the creation or redistribution of,
	11	* unlawful or unlicensed copies of an Apple operating system, or to
	12	* circumvent, violate, or enable the circumvention or violation of, any
	13	* terms of an Apple operating system software license agreement.
	14	*
	15	* Please obtain a copy of the License at
	16	* http://www.opensource.apple.com/apsl/ and read it before using this file.
	17	*
	18	* The Original Code and all software distributed under the License are
	19	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
	20	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
	21	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
	22	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	23	* Please see the License for the specific language governing rights and
8ad349bb	24	* limitations under the License.
8f6c56a5 A	25	*
8f6c56a5 A	26	* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b A	27	*/
1c79356b A	28
91447636	29	#include <libkern/c++/OSDictionary.h>
1c79356b A	30	#include <libkern/c++/OSOrderedSet.h>
	31	#include <libkern/c++/OSLib.h>
	32
	33	#define super OSCollection
	34
	35	OSDefineMetaClassAndStructors(OSOrderedSet, OSCollection)
	36	OSMetaClassDefineReservedUnused(OSOrderedSet, 0);
	37	OSMetaClassDefineReservedUnused(OSOrderedSet, 1);
	38	OSMetaClassDefineReservedUnused(OSOrderedSet, 2);
	39	OSMetaClassDefineReservedUnused(OSOrderedSet, 3);
	40	OSMetaClassDefineReservedUnused(OSOrderedSet, 4);
	41	OSMetaClassDefineReservedUnused(OSOrderedSet, 5);
	42	OSMetaClassDefineReservedUnused(OSOrderedSet, 6);
	43	OSMetaClassDefineReservedUnused(OSOrderedSet, 7);
	44
	45	#if OSALLOCDEBUG
	46	extern "C" {
	47	extern int debug_container_malloc_size;
	48	};
	49	#define ACCUMSIZE(s) do { debug_container_malloc_size += (s); } while(0)
	50	#else
	51	#define ACCUMSIZE(s)
	52	#endif
	53
	54	struct _Element {
	55	const OSMetaClassBase * obj;
	56	// unsigned int pri;
	57	};
	58
91447636 A	59	#define EXT_CAST(obj) \
91447636 A	60	reinterpret_cast<OSObject >(const_cast<OSMetaClassBase >(obj))
1c79356b A	61
	62	bool OSOrderedSet::
	63	initWithCapacity(unsigned int inCapacity,
	64	OSOrderFunction inOrdering, void *inOrderingRef)
	65	{
	66	int size;
	67
	68	if (!super::init())
	69	return false;
	70
	71	size = sizeof(_Element) * inCapacity;
	72	array = (_Element *) kalloc(size);
	73	if (!array)
	74	return false;
	75
	76	count = 0;
	77	capacity = inCapacity;
	78	capacityIncrement = (inCapacity)? inCapacity : 16;
	79	ordering = inOrdering;
	80	orderingRef = inOrderingRef;
	81
	82	bzero(array, size);
	83	ACCUMSIZE(size);
	84
	85	return this;
	86	}
	87
	88	OSOrderedSet * OSOrderedSet::
	89	withCapacity(unsigned int capacity,
	90	OSOrderFunction ordering, void * orderingRef)
	91	{
	92	OSOrderedSet *me = new OSOrderedSet;
	93
	94	if (me && !me->initWithCapacity(capacity, ordering, orderingRef)) {
55e303ae	95	me->release();
1c79356b A	96	me = 0;
	97	}
	98
	99	return me;
	100	}
	101
	102	void OSOrderedSet::free()
	103	{
91447636	104	(void) super::setOptions(0, kImmutable);
1c79356b A	105	flushCollection();
	106
	107	if (array) {
8f6c56a5	108	kfree((vm_offset_t)array, sizeof(_Element) * capacity);
1c79356b A	109	ACCUMSIZE( -(sizeof(_Element) * capacity) );
	110	}
	111
	112	super::free();
	113	}
	114
	115	unsigned int OSOrderedSet::getCount() const { return count; }
	116	unsigned int OSOrderedSet::getCapacity() const { return capacity; }
	117	unsigned int OSOrderedSet::getCapacityIncrement() const
	118	{ return capacityIncrement; }
	119	unsigned int OSOrderedSet::setCapacityIncrement(unsigned int increment)
	120	{
	121	capacityIncrement = (increment)? increment : 16;
	122	return capacityIncrement;
	123	}
	124
	125	unsigned int OSOrderedSet::ensureCapacity(unsigned int newCapacity)
	126	{
	127	_Element *newArray;
	128	int oldSize, newSize;
	129
	130	if (newCapacity <= capacity)
	131	return capacity;
	132
	133	// round up
	134	newCapacity = (((newCapacity - 1) / capacityIncrement) + 1)
	135	* capacityIncrement;
	136	newSize = sizeof(_Element) * newCapacity;
	137
	138	newArray = (_Element *) kalloc(newSize);
	139	if (newArray) {
	140	oldSize = sizeof(_Element) * capacity;
	141
	142	ACCUMSIZE(newSize - oldSize);
	143
	144	bcopy(array, newArray, oldSize);
	145	bzero(&newArray[capacity], newSize - oldSize);
8f6c56a5	146	kfree((vm_offset_t)array, oldSize);
1c79356b A	147	array = newArray;
	148	capacity = newCapacity;
	149	}
	150
	151	return capacity;
	152	}
	153
	154	void OSOrderedSet::flushCollection()
	155	{
	156	unsigned int i;
	157
	158	haveUpdated();
	159
	160	for (i = 0; i < count; i++)
9bccf70c	161	array[i].obj->taggedRelease(OSTypeID(OSCollection));
1c79356b A	162
	163	count = 0;
	164	}
	165
	166	/* internal */
	167	bool OSOrderedSet::setObject(unsigned int index, const OSMetaClassBase *anObject)
	168	{
	169	unsigned int i;
	170	unsigned int newCount = count + 1;
	171
	172	if ((index > count) \|\| !anObject)
	173	return false;
	174
	175	if (containsObject(anObject))
	176	return false;
	177
	178	// do we need more space?
	179	if (newCount > capacity && newCount > ensureCapacity(newCount))
	180	return false;
	181
	182	haveUpdated();
	183	if (index != count) {
	184	for (i = count; i > index; i--)
	185	array[i] = array[i-1];
	186	}
	187	array[index].obj = anObject;
	188	// array[index].pri = pri;
9bccf70c	189	anObject->taggedRetain(OSTypeID(OSCollection));
1c79356b A	190	count++;
	191
	192	return true;
	193	}
	194
	195
	196	bool OSOrderedSet::setFirstObject(const OSMetaClassBase *anObject)
	197	{
	198	return( setObject(0, anObject));
	199	}
	200
	201	bool OSOrderedSet::setLastObject(const OSMetaClassBase *anObject)
	202	{
	203	return( setObject( count, anObject));
	204	}
	205
	206
	207	#define ORDER(obj1,obj2) \
	208	(ordering ? ((ordering)( (OSObject ) obj1, (OSObject *) obj2, orderingRef)) : 0)
	209
	210	bool OSOrderedSet::setObject(const OSMetaClassBase *anObject )
	211	{
	212	unsigned int i;
	213
	214	// queue it behind those with same priority
	215	for( i = 0;
	216	(i < count) && (ORDER(array[i].obj, anObject) >= 0);
	217	i++ ) {}
	218
	219	return( setObject(i, anObject));
	220	}
	221
	222	void OSOrderedSet::removeObject(const OSMetaClassBase *anObject)
	223	{
	224	bool deleted = false;
	225	unsigned int i;
	226
	227	for (i = 0; i < count; i++) {
	228
	229	if( deleted)
	230	array[i-1] = array[i];
	231	else if( (array[i].obj == anObject)) {
1c79356b	232	deleted = true;
91447636 A	233	haveUpdated(); // Pity we can't flush the log
91447636 A	234	array[i].obj->taggedRelease(OSTypeID(OSCollection));
1c79356b A	235	}
	236	}
	237
91447636 A	238	if (deleted)
91447636 A	239	count--;
1c79356b A	240	}
	241
	242	bool OSOrderedSet::containsObject(const OSMetaClassBase *anObject) const
	243	{
	244	return anObject && member(anObject);
	245	}
	246
	247	bool OSOrderedSet::member(const OSMetaClassBase *anObject) const
	248	{
	249	unsigned int i;
	250
	251	for( i = 0;
	252	(i < count) && (array[i].obj != anObject);
	253	i++ ) {}
	254
	255	return( i < count);
	256	}
	257
	258	/* internal */
	259	OSObject *OSOrderedSet::getObject( unsigned int index ) const
	260	{
	261	if (index >= count)
	262	return 0;
	263
	264	// if( pri)
	265	// *pri = array[index].pri;
	266
	267	return( (OSObject *) array[index].obj );
	268	}
	269
	270	OSObject *OSOrderedSet::getFirstObject() const
	271	{
	272	if( count)
	273	return( (OSObject *) array[0].obj );
	274	else
	275	return( 0 );
	276	}
	277
	278	OSObject *OSOrderedSet::getLastObject() const
	279	{
	280	if( count)
	281	return( (OSObject *) array[count-1].obj );
	282	else
	283	return( 0 );
	284	}
	285
	286	SInt32 OSOrderedSet::orderObject( const OSMetaClassBase * anObject )
	287	{
	288	return( ORDER( anObject, 0 ));
	289	}
	290
	291	void *OSOrderedSet::getOrderingRef()
	292	{
	293	return orderingRef;
	294	}
	295
	296	bool OSOrderedSet::isEqualTo(const OSOrderedSet *anOrderedSet) const
	297	{
	298	unsigned int i;
	299
	300	if ( this == anOrderedSet )
	301	return true;
	302
	303	if ( count != anOrderedSet->getCount() )
304	return false;
305
306	for ( i = 0; i < count; i++ ) {
307	if ( !array[i].obj->isEqualTo(anOrderedSet->getObject(i)) )
308	return false;
309	}
310
311	return true;
312	}
313
314	bool OSOrderedSet::isEqualTo(const OSMetaClassBase *anObject) const
315	{
316	OSOrderedSet *oSet;
317
318	oSet = OSDynamicCast(OSOrderedSet, anObject);
319	if ( oSet )
320	return isEqualTo(oSet);
321	else
322	return false;
323	}
324
325	unsigned int OSOrderedSet::iteratorSize() const
326	{
327	return( sizeof(unsigned int));
328	}
329
330	bool OSOrderedSet::initIterator(void *inIterator) const
331	{
332	unsigned int iteratorP = (unsigned int ) inIterator;
333
334	*iteratorP = 0;
335	return true;
336	}
337
338	bool OSOrderedSet::
339	getNextObjectForIterator(void inIterator, OSObject *ret) const
340	{
341	unsigned int iteratorP = (unsigned int ) inIterator;
342	unsigned int index = (*iteratorP)++;
343
344	if (index < count)
345	ret = (OSObject ) array[index].obj;
346	else
347	*ret = 0;
348
349	return (*ret != 0);
350	}
351
91447636 A	352
	353	unsigned OSOrderedSet::setOptions(unsigned options, unsigned mask, void *)
	354	{
	355	unsigned old = super::setOptions(options, mask);
	356	if ((old ^ options) & mask) {
	357
	358	// Value changed need to recurse over all of the child collections
	359	for ( unsigned i = 0; i < count; i++ ) {
	360	OSCollection *coll = OSDynamicCast(OSCollection, array[i].obj);
	361	if (coll)
	362	coll->setOptions(options, mask);
	363	}
	364	}
	365
	366	return old;
	367	}
	368
	369	OSCollection * OSOrderedSet::copyCollection(OSDictionary *cycleDict)
	370	{
	371	bool allocDict = !cycleDict;
	372	OSCollection *ret = 0;
	373	OSOrderedSet *newSet = 0;
	374
	375	if (allocDict) {
	376	cycleDict = OSDictionary::withCapacity(16);
	377	if (!cycleDict)
	378	return 0;
	379	}
	380
	381	do {
	382	// Check for a cycle
	383	ret = super::copyCollection(cycleDict);
	384	if (ret)
	385	continue;
	386
	387	// Duplicate the set with no contents
	388	newSet = OSOrderedSet::withCapacity(capacity, ordering, orderingRef);
	389	if (!newSet)
	390	continue;
	391
	392	// Insert object into cycle Dictionary
	393	cycleDict->setObject((const OSSymbol *) this, newSet);
	394
	395	newSet->capacityIncrement = capacityIncrement;
	396
	397	// Now copy over the contents to the new duplicate
	398	for (unsigned int i = 0; i < count; i++) {
	399	OSObject *obj = EXT_CAST(array[i].obj);
	400	OSCollection *coll = OSDynamicCast(OSCollection, obj);
	401	if (coll) {
	402	OSCollection *newColl = coll->copyCollection(cycleDict);
	403	if (newColl) {
	404	obj = newColl; // Rely on cycleDict ref for a bit
	405	newColl->release();
	406	}
	407	else
	408	goto abortCopy;
	409	};
	410	newSet->setLastObject(obj);
	411	};
	412
	413	ret = newSet;
	414	newSet = 0;
	415
416	} while (false);
417
418	abortCopy:
419	if (newSet)
420	newSet->release();
421
422	if (allocDict)
423	cycleDict->release();
424
425	return ret;
426	}