Loading...
--- xnu/xnu-3248.50.21/libkern/c++/OSOrderedSet.cpp
+++ xnu/xnu-344.32/libkern/c++/OSOrderedSet.cpp
@@ -1,32 +1,25 @@
/*
* Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
*
- * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
+ * @APPLE_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.
+ * The contents of this file constitute Original Code as defined in and
+ * are subject to the Apple Public Source License Version 1.1 (the
+ * "License"). You may not use this file except in compliance with the
+ * License. Please obtain a copy of the License at
+ * http://www.apple.com/publicsource and read it before using this file.
*
- * 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
+ * This 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.
+ * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
+ * License for the specific language governing rights and limitations
+ * under the License.
*
- * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
+ * @APPLE_LICENSE_HEADER_END@
*/
-#include <libkern/c++/OSDictionary.h>
#include <libkern/c++/OSOrderedSet.h>
#include <libkern/c++/OSLib.h>
@@ -42,29 +35,32 @@
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)
{
- unsigned int size;
+ int size;
if (!super::init())
return false;
- if (inCapacity > (UINT_MAX / sizeof(_Element)))
- return false;
-
size = sizeof(_Element) * inCapacity;
- array = (_Element *) kalloc_container(size);
+ array = (_Element *) kalloc(size);
if (!array)
return false;
@@ -75,9 +71,9 @@
orderingRef = inOrderingRef;
bzero(array, size);
- OSCONTAINER_ACCUMSIZE(size);
-
- return true;
+ ACCUMSIZE(size);
+
+ return this;
}
OSOrderedSet * OSOrderedSet::
@@ -87,7 +83,7 @@
OSOrderedSet *me = new OSOrderedSet;
if (me && !me->initWithCapacity(capacity, ordering, orderingRef)) {
- me->release();
+ me->free();
me = 0;
}
@@ -96,12 +92,11 @@
void OSOrderedSet::free()
{
- (void) super::setOptions(0, kImmutable);
flushCollection();
if (array) {
- kfree(array, sizeof(_Element) * capacity);
- OSCONTAINER_ACCUMSIZE( -(sizeof(_Element) * capacity) );
+ kfree((vm_offset_t)array, sizeof(_Element) * capacity);
+ ACCUMSIZE( -(sizeof(_Element) * capacity) );
}
super::free();
@@ -120,31 +115,27 @@
unsigned int OSOrderedSet::ensureCapacity(unsigned int newCapacity)
{
_Element *newArray;
- unsigned int finalCapacity, oldSize, newSize;
+ int oldSize, newSize;
if (newCapacity <= capacity)
return capacity;
// round up
- finalCapacity = (((newCapacity - 1) / capacityIncrement) + 1)
+ newCapacity = (((newCapacity - 1) / capacityIncrement) + 1)
* capacityIncrement;
- if ((finalCapacity < newCapacity) ||
- (finalCapacity > (UINT_MAX / sizeof(_Element)))) {
- return capacity;
- }
- newSize = sizeof(_Element) * finalCapacity;
-
- newArray = (_Element *) kalloc_container(newSize);
+ newSize = sizeof(_Element) * newCapacity;
+
+ newArray = (_Element *) kalloc(newSize);
if (newArray) {
oldSize = sizeof(_Element) * capacity;
- OSCONTAINER_ACCUMSIZE(((size_t)newSize) - ((size_t)oldSize));
+ ACCUMSIZE(newSize - oldSize);
bcopy(array, newArray, oldSize);
bzero(&newArray[capacity], newSize - oldSize);
- kfree(array, oldSize);
+ kfree((vm_offset_t)array, oldSize);
array = newArray;
- capacity = finalCapacity;
+ capacity = newCapacity;
}
return capacity;
@@ -204,7 +195,7 @@
#define ORDER(obj1,obj2) \
- (ordering ? ((*ordering)( (const OSObject *) obj1, (const OSObject *) obj2, orderingRef)) : 0)
+ (ordering ? ((*ordering)( (OSObject *) obj1, (OSObject *) obj2, orderingRef)) : 0)
bool OSOrderedSet::setObject(const OSMetaClassBase *anObject )
{
@@ -225,17 +216,18 @@
for (i = 0; i < count; i++) {
- if (deleted)
+ if( deleted)
array[i-1] = array[i];
- else if (array[i].obj == anObject) {
+ else if( (array[i].obj == anObject)) {
+ array[i].obj->taggedRelease(OSTypeID(OSCollection));
deleted = true;
- haveUpdated(); // Pity we can't flush the log
- array[i].obj->taggedRelease(OSTypeID(OSCollection));
}
}
- if (deleted)
- count--;
+ if( deleted) {
+ count--;
+ haveUpdated();
+ }
}
bool OSOrderedSet::containsObject(const OSMetaClassBase *anObject) const
@@ -263,13 +255,13 @@
// if( pri)
// *pri = array[index].pri;
- return( const_cast<OSObject *>((const OSObject *) array[index].obj) );
+ return( (OSObject *) array[index].obj );
}
OSObject *OSOrderedSet::getFirstObject() const
{
if( count)
- return( const_cast<OSObject *>((const OSObject *) array[0].obj) );
+ return( (OSObject *) array[0].obj );
else
return( 0 );
}
@@ -277,7 +269,7 @@
OSObject *OSOrderedSet::getLastObject() const
{
if( count)
- return( const_cast<OSObject *>((const OSObject *) array[count-1].obj) );
+ return( (OSObject *) array[count-1].obj );
else
return( 0 );
}
@@ -341,85 +333,10 @@
unsigned int index = (*iteratorP)++;
if (index < count)
- *ret = const_cast<OSObject *>((const OSObject *) array[index].obj);
+ *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;
-}