content/blog/woce-2.md (view raw)
1+++
2title = "Writing our own Cheat Engine: Exact Value scanning"
3date = 2021-02-12
4[taxonomies]
5category = ["sw"]
6tags = ["windows", "rust", "hacking"]
7+++
8
9This is part 2 on the *Writing our own Cheat Engine* series.
10
11New around here? Skim over [part 1](/blog/woce-1) to learn what this series is all about.
12
13In the introduction, we spent a good deal of time enumerating all running processes just so we could find out the pid we cared about. With the pid now in our hands, we can do pretty much anything to its corresponding process.
14
15It's now time to read the process' memory and write to it. If our process was a single-player game, this would enable us to do things like setting a very high value on the player's current health pool, making us invencible. This technique will often not work for multi-player games, because the server likely knows your true current health (the most you could probably do is make the client render an incorrect value). However, if the server is crappy and it trusts the client, then you're still free to mess around with your current health.
16
17Even if we don't want to write to the process' memory, reading is still very useful. Maybe you could enhance your experience by making a custom overlay that displays useful information, or something that makes noise if it detects the life is too low, or even simulating a keyboard event to automatically recover some mana when you're running low.
18
19Be warned about anti-cheat systems. Anything beyond a basic game is likely to have some protection measures in place, making the analysis more difficult (perhaps the values are scrambled in memory), or even pinging the server if it detects something fishy.
20
21**I am not responsible for any bans!** Use your brain before messing with online games, and don't ruin the fun for everyone else. If you get caught for cheating, I don't want to know about it.
22
23Now that all [script kiddies][script-kid] have left the room, let's proceed with the post.
24
25## Exact Value scanning
26
27<details open><summary>Cheat Engine Tutorial: Step 2</summary>
28
29> Now that you have opened the tutorial with Cheat Engine let's get on with the next step.
30>
31> You can see at the bottom of this window is the text Health: xxx. Each time you click 'Hit me' your health gets decreased.
32>
33> To get to the next step you have to find this value and change it to 1000
34>
35> To find the value there are different ways, but I'll tell you about the easiest, 'Exact Value': First make sure value type is set to at least 2-bytes or 4-bytes. 1-byte will also work, but you'll run into an easy to fix problem when you've found the address and want to change it. The 8-byte may perhaps works if the bytes after the address are 0, but I wouldn't take the bet. Single, double, and the other scans just don't work, because they store the value in a different way.
36>
37> When the value type is set correctly, make sure the scantype is set to 'Exact Value'. Then fill in the number your health is in the value box. And click 'First Scan'. After a while (if you have a extremely slow pc) the scan is done and the results are shown in the list on the left
38>
39> If you find more than 1 address and you don't know for sure which address it is, click 'Hit me', fill in the new health value into the value box, and click 'Next Scan'. Repeat this until you're sure you've found it. (that includes that there's only 1 address in the list.....)
40>
41> Now double click the address in the list on the left. This makes the address pop-up in the list at the bottom, showing you the current value. Double click the value, (or select it and press enter), and change the value to 1000.
42>
43> If everything went ok the next button should become enabled, and you're ready for the next step.
44>
45> Note: If you did anything wrong while scanning, click "New Scan" and repeat the scanning again. Also, try playing around with the value and click 'hit me'
46
47</details>
48
49## Our First Scan
50
51The Cheat Engine tutorial talks about "value types" and "scan types" like "exact value".
52
53The **value types** will help us narrow down *what* we're looking for. For example, the integer type `i32` is represented in memory as 32 bits, or 4 bytes. However, `f32` is *also* represented by 4 bytes, and so is `u32`. Or perhaps the 4 bytes represent RGBA values of a color! So any 4 bytes in memory can be interpreted in many ways, and it's up to us to decide which way we interpret the bytes in.
54
55When programming, numbers which are 32-bit wide are common, as they're a good (and fast) size to work with. Scanning for this type is often a good bet. For positive numbers, `i32` is represented the same as `u32` in memory, so even if the value turns out to not be signed, the scan is likely to work. Focusing on `i32` will save us from scanning for `f32` or even other types, like interpreting 8 bytes for `i64`, `f64`, or less bytes like `i16`.
56
57The **scan types** will help us narrow down *how* we're looking for a value. Scanning for an exact value means what you think it does: interpret all 4 bytes in the process' memory as our value type, and check if they exactly match our value. This will often yield a lot of candidates, but it will be enough to get us started. Variations of the exact scan include checking for all values below a threshold, above, in between, or even just… unknown.
58
59What's the point of scanning for unknown values if *everything* in memory is unknown? Sometimes you don't have a concrete value. Maybe your health pool is a bar and it nevers tell you how much health you actually have, just a visual indicator of your percentage left, even if the health is not stored as a percentage. As we will find later on, scanning for unknown values is more useful than it might appear at first.
60
61We can access the memory of our own program by guessing random pointers and trying to read from them. But Windows isolates the memory of each program, so no pointer we could ever guess will let us read from the memory of another process. Luckily for us, searching for "read process memory winapi" leads us to the [`ReadProcessMemory`][readmem] function. Spot on.
62
63```rust
64pub fn read_memory(&self, addr: usize, n: usize) -> io::Result<Vec<u8>> {
65 todo!()
66}
67```
68
69Much like trying to dereference a pointer pointing to released memory or even null, reading from an arbitrary address can fail for the same reasons (and more). We will want to signal this with `io::Result`. It's funny to note that, even though we're doing something that seems wildly unsafe (reading arbitrary memory, even if the other process is mutating it at the same time), the function is perfectly safe. If we cannot read something, it will return `Err`, but if it succeeds, it has taken a snapshot of the memory of the process, and the returned value will be correctly initialized.
70
71The function will be defined inside our `impl Process`, since it conveniently holds an open handle to the process in question. It takes `&self`, because we do not need to mutate anything in the `Process` instance. After adding the `memoryapi` feature to `Cargo.toml`, we can perform the call:
72
73```rust
74let mut buffer = Vec::<u8>::with_capacity(n);
75let mut read = 0;
76
77// SAFETY: the buffer points to valid memory, and the buffer size is correctly set.
78if unsafe {
79 winapi::um::memoryapi::ReadProcessMemory(
80 self.handle.as_ptr(),
81 addr as *const _,
82 buffer.as_mut_ptr().cast(),
83 buffer.capacity(),
84 &mut read,
85 )
86} == FALSE
87{
88 Err(io::Error::last_os_error())
89} else {
90 // SAFETY: the call succeeded and `read` contains the amount of bytes written.
91 unsafe { buffer.set_len(read as usize) };
92 Ok(buffer)
93}
94```
95
96Great! But the address space is somewhat large. 64 bits large. Eighteen quintillion, four hundred forty-six quadrillion, seven hundred forty-four trillion, seventy-three billion, seven hundred nine million, five hundred fifty-one thousand, six hundred sixteen[^1] large. You gave up reading that, didn't you? Anyway, 18'446'744'073'709'551'616 is a *big* number.
97
98I am not willing to wait for the program to scan over so many values. I don't even have 16 [exbibytes] of RAM installed on my laptop yet[^2]! What's up with that?
99
100## Memory regions
101
102The program does not actually have all that memory allocated (surprise!). Random-guessing an address is extremely likely to point out to invalid memory. Reading from the start of the address space all the way to the end would not be any better. And we **need** to do better.
103
104We need to query for the memory regions allocated to the program. For this purpose we can use [`VirtualQueryEx`][vquery].
105
106> Retrieves information about a range of pages within the virtual address space of a specified process.
107
108We have enumerated things before, and this function is not all that different.
109
110```rust
111fn memory_regions(&self) -> io::Result<winapi::um::winnt::MEMORY_BASIC_INFORMATION> {
112 let mut info = MaybeUninit::uninit();
113
114 // SAFETY: the info structure points to valid memory.
115 let written = unsafe {
116 winapi::um::memoryapi::VirtualQueryEx(
117 self.handle.as_ptr(),
118 std::ptr::null(),
119 info.as_mut_ptr(),
120 mem::size_of::<winapi::um::winnt::MEMORY_BASIC_INFORMATION>(),
121 )
122 };
123 if written == 0 {
124 Err(io::Error::last_os_error())
125 } else {
126 // SAFETY: a non-zero amount was written to the structure
127 Ok(unsafe { info.assume_init() })
128 }
129}
130```
131
132We start with a base address of zero[^3] (`std::ptr::null()`), and ask the function to tell us what's in there. Let's try it out, with the `impl-debug` crate feature in `Cargo.toml`:
133
134```rust
135dbg!(process.memory_regions());
136```
137
138```
139>cargo run
140Compiling memo v0.1.0
141
142error[E0277]: `winapi::um::winnt::MEMORY_BASIC_INFORMATION` doesn't implement `std::fmt::Debug`
143 --> src\main.rs:185:5
144 |
145185 | dbg!(process.memory_regions());
146 | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ `winapi::um::winnt::MEMORY_BASIC_INFORMATION` cannot be formatted using `{:?}` because it doesn't implement `std::fmt::Debug`
147```
148
149That's annoying. It seems not everything has an `impl std::fmt::Debug`, and [you're supposed to send a PR][prdebug] if you want it to have debug, even if the `impl-debug` feature is set. I'm surprised they don't auto-generate all of this and have to rely on manually adding `Debug` as needed? Oh well, let's get rid of the feature and print it out ourselves:
150
151```
152eprintln!(
153 "Region:
154 BaseAddress: {:?}
155 AllocationBase: {:?}
156 AllocationProtect: {:?}
157 RegionSize: {:?}
158 State: {:?}
159 Protect: {:?}
160 Type: {:?}",
161 region.BaseAddress,
162 region.AllocationBase,
163 region.AllocationProtect,
164 region.RegionSize,
165 region.State,
166 region.Protect,
167 region.Type,
168);
169```
170
171Hopefully we don't need to do this often:
172
173```
174>cargo run
175 Compiling memo v0.1.0
176 Finished dev [unoptimized + debuginfo] target(s) in 0.60s
177 Running `target\debug\memo.exe`
178
179Region:
180 BaseAddress: 0x0
181 AllocationBase: 0x0
182 AllocationProtect: 0
183 RegionSize: 65536
184 State: 65536
185 Protect: 1
186 Type: 0
187```
188
189Awesome! There is a region at `null`, and the `AllocationProtect` of zero indicates that "the caller does not have access" when the region was created. However, `Protect` is `1`, and that is the *current* protection level. A value of one indicates [`PAGE_NOACCESS`][memprot]:
190
191> Disables all access to the committed region of pages. An attempt to read from, write to, or execute the committed region results in an access violation.
192
193Now that we know that the first region starts at 0 and has a size of 64 KiB, we can simply query for the page at `(current base + current size)` to fetch the next region. Essentially, we want to loop until it fails, after which we'll know there are no more pages[^4]:
194
195```rust
196pub fn memory_regions(&self) -> Vec<winapi::um::winnt::MEMORY_BASIC_INFORMATION> {
197 let mut base = 0;
198 let mut regions = Vec::new();
199 let mut info = MaybeUninit::uninit();
200
201 loop {
202 // SAFETY: the info structure points to valid memory.
203 let written = unsafe {
204 winapi::um::memoryapi::VirtualQueryEx(
205 self.handle.as_ptr(),
206 base as *const _,
207 info.as_mut_ptr(),
208 mem::size_of::<winapi::um::winnt::MEMORY_BASIC_INFORMATION>(),
209 )
210 };
211 if written == 0 {
212 break regions;
213 }
214 // SAFETY: a non-zero amount was written to the structure
215 let info = unsafe { info.assume_init() };
216 base = info.BaseAddress as usize + info.RegionSize;
217 regions.push(info);
218 }
219}
220```
221
222`RegionSize` is:
223
224> The size of the region beginning at the base address in which all pages have identical attributes, in bytes.
225
226…which also hints that the value we want is "base address", not the "allocation base". With these two values, we can essentially iterate over all the page ranges:
227
228```rust
229dbg!(process.memory_regions().len());
230```
231
232```
233>cargo run
234 Compiling memo v0.1.0
235 Finished dev [unoptimized + debuginfo] target(s) in 0.63s
236 Running `target\debug\memo.exe`
237
238[src\main.rs:189] process.memory_regions().len() = 367
239```
240
241That's a lot of pages!
242
243## Protection levels
244
245Let's try to narrow the amount of pages down. How many pages aren't `PAGE_NOACCESS`?
246
247```rust
248dbg!(process
249 .memory_regions()
250 .into_iter()
251 .filter(|p| p.Protect != winapi::um::winnt::PAGE_NOACCESS)
252 .count());
253```
254
255```
256295
257```
258
259Still a fair bit! Most likely, there are just a few interleaved `NOACCESS` pages, and the rest are allocated each with different protection levels. How much memory do we need to scan through?
260
261```rust
262dbg!(process
263 .memory_regions()
264 .into_iter()
265 .filter(|p| p.Protect != winapi::um::winnt::PAGE_NOACCESS)
266 .map(|p| p.RegionSize)
267 .sum::<usize>());
268```
269
270```
2714480434176
272```
273
274Wait, what? What do you mean over 4 GiB? The Task Manager claims that the Cheat Engine Tutorial is only using 2.1 MB worth of RAM! Perhaps we can narrow down the [protection levels][memprot] a bit more. If you look at the scan options in Cheat Engine, you will notice the "Memory Scan Options" groupbox. By default, it only scans for memory that is writable, and doesn't care if it's executable or not:
275
276
277```rust
278let mask = winnt::PAGE_EXECUTE_READWRITE
279 | winnt::PAGE_EXECUTE_WRITECOPY
280 | winnt::PAGE_READWRITE
281 | winnt::PAGE_WRITECOPY;
282
283dbg!(process
284 .memory_regions()
285 .into_iter()
286 .filter(|p| (p.Protect & mask) != 0)
287 .map(|p| p.RegionSize)
288 .sum::<usize>());
289```
290
291Each memory protection level has its own bit, so we can OR them all together to have a single mask. When ANDing this mask with the protection level, if any bit is set, it will be non-zero, meaning we want to keep this region.
292
293Don't ask me why there isn't a specific bit for "write", "read", "execute", and there are only bits for combinations. I guess this way Windows forbids certain combinations.
294
295```
2962580480
297```
298
299Hey, that's close to the value shown by the Task Manager! A handfull of megabytes is a lot more manageable than 4 entire gigabytes.
300
301## Actually running our First Scan
302
303Okay, we have all the memory regions from which the program can read, write, and execute. Now we also can read the memory in these regions:
304
305```rust
306let regions = process
307 .memory_regions()
308 .into_iter()
309 .filter(|p| (p.Protect & mask) != 0)
310 .collect::<Vec<_>>();
311
312println!("Scanning {} memory regions", regions.len());
313
314regions.into_iter().for_each(|region| {
315 match process.read_memory(region.BaseAddress as _, region.RegionSize) {
316 Ok(memory) => todo!(),
317 Err(err) => eprintln!(
318 "Failed to read {} bytes at {:?}: {}",
319 region.RegionSize, region.BaseAddress, err,
320 ),
321 }
322})
323```
324
325All that's left is for us to scan for a target value. To do this, we want to iterate over all the [`slice::windows`][slicewin] of size equal to the size of our scan type.
326
327```rust
328let target: i32 = ...;
329let target = target.to_ne_bytes();
330
331...
332
333memory
334 .windows(target.len())
335 .enumerate()
336 .for_each(|(offset, window)| {
337 if window == target {
338 println!(
339 "Found exact value at [{:?}+{:x}]",
340 region.BaseAddress, offset
341 );
342 }
343 })
344```
345
346We convert the 32-bit exact target value to its memory representation as a byte array in [native byte order][tone]. This way we can compare the target bytes with the window bytes. Another option is to interpret the window bytes as an `i32` with `from_be_bytes`, but `slice::windows` gives us slices of type `&[u8]`, and `from_be_bytes` wants an `[u8; 4]` array, so it's a bit more annoying to convert.
347
348This is enough to find the value in the process' memory!
349
350```
351Found exact value at [0x10000+aec]
352Failed to read 12288 bytes at 0x13f8000: Only part of a ReadProcessMemory or WriteProcessMemory request was completed. (os error 299)
353Found exact value at [0x14f0000+3188]
354Found exact value at [0x14f0000+ac74]
355...
356Found exact value at [0x10030e000+1816]
357Found exact value at [0x7ff8f7b93000+441a]
358...
359Found exact value at [0x7ff8fb381000+4023]
360```
361
362The tutorial starts out with health "100", which is what I scanned. Apparently, there are nearly a hundred of `100`-valued integers stored in the memory of the tutorial.
363
364Attentive readers will notice that some values are located at an offset modulo 4. In Cheat Engine, this is known as "Fast Scan", which is enabled by default with an alignment of 4. Most of the time, values are aligned in memory, and this alignment often corresponds with the size of the type itself. For 4-byte integers, it's common that they're 4-byte aligned.
365
366We can perform a fast scan ourselves with [`step_by`][stepby][^5]:
367
368```rust
369memory
370 .windows(target.len())
371 .enumerate()
372 .step_by(4)
373 .for_each(...)
374```
375
376As a bonus, over half the addresses are gone, so we have less results to worry about[^6].
377
378## Next Scan
379
380The first scan gave us way too many results. We have no way to tell which is the correct one, as they all have the same value. What we need to do is a *second* scan at the *locations we just found*. This way, we can get a second reading, and compare it against a new value. If it's the same, we're on good track, and if not, we can discard a location. Repeating this process lets us cut the hundreds of potential addresses to just a handful of them.
381
382For example, let's say we're scanning our current health of `100` in a game. This gives us over a hundred addresses that point to the value of `100`. If we go in-game and get hit[^7] by some enemy and get our health down to, say, `99` (we have a lot of defense), we can then read the memory at the hundred memory locations we found before. If this second reading is not `99`, we know the address does not actually point to our health pool and it just happened to also contain a `100` on the first scan. This address can be removed from the list of potential addresses pointing to our health.
383
384Let's do that:
385
386```rust
387let mut locations = Vec::with_capacity(regions.len());
388// -snip-
389locations.push(region.BaseAddress as usize + offset);
390// -snip-
391let target: i32 = ...;
392let target = target.to_ne_bytes();
393locations.retain(|addr| match process.read_memory(*addr, target.len()) {
394 Ok(memory) => memory == target,
395 Err(_) => false,
396});
397
398println!("Now have {} locations", locations.len());
399```
400
401We create a vector to store all the locations the first scan finds, and then retain those that match a second target value. You may have noticed that we perform a memory read, and thus a call to the Windows API, for every single address. With a hundred locations to read from, this is not a big deal, but oftentimes you will have tens of thousands of addresses. For the time being, we will not worry about this inefficiency, but we will get back to it once it matters:
402
403```
404Scanning 98 memory regions
405Which exact value to scan for?: 100
406Failed to read 12288 bytes at 0x13f8000: Only part of a ReadProcessMemory or WriteProcessMemory request was completed. (os error 299)
407...
408Found 49 locations
409Which exact value to scan for next?: 99
410Now have 1 locations
411```
412
413Sweet! In a real-world scenario, you will likely need to perform these additional scans a couple of times, and even then, there may be more than one value left no matter what.
414
415For good measure, we'll wrap our `retain` in a `while` loop[^8]:
416
417```rust
418while locations.len() != 1 {
419 let target: i32 = ...;
420 let target = target.to_ne_bytes();
421 locations.retain(...);
422}
423```
424
425## Modifying memory
426
427Now that we have very likely locations pointing to our current health in memory, all that's left is writing our new desired value to gain infinite health[^9]. Much like there's a call to `ReadProcessMemory`, there's a different one to [`WriteProcessMemory`][writemem]. Its usage is straightforward:
428
429```rust
430pub fn write_memory(&self, addr: usize, value: &[u8]) -> io::Result<usize> {
431 let mut written = 0;
432
433 // SAFETY: the input value buffer points to valid memory.
434 if unsafe {
435 winapi::um::memoryapi::WriteProcessMemory(
436 self.handle.as_ptr(),
437 addr as *mut _,
438 value.as_ptr().cast(),
439 value.len(),
440 &mut written,
441 )
442 } == FALSE
443 {
444 Err(io::Error::last_os_error())
445 } else {
446 Ok(written)
447 }
448}
449```
450
451Similar to how writing to a file can return short, writing to a memory location could also return short. Here we mimic the API for writing files and return the number of bytes written. The documentation indicates that we could actually ignore the amount written by passing `ptr::null_mut()` as the last parameter, but it does no harm to retrieve the written count as well.
452
453```rust
454let new_value: i32 = ...;
455locations
456 .into_iter()
457 .for_each(|addr| match process.write_memory(addr, &new_value) {
458 Ok(n) => eprintln!("Written {} bytes to [{:x}]", n, addr),
459 Err(e) => eprintln!("Failed to write to [{:x}]: {}", addr, e),
460 });
461```
462
463And just like that:
464
465```
466Now have 1 location(s)
467Enter new memory value: 1000
468Failed to write to [15d8b90]: Access is denied. (os error 5)
469```
470
471…oh noes. Oh yeah. The documentation, which I totally didn't forget to read, mentions:
472
473> The handle must have `PROCESS_VM_WRITE` and `PROCESS_VM_OPERATION` access to the process.
474
475We currently open our process with `PROCESS_QUERY_INFORMATION` and `PROCESS_VM_READ`, which is enough for reading, but not for writing. Let's adjust `OpenProcess` to accomodate for our new requirements:
476
477```rust
478winapi::um::processthreadsapi::OpenProcess(
479 winnt::PROCESS_QUERY_INFORMATION
480 | winnt::PROCESS_VM_READ
481 | winnt::PROCESS_VM_WRITE
482 | winnt::PROCESS_VM_OPERATION,
483 FALSE,
484 pid,
485)
486```
487
488Behold:
489
490```
491Now have 1 location(s)
492Enter new memory value: 1000
493Written 4 bytes to [15d8b90]
494```
495
496![Tutorial complete with memo][completion]
497
498Isn't that active *Next* button just beautiful?
499
500## Finale
501
502This post somehow ended up being longer than part one, but look at what we've achieved! We completed a step of the Cheat Engine Tutorial *without using Cheat Engine*. Just pure Rust. Figuring out how a program works and reimplementing it yourself is a great way to learn what it's doing behind the scenes. And now that this code is yours, you can extend it as much as you like, without being constrained by Cheat Engine's UI. You can automate it as much as you want.
503
504And we're not even done. The current tutorial has nine steps, and three additional graphical levels.
505
506In the next post, we'll tackle the third step of the tutorial: Unknown initial value. This will pose a challenge, because with just 2 MiB of memory, storing all the 4-byte aligned locations would require 524288 addresses (`usize`, 8 bytes). This adds up to twice as much memory as the original program (4 MiB), but that's not our main concern, having to perform over five hundred thousand API calls is!
507
508### Footnotes
509
510[^1]: I did in fact use an online tool to spell it out for me.
511
512[^2]: 16 GiB is good enough for my needs. I don't think I'll ever upgrade to 16 EiB.
513
514[^3]: Every address we query should have a corresponding region, even if it's not allocated or we do not have access. This is why we can query for the memory address zero to get its corresponding region.
515
516[^4]: Another option is to [`GetSystemInfo`][getsysinfo] to determine the `lpMinimumApplicationAddress` and `lpMaximumApplicationAddress` and only work within bounds.
517
518[^5]: Memory regions are page-aligned, which is a large power of two. Our alignment of 4 is much lower than this, so we're guaranteed to start off at an aligned address.
519
520[^6]: If it turns out that the value was actually misaligned, we will miss it. You will notice this if, after going through the whole process, there are no results. It could mean that either the value type is wrong, or the value type is misaligned. In the worst case, the value is not stored directly but is rather computed with something like `maximum - stored`, or XORed with some magic value, or a myriad other things.
521
522[^7]: You could do this without getting hit, and just keep on repeating the scan for the same value over and over again. This does work, but the results are suboptimal, because there are also many other values that didn't change. Scanning for a changed value is a better option.
523
524[^8]: You could actually just go ahead and try to modify the memory at the hundred addresses you just found, although don't be surprised if the program starts to misbehave!
525
526[^9]: Okay, we cannot fit infinity in an `i32`. However, we can fit sufficiently large numbers. Like `1000`, which is enough to complete the tutorial.
527
528[script-kid]: https://www.urbandictionary.com/define.php?term=script%20kiddie
529[readmem]: https://docs.microsoft.com/en-us/windows/win32/api/memoryapi/nf-memoryapi-readprocessmemory
530[exbibytes]: https://en.wikipedia.org/wiki/Orders_of_magnitude_(data)
531[vquery]: https://docs.microsoft.com/en-us/windows/win32/api/memoryapi/nf-memoryapi-virtualqueryex
532[prdebug]: https://github.com/retep998/winapi-rs/issues/548#issuecomment-355278090
533[memprot]: https://docs.microsoft.com/en-us/windows/win32/memory/memory-protection-constants
534[getsysinfo]: https://docs.microsoft.com/en-us/windows/win32/api/sysinfoapi/nf-sysinfoapi-getsysteminfo
535[slicewin]: https://doc.rust-lang.org/stable/std/primitive.slice.html#method.windows
536[tone]: https://doc.rust-lang.org/stable/std/primitive.i32.html#method.to_ne_bytes
537[stepby]: https://doc.rust-lang.org/stable/std/iter/trait.Iterator.html#method.step_by
538[writemem]: https://docs.microsoft.com/en-us/windows/win32/api/memoryapi/nf-memoryapi-writeprocessmemory
539[completion]: https://user-images.githubusercontent.com/6297805/107829541-3f4f2d00-6d8a-11eb-87c4-e2f2d505afbc.png