1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
#include "KMemDriver.h"
#include "Imports.h"
#include "Native.h"
#include <ntddk.h>
#include <Ntstrsafe.h>
#define MM_ZERO_ACCESS 0
TABLE_SEARCH_RESULT
VADFindNodeOrParent(
IN PMM_AVL_TABLE Table,
IN ULONG_PTR StartingVpn,
OUT PMMADDRESS_NODE *NodeOrParent
)
{
PMMADDRESS_NODE Child;
PMMADDRESS_NODE NodeToExamine;
PMMVAD_SHORT VpnCompare;
ULONG_PTR startVpn;
ULONG_PTR endVpn;
if (Table->NumberGenericTableElements == 0) {
return TableEmptyTree;
}
NodeToExamine = (PMMADDRESS_NODE)GET_VAD_ROOT(Table);
for (;;) {
VpnCompare = (PMMVAD_SHORT)NodeToExamine;
startVpn = VpnCompare->StartingVpn;
endVpn = VpnCompare->EndingVpn;
startVpn |= (ULONG_PTR)VpnCompare->StartingVpnHigh << 32;
endVpn |= (ULONG_PTR)VpnCompare->EndingVpnHigh << 32;
KDBG("Examining Node 0x%p with start VA 0x%p and end VA 0x%p\n", VpnCompare, startVpn, endVpn);
//
// Compare the buffer with the key in the tree element.
//
if (StartingVpn < startVpn) {
Child = NodeToExamine->LeftChild;
if (Child != NULL) {
NodeToExamine = Child;
}
else {
//
// Node is not in the tree. Set the output
// parameter to point to what would be its
// parent and return which child it would be.
//
*NodeOrParent = NodeToExamine;
return TableInsertAsLeft;
}
}
else if (StartingVpn <= endVpn) {
//
// This is the node.
//
*NodeOrParent = NodeToExamine;
return TableFoundNode;
}
else {
Child = NodeToExamine->RightChild;
if (Child != NULL) {
NodeToExamine = Child;
}
else {
//
// Node is not in the tree. Set the output
// parameter to point to what would be its
// parent and return which child it would be.
//
*NodeOrParent = NodeToExamine;
return TableInsertAsRight;
}
}
}
}
NTSTATUS VADFind(
IN PEPROCESS pProcess,
IN ULONG_PTR address,
OUT PMMVAD_SHORT* pResult
)
{
NTSTATUS status = STATUS_SUCCESS;
ULONG_PTR vpnStart = address >> PAGE_SHIFT;
PMM_AVL_TABLE pTable = (PMM_AVL_TABLE)((PUCHAR)pProcess + VAD_TREE_1803);
PMM_AVL_NODE pNode = GET_VAD_ROOT(pTable);
if (pProcess == NULL || pResult == NULL)
return STATUS_INVALID_PARAMETER;
// Search VAD
if (VADFindNodeOrParent(pTable, vpnStart, &pNode) == TableFoundNode)
{
*pResult = (PMMVAD_SHORT)pNode;
}
else
{
KDBG("%s: VAD entry for address 0x%p not found\n", __FUNCTION__, address);
status = STATUS_NOT_FOUND;
}
return status;
}
NTSTATUS VADProtect(
IN PEPROCESS pProcess,
IN ULONG_PTR address, IN ULONG prot
)
{
NTSTATUS status = STATUS_SUCCESS;
PMMVAD_SHORT pVadShort = NULL;
status = VADFind(pProcess, address, &pVadShort);
if (NT_SUCCESS(status))
pVadShort->u.VadFlags.Protection = prot;
return status;
}
NTSTATUS VADUnlink(IN PEPROCESS pProcess, IN ULONG_PTR address)
{
NTSTATUS status = STATUS_SUCCESS;
PMMVAD_SHORT pVadShort = NULL;
status = VADFind(pProcess, address, &pVadShort);
if (!NT_SUCCESS(status))
return status;
// Erase image name
if (pVadShort->u.VadFlags.VadType == VadImageMap)
{
PMMVAD pVadLong = (PMMVAD)pVadShort;
if (pVadLong->Subsection && pVadLong->Subsection->ControlArea && pVadLong->Subsection->ControlArea->FilePointer.Object)
{
PFILE_OBJECT pFile = (PFILE_OBJECT)(pVadLong->Subsection->ControlArea->FilePointer.Value & ~0xF);
pFile->FileName.Buffer[0] = L'\0';
pFile->FileName.Length = 0;
}
else
return STATUS_INVALID_ADDRESS;
}
// Make NO_ACCESS
else if (pVadShort->u.VadFlags.VadType == VadDevicePhysicalMemory)
{
pVadShort->u.VadFlags.Protection = MM_ZERO_ACCESS;
}
else {
RtlAvlRemoveNode((PMM_AVL_TABLE)((PUCHAR)pProcess + VAD_TREE_1803), (PMMADDRESS_NODE)pVadShort);
}
return status;
}
|