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 #define MODULE_INVOLVED_IN_ARM3
16 #include "../ARM3/miarm.h"
18 /* GLOBALS ********************************************************************/
20 LIST_ENTRY MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
];
21 PFN_COUNT MmNumberOfFreeNonPagedPool
, MiExpansionPoolPagesInitialCharge
;
22 PVOID MmNonPagedPoolEnd0
;
23 PFN_NUMBER MiStartOfInitialPoolFrame
, MiEndOfInitialPoolFrame
;
24 KGUARDED_MUTEX MmPagedPoolMutex
;
25 MM_PAGED_POOL_INFO MmPagedPoolInfo
;
26 SIZE_T MmAllocatedNonPagedPool
;
27 ULONG MmSpecialPoolTag
;
28 ULONG MmConsumedPoolPercentage
;
29 BOOLEAN MmProtectFreedNonPagedPool
;
30 SLIST_HEADER MiNonPagedPoolSListHead
;
31 ULONG MiNonPagedPoolSListMaximum
= 4;
32 SLIST_HEADER MiPagedPoolSListHead
;
33 ULONG MiPagedPoolSListMaximum
= 8;
35 /* PRIVATE FUNCTIONS **********************************************************/
39 MiProtectFreeNonPagedPool(IN PVOID VirtualAddress
,
42 PMMPTE PointerPte
, LastPte
;
45 /* If pool is physical, can't protect PTEs */
46 if (MI_IS_PHYSICAL_ADDRESS(VirtualAddress
)) return;
48 /* Get PTE pointers and loop */
49 PointerPte
= MiAddressToPte(VirtualAddress
);
50 LastPte
= PointerPte
+ PageCount
;
53 /* Capture the PTE for safety */
54 TempPte
= *PointerPte
;
56 /* Mark it as an invalid PTE, set proto bit to recognize it as pool */
57 TempPte
.u
.Hard
.Valid
= 0;
58 TempPte
.u
.Soft
.Prototype
= 1;
59 MI_WRITE_INVALID_PTE(PointerPte
, TempPte
);
60 } while (++PointerPte
< LastPte
);
63 KeFlushEntireTb(TRUE
, TRUE
);
68 MiUnProtectFreeNonPagedPool(IN PVOID VirtualAddress
,
73 PFN_NUMBER UnprotectedPages
= 0;
75 /* If pool is physical, can't protect PTEs */
76 if (MI_IS_PHYSICAL_ADDRESS(VirtualAddress
)) return FALSE
;
78 /* Get, and capture the PTE */
79 PointerPte
= MiAddressToPte(VirtualAddress
);
80 TempPte
= *PointerPte
;
82 /* Loop protected PTEs */
83 while ((TempPte
.u
.Hard
.Valid
== 0) && (TempPte
.u
.Soft
.Prototype
== 1))
85 /* Unprotect the PTE */
86 TempPte
.u
.Hard
.Valid
= 1;
87 TempPte
.u
.Soft
.Prototype
= 0;
88 MI_WRITE_VALID_PTE(PointerPte
, TempPte
);
91 if (++UnprotectedPages
== PageCount
) break;
93 /* Capture next PTE */
94 TempPte
= *(++PointerPte
);
97 /* Return if any pages were unprotected */
98 return UnprotectedPages
? TRUE
: FALSE
;
103 MiProtectedPoolUnProtectLinks(IN PLIST_ENTRY Links
,
104 OUT PVOID
* PoolFlink
,
105 OUT PVOID
* PoolBlink
)
110 /* Initialize variables */
111 *PoolFlink
= *PoolBlink
= NULL
;
113 /* Check if the list has entries */
114 if (IsListEmpty(Links
) == FALSE
)
116 /* We are going to need to forward link to do an insert */
117 PoolVa
= Links
->Flink
;
119 /* So make it safe to access */
120 Safe
= MiUnProtectFreeNonPagedPool(PoolVa
, 1);
121 if (Safe
) *PoolFlink
= PoolVa
;
124 /* Are we going to need a backward link too? */
125 if (Links
!= Links
->Blink
)
127 /* Get the head's backward link for the insert */
128 PoolVa
= Links
->Blink
;
130 /* Make it safe to access */
131 Safe
= MiUnProtectFreeNonPagedPool(PoolVa
, 1);
132 if (Safe
) *PoolBlink
= PoolVa
;
138 MiProtectedPoolProtectLinks(IN PVOID PoolFlink
,
141 /* Reprotect the pages, if they got unprotected earlier */
142 if (PoolFlink
) MiProtectFreeNonPagedPool(PoolFlink
, 1);
143 if (PoolBlink
) MiProtectFreeNonPagedPool(PoolBlink
, 1);
148 MiProtectedPoolInsertList(IN PLIST_ENTRY ListHead
,
149 IN PLIST_ENTRY Entry
,
152 PVOID PoolFlink
, PoolBlink
;
154 /* Make the list accessible */
155 MiProtectedPoolUnProtectLinks(ListHead
, &PoolFlink
, &PoolBlink
);
157 /* Now insert in the right position */
158 Critical
? InsertHeadList(ListHead
, Entry
) : InsertTailList(ListHead
, Entry
);
160 /* And reprotect the pages containing the free links */
161 MiProtectedPoolProtectLinks(PoolFlink
, PoolBlink
);
166 MiProtectedPoolRemoveEntryList(IN PLIST_ENTRY Entry
)
168 PVOID PoolFlink
, PoolBlink
;
170 /* Make the list accessible */
171 MiProtectedPoolUnProtectLinks(Entry
, &PoolFlink
, &PoolBlink
);
174 RemoveEntryList(Entry
);
176 /* And reprotect the pages containing the free links */
177 if (PoolFlink
) MiProtectFreeNonPagedPool(PoolFlink
, 1);
178 if (PoolBlink
) MiProtectFreeNonPagedPool(PoolBlink
, 1);
184 MiInitializeNonPagedPoolThresholds(VOID
)
186 PFN_NUMBER Size
= MmMaximumNonPagedPoolInPages
;
188 /* Default low threshold of 8MB or one third of nonpaged pool */
189 MiLowNonPagedPoolThreshold
= (8 * _1MB
) >> PAGE_SHIFT
;
190 MiLowNonPagedPoolThreshold
= min(MiLowNonPagedPoolThreshold
, Size
/ 3);
192 /* Default high threshold of 20MB or 50% */
193 MiHighNonPagedPoolThreshold
= (20 * _1MB
) >> PAGE_SHIFT
;
194 MiHighNonPagedPoolThreshold
= min(MiHighNonPagedPoolThreshold
, Size
/ 2);
195 ASSERT(MiLowNonPagedPoolThreshold
< MiHighNonPagedPoolThreshold
);
201 MiInitializePoolEvents(VOID
)
204 PFN_NUMBER FreePoolInPages
;
206 /* Lock paged pool */
207 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
209 /* Total size of the paged pool minus the allocated size, is free */
210 FreePoolInPages
= MmSizeOfPagedPoolInPages
- MmPagedPoolInfo
.AllocatedPagedPool
;
212 /* Check the initial state high state */
213 if (FreePoolInPages
>= MiHighPagedPoolThreshold
)
215 /* We have plenty of pool */
216 KeSetEvent(MiHighPagedPoolEvent
, 0, FALSE
);
221 KeClearEvent(MiHighPagedPoolEvent
);
224 /* Check the initial low state */
225 if (FreePoolInPages
<= MiLowPagedPoolThreshold
)
227 /* We're very low in free pool memory */
228 KeSetEvent(MiLowPagedPoolEvent
, 0, FALSE
);
233 KeClearEvent(MiLowPagedPoolEvent
);
236 /* Release the paged pool lock */
237 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
239 /* Now it's time for the nonpaged pool lock */
240 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
242 /* Free pages are the maximum minus what's been allocated */
243 FreePoolInPages
= MmMaximumNonPagedPoolInPages
- MmAllocatedNonPagedPool
;
245 /* Check if we have plenty */
246 if (FreePoolInPages
>= MiHighNonPagedPoolThreshold
)
248 /* We do, set the event */
249 KeSetEvent(MiHighNonPagedPoolEvent
, 0, FALSE
);
253 /* We don't, clear the event */
254 KeClearEvent(MiHighNonPagedPoolEvent
);
257 /* Check if we have very little */
258 if (FreePoolInPages
<= MiLowNonPagedPoolThreshold
)
260 /* We do, set the event */
261 KeSetEvent(MiLowNonPagedPoolEvent
, 0, FALSE
);
265 /* We don't, clear it */
266 KeClearEvent(MiLowNonPagedPoolEvent
);
269 /* We're done, release the nonpaged pool lock */
270 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
276 MiInitializeNonPagedPool(VOID
)
280 PMMFREE_POOL_ENTRY FreeEntry
, FirstEntry
;
285 // Initialize the pool S-LISTs as well as their maximum count. In general,
286 // we'll allow 8 times the default on a 2GB system, and two times the default
289 InitializeSListHead(&MiPagedPoolSListHead
);
290 InitializeSListHead(&MiNonPagedPoolSListHead
);
291 if (MmNumberOfPhysicalPages
>= ((2 * _1GB
) /PAGE_SIZE
))
293 MiNonPagedPoolSListMaximum
*= 8;
294 MiPagedPoolSListMaximum
*= 8;
296 else if (MmNumberOfPhysicalPages
>= (_1GB
/PAGE_SIZE
))
298 MiNonPagedPoolSListMaximum
*= 2;
299 MiPagedPoolSListMaximum
*= 2;
303 // However if debugging options for the pool are enabled, turn off the S-LIST
304 // to reduce the risk of messing things up even more
306 if (MmProtectFreedNonPagedPool
)
308 MiNonPagedPoolSListMaximum
= 0;
309 MiPagedPoolSListMaximum
= 0;
313 // We keep 4 lists of free pages (4 lists help avoid contention)
315 for (i
= 0; i
< MI_MAX_FREE_PAGE_LISTS
; i
++)
318 // Initialize each of them
320 InitializeListHead(&MmNonPagedPoolFreeListHead
[i
]);
324 // Calculate how many pages the initial nonpaged pool has
326 PoolPages
= (PFN_COUNT
)BYTES_TO_PAGES(MmSizeOfNonPagedPoolInBytes
);
327 MmNumberOfFreeNonPagedPool
= PoolPages
;
330 // Initialize the first free entry
332 FreeEntry
= MmNonPagedPoolStart
;
333 FirstEntry
= FreeEntry
;
334 FreeEntry
->Size
= PoolPages
;
335 FreeEntry
->Signature
= MM_FREE_POOL_SIGNATURE
;
336 FreeEntry
->Owner
= FirstEntry
;
339 // Insert it into the last list
341 InsertHeadList(&MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
- 1],
345 // Now create free entries for every single other page
347 while (PoolPages
-- > 1)
350 // Link them all back to the original entry
352 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)FreeEntry
+ PAGE_SIZE
);
353 FreeEntry
->Owner
= FirstEntry
;
354 FreeEntry
->Signature
= MM_FREE_POOL_SIGNATURE
;
358 // Validate and remember first allocated pool page
360 PointerPte
= MiAddressToPte(MmNonPagedPoolStart
);
361 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
362 MiStartOfInitialPoolFrame
= PFN_FROM_PTE(PointerPte
);
365 // Keep track of where initial nonpaged pool ends
367 MmNonPagedPoolEnd0
= (PVOID
)((ULONG_PTR
)MmNonPagedPoolStart
+
368 MmSizeOfNonPagedPoolInBytes
);
371 // Validate and remember last allocated pool page
373 PointerPte
= MiAddressToPte((PVOID
)((ULONG_PTR
)MmNonPagedPoolEnd0
- 1));
374 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
375 MiEndOfInitialPoolFrame
= PFN_FROM_PTE(PointerPte
);
378 // Validate the first nonpaged pool expansion page (which is a guard page)
380 PointerPte
= MiAddressToPte(MmNonPagedPoolExpansionStart
);
381 ASSERT(PointerPte
->u
.Hard
.Valid
== 0);
384 // Calculate the size of the expansion region alone
386 MiExpansionPoolPagesInitialCharge
= (PFN_COUNT
)
387 BYTES_TO_PAGES(MmMaximumNonPagedPoolInBytes
- MmSizeOfNonPagedPoolInBytes
);
390 // Remove 2 pages, since there's a guard page on top and on the bottom
392 MiExpansionPoolPagesInitialCharge
-= 2;
395 // Now initialize the nonpaged pool expansion PTE space. Remember there's a
396 // guard page on top so make sure to skip it. The bottom guard page will be
397 // guaranteed by the fact our size is off by one.
399 MiInitializeSystemPtes(PointerPte
+ 1,
400 MiExpansionPoolPagesInitialCharge
,
401 NonPagedPoolExpansion
);
406 MmDeterminePoolType(IN PVOID PoolAddress
)
409 // Use a simple bounds check
411 if (PoolAddress
>= MmPagedPoolStart
&& PoolAddress
<= MmPagedPoolEnd
)
413 else if (PoolAddress
>= MmNonPagedPoolStart
&& PoolAddress
<= MmNonPagedPoolEnd
)
415 KeBugCheckEx(BAD_POOL_CALLER
, 0x42, (ULONG_PTR
)PoolAddress
, 0, 0);
420 MiAllocatePoolPages(IN POOL_TYPE PoolType
,
421 IN SIZE_T SizeInBytes
)
423 PFN_NUMBER PageFrameNumber
;
424 PFN_COUNT SizeInPages
, PageTableCount
;
427 PLIST_ENTRY NextEntry
, NextHead
, LastHead
;
428 PMMPTE PointerPte
, StartPte
;
434 PVOID BaseVa
, BaseVaStart
;
435 PMMFREE_POOL_ENTRY FreeEntry
;
436 PKSPIN_LOCK_QUEUE LockQueue
;
439 // Figure out how big the allocation is in pages
441 SizeInPages
= (PFN_COUNT
)BYTES_TO_PAGES(SizeInBytes
);
444 // Check for overflow
446 if (SizeInPages
== 0)
457 if ((PoolType
& BASE_POOL_TYPE_MASK
) == PagedPool
)
460 // If only one page is being requested, try to grab it from the S-LIST
462 if ((SizeInPages
== 1) && (ExQueryDepthSList(&MiPagedPoolSListHead
)))
464 BaseVa
= InterlockedPopEntrySList(&MiPagedPoolSListHead
);
465 if (BaseVa
) return BaseVa
;
469 // Lock the paged pool mutex
471 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
474 // Find some empty allocation space
476 i
= RtlFindClearBitsAndSet(MmPagedPoolInfo
.PagedPoolAllocationMap
,
478 MmPagedPoolInfo
.PagedPoolHint
);
482 // Get the page bit count
484 i
= ((SizeInPages
- 1) / PTE_COUNT
) + 1;
485 DPRINT("Paged pool expansion: %lu %x\n", i
, SizeInPages
);
488 // Check if there is enougn paged pool expansion space left
490 if (MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
>
491 (PMMPDE
)MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
))
496 DPRINT1("OUT OF PAGED POOL!!!\n");
497 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
502 // Check if we'll have to expand past the last PTE we have available
504 if (((i
- 1) + MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
) >
505 (PMMPDE
)MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
))
508 // We can only support this much then
510 PointerPde
= MiAddressToPte(MmPagedPoolInfo
.LastPteForPagedPool
);
511 PageTableCount
= (PFN_COUNT
)(PointerPde
+ 1 -
512 MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
);
513 ASSERT(PageTableCount
< i
);
519 // Otherwise, there is plenty of space left for this expansion
525 // Get the template PDE we'll use to expand
527 TempPde
= ValidKernelPde
;
530 // Get the first PTE in expansion space
532 PointerPde
= MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
;
533 BaseVa
= MiPdeToPte(PointerPde
);
534 BaseVaStart
= BaseVa
;
537 // Lock the PFN database and loop pages
539 OldIrql
= KeAcquireQueuedSpinLock(LockQueuePfnLock
);
543 // It should not already be valid
545 ASSERT(PointerPde
->u
.Hard
.Valid
== 0);
548 MI_SET_USAGE(MI_USAGE_PAGED_POOL
);
549 MI_SET_PROCESS2("Kernel");
550 PageFrameNumber
= MiRemoveAnyPage(MI_GET_NEXT_COLOR());
551 TempPde
.u
.Hard
.PageFrameNumber
= PageFrameNumber
;
552 #if (_MI_PAGING_LEVELS >= 3)
553 /* On PAE/x64 systems, there's no double-buffering */
557 // Save it into our double-buffered system page directory
559 MmSystemPagePtes
[((ULONG_PTR
)PointerPde
& (SYSTEM_PD_SIZE
- 1)) / sizeof(MMPTE
)] = TempPde
;
561 /* Initialize the PFN */
562 MiInitializePfnForOtherProcess(PageFrameNumber
,
564 MmSystemPageDirectory
[(PointerPde
- MiAddressToPde(NULL
)) / PDE_COUNT
]);
566 /* Write the actual PDE now */
567 // MI_WRITE_VALID_PDE(PointerPde, TempPde);
570 // Move on to the next expansion address
573 BaseVa
= (PVOID
)((ULONG_PTR
)BaseVa
+ PAGE_SIZE
);
578 // Release the PFN database lock
580 KeReleaseQueuedSpinLock(LockQueuePfnLock
, OldIrql
);
583 // These pages are now available, clear their availablity bits
585 EndAllocation
= (ULONG
)(MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
-
586 (PMMPDE
)MiAddressToPte(MmPagedPoolInfo
.FirstPteForPagedPool
)) *
588 RtlClearBits(MmPagedPoolInfo
.PagedPoolAllocationMap
,
590 PageTableCount
* PTE_COUNT
);
593 // Update the next expansion location
595 MmPagedPoolInfo
.NextPdeForPagedPoolExpansion
+= PageTableCount
;
598 // Zero out the newly available memory
600 RtlZeroMemory(BaseVaStart
, PageTableCount
* PAGE_SIZE
);
603 // Now try consuming the pages again
605 i
= RtlFindClearBitsAndSet(MmPagedPoolInfo
.PagedPoolAllocationMap
,
613 DPRINT1("OUT OF PAGED POOL!!!\n");
614 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
620 // Update the pool hint if the request was just one page
622 if (SizeInPages
== 1) MmPagedPoolInfo
.PagedPoolHint
= i
+ 1;
625 // Update the end bitmap so we know the bounds of this allocation when
626 // the time comes to free it
628 EndAllocation
= i
+ SizeInPages
- 1;
629 RtlSetBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, EndAllocation
);
632 // Now we can release the lock (it mainly protects the bitmap)
634 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
637 // Now figure out where this allocation starts
639 BaseVa
= (PVOID
)((ULONG_PTR
)MmPagedPoolStart
+ (i
<< PAGE_SHIFT
));
644 KeFlushEntireTb(TRUE
, TRUE
);
646 /* Setup a demand-zero writable PTE */
647 MI_MAKE_SOFTWARE_PTE(&TempPte
, MM_READWRITE
);
650 // Find the first and last PTE, then loop them all
652 PointerPte
= MiAddressToPte(BaseVa
);
653 StartPte
= PointerPte
+ SizeInPages
;
657 // Write the demand zero PTE and keep going
659 MI_WRITE_INVALID_PTE(PointerPte
, TempPte
);
660 } while (++PointerPte
< StartPte
);
663 // Return the allocation address to the caller
669 // If only one page is being requested, try to grab it from the S-LIST
671 if ((SizeInPages
== 1) && (ExQueryDepthSList(&MiNonPagedPoolSListHead
)))
673 BaseVa
= InterlockedPopEntrySList(&MiNonPagedPoolSListHead
);
674 if (BaseVa
) return BaseVa
;
678 // Allocations of less than 4 pages go into their individual buckets
681 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
684 // Loop through all the free page lists based on the page index
686 NextHead
= &MmNonPagedPoolFreeListHead
[i
];
687 LastHead
= &MmNonPagedPoolFreeListHead
[MI_MAX_FREE_PAGE_LISTS
];
690 // Acquire the nonpaged pool lock
692 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
696 // Now loop through all the free page entries in this given list
698 NextEntry
= NextHead
->Flink
;
699 while (NextEntry
!= NextHead
)
701 /* Is freed non paged pool enabled */
702 if (MmProtectFreedNonPagedPool
)
704 /* We need to be able to touch this page, unprotect it */
705 MiUnProtectFreeNonPagedPool(NextEntry
, 0);
709 // Grab the entry and see if it can handle our allocation
711 FreeEntry
= CONTAINING_RECORD(NextEntry
, MMFREE_POOL_ENTRY
, List
);
712 ASSERT(FreeEntry
->Signature
== MM_FREE_POOL_SIGNATURE
);
713 if (FreeEntry
->Size
>= SizeInPages
)
716 // It does, so consume the pages from here
718 FreeEntry
->Size
-= SizeInPages
;
721 // The allocation will begin in this free page area
723 BaseVa
= (PVOID
)((ULONG_PTR
)FreeEntry
+
724 (FreeEntry
->Size
<< PAGE_SHIFT
));
726 /* Remove the item from the list, depending if pool is protected */
727 MmProtectFreedNonPagedPool
?
728 MiProtectedPoolRemoveEntryList(&FreeEntry
->List
) :
729 RemoveEntryList(&FreeEntry
->List
);
732 // However, check if its' still got space left
734 if (FreeEntry
->Size
!= 0)
736 /* Check which list to insert this entry into */
737 i
= FreeEntry
->Size
- 1;
738 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
740 /* Insert the entry into the free list head, check for prot. pool */
741 MmProtectFreedNonPagedPool
?
742 MiProtectedPoolInsertList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
, TRUE
) :
743 InsertTailList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
);
745 /* Is freed non paged pool protected? */
746 if (MmProtectFreedNonPagedPool
)
748 /* Protect the freed pool! */
749 MiProtectFreeNonPagedPool(FreeEntry
, FreeEntry
->Size
);
754 // Grab the PTE for this allocation
756 PointerPte
= MiAddressToPte(BaseVa
);
757 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
760 // Grab the PFN NextEntry and index
762 Pfn1
= MiGetPfnEntry(PFN_FROM_PTE(PointerPte
));
765 // Now mark it as the beginning of an allocation
767 ASSERT(Pfn1
->u3
.e1
.StartOfAllocation
== 0);
768 Pfn1
->u3
.e1
.StartOfAllocation
= 1;
770 /* Mark it as special pool if needed */
771 ASSERT(Pfn1
->u4
.VerifierAllocation
== 0);
772 if (PoolType
& 64) Pfn1
->u4
.VerifierAllocation
= 1;
775 // Check if the allocation is larger than one page
777 if (SizeInPages
!= 1)
780 // Navigate to the last PFN entry and PTE
782 PointerPte
+= SizeInPages
- 1;
783 ASSERT(PointerPte
->u
.Hard
.Valid
== 1);
784 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
788 // Mark this PFN as the last (might be the same as the first)
790 ASSERT(Pfn1
->u3
.e1
.EndOfAllocation
== 0);
791 Pfn1
->u3
.e1
.EndOfAllocation
= 1;
794 // Release the nonpaged pool lock, and return the allocation
796 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
801 // Try the next free page entry
803 NextEntry
= FreeEntry
->List
.Flink
;
805 /* Is freed non paged pool protected? */
806 if (MmProtectFreedNonPagedPool
)
808 /* Protect the freed pool! */
809 MiProtectFreeNonPagedPool(FreeEntry
, FreeEntry
->Size
);
812 } while (++NextHead
< LastHead
);
815 // If we got here, we're out of space.
816 // Start by releasing the lock
818 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
821 // Allocate some system PTEs
823 StartPte
= MiReserveSystemPtes(SizeInPages
, NonPagedPoolExpansion
);
824 PointerPte
= StartPte
;
825 if (StartPte
== NULL
)
830 DPRINT1("Out of NP Expansion Pool\n");
835 // Acquire the pool lock now
837 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
840 // Lock the PFN database too
842 LockQueue
= &KeGetCurrentPrcb()->LockQueue
[LockQueuePfnLock
];
843 KeAcquireQueuedSpinLockAtDpcLevel(LockQueue
);
848 TempPte
= ValidKernelPte
;
851 /* Allocate a page */
852 MI_SET_USAGE(MI_USAGE_PAGED_POOL
);
853 MI_SET_PROCESS2("Kernel");
854 PageFrameNumber
= MiRemoveAnyPage(MI_GET_NEXT_COLOR());
856 /* Get the PFN entry for it and fill it out */
857 Pfn1
= MiGetPfnEntry(PageFrameNumber
);
858 Pfn1
->u3
.e2
.ReferenceCount
= 1;
859 Pfn1
->u2
.ShareCount
= 1;
860 Pfn1
->PteAddress
= PointerPte
;
861 Pfn1
->u3
.e1
.PageLocation
= ActiveAndValid
;
862 Pfn1
->u4
.VerifierAllocation
= 0;
864 /* Write the PTE for it */
865 TempPte
.u
.Hard
.PageFrameNumber
= PageFrameNumber
;
866 MI_WRITE_VALID_PTE(PointerPte
++, TempPte
);
867 } while (--SizeInPages
> 0);
870 // This is the last page
872 Pfn1
->u3
.e1
.EndOfAllocation
= 1;
875 // Get the first page and mark it as such
877 Pfn1
= MiGetPfnEntry(StartPte
->u
.Hard
.PageFrameNumber
);
878 Pfn1
->u3
.e1
.StartOfAllocation
= 1;
880 /* Mark it as a verifier allocation if needed */
881 ASSERT(Pfn1
->u4
.VerifierAllocation
== 0);
882 if (PoolType
& 64) Pfn1
->u4
.VerifierAllocation
= 1;
885 // Release the PFN and nonpaged pool lock
887 KeReleaseQueuedSpinLockFromDpcLevel(LockQueue
);
888 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
891 // Return the address
893 return MiPteToAddress(StartPte
);
898 MiFreePoolPages(IN PVOID StartingVa
)
900 PMMPTE PointerPte
, StartPte
;
901 PMMPFN Pfn1
, StartPfn
;
902 PFN_COUNT FreePages
, NumberOfPages
;
904 PMMFREE_POOL_ENTRY FreeEntry
, NextEntry
, LastEntry
;
911 if ((StartingVa
>= MmPagedPoolStart
) && (StartingVa
<= MmPagedPoolEnd
))
914 // Calculate the offset from the beginning of paged pool, and convert it
917 Offset
= (ULONG_PTR
)StartingVa
- (ULONG_PTR
)MmPagedPoolStart
;
918 i
= (ULONG
)(Offset
>> PAGE_SHIFT
);
922 // Now use the end bitmap to scan until we find a set bit, meaning that
923 // this allocation finishes here
925 while (!RtlTestBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, End
)) End
++;
928 // Now calculate the total number of pages this allocation spans. If it's
929 // only one page, add it to the S-LIST instead of freeing it
931 NumberOfPages
= End
- i
+ 1;
932 if ((NumberOfPages
== 1) &&
933 (ExQueryDepthSList(&MiPagedPoolSListHead
) < MiPagedPoolSListMaximum
))
935 InterlockedPushEntrySList(&MiPagedPoolSListHead
, StartingVa
);
939 /* Delete the actual pages */
940 PointerPte
= MmPagedPoolInfo
.FirstPteForPagedPool
+ i
;
941 FreePages
= MiDeleteSystemPageableVm(PointerPte
, NumberOfPages
, 0, NULL
);
942 ASSERT(FreePages
== NumberOfPages
);
945 // Acquire the paged pool lock
947 KeAcquireGuardedMutex(&MmPagedPoolMutex
);
950 // Clear the allocation and free bits
952 RtlClearBit(MmPagedPoolInfo
.EndOfPagedPoolBitmap
, End
);
953 RtlClearBits(MmPagedPoolInfo
.PagedPoolAllocationMap
, i
, NumberOfPages
);
956 // Update the hint if we need to
958 if (i
< MmPagedPoolInfo
.PagedPoolHint
) MmPagedPoolInfo
.PagedPoolHint
= i
;
961 // Release the lock protecting the bitmaps
963 KeReleaseGuardedMutex(&MmPagedPoolMutex
);
966 // And finally return the number of pages freed
968 return NumberOfPages
;
972 // Get the first PTE and its corresponding PFN entry. If this is also the
973 // last PTE, meaning that this allocation was only for one page, push it into
974 // the S-LIST instead of freeing it
976 StartPte
= PointerPte
= MiAddressToPte(StartingVa
);
977 StartPfn
= Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
978 if ((Pfn1
->u3
.e1
.EndOfAllocation
== 1) &&
979 (ExQueryDepthSList(&MiNonPagedPoolSListHead
) < MiNonPagedPoolSListMaximum
))
981 InterlockedPushEntrySList(&MiNonPagedPoolSListHead
, StartingVa
);
986 // Loop until we find the last PTE
988 while (Pfn1
->u3
.e1
.EndOfAllocation
== 0)
994 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
998 // Now we know how many pages we have
1000 NumberOfPages
= (PFN_COUNT
)(PointerPte
- StartPte
+ 1);
1003 // Acquire the nonpaged pool lock
1005 OldIrql
= KeAcquireQueuedSpinLock(LockQueueMmNonPagedPoolLock
);
1008 // Mark the first and last PTEs as not part of an allocation anymore
1010 StartPfn
->u3
.e1
.StartOfAllocation
= 0;
1011 Pfn1
->u3
.e1
.EndOfAllocation
= 0;
1014 // Assume we will free as many pages as the allocation was
1016 FreePages
= NumberOfPages
;
1019 // Peek one page past the end of the allocation
1024 // Guard against going past initial nonpaged pool
1026 if (MiGetPfnEntryIndex(Pfn1
) == MiEndOfInitialPoolFrame
)
1029 // This page is on the outskirts of initial nonpaged pool, so ignore it
1036 ASSERT((ULONG_PTR
)StartingVa
+ NumberOfPages
<= (ULONG_PTR
)MmNonPagedPoolEnd
);
1038 /* Check if protected pool is enabled */
1039 if (MmProtectFreedNonPagedPool
)
1041 /* The freed block will be merged, it must be made accessible */
1042 MiUnProtectFreeNonPagedPool(MiPteToAddress(PointerPte
), 0);
1046 // Otherwise, our entire allocation must've fit within the initial non
1047 // paged pool, or the expansion nonpaged pool, so get the PFN entry of
1048 // the next allocation
1050 if (PointerPte
->u
.Hard
.Valid
== 1)
1053 // It's either expansion or initial: get the PFN entry
1055 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
1060 // This means we've reached the guard page that protects the end of
1061 // the expansion nonpaged pool
1069 // Check if this allocation actually exists
1071 if ((Pfn1
) && (Pfn1
->u3
.e1
.StartOfAllocation
== 0))
1074 // It doesn't, so we should actually locate a free entry descriptor
1076 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)StartingVa
+
1077 (NumberOfPages
<< PAGE_SHIFT
));
1078 ASSERT(FreeEntry
->Signature
== MM_FREE_POOL_SIGNATURE
);
1079 ASSERT(FreeEntry
->Owner
== FreeEntry
);
1081 /* Consume this entry's pages */
1082 FreePages
+= FreeEntry
->Size
;
1084 /* Remove the item from the list, depending if pool is protected */
1085 MmProtectFreedNonPagedPool
?
1086 MiProtectedPoolRemoveEntryList(&FreeEntry
->List
) :
1087 RemoveEntryList(&FreeEntry
->List
);
1091 // Now get the official free entry we'll create for the caller's allocation
1093 FreeEntry
= StartingVa
;
1096 // Check if the our allocation is the very first page
1098 if (MiGetPfnEntryIndex(StartPfn
) == MiStartOfInitialPoolFrame
)
1101 // Then we can't do anything or we'll risk underflowing
1108 // Otherwise, get the PTE for the page right before our allocation
1110 PointerPte
-= NumberOfPages
+ 1;
1112 /* Check if protected pool is enabled */
1113 if (MmProtectFreedNonPagedPool
)
1115 /* The freed block will be merged, it must be made accessible */
1116 MiUnProtectFreeNonPagedPool(MiPteToAddress(PointerPte
), 0);
1119 /* Check if this is valid pool, or a guard page */
1120 if (PointerPte
->u
.Hard
.Valid
== 1)
1123 // It's either expansion or initial nonpaged pool, get the PFN entry
1125 Pfn1
= MiGetPfnEntry(PointerPte
->u
.Hard
.PageFrameNumber
);
1130 // We must've reached the guard page, so don't risk touching it
1137 // Check if there is a valid PFN entry for the page before the allocation
1138 // and then check if this page was actually the end of an allocation.
1139 // If it wasn't, then we know for sure it's a free page
1141 if ((Pfn1
) && (Pfn1
->u3
.e1
.EndOfAllocation
== 0))
1144 // Get the free entry descriptor for that given page range
1146 FreeEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)StartingVa
- PAGE_SIZE
);
1147 ASSERT(FreeEntry
->Signature
== MM_FREE_POOL_SIGNATURE
);
1148 FreeEntry
= FreeEntry
->Owner
;
1150 /* Check if protected pool is enabled */
1151 if (MmProtectFreedNonPagedPool
)
1153 /* The freed block will be merged, it must be made accessible */
1154 MiUnProtectFreeNonPagedPool(FreeEntry
, 0);
1158 // Check if the entry is small enough to be indexed on a free list
1159 // If it is, we'll want to re-insert it, since we're about to
1160 // collapse our pages on top of it, which will change its count
1162 if (FreeEntry
->Size
< (MI_MAX_FREE_PAGE_LISTS
- 1))
1164 /* Remove the item from the list, depending if pool is protected */
1165 MmProtectFreedNonPagedPool
?
1166 MiProtectedPoolRemoveEntryList(&FreeEntry
->List
) :
1167 RemoveEntryList(&FreeEntry
->List
);
1172 FreeEntry
->Size
+= FreePages
;
1175 // And now find the new appropriate list to place it in
1177 i
= (ULONG
)(FreeEntry
->Size
- 1);
1178 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
1180 /* Insert the entry into the free list head, check for prot. pool */
1181 MmProtectFreedNonPagedPool
?
1182 MiProtectedPoolInsertList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
, TRUE
) :
1183 InsertTailList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
);
1188 // Otherwise, just combine our free pages into this entry
1190 FreeEntry
->Size
+= FreePages
;
1195 // Check if we were unable to do any compaction, and we'll stick with this
1197 if (FreeEntry
== StartingVa
)
1200 // Well, now we are a free entry. At worse we just have our newly freed
1201 // pages, at best we have our pages plus whatever entry came after us
1203 FreeEntry
->Size
= FreePages
;
1206 // Find the appropriate list we should be on
1208 i
= FreeEntry
->Size
- 1;
1209 if (i
>= MI_MAX_FREE_PAGE_LISTS
) i
= MI_MAX_FREE_PAGE_LISTS
- 1;
1211 /* Insert the entry into the free list head, check for prot. pool */
1212 MmProtectFreedNonPagedPool
?
1213 MiProtectedPoolInsertList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
, TRUE
) :
1214 InsertTailList(&MmNonPagedPoolFreeListHead
[i
], &FreeEntry
->List
);
1218 // Just a sanity check
1220 ASSERT(FreePages
!= 0);
1223 // Get all the pages between our allocation and its end. These will all now
1224 // become free page chunks.
1226 NextEntry
= StartingVa
;
1227 LastEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)NextEntry
+ (FreePages
<< PAGE_SHIFT
));
1231 // Link back to the parent free entry, and keep going
1233 NextEntry
->Owner
= FreeEntry
;
1234 NextEntry
->Signature
= MM_FREE_POOL_SIGNATURE
;
1235 NextEntry
= (PMMFREE_POOL_ENTRY
)((ULONG_PTR
)NextEntry
+ PAGE_SIZE
);
1236 } while (NextEntry
!= LastEntry
);
1238 /* Is freed non paged pool protected? */
1239 if (MmProtectFreedNonPagedPool
)
1241 /* Protect the freed pool! */
1242 MiProtectFreeNonPagedPool(FreeEntry
, FreeEntry
->Size
);
1246 // We're done, release the lock and let the caller know how much we freed
1248 KeReleaseQueuedSpinLock(LockQueueMmNonPagedPoolLock
, OldIrql
);
1249 return NumberOfPages
;
1255 MiRaisePoolQuota(IN POOL_TYPE PoolType
,
1256 IN ULONG CurrentMaxQuota
,
1257 OUT PULONG NewMaxQuota
)
1263 *NewMaxQuota
= CurrentMaxQuota
+ 65536;
1269 MiInitializeSessionPool(VOID
)
1271 PMMPTE PointerPde
, PointerPte
, LastPte
, LastPde
;
1272 PFN_NUMBER PageFrameIndex
, PdeCount
;
1273 PPOOL_DESCRIPTOR PoolDescriptor
;
1274 PMM_SESSION_SPACE SessionGlobal
;
1275 PMM_PAGED_POOL_INFO PagedPoolInfo
;
1277 ULONG Index
, PoolSize
, BitmapSize
;
1280 /* Lock session pool */
1281 SessionGlobal
= MmSessionSpace
->GlobalVirtualAddress
;
1282 KeInitializeGuardedMutex(&SessionGlobal
->PagedPoolMutex
);
1284 /* Setup a valid pool descriptor */
1285 PoolDescriptor
= &MmSessionSpace
->PagedPool
;
1286 ExInitializePoolDescriptor(PoolDescriptor
,
1290 &SessionGlobal
->PagedPoolMutex
);
1292 /* Setup the pool addresses */
1293 MmSessionSpace
->PagedPoolStart
= (PVOID
)MiSessionPoolStart
;
1294 MmSessionSpace
->PagedPoolEnd
= (PVOID
)((ULONG_PTR
)MiSessionPoolEnd
- 1);
1295 DPRINT1("Session Pool Start: 0x%p End: 0x%p\n",
1296 MmSessionSpace
->PagedPoolStart
, MmSessionSpace
->PagedPoolEnd
);
1298 /* Reset all the counters */
1299 PagedPoolInfo
= &MmSessionSpace
->PagedPoolInfo
;
1300 PagedPoolInfo
->PagedPoolCommit
= 0;
1301 PagedPoolInfo
->PagedPoolHint
= 0;
1302 PagedPoolInfo
->AllocatedPagedPool
= 0;
1304 /* Compute PDE and PTE addresses */
1305 PointerPde
= MiAddressToPde(MmSessionSpace
->PagedPoolStart
);
1306 PointerPte
= MiAddressToPte(MmSessionSpace
->PagedPoolStart
);
1307 LastPde
= MiAddressToPde(MmSessionSpace
->PagedPoolEnd
);
1308 LastPte
= MiAddressToPte(MmSessionSpace
->PagedPoolEnd
);
1310 /* Write them down */
1311 MmSessionSpace
->PagedPoolBasePde
= PointerPde
;
1312 PagedPoolInfo
->FirstPteForPagedPool
= PointerPte
;
1313 PagedPoolInfo
->LastPteForPagedPool
= LastPte
;
1314 PagedPoolInfo
->NextPdeForPagedPoolExpansion
= PointerPde
+ 1;
1317 PdeCount
= LastPde
- PointerPde
;
1318 RtlZeroMemory(PointerPde
, (PdeCount
+ 1) * sizeof(MMPTE
));
1320 /* Initialize the PFN for the PDE */
1321 Status
= MiInitializeAndChargePfn(&PageFrameIndex
,
1323 MmSessionSpace
->SessionPageDirectoryIndex
,
1325 ASSERT(NT_SUCCESS(Status
) == TRUE
);
1327 /* Initialize the first page table */
1328 Index
= (ULONG_PTR
)MmSessionSpace
->PagedPoolStart
- (ULONG_PTR
)MmSessionBase
;
1330 #ifndef _M_AMD64 // FIXME
1331 ASSERT(MmSessionSpace
->PageTables
[Index
].u
.Long
== 0);
1332 MmSessionSpace
->PageTables
[Index
] = *PointerPde
;
1335 /* Bump up counters */
1336 InterlockedIncrementSizeT(&MmSessionSpace
->NonPageablePages
);
1337 InterlockedIncrementSizeT(&MmSessionSpace
->CommittedPages
);
1339 /* Compute the size of the pool in pages, and of the bitmap for it */
1340 PoolSize
= MmSessionPoolSize
>> PAGE_SHIFT
;
1341 BitmapSize
= sizeof(RTL_BITMAP
) + ((PoolSize
+ 31) / 32) * sizeof(ULONG
);
1343 /* Allocate and initialize the bitmap to track allocations */
1344 PagedPoolInfo
->PagedPoolAllocationMap
= ExAllocatePoolWithTag(NonPagedPool
,
1347 ASSERT(PagedPoolInfo
->PagedPoolAllocationMap
!= NULL
);
1348 RtlInitializeBitMap(PagedPoolInfo
->PagedPoolAllocationMap
,
1349 (PULONG
)(PagedPoolInfo
->PagedPoolAllocationMap
+ 1),
1352 /* Set all bits, but clear the first page table's worth */
1353 RtlSetAllBits(PagedPoolInfo
->PagedPoolAllocationMap
);
1354 RtlClearBits(PagedPoolInfo
->PagedPoolAllocationMap
, 0, PTE_PER_PAGE
);
1356 /* Allocate and initialize the bitmap to track free space */
1357 PagedPoolInfo
->EndOfPagedPoolBitmap
= ExAllocatePoolWithTag(NonPagedPool
,
1360 ASSERT(PagedPoolInfo
->EndOfPagedPoolBitmap
!= NULL
);
1361 RtlInitializeBitMap(PagedPoolInfo
->EndOfPagedPoolBitmap
,
1362 (PULONG
)(PagedPoolInfo
->EndOfPagedPoolBitmap
+ 1),
1365 /* Clear all the bits and return success */
1366 RtlClearAllBits(PagedPoolInfo
->EndOfPagedPoolBitmap
);
1367 return STATUS_SUCCESS
;
1370 /* PUBLIC FUNCTIONS ***********************************************************/
1377 MmAllocateMappingAddress(IN SIZE_T NumberOfBytes
,
1389 MmFreeMappingAddress(IN PVOID BaseAddress
,