2023-08-26 14:07:06 +02:00
|
|
|
#include "pool.h"
|
|
|
|
|
2023-09-27 15:10:12 +02:00
|
|
|
#include <intrin.h>
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-08-28 11:17:38 +02:00
|
|
|
#include "callbacks.h"
|
2023-09-18 05:15:26 +02:00
|
|
|
#include "queue.h"
|
2023-12-29 17:20:32 +01:00
|
|
|
#include "ia32.h"
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-09-27 15:10:12 +02:00
|
|
|
#define PAGE_BASE_SIZE 0x1000
|
2023-12-13 05:06:27 +01:00
|
|
|
#define POOL_TAG_SIZE 0x004
|
2023-09-27 15:10:12 +02:00
|
|
|
|
|
|
|
#define PML4_ENTRY_COUNT 512
|
|
|
|
#define PDPT_ENTRY_COUNT 512
|
2023-12-13 05:06:27 +01:00
|
|
|
#define PD_ENTRY_COUNT 512
|
|
|
|
#define PT_ENTRY_COUNT 512
|
2023-09-27 15:10:12 +02:00
|
|
|
|
|
|
|
#define LARGE_PAGE_2MB_ENTRIES 512
|
|
|
|
#define LARGE_PAGE_1GB_ENTRIES 0x40000
|
|
|
|
|
|
|
|
#define CHUNK_SIZE 16
|
|
|
|
|
|
|
|
#define PROCESS_OBJECT_ALLOCATION_MARGIN 0x90
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
#define POOL_TAG_LENGTH 4
|
2023-08-28 13:10:07 +02:00
|
|
|
#define EXECUTIVE_OBJECT_COUNT 8
|
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
#define INDEX_PROCESS_POOL_TAG 0
|
|
|
|
#define INDEX_THREAD_POOL_TAG 1
|
|
|
|
#define INDEX_DESKTOP_POOL_TAG 2
|
2023-08-28 13:10:07 +02:00
|
|
|
#define INDEX_WINDOW_STATIONS_POOL_TAG 3
|
2023-12-13 05:06:27 +01:00
|
|
|
#define INDEX_MUTANTS_POOL_TAG 4
|
|
|
|
#define INDEX_FILE_OBJECTS_POOL_TAG 5
|
|
|
|
#define INDEX_DRIVERS_POOL_TAG 6
|
|
|
|
#define INDEX_SYMBOLIC_LINKS_POOL_TAG 7
|
|
|
|
|
|
|
|
CHAR EXECUTIVE_OBJECT_POOL_TAGS[EXECUTIVE_OBJECT_COUNT][POOL_TAG_LENGTH] = {
|
|
|
|
"\x50\x72\x6f\x63", /* Process */
|
|
|
|
"\x54\x68\x72\x64", /* Thread */
|
|
|
|
"\x44\x65\x73\x6B", /* Desktop */
|
|
|
|
"\x57\x69\x6E\x64", /* Windows Station */
|
|
|
|
"\x4D\x75\x74\x65", /* Mutants i.e mutex etc. */
|
|
|
|
"\x46\x69\x6C\x65", /* File objects */
|
|
|
|
"\x44\x72\x69\x76", /* Drivers */
|
|
|
|
"\x4C\x69\x6E\x6B" /* Symbolic links */
|
2023-08-28 13:10:07 +02:00
|
|
|
};
|
2023-08-27 16:34:21 +02:00
|
|
|
|
2023-10-08 06:24:54 +02:00
|
|
|
typedef struct _PROCESS_SCAN_CONTEXT
|
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
ULONG process_count;
|
|
|
|
PVOID process_buffer;
|
|
|
|
|
|
|
|
} PROCESS_SCAN_CONTEXT, *PPROCESS_SCAN_CONTEXT;
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
BOOLEAN
|
|
|
|
ValidateIfAddressIsProcessStructure(_In_ PVOID Address, _In_ PPOOL_HEADER PoolHeader);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
VOID
|
|
|
|
ScanPageForKernelObjectAllocation(_In_ UINT64 PageBase,
|
|
|
|
_In_ ULONG PageSize,
|
|
|
|
_In_ ULONG ObjectIndex,
|
|
|
|
_Inout_ PPROCESS_SCAN_CONTEXT Context);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
BOOLEAN
|
|
|
|
IsPhysicalAddressInPhysicalMemoryRange(_In_ UINT64 PhysicalAddress,
|
|
|
|
_In_ PPHYSICAL_MEMORY_RANGE PhysicalMemoryRanges);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
VOID
|
|
|
|
EnumerateKernelLargePages(_In_ UINT64 PageBase,
|
|
|
|
_In_ ULONG PageSize,
|
|
|
|
_In_ PPROCESS_SCAN_CONTEXT Context,
|
|
|
|
_In_ ULONG ObjectIndex);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
VOID
|
|
|
|
WalkKernelPageTables(_In_ PPROCESS_SCAN_CONTEXT Context);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
VOID
|
|
|
|
IncrementProcessCounter(_In_ PPROCESS_LIST_ENTRY ProcessListEntry, _Inout_opt_ PVOID Context);
|
|
|
|
|
|
|
|
STATIC
|
|
|
|
VOID
|
|
|
|
CheckIfProcessAllocationIsInProcessList(_In_ PPROCESS_LIST_ENTRY ProcessListEntry,
|
|
|
|
_Inout_opt_ PVOID Context);
|
2023-10-08 06:24:54 +02:00
|
|
|
|
|
|
|
#ifdef ALLOC_PRAGMA
|
2023-12-13 05:06:27 +01:00
|
|
|
# pragma alloc_text(PAGE, GetGlobalDebuggerData)
|
|
|
|
# pragma alloc_text(PAGE, GetPsActiveProcessHead)
|
|
|
|
# pragma alloc_text(PAGE, IncrementProcessCounter)
|
|
|
|
# pragma alloc_text(PAGE, CheckIfProcessAllocationIsInProcessList)
|
|
|
|
# pragma alloc_text(PAGE, FindUnlinkedProcesses)
|
2023-10-08 06:24:54 +02:00
|
|
|
#endif
|
|
|
|
|
2023-10-05 08:27:17 +02:00
|
|
|
PKDDEBUGGER_DATA64
|
2023-09-27 06:22:14 +02:00
|
|
|
GetGlobalDebuggerData()
|
2023-08-26 14:07:06 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
PAGED_CODE();
|
2023-10-09 20:19:51 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
CONTEXT context = {0};
|
|
|
|
PDUMP_HEADER dump_header = {0};
|
|
|
|
UINT64 thread_state = 0;
|
|
|
|
PKDDEBUGGER_DATA64 debugger_data = NULL;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
context.ContextFlags = CONTEXT_FULL;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
RtlCaptureContext(&context);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
dump_header = ExAllocatePool2(POOL_FLAG_NON_PAGED, DUMP_BLOCK_SIZE, POOL_DUMP_BLOCK_TAG);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!dump_header)
|
|
|
|
goto end;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
KeCapturePersistentThreadState(&context, NULL, NULL, NULL, NULL, NULL, NULL, dump_header);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
debugger_data = (PKDDEBUGGER_DATA64)ExAllocatePool2(
|
|
|
|
POOL_FLAG_NON_PAGED, sizeof(KDDEBUGGER_DATA64), POOL_DEBUGGER_DATA_TAG);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!debugger_data)
|
|
|
|
goto end;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
RtlCopyMemory(debugger_data, dump_header->KdDebuggerDataBlock, sizeof(KDDEBUGGER_DATA64));
|
2023-08-26 14:07:06 +02:00
|
|
|
|
|
|
|
end:
|
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (dump_header)
|
|
|
|
ExFreePoolWithTag(dump_header, POOL_DUMP_BLOCK_TAG);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
return debugger_data;
|
2023-08-26 14:07:06 +02:00
|
|
|
}
|
|
|
|
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
GetPsActiveProcessHead(_Out_ PUINT64 Address)
|
2023-08-30 11:19:41 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
PAGED_CODE();
|
2023-10-09 20:19:51 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
*Address = NULL;
|
2023-10-10 15:52:42 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
PKDDEBUGGER_DATA64 debugger_data = GetGlobalDebuggerData();
|
2023-08-30 11:19:41 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!debugger_data)
|
|
|
|
return;
|
2023-10-10 15:52:42 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
*Address = *(UINT64*)(debugger_data->PsActiveProcessHead);
|
|
|
|
ExFreePoolWithTag(debugger_data, POOL_DEBUGGER_DATA_TAG);
|
2023-08-30 11:19:41 +02:00
|
|
|
}
|
|
|
|
|
2023-09-15 22:25:02 +02:00
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* Here we define a signature that can be used to find EPROCESS structures consistently across
|
|
|
|
* major windows versions. The fields we test have proven to be consistent in the following study:
|
|
|
|
*
|
|
|
|
* https://www.cise.ufl.edu/~traynor/papers/ccs09b.pdf
|
|
|
|
*
|
|
|
|
* Aswell as some of my own additional research and testing. The following signature is used:
|
|
|
|
*
|
|
|
|
* PeakVirtualSize must be greater then 0 for any valid process:
|
|
|
|
* -> EPROCESS->PeakVirtualSize > 0
|
|
|
|
*
|
|
|
|
* The DirectoryTableBase must be 0x20 aligned:
|
|
|
|
* -> EPROCESS->DirectoryTableBase % 20 == 0
|
|
|
|
*
|
|
|
|
* The pool allocation size must be greater then the size of an EPROCESS allocation and
|
|
|
|
* less then the size of a page. Allocation size can be found with the following formula:
|
|
|
|
* -> AllocationSize = POOL_HEADER->BlockSize * CHUNK_SIZE - sizeof(POOL_HEADER)
|
|
|
|
* -> AllocationSize > sizeof(EPROCESS)
|
|
|
|
* -> AllocationSize < PAGE_SIZE (4096)
|
|
|
|
*
|
|
|
|
* Pool type must be non-null:
|
|
|
|
* -> POOL_HEADER->PoolType != NULL
|
|
|
|
*
|
|
|
|
* The process PEB must be a usermode address and 0x1000 aligned:
|
|
|
|
* -> EPROCESS->Peb & 0x7ffd0000 == 0x7ffd0000 && EPROCESS->Peb % 0x1000 == 0
|
|
|
|
*
|
|
|
|
* The object table must have the following properties and be 0x8 aligned:
|
|
|
|
* -> EPROCESS->ObjectTable & 0xe0000000 == 0xe0000000 && EPROCESS->ObjectTable % 0x8 == 0
|
|
|
|
*
|
|
|
|
* The allocation size, when AND'd with 0xfff0 must not equal 0xfff0:
|
|
|
|
* -> AllocationSize & 0xfff0 != 0xfff0
|
|
|
|
*
|
|
|
|
* This signature will allow us to consistently and accurately determine if a given pool allocation
|
|
|
|
*is indeed an executive process allocation across major versions of Windows.
|
|
|
|
*/
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
BOOLEAN
|
2023-12-13 05:06:27 +01:00
|
|
|
ValidateIfAddressIsProcessStructure(_In_ PVOID Address, _In_ PPOOL_HEADER PoolHeader)
|
2023-09-15 22:25:02 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
UINT64 peak_virtual_size = 0;
|
|
|
|
UINT64 dir_table_base = 0;
|
|
|
|
UINT64 allocation_size = 0;
|
|
|
|
UINT64 peb = 0;
|
|
|
|
UINT64 object_table = 0;
|
|
|
|
BOOLEAN peb_test = FALSE;
|
|
|
|
BOOLEAN object_table_test = FALSE;
|
|
|
|
UINT64 allocation_size_test = 0;
|
|
|
|
|
|
|
|
if (MmIsAddressValid((UINT64)Address + KPROCESS_DIRECTORY_TABLE_BASE_OFFSET))
|
|
|
|
dir_table_base = *(UINT64*)((UINT64)Address + KPROCESS_DIRECTORY_TABLE_BASE_OFFSET);
|
|
|
|
|
|
|
|
if (MmIsAddressValid((UINT64)Address + EPROCESS_PEAK_VIRTUAL_SIZE_OFFSET))
|
|
|
|
peak_virtual_size = *(UINT64*)((UINT64)Address + EPROCESS_PEAK_VIRTUAL_SIZE_OFFSET);
|
|
|
|
|
|
|
|
if (MmIsAddressValid((UINT64)PoolHeader + POOL_HEADER_BLOCK_SIZE_OFFSET))
|
|
|
|
allocation_size = PoolHeader->BlockSize * CHUNK_SIZE - sizeof(POOL_HEADER);
|
|
|
|
|
|
|
|
if (MmIsAddressValid((UINT64)Address + EPROCESS_PEB_OFFSET))
|
|
|
|
peb = *(UINT64*)((UINT64)Address + EPROCESS_PEB_OFFSET);
|
|
|
|
|
|
|
|
if (MmIsAddressValid((UINT64)Address + EPROCESS_OBJECT_TABLE_OFFSET))
|
|
|
|
object_table = *(UINT64*)((UINT64)Address + EPROCESS_OBJECT_TABLE_OFFSET);
|
|
|
|
|
|
|
|
peb_test = peb == NULL || (peb & 0x7ffd0000 == 0x7ffd0000 && peb % 0x1000 == NULL);
|
|
|
|
object_table_test = object_table == NULL ||
|
|
|
|
(object_table & 0xe0000000 == 0xe0000000 && object_table % 0x8 == 0);
|
|
|
|
allocation_size_test = allocation_size & 0xfff0;
|
|
|
|
|
|
|
|
if (peak_virtual_size > 0 && (dir_table_base & 0x20) == 0 &&
|
|
|
|
allocation_size > (EPROCESS_SIZE + OBJECT_HEADER_SIZE + sizeof(POOL_HEADER)) &&
|
|
|
|
PoolHeader->PoolType != NULL && !(allocation_size_test == 0xfff0) && !peb_test &&
|
|
|
|
!object_table_test)
|
|
|
|
{
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
return FALSE;
|
2023-09-15 22:25:02 +02:00
|
|
|
}
|
|
|
|
|
2023-08-28 11:17:38 +02:00
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* OBJECT_HEADER->InfoMask is a bit mask that tells us which optional
|
|
|
|
* headers the object has. The bits are as follows:
|
|
|
|
*
|
|
|
|
* 0x1 = OBJECT_HEADER_CREATOR_INFO
|
|
|
|
* 0x2 = OBJECT_HEADER_NAME_INFO
|
|
|
|
* 0x4 = OBJECT_HEADER_HANDLE_INFO
|
|
|
|
* 0x8 = OBJECT_HEADER_QUOTA_INFO
|
|
|
|
* 0x10 = OBJECT_HEADER_PROCESS_INFO
|
|
|
|
* 0x20 = OBJECT_HEADER_AUDIT_INFO
|
|
|
|
* 0x40 = OBJECT_HEADER_HANDLE_REVOCATION_INFO
|
|
|
|
*/
|
2023-08-28 11:17:38 +02:00
|
|
|
|
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* Idea: since we don't know the number of headers or the exact memory layout of the object
|
|
|
|
* header section for these proc allocations, we can form an estimate address of base + 0x70
|
|
|
|
* and then iterate the loaded process list and if theres an address within say 0x50 of it we
|
|
|
|
* can assume that the process is legitmate. Then to find an unlinked process, it wouldn't
|
|
|
|
* exist in the loaded module list, check that it hasnt been deallocated and then focus on
|
|
|
|
* scanning it for name etc. Maybe scan for .exe extension?
|
|
|
|
*
|
|
|
|
* Also use the full name so we get the file extension and path not the 15 char long one
|
|
|
|
*/
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
ScanPageForKernelObjectAllocation(_In_ UINT64 PageBase,
|
|
|
|
_In_ ULONG PageSize,
|
|
|
|
_In_ ULONG ObjectIndex,
|
|
|
|
_Inout_ PPROCESS_SCAN_CONTEXT Context)
|
2023-08-26 15:29:12 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
INT length = 0;
|
|
|
|
CHAR current_char = 0;
|
|
|
|
CHAR current_sig_byte = 0;
|
|
|
|
PPOOL_HEADER pool_header = NULL;
|
|
|
|
PEPROCESS process = NULL;
|
|
|
|
PEPROCESS process_size_one = NULL;
|
|
|
|
PEPROCESS process_size_two = NULL;
|
|
|
|
PEPROCESS test_process = NULL;
|
|
|
|
LPCSTR process_name = NULL;
|
|
|
|
PUINT64 address_list = NULL;
|
|
|
|
ULONG allocation_size = 0;
|
|
|
|
ULONG minimum_process_allocation_size =
|
|
|
|
EPROCESS_SIZE - sizeof(POOL_HEADER) - OBJECT_HEADER_SIZE;
|
|
|
|
|
|
|
|
if (!PageBase || !PageSize)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (INT offset = 0; offset <= PageSize - POOL_TAG_LENGTH - minimum_process_allocation_size;
|
|
|
|
offset++)
|
|
|
|
{
|
|
|
|
for (INT sig_index = 0; sig_index < POOL_TAG_LENGTH + 1; sig_index++)
|
|
|
|
{
|
|
|
|
if (!MmIsAddressValid(PageBase + offset + sig_index))
|
|
|
|
break;
|
|
|
|
|
|
|
|
current_char = *(PCHAR)(PageBase + offset + sig_index);
|
|
|
|
current_sig_byte = EXECUTIVE_OBJECT_POOL_TAGS[ObjectIndex][sig_index];
|
|
|
|
|
|
|
|
if (sig_index == POOL_TAG_LENGTH)
|
|
|
|
{
|
|
|
|
pool_header = (UINT64)PageBase + offset - POOL_HEADER_TAG_OFFSET;
|
|
|
|
|
|
|
|
if (!MmIsAddressValid((PVOID)pool_header))
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since every executive allocation is required to have an
|
|
|
|
* _OBJECT_HEADER, we start iterating from the size of this object
|
|
|
|
* header, then jump up in blocks of 0x10 since every object header
|
|
|
|
* is divisible by 0x10. We iterate up to 0xb0 which is equal to the
|
|
|
|
* following:
|
|
|
|
*
|
|
|
|
* 0xb0 = sizeof(ALL_HEADER_OBJECTS) + 0x10 where the 0x10 is 16
|
|
|
|
* bytes of padding.
|
|
|
|
*/
|
|
|
|
for (ULONG header_size = OBJECT_HEADER_SIZE; header_size < 0xb0;
|
|
|
|
header_size += 0x10)
|
|
|
|
{
|
|
|
|
test_process =
|
|
|
|
(PEPROCESS)((UINT64)pool_header + sizeof(POOL_HEADER) +
|
|
|
|
header_size);
|
|
|
|
|
|
|
|
if (ValidateIfAddressIsProcessStructure(test_process,
|
|
|
|
pool_header))
|
|
|
|
{
|
|
|
|
process = test_process;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (process == NULL)
|
|
|
|
break;
|
|
|
|
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_VERBOSE("Found process via pt walk: %llx", (UINT64)process);
|
2023-12-13 05:06:27 +01:00
|
|
|
|
|
|
|
address_list = (PUINT64)Context->process_buffer;
|
|
|
|
|
|
|
|
for (INT i = 0; i < Context->process_count; i++)
|
|
|
|
{
|
|
|
|
if (address_list[i] == NULL)
|
|
|
|
{
|
|
|
|
address_list[i] = (UINT64)process;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (current_char != current_sig_byte)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2023-08-26 17:48:50 +02:00
|
|
|
}
|
|
|
|
|
2023-08-26 19:19:26 +02:00
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* Using MmGetPhysicalMemoryRangesEx2(), we can get a block of structures that
|
|
|
|
* describe the physical memory layout. With each physical page base we are going
|
|
|
|
* to enumerate, we want to make sure it lies within an appropriate region of
|
|
|
|
* physical memory, so this function is to check for exactly that.
|
|
|
|
*/
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
BOOLEAN
|
2023-12-13 05:06:27 +01:00
|
|
|
IsPhysicalAddressInPhysicalMemoryRange(_In_ UINT64 PhysicalAddress,
|
|
|
|
_In_ PPHYSICAL_MEMORY_RANGE PhysicalMemoryRanges)
|
2023-08-26 17:48:50 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
ULONG page_index = 0;
|
|
|
|
UINT64 start_address = 0;
|
|
|
|
UINT64 end_address = 0;
|
2023-08-27 16:34:21 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
while (PhysicalMemoryRanges[page_index].NumberOfBytes.QuadPart != NULL)
|
|
|
|
{
|
|
|
|
start_address = PhysicalMemoryRanges[page_index].BaseAddress.QuadPart;
|
|
|
|
end_address =
|
|
|
|
start_address + PhysicalMemoryRanges[page_index].NumberOfBytes.QuadPart;
|
2023-08-26 15:29:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (PhysicalAddress >= start_address && PhysicalAddress <= end_address)
|
|
|
|
return TRUE;
|
2023-08-26 19:19:26 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
page_index++;
|
|
|
|
}
|
2023-08-26 17:48:50 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
return FALSE;
|
2023-08-26 15:29:12 +02:00
|
|
|
}
|
|
|
|
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
EnumerateKernelLargePages(_In_ UINT64 PageBase,
|
|
|
|
_In_ ULONG PageSize,
|
|
|
|
_In_ PPROCESS_SCAN_CONTEXT Context,
|
|
|
|
_In_ ULONG ObjectIndex)
|
2023-09-15 22:25:02 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
/*
|
|
|
|
* Split the large pages up into blocks of 0x1000 and scan each block
|
|
|
|
*/
|
|
|
|
for (UINT64 page_index = 0; page_index < PageSize; page_index++)
|
|
|
|
{
|
|
|
|
ScanPageForKernelObjectAllocation(
|
|
|
|
PageBase + (page_index * PAGE_SIZE), PAGE_SIZE, ObjectIndex, Context);
|
|
|
|
}
|
2023-09-15 22:25:02 +02:00
|
|
|
}
|
|
|
|
|
2023-08-26 15:29:12 +02:00
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* This is your basic page table walk function. On intel systems, paging has 4 levels,
|
|
|
|
* each table holds 512 entries with a total size of 0x1000 (512 * sizeof(QWORD)). Each entry
|
|
|
|
* in each table contains a value with a subset bitfield containing the physical address
|
|
|
|
* of the base of the next table in the structure. So for example, a PML4 entry contains
|
|
|
|
* a physical address that points to the base of the PDPT table, it is the same for a PDPT
|
|
|
|
* entry -> PD base and so on.
|
|
|
|
*
|
|
|
|
* However, as with all good things Windows has implemented security features meaning
|
|
|
|
* we cannot use functions such as MmCopyMemory or MmMapIoSpace on paging structures,
|
|
|
|
* so we must find another way to walk the pages. Luckily for us, there exists
|
|
|
|
* MmGetVirtualForPhysical. This function is self explanatory and returns the corresponding
|
|
|
|
* virtual address given a physical address. What this means is that we can extract a page
|
|
|
|
* entry physical address, pass it to MmGetVirtualForPhysical which returns us the virtual
|
|
|
|
* address of the base of the next page structure. This is because page tables are still
|
|
|
|
* mapped by the kernel and exist in virtual memory just like everything else and hence
|
|
|
|
* reading the value at all 512 entries from the virtual base will give us the equivalent
|
|
|
|
* value as directly reading the physical address.
|
|
|
|
*
|
|
|
|
* Using this, we essentially walk the page tables as any regular translation would
|
|
|
|
* except instead of simply reading the physical we translate it to a virtual address
|
|
|
|
* and extract the physical address from the value at each virtual address page entry.
|
|
|
|
*
|
|
|
|
* TODO: rewrite this its kinda ugly
|
|
|
|
*/
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
WalkKernelPageTables(_In_ PPROCESS_SCAN_CONTEXT Context)
|
2023-08-26 14:07:06 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
CR3 cr3 = {0};
|
|
|
|
PML4E pml4_base = {0};
|
|
|
|
PML4E pml4_entry = {0};
|
|
|
|
UINT64 pdpt_base = 0;
|
|
|
|
UINT64 pd_base = 0;
|
|
|
|
UINT64 pt_base = 0;
|
|
|
|
PDPTE pdpt_entry = {0};
|
|
|
|
PDPTE_LARGE pdpt_large_entry = {0};
|
|
|
|
PDE pd_entry = {0};
|
|
|
|
PDE_LARGE pd_large_entry = {0};
|
|
|
|
PTE pt_entry = {0};
|
|
|
|
UINT64 base_physical_page = 0;
|
|
|
|
UINT64 base_virtual_page = 0;
|
|
|
|
UINT64 base_2mb_virtual_page = 0;
|
|
|
|
UINT64 base_1gb_virtual_page = 0;
|
|
|
|
PHYSICAL_ADDRESS physical = {0};
|
|
|
|
PPHYSICAL_MEMORY_RANGE physical_memory_ranges = NULL;
|
|
|
|
KIRQL irql = {0};
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical_memory_ranges = MmGetPhysicalMemoryRangesEx2(NULL, NULL);
|
2023-08-26 17:48:50 +02:00
|
|
|
|
2023-12-23 19:52:55 +01:00
|
|
|
if (!physical_memory_ranges)
|
2023-12-13 05:06:27 +01:00
|
|
|
{
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_ERROR("MmGetPhysicalMemoryRangesEx2 failed with no status.");
|
2023-12-13 05:06:27 +01:00
|
|
|
return;
|
|
|
|
}
|
2023-08-26 17:48:50 +02:00
|
|
|
|
2023-12-29 17:20:32 +01:00
|
|
|
cr3.AsUInt = __readcr3();
|
2023-08-27 08:01:36 +02:00
|
|
|
|
2023-12-29 17:20:32 +01:00
|
|
|
physical.QuadPart = cr3.AddressOfPageDirectory << PAGE_4KB_SHIFT;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pml4_base.BitAddress = MmGetVirtualForPhysical(physical);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!MmIsAddressValid(pml4_base.BitAddress) || !pml4_base.BitAddress)
|
|
|
|
return;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
for (INT pml4_index = 0; pml4_index < PML4_ENTRY_COUNT; pml4_index++)
|
|
|
|
{
|
|
|
|
if (!MmIsAddressValid(pml4_base.BitAddress + pml4_index * sizeof(UINT64)))
|
|
|
|
continue;
|
2023-08-30 15:38:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pml4_entry.BitAddress =
|
|
|
|
*(UINT64*)(pml4_base.BitAddress + pml4_index * sizeof(UINT64));
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (pml4_entry.Bits.Present == NULL)
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pml4_entry.Bits.PhysicalAddress << PAGE_4KB_SHIFT;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pdpt_base = MmGetVirtualForPhysical(physical);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!pdpt_base || !MmIsAddressValid(pdpt_base))
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
for (INT pdpt_index = 0; pdpt_index < PDPT_ENTRY_COUNT; pdpt_index++)
|
|
|
|
{
|
|
|
|
if (!MmIsAddressValid(pdpt_base + pdpt_index * sizeof(UINT64)))
|
|
|
|
continue;
|
2023-08-30 15:38:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pdpt_entry.BitAddress = *(UINT64*)(pdpt_base + pdpt_index * sizeof(UINT64));
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (pdpt_entry.Bits.Present == NULL)
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (IS_LARGE_PAGE(pdpt_entry.BitAddress))
|
|
|
|
{
|
|
|
|
/* 1gb size page */
|
|
|
|
pdpt_large_entry.BitAddress = pdpt_entry.BitAddress;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pdpt_large_entry.Bits.PhysicalAddress
|
|
|
|
<< PAGE_1GB_SHIFT;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (IsPhysicalAddressInPhysicalMemoryRange(
|
|
|
|
physical.QuadPart, physical_memory_ranges) == FALSE)
|
|
|
|
continue;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
base_1gb_virtual_page = MmGetVirtualForPhysical(physical);
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!base_1gb_virtual_page ||
|
|
|
|
!MmIsAddressValid(base_1gb_virtual_page))
|
|
|
|
continue;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
EnumerateKernelLargePages(base_1gb_virtual_page,
|
|
|
|
LARGE_PAGE_1GB_ENTRIES,
|
|
|
|
Context,
|
|
|
|
INDEX_PROCESS_POOL_TAG);
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
continue;
|
|
|
|
}
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pdpt_entry.Bits.PhysicalAddress << PAGE_4KB_SHIFT;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pd_base = MmGetVirtualForPhysical(physical);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!pd_base || !MmIsAddressValid(pd_base))
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
for (INT pd_index = 0; pd_index < PD_ENTRY_COUNT; pd_index++)
|
|
|
|
{
|
|
|
|
if (!MmIsAddressValid(pd_base + pd_index * sizeof(UINT64)))
|
|
|
|
continue;
|
2023-08-30 15:38:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pd_entry.BitAddress =
|
|
|
|
*(UINT64*)(pd_base + pd_index * sizeof(UINT64));
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (pd_entry.Bits.Present == NULL)
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (IS_LARGE_PAGE(pd_entry.BitAddress))
|
|
|
|
{
|
|
|
|
/* 2MB size page */
|
|
|
|
pd_large_entry.BitAddress = pd_entry.BitAddress;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pd_large_entry.Bits.PhysicalAddress
|
|
|
|
<< PAGE_2MB_SHIFT;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (IsPhysicalAddressInPhysicalMemoryRange(
|
|
|
|
physical.QuadPart, physical_memory_ranges) == FALSE)
|
|
|
|
continue;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
base_2mb_virtual_page = MmGetVirtualForPhysical(physical);
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!base_2mb_virtual_page ||
|
|
|
|
!MmIsAddressValid(base_2mb_virtual_page))
|
|
|
|
continue;
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
EnumerateKernelLargePages(base_2mb_virtual_page,
|
|
|
|
LARGE_PAGE_2MB_ENTRIES,
|
|
|
|
Context,
|
|
|
|
INDEX_PROCESS_POOL_TAG);
|
2023-09-03 19:33:27 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
continue;
|
|
|
|
}
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pd_entry.Bits.PhysicalAddress << PAGE_4KB_SHIFT;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!MmIsAddressValid(pd_base + pd_index * sizeof(UINT64)))
|
|
|
|
continue;
|
2023-09-17 05:14:02 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pt_base = MmGetVirtualForPhysical(physical);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!pt_base || !MmIsAddressValid(pt_base))
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
for (INT pt_index = 0; pt_index < PT_ENTRY_COUNT; pt_index++)
|
|
|
|
{
|
|
|
|
if (!MmIsAddressValid(pt_base + pt_index * sizeof(UINT64)))
|
|
|
|
continue;
|
2023-08-30 15:38:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
pt_entry.BitAddress =
|
|
|
|
*(UINT64*)(pt_base + pt_index * sizeof(UINT64));
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (pt_entry.Bits.Present == NULL)
|
|
|
|
continue;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
physical.QuadPart = pt_entry.Bits.PhysicalAddress
|
|
|
|
<< PAGE_4KB_SHIFT;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
/* if the page base isnt in a legit region, go next */
|
|
|
|
if (IsPhysicalAddressInPhysicalMemoryRange(
|
|
|
|
physical.QuadPart, physical_memory_ranges) == FALSE)
|
|
|
|
continue;
|
2023-08-26 19:19:26 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
base_virtual_page = MmGetVirtualForPhysical(physical);
|
2023-08-26 15:29:12 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
/* stupid fucking intellisense error GO AWAY! */
|
|
|
|
if (base_virtual_page == NULL ||
|
|
|
|
!MmIsAddressValid(base_virtual_page))
|
|
|
|
continue;
|
2023-08-26 17:48:50 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
ScanPageForKernelObjectAllocation(base_virtual_page,
|
|
|
|
PAGE_BASE_SIZE,
|
|
|
|
INDEX_PROCESS_POOL_TAG,
|
|
|
|
Context);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_VERBOSE("Finished scanning memory for unlinked processes.");
|
2023-08-28 11:17:38 +02:00
|
|
|
}
|
2023-08-27 07:49:59 +02:00
|
|
|
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
IncrementProcessCounter(_In_ PPROCESS_LIST_ENTRY ProcessListEntry, _Inout_opt_ PVOID Context)
|
2023-08-28 11:17:38 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
PAGED_CODE();
|
2023-10-10 15:52:42 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
UNREFERENCED_PARAMETER(ProcessListEntry);
|
2023-10-10 19:49:17 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
PPROCESS_SCAN_CONTEXT context = (PPROCESS_SCAN_CONTEXT)Context;
|
2023-10-07 07:27:22 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!context)
|
|
|
|
return;
|
2023-10-07 07:27:22 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
context->process_count++;
|
2023-08-28 11:17:38 +02:00
|
|
|
}
|
2023-08-27 07:49:59 +02:00
|
|
|
|
2023-09-27 06:22:14 +02:00
|
|
|
STATIC
|
2023-10-05 08:27:17 +02:00
|
|
|
VOID
|
2023-12-13 05:06:27 +01:00
|
|
|
CheckIfProcessAllocationIsInProcessList(_In_ PPROCESS_LIST_ENTRY ProcessListEntry,
|
|
|
|
_Inout_opt_ PVOID Context)
|
2023-08-28 11:17:38 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
PAGED_CODE();
|
|
|
|
|
|
|
|
PUINT64 allocation_address = NULL;
|
|
|
|
PPROCESS_SCAN_CONTEXT context = (PPROCESS_SCAN_CONTEXT)Context;
|
|
|
|
|
|
|
|
if (!context)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (INT i = 0; i < context->process_count; i++)
|
|
|
|
{
|
|
|
|
allocation_address = (PUINT64)context->process_buffer;
|
|
|
|
|
|
|
|
if ((UINT64)ProcessListEntry->process >=
|
|
|
|
allocation_address[i] - PROCESS_OBJECT_ALLOCATION_MARGIN &&
|
|
|
|
(UINT64)ProcessListEntry->process <=
|
|
|
|
allocation_address[i] + PROCESS_OBJECT_ALLOCATION_MARGIN)
|
|
|
|
{
|
|
|
|
RtlZeroMemory((UINT64)context->process_buffer + i * sizeof(UINT64),
|
|
|
|
sizeof(UINT64));
|
|
|
|
}
|
|
|
|
}
|
2023-08-26 14:07:06 +02:00
|
|
|
}
|
|
|
|
|
2023-10-05 08:27:17 +02:00
|
|
|
NTSTATUS
|
2023-11-09 08:30:59 +01:00
|
|
|
FindUnlinkedProcesses()
|
2023-08-26 14:07:06 +02:00
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
PAGED_CODE();
|
2023-10-10 15:52:42 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
PUINT64 allocation_address = NULL;
|
|
|
|
PROCESS_SCAN_CONTEXT context = {0};
|
|
|
|
PINVALID_PROCESS_ALLOCATION_REPORT report_buffer = NULL;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
EnumerateProcessListWithCallbackRoutine(IncrementProcessCounter, &context);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (context.process_count == 0)
|
|
|
|
{
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_ERROR("IncrementProcessCounter failed with no status.");
|
2023-12-13 05:06:27 +01:00
|
|
|
return STATUS_ABANDONED;
|
|
|
|
}
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
context.process_buffer = ExAllocatePool2(POOL_FLAG_NON_PAGED,
|
|
|
|
context.process_count * 2 * sizeof(UINT64),
|
|
|
|
PROCESS_ADDRESS_LIST_TAG);
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!context.process_buffer)
|
|
|
|
return STATUS_MEMORY_NOT_ALLOCATED;
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
WalkKernelPageTables(&context);
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
EnumerateProcessListWithCallbackRoutine(CheckIfProcessAllocationIsInProcessList, &context);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
allocation_address = (PUINT64)context.process_buffer;
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
for (INT index = 0; index < context.process_count; index++)
|
|
|
|
{
|
|
|
|
if (allocation_address[index] == NULL)
|
|
|
|
continue;
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-12-23 19:52:55 +01:00
|
|
|
UINT64 allocation = (UINT64)allocation_address[index] - OBJECT_HEADER_SIZE;
|
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
/*
|
|
|
|
* It's important to remember that at this point it is still not guaranteed that we
|
|
|
|
* have found an unlinked process allocation. It is better to have a few false
|
|
|
|
* positives that can be later analysed rather then enforce a strict signature and
|
|
|
|
* potentially miss a real unlinked process.
|
|
|
|
*/
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_WARNING("Potentially found an unlinked process allocation at address: %llx",
|
|
|
|
allocation);
|
2023-08-28 17:00:52 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
report_buffer = ExAllocatePool2(
|
|
|
|
POOL_FLAG_PAGED, sizeof(INVALID_PROCESS_ALLOCATION_REPORT), REPORT_POOL_TAG);
|
2023-08-28 17:00:52 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (!report_buffer)
|
|
|
|
goto end;
|
2023-08-28 17:00:52 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
report_buffer->report_code = REPORT_INVALID_PROCESS_ALLOCATION;
|
2023-08-28 17:00:52 +02:00
|
|
|
|
2023-12-23 19:52:55 +01:00
|
|
|
RtlCopyMemory(
|
|
|
|
report_buffer->process, allocation, REPORT_INVALID_PROCESS_BUFFER_SIZE);
|
2023-08-28 17:00:52 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
InsertReportToQueue(report_buffer);
|
|
|
|
}
|
2023-08-28 11:17:38 +02:00
|
|
|
|
2023-08-28 17:00:52 +02:00
|
|
|
end:
|
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (context.process_buffer)
|
|
|
|
ExFreePoolWithTag(context.process_buffer, PROCESS_ADDRESS_LIST_TAG);
|
2023-08-26 14:07:06 +02:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
return STATUS_SUCCESS;
|
2023-11-08 16:02:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2023-12-13 05:06:27 +01:00
|
|
|
* Allocations greater then a page in size are stored in a linked list and are called
|
|
|
|
* big pool allocations.
|
|
|
|
*/
|
2023-11-08 16:02:17 +01:00
|
|
|
|
|
|
|
NTSTATUS
|
|
|
|
EnumerateBigPoolAllocations()
|
|
|
|
{
|
2023-12-13 05:06:27 +01:00
|
|
|
ULONG return_length = 0;
|
2023-12-23 19:52:55 +01:00
|
|
|
NTSTATUS status = STATUS_UNSUCCESSFUL;
|
2023-12-13 05:06:27 +01:00
|
|
|
PSYSTEM_BIGPOOL_ENTRY entry = NULL;
|
|
|
|
SYSTEM_BIGPOOL_INFORMATION pool_information = {0};
|
|
|
|
PSYSTEM_BIGPOOL_INFORMATION pool_entries = NULL;
|
|
|
|
UNICODE_STRING routine = RTL_CONSTANT_STRING(L"ZwQuerySystemInformation");
|
|
|
|
ZwQuerySystemInformation pZwQuerySystemInformation = MmGetSystemRoutineAddress(&routine);
|
|
|
|
|
|
|
|
if (!pZwQuerySystemInformation)
|
|
|
|
{
|
2023-12-23 19:52:55 +01:00
|
|
|
DEBUG_ERROR("MmGetSystemRoutineAddress failed with no status.");
|
|
|
|
return status;
|
2023-12-13 05:06:27 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
status = pZwQuerySystemInformation(SYSTEM_BIGPOOL_INFORMATION_ID,
|
|
|
|
&pool_information,
|
|
|
|
sizeof(pool_information),
|
|
|
|
&return_length);
|
|
|
|
|
|
|
|
if (status != STATUS_INFO_LENGTH_MISMATCH)
|
|
|
|
{
|
|
|
|
DEBUG_ERROR("ZwQuerySystemInformation failed with status %x", status);
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
return_length += sizeof(SYSTEM_BIGPOOL_INFORMATION);
|
|
|
|
|
|
|
|
pool_entries = ExAllocatePool2(POOL_FLAG_NON_PAGED, return_length, POOL_TAG_INTEGRITY);
|
|
|
|
|
|
|
|
if (!pool_entries)
|
|
|
|
return STATUS_MEMORY_NOT_ALLOCATED;
|
|
|
|
|
|
|
|
status = pZwQuerySystemInformation(
|
|
|
|
SYSTEM_BIGPOOL_INFORMATION_ID, pool_entries, return_length, &return_length);
|
|
|
|
|
|
|
|
if (!NT_SUCCESS(status))
|
|
|
|
{
|
|
|
|
DEBUG_ERROR("ZwQuerySystemInformation 2 failed with status %x", status);
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (INT index = 0; index < pool_entries->Count; index++)
|
|
|
|
{
|
|
|
|
entry = &pool_entries->AllocatedInfo[index];
|
|
|
|
}
|
|
|
|
// MiGetPteAddress of va
|
|
|
|
// check if page is executaable
|
2023-11-08 16:02:17 +01:00
|
|
|
end:
|
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
if (pool_entries)
|
|
|
|
ExFreePoolWithTag(pool_entries, POOL_TAG_INTEGRITY);
|
2023-11-08 16:02:17 +01:00
|
|
|
|
2023-12-13 05:06:27 +01:00
|
|
|
return status;
|
2023-08-26 14:07:06 +02:00
|
|
|
}
|