Changeset 4164 for trunk/src/win32k/misc/rmalloc_avl.c

Timestamp:

Sep 2, 2000, 11:08:23 PM (25 years ago)

Author:

bird

Message:

Merged in the Grace branch. New Win32k!

File:

• trunk/src/win32k/misc/rmalloc_avl.c (modified) (4 diffs)

trunk/src/win32k/misc/rmalloc_avl.c

@@ -1 @@
-/* $Id: rmalloc_avl.c,v 1.5 2000-01-24 18:19:00 bird Exp $
+/* $Id: rmalloc_avl.c,v 1.6 2000-09-02 21:08:14 bird Exp $
  *
  * Resident Heap - AVL.
@@ -47 +47 @@
 ******************************************************************************/
 #include <os2.h>
+#include "devSegDf.h"                   /* Win32k segment definitions. */
 #ifdef RING0
     #include "dev32hlp.h"
@@ -120 +121 @@
 static PHEAPANCHOR  phaFirst;           /* Pointer to the first anchor block.*/
 static PHEAPANCHOR  phaLast;            /* Pointer to the last anchor block.*/
-static unsigned     cbResHeapMax;       /* Maximum amount of memory used by the heap. */
+unsigned            cbResHeapMax;       /* Maximum amount of memory used by the heap. */
 
 #ifndef RING0
@@ -898 +899 @@
 
 /**
+ * Get amount of used memory (in bytes)
+ * @returns  Amount of used memory (in bytes).
+ */
+unsigned    _res_memused(void)
+{
+    PHEAPANCHOR pha = phaFirst;
+    unsigned    cb;
+
+    #ifdef ALLWAYS_HEAPCHECK
+    if (!_res_heap_check())
+        kprintf(("_res_memused: _res_heap_check failed!\n"));
+    #endif
+
+    for (cb = 0; pha != NULL; pha = pha->pNext)
+        cb += pha->cbUsed;
+
+    return cb;
+}
+
+
+/**
+ * Collects the heap state.
+ * @returns     0 on success.
+ *              -1 on error.
+ * @param       pState  Pointer to a RES_HEAPSTATE structure which is
+ *                      filled upon successful return.
+ */
+int         _res_state(PHEAPSTATE pState)
+{
+    PHEAPANCHOR pha;
+
+    #ifdef ALLWAYS_HEAPCHECK
+    if (!_res_heap_check())
+    {
+        kprintf(("_res_state: _res_heap_check failed!\n"));
+        return -1;
+    }
+    #endif
+
+    if (pState == NULL)
+        return -1;
+
+    /*
+     * Loop thru all the anchor blocks and all memory blocks
+     * building the stats.
+     */
+    memset(pState, 0, sizeof(HEAPSTATE));
+    for (pha = phaFirst; pha != NULL; pha = pha->pNext)
+    {
+        AVLENUMDATA     EnumData;
+        PAVLENUMDATA    pEnumData = SSToDS(&EnumData);
+        PMEMBLOCK       pmb;
+
+        /* count of free blocks */
+        pmb = (PMEMBLOCK)AVLBeginEnumTree((PPAVLNODECORE)&pha->pmbFree, pEnumData, TRUE);
+        while (pmb)
+        {
+            pState->cBlocksFree++;
+            pmb = (PMEMBLOCK)AVLGetNextNode(pEnumData);
+        }
+
+        /* count of used blocks */
+        pmb = (PMEMBLOCK)AVLBeginEnumTree((PPAVLNODECORE)&pha->pmbUsed, pEnumData, TRUE);
+        while (pmb)
+        {
+            pState->cBlocksUsed++;
+            pmb = (PMEMBLOCK)AVLGetNextNode(pEnumData);
+        }
+
+        /* sizes */
+        pState->cbHeapSize  += pha->cbSize;
+        pState->cbHeapFree  += pha->cbFree;
+        pState->cbHeapUsed  += pha->cbUsed;
+    }
+
+    return 0;
+}
+
+
+/**
  * Checks heap integrety.
  * @returns  TRUE  when ok.