Loading...
libkern/c++/OSOrderedSet.cpp xnu-3248.40.184 xnu-792
--- xnu/xnu-3248.40.184/libkern/c++/OSOrderedSet.cpp
+++ xnu/xnu-792/libkern/c++/OSOrderedSet.cpp
@@ -1,29 +1,23 @@
 /*
  * 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>
@@ -42,6 +36,14 @@
 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;
@@ -55,16 +57,13 @@
 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 +74,9 @@
     orderingRef = inOrderingRef;
 
     bzero(array, size);
-    OSCONTAINER_ACCUMSIZE(size);
-
-    return true;	
+    ACCUMSIZE(size);
+
+    return this;	
 }
 
 OSOrderedSet * OSOrderedSet::
@@ -100,8 +99,8 @@
     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 +119,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 +199,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,9 +220,9 @@
 
     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)) {
             deleted = true;
 	    haveUpdated();	// Pity we can't flush the log
             array[i].obj->taggedRelease(OSTypeID(OSCollection));
@@ -263,13 +258,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 +272,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,7 +336,7 @@
     unsigned int index = (*iteratorP)++;
 
     if (index < count)
-        *ret = const_cast<OSObject *>((const OSObject *) array[index].obj);
+        *ret = (OSObject *) array[index].obj;
     else
         *ret = 0;