2 * PROJECT: ReactOS Kernel
3 * LICENSE: BSD - See COPYING.ARM in the top level directory
4 * FILE: ntoskrnl/mm/ARM3/pool.c
5 * PURPOSE: ARM Memory Manager Pool Allocator
6 * PROGRAMMERS: ReactOS Portable Systems Group
9 /* INCLUDES *******************************************************************/
15 #line 15 "ARMĀ³::POOL"
16 #define MODULE_INVOLVED_IN_ARM3
17 #include "../ARM3/miarm.h"
19 /* GLOBALS ********************************************************************/
21 LIST_ENTRY MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
];
22 PFN_NUMBER MmNumberOfFreeNonPagedPool
, MiExpansionPoolPagesInitialCharge
;
23 PVOID MmNonPagedPoolEnd0
;
24 PFN_NUMBER MiStartOfInitialPoolFrame
, MiEndOfInitialPoolFrame
;
25 KGUARDED_MUTEX MmPagedPoolMutex
;
26 MM_PAGED_POOL_INFO MmPagedPoolInfo
;
27 SIZE_T MmAllocatedNonPagedPool
;
28 ULONG MmSpecialPoolTag
;
29 ULONG MmConsumedPoolPercentage
;
30 BOOLEAN MmProtectFreedNonPagedPool
;
32 /* PRIVATE FUNCTIONS **********************************************************/
36 MiInitializeNonPagedPoolThresholds(VOID
)
38 PFN_NUMBER Size
= MmMaximumNonPagedPoolInPages
;
40 /* Default low threshold of 8MB or one third of nonpaged pool */
41 MiLowNonPagedPoolThreshold
= (8 * _1MB
) >> PAGE_SHIFT
;
42 MiLowNonPagedPoolThreshold
= min(MiLowNonPagedPoolThreshold
, Size
/ 3);
44 /* Default high threshold of 20MB or 50% */
45 MiHighNonPagedPoolThreshold
= (20 * _1MB
) >> PAGE_SHIFT
;
46 MiHighNonPagedPoolThreshold
= min(MiHighNonPagedPoolThreshold
, Size
/ 2);
47 ASSERT(MiLowNonPagedPoolThreshold
< MiHighNonPagedPoolThreshold
);
52 MiInitializePoolEvents(VOID
)
55 PFN_NUMBER FreePoolInPages
;
58 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
60 /* Total size of the paged pool minus the allocated size, is free */
61 FreePoolInPages
= MmSizeOfPagedPoolInPages
- MmPagedPoolInfo
.AllocatedPagedPool
;
63 /* Check the initial state high state */
64 if (FreePoolInPages
>= MiHighPagedPoolThreshold
)
66 /* We have plenty of pool */
67 KeSetEvent(MiHighPagedPoolEvent
, 0, FALSE
);
72 KeClearEvent(MiHighPagedPoolEvent
);
75 /* Check the initial low state */
76 if (FreePoolInPages
<= MiLowPagedPoolThreshold
)
78 /* We're very low in free pool memory */
79 KeSetEvent(MiLowPagedPoolEvent
, 0, FALSE
);
84 KeClearEvent(MiLowPagedPoolEvent
);
87 /* Release the paged pool lock */
88 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
90 /* Now it's time for the nonpaged pool lock */
91 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
93 /* Free pages are the maximum minus what's been allocated */
94 FreePoolInPages
= MmMaximumNonPagedPoolInPages
- MmAllocatedNonPagedPool
;
96 /* Check if we have plenty */
97 if (FreePoolInPages
>= MiHighNonPagedPoolThreshold
)
99 /* We do, set the event */
100 KeSetEvent(MiHighNonPagedPoolEvent
, 0, FALSE
);
104 /* We don't, clear the event */
105 KeClearEvent(MiHighNonPagedPoolEvent
);
108 /* Check if we have very little */
109 if (FreePoolInPages
<= MiLowNonPagedPoolThreshold
)
111 /* We do, set the event */
112 KeSetEvent(MiLowNonPagedPoolEvent
, 0, FALSE
);
116 /* We don't, clear it */
117 KeClearEvent(MiLowNonPagedPoolEvent
);
120 /* We're done, release the nonpaged pool lock */
121 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
126 MiInitializeNonPagedPool(VOID
)
129 PFN_NUMBER PoolPages
;
130 PMMFREE_POOL_ENTRY FreeEntry
, FirstEntry
;
135 // We keep 4 lists of free pages (4 lists help avoid contention)
137 for (i
= 0; i
< MI_MAX_FREE_PAGE_LISTS
; i
++)
140 // Initialize each of them
142 InitializeListHead(&MmNonPagedPoolFreeListHead
[i
]);
146 // Calculate how many pages the initial nonpaged pool has
148 PoolPages
= BYTES_TO_PAGES(MmSizeOfNonPagedPoolInBytes
);
149 MmNumberOfFreeNonPagedPool
= PoolPages
;
152 // Initialize the first free entry
154 FreeEntry
= MmNonPagedPoolStart
;
155 FirstEntry
= FreeEntry
;
156 FreeEntry
->Size
= PoolPages
;
157 FreeEntry
->Owner
= FirstEntry
;
160 // Insert it into the last list
162 InsertHeadList(&MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
- 1],
166 // Now create free entries for every single other page
168 while (PoolPages
-- > 1)
171 // Link them all back to the original entry
173 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)FreeEntry
+ PAGE_SIZE
);
174 FreeEntry
->Owner
= FirstEntry
;
178 // Validate and remember first allocated pool page
180 PointerPte
= MiAddressToPte(MmNonPagedPoolStart
);
181 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
182 MiStartOfInitialPoolFrame
= PFN_FROM_PTE(PointerPte
);
185 // Keep track of where initial nonpaged pool ends
187 MmNonPagedPoolEnd0
= (PVOID
)((ULONG_PTR
)MmNonPagedPoolStart
+
188 MmSizeOfNonPagedPoolInBytes
);
191 // Validate and remember last allocated pool page
193 PointerPte
= MiAddressToPte((PVOID
)((ULONG_PTR
)MmNonPagedPoolEnd0
- 1));
194 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
195 MiEndOfInitialPoolFrame
= PFN_FROM_PTE(PointerPte
);
198 // Validate the first nonpaged pool expansion page (which is a guard page)
200 PointerPte
= MiAddressToPte(MmNonPagedPoolExpansionStart
);
201 ASSERT(PointerPte
->u
.Hard
.Valid
== 0);
204 // Calculate the size of the expansion region alone
206 MiExpansionPoolPagesInitialCharge
=
207 BYTES_TO_PAGES(MmMaximumNonPagedPoolInBytes
- MmSizeOfNonPagedPoolInBytes
);
210 // Remove 2 pages, since there's a guard page on top and on the bottom
212 MiExpansionPoolPagesInitialCharge
-= 2;
215 // Now initialize the nonpaged pool expansion PTE space. Remember there's a
216 // guard page on top so make sure to skip it. The bottom guard page will be
217 // guaranteed by the fact our size is off by one.
219 MiInitializeSystemPtes(PointerPte
+ 1,
220 MiExpansionPoolPagesInitialCharge
,
221 NonPagedPoolExpansion
);
226 MiAllocatePoolPages(IN POOL_TYPE PoolType
,
227 IN SIZE_T SizeInBytes
)
229 PFN_NUMBER SizeInPages
, PageFrameNumber
;
232 PLIST_ENTRY NextEntry
, NextHead
, LastHead
;
233 PMMPTE PointerPte
, StartPte
;
236 PVOID BaseVa
, BaseVaStart
;
237 PMMFREE_POOL_ENTRY FreeEntry
;
238 PKSPIN_LOCK_QUEUE LockQueue
;
241 // Figure out how big the allocation is in pages
243 SizeInPages
= BYTES_TO_PAGES(SizeInBytes
);
248 if (PoolType
== PagedPool
)
251 // Lock the paged pool mutex
253 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
256 // Find some empty allocation space
258 i
= RtlFindClearBitsAndSet(MmPagedPoolInfo
.PagedPoolAllocationMap
,
260 MmPagedPoolInfo
.PagedPoolHint
);
264 // Get the page bit count
266 i
= ((SizeInPages
- 1) / 1024) + 1;
269 // Check if there is enougn paged pool expansion space left
271 if (MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
>
272 MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
))
277 DPRINT1("OUT OF PAGED POOL!!!\n");
278 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
283 // Check if we'll have to expand past the last PTE we have available
285 if (((i
- 1) + MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
) >
286 MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
))
289 // We can only support this much then
291 SizeInPages
= MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
) -
292 MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
+
294 ASSERT(SizeInPages
< i
);
300 // Otherwise, there is plenty of space left for this expansion
306 // Get the template PTE we'll use to expand
308 TempPte
= ValidKernelPte
;
311 // Get the first PTE in expansion space
313 PointerPte
= MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
;
314 BaseVa
= MiPteToAddress(PointerPte
);
315 BaseVaStart
= BaseVa
;
318 // Lock the PFN database and loop pages
320 OldIrql
= KeAcquireQueuedSpinLock(LockQueuePfnLock
);
324 // It should not already be valid
326 ASSERT(PointerPte
->u
.Hard
.Valid
== 0);
329 // Request a paged pool page and write the PFN for it
331 PageFrameNumber
= MmAllocPage(MC_PPOOL
);
332 TempPte
.u
.Hard
.PageFrameNumber
= PageFrameNumber
;
335 // Save it into our double-buffered system page directory
337 MmSystemPagePtes
[(ULONG_PTR
)PointerPte
& (PAGE_SIZE
- 1) /
338 sizeof(MMPTE
)] = TempPte
;
341 // Write the actual PTE now
343 *PointerPte
++ = TempPte
;
346 // Move on to the next expansion address
348 BaseVa
= (PVOID
)((ULONG_PTR
)BaseVa
+ PAGE_SIZE
);
352 // Release the PFN database lock
354 KeReleaseQueuedSpinLock(LockQueuePfnLock
, OldIrql
);
357 // These pages are now available, clear their availablity bits
359 RtlClearBits(MmPagedPoolInfo
.PagedPoolAllocationMap
,
360 (MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
-
361 MiAddressToPte(MmPagedPoolInfo
.FirstPteForPagedPool
)) *
366 // Update the next expansion location
368 MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
+= SizeInPages
;
371 // Zero out the newly available memory
373 RtlZeroMemory(BaseVaStart
, SizeInPages
* PAGE_SIZE
);
376 // Now try consuming the pages again
378 SizeInPages
= BYTES_TO_PAGES(SizeInBytes
);
379 i
= RtlFindClearBitsAndSet(MmPagedPoolInfo
.PagedPoolAllocationMap
,
387 DPRINT1("OUT OF PAGED POOL!!!\n");
388 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
394 // Update the pool hint if the request was just one page
396 if (SizeInPages
== 1) MmPagedPoolInfo
.PagedPoolHint
= i
+ 1;
399 // Update the end bitmap so we know the bounds of this allocation when
400 // the time comes to free it
402 RtlSetBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, i
+ SizeInPages
- 1);
405 // Now we can release the lock (it mainly protects the bitmap)
407 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
410 // Now figure out where this allocation starts
412 BaseVa
= (PVOID
)((ULONG_PTR
)MmPagedPoolStart
+ (i
<< PAGE_SHIFT
));
417 KeFlushEntireTb(TRUE
, TRUE
);
420 // Setup a demand-zero writable PTE
423 MI_MAKE_WRITE_PAGE(&TempPte
);
426 // Find the first and last PTE, then loop them all
428 PointerPte
= MiAddressToPte(BaseVa
);
429 StartPte
= PointerPte
+ SizeInPages
;
433 // Write the demand zero PTE and keep going
435 *PointerPte
++ = TempPte
;
436 } while (PointerPte
< StartPte
);
439 // Return the allocation address to the caller
445 // Allocations of less than 4 pages go into their individual buckets
448 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
451 // Loop through all the free page lists based on the page index
453 NextHead
= &MmNonPagedPoolFreeListHead
[i
];
454 LastHead
= &MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
];
457 // Acquire the nonpaged pool lock
459 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
463 // Now loop through all the free page entries in this given list
465 NextEntry
= NextHead
->Flink
;
466 while (NextEntry
!= NextHead
)
469 // Grab the entry and see if it can handle our allocation
471 FreeEntry
= CONTAINING_RECORD(NextEntry
, MMFREE_POOL_ENTRY
, List
);
472 if (FreeEntry
->Size
>= SizeInPages
)
475 // It does, so consume the pages from here
477 FreeEntry
->Size
-= SizeInPages
;
480 // The allocation will begin in this free page area
482 BaseVa
= (PVOID
)((ULONG_PTR
)FreeEntry
+
483 (FreeEntry
->Size
<< PAGE_SHIFT
));
486 // This is not a free page segment anymore
488 RemoveEntryList(&FreeEntry
->List
);
491 // However, check if its' still got space left
493 if (FreeEntry
->Size
!= 0)
496 // Insert it back into a different list, based on its pages
498 i
= FreeEntry
->Size
- 1;
499 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
500 InsertTailList (&MmNonPagedPoolFreeListHead
[i
],
505 // Grab the PTE for this allocation
507 PointerPte
= MiAddressToPte(BaseVa
);
508 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
511 // Grab the PFN NextEntry and index
513 Pfn1
= MiGetPfnEntry(PFN_FROM_PTE(PointerPte
));
516 // Now mark it as the beginning of an allocation
518 ASSERT(Pfn1
->u3
.e1
.StartOfAllocation
== 0);
519 Pfn1
->u3
.e1
.StartOfAllocation
= 1;
522 // Check if the allocation is larger than one page
524 if (SizeInPages
!= 1)
527 // Navigate to the last PFN entry and PTE
529 PointerPte
+= SizeInPages
- 1;
530 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
531 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
535 // Mark this PFN as the last (might be the same as the first)
537 ASSERT(Pfn1
->u3
.e1
.EndOfAllocation
== 0);
538 Pfn1
->u3
.e1
.EndOfAllocation
= 1;
541 // Release the nonpaged pool lock, and return the allocation
543 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
548 // Try the next free page entry
550 NextEntry
= FreeEntry
->List
.Flink
;
552 } while (++NextHead
< LastHead
);
555 // If we got here, we're out of space.
556 // Start by releasing the lock
558 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
561 // Allocate some system PTEs
563 StartPte
= MiReserveSystemPtes(SizeInPages
, NonPagedPoolExpansion
);
564 PointerPte
= StartPte
;
565 if (StartPte
== NULL
)
570 DPRINT1("Out of NP Expansion Pool\n");
575 // Acquire the pool lock now
577 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
580 // Lock the PFN database too
582 LockQueue
= &KeGetCurrentPrcb()->LockQueue
[LockQueuePfnLock
];
583 KeAcquireQueuedSpinLockAtDpcLevel(LockQueue
);
588 TempPte
= ValidKernelPte
;
594 PageFrameNumber
= MmAllocPage(MC_NPPOOL
);
597 // Get the PFN entry for it
599 Pfn1
= MiGetPfnEntry(PageFrameNumber
);
602 // Write the PTE for it
604 TempPte
.u
.Hard
.PageFrameNumber
= PageFrameNumber
;
605 ASSERT(PointerPte
->u
.Hard
.Valid
== 0);
606 ASSERT(TempPte
.u
.Hard
.Valid
== 1);
607 *PointerPte
++ = TempPte
;
608 } while (--SizeInPages
> 0);
611 // This is the last page
613 Pfn1
->u3
.e1
.EndOfAllocation
= 1;
616 // Get the first page and mark it as such
618 Pfn1
= MiGetPfnEntry(StartPte
->u
.Hard
.PageFrameNumber
);
619 Pfn1
->u3
.e1
.StartOfAllocation
= 1;
622 // Release the PFN and nonpaged pool lock
624 KeReleaseQueuedSpinLockFromDpcLevel(LockQueue
);
625 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
628 // Return the address
630 return MiPteToAddress(StartPte
);
635 MiFreePoolPages(IN PVOID StartingVa
)
637 PMMPTE PointerPte
, StartPte
;
638 PMMPFN Pfn1
, StartPfn
;
639 PFN_NUMBER FreePages
, NumberOfPages
;
641 PMMFREE_POOL_ENTRY FreeEntry
, NextEntry
, LastEntry
;
647 if ((StartingVa
>= MmPagedPoolStart
) && (StartingVa
<= MmPagedPoolEnd
))
650 // Calculate the offset from the beginning of paged pool, and convert it
653 i
= ((ULONG_PTR
)StartingVa
- (ULONG_PTR
)MmPagedPoolStart
) >> PAGE_SHIFT
;
657 // Now use the end bitmap to scan until we find a set bit, meaning that
658 // this allocation finishes here
660 while (!RtlTestBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, End
)) End
++;
663 // Now calculate the total number of pages this allocation spans
665 NumberOfPages
= End
- i
+ 1;
668 // Acquire the paged pool lock
670 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
673 // Clear the allocation and free bits
675 RtlClearBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, i
);
676 RtlClearBits(MmPagedPoolInfo
.PagedPoolAllocationMap
, i
, NumberOfPages
);
679 // Update the hint if we need to
681 if (i
< MmPagedPoolInfo
.PagedPoolHint
) MmPagedPoolInfo
.PagedPoolHint
= i
;
684 // Release the lock protecting the bitmaps
686 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
689 // And finally return the number of pages freed
691 return NumberOfPages
;
695 // Get the first PTE and its corresponding PFN entry
697 StartPte
= PointerPte
= MiAddressToPte(StartingVa
);
698 StartPfn
= Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
701 // Loop until we find the last PTE
703 while (Pfn1
->u3
.e1
.EndOfAllocation
== 0)
709 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
713 // Now we know how many pages we have
715 NumberOfPages
= PointerPte
- StartPte
+ 1;
718 // Acquire the nonpaged pool lock
720 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
723 // Mark the first and last PTEs as not part of an allocation anymore
725 StartPfn
->u3
.e1
.StartOfAllocation
= 0;
726 Pfn1
->u3
.e1
.EndOfAllocation
= 0;
729 // Assume we will free as many pages as the allocation was
731 FreePages
= NumberOfPages
;
734 // Peek one page past the end of the allocation
739 // Guard against going past initial nonpaged pool
741 if (MiGetPfnEntryIndex(Pfn1
) == MiEndOfInitialPoolFrame
)
744 // This page is on the outskirts of initial nonpaged pool, so ignore it
751 // Otherwise, our entire allocation must've fit within the initial non
752 // paged pool, or the expansion nonpaged pool, so get the PFN entry of
753 // the next allocation
755 ASSERT((ULONG_PTR
)StartingVa
+ NumberOfPages
<= (ULONG_PTR
)MmNonPagedPoolEnd
);
756 if (PointerPte
->u
.Hard
.Valid
== 1)
759 // It's either expansion or initial: get the PFN entry
761 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
766 // This means we've reached the guard page that protects the end of
767 // the expansion nonpaged pool
775 // Check if this allocation actually exists
777 if ((Pfn1
) && (Pfn1
->u3
.e1
.StartOfAllocation
== 0))
780 // It doesn't, so we should actually locate a free entry descriptor
782 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)StartingVa
+
783 (NumberOfPages
<< PAGE_SHIFT
));
784 ASSERT(FreeEntry
->Owner
== FreeEntry
);
787 // Consume this entry's pages, and remove it from its free list
789 FreePages
+= FreeEntry
->Size
;
790 RemoveEntryList (&FreeEntry
->List
);
794 // Now get the official free entry we'll create for the caller's allocation
796 FreeEntry
= StartingVa
;
799 // Check if the our allocation is the very first page
801 if (MiGetPfnEntryIndex(StartPfn
) == MiStartOfInitialPoolFrame
)
804 // Then we can't do anything or we'll risk underflowing
811 // Otherwise, get the PTE for the page right before our allocation
813 PointerPte
-= NumberOfPages
+ 1;
814 if (PointerPte
->u
.Hard
.Valid
== 1)
817 // It's either expansion or initial nonpaged pool, get the PFN entry
819 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
824 // We must've reached the guard page, so don't risk touching it
831 // Check if there is a valid PFN entry for the page before the allocation
832 // and then check if this page was actually the end of an allocation.
833 // If it wasn't, then we know for sure it's a free page
835 if ((Pfn1
) && (Pfn1
->u3
.e1
.EndOfAllocation
== 0))
838 // Get the free entry descriptor for that given page range
840 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)StartingVa
- PAGE_SIZE
);
841 FreeEntry
= FreeEntry
->Owner
;
844 // Check if the entry is small enough to be indexed on a free list
845 // If it is, we'll want to re-insert it, since we're about to
846 // collapse our pages on top of it, which will change its count
848 if (FreeEntry
->Size
< (MI_MAX_FREE_PAGE_LISTS
- 1))
851 // Remove the list from where it is now
853 RemoveEntryList(&FreeEntry
->List
);
858 FreeEntry
->Size
+= FreePages
;
861 // And now find the new appropriate list to place it in
863 i
= (ULONG
)(FreeEntry
->Size
- 1);
864 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
869 InsertTailList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
);
874 // Otherwise, just combine our free pages into this entry
876 FreeEntry
->Size
+= FreePages
;
881 // Check if we were unable to do any compaction, and we'll stick with this
883 if (FreeEntry
== StartingVa
)
886 // Well, now we are a free entry. At worse we just have our newly freed
887 // pages, at best we have our pages plus whatever entry came after us
889 FreeEntry
->Size
= FreePages
;
892 // Find the appropriate list we should be on
894 i
= FreeEntry
->Size
- 1;
895 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
900 InsertTailList (&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
);
904 // Just a sanity check
906 ASSERT(FreePages
!= 0);
909 // Get all the pages between our allocation and its end. These will all now
910 // become free page chunks.
912 NextEntry
= StartingVa
;
913 LastEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)NextEntry
+ (FreePages
<< PAGE_SHIFT
));
917 // Link back to the parent free entry, and keep going
919 NextEntry
->Owner
= FreeEntry
;
920 NextEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)NextEntry
+ PAGE_SIZE
);
921 } while (NextEntry
!= LastEntry
);
924 // We're done, release the lock and let the caller know how much we freed
926 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
927 return NumberOfPages
;
933 MiRaisePoolQuota(IN POOL_TYPE PoolType
,
934 IN ULONG CurrentMaxQuota
,
935 OUT PULONG NewMaxQuota
)
941 *NewMaxQuota
= CurrentMaxQuota
+ 65536;
945 /* PUBLIC FUNCTIONS ***********************************************************/
952 MmAllocateMappingAddress(IN SIZE_T NumberOfBytes
,
964 MmFreeMappingAddress(IN PVOID BaseAddress
,